From da6c635ea2cc315b477ad4d89c31518e545fc7fd Mon Sep 17 00:00:00 2001 From: Ivan Gabaldon Date: Fri, 5 Dec 2025 11:59:59 +0100 Subject: [PATCH] [upd] themes: update vite --- client/simple/package-lock.json | 166 ++++++++---------- client/simple/package.json | 3 +- .../themes/simple/chunk/BVhnhCXf.min.js | 2 + ...xJxX49r.min.js.map => BVhnhCXf.min.js.map} | 2 +- .../themes/simple/chunk/CEKii0mQ.min.js | 15 -- .../themes/simple/chunk/CGazvOKw.min.js | 15 ++ ...EKii0mQ.min.js.map => CGazvOKw.min.js.map} | 2 +- .../themes/simple/chunk/DxJxX49r.min.js | 2 - searx/static/themes/simple/manifest.json | 6 +- searx/static/themes/simple/sxng-core.min.js | 4 +- 10 files changed, 97 insertions(+), 120 deletions(-) create mode 100644 searx/static/themes/simple/chunk/BVhnhCXf.min.js rename searx/static/themes/simple/chunk/{DxJxX49r.min.js.map => BVhnhCXf.min.js.map} (97%) delete mode 100644 searx/static/themes/simple/chunk/CEKii0mQ.min.js create mode 100644 searx/static/themes/simple/chunk/CGazvOKw.min.js rename searx/static/themes/simple/chunk/{CEKii0mQ.min.js.map => CGazvOKw.min.js.map} (99%) delete mode 100644 searx/static/themes/simple/chunk/DxJxX49r.min.js diff --git a/client/simple/package-lock.json b/client/simple/package-lock.json index 5de8eaa8a..656af5d7d 100644 --- a/client/simple/package-lock.json +++ b/client/simple/package-lock.json @@ -21,7 +21,6 @@ "browserslist-to-esbuild": "~2.1.1", "edge.js": "~6.3.0", "less": "~4.4.2", - "lightningcss": "~1.30.2", "mathjs": "~15.1.0", "sharp": "~0.34.5", "sort-package-json": "~3.5.0", @@ -30,7 +29,7 @@ "stylelint-prettier": "~5.0.3", "svgo": "~4.0.0", "typescript": "~5.9.3", - "vite": "npm:rolldown-vite@7.2.7", + "vite": "8.0.0-beta.0", "vite-bundle-analyzer": "~1.2.3" } }, @@ -989,9 +988,9 @@ } }, "node_modules/@oxc-project/runtime": { - "version": "0.98.0", - "resolved": "https://registry.npmjs.org/@oxc-project/runtime/-/runtime-0.98.0.tgz", - "integrity": "sha512-F0ldlBv2orG2YqNL0w77deq9yCaO4zEHbanGnW/jaJxGBR8ImekvZb8x42zAHvdzr8J76psibijvHtXfSjbEIQ==", + "version": "0.101.0", + "resolved": "https://registry.npmjs.org/@oxc-project/runtime/-/runtime-0.101.0.tgz", + "integrity": "sha512-t3qpfVZIqSiLQ5Kqt/MC4Ge/WCOGrrcagAdzTcDaggupjiGxUx4nJF2v6wUCXWSzWHn5Ns7XLv13fCJEwCOERQ==", "dev": true, "license": "MIT", "engines": { @@ -999,9 +998,9 @@ } }, "node_modules/@oxc-project/types": { - "version": "0.98.0", - "resolved": "https://registry.npmjs.org/@oxc-project/types/-/types-0.98.0.tgz", - "integrity": "sha512-Vzmd6FsqVuz5HQVcRC/hrx7Ujo3WEVeQP7C2UNP5uy1hUY4SQvMB+93jxkI1KRHz9a/6cni3glPOtvteN+zpsw==", + "version": "0.101.0", + "resolved": "https://registry.npmjs.org/@oxc-project/types/-/types-0.101.0.tgz", + "integrity": "sha512-nuFhqlUzJX+gVIPPfuE6xurd4lST3mdcWOhyK/rZO0B9XWMKm79SuszIQEnSMmmDhq1DC8WWVYGVd+6F93o1gQ==", "dev": true, "license": "MIT", "funding": { @@ -1084,9 +1083,9 @@ } }, "node_modules/@rolldown/binding-android-arm64": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-android-arm64/-/binding-android-arm64-1.0.0-beta.51.tgz", - "integrity": "sha512-Ctn8FUXKWWQI9pWC61P1yumS9WjQtelNS9riHwV7oCkknPGaAry4o7eFx2KgoLMnI2BgFJYpW7Im8/zX3BuONg==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-android-arm64/-/binding-android-arm64-1.0.0-beta.53.tgz", + "integrity": "sha512-Ok9V8o7o6YfSdTTYA/uHH30r3YtOxLD6G3wih/U9DO0ucBBFq8WPt/DslU53OgfteLRHITZny9N/qCUxMf9kjQ==", "cpu": [ "arm64" ], @@ -1101,9 +1100,9 @@ } }, "node_modules/@rolldown/binding-darwin-arm64": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-arm64/-/binding-darwin-arm64-1.0.0-beta.51.tgz", - "integrity": "sha512-EL1aRW2Oq15ShUEkBPsDtLMO8GTqfb/ktM/dFaVzXKQiEE96Ss6nexMgfgQrg8dGnNpndFyffVDb5IdSibsu1g==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-arm64/-/binding-darwin-arm64-1.0.0-beta.53.tgz", + "integrity": "sha512-yIsKqMz0CtRnVa6x3Pa+mzTihr4Ty+Z6HfPbZ7RVbk1Uxnco4+CUn7Qbm/5SBol1JD/7nvY8rphAgyAi7Lj6Vg==", "cpu": [ "arm64" ], @@ -1118,9 +1117,9 @@ } }, "node_modules/@rolldown/binding-darwin-x64": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-x64/-/binding-darwin-x64-1.0.0-beta.51.tgz", - "integrity": "sha512-uGtYKlFen9pMIPvkHPWZVDtmYhMQi5g5Ddsndg1gf3atScKYKYgs5aDP4DhHeTwGXQglhfBG7lEaOIZ4UAIWww==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-darwin-x64/-/binding-darwin-x64-1.0.0-beta.53.tgz", + "integrity": "sha512-GTXe+mxsCGUnJOFMhfGWmefP7Q9TpYUseHvhAhr21nCTgdS8jPsvirb0tJwM3lN0/u/cg7bpFNa16fQrjKrCjQ==", "cpu": [ "x64" ], @@ -1135,9 +1134,9 @@ } }, "node_modules/@rolldown/binding-freebsd-x64": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-freebsd-x64/-/binding-freebsd-x64-1.0.0-beta.51.tgz", - "integrity": "sha512-JRoVTQtHYbZj1P07JLiuTuXjiBtIa7ag7/qgKA6CIIXnAcdl4LrOf7nfDuHPJcuRKaP5dzecMgY99itvWfmUFQ==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-freebsd-x64/-/binding-freebsd-x64-1.0.0-beta.53.tgz", + "integrity": "sha512-9Tmp7bBvKqyDkMcL4e089pH3RsjD3SUungjmqWtyhNOxoQMh0fSmINTyYV8KXtE+JkxYMPWvnEt+/mfpVCkk8w==", "cpu": [ "x64" ], @@ -1152,9 +1151,9 @@ } }, "node_modules/@rolldown/binding-linux-arm-gnueabihf": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm-gnueabihf/-/binding-linux-arm-gnueabihf-1.0.0-beta.51.tgz", - "integrity": "sha512-BKATVnpPZ0TYBW9XfDwyd4kPGgvf964HiotIwUgpMrFOFYWqpZ+9ONNzMV4UFAYC7Hb5C2qgYQk/qj2OnAd4RQ==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm-gnueabihf/-/binding-linux-arm-gnueabihf-1.0.0-beta.53.tgz", + "integrity": "sha512-a1y5fiB0iovuzdbjUxa7+Zcvgv+mTmlGGC4XydVIsyl48eoxgaYkA3l9079hyTyhECsPq+mbr0gVQsFU11OJAQ==", "cpu": [ "arm" ], @@ -1169,9 +1168,9 @@ } }, "node_modules/@rolldown/binding-linux-arm64-gnu": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-gnu/-/binding-linux-arm64-gnu-1.0.0-beta.51.tgz", - "integrity": "sha512-xLd7da5jkfbVsBCm1buIRdWtuXY8+hU3+6ESXY/Tk5X5DPHaifrUblhYDgmA34dQt6WyNC2kfXGgrduPEvDI6Q==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-gnu/-/binding-linux-arm64-gnu-1.0.0-beta.53.tgz", + "integrity": "sha512-bpIGX+ov9PhJYV+wHNXl9rzq4F0QvILiURn0y0oepbQx+7stmQsKA0DhPGwmhfvF856wq+gbM8L92SAa/CBcLg==", "cpu": [ "arm64" ], @@ -1186,9 +1185,9 @@ } }, "node_modules/@rolldown/binding-linux-arm64-musl": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-musl/-/binding-linux-arm64-musl-1.0.0-beta.51.tgz", - "integrity": "sha512-EQFXTgHxxTzv3t5EmjUP/DfxzFYx9sMndfLsYaAY4DWF6KsK1fXGYsiupif6qPTViPC9eVmRm78q0pZU/kuIPg==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-arm64-musl/-/binding-linux-arm64-musl-1.0.0-beta.53.tgz", + "integrity": "sha512-bGe5EBB8FVjHBR1mOLOPEFg1Lp3//7geqWkU5NIhxe+yH0W8FVrQ6WRYOap4SUTKdklD/dC4qPLREkMMQ855FA==", "cpu": [ "arm64" ], @@ -1203,9 +1202,9 @@ } }, "node_modules/@rolldown/binding-linux-x64-gnu": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-gnu/-/binding-linux-x64-gnu-1.0.0-beta.51.tgz", - "integrity": "sha512-p5P6Xpa68w3yFaAdSzIZJbj+AfuDnMDqNSeglBXM7UlJT14Q4zwK+rV+8Mhp9MiUb4XFISZtbI/seBprhkQbiQ==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-gnu/-/binding-linux-x64-gnu-1.0.0-beta.53.tgz", + "integrity": "sha512-qL+63WKVQs1CMvFedlPt0U9PiEKJOAL/bsHMKUDS6Vp2Q+YAv/QLPu8rcvkfIMvQ0FPU2WL0aX4eWwF6e/GAnA==", "cpu": [ "x64" ], @@ -1220,9 +1219,9 @@ } }, "node_modules/@rolldown/binding-linux-x64-musl": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-musl/-/binding-linux-x64-musl-1.0.0-beta.51.tgz", - "integrity": "sha512-sNVVyLa8HB8wkFipdfz1s6i0YWinwpbMWk5hO5S+XAYH2UH67YzUT13gs6wZTKg2x/3gtgXzYnHyF5wMIqoDAw==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-linux-x64-musl/-/binding-linux-x64-musl-1.0.0-beta.53.tgz", + "integrity": "sha512-VGl9JIGjoJh3H8Mb+7xnVqODajBmrdOOb9lxWXdcmxyI+zjB2sux69br0hZJDTyLJfvBoYm439zPACYbCjGRmw==", "cpu": [ "x64" ], @@ -1237,9 +1236,9 @@ } }, "node_modules/@rolldown/binding-openharmony-arm64": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-openharmony-arm64/-/binding-openharmony-arm64-1.0.0-beta.51.tgz", - "integrity": "sha512-e/JMTz9Q8+T3g/deEi8DK44sFWZWGKr9AOCW5e8C8SCVWzAXqYXAG7FXBWBNzWEZK0Rcwo9TQHTQ9Q0gXgdCaA==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-openharmony-arm64/-/binding-openharmony-arm64-1.0.0-beta.53.tgz", + "integrity": "sha512-B4iIserJXuSnNzA5xBLFUIjTfhNy7d9sq4FUMQY3GhQWGVhS2RWWzzDnkSU6MUt7/aHUrep0CdQfXUJI9D3W7A==", "cpu": [ "arm64" ], @@ -1254,9 +1253,9 @@ } }, "node_modules/@rolldown/binding-wasm32-wasi": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-wasm32-wasi/-/binding-wasm32-wasi-1.0.0-beta.51.tgz", - "integrity": "sha512-We3LWqSu6J9s5Y0MK+N7fUiiu37aBGPG3Pc347EoaROuAwkCS2u9xJ5dpIyLW4B49CIbS3KaPmn4kTgPb3EyPw==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-wasm32-wasi/-/binding-wasm32-wasi-1.0.0-beta.53.tgz", + "integrity": "sha512-BUjAEgpABEJXilGq/BPh7jeU3WAJ5o15c1ZEgHaDWSz3LB881LQZnbNJHmUiM4d1JQWMYYyR1Y490IBHi2FPJg==", "cpu": [ "wasm32" ], @@ -1264,16 +1263,16 @@ "license": "MIT", "optional": true, "dependencies": { - "@napi-rs/wasm-runtime": "^1.0.7" + "@napi-rs/wasm-runtime": "^1.1.0" }, "engines": { "node": ">=14.0.0" } }, "node_modules/@rolldown/binding-win32-arm64-msvc": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-arm64-msvc/-/binding-win32-arm64-msvc-1.0.0-beta.51.tgz", - "integrity": "sha512-fj56buHRuMM+r/cb6ZYfNjNvO/0xeFybI6cTkTROJatdP4fvmQ1NS8D/Lm10FCSDEOkqIz8hK3TGpbAThbPHsA==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-arm64-msvc/-/binding-win32-arm64-msvc-1.0.0-beta.53.tgz", + "integrity": "sha512-s27uU7tpCWSjHBnxyVXHt3rMrQdJq5MHNv3BzsewCIroIw3DJFjMH1dzCPPMUFxnh1r52Nf9IJ/eWp6LDoyGcw==", "cpu": [ "arm64" ], @@ -1287,27 +1286,10 @@ "node": "^20.19.0 || >=22.12.0" } }, - "node_modules/@rolldown/binding-win32-ia32-msvc": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-ia32-msvc/-/binding-win32-ia32-msvc-1.0.0-beta.51.tgz", - "integrity": "sha512-fkqEqaeEx8AySXiDm54b/RdINb3C0VovzJA3osMhZsbn6FoD73H0AOIiaVAtGr6x63hefruVKTX8irAm4Jkt2w==", - "cpu": [ - "ia32" - ], - "dev": true, - "license": "MIT", - "optional": true, - "os": [ - "win32" - ], - "engines": { - "node": "^20.19.0 || >=22.12.0" - } - }, "node_modules/@rolldown/binding-win32-x64-msvc": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-x64-msvc/-/binding-win32-x64-msvc-1.0.0-beta.51.tgz", - "integrity": "sha512-CWuLG/HMtrVcjKGa0C4GnuxONrku89g0+CsH8nT0SNhOtREXuzwgjIXNJImpE/A/DMf9JF+1Xkrq/YRr+F/rCg==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/binding-win32-x64-msvc/-/binding-win32-x64-msvc-1.0.0-beta.53.tgz", + "integrity": "sha512-cjWL/USPJ1g0en2htb4ssMjIycc36RvdQAx1WlXnS6DpULswiUTVXPDesTifSKYSyvx24E0YqQkEm0K/M2Z/AA==", "cpu": [ "x64" ], @@ -1322,9 +1304,9 @@ } }, "node_modules/@rolldown/pluginutils": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/@rolldown/pluginutils/-/pluginutils-1.0.0-beta.51.tgz", - "integrity": "sha512-51/8cNXMrqWqX3o8DZidhwz1uYq0BhHDDSfVygAND1Skx5s1TDw3APSSxCMcFFedwgqGcx34gRouwY+m404BBQ==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/@rolldown/pluginutils/-/pluginutils-1.0.0-beta.53.tgz", + "integrity": "sha512-vENRlFU4YbrwVqNDZ7fLvy+JR1CRkyr01jhSiDpE1u6py3OMzQfztQU2jxykW3ALNxO4kSlqIDeYyD0Y9RcQeQ==", "dev": true, "license": "MIT" }, @@ -3710,14 +3692,14 @@ } }, "node_modules/rolldown": { - "version": "1.0.0-beta.51", - "resolved": "https://registry.npmjs.org/rolldown/-/rolldown-1.0.0-beta.51.tgz", - "integrity": "sha512-ZRLgPlS91l4JztLYEZnmMcd3Umcla1hkXJgiEiR4HloRJBBoeaX8qogTu5Jfu36rRMVLndzqYv0h+M5gJAkUfg==", + "version": "1.0.0-beta.53", + "resolved": "https://registry.npmjs.org/rolldown/-/rolldown-1.0.0-beta.53.tgz", + "integrity": "sha512-Qd9c2p0XKZdgT5AYd+KgAMggJ8ZmCs3JnS9PTMWkyUfteKlfmKtxJbWTHkVakxwXs1Ub7jrRYVeFeF7N0sQxyw==", "dev": true, "license": "MIT", "dependencies": { - "@oxc-project/types": "=0.98.0", - "@rolldown/pluginutils": "1.0.0-beta.51" + "@oxc-project/types": "=0.101.0", + "@rolldown/pluginutils": "1.0.0-beta.53" }, "bin": { "rolldown": "bin/cli.mjs" @@ -3726,20 +3708,19 @@ "node": "^20.19.0 || >=22.12.0" }, "optionalDependencies": { - "@rolldown/binding-android-arm64": "1.0.0-beta.51", - "@rolldown/binding-darwin-arm64": "1.0.0-beta.51", - "@rolldown/binding-darwin-x64": "1.0.0-beta.51", - "@rolldown/binding-freebsd-x64": "1.0.0-beta.51", - "@rolldown/binding-linux-arm-gnueabihf": "1.0.0-beta.51", - "@rolldown/binding-linux-arm64-gnu": "1.0.0-beta.51", - "@rolldown/binding-linux-arm64-musl": "1.0.0-beta.51", - "@rolldown/binding-linux-x64-gnu": "1.0.0-beta.51", - "@rolldown/binding-linux-x64-musl": "1.0.0-beta.51", - "@rolldown/binding-openharmony-arm64": "1.0.0-beta.51", - "@rolldown/binding-wasm32-wasi": "1.0.0-beta.51", - "@rolldown/binding-win32-arm64-msvc": "1.0.0-beta.51", - "@rolldown/binding-win32-ia32-msvc": "1.0.0-beta.51", - "@rolldown/binding-win32-x64-msvc": "1.0.0-beta.51" + "@rolldown/binding-android-arm64": "1.0.0-beta.53", + "@rolldown/binding-darwin-arm64": "1.0.0-beta.53", + "@rolldown/binding-darwin-x64": "1.0.0-beta.53", + "@rolldown/binding-freebsd-x64": "1.0.0-beta.53", + "@rolldown/binding-linux-arm-gnueabihf": "1.0.0-beta.53", + "@rolldown/binding-linux-arm64-gnu": "1.0.0-beta.53", + "@rolldown/binding-linux-arm64-musl": "1.0.0-beta.53", + "@rolldown/binding-linux-x64-gnu": "1.0.0-beta.53", + "@rolldown/binding-linux-x64-musl": "1.0.0-beta.53", + "@rolldown/binding-openharmony-arm64": "1.0.0-beta.53", + "@rolldown/binding-wasm32-wasi": "1.0.0-beta.53", + "@rolldown/binding-win32-arm64-msvc": "1.0.0-beta.53", + "@rolldown/binding-win32-x64-msvc": "1.0.0-beta.53" } }, "node_modules/run-parallel": { @@ -4458,19 +4439,18 @@ "license": "MIT" }, "node_modules/vite": { - "name": "rolldown-vite", - "version": "7.2.7", - "resolved": "https://registry.npmjs.org/rolldown-vite/-/rolldown-vite-7.2.7.tgz", - "integrity": "sha512-N6a9KgNZ0xgCJ6/Ej2FQ7W8D3fOzDwFw7CLWZ2ubZknVrs9NdNkx25AFEuNbSwQO76VEHp4N7YatsZwp/ST1Gg==", + "version": "8.0.0-beta.0", + "resolved": "https://registry.npmjs.org/vite/-/vite-8.0.0-beta.0.tgz", + "integrity": "sha512-bXHWmtg5hUxn/MB5zJ8qhBLphnsNmO1EYOFmBO/fVCBJekTdWDuqJ/GmUMLgrC0QUCCrxhw3JLgteWdiyqaVSQ==", "dev": true, "license": "MIT", "dependencies": { - "@oxc-project/runtime": "0.98.0", + "@oxc-project/runtime": "0.101.0", "fdir": "^6.5.0", "lightningcss": "^1.30.2", "picomatch": "^4.0.3", "postcss": "^8.5.6", - "rolldown": "1.0.0-beta.51", + "rolldown": "1.0.0-beta.53", "tinyglobby": "^0.2.15" }, "bin": { diff --git a/client/simple/package.json b/client/simple/package.json index 3f84befd2..7ee1410a5 100644 --- a/client/simple/package.json +++ b/client/simple/package.json @@ -35,7 +35,6 @@ "browserslist-to-esbuild": "~2.1.1", "edge.js": "~6.3.0", "less": "~4.4.2", - "lightningcss": "~1.30.2", "mathjs": "~15.1.0", "sharp": "~0.34.5", "sort-package-json": "~3.5.0", @@ -44,7 +43,7 @@ "stylelint-prettier": "~5.0.3", "svgo": "~4.0.0", "typescript": "~5.9.3", - "vite": "npm:rolldown-vite@7.2.7", + "vite": "8.0.0-beta.0", "vite-bundle-analyzer": "~1.2.3" } } diff --git a/searx/static/themes/simple/chunk/BVhnhCXf.min.js b/searx/static/themes/simple/chunk/BVhnhCXf.min.js new file mode 100644 index 000000000..63c780e9f --- /dev/null +++ b/searx/static/themes/simple/chunk/BVhnhCXf.min.js @@ -0,0 +1,2 @@ +import{n as e}from"../sxng-core.min.js";import{t}from"./gZqIRpW1.min.js";var n=t(`search`),r=t(`q`),i=t(`clear_search`),a=window.matchMedia(`(max-width: 50em)`).matches,o=document.querySelector(`main`)?.id===`main_results`,s=Array.from(document.querySelectorAll(`#categories_container button.category`));r.value.length===0&&i.classList.add(`empty`),a||o||r.focus(),a&&e(`focus`,r,()=>{requestAnimationFrame(()=>{let e=r.value.length;r.setSelectionRange(e,e),r.scrollLeft=r.scrollWidth})}),e(`input`,r,()=>{i.classList.toggle(`empty`,r.value.length===0)}),e(`click`,i,()=>{i.classList.add(`empty`),r.focus()});for(let t of s)e(`click`,t,e=>{if(e.shiftKey){e.preventDefault(),t.classList.toggle(`selected`);return}for(let e of s)e.classList.toggle(`selected`,e===t)});if(document.querySelector(`div.search_filters`)){let t=document.getElementById(`safesearch`);t&&e(`change`,t,()=>n.submit());let r=document.getElementById(`time_range`);r&&e(`change`,r,()=>n.submit());let i=document.getElementById(`language`);i&&e(`change`,i,()=>n.submit())}e(`submit`,n,e=>{if(e.preventDefault(),s.length>0){let e=t(`selected-categories`);e.value=s.filter(e=>e.classList.contains(`selected`)).map(e=>e.name.replace(`category_`,``)).join(`,`)}n.submit()}); +//# sourceMappingURL=BVhnhCXf.min.js.map \ No newline at end of file diff --git a/searx/static/themes/simple/chunk/DxJxX49r.min.js.map b/searx/static/themes/simple/chunk/BVhnhCXf.min.js.map similarity index 97% rename from searx/static/themes/simple/chunk/DxJxX49r.min.js.map rename to searx/static/themes/simple/chunk/BVhnhCXf.min.js.map index 77dd7356b..1e1efcc39 100644 --- a/searx/static/themes/simple/chunk/DxJxX49r.min.js.map +++ b/searx/static/themes/simple/chunk/BVhnhCXf.min.js.map @@ -1 +1 @@ -{"version":3,"file":"DxJxX49r.min.js","names":["searchForm: HTMLFormElement","searchInput: HTMLInputElement","searchReset: HTMLButtonElement","isMobile: boolean","isResultsPage: boolean","categoryButtons: HTMLButtonElement[]"],"sources":["../../../../../client/simple/src/js/main/search.ts"],"sourcesContent":["// SPDX-License-Identifier: AGPL-3.0-or-later\n\nimport { listen } from \"../toolkit.ts\";\nimport { getElement } from \"../util/getElement.ts\";\n\nconst searchForm: HTMLFormElement = getElement(\"search\");\nconst searchInput: HTMLInputElement = getElement(\"q\");\nconst searchReset: HTMLButtonElement = getElement(\"clear_search\");\n\nconst isMobile: boolean = window.matchMedia(\"(max-width: 50em)\").matches;\nconst isResultsPage: boolean = document.querySelector(\"main\")?.id === \"main_results\";\n\nconst categoryButtons: HTMLButtonElement[] = Array.from(\n document.querySelectorAll(\"#categories_container button.category\")\n);\n\nif (searchInput.value.length === 0) {\n searchReset.classList.add(\"empty\");\n}\n\n// focus search input on large screens\nif (!(isMobile || isResultsPage)) {\n searchInput.focus();\n}\n\n// On mobile, move cursor to the end of the input on focus\nif (isMobile) {\n listen(\"focus\", searchInput, () => {\n // Defer cursor move until the next frame to prevent a visual jump\n requestAnimationFrame(() => {\n const end = searchInput.value.length;\n searchInput.setSelectionRange(end, end);\n searchInput.scrollLeft = searchInput.scrollWidth;\n });\n });\n}\n\nlisten(\"input\", searchInput, () => {\n searchReset.classList.toggle(\"empty\", searchInput.value.length === 0);\n});\n\nlisten(\"click\", searchReset, () => {\n searchReset.classList.add(\"empty\");\n searchInput.focus();\n});\n\nfor (const button of categoryButtons) {\n listen(\"click\", button, (event: MouseEvent) => {\n if (event.shiftKey) {\n event.preventDefault();\n button.classList.toggle(\"selected\");\n return;\n }\n\n // deselect all other categories\n for (const categoryButton of categoryButtons) {\n categoryButton.classList.toggle(\"selected\", categoryButton === button);\n }\n });\n}\n\nif (document.querySelector(\"div.search_filters\")) {\n const safesearchElement = document.getElementById(\"safesearch\");\n if (safesearchElement) {\n listen(\"change\", safesearchElement, () => searchForm.submit());\n }\n\n const timeRangeElement = document.getElementById(\"time_range\");\n if (timeRangeElement) {\n listen(\"change\", timeRangeElement, () => searchForm.submit());\n }\n\n const languageElement = document.getElementById(\"language\");\n if (languageElement) {\n listen(\"change\", languageElement, () => searchForm.submit());\n }\n}\n\n// override searchForm submit event\nlisten(\"submit\", searchForm, (event: Event) => {\n event.preventDefault();\n\n if (categoryButtons.length > 0) {\n const searchCategories = getElement(\"selected-categories\");\n searchCategories.value = categoryButtons\n .filter((button) => button.classList.contains(\"selected\"))\n .map((button) => button.name.replace(\"category_\", \"\"))\n .join(\",\");\n }\n\n searchForm.submit();\n});\n"],"mappings":"mGAKA,IAAMA,EAA8B,EAA4B,SAAS,CACnEC,EAAgC,EAA6B,IAAI,CACjEC,EAAiC,EAA8B,eAAe,CAE9EC,EAAoB,OAAO,WAAW,oBAAoB,CAAC,QAC3DC,EAAyB,SAAS,cAAc,OAAO,EAAE,KAAO,eAEhEC,EAAuC,MAAM,KACjD,SAAS,iBAAoC,wCAAwC,CACtF,CAEG,EAAY,MAAM,SAAW,GAC/B,EAAY,UAAU,IAAI,QAAQ,CAI9B,GAAY,GAChB,EAAY,OAAO,CAIjB,GACF,EAAO,QAAS,MAAmB,CAEjC,0BAA4B,CAC1B,IAAM,EAAM,EAAY,MAAM,OAC9B,EAAY,kBAAkB,EAAK,EAAI,CACvC,EAAY,WAAa,EAAY,aACrC,EACF,CAGJ,EAAO,QAAS,MAAmB,CACjC,EAAY,UAAU,OAAO,QAAS,EAAY,MAAM,SAAW,EAAE,EACrE,CAEF,EAAO,QAAS,MAAmB,CACjC,EAAY,UAAU,IAAI,QAAQ,CAClC,EAAY,OAAO,EACnB,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,QAAS,EAAS,GAAsB,CAC7C,GAAI,EAAM,SAAU,CAClB,EAAM,gBAAgB,CACtB,EAAO,UAAU,OAAO,WAAW,CACnC,OAIF,IAAK,IAAM,KAAkB,EAC3B,EAAe,UAAU,OAAO,WAAY,IAAmB,EAAO,EAExE,CAGJ,GAAI,SAAS,cAAc,qBAAqB,CAAE,CAChD,IAAM,EAAoB,SAAS,eAAe,aAAa,CAC3D,GACF,EAAO,SAAU,MAAyB,EAAW,QAAQ,CAAC,CAGhE,IAAM,EAAmB,SAAS,eAAe,aAAa,CAC1D,GACF,EAAO,SAAU,MAAwB,EAAW,QAAQ,CAAC,CAG/D,IAAM,EAAkB,SAAS,eAAe,WAAW,CACvD,GACF,EAAO,SAAU,MAAuB,EAAW,QAAQ,CAAC,CAKhE,EAAO,SAAU,EAAa,GAAiB,CAG7C,GAFA,EAAM,gBAAgB,CAElB,EAAgB,OAAS,EAAG,CAC9B,IAAM,EAAmB,EAA6B,sBAAsB,CAC5E,EAAiB,MAAQ,EACtB,OAAQ,GAAW,EAAO,UAAU,SAAS,WAAW,CAAC,CACzD,IAAK,GAAW,EAAO,KAAK,QAAQ,YAAa,GAAG,CAAC,CACrD,KAAK,IAAI,CAGd,EAAW,QAAQ,EACnB"} \ No newline at end of file +{"version":3,"file":"BVhnhCXf.min.js","names":["searchForm: HTMLFormElement","searchInput: HTMLInputElement","searchReset: HTMLButtonElement","isMobile: boolean","isResultsPage: boolean","categoryButtons: HTMLButtonElement[]"],"sources":["../../../../../client/simple/src/js/main/search.ts"],"sourcesContent":["// SPDX-License-Identifier: AGPL-3.0-or-later\n\nimport { listen } from \"../toolkit.ts\";\nimport { getElement } from \"../util/getElement.ts\";\n\nconst searchForm: HTMLFormElement = getElement(\"search\");\nconst searchInput: HTMLInputElement = getElement(\"q\");\nconst searchReset: HTMLButtonElement = getElement(\"clear_search\");\n\nconst isMobile: boolean = window.matchMedia(\"(max-width: 50em)\").matches;\nconst isResultsPage: boolean = document.querySelector(\"main\")?.id === \"main_results\";\n\nconst categoryButtons: HTMLButtonElement[] = Array.from(\n document.querySelectorAll(\"#categories_container button.category\")\n);\n\nif (searchInput.value.length === 0) {\n searchReset.classList.add(\"empty\");\n}\n\n// focus search input on large screens\nif (!(isMobile || isResultsPage)) {\n searchInput.focus();\n}\n\n// On mobile, move cursor to the end of the input on focus\nif (isMobile) {\n listen(\"focus\", searchInput, () => {\n // Defer cursor move until the next frame to prevent a visual jump\n requestAnimationFrame(() => {\n const end = searchInput.value.length;\n searchInput.setSelectionRange(end, end);\n searchInput.scrollLeft = searchInput.scrollWidth;\n });\n });\n}\n\nlisten(\"input\", searchInput, () => {\n searchReset.classList.toggle(\"empty\", searchInput.value.length === 0);\n});\n\nlisten(\"click\", searchReset, () => {\n searchReset.classList.add(\"empty\");\n searchInput.focus();\n});\n\nfor (const button of categoryButtons) {\n listen(\"click\", button, (event: MouseEvent) => {\n if (event.shiftKey) {\n event.preventDefault();\n button.classList.toggle(\"selected\");\n return;\n }\n\n // deselect all other categories\n for (const categoryButton of categoryButtons) {\n categoryButton.classList.toggle(\"selected\", categoryButton === button);\n }\n });\n}\n\nif (document.querySelector(\"div.search_filters\")) {\n const safesearchElement = document.getElementById(\"safesearch\");\n if (safesearchElement) {\n listen(\"change\", safesearchElement, () => searchForm.submit());\n }\n\n const timeRangeElement = document.getElementById(\"time_range\");\n if (timeRangeElement) {\n listen(\"change\", timeRangeElement, () => searchForm.submit());\n }\n\n const languageElement = document.getElementById(\"language\");\n if (languageElement) {\n listen(\"change\", languageElement, () => searchForm.submit());\n }\n}\n\n// override searchForm submit event\nlisten(\"submit\", searchForm, (event: Event) => {\n event.preventDefault();\n\n if (categoryButtons.length > 0) {\n const searchCategories = getElement(\"selected-categories\");\n searchCategories.value = categoryButtons\n .filter((button) => button.classList.contains(\"selected\"))\n .map((button) => button.name.replace(\"category_\", \"\"))\n .join(\",\");\n }\n\n searchForm.submit();\n});\n"],"mappings":"yEAKA,IAAMA,EAA8B,EAA4B,SAAS,CACnEC,EAAgC,EAA6B,IAAI,CACjEC,EAAiC,EAA8B,eAAe,CAE9EC,EAAoB,OAAO,WAAW,oBAAoB,CAAC,QAC3DC,EAAyB,SAAS,cAAc,OAAO,EAAE,KAAO,eAEhEC,EAAuC,MAAM,KACjD,SAAS,iBAAoC,wCAAwC,CACtF,CAEG,EAAY,MAAM,SAAW,GAC/B,EAAY,UAAU,IAAI,QAAQ,CAI9B,GAAY,GAChB,EAAY,OAAO,CAIjB,GACF,EAAO,QAAS,MAAmB,CAEjC,0BAA4B,CAC1B,IAAM,EAAM,EAAY,MAAM,OAC9B,EAAY,kBAAkB,EAAK,EAAI,CACvC,EAAY,WAAa,EAAY,aACrC,EACF,CAGJ,EAAO,QAAS,MAAmB,CACjC,EAAY,UAAU,OAAO,QAAS,EAAY,MAAM,SAAW,EAAE,EACrE,CAEF,EAAO,QAAS,MAAmB,CACjC,EAAY,UAAU,IAAI,QAAQ,CAClC,EAAY,OAAO,EACnB,CAEF,IAAK,IAAM,KAAU,EACnB,EAAO,QAAS,EAAS,GAAsB,CAC7C,GAAI,EAAM,SAAU,CAClB,EAAM,gBAAgB,CACtB,EAAO,UAAU,OAAO,WAAW,CACnC,OAIF,IAAK,IAAM,KAAkB,EAC3B,EAAe,UAAU,OAAO,WAAY,IAAmB,EAAO,EAExE,CAGJ,GAAI,SAAS,cAAc,qBAAqB,CAAE,CAChD,IAAM,EAAoB,SAAS,eAAe,aAAa,CAC3D,GACF,EAAO,SAAU,MAAyB,EAAW,QAAQ,CAAC,CAGhE,IAAM,EAAmB,SAAS,eAAe,aAAa,CAC1D,GACF,EAAO,SAAU,MAAwB,EAAW,QAAQ,CAAC,CAG/D,IAAM,EAAkB,SAAS,eAAe,WAAW,CACvD,GACF,EAAO,SAAU,MAAuB,EAAW,QAAQ,CAAC,CAKhE,EAAO,SAAU,EAAa,GAAiB,CAG7C,GAFA,EAAM,gBAAgB,CAElB,EAAgB,OAAS,EAAG,CAC9B,IAAM,EAAmB,EAA6B,sBAAsB,CAC5E,EAAiB,MAAQ,EACtB,OAAQ,GAAW,EAAO,UAAU,SAAS,WAAW,CAAC,CACzD,IAAK,GAAW,EAAO,KAAK,QAAQ,YAAa,GAAG,CAAC,CACrD,KAAK,IAAI,CAGd,EAAW,QAAQ,EACnB"} \ No newline at end of file diff --git a/searx/static/themes/simple/chunk/CEKii0mQ.min.js b/searx/static/themes/simple/chunk/CEKii0mQ.min.js deleted file mode 100644 index 58b613a56..000000000 --- a/searx/static/themes/simple/chunk/CEKii0mQ.min.js +++ /dev/null @@ -1,15 +0,0 @@ -import{a as e}from"../sxng-core.min.js";import"./13gvpunf.min.js";import{t}from"./gZqIRpW1.min.js";var n=Object.create,r=Object.defineProperty,i=Object.getOwnPropertyDescriptor,a=Object.getOwnPropertyNames,o=Object.getPrototypeOf,s=Object.prototype.hasOwnProperty,c=(e,t)=>()=>(t||e((t={exports:{}}).exports,t),t.exports),l=(e,t,n,o)=>{if(t&&typeof t==`object`||typeof t==`function`)for(var c=a(t),l=0,u=c.length,d;lt[e]).bind(null,d),enumerable:!(o=i(t,d))||o.enumerable});return e},u=(e,t,i)=>(i=e==null?{}:n(o(e)),l(t||!e||!e.__esModule?r(i,`default`,{value:e,enumerable:!0}):i,e));function d(){return d=Object.assign?Object.assign.bind():function(e){for(var t=1;tthis.has(e)).values()}get(e){return p(this.wrappedObject,e)}set(e,t){return m(this.wrappedObject,e,t),this}has(e){return h(this.wrappedObject,e)&&e in this.wrappedObject}entries(){return ee(this.keys(),e=>[e,this.get(e)])}forEach(e){for(var t of this.keys())e(this.get(t),t,this)}delete(e){h(this.wrappedObject,e)&&delete this.wrappedObject[e]}clear(){for(var e of this.keys())this.delete(e)}get size(){return Object.keys(this.wrappedObject).length}},S=class{constructor(e,t,n){this.a=e,this.b=t,this.bKeys=n,this[Symbol.iterator]=this.entries}get(e){return this.bKeys.has(e)?this.b.get(e):this.a.get(e)}set(e,t){return this.bKeys.has(e)?this.b.set(e,t):this.a.set(e,t),this}has(e){return this.b.has(e)||this.a.has(e)}keys(){return new Set([...this.a.keys(),...this.b.keys()])[Symbol.iterator]()}entries(){return ee(this.keys(),e=>[e,this.get(e)])}forEach(e){for(var t of this.keys())e(this.get(t),t,this)}delete(e){return this.bKeys.has(e)?this.b.delete(e):this.a.delete(e)}clear(){this.a.clear(),this.b.clear()}get size(){return[...this.keys()].length}};function ee(e,t){return{next:()=>{var n=e.next();return n.done?n:{value:t(n.value),done:!1}}}}function te(){return new Map}function ne(e){if(!e)return te();if(F(e))return e;if(P(e))return new x(e);throw Error(`createMap can create maps from objects or Maps`)}function C(e){return typeof e==`number`}function w(e){return!e||typeof e!=`object`||typeof e.constructor!=`function`?!1:e.isBigNumber===!0&&typeof e.constructor.prototype==`object`&&e.constructor.prototype.isBigNumber===!0||typeof e.constructor.isDecimal==`function`&&e.constructor.isDecimal(e)===!0}function re(e){return typeof e==`bigint`}function T(e){return e&&typeof e==`object`&&Object.getPrototypeOf(e).isComplex===!0||!1}function E(e){return e&&typeof e==`object`&&Object.getPrototypeOf(e).isFraction===!0||!1}function D(e){return e&&e.constructor.prototype.isUnit===!0||!1}function O(e){return typeof e==`string`}var k=Array.isArray;function A(e){return e&&e.constructor.prototype.isMatrix===!0||!1}function j(e){return Array.isArray(e)||A(e)}function ie(e){return e&&e.isDenseMatrix&&e.constructor.prototype.isMatrix===!0||!1}function M(e){return e&&e.isSparseMatrix&&e.constructor.prototype.isMatrix===!0||!1}function ae(e){return e&&e.constructor.prototype.isRange===!0||!1}function oe(e){return e&&e.constructor.prototype.isIndex===!0||!1}function N(e){return typeof e==`boolean`}function se(e){return e&&e.constructor.prototype.isResultSet===!0||!1}function ce(e){return e&&e.constructor.prototype.isHelp===!0||!1}function le(e){return typeof e==`function`}function ue(e){return e instanceof Date}function de(e){return e instanceof RegExp}function P(e){return!!(e&&typeof e==`object`&&e.constructor===Object&&!T(e)&&!E(e))}function F(e){return e?e instanceof Map||e instanceof x||typeof e.set==`function`&&typeof e.get==`function`&&typeof e.keys==`function`&&typeof e.has==`function`:!1}function fe(e){return F(e)&&F(e.a)&&F(e.b)}function pe(e){return F(e)&&P(e.wrappedObject)}function I(e){return e===null}function me(e){return e===void 0}function L(e){return e&&e.isAccessorNode===!0&&e.constructor.prototype.isNode===!0||!1}function he(e){return e&&e.isArrayNode===!0&&e.constructor.prototype.isNode===!0||!1}function ge(e){return e&&e.isAssignmentNode===!0&&e.constructor.prototype.isNode===!0||!1}function _e(e){return e&&e.isBlockNode===!0&&e.constructor.prototype.isNode===!0||!1}function ve(e){return e&&e.isConditionalNode===!0&&e.constructor.prototype.isNode===!0||!1}function R(e){return e&&e.isConstantNode===!0&&e.constructor.prototype.isNode===!0||!1}function ye(e){return R(e)||Ce(e)&&e.args.length===1&&R(e.args[0])&&`-+~`.includes(e.op)}function be(e){return e&&e.isFunctionAssignmentNode===!0&&e.constructor.prototype.isNode===!0||!1}function xe(e){return e&&e.isFunctionNode===!0&&e.constructor.prototype.isNode===!0||!1}function z(e){return e&&e.isIndexNode===!0&&e.constructor.prototype.isNode===!0||!1}function B(e){return e&&e.isNode===!0&&e.constructor.prototype.isNode===!0||!1}function Se(e){return e&&e.isObjectNode===!0&&e.constructor.prototype.isNode===!0||!1}function Ce(e){return e&&e.isOperatorNode===!0&&e.constructor.prototype.isNode===!0||!1}function we(e){return e&&e.isParenthesisNode===!0&&e.constructor.prototype.isNode===!0||!1}function Te(e){return e&&e.isRangeNode===!0&&e.constructor.prototype.isNode===!0||!1}function Ee(e){return e&&e.isRelationalNode===!0&&e.constructor.prototype.isNode===!0||!1}function V(e){return e&&e.isSymbolNode===!0&&e.constructor.prototype.isNode===!0||!1}function De(e){return e&&e.constructor.prototype.isChain===!0||!1}function Oe(e){var t=typeof e;return t===`object`?e===null?`null`:w(e)?`BigNumber`:e.constructor&&e.constructor.name?e.constructor.name:`Object`:t}function ke(e){var t=typeof e;if(t===`number`||t===`bigint`||t===`string`||t===`boolean`||e==null)return e;if(typeof e.clone==`function`)return e.clone();if(Array.isArray(e))return e.map(function(e){return ke(e)});if(e instanceof Date)return new Date(e.valueOf());if(w(e))return e;if(P(e))return Ae(e,ke);if(t===`function`)return e;throw TypeError(`Cannot clone: unknown type of value (value: ${e})`)}function Ae(e,t){var n={};for(var r in e)H(e,r)&&(n[r]=t(e[r]));return n}function je(e,t){if(Array.isArray(t))throw TypeError(`Arrays are not supported by deepExtend`);for(var n in t)if(H(t,n)&&!(n in Object.prototype)&&!(n in Function.prototype))if(t[n]&&t[n].constructor===Object)e[n]===void 0&&(e[n]={}),e[n]&&e[n].constructor===Object?je(e[n],t[n]):e[n]=t[n];else if(Array.isArray(t[n]))throw TypeError(`Arrays are not supported by deepExtend`);else e[n]=t[n];return e}function Me(e,t){var n,r,i;if(Array.isArray(e)){if(!Array.isArray(t)||e.length!==t.length)return!1;for(r=0,i=e.length;r{Object.defineProperty(n,t,{get:()=>e[t],enumerable:!0,configurable:!0})}),n}function Be(e,t,n){e[t]!==void 0&&!n.includes(e[t])&&console.warn(`Warning: Unknown value "`+e[t]+`" for configuration option "`+t+`". Available options: `+n.map(e=>JSON.stringify(e)).join(`, `)+`.`)}function W(e){return typeof e==`boolean`?!0:Number.isFinite(e)?e===Math.round(e):!1}function Ve(e,t){if(t.number===`bigint`)try{BigInt(e)}catch{return t.numberFallback}return t.number}var He=Math.sign||function(e){return e>0?1:e<0?-1:0},Ue=Math.log2||function(e){return Math.log(e)/Math.LN2},We=Math.log10||function(e){return Math.log(e)/Math.LN10},Ge=Math.log1p||function(e){return Math.log(e+1)},Ke=Math.cbrt||function(e){if(e===0)return e;var t=e<0,n;return t&&(e=-e),Number.isFinite(e)?(n=Math.exp(Math.log(e)/3),n=(e/(n*n)+2*n)/3):n=e,t?-n:n},qe=Math.expm1||function(e){return e>=2e-4||e<=-2e-4?Math.exp(e)-1:e+e*e/2+e*e*e/6};function Je(e,t,n){var r={2:`0b`,8:`0o`,16:`0x`}[t],i=``;if(n){if(n<1)throw Error(`size must be in greater than 0`);if(!W(n))throw Error(`size must be an integer`);if(e>2**(n-1)-1||e<-(2**(n-1)))throw Error(`Value must be in range [-2^${n-1}, 2^${n-1}-1]`);if(!W(e))throw Error(`Value must be an integer`);e<0&&(e+=2**n),i=`i${n}`}var a=``;return e<0&&(e=-e,a=`-`),`${a}${r}${e.toString(t)}${i}`}function Ye(e,t){if(typeof t==`function`)return t(e);if(e===1/0)return`Infinity`;if(e===-1/0)return`-Infinity`;if(isNaN(e))return`NaN`;var{notation:n,precision:r,wordSize:i}=Xe(t);switch(n){case`fixed`:return $e(e,r);case`exponential`:return et(e,r);case`engineering`:return Qe(e,r);case`bin`:return Je(e,2,i);case`oct`:return Je(e,8,i);case`hex`:return Je(e,16,i);case`auto`:return tt(e,r,t).replace(/((\.\d*?)(0+))($|e)/,function(){var e=arguments[2],t=arguments[4];return e===`.`?t:e+t});default:throw Error(`Unknown notation "`+n+`". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.`)}}function Xe(e){var t=`auto`,n,r;if(e!==void 0)if(C(e))n=e;else if(w(e))n=e.toNumber();else if(P(e))e.precision!==void 0&&(n=at(e.precision,()=>{throw Error(`Option "precision" must be a number or BigNumber`)})),e.wordSize!==void 0&&(r=at(e.wordSize,()=>{throw Error(`Option "wordSize" must be a number or BigNumber`)})),e.notation&&(t=e.notation);else throw Error(`Unsupported type of options, number, BigNumber, or object expected`);return{notation:t,precision:n,wordSize:r}}function Ze(e){var t=String(e).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);if(!t)throw SyntaxError(`Invalid number `+e);var n=t[1],r=t[2],i=parseFloat(t[4]||`0`),a=r.indexOf(`.`);i+=a===-1?r.length-1:a-1;var o=r.replace(`.`,``).replace(/^0*/,function(e){return i-=e.length,``}).replace(/0*$/,``).split(``).map(function(e){return parseInt(e)});return o.length===0&&(o.push(0),i++),{sign:n,coefficients:o,exponent:i}}function Qe(e,t){if(isNaN(e)||!Number.isFinite(e))return String(e);var n=nt(Ze(e),t),r=n.exponent,i=n.coefficients,a=r%3==0?r:r<0?r-3-r%3:r-r%3;if(C(t))for(;t>i.length||r-a+1>i.length;)i.push(0);else for(var o=Math.abs(r-a)-(i.length-1),s=0;s0;)l++,c--;var u=i.slice(l).join(``),d=C(t)&&u.length||u.match(/[1-9]/)?`.`+u:``,f=i.slice(0,l).join(``)+d+`e`+(r>=0?`+`:``)+a.toString();return n.sign+f}function $e(e,t){if(isNaN(e)||!Number.isFinite(e))return String(e);var n=Ze(e),r=typeof t==`number`?nt(n,n.exponent+1+t):n,i=r.coefficients,a=r.exponent+1,o=a+(t||0);return i.length0?`.`+i.join(``):``)+`e`+(a>=0?`+`:``)+a}function tt(e,t,n){if(isNaN(e)||!Number.isFinite(e))return String(e);var r=ot(n?.lowerExp,-3),i=ot(n?.upperExp,5),a=Ze(e),o=t?nt(a,t):a;if(o.exponent=i)return et(e,t);var s=o.coefficients,c=o.exponent;s.length0?c:0;return lt&&r.splice(t,r.length-t)[0]>=5){var i=t-1;for(r[i]++;r[i]===10;)r.pop(),i===0&&(r.unshift(0),n.exponent++,i++),i--,r[i]++}return n}function rt(e){for(var t=[],n=0;n1&&arguments[1]!==void 0?arguments[1]:2,n=t<0;if(n&&(t=-t),t===0)throw Error(`Root must be non-zero`);if(e<0&&Math.abs(t)%2!=1)throw Error(`Root must be odd when a is negative.`);if(e===0)return n?1/0:0;if(!isFinite(e))return n?0:e;var r=Math.abs(e)**(1/t);return r=e<0?-r:r,n?1/r:r}function Dt(e){return He(e)}Dt.signature=G;function Ot(e){return Math.sqrt(e)}Ot.signature=G;function kt(e){return e*e}kt.signature=G;function At(e,t){var n,r,i,a=0,o=1,s=1,c=0;if(!W(e)||!W(t))throw Error(`Parameters in function xgcd must be integer numbers`);for(;t;)r=Math.floor(e/t),i=e-r*t,n=a,a=o-r*a,o=n,n=s,s=c-r*s,c=n,e=t,t=i;return e<0?[-e,-o,-c]:[e,e?o:0,c]}At.signature=st;function jt(e,t){return e*e<1&&t===1/0||e*e>1&&t===-1/0?0:e**+t}jt.signature=st;function Mt(e){var t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:0;if(!W(t)||t<0||t>15)throw Error(`Number of decimals in function round must be an integer from 0 to 15 inclusive`);return parseFloat($e(e,t))}function Nt(e){return Math.abs(e)}Nt.signature=G;function Pt(e,t){if(t>1;return Pt(e,n)*Pt(n+1,t)}function Ft(e,t){if(!W(e)||e<0||!W(t)||t<0)throw TypeError(`Positive integer value expected in function combinations`);if(t>e)throw TypeError(`k must be less than or equal to n`);for(var n=e-t,r=1,i=t171?1/0:Pt(1,e-1);if(e<.5)return Math.PI/(Math.sin(Math.PI*e)*Rt(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)*(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=Bt[0];for(var o=1;o=1;r--)n+=Ht[r]/(e+r);return Vt+(e+.5)*Math.log(t)-t+Math.log(n)}Ut.signature=`number`;function K(e,t,n,r){function i(r){var i=U(r,t.map(qt));return Gt(e,t,r),n(i)}return i.isFactory=!0,i.fn=e,i.dependencies=t.slice().sort(),r&&(i.meta=r),i}function Wt(e){return typeof e==`function`&&typeof e.fn==`string`&&Array.isArray(e.dependencies)}function Gt(e,t,n){if(!t.filter(e=>!Kt(e)).every(e=>n[e]!==void 0)){var r=t.filter(e=>n[e]===void 0);throw Error(`Cannot create function "${e}", some dependencies are missing: ${r.map(e=>`"${e}"`).join(`, `)}.`)}}function Kt(e){return e&&e[0]===`?`}function qt(e){return e&&e[0]===`?`?e.slice(1):e}function Jt(){throw Error(`No "bignumber" implementation available`)}function Yt(){throw Error(`No "fraction" implementation available`)}function Xt(){throw Error(`No "matrix" implementation available`)}function Zt(){throw Error(`No "matrix" implementation available`)}var Qt=c(((e,t)=>{(function(n,r){typeof e==`object`&&t!==void 0?t.exports=r():typeof define==`function`&&define.amd?define(r):(n=typeof globalThis<`u`?globalThis:n||self,n.typed=r())})(e,(function(){function e(){return!0}function t(){return!1}function n(){}let r=`Argument is not a typed-function.`;function i(){function a(e){return typeof e==`object`&&!!e&&e.constructor===Object}let o=[{name:`number`,test:function(e){return typeof e==`number`}},{name:`string`,test:function(e){return typeof e==`string`}},{name:`boolean`,test:function(e){return typeof e==`boolean`}},{name:`Function`,test:function(e){return typeof e==`function`}},{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:a},{name:`null`,test:function(e){return e===null}},{name:`undefined`,test:function(e){return e===void 0}}],s={name:`any`,test:e,isAny:!0},c,l,u=0,d={createCount:0};function f(e){let t=c.get(e);if(t)return t;let n=`Unknown type "`+e+`"`,r=e.toLowerCase(),i;for(i of l)if(i.toLowerCase()===r){n+=`. Did you mean "`+i+`" ?`;break}throw TypeError(n)}function p(e){let t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:`any`,n=t?f(t).index:l.length,r=[];for(let t=0;t{let n=c.get(t);return!n.isAny&&n.test(e)});return t.length?t:[`any`]}function _(e){return e&&typeof e==`function`&&`_typedFunctionData`in e}function v(e,t,n){if(!_(e))throw TypeError(r);let i=n&&n.exact,a=ne(Array.isArray(t)?t.join(`,`):t),o=x(a);if(!i||o in e.signatures){let t=e._typedFunctionData.signatureMap.get(o);if(t)return t}let s=a.length,c;if(i){c=[];let t;for(t in e.signatures)c.push(e._typedFunctionData.signatureMap.get(t))}else c=e._typedFunctionData.signatures;for(let e=0;e!e.has(t.name)))continue}n.push(r)}}if(c=n,c.length===0)break}let l;for(l of c)if(l.params.length<=s)return l;throw TypeError(`Signature not found (signature: `+(e.name||`unnamed`)+`(`+x(a,`, `)+`))`)}function y(e,t,n){return v(e,t,n).implementation}function b(e,t){let n=f(t);if(n.test(e))return e;let r=n.conversionsTo;if(r.length===0)throw Error(`There are no conversions to `+t+` defined.`);for(let t=0;t1&&arguments[1]!==void 0?arguments[1]:`,`;return e.map(e=>e.name).join(t)}function S(e){let t=e.indexOf(`...`)===0,n=(t?e.length>3?e.slice(3):`any`:e).split(`|`).map(e=>f(e.trim())),r=!1,i=t?`...`:``;return{types:n.map(function(e){return r=e.isAny||r,i+=e.name+`|`,{name:e.name,typeIndex:e.index,test:e.test,isAny:e.isAny,conversion:null,conversionIndex:-1}}),name:i.slice(0,-1),hasAny:r,hasConversion:!1,restParam:t}}function ee(e){let t=ae(e.types.map(e=>e.name)),n=e.hasAny,r=e.name,i=t.map(function(e){let t=f(e.from);return n=t.isAny||n,r+=`|`+e.from,{name:e.from,typeIndex:t.index,test:t.test,isAny:t.isAny,conversion:e,conversionIndex:e.index}});return{types:e.types.concat(i),name:r,hasAny:n,hasConversion:i.length>0,restParam:e.restParam}}function te(e){return e.typeSet||(e.typeSet=new Set,e.types.forEach(t=>e.typeSet.add(t.name))),e.typeSet}function ne(e){let t=[];if(typeof e!=`string`)throw TypeError(`Signatures must be strings`);let n=e.trim();if(n===``)return t;let r=n.split(`,`);for(let e=0;e=n+1}}else if(e.length===0)return function(e){return e.length===0};else if(e.length===1)return n=w(e[0]),function(e){return n(e[0])&&e.length===1};else if(e.length===2)return n=w(e[0]),r=w(e[1]),function(e){return n(e[0])&&r(e[1])&&e.length===2};else return t=e.map(w),function(e){for(let n=0;n{let r=E(e.params,t),i;for(i of r)n.add(i)}),n.has(`any`)?[`any`]:Array.from(n)}function k(e,t,n){let r,i,a=e||`unnamed`,o=n,s;for(s=0;s{let r=w(T(n.params,s));(s0){let e=g(t[s]);return r=TypeError(`Unexpected type of argument in function `+a+` (expected: `+i.join(` or `)+`, actual: `+e.join(` | `)+`, index: `+s+`)`),r.data={category:`wrongType`,fn:a,index:s,actual:e,expected:i},r}}else o=e}let c=o.map(function(e){return C(e.params)?1/0:e.params.length});if(t.lengthl)return r=TypeError(`Too many arguments in function `+a+` (expected: `+l+`, actual: `+t.length+`)`),r.data={category:`tooManyArgs`,fn:a,index:t.length,expectedLength:l},r;let u=[];for(let e=0;e0)return .001;let r=j(e),i=j(t);if(e.hasConversion){if(!t.hasConversion)return(1+r)*1e-6}else if(t.hasConversion)return-(1+i)*1e-6;let a=r-i;return a<0?-1e-7:a>0?1e-7:0}function M(e,t){let n=e.params,r=t.params,i=I(n),a=I(r),o=C(n),s=C(r);if(o&&i.hasAny){if(!s||!a.hasAny)return 1e7}else if(s&&a.hasAny)return-1e7;let c=0,l=0,u;for(u of n)u.hasAny&&++c,u.hasConversion&&++l;let d=0,f=0;for(u of r)u.hasAny&&++d,u.hasConversion&&++f;if(c!==d)return(c-d)*1e6;if(o&&i.hasConversion){if(!s||!a.hasConversion)return 1e5}else if(s&&a.hasConversion)return-1e5;if(l!==f)return(l-f)*1e4;if(o){if(!s)return 1e3}else if(s)return-1e3;let p=(n.length-r.length)*(o?-100:100);if(p!==0)return p;let m=[],h=0;for(let e=0;ee.hasConversion)){let i=C(e),a=e.map(N);r=a.map(e=>e.name).join(`;`),n=function(){let e=[],n=i?arguments.length-1:arguments.length;for(let t=0;t`+e.conversion.to+`,`,a.push(f(e.conversion.from).test),o.push(e.conversion.convert))}),s=s?s.slice(0,-1):`pass`;let c=e=>e;switch(o.length){case 0:break;case 1:t=a[0],r=o[0],c=function(e){return t(e)?r(e):e};break;case 2:t=a[0],n=a[1],r=o[0],i=o[1],c=function(e){return t(e)?r(e):n(e)?i(e):e};break;default:c=function(e){for(let t=0;te.name).join(`|`),hasAny:e.some(e=>e.isAny),hasConversion:!1,restParam:!0}),a.push(i)}else a=i.types.map(function(e){return{types:[e],name:e.name,hasAny:e.isAny,hasConversion:e.conversion,restParam:!1}});return he(a,function(i){return t(e,n+1,r.concat([i]))})}else return[r]}return t(e,0,[])}function ce(e,t){let n=Math.max(e.length,t.length);for(let r=0;r=r:o?r>=i:r===i}function le(e){return e.map(e=>ye(e)?ve(e.referToSelf.callback):R(e)?_e(e.referTo.references,e.referTo.callback):e)}function ue(e,t,n){let r=[],i;for(i of e){let e=n[i];if(typeof e!=`number`)throw TypeError(`No definition for referenced signature "`+i+`"`);if(e=t[e],typeof e!=`function`)return!1;r.push(e)}return r}function de(e,t,n){let r=le(e),i=Array(r.length).fill(!1),a=!0;for(;a;){a=!1;let e=!0;for(let o=0;o{let r=e[n];if(t.test(r.toString()))throw SyntaxError("Using `this` to self-reference a function is deprecated since typed-function@3. Use typed.referTo and typed.referToSelf instead.")})}function F(e,r){if(d.createCount++,Object.keys(r).length===0)throw SyntaxError(`No signatures provided`);d.warnAgainstDeprecatedThis&&P(r);let i=[],a=[],o={},s=[],c;for(c in r){if(!Object.prototype.hasOwnProperty.call(r,c))continue;let e=ne(c);if(!e)continue;i.forEach(function(t){if(ce(t,e))throw TypeError(`Conflicting signatures "`+x(t)+`" and "`+x(e)+`".`)}),i.push(e);let t=a.length;a.push(r[c]);let n=e.map(ee),l;for(l of se(n)){let e=x(l);s.push({params:l,name:e,fn:t}),l.every(e=>!e.hasConversion)&&(o[e]=t)}}s.sort(M);let l=de(a,o,B),u;for(u in o)Object.prototype.hasOwnProperty.call(o,u)&&(o[u]=l[o[u]]);let f=[],p=new Map;for(u of s)p.has(u.name)||(u.fn=l[u.fn],f.push(u),p.set(u.name,u));let m=f[0]&&f[0].params.length<=2&&!C(f[0].params),h=f[1]&&f[1].params.length<=2&&!C(f[1].params),g=f[2]&&f[2].params.length<=2&&!C(f[2].params),_=f[3]&&f[3].params.length<=2&&!C(f[3].params),v=f[4]&&f[4].params.length<=2&&!C(f[4].params),y=f[5]&&f[5].params.length<=2&&!C(f[5].params),b=m&&h&&g&&_&&v&&y;for(let e=0;ee.test),xe=f.map(e=>e.implementation),z=function(){for(let e=R;ex(ne(e))),t=I(arguments);if(typeof t!=`function`)throw TypeError(`Callback function expected as last argument`);return _e(e,t)}function _e(e,t){return{referTo:{references:e,callback:t}}}function ve(e){if(typeof e!=`function`)throw TypeError(`Callback function expected as first argument`);return{referToSelf:{callback:e}}}function R(e){return e&&typeof e.referTo==`object`&&Array.isArray(e.referTo.references)&&typeof e.referTo.callback==`function`}function ye(e){return e&&typeof e.referToSelf==`object`&&typeof e.referToSelf.callback==`function`}function be(e,t){if(!e)return t;if(t&&t!==e){let n=Error(`Function names do not match (expected: `+e+`, actual: `+t+`)`);throw n.data={actual:t,expected:e},n}return e}function xe(e){let t;for(let n in e)Object.prototype.hasOwnProperty.call(e,n)&&(_(e[n])||typeof e[n].signature==`string`)&&(t=be(t,e[n].name));return t}function z(e,t){let n;for(n in t)if(Object.prototype.hasOwnProperty.call(t,n)){if(n in e&&t[n]!==e[n]){let r=Error(`Signature "`+n+`" is defined twice`);throw r.data={signature:n,sourceFunction:t[n],destFunction:e[n]},r}e[n]=t[n]}}let B=d;d=function(e){let t=typeof e==`string`,n=t?1:0,r=t?e:``,i={};for(let e=n;e1&&arguments[1]!==void 0?arguments[1]:{override:!1};Se(e);let n=f(e.to),r=n.conversionsTo.find(t=>t.from===e.from);if(r)if(t&&t.override)d.removeConversion({from:r.from,to:e.to,convert:r.convert});else throw Error(`There is already a conversion from "`+e.from+`" to "`+n.name+`"`);n.conversionsTo.push({from:e.from,to:n.name,convert:e.convert,index:u++})},d.addConversions=function(e,t){e.forEach(e=>d.addConversion(e,t))},d.removeConversion=function(e){Se(e);let t=f(e.to),n=L(t.conversionsTo,t=>t.from===e.from);if(!n)throw Error(`Attempt to remove nonexistent conversion from `+e.from+` to `+e.to);if(n.convert!==e.convert)throw Error(`Conversion to remove does not match existing conversion`);let r=t.conversionsTo.indexOf(n);t.conversionsTo.splice(r,1)},d.resolve=function(e,t){if(!_(e))throw TypeError(r);let n=e._typedFunctionData.signatures;for(let e=0;eO&&/^(?:[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBA]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC4\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC80-\uDD43]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD887][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]|\uD821[\uDC00-\uDFF7]|\uD823[\uDC00-\uDCD5\uDCFF-\uDD08]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD22\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD67\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF1E\uDF25-\uDF2A]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF39\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD888[\uDC00-\uDFAF])(?:[0-9A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBA]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC4\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC80-\uDD43]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD887][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]|\uD821[\uDC00-\uDFF7]|\uD823[\uDC00-\uDCD5\uDCFF-\uDD08]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD22\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD67\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF1E\uDF25-\uDF2A]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF39\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD888[\uDC00-\uDFAF])*$/.test(e)},{name:`string`,test:O},{name:`Chain`,test:De},{name:`Array`,test:k},{name:`Matrix`,test:A},{name:`DenseMatrix`,test:ie},{name:`SparseMatrix`,test:M},{name:`Range`,test:ae},{name:`Index`,test:oe},{name:`boolean`,test:N},{name:`ResultSet`,test:se},{name:`Help`,test:ce},{name:`function`,test:le},{name:`Date`,test:ue},{name:`RegExp`,test:de},{name:`null`,test:I},{name:`undefined`,test:me},{name:`AccessorNode`,test:L},{name:`ArrayNode`,test:he},{name:`AssignmentNode`,test:ge},{name:`BlockNode`,test:_e},{name:`ConditionalNode`,test:ve},{name:`ConstantNode`,test:R},{name:`FunctionNode`,test:xe},{name:`FunctionAssignmentNode`,test:be},{name:`IndexNode`,test:z},{name:`Node`,test:B},{name:`ObjectNode`,test:Se},{name:`OperatorNode`,test:Ce},{name:`ParenthesisNode`,test:we},{name:`RangeNode`,test:Te},{name:`RelationalNode`,test:Ee},{name:`SymbolNode`,test:V},{name:`Map`,test:F},{name:`Object`,test:P}]),a.addConversions([{from:`number`,to:`BigNumber`,convert:function(e){if(t||nn(e),it(e)>15)throw 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||rn(e),new n(e,0)}},{from:`BigNumber`,to:`Complex`,convert:function(e){return n||rn(e),new n(e.toNumber(),0)}},{from:`bigint`,to:`number`,convert:function(e){if(e>2**53-1)throw TypeError(`Cannot implicitly convert bigint to number: value exceeds the max safe integer value (value: `+e+`)`);return Number(e)}},{from:`bigint`,to:`BigNumber`,convert:function(e){return t||nn(e),new t(e.toString())}},{from:`bigint`,to:`Fraction`,convert:function(e){return i||on(e),new i(e)}},{from:`Fraction`,to:`BigNumber`,convert:function(e){throw 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||rn(e),new n(e.valueOf(),0)}},{from:`number`,to:`Fraction`,convert:function(e){i||on(e);var t=new i(e);if(t.valueOf()!==e)throw 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 Error(`Cannot convert "`+e+`" to a number`);return t}},{from:`string`,to:`BigNumber`,convert:function(e){t||nn(e);try{return new t(e)}catch{throw Error(`Cannot convert "`+e+`" to BigNumber`)}}},{from:`string`,to:`bigint`,convert:function(e){try{return BigInt(e)}catch{throw Error(`Cannot convert "`+e+`" to BigInt`)}}},{from:`string`,to:`Fraction`,convert:function(e){i||on(e);try{return new i(e)}catch{throw Error(`Cannot convert "`+e+`" to Fraction`)}}},{from:`string`,to:`Complex`,convert:function(e){n||rn(e);try{return new n(e)}catch{throw Error(`Cannot convert "`+e+`" to Complex`)}}},{from:`boolean`,to:`number`,convert:function(e){return+e}},{from:`boolean`,to:`BigNumber`,convert:function(e){return t||nn(e),new t(+e)}},{from:`boolean`,to:`bigint`,convert:function(e){return BigInt(+e)}},{from:`boolean`,to:`Fraction`,convert:function(e){return i||on(e),new i(+e)}},{from:`boolean`,to:`string`,convert:function(e){return String(e)}},{from:`Array`,to:`Matrix`,convert:function(e){return r||an(),new r(e)}},{from:`Matrix`,to:`Array`,convert:function(e){return e.valueOf()}}]),a.onMismatch=(e,t,n)=>{var r=a.createError(e,t,n);if([`wrongType`,`mismatch`].includes(r.data.category)&&t.length===1&&j(t[0])&&n.some(e=>!e.params.includes(`,`))){var i=TypeError(`Function '${e}' doesn't apply to matrices. To call it elementwise on a matrix 'M', try 'map(M, ${e})'.`);throw i.data=r.data,i}throw r},a.onMismatch=(e,t,n)=>{var r=a.createError(e,t,n);if([`wrongType`,`mismatch`].includes(r.data.category)&&t.length===1&&j(t[0])&&n.some(e=>!e.params.includes(`,`))){var i=TypeError(`Function '${e}' doesn't apply to matrices. To call it elementwise on a matrix 'M', try 'map(M, ${e})'.`);throw i.data=r.data,i}throw r},a});function nn(e){throw Error(`Cannot convert value ${e} into a BigNumber: no class 'BigNumber' provided`)}function rn(e){throw Error(`Cannot convert value ${e} into a Complex number: no class 'Complex' provided`)}function an(){throw Error(`Cannot convert array into a Matrix: no class 'DenseMatrix' provided`)}function on(e){throw Error(`Cannot convert value ${e} into a Fraction, no class 'Fraction' provided.`)}var sn=K(`ResultSet`,[],()=>{function e(t){if(!(this instanceof e))throw 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.map(String).join(`, `)+`]`},e.prototype.toJSON=function(){return{mathjs:`ResultSet`,entries:this.entries}},e.fromJSON=function(t){return new e(t.entries)},e},{isClass:!0});function cn(e,t,n){var r=e.constructor,i=new r(2),a=``;if(n){if(n<1)throw Error(`size must be in greater than 0`);if(!W(n))throw Error(`size must be an integer`);if(e.greaterThan(i.pow(n-1).sub(1))||e.lessThan(i.pow(n-1).mul(-1)))throw Error(`Value must be in range [-2^${n-1}, 2^${n-1}-1]`);if(!e.isInteger())throw Error(`Value must be an integer`);e.lessThan(0)&&(e=e.add(i.pow(n))),a=`i${n}`}switch(t){case 2:return`${e.toBinary()}${a}`;case 8:return`${e.toOctal()}${a}`;case 16:return`${e.toHexadecimal()}${a}`;default:throw Error(`Base ${t} not supported `)}}function ln(e,t){if(typeof t==`function`)return t(e);if(!e.isFinite())return e.isNaN()?`NaN`:e.gt(0)?`Infinity`:`-Infinity`;var{notation:n,precision:r,wordSize:i}=Xe(t);switch(n){case`fixed`:return fn(e,r);case`exponential`:return dn(e,r);case`engineering`:return un(e,r);case`bin`:return cn(e,2,i);case`oct`:return cn(e,8,i);case`hex`:return cn(e,16,i);case`auto`:var a=pn(t?.lowerExp,-3),o=pn(t?.upperExp,5);if(e.isZero())return`0`;var s,c=e.toSignificantDigits(r),l=c.e;return s=l>=a&&l=0?`+`:``)+r.toString()}function dn(e,t){return t===void 0?e.toExponential():e.toExponential(t-1)}function fn(e,t){return e.toFixed(t)}function pn(e,t){return C(e)?e:w(e)?e.toNumber():t}function mn(e,t){var n=hn(e,t);return t&&typeof t==`object`&&`truncate`in t&&n.length>t.truncate?n.substring(0,t.truncate-3)+`...`:n}function hn(e,t){return typeof e==`number`?Ye(e,t):w(e)?ln(e,t):yn(e)?!t||t.fraction!==`decimal`?`${e.s*e.n}/${e.d}`:e.toString():Array.isArray(e)?vn(e,t):O(e)?gn(e):typeof e==`function`?e.syntax?String(e.syntax):`function`:e&&typeof e==`object`?typeof e.format==`function`?e.format(t):e&&e.toString(t)!=={}.toString()?e.toString(t):`{`+Object.keys(e).map(n=>gn(n)+`: `+mn(e[n],t)).join(`, `)+`}`:String(e)}function gn(e){for(var t=String(e),n=``,r=0;r/g,`>`),t}function vn(e,t){if(Array.isArray(e)){for(var n=`[`,r=e.length,i=0;i`,associativity:`left`,associativeWith:[]},"OperatorNode:smallerEq":{op:`<=`,associativity:`left`,associativeWith:[]},"OperatorNode:largerEq":{op:`>=`,associativity:`left`,associativeWith:[]},RelationalNode:{associativity:`left`,associativeWith:[]}},{"OperatorNode:leftShift":{op:`<<`,associativity:`left`,associativeWith:[]},"OperatorNode:rightArithShift":{op:`>>`,associativity:`left`,associativeWith:[]},"OperatorNode:rightLogShift":{op:`>>>`,associativity:`left`,associativeWith:[]}},{"OperatorNode:to":{op:`to`,associativity:`left`,associativeWith:[]}},{RangeNode:{}},{"OperatorNode:add":{op:`+`,associativity:`left`,associativeWith:[`OperatorNode:add`,`OperatorNode:subtract`]},"OperatorNode:subtract":{op:`-`,associativity:`left`,associativeWith:[]}},{"OperatorNode:multiply":{op:`*`,associativity:`left`,associativeWith:[`OperatorNode:multiply`,`OperatorNode:divide`,`Operator:dotMultiply`,`Operator:dotDivide`]},"OperatorNode:divide":{op:`/`,associativity:`left`,associativeWith:[],latexLeftParens:!1,latexRightParens:!1,latexParens:!1},"OperatorNode:dotMultiply":{op:`.*`,associativity:`left`,associativeWith:[`OperatorNode:multiply`,`OperatorNode:divide`,`OperatorNode:dotMultiply`,`OperatorNode:doDivide`]},"OperatorNode:dotDivide":{op:`./`,associativity:`left`,associativeWith:[]},"OperatorNode:mod":{op:`mod`,associativity:`left`,associativeWith:[]}},{"OperatorNode:multiply":{associativity:`left`,associativeWith:[`OperatorNode:multiply`,`OperatorNode:divide`,`Operator:dotMultiply`,`Operator:dotDivide`]}},{"OperatorNode:unaryPlus":{op:`+`,associativity:`right`},"OperatorNode:unaryMinus":{op:`-`,associativity:`right`},"OperatorNode:bitNot":{op:`~`,associativity:`right`},"OperatorNode:not":{op:`not`,associativity:`right`}},{"OperatorNode:pow":{op:`^`,associativity:`right`,associativeWith:[],latexRightParens:!1},"OperatorNode:dotPow":{op:`.^`,associativity:`right`,associativeWith:[]}},{"OperatorNode:nullish":{op:`??`,associativity:`left`,associativeWith:[]}},{"OperatorNode:factorial":{op:`!`,associativity:`left`}},{"OperatorNode:ctranspose":{op:`'`,associativity:`left`}}];function wn(e,t){if(!t||t!==`auto`)return e;for(var n=e;we(n);)n=n.content;return n}function Y(e,t,n,r){var i=e;t!==`keep`&&(i=e.getContent());for(var a=i.getIdentifier(),o=null,s=0;s=this.max?this.message=`Index out of range (`+this.index+` > `+(this.max-1)+`)`:this.message=`Index out of range (`+this.index+`)`,this.stack=Error().stack}Dn.prototype=RangeError(),Dn.prototype.constructor=RangeError,Dn.prototype.name=`IndexError`,Dn.prototype.isIndexError=!0;function On(e,t,n){if(!(this instanceof On))throw 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=Error().stack}On.prototype=RangeError(),On.prototype.constructor=RangeError,On.prototype.name=`DimensionError`,On.prototype.isDimensionError=!0;function kn(e){for(var t=[];Array.isArray(e);)t.push(e.length),e=e[0];return t}function An(e,t){return Array.prototype.map.call(e,t)}function jn(e,t){Array.prototype.forEach.call(e,t)}function Mn(e,t){return Array.prototype.join.call(e,t)}function Nn(e,t){var n=arguments.length>2&&arguments[2]!==void 0?arguments[2]:!1;if(e.length===0)return[];if(n)return a(e);var r=[];return i(e,0);function i(n,a){if(Array.isArray(n)){for(var o=n.length,s=Array(o),c=0;ct(e),!1,!0):Nn(e,t,!0);var r=e=>e===0?e:t(e);return A(e)?e.map(e=>r(e),!1,!0):Nn(e,r,!0)}function Fn(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){a=0,n=1;return}for(;!Object.prototype.hasOwnProperty.call(r,++n););}};return e=Math.abs(e),{hit:function(s){var c=i[s],l=++a;if(r[l]=s,i[s]=l,!c)return++t,t<=e?void 0:(s=r[n],o(s),s);if(delete r[c],n===c)for(;!Object.prototype.hasOwnProperty.call(r,++n););},delete:o,clear:function(){t=a=0,n=1,r=Object.create(null),i=Object.create(null)}}}function In(e){var{hasher:t,limit:n}=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{};return n??=1/0,t??=JSON.stringify,function r(){typeof r.cache!=`object`&&(r.cache={values:new Map,lru:Fn(n||1/0)});var i=[...arguments],a=t(i);if(r.cache.values.has(a))return r.cache.lru.hit(a),r.cache.values.get(a);var o=e.apply(e,i);return r.cache.values.set(a,o),r.cache.values.delete(r.cache.lru.hit(a)),o}}var Ln=In(function(e){return new e(1).exp()},{hasher:zn});In(function(e){return new e(1).plus(new e(5).sqrt()).div(2)},{hasher:zn});var Rn=In(function(e){return e.acos(-1)},{hasher:zn});In(function(e){return Rn(e).times(2)},{hasher:zn});function zn(e){return e[0].precision}var Bn=Hn(`pi`,[`config`,`?BigNumber`],e=>{var{config:t,BigNumber:n}=e;return t.number===`BigNumber`?Rn(n):It}),Vn=Hn(`e`,[`config`,`?BigNumber`],e=>{var{config:t,BigNumber:n}=e;return t.number===`BigNumber`?Ln(n):Lt});function Hn(e,t,n){return K(e,t,n,{recreateOnConfigChange:!0})}var Un=`number`,Wn=[`typed`];function Gn(e){var t=e.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);return t?{input:e,radix:{"0b":2,"0o":8,"0x":16}[t[1]],integerPart:t[2],fractionalPart:t[3]}:null}function Kn(e){for(var t=parseInt(e.integerPart,e.radix),n=0,r=0;r{var{typed:t}=e,n=t(`number`,{"":function(){return 0},number:function(e){return e},string:function(e){if(e===`NaN`)return NaN;var t=Gn(e);if(t)return Kn(t);var n=0,r=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);r&&(n=Number(r[2]),e=r[1]);var i=Number(e);if(isNaN(i))throw SyntaxError(`String "`+e+`" is not a valid number`);if(r){if(i>2**n-1)throw SyntaxError(`String "${e}" is out of range`);i>=2**(n-1)&&(i-=2**n)}return i},BigNumber:function(e){return e.toNumber()},bigint:function(e){return Number(e)},Fraction:function(e){return e.valueOf()},Unit:t.referToSelf(e=>t=>{var n=t.clone();return n.value=e(t.value),n}),null:function(e){return 0},"Unit, string | Unit":function(e,t){return e.toNumber(t)},"Array | Matrix":t.referToSelf(e=>t=>Pn(t,e))});return n.fromJSON=function(e){return parseFloat(e.value)},n}),Jn=new Set([`end`]),Yn=K(`Node`,[`mathWithTransform`],e=>{var{mathWithTransform:t}=e;function n(e){for(var t of[...Jn])if(e.has(t))throw Error(`Scope contains an illegal symbol, "`+t+`" is a reserved keyword`)}class r{get type(){return`Node`}get isNode(){return!0}evaluate(e){return this.compile().evaluate(e)}compile(){var e=this._compile(t,{}),r={},i=null;function a(t){var a=ne(t);return n(a),e(a,r,i)}return{evaluate:a}}_compile(e,t){throw Error(`Method _compile must be implemented by type `+this.type)}forEach(e){throw Error(`Cannot run forEach on a Node interface`)}map(e){throw Error(`Cannot run map on a Node interface`)}_ifNode(e){if(!B(e))throw TypeError(`Callback function must return a Node`);return e}traverse(e){e(this,null,null);function t(e,n){e.forEach(function(e,r,i){n(e,r,i),t(e,n)})}t(this,e)}transform(e){function t(n,r,i){var a=e(n,r,i);return a===n?n.map(t):a}return t(this,null,null)}filter(e){var t=[];return this.traverse(function(n,r,i){e(n,r,i)&&t.push(n)}),t}clone(){throw Error(`Cannot clone a Node interface`)}cloneDeep(){return this.map(function(e){return e.cloneDeep()})}equals(e){return e?this.type===e.type&&Me(this,e):!1}toString(e){var t=this._getCustomString(e);return t===void 0?this._toString(e):t}_toString(){throw Error(`_toString not implemented for `+this.type)}toJSON(){throw Error(`Cannot serialize object: toJSON not implemented by `+this.type)}toHTML(e){var t=this._getCustomString(e);return t===void 0?this._toHTML(e):t}_toHTML(){throw Error(`_toHTML not implemented for `+this.type)}toTex(e){var t=this._getCustomString(e);return t===void 0?this._toTex(e):t}_toTex(e){throw Error(`_toTex not implemented for `+this.type)}_getCustomString(e){if(e&&typeof e==`object`)switch(typeof e.handler){case`object`:case`undefined`:return;case`function`:return e.handler(this,e);default:throw TypeError(`Object or function expected as callback`)}}getIdentifier(){return this.type}getContent(){return this}}return r},{isClass:!0,isNode:!0});function Xn(e){return e&&e.isIndexError?new Dn(e.index+1,e.min+1,e.max===void 0?void 0:e.max+1):e}function Zn(e){var{subset:t}=e;return function(e,n){try{if(Array.isArray(e))return t(e,n);if(e&&typeof e.subset==`function`)return e.subset(n);if(typeof e==`string`)return t(e,n);if(typeof e==`object`){if(!n.isObjectProperty())throw TypeError(`Cannot apply a numeric index as object property`);return p(e,n.getObjectProperty())}else throw TypeError(`Cannot apply index: unsupported type of object`)}catch(e){throw Xn(e)}}}var Qn=`AccessorNode`,$n=K(Qn,[`subset`,`Node`],e=>{var{subset:t,Node:n}=e,r=Zn({subset:t});function i(e){return!(L(e)||he(e)||R(e)||xe(e)||Se(e)||we(e)||V(e))}class a extends n{constructor(e,t){var n=arguments.length>2&&arguments[2]!==void 0?arguments[2]:!1;if(super(),!B(e))throw TypeError(`Node expected for parameter "object"`);if(!z(t))throw TypeError(`IndexNode expected for parameter "index"`);this.object=e,this.index=t,this.optionalChaining=n}get name(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():``:this.object.name||``}get type(){return Qn}get isAccessorNode(){return!0}_compile(e,t){var n=this.object._compile(e,t),i=this.index._compile(e,t),a=this.optionalChaining,o=L(this.object)&&this.object.optionalChaining;if(this.index.isObjectProperty()){var s=this.index.getObjectProperty();return function(e,t,r){var i=r||{},c=n(e,t,i);if(a&&c==null){i.optionalShortCircuit=!0;return}if(!(o&&i!=null&&i.optionalShortCircuit))return p(c,s)}}else return function(e,t,s){var c=s||{},l=n(e,t,c);if(a&&l==null){c.optionalShortCircuit=!0;return}if(!(o&&c!=null&&c.optionalShortCircuit))return r(l,i(e,t,l))}}forEach(e){e(this.object,`object`,this),e(this.index,`index`,this)}map(e){return new a(this._ifNode(e(this.object,`object`,this)),this._ifNode(e(this.index,`index`,this)),this.optionalChaining)}clone(){return new a(this.object,this.index,this.optionalChaining)}_toString(e){var t=this.object.toString(e);i(this.object)&&(t=`(`+t+`)`);var n=this.optionalChaining?this.index.dotNotation?`?`:`?.`:``;return t+n+this.index.toString(e)}_toHTML(e){var t=this.object.toHTML(e);return i(this.object)&&(t=`(`+t+`)`),t+this.index.toHTML(e)}_toTex(e){var t=this.object.toTex(e);return i(this.object)&&(t=`\\left(' + object + '\\right)`),t+this.index.toTex(e)}toJSON(){return{mathjs:Qn,object:this.object,index:this.index,optionalChaining:this.optionalChaining}}static fromJSON(e){return new a(e.object,e.index,e.optionalChaining)}}return J(a,`name`,Qn),a},{isClass:!0,isNode:!0}),er=`ArrayNode`,tr=K(er,[`Node`],e=>{var{Node:t}=e;class n extends t{constructor(e){if(super(),this.items=e||[],!Array.isArray(this.items)||!this.items.every(B))throw TypeError(`Array containing Nodes expected`)}get type(){return er}get isArrayNode(){return!0}_compile(e,t){var n=An(this.items,function(n){return n._compile(e,t)});if(e.config.matrix!==`Array`){var r=e.matrix;return function(e,t,i){return r(An(n,function(n){return n(e,t,i)}))}}else return function(e,t,r){return An(n,function(n){return n(e,t,r)})}}forEach(e){for(var t=0;t[`+this.items.map(function(t){return t.toHTML(e)}).join(`,`)+`]`}_toTex(e){function t(n,r){var i=n.some(he)&&!n.every(he),a=r||i,o=a?`&`:`\\\\`,s=n.map(function(n){return n.items?t(n.items,!r):n.toTex(e)}).join(o);return i||!a||a&&!r?`\\begin{bmatrix}`+s+`\\end{bmatrix}`:s}return t(this.items,!1)}}return J(n,`name`,er),n},{isClass:!0,isNode:!0});function nr(e){var{subset:t,matrix:n}=e;return function(e,r,i){try{if(Array.isArray(e))return n(e).subset(r,i).valueOf().forEach((t,n)=>{e[n]=t}),e;if(e&&typeof e.subset==`function`)return e.subset(r,i);if(typeof e==`string`)return t(e,r,i);if(typeof e==`object`){if(!r.isObjectProperty())throw TypeError(`Cannot apply a numeric index as object property`);return m(e,r.getObjectProperty(),i),e}else throw TypeError(`Cannot apply index: unsupported type of object`)}catch(e){throw Xn(e)}}}var rr=`AssignmentNode`,ir=K(rr,[`subset`,`?matrix`,`Node`],e=>{var{subset:t,matrix:n,Node:r}=e,i=Zn({subset:t}),a=nr({subset:t,matrix:n});function o(e,t,n){t||=`keep`;var r=Y(e,t,n),i=Y(e.value,t,n);return t===`all`||i!==null&&i<=r}class s extends r{constructor(e,t,n){if(super(),this.object=e,this.index=n?t:null,this.value=n||t,!V(e)&&!L(e))throw TypeError(`SymbolNode or AccessorNode expected as "object"`);if(V(e)&&e.name===`end`)throw Error(`Cannot assign to symbol "end"`);if(this.index&&!z(this.index))throw TypeError(`IndexNode expected as "index"`);if(!B(this.value))throw TypeError(`Node expected as "value"`)}get name(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():``:this.object.name||``}get type(){return rr}get isAssignmentNode(){return!0}_compile(e,t){var n=this.object._compile(e,t),r=this.index?this.index._compile(e,t):null,o=this.value._compile(e,t),s=this.object.name;if(this.index)if(this.index.isObjectProperty()){var c=this.index.getObjectProperty();return function(e,t,r){var i=n(e,t,r),a=o(e,t,r);return m(i,c,a),a}}else if(V(this.object))return function(e,t,i){var c=n(e,t,i),l=o(e,t,i),u=r(e,t,c);return e.set(s,a(c,u,l)),l};else{var l=this.object.object._compile(e,t);if(this.object.index.isObjectProperty()){var u=this.object.index.getObjectProperty();return function(e,t,n){var i=l(e,t,n),s=p(i,u),c=r(e,t,s),d=o(e,t,n);return m(i,u,a(s,c,d)),d}}else{var d=this.object.index._compile(e,t);return function(e,t,n){var s=l(e,t,n),c=d(e,t,s),u=i(s,c),f=r(e,t,u),p=o(e,t,n);return a(s,c,a(u,f,p)),p}}}else{if(!V(this.object))throw TypeError(`SymbolNode expected as object`);return function(e,t,n){var r=o(e,t,n);return e.set(s,r),r}}}forEach(e){e(this.object,`object`,this),this.index&&e(this.index,`index`,this),e(this.value,`value`,this)}map(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)))}clone(){return new s(this.object,this.index,this.value)}_toString(e){var t=this.object.toString(e),n=this.index?this.index.toString(e):``,r=this.value.toString(e);return o(this,e&&e.parenthesis,e&&e.implicit)&&(r=`(`+r+`)`),t+n+` = `+r}toJSON(){return{mathjs:rr,object:this.object,index:this.index,value:this.value}}static fromJSON(e){return new s(e.object,e.index,e.value)}_toHTML(e){var t=this.object.toHTML(e),n=this.index?this.index.toHTML(e):``,r=this.value.toHTML(e);return o(this,e&&e.parenthesis,e&&e.implicit)&&(r=`(`+r+`)`),t+n+`=`+r}_toTex(e){var t=this.object.toTex(e),n=this.index?this.index.toTex(e):``,r=this.value.toTex(e);return o(this,e&&e.parenthesis,e&&e.implicit)&&(r=`\\left(${r}\\right)`),t+n+`=`+r}}return J(s,`name`,rr),s},{isClass:!0,isNode:!0}),ar=`BlockNode`,or=K(ar,[`ResultSet`,`Node`],e=>{var{ResultSet:t,Node:n}=e;class r extends n{constructor(e){if(super(),!Array.isArray(e))throw Error(`Array expected`);this.blocks=e.map(function(e){var t=e&&e.node,n=e&&e.visible!==void 0?e.visible:!0;if(!B(t))throw TypeError(`Property "node" must be a Node`);if(typeof n!=`boolean`)throw TypeError(`Property "visible" must be a boolean`);return{node:t,visible:n}})}get type(){return ar}get isBlockNode(){return!0}_compile(e,n){var r=An(this.blocks,function(t){return{evaluate:t.node._compile(e,n),visible:t.visible}});return function(e,n,i){var a=[];return jn(r,function(t){var r=t.evaluate(e,n,i);t.visible&&a.push(r)}),new t(a)}}forEach(e){for(var t=0;t;`)}).join(`
`)}_toTex(e){return this.blocks.map(function(t){return t.node.toTex(e)+(t.visible?``:`;`)}).join(`\\;\\; -`)}}return J(r,`name`,ar),r},{isClass:!0,isNode:!0}),sr=`ConditionalNode`,cr=K(sr,[`Node`],e=>{var{Node:t}=e;function n(e){if(typeof e==`number`||typeof e==`boolean`||typeof e==`string`)return!!e;if(e){if(w(e))return!e.isZero();if(T(e))return!!(e.re||e.im);if(D(e))return!!e.value}if(e==null)return!1;throw TypeError(`Unsupported type of condition "`+Oe(e)+`"`)}class r extends t{constructor(e,t,n){if(super(),!B(e))throw TypeError(`Parameter condition must be a Node`);if(!B(t))throw TypeError(`Parameter trueExpr must be a Node`);if(!B(n))throw TypeError(`Parameter falseExpr must be a Node`);this.condition=e,this.trueExpr=t,this.falseExpr=n}get type(){return sr}get isConditionalNode(){return!0}_compile(e,t){var r=this.condition._compile(e,t),i=this.trueExpr._compile(e,t),a=this.falseExpr._compile(e,t);return function(e,t,o){return n(r(e,t,o))?i(e,t,o):a(e,t,o)}}forEach(e){e(this.condition,`condition`,this),e(this.trueExpr,`trueExpr`,this),e(this.falseExpr,`falseExpr`,this)}map(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)))}clone(){return new r(this.condition,this.trueExpr,this.falseExpr)}_toString(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,n=Y(this,t,e&&e.implicit),r=this.condition.toString(e),i=Y(this.condition,t,e&&e.implicit);(t===`all`||this.condition.type===`OperatorNode`||i!==null&&i<=n)&&(r=`(`+r+`)`);var a=this.trueExpr.toString(e),o=Y(this.trueExpr,t,e&&e.implicit);(t===`all`||this.trueExpr.type===`OperatorNode`||o!==null&&o<=n)&&(a=`(`+a+`)`);var s=this.falseExpr.toString(e),c=Y(this.falseExpr,t,e&&e.implicit);return(t===`all`||this.falseExpr.type===`OperatorNode`||c!==null&&c<=n)&&(s=`(`+s+`)`),r+` ? `+a+` : `+s}toJSON(){return{mathjs:sr,condition:this.condition,trueExpr:this.trueExpr,falseExpr:this.falseExpr}}static fromJSON(e){return new r(e.condition,e.trueExpr,e.falseExpr)}_toHTML(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,n=Y(this,t,e&&e.implicit),r=this.condition.toHTML(e),i=Y(this.condition,t,e&&e.implicit);(t===`all`||this.condition.type===`OperatorNode`||i!==null&&i<=n)&&(r=`(`+r+`)`);var a=this.trueExpr.toHTML(e),o=Y(this.trueExpr,t,e&&e.implicit);(t===`all`||this.trueExpr.type===`OperatorNode`||o!==null&&o<=n)&&(a=`(`+a+`)`);var s=this.falseExpr.toHTML(e),c=Y(this.falseExpr,t,e&&e.implicit);return(t===`all`||this.falseExpr.type===`OperatorNode`||c!==null&&c<=n)&&(s=`(`+s+`)`),r+`?`+a+`:`+s}_toTex(e){return`\\begin{cases} {`+this.trueExpr.toTex(e)+`}, &\\quad{\\text{if }\\;`+this.condition.toTex(e)+`}\\\\{`+this.falseExpr.toTex(e)+`}, &\\quad{\\text{otherwise}}\\end{cases}`}}return J(r,`name`,sr),r},{isClass:!0,isNode:!0}),lr=u(c(((e,t)=>{var n=Object.assign||function(e){for(var t=1;t1&&arguments[1]!==void 0?arguments[1]:{},o=t.preserveFormatting,s=o===void 0?!1:o,c=t.escapeMapFn,l=c===void 0?a:c,u=String(e),d=``,f=l(n({},r),s?n({},i):{}),p=Object.keys(f),m=function(){var e=!1;p.forEach(function(t,n){e||u.length>=t.length&&u.slice(0,t.length)===t&&(d+=f[p[n]],u=u.slice(t.length,u.length),e=!0)}),e||(d+=u.slice(0,1),u=u.slice(1,u.length))};u;)m();return d}}))(),1),ur={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{?}`},X={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`},dr={abs:{1:"\\left|${args[0]}\\right|"},add:{2:`\\left(\${args[0]}${X.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]}${X.dotDivide}\${args[1]}\\right)`},dotMultiply:{2:`\\left(\${args[0]}${X.dotMultiply}\${args[1]}\\right)`},dotPow:{2:`\\left(\${args[0]}${X.dotPow}\${args[1]}\\right)`},exp:{1:"\\exp\\left(${args[0]}\\right)"},expm1:`\\left(e${X.pow}{\${args[0]}}-1\\right)`,fix:{1:"\\mathrm{${name}}\\left(${args[0]}\\right)"},floor:{1:"\\left\\lfloor${args[0]}\\right\\rfloor"},fraction:{2:"\\frac{${args[0]}}{${args[1]}}"},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]}${X.mod}\${args[1]}\\right)`},multiply:{2:`\\left(\${args[0]}${X.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)${X.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]}${X.subtract}\${args[1]}\\right)`},unaryMinus:{1:`${X.unaryMinus}\\left(\${args[0]}\\right)`},unaryPlus:{1:`${X.unaryPlus}\\left(\${args[0]}\\right)`},bitAnd:{2:`\\left(\${args[0]}${X.bitAnd}\${args[1]}\\right)`},bitNot:{1:X.bitNot+"\\left(${args[0]}\\right)"},bitOr:{2:`\\left(\${args[0]}${X.bitOr}\${args[1]}\\right)`},bitXor:{2:`\\left(\${args[0]}${X.bitXor}\${args[1]}\\right)`},leftShift:{2:`\\left(\${args[0]}${X.leftShift}\${args[1]}\\right)`},rightArithShift:{2:`\\left(\${args[0]}${X.rightArithShift}\${args[1]}\\right)`},rightLogShift:{2:`\\left(\${args[0]}${X.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]}${X.and}\${args[1]}\\right)`},not:{1:X.not+"\\left(${args[0]}\\right)"},or:{2:`\\left(\${args[0]}${X.or}\${args[1]}\\right)`},xor:{2:`\\left(\${args[0]}${X.xor}\${args[1]}\\right)`},cross:{2:"\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)"},ctranspose:{1:`\\left(\${args[0]}\\right)${X.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}"},pinv:{1:"\\left(${args[0]}\\right)^{+}"},sqrtm:{1:`{\${args[0]}}${X.pow}{\\frac{1}{2}}`},trace:{1:"\\mathrm{tr}\\left(${args[0]}\\right)"},transpose:{1:`\\left(\${args[0]}\\right)${X.transpose}`},combinations:{2:"\\binom{${args[0]}}{${args[1]}}"},combinationsWithRep:{2:"\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)"},factorial:{1:`\\left(\${args[0]}\\right)${X.factorial}`},gamma:{1:"\\Gamma\\left(${args[0]}\\right)"},lgamma:{1:"\\ln\\Gamma\\left(${args[0]}\\right)"},equal:{2:`\\left(\${args[0]}${X.equal}\${args[1]}\\right)`},larger:{2:`\\left(\${args[0]}${X.larger}\${args[1]}\\right)`},largerEq:{2:`\\left(\${args[0]}${X.largerEq}\${args[1]}\\right)`},smaller:{2:`\\left(\${args[0]}${X.smaller}\${args[1]}\\right)`},smallerEq:{2:`\\left(\${args[0]}${X.smallerEq}\${args[1]}\\right)`},unequal:{2:`\\left(\${args[0]}${X.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]}${X.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)"},bigint:{0:`0`,1:"\\left(${args[0]}\\right)"},complex:{0:`0`,1:"\\left(${args[0]}\\right)",2:`\\left(\\left(\${args[0]}\\right)+${ur.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)"}},fr="\\mathrm{${name}}\\left(${args}\\right)",pr={deg:`^\\circ`};function mr(e){return(0,lr.default)(e,{preserveFormatting:!0})}function hr(e,t){return t=t===void 0?!1:t,t?H(pr,e)?pr[e]:`\\mathrm{`+mr(e)+`}`:H(ur,e)?ur[e]:mr(e)}var gr=`ConstantNode`,_r=K(gr,[`Node`,`isBounded`],e=>{var{Node:t,isBounded:n}=e;class r extends t{constructor(e){super(),this.value=e}get type(){return gr}get isConstantNode(){return!0}_compile(e,t){var n=this.value;return function(){return n}}forEach(e){}map(e){return this.clone()}clone(){return new r(this.value)}_toString(e){return mn(this.value,e)}_toHTML(e){var t=this._toString(e);switch(Oe(this.value)){case`number`:case`bigint`:case`BigNumber`:case`Fraction`:return``+t+``;case`string`:return``+t+``;case`boolean`:return``+t+``;case`null`:return``+t+``;case`undefined`:return``+t+``;default:return``+t+``}}toJSON(){return{mathjs:gr,value:this.value}}static fromJSON(e){return new r(e.value)}_toTex(e){var t=this._toString(e);switch(Oe(this.value)){case`string`:return`\\mathtt{`+mr(t)+`}`;case`number`:case`BigNumber`:if(!n(this.value))return this.value.valueOf()<0?`-\\infty`:`\\infty`;var r=t.toLowerCase().indexOf(`e`);return r===-1?t:t.substring(0,r)+`\\cdot10^{`+t.substring(r+1)+`}`;case`bigint`:return t.toString();case`Fraction`:return this.value.toLatex();default:return t}}}return J(r,`name`,gr),r},{isClass:!0,isNode:!0}),vr=`FunctionAssignmentNode`,yr=K(vr,[`typed`,`Node`],e=>{var{typed:t,Node:n}=e;function r(e,t,n){var r=Y(e,t,n),i=Y(e.expr,t,n);return t===`all`||i!==null&&i<=r}class i extends n{constructor(e,t,n){if(super(),typeof e!=`string`)throw TypeError(`String expected for parameter "name"`);if(!Array.isArray(t))throw TypeError(`Array containing strings or objects expected for parameter "params"`);if(!B(n))throw TypeError(`Node expected for parameter "expr"`);if(Jn.has(e))throw Error(`Illegal function name, "`+e+`" is a reserved keyword`);var r=new Set;for(var i of t){var a=typeof i==`string`?i:i.name;if(r.has(a))throw Error(`Duplicate parameter name "${a}"`);r.add(a)}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}get type(){return vr}get isFunctionAssignmentNode(){return!0}_compile(e,n){var r=Object.create(n);jn(this.params,function(e){r[e]=!0});var i=this.expr,a=i._compile(e,r),o=this.name,s=this.params,c=Mn(this.types,`,`),l=o+`(`+Mn(this.params,`, `)+`)`;return function(e,n,r){var u={};u[c]=function(){for(var t=Object.create(n),i=0;i`+q(this.params[i])+``);var a=this.expr.toHTML(e);return r(this,t,e&&e.implicit)&&(a=`(`+a+`)`),``+q(this.name)+`(`+n.join(`,`)+`)=`+a}_toTex(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,n=this.expr.toTex(e);return r(this,t,e&&e.implicit)&&(n=`\\left(${n}\\right)`),`\\mathrm{`+this.name+`}\\left(`+this.params.map(hr).join(`,`)+`\\right)=`+n}}return J(i,`name`,vr),i},{isClass:!0,isNode:!0}),br=`IndexNode`,xr=K(br,[`Node`,`size`],e=>{var{Node:t,size:n}=e;class r extends t{constructor(e,t){if(super(),this.dimensions=e,this.dotNotation=t||!1,!Array.isArray(e)||!e.every(B))throw TypeError(`Array containing Nodes expected for parameter "dimensions"`);if(this.dotNotation&&!this.isObjectProperty())throw Error(`dotNotation only applicable for object properties`)}get type(){return br}get isIndexNode(){return!0}_compile(e,t){var r=An(this.dimensions,function(r,i){if(r.filter(e=>e.isSymbolNode&&e.name===`end`).length>0){var a=Object.create(t);a.end=!0;var o=r._compile(e,a);return function(e,t,r){if(!A(r)&&!k(r)&&!O(r))throw TypeError(`Cannot resolve "end": context must be a Matrix, Array, or string but is `+Oe(r));var a=n(r),s=Object.create(t);return s.end=a[i],o(e,s,r)}}else return r._compile(e,t)}),i=p(e,`index`);return function(e,t,n){return i(...An(r,function(r){return r(e,t,n)}))}}forEach(e){for(var t=0;t.`+q(this.getObjectProperty())+``:`[`+t.join(`,`)+`]`}_toTex(e){var t=this.dimensions.map(function(t){return t.toTex(e)});return this.dotNotation?`.`+this.getObjectProperty():`_{`+t.join(`,`)+`}`}}return J(r,`name`,br),r},{isClass:!0,isNode:!0}),Sr=`ObjectNode`,Cr=K(Sr,[`Node`],e=>{var{Node:t}=e;class n extends t{constructor(e){if(super(),this.properties=e||{},e&&(typeof e!=`object`||!Object.keys(e).every(function(t){return B(e[t])})))throw TypeError(`Object containing Nodes expected`)}get type(){return Sr}get isObjectNode(){return!0}_compile(e,t){var n={};for(var r in this.properties)if(H(this.properties,r)){var i=gn(r),a=JSON.parse(i);n[a]=p(this.properties,r)._compile(e,t)}return function(e,t,r){var i={};for(var a in n)H(n,a)&&(i[a]=n[a](e,t,r));return i}}forEach(e){for(var t in this.properties)H(this.properties,t)&&e(this.properties[t],`properties[`+gn(t)+`]`,this)}map(e){var t={};for(var r in this.properties)H(this.properties,r)&&(t[r]=this._ifNode(e(this.properties[r],`properties[`+gn(r)+`]`,this)));return new n(t)}clone(){var e={};for(var t in this.properties)H(this.properties,t)&&(e[t]=this.properties[t]);return new n(e)}_toString(e){var t=[];for(var n in this.properties)H(this.properties,n)&&t.push(gn(n)+`: `+this.properties[n].toString(e));return`{`+t.join(`, `)+`}`}toJSON(){return{mathjs:Sr,properties:this.properties}}static fromJSON(e){return new n(e.properties)}_toHTML(e){var t=[];for(var n in this.properties)H(this.properties,n)&&t.push(``+q(n)+`:`+this.properties[n].toHTML(e));return`{`+t.join(`,`)+`}`}_toTex(e){var t=[];for(var n in this.properties)H(this.properties,n)&&t.push(`\\mathbf{`+n+`:} & `+this.properties[n].toTex(e)+`\\\\`);return`\\left\\{\\begin{array}{ll}`+t.join(` -`)+`\\end{array}\\right\\}`}}return J(n,`name`,Sr),n},{isClass:!0,isNode:!0});function wr(e,t){return new S(e,new x(t),new Set(Object.keys(t)))}var Tr=`OperatorNode`,Er=K(Tr,[`Node`],e=>{var{Node:t}=e;function n(e,t){var r=e;if(t===`auto`)for(;we(r);)r=r.content;return R(r)?!0:Ce(r)?n(r.args[0],t):!1}function r(e,t,r,i,a){var o=Y(e,t,r),s=Tn(e,t);if(t===`all`||i.length>2&&e.getIdentifier()!==`OperatorNode:add`&&e.getIdentifier()!==`OperatorNode:multiply`)return i.map(function(e){switch(e.getContent().type){case`ArrayNode`:case`ConstantNode`:case`SymbolNode`:case`ParenthesisNode`:return!1;default:return!0}});var c;switch(i.length){case 0:c=[];break;case 1:var l=Y(i[0],t,r,e);if(a&&l!==null){var u,d;if(t===`keep`?(u=i[0].getIdentifier(),d=e.getIdentifier()):(u=i[0].getContent().getIdentifier(),d=e.getContent().getIdentifier()),Cn[o][d].latexLeftParens===!1){c=[!1];break}if(Cn[l][u].latexParens===!1){c=[!1];break}}if(l===null){c=[!1];break}if(l<=o){c=[!0];break}c=[!1];break;case 2:var f,p=Y(i[0],t,r,e),m=En(e,i[0],t);f=p===null?!1:p===o&&s===`right`&&!m?!0:p=2&&e.getIdentifier()===`OperatorNode:multiply`&&e.implicit&&t!==`all`&&r===`hide`)for(var x=1;x2&&(this.getIdentifier()===`OperatorNode:add`||this.getIdentifier()===`OperatorNode:multiply`)){var d=i.map(function(t,n){return t=t.toString(e),a[n]&&(t=`(`+t+`)`),t});return this.implicit&&this.getIdentifier()===`OperatorNode:multiply`&&n===`hide`?d.join(` `):d.join(` `+this.op+` `)}else return this.fn+`(`+this.args.join(`, `)+`)`}toJSON(){return{mathjs:Tr,op:this.op,fn:this.fn,args:this.args,implicit:this.implicit,isPercentage:this.isPercentage}}static fromJSON(e){return new i(e.op,e.fn,e.args,e.implicit,e.isPercentage)}_toHTML(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(i.length===1){var o=Tn(this,t),s=i[0].toHTML(e);return a[0]&&(s=`(`+s+`)`),o===`right`?``+q(this.op)+``+s:s+``+q(this.op)+``}else if(i.length===2){var c=i[0].toHTML(e),l=i[1].toHTML(e);return a[0]&&(c=`(`+c+`)`),a[1]&&(l=`(`+l+`)`),this.implicit&&this.getIdentifier()===`OperatorNode:multiply`&&n===`hide`?c+``+l:c+``+q(this.op)+``+l}else{var u=i.map(function(t,n){return t=t.toHTML(e),a[n]&&(t=`(`+t+`)`),t});return i.length>2&&(this.getIdentifier()===`OperatorNode:add`||this.getIdentifier()===`OperatorNode:multiply`)?this.implicit&&this.getIdentifier()===`OperatorNode:multiply`&&n===`hide`?u.join(``):u.join(``+q(this.op)+``):``+q(this.fn)+`(`+u.join(`,`)+`)`}}_toTex(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=X[this.fn];if(o=o===void 0?this.op:o,i.length===1){var s=Tn(this,t),c=i[0].toTex(e);return a[0]&&(c=`\\left(${c}\\right)`),s===`right`?o+c:c+o}else if(i.length===2){var l=i[0],u=l.toTex(e);a[0]&&(u=`\\left(${u}\\right)`);var d=i[1].toTex(e);a[1]&&(d=`\\left(${d}\\right)`);var f=t===`keep`?l.getIdentifier():l.getContent().getIdentifier();switch(this.getIdentifier()){case`OperatorNode:divide`:return o+`{`+u+`}{`+d+`}`;case`OperatorNode:pow`:switch(u=`{`+u+`}`,d=`{`+d+`}`,f){case`ConditionalNode`:case`OperatorNode:divide`:u=`\\left(${u}\\right)`}break;case`OperatorNode:multiply`:if(this.implicit&&n===`hide`)return u+`~`+d}return u+o+d}else if(i.length>2&&(this.getIdentifier()===`OperatorNode:add`||this.getIdentifier()===`OperatorNode:multiply`)){var p=i.map(function(t,n){return t=t.toTex(e),a[n]&&(t=`\\left(${t}\\right)`),t});return this.getIdentifier()===`OperatorNode:multiply`&&this.implicit&&n===`hide`?p.join(`~`):p.join(o)}else return`\\mathrm{`+this.fn+`}\\left(`+i.map(function(t){return t.toTex(e)}).join(`,`)+`\\right)`}getIdentifier(){return this.type+`:`+this.fn}}return J(i,`name`,Tr),i},{isClass:!0,isNode:!0}),Dr=`ParenthesisNode`,Or=K(Dr,[`Node`],e=>{var{Node:t}=e;class n extends t{constructor(e){if(super(),!B(e))throw TypeError(`Node expected for parameter "content"`);this.content=e}get type(){return Dr}get isParenthesisNode(){return!0}_compile(e,t){return this.content._compile(e,t)}getContent(){return this.content.getContent()}forEach(e){e(this.content,`content`,this)}map(e){return new n(e(this.content,`content`,this))}clone(){return new n(this.content)}_toString(e){return!e||e&&!e.parenthesis||e&&e.parenthesis===`keep`?`(`+this.content.toString(e)+`)`:this.content.toString(e)}toJSON(){return{mathjs:Dr,content:this.content}}static fromJSON(e){return new n(e.content)}_toHTML(e){return!e||e&&!e.parenthesis||e&&e.parenthesis===`keep`?`(`+this.content.toHTML(e)+`)`:this.content.toHTML(e)}_toTex(e){return!e||e&&!e.parenthesis||e&&e.parenthesis===`keep`?`\\left(${this.content.toTex(e)}\\right)`:this.content.toTex(e)}}return J(n,`name`,Dr),n},{isClass:!0,isNode:!0}),kr=`RangeNode`,Ar=K(kr,[`Node`],e=>{var{Node:t}=e;function n(e,t,n){var r=Y(e,t,n),i={},a=Y(e.start,t,n);if(i.start=a!==null&&a<=r||t===`all`,e.step){var o=Y(e.step,t,n);i.step=o!==null&&o<=r||t===`all`}var s=Y(e.end,t,n);return i.end=s!==null&&s<=r||t===`all`,i}class r extends t{constructor(e,t,n){if(super(),!B(e)||!B(t)||n&&!B(n))throw TypeError(`Node expected`);if(arguments.length>3)throw Error(`Too many arguments`);this.start=e,this.end=t,this.step=n||null}get type(){return kr}get isRangeNode(){return!0}needsEnd(){return this.filter(function(e){return V(e)&&e.name===`end`}).length>0}_compile(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))}}else return function(e,t,a){return n(r(e,t,a),i(e,t,a))}}forEach(e){e(this.start,`start`,this),e(this.end,`end`,this),this.step&&e(this.step,`step`,this)}map(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)))}clone(){return new r(this.start,this.end,this.step&&this.step)}_toString(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,r=n(this,t,e&&e.implicit),i,a=this.start.toString(e);if(r.start&&(a=`(`+a+`)`),i=a,this.step){var o=this.step.toString(e);r.step&&(o=`(`+o+`)`),i+=`:`+o}var s=this.end.toString(e);return r.end&&(s=`(`+s+`)`),i+=`:`+s,i}toJSON(){return{mathjs:kr,start:this.start,end:this.end,step:this.step}}static fromJSON(e){return new r(e.start,e.end,e.step)}_toHTML(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,r=n(this,t,e&&e.implicit),i,a=this.start.toHTML(e);if(r.start&&(a=`(`+a+`)`),i=a,this.step){var o=this.step.toHTML(e);r.step&&(o=`(`+o+`)`),i+=`:`+o}var s=this.end.toHTML(e);return r.end&&(s=`(`+s+`)`),i+=`:`+s,i}_toTex(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,r=n(this,t,e&&e.implicit),i=this.start.toTex(e);if(r.start&&(i=`\\left(${i}\\right)`),this.step){var a=this.step.toTex(e);r.step&&(a=`\\left(${a}\\right)`),i+=`:`+a}var o=this.end.toTex(e);return r.end&&(o=`\\left(${o}\\right)`),i+=`:`+o,i}}return J(r,`name`,kr),r},{isClass:!0,isNode:!0}),jr=`RelationalNode`,Mr=K(jr,[`Node`],e=>{var{Node:t}=e,n={equal:`==`,unequal:`!=`,smaller:`<`,larger:`>`,smallerEq:`<=`,largerEq:`>=`};class r extends t{constructor(e,t){if(super(),!Array.isArray(e))throw TypeError(`Parameter conditionals must be an array`);if(!Array.isArray(t))throw TypeError(`Parameter params must be an array`);if(e.length!==t.length-1)throw TypeError(`Parameter params must contain exactly one more element than parameter conditionals`);this.conditionals=e,this.params=t}get type(){return jr}get isRelationalNode(){return!0}_compile(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),c=0;ce(t,`params[`+n+`]`,this),this)}map(e){return new r(this.conditionals.slice(),this.params.map((t,n)=>this._ifNode(e(t,`params[`+n+`]`,this)),this))}clone(){return new r(this.conditionals,this.params)}_toString(e){for(var t=e&&e.parenthesis?e.parenthesis:`keep`,r=Y(this,t,e&&e.implicit),i=this.params.map(function(n,i){var a=Y(n,t,e&&e.implicit);return t===`all`||a!==null&&a<=r?`(`+n.toString(e)+`)`:n.toString(e)}),a=i[0],o=0;o(`+n.toHTML(e)+`)`:n.toHTML(e)}),a=i[0],o=0;o`+q(n[this.conditionals[o]])+``+i[o+1];return a}_toTex(e){for(var t=e&&e.parenthesis?e.parenthesis:`keep`,n=Y(this,t,e&&e.implicit),r=this.params.map(function(r,i){var a=Y(r,t,e&&e.implicit);return t===`all`||a!==null&&a<=n?`\\left(`+r.toTex(e)+`\right)`:r.toTex(e)}),i=r[0],a=0;a{var{math:t,Unit:n,Node:r}=e;function i(e){return n?n.isValuelessUnit(e):!1}class a extends r{constructor(e){if(super(),typeof e!=`string`)throw TypeError(`String expected for parameter "name"`);this.name=e}get type(){return`SymbolNode`}get isSymbolNode(){return!0}_compile(e,t){var r=this.name;if(t[r]===!0)return function(e,t,n){return p(t,r)};if(r in e)return function(t,n,i){return t.has(r)?t.get(r):p(e,r)};var o=i(r);return function(e,t,i){return e.has(r)?e.get(r):o?new n(null,r):a.onUndefinedSymbol(r)}}forEach(e){}map(e){return this.clone()}static onUndefinedSymbol(e){throw Error(`Undefined symbol `+e)}clone(){return new a(this.name)}_toString(e){return this.name}_toHTML(e){var t=q(this.name);return t===`true`||t===`false`?``+t+``:t===`i`?``+t+``:t===`Infinity`?``+t+``:t===`NaN`?``+t+``:t===`null`?``+t+``:t===`undefined`?``+t+``:``+t+``}toJSON(){return{mathjs:`SymbolNode`,name:this.name}}static fromJSON(e){return new a(e.name)}_toTex(e){var n=!1;t[this.name]===void 0&&i(this.name)&&(n=!0);var r=hr(this.name,n);return r[0]===`\\`?r:` `+r}}return a},{isClass:!0,isNode:!0}),Pr=`FunctionNode`,Fr=K(Pr,[`math`,`Node`,`SymbolNode`],e=>{var t,{math:n,Node:r,SymbolNode:i}=e,a=e=>mn(e,{truncate:78});function o(e,t,n){for(var r=``,i=/\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi,a=0,o;(o=i.exec(e))!==null;)if(r+=e.substring(a,o.index),a=o.index,o[0]===`$$`)r+=`$`,a++;else{a+=o[0].length;var s=t[o[1]];if(!s)throw ReferenceError(`Template: Property `+o[1]+` does not exist.`);if(o[2]===void 0)switch(typeof s){case`string`:r+=s;break;case`object`:if(B(s))r+=s.toTex(n);else if(Array.isArray(s))r+=s.map(function(e,t){if(B(e))return e.toTex(n);throw TypeError(`Template: `+o[1]+`[`+t+`] is not a Node.`)}).join(`,`);else throw TypeError(`Template: `+o[1]+` has to be a Node, String or array of Nodes`);break;default:throw TypeError(`Template: `+o[1]+` has to be a Node, String or array of Nodes`)}else if(B(s[o[2]]&&s[o[2]]))r+=s[o[2]].toTex(n);else throw TypeError(`Template: `+o[1]+`[`+o[2]+`] is not a Node.`)}return r+=e.slice(a),r}class s extends r{constructor(e,t,n){if(super(),typeof e==`string`&&(e=new i(e)),!B(e))throw TypeError(`Node expected as parameter "fn"`);if(!Array.isArray(t)||!t.every(B))throw TypeError(`Array containing Nodes expected for parameter "args"`);var r=typeof n;if(!(r===`undefined`||r===`boolean`))throw TypeError(`optional flag, if specified, must be boolean`);this.fn=e,this.args=t||[],this.optional=!!n}get name(){return this.fn.name||``}get type(){return Pr}get isFunctionNode(){return!0}_compile(e,t){var n=this.args.map(n=>n._compile(e,t)),r=this.optional||L(this.fn)&&this.fn.optionalChaining;if(V(this.fn)){var i=this.fn.name;if(t[i]){var o=this.args;return function(t,s,c){var l=p(s,i);if(!(r&&l===void 0)){if(typeof l!=`function`)throw TypeError(`Argument '${i}' was not a function; received: ${a(l)}`);if(l.rawArgs)return l(o,e,wr(t,s));var u=n.map(e=>e(t,s,c));return l.apply(l,u)}}}else{var c=i in e?p(e,i):void 0,l=typeof c==`function`&&c.rawArgs===!0,u=t=>{var n;if(t.has(i))n=t.get(i);else if(i in e)n=p(e,i);else if(r)n=void 0;else return s.onUndefinedFunction(i);if(typeof n==`function`||r&&n===void 0)return n;throw TypeError(`'${i}' is not a function; its value is: - ${a(n)}`)};if(l){var d=this.args;return function(t,r,i){var a=u(t);return a.rawArgs===!0?a(d,e,wr(t,r)):a(...n.map(e=>e(t,r,i)))}}else switch(n.length){case 0:return function(e,t,n){var i=u(e);if(!(r&&i===void 0))return i()};case 1:return function(e,t,i){var a=u(e);if(!(r&&a===void 0)){var o=n[0];return a(o(e,t,i))}};case 2:return function(e,t,i){var a=u(e);if(!(r&&a===void 0)){var o=n[0],s=n[1];return a(o(e,t,i),s(e,t,i))}};default:return function(e,t,i){var a=u(e);if(!(r&&a===void 0))return a(...n.map(n=>n(e,t,i)))}}}}else if(L(this.fn)&&z(this.fn.index)&&this.fn.index.isObjectProperty()){var f=this.fn.object._compile(e,t),m=this.fn.index.getObjectProperty(),h=this.args;return function(t,i,a){var o=f(t,i,a);if(!(r&&(o==null||o[m]===void 0))){var s=g(o,m);if(s!=null&&s.rawArgs)return s(h,e,wr(t,i));var c=n.map(e=>e(t,i,a));return s.apply(o,c)}}}else{var _=this.fn.toString(),v=this.fn._compile(e,t),y=this.args;return function(t,i,o){var s=v(t,i,o);if(!(r&&s===void 0)){if(typeof s!=`function`)throw TypeError(`Expression '${_}' did not evaluate to a function; value is: - ${a(s)}`);if(s.rawArgs)return s(y,e,wr(t,i));var c=n.map(e=>e(t,i,o));return s.apply(s,c)}}}}forEach(e){e(this.fn,`fn`,this);for(var t=0;t`+q(this.fn)+`(`+t.join(`,`)+`)`}toTex(e){var t;return e&&typeof e.handler==`object`&&H(e.handler,this.name)&&(t=e.handler[this.name](this,e)),t===void 0?super.toTex(e):t}_toTex(e){var t=this.args.map(function(t){return t.toTex(e)}),r;dr[this.name]&&(r=dr[this.name]),n[this.name]&&(typeof n[this.name].toTex==`function`||typeof n[this.name].toTex==`object`||typeof n[this.name].toTex==`string`)&&(r=n[this.name].toTex);var i;switch(typeof r){case`function`:i=r(this,e);break;case`string`:i=o(r,this,e);break;case`object`:switch(typeof r[t.length]){case`function`:i=r[t.length](this,e);break;case`string`:i=o(r[t.length],this,e);break}}return i===void 0?o(fr,this,e):i}getIdentifier(){return this.type+`:`+this.name}}return t=s,J(s,`name`,Pr),J(s,`onUndefinedFunction`,function(e){throw Error(`Undefined function `+e)}),J(s,`fromJSON`,function(e){return new t(e.fn,e.args)}),s},{isClass:!0,isNode:!0}),Ir=`parse`,Lr=K(Ir,[`typed`,`numeric`,`config`,`AccessorNode`,`ArrayNode`,`AssignmentNode`,`BlockNode`,`ConditionalNode`,`ConstantNode`,`FunctionAssignmentNode`,`FunctionNode`,`IndexNode`,`ObjectNode`,`OperatorNode`,`ParenthesisNode`,`RangeNode`,`RelationalNode`,`SymbolNode`],e=>{var{typed:t,numeric:n,config:r,AccessorNode:i,ArrayNode:a,AssignmentNode:o,BlockNode:s,ConditionalNode:c,ConstantNode:l,FunctionAssignmentNode:u,FunctionNode:f,IndexNode:p,ObjectNode:m,OperatorNode:h,ParenthesisNode:g,RangeNode:_,RelationalNode:v,SymbolNode:y}=e,b=t(Ir,{string:function(e){return ae(e,{})},"Array | Matrix":function(e){return x(e,{})},"string, Object":function(e,t){return ae(e,t.nodes===void 0?{}:t.nodes)},"Array | Matrix, Object":x});function x(e){var t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{},n=t.nodes===void 0?{}:t.nodes;return Pn(e,function(e){if(typeof e!=`string`)throw TypeError(`String expected`);return ae(e,n)})}var S={NULL:0,DELIMITER:1,NUMBER:2,SYMBOL:3,UNKNOWN:4},ee={",":!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,">>":!0,">>>":!0},te={mod:!0,to:!0,in:!0,and:!0,xor:!0,or:!0,not:!0},ne={true:!0,false:!1,null:null,undefined:void 0},C=[`NaN`,`Infinity`],w={'"':`"`,"'":`'`,"\\":`\\`,"/":`/`,b:`\b`,f:`\f`,n:` -`,r:`\r`,t:` `};function re(){return{extraNodes:{},expression:``,comment:``,index:0,token:``,tokenType:S.NULL,nestingLevel:0,conditionalLevel:null}}function T(e,t){return e.expression.substr(e.index,t)}function E(e){return T(e,1)}function D(e){e.index++}function O(e){return e.expression.charAt(e.index-1)}function k(e){return e.expression.charAt(e.index+1)}function A(e){for(e.tokenType=S.NULL,e.token=``,e.comment=``;;){if(E(e)===`#`)for(;E(e)!==` -`&&E(e)!==``;)e.comment+=E(e),D(e);if(b.isWhitespace(E(e),e.nestingLevel))D(e);else break}if(E(e)===``){e.tokenType=S.DELIMITER;return}if(E(e)===` -`&&!e.nestingLevel){e.tokenType=S.DELIMITER,e.token=E(e),D(e);return}var t=E(e),n=T(e,2),r=T(e,3);if(r.length===3&&ee[r]){e.tokenType=S.DELIMITER,e.token=r,D(e),D(e),D(e);return}if(n.length===2&&ee[n]&&(n!==`?.`||!b.isDigit(e.expression.charAt(e.index+2)))){e.tokenType=S.DELIMITER,e.token=n,D(e),D(e);return}if(ee[t]){e.tokenType=S.DELIMITER,e.token=t,D(e);return}if(b.isDigitDot(t)){e.tokenType=S.NUMBER;var i=T(e,2);if(i===`0b`||i===`0o`||i===`0x`){for(e.token+=E(e),D(e),e.token+=E(e),D(e);b.isAlpha(E(e),O(e),k(e))||b.isDigit(E(e));)e.token+=E(e),D(e);if(E(e)===`.`)for(e.token+=`.`,D(e);b.isAlpha(E(e),O(e),k(e))||b.isDigit(E(e));)e.token+=E(e),D(e);else if(E(e)===`i`)for(e.token+=`i`,D(e);b.isDigit(E(e));)e.token+=E(e),D(e);return}if(E(e)===`.`){if(e.token+=E(e),D(e),!b.isDigit(E(e))){e.tokenType=S.DELIMITER;return}}else{for(;b.isDigit(E(e));)e.token+=E(e),D(e);b.isDecimalMark(E(e),k(e))&&(e.token+=E(e),D(e))}for(;b.isDigit(E(e));)e.token+=E(e),D(e);if(E(e)===`E`||E(e)===`e`){if(b.isDigit(k(e))||k(e)===`-`||k(e)===`+`){if(e.token+=E(e),D(e),(E(e)===`+`||E(e)===`-`)&&(e.token+=E(e),D(e)),!b.isDigit(E(e)))throw U(e,`Digit expected, got "`+E(e)+`"`);for(;b.isDigit(E(e));)e.token+=E(e),D(e);if(b.isDecimalMark(E(e),k(e)))throw U(e,`Digit expected, got "`+E(e)+`"`)}else if(b.isDecimalMark(k(e),e.expression.charAt(e.index+2)))throw D(e),U(e,`Digit expected, got "`+E(e)+`"`)}return}if(b.isAlpha(E(e),O(e),k(e))){for(;b.isAlpha(E(e),O(e),k(e))||b.isDigit(E(e));)e.token+=E(e),D(e);H(te,e.token)?e.tokenType=S.DELIMITER:e.tokenType=S.SYMBOL;return}for(e.tokenType=S.UNKNOWN;E(e)!==``;)e.token+=E(e),D(e);throw U(e,`Syntax error in part "`+e.token+`"`)}function j(e){do A(e);while(e.token===` -`)}function ie(e){e.nestingLevel++}function M(e){e.nestingLevel--}b.isAlpha=function(e,t,n){return b.isValidLatinOrGreek(e)||b.isValidMathSymbol(e,n)||b.isValidMathSymbol(t,e)},b.isValidLatinOrGreek=function(e){return/^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(e)},b.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)},b.isWhitespace=function(e,t){return e===` `||e===` `||e===`\xA0`||e===` -`&&t>0},b.isDecimalMark=function(e,t){return e===`.`&&t!==`/`&&t!==`*`&&t!==`^`},b.isDigitDot=function(e){return e>=`0`&&e<=`9`||e===`.`},b.isDigit=function(e){return e>=`0`&&e<=`9`};function ae(e,t){var n=re();d(n,{expression:e,extraNodes:t}),A(n);var r=oe(n);if(n.token!==``)throw n.tokenType===S.DELIMITER?Le(n,`Unexpected operator `+n.token):U(n,`Unexpected part "`+n.token+`"`);return r}function oe(e){var t,n=[],r;for(e.token!==``&&e.token!==` -`&&e.token!==`;`&&(t=N(e),e.comment&&(t.comment=e.comment));e.token===` -`||e.token===`;`;)n.length===0&&t&&(r=e.token!==`;`,n.push({node:t,visible:r})),A(e),e.token!==` -`&&e.token!==`;`&&e.token!==``&&(t=N(e),e.comment&&(t.comment=e.comment),r=e.token!==`;`,n.push({node:t,visible:r}));return n.length>0?new s(n):(t||(t=new l(void 0),e.comment&&(t.comment=e.comment)),t)}function N(e){var t,n,r,i,a=se(e);if(e.token===`=`){if(V(a))return t=a.name,j(e),r=N(e),new o(new y(t),r);if(L(a)){if(a.optionalChaining)throw U(e,`Cannot assign to optional chain`);return j(e),r=N(e),new o(a.object,a.index,r)}else if(xe(a)&&V(a.fn)&&(i=!0,n=[],t=a.name,a.args.forEach(function(e,t){V(e)?n[t]=e.name:i=!1}),i))return j(e),r=N(e),new u(t,n,r);throw U(e,`Invalid left hand side of assignment operator =`)}return a}function se(e){for(var t=ce(e);e.token===`?`;){var n=e.conditionalLevel;e.conditionalLevel=e.nestingLevel,j(e);var r=t,i=N(e);if(e.token!==`:`)throw U(e,`False part of conditional expression expected`);e.conditionalLevel=null,j(e),t=new c(r,i,N(e)),e.conditionalLevel=n}return t}function ce(e){for(var t=le(e);e.token===`or`;)j(e),t=new h(`or`,`or`,[t,le(e)]);return t}function le(e){for(var t=ue(e);e.token===`xor`;)j(e),t=new h(`xor`,`xor`,[t,ue(e)]);return t}function ue(e){for(var t=de(e);e.token===`and`;)j(e),t=new h(`and`,`and`,[t,de(e)]);return t}function de(e){for(var t=P(e);e.token===`|`;)j(e),t=new h(`|`,`bitOr`,[t,P(e)]);return t}function P(e){for(var t=F(e);e.token===`^|`;)j(e),t=new h(`^|`,`bitXor`,[t,F(e)]);return t}function F(e){for(var t=fe(e);e.token===`&`;)j(e),t=new h(`&`,`bitAnd`,[t,fe(e)]);return t}function fe(e){for(var t=[pe(e)],n=[],r={"==":`equal`,"!=":`unequal`,"<":`smaller`,">":`larger`,"<=":`smallerEq`,">=":`largerEq`};H(r,e.token);){var i={name:e.token,fn:r[e.token]};n.push(i),j(e),t.push(pe(e))}return t.length===1?t[0]:t.length===2?new h(n[0].name,n[0].fn,t):new v(n.map(e=>e.fn),t)}function pe(e){for(var t=I(e),n,r,i,a={"<<":`leftShift`,">>":`rightArithShift`,">>>":`rightLogShift`};H(a,e.token);)n=e.token,r=a[n],j(e),i=[t,I(e)],t=new h(n,r,i);return t}function I(e){for(var t=me(e),n,r,i,a={to:`to`,in:`to`};H(a,e.token);)n=e.token,r=a[n],j(e),n===`in`&&`])},;`.includes(e.token)?t=new h(`*`,`multiply`,[t,new y(`in`)],!0):(i=[t,me(e)],t=new h(n,r,i));return t}function me(e){var t,n=[];if(t=e.token===`:`?new l(1):he(e),e.token===`:`&&e.conditionalLevel!==e.nestingLevel){for(n.push(t);e.token===`:`&&n.length<3;)j(e),e.token===`)`||e.token===`]`||e.token===`,`||e.token===``?n.push(new y(`end`)):n.push(he(e));t=n.length===3?new _(n[0],n[2],n[1]):new _(n[0],n[1])}return t}function he(e){for(var t=ge(e),n,r,i,a={"+":`add`,"-":`subtract`};H(a,e.token);){n=e.token,r=a[n],j(e);var o=ge(e);i=o.isPercentage?[t,new h(`*`,`multiply`,[t,o])]:[t,o],t=new h(n,r,i)}return t}function ge(e){for(var t=_e(e),n=t,r,i,a={"*":`multiply`,".*":`dotMultiply`,"/":`divide`,"./":`dotDivide`,"%":`mod`,mod:`mod`};H(a,e.token);)r=e.token,i=a[r],j(e),n=_e(e),t=new h(r,i,[t,n]);return t}function _e(e){for(var t=ve(e),n=t;e.tokenType===S.SYMBOL||e.token===`in`&&R(t)||e.token===`in`&&Ce(t)&&t.fn===`unaryMinus`&&R(t.args[0])||e.tokenType===S.NUMBER&&!R(n)&&(!Ce(n)||n.op===`!`)||e.token===`(`;)n=ve(e),t=new h(`*`,`multiply`,[t,n],!0);return t}function ve(e){for(var t=be(e),n=t,r=[];e.token===`/`&&ye(n);)if(r.push(d({},e)),j(e),e.tokenType===S.NUMBER)if(r.push(d({},e)),j(e),e.tokenType===S.SYMBOL||e.token===`(`||e.token===`in`)d(e,r.pop()),r.pop(),n=be(e),t=new h(`/`,`divide`,[t,n]);else{r.pop(),d(e,r.pop());break}else{d(e,r.pop());break}return t}function be(e){var t=z(e);if(e.token===`%`){var n=d({},e);j(e);try{z(e),d(e,n)}catch{t=new h(`/`,`divide`,[t,new l(100)],!1,!0)}}return t}function z(e){var t,n,r,i={"-":`unaryMinus`,"+":`unaryPlus`,"~":`bitNot`,not:`not`};return H(i,e.token)?(r=i[e.token],t=e.token,j(e),n=[z(e)],new h(t,r,n)):B(e)}function B(e){var t=Se(e),n,r,i;return(e.token===`^`||e.token===`.^`)&&(n=e.token,r=n===`^`?`pow`:`dotPow`,j(e),i=[t,z(e)],t=new h(n,r,i)),t}function Se(e){for(var t=we(e);e.token===`??`;)j(e),t=new h(`??`,`nullish`,[t,we(e)]);return t}function we(e){for(var t=Te(e),n,r,i,a={"!":`factorial`,"'":`ctranspose`};H(a,e.token);)n=e.token,r=a[n],A(e),i=[t],t=new h(n,r,i),t=De(e,t);return t}function Te(e){var t=[];if(e.tokenType===S.SYMBOL&&H(e.extraNodes,e.token)){var n=e.extraNodes[e.token];if(A(e),e.token===`(`){if(t=[],ie(e),A(e),e.token!==`)`)for(t.push(N(e));e.token===`,`;)A(e),t.push(N(e));if(e.token!==`)`)throw U(e,`Parenthesis ) expected`);M(e),A(e)}return new n(t)}return Ee(e)}function Ee(e){var t,r;return e.tokenType===S.SYMBOL||e.tokenType===S.DELIMITER&&e.token in te?(r=e.token,A(e),t=H(ne,r)?new l(ne[r]):C.includes(r)?new l(n(r,`number`)):new y(r),t=De(e,t),t):Oe(e)}function De(e,t,n){for(var r;;){var a=!1;e.token===`?.`&&(a=!0,A(e));var o=(e.token===`(`||e.token===`[`||e.token===`.`)&&(!n||n.includes(e.token));if(!(a||o))break;if(r=[],e.token===`(`)if(a||V(t)||L(t)){if(ie(e),A(e),e.token!==`)`)for(r.push(N(e));e.token===`,`;)A(e),r.push(N(e));if(e.token!==`)`)throw U(e,`Parenthesis ) expected`);M(e),A(e),t=new f(t,r,a)}else return t;else if(e.token===`[`){if(ie(e),A(e),e.token!==`]`)for(r.push(N(e));e.token===`,`;)A(e),r.push(N(e));if(e.token!==`]`)throw U(e,`Parenthesis ] expected`);M(e),A(e),t=new i(t,new p(r),a)}else{if(a||A(e),!(e.tokenType===S.SYMBOL||e.tokenType===S.DELIMITER&&e.token in te)){var s=`Property name expected after `;throw s+=a?`optional chain`:`dot`,U(e,s)}r.push(new l(e.token)),A(e),t=new i(t,new p(r,!0),a)}}return t}function Oe(e){var t,n;return e.token===`"`||e.token===`'`?(n=ke(e,e.token),t=new l(n),t=De(e,t),t):Ae(e)}function ke(e,t){for(var n=``;E(e)!==``&&E(e)!==t;)if(E(e)===`\\`){D(e);var r=E(e),i=w[r];if(i!==void 0)n+=i,e.index+=1;else if(r===`u`){var a=e.expression.slice(e.index+1,e.index+5);if(/^[0-9A-Fa-f]{4}$/.test(a))n+=String.fromCharCode(parseInt(a,16)),e.index+=5;else throw U(e,`Invalid unicode character \\u${a}`)}else throw U(e,`Bad escape character \\${r}`)}else n+=E(e),D(e);if(A(e),e.token!==t)throw U(e,`End of string ${t} expected`);return A(e),n}function Ae(e){var t,n,r,i;if(e.token===`[`){if(ie(e),A(e),e.token!==`]`){var o=je(e);if(e.token===`;`){for(r=1,n=[o];e.token===`;`;)A(e),e.token!==`]`&&(n[r]=je(e),r++);if(e.token!==`]`)throw U(e,`End of matrix ] expected`);M(e),A(e),i=n[0].items.length;for(var s=1;s{var{typed:t,parse:n}=e;return t(Rr,{string:function(e){var t=te();return n(e).compile().evaluate(t)},"string, Map | Object":function(e,t){return n(e).compile().evaluate(t)},"Array | Matrix":function(e){var t=te();return Pn(e,function(e){return n(e).compile().evaluate(t)})},"Array | Matrix, Map | Object":function(e,t){return Pn(e,function(e){return n(e).compile().evaluate(t)})}})}),Br=`size`,Vr=K(Br,[`typed`],e=>{var{typed:t}=e;return t(Br,{Matrix:e=>e.size(),Array:kn,string:e=>[e.length],"number | Complex | BigNumber | Unit | boolean | null":e=>[]})}),Hr=`factorial`,Ur=K(Hr,[`typed`,`gamma`],e=>{var{typed:t,gamma:n}=e;return t(Hr,{number:function(e){if(e<0)throw Error(`Value must be non-negative`);return n(e+1)},BigNumber:function(e){if(e.isNegative())throw Error(`Value must be non-negative`);return n(e.plus(1))},"Array | Matrix":t.referToSelf(e=>t=>Pn(t,e))})}),Wr=`isBounded`,Gr=K(Wr,[`typed`],e=>{var{typed:t}=e;return t(Wr,{number:e=>Number.isFinite(e),"BigNumber | Complex":e=>e.isFinite(),"bigint | Fraction":()=>!0,"null | undefined":()=>!1,Unit:t.referToSelf(e=>t=>e(t.value)),"Array | Matrix":t.referToSelf(e=>t=>(Array.isArray(t)||(t=t.valueOf()),t.every(t=>e(t))))})}),Kr=K(`numeric`,[`number`,`?bignumber`,`?fraction`],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):Jt,bigint:e=>BigInt(e),Fraction:r?e=>r(e):Yt};return function(e){var t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:`number`;if((arguments.length>2?arguments[2]:void 0)!==void 0)throw SyntaxError(`numeric() takes one or two arguments`);var n=Oe(e);if(!(n in i))throw TypeError(`Cannot convert `+e+` of type "`+n+`"; valid input types are `+Object.keys(i).join(`, `));if(!(t in a))throw TypeError(`Cannot convert `+e+` to type "`+t+`"; valid output types are `+Object.keys(a).join(`, `));return t===n?e:a[t](e)}}),qr=Z(`abs`,ct),Jr=Z(`exp`,_t),Yr=Z(`gcd`,yt),Xr=Z(`lcm`,bt),Zr=Z(`log10`,St),Qr=Z(`log2`,Ct),$r=Z(`mod`,Tt),ei=Z(`multiply`,dt),ti=mi(`nthRoot`,Et),ni=Z(`sign`,Dt),ri=Z(`sqrt`,Ot),ii=Z(`subtract`,ut),ai=Z(`pow`,jt),oi=mi(`round`,Mt),si=mi(`log`,xt),ci=Z(`log1p`,wt),li=Z(`add`,lt),ui=Z(`divide`,ft),di=K(`matrix`,[],()=>Xt),fi=K(`subset`,[],()=>Zt);Z(`combinations`,Ft);var pi=Z(`gamma`,Rt);Z(`lgamma`,Ut);function Z(e,t){return K(e,[`typed`],e=>{var{typed:n}=e;return n(t)})}function mi(e,t){return K(e,[`typed`],e=>{var{typed:n}=e;return n({number:t,"number,number":t})})}function hi(e,t,n,r){if(!(this instanceof hi))throw 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+(r==null?``:`-`+r)+` expected)`,this.stack=Error().stack}hi.prototype=Error(),hi.prototype.constructor=Error,hi.prototype.name=`ArgumentsError`,hi.prototype.isArgumentsError=!0;var Q={createTyped:tn},gi={typedDependencies:Q,createAbs:qr},$={createNode:Yn},_i={createSubset:fi},vi={NodeDependencies:$,subsetDependencies:_i,createAccessorNode:$n},yi={typedDependencies:Q,createAdd:li},bi={NodeDependencies:$,createArrayNode:tr},xi={matrixDependencies:{createMatrix:di},NodeDependencies:$,subsetDependencies:_i,createAssignmentNode:ir},Si={gammaDependencies:{typedDependencies:Q,createGamma:pi},typedDependencies:Q,createFactorial:Ur},Ci={typedDependencies:Q,createNumber:qn},wi={typedDependencies:Q,createPow:ai},Ti={NodeDependencies:$,ResultSetDependencies:{createResultSet:sn},createBlockNode:or},Ei={typedDependencies:Q,createRound:oi},Di={NodeDependencies:$,createConditionalNode:cr},Oi={NodeDependencies:$,isBoundedDependencies:{typedDependencies:Q,createIsBounded:Gr},createConstantNode:_r},ki={NodeDependencies:$,typedDependencies:Q,createFunctionAssignmentNode:yr},Ai={NodeDependencies:$,createSymbolNode:Nr},ji={AccessorNodeDependencies:vi,ArrayNodeDependencies:bi,AssignmentNodeDependencies:xi,BlockNodeDependencies:Ti,ConditionalNodeDependencies:Di,ConstantNodeDependencies:Oi,FunctionAssignmentNodeDependencies:ki,FunctionNodeDependencies:{NodeDependencies:$,SymbolNodeDependencies:Ai,createFunctionNode:Fr},IndexNodeDependencies:{NodeDependencies:$,sizeDependencies:{typedDependencies:Q,createSize:Vr},createIndexNode:xr},ObjectNodeDependencies:{NodeDependencies:$,createObjectNode:Cr},OperatorNodeDependencies:{NodeDependencies:$,createOperatorNode:Er},ParenthesisNodeDependencies:{NodeDependencies:$,createParenthesisNode:Or},RangeNodeDependencies:{NodeDependencies:$,createRangeNode:Ar},RelationalNodeDependencies:{NodeDependencies:$,createRelationalNode:Mr},SymbolNodeDependencies:Ai,numericDependencies:{numberDependencies:Ci,createNumeric:Kr},typedDependencies:Q,createParse:Lr},Mi={typedDependencies:Q,createDivide:ui},Ni={typedDependencies:Q,createMultiply:ei},Pi={typedDependencies:Q,createSqrt:ri},Fi={typedDependencies:Q,createSubtract:ii},Ii={createE:Vn},Li={parseDependencies:ji,typedDependencies:Q,createEvaluate:zr},Ri={typedDependencies:Q,createExp:Jr},zi={typedDependencies:Q,createGcd:Yr},Bi={typedDependencies:Q,createLcm:Xr},Vi={typedDependencies:Q,createLog:si},Hi={typedDependencies:Q,createLog10:Zr},Ui={typedDependencies:Q,createLog1p:ci},Wi={typedDependencies:Q,createLog2:Qr},Gi={typedDependencies:Q,createMod:$r},Ki={typedDependencies:Q,createNthRoot:ti},qi={createPi:Bn},Ji={typedDependencies:Q,createSign:ni},Yi=u(c(((e,t)=>{function n(){}n.prototype={on:function(e,t,n){var r=this.e||={};return(r[e]||(r[e]=[])).push({fn:t,ctx:n}),this},once:function(e,t,n){var r=this;function i(){r.off(e,i),t.apply(n,arguments)}return i._=t,this.on(e,i,n)},emit:function(e){for(var t=[].slice.call(arguments,1),n=((this.e||={})[e]||[]).slice(),r=0,i=n.length;rr(e,t));else if(P(n)||d(n))for(var a in n)H(n,a)&&r(e,n[a],a);else if(Wt(n)||i!==void 0){var o=Wt(n)?h(n)?n.fn+`.transform`:n.fn:i;if(H(e,o)&&e[o]!==n&&!t.silent)throw Error(`Cannot import "`+o+`" twice`);e[o]=n}else if(!t.silent)throw TypeError(`Factory, Object, or Array expected`)}var i={};for(var o in r(i,e),i)if(H(i,o)){var s=i[o];if(Wt(s))l(s,t);else if(u(s))a(o,s,t);else if(!t.silent)throw TypeError(`Factory, Object, or Array expected`)}}function a(t,i,a){if(a.wrap&&typeof i==`function`&&(i=c(i)),f(i)&&(i=e(t,{[i.signature]:i})),e.isTypedFunction(n[t])&&e.isTypedFunction(i)){i=a.override?e(t,i.signatures):e(n[t],i),n[t]=i,delete r[t],o(t,i),n.emit(`import`,t,function(){return i});return}var s=n[t]!==void 0,l=n.Unit?.isValuelessUnit(t);if(!s&&!l||a.override){n[t]=i,delete r[t],o(t,i),n.emit(`import`,t,function(){return i});return}if(!a.silent)throw Error(`Cannot import "`+t+`": already exists`)}function o(e,t){t&&typeof t.transform==`function`?(n.expression.transform[e]=t.transform,p(e)&&(n.expression.mathWithTransform[e]=t.transform)):(delete n.expression.transform[e],p(e)&&(n.expression.mathWithTransform[e]=t))}function s(e){delete n.expression.transform[e],p(e)?n.expression.mathWithTransform[e]=n[e]:delete n.expression.mathWithTransform[e]}function c(e){var t=function(){for(var t=[],r=0,i=arguments.length;r2&&arguments[2]!==void 0?arguments[2]:t.fn;if(a.includes(`.`))throw Error(`Factory name should not contain a nested path. Name: `+JSON.stringify(a));var o=h(t)?n.expression.transform:n,c=a in n.expression.transform,l=H(o,a)?o[a]:void 0,u=function(){var r={};t.dependencies.map(qt).forEach(e=>{if(e.includes(`.`))throw Error(`Factory dependency should not contain a nested path. Name: `+JSON.stringify(e));e===`math`?r.math=n:e===`mathWithTransform`?r.mathWithTransform=n.expression.mathWithTransform:e===`classes`?r.classes=n:r[e]=n[e]});var o=t(r);if(o&&typeof o.transform==`function`)throw Error(`Transforms cannot be attached to factory functions. Please create a separate function for it with export const path = "expression.transform"`);if(l===void 0||i.override)return o;if(e.isTypedFunction(l)&&e.isTypedFunction(o))return e(l,o);if(i.silent)return l;throw Error(`Cannot import "`+a+`": already exists`)},d=t.meta?.formerly??``,f=h(t)||m(t),p=n.expression.mathWithTransform;!t.meta||t.meta.lazy!==!1?(Fe(o,a,u),d&&Fe(o,d,u),l&&c?(s(a),d&&s(d)):f&&(Fe(p,a,()=>o[a]),d&&Fe(p,d,()=>o[a]))):(o[a]=u(),d&&(o[d]=o[a]),l&&c?(s(a),d&&s(d)):f&&(Fe(p,a,()=>o[a]),d&&Fe(p,d,()=>o[a]))),r[a]=t,n.emit(`import`,a,u)}function u(e){return typeof e==`function`||typeof e==`number`||typeof e==`string`||typeof e==`boolean`||e===null||D(e)||T(e)||w(e)||E(e)||A(e)||Array.isArray(e)}function d(e){return typeof e==`object`&&e[Symbol.toStringTag]===`Module`}function f(e){return typeof e==`function`&&typeof e.signature==`string`}function p(e){return!H(g,e)}function m(e){return!e.fn.includes(`.`)&&!H(g,e.fn)&&(!e.meta||!e.meta.isClass)}function h(e){return e!==void 0&&e.meta!==void 0&&e.meta.isTransformFunction===!0||!1}var g={expression:!0,type:!0,docs:!0,error:!0,json:!0,chain:!0};return i}var Qi=u(Qt(),1);function $i(e,t){var n=d({},f,t);if(typeof Object.create!=`function`)throw Error(`ES5 not supported by this JavaScript engine. Please load the es5-shim and es5-sham library for compatibility.`);var r=Xi({isNumber:C,isComplex:T,isBigNumber:w,isBigInt:re,isFraction:E,isUnit:D,isString:O,isArray:k,isMatrix:A,isCollection:j,isDenseMatrix:ie,isSparseMatrix:M,isRange:ae,isIndex:oe,isBoolean:N,isResultSet:se,isHelp:ce,isFunction:le,isDate:ue,isRegExp:de,isObject:P,isMap:F,isPartitionedMap:fe,isObjectWrappingMap:pe,isNull:I,isUndefined:me,isAccessorNode:L,isArrayNode:he,isAssignmentNode:ge,isBlockNode:_e,isConditionalNode:ve,isConstantNode:R,isFunctionAssignmentNode:be,isFunctionNode:xe,isIndexNode:z,isNode:B,isObjectNode:Se,isOperatorNode:Ce,isParenthesisNode:we,isRangeNode:Te,isRelationalNode:Ee,isSymbolNode:V,isChain:De});r.config=ze(n,r.emit),r.expression={transform:{},mathWithTransform:{config:r.config}};var i=[],a=[];function o(e){if(Wt(e))return e(r);var t=e[Object.keys(e)[0]];if(Wt(t))return t(r);if(!Ie(e))throw console.warn("Factory object with properties `type`, `name`, and `factory` expected",e),Error("Factory object with properties `type`, `name`, and `factory` expected");var s=i.indexOf(e),c;return s===-1?(c=e.math===!0?e.factory(r.type,n,o,r.typed,r):e.factory(r.type,n,o,r.typed),i.push(e),a.push(c)):c=a[s],c}var s={};function c(){var e=[...arguments];return r.typed.apply(r.typed,e)}c.isTypedFunction=Qi.default.isTypedFunction;var l=Zi(c,o,r,s);return r.import=l,r.on(`config`,()=>{Object.values(s).forEach(e=>{e&&e.meta&&e.meta.recreateOnConfigChange&&l(e,{override:!0})})}),r.create=$i.bind(null,e),r.factory=K,r.import(Object.values(Ne(e))),r.ArgumentsError=hi,r.DimensionError=On,r.IndexError=Dn,r}const ea=e=>{let n=t(`results`),r=t(`answers`,{assert:!1});if(!r){let e=document.createElement(`h4`);e.setAttribute(`class`,`title`),e.setAttribute(`id`,`answers-title`),e.textContent=`Answers : `,r=document.createElement(`div`),r.setAttribute(`id`,`answers`),r.setAttribute(`role`,`complementary`),r.setAttribute(`aria-labelledby`,`answers-title`),r.appendChild(e)}if(!(e instanceof HTMLElement)){let t=document.createElement(`span`);t.innerHTML=e.toString(),e=t}r.appendChild(e),n.insertAdjacentElement(`afterbegin`,r)};var ta=class n extends e{constructor(){super(`calculator`)}static math=$i({...gi,...yi,...Mi,...Ii,...Li,...Ri,...Si,...zi,...Bi,...Hi,...Ui,...Wi,...Vi,...Gi,...Ni,...Ki,...qi,...wi,...Ei,...Ji,...Pi,...Fi});async run(){let e=t(`q`),r=n.math.parse(e.value);try{return`${r.toString()} = ${r.evaluate()}`}catch{return}}async post(e){ea(e)}};export{ta as default}; -//# sourceMappingURL=CEKii0mQ.min.js.map \ No newline at end of file diff --git a/searx/static/themes/simple/chunk/CGazvOKw.min.js b/searx/static/themes/simple/chunk/CGazvOKw.min.js new file mode 100644 index 000000000..72a31f020 --- /dev/null +++ b/searx/static/themes/simple/chunk/CGazvOKw.min.js @@ -0,0 +1,15 @@ +import{a as e}from"../sxng-core.min.js";import{t}from"./gZqIRpW1.min.js";var n=Object.create,r=Object.defineProperty,i=Object.getOwnPropertyDescriptor,a=Object.getOwnPropertyNames,o=Object.getPrototypeOf,s=Object.prototype.hasOwnProperty,c=(e,t)=>()=>(t||e((t={exports:{}}).exports,t),t.exports),l=(e,t,n,o)=>{if(t&&typeof t==`object`||typeof t==`function`)for(var c=a(t),l=0,u=c.length,d;lt[e]).bind(null,d),enumerable:!(o=i(t,d))||o.enumerable});return e},u=(e,t,i)=>(i=e==null?{}:n(o(e)),l(t||!e||!e.__esModule?r(i,`default`,{value:e,enumerable:!0}):i,e));function d(){return d=Object.assign?Object.assign.bind():function(e){for(var t=1;tthis.has(e)).values()}get(e){return p(this.wrappedObject,e)}set(e,t){return m(this.wrappedObject,e,t),this}has(e){return h(this.wrappedObject,e)&&e in this.wrappedObject}entries(){return ee(this.keys(),e=>[e,this.get(e)])}forEach(e){for(var t of this.keys())e(this.get(t),t,this)}delete(e){h(this.wrappedObject,e)&&delete this.wrappedObject[e]}clear(){for(var e of this.keys())this.delete(e)}get size(){return Object.keys(this.wrappedObject).length}},S=class{constructor(e,t,n){this.a=e,this.b=t,this.bKeys=n,this[Symbol.iterator]=this.entries}get(e){return this.bKeys.has(e)?this.b.get(e):this.a.get(e)}set(e,t){return this.bKeys.has(e)?this.b.set(e,t):this.a.set(e,t),this}has(e){return this.b.has(e)||this.a.has(e)}keys(){return new Set([...this.a.keys(),...this.b.keys()])[Symbol.iterator]()}entries(){return ee(this.keys(),e=>[e,this.get(e)])}forEach(e){for(var t of this.keys())e(this.get(t),t,this)}delete(e){return this.bKeys.has(e)?this.b.delete(e):this.a.delete(e)}clear(){this.a.clear(),this.b.clear()}get size(){return[...this.keys()].length}};function ee(e,t){return{next:()=>{var n=e.next();return n.done?n:{value:t(n.value),done:!1}}}}function te(){return new Map}function ne(e){if(!e)return te();if(F(e))return e;if(P(e))return new x(e);throw Error(`createMap can create maps from objects or Maps`)}function C(e){return typeof e==`number`}function w(e){return!e||typeof e!=`object`||typeof e.constructor!=`function`?!1:e.isBigNumber===!0&&typeof e.constructor.prototype==`object`&&e.constructor.prototype.isBigNumber===!0||typeof e.constructor.isDecimal==`function`&&e.constructor.isDecimal(e)===!0}function re(e){return typeof e==`bigint`}function T(e){return e&&typeof e==`object`&&Object.getPrototypeOf(e).isComplex===!0||!1}function E(e){return e&&typeof e==`object`&&Object.getPrototypeOf(e).isFraction===!0||!1}function D(e){return e&&e.constructor.prototype.isUnit===!0||!1}function O(e){return typeof e==`string`}var k=Array.isArray;function A(e){return e&&e.constructor.prototype.isMatrix===!0||!1}function j(e){return Array.isArray(e)||A(e)}function ie(e){return e&&e.isDenseMatrix&&e.constructor.prototype.isMatrix===!0||!1}function M(e){return e&&e.isSparseMatrix&&e.constructor.prototype.isMatrix===!0||!1}function ae(e){return e&&e.constructor.prototype.isRange===!0||!1}function oe(e){return e&&e.constructor.prototype.isIndex===!0||!1}function N(e){return typeof e==`boolean`}function se(e){return e&&e.constructor.prototype.isResultSet===!0||!1}function ce(e){return e&&e.constructor.prototype.isHelp===!0||!1}function le(e){return typeof e==`function`}function ue(e){return e instanceof Date}function de(e){return e instanceof RegExp}function P(e){return!!(e&&typeof e==`object`&&e.constructor===Object&&!T(e)&&!E(e))}function F(e){return e?e instanceof Map||e instanceof x||typeof e.set==`function`&&typeof e.get==`function`&&typeof e.keys==`function`&&typeof e.has==`function`:!1}function fe(e){return F(e)&&F(e.a)&&F(e.b)}function pe(e){return F(e)&&P(e.wrappedObject)}function I(e){return e===null}function me(e){return e===void 0}function L(e){return e&&e.isAccessorNode===!0&&e.constructor.prototype.isNode===!0||!1}function he(e){return e&&e.isArrayNode===!0&&e.constructor.prototype.isNode===!0||!1}function ge(e){return e&&e.isAssignmentNode===!0&&e.constructor.prototype.isNode===!0||!1}function _e(e){return e&&e.isBlockNode===!0&&e.constructor.prototype.isNode===!0||!1}function ve(e){return e&&e.isConditionalNode===!0&&e.constructor.prototype.isNode===!0||!1}function R(e){return e&&e.isConstantNode===!0&&e.constructor.prototype.isNode===!0||!1}function ye(e){return R(e)||Ce(e)&&e.args.length===1&&R(e.args[0])&&`-+~`.includes(e.op)}function be(e){return e&&e.isFunctionAssignmentNode===!0&&e.constructor.prototype.isNode===!0||!1}function xe(e){return e&&e.isFunctionNode===!0&&e.constructor.prototype.isNode===!0||!1}function z(e){return e&&e.isIndexNode===!0&&e.constructor.prototype.isNode===!0||!1}function B(e){return e&&e.isNode===!0&&e.constructor.prototype.isNode===!0||!1}function Se(e){return e&&e.isObjectNode===!0&&e.constructor.prototype.isNode===!0||!1}function Ce(e){return e&&e.isOperatorNode===!0&&e.constructor.prototype.isNode===!0||!1}function we(e){return e&&e.isParenthesisNode===!0&&e.constructor.prototype.isNode===!0||!1}function Te(e){return e&&e.isRangeNode===!0&&e.constructor.prototype.isNode===!0||!1}function Ee(e){return e&&e.isRelationalNode===!0&&e.constructor.prototype.isNode===!0||!1}function V(e){return e&&e.isSymbolNode===!0&&e.constructor.prototype.isNode===!0||!1}function De(e){return e&&e.constructor.prototype.isChain===!0||!1}function Oe(e){var t=typeof e;return t===`object`?e===null?`null`:w(e)?`BigNumber`:e.constructor&&e.constructor.name?e.constructor.name:`Object`:t}function ke(e){var t=typeof e;if(t===`number`||t===`bigint`||t===`string`||t===`boolean`||e==null)return e;if(typeof e.clone==`function`)return e.clone();if(Array.isArray(e))return e.map(function(e){return ke(e)});if(e instanceof Date)return new Date(e.valueOf());if(w(e))return e;if(P(e))return Ae(e,ke);if(t===`function`)return e;throw TypeError(`Cannot clone: unknown type of value (value: ${e})`)}function Ae(e,t){var n={};for(var r in e)H(e,r)&&(n[r]=t(e[r]));return n}function je(e,t){if(Array.isArray(t))throw TypeError(`Arrays are not supported by deepExtend`);for(var n in t)if(H(t,n)&&!(n in Object.prototype)&&!(n in Function.prototype))if(t[n]&&t[n].constructor===Object)e[n]===void 0&&(e[n]={}),e[n]&&e[n].constructor===Object?je(e[n],t[n]):e[n]=t[n];else if(Array.isArray(t[n]))throw TypeError(`Arrays are not supported by deepExtend`);else e[n]=t[n];return e}function Me(e,t){var n,r,i;if(Array.isArray(e)){if(!Array.isArray(t)||e.length!==t.length)return!1;for(r=0,i=e.length;r{Object.defineProperty(n,t,{get:()=>e[t],enumerable:!0,configurable:!0})}),n}function Be(e,t,n){e[t]!==void 0&&!n.includes(e[t])&&console.warn(`Warning: Unknown value "`+e[t]+`" for configuration option "`+t+`". Available options: `+n.map(e=>JSON.stringify(e)).join(`, `)+`.`)}function W(e){return typeof e==`boolean`?!0:Number.isFinite(e)?e===Math.round(e):!1}function Ve(e,t){if(t.number===`bigint`)try{BigInt(e)}catch{return t.numberFallback}return t.number}var He=Math.sign||function(e){return e>0?1:e<0?-1:0},Ue=Math.log2||function(e){return Math.log(e)/Math.LN2},We=Math.log10||function(e){return Math.log(e)/Math.LN10},Ge=Math.log1p||function(e){return Math.log(e+1)},Ke=Math.cbrt||function(e){if(e===0)return e;var t=e<0,n;return t&&(e=-e),Number.isFinite(e)?(n=Math.exp(Math.log(e)/3),n=(e/(n*n)+2*n)/3):n=e,t?-n:n},qe=Math.expm1||function(e){return e>=2e-4||e<=-2e-4?Math.exp(e)-1:e+e*e/2+e*e*e/6};function Je(e,t,n){var r={2:`0b`,8:`0o`,16:`0x`}[t],i=``;if(n){if(n<1)throw Error(`size must be in greater than 0`);if(!W(n))throw Error(`size must be an integer`);if(e>2**(n-1)-1||e<-(2**(n-1)))throw Error(`Value must be in range [-2^${n-1}, 2^${n-1}-1]`);if(!W(e))throw Error(`Value must be an integer`);e<0&&(e+=2**n),i=`i${n}`}var a=``;return e<0&&(e=-e,a=`-`),`${a}${r}${e.toString(t)}${i}`}function Ye(e,t){if(typeof t==`function`)return t(e);if(e===1/0)return`Infinity`;if(e===-1/0)return`-Infinity`;if(isNaN(e))return`NaN`;var{notation:n,precision:r,wordSize:i}=Xe(t);switch(n){case`fixed`:return $e(e,r);case`exponential`:return et(e,r);case`engineering`:return Qe(e,r);case`bin`:return Je(e,2,i);case`oct`:return Je(e,8,i);case`hex`:return Je(e,16,i);case`auto`:return tt(e,r,t).replace(/((\.\d*?)(0+))($|e)/,function(){var e=arguments[2],t=arguments[4];return e===`.`?t:e+t});default:throw Error(`Unknown notation "`+n+`". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.`)}}function Xe(e){var t=`auto`,n,r;if(e!==void 0)if(C(e))n=e;else if(w(e))n=e.toNumber();else if(P(e))e.precision!==void 0&&(n=at(e.precision,()=>{throw Error(`Option "precision" must be a number or BigNumber`)})),e.wordSize!==void 0&&(r=at(e.wordSize,()=>{throw Error(`Option "wordSize" must be a number or BigNumber`)})),e.notation&&(t=e.notation);else throw Error(`Unsupported type of options, number, BigNumber, or object expected`);return{notation:t,precision:n,wordSize:r}}function Ze(e){var t=String(e).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);if(!t)throw SyntaxError(`Invalid number `+e);var n=t[1],r=t[2],i=parseFloat(t[4]||`0`),a=r.indexOf(`.`);i+=a===-1?r.length-1:a-1;var o=r.replace(`.`,``).replace(/^0*/,function(e){return i-=e.length,``}).replace(/0*$/,``).split(``).map(function(e){return parseInt(e)});return o.length===0&&(o.push(0),i++),{sign:n,coefficients:o,exponent:i}}function Qe(e,t){if(isNaN(e)||!Number.isFinite(e))return String(e);var n=nt(Ze(e),t),r=n.exponent,i=n.coefficients,a=r%3==0?r:r<0?r-3-r%3:r-r%3;if(C(t))for(;t>i.length||r-a+1>i.length;)i.push(0);else for(var o=Math.abs(r-a)-(i.length-1),s=0;s0;)l++,c--;var u=i.slice(l).join(``),d=C(t)&&u.length||u.match(/[1-9]/)?`.`+u:``,f=i.slice(0,l).join(``)+d+`e`+(r>=0?`+`:``)+a.toString();return n.sign+f}function $e(e,t){if(isNaN(e)||!Number.isFinite(e))return String(e);var n=Ze(e),r=typeof t==`number`?nt(n,n.exponent+1+t):n,i=r.coefficients,a=r.exponent+1,o=a+(t||0);return i.length0?`.`+i.join(``):``)+`e`+(a>=0?`+`:``)+a}function tt(e,t,n){if(isNaN(e)||!Number.isFinite(e))return String(e);var r=ot(n?.lowerExp,-3),i=ot(n?.upperExp,5),a=Ze(e),o=t?nt(a,t):a;if(o.exponent=i)return et(e,t);var s=o.coefficients,c=o.exponent;s.length0?c:0;return lt&&r.splice(t,r.length-t)[0]>=5){var i=t-1;for(r[i]++;r[i]===10;)r.pop(),i===0&&(r.unshift(0),n.exponent++,i++),i--,r[i]++}return n}function rt(e){for(var t=[],n=0;n1&&arguments[1]!==void 0?arguments[1]:2,n=t<0;if(n&&(t=-t),t===0)throw Error(`Root must be non-zero`);if(e<0&&Math.abs(t)%2!=1)throw Error(`Root must be odd when a is negative.`);if(e===0)return n?1/0:0;if(!isFinite(e))return n?0:e;var r=Math.abs(e)**(1/t);return r=e<0?-r:r,n?1/r:r}function Dt(e){return He(e)}Dt.signature=G;function Ot(e){return Math.sqrt(e)}Ot.signature=G;function kt(e){return e*e}kt.signature=G;function At(e,t){var n,r,i,a=0,o=1,s=1,c=0;if(!W(e)||!W(t))throw Error(`Parameters in function xgcd must be integer numbers`);for(;t;)r=Math.floor(e/t),i=e-r*t,n=a,a=o-r*a,o=n,n=s,s=c-r*s,c=n,e=t,t=i;return e<0?[-e,-o,-c]:[e,e?o:0,c]}At.signature=st;function jt(e,t){return e*e<1&&t===1/0||e*e>1&&t===-1/0?0:e**+t}jt.signature=st;function Mt(e){var t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:0;if(!W(t)||t<0||t>15)throw Error(`Number of decimals in function round must be an integer from 0 to 15 inclusive`);return parseFloat($e(e,t))}function Nt(e){return Math.abs(e)}Nt.signature=G;function Pt(e,t){if(t>1;return Pt(e,n)*Pt(n+1,t)}function Ft(e,t){if(!W(e)||e<0||!W(t)||t<0)throw TypeError(`Positive integer value expected in function combinations`);if(t>e)throw TypeError(`k must be less than or equal to n`);for(var n=e-t,r=1,i=t171?1/0:Pt(1,e-1);if(e<.5)return Math.PI/(Math.sin(Math.PI*e)*Rt(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)*(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=Bt[0];for(var o=1;o=1;r--)n+=Ht[r]/(e+r);return Vt+(e+.5)*Math.log(t)-t+Math.log(n)}Ut.signature=`number`;function K(e,t,n,r){function i(r){var i=U(r,t.map(qt));return Gt(e,t,r),n(i)}return i.isFactory=!0,i.fn=e,i.dependencies=t.slice().sort(),r&&(i.meta=r),i}function Wt(e){return typeof e==`function`&&typeof e.fn==`string`&&Array.isArray(e.dependencies)}function Gt(e,t,n){if(!t.filter(e=>!Kt(e)).every(e=>n[e]!==void 0)){var r=t.filter(e=>n[e]===void 0);throw Error(`Cannot create function "${e}", some dependencies are missing: ${r.map(e=>`"${e}"`).join(`, `)}.`)}}function Kt(e){return e&&e[0]===`?`}function qt(e){return e&&e[0]===`?`?e.slice(1):e}function Jt(){throw Error(`No "bignumber" implementation available`)}function Yt(){throw Error(`No "fraction" implementation available`)}function Xt(){throw Error(`No "matrix" implementation available`)}function Zt(){throw Error(`No "matrix" implementation available`)}var Qt=c(((e,t)=>{(function(n,r){typeof e==`object`&&t!==void 0?t.exports=r():typeof define==`function`&&define.amd?define(r):(n=typeof globalThis<`u`?globalThis:n||self,n.typed=r())})(e,(function(){function e(){return!0}function t(){return!1}function n(){}let r=`Argument is not a typed-function.`;function i(){function a(e){return typeof e==`object`&&!!e&&e.constructor===Object}let o=[{name:`number`,test:function(e){return typeof e==`number`}},{name:`string`,test:function(e){return typeof e==`string`}},{name:`boolean`,test:function(e){return typeof e==`boolean`}},{name:`Function`,test:function(e){return typeof e==`function`}},{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:a},{name:`null`,test:function(e){return e===null}},{name:`undefined`,test:function(e){return e===void 0}}],s={name:`any`,test:e,isAny:!0},c,l,u=0,d={createCount:0};function f(e){let t=c.get(e);if(t)return t;let n=`Unknown type "`+e+`"`,r=e.toLowerCase(),i;for(i of l)if(i.toLowerCase()===r){n+=`. Did you mean "`+i+`" ?`;break}throw TypeError(n)}function p(e){let t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:`any`,n=t?f(t).index:l.length,r=[];for(let t=0;t{let n=c.get(t);return!n.isAny&&n.test(e)});return t.length?t:[`any`]}function _(e){return e&&typeof e==`function`&&`_typedFunctionData`in e}function v(e,t,n){if(!_(e))throw TypeError(r);let i=n&&n.exact,a=ne(Array.isArray(t)?t.join(`,`):t),o=x(a);if(!i||o in e.signatures){let t=e._typedFunctionData.signatureMap.get(o);if(t)return t}let s=a.length,c;if(i){c=[];let t;for(t in e.signatures)c.push(e._typedFunctionData.signatureMap.get(t))}else c=e._typedFunctionData.signatures;for(let e=0;e!e.has(t.name)))continue}n.push(r)}}if(c=n,c.length===0)break}let l;for(l of c)if(l.params.length<=s)return l;throw TypeError(`Signature not found (signature: `+(e.name||`unnamed`)+`(`+x(a,`, `)+`))`)}function y(e,t,n){return v(e,t,n).implementation}function b(e,t){let n=f(t);if(n.test(e))return e;let r=n.conversionsTo;if(r.length===0)throw Error(`There are no conversions to `+t+` defined.`);for(let t=0;t1&&arguments[1]!==void 0?arguments[1]:`,`;return e.map(e=>e.name).join(t)}function S(e){let t=e.indexOf(`...`)===0,n=(t?e.length>3?e.slice(3):`any`:e).split(`|`).map(e=>f(e.trim())),r=!1,i=t?`...`:``;return{types:n.map(function(e){return r=e.isAny||r,i+=e.name+`|`,{name:e.name,typeIndex:e.index,test:e.test,isAny:e.isAny,conversion:null,conversionIndex:-1}}),name:i.slice(0,-1),hasAny:r,hasConversion:!1,restParam:t}}function ee(e){let t=ae(e.types.map(e=>e.name)),n=e.hasAny,r=e.name,i=t.map(function(e){let t=f(e.from);return n=t.isAny||n,r+=`|`+e.from,{name:e.from,typeIndex:t.index,test:t.test,isAny:t.isAny,conversion:e,conversionIndex:e.index}});return{types:e.types.concat(i),name:r,hasAny:n,hasConversion:i.length>0,restParam:e.restParam}}function te(e){return e.typeSet||(e.typeSet=new Set,e.types.forEach(t=>e.typeSet.add(t.name))),e.typeSet}function ne(e){let t=[];if(typeof e!=`string`)throw TypeError(`Signatures must be strings`);let n=e.trim();if(n===``)return t;let r=n.split(`,`);for(let e=0;e=n+1}}else if(e.length===0)return function(e){return e.length===0};else if(e.length===1)return n=w(e[0]),function(e){return n(e[0])&&e.length===1};else if(e.length===2)return n=w(e[0]),r=w(e[1]),function(e){return n(e[0])&&r(e[1])&&e.length===2};else return t=e.map(w),function(e){for(let n=0;n{let r=E(e.params,t),i;for(i of r)n.add(i)}),n.has(`any`)?[`any`]:Array.from(n)}function k(e,t,n){let r,i,a=e||`unnamed`,o=n,s;for(s=0;s{let r=w(T(n.params,s));(s0){let e=g(t[s]);return r=TypeError(`Unexpected type of argument in function `+a+` (expected: `+i.join(` or `)+`, actual: `+e.join(` | `)+`, index: `+s+`)`),r.data={category:`wrongType`,fn:a,index:s,actual:e,expected:i},r}}else o=e}let c=o.map(function(e){return C(e.params)?1/0:e.params.length});if(t.lengthl)return r=TypeError(`Too many arguments in function `+a+` (expected: `+l+`, actual: `+t.length+`)`),r.data={category:`tooManyArgs`,fn:a,index:t.length,expectedLength:l},r;let u=[];for(let e=0;e0)return .001;let r=j(e),i=j(t);if(e.hasConversion){if(!t.hasConversion)return(1+r)*1e-6}else if(t.hasConversion)return-(1+i)*1e-6;let a=r-i;return a<0?-1e-7:a>0?1e-7:0}function M(e,t){let n=e.params,r=t.params,i=I(n),a=I(r),o=C(n),s=C(r);if(o&&i.hasAny){if(!s||!a.hasAny)return 1e7}else if(s&&a.hasAny)return-1e7;let c=0,l=0,u;for(u of n)u.hasAny&&++c,u.hasConversion&&++l;let d=0,f=0;for(u of r)u.hasAny&&++d,u.hasConversion&&++f;if(c!==d)return(c-d)*1e6;if(o&&i.hasConversion){if(!s||!a.hasConversion)return 1e5}else if(s&&a.hasConversion)return-1e5;if(l!==f)return(l-f)*1e4;if(o){if(!s)return 1e3}else if(s)return-1e3;let p=(n.length-r.length)*(o?-100:100);if(p!==0)return p;let m=[],h=0;for(let e=0;ee.hasConversion)){let i=C(e),a=e.map(N);r=a.map(e=>e.name).join(`;`),n=function(){let e=[],n=i?arguments.length-1:arguments.length;for(let t=0;t`+e.conversion.to+`,`,a.push(f(e.conversion.from).test),o.push(e.conversion.convert))}),s=s?s.slice(0,-1):`pass`;let c=e=>e;switch(o.length){case 0:break;case 1:t=a[0],r=o[0],c=function(e){return t(e)?r(e):e};break;case 2:t=a[0],n=a[1],r=o[0],i=o[1],c=function(e){return t(e)?r(e):n(e)?i(e):e};break;default:c=function(e){for(let t=0;te.name).join(`|`),hasAny:e.some(e=>e.isAny),hasConversion:!1,restParam:!0}),a.push(i)}else a=i.types.map(function(e){return{types:[e],name:e.name,hasAny:e.isAny,hasConversion:e.conversion,restParam:!1}});return he(a,function(i){return t(e,n+1,r.concat([i]))})}else return[r]}return t(e,0,[])}function ce(e,t){let n=Math.max(e.length,t.length);for(let r=0;r=r:o?r>=i:r===i}function le(e){return e.map(e=>ye(e)?ve(e.referToSelf.callback):R(e)?_e(e.referTo.references,e.referTo.callback):e)}function ue(e,t,n){let r=[],i;for(i of e){let e=n[i];if(typeof e!=`number`)throw TypeError(`No definition for referenced signature "`+i+`"`);if(e=t[e],typeof e!=`function`)return!1;r.push(e)}return r}function de(e,t,n){let r=le(e),i=Array(r.length).fill(!1),a=!0;for(;a;){a=!1;let e=!0;for(let o=0;o{let r=e[n];if(t.test(r.toString()))throw SyntaxError("Using `this` to self-reference a function is deprecated since typed-function@3. Use typed.referTo and typed.referToSelf instead.")})}function F(e,r){if(d.createCount++,Object.keys(r).length===0)throw SyntaxError(`No signatures provided`);d.warnAgainstDeprecatedThis&&P(r);let i=[],a=[],o={},s=[],c;for(c in r){if(!Object.prototype.hasOwnProperty.call(r,c))continue;let e=ne(c);if(!e)continue;i.forEach(function(t){if(ce(t,e))throw TypeError(`Conflicting signatures "`+x(t)+`" and "`+x(e)+`".`)}),i.push(e);let t=a.length;a.push(r[c]);let n=e.map(ee),l;for(l of se(n)){let e=x(l);s.push({params:l,name:e,fn:t}),l.every(e=>!e.hasConversion)&&(o[e]=t)}}s.sort(M);let l=de(a,o,B),u;for(u in o)Object.prototype.hasOwnProperty.call(o,u)&&(o[u]=l[o[u]]);let f=[],p=new Map;for(u of s)p.has(u.name)||(u.fn=l[u.fn],f.push(u),p.set(u.name,u));let m=f[0]&&f[0].params.length<=2&&!C(f[0].params),h=f[1]&&f[1].params.length<=2&&!C(f[1].params),g=f[2]&&f[2].params.length<=2&&!C(f[2].params),_=f[3]&&f[3].params.length<=2&&!C(f[3].params),v=f[4]&&f[4].params.length<=2&&!C(f[4].params),y=f[5]&&f[5].params.length<=2&&!C(f[5].params),b=m&&h&&g&&_&&v&&y;for(let e=0;ee.test),xe=f.map(e=>e.implementation),z=function(){for(let e=R;ex(ne(e))),t=I(arguments);if(typeof t!=`function`)throw TypeError(`Callback function expected as last argument`);return _e(e,t)}function _e(e,t){return{referTo:{references:e,callback:t}}}function ve(e){if(typeof e!=`function`)throw TypeError(`Callback function expected as first argument`);return{referToSelf:{callback:e}}}function R(e){return e&&typeof e.referTo==`object`&&Array.isArray(e.referTo.references)&&typeof e.referTo.callback==`function`}function ye(e){return e&&typeof e.referToSelf==`object`&&typeof e.referToSelf.callback==`function`}function be(e,t){if(!e)return t;if(t&&t!==e){let n=Error(`Function names do not match (expected: `+e+`, actual: `+t+`)`);throw n.data={actual:t,expected:e},n}return e}function xe(e){let t;for(let n in e)Object.prototype.hasOwnProperty.call(e,n)&&(_(e[n])||typeof e[n].signature==`string`)&&(t=be(t,e[n].name));return t}function z(e,t){let n;for(n in t)if(Object.prototype.hasOwnProperty.call(t,n)){if(n in e&&t[n]!==e[n]){let r=Error(`Signature "`+n+`" is defined twice`);throw r.data={signature:n,sourceFunction:t[n],destFunction:e[n]},r}e[n]=t[n]}}let B=d;d=function(e){let t=typeof e==`string`,n=t?1:0,r=t?e:``,i={};for(let e=n;e1&&arguments[1]!==void 0?arguments[1]:{override:!1};Se(e);let n=f(e.to),r=n.conversionsTo.find(t=>t.from===e.from);if(r)if(t&&t.override)d.removeConversion({from:r.from,to:e.to,convert:r.convert});else throw Error(`There is already a conversion from "`+e.from+`" to "`+n.name+`"`);n.conversionsTo.push({from:e.from,to:n.name,convert:e.convert,index:u++})},d.addConversions=function(e,t){e.forEach(e=>d.addConversion(e,t))},d.removeConversion=function(e){Se(e);let t=f(e.to),n=L(t.conversionsTo,t=>t.from===e.from);if(!n)throw Error(`Attempt to remove nonexistent conversion from `+e.from+` to `+e.to);if(n.convert!==e.convert)throw Error(`Conversion to remove does not match existing conversion`);let r=t.conversionsTo.indexOf(n);t.conversionsTo.splice(r,1)},d.resolve=function(e,t){if(!_(e))throw TypeError(r);let n=e._typedFunctionData.signatures;for(let e=0;eO&&/^(?:[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBA]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC4\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC80-\uDD43]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD887][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]|\uD821[\uDC00-\uDFF7]|\uD823[\uDC00-\uDCD5\uDCFF-\uDD08]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD22\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD67\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF1E\uDF25-\uDF2A]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF39\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD888[\uDC00-\uDFAF])(?:[0-9A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBA]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC4\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC80-\uDD43]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD887][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]|\uD821[\uDC00-\uDFF7]|\uD823[\uDC00-\uDCD5\uDCFF-\uDD08]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD22\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD67\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF1E\uDF25-\uDF2A]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF39\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD888[\uDC00-\uDFAF])*$/.test(e)},{name:`string`,test:O},{name:`Chain`,test:De},{name:`Array`,test:k},{name:`Matrix`,test:A},{name:`DenseMatrix`,test:ie},{name:`SparseMatrix`,test:M},{name:`Range`,test:ae},{name:`Index`,test:oe},{name:`boolean`,test:N},{name:`ResultSet`,test:se},{name:`Help`,test:ce},{name:`function`,test:le},{name:`Date`,test:ue},{name:`RegExp`,test:de},{name:`null`,test:I},{name:`undefined`,test:me},{name:`AccessorNode`,test:L},{name:`ArrayNode`,test:he},{name:`AssignmentNode`,test:ge},{name:`BlockNode`,test:_e},{name:`ConditionalNode`,test:ve},{name:`ConstantNode`,test:R},{name:`FunctionNode`,test:xe},{name:`FunctionAssignmentNode`,test:be},{name:`IndexNode`,test:z},{name:`Node`,test:B},{name:`ObjectNode`,test:Se},{name:`OperatorNode`,test:Ce},{name:`ParenthesisNode`,test:we},{name:`RangeNode`,test:Te},{name:`RelationalNode`,test:Ee},{name:`SymbolNode`,test:V},{name:`Map`,test:F},{name:`Object`,test:P}]),a.addConversions([{from:`number`,to:`BigNumber`,convert:function(e){if(t||nn(e),it(e)>15)throw 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||rn(e),new n(e,0)}},{from:`BigNumber`,to:`Complex`,convert:function(e){return n||rn(e),new n(e.toNumber(),0)}},{from:`bigint`,to:`number`,convert:function(e){if(e>2**53-1)throw TypeError(`Cannot implicitly convert bigint to number: value exceeds the max safe integer value (value: `+e+`)`);return Number(e)}},{from:`bigint`,to:`BigNumber`,convert:function(e){return t||nn(e),new t(e.toString())}},{from:`bigint`,to:`Fraction`,convert:function(e){return i||on(e),new i(e)}},{from:`Fraction`,to:`BigNumber`,convert:function(e){throw 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||rn(e),new n(e.valueOf(),0)}},{from:`number`,to:`Fraction`,convert:function(e){i||on(e);var t=new i(e);if(t.valueOf()!==e)throw 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 Error(`Cannot convert "`+e+`" to a number`);return t}},{from:`string`,to:`BigNumber`,convert:function(e){t||nn(e);try{return new t(e)}catch{throw Error(`Cannot convert "`+e+`" to BigNumber`)}}},{from:`string`,to:`bigint`,convert:function(e){try{return BigInt(e)}catch{throw Error(`Cannot convert "`+e+`" to BigInt`)}}},{from:`string`,to:`Fraction`,convert:function(e){i||on(e);try{return new i(e)}catch{throw Error(`Cannot convert "`+e+`" to Fraction`)}}},{from:`string`,to:`Complex`,convert:function(e){n||rn(e);try{return new n(e)}catch{throw Error(`Cannot convert "`+e+`" to Complex`)}}},{from:`boolean`,to:`number`,convert:function(e){return+e}},{from:`boolean`,to:`BigNumber`,convert:function(e){return t||nn(e),new t(+e)}},{from:`boolean`,to:`bigint`,convert:function(e){return BigInt(+e)}},{from:`boolean`,to:`Fraction`,convert:function(e){return i||on(e),new i(+e)}},{from:`boolean`,to:`string`,convert:function(e){return String(e)}},{from:`Array`,to:`Matrix`,convert:function(e){return r||an(),new r(e)}},{from:`Matrix`,to:`Array`,convert:function(e){return e.valueOf()}}]),a.onMismatch=(e,t,n)=>{var r=a.createError(e,t,n);if([`wrongType`,`mismatch`].includes(r.data.category)&&t.length===1&&j(t[0])&&n.some(e=>!e.params.includes(`,`))){var i=TypeError(`Function '${e}' doesn't apply to matrices. To call it elementwise on a matrix 'M', try 'map(M, ${e})'.`);throw i.data=r.data,i}throw r},a.onMismatch=(e,t,n)=>{var r=a.createError(e,t,n);if([`wrongType`,`mismatch`].includes(r.data.category)&&t.length===1&&j(t[0])&&n.some(e=>!e.params.includes(`,`))){var i=TypeError(`Function '${e}' doesn't apply to matrices. To call it elementwise on a matrix 'M', try 'map(M, ${e})'.`);throw i.data=r.data,i}throw r},a});function nn(e){throw Error(`Cannot convert value ${e} into a BigNumber: no class 'BigNumber' provided`)}function rn(e){throw Error(`Cannot convert value ${e} into a Complex number: no class 'Complex' provided`)}function an(){throw Error(`Cannot convert array into a Matrix: no class 'DenseMatrix' provided`)}function on(e){throw Error(`Cannot convert value ${e} into a Fraction, no class 'Fraction' provided.`)}var sn=K(`ResultSet`,[],()=>{function e(t){if(!(this instanceof e))throw 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.map(String).join(`, `)+`]`},e.prototype.toJSON=function(){return{mathjs:`ResultSet`,entries:this.entries}},e.fromJSON=function(t){return new e(t.entries)},e},{isClass:!0});function cn(e,t,n){var r=e.constructor,i=new r(2),a=``;if(n){if(n<1)throw Error(`size must be in greater than 0`);if(!W(n))throw Error(`size must be an integer`);if(e.greaterThan(i.pow(n-1).sub(1))||e.lessThan(i.pow(n-1).mul(-1)))throw Error(`Value must be in range [-2^${n-1}, 2^${n-1}-1]`);if(!e.isInteger())throw Error(`Value must be an integer`);e.lessThan(0)&&(e=e.add(i.pow(n))),a=`i${n}`}switch(t){case 2:return`${e.toBinary()}${a}`;case 8:return`${e.toOctal()}${a}`;case 16:return`${e.toHexadecimal()}${a}`;default:throw Error(`Base ${t} not supported `)}}function ln(e,t){if(typeof t==`function`)return t(e);if(!e.isFinite())return e.isNaN()?`NaN`:e.gt(0)?`Infinity`:`-Infinity`;var{notation:n,precision:r,wordSize:i}=Xe(t);switch(n){case`fixed`:return fn(e,r);case`exponential`:return dn(e,r);case`engineering`:return un(e,r);case`bin`:return cn(e,2,i);case`oct`:return cn(e,8,i);case`hex`:return cn(e,16,i);case`auto`:var a=pn(t?.lowerExp,-3),o=pn(t?.upperExp,5);if(e.isZero())return`0`;var s,c=e.toSignificantDigits(r),l=c.e;return s=l>=a&&l=0?`+`:``)+r.toString()}function dn(e,t){return t===void 0?e.toExponential():e.toExponential(t-1)}function fn(e,t){return e.toFixed(t)}function pn(e,t){return C(e)?e:w(e)?e.toNumber():t}function mn(e,t){var n=hn(e,t);return t&&typeof t==`object`&&`truncate`in t&&n.length>t.truncate?n.substring(0,t.truncate-3)+`...`:n}function hn(e,t){return typeof e==`number`?Ye(e,t):w(e)?ln(e,t):yn(e)?!t||t.fraction!==`decimal`?`${e.s*e.n}/${e.d}`:e.toString():Array.isArray(e)?vn(e,t):O(e)?gn(e):typeof e==`function`?e.syntax?String(e.syntax):`function`:e&&typeof e==`object`?typeof e.format==`function`?e.format(t):e&&e.toString(t)!=={}.toString()?e.toString(t):`{`+Object.keys(e).map(n=>gn(n)+`: `+mn(e[n],t)).join(`, `)+`}`:String(e)}function gn(e){for(var t=String(e),n=``,r=0;r/g,`>`),t}function vn(e,t){if(Array.isArray(e)){for(var n=`[`,r=e.length,i=0;i`,associativity:`left`,associativeWith:[]},"OperatorNode:smallerEq":{op:`<=`,associativity:`left`,associativeWith:[]},"OperatorNode:largerEq":{op:`>=`,associativity:`left`,associativeWith:[]},RelationalNode:{associativity:`left`,associativeWith:[]}},{"OperatorNode:leftShift":{op:`<<`,associativity:`left`,associativeWith:[]},"OperatorNode:rightArithShift":{op:`>>`,associativity:`left`,associativeWith:[]},"OperatorNode:rightLogShift":{op:`>>>`,associativity:`left`,associativeWith:[]}},{"OperatorNode:to":{op:`to`,associativity:`left`,associativeWith:[]}},{RangeNode:{}},{"OperatorNode:add":{op:`+`,associativity:`left`,associativeWith:[`OperatorNode:add`,`OperatorNode:subtract`]},"OperatorNode:subtract":{op:`-`,associativity:`left`,associativeWith:[]}},{"OperatorNode:multiply":{op:`*`,associativity:`left`,associativeWith:[`OperatorNode:multiply`,`OperatorNode:divide`,`Operator:dotMultiply`,`Operator:dotDivide`]},"OperatorNode:divide":{op:`/`,associativity:`left`,associativeWith:[],latexLeftParens:!1,latexRightParens:!1,latexParens:!1},"OperatorNode:dotMultiply":{op:`.*`,associativity:`left`,associativeWith:[`OperatorNode:multiply`,`OperatorNode:divide`,`OperatorNode:dotMultiply`,`OperatorNode:doDivide`]},"OperatorNode:dotDivide":{op:`./`,associativity:`left`,associativeWith:[]},"OperatorNode:mod":{op:`mod`,associativity:`left`,associativeWith:[]}},{"OperatorNode:multiply":{associativity:`left`,associativeWith:[`OperatorNode:multiply`,`OperatorNode:divide`,`Operator:dotMultiply`,`Operator:dotDivide`]}},{"OperatorNode:unaryPlus":{op:`+`,associativity:`right`},"OperatorNode:unaryMinus":{op:`-`,associativity:`right`},"OperatorNode:bitNot":{op:`~`,associativity:`right`},"OperatorNode:not":{op:`not`,associativity:`right`}},{"OperatorNode:pow":{op:`^`,associativity:`right`,associativeWith:[],latexRightParens:!1},"OperatorNode:dotPow":{op:`.^`,associativity:`right`,associativeWith:[]}},{"OperatorNode:nullish":{op:`??`,associativity:`left`,associativeWith:[]}},{"OperatorNode:factorial":{op:`!`,associativity:`left`}},{"OperatorNode:ctranspose":{op:`'`,associativity:`left`}}];function wn(e,t){if(!t||t!==`auto`)return e;for(var n=e;we(n);)n=n.content;return n}function Y(e,t,n,r){var i=e;t!==`keep`&&(i=e.getContent());for(var a=i.getIdentifier(),o=null,s=0;s=this.max?this.message=`Index out of range (`+this.index+` > `+(this.max-1)+`)`:this.message=`Index out of range (`+this.index+`)`,this.stack=Error().stack}Dn.prototype=RangeError(),Dn.prototype.constructor=RangeError,Dn.prototype.name=`IndexError`,Dn.prototype.isIndexError=!0;function On(e,t,n){if(!(this instanceof On))throw 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=Error().stack}On.prototype=RangeError(),On.prototype.constructor=RangeError,On.prototype.name=`DimensionError`,On.prototype.isDimensionError=!0;function kn(e){for(var t=[];Array.isArray(e);)t.push(e.length),e=e[0];return t}function An(e,t){return Array.prototype.map.call(e,t)}function jn(e,t){Array.prototype.forEach.call(e,t)}function Mn(e,t){return Array.prototype.join.call(e,t)}function Nn(e,t){var n=arguments.length>2&&arguments[2]!==void 0?arguments[2]:!1;if(e.length===0)return[];if(n)return a(e);var r=[];return i(e,0);function i(n,a){if(Array.isArray(n)){for(var o=n.length,s=Array(o),c=0;ct(e),!1,!0):Nn(e,t,!0);var r=e=>e===0?e:t(e);return A(e)?e.map(e=>r(e),!1,!0):Nn(e,r,!0)}function Fn(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){a=0,n=1;return}for(;!Object.prototype.hasOwnProperty.call(r,++n););}};return e=Math.abs(e),{hit:function(s){var c=i[s],l=++a;if(r[l]=s,i[s]=l,!c)return++t,t<=e?void 0:(s=r[n],o(s),s);if(delete r[c],n===c)for(;!Object.prototype.hasOwnProperty.call(r,++n););},delete:o,clear:function(){t=a=0,n=1,r=Object.create(null),i=Object.create(null)}}}function In(e){var{hasher:t,limit:n}=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{};return n??=1/0,t??=JSON.stringify,function r(){typeof r.cache!=`object`&&(r.cache={values:new Map,lru:Fn(n||1/0)});var i=[...arguments],a=t(i);if(r.cache.values.has(a))return r.cache.lru.hit(a),r.cache.values.get(a);var o=e.apply(e,i);return r.cache.values.set(a,o),r.cache.values.delete(r.cache.lru.hit(a)),o}}var Ln=In(function(e){return new e(1).exp()},{hasher:zn});In(function(e){return new e(1).plus(new e(5).sqrt()).div(2)},{hasher:zn});var Rn=In(function(e){return e.acos(-1)},{hasher:zn});In(function(e){return Rn(e).times(2)},{hasher:zn});function zn(e){return e[0].precision}var Bn=Hn(`pi`,[`config`,`?BigNumber`],e=>{var{config:t,BigNumber:n}=e;return t.number===`BigNumber`?Rn(n):It}),Vn=Hn(`e`,[`config`,`?BigNumber`],e=>{var{config:t,BigNumber:n}=e;return t.number===`BigNumber`?Ln(n):Lt});function Hn(e,t,n){return K(e,t,n,{recreateOnConfigChange:!0})}var Un=`number`,Wn=[`typed`];function Gn(e){var t=e.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);return t?{input:e,radix:{"0b":2,"0o":8,"0x":16}[t[1]],integerPart:t[2],fractionalPart:t[3]}:null}function Kn(e){for(var t=parseInt(e.integerPart,e.radix),n=0,r=0;r{var{typed:t}=e,n=t(`number`,{"":function(){return 0},number:function(e){return e},string:function(e){if(e===`NaN`)return NaN;var t=Gn(e);if(t)return Kn(t);var n=0,r=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);r&&(n=Number(r[2]),e=r[1]);var i=Number(e);if(isNaN(i))throw SyntaxError(`String "`+e+`" is not a valid number`);if(r){if(i>2**n-1)throw SyntaxError(`String "${e}" is out of range`);i>=2**(n-1)&&(i-=2**n)}return i},BigNumber:function(e){return e.toNumber()},bigint:function(e){return Number(e)},Fraction:function(e){return e.valueOf()},Unit:t.referToSelf(e=>t=>{var n=t.clone();return n.value=e(t.value),n}),null:function(e){return 0},"Unit, string | Unit":function(e,t){return e.toNumber(t)},"Array | Matrix":t.referToSelf(e=>t=>Pn(t,e))});return n.fromJSON=function(e){return parseFloat(e.value)},n}),Jn=new Set([`end`]),Yn=K(`Node`,[`mathWithTransform`],e=>{var{mathWithTransform:t}=e;function n(e){for(var t of[...Jn])if(e.has(t))throw Error(`Scope contains an illegal symbol, "`+t+`" is a reserved keyword`)}class r{get type(){return`Node`}get isNode(){return!0}evaluate(e){return this.compile().evaluate(e)}compile(){var e=this._compile(t,{}),r={},i=null;function a(t){var a=ne(t);return n(a),e(a,r,i)}return{evaluate:a}}_compile(e,t){throw Error(`Method _compile must be implemented by type `+this.type)}forEach(e){throw Error(`Cannot run forEach on a Node interface`)}map(e){throw Error(`Cannot run map on a Node interface`)}_ifNode(e){if(!B(e))throw TypeError(`Callback function must return a Node`);return e}traverse(e){e(this,null,null);function t(e,n){e.forEach(function(e,r,i){n(e,r,i),t(e,n)})}t(this,e)}transform(e){function t(n,r,i){var a=e(n,r,i);return a===n?n.map(t):a}return t(this,null,null)}filter(e){var t=[];return this.traverse(function(n,r,i){e(n,r,i)&&t.push(n)}),t}clone(){throw Error(`Cannot clone a Node interface`)}cloneDeep(){return this.map(function(e){return e.cloneDeep()})}equals(e){return e?this.type===e.type&&Me(this,e):!1}toString(e){var t=this._getCustomString(e);return t===void 0?this._toString(e):t}_toString(){throw Error(`_toString not implemented for `+this.type)}toJSON(){throw Error(`Cannot serialize object: toJSON not implemented by `+this.type)}toHTML(e){var t=this._getCustomString(e);return t===void 0?this._toHTML(e):t}_toHTML(){throw Error(`_toHTML not implemented for `+this.type)}toTex(e){var t=this._getCustomString(e);return t===void 0?this._toTex(e):t}_toTex(e){throw Error(`_toTex not implemented for `+this.type)}_getCustomString(e){if(e&&typeof e==`object`)switch(typeof e.handler){case`object`:case`undefined`:return;case`function`:return e.handler(this,e);default:throw TypeError(`Object or function expected as callback`)}}getIdentifier(){return this.type}getContent(){return this}}return r},{isClass:!0,isNode:!0});function Xn(e){return e&&e.isIndexError?new Dn(e.index+1,e.min+1,e.max===void 0?void 0:e.max+1):e}function Zn(e){var{subset:t}=e;return function(e,n){try{if(Array.isArray(e))return t(e,n);if(e&&typeof e.subset==`function`)return e.subset(n);if(typeof e==`string`)return t(e,n);if(typeof e==`object`){if(!n.isObjectProperty())throw TypeError(`Cannot apply a numeric index as object property`);return p(e,n.getObjectProperty())}else throw TypeError(`Cannot apply index: unsupported type of object`)}catch(e){throw Xn(e)}}}var Qn=`AccessorNode`,$n=K(Qn,[`subset`,`Node`],e=>{var{subset:t,Node:n}=e,r=Zn({subset:t});function i(e){return!(L(e)||he(e)||R(e)||xe(e)||Se(e)||we(e)||V(e))}class a extends n{constructor(e,t){var n=arguments.length>2&&arguments[2]!==void 0?arguments[2]:!1;if(super(),!B(e))throw TypeError(`Node expected for parameter "object"`);if(!z(t))throw TypeError(`IndexNode expected for parameter "index"`);this.object=e,this.index=t,this.optionalChaining=n}get name(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():``:this.object.name||``}get type(){return Qn}get isAccessorNode(){return!0}_compile(e,t){var n=this.object._compile(e,t),i=this.index._compile(e,t),a=this.optionalChaining,o=L(this.object)&&this.object.optionalChaining;if(this.index.isObjectProperty()){var s=this.index.getObjectProperty();return function(e,t,r){var i=r||{},c=n(e,t,i);if(a&&c==null){i.optionalShortCircuit=!0;return}if(!(o&&i!=null&&i.optionalShortCircuit))return p(c,s)}}else return function(e,t,s){var c=s||{},l=n(e,t,c);if(a&&l==null){c.optionalShortCircuit=!0;return}if(!(o&&c!=null&&c.optionalShortCircuit))return r(l,i(e,t,l))}}forEach(e){e(this.object,`object`,this),e(this.index,`index`,this)}map(e){return new a(this._ifNode(e(this.object,`object`,this)),this._ifNode(e(this.index,`index`,this)),this.optionalChaining)}clone(){return new a(this.object,this.index,this.optionalChaining)}_toString(e){var t=this.object.toString(e);i(this.object)&&(t=`(`+t+`)`);var n=this.optionalChaining?this.index.dotNotation?`?`:`?.`:``;return t+n+this.index.toString(e)}_toHTML(e){var t=this.object.toHTML(e);return i(this.object)&&(t=`(`+t+`)`),t+this.index.toHTML(e)}_toTex(e){var t=this.object.toTex(e);return i(this.object)&&(t=`\\left(' + object + '\\right)`),t+this.index.toTex(e)}toJSON(){return{mathjs:Qn,object:this.object,index:this.index,optionalChaining:this.optionalChaining}}static fromJSON(e){return new a(e.object,e.index,e.optionalChaining)}}return J(a,`name`,Qn),a},{isClass:!0,isNode:!0}),er=`ArrayNode`,tr=K(er,[`Node`],e=>{var{Node:t}=e;class n extends t{constructor(e){if(super(),this.items=e||[],!Array.isArray(this.items)||!this.items.every(B))throw TypeError(`Array containing Nodes expected`)}get type(){return er}get isArrayNode(){return!0}_compile(e,t){var n=An(this.items,function(n){return n._compile(e,t)});if(e.config.matrix!==`Array`){var r=e.matrix;return function(e,t,i){return r(An(n,function(n){return n(e,t,i)}))}}else return function(e,t,r){return An(n,function(n){return n(e,t,r)})}}forEach(e){for(var t=0;t[`+this.items.map(function(t){return t.toHTML(e)}).join(`,`)+`]`}_toTex(e){function t(n,r){var i=n.some(he)&&!n.every(he),a=r||i,o=a?`&`:`\\\\`,s=n.map(function(n){return n.items?t(n.items,!r):n.toTex(e)}).join(o);return i||!a||a&&!r?`\\begin{bmatrix}`+s+`\\end{bmatrix}`:s}return t(this.items,!1)}}return J(n,`name`,er),n},{isClass:!0,isNode:!0});function nr(e){var{subset:t,matrix:n}=e;return function(e,r,i){try{if(Array.isArray(e))return n(e).subset(r,i).valueOf().forEach((t,n)=>{e[n]=t}),e;if(e&&typeof e.subset==`function`)return e.subset(r,i);if(typeof e==`string`)return t(e,r,i);if(typeof e==`object`){if(!r.isObjectProperty())throw TypeError(`Cannot apply a numeric index as object property`);return m(e,r.getObjectProperty(),i),e}else throw TypeError(`Cannot apply index: unsupported type of object`)}catch(e){throw Xn(e)}}}var rr=`AssignmentNode`,ir=K(rr,[`subset`,`?matrix`,`Node`],e=>{var{subset:t,matrix:n,Node:r}=e,i=Zn({subset:t}),a=nr({subset:t,matrix:n});function o(e,t,n){t||=`keep`;var r=Y(e,t,n),i=Y(e.value,t,n);return t===`all`||i!==null&&i<=r}class s extends r{constructor(e,t,n){if(super(),this.object=e,this.index=n?t:null,this.value=n||t,!V(e)&&!L(e))throw TypeError(`SymbolNode or AccessorNode expected as "object"`);if(V(e)&&e.name===`end`)throw Error(`Cannot assign to symbol "end"`);if(this.index&&!z(this.index))throw TypeError(`IndexNode expected as "index"`);if(!B(this.value))throw TypeError(`Node expected as "value"`)}get name(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():``:this.object.name||``}get type(){return rr}get isAssignmentNode(){return!0}_compile(e,t){var n=this.object._compile(e,t),r=this.index?this.index._compile(e,t):null,o=this.value._compile(e,t),s=this.object.name;if(this.index)if(this.index.isObjectProperty()){var c=this.index.getObjectProperty();return function(e,t,r){var i=n(e,t,r),a=o(e,t,r);return m(i,c,a),a}}else if(V(this.object))return function(e,t,i){var c=n(e,t,i),l=o(e,t,i),u=r(e,t,c);return e.set(s,a(c,u,l)),l};else{var l=this.object.object._compile(e,t);if(this.object.index.isObjectProperty()){var u=this.object.index.getObjectProperty();return function(e,t,n){var i=l(e,t,n),s=p(i,u),c=r(e,t,s),d=o(e,t,n);return m(i,u,a(s,c,d)),d}}else{var d=this.object.index._compile(e,t);return function(e,t,n){var s=l(e,t,n),c=d(e,t,s),u=i(s,c),f=r(e,t,u),p=o(e,t,n);return a(s,c,a(u,f,p)),p}}}else{if(!V(this.object))throw TypeError(`SymbolNode expected as object`);return function(e,t,n){var r=o(e,t,n);return e.set(s,r),r}}}forEach(e){e(this.object,`object`,this),this.index&&e(this.index,`index`,this),e(this.value,`value`,this)}map(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)))}clone(){return new s(this.object,this.index,this.value)}_toString(e){var t=this.object.toString(e),n=this.index?this.index.toString(e):``,r=this.value.toString(e);return o(this,e&&e.parenthesis,e&&e.implicit)&&(r=`(`+r+`)`),t+n+` = `+r}toJSON(){return{mathjs:rr,object:this.object,index:this.index,value:this.value}}static fromJSON(e){return new s(e.object,e.index,e.value)}_toHTML(e){var t=this.object.toHTML(e),n=this.index?this.index.toHTML(e):``,r=this.value.toHTML(e);return o(this,e&&e.parenthesis,e&&e.implicit)&&(r=`(`+r+`)`),t+n+`=`+r}_toTex(e){var t=this.object.toTex(e),n=this.index?this.index.toTex(e):``,r=this.value.toTex(e);return o(this,e&&e.parenthesis,e&&e.implicit)&&(r=`\\left(${r}\\right)`),t+n+`=`+r}}return J(s,`name`,rr),s},{isClass:!0,isNode:!0}),ar=`BlockNode`,or=K(ar,[`ResultSet`,`Node`],e=>{var{ResultSet:t,Node:n}=e;class r extends n{constructor(e){if(super(),!Array.isArray(e))throw Error(`Array expected`);this.blocks=e.map(function(e){var t=e&&e.node,n=e&&e.visible!==void 0?e.visible:!0;if(!B(t))throw TypeError(`Property "node" must be a Node`);if(typeof n!=`boolean`)throw TypeError(`Property "visible" must be a boolean`);return{node:t,visible:n}})}get type(){return ar}get isBlockNode(){return!0}_compile(e,n){var r=An(this.blocks,function(t){return{evaluate:t.node._compile(e,n),visible:t.visible}});return function(e,n,i){var a=[];return jn(r,function(t){var r=t.evaluate(e,n,i);t.visible&&a.push(r)}),new t(a)}}forEach(e){for(var t=0;t;`)}).join(`
`)}_toTex(e){return this.blocks.map(function(t){return t.node.toTex(e)+(t.visible?``:`;`)}).join(`\\;\\; +`)}}return J(r,`name`,ar),r},{isClass:!0,isNode:!0}),sr=`ConditionalNode`,cr=K(sr,[`Node`],e=>{var{Node:t}=e;function n(e){if(typeof e==`number`||typeof e==`boolean`||typeof e==`string`)return!!e;if(e){if(w(e))return!e.isZero();if(T(e))return!!(e.re||e.im);if(D(e))return!!e.value}if(e==null)return!1;throw TypeError(`Unsupported type of condition "`+Oe(e)+`"`)}class r extends t{constructor(e,t,n){if(super(),!B(e))throw TypeError(`Parameter condition must be a Node`);if(!B(t))throw TypeError(`Parameter trueExpr must be a Node`);if(!B(n))throw TypeError(`Parameter falseExpr must be a Node`);this.condition=e,this.trueExpr=t,this.falseExpr=n}get type(){return sr}get isConditionalNode(){return!0}_compile(e,t){var r=this.condition._compile(e,t),i=this.trueExpr._compile(e,t),a=this.falseExpr._compile(e,t);return function(e,t,o){return n(r(e,t,o))?i(e,t,o):a(e,t,o)}}forEach(e){e(this.condition,`condition`,this),e(this.trueExpr,`trueExpr`,this),e(this.falseExpr,`falseExpr`,this)}map(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)))}clone(){return new r(this.condition,this.trueExpr,this.falseExpr)}_toString(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,n=Y(this,t,e&&e.implicit),r=this.condition.toString(e),i=Y(this.condition,t,e&&e.implicit);(t===`all`||this.condition.type===`OperatorNode`||i!==null&&i<=n)&&(r=`(`+r+`)`);var a=this.trueExpr.toString(e),o=Y(this.trueExpr,t,e&&e.implicit);(t===`all`||this.trueExpr.type===`OperatorNode`||o!==null&&o<=n)&&(a=`(`+a+`)`);var s=this.falseExpr.toString(e),c=Y(this.falseExpr,t,e&&e.implicit);return(t===`all`||this.falseExpr.type===`OperatorNode`||c!==null&&c<=n)&&(s=`(`+s+`)`),r+` ? `+a+` : `+s}toJSON(){return{mathjs:sr,condition:this.condition,trueExpr:this.trueExpr,falseExpr:this.falseExpr}}static fromJSON(e){return new r(e.condition,e.trueExpr,e.falseExpr)}_toHTML(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,n=Y(this,t,e&&e.implicit),r=this.condition.toHTML(e),i=Y(this.condition,t,e&&e.implicit);(t===`all`||this.condition.type===`OperatorNode`||i!==null&&i<=n)&&(r=`(`+r+`)`);var a=this.trueExpr.toHTML(e),o=Y(this.trueExpr,t,e&&e.implicit);(t===`all`||this.trueExpr.type===`OperatorNode`||o!==null&&o<=n)&&(a=`(`+a+`)`);var s=this.falseExpr.toHTML(e),c=Y(this.falseExpr,t,e&&e.implicit);return(t===`all`||this.falseExpr.type===`OperatorNode`||c!==null&&c<=n)&&(s=`(`+s+`)`),r+`?`+a+`:`+s}_toTex(e){return`\\begin{cases} {`+this.trueExpr.toTex(e)+`}, &\\quad{\\text{if }\\;`+this.condition.toTex(e)+`}\\\\{`+this.falseExpr.toTex(e)+`}, &\\quad{\\text{otherwise}}\\end{cases}`}}return J(r,`name`,sr),r},{isClass:!0,isNode:!0}),lr=u(c(((e,t)=>{var n=Object.assign||function(e){for(var t=1;t1&&arguments[1]!==void 0?arguments[1]:{},o=t.preserveFormatting,s=o===void 0?!1:o,c=t.escapeMapFn,l=c===void 0?a:c,u=String(e),d=``,f=l(n({},r),s?n({},i):{}),p=Object.keys(f),m=function(){var e=!1;p.forEach(function(t,n){e||u.length>=t.length&&u.slice(0,t.length)===t&&(d+=f[p[n]],u=u.slice(t.length,u.length),e=!0)}),e||(d+=u.slice(0,1),u=u.slice(1,u.length))};u;)m();return d}}))(),1),ur={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{?}`},X={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`},dr={abs:{1:"\\left|${args[0]}\\right|"},add:{2:`\\left(\${args[0]}${X.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]}${X.dotDivide}\${args[1]}\\right)`},dotMultiply:{2:`\\left(\${args[0]}${X.dotMultiply}\${args[1]}\\right)`},dotPow:{2:`\\left(\${args[0]}${X.dotPow}\${args[1]}\\right)`},exp:{1:"\\exp\\left(${args[0]}\\right)"},expm1:`\\left(e${X.pow}{\${args[0]}}-1\\right)`,fix:{1:"\\mathrm{${name}}\\left(${args[0]}\\right)"},floor:{1:"\\left\\lfloor${args[0]}\\right\\rfloor"},fraction:{2:"\\frac{${args[0]}}{${args[1]}}"},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]}${X.mod}\${args[1]}\\right)`},multiply:{2:`\\left(\${args[0]}${X.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)${X.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]}${X.subtract}\${args[1]}\\right)`},unaryMinus:{1:`${X.unaryMinus}\\left(\${args[0]}\\right)`},unaryPlus:{1:`${X.unaryPlus}\\left(\${args[0]}\\right)`},bitAnd:{2:`\\left(\${args[0]}${X.bitAnd}\${args[1]}\\right)`},bitNot:{1:X.bitNot+"\\left(${args[0]}\\right)"},bitOr:{2:`\\left(\${args[0]}${X.bitOr}\${args[1]}\\right)`},bitXor:{2:`\\left(\${args[0]}${X.bitXor}\${args[1]}\\right)`},leftShift:{2:`\\left(\${args[0]}${X.leftShift}\${args[1]}\\right)`},rightArithShift:{2:`\\left(\${args[0]}${X.rightArithShift}\${args[1]}\\right)`},rightLogShift:{2:`\\left(\${args[0]}${X.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]}${X.and}\${args[1]}\\right)`},not:{1:X.not+"\\left(${args[0]}\\right)"},or:{2:`\\left(\${args[0]}${X.or}\${args[1]}\\right)`},xor:{2:`\\left(\${args[0]}${X.xor}\${args[1]}\\right)`},cross:{2:"\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)"},ctranspose:{1:`\\left(\${args[0]}\\right)${X.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}"},pinv:{1:"\\left(${args[0]}\\right)^{+}"},sqrtm:{1:`{\${args[0]}}${X.pow}{\\frac{1}{2}}`},trace:{1:"\\mathrm{tr}\\left(${args[0]}\\right)"},transpose:{1:`\\left(\${args[0]}\\right)${X.transpose}`},combinations:{2:"\\binom{${args[0]}}{${args[1]}}"},combinationsWithRep:{2:"\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)"},factorial:{1:`\\left(\${args[0]}\\right)${X.factorial}`},gamma:{1:"\\Gamma\\left(${args[0]}\\right)"},lgamma:{1:"\\ln\\Gamma\\left(${args[0]}\\right)"},equal:{2:`\\left(\${args[0]}${X.equal}\${args[1]}\\right)`},larger:{2:`\\left(\${args[0]}${X.larger}\${args[1]}\\right)`},largerEq:{2:`\\left(\${args[0]}${X.largerEq}\${args[1]}\\right)`},smaller:{2:`\\left(\${args[0]}${X.smaller}\${args[1]}\\right)`},smallerEq:{2:`\\left(\${args[0]}${X.smallerEq}\${args[1]}\\right)`},unequal:{2:`\\left(\${args[0]}${X.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]}${X.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)"},bigint:{0:`0`,1:"\\left(${args[0]}\\right)"},complex:{0:`0`,1:"\\left(${args[0]}\\right)",2:`\\left(\\left(\${args[0]}\\right)+${ur.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)"}},fr="\\mathrm{${name}}\\left(${args}\\right)",pr={deg:`^\\circ`};function mr(e){return(0,lr.default)(e,{preserveFormatting:!0})}function hr(e,t){return t=t===void 0?!1:t,t?H(pr,e)?pr[e]:`\\mathrm{`+mr(e)+`}`:H(ur,e)?ur[e]:mr(e)}var gr=`ConstantNode`,_r=K(gr,[`Node`,`isBounded`],e=>{var{Node:t,isBounded:n}=e;class r extends t{constructor(e){super(),this.value=e}get type(){return gr}get isConstantNode(){return!0}_compile(e,t){var n=this.value;return function(){return n}}forEach(e){}map(e){return this.clone()}clone(){return new r(this.value)}_toString(e){return mn(this.value,e)}_toHTML(e){var t=this._toString(e);switch(Oe(this.value)){case`number`:case`bigint`:case`BigNumber`:case`Fraction`:return``+t+``;case`string`:return``+t+``;case`boolean`:return``+t+``;case`null`:return``+t+``;case`undefined`:return``+t+``;default:return``+t+``}}toJSON(){return{mathjs:gr,value:this.value}}static fromJSON(e){return new r(e.value)}_toTex(e){var t=this._toString(e);switch(Oe(this.value)){case`string`:return`\\mathtt{`+mr(t)+`}`;case`number`:case`BigNumber`:if(!n(this.value))return this.value.valueOf()<0?`-\\infty`:`\\infty`;var r=t.toLowerCase().indexOf(`e`);return r===-1?t:t.substring(0,r)+`\\cdot10^{`+t.substring(r+1)+`}`;case`bigint`:return t.toString();case`Fraction`:return this.value.toLatex();default:return t}}}return J(r,`name`,gr),r},{isClass:!0,isNode:!0}),vr=`FunctionAssignmentNode`,yr=K(vr,[`typed`,`Node`],e=>{var{typed:t,Node:n}=e;function r(e,t,n){var r=Y(e,t,n),i=Y(e.expr,t,n);return t===`all`||i!==null&&i<=r}class i extends n{constructor(e,t,n){if(super(),typeof e!=`string`)throw TypeError(`String expected for parameter "name"`);if(!Array.isArray(t))throw TypeError(`Array containing strings or objects expected for parameter "params"`);if(!B(n))throw TypeError(`Node expected for parameter "expr"`);if(Jn.has(e))throw Error(`Illegal function name, "`+e+`" is a reserved keyword`);var r=new Set;for(var i of t){var a=typeof i==`string`?i:i.name;if(r.has(a))throw Error(`Duplicate parameter name "${a}"`);r.add(a)}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}get type(){return vr}get isFunctionAssignmentNode(){return!0}_compile(e,n){var r=Object.create(n);jn(this.params,function(e){r[e]=!0});var i=this.expr,a=i._compile(e,r),o=this.name,s=this.params,c=Mn(this.types,`,`),l=o+`(`+Mn(this.params,`, `)+`)`;return function(e,n,r){var u={};u[c]=function(){for(var t=Object.create(n),i=0;i`+q(this.params[i])+``);var a=this.expr.toHTML(e);return r(this,t,e&&e.implicit)&&(a=`(`+a+`)`),``+q(this.name)+`(`+n.join(`,`)+`)=`+a}_toTex(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,n=this.expr.toTex(e);return r(this,t,e&&e.implicit)&&(n=`\\left(${n}\\right)`),`\\mathrm{`+this.name+`}\\left(`+this.params.map(hr).join(`,`)+`\\right)=`+n}}return J(i,`name`,vr),i},{isClass:!0,isNode:!0}),br=`IndexNode`,xr=K(br,[`Node`,`size`],e=>{var{Node:t,size:n}=e;class r extends t{constructor(e,t){if(super(),this.dimensions=e,this.dotNotation=t||!1,!Array.isArray(e)||!e.every(B))throw TypeError(`Array containing Nodes expected for parameter "dimensions"`);if(this.dotNotation&&!this.isObjectProperty())throw Error(`dotNotation only applicable for object properties`)}get type(){return br}get isIndexNode(){return!0}_compile(e,t){var r=An(this.dimensions,function(r,i){if(r.filter(e=>e.isSymbolNode&&e.name===`end`).length>0){var a=Object.create(t);a.end=!0;var o=r._compile(e,a);return function(e,t,r){if(!A(r)&&!k(r)&&!O(r))throw TypeError(`Cannot resolve "end": context must be a Matrix, Array, or string but is `+Oe(r));var a=n(r),s=Object.create(t);return s.end=a[i],o(e,s,r)}}else return r._compile(e,t)}),i=p(e,`index`);return function(e,t,n){return i(...An(r,function(r){return r(e,t,n)}))}}forEach(e){for(var t=0;t.`+q(this.getObjectProperty())+``:`[`+t.join(`,`)+`]`}_toTex(e){var t=this.dimensions.map(function(t){return t.toTex(e)});return this.dotNotation?`.`+this.getObjectProperty():`_{`+t.join(`,`)+`}`}}return J(r,`name`,br),r},{isClass:!0,isNode:!0}),Sr=`ObjectNode`,Cr=K(Sr,[`Node`],e=>{var{Node:t}=e;class n extends t{constructor(e){if(super(),this.properties=e||{},e&&(typeof e!=`object`||!Object.keys(e).every(function(t){return B(e[t])})))throw TypeError(`Object containing Nodes expected`)}get type(){return Sr}get isObjectNode(){return!0}_compile(e,t){var n={};for(var r in this.properties)if(H(this.properties,r)){var i=gn(r),a=JSON.parse(i);n[a]=p(this.properties,r)._compile(e,t)}return function(e,t,r){var i={};for(var a in n)H(n,a)&&(i[a]=n[a](e,t,r));return i}}forEach(e){for(var t in this.properties)H(this.properties,t)&&e(this.properties[t],`properties[`+gn(t)+`]`,this)}map(e){var t={};for(var r in this.properties)H(this.properties,r)&&(t[r]=this._ifNode(e(this.properties[r],`properties[`+gn(r)+`]`,this)));return new n(t)}clone(){var e={};for(var t in this.properties)H(this.properties,t)&&(e[t]=this.properties[t]);return new n(e)}_toString(e){var t=[];for(var n in this.properties)H(this.properties,n)&&t.push(gn(n)+`: `+this.properties[n].toString(e));return`{`+t.join(`, `)+`}`}toJSON(){return{mathjs:Sr,properties:this.properties}}static fromJSON(e){return new n(e.properties)}_toHTML(e){var t=[];for(var n in this.properties)H(this.properties,n)&&t.push(``+q(n)+`:`+this.properties[n].toHTML(e));return`{`+t.join(`,`)+`}`}_toTex(e){var t=[];for(var n in this.properties)H(this.properties,n)&&t.push(`\\mathbf{`+n+`:} & `+this.properties[n].toTex(e)+`\\\\`);return`\\left\\{\\begin{array}{ll}`+t.join(` +`)+`\\end{array}\\right\\}`}}return J(n,`name`,Sr),n},{isClass:!0,isNode:!0});function wr(e,t){return new S(e,new x(t),new Set(Object.keys(t)))}var Tr=`OperatorNode`,Er=K(Tr,[`Node`],e=>{var{Node:t}=e;function n(e,t){var r=e;if(t===`auto`)for(;we(r);)r=r.content;return R(r)?!0:Ce(r)?n(r.args[0],t):!1}function r(e,t,r,i,a){var o=Y(e,t,r),s=Tn(e,t);if(t===`all`||i.length>2&&e.getIdentifier()!==`OperatorNode:add`&&e.getIdentifier()!==`OperatorNode:multiply`)return i.map(function(e){switch(e.getContent().type){case`ArrayNode`:case`ConstantNode`:case`SymbolNode`:case`ParenthesisNode`:return!1;default:return!0}});var c;switch(i.length){case 0:c=[];break;case 1:var l=Y(i[0],t,r,e);if(a&&l!==null){var u,d;if(t===`keep`?(u=i[0].getIdentifier(),d=e.getIdentifier()):(u=i[0].getContent().getIdentifier(),d=e.getContent().getIdentifier()),Cn[o][d].latexLeftParens===!1){c=[!1];break}if(Cn[l][u].latexParens===!1){c=[!1];break}}if(l===null){c=[!1];break}if(l<=o){c=[!0];break}c=[!1];break;case 2:var f,p=Y(i[0],t,r,e),m=En(e,i[0],t);f=p===null?!1:p===o&&s===`right`&&!m?!0:p=2&&e.getIdentifier()===`OperatorNode:multiply`&&e.implicit&&t!==`all`&&r===`hide`)for(var x=1;x2&&(this.getIdentifier()===`OperatorNode:add`||this.getIdentifier()===`OperatorNode:multiply`)){var d=i.map(function(t,n){return t=t.toString(e),a[n]&&(t=`(`+t+`)`),t});return this.implicit&&this.getIdentifier()===`OperatorNode:multiply`&&n===`hide`?d.join(` `):d.join(` `+this.op+` `)}else return this.fn+`(`+this.args.join(`, `)+`)`}toJSON(){return{mathjs:Tr,op:this.op,fn:this.fn,args:this.args,implicit:this.implicit,isPercentage:this.isPercentage}}static fromJSON(e){return new i(e.op,e.fn,e.args,e.implicit,e.isPercentage)}_toHTML(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(i.length===1){var o=Tn(this,t),s=i[0].toHTML(e);return a[0]&&(s=`(`+s+`)`),o===`right`?``+q(this.op)+``+s:s+``+q(this.op)+``}else if(i.length===2){var c=i[0].toHTML(e),l=i[1].toHTML(e);return a[0]&&(c=`(`+c+`)`),a[1]&&(l=`(`+l+`)`),this.implicit&&this.getIdentifier()===`OperatorNode:multiply`&&n===`hide`?c+``+l:c+``+q(this.op)+``+l}else{var u=i.map(function(t,n){return t=t.toHTML(e),a[n]&&(t=`(`+t+`)`),t});return i.length>2&&(this.getIdentifier()===`OperatorNode:add`||this.getIdentifier()===`OperatorNode:multiply`)?this.implicit&&this.getIdentifier()===`OperatorNode:multiply`&&n===`hide`?u.join(``):u.join(``+q(this.op)+``):``+q(this.fn)+`(`+u.join(`,`)+`)`}}_toTex(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=X[this.fn];if(o=o===void 0?this.op:o,i.length===1){var s=Tn(this,t),c=i[0].toTex(e);return a[0]&&(c=`\\left(${c}\\right)`),s===`right`?o+c:c+o}else if(i.length===2){var l=i[0],u=l.toTex(e);a[0]&&(u=`\\left(${u}\\right)`);var d=i[1].toTex(e);a[1]&&(d=`\\left(${d}\\right)`);var f=t===`keep`?l.getIdentifier():l.getContent().getIdentifier();switch(this.getIdentifier()){case`OperatorNode:divide`:return o+`{`+u+`}{`+d+`}`;case`OperatorNode:pow`:switch(u=`{`+u+`}`,d=`{`+d+`}`,f){case`ConditionalNode`:case`OperatorNode:divide`:u=`\\left(${u}\\right)`}break;case`OperatorNode:multiply`:if(this.implicit&&n===`hide`)return u+`~`+d}return u+o+d}else if(i.length>2&&(this.getIdentifier()===`OperatorNode:add`||this.getIdentifier()===`OperatorNode:multiply`)){var p=i.map(function(t,n){return t=t.toTex(e),a[n]&&(t=`\\left(${t}\\right)`),t});return this.getIdentifier()===`OperatorNode:multiply`&&this.implicit&&n===`hide`?p.join(`~`):p.join(o)}else return`\\mathrm{`+this.fn+`}\\left(`+i.map(function(t){return t.toTex(e)}).join(`,`)+`\\right)`}getIdentifier(){return this.type+`:`+this.fn}}return J(i,`name`,Tr),i},{isClass:!0,isNode:!0}),Dr=`ParenthesisNode`,Or=K(Dr,[`Node`],e=>{var{Node:t}=e;class n extends t{constructor(e){if(super(),!B(e))throw TypeError(`Node expected for parameter "content"`);this.content=e}get type(){return Dr}get isParenthesisNode(){return!0}_compile(e,t){return this.content._compile(e,t)}getContent(){return this.content.getContent()}forEach(e){e(this.content,`content`,this)}map(e){return new n(e(this.content,`content`,this))}clone(){return new n(this.content)}_toString(e){return!e||e&&!e.parenthesis||e&&e.parenthesis===`keep`?`(`+this.content.toString(e)+`)`:this.content.toString(e)}toJSON(){return{mathjs:Dr,content:this.content}}static fromJSON(e){return new n(e.content)}_toHTML(e){return!e||e&&!e.parenthesis||e&&e.parenthesis===`keep`?`(`+this.content.toHTML(e)+`)`:this.content.toHTML(e)}_toTex(e){return!e||e&&!e.parenthesis||e&&e.parenthesis===`keep`?`\\left(${this.content.toTex(e)}\\right)`:this.content.toTex(e)}}return J(n,`name`,Dr),n},{isClass:!0,isNode:!0}),kr=`RangeNode`,Ar=K(kr,[`Node`],e=>{var{Node:t}=e;function n(e,t,n){var r=Y(e,t,n),i={},a=Y(e.start,t,n);if(i.start=a!==null&&a<=r||t===`all`,e.step){var o=Y(e.step,t,n);i.step=o!==null&&o<=r||t===`all`}var s=Y(e.end,t,n);return i.end=s!==null&&s<=r||t===`all`,i}class r extends t{constructor(e,t,n){if(super(),!B(e)||!B(t)||n&&!B(n))throw TypeError(`Node expected`);if(arguments.length>3)throw Error(`Too many arguments`);this.start=e,this.end=t,this.step=n||null}get type(){return kr}get isRangeNode(){return!0}needsEnd(){return this.filter(function(e){return V(e)&&e.name===`end`}).length>0}_compile(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))}}else return function(e,t,a){return n(r(e,t,a),i(e,t,a))}}forEach(e){e(this.start,`start`,this),e(this.end,`end`,this),this.step&&e(this.step,`step`,this)}map(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)))}clone(){return new r(this.start,this.end,this.step&&this.step)}_toString(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,r=n(this,t,e&&e.implicit),i,a=this.start.toString(e);if(r.start&&(a=`(`+a+`)`),i=a,this.step){var o=this.step.toString(e);r.step&&(o=`(`+o+`)`),i+=`:`+o}var s=this.end.toString(e);return r.end&&(s=`(`+s+`)`),i+=`:`+s,i}toJSON(){return{mathjs:kr,start:this.start,end:this.end,step:this.step}}static fromJSON(e){return new r(e.start,e.end,e.step)}_toHTML(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,r=n(this,t,e&&e.implicit),i,a=this.start.toHTML(e);if(r.start&&(a=`(`+a+`)`),i=a,this.step){var o=this.step.toHTML(e);r.step&&(o=`(`+o+`)`),i+=`:`+o}var s=this.end.toHTML(e);return r.end&&(s=`(`+s+`)`),i+=`:`+s,i}_toTex(e){var t=e&&e.parenthesis?e.parenthesis:`keep`,r=n(this,t,e&&e.implicit),i=this.start.toTex(e);if(r.start&&(i=`\\left(${i}\\right)`),this.step){var a=this.step.toTex(e);r.step&&(a=`\\left(${a}\\right)`),i+=`:`+a}var o=this.end.toTex(e);return r.end&&(o=`\\left(${o}\\right)`),i+=`:`+o,i}}return J(r,`name`,kr),r},{isClass:!0,isNode:!0}),jr=`RelationalNode`,Mr=K(jr,[`Node`],e=>{var{Node:t}=e,n={equal:`==`,unequal:`!=`,smaller:`<`,larger:`>`,smallerEq:`<=`,largerEq:`>=`};class r extends t{constructor(e,t){if(super(),!Array.isArray(e))throw TypeError(`Parameter conditionals must be an array`);if(!Array.isArray(t))throw TypeError(`Parameter params must be an array`);if(e.length!==t.length-1)throw TypeError(`Parameter params must contain exactly one more element than parameter conditionals`);this.conditionals=e,this.params=t}get type(){return jr}get isRelationalNode(){return!0}_compile(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),c=0;ce(t,`params[`+n+`]`,this),this)}map(e){return new r(this.conditionals.slice(),this.params.map((t,n)=>this._ifNode(e(t,`params[`+n+`]`,this)),this))}clone(){return new r(this.conditionals,this.params)}_toString(e){for(var t=e&&e.parenthesis?e.parenthesis:`keep`,r=Y(this,t,e&&e.implicit),i=this.params.map(function(n,i){var a=Y(n,t,e&&e.implicit);return t===`all`||a!==null&&a<=r?`(`+n.toString(e)+`)`:n.toString(e)}),a=i[0],o=0;o(`+n.toHTML(e)+`)`:n.toHTML(e)}),a=i[0],o=0;o`+q(n[this.conditionals[o]])+``+i[o+1];return a}_toTex(e){for(var t=e&&e.parenthesis?e.parenthesis:`keep`,n=Y(this,t,e&&e.implicit),r=this.params.map(function(r,i){var a=Y(r,t,e&&e.implicit);return t===`all`||a!==null&&a<=n?`\\left(`+r.toTex(e)+`\right)`:r.toTex(e)}),i=r[0],a=0;a{var{math:t,Unit:n,Node:r}=e;function i(e){return n?n.isValuelessUnit(e):!1}class a extends r{constructor(e){if(super(),typeof e!=`string`)throw TypeError(`String expected for parameter "name"`);this.name=e}get type(){return`SymbolNode`}get isSymbolNode(){return!0}_compile(e,t){var r=this.name;if(t[r]===!0)return function(e,t,n){return p(t,r)};if(r in e)return function(t,n,i){return t.has(r)?t.get(r):p(e,r)};var o=i(r);return function(e,t,i){return e.has(r)?e.get(r):o?new n(null,r):a.onUndefinedSymbol(r)}}forEach(e){}map(e){return this.clone()}static onUndefinedSymbol(e){throw Error(`Undefined symbol `+e)}clone(){return new a(this.name)}_toString(e){return this.name}_toHTML(e){var t=q(this.name);return t===`true`||t===`false`?``+t+``:t===`i`?``+t+``:t===`Infinity`?``+t+``:t===`NaN`?``+t+``:t===`null`?``+t+``:t===`undefined`?``+t+``:``+t+``}toJSON(){return{mathjs:`SymbolNode`,name:this.name}}static fromJSON(e){return new a(e.name)}_toTex(e){var n=!1;t[this.name]===void 0&&i(this.name)&&(n=!0);var r=hr(this.name,n);return r[0]===`\\`?r:` `+r}}return a},{isClass:!0,isNode:!0}),Pr=`FunctionNode`,Fr=K(Pr,[`math`,`Node`,`SymbolNode`],e=>{var t,{math:n,Node:r,SymbolNode:i}=e,a=e=>mn(e,{truncate:78});function o(e,t,n){for(var r=``,i=/\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi,a=0,o;(o=i.exec(e))!==null;)if(r+=e.substring(a,o.index),a=o.index,o[0]===`$$`)r+=`$`,a++;else{a+=o[0].length;var s=t[o[1]];if(!s)throw ReferenceError(`Template: Property `+o[1]+` does not exist.`);if(o[2]===void 0)switch(typeof s){case`string`:r+=s;break;case`object`:if(B(s))r+=s.toTex(n);else if(Array.isArray(s))r+=s.map(function(e,t){if(B(e))return e.toTex(n);throw TypeError(`Template: `+o[1]+`[`+t+`] is not a Node.`)}).join(`,`);else throw TypeError(`Template: `+o[1]+` has to be a Node, String or array of Nodes`);break;default:throw TypeError(`Template: `+o[1]+` has to be a Node, String or array of Nodes`)}else if(B(s[o[2]]&&s[o[2]]))r+=s[o[2]].toTex(n);else throw TypeError(`Template: `+o[1]+`[`+o[2]+`] is not a Node.`)}return r+=e.slice(a),r}class s extends r{constructor(e,t,n){if(super(),typeof e==`string`&&(e=new i(e)),!B(e))throw TypeError(`Node expected as parameter "fn"`);if(!Array.isArray(t)||!t.every(B))throw TypeError(`Array containing Nodes expected for parameter "args"`);var r=typeof n;if(!(r===`undefined`||r===`boolean`))throw TypeError(`optional flag, if specified, must be boolean`);this.fn=e,this.args=t||[],this.optional=!!n}get name(){return this.fn.name||``}get type(){return Pr}get isFunctionNode(){return!0}_compile(e,t){var n=this.args.map(n=>n._compile(e,t)),r=this.optional||L(this.fn)&&this.fn.optionalChaining;if(V(this.fn)){var i=this.fn.name;if(t[i]){var o=this.args;return function(t,s,c){var l=p(s,i);if(!(r&&l===void 0)){if(typeof l!=`function`)throw TypeError(`Argument '${i}' was not a function; received: ${a(l)}`);if(l.rawArgs)return l(o,e,wr(t,s));var u=n.map(e=>e(t,s,c));return l.apply(l,u)}}}else{var c=i in e?p(e,i):void 0,l=typeof c==`function`&&c.rawArgs===!0,u=t=>{var n;if(t.has(i))n=t.get(i);else if(i in e)n=p(e,i);else if(r)n=void 0;else return s.onUndefinedFunction(i);if(typeof n==`function`||r&&n===void 0)return n;throw TypeError(`'${i}' is not a function; its value is: + ${a(n)}`)};if(l){var d=this.args;return function(t,r,i){var a=u(t);return a.rawArgs===!0?a(d,e,wr(t,r)):a(...n.map(e=>e(t,r,i)))}}else switch(n.length){case 0:return function(e,t,n){var i=u(e);if(!(r&&i===void 0))return i()};case 1:return function(e,t,i){var a=u(e);if(!(r&&a===void 0)){var o=n[0];return a(o(e,t,i))}};case 2:return function(e,t,i){var a=u(e);if(!(r&&a===void 0)){var o=n[0],s=n[1];return a(o(e,t,i),s(e,t,i))}};default:return function(e,t,i){var a=u(e);if(!(r&&a===void 0))return a(...n.map(n=>n(e,t,i)))}}}}else if(L(this.fn)&&z(this.fn.index)&&this.fn.index.isObjectProperty()){var f=this.fn.object._compile(e,t),m=this.fn.index.getObjectProperty(),h=this.args;return function(t,i,a){var o=f(t,i,a);if(!(r&&(o==null||o[m]===void 0))){var s=g(o,m);if(s!=null&&s.rawArgs)return s(h,e,wr(t,i));var c=n.map(e=>e(t,i,a));return s.apply(o,c)}}}else{var _=this.fn.toString(),v=this.fn._compile(e,t),y=this.args;return function(t,i,o){var s=v(t,i,o);if(!(r&&s===void 0)){if(typeof s!=`function`)throw TypeError(`Expression '${_}' did not evaluate to a function; value is: + ${a(s)}`);if(s.rawArgs)return s(y,e,wr(t,i));var c=n.map(e=>e(t,i,o));return s.apply(s,c)}}}}forEach(e){e(this.fn,`fn`,this);for(var t=0;t`+q(this.fn)+`(`+t.join(`,`)+`)`}toTex(e){var t;return e&&typeof e.handler==`object`&&H(e.handler,this.name)&&(t=e.handler[this.name](this,e)),t===void 0?super.toTex(e):t}_toTex(e){var t=this.args.map(function(t){return t.toTex(e)}),r;dr[this.name]&&(r=dr[this.name]),n[this.name]&&(typeof n[this.name].toTex==`function`||typeof n[this.name].toTex==`object`||typeof n[this.name].toTex==`string`)&&(r=n[this.name].toTex);var i;switch(typeof r){case`function`:i=r(this,e);break;case`string`:i=o(r,this,e);break;case`object`:switch(typeof r[t.length]){case`function`:i=r[t.length](this,e);break;case`string`:i=o(r[t.length],this,e);break}}return i===void 0?o(fr,this,e):i}getIdentifier(){return this.type+`:`+this.name}}return t=s,J(s,`name`,Pr),J(s,`onUndefinedFunction`,function(e){throw Error(`Undefined function `+e)}),J(s,`fromJSON`,function(e){return new t(e.fn,e.args)}),s},{isClass:!0,isNode:!0}),Ir=`parse`,Lr=K(Ir,[`typed`,`numeric`,`config`,`AccessorNode`,`ArrayNode`,`AssignmentNode`,`BlockNode`,`ConditionalNode`,`ConstantNode`,`FunctionAssignmentNode`,`FunctionNode`,`IndexNode`,`ObjectNode`,`OperatorNode`,`ParenthesisNode`,`RangeNode`,`RelationalNode`,`SymbolNode`],e=>{var{typed:t,numeric:n,config:r,AccessorNode:i,ArrayNode:a,AssignmentNode:o,BlockNode:s,ConditionalNode:c,ConstantNode:l,FunctionAssignmentNode:u,FunctionNode:f,IndexNode:p,ObjectNode:m,OperatorNode:h,ParenthesisNode:g,RangeNode:_,RelationalNode:v,SymbolNode:y}=e,b=t(Ir,{string:function(e){return ae(e,{})},"Array | Matrix":function(e){return x(e,{})},"string, Object":function(e,t){return ae(e,t.nodes===void 0?{}:t.nodes)},"Array | Matrix, Object":x});function x(e){var t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{},n=t.nodes===void 0?{}:t.nodes;return Pn(e,function(e){if(typeof e!=`string`)throw TypeError(`String expected`);return ae(e,n)})}var S={NULL:0,DELIMITER:1,NUMBER:2,SYMBOL:3,UNKNOWN:4},ee={",":!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,">>":!0,">>>":!0},te={mod:!0,to:!0,in:!0,and:!0,xor:!0,or:!0,not:!0},ne={true:!0,false:!1,null:null,undefined:void 0},C=[`NaN`,`Infinity`],w={'"':`"`,"'":`'`,"\\":`\\`,"/":`/`,b:`\b`,f:`\f`,n:` +`,r:`\r`,t:` `};function re(){return{extraNodes:{},expression:``,comment:``,index:0,token:``,tokenType:S.NULL,nestingLevel:0,conditionalLevel:null}}function T(e,t){return e.expression.substr(e.index,t)}function E(e){return T(e,1)}function D(e){e.index++}function O(e){return e.expression.charAt(e.index-1)}function k(e){return e.expression.charAt(e.index+1)}function A(e){for(e.tokenType=S.NULL,e.token=``,e.comment=``;;){if(E(e)===`#`)for(;E(e)!==` +`&&E(e)!==``;)e.comment+=E(e),D(e);if(b.isWhitespace(E(e),e.nestingLevel))D(e);else break}if(E(e)===``){e.tokenType=S.DELIMITER;return}if(E(e)===` +`&&!e.nestingLevel){e.tokenType=S.DELIMITER,e.token=E(e),D(e);return}var t=E(e),n=T(e,2),r=T(e,3);if(r.length===3&&ee[r]){e.tokenType=S.DELIMITER,e.token=r,D(e),D(e),D(e);return}if(n.length===2&&ee[n]&&(n!==`?.`||!b.isDigit(e.expression.charAt(e.index+2)))){e.tokenType=S.DELIMITER,e.token=n,D(e),D(e);return}if(ee[t]){e.tokenType=S.DELIMITER,e.token=t,D(e);return}if(b.isDigitDot(t)){e.tokenType=S.NUMBER;var i=T(e,2);if(i===`0b`||i===`0o`||i===`0x`){for(e.token+=E(e),D(e),e.token+=E(e),D(e);b.isAlpha(E(e),O(e),k(e))||b.isDigit(E(e));)e.token+=E(e),D(e);if(E(e)===`.`)for(e.token+=`.`,D(e);b.isAlpha(E(e),O(e),k(e))||b.isDigit(E(e));)e.token+=E(e),D(e);else if(E(e)===`i`)for(e.token+=`i`,D(e);b.isDigit(E(e));)e.token+=E(e),D(e);return}if(E(e)===`.`){if(e.token+=E(e),D(e),!b.isDigit(E(e))){e.tokenType=S.DELIMITER;return}}else{for(;b.isDigit(E(e));)e.token+=E(e),D(e);b.isDecimalMark(E(e),k(e))&&(e.token+=E(e),D(e))}for(;b.isDigit(E(e));)e.token+=E(e),D(e);if(E(e)===`E`||E(e)===`e`){if(b.isDigit(k(e))||k(e)===`-`||k(e)===`+`){if(e.token+=E(e),D(e),(E(e)===`+`||E(e)===`-`)&&(e.token+=E(e),D(e)),!b.isDigit(E(e)))throw U(e,`Digit expected, got "`+E(e)+`"`);for(;b.isDigit(E(e));)e.token+=E(e),D(e);if(b.isDecimalMark(E(e),k(e)))throw U(e,`Digit expected, got "`+E(e)+`"`)}else if(b.isDecimalMark(k(e),e.expression.charAt(e.index+2)))throw D(e),U(e,`Digit expected, got "`+E(e)+`"`)}return}if(b.isAlpha(E(e),O(e),k(e))){for(;b.isAlpha(E(e),O(e),k(e))||b.isDigit(E(e));)e.token+=E(e),D(e);H(te,e.token)?e.tokenType=S.DELIMITER:e.tokenType=S.SYMBOL;return}for(e.tokenType=S.UNKNOWN;E(e)!==``;)e.token+=E(e),D(e);throw U(e,`Syntax error in part "`+e.token+`"`)}function j(e){do A(e);while(e.token===` +`)}function ie(e){e.nestingLevel++}function M(e){e.nestingLevel--}b.isAlpha=function(e,t,n){return b.isValidLatinOrGreek(e)||b.isValidMathSymbol(e,n)||b.isValidMathSymbol(t,e)},b.isValidLatinOrGreek=function(e){return/^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(e)},b.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)},b.isWhitespace=function(e,t){return e===` `||e===` `||e===`\xA0`||e===` +`&&t>0},b.isDecimalMark=function(e,t){return e===`.`&&t!==`/`&&t!==`*`&&t!==`^`},b.isDigitDot=function(e){return e>=`0`&&e<=`9`||e===`.`},b.isDigit=function(e){return e>=`0`&&e<=`9`};function ae(e,t){var n=re();d(n,{expression:e,extraNodes:t}),A(n);var r=oe(n);if(n.token!==``)throw n.tokenType===S.DELIMITER?Le(n,`Unexpected operator `+n.token):U(n,`Unexpected part "`+n.token+`"`);return r}function oe(e){var t,n=[],r;for(e.token!==``&&e.token!==` +`&&e.token!==`;`&&(t=N(e),e.comment&&(t.comment=e.comment));e.token===` +`||e.token===`;`;)n.length===0&&t&&(r=e.token!==`;`,n.push({node:t,visible:r})),A(e),e.token!==` +`&&e.token!==`;`&&e.token!==``&&(t=N(e),e.comment&&(t.comment=e.comment),r=e.token!==`;`,n.push({node:t,visible:r}));return n.length>0?new s(n):(t||(t=new l(void 0),e.comment&&(t.comment=e.comment)),t)}function N(e){var t,n,r,i,a=se(e);if(e.token===`=`){if(V(a))return t=a.name,j(e),r=N(e),new o(new y(t),r);if(L(a)){if(a.optionalChaining)throw U(e,`Cannot assign to optional chain`);return j(e),r=N(e),new o(a.object,a.index,r)}else if(xe(a)&&V(a.fn)&&(i=!0,n=[],t=a.name,a.args.forEach(function(e,t){V(e)?n[t]=e.name:i=!1}),i))return j(e),r=N(e),new u(t,n,r);throw U(e,`Invalid left hand side of assignment operator =`)}return a}function se(e){for(var t=ce(e);e.token===`?`;){var n=e.conditionalLevel;e.conditionalLevel=e.nestingLevel,j(e);var r=t,i=N(e);if(e.token!==`:`)throw U(e,`False part of conditional expression expected`);e.conditionalLevel=null,j(e),t=new c(r,i,N(e)),e.conditionalLevel=n}return t}function ce(e){for(var t=le(e);e.token===`or`;)j(e),t=new h(`or`,`or`,[t,le(e)]);return t}function le(e){for(var t=ue(e);e.token===`xor`;)j(e),t=new h(`xor`,`xor`,[t,ue(e)]);return t}function ue(e){for(var t=de(e);e.token===`and`;)j(e),t=new h(`and`,`and`,[t,de(e)]);return t}function de(e){for(var t=P(e);e.token===`|`;)j(e),t=new h(`|`,`bitOr`,[t,P(e)]);return t}function P(e){for(var t=F(e);e.token===`^|`;)j(e),t=new h(`^|`,`bitXor`,[t,F(e)]);return t}function F(e){for(var t=fe(e);e.token===`&`;)j(e),t=new h(`&`,`bitAnd`,[t,fe(e)]);return t}function fe(e){for(var t=[pe(e)],n=[],r={"==":`equal`,"!=":`unequal`,"<":`smaller`,">":`larger`,"<=":`smallerEq`,">=":`largerEq`};H(r,e.token);){var i={name:e.token,fn:r[e.token]};n.push(i),j(e),t.push(pe(e))}return t.length===1?t[0]:t.length===2?new h(n[0].name,n[0].fn,t):new v(n.map(e=>e.fn),t)}function pe(e){for(var t=I(e),n,r,i,a={"<<":`leftShift`,">>":`rightArithShift`,">>>":`rightLogShift`};H(a,e.token);)n=e.token,r=a[n],j(e),i=[t,I(e)],t=new h(n,r,i);return t}function I(e){for(var t=me(e),n,r,i,a={to:`to`,in:`to`};H(a,e.token);)n=e.token,r=a[n],j(e),n===`in`&&`])},;`.includes(e.token)?t=new h(`*`,`multiply`,[t,new y(`in`)],!0):(i=[t,me(e)],t=new h(n,r,i));return t}function me(e){var t,n=[];if(t=e.token===`:`?new l(1):he(e),e.token===`:`&&e.conditionalLevel!==e.nestingLevel){for(n.push(t);e.token===`:`&&n.length<3;)j(e),e.token===`)`||e.token===`]`||e.token===`,`||e.token===``?n.push(new y(`end`)):n.push(he(e));t=n.length===3?new _(n[0],n[2],n[1]):new _(n[0],n[1])}return t}function he(e){for(var t=ge(e),n,r,i,a={"+":`add`,"-":`subtract`};H(a,e.token);){n=e.token,r=a[n],j(e);var o=ge(e);i=o.isPercentage?[t,new h(`*`,`multiply`,[t,o])]:[t,o],t=new h(n,r,i)}return t}function ge(e){for(var t=_e(e),n=t,r,i,a={"*":`multiply`,".*":`dotMultiply`,"/":`divide`,"./":`dotDivide`,"%":`mod`,mod:`mod`};H(a,e.token);)r=e.token,i=a[r],j(e),n=_e(e),t=new h(r,i,[t,n]);return t}function _e(e){for(var t=ve(e),n=t;e.tokenType===S.SYMBOL||e.token===`in`&&R(t)||e.token===`in`&&Ce(t)&&t.fn===`unaryMinus`&&R(t.args[0])||e.tokenType===S.NUMBER&&!R(n)&&(!Ce(n)||n.op===`!`)||e.token===`(`;)n=ve(e),t=new h(`*`,`multiply`,[t,n],!0);return t}function ve(e){for(var t=be(e),n=t,r=[];e.token===`/`&&ye(n);)if(r.push(d({},e)),j(e),e.tokenType===S.NUMBER)if(r.push(d({},e)),j(e),e.tokenType===S.SYMBOL||e.token===`(`||e.token===`in`)d(e,r.pop()),r.pop(),n=be(e),t=new h(`/`,`divide`,[t,n]);else{r.pop(),d(e,r.pop());break}else{d(e,r.pop());break}return t}function be(e){var t=z(e);if(e.token===`%`){var n=d({},e);j(e);try{z(e),d(e,n)}catch{t=new h(`/`,`divide`,[t,new l(100)],!1,!0)}}return t}function z(e){var t,n,r,i={"-":`unaryMinus`,"+":`unaryPlus`,"~":`bitNot`,not:`not`};return H(i,e.token)?(r=i[e.token],t=e.token,j(e),n=[z(e)],new h(t,r,n)):B(e)}function B(e){var t=Se(e),n,r,i;return(e.token===`^`||e.token===`.^`)&&(n=e.token,r=n===`^`?`pow`:`dotPow`,j(e),i=[t,z(e)],t=new h(n,r,i)),t}function Se(e){for(var t=we(e);e.token===`??`;)j(e),t=new h(`??`,`nullish`,[t,we(e)]);return t}function we(e){for(var t=Te(e),n,r,i,a={"!":`factorial`,"'":`ctranspose`};H(a,e.token);)n=e.token,r=a[n],A(e),i=[t],t=new h(n,r,i),t=De(e,t);return t}function Te(e){var t=[];if(e.tokenType===S.SYMBOL&&H(e.extraNodes,e.token)){var n=e.extraNodes[e.token];if(A(e),e.token===`(`){if(t=[],ie(e),A(e),e.token!==`)`)for(t.push(N(e));e.token===`,`;)A(e),t.push(N(e));if(e.token!==`)`)throw U(e,`Parenthesis ) expected`);M(e),A(e)}return new n(t)}return Ee(e)}function Ee(e){var t,r;return e.tokenType===S.SYMBOL||e.tokenType===S.DELIMITER&&e.token in te?(r=e.token,A(e),t=H(ne,r)?new l(ne[r]):C.includes(r)?new l(n(r,`number`)):new y(r),t=De(e,t),t):Oe(e)}function De(e,t,n){for(var r;;){var a=!1;e.token===`?.`&&(a=!0,A(e));var o=(e.token===`(`||e.token===`[`||e.token===`.`)&&(!n||n.includes(e.token));if(!(a||o))break;if(r=[],e.token===`(`)if(a||V(t)||L(t)){if(ie(e),A(e),e.token!==`)`)for(r.push(N(e));e.token===`,`;)A(e),r.push(N(e));if(e.token!==`)`)throw U(e,`Parenthesis ) expected`);M(e),A(e),t=new f(t,r,a)}else return t;else if(e.token===`[`){if(ie(e),A(e),e.token!==`]`)for(r.push(N(e));e.token===`,`;)A(e),r.push(N(e));if(e.token!==`]`)throw U(e,`Parenthesis ] expected`);M(e),A(e),t=new i(t,new p(r),a)}else{if(a||A(e),!(e.tokenType===S.SYMBOL||e.tokenType===S.DELIMITER&&e.token in te)){var s=`Property name expected after `;throw s+=a?`optional chain`:`dot`,U(e,s)}r.push(new l(e.token)),A(e),t=new i(t,new p(r,!0),a)}}return t}function Oe(e){var t,n;return e.token===`"`||e.token===`'`?(n=ke(e,e.token),t=new l(n),t=De(e,t),t):Ae(e)}function ke(e,t){for(var n=``;E(e)!==``&&E(e)!==t;)if(E(e)===`\\`){D(e);var r=E(e),i=w[r];if(i!==void 0)n+=i,e.index+=1;else if(r===`u`){var a=e.expression.slice(e.index+1,e.index+5);if(/^[0-9A-Fa-f]{4}$/.test(a))n+=String.fromCharCode(parseInt(a,16)),e.index+=5;else throw U(e,`Invalid unicode character \\u${a}`)}else throw U(e,`Bad escape character \\${r}`)}else n+=E(e),D(e);if(A(e),e.token!==t)throw U(e,`End of string ${t} expected`);return A(e),n}function Ae(e){var t,n,r,i;if(e.token===`[`){if(ie(e),A(e),e.token!==`]`){var o=je(e);if(e.token===`;`){for(r=1,n=[o];e.token===`;`;)A(e),e.token!==`]`&&(n[r]=je(e),r++);if(e.token!==`]`)throw U(e,`End of matrix ] expected`);M(e),A(e),i=n[0].items.length;for(var s=1;s{var{typed:t,parse:n}=e;return t(Rr,{string:function(e){var t=te();return n(e).compile().evaluate(t)},"string, Map | Object":function(e,t){return n(e).compile().evaluate(t)},"Array | Matrix":function(e){var t=te();return Pn(e,function(e){return n(e).compile().evaluate(t)})},"Array | Matrix, Map | Object":function(e,t){return Pn(e,function(e){return n(e).compile().evaluate(t)})}})}),Br=`size`,Vr=K(Br,[`typed`],e=>{var{typed:t}=e;return t(Br,{Matrix:e=>e.size(),Array:kn,string:e=>[e.length],"number | Complex | BigNumber | Unit | boolean | null":e=>[]})}),Hr=`factorial`,Ur=K(Hr,[`typed`,`gamma`],e=>{var{typed:t,gamma:n}=e;return t(Hr,{number:function(e){if(e<0)throw Error(`Value must be non-negative`);return n(e+1)},BigNumber:function(e){if(e.isNegative())throw Error(`Value must be non-negative`);return n(e.plus(1))},"Array | Matrix":t.referToSelf(e=>t=>Pn(t,e))})}),Wr=`isBounded`,Gr=K(Wr,[`typed`],e=>{var{typed:t}=e;return t(Wr,{number:e=>Number.isFinite(e),"BigNumber | Complex":e=>e.isFinite(),"bigint | Fraction":()=>!0,"null | undefined":()=>!1,Unit:t.referToSelf(e=>t=>e(t.value)),"Array | Matrix":t.referToSelf(e=>t=>(Array.isArray(t)||(t=t.valueOf()),t.every(t=>e(t))))})}),Kr=K(`numeric`,[`number`,`?bignumber`,`?fraction`],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):Jt,bigint:e=>BigInt(e),Fraction:r?e=>r(e):Yt};return function(e){var t=arguments.length>1&&arguments[1]!==void 0?arguments[1]:`number`;if((arguments.length>2?arguments[2]:void 0)!==void 0)throw SyntaxError(`numeric() takes one or two arguments`);var n=Oe(e);if(!(n in i))throw TypeError(`Cannot convert `+e+` of type "`+n+`"; valid input types are `+Object.keys(i).join(`, `));if(!(t in a))throw TypeError(`Cannot convert `+e+` to type "`+t+`"; valid output types are `+Object.keys(a).join(`, `));return t===n?e:a[t](e)}}),qr=Z(`abs`,ct),Jr=Z(`exp`,_t),Yr=Z(`gcd`,yt),Xr=Z(`lcm`,bt),Zr=Z(`log10`,St),Qr=Z(`log2`,Ct),$r=Z(`mod`,Tt),ei=Z(`multiply`,dt),ti=mi(`nthRoot`,Et),ni=Z(`sign`,Dt),ri=Z(`sqrt`,Ot),ii=Z(`subtract`,ut),ai=Z(`pow`,jt),oi=mi(`round`,Mt),si=mi(`log`,xt),ci=Z(`log1p`,wt),li=Z(`add`,lt),ui=Z(`divide`,ft),di=K(`matrix`,[],()=>Xt),fi=K(`subset`,[],()=>Zt);Z(`combinations`,Ft);var pi=Z(`gamma`,Rt);Z(`lgamma`,Ut);function Z(e,t){return K(e,[`typed`],e=>{var{typed:n}=e;return n(t)})}function mi(e,t){return K(e,[`typed`],e=>{var{typed:n}=e;return n({number:t,"number,number":t})})}function hi(e,t,n,r){if(!(this instanceof hi))throw 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+(r==null?``:`-`+r)+` expected)`,this.stack=Error().stack}hi.prototype=Error(),hi.prototype.constructor=Error,hi.prototype.name=`ArgumentsError`,hi.prototype.isArgumentsError=!0;var Q={createTyped:tn},gi={typedDependencies:Q,createAbs:qr},$={createNode:Yn},_i={createSubset:fi},vi={NodeDependencies:$,subsetDependencies:_i,createAccessorNode:$n},yi={typedDependencies:Q,createAdd:li},bi={NodeDependencies:$,createArrayNode:tr},xi={matrixDependencies:{createMatrix:di},NodeDependencies:$,subsetDependencies:_i,createAssignmentNode:ir},Si={gammaDependencies:{typedDependencies:Q,createGamma:pi},typedDependencies:Q,createFactorial:Ur},Ci={typedDependencies:Q,createNumber:qn},wi={typedDependencies:Q,createPow:ai},Ti={NodeDependencies:$,ResultSetDependencies:{createResultSet:sn},createBlockNode:or},Ei={typedDependencies:Q,createRound:oi},Di={NodeDependencies:$,createConditionalNode:cr},Oi={NodeDependencies:$,isBoundedDependencies:{typedDependencies:Q,createIsBounded:Gr},createConstantNode:_r},ki={NodeDependencies:$,typedDependencies:Q,createFunctionAssignmentNode:yr},Ai={NodeDependencies:$,createSymbolNode:Nr},ji={AccessorNodeDependencies:vi,ArrayNodeDependencies:bi,AssignmentNodeDependencies:xi,BlockNodeDependencies:Ti,ConditionalNodeDependencies:Di,ConstantNodeDependencies:Oi,FunctionAssignmentNodeDependencies:ki,FunctionNodeDependencies:{NodeDependencies:$,SymbolNodeDependencies:Ai,createFunctionNode:Fr},IndexNodeDependencies:{NodeDependencies:$,sizeDependencies:{typedDependencies:Q,createSize:Vr},createIndexNode:xr},ObjectNodeDependencies:{NodeDependencies:$,createObjectNode:Cr},OperatorNodeDependencies:{NodeDependencies:$,createOperatorNode:Er},ParenthesisNodeDependencies:{NodeDependencies:$,createParenthesisNode:Or},RangeNodeDependencies:{NodeDependencies:$,createRangeNode:Ar},RelationalNodeDependencies:{NodeDependencies:$,createRelationalNode:Mr},SymbolNodeDependencies:Ai,numericDependencies:{numberDependencies:Ci,createNumeric:Kr},typedDependencies:Q,createParse:Lr},Mi={typedDependencies:Q,createDivide:ui},Ni={typedDependencies:Q,createMultiply:ei},Pi={typedDependencies:Q,createSqrt:ri},Fi={typedDependencies:Q,createSubtract:ii},Ii={createE:Vn},Li={parseDependencies:ji,typedDependencies:Q,createEvaluate:zr},Ri={typedDependencies:Q,createExp:Jr},zi={typedDependencies:Q,createGcd:Yr},Bi={typedDependencies:Q,createLcm:Xr},Vi={typedDependencies:Q,createLog:si},Hi={typedDependencies:Q,createLog10:Zr},Ui={typedDependencies:Q,createLog1p:ci},Wi={typedDependencies:Q,createLog2:Qr},Gi={typedDependencies:Q,createMod:$r},Ki={typedDependencies:Q,createNthRoot:ti},qi={createPi:Bn},Ji={typedDependencies:Q,createSign:ni},Yi=u(c(((e,t)=>{function n(){}n.prototype={on:function(e,t,n){var r=this.e||={};return(r[e]||(r[e]=[])).push({fn:t,ctx:n}),this},once:function(e,t,n){var r=this;function i(){r.off(e,i),t.apply(n,arguments)}return i._=t,this.on(e,i,n)},emit:function(e){for(var t=[].slice.call(arguments,1),n=((this.e||={})[e]||[]).slice(),r=0,i=n.length;rr(e,t));else if(P(n)||d(n))for(var a in n)H(n,a)&&r(e,n[a],a);else if(Wt(n)||i!==void 0){var o=Wt(n)?h(n)?n.fn+`.transform`:n.fn:i;if(H(e,o)&&e[o]!==n&&!t.silent)throw Error(`Cannot import "`+o+`" twice`);e[o]=n}else if(!t.silent)throw TypeError(`Factory, Object, or Array expected`)}var i={};for(var o in r(i,e),i)if(H(i,o)){var s=i[o];if(Wt(s))l(s,t);else if(u(s))a(o,s,t);else if(!t.silent)throw TypeError(`Factory, Object, or Array expected`)}}function a(t,i,a){if(a.wrap&&typeof i==`function`&&(i=c(i)),f(i)&&(i=e(t,{[i.signature]:i})),e.isTypedFunction(n[t])&&e.isTypedFunction(i)){i=a.override?e(t,i.signatures):e(n[t],i),n[t]=i,delete r[t],o(t,i),n.emit(`import`,t,function(){return i});return}var s=n[t]!==void 0,l=n.Unit?.isValuelessUnit(t);if(!s&&!l||a.override){n[t]=i,delete r[t],o(t,i),n.emit(`import`,t,function(){return i});return}if(!a.silent)throw Error(`Cannot import "`+t+`": already exists`)}function o(e,t){t&&typeof t.transform==`function`?(n.expression.transform[e]=t.transform,p(e)&&(n.expression.mathWithTransform[e]=t.transform)):(delete n.expression.transform[e],p(e)&&(n.expression.mathWithTransform[e]=t))}function s(e){delete n.expression.transform[e],p(e)?n.expression.mathWithTransform[e]=n[e]:delete n.expression.mathWithTransform[e]}function c(e){var t=function(){for(var t=[],r=0,i=arguments.length;r2&&arguments[2]!==void 0?arguments[2]:t.fn;if(a.includes(`.`))throw Error(`Factory name should not contain a nested path. Name: `+JSON.stringify(a));var o=h(t)?n.expression.transform:n,c=a in n.expression.transform,l=H(o,a)?o[a]:void 0,u=function(){var r={};t.dependencies.map(qt).forEach(e=>{if(e.includes(`.`))throw Error(`Factory dependency should not contain a nested path. Name: `+JSON.stringify(e));e===`math`?r.math=n:e===`mathWithTransform`?r.mathWithTransform=n.expression.mathWithTransform:e===`classes`?r.classes=n:r[e]=n[e]});var o=t(r);if(o&&typeof o.transform==`function`)throw Error(`Transforms cannot be attached to factory functions. Please create a separate function for it with export const path = "expression.transform"`);if(l===void 0||i.override)return o;if(e.isTypedFunction(l)&&e.isTypedFunction(o))return e(l,o);if(i.silent)return l;throw Error(`Cannot import "`+a+`": already exists`)},d=t.meta?.formerly??``,f=h(t)||m(t),p=n.expression.mathWithTransform;!t.meta||t.meta.lazy!==!1?(Fe(o,a,u),d&&Fe(o,d,u),l&&c?(s(a),d&&s(d)):f&&(Fe(p,a,()=>o[a]),d&&Fe(p,d,()=>o[a]))):(o[a]=u(),d&&(o[d]=o[a]),l&&c?(s(a),d&&s(d)):f&&(Fe(p,a,()=>o[a]),d&&Fe(p,d,()=>o[a]))),r[a]=t,n.emit(`import`,a,u)}function u(e){return typeof e==`function`||typeof e==`number`||typeof e==`string`||typeof e==`boolean`||e===null||D(e)||T(e)||w(e)||E(e)||A(e)||Array.isArray(e)}function d(e){return typeof e==`object`&&e[Symbol.toStringTag]===`Module`}function f(e){return typeof e==`function`&&typeof e.signature==`string`}function p(e){return!H(g,e)}function m(e){return!e.fn.includes(`.`)&&!H(g,e.fn)&&(!e.meta||!e.meta.isClass)}function h(e){return e!==void 0&&e.meta!==void 0&&e.meta.isTransformFunction===!0||!1}var g={expression:!0,type:!0,docs:!0,error:!0,json:!0,chain:!0};return i}var Qi=u(Qt(),1);function $i(e,t){var n=d({},f,t);if(typeof Object.create!=`function`)throw Error(`ES5 not supported by this JavaScript engine. Please load the es5-shim and es5-sham library for compatibility.`);var r=Xi({isNumber:C,isComplex:T,isBigNumber:w,isBigInt:re,isFraction:E,isUnit:D,isString:O,isArray:k,isMatrix:A,isCollection:j,isDenseMatrix:ie,isSparseMatrix:M,isRange:ae,isIndex:oe,isBoolean:N,isResultSet:se,isHelp:ce,isFunction:le,isDate:ue,isRegExp:de,isObject:P,isMap:F,isPartitionedMap:fe,isObjectWrappingMap:pe,isNull:I,isUndefined:me,isAccessorNode:L,isArrayNode:he,isAssignmentNode:ge,isBlockNode:_e,isConditionalNode:ve,isConstantNode:R,isFunctionAssignmentNode:be,isFunctionNode:xe,isIndexNode:z,isNode:B,isObjectNode:Se,isOperatorNode:Ce,isParenthesisNode:we,isRangeNode:Te,isRelationalNode:Ee,isSymbolNode:V,isChain:De});r.config=ze(n,r.emit),r.expression={transform:{},mathWithTransform:{config:r.config}};var i=[],a=[];function o(e){if(Wt(e))return e(r);var t=e[Object.keys(e)[0]];if(Wt(t))return t(r);if(!Ie(e))throw console.warn("Factory object with properties `type`, `name`, and `factory` expected",e),Error("Factory object with properties `type`, `name`, and `factory` expected");var s=i.indexOf(e),c;return s===-1?(c=e.math===!0?e.factory(r.type,n,o,r.typed,r):e.factory(r.type,n,o,r.typed),i.push(e),a.push(c)):c=a[s],c}var s={};function c(){var e=[...arguments];return r.typed.apply(r.typed,e)}c.isTypedFunction=Qi.default.isTypedFunction;var l=Zi(c,o,r,s);return r.import=l,r.on(`config`,()=>{Object.values(s).forEach(e=>{e&&e.meta&&e.meta.recreateOnConfigChange&&l(e,{override:!0})})}),r.create=$i.bind(null,e),r.factory=K,r.import(Object.values(Ne(e))),r.ArgumentsError=hi,r.DimensionError=On,r.IndexError=Dn,r}const ea=e=>{let n=t(`results`),r=t(`answers`,{assert:!1});if(!r){let e=document.createElement(`h4`);e.setAttribute(`class`,`title`),e.setAttribute(`id`,`answers-title`),e.textContent=`Answers : `,r=document.createElement(`div`),r.setAttribute(`id`,`answers`),r.setAttribute(`role`,`complementary`),r.setAttribute(`aria-labelledby`,`answers-title`),r.appendChild(e)}if(!(e instanceof HTMLElement)){let t=document.createElement(`span`);t.innerHTML=e.toString(),e=t}r.appendChild(e),n.insertAdjacentElement(`afterbegin`,r)};var ta=class n extends e{constructor(){super(`calculator`)}static math=$i({...gi,...yi,...Mi,...Ii,...Li,...Ri,...Si,...zi,...Bi,...Hi,...Ui,...Wi,...Vi,...Gi,...Ni,...Ki,...qi,...wi,...Ei,...Ji,...Pi,...Fi});async run(){let e=t(`q`),r=n.math.parse(e.value);try{return`${r.toString()} = ${r.evaluate()}`}catch{return}}async post(e){ea(e)}};export{ta as default}; +//# sourceMappingURL=CGazvOKw.min.js.map \ No newline at end of file diff --git a/searx/static/themes/simple/chunk/CEKii0mQ.min.js.map b/searx/static/themes/simple/chunk/CGazvOKw.min.js.map similarity index 99% rename from searx/static/themes/simple/chunk/CEKii0mQ.min.js.map rename to searx/static/themes/simple/chunk/CGazvOKw.min.js.map index 1f71a5b14..1a06e6be1 100644 --- a/searx/static/themes/simple/chunk/CEKii0mQ.min.js.map +++ b/searx/static/themes/simple/chunk/CGazvOKw.min.js.map @@ -1 +1 @@ -{"version":3,"file":"CEKii0mQ.min.js","names":["e","clone","properties","name","log2","log10","cbrt","expm1","sign","format","toFixed","toExponential","toEngineering","digits","e","zeros","_toNumberOrDefault","toFixed","dependencies","name","create","factory","create","isPlainObject","name","last","params","self","s","generic","typedFunction","dependencies","createTyped","name","name","dependencies","format","digits","e","formatNumber","formatBigNumber","o","e","e","deepMap","arrayDeepMap","map","del","hasher","memoize","name","dependencies","create","name","dependencies","number","clone","self","name","dependencies","callback","name","dependencies","name","dependencies","index","name","dependencies","name","dependencies","name","dependencies","_extends","defaultEscapeMapFn","defaultEscapes","formatEscapes","_loop","isUnit","name","name","dependencies","name","dependencies","param","name","dependencies","name","dependencies","properties","name","dependencies","name","dependencies","name","dependencies","name","dependencies","self","name","dependencies","math","isUnit","name","dependencies","math","fn","name","dependencies","properties","name","dependencies","name","dependencies","name","dependencies","self","name","dependencies","self","name","e","name","self","Emitter","value","flatValues","name","wrapper","factory","resolver","dependencies","emitter.mixin","factory","typedFunction"],"sources":["../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/extends.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/config.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/customs.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/map.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/is.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/object.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/function/config.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/number.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/arithmetic.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/product.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/combinations.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/constants.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/probability.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/factory.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/noop.js","../../../../../client/simple/node_modules/typed-function/lib/umd/typed-function.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/function/typed.js","../../../../../client/simple/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/string.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/typeof.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/toPrimitive.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/defineProperty.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/operators.js","../../../../../client/simple/node_modules/mathjs/lib/esm/error/IndexError.js","../../../../../client/simple/node_modules/mathjs/lib/esm/error/DimensionError.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/array.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/collection.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/lruQueue.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/function.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/bignumber/constants.js","../../../../../client/simple/node_modules/mathjs/lib/esm/constants.js","../../../../../client/simple/node_modules/mathjs/lib/esm/type/number.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/keywords.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/Node.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/utils/access.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/utils/assign.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/BlockNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js","../../../../../client/simple/node_modules/escape-latex/dist/index.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/latex.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/IndexNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/scope.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/RangeNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/parse.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/function/evaluate.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/matrix/size.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/probability/factorial.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/utils/isBounded.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/utils/numeric.js","../../../../../client/simple/node_modules/mathjs/lib/esm/factoriesNumber.js","../../../../../client/simple/node_modules/mathjs/lib/esm/error/ArgumentsError.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsBounded.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js","../../../../../client/simple/node_modules/tiny-emitter/index.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/emitter.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/function/import.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/create.js","../../../../../client/simple/src/js/util/appendAnswerElement.ts","../../../../../client/simple/src/js/plugin/Calculator.ts"],"sourcesContent":["function _extends() {\n return _extends = Object.assign ? Object.assign.bind() : function (n) {\n for (var e = 1; e < arguments.length; e++) {\n var t = arguments[e];\n for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n }\n return n;\n }, _extends.apply(null, arguments);\n}\nexport { _extends as default };","export var DEFAULT_CONFIG = {\n // minimum relative difference between two compared values,\n // used by all comparison functions\n relTol: 1e-12,\n // minimum absolute difference between two compared values,\n // used by all comparison functions\n absTol: 1e-15,\n // type of default matrix output. Choose 'matrix' (default) or 'array'\n matrix: 'Matrix',\n // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'\n number: 'number',\n // type of fallback used for config { number: 'bigint' } when a value cannot be represented\n // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.\n numberFallback: '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 // legacy behavior for matrix subset. When true, the subset function\n // returns a matrix or array with the same size as the index (except for scalars).\n // When false, it returns a matrix or array with a size depending on the type of index.\n legacySubset: false\n};","import { hasOwnProperty } from './object.js';\n\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\nfunction getSafeProperty(object, prop) {\n // only allow getting safe properties of a plain object\n if (isSafeProperty(object, prop)) {\n return object[prop];\n }\n if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n throw new Error('Cannot access method \"' + prop + '\" as a property');\n }\n throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\nfunction setSafeProperty(object, prop, value) {\n // only allow setting safe properties of a plain object\n if (isSafeProperty(object, prop)) {\n object[prop] = value;\n return value;\n }\n throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Test whether a property is safe to use on an object or Array.\n * For example .toString and .constructor are not safe\n * @param {Object | Array} object\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty(object, prop) {\n if (!isPlainObject(object) && !Array.isArray(object)) {\n return false;\n }\n // SAFE: whitelisted\n // e.g length\n if (hasOwnProperty(safeNativeProperties, prop)) {\n return true;\n }\n // UNSAFE: inherited from Object prototype\n // e.g constructor\n if (prop in Object.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Object.prototype is a root object\n return false;\n }\n // UNSAFE: inherited from Function prototype\n // e.g call, apply\n if (prop in Function.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Function.prototype is a root object\n return false;\n }\n return true;\n}\n\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n * @return {function} Returns the method when valid\n */\nfunction getSafeMethod(object, method) {\n if (!isSafeMethod(object, method)) {\n throw new Error('No access to method \"' + method + '\"');\n }\n return object[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 */\nfunction isSafeMethod(object, method) {\n if (object === null || object === undefined || typeof object[method] !== 'function') {\n return false;\n }\n // UNSAFE: ghosted\n // e.g overridden toString\n // Note that IE10 doesn't support __proto__ and we can't do this check there.\n if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n return false;\n }\n // SAFE: whitelisted\n // e.g toString\n if (hasOwnProperty(safeNativeMethods, method)) {\n return true;\n }\n // UNSAFE: inherited from Object prototype\n // e.g constructor\n if (method in Object.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Object.prototype is a root object\n return false;\n }\n // UNSAFE: inherited from Function prototype\n // e.g call, apply\n if (method in Function.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Function.prototype is a root object\n return false;\n }\n return true;\n}\nfunction isPlainObject(object) {\n return typeof object === 'object' && object && object.constructor === Object;\n}\nvar safeNativeProperties = {\n length: true,\n name: true\n};\nvar safeNativeMethods = {\n toString: true,\n valueOf: true,\n toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { getSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { getSafeProperty, isSafeProperty, setSafeProperty } from './customs.js';\nimport { isMap, isObject } from './is.js';\n\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nexport class ObjectWrappingMap {\n constructor(object) {\n this.wrappedObject = object;\n this[Symbol.iterator] = this.entries;\n }\n keys() {\n return Object.keys(this.wrappedObject).filter(key => this.has(key)).values();\n }\n get(key) {\n return getSafeProperty(this.wrappedObject, key);\n }\n set(key, value) {\n setSafeProperty(this.wrappedObject, key, value);\n return this;\n }\n has(key) {\n return isSafeProperty(this.wrappedObject, key) && key in this.wrappedObject;\n }\n entries() {\n return mapIterator(this.keys(), key => [key, this.get(key)]);\n }\n forEach(callback) {\n for (var key of this.keys()) {\n callback(this.get(key), key, this);\n }\n }\n delete(key) {\n if (isSafeProperty(this.wrappedObject, key)) {\n delete this.wrappedObject[key];\n }\n }\n clear() {\n for (var key of this.keys()) {\n this.delete(key);\n }\n }\n get size() {\n return Object.keys(this.wrappedObject).length;\n }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n * const a = new Map()\n * const b = new Map()\n * const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n /**\n * @param {Map} a\n * @param {Map} b\n * @param {Set} bKeys\n */\n constructor(a, b, bKeys) {\n this.a = a;\n this.b = b;\n this.bKeys = bKeys;\n this[Symbol.iterator] = this.entries;\n }\n get(key) {\n return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);\n }\n set(key, value) {\n if (this.bKeys.has(key)) {\n this.b.set(key, value);\n } else {\n this.a.set(key, value);\n }\n return this;\n }\n has(key) {\n return this.b.has(key) || this.a.has(key);\n }\n keys() {\n return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();\n }\n entries() {\n return mapIterator(this.keys(), key => [key, this.get(key)]);\n }\n forEach(callback) {\n for (var key of this.keys()) {\n callback(this.get(key), key, this);\n }\n }\n delete(key) {\n return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);\n }\n clear() {\n this.a.clear();\n this.b.clear();\n }\n get size() {\n return [...this.keys()].length;\n }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator(it, callback) {\n return {\n next: () => {\n var n = it.next();\n return n.done ? n : {\n value: callback(n.value),\n done: false\n };\n }\n };\n}\n\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexport function createEmptyMap() {\n return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap(mapOrObject) {\n if (!mapOrObject) {\n return createEmptyMap();\n }\n if (isMap(mapOrObject)) {\n return mapOrObject;\n }\n if (isObject(mapOrObject)) {\n return new ObjectWrappingMap(mapOrObject);\n }\n throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject(map) {\n if (map instanceof ObjectWrappingMap) {\n return map.wrappedObject;\n }\n var object = {};\n for (var key of map.keys()) {\n var value = map.get(key);\n setSafeProperty(object, key, value);\n }\n return object;\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nexport function assign(map) {\n for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n objects[_key - 1] = arguments[_key];\n }\n for (var args of objects) {\n if (!args) {\n continue;\n }\n if (isMap(args)) {\n for (var key of args.keys()) {\n map.set(key, args.get(key));\n }\n } else if (isObject(args)) {\n for (var _key2 of Object.keys(args)) {\n map.set(_key2, args[_key2]);\n }\n }\n }\n return map;\n}","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n// instanceof cannot be used because that would not allow to pass data from\n// one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n// matches for \"fake\" instances like plain objects with a property `isUnit`.\n// That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n// for security reasons, so these functions are not exposed in the expression\n// parser.\n\nimport { ObjectWrappingMap } from './map.js';\nexport function isNumber(x) {\n return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n return false;\n }\n if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n return true;\n }\n if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n return true;\n }\n return false;\n}\nexport function isBigInt(x) {\n return typeof x === 'bigint';\n}\nexport function isComplex(x) {\n return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n return x && x.constructor.prototype.isMatrix === true || false;\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nexport function isCollection(x) {\n return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n return typeof x === 'function';\n}\nexport function isDate(x) {\n return x instanceof Date;\n}\nexport function isRegExp(x) {\n return x instanceof RegExp;\n}\nexport function isObject(x) {\n return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nexport function isMap(object) {\n // We can use the fast instanceof, or a slower duck typing check.\n // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n if (!object) {\n return false;\n }\n return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\nexport function isPartitionedMap(object) {\n return isMap(object) && isMap(object.a) && isMap(object.b);\n}\nexport function isObjectWrappingMap(object) {\n return isMap(object) && isObject(object.wrappedObject);\n}\nexport function isNull(x) {\n return x === null;\n}\nexport function isUndefined(x) {\n return x === undefined;\n}\nexport function isAccessorNode(x) {\n return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n a fraction means that the division in that fraction has precedence over implicit\n multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n 6!/8 x parses as 6! / (8x). It is located here because it is shared between\n parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n This should *not* be exported from mathjs, unlike most of the tests here.\n Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n it should be exported.\n*/\nexport function rule2Node(node) {\n return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nexport function isFunctionAssignmentNode(x) {\n return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRelationalNode(x) {\n return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n var t = typeof x;\n if (t === 'object') {\n if (x === null) return 'null';\n if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n if (x.constructor && x.constructor.name) return x.constructor.name;\n return 'Object'; // just in case\n }\n return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","import { isBigNumber, isObject } from './is.js';\n\n/**\n * Clone an object\n *\n * clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\nexport function clone(x) {\n var type = typeof x;\n\n // immutable primitive types\n if (type === 'number' || type === 'bigint' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n return x;\n }\n\n // use clone function of the object when available\n if (typeof x.clone === 'function') {\n return x.clone();\n }\n\n // array\n if (Array.isArray(x)) {\n return x.map(function (value) {\n return clone(value);\n });\n }\n if (x instanceof Date) return new Date(x.valueOf());\n if (isBigNumber(x)) return x; // bignumbers are immutable\n\n // object\n if (isObject(x)) {\n return mapObject(x, clone);\n }\n if (type === 'function') {\n // we assume that the function is immutable\n return x;\n }\n throw new TypeError(\"Cannot clone: unknown type of value (value: \".concat(x, \")\"));\n}\n\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\nexport function mapObject(object, callback) {\n var clone = {};\n for (var key in object) {\n if (hasOwnProperty(object, key)) {\n clone[key] = callback(object[key]);\n }\n }\n return clone;\n}\n\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\nexport function extend(a, b) {\n for (var prop in b) {\n if (hasOwnProperty(b, prop)) {\n a[prop] = b[prop];\n }\n }\n return a;\n}\n\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\nexport function deepExtend(a, b) {\n // TODO: add support for Arrays to deepExtend\n if (Array.isArray(b)) {\n throw new TypeError('Arrays are not supported by deepExtend');\n }\n for (var prop in b) {\n // We check against prop not being in Object.prototype or Function.prototype\n // to prevent polluting for example Object.__proto__.\n if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n if (b[prop] && b[prop].constructor === Object) {\n if (a[prop] === undefined) {\n a[prop] = {};\n }\n if (a[prop] && a[prop].constructor === Object) {\n deepExtend(a[prop], b[prop]);\n } else {\n a[prop] = b[prop];\n }\n } else if (Array.isArray(b[prop])) {\n throw new TypeError('Arrays are not supported by deepExtend');\n } else {\n a[prop] = b[prop];\n }\n }\n }\n return a;\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nexport function deepStrictEqual(a, b) {\n var prop, i, len;\n if (Array.isArray(a)) {\n if (!Array.isArray(b)) {\n return false;\n }\n if (a.length !== b.length) {\n return false;\n }\n for (i = 0, len = a.length; i < len; i++) {\n if (!deepStrictEqual(a[i], b[i])) {\n return false;\n }\n }\n return true;\n } else if (typeof a === 'function') {\n return a === b;\n } else if (a instanceof Object) {\n if (Array.isArray(b) || !(b instanceof Object)) {\n return false;\n }\n for (prop in a) {\n // noinspection JSUnfilteredForInLoop\n if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n return false;\n }\n }\n for (prop in b) {\n // noinspection JSUnfilteredForInLoop\n if (!(prop in a)) {\n return false;\n }\n }\n return true;\n } else {\n return a === b;\n }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten(nestedObject) {\n var flattenedObject = {};\n _deepFlatten(nestedObject, flattenedObject);\n return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n for (var prop in nestedObject) {\n if (hasOwnProperty(nestedObject, prop)) {\n var value = nestedObject[prop];\n if (typeof value === 'object' && value !== null) {\n _deepFlatten(value, flattenedObject);\n } else {\n flattenedObject[prop] = value;\n }\n }\n }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nexport function canDefineProperty() {\n // test needed for broken IE8 implementation\n try {\n if (Object.defineProperty) {\n Object.defineProperty({}, 'x', {\n get: function get() {\n return null;\n }\n });\n return true;\n }\n } catch (e) {}\n return false;\n}\n\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object Object where to add the property\n * @param {string} prop Property name\n * @param {Function} valueResolver Function returning the property value. Called\n * without arguments.\n */\nexport function lazy(object, prop, valueResolver) {\n var _uninitialized = true;\n var _value;\n Object.defineProperty(object, prop, {\n get: function get() {\n if (_uninitialized) {\n _value = valueResolver();\n _uninitialized = false;\n }\n return _value;\n },\n set: function set(value) {\n _value = value;\n _uninitialized = false;\n },\n configurable: true,\n enumerable: true\n });\n}\n\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nexport function traverse(object, path) {\n if (path && typeof path === 'string') {\n return traverse(object, path.split('.'));\n }\n var obj = object;\n if (path) {\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n if (!(key in obj)) {\n obj[key] = {};\n }\n obj = obj[key];\n }\n }\n return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty(object, property) {\n return object && Object.hasOwnProperty.call(object, property);\n}\n\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object]) (required)\n * - name: string (optional)\n * - path: string A dot separated path (optional)\n * - math: boolean If true (false by default), the math namespace is passed\n * as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\nexport function isLegacyFactory(object) {\n return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nexport function get(object, path) {\n if (typeof path === 'string') {\n if (isPath(path)) {\n return get(object, path.split('.'));\n } else {\n return object[path];\n }\n }\n var child = object;\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n child = child ? child[key] : undefined;\n }\n return child;\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nexport function set(object, path, value) {\n if (typeof path === 'string') {\n if (isPath(path)) {\n return set(object, path.split('.'), value);\n } else {\n object[path] = value;\n return object;\n }\n }\n var child = object;\n for (var i = 0; i < path.length - 1; i++) {\n var key = path[i];\n if (child[key] === undefined) {\n child[key] = {};\n }\n child = child[key];\n }\n if (path.length > 0) {\n var lastKey = path[path.length - 1];\n child[lastKey] = value;\n }\n return object;\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nexport function pick(object, properties, transform) {\n var copy = {};\n for (var i = 0; i < properties.length; i++) {\n var key = properties[i];\n var value = get(object, key);\n if (value !== undefined) {\n set(copy, key, transform ? transform(value, key) : value);\n }\n }\n return copy;\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nexport function pickShallow(object, properties) {\n var copy = {};\n for (var i = 0; i < properties.length; i++) {\n var key = properties[i];\n var value = object[key];\n if (value !== undefined) {\n copy[key] = value;\n }\n }\n return copy;\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n return str.includes('.');\n}","import { clone, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', '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 * 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} relTol\n * Minimum relative difference between two\n * compared values, used by all comparison functions.\n * {number} absTol\n * Minimum absolute 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', 'bigint', 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 if (options.epsilon !== undefined) {\n // this if is only for backwards compatibility, it can be removed in the future.\n console.warn('Warning: The configuration option \"epsilon\" is deprecated. Use \"relTol\" and \"absTol\" instead.');\n var optionsFix = clone(options);\n optionsFix.relTol = options.epsilon;\n optionsFix.absTol = options.epsilon * 1e-3;\n delete optionsFix.epsilon;\n return _config(optionsFix);\n }\n if (options.legacySubset === true) {\n // this if is only for backwards compatibility, it can be removed in the future.\n console.warn('Warning: The configuration option \"legacySubset\" is for compatibility only and might be deprecated in the future.');\n }\n var prev = clone(config);\n\n // validate some of the options\n validateOption(options, 'matrix', MATRIX_OPTIONS);\n validateOption(options, 'number', NUMBER_OPTIONS);\n\n // merge options\n deepExtend(config, options);\n var curr = clone(config);\n var changes = clone(options);\n\n // emit 'config' event\n emit('config', curr, prev, changes);\n return curr;\n } else {\n return clone(config);\n }\n }\n\n // attach the valid options to the function so they can be extended\n _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n // attach the config properties as readonly properties to the config function\n Object.keys(DEFAULT_CONFIG).forEach(key => {\n Object.defineProperty(_config, key, {\n get: () => config[key],\n enumerable: true,\n configurable: true\n });\n });\n return _config;\n}\n\n/**\n * Validate an option\n * @param {Object} options Object with options\n * @param {string} name Name of the option to validate\n * @param {Array.} values Array with valid values for this option\n */\nfunction validateOption(options, name, values) {\n if (options[name] !== undefined && !values.includes(options[name])) {\n // unknown value\n console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n }\n}","import { isBigNumber, isNumber, isObject } from './is.js';\n\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nexport function isInteger(value) {\n if (typeof value === 'boolean') {\n return true;\n }\n return Number.isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Ensure the number type is compatible with the provided value.\n * If not, return 'number' instead.\n *\n * For example:\n *\n * safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })\n *\n * will return 'number' and not 'bigint' because trying to create a bigint with\n * value 2.3 would throw an exception.\n *\n * @param {string} numberStr\n * @param {{\n * number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'\n * numberFallback: 'number' | 'BigNumber'\n * }} config\n * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}\n */\nexport function safeNumberType(numberStr, config) {\n if (config.number === 'bigint') {\n try {\n BigInt(numberStr);\n } catch (_unused) {\n return config.numberFallback;\n }\n }\n return config.number;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = Math.sign || function (x) {\n if (x > 0) {\n return 1;\n } else if (x < 0) {\n return -1;\n } else {\n return 0;\n }\n};\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = Math.log2 || function log2(x) {\n return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log10 = Math.log10 || function log10(x) {\n return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport var log1p = Math.log1p || function (x) {\n return Math.log(x + 1);\n};\n\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n * https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\nexport var cbrt = Math.cbrt || function cbrt(x) {\n if (x === 0) {\n return x;\n }\n var negate = x < 0;\n var result;\n if (negate) {\n x = -x;\n }\n if (Number.isFinite(x)) {\n result = Math.exp(Math.log(x) / 3);\n // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n result = (x / (result * result) + 2 * result) / 3;\n } else {\n result = x;\n }\n return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport var expm1 = Math.expm1 || function expm1(x) {\n return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatNumberToBase(n, base, size) {\n var prefixes = {\n 2: '0b',\n 8: '0o',\n 16: '0x'\n };\n var prefix = prefixes[base];\n var suffix = '';\n if (size) {\n if (size < 1) {\n throw new Error('size must be in greater than 0');\n }\n if (!isInteger(size)) {\n throw new Error('size must be an integer');\n }\n if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n }\n if (!isInteger(n)) {\n throw new Error('Value must be an integer');\n }\n if (n < 0) {\n n = n + 2 ** size;\n }\n suffix = \"i\".concat(size);\n }\n var sign = '';\n if (n < 0) {\n n = -n;\n sign = '-';\n }\n return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\n\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n * format(value)\n * format(value, options)\n * format(value, precision)\n * format(value, fn)\n *\n * Where:\n *\n * {number} value The value to be formatted\n * {Object} options An object with formatting options. Available options:\n * {string} notation\n * Number notation. Choose from:\n * 'fixed' Always use regular number notation.\n * For example '123.40' and '14000000'\n * 'exponential' Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * 'engineering' Always use engineering notation.\n * For example '123.4e+0' and '14.0e+6'\n * 'auto' (default) Regular number notation for numbers\n * having an absolute value between\n * `lowerExp` and `upperExp` bounds, and\n * uses exponential notation elsewhere.\n * Lower bound is included, upper bound\n * is excluded.\n * For example '123.4' and '1.4e7'.\n * 'bin', 'oct, or\n * 'hex' Format the number using binary, octal,\n * or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * {number} wordSize The word size in bits to use for formatting\n * in binary, octal, or hexadecimal notation.\n * To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option\n * is defined the value is formatted as a signed\n * twos complement integer of the given word size\n * and the size suffix is appended to the output.\n * For example\n * format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * {number} precision A number between 0 and 16 to round\n * the digits of the number.\n * In case of notations 'exponential',\n * 'engineering', and 'auto',\n * `precision` defines the total\n * number of significant digits returned.\n * In case of notation 'fixed',\n * `precision` defines the number of\n * significant digits after the decimal\n * point.\n * `precision` is undefined by default,\n * not rounding any digits.\n * {number} lowerExp Exponent determining the lower boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `-3`.\n * {number} upperExp Exponent determining the upper boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `5`.\n * {Function} fn A custom formatting function. Can be used to override the\n * built-in notations. Function `fn` is called with `value` as\n * parameter and must return a string. Is useful for example to\n * format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n * format(6.4) // '6.4'\n * format(1240000) // '1.24e6'\n * format(1/3) // '0.3333333333333333'\n * format(1/3, 3) // '0.333'\n * format(21385, 2) // '21000'\n * format(12.071, {notation: 'fixed'}) // '12'\n * format(2.3, {notation: 'fixed', precision: 2}) // '2.30'\n * format(52.8, {notation: 'exponential'}) // '5.28e+1'\n * format(12345678, {notation: 'engineering'}) // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n if (typeof options === 'function') {\n // handle format(value, fn)\n return options(value);\n }\n\n // handle special cases\n if (value === Infinity) {\n return 'Infinity';\n } else if (value === -Infinity) {\n return '-Infinity';\n } else if (isNaN(value)) {\n return 'NaN';\n }\n var {\n notation,\n precision,\n wordSize\n } = normalizeFormatOptions(options);\n\n // handle the various notations\n switch (notation) {\n case 'fixed':\n return toFixed(value, precision);\n case 'exponential':\n return toExponential(value, precision);\n case 'engineering':\n return toEngineering(value, precision);\n case 'bin':\n return formatNumberToBase(value, 2, wordSize);\n case 'oct':\n return formatNumberToBase(value, 8, wordSize);\n case 'hex':\n return formatNumberToBase(value, 16, wordSize);\n case 'auto':\n // remove trailing zeros after the decimal point\n return toPrecision(value, precision, options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n var digits = arguments[2];\n var e = arguments[4];\n return digits !== '.' ? digits + e : e;\n });\n default:\n throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n }\n}\n\n/**\n * Normalize format options into an object:\n * {\n * notation: string,\n * precision: number | undefined,\n * wordSize: number | undefined\n * }\n */\nexport function normalizeFormatOptions(options) {\n // default values for options\n var notation = 'auto';\n var precision;\n var wordSize;\n if (options !== undefined) {\n if (isNumber(options)) {\n precision = options;\n } else if (isBigNumber(options)) {\n precision = options.toNumber();\n } else if (isObject(options)) {\n if (options.precision !== undefined) {\n precision = _toNumberOrThrow(options.precision, () => {\n throw new Error('Option \"precision\" must be a number or BigNumber');\n });\n }\n if (options.wordSize !== undefined) {\n wordSize = _toNumberOrThrow(options.wordSize, () => {\n throw new Error('Option \"wordSize\" must be a number or BigNumber');\n });\n }\n if (options.notation) {\n notation = options.notation;\n }\n } else {\n throw new Error('Unsupported type of options, number, BigNumber, or object expected');\n }\n }\n return {\n notation,\n precision,\n wordSize\n };\n}\n\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n * Returns an object containing sign, coefficients, and exponent\n */\nexport function splitNumber(value) {\n // parse the input value\n var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n if (!match) {\n throw new SyntaxError('Invalid number ' + value);\n }\n var sign = match[1];\n var digits = match[2];\n var exponent = parseFloat(match[4] || '0');\n var dot = digits.indexOf('.');\n exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n .replace(/^0*/, function (zeros) {\n // remove leading zeros, add their count to the exponent\n exponent -= zeros.length;\n return '';\n }).replace(/0*$/, '') // remove trailing zeros\n .split('').map(function (d) {\n return parseInt(d);\n });\n if (coefficients.length === 0) {\n coefficients.push(0);\n exponent++;\n }\n return {\n sign,\n coefficients,\n exponent\n };\n}\n\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision] Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n if (isNaN(value) || !Number.isFinite(value)) {\n return String(value);\n }\n var split = splitNumber(value);\n var rounded = roundDigits(split, precision);\n var e = rounded.exponent;\n var c = rounded.coefficients;\n\n // find nearest lower multiple of 3 for exponent\n var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n if (isNumber(precision)) {\n // add zeroes to give correct sig figs\n while (precision > c.length || e - newExp + 1 > c.length) {\n c.push(0);\n }\n } else {\n // concatenate coefficients with necessary zeros\n // add zeros if necessary (for example: 1e+8 -> 100e+6)\n var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n for (var i = 0; i < missingZeros; i++) {\n c.push(0);\n }\n }\n\n // find difference in exponents\n var expDiff = Math.abs(e - newExp);\n var decimalIdx = 1;\n\n // push decimal index over by expDiff times\n while (expDiff > 0) {\n decimalIdx++;\n expDiff--;\n }\n\n // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n // otherwise concat with the rest of the coefficients\n var decimals = c.slice(decimalIdx).join('');\n var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n return rounded.sign + str;\n}\n\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n * decimal point. null by default.\n */\nexport function toFixed(value, precision) {\n if (isNaN(value) || !Number.isFinite(value)) {\n return String(value);\n }\n var splitValue = splitNumber(value);\n var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n var c = rounded.coefficients;\n var p = rounded.exponent + 1; // exponent may have changed\n\n // append zeros if needed\n var pp = p + (precision || 0);\n if (c.length < pp) {\n c = c.concat(zeros(pp - c.length));\n }\n\n // prepend zeros if needed\n if (p < 0) {\n c = zeros(-p + 1).concat(c);\n p = 1;\n }\n\n // insert a dot if needed\n if (p < c.length) {\n c.splice(p, 0, p === 0 ? '0.' : '.');\n }\n return rounded.sign + c.join('');\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision] Number of digits in formatted output.\n * If not provided, the maximum available digits\n * is used.\n */\nexport function toExponential(value, precision) {\n if (isNaN(value) || !Number.isFinite(Number(value))) {\n return String(value);\n }\n\n // round if needed, else create a clone\n var split = splitNumber(value);\n var rounded = precision ? roundDigits(split, precision) : split;\n var c = rounded.coefficients;\n var e = rounded.exponent;\n\n // append zeros if needed\n if (c.length < precision) {\n c = c.concat(zeros(precision - c.length));\n }\n\n // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n var first = c.shift();\n return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n * By default:\n * lowerExp = -3 (incl)\n * upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision(value, precision, options) {\n if (isNaN(value) || !Number.isFinite(value)) {\n return String(value);\n }\n\n // determine lower and upper bound for exponential notation.\n var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n var split = splitNumber(value);\n var rounded = precision ? roundDigits(split, precision) : split;\n if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n // exponential notation\n return toExponential(value, precision);\n } else {\n var c = rounded.coefficients;\n var e = rounded.exponent;\n\n // append trailing zeros\n if (c.length < precision) {\n c = c.concat(zeros(precision - c.length));\n }\n\n // append trailing zeros\n // TODO: simplify the next statement\n c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n // prepend zeros\n c = zeros(-e).concat(c);\n var dot = e > 0 ? e : 0;\n if (dot < c.length - 1) {\n c.splice(dot + 1, 0, '.');\n }\n return rounded.sign + c.join('');\n }\n}\n\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split A value split with .splitNumber(value)\n * @param {number} precision A positive integer\n * @return {SplitValue}\n * Returns an object containing sign, coefficients, and exponent\n * with rounded digits\n */\nexport function roundDigits(split, precision) {\n // create a clone\n var rounded = {\n sign: split.sign,\n coefficients: split.coefficients,\n exponent: split.exponent\n };\n var c = rounded.coefficients;\n\n // prepend zeros if needed\n while (precision <= 0) {\n c.unshift(0);\n rounded.exponent++;\n precision++;\n }\n if (c.length > precision) {\n var removed = c.splice(precision, c.length - precision);\n if (removed[0] >= 5) {\n var i = precision - 1;\n c[i]++;\n while (c[i] === 10) {\n c.pop();\n if (i === 0) {\n c.unshift(0);\n rounded.exponent++;\n i++;\n }\n i--;\n c[i]++;\n }\n }\n }\n return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n var arr = [];\n for (var i = 0; i < length; i++) {\n arr.push(0);\n }\n return arr;\n}\n\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n * 2.34 returns 3\n * 0.0034 returns 2\n * 120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits Number of significant digits\n */\nexport function digits(value) {\n return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n .length;\n}\n\n/**\n * Compares two floating point numbers.\n * @param {number} a - First value to compare\n * @param {number} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @return {boolean} whether the two numbers are nearly equal\n *\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-8); // true\n * nearlyEqual(1.000000002, 1.0, 0); // false\n * nearlyEqual(1.0, 1.009, undefined, 0.01); // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual(a, b) {\n var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-8;\n var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;\n if (relTol <= 0) {\n throw new Error('Relative tolerance must be greater than 0');\n }\n if (absTol < 0) {\n throw new Error('Absolute tolerance must be at least 0');\n }\n\n // NaN\n if (isNaN(a) || isNaN(b)) {\n return false;\n }\n if (!Number.isFinite(a) || !Number.isFinite(b)) {\n return a === b;\n }\n if (a === b) {\n return true;\n }\n\n // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)\n return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol);\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport var acosh = Math.acosh || function (x) {\n return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n return Math.log(Math.sqrt(x * x + 1) + x);\n};\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport var atanh = Math.atanh || function (x) {\n return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var cosh = Math.cosh || function (x) {\n return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sinh = Math.sinh || function (x) {\n return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport var tanh = Math.tanh || function (x) {\n var e = Math.exp(2 * x);\n return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign(x, y) {\n var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n return signx ^ signy ? -x : x;\n}\nfunction _toNumberOrThrow(value, onError) {\n if (isNumber(value)) {\n return value;\n } else if (isBigNumber(value)) {\n return value.toNumber();\n } else {\n onError();\n }\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n if (isNumber(value)) {\n return value;\n } else if (isBigNumber(value)) {\n return value.toNumber();\n } else {\n return defaultValue;\n }\n}","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function cubeNumber(x) {\n return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n return expm1(x);\n}\nexpm1Number.signature = n1;\n\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\nexport function gcdNumber(a, b) {\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function gcd must be integer numbers');\n }\n\n // https://en.wikipedia.org/wiki/Euclidean_algorithm\n var r;\n while (b !== 0) {\n r = a % b;\n a = b;\n b = r;\n }\n return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\nexport function lcmNumber(a, b) {\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function lcm must be integer numbers');\n }\n if (a === 0 || b === 0) {\n return 0;\n }\n\n // https://en.wikipedia.org/wiki/Euclidean_algorithm\n // evaluate lcm here inline to reduce overhead\n var t;\n var prod = a * b;\n while (b !== 0) {\n t = b;\n b = a % t;\n a = t;\n }\n return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber(x, y) {\n if (y) {\n return Math.log(x) / Math.log(y);\n }\n return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number(x) {\n return log10(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number(x) {\n return log2(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber(x) {\n return log1p(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber(x, y) {\n // 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 y === 0 ? x : x - y * Math.floor(x / y);\n}\nmodNumber.signature = n2;\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nexport function nthRootNumber(a) {\n var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n var inv = root < 0;\n if (inv) {\n root = -root;\n }\n if (root === 0) {\n throw new Error('Root must be non-zero');\n }\n if (a < 0 && Math.abs(root) % 2 !== 1) {\n throw new Error('Root must be odd when a is negative.');\n }\n\n // edge cases zero and infinity\n if (a === 0) {\n return inv ? Infinity : 0;\n }\n if (!isFinite(a)) {\n return inv ? 0 : a;\n }\n var x = Math.pow(Math.abs(a), 1 / root);\n // If a < 0, we require that root is an odd integer,\n // so (-1) ^ (1/root) = -1\n x = a < 0 ? -x : x;\n return inv ? 1 / x : x;\n\n // Very nice algorithm, but fails with nthRoot(-2, 3).\n // Newton's method has some well-known problems at times:\n // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n /*\n let x = 1 // Initial guess\n let xPrev = 1\n let i = 0\n const iMax = 10000\n do {\n const delta = (a / Math.pow(x, root - 1) - x) / root\n xPrev = x\n x = x + delta\n i++\n }\n while (xPrev !== x && i < iMax)\n if (xPrev !== x) {\n throw new Error('Function nthRoot failed to converge')\n }\n return inv ? 1 / x : x\n */\n}\nexport function signNumber(x) {\n return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n return x * x;\n}\nsquareNumber.signature = n1;\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nexport function xgcdNumber(a, b) {\n // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n var t; // used to swap two variables\n var q; // quotient\n var r; // remainder\n var x = 0;\n var lastx = 1;\n var y = 1;\n var lasty = 0;\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function xgcd must be integer numbers');\n }\n while (b) {\n q = Math.floor(a / b);\n r = a - q * b;\n t = x;\n x = lastx - q * x;\n lastx = t;\n t = y;\n y = lasty - q * y;\n lasty = t;\n a = b;\n b = r;\n }\n var res;\n if (a < 0) {\n res = [-a, -lastx, -lasty];\n } else {\n res = [a, a ? lastx : 0, lasty];\n }\n return res;\n}\nxgcdNumber.signature = n2;\n\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\nexport function powNumber(x, y) {\n // x^Infinity === 0 if -1 < x < 1\n // A real number 0 is returned instead of complex(0)\n if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n return 0;\n }\n return Math.pow(x, y);\n}\npowNumber.signature = n2;\n\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\nexport function roundNumber(value) {\n var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n }\n return parseFloat(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n return Math.abs(x);\n}\nnormNumber.signature = n1;","/** @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 if (n === i) {\n return n;\n }\n var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer\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 if (!isInteger(k) || k < 0) {\n throw new TypeError('Positive integer value expected in function combinations');\n }\n if (k > n) {\n throw new TypeError('k must be less than or equal to n');\n }\n var nMinusk = n - k;\n var answer = 1;\n var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;\n var nextdivisor = 2;\n var lastdivisor = k < nMinusk ? k : nMinusk;\n // balance multiplications and divisions to try to keep intermediate values\n // in exact-integer range as long as possible\n for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {\n answer *= nextnumerator;\n while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {\n answer /= nextdivisor;\n ++nextdivisor;\n }\n }\n // for big n, k, floating point may have caused weirdness in remainder\n if (nextdivisor <= lastdivisor) {\n answer /= product(nextdivisor, lastdivisor);\n }\n return answer;\n}\ncombinationsNumber.signature = 'number, number';","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","/* eslint-disable no-loss-of-precision */\n\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function gammaNumber(n) {\n var x;\n if (isInteger(n)) {\n if (n <= 0) {\n return Number.isFinite(n) ? Infinity : NaN;\n }\n if (n > 171) {\n return Infinity; // Will overflow\n }\n return product(1, n - 1);\n }\n if (n < 0.5) {\n return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));\n }\n if (n >= 171.35) {\n return Infinity; // will overflow\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 x = gammaP[0];\n for (var i = 1; i < gammaP.length; ++i) {\n x += gammaP[i] / (n + i);\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';\n\n// 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];\n\n// lgamma implementation ref: https://mrob.com/pub/ries/lanczos-gamma.html#code\n\n// log(2 * pi) / 2\nexport var lnSqrt2PI = 0.91893853320467274178;\nexport var lgammaG = 5; // Lanczos parameter \"g\"\nexport var lgammaN = 7; // Range of coefficients \"n\"\n\nexport var lgammaSeries = [1.000000000190015, 76.18009172947146, -86.50532032941677, 24.01409824083091, -1.231739572450155, 0.1208650973866179e-2, -0.5395239384953e-5];\nexport function lgammaNumber(n) {\n if (n < 0) return NaN;\n if (n === 0) return Infinity;\n if (!Number.isFinite(n)) return n;\n if (n < 0.5) {\n // Use Euler's reflection formula:\n // gamma(z) = PI / (sin(PI * z) * gamma(1 - z))\n return Math.log(Math.PI / Math.sin(Math.PI * n)) - lgammaNumber(1 - n);\n }\n\n // Compute the logarithm of the Gamma function using the Lanczos method\n\n n = n - 1;\n var base = n + lgammaG + 0.5; // Base of the Lanczos exponential\n var sum = lgammaSeries[0];\n\n // We start with the terms that have the smallest coefficients and largest denominator\n for (var i = lgammaN - 1; i >= 1; i--) {\n sum += lgammaSeries[i] / (n + i);\n }\n return lnSqrt2PI + (n + 0.5) * Math.log(base) - base + Math.log(sum);\n}\nlgammaNumber.signature = 'number';","import { pickShallow } from './object.js';\n\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n * const name = 'log'\n * const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n * export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n * // ... create the function log here and return it\n * }\n *\n * @param {string} name Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create Callback function called with an object with all dependencies\n * @param {Object} [meta]\n * Optional object with meta information that will be attached\n * to the created factory function as property `meta`. For explanation\n * of what meta properties can be specified and what they mean, see\n * docs/core/extension.md.\n * @returns {function}\n */\nexport function factory(name, dependencies, create, meta) {\n function assertAndCreate(scope) {\n // we only pass the requested dependencies to the factory function\n // to prevent functions to rely on dependencies that are not explicitly\n // requested.\n var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n assertDependencies(name, dependencies, scope);\n return create(deps);\n }\n assertAndCreate.isFactory = true;\n assertAndCreate.fn = name;\n assertAndCreate.dependencies = dependencies.slice().sort();\n if (meta) {\n assertAndCreate.meta = meta;\n }\n return assertAndCreate;\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nexport function sortFactories(factories) {\n var factoriesByName = {};\n factories.forEach(factory => {\n factoriesByName[factory.fn] = factory;\n });\n function containsDependency(factory, dependency) {\n // TODO: detect circular references\n if (isFactory(factory)) {\n if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n return true;\n }\n if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n return true;\n }\n }\n return false;\n }\n var sorted = [];\n function addFactory(factory) {\n var index = 0;\n while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n index++;\n }\n sorted.splice(index, 0, factory);\n }\n\n // sort regular factory functions\n factories.filter(isFactory).forEach(addFactory);\n\n // sort legacy factory functions AFTER the regular factory functions\n factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create(factories) {\n var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n sortFactories(factories).forEach(factory => factory(scope));\n return scope;\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nexport function isFactory(obj) {\n return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nexport function assertDependencies(name, dependencies, scope) {\n var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n .every(dependency => scope[dependency] !== undefined);\n if (!allDefined) {\n var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\n\n // TODO: create a custom error class for this, a MathjsError or something like that\n throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n }\n}\nexport function isOptionalDependency(dependency) {\n return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","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}","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.typed = factory());\n})(this, (function () { 'use strict';\n\n function ok() {\n return true;\n }\n function notOk() {\n return false;\n }\n function undef() {\n return undefined;\n }\n const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n\n /**\n * @typedef {{\n * params: Param[],\n * fn: function,\n * test: function,\n * implementation: function\n * }} Signature\n *\n * @typedef {{\n * types: Type[],\n * hasAny: boolean,\n * hasConversion: boolean,\n * restParam: boolean\n * }} Param\n *\n * @typedef {{\n * name: string,\n * typeIndex: number,\n * test: function,\n * isAny: boolean,\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 * isAny?: boolean\n * }} TypeDef\n */\n\n /**\n * @returns {() => function}\n */\n function create() {\n // data type tests\n\n /**\n * Returns true if the argument is a non-null \"plain\" object\n */\n function isPlainObject(x) {\n return typeof x === 'object' && x !== null && x.constructor === Object;\n }\n const _types = [{\n name: 'number',\n test: function (x) {\n return typeof x === 'number';\n }\n }, {\n name: 'string',\n test: function (x) {\n return typeof x === 'string';\n }\n }, {\n name: 'boolean',\n test: function (x) {\n return typeof x === 'boolean';\n }\n }, {\n name: 'Function',\n test: function (x) {\n return typeof x === 'function';\n }\n }, {\n name: 'Array',\n test: Array.isArray\n }, {\n name: 'Date',\n test: function (x) {\n return x instanceof Date;\n }\n }, {\n name: 'RegExp',\n test: function (x) {\n return x instanceof RegExp;\n }\n }, {\n name: 'Object',\n test: isPlainObject\n }, {\n name: 'null',\n test: function (x) {\n return x === null;\n }\n }, {\n name: 'undefined',\n test: function (x) {\n return x === undefined;\n }\n }];\n const anyType = {\n name: 'any',\n test: ok,\n isAny: true\n };\n\n // Data structures to track the types. As these are local variables in\n // create(), each typed universe will get its own copy, but the variables\n // will only be accessible through the (closures of the) functions supplied\n // as properties of the typed object, not directly.\n // These will be initialized in clear() below\n let typeMap; // primary store of all types\n let typeList; // Array of just type names, for the sake of ordering\n\n // And similar data structures for the type conversions:\n let nConversions = 0;\n // the actual conversions are stored on a property of the destination types\n\n // This is a temporary object, will be replaced with a function at the end\n let typed = {\n createCount: 0\n };\n\n /**\n * Takes a type name and returns the corresponding official type object\n * for that type.\n *\n * @param {string} typeName\n * @returns {TypeDef} type\n */\n function findType(typeName) {\n const type = typeMap.get(typeName);\n if (type) {\n return type;\n }\n // Remainder is error handling\n let message = 'Unknown type \"' + typeName + '\"';\n const name = typeName.toLowerCase();\n let otherName;\n for (otherName of typeList) {\n if (otherName.toLowerCase() === name) {\n message += '. Did you mean \"' + otherName + '\" ?';\n break;\n }\n }\n throw new TypeError(message);\n }\n\n /**\n * Adds an array `types` of type definitions to this typed instance.\n * Each type definition should be an object with properties:\n * 'name' - a string giving the name of the type; 'test' - function\n * returning a boolean that tests membership in the type; and optionally\n * 'isAny' - true only for the 'any' type.\n *\n * The second optional argument, `before`, gives the name of a type that\n * these types should be added before. The new types are added in the\n * order specified.\n * @param {TypeDef[]} types\n * @param {string | boolean} [beforeSpec='any'] before\n */\n function addTypes(types) {\n let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n const newTypes = [];\n for (let i = 0; i < types.length; ++i) {\n if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n throw new TypeError('Object with properties {name: string, test: function} expected');\n }\n const typeName = types[i].name;\n if (typeMap.has(typeName)) {\n throw new TypeError('Duplicate type name \"' + typeName + '\"');\n }\n newTypes.push(typeName);\n typeMap.set(typeName, {\n name: typeName,\n test: types[i].test,\n isAny: types[i].isAny,\n index: beforeIndex + i,\n conversionsTo: [] // Newly added type can't have any conversions to it\n });\n }\n // update the typeList\n const affectedTypes = typeList.slice(beforeIndex);\n typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);\n // Fix the indices\n for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n typeMap.get(typeList[i]).index = i;\n }\n }\n\n /**\n * Removes all types and conversions from this typed instance.\n * May cause previously constructed typed-functions to throw\n * strange errors when they are called with types that do not\n * match any of their signatures.\n */\n function clear() {\n typeMap = new Map();\n typeList = [];\n nConversions = 0;\n addTypes([anyType], false);\n }\n\n // initialize the types to the default list\n clear();\n addTypes(_types);\n\n /**\n * Removes all conversions, leaving the types alone.\n */\n function clearConversions() {\n let typeName;\n for (typeName of typeList) {\n typeMap.get(typeName).conversionsTo = [];\n }\n nConversions = 0;\n }\n\n /**\n * Find the type names that match a value.\n * @param {*} value\n * @return {string[]} Array of names of types for which\n * the type test matches the value.\n */\n function findTypeNames(value) {\n const matches = typeList.filter(name => {\n const type = typeMap.get(name);\n return !type.isAny && type.test(value);\n });\n if (matches.length) {\n return matches;\n }\n return ['any'];\n }\n\n /**\n * Check if an entity is a typed function created by any instance\n * @param {any} entity\n * @returns {boolean}\n */\n function isTypedFunction(entity) {\n return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n }\n\n /**\n * Find a specific signature from a (composed) typed function, for example:\n *\n * typed.findSignature(fn, ['number', 'string'])\n * typed.findSignature(fn, 'number, string')\n * typed.findSignature(fn, 'number,string', {exact: true})\n *\n * This function findSignature will by default return the best match to\n * the given signature, possibly employing type conversions.\n *\n * The (optional) third argument is a plain object giving options\n * controlling the signature search. Currently the only implemented\n * option is `exact`: if specified as true (default is false), only\n * exact matches will be returned (i.e. signatures for which `fn` was\n * directly defined). Note that a (possibly different) type matching\n * `any`, or one or more instances of TYPE matching `...TYPE` are\n * considered exact matches in this regard, as no conversions are used.\n *\n * This function returns a \"signature\" object, as does `typed.resolve()`,\n * which is a plain object with four keys: `params` (the array of parameters\n * for this signature), `fn` (the originally supplied function for this\n * signature), `test` (a generated function that determines if an argument\n * list matches this signature, and `implementation` (the function to call\n * on a matching argument list, that performs conversions if necessary and\n * then calls the originally supplied function).\n *\n * @param {Function} fn A typed-function\n * @param {string | string[]} signature\n * Signature to be found, can be an array or a comma separated string.\n * @param {object} options Controls the signature search as documented\n * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n * Returns the matching signature, or throws an error when no signature\n * is found.\n */\n function findSignature(fn, signature, options) {\n if (!isTypedFunction(fn)) {\n throw new TypeError(NOT_TYPED_FUNCTION);\n }\n\n // Canonicalize input\n const exact = options && options.exact;\n const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n const params = parseSignature(stringSignature);\n const canonicalSignature = stringifyParams(params);\n\n // First hope we get lucky and exactly match a signature\n if (!exact || canonicalSignature in fn.signatures) {\n // OK, we can check the internal signatures\n const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n if (match) {\n return match;\n }\n }\n\n // Oh well, we did not; so we have to go back and check the parameters\n // one by one, in order to catch things like `any` and rest params.\n // Note here we can assume there is at least one parameter, because\n // the empty signature would have matched successfully above.\n const nParams = params.length;\n let remainingSignatures;\n if (exact) {\n remainingSignatures = [];\n let name;\n for (name in fn.signatures) {\n remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n }\n } else {\n remainingSignatures = fn._typedFunctionData.signatures;\n }\n for (let i = 0; i < nParams; ++i) {\n const want = params[i];\n const filteredSignatures = [];\n let possibility;\n for (possibility of remainingSignatures) {\n const have = getParamAtIndex(possibility.params, i);\n if (!have || want.restParam && !have.restParam) {\n continue;\n }\n if (!have.hasAny) {\n // have to check all of the wanted types are available\n const haveTypes = paramTypeSet(have);\n if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n continue;\n }\n }\n // OK, this looks good\n filteredSignatures.push(possibility);\n }\n remainingSignatures = filteredSignatures;\n if (remainingSignatures.length === 0) break;\n }\n // Return the first remaining signature that was totally matched:\n let candidate;\n for (candidate of remainingSignatures) {\n if (candidate.params.length <= nParams) {\n return candidate;\n }\n }\n throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n }\n\n /**\n * Find the proper function to call for a specific signature from\n * a (composed) typed function, for example:\n *\n * typed.find(fn, ['number', 'string'])\n * typed.find(fn, 'number, string')\n * typed.find(fn, 'number,string', {exact: true})\n *\n * This function find will by default return the best match to\n * the given signature, possibly employing type conversions (and returning\n * a function that will perform those conversions as needed). The\n * (optional) third argument is a plain object giving options contolling\n * the signature search. Currently only the option `exact` is implemented,\n * which defaults to \"false\". If `exact` is specified as true, then only\n * exact matches will be returned (i.e. signatures for which `fn` was\n * directly defined). Uses of `any` and `...TYPE` are considered exact if\n * no conversions are necessary to apply the corresponding function.\n *\n * @param {Function} fn A typed-function\n * @param {string | string[]} signature\n * Signature to be found, can be an array or a comma separated string.\n * @param {object} options Controls the signature match as documented\n * @return {function}\n * Returns the function to call for the given signature, or throws an\n * error if no match is found.\n */\n function find(fn, signature, options) {\n return findSignature(fn, signature, options).implementation;\n }\n\n /**\n * Convert a given value to another data type, specified by type name.\n *\n * @param {*} value\n * @param {string} typeName\n */\n function convert(value, typeName) {\n // check conversion is needed\n const type = findType(typeName);\n if (type.test(value)) {\n return value;\n }\n const conversions = type.conversionsTo;\n if (conversions.length === 0) {\n throw new Error('There are no conversions to ' + typeName + ' defined.');\n }\n for (let i = 0; i < conversions.length; i++) {\n const fromType = findType(conversions[i].from);\n if (fromType.test(value)) {\n return conversions[i].convert(value);\n }\n }\n throw new Error('Cannot convert ' + value + ' to ' + typeName);\n }\n\n /**\n * Stringify parameters in a normalized way\n * @param {Param[]} params\n * @param {string} [','] separator\n * @return {string}\n */\n function stringifyParams(params) {\n let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n return params.map(p => p.name).join(separator);\n }\n\n /**\n * Parse a parameter, like \"...number | boolean\"\n * @param {string} param\n * @return {Param} param\n */\n function parseParam(param) {\n const restParam = param.indexOf('...') === 0;\n const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n const typeDefs = types.split('|').map(s => findType(s.trim()));\n let hasAny = false;\n let paramName = restParam ? '...' : '';\n const exactTypes = typeDefs.map(function (type) {\n hasAny = type.isAny || hasAny;\n paramName += type.name + '|';\n return {\n name: type.name,\n typeIndex: type.index,\n test: type.test,\n isAny: type.isAny,\n conversion: null,\n conversionIndex: -1\n };\n });\n return {\n types: exactTypes,\n name: paramName.slice(0, -1),\n // remove trailing '|' from above\n hasAny,\n hasConversion: false,\n restParam\n };\n }\n\n /**\n * Expands a parsed parameter with the types available from currently\n * defined conversions.\n * @param {Param} param\n * @return {Param} param\n */\n function expandParam(param) {\n const typeNames = param.types.map(t => t.name);\n const matchingConversions = availableConversions(typeNames);\n let hasAny = param.hasAny;\n let newName = param.name;\n const convertibleTypes = matchingConversions.map(function (conversion) {\n const type = findType(conversion.from);\n hasAny = type.isAny || hasAny;\n newName += '|' + conversion.from;\n return {\n name: conversion.from,\n typeIndex: type.index,\n test: type.test,\n isAny: type.isAny,\n conversion,\n conversionIndex: conversion.index\n };\n });\n return {\n types: param.types.concat(convertibleTypes),\n name: newName,\n hasAny,\n hasConversion: convertibleTypes.length > 0,\n restParam: param.restParam\n };\n }\n\n /**\n * Return the set of type names in a parameter.\n * Caches the result for efficiency\n *\n * @param {Param} param\n * @return {Set} typenames\n */\n function paramTypeSet(param) {\n if (!param.typeSet) {\n param.typeSet = new Set();\n param.types.forEach(type => param.typeSet.add(type.name));\n }\n return param.typeSet;\n }\n\n /**\n * Parse a signature with comma separated parameters,\n * like \"number | boolean, ...string\"\n *\n * @param {string} signature\n * @return {Param[]} params\n */\n function parseSignature(rawSignature) {\n const params = [];\n if (typeof rawSignature !== 'string') {\n throw new TypeError('Signatures must be strings');\n }\n const signature = rawSignature.trim();\n if (signature === '') {\n return params;\n }\n const rawParams = signature.split(',');\n for (let i = 0; i < rawParams.length; ++i) {\n const parsedParam = parseParam(rawParams[i].trim());\n if (parsedParam.restParam && i !== rawParams.length - 1) {\n throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n }\n // if invalid, short-circuit (all the types may have been filtered)\n if (parsedParam.types.length === 0) {\n return null;\n }\n params.push(parsedParam);\n }\n return params;\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 const param = last(params);\n return param ? param.restParam : false;\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 } else if (param.types.length === 1) {\n return findType(param.types[0].name).test;\n } else if (param.types.length === 2) {\n const test0 = findType(param.types[0].name).test;\n const test1 = findType(param.types[1].name).test;\n return function or(x) {\n return test0(x) || test1(x);\n };\n } else {\n // param.types.length > 2\n const tests = param.types.map(function (type) {\n return findType(type.name).test;\n });\n return function or(x) {\n for (let 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 let tests, test0, test1;\n if (hasRestParam(params)) {\n // variable arguments like '...number'\n tests = initial(params).map(compileTest);\n const varIndex = tests.length;\n const lastTest = compileTest(last(params));\n const testRestParam = function (args) {\n for (let i = varIndex; i < args.length; i++) {\n if (!lastTest(args[i])) {\n return false;\n }\n }\n return true;\n };\n return function testArgs(args) {\n for (let 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 } else {\n // no variable arguments\n if (params.length === 0) {\n return function testArgs(args) {\n return args.length === 0;\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 } 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 } else {\n // arguments.length > 2\n tests = params.map(compileTest);\n return function testArgs(args) {\n for (let 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 Params list.\n * Handles rest parameters.\n * @param {Param[]} params\n * @param {number} index\n * @return {Param | null} Returns the matching parameter when found,\n * null otherwise.\n */\n function getParamAtIndex(params, index) {\n return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n }\n\n /**\n * Get all type names of a parameter\n * @param {Params[]} params\n * @param {number} index\n * @return {string[]} Returns an array with type names\n */\n function getTypeSetAtIndex(params, index) {\n const param = getParamAtIndex(params, index);\n if (!param) {\n return new Set();\n }\n return paramTypeSet(param);\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 const typeSet = new Set();\n signatures.forEach(signature => {\n const paramSet = getTypeSetAtIndex(signature.params, index);\n let name;\n for (name of paramSet) {\n typeSet.add(name);\n }\n });\n return typeSet.has('any') ? ['any'] : Array.from(typeSet);\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 let err, expected;\n const _name = name || 'unnamed';\n\n // test for wrong type at some index\n let matchingSignatures = signatures;\n let index;\n for (index = 0; index < args.length; index++) {\n const nextMatchingDefs = [];\n matchingSignatures.forEach(signature => {\n const param = getParamAtIndex(signature.params, index);\n const test = compileTest(param);\n if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n nextMatchingDefs.push(signature);\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 const actualTypes = findTypeNames(args[index]);\n err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n err.data = {\n category: 'wrongType',\n fn: _name,\n index,\n actual: actualTypes,\n expected\n };\n return err;\n }\n } else {\n matchingSignatures = nextMatchingDefs;\n }\n }\n\n // test for too few arguments\n const 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 + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n err.data = {\n category: 'tooFewArgs',\n fn: _name,\n index: args.length,\n expected\n };\n return err;\n }\n\n // test for too many arguments\n const maxLength = Math.max.apply(null, lengths);\n if (args.length > maxLength) {\n err = new TypeError('Too many arguments in function ' + _name + ' (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 // Generic error\n const argTypes = [];\n for (let i = 0; i < args.length; ++i) {\n argTypes.push(findTypeNames(args[i]).join('|'));\n }\n err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n err.data = {\n category: 'mismatch',\n actual: argTypes\n };\n return err;\n }\n\n /**\n * Find the lowest index of all types of a parameter\n * @param {Param} param\n * @return {number} Returns the index of the lowest type in typed.types\n */\n function getLowestTypeIndex(param) {\n let min = typeList.length + 1;\n for (let i = 0; i < param.types.length; i++) {\n min = Math.min(min, param.types[i].typeIndex);\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 let min = nConversions + 1;\n for (let 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 return min;\n }\n\n /**\n * Compare two params. The return value is a number that is\n * negative when param1 should be considered first, positive\n * when param2 should be considered first, and zero when the\n * params are indistinguishable. Primarily as a debugging aid,\n * the value is always less than one in absolute value, and\n * a smaller absolute value indicates a less important distinction\n * between the parameters.\n * @param {Param} param1\n * @param {Param} param2\n * @return {number} negative, positive, or zero depending on whether\n * param1 should be ordered before, after, or equivalently\n * to param2\n */\n function compareParams(param1, param2) {\n // We compare a number of metrics on a param in turn:\n // 1) 'any' parameters are the least preferred\n if (param1.hasAny) {\n if (!param2.hasAny) {\n return 0.1;\n }\n } else if (param2.hasAny) {\n return -0.1;\n }\n\n // 2) Prefer non-rest to rest parameters\n if (param1.restParam) {\n if (!param2.restParam) {\n return 0.01;\n }\n } else if (param2.restParam) {\n return -0.01;\n }\n\n // 3) Prefer lower type index:\n const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n if (typeDiff < 0) {\n return -1e-3;\n }\n if (typeDiff > 0) {\n return 0.001;\n }\n\n // 4) Prefer exact type match to conversions, with a strength that\n // grows with the conversion index\n const conv1 = getLowestConversionIndex(param1);\n const conv2 = getLowestConversionIndex(param2);\n if (param1.hasConversion) {\n if (!param2.hasConversion) {\n return (1 + conv1) * 0.000001;\n }\n } else if (param2.hasConversion) {\n return -(1 + conv2) * 0.000001;\n }\n\n // 5) Prefer lower conversion index\n const convDiff = conv1 - conv2;\n if (convDiff < 0) {\n return -1e-7;\n }\n if (convDiff > 0) {\n return 0.0000001;\n }\n\n // Don't have a basis for preference\n return 0;\n }\n\n /**\n * Compare two signatures. The result is a number that is negative\n * when the first signature should be preferred to the second, positive\n * when the second signature should be preferred, and zero in case the\n * two signatures are essentially equivalent. Primarily as a debugging\n * aid, a larger absolute value indicates a more \"important\" difference.\n *\n * @param {Signature} signature1\n * @param {Signature} signature2\n * @return {number} returns a negative number when signature1 must get a\n * lower index than signature2, a positive number when the\n * opposite holds, or zero when both are equivalent.\n */\n function compareSignatures(signature1, signature2) {\n const pars1 = signature1.params;\n const pars2 = signature2.params;\n const last1 = last(pars1);\n const last2 = last(pars2);\n const hasRest1 = hasRestParam(pars1);\n const hasRest2 = hasRestParam(pars2);\n // We compare a number of metrics on signatures in turn:\n // 1) An \"any rest param\" is least preferred\n if (hasRest1 && last1.hasAny) {\n if (!hasRest2 || !last2.hasAny) {\n return 10000000;\n }\n } else if (hasRest2 && last2.hasAny) {\n return -1e7;\n }\n\n // 2) Minimize the number of 'any' parameters\n let any1 = 0;\n let conv1 = 0;\n let par;\n for (par of pars1) {\n if (par.hasAny) ++any1;\n if (par.hasConversion) ++conv1;\n }\n let any2 = 0;\n let conv2 = 0;\n for (par of pars2) {\n if (par.hasAny) ++any2;\n if (par.hasConversion) ++conv2;\n }\n if (any1 !== any2) {\n return (any1 - any2) * 1000000;\n }\n\n // 3) A conversion rest param is less preferred\n if (hasRest1 && last1.hasConversion) {\n if (!hasRest2 || !last2.hasConversion) {\n return 100000;\n }\n } else if (hasRest2 && last2.hasConversion) {\n return -1e5;\n }\n\n // 4) Minimize the number of conversions\n if (conv1 !== conv2) {\n return (conv1 - conv2) * 10000;\n }\n\n // 5) Prefer no rest param\n if (hasRest1) {\n if (!hasRest2) {\n return 1000;\n }\n } else if (hasRest2) {\n return -1e3;\n }\n\n // 6) Prefer shorter with rest param, longer without\n const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);\n if (lengthCriterion !== 0) {\n return lengthCriterion;\n }\n\n // Signatures are identical in each of the above metrics.\n // In particular, they are the same length.\n // We can therefore compare the parameters one by one.\n // First we count which signature has more preferred parameters.\n const comparisons = [];\n let tc = 0;\n for (let i = 0; i < pars1.length; ++i) {\n const thisComparison = compareParams(pars1[i], pars2[i]);\n comparisons.push(thisComparison);\n tc += thisComparison;\n }\n if (tc !== 0) {\n return (tc < 0 ? -10 : 10) + tc;\n }\n\n // They have the same number of preferred parameters, so go by the\n // earliest parameter in which we have a preference.\n // In other words, dispatch is driven somewhat more by earlier\n // parameters than later ones.\n let c;\n let bonus = 9;\n const decrement = bonus / (comparisons.length + 1);\n for (c of comparisons) {\n if (c !== 0) {\n return (c < 0 ? -bonus : bonus) + c;\n }\n bonus -= decrement;\n }\n\n // It's a tossup:\n return 0;\n }\n\n /**\n * Produce a list of all conversions from distinct types to one of\n * the given types.\n *\n * @param {string[]} typeNames\n * @return {ConversionDef[]} Returns the conversions that are available\n * resulting in any given type (if any)\n */\n function availableConversions(typeNames) {\n if (typeNames.length === 0) {\n return [];\n }\n const types = typeNames.map(findType);\n if (typeNames.length === 1) return types[0].conversionsTo;\n\n // Here, for each type that occurs as the from-type of any conversion\n // to any of the types found, we must select the conversion of\n // lowest index from that type. So first collect the types.\n const knownTypes = new Set(typeNames);\n const convertibleTypes = new Set();\n for (let i = 0; i < types.length; ++i) {\n for (const match of types[i].conversionsTo) {\n if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);\n }\n }\n\n // Now get the lowest-index conversion for each type\n const matches = [];\n for (const typeName of convertibleTypes) {\n let bestIndex = nConversions + 1;\n let bestConversion = null;\n for (let i = 0; i < types.length; ++i) {\n for (const match of types[i].conversionsTo) {\n if (match.from === typeName && match.index < bestIndex) {\n bestIndex = match.index;\n bestConversion = match;\n }\n }\n }\n matches.push(bestConversion);\n }\n return matches;\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 fn or a wrapped function if needed. If it\n * has conversions, the function will be named to indicate\n * what conversions are occurring.\n */\n function compileArgsPreprocessing(params, fn) {\n let fnConvert = fn;\n\n // TODO: can we make this wrapper function smarter/simpler?\n\n let name = '';\n if (params.some(p => p.hasConversion)) {\n const restParam = hasRestParam(params);\n const compiledConversions = params.map(compileArgConversion);\n name = compiledConversions.map(conv => conv.name).join(';');\n fnConvert = function convertArgs() {\n const args = [];\n const last = restParam ? arguments.length - 1 : arguments.length;\n for (let 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 return fn.apply(this, args);\n };\n }\n let fnPreprocess = fnConvert;\n if (hasRestParam(params)) {\n const offset = params.length - 1;\n fnPreprocess = function preprocessRestParams() {\n return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n };\n }\n if (name) Object.defineProperty(fnPreprocess, 'name', {\n value: name\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 let test0, test1, conversion0, conversion1;\n const tests = [];\n const conversions = [];\n let name = '';\n param.types.forEach(function (type) {\n if (type.conversion) {\n name += type.conversion.from + '~>' + type.conversion.to + ',';\n tests.push(findType(type.conversion.from).test);\n conversions.push(type.conversion.convert);\n }\n });\n if (name) name = name.slice(0, -1);else name = 'pass';\n\n // create optimized conversion functions depending on the number of conversions\n let convertor = arg => arg;\n switch (conversions.length) {\n case 0:\n break;\n case 1:\n test0 = tests[0];\n conversion0 = conversions[0];\n convertor = function convertArg(arg) {\n if (test0(arg)) {\n return conversion0(arg);\n }\n return arg;\n };\n break;\n case 2:\n test0 = tests[0];\n test1 = tests[1];\n conversion0 = conversions[0];\n conversion1 = conversions[1];\n convertor = 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 break;\n default:\n convertor = function convertArg(arg) {\n for (let i = 0; i < conversions.length; i++) {\n if (tests[i](arg)) {\n return conversions[i](arg);\n }\n }\n return arg;\n };\n }\n Object.defineProperty(convertor, 'name', {\n value: name\n });\n return convertor;\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 * @return {Param[]}\n */\n function splitParams(params) {\n function _splitParams(params, index, paramsSoFar) {\n if (index < params.length) {\n const param = params[index];\n let resultingParams = [];\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 const exactTypes = param.types.filter(isExactType);\n if (exactTypes.length < param.types.length) {\n resultingParams.push({\n types: exactTypes,\n name: '...' + exactTypes.map(t => t.name).join('|'),\n hasAny: exactTypes.some(t => t.isAny),\n hasConversion: false,\n restParam: true\n });\n }\n resultingParams.push(param);\n } else {\n // split all the types of a regular parameter into one type per param\n resultingParams = param.types.map(function (type) {\n return {\n types: [type],\n name: type.name,\n hasAny: type.isAny,\n hasConversion: type.conversion,\n restParam: false\n };\n });\n }\n\n // recurse over the groups with types\n return flatMap(resultingParams, function (nextParam) {\n return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n });\n } else {\n // we've reached the end of the parameters.\n return [paramsSoFar];\n }\n }\n return _splitParams(params, 0, []);\n }\n\n /**\n * Test whether two param lists represent conflicting signatures\n * @param {Param[]} params1\n * @param {Param[]} params2\n * @return {boolean} Returns true when the signatures conflict, false otherwise.\n */\n function conflicting(params1, params2) {\n const ii = Math.max(params1.length, params2.length);\n for (let i = 0; i < ii; i++) {\n const typeSet1 = getTypeSetAtIndex(params1, i);\n const typeSet2 = getTypeSetAtIndex(params2, i);\n let overlap = false;\n let name;\n for (name of typeSet2) {\n if (typeSet1.has(name)) {\n overlap = true;\n break;\n }\n }\n if (!overlap) {\n return false;\n }\n }\n const len1 = params1.length;\n const len2 = params2.length;\n const restParam1 = hasRestParam(params1);\n const restParam2 = hasRestParam(params2);\n return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n }\n\n /**\n * Helper function for `resolveReferences` that returns a copy of\n * functionList wihe any prior resolutions cleared out, in case we are\n * recycling signatures from a prior typed function construction.\n *\n * @param {Array.} functionList\n * @return {Array.}\n */\n function clearResolutions(functionList) {\n return functionList.map(fn => {\n if (isReferToSelf(fn)) {\n return referToSelf(fn.referToSelf.callback);\n }\n if (isReferTo(fn)) {\n return makeReferTo(fn.referTo.references, fn.referTo.callback);\n }\n return fn;\n });\n }\n\n /**\n * Take a list of references, a list of functions functionList, and a\n * signatureMap indexing signatures into functionList, and return\n * the list of resolutions, or a false-y value if they don't all\n * resolve in a valid way (yet).\n *\n * @param {string[]} references\n * @param {Array} signatureMap\n * @return {function[] | false} resolutions\n */\n function collectResolutions(references, functionList, signatureMap) {\n const resolvedReferences = [];\n let reference;\n for (reference of references) {\n let resolution = signatureMap[reference];\n if (typeof resolution !== 'number') {\n throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n }\n resolution = functionList[resolution];\n if (typeof resolution !== 'function') {\n return false;\n }\n resolvedReferences.push(resolution);\n }\n return resolvedReferences;\n }\n\n /**\n * Resolve any references in the functionList for the typed function\n * itself. The signatureMap tells which index in the functionList a\n * given signature should be mapped to (for use in resolving typed.referTo)\n * and self provides the destions of a typed.referToSelf.\n *\n * @param {Array} functionList\n * @param {Object.} signatureMap\n * @param {function} self The typed-function itself\n * @return {Array} The list of resolved functions\n */\n function resolveReferences(functionList, signatureMap, self) {\n const resolvedFunctions = clearResolutions(functionList);\n const isResolved = new Array(resolvedFunctions.length).fill(false);\n let leftUnresolved = true;\n while (leftUnresolved) {\n leftUnresolved = false;\n let nothingResolved = true;\n for (let i = 0; i < resolvedFunctions.length; ++i) {\n if (isResolved[i]) continue;\n const fn = resolvedFunctions[i];\n if (isReferToSelf(fn)) {\n resolvedFunctions[i] = fn.referToSelf.callback(self);\n // Preserve reference in case signature is reused someday:\n resolvedFunctions[i].referToSelf = fn.referToSelf;\n isResolved[i] = true;\n nothingResolved = false;\n } else if (isReferTo(fn)) {\n const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n if (resolvedReferences) {\n resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);\n // Preserve reference in case signature is reused someday:\n resolvedFunctions[i].referTo = fn.referTo;\n isResolved[i] = true;\n nothingResolved = false;\n } else {\n leftUnresolved = true;\n }\n }\n }\n if (nothingResolved && leftUnresolved) {\n throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n }\n }\n return resolvedFunctions;\n }\n\n /**\n * Validate whether any of the function bodies contains a self-reference\n * usage like `this(...)` or `this.signatures`. This self-referencing is\n * deprecated since typed-function v3. It has been replaced with\n * the functions typed.referTo and typed.referToSelf.\n * @param {Object.} signaturesMap\n */\n function validateDeprecatedThis(signaturesMap) {\n // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n // match occurrences like 'this(' and 'this.signatures'\n const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n Object.keys(signaturesMap).forEach(signature => {\n const fn = signaturesMap[signature];\n if (deprecatedThisRegex.test(fn.toString())) {\n throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n }\n });\n }\n\n /**\n * Create a typed function\n * @param {String} name The name for the typed function\n * @param {Object.} rawSignaturesMap\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, rawSignaturesMap) {\n typed.createCount++;\n if (Object.keys(rawSignaturesMap).length === 0) {\n throw new SyntaxError('No signatures provided');\n }\n if (typed.warnAgainstDeprecatedThis) {\n validateDeprecatedThis(rawSignaturesMap);\n }\n\n // Main processing loop for signatures\n const parsedParams = [];\n const originalFunctions = [];\n const signaturesMap = {};\n const preliminarySignatures = []; // may have duplicates from conversions\n let signature;\n for (signature in rawSignaturesMap) {\n // A) Protect against polluted Object prototype:\n if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n continue;\n }\n // B) Parse the signature\n const params = parseSignature(signature);\n if (!params) continue;\n // C) Check for conflicts\n parsedParams.forEach(function (pp) {\n if (conflicting(pp, params)) {\n throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n }\n });\n parsedParams.push(params);\n // D) Store the provided function and add conversions\n const functionIndex = originalFunctions.length;\n originalFunctions.push(rawSignaturesMap[signature]);\n const conversionParams = params.map(expandParam);\n // E) Split the signatures and collect them up\n let sp;\n for (sp of splitParams(conversionParams)) {\n const spName = stringifyParams(sp);\n preliminarySignatures.push({\n params: sp,\n name: spName,\n fn: functionIndex\n });\n if (sp.every(p => !p.hasConversion)) {\n signaturesMap[spName] = functionIndex;\n }\n }\n }\n preliminarySignatures.sort(compareSignatures);\n\n // Note the forward reference to theTypedFn\n const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);\n\n // Fill in the proper function for each signature\n let s;\n for (s in signaturesMap) {\n if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n }\n }\n const signatures = [];\n const internalSignatureMap = new Map(); // benchmarks faster than object\n for (s of preliminarySignatures) {\n // Note it's only safe to eliminate duplicates like this\n // _after_ the signature sorting step above; otherwise we might\n // remove the wrong one.\n if (!internalSignatureMap.has(s.name)) {\n s.fn = resolvedFunctions[s.fn];\n signatures.push(s);\n internalSignatureMap.set(s.name, s);\n }\n }\n\n // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n // compile the tests\n for (let i = 0; i < signatures.length; ++i) {\n signatures[i].test = compileTests(signatures[i].params);\n }\n const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n // compile the functions\n for (let i = 0; i < signatures.length; ++i) {\n signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n }\n const fn0 = ok0 ? signatures[0].implementation : undef;\n const fn1 = ok1 ? signatures[1].implementation : undef;\n const fn2 = ok2 ? signatures[2].implementation : undef;\n const fn3 = ok3 ? signatures[3].implementation : undef;\n const fn4 = ok4 ? signatures[4].implementation : undef;\n const fn5 = ok5 ? signatures[5].implementation : undef;\n const len0 = ok0 ? signatures[0].params.length : -1;\n const len1 = ok1 ? signatures[1].params.length : -1;\n const len2 = ok2 ? signatures[2].params.length : -1;\n const len3 = ok3 ? signatures[3].params.length : -1;\n const len4 = ok4 ? signatures[4].params.length : -1;\n const len5 = ok5 ? signatures[5].params.length : -1;\n\n // simple and generic, but also slow\n const iStart = allOk ? 6 : 0;\n const iEnd = signatures.length;\n // de-reference ahead for execution speed:\n const tests = signatures.map(s => s.test);\n const fns = signatures.map(s => s.implementation);\n const generic = function generic() {\n\n for (let i = iStart; i < iEnd; i++) {\n if (tests[i](arguments)) {\n return fns[i].apply(this, arguments);\n }\n }\n return typed.onMismatch(name, arguments, signatures);\n };\n\n // create the typed function\n // fast, specialized version. Falls back to the slower, generic one if needed\n function theTypedFn(arg0, arg1) {\n\n if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n return fn0.apply(this, arguments);\n }\n if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n return fn1.apply(this, arguments);\n }\n if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n return fn2.apply(this, arguments);\n }\n if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n return fn3.apply(this, arguments);\n }\n if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n return fn4.apply(this, arguments);\n }\n if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n return fn5.apply(this, arguments);\n }\n return generic.apply(this, arguments);\n }\n\n // attach name the typed function\n try {\n Object.defineProperty(theTypedFn, 'name', {\n 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 // This property is close to the original collection of signatures\n // used to create the typed-function, just with unions split:\n theTypedFn.signatures = signaturesMap;\n\n // Store internal data for functions like resolve, find, etc.\n // Also serves as the flag that this is a typed-function\n theTypedFn._typedFunctionData = {\n signatures,\n signatureMap: internalSignatureMap\n };\n return theTypedFn;\n }\n\n /**\n * Action to take on mismatch\n * @param {string} name Name of function that was attempted to be called\n * @param {Array} args Actual arguments to the call\n * @param {Array} signatures Known signatures of the named typed-function\n */\n function _onMismatch(name, args, signatures) {\n throw createError(name, args, signatures);\n }\n\n /**\n * Return all but the last items of an array or function Arguments\n * @param {Array | Arguments} arr\n * @return {Array}\n */\n function initial(arr) {\n return slice(arr, 0, arr.length - 1);\n }\n\n /**\n * return the last item of an array or function Arguments\n * @param {Array | Arguments} 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 * 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 (let i = 0; i < arr.length; i++) {\n if (test(arr[i])) {\n return arr[i];\n }\n }\n return undefined;\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 * Create a reference callback to one or multiple signatures\n *\n * Syntax:\n *\n * typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n * // ...\n * })\n *\n * @returns {{referTo: {references: string[], callback}}}\n */\n function referTo() {\n const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n const callback = last(arguments);\n if (typeof callback !== 'function') {\n throw new TypeError('Callback function expected as last argument');\n }\n return makeReferTo(references, callback);\n }\n function makeReferTo(references, callback) {\n return {\n referTo: {\n references,\n callback\n }\n };\n }\n\n /**\n * Create a reference callback to the typed-function itself\n *\n * @param {(self: function) => function} callback\n * @returns {{referToSelf: { callback: function }}}\n */\n function referToSelf(callback) {\n if (typeof callback !== 'function') {\n throw new TypeError('Callback function expected as first argument');\n }\n return {\n referToSelf: {\n callback\n }\n };\n }\n\n /**\n * Test whether something is a referTo object, holding a list with reference\n * signatures and a callback.\n *\n * @param {Object | function} objectOrFn\n * @returns {boolean}\n */\n function isReferTo(objectOrFn) {\n return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n }\n\n /**\n * Test whether something is a referToSelf object, holding a callback where\n * to pass `self`.\n *\n * @param {Object | function} objectOrFn\n * @returns {boolean}\n */\n function isReferToSelf(objectOrFn) {\n return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n }\n\n /**\n * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n * an error in case (C).\n *\n * @param { string | undefined } nameSoFar\n * @param { string | undefined } newName\n * @returns { string } updated name\n */\n function checkName(nameSoFar, newName) {\n if (!nameSoFar) {\n return newName;\n }\n if (newName && newName !== nameSoFar) {\n const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n err.data = {\n actual: newName,\n expected: nameSoFar\n };\n throw err;\n }\n return nameSoFar;\n }\n\n /**\n * Retrieve the implied name from an object with signature keys\n * and function values, checking whether all value names match\n *\n * @param { {string: function} } obj\n */\n function getObjectName(obj) {\n let name;\n for (const key in obj) {\n // Only pay attention to own properties, and only if their values\n // are typed functions or functions with a signature property\n if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n name = checkName(name, obj[key].name);\n }\n }\n return name;\n }\n\n /**\n * Copy all of the signatures from the second argument into the first,\n * which is modified by side effect, checking for conflicts\n *\n * @param {Object.} dest\n * @param {Object.} source\n */\n function mergeSignatures(dest, source) {\n let key;\n for (key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n if (key in dest) {\n if (source[key] !== dest[key]) {\n const err = new Error('Signature \"' + key + '\" is defined twice');\n err.data = {\n signature: key,\n sourceFunction: source[key],\n destFunction: dest[key]\n };\n throw err;\n }\n // else: both signatures point to the same function, that's fine\n }\n dest[key] = source[key];\n }\n }\n }\n const saveTyped = typed;\n\n /**\n * Originally the main function was a typed function itself, but then\n * it might not be able to generate error messages if the client\n * replaced the type system with different names.\n *\n * Main entry: typed([name], functions/objects with signatures...)\n *\n * Assembles and returns a new typed-function from the given items\n * that provide signatures and implementations, each of which may be\n * * a plain object mapping (string) signatures to implementing functions,\n * * a previously constructed typed function, or\n * * any other single function with a string-valued property `signature`.\n * The name of the resulting typed-function will be given by the\n * string-valued name argument if present, or if not, by the name\n * of any of the arguments that have one, as long as any that do are\n * consistent with each other. If no name is specified, the name will be\n * an empty string.\n *\n * @param {string} maybeName [optional]\n * @param {(function|object)[]} signature providers\n * @returns {typed-function}\n */\n typed = function (maybeName) {\n const named = typeof maybeName === 'string';\n const start = named ? 1 : 0;\n let name = named ? maybeName : '';\n const allSignatures = {};\n for (let i = start; i < arguments.length; ++i) {\n const item = arguments[i];\n let theseSignatures = {};\n let thisName;\n if (typeof item === 'function') {\n thisName = item.name;\n if (typeof item.signature === 'string') {\n // Case 1: Ordinary function with a string 'signature' property\n theseSignatures[item.signature] = item;\n } else if (isTypedFunction(item)) {\n // Case 2: Existing typed function\n theseSignatures = item.signatures;\n }\n } else if (isPlainObject(item)) {\n // Case 3: Plain object, assume keys = signatures, values = functions\n theseSignatures = item;\n if (!named) {\n thisName = getObjectName(item);\n }\n }\n if (Object.keys(theseSignatures).length === 0) {\n const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n err.data = {\n index: i,\n argument: item\n };\n throw err;\n }\n if (!named) {\n name = checkName(name, thisName);\n }\n mergeSignatures(allSignatures, theseSignatures);\n }\n return createTypedFunction(name || '', allSignatures);\n };\n typed.create = create;\n typed.createCount = saveTyped.createCount;\n typed.onMismatch = _onMismatch;\n typed.throwMismatchError = _onMismatch;\n typed.createError = createError;\n typed.clear = clear;\n typed.clearConversions = clearConversions;\n typed.addTypes = addTypes;\n typed._findType = findType; // For unit testing only\n typed.referTo = referTo;\n typed.referToSelf = referToSelf;\n typed.convert = convert;\n typed.findSignature = findSignature;\n typed.find = find;\n typed.isTypedFunction = isTypedFunction;\n typed.warnAgainstDeprecatedThis = true;\n\n /**\n * add a type (convenience wrapper for typed.addTypes)\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 let before = 'any';\n if (beforeObjectTest !== false && typeMap.has('Object')) {\n before = 'Object';\n }\n typed.addTypes([type], before);\n };\n\n /**\n * Verify that the ConversionDef conversion has a valid format.\n *\n * @param {conversionDef} conversion\n * @return {void}\n * @throws {TypeError|SyntaxError}\n */\n function _validateConversion(conversion) {\n if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n }\n if (conversion.to === conversion.from) {\n throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n }\n }\n\n /**\n * Add a conversion\n *\n * @param {ConversionDef} conversion\n * @param {{override: boolean}} [options]\n * @returns {void}\n * @throws {TypeError}\n */\n typed.addConversion = function (conversion) {\n let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n override: false\n };\n _validateConversion(conversion);\n const to = findType(conversion.to);\n const existing = to.conversionsTo.find(other => other.from === conversion.from);\n if (existing) {\n if (options && options.override) {\n typed.removeConversion({\n from: existing.from,\n to: conversion.to,\n convert: existing.convert\n });\n } else {\n throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n }\n }\n to.conversionsTo.push({\n from: conversion.from,\n to: to.name,\n convert: conversion.convert,\n index: nConversions++\n });\n };\n\n /**\n * Convenience wrapper to call addConversion on each conversion in a list.\n *\n * @param {ConversionDef[]} conversions\n * @param {{override: boolean}} [options]\n * @returns {void}\n * @throws {TypeError}\n */\n typed.addConversions = function (conversions, options) {\n conversions.forEach(conversion => typed.addConversion(conversion, options));\n };\n\n /**\n * Remove the specified conversion. The format is the same as for\n * addConversion, and the convert function must match or an error\n * is thrown.\n *\n * @param {{from: string, to: string, convert: function}} conversion\n * @returns {void}\n * @throws {TypeError|SyntaxError|Error}\n */\n typed.removeConversion = function (conversion) {\n _validateConversion(conversion);\n const to = findType(conversion.to);\n const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n if (!existingConversion) {\n throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n }\n if (existingConversion.convert !== conversion.convert) {\n throw new Error('Conversion to remove does not match existing conversion');\n }\n const index = to.conversionsTo.indexOf(existingConversion);\n to.conversionsTo.splice(index, 1);\n };\n\n /**\n * Produce the specific signature that a typed function\n * will execute on the given arguments. Here, a \"signature\" is an\n * object with properties 'params', 'test', 'fn', and 'implementation'.\n * This last property is a function that converts params as necessary\n * and then calls 'fn'. Returns null if there is no matching signature.\n * @param {typed-function} tf\n * @param {any[]} argList\n * @returns {{params: string, test: function, fn: function, implementation: function}}\n */\n typed.resolve = function (tf, argList) {\n if (!isTypedFunction(tf)) {\n throw new TypeError(NOT_TYPED_FUNCTION);\n }\n const sigs = tf._typedFunctionData.signatures;\n for (let i = 0; i < sigs.length; ++i) {\n if (sigs[i].test(argList)) {\n return sigs[i];\n }\n }\n return null;\n };\n return typed;\n }\n var typedFunction = create();\n\n return typedFunction;\n\n}));\n//# sourceMappingURL=typed-function.js.map\n","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n * math.typed(name, signatures) : function\n * math.typed(signatures) : function\n *\n * Examples:\n *\n * // create a typed function with multiple types per argument (type union)\n * const fn2 = typed({\n * 'number | boolean': function (b) {\n * return 'b is a number or boolean'\n * },\n * 'string, number | boolean': function (a, b) {\n * return 'a is a string, b is a number or boolean'\n * }\n * })\n *\n * // create a typed function with an any type argument\n * const log = typed({\n * 'string, any': function (event, data) {\n * console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n * }\n * })\n *\n * @param {string} [name] Optional name for the typed-function\n * @param {Object} signatures Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\nimport typedFunction from 'typed-function';\nimport { factory } from '../../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport { digits } from '../../utils/number.js';\n\n// returns a new instance of typed-function\nvar _createTyped2 = function _createTyped() {\n // initially, return the original instance of typed-function\n // consecutively, return a new instance from typed.create.\n _createTyped2 = typedFunction.create;\n return typedFunction;\n};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n var {\n BigNumber,\n Complex,\n DenseMatrix,\n Fraction\n } = _ref;\n // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n // get a new instance of typed-function\n var typed = _createTyped2();\n\n // define all types. The order of the types determines in which order function\n // arguments are type-checked (so for performance it's important to put the\n // most used types first).\n typed.clear();\n typed.addTypes([{\n name: 'number',\n test: isNumber\n }, {\n name: 'Complex',\n test: isComplex\n }, {\n name: 'BigNumber',\n test: isBigNumber\n }, {\n name: 'bigint',\n test: isBigInt\n }, {\n name: 'Fraction',\n test: isFraction\n }, {\n name: 'Unit',\n test: isUnit\n },\n // The following type matches a valid variable name, i.e., an alphanumeric\n // string starting with an alphabetic character. It is used (at least)\n // in the definition of the derivative() function, as the argument telling\n // what to differentiate over must (currently) be a variable.\n // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)\n {\n name: 'identifier',\n test: s => isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CD\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7DC\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDDC0-\\uDDF3\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC4\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CD\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7DC\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDDC0-\\uDDF3\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC4\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])*$/.test(s)\n }, {\n name: 'string',\n test: isString\n }, {\n name: 'Chain',\n test: isChain\n }, {\n name: 'Array',\n test: isArray\n }, {\n name: 'Matrix',\n test: isMatrix\n }, {\n name: 'DenseMatrix',\n test: isDenseMatrix\n }, {\n name: 'SparseMatrix',\n test: isSparseMatrix\n }, {\n name: 'Range',\n test: isRange\n }, {\n name: 'Index',\n test: isIndex\n }, {\n name: 'boolean',\n test: isBoolean\n }, {\n name: 'ResultSet',\n test: isResultSet\n }, {\n name: 'Help',\n test: isHelp\n }, {\n name: 'function',\n test: isFunction\n }, {\n name: 'Date',\n test: isDate\n }, {\n name: 'RegExp',\n test: isRegExp\n }, {\n name: 'null',\n test: isNull\n }, {\n name: 'undefined',\n test: isUndefined\n }, {\n name: 'AccessorNode',\n test: isAccessorNode\n }, {\n name: 'ArrayNode',\n test: isArrayNode\n }, {\n name: 'AssignmentNode',\n test: isAssignmentNode\n }, {\n name: 'BlockNode',\n test: isBlockNode\n }, {\n name: 'ConditionalNode',\n test: isConditionalNode\n }, {\n name: 'ConstantNode',\n test: isConstantNode\n }, {\n name: 'FunctionNode',\n test: isFunctionNode\n }, {\n name: 'FunctionAssignmentNode',\n test: isFunctionAssignmentNode\n }, {\n name: 'IndexNode',\n test: isIndexNode\n }, {\n name: 'Node',\n test: isNode\n }, {\n name: 'ObjectNode',\n test: isObjectNode\n }, {\n name: 'OperatorNode',\n test: isOperatorNode\n }, {\n name: 'ParenthesisNode',\n test: isParenthesisNode\n }, {\n name: 'RangeNode',\n test: isRangeNode\n }, {\n name: 'RelationalNode',\n test: isRelationalNode\n }, {\n name: 'SymbolNode',\n test: isSymbolNode\n }, {\n name: 'Map',\n test: isMap\n }, {\n name: 'Object',\n test: isObject\n } // order 'Object' last, it matches on other classes too\n ]);\n typed.addConversions([{\n from: 'number',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n\n // note: conversion from number to BigNumber can fail if x has >15 digits\n if (digits(x) > 15) {\n throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n }\n return new BigNumber(x);\n }\n }, {\n from: 'number',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n return new Complex(x, 0);\n }\n }, {\n from: 'BigNumber',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n return new Complex(x.toNumber(), 0);\n }\n }, {\n from: 'bigint',\n to: 'number',\n convert: function convert(x) {\n if (x > Number.MAX_SAFE_INTEGER) {\n throw new TypeError('Cannot implicitly convert bigint to number: ' + 'value exceeds the max safe integer value (value: ' + x + ')');\n }\n return Number(x);\n }\n }, {\n from: 'bigint',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n return new BigNumber(x.toString());\n }\n }, {\n from: 'bigint',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n return new Fraction(x);\n }\n }, {\n from: 'Fraction',\n to: 'BigNumber',\n convert: function convert(x) {\n throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n }\n }, {\n from: 'Fraction',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n return new Complex(x.valueOf(), 0);\n }\n }, {\n from: 'number',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n var f = new Fraction(x);\n if (f.valueOf() !== x) {\n throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n }\n return f;\n }\n }, {\n // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n // from: 'Fraction',\n // to: 'number',\n // convert: function (x) {\n // return x.valueOf()\n // }\n // }, {\n from: 'string',\n to: 'number',\n convert: function convert(x) {\n var n = Number(x);\n if (isNaN(n)) {\n throw new Error('Cannot convert \"' + x + '\" to a number');\n }\n return n;\n }\n }, {\n from: 'string',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n try {\n return new BigNumber(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n }\n }\n }, {\n from: 'string',\n to: 'bigint',\n convert: function convert(x) {\n try {\n return BigInt(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to BigInt');\n }\n }\n }, {\n from: 'string',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n try {\n return new Fraction(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to Fraction');\n }\n }\n }, {\n from: 'string',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n try {\n return new Complex(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to Complex');\n }\n }\n }, {\n from: 'boolean',\n to: 'number',\n convert: function convert(x) {\n return +x;\n }\n }, {\n from: 'boolean',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n return new BigNumber(+x);\n }\n }, {\n from: 'boolean',\n to: 'bigint',\n convert: function convert(x) {\n return BigInt(+x);\n }\n }, {\n from: 'boolean',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n return new Fraction(+x);\n }\n }, {\n from: 'boolean',\n to: 'string',\n convert: function convert(x) {\n return String(x);\n }\n }, {\n from: 'Array',\n to: 'Matrix',\n convert: function convert(array) {\n if (!DenseMatrix) {\n throwNoMatrix();\n }\n return new DenseMatrix(array);\n }\n }, {\n from: 'Matrix',\n to: 'Array',\n convert: function convert(matrix) {\n return matrix.valueOf();\n }\n }]);\n\n // Provide a suggestion on how to call a function elementwise\n // This was added primarily as guidance for the v10 -> v11 transition,\n // and could potentially be removed in the future if it no longer seems\n // to be helpful.\n typed.onMismatch = (name, args, signatures) => {\n var usualError = typed.createError(name, args, signatures);\n if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n // check if the function can be unary:\n signatures.some(sig => !sig.params.includes(','))) {\n var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n err.data = usualError.data;\n throw err;\n }\n throw usualError;\n };\n\n // Provide a suggestion on how to call a function elementwise\n // This was added primarily as guidance for the v10 -> v11 transition,\n // and could potentially be removed in the future if it no longer seems\n // to be helpful.\n typed.onMismatch = (name, args, signatures) => {\n var usualError = typed.createError(name, args, signatures);\n if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n // check if the function can be unary:\n signatures.some(sig => !sig.params.includes(','))) {\n var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n err.data = usualError.data;\n throw err;\n }\n throw usualError;\n };\n return typed;\n});\nfunction throwNoBignumber(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","import { 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 this.entries = entries || [];\n }\n\n /**\n * Attach type information\n */\n ResultSet.prototype.type = 'ResultSet';\n ResultSet.prototype.isResultSet = true;\n\n /**\n * Returns the array with results hold by this ResultSet\n * @memberof ResultSet\n * @returns {Array} entries\n */\n ResultSet.prototype.valueOf = function () {\n return this.entries;\n };\n\n /**\n * Returns the stringified results of the ResultSet\n * @memberof ResultSet\n * @returns {string} string\n */\n ResultSet.prototype.toString = function () {\n return '[' + this.entries.map(String).join(', ') + ']';\n };\n\n /**\n * Get a JSON representation of the ResultSet\n * @memberof ResultSet\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n */\n ResultSet.prototype.toJSON = function () {\n return {\n mathjs: 'ResultSet',\n entries: this.entries\n };\n };\n\n /**\n * Instantiate a ResultSet from a JSON object\n * @memberof ResultSet\n * @param {Object} json A JSON object structured as:\n * `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n * @return {ResultSet}\n */\n ResultSet.fromJSON = function (json) {\n return new ResultSet(json.entries);\n };\n return ResultSet;\n}, {\n isClass: true\n});","import { isBigNumber, isNumber } from '../is.js';\nimport { isInteger, normalizeFormatOptions } from '../number.js';\n\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase(n, base, size) {\n var BigNumberCtor = n.constructor;\n var big2 = new BigNumberCtor(2);\n var suffix = '';\n if (size) {\n if (size < 1) {\n throw new Error('size must be in greater than 0');\n }\n if (!isInteger(size)) {\n throw new Error('size must be an integer');\n }\n if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n }\n if (!n.isInteger()) {\n throw new Error('Value must be an integer');\n }\n if (n.lessThan(0)) {\n n = n.add(big2.pow(size));\n }\n suffix = \"i\".concat(size);\n }\n switch (base) {\n case 2:\n return \"\".concat(n.toBinary()).concat(suffix);\n case 8:\n return \"\".concat(n.toOctal()).concat(suffix);\n case 16:\n return \"\".concat(n.toHexadecimal()).concat(suffix);\n default:\n throw new Error(\"Base \".concat(base, \" not supported \"));\n }\n}\n\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n * format(value)\n * format(value, options)\n * format(value, precision)\n * format(value, fn)\n *\n * Where:\n *\n * {number} value The value to be formatted\n * {Object} options An object with formatting options. Available options:\n * {string} notation\n * Number notation. Choose from:\n * 'fixed' Always use regular number notation.\n * For example '123.40' and '14000000'\n * 'exponential' Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * 'auto' (default) Regular number notation for numbers\n * having an absolute value between\n * `lower` and `upper` bounds, and uses\n * exponential notation elsewhere.\n * Lower bound is included, upper bound\n * is excluded.\n * For example '123.4' and '1.4e7'.\n * 'bin', 'oct, or\n * 'hex' Format the number using binary, octal,\n * or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * {number} wordSize The word size in bits to use for formatting\n * in binary, octal, or hexadecimal notation.\n * To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option\n * is defined the value is formatted as a signed\n * twos complement integer of the given word size\n * and the size suffix is appended to the output.\n * For example\n * format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * {number} precision A number between 0 and 16 to round\n * the digits of the number.\n * In case of notations 'exponential',\n * 'engineering', and 'auto',\n * `precision` defines the total\n * number of significant digits returned.\n * In case of notation 'fixed',\n * `precision` defines the number of\n * significant digits after the decimal\n * point.\n * `precision` is undefined by default.\n * {number} lowerExp Exponent determining the lower boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `-3`.\n * {number} upperExp Exponent determining the upper boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `5`.\n * {Function} fn A custom formatting function. Can be used to override the\n * built-in notations. Function `fn` is called with `value` as\n * parameter and must return a string. Is useful for example to\n * format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n * format(6.4) // '6.4'\n * format(1240000) // '1.24e6'\n * format(1/3) // '0.3333333333333333'\n * format(1/3, 3) // '0.333'\n * format(21385, 2) // '21000'\n * format(12e8, {notation: 'fixed'}) // returns '1200000000'\n * format(2.3, {notation: 'fixed', precision: 4}) // returns '2.3000'\n * format(52.8, {notation: 'exponential'}) // returns '5.28e+1'\n * format(12400, {notation: 'engineering'}) // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n if (typeof options === 'function') {\n // handle format(value, fn)\n return options(value);\n }\n\n // handle special cases\n if (!value.isFinite()) {\n return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n }\n var {\n notation,\n precision,\n wordSize\n } = normalizeFormatOptions(options);\n\n // handle the various notations\n switch (notation) {\n case 'fixed':\n return toFixed(value, precision);\n case 'exponential':\n return toExponential(value, precision);\n case 'engineering':\n return toEngineering(value, precision);\n case 'bin':\n return formatBigNumberToBase(value, 2, wordSize);\n case 'oct':\n return formatBigNumberToBase(value, 8, wordSize);\n case 'hex':\n return formatBigNumberToBase(value, 16, wordSize);\n case 'auto':\n {\n // determine lower and upper bound for exponential notation.\n // TODO: implement support for upper and lower to be BigNumbers themselves\n var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n\n // handle special case zero\n if (value.isZero()) return '0';\n\n // determine whether or not to output exponential notation\n var str;\n var rounded = value.toSignificantDigits(precision);\n var exp = rounded.e;\n if (exp >= lowerExp && exp < upperExp) {\n // normal number notation\n str = rounded.toFixed();\n } else {\n // exponential notation\n str = toExponential(value, precision);\n }\n\n // remove trailing zeros after the decimal point\n return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n var digits = arguments[2];\n var e = arguments[4];\n return digits !== '.' ? digits + e : e;\n });\n }\n default:\n throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision] Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n // find nearest lower multiple of 3 for exponent\n var e = value.e;\n var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n // find difference in exponents, and calculate the value without exponent\n var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n var valueStr = valueWithoutExp.toPrecision(precision);\n if (valueStr.includes('e')) {\n var BigNumber = value.constructor;\n valueStr = new BigNumber(valueStr).toFixed();\n }\n return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision] Number of digits in formatted output.\n * If not provided, the maximum available digits\n * is used.\n * @returns {string} str\n */\nexport function toExponential(value, precision) {\n if (precision !== undefined) {\n return value.toExponential(precision - 1); // Note the offset of one\n } else {\n return value.toExponential();\n }\n}\n\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n * decimal point. Undefined by default.\n */\nexport function toFixed(value, precision) {\n return value.toFixed(precision);\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n if (isNumber(value)) {\n return value;\n } else if (isBigNumber(value)) {\n return value.toNumber();\n } else {\n return defaultValue;\n }\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function endsWith(text, search) {\n var start = text.length - search.length;\n var end = text.length;\n return text.substring(start, end) === search;\n}\n\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n * math.format(value)\n * math.format(value, precision)\n * math.format(value, options)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n * syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n * function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n * and the result is returned.\n * - In other cases the function will loop over all object properties and\n * return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n * math.format(2/7) // '0.2857142857142857'\n * math.format(math.pi, 3) // '3.14'\n * math.format(new Complex(2, 3)) // '2 + 3i'\n * math.format('hello') // '\"hello\"'\n *\n * @param {*} value Value to be stringified\n * @param {Object | number | Function} [options]\n * Formatting options. See src/utils/number.js:format for a\n * description of the available options controlling number output.\n * This generic \"format\" also supports the option property `truncate: NN`\n * giving the maximum number NN of characters to return (if there would\n * have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format(value, options) {\n var result = _format(value, options);\n if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {\n return result.substring(0, options.truncate - 3) + '...';\n }\n return result;\n}\nfunction _format(value, options) {\n if (typeof value === 'number') {\n return formatNumber(value, options);\n }\n if (isBigNumber(value)) {\n return formatBigNumber(value, options);\n }\n\n // note: we use unsafe duck-typing here to check for Fractions, this is\n // ok here since we're only invoking toString or concatenating its values\n if (looksLikeFraction(value)) {\n if (!options || options.fraction !== 'decimal') {\n // output as ratio, like '1/3'\n return \"\".concat(value.s * value.n, \"/\").concat(value.d);\n } else {\n // output as decimal, like '0.(3)'\n return value.toString();\n }\n }\n if (Array.isArray(value)) {\n return formatArray(value, options);\n }\n if (isString(value)) {\n return stringify(value);\n }\n if (typeof value === 'function') {\n return value.syntax ? String(value.syntax) : 'function';\n }\n if (value && typeof value === 'object') {\n if (typeof value.format === 'function') {\n return value.format(options);\n } else if (value && value.toString(options) !== {}.toString()) {\n // this object has a non-native toString method, use that one\n return value.toString(options);\n } else {\n var entries = Object.keys(value).map(key => {\n return stringify(key) + ': ' + format(value[key], options);\n });\n return '{' + entries.join(', ') + '}';\n }\n }\n return String(value);\n}\n\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\nexport function stringify(value) {\n var text = String(value);\n var escaped = '';\n var i = 0;\n while (i < text.length) {\n var c = text.charAt(i);\n escaped += c in controlCharacters ? controlCharacters[c] : c;\n i++;\n }\n return '\"' + escaped + '\"';\n}\nvar controlCharacters = {\n '\"': '\\\\\"',\n '\\\\': '\\\\\\\\',\n '\\b': '\\\\b',\n '\\f': '\\\\f',\n '\\n': '\\\\n',\n '\\r': '\\\\r',\n '\\t': '\\\\t'\n};\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape(value) {\n var text = String(value);\n text = text.replace(/&/g, '&').replace(/\"/g, '"').replace(/'/g, ''').replace(//g, '>');\n return text;\n}\n\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\nfunction formatArray(array, options) {\n if (Array.isArray(array)) {\n var str = '[';\n var len = array.length;\n for (var i = 0; i < len; i++) {\n if (i !== 0) {\n str += ', ';\n }\n str += formatArray(array[i], options);\n }\n str += ']';\n return str;\n } else {\n return format(array, options);\n }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction(value) {\n return value && typeof value === 'object' && typeof value.s === 'bigint' && typeof value.n === 'bigint' && typeof value.d === 'bigint' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText(x, y) {\n // we don't want to convert numbers to string, only accept string input\n if (!isString(x)) {\n throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n }\n if (!isString(y)) {\n throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n }\n return x === y ? 0 : x > y ? 1 : -1;\n}","function _typeof(o) {\n \"@babel/helpers - typeof\";\n\n return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n return typeof o;\n } : function (o) {\n return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n }, _typeof(o);\n}\nexport { _typeof as default };","import _typeof from \"./typeof.js\";\nfunction toPrimitive(t, r) {\n if (\"object\" != _typeof(t) || !t) return t;\n var e = t[Symbol.toPrimitive];\n if (void 0 !== e) {\n var i = e.call(t, r || \"default\");\n if (\"object\" != _typeof(i)) return i;\n throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n }\n return (\"string\" === r ? String : Number)(t);\n}\nexport { toPrimitive as default };","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n var i = toPrimitive(t, \"string\");\n return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n value: t,\n enumerable: !0,\n configurable: !0,\n writable: !0\n }) : e[r] = t, e;\n}\nexport { _defineProperty as default };","// 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';\nimport { isConstantNode, isParenthesisNode, rule2Node } from '../utils/is.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\n // conditionals don't need parentheses in LaTeX because\n // they are 2 dimensional\n }\n}, {\n // logical or\n 'OperatorNode:or': {\n op: 'or',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // logical xor\n 'OperatorNode:xor': {\n op: 'xor',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // logical and\n 'OperatorNode:and': {\n op: 'and',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise or\n 'OperatorNode:bitOr': {\n op: '|',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise xor\n 'OperatorNode:bitXor': {\n op: '^|',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise and\n 'OperatorNode:bitAnd': {\n op: '&',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // relational operators\n 'OperatorNode:equal': {\n op: '==',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:unequal': {\n op: '!=',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:smaller': {\n op: '<',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:larger': {\n op: '>',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:smallerEq': {\n op: '<=',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:largerEq': {\n op: '>=',\n associativity: 'left',\n associativeWith: []\n },\n RelationalNode: {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitshift operators\n 'OperatorNode:leftShift': {\n op: '<<',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:rightArithShift': {\n op: '>>',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:rightLogShift': {\n op: '>>>',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // unit conversion\n 'OperatorNode:to': {\n op: 'to',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // range\n RangeNode: {}\n}, {\n // addition, subtraction\n 'OperatorNode:add': {\n op: '+',\n associativity: 'left',\n associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n },\n 'OperatorNode:subtract': {\n op: '-',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // multiply, divide, modulus\n 'OperatorNode:multiply': {\n op: '*',\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n },\n 'OperatorNode:divide': {\n op: '/',\n associativity: 'left',\n associativeWith: [],\n latexLeftParens: false,\n latexRightParens: false,\n latexParens: false\n // fractions don't require parentheses because\n // they're 2 dimensional, so parens aren't needed\n // in LaTeX\n },\n 'OperatorNode:dotMultiply': {\n op: '.*',\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\n },\n 'OperatorNode:dotDivide': {\n op: './',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:mod': {\n op: 'mod',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // Repeat multiplication for implicit multiplication\n 'OperatorNode:multiply': {\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n }\n}, {\n // unary prefix operators\n 'OperatorNode:unaryPlus': {\n op: '+',\n associativity: 'right'\n },\n 'OperatorNode:unaryMinus': {\n op: '-',\n associativity: 'right'\n },\n 'OperatorNode:bitNot': {\n op: '~',\n associativity: 'right'\n },\n 'OperatorNode:not': {\n op: 'not',\n associativity: 'right'\n }\n}, {\n // exponentiation\n 'OperatorNode:pow': {\n op: '^',\n associativity: 'right',\n associativeWith: [],\n latexRightParens: false\n // the exponent doesn't need parentheses in\n // LaTeX because it's 2 dimensional\n // (it's on top)\n },\n 'OperatorNode:dotPow': {\n op: '.^',\n associativity: 'right',\n associativeWith: []\n }\n}, {\n // nullish coalescing\n 'OperatorNode:nullish': {\n op: '??',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // factorial\n 'OperatorNode:factorial': {\n op: '!',\n associativity: 'left'\n }\n}, {\n // matrix transpose\n 'OperatorNode:ctranspose': {\n op: \"'\",\n associativity: 'left'\n }\n}];\n\n/**\n * Returns the first non-parenthesis internal node, but only\n * when the 'parenthesis' option is unset or auto.\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {Node}\n */\nfunction unwrapParen(_node, parenthesis) {\n if (!parenthesis || parenthesis !== 'auto') return _node;\n var node = _node;\n while (isParenthesisNode(node)) node = node.content;\n return node;\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 * @param {string} implicit\n * @param {Node} parent (for determining context for implicit multiplication)\n * @return {number | null}\n */\nexport function getPrecedence(_node, parenthesis, implicit, parent) {\n var node = _node;\n if (parenthesis !== 'keep') {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n node = _node.getContent();\n }\n var identifier = node.getIdentifier();\n var precedence = null;\n for (var i = 0; i < properties.length; i++) {\n if (identifier in properties[i]) {\n precedence = i;\n break;\n }\n }\n // Bump up precedence of implicit multiplication, except when preceded\n // by a \"Rule 2\" fraction ( [unaryOp]constant / constant )\n if (identifier === 'OperatorNode:multiply' && node.implicit && implicit !== 'show') {\n var leftArg = unwrapParen(node.args[0], parenthesis);\n if (!(isConstantNode(leftArg) && parent && parent.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(parent.args[0], parenthesis))) && !(leftArg.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(leftArg.args[0], parenthesis)) && isConstantNode(unwrapParen(leftArg.args[1])))) {\n precedence += 1;\n }\n }\n return precedence;\n}\n\n/**\n * Get the associativity of an operator (left or right).\n * Returns a string containing 'left' or 'right' or null if\n * the associativity is not defined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\nexport function getAssociativity(_node, parenthesis) {\n var node = _node;\n if (parenthesis !== 'keep') {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n node = _node.getContent();\n }\n var identifier = node.getIdentifier();\n var index = getPrecedence(node, parenthesis);\n if (index === null) {\n // node isn't in the list\n return null;\n }\n var property = properties[index][identifier];\n if (hasOwnProperty(property, 'associativity')) {\n if (property.associativity === 'left') {\n return 'left';\n }\n if (property.associativity === 'right') {\n return 'right';\n }\n // associativity is invalid\n throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n }\n\n // associativity is undefined\n return null;\n}\n\n/**\n * Check if an operator is associative with another operator.\n * Returns either true or false or null if not defined.\n *\n * @param {Node} nodeA\n * @param {Node} nodeB\n * @param {string} parenthesis\n * @return {boolean | null}\n */\nexport function isAssociativeWith(nodeA, nodeB, parenthesis) {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n 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 if (index === null) {\n // node isn't in the list\n return null;\n }\n var property = properties[index][identifierA];\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 return false;\n }\n\n // associativeWith is not defined\n return null;\n}\n\n/**\n * Get the operator associated with a function name.\n * Returns a string with the operator symbol, or null if the\n * input is not the name of a function associated with an\n * operator.\n *\n * @param {string} Function name\n * @return {string | null} Associated operator symbol, if any\n */\nexport function getOperator(fn) {\n var identifier = 'OperatorNode:' + fn;\n for (var group of properties) {\n if (identifier in group) {\n return group[identifier].op;\n }\n }\n return null;\n}","/**\n * Create a range error with the message:\n * 'Index out of range (index < min)'\n * 'Index out of range (index < max)'\n *\n * @param {number} index The actual index\n * @param {number} [min=0] Minimum index (included)\n * @param {number} [max] Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n if (!(this instanceof IndexError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n this.index = index;\n if (arguments.length < 3) {\n this.min = 0;\n this.max = min;\n } else {\n this.min = min;\n this.max = max;\n }\n if (this.min !== undefined && this.index < this.min) {\n this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n } else if (this.max !== undefined && this.index >= this.max) {\n this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n } else {\n this.message = 'Index out of range (' + this.index + ')';\n }\n this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","/**\n * Create a range error with the message:\n * 'Dimension mismatch ( != )'\n * @param {number | number[]} actual The actual size\n * @param {number | number[]} expected The expected size\n * @param {string} [relation='!='] Optional relation between actual\n * and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError(actual, expected, relation) {\n if (!(this instanceof DimensionError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n this.actual = actual;\n this.expected = expected;\n this.relation = relation;\n this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","import _extends from \"@babel/runtime/helpers/extends\";\nimport { isInteger } from './number.js';\nimport { isNumber, isBigNumber, isArray, isString } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { deepStrictEqual } from './object.js';\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @return {number[]} size\n */\nexport function arraySize(x) {\n var s = [];\n while (Array.isArray(x)) {\n s.push(x.length);\n x = x[0];\n }\n return s;\n}\n\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array Array to be validated\n * @param {number[]} size Array with the size of each dimension\n * @param {number} dim Current dimension\n * @throws DimensionError\n * @private\n */\nfunction _validate(array, size, dim) {\n var i;\n var len = array.length;\n if (len !== size[dim]) {\n throw new DimensionError(len, size[dim]);\n }\n if (dim < size.length - 1) {\n // recursively validate each child array\n var dimNext = dim + 1;\n for (i = 0; i < len; i++) {\n var child = array[i];\n if (!Array.isArray(child)) {\n throw new DimensionError(size.length - 1, size.length, '<');\n }\n _validate(array[i], size, dimNext);\n }\n } else {\n // last dimension. none of the children may be an array\n for (i = 0; i < len; i++) {\n if (Array.isArray(array[i])) {\n throw new DimensionError(size.length + 1, size.length, '>');\n }\n }\n }\n}\n\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array Array to be validated\n * @param {number[]} size Array with the size of each dimension\n * @throws DimensionError\n */\nexport function validate(array, size) {\n var isScalar = size.length === 0;\n if (isScalar) {\n // scalar\n if (Array.isArray(array)) {\n throw new DimensionError(array.length, 0);\n }\n } else {\n // array\n _validate(array, size, 0);\n }\n}\n\n/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} value Array to be validated\n * @param {Index} index Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize(value, index) {\n var valueSize = value.isMatrix ? value._size : arraySize(value);\n var sourceSize = index._sourceSize;\n // checks if the source size is not null and matches the valueSize\n sourceSize.forEach((sourceDim, i) => {\n if (sourceDim !== null && sourceDim !== valueSize[i]) {\n throw new DimensionError(sourceDim, valueSize[i]);\n }\n });\n}\n\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index Zero-based index\n * @param {number} [length] Length of the array\n */\nexport function validateIndex(index, length) {\n if (index !== undefined) {\n if (!isNumber(index) || !isInteger(index)) {\n throw new TypeError('Index must be an integer (value: ' + index + ')');\n }\n if (index < 0 || typeof length === 'number' && index >= length) {\n throw new IndexError(index, length);\n }\n }\n}\n\n/**\n * Test if an index has empty values\n * @param {Index} index Zero-based index\n */\nexport function isEmptyIndex(index) {\n for (var i = 0; i < index._dimensions.length; ++i) {\n var dimension = index._dimensions[i];\n if (dimension._data && isArray(dimension._data)) {\n if (dimension._size[0] === 0) {\n return true;\n }\n } else if (dimension.isRange) {\n if (dimension.start === dimension.end) {\n return true;\n }\n } else if (isString(dimension)) {\n if (dimension.length === 0) {\n return true;\n }\n }\n }\n return false;\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {*} [defaultValue=0] Value to be filled in new entries,\n * zero by default. Specify for example `null`,\n * to clearly see entries that are not explicitly\n * set.\n * @return {Array} array The resized array\n */\nexport function resize(array, size, defaultValue) {\n // check the type of the arguments\n if (!Array.isArray(size)) {\n throw new TypeError('Array expected');\n }\n if (size.length === 0) {\n throw new Error('Resizing to scalar is not supported');\n }\n\n // check whether size contains positive integers\n size.forEach(function (value) {\n if (!isNumber(value) || !isInteger(value) || value < 0) {\n throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n }\n });\n\n // convert number to an array\n if (isNumber(array) || isBigNumber(array)) {\n array = [array];\n }\n\n // recursively resize the array\n var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n _resize(array, size, 0, _defaultValue);\n return array;\n}\n\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {number} dim Current dimension\n * @param {*} [defaultValue] Value to be filled in new entries,\n * undefined by default.\n * @private\n */\nfunction _resize(array, size, dim, defaultValue) {\n var i;\n var elem;\n var oldLen = array.length;\n var newLen = size[dim];\n var minLen = Math.min(oldLen, newLen);\n\n // apply new length\n array.length = newLen;\n if (dim < size.length - 1) {\n // non-last dimension\n var dimNext = dim + 1;\n\n // resize existing child arrays\n for (i = 0; i < minLen; i++) {\n // resize child array\n elem = array[i];\n if (!Array.isArray(elem)) {\n elem = [elem]; // add a dimension\n array[i] = elem;\n }\n _resize(elem, size, dimNext, defaultValue);\n }\n\n // create new child arrays\n for (i = minLen; i < newLen; i++) {\n // get child array\n elem = [];\n array[i] = elem;\n\n // resize new child array\n _resize(elem, size, dimNext, defaultValue);\n }\n } else {\n // last dimension\n\n // remove dimensions of existing values\n for (i = 0; i < minLen; i++) {\n while (Array.isArray(array[i])) {\n array[i] = array[i][0];\n }\n }\n\n // fill new elements with the default value\n for (i = minLen; i < newLen; i++) {\n array[i] = defaultValue;\n }\n }\n}\n\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array Array to be reshaped\n * @param {number[]} sizes List of sizes for each dimension\n * @returns {Array} Array whose data has been formatted to fit the\n * specified dimensions\n *\n * @throws {DimensionError} If the product of the new dimension sizes does\n * not equal that of the old ones\n */\nexport function reshape(array, sizes) {\n var flatArray = flatten(array, true); // since it has rectangular\n var currentLength = flatArray.length;\n if (!Array.isArray(array) || !Array.isArray(sizes)) {\n throw new TypeError('Array expected');\n }\n if (sizes.length === 0) {\n throw new DimensionError(0, currentLength, '!=');\n }\n sizes = processSizesWildcard(sizes, currentLength);\n var newLength = product(sizes);\n if (currentLength !== newLength) {\n throw new DimensionError(newLength, currentLength, '!=');\n }\n try {\n return _reshape(flatArray, sizes);\n } catch (e) {\n if (e instanceof DimensionError) {\n throw new DimensionError(newLength, currentLength, '!=');\n }\n throw e;\n }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {number[]} sizes List of sizes for each dimension. At most one 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 {number[]} The sizes array with wildcard replaced.\n */\nexport function processSizesWildcard(sizes, currentLength) {\n var newLength = product(sizes);\n var processedSizes = sizes.slice();\n var WILDCARD = -1;\n var wildCardIndex = sizes.indexOf(WILDCARD);\n var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n if (isMoreThanOneWildcard) {\n throw new Error('More than one wildcard in sizes');\n }\n var hasWildcard = wildCardIndex >= 0;\n var canReplaceWildcard = currentLength % newLength === 0;\n if (hasWildcard) {\n if (canReplaceWildcard) {\n processedSizes[wildCardIndex] = -currentLength / newLength;\n } else {\n throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n }\n }\n return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {number[]} array Array of factors\n * @returns {number} Product of all elements\n */\nfunction product(array) {\n return array.reduce((prev, curr) => prev * curr, 1);\n}\n\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array Array to be reshaped\n * @param {number[]} sizes List of sizes for each dimension\n * @returns {Array} Array whose data has been formatted to fit the\n * specified dimensions\n */\n\nfunction _reshape(array, sizes) {\n // testing if there are enough elements for the requested shape\n var tmpArray = array;\n var tmpArray2;\n // for each dimension starting by the last one and ignoring the first one\n for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n var size = sizes[sizeIndex];\n tmpArray2 = [];\n\n // aggregate the elements of the current tmpArray in elements of the requested size\n var length = tmpArray.length / size;\n for (var i = 0; i < length; i++) {\n tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n }\n // set it as the new tmpArray for the next loop turn or for return\n tmpArray = tmpArray2;\n }\n return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze(array, size) {\n var s = size || arraySize(array);\n\n // squeeze outer dimensions\n while (Array.isArray(array) && array.length === 1) {\n array = array[0];\n s.shift();\n }\n\n // find the first dimension to be squeezed\n var dims = s.length;\n while (s[dims - 1] === 1) {\n dims--;\n }\n\n // squeeze inner dimensions\n if (dims < s.length) {\n array = _squeeze(array, dims, 0);\n s.length = dims;\n }\n return array;\n}\n\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _squeeze(array, dims, dim) {\n var i, ii;\n if (dim < dims) {\n var next = dim + 1;\n for (i = 0, ii = array.length; i < ii; i++) {\n array[i] = _squeeze(array[i], dims, next);\n }\n } else {\n while (Array.isArray(array)) {\n array = array[0];\n }\n }\n return array;\n}\n\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Parameter `size` will be mutated to match the new, unsqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims Desired number of dimensions of the array\n * @param {number} [outer] Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nexport function unsqueeze(array, dims, outer, size) {\n var s = size || arraySize(array);\n\n // unsqueeze outer dimensions\n if (outer) {\n for (var i = 0; i < outer; i++) {\n array = [array];\n s.unshift(1);\n }\n }\n\n // unsqueeze inner dimensions\n array = _unsqueeze(array, dims, 0);\n while (s.length < dims) {\n s.push(1);\n }\n return array;\n}\n\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim Current dimension\n * @returns {Array | *} Returns the unsqueezed array\n * @private\n */\nfunction _unsqueeze(array, dims, dim) {\n var i, ii;\n if (Array.isArray(array)) {\n var next = dim + 1;\n for (i = 0, ii = array.length; i < ii; i++) {\n array[i] = _unsqueeze(array[i], dims, next);\n }\n } else {\n for (var d = dim; d < dims; d++) {\n array = [array];\n }\n }\n return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array A multi dimensional array\n * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)\n * @return {Array} The flattened array (1 dimensional)\n */\nexport function flatten(array) {\n var isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n if (!Array.isArray(array)) {\n // if not an array, return as is\n return array;\n }\n if (typeof isRectangular !== 'boolean') {\n throw new TypeError('Boolean expected for second argument of flatten');\n }\n var flat = [];\n if (isRectangular) {\n _flattenRectangular(array);\n } else {\n _flatten(array);\n }\n return flat;\n function _flatten(array) {\n for (var i = 0; i < array.length; i++) {\n var item = array[i];\n if (Array.isArray(item)) {\n _flatten(item);\n } else {\n flat.push(item);\n }\n }\n }\n function _flattenRectangular(array) {\n if (Array.isArray(array[0])) {\n for (var i = 0; i < array.length; i++) {\n _flattenRectangular(array[i]);\n }\n } else {\n for (var _i = 0; _i < array.length; _i++) {\n flat.push(array[_i]);\n }\n }\n }\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map(array, callback) {\n return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach(array, callback) {\n Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter(array, callback) {\n if (arraySize(array).length !== 1) {\n throw new Error('Only one dimensional matrices supported');\n }\n return Array.prototype.filter.call(array, callback);\n}\n\n/**\n * Filter values in an array given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function filterRegExp(array, regexp) {\n if (arraySize(array).length !== 1) {\n throw new Error('Only one dimensional matrices supported');\n }\n return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join(array, separator) {\n return Array.prototype.join.call(array, separator);\n}\n\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\nexport function identify(a) {\n if (!Array.isArray(a)) {\n throw new TypeError('Array input expected');\n }\n if (a.length === 0) {\n return a;\n }\n var b = [];\n var count = 0;\n b[0] = {\n value: a[0],\n identifier: 0\n };\n for (var i = 1; i < a.length; i++) {\n if (a[i] === a[i - 1]) {\n count++;\n } else {\n count = 0;\n }\n b.push({\n value: a[i],\n identifier: count\n });\n }\n return b;\n}\n\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a An array\n * @return {array} An array of values without identifiers\n */\nexport function generalize(a) {\n if (!Array.isArray(a)) {\n throw new TypeError('Array input expected');\n }\n if (a.length === 0) {\n return a;\n }\n var b = [];\n for (var i = 0; i < a.length; i++) {\n b.push(a[i].value);\n }\n return b;\n}\n\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf Callback function to use to determine the type of a value\n * @return {string}\n */\nexport function getArrayDataType(array, typeOf) {\n var type; // to hold type info\n var length = 0; // to hold length value to ensure it has consistent sizes\n\n for (var i = 0; i < array.length; i++) {\n var item = array[i];\n var _isArray = Array.isArray(item);\n\n // Saving the target matrix row size\n if (i === 0 && _isArray) {\n length = item.length;\n }\n\n // If the current item is an array but the length does not equal the targetVectorSize\n if (_isArray && item.length !== length) {\n return undefined;\n }\n var itemType = _isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n : typeOf(item);\n if (type === undefined) {\n type = itemType; // first item\n } else if (type !== itemType) {\n return 'mixed';\n } else {\n // we're good, everything has the same type so far\n }\n }\n return type;\n}\n\n/**\n * Return the last item from an array\n * @param {Array} array\n * @returns {*}\n */\nexport function last(array) {\n return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n * @param {Array} array\n * @returns {Array}\n */\nexport function initial(array) {\n return array.slice(0, array.length - 1);\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices are not cloned.\n * @param {Array} a Multi dimensional array\n * @param {Array} b Multi dimensional array\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @param {number} dim The current dim (zero-based)\n * @return {Array} c The concatenated matrix\n * @private\n */\nfunction concatRecursive(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 var c = [];\n for (var i = 0; i < a.length; i++) {\n c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);\n }\n return c;\n } else {\n // concatenate this dimension\n return a.concat(b);\n }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns {Array}\n */\nexport function concat() {\n var arrays = Array.prototype.slice.call(arguments, 0, -1);\n var concatDim = Array.prototype.slice.call(arguments, -1);\n if (arrays.length === 1) {\n return arrays[0];\n }\n if (arrays.length > 1) {\n return arrays.slice(1).reduce(function (A, B) {\n return concatRecursive(A, B, concatDim, 0);\n }, arrays[0]);\n } else {\n throw new Error('Wrong number of arguments in function concat');\n }\n}\n\n/**\n * Receives two or more sizes and gets the broadcasted size for both.\n * @param {...number[]} sizes Sizes to broadcast together\n * @returns {number[]} The broadcasted size\n */\nexport function broadcastSizes() {\n for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {\n sizes[_key] = arguments[_key];\n }\n var dimensions = sizes.map(s => s.length);\n var N = Math.max(...dimensions);\n var sizeMax = new Array(N).fill(null);\n // check for every size\n for (var i = 0; i < sizes.length; i++) {\n var size = sizes[i];\n var dim = dimensions[i];\n for (var j = 0; j < dim; j++) {\n var n = N - dim + j;\n if (size[j] > sizeMax[n]) {\n sizeMax[n] = size[j];\n }\n }\n }\n for (var _i2 = 0; _i2 < sizes.length; _i2++) {\n checkBroadcastingRules(sizes[_i2], sizeMax);\n }\n return sizeMax;\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules(size, toSize) {\n var N = toSize.length;\n var dim = size.length;\n for (var j = 0; j < dim; j++) {\n var n = N - dim + j;\n if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {\n throw new Error(\"shape mismatch: mismatch is found in arg with shape (\".concat(size, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(size[j], \" to size \").concat(toSize[n]));\n }\n }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {Array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns {Array} The broadcasted array\n */\nexport function broadcastTo(array, toSize) {\n var Asize = arraySize(array);\n if (deepStrictEqual(Asize, toSize)) {\n return array;\n }\n checkBroadcastingRules(Asize, toSize);\n var broadcastedSize = broadcastSizes(Asize, toSize);\n var N = broadcastedSize.length;\n var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];\n var A = clone(array);\n // reshape A if needed to make it ready for concat\n if (Asize.length < N) {\n A = reshape(A, paddedSize);\n Asize = arraySize(A);\n }\n\n // stretches the array on each dimension to make it the same size as index\n for (var dim = 0; dim < N; dim++) {\n if (Asize[dim] < broadcastedSize[dim]) {\n A = stretch(A, broadcastedSize[dim], dim);\n Asize = arraySize(A);\n }\n }\n return A;\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param {...Array | any} arrays\n * @returns {Array[]} The broadcasted arrays\n */\nexport function broadcastArrays() {\n for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n arrays[_key2] = arguments[_key2];\n }\n if (arrays.length === 0) {\n throw new Error('Insufficient number of arguments in function broadcastArrays');\n }\n if (arrays.length === 1) {\n return arrays[0];\n }\n var sizes = arrays.map(function (array) {\n return arraySize(array);\n });\n var broadcastedSize = broadcastSizes(...sizes);\n var broadcastedArrays = [];\n arrays.forEach(function (array) {\n broadcastedArrays.push(broadcastTo(array, broadcastedSize));\n });\n return broadcastedArrays;\n}\n\n/**\n * Stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns {Array} The stretched array\n */\nexport function stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n}\n\n/**\n* Retrieves a single element from an array given an index.\n*\n* @param {Array} array - The array from which to retrieve the value.\n* @param {Array} index - An array of indices specifying the position of the desired element in each dimension.\n* @returns {*} - The value at the specified position in the array.\n*\n* @example\n* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];\n* const index = [1, 0, 1];\n* console.log(get(arr, index)); // 6\n*/\nexport function get(array, index) {\n if (!Array.isArray(array)) {\n throw new Error('Array expected');\n }\n var size = arraySize(array);\n if (index.length !== size.length) {\n throw new DimensionError(index.length, size.length);\n }\n for (var x = 0; x < index.length; x++) {\n validateIndex(index[x], size[x]);\n }\n return index.reduce((acc, curr) => acc[curr], array);\n}\n\n/**\n * Recursively maps over each element of nested array using a provided callback function.\n *\n * @param {Array} array - The array to be mapped.\n * @param {Function} callback - The function to execute on each element, taking three arguments:\n * - `value` (any): The current element being processed in the array.\n * - `index` (Array): The index of the current element being processed in the array.\n * - `array` (Array): The array `deepMap` was called upon.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n * @returns {Array} A new array with each element being the result of the callback function.\n */\nexport function deepMap(array, callback) {\n var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n if (array.length === 0) {\n return [];\n }\n if (skipIndex) {\n return recursiveMap(array);\n }\n var index = [];\n return recursiveMapWithIndex(array, 0);\n function recursiveMapWithIndex(value, depth) {\n if (Array.isArray(value)) {\n var N = value.length;\n var result = Array(N);\n for (var i = 0; i < N; i++) {\n index[depth] = i;\n result[i] = recursiveMapWithIndex(value[i], depth + 1);\n }\n return result;\n } else {\n return callback(value, index.slice(0, depth), array);\n }\n }\n function recursiveMap(value) {\n if (Array.isArray(value)) {\n var N = value.length;\n var result = Array(N);\n for (var i = 0; i < N; i++) {\n result[i] = recursiveMap(value[i]);\n }\n return result;\n } else {\n return callback(value);\n }\n }\n}\n\n/**\n * Recursively iterates over each element in a multi-dimensional array and applies a callback function.\n *\n * @param {Array} array - The multi-dimensional array to iterate over.\n * @param {Function} callback - The function to execute for each element. It receives three arguments:\n * - {any} value: The current element being processed in the array.\n * - {Array} index: The index of the current element in each dimension.\n * - {Array} array: The original array being processed.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n */\nexport function deepForEach(array, callback) {\n var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n if (array.length === 0) {\n return;\n }\n if (skipIndex) {\n recursiveForEach(array);\n return;\n }\n var index = [];\n recursiveForEachWithIndex(array, 0);\n function recursiveForEachWithIndex(value, depth) {\n if (Array.isArray(value)) {\n var N = value.length;\n for (var i = 0; i < N; i++) {\n index[depth] = i;\n recursiveForEachWithIndex(value[i], depth + 1);\n }\n } else {\n callback(value, index.slice(0, depth), array);\n }\n }\n function recursiveForEach(value) {\n if (Array.isArray(value)) {\n var N = value.length;\n for (var i = 0; i < N; i++) {\n recursiveForEach(value[i]);\n }\n } else {\n callback(value);\n }\n }\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns {Array} cloned array\n */\nexport function clone(array) {\n return _extends([], array);\n}","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize, deepMap as arrayDeepMap, deepForEach as arrayDeepForEach } from './array.js';\nimport { _switch } from './switch.js';\n\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n * collections (Arrays or Matrices). Returns false otherwise.\n */\nexport function containsCollections(array) {\n for (var i = 0; i < array.length; i++) {\n if (isCollection(array[i])) {\n return true;\n }\n }\n return false;\n}\n\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback The callback method is invoked with one\n * parameter: the current element in the array\n */\nexport function deepForEach(array, callback) {\n if (isMatrix(array)) {\n array.forEach(x => callback(x), false, true);\n } else {\n arrayDeepForEach(array, callback, true);\n }\n}\n\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback The callback is called with two parameters:\n * value1 and value2, which contain the current\n * element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\nexport function deepMap(array, callback, skipZeros) {\n if (!skipZeros) {\n if (isMatrix(array)) {\n return array.map(x => callback(x), false, true);\n } else {\n return arrayDeepMap(array, callback, true);\n }\n }\n var skipZerosCallback = x => x === 0 ? x : callback(x);\n if (isMatrix(array)) {\n return array.map(x => skipZerosCallback(x), false, true);\n } else {\n return arrayDeepMap(array, skipZerosCallback, true);\n }\n}\n\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\nexport function reduce(mat, dim, callback) {\n var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n if (dim < 0 || dim >= size.length) {\n // TODO: would be more clear when throwing a DimensionError here\n throw new IndexError(dim, size.length);\n }\n if (isMatrix(mat)) {\n return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype());\n } else {\n return _reduce(mat, dim, callback);\n }\n}\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _reduce(mat, dim, callback) {\n var i, ret, val, tran;\n if (dim <= 0) {\n if (!Array.isArray(mat[0])) {\n val = mat[0];\n for (i = 1; i < mat.length; i++) {\n val = callback(val, mat[i]);\n }\n return val;\n } else {\n tran = _switch(mat);\n ret = [];\n for (i = 0; i < tran.length; i++) {\n ret[i] = _reduce(tran[i], dim - 1, callback);\n }\n return ret;\n }\n } else {\n ret = [];\n for (i = 0; i < mat.length; i++) {\n ret[i] = _reduce(mat[i], dim - 1, callback);\n }\n return ret;\n }\n}\n\n// TODO: document function scatter\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n // a arrays\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n\n // vars\n var k, k0, k1, i;\n\n // check we need to process values (pattern matrix)\n if (x) {\n // values in j\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k];\n // check value exists in current j\n if (w[i] !== mark) {\n // i is new entry in j\n w[i] = mark;\n // add i to pattern of C\n cindex.push(i);\n // x(i) = A, check we need to call function this time\n if (update) {\n // copy value to workspace calling callback function\n x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n // function was called on current row\n u[i] = mark;\n } else {\n // copy value to workspace\n x[i] = avalues[k];\n }\n } else {\n // i exists in C already\n x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);\n // function was called on current row\n u[i] = mark;\n }\n }\n } else {\n // values in j\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k];\n // check value exists in current j\n if (w[i] !== mark) {\n // i is new entry in j\n w[i] = mark;\n // add i to pattern of C\n cindex.push(i);\n } else {\n // indicate function was called on current row\n u[i] = mark;\n }\n }\n }\n}","// (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 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 if (!size) {\n index = 0;\n base = 1;\n return;\n }\n while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}\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 if (!oldIndex) {\n ++size;\n if (size <= limit) return undefined;\n id = queue[base];\n del(id);\n return id;\n }\n delete queue[oldIndex];\n if (base !== oldIndex) return undefined;\n while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}\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}","// function utils\n\nimport { lruQueue } from './lruQueue.js';\n\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn The function to be memoized.\n * Must be a pure function.\n * @param {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n * A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n * Maximum number of values that may be cached. Undefined indicates\n * unlimited (default)\n * @return {function} Returns the memoized function\n */\nexport function memoize(fn) {\n var {\n hasher,\n limit\n } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n hasher = hasher == null ? JSON.stringify : hasher;\n return function memoize() {\n if (typeof memoize.cache !== 'object') {\n memoize.cache = {\n values: new Map(),\n lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n };\n }\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args[i] = arguments[i];\n }\n var hash = hasher(args);\n if (memoize.cache.values.has(hash)) {\n memoize.cache.lru.hit(hash);\n return memoize.cache.values.get(hash);\n }\n var newVal = fn.apply(fn, args);\n memoize.cache.values.set(hash, newVal);\n memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n return newVal;\n };\n}\n\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\nexport function memoizeCompare(fn, isEqual) {\n var memoize = function memoize() {\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args[i] = arguments[i];\n }\n for (var c = 0; c < memoize.cache.length; c++) {\n var cached = memoize.cache[c];\n if (isEqual(args, cached.args)) {\n // TODO: move this cache entry to the top so recently used entries move up?\n return cached.res;\n }\n }\n var res = fn.apply(fn, args);\n memoize.cache.unshift({\n args,\n res\n });\n return res;\n };\n memoize.cache = [];\n return memoize;\n}","import { memoize } from '../function.js';\n\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns e\n */\nexport var createBigNumberE = memoize(function (BigNumber) {\n return new BigNumber(1).exp();\n}, {\n hasher\n});\n\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\nexport var createBigNumberPhi = memoize(function (BigNumber) {\n return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n hasher\n});\n\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\nexport var createBigNumberPi = memoize(function (BigNumber) {\n return BigNumber.acos(-1);\n}, {\n hasher\n});\n\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\nexport var createBigNumberTau = memoize(function (BigNumber) {\n return createBigNumberPi(BigNumber).times(2);\n}, {\n hasher\n});\n\n/**\n * Create a hash for a BigNumber constructor function. The created has is\n * the configured precision\n * @param {Array} args Supposed to contain a single entry with\n * a BigNumber constructor\n * @return {number} precision\n * @private\n */\nfunction hasher(args) {\n return args[0].precision;\n}","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});\n\n// golden ratio, (1+sqrt(5))/2\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'], _ref0 => {\n var {\n config,\n BigNumber\n } = _ref0;\n return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;\n});\nexport var createSQRT1_2 = /* #__PURE__ */recreateFactory(\n// eslint-disable-line camelcase\n'SQRT1_2', ['config', '?BigNumber'], _ref1 => {\n var {\n config,\n BigNumber\n } = _ref1;\n return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;\n});\nexport var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], _ref10 => {\n var {\n config,\n BigNumber\n } = _ref10;\n return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;\n});\nexport var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], _ref11 => {\n var {\n Complex\n } = _ref11;\n return Complex.I;\n});\n\n// for backward compatibility with v5\nexport var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], _ref12 => {\n var {\n pi\n } = _ref12;\n return pi;\n});\nexport var createUppercaseE = /* #__PURE__ */factory('E', ['e'], _ref13 => {\n var {\n e\n } = _ref13;\n return e;\n});\nexport var createVersion = /* #__PURE__ */factory('version', [], () => version);\n\n// helper function to create a factory with a flag recreateOnConfigChange\n// idea: allow passing optional properties to be attached to the factory function as 4th argument?\nfunction recreateFactory(name, dependencies, create) {\n return factory(name, dependencies, create, {\n recreateOnConfigChange: true\n });\n}","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts(input) {\n var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\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/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts(parts) {\n var n = parseInt(parts.integerPart, parts.radix);\n var f = 0;\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 var result = n + f;\n if (isNaN(result)) {\n throw new SyntaxError('String \"' + parts.input + '\" is not a valid number');\n }\n return result;\n}\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\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, bigint, boolean, numeric, 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 if (nonDecimalNumberParts) {\n return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n }\n var size = 0;\n var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n if (wordSizeSuffixMatch) {\n // x includes a size suffix like 0xffffi32, so we extract\n // the suffix and remove it from x\n size = Number(wordSizeSuffixMatch[2]);\n x = wordSizeSuffixMatch[1];\n }\n var num = Number(x);\n if (isNaN(num)) {\n throw new SyntaxError('String \"' + x + '\" is not a valid number');\n }\n if (wordSizeSuffixMatch) {\n // x is a signed bin, oct, or hex literal\n // num is the value of string x if x is interpreted as unsigned\n if (num > 2 ** size - 1) {\n // literal is too large for size suffix\n throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n }\n // check if the bit at index size - 1 is set and if so do the twos complement\n if (num >= 2 ** (size - 1)) {\n num = num - 2 ** size;\n }\n }\n return num;\n },\n BigNumber: function BigNumber(x) {\n return x.toNumber();\n },\n bigint: function bigint(x) {\n return Number(x);\n },\n Fraction: function Fraction(x) {\n return x.valueOf();\n },\n Unit: typed.referToSelf(self => x => {\n var clone = x.clone();\n clone.value = self(x.value);\n return clone;\n }),\n null: function _null(x) {\n return 0;\n },\n 'Unit, string | Unit': function Unit_string__Unit(unit, valuelessUnit) {\n return unit.toNumber(valuelessUnit);\n },\n 'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n });\n\n // reviver function to parse a JSON object like:\n //\n // {\"mathjs\":\"number\",\"value\":\"2.3\"}\n //\n // into a number 2.3\n number.fromJSON = function (json) {\n return parseFloat(json.value);\n };\n return number;\n});","// Reserved keywords not allowed to use in the parser\nexport var keywords = new Set(['end']);","import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { deepStrictEqual } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMap } from '../../utils/map.js';\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nexport var createNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n mathWithTransform\n } = _ref;\n /**\n * Validate the symbol names of a scope.\n * Throws an error when the scope contains an illegal symbol.\n * @param {Object} scope\n */\n function _validateScope(scope) {\n for (var symbol of [...keywords]) {\n if (scope.has(symbol)) {\n throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n }\n }\n }\n class Node {\n get type() {\n return 'Node';\n }\n get isNode() {\n return true;\n }\n\n /**\n * Evaluate the node\n * @param {Object} [scope] Scope to read/write variables\n * @return {*} Returns the result\n */\n evaluate(scope) {\n return this.compile().evaluate(scope);\n }\n\n /**\n * Compile the node into an optimized, evauatable JavaScript function\n * @return {{evaluate: function([Object])}} object\n * Returns an object with a function 'evaluate',\n * which can be invoked as expr.evaluate([scope: Object]),\n * where scope is an optional object with\n * variables.\n */\n compile() {\n var expr = this._compile(mathWithTransform, {});\n var args = {};\n var context = null;\n function evaluate(scope) {\n var s = createMap(scope);\n _validateScope(s);\n return expr(s, args, context);\n }\n return {\n evaluate\n };\n }\n\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n _compile(math, argNames) {\n throw new Error('Method _compile must be implemented by type ' + this.type);\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot run forEach on a Node interface');\n }\n\n /**\n * Create a new Node whose children are the results of calling the\n * provided callback function for each child 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 map(callback) {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot run map on a Node interface');\n }\n\n /**\n * Validate whether an object is a Node, for use with map\n * @param {Node} node\n * @returns {Node} Returns the input if it's a node, else throws an Error\n * @protected\n */\n _ifNode(node) {\n if (!isNode(node)) {\n throw new TypeError('Callback function must return a Node');\n }\n return node;\n }\n\n /**\n * Recursively traverse all nodes in a node tree. Executes given callback for\n * this node and each of its child nodes.\n * @param {function(node: Node, path: string, parent: Node)} callback\n * A callback called for every node in the node tree.\n */\n traverse(callback) {\n // execute callback for itself\n // eslint-disable-next-line\n callback(this, null, null);\n\n // recursively traverse over all children of a node\n function _traverse(node, callback) {\n node.forEach(function (child, path, parent) {\n callback(child, path, parent);\n _traverse(child, callback);\n });\n }\n _traverse(this, callback);\n }\n\n /**\n * Recursively transform a node tree via a transform function.\n *\n * For example, to replace all nodes of type SymbolNode having name 'x' with\n * a 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. The \"signature\"\n * of the callback must be:\n * callback(node: Node, index: string, parent: Node) : Node\n * @return {Node} Returns the original node or its replacement\n */\n transform(callback) {\n function _transform(child, path, parent) {\n var replacement = callback(child, path, parent);\n if (replacement !== child) {\n // stop iterating when the node is replaced\n return replacement;\n }\n return child.map(_transform);\n }\n return _transform(this, null, null);\n }\n\n /**\n * Find any node in the node tree matching given filter function. For\n * example, to 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\n * An array with nodes matching given filter criteria\n */\n filter(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 /**\n * Create a shallow clone of this node\n * @return {Node}\n */\n clone() {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot clone a Node interface');\n }\n\n /**\n * Create a deep clone of this node\n * @return {Node}\n */\n cloneDeep() {\n return this.map(function (node) {\n return node.cloneDeep();\n });\n }\n\n /**\n * Deep compare this node with another node.\n * @param {Node} other\n * @return {boolean} Returns true when both nodes are of the same type and\n * contain the same values (as do their childs)\n */\n equals(other) {\n return other ? this.type === other.type && deepStrictEqual(this, other) : false;\n }\n\n /**\n * Get string representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\"or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n toString(options) {\n var customString = this._getCustomString(options);\n if (typeof customString !== 'undefined') {\n return customString;\n }\n return this._toString(options);\n }\n\n /**\n * Internal function to generate the string output.\n * This has to be implemented by every Node\n *\n * @throws {Error}\n */\n _toString() {\n // must be implemented by each of the Node implementations\n throw new Error('_toString not implemented for ' + this.type);\n }\n\n /**\n * Get 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 toJSON() {\n throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\n }\n\n /**\n * Get HTML representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\" or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n toHTML(options) {\n var customString = this._getCustomString(options);\n if (typeof customString !== 'undefined') {\n return customString;\n }\n return this._toHTML(options);\n }\n\n /**\n * Internal function to generate the HTML output.\n * This has to be implemented by every Node\n *\n * @throws {Error}\n */\n _toHTML() {\n // must be implemented by each of the Node implementations\n throw new Error('_toHTML not implemented for ' + this.type);\n }\n\n /**\n * Get LaTeX representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\"or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n toTex(options) {\n var customString = this._getCustomString(options);\n if (typeof customString !== 'undefined') {\n return customString;\n }\n return this._toTex(options);\n }\n\n /**\n * Internal function to generate the LaTeX output.\n * This has to be implemented by every Node\n *\n * @param {Object} [options]\n * @throws {Error}\n */\n _toTex(options) {\n // must be implemented by each of the Node implementations\n throw new Error('_toTex not implemented for ' + this.type);\n }\n\n /**\n * Helper used by `to...` functions.\n */\n _getCustomString(options) {\n if (options && typeof options === 'object') {\n switch (typeof options.handler) {\n case 'object':\n case 'undefined':\n return;\n case 'function':\n return options.handler(this, options);\n default:\n throw new TypeError('Object or function expected as callback');\n }\n }\n }\n\n /**\n * Get identifier.\n * @return {string}\n */\n getIdentifier() {\n return this.type;\n }\n\n /**\n * Get the content of the current Node.\n * @return {Node} node\n **/\n getContent() {\n return this;\n }\n }\n return Node;\n}, {\n isClass: true,\n isNode: true\n});","import { IndexError } from '../../../error/IndexError.js';\n\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error | IndexError} Returns the transformed error\n */\nexport function errorTransform(err) {\n if (err && err.isIndexError) {\n return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\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 * 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 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 _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 /**\n * Are parenthesis needed?\n * @private\n */\n function needParenthesis(node) {\n // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));\n }\n class AccessorNode extends Node {\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 * @param {boolean} [optionalChaining=false]\n * Optional property, if the accessor was written as optional-chaining\n * using `a?.b`, or `a?.[\"b\"] with bracket notation.\n * Forces evaluate to undefined if the given object is undefined or null.\n */\n constructor(object, index) {\n var optionalChaining = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n super();\n if (!isNode(object)) {\n throw new TypeError('Node expected for parameter \"object\"');\n }\n if (!isIndexNode(index)) {\n throw new TypeError('IndexNode expected for parameter \"index\"');\n }\n this.object = object;\n this.index = index;\n this.optionalChaining = optionalChaining;\n }\n\n // readonly property name\n get name() {\n if (this.index) {\n return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n } else {\n return this.object.name || '';\n }\n }\n get type() {\n return name;\n }\n get isAccessorNode() {\n return true;\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 _compile(math, argNames) {\n var evalObject = this.object._compile(math, argNames);\n var evalIndex = this.index._compile(math, argNames);\n var optionalChaining = this.optionalChaining;\n var prevOptionalChaining = isAccessorNode(this.object) && this.object.optionalChaining;\n if (this.index.isObjectProperty()) {\n var prop = this.index.getObjectProperty();\n return function evalAccessorNode(scope, args, context) {\n var ctx = context || {};\n var object = evalObject(scope, args, ctx);\n if (optionalChaining && object == null) {\n ctx.optionalShortCircuit = true;\n return undefined;\n }\n if (prevOptionalChaining && ctx !== null && ctx !== void 0 && ctx.optionalShortCircuit) {\n return undefined;\n }\n\n // get a property from an object evaluated using the scope.\n return getSafeProperty(object, prop);\n };\n } else {\n return function evalAccessorNode(scope, args, context) {\n var ctx = context || {};\n var object = evalObject(scope, args, ctx);\n if (optionalChaining && object == null) {\n ctx.optionalShortCircuit = true;\n return undefined;\n }\n if (prevOptionalChaining && ctx !== null && ctx !== void 0 && ctx.optionalShortCircuit) {\n return undefined;\n }\n\n // we pass just object here instead of context:\n var index = evalIndex(scope, args, object);\n return access(object, index);\n };\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.object, 'object', this);\n callback(this.index, 'index', this);\n }\n\n /**\n * Create a new AccessorNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)), this.optionalChaining);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {AccessorNode}\n */\n clone() {\n return new AccessorNode(this.object, this.index, this.optionalChaining);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string}\n */\n _toString(options) {\n var object = this.object.toString(options);\n if (needParenthesis(this.object)) {\n object = '(' + object + ')';\n }\n var optionalChaining = this.optionalChaining ? this.index.dotNotation ? '?' : '?.' : '';\n return object + optionalChaining + this.index.toString(options);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string}\n */\n _toHTML(options) {\n var object = this.object.toHTML(options);\n if (needParenthesis(this.object)) {\n object = '(' + object + ')';\n }\n return object + this.index.toHTML(options);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string}\n */\n _toTex(options) {\n var object = this.object.toTex(options);\n if (needParenthesis(this.object)) {\n object = '\\\\left(\\' + object + \\'\\\\right)';\n }\n return object + this.index.toTex(options);\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n object: this.object,\n index: this.index,\n optionalChaining: this.optionalChaining\n };\n }\n\n /**\n * Instantiate an AccessorNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n * where mathjs is optional\n * @returns {AccessorNode}\n */\n static fromJSON(json) {\n return new AccessorNode(json.object, json.index, json.optionalChaining);\n }\n }\n _defineProperty(AccessorNode, \"name\", name);\n return AccessorNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isArrayNode, 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 class ArrayNode extends Node {\n /**\n * @constructor ArrayNode\n * @extends {Node}\n * Holds an 1-dimensional array with items\n * @param {Node[]} [items] 1 dimensional array with items\n */\n constructor(items) {\n super();\n this.items = items || [];\n\n // validate input\n if (!Array.isArray(this.items) || !this.items.every(isNode)) {\n throw new TypeError('Array containing Nodes expected');\n }\n }\n get type() {\n return name;\n }\n get isArrayNode() {\n return true;\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 _compile(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 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 /**\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 forEach(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 /**\n * Create a new ArrayNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var items = [];\n for (var i = 0; i < this.items.length; i++) {\n items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n }\n return new ArrayNode(items);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ArrayNode}\n */\n clone() {\n return new ArrayNode(this.items.slice(0));\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n var items = this.items.map(function (node) {\n return node.toString(options);\n });\n return '[' + items.join(', ') + ']';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n items: this.items\n };\n }\n\n /**\n * Instantiate an ArrayNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ArrayNode\", items: [...]}`,\n * where mathjs is optional\n * @returns {ArrayNode}\n */\n static fromJSON(json) {\n return new ArrayNode(json.items);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n var items = this.items.map(function (node) {\n return node.toHTML(options);\n });\n return '[' + items.join(',') + ']';\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n function itemsToTex(items, nested) {\n var mixedItems = items.some(isArrayNode) && !items.every(isArrayNode);\n var itemsFormRow = nested || mixedItems;\n var itemSep = itemsFormRow ? '&' : '\\\\\\\\';\n var itemsTex = items.map(function (node) {\n if (node.items) {\n return itemsToTex(node.items, !nested);\n } else {\n return node.toTex(options);\n }\n }).join(itemSep);\n return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\\\begin{bmatrix}' + itemsTex + '\\\\end{bmatrix}' : itemsTex;\n }\n return itemsToTex(this.items, false);\n }\n }\n _defineProperty(ArrayNode, \"name\", name);\n return ArrayNode;\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 * 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 var result = matrix(object).subset(index, value).valueOf();\n\n // shallow copy all (updated) items into the original array\n result.forEach((item, index) => {\n object[index] = item;\n });\n return object;\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 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 _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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',\n// 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 /*\n * Is parenthesis needed?\n * @param {node} node\n * @param {string} [parenthesis='keep']\n * @param {string} implicit\n * @private\n */\n function needParenthesis(node, parenthesis, implicit) {\n if (!parenthesis) {\n parenthesis = 'keep';\n }\n var precedence = getPrecedence(node, parenthesis, implicit);\n var exprPrecedence = getPrecedence(node.value, parenthesis, implicit);\n return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n }\n class AssignmentNode extends Node {\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'),\n * new IndexNode('b'),\n * new ConstantNode(2)) // a.b=2\n * new AssignmentNode(new SymbolNode('a'),\n * new IndexNode(1, 2),\n * new ConstantNode(3)) // a[1,2]=3\n *\n * @param {SymbolNode | AccessorNode} object\n * Object on which to assign a value\n * @param {IndexNode} [index=null]\n * Index, property name or matrix index. Optional. If not provided\n * and `object` is a SymbolNode, the property is assigned to the\n * global scope.\n * @param {Node} value\n * The value to be assigned\n */\n constructor(object, index, value) {\n super();\n this.object = object;\n this.index = value ? index : null;\n this.value = value || index;\n\n // validate input\n if (!isSymbolNode(object) && !isAccessorNode(object)) {\n throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n }\n if (isSymbolNode(object) && object.name === 'end') {\n throw new Error('Cannot assign to symbol \"end\"');\n }\n if (this.index && !isIndexNode(this.index)) {\n // index is optional\n throw new TypeError('IndexNode expected as \"index\"');\n }\n if (!isNode(this.value)) {\n throw new TypeError('Node expected as \"value\"');\n }\n }\n\n // class name for typing purposes:\n\n // readonly property name\n get name() {\n if (this.index) {\n return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n } else {\n return this.object.name || '';\n }\n }\n get type() {\n return name;\n }\n get isAssignmentNode() {\n return true;\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 _compile(math, argNames) {\n var evalObject = this.object._compile(math, argNames);\n var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n var evalValue = this.value._compile(math, argNames);\n var name = this.object.name;\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 return function evalAssignmentNode(scope, args, context) {\n var value = evalValue(scope, args, context);\n scope.set(name, value);\n return value;\n };\n } else if (this.index.isObjectProperty()) {\n // apply an object property for example `a.b=2`\n 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 setSafeProperty(object, prop, value);\n return value;\n };\n } else if (isSymbolNode(this.object)) {\n // update a matrix subset, for example `a[2]=3`\n return function evalAssignmentNode(scope, args, context) {\n var childObject = evalObject(scope, args, context);\n var value = evalValue(scope, args, context);\n // Important: we pass childObject instead of context:\n var index = evalIndex(scope, args, childObject);\n scope.set(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\n // we will not use the compile function of the AccessorNode, but\n // compile it ourselves here as we need the parent object of the\n // AccessorNode:\n // wee need to apply the updated object to parent object\n var evalParentObject = this.object.object._compile(math, argNames);\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 // Important: we pass childObject instead of context:\n var index = evalIndex(scope, args, childObject);\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\n // the size\n var evalParentIndex = this.object.index._compile(math, argNames);\n return function evalAssignmentNode(scope, args, context) {\n var parent = evalParentObject(scope, args, context);\n // Important: we pass parent instead of context:\n var parentIndex = evalParentIndex(scope, args, parent);\n var childObject = access(parent, parentIndex);\n // Important: we pass childObject instead of context\n var index = evalIndex(scope, args, childObject);\n var value = evalValue(scope, args, context);\n assign(parent, parentIndex, assign(childObject, index, value));\n return value;\n };\n }\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.object, 'object', this);\n if (this.index) {\n callback(this.index, 'index', this);\n }\n callback(this.value, 'value', this);\n }\n\n /**\n * Create a new AssignmentNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var object = this._ifNode(callback(this.object, 'object', this));\n var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n var value = this._ifNode(callback(this.value, 'value', this));\n return new AssignmentNode(object, index, value);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {AssignmentNode}\n */\n clone() {\n return new AssignmentNode(this.object, this.index, this.value);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string}\n */\n _toString(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 if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n value = '(' + value + ')';\n }\n return object + index + ' = ' + value;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n object: this.object,\n index: this.index,\n value: this.value\n };\n }\n\n /**\n * Instantiate an AssignmentNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n * where mathjs is optional\n * @returns {AssignmentNode}\n */\n static fromJSON(json) {\n return new AssignmentNode(json.object, json.index, json.value);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string}\n */\n _toHTML(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 if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n value = '(' + value + ')';\n }\n return object + index + '=' + value;\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string}\n */\n _toTex(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 if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n value = \"\\\\left(\".concat(value, \"\\\\right)\");\n }\n return object + index + '=' + value;\n }\n }\n _defineProperty(AssignmentNode, \"name\", name);\n return AssignmentNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 class BlockNode extends Node {\n /**\n * @constructor BlockNode\n * @extends {Node}\n * Holds a set with blocks\n * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks\n * An array with blocks, where a block is constructed as an\n * Object with properties block, which is a Node, and visible,\n * which is a boolean. The property visible is optional and\n * is true by default\n */\n constructor(blocks) {\n super();\n // validate input, copy blocks\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') {\n throw new TypeError('Property \"visible\" must be a boolean');\n }\n return {\n node,\n visible\n };\n });\n }\n get type() {\n return name;\n }\n get isBlockNode() {\n return true;\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 _compile(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 if (block.visible) {\n results.push(result);\n }\n });\n return new ResultSet(results);\n };\n }\n\n /**\n * Execute a callback for each of the child blocks of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(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 /**\n * Create a new BlockNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var blocks = [];\n for (var i = 0; i < this.blocks.length; i++) {\n var block = this.blocks[i];\n var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n blocks[i] = {\n node,\n visible: block.visible\n };\n }\n return new BlockNode(blocks);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {BlockNode}\n */\n clone() {\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 /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n return this.blocks.map(function (param) {\n return param.node.toString(options) + (param.visible ? '' : ';');\n }).join('\\n');\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n blocks: this.blocks\n };\n }\n\n /**\n * Instantiate an BlockNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n * where mathjs is optional\n * @returns {BlockNode}\n */\n static fromJSON(json) {\n return new BlockNode(json.blocks);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n return this.blocks.map(function (param) {\n return param.node.toHTML(options) + (param.visible ? '' : ';');\n }).join('
');\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n return this.blocks.map(function (param) {\n return param.node.toTex(options) + (param.visible ? '' : ';');\n }).join('\\\\;\\\\;\\n');\n }\n }\n _defineProperty(BlockNode, \"name\", name);\n return BlockNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 * Test whether a condition is met\n * @param {*} condition\n * @returns {boolean} true if condition is true or non-zero, else false\n */\n function testCondition(condition) {\n if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {\n return !!condition;\n }\n if (condition) {\n if (isBigNumber(condition)) {\n return !condition.isZero();\n }\n if (isComplex(condition)) {\n return !!(condition.re || condition.im);\n }\n if (isUnit(condition)) {\n return !!condition.value;\n }\n }\n if (condition === null || condition === undefined) {\n return false;\n }\n throw new TypeError('Unsupported type of condition \"' + typeOf(condition) + '\"');\n }\n class ConditionalNode extends Node {\n /**\n * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'\n *\n * @param {Node} condition Condition, must result in a boolean\n * @param {Node} trueExpr Expression evaluated when condition is true\n * @param {Node} falseExpr Expression evaluated when condition is true\n *\n * @constructor ConditionalNode\n * @extends {Node}\n */\n constructor(condition, trueExpr, falseExpr) {\n super();\n if (!isNode(condition)) {\n throw new TypeError('Parameter condition must be a Node');\n }\n if (!isNode(trueExpr)) {\n throw new TypeError('Parameter trueExpr must be a Node');\n }\n if (!isNode(falseExpr)) {\n throw new TypeError('Parameter falseExpr must be a Node');\n }\n this.condition = condition;\n this.trueExpr = trueExpr;\n this.falseExpr = falseExpr;\n }\n get type() {\n return name;\n }\n get isConditionalNode() {\n return true;\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 _compile(math, argNames) {\n var evalCondition = this.condition._compile(math, argNames);\n var evalTrueExpr = this.trueExpr._compile(math, argNames);\n var evalFalseExpr = this.falseExpr._compile(math, argNames);\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 /**\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 forEach(callback) {\n callback(this.condition, 'condition', this);\n callback(this.trueExpr, 'trueExpr', this);\n callback(this.falseExpr, 'falseExpr', this);\n }\n\n /**\n * Create a new ConditionalNode whose children are the results of calling\n * the provided callback function for each child 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 map(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 /**\n * Create a clone of this node, a shallow copy\n * @return {ConditionalNode}\n */\n clone() {\n return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n\n // Enclose Arguments in parentheses if they are an OperatorNode\n // or have lower or equal precedence\n // NOTE: enclosing all OperatorNodes in parentheses is a decision\n // purely based on aesthetics and readability\n var condition = this.condition.toString(options);\n var conditionPrecedence = getPrecedence(this.condition, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n condition = '(' + condition + ')';\n }\n var trueExpr = this.trueExpr.toString(options);\n var truePrecedence = getPrecedence(this.trueExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n trueExpr = '(' + trueExpr + ')';\n }\n var falseExpr = this.falseExpr.toString(options);\n var falsePrecedence = getPrecedence(this.falseExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n falseExpr = '(' + falseExpr + ')';\n }\n return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n condition: this.condition,\n trueExpr: this.trueExpr,\n falseExpr: this.falseExpr\n };\n }\n\n /**\n * Instantiate an ConditionalNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * ```\n * {\"mathjs\": \"ConditionalNode\",\n * \"condition\": ...,\n * \"trueExpr\": ...,\n * \"falseExpr\": ...}\n * ```\n * where mathjs is optional\n * @returns {ConditionalNode}\n */\n static fromJSON(json) {\n return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n\n // Enclose Arguments in parentheses if they are an OperatorNode\n // or have lower or equal precedence\n // NOTE: enclosing all OperatorNodes in parentheses is a decision\n // purely based on aesthetics and readability\n var condition = this.condition.toHTML(options);\n var conditionPrecedence = getPrecedence(this.condition, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n condition = '(' + condition + ')';\n }\n var trueExpr = this.trueExpr.toHTML(options);\n var truePrecedence = getPrecedence(this.trueExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n trueExpr = '(' + trueExpr + ')';\n }\n var falseExpr = this.falseExpr.toHTML(options);\n var falsePrecedence = getPrecedence(this.falseExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n falseExpr = '(' + falseExpr + ')';\n }\n return condition + '?' + trueExpr + ':' + falseExpr;\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(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 _defineProperty(ConditionalNode, \"name\", name);\n return ConditionalNode;\n}, {\n isClass: true,\n isNode: true\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};","/* eslint no-template-curly-in-string: \"off\" */\n\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 fraction: {\n 2: '\\\\frac{${args[0]}}{${args[1]}}'\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 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 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 pinv: {\n 1: '\\\\left(${args[0]}\\\\right)^{+}'\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 lgamma: {\n 1: '\\\\ln\\\\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 bigint: {\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}\n\n// @param {string} name\n// @param {boolean} isUnit\nexport function toSymbol(name, isUnit) {\n isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n if (isUnit) {\n if (hasOwnProperty(latexUnits, name)) {\n return latexUnits[name];\n }\n return '\\\\mathrm{' + escapeLatex(name) + '}';\n }\n if (hasOwnProperty(latexSymbols, name)) {\n return latexSymbols[name];\n }\n return escapeLatex(name);\n}","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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', 'isBounded'];\nexport var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node,\n isBounded\n } = _ref;\n class ConstantNode extends Node {\n /**\n * A ConstantNode holds a constant value like a number or string.\n *\n * Usage:\n *\n * new ConstantNode(2.3)\n * new ConstantNode('hello')\n *\n * @param {*} value Value can be any type (number, BigNumber, bigint, string, ...)\n * @constructor ConstantNode\n * @extends {Node}\n */\n constructor(value) {\n super();\n this.value = value;\n }\n get type() {\n return name;\n }\n get isConstantNode() {\n return true;\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 _compile(math, argNames) {\n var value = this.value;\n return function evalConstantNode() {\n return value;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n // nothing to do, we don't have any children\n }\n\n /**\n * Create a new ConstantNode with children produced by the given callback.\n * Trivial because there are no children.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {ConstantNode} Returns a clone of the node\n */\n map(callback) {\n return this.clone();\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ConstantNode}\n */\n clone() {\n return new ConstantNode(this.value);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n return format(this.value, options);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var value = this._toString(options);\n switch (typeOf(this.value)) {\n case 'number':\n case 'bigint':\n case 'BigNumber':\n case 'Fraction':\n return '' + value + '';\n case 'string':\n return '' + value + '';\n case 'boolean':\n return '' + value + '';\n case 'null':\n return '' + value + '';\n case 'undefined':\n return '' + value + '';\n default:\n return '' + value + '';\n }\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n value: this.value\n };\n }\n\n /**\n * Instantiate a ConstantNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SymbolNode\", value: 2.3}`,\n * where mathjs is optional\n * @returns {ConstantNode}\n */\n static fromJSON(json) {\n return new ConstantNode(json.value);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var value = this._toString(options);\n var type = typeOf(this.value);\n switch (type) {\n case 'string':\n return '\\\\mathtt{' + escapeLatex(value) + '}';\n case 'number':\n case 'BigNumber':\n {\n if (!isBounded(this.value)) {\n return this.value.valueOf() < 0 ? '-\\\\infty' : '\\\\infty';\n }\n var index = value.toLowerCase().indexOf('e');\n if (index !== -1) {\n return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n }\n return value;\n }\n case 'bigint':\n {\n return value.toString();\n }\n case 'Fraction':\n return this.value.toLatex();\n default:\n return value;\n }\n }\n }\n _defineProperty(ConstantNode, \"name\", name);\n return ConstantNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 { 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 * Is parenthesis needed?\n * @param {Node} node\n * @param {Object} parenthesis\n * @param {string} implicit\n * @private\n */\n function needParenthesis(node, parenthesis, implicit) {\n var precedence = getPrecedence(node, parenthesis, implicit);\n var exprPrecedence = getPrecedence(node.expr, parenthesis, implicit);\n return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n }\n class FunctionAssignmentNode extends Node {\n /**\n * @constructor FunctionAssignmentNode\n * @extends {Node}\n * Function assignment\n *\n * @param {string} name Function name\n * @param {string[] | Array.<{name: string, type: string}>} params\n * Array with function parameter names, or an\n * array with objects containing the name\n * and type of the parameter\n * @param {Node} expr The function expression\n */\n constructor(name, params, expr) {\n super();\n // validate input\n if (typeof name !== 'string') {\n throw new TypeError('String expected for parameter \"name\"');\n }\n if (!Array.isArray(params)) {\n throw new TypeError('Array containing strings or objects expected for parameter \"params\"');\n }\n if (!isNode(expr)) {\n throw new TypeError('Node expected for parameter \"expr\"');\n }\n if (keywords.has(name)) {\n throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\n }\n var paramNames = new Set();\n for (var param of params) {\n var _name = typeof param === 'string' ? param : param.name;\n if (paramNames.has(_name)) {\n throw new Error(\"Duplicate parameter name \\\"\".concat(_name, \"\\\"\"));\n } else {\n paramNames.add(_name);\n }\n }\n this.name = name;\n this.params = params.map(function (param) {\n return param && param.name || param;\n });\n this.types = params.map(function (param) {\n return param && param.type || 'any';\n });\n this.expr = expr;\n }\n get type() {\n return name;\n }\n get isFunctionAssignmentNode() {\n return true;\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 _compile(math, argNames) {\n var childArgNames = Object.create(argNames);\n forEach(this.params, function (param) {\n childArgNames[param] = true;\n });\n\n // compile the function expression with the child args\n var expr = this.expr;\n var evalExpr = expr._compile(math, childArgNames);\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 signatures[signature] = function () {\n var childArgs = Object.create(args);\n for (var i = 0; i < params.length; i++) {\n childArgs[params[i]] = arguments[i];\n }\n return evalExpr(scope, childArgs, context);\n };\n var fn = typed(name, signatures);\n fn.syntax = syntax;\n fn.expr = expr.toString();\n scope.set(name, fn);\n return fn;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.expr, 'expr', this);\n }\n\n /**\n * Create a new FunctionAssignmentNode whose children are the results of\n * calling the provided callback function for each child of the original\n * node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {FunctionAssignmentNode} Returns a transformed copy of the node\n */\n map(callback) {\n var expr = this._ifNode(callback(this.expr, 'expr', this));\n return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {FunctionAssignmentNode}\n */\n clone() {\n return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n }\n\n /**\n * get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var expr = this.expr.toString(options);\n if (needParenthesis(this, parenthesis, options && options.implicit)) {\n expr = '(' + expr + ')';\n }\n return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n var types = this.types;\n return {\n mathjs: name,\n name: this.name,\n params: this.params.map(function (param, index) {\n return {\n name: param,\n type: types[index]\n };\n }),\n expr: this.expr\n };\n }\n\n /**\n * Instantiate an FunctionAssignmentNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * ```\n * {\"mathjs\": \"FunctionAssignmentNode\",\n * name: ..., params: ..., expr: ...}\n * ```\n * where mathjs is optional\n * @returns {FunctionAssignmentNode}\n */\n static fromJSON(json) {\n return new FunctionAssignmentNode(json.name, json.params, json.expr);\n }\n\n /**\n * get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var params = [];\n for (var i = 0; i < this.params.length; i++) {\n params.push('' + escape(this.params[i]) + '');\n }\n var expr = this.expr.toHTML(options);\n if (needParenthesis(this, parenthesis, options && options.implicit)) {\n expr = '(' + expr + ')';\n }\n return '' + escape(this.name) + '' + '(' + params.join(',') + ')' + '=' + expr;\n }\n\n /**\n * get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var expr = this.expr.toTex(options);\n if (needParenthesis(this, parenthesis, options && options.implicit)) {\n expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n }\n return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right)=' + expr;\n }\n }\n _defineProperty(FunctionAssignmentNode, \"name\", name);\n return FunctionAssignmentNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { map } from '../../utils/array.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { isArray, isConstantNode, isMatrix, isNode, isString, typeOf } from '../../utils/is.js';\nimport { escape } from '../../utils/string.js';\nvar name = 'IndexNode';\nvar dependencies = ['Node', 'size'];\nexport var createIndexNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node,\n size\n } = _ref;\n class IndexNode extends Node {\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]\n * Optional property describing whether this index was written using dot\n * notation like `a.b`, or using bracket notation like `a[\"b\"]`\n * (which is the default). This property is used for string conversion.\n */\n constructor(dimensions, dotNotation) {\n super();\n this.dimensions = dimensions;\n this.dotNotation = dotNotation || false;\n\n // validate input\n if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n }\n if (this.dotNotation && !this.isObjectProperty()) {\n throw new Error('dotNotation only applicable for object properties');\n }\n }\n get type() {\n return name;\n }\n get isIndexNode() {\n return true;\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 _compile(math, argNames) {\n // TODO: implement support for bignumber (currently bignumbers are silently\n // reduced to numbers when changing the value to zero-based)\n\n // TODO: Optimization: when the range values are ConstantNodes,\n // we can beforehand resolve the zero-based value\n\n // optimization for a simple object property\n var evalDimensions = map(this.dimensions, function (dimension, i) {\n var needsEnd = dimension.filter(node => node.isSymbolNode && node.name === 'end').length > 0;\n if (needsEnd) {\n // SymbolNode 'end' is used inside the index,\n // like in `A[end]` or `A[end - 2]`\n var childArgNames = Object.create(argNames);\n childArgNames.end = true;\n var _evalDimension = dimension._compile(math, childArgNames);\n return function evalDimension(scope, args, context) {\n if (!isMatrix(context) && !isArray(context) && !isString(context)) {\n throw new TypeError('Cannot resolve \"end\": ' + 'context must be a Matrix, Array, or string but is ' + typeOf(context));\n }\n var s = size(context);\n var childArgs = Object.create(args);\n childArgs.end = s[i];\n return _evalDimension(scope, childArgs, context);\n };\n } else {\n // SymbolNode `end` not used\n return dimension._compile(math, argNames);\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 /**\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 forEach(callback) {\n for (var i = 0; i < this.dimensions.length; i++) {\n callback(this.dimensions[i], 'dimensions[' + i + ']', this);\n }\n }\n\n /**\n * Create a new IndexNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var dimensions = [];\n for (var i = 0; i < this.dimensions.length; i++) {\n dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));\n }\n return new IndexNode(dimensions, this.dotNotation);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {IndexNode}\n */\n clone() {\n return new IndexNode(this.dimensions.slice(0), this.dotNotation);\n }\n\n /**\n * Test whether this IndexNode contains a single property name\n * @return {boolean}\n */\n isObjectProperty() {\n return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n }\n\n /**\n * Returns the property name if IndexNode contains a property.\n * If not, returns null.\n * @return {string | null}\n */\n getObjectProperty() {\n return this.isObjectProperty() ? this.dimensions[0].value : null;\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n // format the parameters like \"[1, 0:5]\"\n return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n dimensions: this.dimensions,\n dotNotation: this.dotNotation\n };\n }\n\n /**\n * Instantiate an IndexNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n * where mathjs is optional\n * @returns {IndexNode}\n */\n static fromJSON(json) {\n return new IndexNode(json.dimensions, json.dotNotation);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n // format the parameters like \"[1, 0:5]\"\n var dimensions = [];\n for (var i = 0; i < this.dimensions.length; i++) {\n dimensions[i] = this.dimensions[i].toHTML();\n }\n if (this.dotNotation) {\n return '.' + '' + escape(this.getObjectProperty()) + '';\n } else {\n return '[' + dimensions.join(',') + ']';\n }\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var dimensions = this.dimensions.map(function (range) {\n return range.toTex(options);\n });\n return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n }\n }\n _defineProperty(IndexNode, \"name\", name);\n return IndexNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNode } from '../../utils/is.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { escape, stringify } from '../../utils/string.js';\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nexport var createObjectNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n class ObjectNode extends Node {\n /**\n * @constructor ObjectNode\n * @extends {Node}\n * Holds an object with keys/values\n * @param {Object.} [properties] object with key/value pairs\n */\n constructor(properties) {\n super();\n this.properties = properties || {};\n\n // validate input\n if (properties) {\n if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {\n return isNode(properties[key]);\n })) {\n throw new TypeError('Object containing Nodes expected');\n }\n }\n }\n get type() {\n return name;\n }\n get isObjectNode() {\n return true;\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 _compile(math, argNames) {\n var evalEntries = {};\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 var prop = getSafeProperty(this.properties, key);\n evalEntries[parsedKey] = prop._compile(math, argNames);\n }\n }\n return function evalObjectNode(scope, args, context) {\n var obj = {};\n for (var _key in evalEntries) {\n if (hasOwnProperty(evalEntries, _key)) {\n obj[_key] = evalEntries[_key](scope, args, context);\n }\n }\n return obj;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(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 /**\n * Create a new ObjectNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var properties = {};\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 return new ObjectNode(properties);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ObjectNode}\n */\n clone() {\n var properties = {};\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n properties[key] = this.properties[key];\n }\n }\n return new ObjectNode(properties);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n var entries = [];\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 return '{' + entries.join(', ') + '}';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n properties: this.properties\n };\n }\n\n /**\n * Instantiate an OperatorNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ObjectNode\", \"properties\": {...}}`,\n * where mathjs is optional\n * @returns {ObjectNode}\n */\n static fromJSON(json) {\n return new ObjectNode(json.properties);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n var entries = [];\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n entries.push('' + escape(key) + '' + '' + ':' + this.properties[key].toHTML(options));\n }\n }\n return '{' + entries.join(',') + '}';\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var entries = [];\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 var tex = '\\\\left\\\\{\\\\begin{array}{ll}' + entries.join('\\n') + '\\\\end{array}\\\\right\\\\}';\n return tex;\n }\n }\n _defineProperty(ObjectNode, \"name\", name);\n return ObjectNode;\n}, {\n isClass: true,\n isNode: true\n});","import { ObjectWrappingMap, PartitionedMap } from './map.js';\n\n/**\n * Create a new scope which can access the parent scope,\n * but does not affect it when written. This is suitable for variable definitions\n * within a block node, or function definition.\n *\n * If parent scope has a createSubScope method, it delegates to that. Otherwise,\n * creates an empty map, and copies the parent scope to it, adding in\n * the remaining `args`.\n *\n * @param {Map} parentScope\n * @param {Object} args\n * @returns {PartitionedMap}\n */\nexport function createSubScope(parentScope, args) {\n return new PartitionedMap(parentScope, new ObjectWrappingMap(args), new Set(Object.keys(args)));\n}","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode, isConstantNode, isOperatorNode, isParenthesisNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { createSubScope } from '../../utils/scope.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 * Returns true if the expression starts with a constant, under\n * the current parenthesization:\n * @param {Node} expression\n * @param {string} parenthesis\n * @return {boolean}\n */\n function startsWithConstant(expr, parenthesis) {\n var curNode = expr;\n if (parenthesis === 'auto') {\n while (isParenthesisNode(curNode)) curNode = curNode.content;\n }\n if (isConstantNode(curNode)) return true;\n if (isOperatorNode(curNode)) {\n return startsWithConstant(curNode.args[0], parenthesis);\n }\n return false;\n }\n\n /**\n * Calculate which parentheses are necessary. Gets an OperatorNode\n * (which is the root of the tree) and an Array of Nodes\n * (this.args) and returns an array where 'true' means that an argument\n * has to be enclosed in parentheses whereas 'false' means the opposite.\n *\n * @param {OperatorNode} root\n * @param {string} parenthesis\n * @param {Node[]} args\n * @param {boolean} latex\n * @return {boolean[]}\n * @private\n */\n function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n // precedence of the root OperatorNode\n var precedence = getPrecedence(root, parenthesis, implicit);\n var associativity = getAssociativity(root, parenthesis);\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 default:\n return true;\n }\n });\n }\n var result;\n switch (args.length) {\n case 0:\n result = [];\n break;\n case 1:\n // unary operators\n {\n // precedence of the operand\n var operandPrecedence = getPrecedence(args[0], parenthesis, implicit, root);\n\n // handle special cases for LaTeX, where some of the parentheses aren't needed\n if (latex && operandPrecedence !== null) {\n var operandIdentifier;\n var rootIdentifier;\n if (parenthesis === 'keep') {\n operandIdentifier = args[0].getIdentifier();\n rootIdentifier = root.getIdentifier();\n } else {\n // Ignore Parenthesis Nodes when not in 'keep' mode\n operandIdentifier = args[0].getContent().getIdentifier();\n rootIdentifier = root.getContent().getIdentifier();\n }\n if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n result = [false];\n break;\n }\n if (properties[operandPrecedence][operandIdentifier].latexParens === false) {\n result = [false];\n break;\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 if (operandPrecedence <= precedence) {\n // if the operands precedence is lower, parens are needed\n result = [true];\n break;\n }\n\n // otherwise, no parens needed\n result = [false];\n }\n break;\n case 2:\n // binary operators\n {\n var lhsParens; // left hand side needs parenthesis?\n // precedence of the left hand side\n var lhsPrecedence = getPrecedence(args[0], parenthesis, implicit, root);\n // is the root node associative with the left hand side\n var assocWithLhs = isAssociativeWith(root, args[0], parenthesis);\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 var rhsParens; // right hand side needs parenthesis?\n // precedence of the right hand side\n var rhsPrecedence = getPrecedence(args[1], parenthesis, implicit, root);\n // is the root node associative with the right hand side?\n var assocWithRhs = isAssociativeWith(root, args[1], parenthesis);\n if (rhsPrecedence === null) {\n // if the right hand side has no defined precedence, no parens are needed\n // FunctionNode for example\n rhsParens = false;\n } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {\n // In case of equal precedence, if the root node is right associative\n // parens are **never** necessary for the right hand side.\n // If it is left associative however, parens are necessary\n // if the root node isn't associative with the right hand side\n rhsParens = true;\n } else if (rhsPrecedence < precedence) {\n rhsParens = true;\n } else {\n rhsParens = false;\n }\n\n // handle special cases for LaTeX, where some of the parentheses aren't needed\n if (latex) {\n var _rootIdentifier;\n var lhsIdentifier;\n var rhsIdentifier;\n if (parenthesis === 'keep') {\n _rootIdentifier = root.getIdentifier();\n lhsIdentifier = root.args[0].getIdentifier();\n rhsIdentifier = root.args[1].getIdentifier();\n } else {\n // Ignore ParenthesisNodes when not in 'keep' mode\n _rootIdentifier = root.getContent().getIdentifier();\n lhsIdentifier = root.args[0].getContent().getIdentifier();\n rhsIdentifier = root.args[1].getContent().getIdentifier();\n }\n if (lhsPrecedence !== null) {\n if (properties[precedence][_rootIdentifier].latexLeftParens === false) {\n lhsParens = false;\n }\n if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n lhsParens = false;\n }\n }\n if (rhsPrecedence !== null) {\n if (properties[precedence][_rootIdentifier].latexRightParens === false) {\n rhsParens = false;\n }\n if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n rhsParens = false;\n }\n }\n }\n result = [lhsParens, rhsParens];\n }\n break;\n default:\n if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {\n result = args.map(function (arg) {\n var argPrecedence = getPrecedence(arg, parenthesis, implicit, root);\n var assocWithArg = isAssociativeWith(root, arg, parenthesis);\n var argAssociativity = getAssociativity(arg, parenthesis);\n if (argPrecedence === null) {\n // if the argument has no defined precedence, no parens are needed\n return false;\n } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {\n return true;\n } else if (argPrecedence < precedence) {\n return true;\n }\n return false;\n });\n }\n break;\n }\n\n // Handles an edge case of parentheses with implicit multiplication\n // of ConstantNode.\n // In that case, parenthesize ConstantNodes that follow an unparenthesized\n // expression, even though they normally wouldn't be printed.\n if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis !== 'all' && implicit === 'hide') {\n for (var i = 1; i < result.length; ++i) {\n if (startsWithConstant(args[i], parenthesis) && !result[i - 1] && (parenthesis !== 'keep' || !isParenthesisNode(args[i - 1]))) {\n result[i] = true;\n }\n }\n }\n return result;\n }\n class OperatorNode extends Node {\n /**\n * @constructor OperatorNode\n * @extends {Node}\n * An operator with two arguments, like 2+3\n *\n * @param {string} op Operator name, for example '+'\n * @param {string} fn Function name, for example 'add'\n * @param {Node[]} args Operator arguments\n * @param {boolean} [implicit] Is this an implicit multiplication?\n * @param {boolean} [isPercentage] Is this an percentage Operation?\n */\n constructor(op, fn, args, implicit, isPercentage) {\n super();\n // validate input\n if (typeof op !== 'string') {\n throw new TypeError('string expected for parameter \"op\"');\n }\n if (typeof fn !== 'string') {\n throw new TypeError('string expected for parameter \"fn\"');\n }\n if (!Array.isArray(args) || !args.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n }\n this.implicit = implicit === true;\n this.isPercentage = isPercentage === true;\n this.op = op;\n this.fn = fn;\n this.args = args || [];\n }\n get type() {\n return name;\n }\n get isOperatorNode() {\n return true;\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 _compile(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 var fn = getSafeProperty(math, this.fn);\n var evalArgs = map(this.args, function (arg) {\n return arg._compile(math, argNames);\n });\n if (typeof fn === 'function' && fn.rawArgs === true) {\n // pass unevaluated parameters (nodes) to the function\n // \"raw\" evaluation\n var rawArgs = this.args;\n return function evalOperatorNode(scope, args, context) {\n return fn(rawArgs, math, createSubScope(scope, args));\n };\n } else 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 /**\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 forEach(callback) {\n for (var i = 0; i < this.args.length; i++) {\n callback(this.args[i], 'args[' + i + ']', this);\n }\n }\n\n /**\n * Create a new OperatorNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var args = [];\n for (var i = 0; i < this.args.length; i++) {\n args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n }\n return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {OperatorNode}\n */\n clone() {\n return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);\n }\n\n /**\n * Check whether this is an unary OperatorNode:\n * has exactly one argument, like `-a`.\n * @return {boolean}\n * Returns true when an unary operator node, false otherwise.\n */\n isUnary() {\n return this.args.length === 1;\n }\n\n /**\n * Check whether this is a binary OperatorNode:\n * has exactly two arguments, like `a + b`.\n * @return {boolean}\n * Returns true when a binary operator node, false otherwise.\n */\n isBinary() {\n return this.args.length === 2;\n }\n\n /**\n * Get string representation.\n * @param {Object} options\n * @return {string} str\n */\n _toString(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 if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toString(options);\n if (parens[0]) {\n operand = '(' + operand + ')';\n }\n\n // for example for \"not\", we want a space between operand and argument\n var opIsNamed = /[a-zA-Z]+/.test(this.op);\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 }\n\n // fall back to postfix\n return operand + this.op;\n } else if (args.length === 2) {\n var lhs = args[0].toString(options); // left hand side\n var rhs = args[1].toString(options); // right hand side\n if (parens[0]) {\n // left hand side in parenthesis?\n lhs = '(' + lhs + ')';\n }\n if (parens[1]) {\n // right hand side in parenthesis?\n rhs = '(' + rhs + ')';\n }\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return lhs + ' ' + rhs;\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 if (parens[index]) {\n // put in parenthesis?\n arg = '(' + arg + ')';\n }\n return arg;\n });\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return stringifiedArgs.join(' ');\n }\n return stringifiedArgs.join(' ' + this.op + ' ');\n } else {\n // fallback to formatting as a function call\n return this.fn + '(' + this.args.join(', ') + ')';\n }\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n op: this.op,\n fn: this.fn,\n args: this.args,\n implicit: this.implicit,\n isPercentage: this.isPercentage\n };\n }\n\n /**\n * Instantiate an OperatorNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * ```\n * {\"mathjs\": \"OperatorNode\",\n * \"op\": \"+\", \"fn\": \"add\", \"args\": [...],\n * \"implicit\": false,\n * \"isPercentage\":false}\n * ```\n * where mathjs is optional\n * @returns {OperatorNode}\n */\n static fromJSON(json) {\n return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);\n }\n\n /**\n * Get HTML representation.\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(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 if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toHTML(options);\n if (parens[0]) {\n operand = '(' + operand + ')';\n }\n if (assoc === 'right') {\n // prefix operator\n return '' + escape(this.op) + '' + operand;\n } else {\n // postfix when assoc === 'left' or undefined\n return operand + '' + escape(this.op) + '';\n }\n } else if (args.length === 2) {\n // binary operatoes\n var lhs = args[0].toHTML(options); // left hand side\n var rhs = args[1].toHTML(options); // right hand side\n if (parens[0]) {\n // left hand side in parenthesis?\n lhs = '(' + lhs + ')';\n }\n if (parens[1]) {\n // right hand side in parenthesis?\n rhs = '(' + rhs + ')';\n }\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return lhs + '' + rhs;\n }\n return lhs + '' + escape(this.op) + '' + rhs;\n } else {\n var stringifiedArgs = args.map(function (arg, index) {\n arg = arg.toHTML(options);\n if (parens[index]) {\n // put in parenthesis?\n arg = '(' + arg + ')';\n }\n return arg;\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('');\n }\n return stringifiedArgs.join('' + escape(this.op) + '');\n } else {\n // fallback to formatting as a function call\n return '' + escape(this.fn) + '' + '(' + stringifiedArgs.join(',') + ')';\n }\n }\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(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 if (parens[0]) {\n operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\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 }\n\n // fall back to postfix\n return operand + op;\n } else if (args.length === 2) {\n // binary operators\n var lhs = args[0]; // left hand side\n var lhsTex = lhs.toTex(options);\n if (parens[0]) {\n lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n }\n var rhs = args[1]; // right hand side\n var rhsTex = rhs.toTex(options);\n if (parens[1]) {\n rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n }\n\n // handle some exceptions (due to the way LaTeX works)\n var lhsIdentifier;\n if (parenthesis === 'keep') {\n lhsIdentifier = lhs.getIdentifier();\n } else {\n // Ignore ParenthesisNodes if in 'keep' mode\n lhsIdentifier = lhs.getContent().getIdentifier();\n }\n switch (this.getIdentifier()) {\n case 'OperatorNode:divide':\n // op contains '\\\\frac' at this point\n return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n case 'OperatorNode:pow':\n lhsTex = '{' + lhsTex + '}';\n rhsTex = '{' + rhsTex + '}';\n switch (lhsIdentifier) {\n case 'ConditionalNode': //\n case 'OperatorNode:divide':\n lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n }\n break;\n case 'OperatorNode:multiply':\n if (this.implicit && implicit === 'hide') {\n return lhsTex + '~' + rhsTex;\n }\n }\n return lhsTex + op + rhsTex;\n } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n var texifiedArgs = args.map(function (arg, index) {\n arg = arg.toTex(options);\n if (parens[index]) {\n arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n }\n return arg;\n });\n if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit && implicit === 'hide') {\n return texifiedArgs.join('~');\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 /**\n * Get identifier.\n * @return {string}\n */\n getIdentifier() {\n return this.type + ':' + this.fn;\n }\n }\n _defineProperty(OperatorNode, \"name\", name);\n return OperatorNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 class ParenthesisNode extends Node {\n /**\n * @constructor ParenthesisNode\n * @extends {Node}\n * A parenthesis node describes manual parenthesis from the user input\n * @param {Node} content\n * @extends {Node}\n */\n constructor(content) {\n super();\n // validate input\n if (!isNode(content)) {\n throw new TypeError('Node expected for parameter \"content\"');\n }\n this.content = content;\n }\n get type() {\n return name;\n }\n get isParenthesisNode() {\n return true;\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 _compile(math, argNames) {\n return this.content._compile(math, argNames);\n }\n\n /**\n * Get the content of the current Node.\n * @return {Node} content\n * @override\n **/\n getContent() {\n return this.content.getContent();\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.content, 'content', this);\n }\n\n /**\n * Create a new ParenthesisNode whose child is the result of calling\n * the provided callback function on the child of this node.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {ParenthesisNode} Returns a clone of the node\n */\n map(callback) {\n var content = callback(this.content, 'content', this);\n return new ParenthesisNode(content);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ParenthesisNode}\n */\n clone() {\n return new ParenthesisNode(this.content);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return '(' + this.content.toString(options) + ')';\n }\n return this.content.toString(options);\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n content: this.content\n };\n }\n\n /**\n * Instantiate an ParenthesisNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ParenthesisNode\", \"content\": ...}`,\n * where mathjs is optional\n * @returns {ParenthesisNode}\n */\n static fromJSON(json) {\n return new ParenthesisNode(json.content);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return '(' + this.content.toHTML(options) + ')';\n }\n return this.content.toHTML(options);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toTex(options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n }\n return this.content.toTex(options);\n }\n }\n _defineProperty(ParenthesisNode, \"name\", name);\n return ParenthesisNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 * Calculate the necessary parentheses\n * @param {Node} node\n * @param {string} parenthesis\n * @param {string} implicit\n * @return {Object} parentheses\n * @private\n */\n function calculateNecessaryParentheses(node, parenthesis, implicit) {\n var precedence = getPrecedence(node, parenthesis, implicit);\n var parens = {};\n var startPrecedence = getPrecedence(node.start, parenthesis, implicit);\n parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n if (node.step) {\n var stepPrecedence = getPrecedence(node.step, parenthesis, implicit);\n parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n }\n var endPrecedence = getPrecedence(node.end, parenthesis, implicit);\n parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n return parens;\n }\n class RangeNode extends Node {\n /**\n * @constructor RangeNode\n * @extends {Node}\n * create a range\n * @param {Node} start included lower-bound\n * @param {Node} end included upper-bound\n * @param {Node} [step] optional step\n */\n constructor(start, end, step) {\n super();\n // validate inputs\n if (!isNode(start)) throw new TypeError('Node expected');\n if (!isNode(end)) throw new TypeError('Node expected');\n if (step && !isNode(step)) throw new TypeError('Node expected');\n if (arguments.length > 3) throw new Error('Too many arguments');\n this.start = start; // included lower-bound\n this.end = end; // included upper-bound\n this.step = step || null; // optional step\n }\n get type() {\n return name;\n }\n get isRangeNode() {\n return true;\n }\n\n /**\n * Check whether the RangeNode needs the `end` symbol to be defined.\n * This end is the size of the Matrix in current dimension.\n * @return {boolean}\n */\n needsEnd() {\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 /**\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 _compile(math, argNames) {\n var range = math.range;\n var evalStart = this.start._compile(math, argNames);\n var evalEnd = this.end._compile(math, argNames);\n if (this.step) {\n var evalStep = this.step._compile(math, argNames);\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 /**\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 forEach(callback) {\n callback(this.start, 'start', this);\n callback(this.end, 'end', this);\n if (this.step) {\n callback(this.step, 'step', this);\n }\n }\n\n /**\n * Create a new RangeNode whose children are the results of calling\n * the provided callback function for each child 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 map(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 /**\n * Create a clone of this node, a shallow copy\n * @return {RangeNode}\n */\n clone() {\n return new RangeNode(this.start, this.end, this.step && this.step);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n\n // format string as start:step:stop\n var str;\n var start = this.start.toString(options);\n if (parens.start) {\n start = '(' + start + ')';\n }\n str = start;\n if (this.step) {\n var step = this.step.toString(options);\n if (parens.step) {\n step = '(' + step + ')';\n }\n str += ':' + step;\n }\n var end = this.end.toString(options);\n if (parens.end) {\n end = '(' + end + ')';\n }\n str += ':' + end;\n return str;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n start: this.start,\n end: this.end,\n step: this.step\n };\n }\n\n /**\n * Instantiate an RangeNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n * where mathjs is optional\n * @returns {RangeNode}\n */\n static fromJSON(json) {\n return new RangeNode(json.start, json.end, json.step);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n\n // format string as start:step:stop\n var str;\n var start = this.start.toHTML(options);\n if (parens.start) {\n start = '(' + start + ')';\n }\n str = start;\n if (this.step) {\n var step = this.step.toHTML(options);\n if (parens.step) {\n step = '(' + step + ')';\n }\n str += ':' + step;\n }\n var end = this.end.toHTML(options);\n if (parens.end) {\n end = '(' + end + ')';\n }\n str += ':' + end;\n return str;\n }\n\n /**\n * Get LaTeX representation\n * @params {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n var str = this.start.toTex(options);\n if (parens.start) {\n str = \"\\\\left(\".concat(str, \"\\\\right)\");\n }\n if (this.step) {\n var step = this.step.toTex(options);\n if (parens.step) {\n step = \"\\\\left(\".concat(step, \"\\\\right)\");\n }\n str += ':' + step;\n }\n var end = this.end.toTex(options);\n if (parens.end) {\n end = \"\\\\left(\".concat(end, \"\\\\right)\");\n }\n str += ':' + end;\n return str;\n }\n }\n _defineProperty(RangeNode, \"name\", name);\n return RangeNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 var operatorMap = {\n equal: '==',\n unequal: '!=',\n smaller: '<',\n larger: '>',\n smallerEq: '<=',\n largerEq: '>='\n };\n class RelationalNode extends Node {\n /**\n * A node representing a chained conditional expression, such as 'x > y > z'\n *\n * @param {String[]} conditionals\n * An array of conditional operators used to compare the parameters\n * @param {Node[]} params\n * The parameters that will be compared\n *\n * @constructor RelationalNode\n * @extends {Node}\n */\n constructor(conditionals, params) {\n super();\n if (!Array.isArray(conditionals)) {\n throw new TypeError('Parameter conditionals must be an array');\n }\n if (!Array.isArray(params)) {\n throw new TypeError('Parameter params must be an array');\n }\n if (conditionals.length !== params.length - 1) {\n throw new TypeError('Parameter params must contain exactly one more element ' + 'than parameter conditionals');\n }\n this.conditionals = conditionals;\n this.params = params;\n }\n get type() {\n return name;\n }\n get isRelationalNode() {\n return true;\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 _compile(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 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 if (!condFn(evalLhs, evalRhs)) {\n return false;\n }\n }\n return true;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);\n }\n\n /**\n * Create a new RelationalNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {RelationalNode}\n */\n clone() {\n return new RelationalNode(this.conditionals, this.params);\n }\n\n /**\n * Get string representation.\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n });\n var ret = paramStrings[0];\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += ' ' + operatorMap[this.conditionals[i]];\n ret += ' ' + paramStrings[i + 1];\n }\n return ret;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n conditionals: this.conditionals,\n params: this.params\n };\n }\n\n /**\n * Instantiate a RelationalNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"RelationalNode\", \"conditionals\": ..., \"params\": ...}`,\n * where mathjs is optional\n * @returns {RelationalNode}\n */\n static fromJSON(json) {\n return new RelationalNode(json.conditionals, json.params);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toHTML(options) + ')' : p.toHTML(options);\n });\n var ret = paramStrings[0];\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += '' + escape(operatorMap[this.conditionals[i]]) + '' + paramStrings[i + 1];\n }\n return ret;\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n });\n var ret = paramStrings[0];\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1];\n }\n return ret;\n }\n }\n _defineProperty(RelationalNode, \"name\", name);\n return RelationalNode;\n}, {\n isClass: true,\n isNode: true\n});","import { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { toSymbol } from '../../utils/latex.js';\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 * 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 class SymbolNode extends Node {\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 constructor(name) {\n super();\n // validate input\n if (typeof name !== 'string') {\n throw new TypeError('String expected for parameter \"name\"');\n }\n this.name = name;\n }\n get type() {\n return 'SymbolNode';\n }\n get isSymbolNode() {\n return true;\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 _compile(math, argNames) {\n var name = this.name;\n if (argNames[name] === true) {\n // this is a FunctionAssignment argument\n // (like an x when inside the expression of a function\n // assignment `f(x) = ...`)\n return function (scope, args, context) {\n return getSafeProperty(args, name);\n };\n } else if (name in math) {\n return function (scope, args, context) {\n return scope.has(name) ? scope.get(name) : getSafeProperty(math, name);\n };\n } else {\n var isUnit = isValuelessUnit(name);\n return function (scope, args, context) {\n return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);\n };\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n // nothing to do, we don't have any children\n }\n\n /**\n * Create a new SymbolNode with children produced by the given callback.\n * Trivial since a SymbolNode has no children\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {SymbolNode} Returns a clone of the node\n */\n map(callback) {\n return this.clone();\n }\n\n /**\n * Throws an error 'Undefined symbol {name}'\n * @param {string} name\n */\n static onUndefinedSymbol(name) {\n throw new Error('Undefined symbol ' + name);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {SymbolNode}\n */\n clone() {\n return new SymbolNode(this.name);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n return this.name;\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n var name = escape(this.name);\n if (name === 'true' || name === 'false') {\n return '' + name + '';\n } else if (name === 'i') {\n return '' + name + '';\n } else if (name === 'Infinity') {\n return '' + name + '';\n } else if (name === 'NaN') {\n return '' + name + '';\n } else if (name === 'null') {\n return '' + name + '';\n } else if (name === 'undefined') {\n return '' + name + '';\n }\n return '' + name + '';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: 'SymbolNode',\n name: this.name\n };\n }\n\n /**\n * Instantiate a SymbolNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SymbolNode\", name: \"x\"}`,\n * where mathjs is optional\n * @returns {SymbolNode}\n */\n static fromJSON(json) {\n return new SymbolNode(json.name);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toTex(options) {\n var isUnit = false;\n if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n isUnit = true;\n }\n var symbol = toSymbol(this.name, isUnit);\n if (symbol[0] === '\\\\') {\n // no space needed if the symbol starts with '\\'\n return symbol;\n }\n // the space prevents symbols from breaking stuff like '\\cdot'\n // if it's written right before the symbol\n return ' ' + symbol;\n }\n }\n return SymbolNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { escape, format } from '../../utils/string.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { getSafeProperty, getSafeMethod } from '../../utils/customs.js';\nimport { createSubScope } from '../../utils/scope.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 _FunctionNode;\n var {\n math,\n Node,\n SymbolNode\n } = _ref;\n /* format to fixed length */\n var strin = entity => format(entity, {\n truncate: 78\n });\n\n /*\n * Expand a LaTeX template\n *\n * @param {string} template\n * @param {Node} node\n * @param {Object} options\n * @private\n **/\n function expandTemplate(template, node, options) {\n var latex = '';\n\n // Match everything of the form ${identifier} or ${identifier[2]} or $$\n // while submatching identifier and 2 (in the second case)\n var regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi;\n var inputPos = 0; // position in the input string\n var match;\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 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 if (!property) {\n throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n }\n if (match[2] === undefined) {\n // no square brackets\n switch (typeof property) {\n case 'string':\n latex += property;\n break;\n case 'object':\n if (isNode(property)) {\n latex += property.toTex(options);\n } else if (Array.isArray(property)) {\n // make array of Nodes into comma separated list\n latex += property.map(function (arg, index) {\n if (isNode(arg)) {\n return arg.toTex(options);\n }\n throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');\n }).join(',');\n } else {\n throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n }\n break;\n default:\n throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n }\n } else {\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 latex += template.slice(inputPos); // append rest of the template\n\n return latex;\n }\n class FunctionNode extends Node {\n /**\n * @constructor FunctionNode\n * @extends {./Node}\n * invoke a list with arguments on a node\n * @param {./Node | string} fn\n * Item resolving to a function on which to invoke\n * the arguments, typically a SymbolNode or AccessorNode\n * @param {./Node[]} args\n */\n constructor(fn, args, optional) {\n super();\n if (typeof fn === 'string') {\n fn = new SymbolNode(fn);\n }\n\n // validate input\n if (!isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"');\n if (!Array.isArray(args) || !args.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n }\n var optionalType = typeof optional;\n if (!(optionalType === 'undefined' || optionalType === 'boolean')) {\n throw new TypeError('optional flag, if specified, must be boolean');\n }\n this.fn = fn;\n this.args = args || [];\n this.optional = !!optional;\n }\n\n // readonly property name\n get name() {\n return this.fn.name || '';\n }\n get type() {\n return name;\n }\n get isFunctionNode() {\n return true;\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 _compile(math, argNames) {\n // compile arguments\n var evalArgs = this.args.map(arg => arg._compile(math, argNames));\n var fromOptionalChaining = this.optional || isAccessorNode(this.fn) && this.fn.optionalChaining;\n if (isSymbolNode(this.fn)) {\n var _name = this.fn.name;\n if (!argNames[_name]) {\n // we can statically determine whether the function\n // has the rawArgs property\n var fn = _name in math ? getSafeProperty(math, _name) : undefined;\n var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n var resolveFn = scope => {\n var value;\n if (scope.has(_name)) {\n value = scope.get(_name);\n } else if (_name in math) {\n value = getSafeProperty(math, _name);\n } else if (fromOptionalChaining) value = undefined;else return FunctionNode.onUndefinedFunction(_name);\n if (typeof value === 'function' || fromOptionalChaining && value === undefined) {\n return value;\n }\n throw new TypeError(\"'\".concat(_name, \"' is not a function; its value is:\\n \").concat(strin(value)));\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 var fn = resolveFn(scope);\n\n // the original function can be overwritten in the scope with a non-rawArgs function\n if (fn.rawArgs === true) {\n return fn(rawArgs, math, createSubScope(scope, args));\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn(...values);\n }\n };\n } else {\n // \"regular\" evaluation\n switch (evalArgs.length) {\n case 0:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n return fn();\n };\n case 1:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n var evalArg0 = evalArgs[0];\n return fn(evalArg0(scope, args, context));\n };\n case 2:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n var evalArg0 = evalArgs[0];\n var evalArg1 = evalArgs[1];\n return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));\n };\n default:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn(...values);\n };\n }\n }\n } else {\n // the function symbol is an argName\n var _rawArgs = this.args;\n return function evalFunctionNode(scope, args, context) {\n var fn = getSafeProperty(args, _name);\n if (fromOptionalChaining && fn === undefined) return undefined;\n if (typeof fn !== 'function') {\n throw new TypeError(\"Argument '\".concat(_name, \"' was not a function; received: \").concat(strin(fn)));\n }\n if (fn.rawArgs) {\n // \"Raw\" evaluation\n return fn(_rawArgs, math, createSubScope(scope, args));\n } else {\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(fn, values);\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:\n // the object of the AccessorNode\n\n var evalObject = this.fn.object._compile(math, argNames);\n var prop = this.fn.index.getObjectProperty();\n var _rawArgs2 = this.args;\n return function evalFunctionNode(scope, args, context) {\n var object = evalObject(scope, args, context);\n\n // Optional chaining: if the base object is nullish, short-circuit to undefined\n if (fromOptionalChaining && (object == null || object[prop] === undefined)) {\n return undefined;\n }\n var fn = getSafeMethod(object, prop);\n if (fn !== null && fn !== void 0 && fn.rawArgs) {\n // \"Raw\" evaluation\n return fn(_rawArgs2, math, createSubScope(scope, args));\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(object, values);\n }\n };\n } else {\n // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n // we have to dynamically determine whether the function has the\n // rawArgs property\n var fnExpr = this.fn.toString();\n var evalFn = this.fn._compile(math, argNames);\n var _rawArgs3 = this.args;\n return function evalFunctionNode(scope, args, context) {\n var fn = evalFn(scope, args, context);\n if (fromOptionalChaining && fn === undefined) return undefined;\n if (typeof fn !== 'function') {\n throw new TypeError(\"Expression '\".concat(fnExpr, \"' did not evaluate to a function; value is:\") + \"\\n \".concat(strin(fn)));\n }\n if (fn.rawArgs) {\n // \"Raw\" evaluation\n return fn(_rawArgs3, math, createSubScope(scope, args));\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(fn, values);\n }\n };\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.fn, 'fn', this);\n for (var i = 0; i < this.args.length; i++) {\n callback(this.args[i], 'args[' + i + ']', this);\n }\n }\n\n /**\n * Create a new FunctionNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var fn = this._ifNode(callback(this.fn, 'fn', this));\n var args = [];\n for (var i = 0; i < this.args.length; i++) {\n args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n }\n return new FunctionNode(fn, args);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {FunctionNode}\n */\n clone() {\n return new FunctionNode(this.fn, this.args.slice(0));\n }\n\n /**\n * Throws an error 'Undefined function {name}'\n * @param {string} name\n */\n\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 toString(options) {\n var customString;\n var name = this.fn.toString(options);\n if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, name)) {\n // callback is a map of callback functions\n customString = options.handler[name](this, options);\n }\n if (typeof customString !== 'undefined') {\n return customString;\n }\n\n // fall back to Node's toString\n return super.toString(options);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(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);\n\n // format the arguments like \"add(2, 4.2)\"\n return fn + '(' + args.join(', ') + ')';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n fn: this.fn,\n args: this.args\n };\n }\n\n /**\n * Instantiate an AssignmentNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"FunctionNode\", fn: ..., args: ...}`,\n * where mathjs is optional\n * @returns {FunctionNode}\n */\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var args = this.args.map(function (arg) {\n return arg.toHTML(options);\n });\n\n // format the arguments like \"add(2, 4.2)\"\n return '' + escape(this.fn) + '(' + args.join(',') + ')';\n }\n\n /**\n * Get LaTeX representation. (wrapper function)\n * This overrides parts of Node's toTex function.\n * If callback is an object containing callbacks, it\n * calls the correct callback for the current node,\n * otherwise it falls back to calling Node's toTex\n * function.\n *\n * @param {Object} options\n * @return {string}\n */\n toTex(options) {\n var customTex;\n if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, this.name)) {\n // callback is a map of callback functions\n customTex = options.handler[this.name](this, options);\n }\n if (typeof customTex !== 'undefined') {\n return customTex;\n }\n\n // fall back to Node's toTex\n return super.toTex(options);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(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 if (latexFunctions[this.name]) {\n latexConverter = latexFunctions[this.name];\n }\n\n // toTex property on the function itself\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 var customToTex;\n switch (typeof latexConverter) {\n case 'function':\n // a callback function\n customToTex = latexConverter(this, options);\n break;\n case 'string':\n // a template string\n customToTex = expandTemplate(latexConverter, this, options);\n break;\n case 'object':\n // an object with different \"converters\" for different\n // numbers of arguments\n switch (typeof latexConverter[args.length]) {\n case 'function':\n customToTex = latexConverter[args.length](this, options);\n break;\n case 'string':\n customToTex = expandTemplate(latexConverter[args.length], this, options);\n break;\n }\n }\n if (typeof customToTex !== 'undefined') {\n return customToTex;\n }\n return expandTemplate(defaultTemplate, this, options);\n }\n\n /**\n * Get identifier.\n * @return {string}\n */\n getIdentifier() {\n return this.type + ':' + this.name;\n }\n }\n _FunctionNode = FunctionNode;\n _defineProperty(FunctionNode, \"name\", name);\n _defineProperty(FunctionNode, \"onUndefinedFunction\", function (name) {\n throw new Error('Undefined function ' + name);\n });\n _defineProperty(FunctionNode, \"fromJSON\", function (json) {\n return new _FunctionNode(json.fn, json.args);\n });\n return FunctionNode;\n}, {\n isClass: true,\n isNode: true\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../utils/factory.js';\nimport { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode, rule2Node } from '../utils/is.js';\nimport { deepMap } from '../utils/collection.js';\nimport { safeNumberType } from '../utils/number.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 * Parse an expression. Returns a node tree, which can be evaluated by\n * invoking node.evaluate() or transformed into a functional object via node.compile().\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')\n * node2.evaluate(scope) // 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}} [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 Array__Matrix(expressions) {\n return parseMultiple(expressions, {});\n },\n 'string, Object': function string_Object(expression, options) {\n var extraNodes = options.nodes !== undefined ? options.nodes : {};\n return parseStart(expression, extraNodes);\n },\n 'Array | Matrix, Object': parseMultiple\n });\n function parseMultiple(expressions) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n var extraNodes = options.nodes !== undefined ? options.nodes : {};\n\n // parse an array or matrix with expressions\n return deepMap(expressions, function (elem) {\n if (typeof elem !== 'string') throw new TypeError('String expected');\n return parseStart(elem, extraNodes);\n });\n }\n\n // token types enumeration\n var TOKENTYPE = {\n NULL: 0,\n DELIMITER: 1,\n NUMBER: 2,\n SYMBOL: 3,\n UNKNOWN: 4\n };\n\n // map with all delimiters\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 '>>': true,\n '>>>': true\n };\n\n // map with all named delimiters\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\n };\n var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n var ESCAPE_CHARACTERS = {\n '\"': '\"',\n \"'\": \"'\",\n '\\\\': '\\\\',\n '/': '/',\n b: '\\b',\n f: '\\f',\n n: '\\n',\n r: '\\r',\n t: '\\t'\n // note that \\u is handled separately in parseStringToken()\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 function currentString(state, length) {\n return state.expression.substr(state.index, length);\n }\n\n /**\n * View the current character. Returns '' if end of expression is reached.\n *\n * @param {Object} state\n * @returns {string}\n * @private\n */\n function currentCharacter(state) {\n return currentString(state, 1);\n }\n\n /**\n * Get the next character from the expression.\n * The character is stored into the char c. If the end of the expression is\n * reached, the function puts an empty string in c.\n * @private\n */\n function next(state) {\n state.index++;\n }\n\n /**\n * Preview the previous character from the expression.\n * @return {string} cNext\n * @private\n */\n function prevCharacter(state) {\n return state.expression.charAt(state.index - 1);\n }\n\n /**\n * Preview the next character from the expression.\n * @return {string} cNext\n * @private\n */\n function nextCharacter(state) {\n return state.expression.charAt(state.index + 1);\n }\n\n /**\n * Get next token in the current string expr.\n * The token and token type are available as token and tokenType\n * @private\n */\n function getToken(state) {\n state.tokenType = TOKENTYPE.NULL;\n state.token = '';\n state.comment = '';\n\n // skip over ignored characters:\n while (true) {\n // comments:\n if (currentCharacter(state) === '#') {\n while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n state.comment += currentCharacter(state);\n next(state);\n }\n }\n // whitespace: space, tab, and newline when inside parameters\n if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n next(state);\n } else {\n break;\n }\n }\n\n // check for end of expression\n if (currentCharacter(state) === '') {\n // token is still empty\n state.tokenType = TOKENTYPE.DELIMITER;\n return;\n }\n\n // check for new line character\n if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = currentCharacter(state);\n next(state);\n return;\n }\n var c1 = currentCharacter(state);\n var c2 = currentString(state, 2);\n var c3 = currentString(state, 3);\n if (c3.length === 3 && DELIMITERS[c3]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c3;\n next(state);\n next(state);\n next(state);\n return;\n }\n\n // check for delimiters consisting of 2 characters\n // Special case: the check for '?.' is to prevent a case like 'a?.3:.7' from being interpreted as optional chaining\n // TODO: refactor the tokenization into some better way to deal with cases like 'a?.3:.7', see https://github.com/josdejong/mathjs/pull/3584\n if (c2.length === 2 && DELIMITERS[c2] && (c2 !== '?.' || !parse.isDigit(state.expression.charAt(state.index + 2)))) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c2;\n next(state);\n next(state);\n return;\n }\n\n // check for delimiters consisting of 1 character\n if (DELIMITERS[c1]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c1;\n next(state);\n return;\n }\n\n // check for a number\n if (parse.isDigitDot(c1)) {\n state.tokenType = TOKENTYPE.NUMBER;\n\n // check for binary, octal, or hex\n var _c = currentString(state, 2);\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 while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (currentCharacter(state) === '.') {\n // this number has a radix point\n state.token += '.';\n next(state);\n // get the digits after the radix\n while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n } else if (currentCharacter(state) === 'i') {\n // this number has a word size suffix\n state.token += 'i';\n next(state);\n // get the word size\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n }\n return;\n }\n\n // get number, can have a single dot\n if (currentCharacter(state) === '.') {\n state.token += currentCharacter(state);\n next(state);\n if (!parse.isDigit(currentCharacter(state))) {\n // this is no number, it is just a dot (can be dot notation)\n state.tokenType = TOKENTYPE.DELIMITER;\n return;\n }\n } else {\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n }\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {\n if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {\n state.token += currentCharacter(state);\n next(state);\n if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n state.token += currentCharacter(state);\n next(state);\n }\n // Scientific notation MUST be followed by an exponent\n if (!parse.isDigit(currentCharacter(state))) {\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n } else if (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {\n next(state);\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n }\n return;\n }\n\n // check for variables, functions, named operators\n if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {\n while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {\n state.tokenType = TOKENTYPE.DELIMITER;\n } else {\n state.tokenType = TOKENTYPE.SYMBOL;\n }\n return;\n }\n\n // something unknown is found, wrong characters -> a syntax error\n state.tokenType = TOKENTYPE.UNKNOWN;\n while (currentCharacter(state) !== '') {\n state.token += currentCharacter(state);\n next(state);\n }\n throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n }\n\n /**\n * Get next token and skip newline tokens\n */\n function getTokenSkipNewline(state) {\n do {\n getToken(state);\n } while (state.token === '\\n'); // eslint-disable-line no-unmodified-loop-condition\n }\n\n /**\n * Open parameters.\n * New line characters will be ignored until closeParams(state) is called\n */\n function openParams(state) {\n state.nestingLevel++;\n }\n\n /**\n * Close parameters.\n * New line characters will no longer be ignored\n */\n function closeParams(state) {\n state.nestingLevel--;\n }\n\n /**\n * Checks whether the current character `c` is a valid alpha character:\n *\n * - A latin letter (upper or lower case) Ascii: a-z, A-Z\n * - An underscore Ascii: _\n * - A dollar sign Ascii: $\n * - A latin letter with accents Unicode: \\u00C0 - \\u02AF\n * - A greek letter Unicode: \\u0370 - \\u03FF\n * - A mathematical alphanumeric symbol Unicode: \\u{1D400} - \\u{1D7FF} excluding invalid code points\n *\n * The previous and next characters are needed to determine whether\n * this character is part of a unicode surrogate pair.\n *\n * @param {string} c Current character in the expression\n * @param {string} cPrev Previous character\n * @param {string} cNext Next character\n * @return {boolean}\n */\n parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\n };\n\n /**\n * Test whether a character is a valid latin, greek, or letter-like character\n * @param {string} c\n * @return {boolean}\n */\n parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\n };\n\n /**\n * Test whether two given 16 bit characters form a surrogate pair of a\n * unicode math symbol.\n *\n * https://unicode-table.com/en/\n * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode\n *\n * Note: In ES6 will be unicode aware:\n * https://stackoverflow.com/questions/280712/javascript-unicode-regexes\n * https://mathiasbynens.be/notes/es6-unicode-regex\n *\n * @param {string} high\n * @param {string} low\n * @return {boolean}\n */\n parse.isValidMathSymbol = function isValidMathSymbol(high, low) {\n return /^[\\uD835]$/.test(high) && /^[\\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 /**\n * Check whether given character c is a white space character: space, tab, or enter\n * @param {string} c\n * @param {number} nestingLevel\n * @return {boolean}\n */\n parse.isWhitespace = function isWhitespace(c, nestingLevel) {\n // TODO: also take '\\r' carriage return as newline? Or does that give problems on mac?\n return c === ' ' || c === '\\t' || c === '\\u00A0' || c === '\\n' && nestingLevel > 0;\n };\n\n /**\n * Test whether the character c is a decimal mark (dot).\n * This is the case when it's not the start of a delimiter '.*', './', or '.^'\n * @param {string} c\n * @param {string} cNext\n * @return {boolean}\n */\n parse.isDecimalMark = function isDecimalMark(c, cNext) {\n return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\n };\n\n /**\n * checks if the given char c is a digit or dot\n * @param {string} c a string with one character\n * @return {boolean}\n */\n parse.isDigitDot = function isDigitDot(c) {\n return c >= '0' && c <= '9' || c === '.';\n };\n\n /**\n * checks if the given char c is a digit\n * @param {string} c a string with one character\n * @return {boolean}\n */\n parse.isDigit = function isDigit(c) {\n return c >= '0' && c <= '9';\n };\n\n /**\n * Start of the parse levels below, in order of precedence\n * @return {Node} node\n * @private\n */\n function parseStart(expression, extraNodes) {\n var state = initialState();\n _extends(state, {\n expression,\n extraNodes\n });\n getToken(state);\n var node = parseBlock(state);\n\n // check for garbage at the end of the expression\n // an expression ends with a empty character '' and tokenType DELIMITER\n if (state.token !== '') {\n if (state.tokenType === TOKENTYPE.DELIMITER) {\n // user entered a not existing operator like \"//\"\n\n // TODO: give hints for aliases, for example with \"<>\" give as hint \" did you mean !== ?\"\n throw createError(state, 'Unexpected operator ' + state.token);\n } else {\n throw createSyntaxError(state, 'Unexpected part \"' + state.token + '\"');\n }\n }\n return node;\n }\n\n /**\n * Parse a block with expressions. Expressions can be separated by a newline\n * character '\\n', or by a semicolon ';'. In case of a semicolon, no output\n * of the preceding line is returned.\n * @return {Node} node\n * @private\n */\n function parseBlock(state) {\n var node;\n var blocks = [];\n var visible;\n if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n node = parseAssignment(state);\n if (state.comment) {\n node.comment = state.comment;\n }\n }\n\n // TODO: simplify this loop\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,\n visible\n });\n }\n getToken(state);\n if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n node = parseAssignment(state);\n if (state.comment) {\n node.comment = state.comment;\n }\n visible = state.token !== ';';\n blocks.push({\n node,\n visible\n });\n }\n }\n if (blocks.length > 0) {\n return new BlockNode(blocks);\n } else {\n if (!node) {\n node = new ConstantNode(undefined);\n if (state.comment) {\n node.comment = state.comment;\n }\n }\n return node;\n }\n }\n\n /**\n * Assignment of a function or variable,\n * - can be a variable like 'a=2.3'\n * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'\n * - defining a function like 'f(x) = x^2'\n * @return {Node} node\n * @private\n */\n function parseAssignment(state) {\n var name, args, value, valid;\n var node = parseConditional(state);\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 if (node.optionalChaining) {\n throw createSyntaxError(state, 'Cannot assign to optional chain');\n }\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 if (valid) {\n getTokenSkipNewline(state);\n value = parseAssignment(state);\n return new FunctionAssignmentNode(name, args, value);\n }\n }\n throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');\n }\n return node;\n }\n\n /**\n * conditional operation\n *\n * condition ? truePart : falsePart\n *\n * Note: conditional operator is right-associative\n *\n * @return {Node} node\n * @private\n */\n function parseConditional(state) {\n var node = parseLogicalOr(state);\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);\n\n // restore the previous conditional level\n state.conditionalLevel = prev;\n }\n return node;\n }\n\n /**\n * logical or, 'x or y'\n * @return {Node} node\n * @private\n */\n function parseLogicalOr(state) {\n var node = parseLogicalXor(state);\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 return node;\n }\n\n /**\n * logical exclusive or, 'x xor y'\n * @return {Node} node\n * @private\n */\n function parseLogicalXor(state) {\n var node = parseLogicalAnd(state);\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 return node;\n }\n\n /**\n * logical and, 'x and y'\n * @return {Node} node\n * @private\n */\n function parseLogicalAnd(state) {\n var node = parseBitwiseOr(state);\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 return node;\n }\n\n /**\n * bitwise or, 'x | y'\n * @return {Node} node\n * @private\n */\n function parseBitwiseOr(state) {\n var node = parseBitwiseXor(state);\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 return node;\n }\n\n /**\n * bitwise exclusive or (xor), 'x ^| y'\n * @return {Node} node\n * @private\n */\n function parseBitwiseXor(state) {\n var node = parseBitwiseAnd(state);\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 return node;\n }\n\n /**\n * bitwise and, 'x & y'\n * @return {Node} node\n * @private\n */\n function parseBitwiseAnd(state) {\n var node = parseRelational(state);\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 return node;\n }\n\n /**\n * Parse a chained conditional, like 'a > b >= c'\n * @return {Node} node\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 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 if (params.length === 1) {\n return params[0];\n } else if (params.length === 2) {\n return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);\n } else {\n return new RelationalNode(conditionals.map(c => c.fn), params);\n }\n }\n\n /**\n * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n * @return {Node} node\n * @private\n */\n function parseShift(state) {\n var node, name, fn, params;\n node = parseConversion(state);\n var operators = {\n '<<': 'leftShift',\n '>>': 'rightArithShift',\n '>>>': 'rightLogShift'\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 return node;\n }\n\n /**\n * conversion operators 'to' and 'in'\n * @return {Node} node\n * @private\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 while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n if (name === 'in' && '])},;'.includes(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 return node;\n }\n\n /**\n * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n * @return {Node} node\n * @private\n */\n function parseRange(state) {\n var node;\n var params = [];\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 if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {\n // we ignore the range operator when a conditional operator is being processed on the same level\n params.push(node);\n\n // parse step and end\n while (state.token === ':' && params.length < 3) {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\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 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 return node;\n }\n\n /**\n * add or subtract\n * @return {Node} node\n * @private\n */\n function parseAddSubtract(state) {\n var node, name, fn, params;\n node = parseMultiplyDivideModulus(state);\n var operators = {\n '+': 'add',\n '-': 'subtract'\n };\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n var rightNode = parseMultiplyDivideModulus(state);\n if (rightNode.isPercentage) {\n params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];\n } else {\n params = [node, rightNode];\n }\n node = new OperatorNode(name, fn, params);\n }\n return node;\n }\n\n /**\n * multiply, divide, modulus\n * @return {Node} node\n * @private\n */\n function parseMultiplyDivideModulus(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 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 return node;\n }\n\n /**\n * implicit multiplication\n * @return {Node} node\n * @private\n */\n function parseImplicitMultiplication(state) {\n var node, last;\n node = parseRule2(state);\n last = node;\n while (true) {\n if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.token === 'in' && isOperatorNode(node) && node.fn === 'unaryMinus' && isConstantNode(node.args[0]) || 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 /* implicit */);\n } else {\n break;\n }\n }\n return node;\n }\n\n /**\n * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n * And as amended in https://github.com/josdejong/mathjs/issues/2370#issuecomment-1054052164\n * Explicit division gets higher precedence than implicit multiplication\n * when the division matches this pattern:\n * [unaryPrefixOp]?[number] / [number] [symbol]\n * @return {Node} node\n * @private\n */\n function parseRule2(state) {\n var node = parseUnaryPercentage(state);\n var last = node;\n var tokenStates = [];\n while (true) {\n // Match the \"number /\" part of the pattern \"number / number symbol\"\n if (state.token === '/' && rule2Node(last)) {\n // Look ahead to see if the next token is a number\n tokenStates.push(_extends({}, state));\n getTokenSkipNewline(state);\n\n // Match the \"number / number\" part of the pattern\n if (state.tokenType === TOKENTYPE.NUMBER) {\n // Look ahead again\n tokenStates.push(_extends({}, state));\n getTokenSkipNewline(state);\n\n // Match the \"symbol\" part of the pattern, or a left parenthesis\n if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(' || state.token === 'in') {\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 tokenStates.pop();\n last = parseUnaryPercentage(state);\n node = new OperatorNode('/', 'divide', [node, last]);\n } else {\n // Not a match, so rewind\n tokenStates.pop();\n _extends(state, tokenStates.pop());\n break;\n }\n } else {\n // Not a match, so rewind\n _extends(state, tokenStates.pop());\n break;\n }\n } else {\n break;\n }\n }\n return node;\n }\n\n /**\n * Unary percentage operator (treated as `value / 100`)\n * @return {Node} node\n * @private\n */\n function parseUnaryPercentage(state) {\n var node = parseUnary(state);\n if (state.token === '%') {\n var previousState = _extends({}, state);\n getTokenSkipNewline(state);\n // We need to decide if this is a unary percentage % or binary modulo %\n // So we attempt to parse a unary expression at this point.\n // If it fails, then the only possibility is that this is a unary percentage.\n // If it succeeds, then we presume that this must be binary modulo, since the\n // only things that parseUnary can handle are _higher_ precedence than unary %.\n try {\n parseUnary(state);\n // Not sure if we could somehow use the result of that parseUnary? Without\n // further analysis/testing, safer just to discard and let the parse proceed\n _extends(state, previousState);\n } catch (_unused) {\n // Not seeing a term at this point, so was a unary %\n node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);\n }\n }\n return node;\n }\n\n /**\n * Unary plus and minus, and logical and bitwise not\n * @return {Node} node\n * @private\n */\n function parseUnary(state) {\n var name, params, fn;\n var operators = {\n '-': 'unaryMinus',\n '+': 'unaryPlus',\n '~': 'bitNot',\n not: 'not'\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 return parsePow(state);\n }\n\n /**\n * power\n * Note: power operator is right associative\n * @return {Node} node\n * @private\n */\n function parsePow(state) {\n var node, name, fn, params;\n node = parseNullishCoalescing(state);\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 node = new OperatorNode(name, fn, params);\n }\n return node;\n }\n\n /**\n * nullish coalescing operator\n * @return {Node} node\n * @private\n */\n function parseNullishCoalescing(state) {\n var node = parseLeftHandOperators(state);\n while (state.token === '??') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('??', 'nullish', [node, parseLeftHandOperators(state)]);\n }\n return node;\n }\n\n /**\n * Left hand operators: factorial x!, ctranspose x'\n * @return {Node} node\n * @private\n */\n function parseLeftHandOperators(state) {\n var node, name, fn, params;\n node = parseCustomNodes(state);\n var operators = {\n '!': 'factorial',\n '\\'': 'ctranspose'\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 return node;\n }\n\n /**\n * Parse a custom node handler. A node handler can be used to process\n * nodes in a custom way, for example for handling a plot.\n *\n * A handler must be passed as second argument of the parse function.\n * - must extend math.Node\n * - must contain a function _compile(defs: Object) : string\n * - must contain a function find(filter: Object) : Node[]\n * - must contain a function toString() : string\n * - the constructor is called with a single argument containing all parameters\n *\n * For example:\n *\n * nodes = {\n * 'plot': PlotHandler\n * }\n *\n * The constructor of the handler is called as:\n *\n * node = new PlotHandler(params)\n *\n * The handler will be invoked when evaluating an expression like:\n *\n * node = math.parse('plot(sin(x), x)', nodes)\n *\n * @return {Node} node\n * @private\n */\n function parseCustomNodes(state) {\n var params = [];\n if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n var CustomNode = state.extraNodes[state.token];\n getToken(state);\n\n // parse parameters\n if (state.token === '(') {\n params = [];\n openParams(state);\n getToken(state);\n if (state.token !== ')') {\n params.push(parseAssignment(state));\n\n // parse a list with parameters\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n closeParams(state);\n getToken(state);\n }\n\n // create a new custom node\n // noinspection JSValidateTypes\n return new CustomNode(params);\n }\n return parseSymbol(state);\n }\n\n /**\n * parse symbols: functions, variables, constants, units\n * @return {Node} node\n * @private\n */\n function parseSymbol(state) {\n var node, name;\n if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n name = state.token;\n getToken(state);\n if (hasOwnProperty(CONSTANTS, name)) {\n // true, false, null, ...\n node = new ConstantNode(CONSTANTS[name]);\n } else if (NUMERIC_CONSTANTS.includes(name)) {\n // NaN, Infinity\n node = new ConstantNode(numeric(name, 'number'));\n } else {\n node = new SymbolNode(name);\n }\n\n // parse function parameters and matrix index\n node = parseAccessors(state, node);\n return node;\n }\n return parseString(state);\n }\n\n /**\n * parse accessors:\n * - function invocation in round brackets (...), for example sqrt(2) or sqrt?.(2) with optional chaining\n * - index enclosed in square brackets [...], for example A[2,3] or A?.[2,3] with optional chaining\n * - dot notation for properties, like foo.bar or foo?.bar with optional chaining\n * @param {Object} state\n * @param {Node} node Node on which to apply the parameters. If there\n * are no parameters in the expression, the node\n * itself is returned\n * @param {string[]} [types] Filter the types of notations\n * can be ['(', '[', '.']\n * @return {Node} node\n * @private\n */\n function parseAccessors(state, node, types) {\n var params;\n\n // Iterate and handle chained accessors, including repeated optional chaining\n while (true) {\n // eslint-disable-line no-unmodified-loop-condition\n // Track whether an optional chaining operator precedes the next accessor\n var optional = false;\n\n // Consume an optional chaining operator if present\n if (state.token === '?.') {\n optional = true;\n // consume the '?.' token\n getToken(state);\n }\n var hasNextAccessor = (state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.includes(state.token));\n if (!(optional || hasNextAccessor)) {\n break;\n }\n params = [];\n if (state.token === '(') {\n if (optional || isSymbolNode(node) || isAccessorNode(node)) {\n // function invocation: fn(2, 3) or obj.fn(2, 3) or (anything)?.(2, 3)\n openParams(state);\n getToken(state);\n if (state.token !== ')') {\n params.push(parseAssignment(state));\n\n // parse a list with parameters\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n closeParams(state);\n getToken(state);\n node = new FunctionNode(node, params, optional);\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 if (state.token !== ']') {\n params.push(parseAssignment(state));\n\n // parse a list with parameters\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n if (state.token !== ']') {\n throw createSyntaxError(state, 'Parenthesis ] expected');\n }\n closeParams(state);\n getToken(state);\n node = new AccessorNode(node, new IndexNode(params), optional);\n } else {\n // dot notation like variable.prop\n // consume the `.` (if it was ?., already consumed):\n if (!optional) getToken(state);\n var isPropertyName = state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS;\n if (!isPropertyName) {\n var message = 'Property name expected after ';\n message += optional ? 'optional chain' : 'dot';\n throw createSyntaxError(state, message);\n }\n params.push(new ConstantNode(state.token));\n getToken(state);\n var dotNotation = true;\n node = new AccessorNode(node, new IndexNode(params, dotNotation), optional);\n }\n }\n return node;\n }\n\n /**\n * Parse a single or double quoted string.\n * @return {Node} node\n * @private\n */\n function parseString(state) {\n var node, str;\n if (state.token === '\"' || state.token === \"'\") {\n str = parseStringToken(state, state.token);\n\n // create constant\n node = new ConstantNode(str);\n\n // parse index parameters\n node = parseAccessors(state, node);\n return node;\n }\n return parseMatrix(state);\n }\n\n /**\n * Parse a string surrounded by single or double quotes\n * @param {Object} state\n * @param {\"'\" | \"\\\"\"} quote\n * @return {string}\n */\n function parseStringToken(state, quote) {\n var str = '';\n while (currentCharacter(state) !== '' && currentCharacter(state) !== quote) {\n if (currentCharacter(state) === '\\\\') {\n next(state);\n var char = currentCharacter(state);\n var escapeChar = ESCAPE_CHARACTERS[char];\n if (escapeChar !== undefined) {\n // an escaped control character like \\\" or \\n\n str += escapeChar;\n state.index += 1;\n } else if (char === 'u') {\n // escaped unicode character\n var unicode = state.expression.slice(state.index + 1, state.index + 5);\n if (/^[0-9A-Fa-f]{4}$/.test(unicode)) {\n // test whether the string holds four hexadecimal values\n str += String.fromCharCode(parseInt(unicode, 16));\n state.index += 5;\n } else {\n throw createSyntaxError(state, \"Invalid unicode character \\\\u\".concat(unicode));\n }\n } else {\n throw createSyntaxError(state, \"Bad escape character \\\\\".concat(char));\n }\n } else {\n // any regular character\n str += currentCharacter(state);\n next(state);\n }\n }\n getToken(state);\n if (state.token !== quote) {\n throw createSyntaxError(state, \"End of string \".concat(quote, \" expected\"));\n }\n getToken(state);\n return str;\n }\n\n /**\n * parse the matrix\n * @return {Node} node\n * @private\n */\n function parseMatrix(state) {\n var array, params, rows, cols;\n if (state.token === '[') {\n // matrix [...]\n openParams(state);\n getToken(state);\n if (state.token !== ']') {\n // this is a non-empty matrix\n var row = parseRow(state);\n if (state.token === ';') {\n // 2 dimensional array\n rows = 1;\n params = [row];\n\n // the rows of the matrix are separated by dot-comma's\n while (state.token === ';') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n if (state.token !== ']') {\n params[rows] = parseRow(state);\n rows++;\n }\n }\n if (state.token !== ']') {\n throw createSyntaxError(state, 'End of matrix ] expected');\n }\n closeParams(state);\n getToken(state);\n\n // check if the number of columns matches in all rows\n cols = params[0].items.length;\n for (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 array = new ArrayNode(params);\n } else {\n // 1 dimensional vector\n if (state.token !== ']') {\n throw createSyntaxError(state, 'End of matrix ] expected');\n }\n closeParams(state);\n getToken(state);\n array = row;\n }\n } else {\n // this is an empty matrix \"[ ]\"\n closeParams(state);\n getToken(state);\n array = new ArrayNode([]);\n }\n return parseAccessors(state, array);\n }\n return parseObject(state);\n }\n\n /**\n * Parse a single comma-separated row from a matrix, like 'a, b, c'\n * @return {ArrayNode} node\n */\n function parseRow(state) {\n var params = [parseAssignment(state)];\n var len = 1;\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n\n // parse expression\n if (state.token !== ']' && state.token !== ';') {\n params[len] = parseAssignment(state);\n len++;\n }\n }\n return new ArrayNode(params);\n }\n\n /**\n * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n * @return {Node} node\n * @private\n */\n function parseObject(state) {\n if (state.token === '{') {\n openParams(state);\n var key;\n var properties = {};\n do {\n getToken(state);\n if (state.token !== '}') {\n // parse key\n if (state.token === '\"' || state.token === \"'\") {\n key = parseStringToken(state, state.token);\n } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n key = state.token;\n getToken(state);\n } else {\n throw createSyntaxError(state, 'Symbol or string expected as object key');\n }\n\n // parse key/value separator\n if (state.token !== ':') {\n throw createSyntaxError(state, 'Colon : expected after object key');\n }\n getToken(state);\n\n // parse key\n properties[key] = parseAssignment(state);\n }\n } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n if (state.token !== '}') {\n throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n }\n closeParams(state);\n getToken(state);\n var node = new ObjectNode(properties);\n\n // parse index parameters\n node = parseAccessors(state, node);\n return node;\n }\n return parseNumber(state);\n }\n\n /**\n * parse a number\n * @return {Node} node\n * @private\n */\n function parseNumber(state) {\n var numberStr;\n if (state.tokenType === TOKENTYPE.NUMBER) {\n // this is a number\n numberStr = state.token;\n getToken(state);\n var numericType = safeNumberType(numberStr, config);\n var value = numeric(numberStr, numericType);\n return new ConstantNode(value);\n }\n return parseParentheses(state);\n }\n\n /**\n * parentheses\n * @return {Node} node\n * @private\n */\n function parseParentheses(state) {\n var node;\n\n // check if it is a parenthesized expression\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 closeParams(state);\n getToken(state);\n node = new ParenthesisNode(node);\n node = parseAccessors(state, node);\n return node;\n }\n return parseEnd(state);\n }\n\n /**\n * Evaluated when the expression is not yet ended but expected to end\n * @return {Node} res\n * @private\n */\n function parseEnd(state) {\n if (state.token === '') {\n // syntax error or unexpected end of expression\n throw createSyntaxError(state, 'Unexpected end of expression');\n } else {\n throw createSyntaxError(state, 'Value expected');\n }\n }\n\n /**\n * Shortcut for getting the current row value (one based)\n * Returns the line of the currently handled expression\n * @private\n */\n /* TODO: implement keeping track on the row number\n function row () {\n return null\n }\n */\n\n /**\n * Shortcut for getting the current col value (one based)\n * Returns the column (position) where the last state.token starts\n * @private\n */\n function col(state) {\n return state.index - state.token.length + 1;\n }\n\n /**\n * Create an error\n * @param {Object} state\n * @param {string} message\n * @return {SyntaxError} instantiated error\n * @private\n */\n function createSyntaxError(state, message) {\n var c = col(state);\n var error = new SyntaxError(message + ' (char ' + c + ')');\n error.char = c;\n return error;\n }\n\n /**\n * Create an error\n * @param {Object} state\n * @param {string} message\n * @return {Error} instantiated error\n * @private\n */\n function createError(state, message) {\n var c = col(state);\n var error = new SyntaxError(message + ' (char ' + c + ')');\n error.char = c;\n return error;\n }\n\n // Now that we can parse, automatically convert strings to Nodes by parsing\n typed.addConversion({\n from: 'string',\n to: 'Node',\n convert: parse\n });\n return parse;\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { createEmptyMap } from '../../utils/map.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 * Evaluate an expression.\n *\n * The expression parser does not use JavaScript. Its syntax is close\n * to JavaScript but more suited for mathematical expressions.\n * See [https://mathjs.org/docs/expressions/syntax.html](https://mathjs.org/docs/expressions/syntax.html) to learn\n * the syntax and get an overview of the exact differences from JavaScript.\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 = createEmptyMap();\n return parse(expr).compile().evaluate(scope);\n },\n 'string, Map | Object': function string_Map__Object(expr, scope) {\n return parse(expr).compile().evaluate(scope);\n },\n 'Array | Matrix': function Array__Matrix(expr) {\n var scope = createEmptyMap();\n return deepMap(expr, function (entry) {\n return parse(entry).compile().evaluate(scope);\n });\n },\n 'Array | Matrix, Map | Object': function Array__Matrix_Map__Object(expr, scope) {\n return deepMap(expr, function (entry) {\n return parse(entry).compile().evaluate(scope);\n });\n }\n });\n});","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'size';\nvar dependencies = ['typed'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n /**\n * Calculate the size of a matrix or scalar. Always returns an Array containing numbers.\n *\n * Note that in mathjs v14 and older, function size could return a Matrix depending on\n * the input type and configuration.\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).toArray()) // 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} A vector with size of `x`.\n */\n return typed(name, {\n Matrix: x => x.size(),\n Array: arraySize,\n string: x => [x.length],\n // scalar\n 'number | Complex | BigNumber | Unit | boolean | null': _x => []\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 * 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 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 return gamma(n.plus(1));\n },\n 'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))\n });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'isBounded';\nvar dependencies = ['typed'];\nexport var createIsBounded = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n /**\n * Test whether a value is bounded. For scalars, this test is equivalent\n * to the isFinite finiteness test. On the other hand, a Matrix or Array\n * is defined to be bounded if every entry is finite.\n *\n * Syntax:\n *\n * math.isBounded(x)\n *\n * Examples:\n *\n * math.isBounded(0) // returns true\n * math.isBounded(NaN) // returns false\n * math.isBounded(math.bignumber(Infinity)) // returns false\n * math.isBounded(math.fraction(1,3)) // returns true\n * math.isBounded(math.complex('2 - 4i')) // returns true\n * math.isBounded(-10000000000000000n) // returns true\n * math.isBounded(undefined) // returns false\n * math.isBounded(null) // returns false\n * math.isBounded([0.001, -3n, 0]) // returns true\n * math.isBounded([2, -Infinity, -3]) // returns false\n *\n * See also:\n *\n * isFinite, isNumeric, isPositive, isNegative, isNaN\n *\n * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x Value to be tested\n * @return {boolean} Returns true when `x` is bounded.\n */\n return typed(name, {\n number: n => Number.isFinite(n),\n 'BigNumber | Complex': x => x.isFinite(),\n 'bigint | Fraction': () => true,\n 'null | undefined': () => false,\n Unit: typed.referToSelf(self => x => self(x.value)),\n 'Array | Matrix': typed.referToSelf(self => A => {\n if (!Array.isArray(A)) A = A.valueOf();\n return A.every(entry => self(entry));\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 };\n\n // Load the conversion functions for each output type\n var validOutputTypes = {\n number: x => _number(x),\n BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n bigint: x => BigInt(x),\n Fraction: fraction ? x => fraction(x) : noFraction\n };\n\n /**\n * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.\n *\n * Syntax:\n *\n * math.numeric(x)\n * math.numeric(value, outputType)\n *\n * Examples:\n *\n * math.numeric('4') // returns 4\n * math.numeric('4', 'number') // returns 4\n * math.numeric('4', 'bigint') // returns 4n\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 0.4\n *\n * See also:\n *\n * number, fraction, bignumber, bigint, string, format\n *\n * @param {string | number | BigNumber | bigint | 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 | bigint | Fraction}\n * Returns an instance of the numeric in the requested type\n */\n return function numeric(value) {\n var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';\n var check = arguments.length > 2 ? arguments[2] : undefined;\n if (check !== undefined) {\n throw new SyntaxError('numeric() takes one or two arguments');\n }\n var inputType = typeOf(value);\n if (!(inputType in validInputTypes)) {\n throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '));\n }\n if (!(outputType in validOutputTypes)) {\n throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n }\n if (outputType === inputType) {\n return value;\n } else {\n return validOutputTypes[outputType](value);\n }\n };\n});","import { absNumber, acoshNumber, acosNumber, acothNumber, acotNumber, acschNumber, acscNumber, addNumber, andNumber, asechNumber, asecNumber, asinhNumber, asinNumber, atan2Number, atanhNumber, atanNumber, bitAndNumber, bitNotNumber, bitOrNumber, bitXorNumber, cbrtNumber, combinationsNumber, coshNumber, cosNumber, cothNumber, cotNumber, cschNumber, cscNumber, cubeNumber, divideNumber, expm1Number, expNumber, gammaNumber, gcdNumber, isIntegerNumber, isNaNNumber, isNegativeNumber, isPositiveNumber, isZeroNumber, lcmNumber, leftShiftNumber, lgammaNumber, log10Number, log1pNumber, log2Number, logNumber, modNumber, multiplyNumber, normNumber, notNumber, nthRootNumber, orNumber, powNumber, rightArithShiftNumber, rightLogShiftNumber, roundNumber, sechNumber, secNumber, signNumber, sinhNumber, sinNumber, sqrtNumber, squareNumber, subtractNumber, tanhNumber, tanNumber, unaryMinusNumber, unaryPlusNumber, xgcdNumber, xorNumber } from './plain/number/index.js';\nimport { factory } from './utils/factory.js';\nimport { noIndex, noMatrix, noSubset } from './utils/noop.js';\n\n// ----------------------------------------------------------------------------\n// classes and functions\n\n// core\nexport { createTyped } from './core/function/typed.js';\n\n// classes\nexport { createResultSet } from './type/resultset/ResultSet.js';\nexport { createRangeClass } from './type/matrix/Range.js';\nexport { createHelpClass } from './expression/Help.js';\nexport { createChainClass } from './type/chain/Chain.js';\nexport { createHelp } from './expression/function/help.js';\nexport { createChain } from './type/chain/function/chain.js';\n\n// algebra\nexport { createResolve } from './function/algebra/resolve.js';\nexport { createSimplify } from './function/algebra/simplify.js';\nexport { createSimplifyConstant } from './function/algebra/simplifyConstant.js';\nexport { createSimplifyCore } from './function/algebra/simplifyCore.js';\nexport { createDerivative } from './function/algebra/derivative.js';\nexport { createRationalize } from './function/algebra/rationalize.js';\n\n// arithmetic\nexport var createUnaryMinus = /* #__PURE__ */createNumberFactory('unaryMinus', unaryMinusNumber);\nexport var createUnaryPlus = /* #__PURE__ */createNumberFactory('unaryPlus', unaryPlusNumber);\nexport var createAbs = /* #__PURE__ */createNumberFactory('abs', absNumber);\nexport var createAddScalar = /* #__PURE__ */createNumberFactory('addScalar', addNumber);\nexport var createSubtractScalar = /* #__PURE__ */createNumberFactory('subtractScalar', subtractNumber);\nexport var createCbrt = /* #__PURE__ */createNumberFactory('cbrt', cbrtNumber);\nexport { createCeilNumber as createCeil } from './function/arithmetic/ceil.js';\nexport var createCube = /* #__PURE__ */createNumberFactory('cube', cubeNumber);\nexport var createExp = /* #__PURE__ */createNumberFactory('exp', expNumber);\nexport var createExpm1 = /* #__PURE__ */createNumberFactory('expm1', expm1Number);\nexport { createFixNumber as createFix } from './function/arithmetic/fix.js';\nexport { createFloorNumber as createFloor } from './function/arithmetic/floor.js';\nexport var createGcd = /* #__PURE__ */createNumberFactory('gcd', gcdNumber);\nexport var createLcm = /* #__PURE__ */createNumberFactory('lcm', lcmNumber);\nexport var createLog10 = /* #__PURE__ */createNumberFactory('log10', log10Number);\nexport var createLog2 = /* #__PURE__ */createNumberFactory('log2', log2Number);\nexport var createMod = /* #__PURE__ */createNumberFactory('mod', modNumber);\nexport var createMultiplyScalar = /* #__PURE__ */createNumberFactory('multiplyScalar', multiplyNumber);\nexport var createMultiply = /* #__PURE__ */createNumberFactory('multiply', multiplyNumber);\nexport var createNthRoot = /* #__PURE__ */\ncreateNumberOptionalSecondArgFactory('nthRoot', nthRootNumber);\nexport var createSign = /* #__PURE__ */createNumberFactory('sign', signNumber);\nexport var createSqrt = /* #__PURE__ */createNumberFactory('sqrt', sqrtNumber);\nexport var createSquare = /* #__PURE__ */createNumberFactory('square', squareNumber);\nexport var createSubtract = /* #__PURE__ */createNumberFactory('subtract', subtractNumber);\nexport var createXgcd = /* #__PURE__ */createNumberFactory('xgcd', xgcdNumber);\nexport var createDivideScalar = /* #__PURE__ */createNumberFactory('divideScalar', divideNumber);\nexport var createPow = /* #__PURE__ */createNumberFactory('pow', powNumber);\nexport var createRound = /* #__PURE__ */\ncreateNumberOptionalSecondArgFactory('round', roundNumber);\nexport var createLog = /* #__PURE__ */\ncreateNumberOptionalSecondArgFactory('log', logNumber);\nexport var createLog1p = /* #__PURE__ */createNumberFactory('log1p', log1pNumber);\nexport var createAdd = /* #__PURE__ */createNumberFactory('add', addNumber);\nexport { createHypot } from './function/arithmetic/hypot.js';\nexport var createNorm = /* #__PURE__ */createNumberFactory('norm', normNumber);\nexport var createDivide = /* #__PURE__ */createNumberFactory('divide', divideNumber);\n\n// bitwise\nexport var createBitAnd = /* #__PURE__ */createNumberFactory('bitAnd', bitAndNumber);\nexport var createBitNot = /* #__PURE__ */createNumberFactory('bitNot', bitNotNumber);\nexport var createBitOr = /* #__PURE__ */createNumberFactory('bitOr', bitOrNumber);\nexport var createBitXor = /* #__PURE__ */createNumberFactory('bitXor', bitXorNumber);\nexport var createLeftShift = /* #__PURE__ */createNumberFactory('leftShift', leftShiftNumber);\nexport var createRightArithShift = /* #__PURE__ */createNumberFactory('rightArithShift', rightArithShiftNumber);\nexport var createRightLogShift = /* #__PURE__ */createNumberFactory('rightLogShift', rightLogShiftNumber);\n\n// combinatorics\nexport { createStirlingS2 } from './function/combinatorics/stirlingS2.js';\nexport { createBellNumbers } from './function/combinatorics/bellNumbers.js';\nexport { createCatalan } from './function/combinatorics/catalan.js';\nexport { createComposition } from './function/combinatorics/composition.js';\n\n// constants\nexport { createE, createUppercaseE, createFalse,\n// createI,\ncreateInfinity, createLN10, createLN2, createLOG10E, createLOG2E, createNaN, createNull, createPhi, createPi, createUppercasePi, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSQRT2, createTau, createTrue, createVersion } from './constants.js';\n\n// create\nexport { createNumber } from './type/number.js';\nexport { createBigint } from './type/bigint.js';\nexport { createString } from './type/string.js';\nexport { createBoolean } from './type/boolean.js';\nexport { createParser } from './expression/function/parser.js';\n\n// expression\nexport { createNode } from './expression/node/Node.js';\nexport { createAccessorNode } from './expression/node/AccessorNode.js';\nexport { createArrayNode } from './expression/node/ArrayNode.js';\nexport { createAssignmentNode } from './expression/node/AssignmentNode.js';\nexport { createBlockNode } from './expression/node/BlockNode.js';\nexport { createConditionalNode } from './expression/node/ConditionalNode.js';\nexport { createConstantNode } from './expression/node/ConstantNode.js';\nexport { createFunctionAssignmentNode } from './expression/node/FunctionAssignmentNode.js';\nexport { createIndexNode } from './expression/node/IndexNode.js';\nexport { createObjectNode } from './expression/node/ObjectNode.js';\nexport { createOperatorNode } from './expression/node/OperatorNode.js';\nexport { createParenthesisNode } from './expression/node/ParenthesisNode.js';\nexport { createRangeNode } from './expression/node/RangeNode.js';\nexport { createRelationalNode } from './expression/node/RelationalNode.js';\nexport { createSymbolNode } from './expression/node/SymbolNode.js';\nexport { createFunctionNode } from './expression/node/FunctionNode.js';\nexport { createParse } from './expression/parse.js';\nexport { createCompile } from './expression/function/compile.js';\nexport { createEvaluate } from './expression/function/evaluate.js';\nexport { createParserClass } from './expression/Parser.js';\n\n// logical\nexport var createAnd = /* #__PURE__ */createNumberFactory('and', andNumber);\nexport var createNot = /* #__PURE__ */createNumberFactory('not', notNumber);\nexport var createOr = /* #__PURE__ */createNumberFactory('or', orNumber);\nexport var createXor = /* #__PURE__ */createNumberFactory('xor', xorNumber);\n\n// matrix\nexport { createMapSlices } from './function/matrix/mapSlices.js';\nexport { createFilter } from './function/matrix/filter.js';\nexport { createForEach } from './function/matrix/forEach.js';\nexport { createMap } from './function/matrix/map.js';\nexport { createRange } from './function/matrix/range.js';\nexport { createSize } from './function/matrix/size.js';\n// FIXME: create a lightweight \"number\" implementation of subset only supporting plain objects/arrays\nexport var createIndex = /* #__PURE__ */factory('index', [], () => noIndex);\nexport var createMatrix = /* #__PURE__ */factory('matrix', [], () => noMatrix); // FIXME: needed now because subset transform needs it. Remove the need for it in subset\nexport var createSubset = /* #__PURE__ */factory('subset', [], () => noSubset);\n// TODO: provide number+array implementations for map, filter, forEach, zeros, ...?\n// TODO: create range implementation for range?\nexport { createPartitionSelect } from './function/matrix/partitionSelect.js';\n\n// probability\nexport { createBernoulli } from './function/probability/bernoulli.js';\nexport var createCombinations = createNumberFactory('combinations', combinationsNumber);\nexport var createGamma = createNumberFactory('gamma', gammaNumber);\nexport var createLgamma = createNumberFactory('lgamma', lgammaNumber);\nexport { createCombinationsWithRep } from './function/probability/combinationsWithRep.js';\nexport { createFactorial } from './function/probability/factorial.js';\nexport { createMultinomial } from './function/probability/multinomial.js';\nexport { createPermutations } from './function/probability/permutations.js';\nexport { createPickRandom } from './function/probability/pickRandom.js';\nexport { createRandomNumber as createRandom } from './function/probability/random.js';\nexport { createRandomInt } from './function/probability/randomInt.js';\n\n// relational\nexport { createEqualScalarNumber as createEqualScalar } from './function/relational/equalScalar.js';\nexport { createCompareNumber as createCompare } from './function/relational/compare.js';\nexport { createCompareNatural } from './function/relational/compareNatural.js';\nexport { createCompareTextNumber as createCompareText } from './function/relational/compareText.js';\nexport { createEqualNumber as createEqual } from './function/relational/equal.js';\nexport { createEqualText } from './function/relational/equalText.js';\nexport { createSmallerNumber as createSmaller } from './function/relational/smaller.js';\nexport { createSmallerEqNumber as createSmallerEq } from './function/relational/smallerEq.js';\nexport { createLargerNumber as createLarger } from './function/relational/larger.js';\nexport { createLargerEqNumber as createLargerEq } from './function/relational/largerEq.js';\nexport { createDeepEqual } from './function/relational/deepEqual.js';\nexport { createUnequalNumber as createUnequal } from './function/relational/unequal.js';\n\n// special\nexport { createErf } from './function/special/erf.js';\nexport { createZeta } from './function/special/zeta.js';\n// statistics\nexport { createMode } from './function/statistics/mode.js';\nexport { createProd } from './function/statistics/prod.js';\nexport { createMax } from './function/statistics/max.js';\nexport { createMin } from './function/statistics/min.js';\nexport { createSum } from './function/statistics/sum.js';\nexport { createCumSum } from './function/statistics/cumsum.js';\nexport { createMean } from './function/statistics/mean.js';\nexport { createMedian } from './function/statistics/median.js';\nexport { createMad } from './function/statistics/mad.js';\nexport { createVariance } from './function/statistics/variance.js';\nexport { createQuantileSeq } from './function/statistics/quantileSeq.js';\nexport { createStd } from './function/statistics/std.js';\nexport { createCorr } from './function/statistics/corr.js';\n\n// string\nexport { createFormat } from './function/string/format.js';\nexport { createPrint } from './function/string/print.js';\n\n// trigonometry\nexport var createAcos = /* #__PURE__ */createNumberFactory('acos', acosNumber);\nexport var createAcosh = /* #__PURE__ */createNumberFactory('acosh', acoshNumber);\nexport var createAcot = /* #__PURE__ */createNumberFactory('acot', acotNumber);\nexport var createAcoth = /* #__PURE__ */createNumberFactory('acoth', acothNumber);\nexport var createAcsc = /* #__PURE__ */createNumberFactory('acsc', acscNumber);\nexport var createAcsch = /* #__PURE__ */createNumberFactory('acsch', acschNumber);\nexport var createAsec = /* #__PURE__ */createNumberFactory('asec', asecNumber);\nexport var createAsech = /* #__PURE__ */createNumberFactory('asech', asechNumber);\nexport var createAsin = /* #__PURE__ */createNumberFactory('asin', asinNumber);\nexport var createAsinh = /* #__PURE__ */createNumberFactory('asinh', asinhNumber);\nexport var createAtan = /* #__PURE__ */createNumberFactory('atan', atanNumber);\nexport var createAtan2 = /* #__PURE__ */createNumberFactory('atan2', atan2Number);\nexport var createAtanh = /* #__PURE__ */createNumberFactory('atanh', atanhNumber);\nexport var createCos = /* #__PURE__ */createNumberFactory('cos', cosNumber);\nexport var createCosh = /* #__PURE__ */createNumberFactory('cosh', coshNumber);\nexport var createCot = /* #__PURE__ */createNumberFactory('cot', cotNumber);\nexport var createCoth = /* #__PURE__ */createNumberFactory('coth', cothNumber);\nexport var createCsc = /* #__PURE__ */createNumberFactory('csc', cscNumber);\nexport var createCsch = /* #__PURE__ */createNumberFactory('csch', cschNumber);\nexport var createSec = /* #__PURE__ */createNumberFactory('sec', secNumber);\nexport var createSech = /* #__PURE__ */createNumberFactory('sech', sechNumber);\nexport var createSin = /* #__PURE__ */createNumberFactory('sin', sinNumber);\nexport var createSinh = /* #__PURE__ */createNumberFactory('sinh', sinhNumber);\nexport var createTan = /* #__PURE__ */createNumberFactory('tan', tanNumber);\nexport var createTanh = /* #__PURE__ */createNumberFactory('tanh', tanhNumber);\n\n// transforms\nexport { createMapSlicesTransform } from './expression/transform/mapSlices.transform.js';\nexport { createFilterTransform } from './expression/transform/filter.transform.js';\nexport { createForEachTransform } from './expression/transform/forEach.transform.js';\nexport { createMapTransform } from './expression/transform/map.transform.js';\nexport { createMaxTransform } from './expression/transform/max.transform.js';\nexport { createMeanTransform } from './expression/transform/mean.transform.js';\nexport { createMinTransform } from './expression/transform/min.transform.js';\nexport { createRangeTransform } from './expression/transform/range.transform.js';\nexport var createSubsetTransform = /* #__PURE__ */factory('subset', [], () => noSubset, {\n isTransformFunction: true\n});\nexport { createStdTransform } from './expression/transform/std.transform.js';\nexport { createSumTransform } from './expression/transform/sum.transform.js';\nexport { createCumSumTransform } from './expression/transform/cumsum.transform.js';\nexport { createVarianceTransform } from './expression/transform/variance.transform.js';\n\n// utils\nexport { createClone } from './function/utils/clone.js';\nexport var createIsInteger = /* #__PURE__ */createNumberFactory('isInteger', isIntegerNumber);\nexport var createIsNegative = /* #__PURE__ */createNumberFactory('isNegative', isNegativeNumber);\nexport { createIsNumeric } from './function/utils/isNumeric.js';\nexport { createHasNumericValue } from './function/utils/hasNumericValue.js';\nexport var createIsPositive = /* #__PURE__ */createNumberFactory('isPositive', isPositiveNumber);\nexport var createIsZero = /* #__PURE__ */createNumberFactory('isZero', isZeroNumber);\nexport var createIsNaN = /* #__PURE__ */createNumberFactory('isNaN', isNaNNumber);\nexport { createIsBounded } from './function/utils/isBounded.js';\nexport { createIsFinite } from './function/utils/isFinite.js';\nexport { createTypeOf } from './function/utils/typeOf.js';\nexport { createIsPrime } from './function/utils/isPrime.js';\nexport { createNumeric } from './function/utils/numeric.js';\n\n// json\nexport { createReviver } from './json/reviver.js';\nexport { createReplacer } from './json/replacer.js';\n\n// helper functions to create a factory function for a function which only needs typed-function\nfunction createNumberFactory(name, fn) {\n return factory(name, ['typed'], _ref => {\n var {\n typed\n } = _ref;\n return typed(fn);\n });\n}\nfunction createNumberOptionalSecondArgFactory(name, fn) {\n return factory(name, ['typed'], _ref2 => {\n var {\n typed\n } = _ref2;\n return typed({\n number: fn,\n 'number,number': fn\n });\n });\n}","/**\n * Create a syntax error with the message:\n * 'Wrong number of arguments in function ( provided, - 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 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;","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createTyped } from '../../factoriesNumber.js';\nexport var typedDependencies = {\n createTyped\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAbs } from '../../factoriesNumber.js';\nexport var absDependencies = {\n typedDependencies,\n createAbs\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createNode } from '../../factoriesNumber.js';\nexport var NodeDependencies = {\n createNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createSubset } from '../../factoriesNumber.js';\nexport var subsetDependencies = {\n createSubset\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { subsetDependencies } from './dependenciesSubset.generated.js';\nimport { createAccessorNode } from '../../factoriesNumber.js';\nexport var AccessorNodeDependencies = {\n NodeDependencies,\n subsetDependencies,\n createAccessorNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAdd } from '../../factoriesNumber.js';\nexport var addDependencies = {\n typedDependencies,\n createAdd\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createArrayNode } from '../../factoriesNumber.js';\nexport var ArrayNodeDependencies = {\n NodeDependencies,\n createArrayNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createMatrix } from '../../factoriesNumber.js';\nexport var matrixDependencies = {\n createMatrix\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { subsetDependencies } from './dependenciesSubset.generated.js';\nimport { createAssignmentNode } from '../../factoriesNumber.js';\nexport var AssignmentNodeDependencies = {\n matrixDependencies,\n NodeDependencies,\n subsetDependencies,\n createAssignmentNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createGamma } from '../../factoriesNumber.js';\nexport var gammaDependencies = {\n typedDependencies,\n createGamma\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { gammaDependencies } from './dependenciesGamma.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFactorial } from '../../factoriesNumber.js';\nexport var factorialDependencies = {\n gammaDependencies,\n typedDependencies,\n createFactorial\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createNumber } from '../../factoriesNumber.js';\nexport var numberDependencies = {\n typedDependencies,\n createNumber\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createPow } from '../../factoriesNumber.js';\nexport var powDependencies = {\n typedDependencies,\n createPow\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createResultSet } from '../../factoriesNumber.js';\nexport var ResultSetDependencies = {\n createResultSet\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { ResultSetDependencies } from './dependenciesResultSet.generated.js';\nimport { createBlockNode } from '../../factoriesNumber.js';\nexport var BlockNodeDependencies = {\n NodeDependencies,\n ResultSetDependencies,\n createBlockNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createRound } from '../../factoriesNumber.js';\nexport var roundDependencies = {\n typedDependencies,\n createRound\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createConditionalNode } from '../../factoriesNumber.js';\nexport var ConditionalNodeDependencies = {\n NodeDependencies,\n createConditionalNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createIsBounded } from '../../factoriesNumber.js';\nexport var isBoundedDependencies = {\n typedDependencies,\n createIsBounded\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { isBoundedDependencies } from './dependenciesIsBounded.generated.js';\nimport { createConstantNode } from '../../factoriesNumber.js';\nexport var ConstantNodeDependencies = {\n NodeDependencies,\n isBoundedDependencies,\n createConstantNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFunctionAssignmentNode } from '../../factoriesNumber.js';\nexport var FunctionAssignmentNodeDependencies = {\n NodeDependencies,\n typedDependencies,\n createFunctionAssignmentNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createSymbolNode } from '../../factoriesNumber.js';\nexport var SymbolNodeDependencies = {\n NodeDependencies,\n createSymbolNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';\nimport { createFunctionNode } from '../../factoriesNumber.js';\nexport var FunctionNodeDependencies = {\n NodeDependencies,\n SymbolNodeDependencies,\n createFunctionNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSize } from '../../factoriesNumber.js';\nexport var sizeDependencies = {\n typedDependencies,\n createSize\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { sizeDependencies } from './dependenciesSize.generated.js';\nimport { createIndexNode } from '../../factoriesNumber.js';\nexport var IndexNodeDependencies = {\n NodeDependencies,\n sizeDependencies,\n createIndexNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createObjectNode } from '../../factoriesNumber.js';\nexport var ObjectNodeDependencies = {\n NodeDependencies,\n createObjectNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createOperatorNode } from '../../factoriesNumber.js';\nexport var OperatorNodeDependencies = {\n NodeDependencies,\n createOperatorNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createParenthesisNode } from '../../factoriesNumber.js';\nexport var ParenthesisNodeDependencies = {\n NodeDependencies,\n createParenthesisNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createRangeNode } from '../../factoriesNumber.js';\nexport var RangeNodeDependencies = {\n NodeDependencies,\n createRangeNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createRelationalNode } from '../../factoriesNumber.js';\nexport var RelationalNodeDependencies = {\n NodeDependencies,\n createRelationalNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { numberDependencies } from './dependenciesNumber.generated.js';\nimport { createNumeric } from '../../factoriesNumber.js';\nexport var numericDependencies = {\n numberDependencies,\n createNumeric\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';\nimport { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';\nimport { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';\nimport { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';\nimport { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';\nimport { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';\nimport { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';\nimport { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';\nimport { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';\nimport { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';\nimport { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';\nimport { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';\nimport { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';\nimport { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';\nimport { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';\nimport { numericDependencies } from './dependenciesNumeric.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createParse } from '../../factoriesNumber.js';\nexport var parseDependencies = {\n AccessorNodeDependencies,\n ArrayNodeDependencies,\n AssignmentNodeDependencies,\n BlockNodeDependencies,\n ConditionalNodeDependencies,\n ConstantNodeDependencies,\n FunctionAssignmentNodeDependencies,\n FunctionNodeDependencies,\n IndexNodeDependencies,\n ObjectNodeDependencies,\n OperatorNodeDependencies,\n ParenthesisNodeDependencies,\n RangeNodeDependencies,\n RelationalNodeDependencies,\n SymbolNodeDependencies,\n numericDependencies,\n typedDependencies,\n createParse\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createDivide } from '../../factoriesNumber.js';\nexport var divideDependencies = {\n typedDependencies,\n createDivide\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMultiply } from '../../factoriesNumber.js';\nexport var multiplyDependencies = {\n typedDependencies,\n createMultiply\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSqrt } from '../../factoriesNumber.js';\nexport var sqrtDependencies = {\n typedDependencies,\n createSqrt\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSubtract } from '../../factoriesNumber.js';\nexport var subtractDependencies = {\n typedDependencies,\n createSubtract\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createE } from '../../factoriesNumber.js';\nexport var eDependencies = {\n createE\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { parseDependencies } from './dependenciesParse.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createEvaluate } from '../../factoriesNumber.js';\nexport var evaluateDependencies = {\n parseDependencies,\n typedDependencies,\n createEvaluate\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createExp } from '../../factoriesNumber.js';\nexport var expDependencies = {\n typedDependencies,\n createExp\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createGcd } from '../../factoriesNumber.js';\nexport var gcdDependencies = {\n typedDependencies,\n createGcd\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLcm } from '../../factoriesNumber.js';\nexport var lcmDependencies = {\n typedDependencies,\n createLcm\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog } from '../../factoriesNumber.js';\nexport var logDependencies = {\n typedDependencies,\n createLog\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog10 } from '../../factoriesNumber.js';\nexport var log10Dependencies = {\n typedDependencies,\n createLog10\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog1p } from '../../factoriesNumber.js';\nexport var log1pDependencies = {\n typedDependencies,\n createLog1p\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog2 } from '../../factoriesNumber.js';\nexport var log2Dependencies = {\n typedDependencies,\n createLog2\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMod } from '../../factoriesNumber.js';\nexport var modDependencies = {\n typedDependencies,\n createMod\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createNthRoot } from '../../factoriesNumber.js';\nexport var nthRootDependencies = {\n typedDependencies,\n createNthRoot\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createPi } from '../../factoriesNumber.js';\nexport var piDependencies = {\n createPi\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSign } from '../../factoriesNumber.js';\nexport var signDependencies = {\n typedDependencies,\n createSign\n};","function E () {\n // Keep this empty so it's easier to inherit from\n // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n on: function (name, callback, ctx) {\n var e = this.e || (this.e = {});\n\n (e[name] || (e[name] = [])).push({\n fn: callback,\n ctx: ctx\n });\n\n return this;\n },\n\n once: function (name, callback, ctx) {\n var self = this;\n function listener () {\n self.off(name, listener);\n callback.apply(ctx, arguments);\n };\n\n listener._ = callback\n return this.on(name, listener, ctx);\n },\n\n emit: function (name) {\n var data = [].slice.call(arguments, 1);\n var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n var i = 0;\n var len = evtArr.length;\n\n for (i; i < len; i++) {\n evtArr[i].fn.apply(evtArr[i].ctx, data);\n }\n\n return this;\n },\n\n off: function (name, callback) {\n var e = this.e || (this.e = {});\n var evts = e[name];\n var liveEvents = [];\n\n if (evts && callback) {\n for (var i = 0, len = evts.length; i < len; i++) {\n if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n liveEvents.push(evts[i]);\n }\n }\n\n // Remove event from queue to prevent memory leak\n // Suggested by https://github.com/lazd\n // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n (liveEvents.length)\n ? e[name] = liveEvents\n : delete e[name];\n\n return this;\n }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n","import Emitter from 'tiny-emitter';\n\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\nexport function mixin(obj) {\n // create event emitter\n var emitter = new Emitter();\n\n // bind methods to obj (we don't want to expose the emitter.e Array...)\n obj.on = emitter.on.bind(emitter);\n obj.off = emitter.off.bind(emitter);\n obj.once = emitter.once.bind(emitter);\n obj.emit = emitter.emit.bind(emitter);\n return obj;\n}","import { isBigNumber, isComplex, isFraction, isMatrix, isObject, isUnit } from '../../utils/is.js';\nimport { isFactory, stripOptionalNotation } from '../../utils/factory.js';\nimport { hasOwnProperty, lazy } from '../../utils/object.js';\nimport { ArgumentsError } from '../../error/ArgumentsError.js';\nexport function importFactory(typed, load, math, importedFactories) {\n /**\n * Import functions from an object or a module.\n *\n * This function is only available on a mathjs instance created using `create`.\n *\n * Syntax:\n *\n * math.import(functions)\n * math.import(functions, options)\n *\n * Where:\n *\n * - `functions: Object`\n * An object with functions or factories to be imported.\n * - `options: Object` An object with import options. Available options:\n * - `override: boolean`\n * If true, existing functions will be overwritten. False by default.\n * - `silent: boolean`\n * If true, the function will not throw errors on duplicates or invalid\n * types. False by default.\n * - `wrap: boolean`\n * If true, the functions will be wrapped in a wrapper function\n * which converts data types like Matrix to primitive data types like Array.\n * The wrapper is needed when extending math.js with libraries which do not\n * support these data type. False by default.\n *\n * Examples:\n *\n * import { create, all } from 'mathjs'\n * import * as numbers from 'numbers'\n *\n * // create a mathjs instance\n * const math = create(all)\n *\n * // define new functions and variables\n * math.import({\n * myvalue: 42,\n * hello: function (name) {\n * return 'hello, ' + name + '!'\n * }\n * })\n *\n * // use the imported function and variable\n * math.myvalue * 2 // 84\n * math.hello('user') // 'hello, user!'\n *\n * // import the npm module 'numbers'\n * // (must be installed first with `npm install numbers`)\n * math.import(numbers, {wrap: true})\n *\n * math.fibonacci(7) // returns 13\n *\n * @param {Object | Array} functions Object with functions to be imported.\n * @param {Object} [options] Import options.\n */\n function mathImport(functions, options) {\n var num = arguments.length;\n if (num !== 1 && num !== 2) {\n throw new ArgumentsError('import', num, 1, 2);\n }\n if (!options) {\n options = {};\n }\n function flattenImports(flatValues, value, name) {\n if (Array.isArray(value)) {\n value.forEach(item => flattenImports(flatValues, item));\n } else if (isObject(value) || isModule(value)) {\n for (var _name in value) {\n if (hasOwnProperty(value, _name)) {\n flattenImports(flatValues, value[_name], _name);\n }\n }\n } else if (isFactory(value) || name !== undefined) {\n var flatName = isFactory(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly\n : value.fn : name;\n\n // we allow importing the same function twice if it points to the same implementation\n if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {\n throw new Error('Cannot import \"' + flatName + '\" twice');\n }\n flatValues[flatName] = value;\n } else {\n if (!options.silent) {\n throw new TypeError('Factory, Object, or Array expected');\n }\n }\n }\n var flatValues = {};\n flattenImports(flatValues, functions);\n for (var name in flatValues) {\n if (hasOwnProperty(flatValues, name)) {\n // console.log('import', name)\n var value = flatValues[name];\n if (isFactory(value)) {\n // we ignore name here and enforce the name of the factory\n // maybe at some point we do want to allow overriding it\n // in that case we can implement an option overrideFactoryNames: true\n _importFactory(value, options);\n } else if (isSupportedType(value)) {\n _import(name, value, options);\n } else {\n if (!options.silent) {\n throw new TypeError('Factory, Object, or Array expected');\n }\n }\n }\n }\n }\n\n /**\n * Add a property to the math namespace\n * @param {string} name\n * @param {*} value\n * @param {Object} options See import for a description of the options\n * @private\n */\n function _import(name, value, options) {\n var _math$Unit;\n // TODO: refactor this function, it's to complicated and contains duplicate code\n if (options.wrap && typeof value === 'function') {\n // create a wrapper around the function\n value = _wrap(value);\n }\n\n // turn a plain function with a typed-function signature into a typed-function\n if (hasTypedFunctionSignature(value)) {\n value = typed(name, {\n [value.signature]: value\n });\n }\n if (typed.isTypedFunction(math[name]) && typed.isTypedFunction(value)) {\n if (options.override) {\n // give the typed function the right name\n value = typed(name, value.signatures);\n } else {\n // merge the existing and typed function\n value = typed(math[name], value);\n }\n math[name] = value;\n delete importedFactories[name];\n _importTransform(name, value);\n math.emit('import', name, function resolver() {\n return value;\n });\n return;\n }\n var isDefined = math[name] !== undefined;\n var isValuelessUnit = (_math$Unit = math.Unit) === null || _math$Unit === void 0 ? void 0 : _math$Unit.isValuelessUnit(name);\n if (!isDefined && !isValuelessUnit || options.override) {\n math[name] = value;\n delete importedFactories[name];\n _importTransform(name, value);\n math.emit('import', name, function resolver() {\n return value;\n });\n return;\n }\n if (!options.silent) {\n throw new Error('Cannot import \"' + name + '\": already exists');\n }\n }\n function _importTransform(name, value) {\n if (value && typeof value.transform === 'function') {\n math.expression.transform[name] = value.transform;\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = value.transform;\n }\n } else {\n // remove existing transform\n delete math.expression.transform[name];\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = value;\n }\n }\n }\n function _deleteTransform(name) {\n delete math.expression.transform[name];\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = math[name];\n } else {\n delete math.expression.mathWithTransform[name];\n }\n }\n\n /**\n * Create a wrapper a round an function which converts the arguments\n * to their primitive values (like convert a Matrix to Array)\n * @param {Function} fn\n * @return {Function} Returns the wrapped function\n * @private\n */\n function _wrap(fn) {\n var wrapper = function wrapper() {\n var args = [];\n for (var i = 0, len = arguments.length; i < len; i++) {\n var arg = arguments[i];\n args[i] = arg && arg.valueOf();\n }\n return fn.apply(math, args);\n };\n if (fn.transform) {\n wrapper.transform = fn.transform;\n }\n return wrapper;\n }\n\n /**\n * Import an instance of a factory into math.js\n * @param {function(scope: object)} factory\n * @param {Object} options See import for a description of the options\n * @param {string} [name=factory.name] Optional custom name\n * @private\n */\n function _importFactory(factory, options) {\n var _factory$meta$formerl, _factory$meta;\n var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;\n if (name.includes('.')) {\n throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));\n }\n var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;\n var existingTransform = name in math.expression.transform;\n var existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined;\n var resolver = function resolver() {\n // collect all dependencies, handle finding both functions and classes and other special cases\n var dependencies = {};\n factory.dependencies.map(stripOptionalNotation).forEach(dependency => {\n if (dependency.includes('.')) {\n throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));\n }\n if (dependency === 'math') {\n dependencies.math = math;\n } else if (dependency === 'mathWithTransform') {\n dependencies.mathWithTransform = math.expression.mathWithTransform;\n } else if (dependency === 'classes') {\n // special case for json reviver\n dependencies.classes = math;\n } else {\n dependencies[dependency] = math[dependency];\n }\n });\n var instance = /* #__PURE__ */factory(dependencies);\n if (instance && typeof instance.transform === 'function') {\n throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with export const path = \"expression.transform\"');\n }\n if (existing === undefined || options.override) {\n return instance;\n }\n if (typed.isTypedFunction(existing) && typed.isTypedFunction(instance)) {\n // merge the existing and new typed function\n return typed(existing, instance);\n }\n if (options.silent) {\n // keep existing, ignore imported function\n return existing;\n } else {\n throw new Error('Cannot import \"' + name + '\": already exists');\n }\n };\n var former = (_factory$meta$formerl = (_factory$meta = factory.meta) === null || _factory$meta === void 0 ? void 0 : _factory$meta.formerly) !== null && _factory$meta$formerl !== void 0 ? _factory$meta$formerl : '';\n var needsTransform = isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory);\n var withTransform = math.expression.mathWithTransform;\n\n // TODO: add unit test with non-lazy factory\n if (!factory.meta || factory.meta.lazy !== false) {\n lazy(namespace, name, resolver);\n if (former) lazy(namespace, former, resolver);\n\n // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n if (existing && existingTransform) {\n _deleteTransform(name);\n if (former) _deleteTransform(former);\n } else {\n if (needsTransform) {\n lazy(withTransform, name, () => namespace[name]);\n if (former) lazy(withTransform, former, () => namespace[name]);\n }\n }\n } else {\n namespace[name] = resolver();\n if (former) namespace[former] = namespace[name];\n\n // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n if (existing && existingTransform) {\n _deleteTransform(name);\n if (former) _deleteTransform(former);\n } else {\n if (needsTransform) {\n lazy(withTransform, name, () => namespace[name]);\n if (former) lazy(withTransform, former, () => namespace[name]);\n }\n }\n }\n\n // TODO: improve factories, store a list with imports instead which can be re-played\n importedFactories[name] = factory;\n math.emit('import', name, resolver);\n }\n\n /**\n * Check whether given object is a type which can be imported\n * @param {Function | number | string | boolean | null | Unit | Complex} object\n * @return {boolean}\n * @private\n */\n function isSupportedType(object) {\n return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || isUnit(object) || isComplex(object) || isBigNumber(object) || isFraction(object) || isMatrix(object) || Array.isArray(object);\n }\n function isModule(object) {\n return typeof object === 'object' && object[Symbol.toStringTag] === 'Module';\n }\n function hasTypedFunctionSignature(fn) {\n return typeof fn === 'function' && typeof fn.signature === 'string';\n }\n function allowedInExpressions(name) {\n return !hasOwnProperty(unsafe, name);\n }\n function factoryAllowedInExpressions(factory) {\n return !factory.fn.includes('.') &&\n // FIXME: make checking on path redundant, check on meta data instead\n !hasOwnProperty(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);\n }\n function isTransformFunctionFactory(factory) {\n return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;\n }\n\n // namespaces and functions not available in the parser for safety reasons\n var unsafe = {\n expression: true,\n type: true,\n docs: true,\n error: true,\n json: true,\n chain: true // chain method not supported. Note that there is a unit chain too.\n };\n return mathImport;\n}","import _extends from \"@babel/runtime/helpers/extends\";\nimport typedFunction from 'typed-function';\nimport { ArgumentsError } from '../error/ArgumentsError.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { factory, isFactory } from '../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isObjectWrappingMap, isOperatorNode, isParenthesisNode, isPartitionedMap, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../utils/is.js';\nimport { deepFlatten, isLegacyFactory } from '../utils/object.js';\nimport * as emitter from './../utils/emitter.js';\nimport { DEFAULT_CONFIG } from './config.js';\nimport { configFactory } from './function/config.js';\nimport { importFactory } from './function/import.js';\n\n/**\n * Create a mathjs instance from given factory functions and optionally config\n *\n * Usage:\n *\n * const mathjs1 = create({ createAdd, createMultiply, ...})\n * const config = { number: 'BigNumber' }\n * const mathjs2 = create(all, config)\n *\n * @param {Object} [factories] An object with factory functions\n * The object can contain nested objects,\n * all nested objects will be flattened.\n * @param {Object} [config] Available options:\n * {number} relTol\n * Minimum relative difference between two\n * compared values, used by all comparison functions.\n * {number} absTol\n * Minimum absolute difference between two\n * compared values, used by all comparison functions.\n * {string} matrix\n * A string 'Matrix' (default) or 'Array'.\n * {string} number\n * A string 'number' (default), 'BigNumber', or 'Fraction'\n * {number} precision\n * The number of significant digits for BigNumbers.\n * Not applicable for Numbers.\n * {boolean} predictable\n * Predictable output type of functions. When true,\n * output type depends only on the input types. When\n * false (default), output type can vary depending\n * on input values. For example `math.sqrt(-4)`\n * returns `complex('2i')` when predictable is false, and\n * returns `NaN` when true.\n * {string} randomSeed\n * Random seed for seeded pseudo random number generator.\n * Set to null to randomly seed.\n * @returns {Object} Returns a bare-bone math.js instance containing\n * functions:\n * - `import` to add new functions\n * - `config` to change configuration\n * - `on`, `off`, `once`, `emit` for events\n */\nexport function create(factories, config) {\n var configInternal = _extends({}, DEFAULT_CONFIG, config);\n\n // simple test for ES5 support\n if (typeof Object.create !== 'function') {\n throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');\n }\n\n // create the mathjs instance\n var math = emitter.mixin({\n // only here for backward compatibility for legacy factory functions\n isNumber,\n isComplex,\n isBigNumber,\n isBigInt,\n isFraction,\n isUnit,\n isString,\n isArray,\n isMatrix,\n isCollection,\n isDenseMatrix,\n isSparseMatrix,\n isRange,\n isIndex,\n isBoolean,\n isResultSet,\n isHelp,\n isFunction,\n isDate,\n isRegExp,\n isObject,\n isMap,\n isPartitionedMap,\n isObjectWrappingMap,\n isNull,\n isUndefined,\n isAccessorNode,\n isArrayNode,\n isAssignmentNode,\n isBlockNode,\n isConditionalNode,\n isConstantNode,\n isFunctionAssignmentNode,\n isFunctionNode,\n isIndexNode,\n isNode,\n isObjectNode,\n isOperatorNode,\n isParenthesisNode,\n isRangeNode,\n isRelationalNode,\n isSymbolNode,\n isChain\n });\n\n // load config function and apply provided config\n math.config = configFactory(configInternal, math.emit);\n math.expression = {\n transform: {},\n mathWithTransform: {\n config: math.config\n }\n };\n\n // cached factories and instances used by function load\n var legacyFactories = [];\n var legacyInstances = [];\n\n /**\n * Load a function or data type from a factory.\n * If the function or data type already exists, the existing instance is\n * returned.\n * @param {Function} factory\n * @returns {*}\n */\n function load(factory) {\n if (isFactory(factory)) {\n return factory(math);\n }\n var firstProperty = factory[Object.keys(factory)[0]];\n if (isFactory(firstProperty)) {\n return firstProperty(math);\n }\n if (!isLegacyFactory(factory)) {\n console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);\n throw new Error('Factory object with properties `type`, `name`, and `factory` expected');\n }\n var index = legacyFactories.indexOf(factory);\n var instance;\n if (index === -1) {\n // doesn't yet exist\n if (factory.math === true) {\n // pass with math namespace\n instance = factory.factory(math.type, configInternal, load, math.typed, math);\n } else {\n instance = factory.factory(math.type, configInternal, load, math.typed);\n }\n\n // append to the cache\n legacyFactories.push(factory);\n legacyInstances.push(instance);\n } else {\n // already existing function, return the cached instance\n instance = legacyInstances[index];\n }\n return instance;\n }\n var importedFactories = {};\n\n // load the import function\n function lazyTyped() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n return math.typed.apply(math.typed, args);\n }\n lazyTyped.isTypedFunction = typedFunction.isTypedFunction;\n var internalImport = importFactory(lazyTyped, load, math, importedFactories);\n math.import = internalImport;\n\n // listen for changes in config, import all functions again when changed\n // TODO: move this listener into the import function?\n math.on('config', () => {\n Object.values(importedFactories).forEach(factory => {\n if (factory && factory.meta && factory.meta.recreateOnConfigChange) {\n // FIXME: only re-create when the current instance is the same as was initially created\n // FIXME: delete the functions/constants before importing them again?\n internalImport(factory, {\n override: true\n });\n }\n });\n });\n\n // the create function exposed on the mathjs instance is bound to\n // the factory functions passed before\n math.create = create.bind(null, factories);\n\n // export factory function\n math.factory = factory;\n\n // import the factory functions like createAdd as an array instead of object,\n // else they will get a different naming (`createAdd` instead of `add`).\n math.import(Object.values(deepFlatten(factories)));\n math.ArgumentsError = ArgumentsError;\n math.DimensionError = DimensionError;\n math.IndexError = IndexError;\n return math;\n}","// SPDX-License-Identifier: AGPL-3.0-or-later\n\nimport { getElement } from \"./getElement.ts\";\n\nexport const appendAnswerElement = (element: HTMLElement | string | number): void => {\n const results = getElement(\"results\");\n\n // ./searx/templates/elements/answers.html\n let answers = getElement(\"answers\", { assert: false });\n if (!answers) {\n // what is this?\n const answersTitle = document.createElement(\"h4\");\n answersTitle.setAttribute(\"class\", \"title\");\n answersTitle.setAttribute(\"id\", \"answers-title\");\n answersTitle.textContent = \"Answers : \";\n\n answers = document.createElement(\"div\");\n answers.setAttribute(\"id\", \"answers\");\n answers.setAttribute(\"role\", \"complementary\");\n answers.setAttribute(\"aria-labelledby\", \"answers-title\");\n answers.appendChild(answersTitle);\n }\n\n if (!(element instanceof HTMLElement)) {\n const span = document.createElement(\"span\");\n span.innerHTML = element.toString();\n // biome-ignore lint/style/noParameterAssign: TODO\n element = span;\n }\n\n answers.appendChild(element);\n\n results.insertAdjacentElement(\"afterbegin\", answers);\n};\n","// SPDX-License-Identifier: AGPL-3.0-or-later\n\nimport {\n absDependencies,\n addDependencies,\n create,\n divideDependencies,\n eDependencies,\n evaluateDependencies,\n expDependencies,\n factorialDependencies,\n gcdDependencies,\n lcmDependencies,\n log1pDependencies,\n log2Dependencies,\n log10Dependencies,\n logDependencies,\n modDependencies,\n multiplyDependencies,\n nthRootDependencies,\n piDependencies,\n powDependencies,\n roundDependencies,\n signDependencies,\n sqrtDependencies,\n subtractDependencies\n} from \"mathjs/number\";\nimport { Plugin } from \"../Plugin.ts\";\nimport { appendAnswerElement } from \"../util/appendAnswerElement.ts\";\nimport { getElement } from \"../util/getElement.ts\";\n\n/**\n * Parses and solves mathematical expressions. Can do basic arithmetic and\n * evaluate some functions.\n *\n * @example\n * \"(3 + 5) / 2\" = \"4\"\n * \"e ^ 2 + pi\" = \"10.530648752520442\"\n * \"gcd(48, 18) + lcm(4, 5)\" = \"26\"\n *\n * @remarks\n * Depends on `mathjs` library.\n */\nexport default class Calculator extends Plugin {\n public constructor() {\n super(\"calculator\");\n }\n\n /**\n * @remarks\n * Compare bundle size after adding or removing features.\n */\n private static readonly math = create({\n ...absDependencies,\n ...addDependencies,\n ...divideDependencies,\n ...eDependencies,\n ...evaluateDependencies,\n ...expDependencies,\n ...factorialDependencies,\n ...gcdDependencies,\n ...lcmDependencies,\n ...log10Dependencies,\n ...log1pDependencies,\n ...log2Dependencies,\n ...logDependencies,\n ...modDependencies,\n ...multiplyDependencies,\n ...nthRootDependencies,\n ...piDependencies,\n ...powDependencies,\n ...roundDependencies,\n ...signDependencies,\n ...sqrtDependencies,\n ...subtractDependencies\n });\n\n protected async run(): Promise {\n const searchInput = getElement(\"q\");\n const node = Calculator.math.parse(searchInput.value);\n\n try {\n return `${node.toString()} = ${node.evaluate()}`;\n } catch {\n // not a compatible math expression\n return;\n }\n }\n\n protected async post(result: string): Promise {\n appendAnswerElement(result);\n }\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116],"mappings":"2nBAAA,SAAS,GAAW,CAClB,MAAO,GAAW,OAAO,OAAS,OAAO,OAAO,MAAM,CAAG,SAAU,EAAG,CACpE,IAAK,IAAIA,EAAI,EAAGA,EAAI,UAAU,OAAQ,IAAK,CACzC,IAAI,EAAI,UAAUA,GAClB,IAAK,IAAI,KAAK,GAAI,EAAE,EAAE,eAAe,KAAK,EAAG,EAAE,GAAK,EAAE,GAAK,EAAE,IAE/D,OAAO,GACN,EAAS,MAAM,KAAM,UAAU,CCPpC,IAAW,EAAiB,CAG1B,OAAQ,MAGR,OAAQ,MAER,OAAQ,SAER,OAAQ,SAGR,eAAgB,SAEhB,UAAW,GAKX,YAAa,GAGb,WAAY,KAIZ,aAAc,GACf,CClBD,SAAS,EAAgB,EAAQ,EAAM,CAErC,GAAI,EAAe,EAAQ,EAAK,CAC9B,OAAO,EAAO,GAKhB,MAHI,OAAO,EAAO,IAAU,YAAc,EAAa,EAAQ,EAAK,CACxD,MAAM,yBAA2B,EAAO,kBAAkB,CAE5D,MAAM,0BAA4B,EAAO,IAAI,CAazD,SAAS,EAAgB,EAAQ,EAAM,EAAO,CAE5C,GAAI,EAAe,EAAQ,EAAK,CAE9B,MADA,GAAO,GAAQ,EACR,EAET,MAAU,MAAM,0BAA4B,EAAO,IAAI,CAUzD,SAAS,EAAe,EAAQ,EAAM,CAyBpC,MAxBI,CAAC,EAAc,EAAO,EAAI,CAAC,MAAM,QAAQ,EAAO,CAC3C,GAIL,EAAe,EAAsB,EAAK,CACrC,GAYT,EARI,KAAQ,OAAO,WAQf,KAAQ,SAAS,WAgBvB,SAAS,EAAc,EAAQ,EAAQ,CACrC,GAAI,CAAC,EAAa,EAAQ,EAAO,CAC/B,MAAU,MAAM,wBAA0B,EAAS,IAAI,CAEzD,OAAO,EAAO,GAUhB,SAAS,EAAa,EAAQ,EAAQ,CA+BpC,OA9BI,GAAW,MAAgC,OAAO,EAAO,IAAY,YAMrE,EAAe,EAAQ,EAAO,EAAI,OAAO,gBAAkB,KAAU,OAAO,eAAe,EAAO,CAC7F,GAIL,EAAe,EAAmB,EAAO,CACpC,GAYT,EARI,KAAU,OAAO,WAQjB,KAAU,SAAS,WAQzB,SAAS,EAAc,EAAQ,CAC7B,OAAO,OAAO,GAAW,UAAY,GAAU,EAAO,cAAgB,OAExE,IAAI,EAAuB,CACzB,OAAQ,GACR,KAAM,GACP,CACG,EAAoB,CACtB,SAAU,GACV,QAAS,GACT,eAAgB,GACjB,CCjIY,EAAb,KAA+B,CAC7B,YAAY,EAAQ,CAClB,KAAK,cAAgB,EACrB,KAAK,OAAO,UAAY,KAAK,QAE/B,MAAO,CACL,OAAO,OAAO,KAAK,KAAK,cAAc,CAAC,OAAO,GAAO,KAAK,IAAI,EAAI,CAAC,CAAC,QAAQ,CAE9E,IAAI,EAAK,CACP,OAAO,EAAgB,KAAK,cAAe,EAAI,CAEjD,IAAI,EAAK,EAAO,CAEd,OADA,EAAgB,KAAK,cAAe,EAAK,EAAM,CACxC,KAET,IAAI,EAAK,CACP,OAAO,EAAe,KAAK,cAAe,EAAI,EAAI,KAAO,KAAK,cAEhE,SAAU,CACR,OAAO,GAAY,KAAK,MAAM,CAAE,GAAO,CAAC,EAAK,KAAK,IAAI,EAAI,CAAC,CAAC,CAE9D,QAAQ,EAAU,CAChB,IAAK,IAAI,KAAO,KAAK,MAAM,CACzB,EAAS,KAAK,IAAI,EAAI,CAAE,EAAK,KAAK,CAGtC,OAAO,EAAK,CACN,EAAe,KAAK,cAAe,EAAI,EACzC,OAAO,KAAK,cAAc,GAG9B,OAAQ,CACN,IAAK,IAAI,KAAO,KAAK,MAAM,CACzB,KAAK,OAAO,EAAI,CAGpB,IAAI,MAAO,CACT,OAAO,OAAO,KAAK,KAAK,cAAc,CAAC,SAkB9B,EAAb,KAA4B,CAM1B,YAAY,EAAG,EAAG,EAAO,CACvB,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,MAAQ,EACb,KAAK,OAAO,UAAY,KAAK,QAE/B,IAAI,EAAK,CACP,OAAO,KAAK,MAAM,IAAI,EAAI,CAAG,KAAK,EAAE,IAAI,EAAI,CAAG,KAAK,EAAE,IAAI,EAAI,CAEhE,IAAI,EAAK,EAAO,CAMd,OALI,KAAK,MAAM,IAAI,EAAI,CACrB,KAAK,EAAE,IAAI,EAAK,EAAM,CAEtB,KAAK,EAAE,IAAI,EAAK,EAAM,CAEjB,KAET,IAAI,EAAK,CACP,OAAO,KAAK,EAAE,IAAI,EAAI,EAAI,KAAK,EAAE,IAAI,EAAI,CAE3C,MAAO,CACL,OAAO,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,MAAM,CAAE,GAAG,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,WAAW,CAEzE,SAAU,CACR,OAAO,GAAY,KAAK,MAAM,CAAE,GAAO,CAAC,EAAK,KAAK,IAAI,EAAI,CAAC,CAAC,CAE9D,QAAQ,EAAU,CAChB,IAAK,IAAI,KAAO,KAAK,MAAM,CACzB,EAAS,KAAK,IAAI,EAAI,CAAE,EAAK,KAAK,CAGtC,OAAO,EAAK,CACV,OAAO,KAAK,MAAM,IAAI,EAAI,CAAG,KAAK,EAAE,OAAO,EAAI,CAAG,KAAK,EAAE,OAAO,EAAI,CAEtE,OAAQ,CACN,KAAK,EAAE,OAAO,CACd,KAAK,EAAE,OAAO,CAEhB,IAAI,MAAO,CACT,MAAO,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,SAO5B,SAAS,GAAY,EAAI,EAAU,CACjC,MAAO,CACL,SAAY,CACV,IAAI,EAAI,EAAG,MAAM,CACjB,OAAO,EAAE,KAAO,EAAI,CAClB,MAAO,EAAS,EAAE,MAAM,CACxB,KAAM,GACP,EAEJ,CAQH,SAAgB,IAAiB,CAC/B,OAAO,IAAI,IASb,SAAgB,GAAU,EAAa,CACrC,GAAI,CAAC,EACH,OAAO,IAAgB,CAEzB,GAAI,EAAM,EAAY,CACpB,OAAO,EAET,GAAI,EAAS,EAAY,CACvB,OAAO,IAAI,EAAkB,EAAY,CAE3C,MAAU,MAAM,iDAAiD,CC5InE,SAAgB,EAAS,EAAG,CAC1B,OAAO,OAAO,GAAM,SAEtB,SAAgB,EAAY,EAAG,CAU7B,MATI,CAAC,GAAK,OAAO,GAAM,UAAY,OAAO,EAAE,aAAgB,WACnD,GAEL,EAAE,cAAgB,IAAQ,OAAO,EAAE,YAAY,WAAc,UAAY,EAAE,YAAY,UAAU,cAAgB,IAGjH,OAAO,EAAE,YAAY,WAAc,YAAc,EAAE,YAAY,UAAU,EAAE,GAAK,GAKtF,SAAgB,GAAS,EAAG,CAC1B,OAAO,OAAO,GAAM,SAEtB,SAAgB,EAAU,EAAG,CAC3B,OAAO,GAAK,OAAO,GAAM,UAAY,OAAO,eAAe,EAAE,CAAC,YAAc,IAAQ,GAEtF,SAAgB,EAAW,EAAG,CAC5B,OAAO,GAAK,OAAO,GAAM,UAAY,OAAO,eAAe,EAAE,CAAC,aAAe,IAAQ,GAEvF,SAAgB,EAAO,EAAG,CACxB,OAAO,GAAK,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzD,SAAgB,EAAS,EAAG,CAC1B,OAAO,OAAO,GAAM,SAEtB,IAAW,EAAU,MAAM,QAC3B,SAAgB,EAAS,EAAG,CAC1B,OAAO,GAAK,EAAE,YAAY,UAAU,WAAa,IAAQ,GAQ3D,SAAgB,EAAa,EAAG,CAC9B,OAAO,MAAM,QAAQ,EAAE,EAAI,EAAS,EAAE,CAExC,SAAgB,GAAc,EAAG,CAC/B,OAAO,GAAK,EAAE,eAAiB,EAAE,YAAY,UAAU,WAAa,IAAQ,GAE9E,SAAgB,EAAe,EAAG,CAChC,OAAO,GAAK,EAAE,gBAAkB,EAAE,YAAY,UAAU,WAAa,IAAQ,GAE/E,SAAgB,GAAQ,EAAG,CACzB,OAAO,GAAK,EAAE,YAAY,UAAU,UAAY,IAAQ,GAE1D,SAAgB,GAAQ,EAAG,CACzB,OAAO,GAAK,EAAE,YAAY,UAAU,UAAY,IAAQ,GAE1D,SAAgB,EAAU,EAAG,CAC3B,OAAO,OAAO,GAAM,UAEtB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,YAAY,UAAU,cAAgB,IAAQ,GAE9D,SAAgB,GAAO,EAAG,CACxB,OAAO,GAAK,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzD,SAAgB,GAAW,EAAG,CAC5B,OAAO,OAAO,GAAM,WAEtB,SAAgB,GAAO,EAAG,CACxB,OAAO,aAAa,KAEtB,SAAgB,GAAS,EAAG,CAC1B,OAAO,aAAa,OAEtB,SAAgB,EAAS,EAAG,CAC1B,MAAO,CAAC,EAAE,GAAK,OAAO,GAAM,UAAY,EAAE,cAAgB,QAAU,CAAC,EAAU,EAAE,EAAI,CAAC,EAAW,EAAE,EAWrG,SAAgB,EAAM,EAAQ,CAM5B,OAHK,EAGE,aAAkB,KAAO,aAAkB,GAAqB,OAAO,EAAO,KAAQ,YAAc,OAAO,EAAO,KAAQ,YAAc,OAAO,EAAO,MAAS,YAAc,OAAO,EAAO,KAAQ,WAFjM,GAIX,SAAgB,GAAiB,EAAQ,CACvC,OAAO,EAAM,EAAO,EAAI,EAAM,EAAO,EAAE,EAAI,EAAM,EAAO,EAAE,CAE5D,SAAgB,GAAoB,EAAQ,CAC1C,OAAO,EAAM,EAAO,EAAI,EAAS,EAAO,cAAc,CAExD,SAAgB,EAAO,EAAG,CACxB,OAAO,IAAM,KAEf,SAAgB,GAAY,EAAG,CAC7B,OAAO,IAAM,IAAA,GAEf,SAAgB,EAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEtF,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,GAAiB,EAAG,CAClC,OAAO,GAAK,EAAE,mBAAqB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAExF,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,GAAkB,EAAG,CACnC,OAAO,GAAK,EAAE,oBAAsB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzF,SAAgB,EAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAatF,SAAgB,GAAU,EAAM,CAC9B,OAAO,EAAe,EAAK,EAAI,GAAe,EAAK,EAAI,EAAK,KAAK,SAAW,GAAK,EAAe,EAAK,KAAK,GAAG,EAAI,MAAM,SAAS,EAAK,GAAG,CAE1I,SAAgB,GAAyB,EAAG,CAC1C,OAAO,GAAK,EAAE,2BAA6B,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEhG,SAAgB,GAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEtF,SAAgB,EAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,EAAO,EAAG,CACxB,OAAO,GAAK,EAAE,SAAW,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAE9E,SAAgB,GAAa,EAAG,CAC9B,OAAO,GAAK,EAAE,eAAiB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEpF,SAAgB,GAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEtF,SAAgB,GAAkB,EAAG,CACnC,OAAO,GAAK,EAAE,oBAAsB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzF,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,GAAiB,EAAG,CAClC,OAAO,GAAK,EAAE,mBAAqB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAExF,SAAgB,EAAa,EAAG,CAC9B,OAAO,GAAK,EAAE,eAAiB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEpF,SAAgB,GAAQ,EAAG,CACzB,OAAO,GAAK,EAAE,YAAY,UAAU,UAAY,IAAQ,GAE1D,SAAgB,GAAO,EAAG,CACxB,IAAI,EAAI,OAAO,EAOf,OANI,IAAM,SACJ,IAAM,KAAa,OACnB,EAAY,EAAE,CAAS,YACvB,EAAE,aAAe,EAAE,YAAY,KAAa,EAAE,YAAY,KACvD,SAEF,ECpLT,SAAgB,GAAM,EAAG,CACvB,IAAI,EAAO,OAAO,EAGlB,GAAI,IAAS,UAAY,IAAS,UAAY,IAAS,UAAY,IAAS,WAAa,GAAM,KAC7F,OAAO,EAIT,GAAI,OAAO,EAAE,OAAU,WACrB,OAAO,EAAE,OAAO,CAIlB,GAAI,MAAM,QAAQ,EAAE,CAClB,OAAO,EAAE,IAAI,SAAU,EAAO,CAC5B,OAAO,GAAM,EAAM,EACnB,CAEJ,GAAI,aAAa,KAAM,OAAO,IAAI,KAAK,EAAE,SAAS,CAAC,CACnD,GAAI,EAAY,EAAE,CAAE,OAAO,EAG3B,GAAI,EAAS,EAAE,CACb,OAAO,GAAU,EAAG,GAAM,CAE5B,GAAI,IAAS,WAEX,OAAO,EAET,MAAU,UAAU,+CAAsD,KAAQ,CASpF,SAAgB,GAAU,EAAQ,EAAU,CAC1C,IAAIC,EAAQ,EAAE,CACd,IAAK,IAAI,KAAO,EACV,EAAe,EAAQ,EAAI,GAC7B,EAAM,GAAO,EAAS,EAAO,GAAK,EAGtC,OAAOA,EAwBT,SAAgB,GAAW,EAAG,EAAG,CAE/B,GAAI,MAAM,QAAQ,EAAE,CAClB,MAAU,UAAU,yCAAyC,CAE/D,IAAK,IAAI,KAAQ,EAGf,GAAI,EAAe,EAAG,EAAK,EAAI,EAAE,KAAQ,OAAO,YAAc,EAAE,KAAQ,SAAS,WAC/E,GAAI,EAAE,IAAS,EAAE,GAAM,cAAgB,OACjC,EAAE,KAAU,IAAA,KACd,EAAE,GAAQ,EAAE,EAEV,EAAE,IAAS,EAAE,GAAM,cAAgB,OACrC,GAAW,EAAE,GAAO,EAAE,GAAM,CAE5B,EAAE,GAAQ,EAAE,WAEL,MAAM,QAAQ,EAAE,GAAM,CAC/B,MAAU,UAAU,yCAAyC,MAE7D,EAAE,GAAQ,EAAE,GAIlB,OAAO,EAUT,SAAgB,GAAgB,EAAG,EAAG,CACpC,IAAI,EAAM,EAAG,EACb,GAAI,MAAM,QAAQ,EAAE,CAAE,CAIpB,GAHI,CAAC,MAAM,QAAQ,EAAE,EAGjB,EAAE,SAAW,EAAE,OACjB,MAAO,GAET,IAAK,EAAI,EAAG,EAAM,EAAE,OAAQ,EAAI,EAAK,IACnC,GAAI,CAAC,GAAgB,EAAE,GAAI,EAAE,GAAG,CAC9B,MAAO,GAGX,MAAO,WACE,OAAO,GAAM,WACtB,OAAO,IAAM,UACJ,aAAa,OAAQ,CAC9B,GAAI,MAAM,QAAQ,EAAE,EAAI,EAAE,aAAa,QACrC,MAAO,GAET,IAAK,KAAQ,EAEX,GAAI,EAAE,KAAQ,IAAM,CAAC,GAAgB,EAAE,GAAO,EAAE,GAAM,CACpD,MAAO,GAGX,IAAK,KAAQ,EAEX,GAAI,EAAE,KAAQ,GACZ,MAAO,GAGX,MAAO,QAEP,OAAO,IAAM,EASjB,SAAgB,GAAY,EAAc,CACxC,IAAI,EAAkB,EAAE,CAExB,OADA,GAAa,EAAc,EAAgB,CACpC,EAIT,SAAS,GAAa,EAAc,EAAiB,CACnD,IAAK,IAAI,KAAQ,EACf,GAAI,EAAe,EAAc,EAAK,CAAE,CACtC,IAAI,EAAQ,EAAa,GACrB,OAAO,GAAU,UAAY,EAC/B,GAAa,EAAO,EAAgB,CAEpC,EAAgB,GAAQ,GAkChC,SAAgB,GAAK,EAAQ,EAAM,EAAe,CAChD,IAAI,EAAiB,GACjB,EACJ,OAAO,eAAe,EAAQ,EAAM,CAClC,IAAK,UAAe,CAKlB,MAJA,CAEE,KADA,EAAS,GAAe,CACP,IAEZ,GAET,IAAK,SAAa,EAAO,CACvB,EAAS,EACT,EAAiB,IAEnB,aAAc,GACd,WAAY,GACb,CAAC,CAgCJ,SAAgB,EAAe,EAAQ,EAAU,CAC/C,OAAO,GAAU,OAAO,eAAe,KAAK,EAAQ,EAAS,CAe/D,SAAgB,GAAgB,EAAQ,CACtC,OAAO,GAAU,OAAO,EAAO,SAAY,WAoF7C,SAAgB,EAAY,EAAQ,EAAY,CAE9C,IAAK,IADD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAIC,EAAW,OAAQ,IAAK,CAC1C,IAAI,EAAMA,EAAW,GACjB,EAAQ,EAAO,GACf,IAAU,IAAA,KACZ,EAAK,GAAO,GAGhB,OAAO,EC/WT,IAAW,GAAiB,CAAC,SAAU,QAAQ,CACpC,GAAiB,CAAC,SAAU,YAAa,SAAU,WAAW,CAEzE,SAAgB,GAAc,EAAQ,EAAM,CA6C1C,SAAS,EAAQ,EAAS,CACxB,GAAI,EAAS,CACX,GAAI,EAAQ,UAAY,IAAA,GAAW,CAEjC,QAAQ,KAAK,gGAAgG,CAC7G,IAAI,EAAa,GAAM,EAAQ,CAI/B,MAHA,GAAW,OAAS,EAAQ,QAC5B,EAAW,OAAS,EAAQ,QAAU,KACtC,OAAO,EAAW,QACX,EAAQ,EAAW,CAExB,EAAQ,eAAiB,IAE3B,QAAQ,KAAK,oHAAoH,CAEnI,IAAI,EAAO,GAAM,EAAO,CAGxB,GAAe,EAAS,SAAU,GAAe,CACjD,GAAe,EAAS,SAAU,GAAe,CAGjD,GAAW,EAAQ,EAAQ,CAC3B,IAAI,EAAO,GAAM,EAAO,CAKxB,OADA,EAAK,SAAU,EAAM,EAHP,GAAM,EAAQ,CAGO,CAC5B,OAEP,OAAO,GAAM,EAAO,CAgBxB,MAXA,GAAQ,eAAiB,GACzB,EAAQ,eAAiB,GAGzB,OAAO,KAAK,EAAe,CAAC,QAAQ,GAAO,CACzC,OAAO,eAAe,EAAS,EAAK,CAClC,QAAW,EAAO,GAClB,WAAY,GACZ,aAAc,GACf,CAAC,EACF,CACK,EAST,SAAS,GAAe,EAAS,EAAM,EAAQ,CACzC,EAAQC,KAAU,IAAA,IAAa,CAAC,EAAO,SAAS,EAAQA,GAAM,EAEhE,QAAQ,KAAK,2BAA6B,EAAQA,GAAQ,+BAAiCA,EAAO,yBAAgC,EAAO,IAAI,GAAS,KAAK,UAAU,EAAM,CAAC,CAAC,KAAK,KAAK,CAAG,IAAI,CCjGlM,SAAgB,EAAU,EAAO,CAI/B,OAHI,OAAO,GAAU,UACZ,GAEF,OAAO,SAAS,EAAM,CAAG,IAAU,KAAK,MAAM,EAAM,CAAG,GAqBhE,SAAgB,GAAe,EAAW,EAAQ,CAChD,GAAI,EAAO,SAAW,SACpB,GAAI,CACF,OAAO,EAAU,MACD,CAChB,OAAO,EAAO,eAGlB,OAAO,EAAO,OAQhB,IAAW,GAAO,KAAK,MAAQ,SAAU,EAAG,CAMxC,OALE,EAAI,EACC,EACE,EAAI,EACN,GAEA,GASA,GAAO,KAAK,MAAQ,SAAc,EAAG,CAC9C,OAAO,KAAK,IAAI,EAAE,CAAG,KAAK,KAQjB,GAAQ,KAAK,OAAS,SAAe,EAAG,CACjD,OAAO,KAAK,IAAI,EAAE,CAAG,KAAK,MAQjB,GAAQ,KAAK,OAAS,SAAU,EAAG,CAC5C,OAAO,KAAK,IAAI,EAAI,EAAE,EAYb,GAAO,KAAK,MAAQ,SAAc,EAAG,CAC9C,GAAI,IAAM,EACR,OAAO,EAET,IAAI,EAAS,EAAI,EACb,EAWJ,OAVI,IACF,EAAI,CAAC,GAEH,OAAO,SAAS,EAAE,EACpB,EAAS,KAAK,IAAI,KAAK,IAAI,EAAE,CAAG,EAAE,CAElC,GAAU,GAAK,EAAS,GAAU,EAAI,GAAU,GAEhD,EAAS,EAEJ,EAAS,CAAC,EAAS,GAQjB,GAAQ,KAAK,OAAS,SAAe,EAAG,CACjD,OAAO,GAAK,MAAQ,GAAK,MAAQ,KAAK,IAAI,EAAE,CAAG,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,GAUjF,SAAS,GAAmB,EAAG,EAAM,EAAM,CAMzC,IAAI,EALW,CACb,EAAG,KACH,EAAG,KACH,GAAI,KACL,CACqB,GAClB,EAAS,GACb,GAAI,EAAM,CACR,GAAI,EAAO,EACT,MAAU,MAAM,iCAAiC,CAEnD,GAAI,CAAC,EAAU,EAAK,CAClB,MAAU,MAAM,0BAA0B,CAE5C,GAAI,EAAI,IAAM,EAAO,GAAK,GAAK,EAAI,EAAE,IAAM,EAAO,IAChD,MAAU,MAAM,8BAAqC,EAAO,QAAkB,EAAO,OAAU,CAEjG,GAAI,CAAC,EAAU,EAAE,CACf,MAAU,MAAM,2BAA2B,CAEzC,EAAI,IACN,GAAQ,GAAK,GAEf,EAAS,IAAW,IAEtB,IAAIK,EAAO,GAKX,OAJI,EAAI,IACN,EAAI,CAAC,EACL,EAAO,KAEF,GAAUA,IAAa,IAAe,EAAE,SAAS,EAAK,GAAS,IAuFxE,SAAgBC,GAAO,EAAO,EAAS,CACrC,GAAI,OAAO,GAAY,WAErB,OAAO,EAAQ,EAAM,CAIvB,GAAI,IAAU,IACZ,MAAO,cACE,IAAU,KACnB,MAAO,eACE,MAAM,EAAM,CACrB,MAAO,MAET,GAAI,CACF,WACA,YACA,YACE,GAAuB,EAAQ,CAGnC,OAAQ,EAAR,CACE,IAAK,QACH,OAAOC,GAAQ,EAAO,EAAU,CAClC,IAAK,cACH,OAAOC,GAAc,EAAO,EAAU,CACxC,IAAK,cACH,OAAOC,GAAc,EAAO,EAAU,CACxC,IAAK,MACH,OAAO,GAAmB,EAAO,EAAG,EAAS,CAC/C,IAAK,MACH,OAAO,GAAmB,EAAO,EAAG,EAAS,CAC/C,IAAK,MACH,OAAO,GAAmB,EAAO,GAAI,EAAS,CAChD,IAAK,OAEH,OAAO,GAAY,EAAO,EAAW,EAAQ,CAAC,QAAQ,sBAAuB,UAAY,CACvF,IAAIC,EAAS,UAAU,GACnBC,EAAI,UAAU,GAClB,OAAOD,IAAW,IAAmBC,EAAbD,EAASC,GACjC,CACJ,QACE,MAAU,MAAM,qBAAuB,EAAW,mEAAwE,EAYhI,SAAgB,GAAuB,EAAS,CAE9C,IAAI,EAAW,OACX,EACA,EACJ,GAAI,IAAY,IAAA,GACd,GAAI,EAAS,EAAQ,CACnB,EAAY,UACH,EAAY,EAAQ,CAC7B,EAAY,EAAQ,UAAU,SACrB,EAAS,EAAQ,CACtB,EAAQ,YAAc,IAAA,KACxB,EAAY,GAAiB,EAAQ,cAAiB,CACpD,MAAU,MAAM,mDAAmD,EACnE,EAEA,EAAQ,WAAa,IAAA,KACvB,EAAW,GAAiB,EAAQ,aAAgB,CAClD,MAAU,MAAM,kDAAkD,EAClE,EAEA,EAAQ,WACV,EAAW,EAAQ,eAGrB,MAAU,MAAM,qEAAqE,CAGzF,MAAO,CACL,WACA,YACA,WACD,CASH,SAAgB,GAAY,EAAO,CAEjC,IAAI,EAAQ,OAAO,EAAM,CAAC,aAAa,CAAC,MAAM,kCAAkC,CAChF,GAAI,CAAC,EACH,MAAU,YAAY,kBAAoB,EAAM,CAElD,IAAIN,EAAO,EAAM,GACbK,EAAS,EAAM,GACf,EAAW,WAAW,EAAM,IAAM,IAAI,CACtC,EAAMA,EAAO,QAAQ,IAAI,CAC7B,GAAY,IAAQ,GAAeA,EAAO,OAAS,EAA1B,EAAM,EAC/B,IAAI,EAAeA,EAAO,QAAQ,IAAK,GAAG,CACzC,QAAQ,MAAO,SAAU,EAAO,CAG/B,MADA,IAAYE,EAAM,OACX,IACP,CAAC,QAAQ,MAAO,GAAG,CACpB,MAAM,GAAG,CAAC,IAAI,SAAU,EAAG,CAC1B,OAAO,SAAS,EAAE,EAClB,CAKF,OAJI,EAAa,SAAW,IAC1B,EAAa,KAAK,EAAE,CACpB,KAEK,CACL,KAAA,EACA,eACA,WACD,CAQH,SAAgBH,GAAc,EAAO,EAAW,CAC9C,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CACzC,OAAO,OAAO,EAAM,CAGtB,IAAI,EAAU,GADF,GAAY,EAAM,CACG,EAAU,CACvCE,EAAI,EAAQ,SACZ,EAAI,EAAQ,aAGZ,EAASA,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAC/D,GAAI,EAAS,EAAU,CAErB,KAAO,EAAY,EAAE,QAAUA,EAAI,EAAS,EAAI,EAAE,QAChD,EAAE,KAAK,EAAE,MAMX,IAAK,IADD,EAAe,KAAK,IAAIA,EAAI,EAAO,EAAI,EAAE,OAAS,GAC7C,EAAI,EAAG,EAAI,EAAc,IAChC,EAAE,KAAK,EAAE,CASb,IAJA,IAAI,EAAU,KAAK,IAAIA,EAAI,EAAO,CAC9B,EAAa,EAGV,EAAU,GACf,IACA,IAKF,IAAI,EAAW,EAAE,MAAM,EAAW,CAAC,KAAK,GAAG,CACvC,EAAa,EAAS,EAAU,EAAI,EAAS,QAAU,EAAS,MAAM,QAAQ,CAAG,IAAM,EAAW,GAClG,EAAM,EAAE,MAAM,EAAG,EAAW,CAAC,KAAK,GAAG,CAAG,EAAa,KAAOA,GAAK,EAAI,IAAM,IAAM,EAAO,UAAU,CACtG,OAAO,EAAQ,KAAO,EASxB,SAAgBJ,GAAQ,EAAO,EAAW,CACxC,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CACzC,OAAO,OAAO,EAAM,CAEtB,IAAI,EAAa,GAAY,EAAM,CAC/B,EAAU,OAAO,GAAc,SAAW,GAAY,EAAY,EAAW,SAAW,EAAI,EAAU,CAAG,EACzG,EAAI,EAAQ,aACZ,EAAI,EAAQ,SAAW,EAGvB,EAAK,GAAK,GAAa,GAe3B,OAdI,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAK,EAAE,OAAO,CAAC,EAIhC,EAAI,IACN,EAAI,GAAM,CAAC,EAAI,EAAE,CAAC,OAAO,EAAE,CAC3B,EAAI,GAIF,EAAI,EAAE,QACR,EAAE,OAAO,EAAG,EAAG,IAAM,EAAI,KAAO,IAAI,CAE/B,EAAQ,KAAO,EAAE,KAAK,GAAG,CAUlC,SAAgBC,GAAc,EAAO,EAAW,CAC9C,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,OAAO,EAAM,CAAC,CACjD,OAAO,OAAO,EAAM,CAItB,IAAI,EAAQ,GAAY,EAAM,CAC1B,EAAU,EAAY,GAAY,EAAO,EAAU,CAAG,EACtD,EAAI,EAAQ,aACZG,EAAI,EAAQ,SAGZ,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAY,EAAE,OAAO,CAAC,EAI3C,IAAI,EAAQ,EAAE,OAAO,CACrB,OAAO,EAAQ,KAAO,GAAS,EAAE,OAAS,EAAI,IAAM,EAAE,KAAK,GAAG,CAAG,IAAM,KAAOA,GAAK,EAAI,IAAM,IAAMA,EAarG,SAAgB,GAAY,EAAO,EAAW,EAAS,CACrD,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CACzC,OAAO,OAAO,EAAM,CAItB,IAAI,EAAWE,GAAmB,GAA0D,SAAU,GAAG,CACrG,EAAWA,GAAmB,GAA0D,SAAU,EAAE,CACpG,EAAQ,GAAY,EAAM,CAC1B,EAAU,EAAY,GAAY,EAAO,EAAU,CAAG,EAC1D,GAAI,EAAQ,SAAW,GAAY,EAAQ,UAAY,EAErD,OAAOL,GAAc,EAAO,EAAU,CAEtC,IAAI,EAAI,EAAQ,aACZG,EAAI,EAAQ,SAGZ,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAY,EAAE,OAAO,CAAC,EAK3C,EAAI,EAAE,OAAO,GAAMA,EAAI,EAAE,OAAS,GAAK,EAAE,OAAS,EAAY,EAAY,EAAE,OAAS,GAAG,CAAC,CAGzF,EAAI,GAAM,CAACA,EAAE,CAAC,OAAO,EAAE,CACvB,IAAI,EAAMA,EAAI,EAAIA,EAAI,EAItB,OAHI,EAAM,EAAE,OAAS,GACnB,EAAE,OAAO,EAAM,EAAG,EAAG,IAAI,CAEpB,EAAQ,KAAO,EAAE,KAAK,GAAG,CAYpC,SAAgB,GAAY,EAAO,EAAW,CAU5C,IARA,IAAI,EAAU,CACZ,KAAM,EAAM,KACZ,aAAc,EAAM,aACpB,SAAU,EAAM,SACjB,CACG,EAAI,EAAQ,aAGT,GAAa,GAClB,EAAE,QAAQ,EAAE,CACZ,EAAQ,WACR,IAEF,GAAI,EAAE,OAAS,GACC,EAAE,OAAO,EAAW,EAAE,OAAS,EAAU,CAC3C,IAAM,EAAG,CACnB,IAAI,EAAI,EAAY,EAEpB,IADA,EAAE,KACK,EAAE,KAAO,IACd,EAAE,KAAK,CACH,IAAM,IACR,EAAE,QAAQ,EAAE,CACZ,EAAQ,WACR,KAEF,IACA,EAAE,KAIR,OAAO,EAQT,SAAS,GAAM,EAAQ,CAErB,IAAK,IADD,EAAM,EAAE,CACH,EAAI,EAAG,EAAI,EAAQ,IAC1B,EAAI,KAAK,EAAE,CAEb,OAAO,EAcT,SAAgB,GAAO,EAAO,CAC5B,OAAO,EAAM,eAAe,CAAC,QAAQ,OAAQ,GAAG,CAC/C,QAAQ,aAAc,GAAG,CACzB,OAyGH,SAAS,GAAiB,EAAO,EAAS,CACxC,GAAI,EAAS,EAAM,CACjB,OAAO,KACE,EAAY,EAAM,CAC3B,OAAO,EAAM,UAAU,CAEvB,GAAS,CAGb,SAASE,GAAmB,EAAO,EAAc,CAM7C,OALE,EAAS,EAAM,CACV,EACE,EAAY,EAAM,CACpB,EAAM,UAAU,CAEhB,ECltBX,IAAI,EAAK,SACL,GAAK,iBACT,SAAgB,GAAU,EAAG,CAC3B,OAAO,KAAK,IAAI,EAAE,CAEpB,GAAU,UAAY,EACtB,SAAgB,GAAU,EAAG,EAAG,CAC9B,OAAO,EAAI,EAEb,GAAU,UAAY,GACtB,SAAgB,GAAe,EAAG,EAAG,CACnC,OAAO,EAAI,EAEb,GAAe,UAAY,GAC3B,SAAgB,GAAe,EAAG,EAAG,CACnC,OAAO,EAAI,EAEb,GAAe,UAAY,GAC3B,SAAgB,GAAa,EAAG,EAAG,CACjC,OAAO,EAAI,EAEb,GAAa,UAAY,GACzB,SAAgB,GAAiB,EAAG,CAClC,MAAO,CAAC,EAEV,GAAiB,UAAY,EAC7B,SAAgB,GAAgB,EAAG,CACjC,OAAO,EAET,GAAgB,UAAY,EAC5B,SAAgB,GAAW,EAAG,CAC5B,OAAO,GAAK,EAAE,CAEhB,GAAW,UAAY,EACvB,SAAgB,GAAW,EAAG,CAC5B,OAAO,EAAI,EAAI,EAEjB,GAAW,UAAY,EACvB,SAAgB,GAAU,EAAG,CAC3B,OAAO,KAAK,IAAI,EAAE,CAEpB,GAAU,UAAY,EACtB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAM,EAAE,CAEjB,GAAY,UAAY,EAQxB,SAAgB,GAAU,EAAG,EAAG,CAC9B,GAAI,CAAC,EAAU,EAAE,EAAI,CAAC,EAAU,EAAE,CAChC,MAAU,MAAM,qDAAqD,CAKvE,IADA,IAAI,EACG,IAAM,GACX,EAAI,EAAI,EACR,EAAI,EACJ,EAAI,EAEN,OAAO,EAAI,EAAI,CAAC,EAAI,EAEtB,GAAU,UAAY,GAQtB,SAAgB,GAAU,EAAG,EAAG,CAC9B,GAAI,CAAC,EAAU,EAAE,EAAI,CAAC,EAAU,EAAE,CAChC,MAAU,MAAM,qDAAqD,CAEvE,GAAI,IAAM,GAAK,IAAM,EACnB,MAAO,GAOT,IAFA,IAAI,EACA,EAAO,EAAI,EACR,IAAM,GACX,EAAI,EACJ,EAAI,EAAI,EACR,EAAI,EAEN,OAAO,KAAK,IAAI,EAAO,EAAE,CAE3B,GAAU,UAAY,GAQtB,SAAgB,GAAU,EAAG,EAAG,CAI9B,OAHI,EACK,KAAK,IAAI,EAAE,CAAG,KAAK,IAAI,EAAE,CAE3B,KAAK,IAAI,EAAE,CAQpB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAM,EAAE,CAEjB,GAAY,UAAY,EAOxB,SAAgB,GAAW,EAAG,CAC5B,OAAO,GAAK,EAAE,CAEhB,GAAW,UAAY,EAOvB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAM,EAAE,CAEjB,GAAY,UAAY,EASxB,SAAgB,GAAU,EAAG,EAAG,CAI9B,OAAO,IAAM,EAAI,EAAI,EAAI,EAAI,KAAK,MAAM,EAAI,EAAE,CAEhD,GAAU,UAAY,GAStB,SAAgB,GAAc,EAAG,CAC/B,IAAI,EAAO,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAC3E,EAAM,EAAO,EAIjB,GAHI,IACF,EAAO,CAAC,GAEN,IAAS,EACX,MAAU,MAAM,wBAAwB,CAE1C,GAAI,EAAI,GAAK,KAAK,IAAI,EAAK,CAAG,GAAM,EAClC,MAAU,MAAM,uCAAuC,CAIzD,GAAI,IAAM,EACR,OAAO,EAAM,IAAW,EAE1B,GAAI,CAAC,SAAS,EAAE,CACd,OAAO,EAAM,EAAI,EAEnB,IAAI,EAAa,KAAK,IAAI,EAAE,GAAE,EAAI,GAIlC,MADA,GAAI,EAAI,EAAI,CAAC,EAAI,EACV,EAAM,EAAI,EAAI,EAuBvB,SAAgB,GAAW,EAAG,CAC5B,OAAO,GAAK,EAAE,CAEhB,GAAW,UAAY,EACvB,SAAgB,GAAW,EAAG,CAC5B,OAAO,KAAK,KAAK,EAAE,CAErB,GAAW,UAAY,EACvB,SAAgB,GAAa,EAAG,CAC9B,OAAO,EAAI,EAEb,GAAa,UAAY,EASzB,SAAgB,GAAW,EAAG,EAAG,CAE/B,IAAI,EACA,EACA,EACA,EAAI,EACJ,EAAQ,EACR,EAAI,EACJ,EAAQ,EACZ,GAAI,CAAC,EAAU,EAAE,EAAI,CAAC,EAAU,EAAE,CAChC,MAAU,MAAM,sDAAsD,CAExE,KAAO,GACL,EAAI,KAAK,MAAM,EAAI,EAAE,CACrB,EAAI,EAAI,EAAI,EACZ,EAAI,EACJ,EAAI,EAAQ,EAAI,EAChB,EAAQ,EACR,EAAI,EACJ,EAAI,EAAQ,EAAI,EAChB,EAAQ,EACR,EAAI,EACJ,EAAI,EAQN,OALI,EAAI,EACA,CAAC,CAAC,EAAG,CAAC,EAAO,CAAC,EAAM,CAEpB,CAAC,EAAG,EAAI,EAAQ,EAAG,EAAM,CAInC,GAAW,UAAY,GAQvB,SAAgB,GAAU,EAAG,EAAG,CAM9B,OAHI,EAAI,EAAI,GAAK,IAAM,KAAY,EAAI,EAAI,GAAK,IAAM,KAC7C,EAEO,IAAG,EAErB,GAAU,UAAY,GAStB,SAAgB,GAAY,EAAO,CACjC,IAAI,EAAW,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EACnF,GAAI,CAAC,EAAU,EAAS,EAAI,EAAW,GAAK,EAAW,GACrD,MAAU,MAAM,iFAAiF,CAEnG,OAAO,WAAWC,GAAQ,EAAO,EAAS,CAAC,CAQ7C,SAAgB,GAAW,EAAG,CAC5B,OAAO,KAAK,IAAI,EAAE,CAEpB,GAAW,UAAY,EC1SvB,SAAgB,GAAQ,EAAG,EAAG,CAC5B,GAAI,EAAI,EACN,MAAO,GAET,GAAI,IAAM,EACR,OAAO,EAET,IAAI,EAAO,EAAI,GAAK,EACpB,OAAO,GAAQ,EAAG,EAAK,CAAG,GAAQ,EAAO,EAAG,EAAE,CCVhD,SAAgB,GAAmB,EAAG,EAAG,CAIvC,GAHI,CAAC,EAAU,EAAE,EAAI,EAAI,GAGrB,CAAC,EAAU,EAAE,EAAI,EAAI,EACvB,MAAU,UAAU,2DAA2D,CAEjF,GAAI,EAAI,EACN,MAAU,UAAU,oCAAoC,CAS1D,IAAK,IAPD,EAAU,EAAI,EACd,EAAS,EACT,EAAiB,EAAI,EAAU,EAAU,EAAI,EAAI,EACjD,EAAc,EACd,EAAc,EAAI,EAAU,EAAI,EAG3B,EAAgB,EAAgB,GAAiB,EAAG,EAAE,EAE7D,IADA,GAAU,EACH,GAAe,GAAe,EAAS,IAAgB,GAC5D,GAAU,EACV,EAAE,EAON,OAHI,GAAe,IACjB,GAAU,GAAQ,EAAa,EAAY,EAEtC,EAET,GAAmB,UAAY,iBChC/B,IAAW,GAAK,KAAK,GACJ,EAAI,KAAK,GAC1B,IAAW,GAAI,KAAK,ECEpB,SAAgB,GAAY,EAAG,CAC7B,IAAI,EACJ,GAAI,EAAU,EAAE,CAOd,OANI,GAAK,EACA,OAAO,SAAS,EAAE,CAAG,IAAW,IAErC,EAAI,IACC,IAEF,GAAQ,EAAG,EAAI,EAAE,CAE1B,GAAI,EAAI,GACN,OAAO,KAAK,IAAM,KAAK,IAAI,KAAK,GAAK,EAAE,CAAG,GAAY,EAAI,EAAE,EAE9D,GAAI,GAAK,OACP,MAAO,KAET,GAAI,EAAI,GAAM,CAEZ,IAAI,EAAO,EAAI,EACX,EAAS,EAAO,EAChB,EAAQ,EAAS,EACjB,EAAQ,EAAQ,EACpB,OAAO,KAAK,KAAK,EAAI,KAAK,GAAK,EAAE,EAAY,EAAI,KAAK,KAAG,GAAM,EAAI,GAAK,GAAK,GAAK,GAAK,IAAM,GAAQ,KAAO,MAAQ,GAAU,KAAO,QAAU,GAAS,QAAU,UAAY,GAAS,SAAW,YAAc,EAAQ,IAE1N,EAAE,EACF,EAAI,GAAO,GACX,IAAK,IAAI,EAAI,EAAG,EAAI,GAAO,OAAQ,EAAE,EACnC,GAAK,GAAO,IAAM,EAAI,GAExB,IAAI,EAAI,EAAI,GAAS,GACrB,OAAO,KAAK,KAAK,EAAI,KAAK,GAAG,CAAY,KAAG,EAAI,IAAO,KAAK,IAAI,CAAC,EAAE,CAAG,EAExE,GAAY,UAAY,SAIxB,IAAW,GAAS,UACT,GAAS,CAAC,kBAAwB,kBAAuB,mBAAwB,mBAAuB,mBAAyB,qBAA2B,qBAA2B,sBAA4B,qBAA2B,uBAA4B,sBAA2B,sBAA4B,qBAA2B,uBAA4B,sBAA0B,CAKlZ,GAAY,kBAIZ,GAAe,CAAC,kBAAmB,kBAAmB,mBAAoB,kBAAmB,mBAAoB,oBAAuB,mBAAoB,CACvK,SAAgB,GAAa,EAAG,CAC9B,GAAI,EAAI,EAAG,MAAO,KAClB,GAAI,IAAM,EAAG,MAAO,KACpB,GAAI,CAAC,OAAO,SAAS,EAAE,CAAE,OAAO,EAChC,GAAI,EAAI,GAGN,OAAO,KAAK,IAAI,KAAK,GAAK,KAAK,IAAI,KAAK,GAAK,EAAE,CAAC,CAAG,GAAa,EAAI,EAAE,CAKxE,IAKA,IAAK,IAJD,EAAO,EAAA,EAAc,GACrB,EAAM,GAAa,GAGd,EAAA,EAAiB,GAAK,EAAG,IAChC,GAAO,GAAa,IAAM,EAAI,GAEhC,OAAO,IAAa,EAAI,IAAO,KAAK,IAAI,EAAK,CAAG,EAAO,KAAK,IAAI,EAAI,CAEtE,GAAa,UAAY,SC7CzB,SAAgB,EAAQ,EAAM,EAAc,EAAQ,EAAM,CACxD,SAAS,EAAgB,EAAO,CAI9B,IAAI,EAAO,EAAY,EAAOC,EAAa,IAAI,GAAsB,CAAC,CAEtE,OADA,GAAmBC,EAAMD,EAAc,EAAM,CACtCE,EAAO,EAAK,CAQrB,MANA,GAAgB,UAAY,GAC5B,EAAgB,GAAKD,EACrB,EAAgB,aAAeD,EAAa,OAAO,CAAC,MAAM,CACtD,IACF,EAAgB,KAAO,GAElB,EAwDT,SAAgB,GAAU,EAAK,CAC7B,OAAO,OAAO,GAAQ,YAAc,OAAO,EAAI,IAAO,UAAY,MAAM,QAAQ,EAAI,aAAa,CAYnG,SAAgB,GAAmB,EAAM,EAAc,EAAO,CAG5D,GAAI,CAFaA,EAAa,OAAO,GAAc,CAAC,GAAqB,EAAW,CAAC,CACpF,MAAM,GAAc,EAAM,KAAgB,IAAA,GAAU,CACpC,CACf,IAAI,EAAsBA,EAAa,OAAO,GAAc,EAAM,KAAgB,IAAA,GAAU,CAG5F,MAAU,MAAM,2BAAmCC,sCAAyD,EAAoB,IAAI,GAAK,IAAY,KAAS,CAAC,KAAK,KAAK,IAAO,EAGpL,SAAgB,GAAqB,EAAY,CAC/C,OAAO,GAAc,EAAW,KAAO,IAEzC,SAAgB,GAAsB,EAAY,CAChD,OAAO,GAAc,EAAW,KAAO,IAAM,EAAW,MAAM,EAAE,CAAG,EC/HrE,SAAgB,IAAc,CAC5B,MAAU,MAAM,0CAA0C,CAE5D,SAAgB,IAAa,CAC3B,MAAU,MAAM,yCAAyC,CAE3D,SAAgB,IAAW,CACzB,MAAU,MAAM,uCAAuC,CAKzD,SAAgB,IAAW,CACzB,MAAU,MAAM,uCAAuC,oBCbxD,SAAU,EAAQ,EAAS,CAC1B,OAAO,GAAY,UAAmB,IAAW,OAAc,EAAO,QAAUE,GAAS,CACzF,OAAO,QAAW,YAAc,OAAO,IAAM,OAAOA,EAAQ,EAC3D,EAAS,OAAO,WAAe,IAAc,WAAa,GAAU,KAAM,EAAO,MAAQA,GAAS,OAC3F,UAAY,CAEpB,SAAS,GAAK,CACZ,MAAO,GAET,SAAS,GAAQ,CACf,MAAO,GAET,SAAS,GAAQ,EAGjB,IAAM,EAAqB,oCA0C3B,SAASC,GAAS,CAMhB,SAASC,EAAc,EAAG,CACxB,OAAO,OAAO,GAAM,YAAY,GAAc,EAAE,cAAgB,OAElE,IAAM,EAAS,CAAC,CACd,KAAM,SACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,UAEvB,CAAE,CACD,KAAM,SACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,UAEvB,CAAE,CACD,KAAM,UACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,WAEvB,CAAE,CACD,KAAM,WACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,YAEvB,CAAE,CACD,KAAM,QACN,KAAM,MAAM,QACb,CAAE,CACD,KAAM,OACN,KAAM,SAAU,EAAG,CACjB,OAAO,aAAa,MAEvB,CAAE,CACD,KAAM,SACN,KAAM,SAAU,EAAG,CACjB,OAAO,aAAa,QAEvB,CAAE,CACD,KAAM,SACN,KAAMA,EACP,CAAE,CACD,KAAM,OACN,KAAM,SAAU,EAAG,CACjB,OAAO,IAAM,MAEhB,CAAE,CACD,KAAM,YACN,KAAM,SAAU,EAAG,CACjB,OAAO,IAAM,IAAA,IAEhB,CAAC,CACI,EAAU,CACd,KAAM,MACN,KAAM,EACN,MAAO,GACR,CAOG,EACA,EAGA,EAAe,EAIf,EAAQ,CACV,YAAa,EACd,CASD,SAAS,EAAS,EAAU,CAC1B,IAAM,EAAO,EAAQ,IAAI,EAAS,CAClC,GAAI,EACF,OAAO,EAGT,IAAI,EAAU,iBAAmB,EAAW,IACtCC,EAAO,EAAS,aAAa,CAC/B,EACJ,IAAK,KAAa,EAChB,GAAI,EAAU,aAAa,GAAKA,EAAM,CACpC,GAAW,mBAAqB,EAAY,MAC5C,MAGJ,MAAU,UAAU,EAAQ,CAgB9B,SAAS,EAAS,EAAO,CACvB,IAAI,EAAa,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,MAC/E,EAAc,EAAa,EAAS,EAAW,CAAC,MAAQ,EAAS,OACjE,EAAW,EAAE,CACnB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAAG,CACrC,GAAI,CAAC,EAAM,IAAM,OAAO,EAAM,GAAG,MAAS,UAAY,OAAO,EAAM,GAAG,MAAS,WAC7E,MAAU,UAAU,iEAAiE,CAEvF,IAAM,EAAW,EAAM,GAAG,KAC1B,GAAI,EAAQ,IAAI,EAAS,CACvB,MAAU,UAAU,wBAA0B,EAAW,IAAI,CAE/D,EAAS,KAAK,EAAS,CACvB,EAAQ,IAAI,EAAU,CACpB,KAAM,EACN,KAAM,EAAM,GAAG,KACf,MAAO,EAAM,GAAG,MAChB,MAAO,EAAc,EACrB,cAAe,EAAE,CAClB,CAAC,CAGJ,IAAM,EAAgB,EAAS,MAAM,EAAY,CACjD,EAAW,EAAS,MAAM,EAAG,EAAY,CAAC,OAAO,EAAS,CAAC,OAAO,EAAc,CAEhF,IAAK,IAAI,EAAI,EAAc,EAAS,OAAQ,EAAI,EAAS,OAAQ,EAAE,EACjE,EAAQ,IAAI,EAAS,GAAG,CAAC,MAAQ,EAUrC,SAAS,GAAQ,CACf,EAAU,IAAI,IACd,EAAW,EAAE,CACb,EAAe,EACf,EAAS,CAAC,EAAQ,CAAE,GAAM,CAI5B,GAAO,CACP,EAAS,EAAO,CAKhB,SAAS,GAAmB,CAC1B,IAAI,EACJ,IAAK,KAAY,EACf,EAAQ,IAAI,EAAS,CAAC,cAAgB,EAAE,CAE1C,EAAe,EASjB,SAAS,EAAc,EAAO,CAC5B,IAAM,EAAU,EAAS,OAAO,GAAQ,CACtC,IAAM,EAAO,EAAQ,IAAIA,EAAK,CAC9B,MAAO,CAAC,EAAK,OAAS,EAAK,KAAK,EAAM,EACtC,CAIF,OAHI,EAAQ,OACH,EAEF,CAAC,MAAM,CAQhB,SAAS,EAAgB,EAAQ,CAC/B,OAAO,GAAU,OAAO,GAAW,YAAc,uBAAwB,EAqC3E,SAAS,EAAc,EAAI,EAAW,EAAS,CAC7C,GAAI,CAAC,EAAgB,EAAG,CACtB,MAAU,UAAU,EAAmB,CAIzC,IAAM,EAAQ,GAAW,EAAQ,MAE3B,EAAS,GADS,MAAM,QAAQ,EAAU,CAAG,EAAU,KAAK,IAAI,CAAG,EAC3B,CACxC,EAAqB,EAAgB,EAAO,CAGlD,GAAI,CAAC,GAAS,KAAsB,EAAG,WAAY,CAEjD,IAAM,EAAQ,EAAG,mBAAmB,aAAa,IAAI,EAAmB,CACxE,GAAI,EACF,OAAO,EAQX,IAAM,EAAU,EAAO,OACnB,EACJ,GAAI,EAAO,CACT,EAAsB,EAAE,CACxB,IAAIA,EACJ,IAAKA,KAAQ,EAAG,WACd,EAAoB,KAAK,EAAG,mBAAmB,aAAa,IAAIA,EAAK,CAAC,MAGxE,EAAsB,EAAG,mBAAmB,WAE9C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,EAAE,EAAG,CAChC,IAAM,EAAO,EAAO,GACd,EAAqB,EAAE,CACzB,EACJ,IAAK,KAAe,EAAqB,CACvC,IAAM,EAAO,EAAgB,EAAY,OAAQ,EAAE,CAC/C,MAAC,GAAQ,EAAK,WAAa,CAAC,EAAK,WAGrC,IAAI,CAAC,EAAK,OAAQ,CAEhB,IAAM,EAAY,GAAa,EAAK,CACpC,GAAI,EAAK,MAAM,KAAK,GAAS,CAAC,EAAU,IAAI,EAAM,KAAK,CAAC,CACtD,SAIJ,EAAmB,KAAK,EAAY,EAGtC,GADA,EAAsB,EAClB,EAAoB,SAAW,EAAG,MAGxC,IAAI,EACJ,IAAK,KAAa,EAChB,GAAI,EAAU,OAAO,QAAU,EAC7B,OAAO,EAGX,MAAU,UAAU,oCAAsC,EAAG,MAAQ,WAAa,IAAM,EAAgB,EAAQ,KAAK,CAAG,KAAK,CA6B/H,SAAS,EAAK,EAAI,EAAW,EAAS,CACpC,OAAO,EAAc,EAAI,EAAW,EAAQ,CAAC,eAS/C,SAAS,EAAQ,EAAO,EAAU,CAEhC,IAAM,EAAO,EAAS,EAAS,CAC/B,GAAI,EAAK,KAAK,EAAM,CAClB,OAAO,EAET,IAAM,EAAc,EAAK,cACzB,GAAI,EAAY,SAAW,EACzB,MAAU,MAAM,+BAAiC,EAAW,YAAY,CAE1E,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,OAAQ,IAEtC,GADiB,EAAS,EAAY,GAAG,KAAK,CACjC,KAAK,EAAM,CACtB,OAAO,EAAY,GAAG,QAAQ,EAAM,CAGxC,MAAU,MAAM,kBAAoB,EAAQ,OAAS,EAAS,CAShE,SAAS,EAAgB,EAAQ,CAC/B,IAAI,EAAY,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,IACpF,OAAO,EAAO,IAAI,GAAK,EAAE,KAAK,CAAC,KAAK,EAAU,CAQhD,SAAS,EAAW,EAAO,CACzB,IAAM,EAAY,EAAM,QAAQ,MAAM,GAAK,EAErC,GADS,EAAoB,EAAM,OAAS,EAAI,EAAM,MAAM,EAAE,CAAG,MAA5C,GACJ,MAAM,IAAI,CAAC,IAAI,GAAK,EAAS,EAAE,MAAM,CAAC,CAAC,CAC1D,EAAS,GACT,EAAY,EAAY,MAAQ,GAapC,MAAO,CACL,MAbiB,EAAS,IAAI,SAAU,EAAM,CAG9C,MAFA,GAAS,EAAK,OAAS,EACvB,GAAa,EAAK,KAAO,IAClB,CACL,KAAM,EAAK,KACX,UAAW,EAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,MACZ,WAAY,KACZ,gBAAiB,GAClB,EACD,CAGA,KAAM,EAAU,MAAM,EAAG,GAAG,CAE5B,SACA,cAAe,GACf,YACD,CASH,SAAS,GAAY,EAAO,CAE1B,IAAM,EAAsB,GADV,EAAM,MAAM,IAAI,GAAK,EAAE,KAAK,CACa,CACvD,EAAS,EAAM,OACf,EAAU,EAAM,KACd,EAAmB,EAAoB,IAAI,SAAU,EAAY,CACrE,IAAM,EAAO,EAAS,EAAW,KAAK,CAGtC,MAFA,GAAS,EAAK,OAAS,EACvB,GAAW,IAAM,EAAW,KACrB,CACL,KAAM,EAAW,KACjB,UAAW,EAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,MACZ,aACA,gBAAiB,EAAW,MAC7B,EACD,CACF,MAAO,CACL,MAAO,EAAM,MAAM,OAAO,EAAiB,CAC3C,KAAM,EACN,SACA,cAAe,EAAiB,OAAS,EACzC,UAAW,EAAM,UAClB,CAUH,SAAS,GAAa,EAAO,CAK3B,OAJK,EAAM,UACT,EAAM,QAAU,IAAI,IACpB,EAAM,MAAM,QAAQ,GAAQ,EAAM,QAAQ,IAAI,EAAK,KAAK,CAAC,EAEpD,EAAM,QAUf,SAAS,GAAe,EAAc,CACpC,IAAM,EAAS,EAAE,CACjB,GAAI,OAAO,GAAiB,SAC1B,MAAU,UAAU,6BAA6B,CAEnD,IAAM,EAAY,EAAa,MAAM,CACrC,GAAI,IAAc,GAChB,OAAO,EAET,IAAM,EAAY,EAAU,MAAM,IAAI,CACtC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,OAAQ,EAAE,EAAG,CACzC,IAAM,EAAc,EAAW,EAAU,GAAG,MAAM,CAAC,CACnD,GAAI,EAAY,WAAa,IAAM,EAAU,OAAS,EACpD,MAAU,YAAY,8BAAgC,EAAU,GAAK,yCAA8C,CAGrH,GAAI,EAAY,MAAM,SAAW,EAC/B,OAAO,KAET,EAAO,KAAK,EAAY,CAE1B,OAAO,EAQT,SAAS,EAAa,EAAQ,CAC5B,IAAM,EAAQ,EAAK,EAAO,CAC1B,OAAO,EAAQ,EAAM,UAAY,GASnC,SAAS,EAAY,EAAO,CAC1B,GAAI,CAAC,GAAS,EAAM,MAAM,SAAW,EAEnC,OAAO,KACE,EAAM,MAAM,SAAW,EAChC,OAAO,EAAS,EAAM,MAAM,GAAG,KAAK,CAAC,QAC5B,EAAM,MAAM,SAAW,EAAG,CACnC,IAAM,EAAQ,EAAS,EAAM,MAAM,GAAG,KAAK,CAAC,KACtC,EAAQ,EAAS,EAAM,MAAM,GAAG,KAAK,CAAC,KAC5C,OAAO,SAAY,EAAG,CACpB,OAAO,EAAM,EAAE,EAAI,EAAM,EAAE,MAExB,CAEL,IAAM,EAAQ,EAAM,MAAM,IAAI,SAAU,EAAM,CAC5C,OAAO,EAAS,EAAK,KAAK,CAAC,MAC3B,CACF,OAAO,SAAY,EAAG,CACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,EAAM,GAAG,EAAE,CACb,MAAO,GAGX,MAAO,KAUb,SAAS,GAAa,EAAQ,CAC5B,IAAI,EAAO,EAAO,EAClB,GAAI,EAAa,EAAO,CAAE,CAExB,EAAQ,GAAQ,EAAO,CAAC,IAAI,EAAY,CACxC,IAAM,EAAW,EAAM,OACjB,EAAW,EAAY,EAAK,EAAO,CAAC,CACpC,EAAgB,SAAU,EAAM,CACpC,IAAK,IAAI,EAAI,EAAU,EAAI,EAAK,OAAQ,IACtC,GAAI,CAAC,EAAS,EAAK,GAAG,CACpB,MAAO,GAGX,MAAO,IAET,OAAO,SAAkB,EAAM,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,CAAC,EAAM,GAAG,EAAK,GAAG,CACpB,MAAO,GAGX,OAAO,EAAc,EAAK,EAAI,EAAK,QAAU,EAAW,WAItD,EAAO,SAAW,EACpB,OAAO,SAAkB,EAAM,CAC7B,OAAO,EAAK,SAAW,WAEhB,EAAO,SAAW,EAE3B,MADA,GAAQ,EAAY,EAAO,GAAG,CACvB,SAAkB,EAAM,CAC7B,OAAO,EAAM,EAAK,GAAG,EAAI,EAAK,SAAW,WAElC,EAAO,SAAW,EAG3B,MAFA,GAAQ,EAAY,EAAO,GAAG,CAC9B,EAAQ,EAAY,EAAO,GAAG,CACvB,SAAkB,EAAM,CAC7B,OAAO,EAAM,EAAK,GAAG,EAAI,EAAM,EAAK,GAAG,EAAI,EAAK,SAAW,QAK7D,MADA,GAAQ,EAAO,IAAI,EAAY,CACxB,SAAkB,EAAM,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,CAAC,EAAM,GAAG,EAAK,GAAG,CACpB,MAAO,GAGX,OAAO,EAAK,SAAW,EAAM,QAcrC,SAAS,EAAgB,EAAQ,EAAO,CACtC,OAAO,EAAQ,EAAO,OAAS,EAAO,GAAS,EAAa,EAAO,CAAG,EAAK,EAAO,CAAG,KASvF,SAAS,EAAkB,EAAQ,EAAO,CACxC,IAAM,EAAQ,EAAgB,EAAQ,EAAM,CAI5C,OAHK,EAGE,GAAa,EAAM,CAFjB,IAAI,IAUf,SAAS,EAAY,EAAM,CACzB,OAAO,EAAK,aAAe,MAAQ,EAAK,aAAe,IAAA,GAUzD,SAAS,EAAoB,EAAY,EAAO,CAC9C,IAAM,EAAU,IAAI,IAQpB,OAPA,EAAW,QAAQ,GAAa,CAC9B,IAAM,EAAW,EAAkB,EAAU,OAAQ,EAAM,CACvDA,EACJ,IAAKA,KAAQ,EACX,EAAQ,IAAIA,EAAK,EAEnB,CACK,EAAQ,IAAI,MAAM,CAAG,CAAC,MAAM,CAAG,MAAM,KAAK,EAAQ,CAW3D,SAAS,EAAY,EAAM,EAAM,EAAY,CAC3C,IAAI,EAAK,EACH,EAAQA,GAAQ,UAGlB,EAAqB,EACrB,EACJ,IAAK,EAAQ,EAAG,EAAQ,EAAK,OAAQ,IAAS,CAC5C,IAAM,EAAmB,EAAE,CAQ3B,GAPA,EAAmB,QAAQ,GAAa,CAEtC,IAAM,EAAO,EADC,EAAgB,EAAU,OAAQ,EAAM,CACvB,EAC1B,EAAQ,EAAU,OAAO,QAAU,EAAa,EAAU,OAAO,GAAK,EAAK,EAAK,GAAO,EAC1F,EAAiB,KAAK,EAAU,EAElC,CACE,EAAiB,SAAW,EAG9B,IADA,EAAW,EAAoB,EAAoB,EAAM,CACrD,EAAS,OAAS,EAAG,CACvB,IAAM,EAAc,EAAc,EAAK,GAAO,CAS9C,MARA,GAAU,UAAU,2CAA6C,EAAQ,eAAiB,EAAS,KAAK,OAAO,CAAG,aAAe,EAAY,KAAK,MAAM,CAAG,YAAc,EAAQ,IAAI,CACrL,EAAI,KAAO,CACT,SAAU,YACV,GAAI,EACJ,QACA,OAAQ,EACR,WACD,CACM,QAGT,EAAqB,EAKzB,IAAM,EAAU,EAAmB,IAAI,SAAU,EAAW,CAC1D,OAAO,EAAa,EAAU,OAAO,CAAG,IAAW,EAAU,OAAO,QACpE,CACF,GAAI,EAAK,OAAS,KAAK,IAAI,MAAM,KAAM,EAAQ,CAS7C,MARA,GAAW,EAAoB,EAAoB,EAAM,CACzD,EAAU,UAAU,iCAAmC,EAAQ,eAAiB,EAAS,KAAK,OAAO,CAAG,YAAc,EAAK,OAAS,IAAI,CACxI,EAAI,KAAO,CACT,SAAU,aACV,GAAI,EACJ,MAAO,EAAK,OACZ,WACD,CACM,EAIT,IAAM,EAAY,KAAK,IAAI,MAAM,KAAM,EAAQ,CAC/C,GAAI,EAAK,OAAS,EAQhB,MAPA,GAAU,UAAU,kCAAoC,EAAQ,eAAiB,EAAY,aAAe,EAAK,OAAS,IAAI,CAC9H,EAAI,KAAO,CACT,SAAU,cACV,GAAI,EACJ,MAAO,EAAK,OACZ,eAAgB,EACjB,CACM,EAIT,IAAM,EAAW,EAAE,CACnB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EACjC,EAAS,KAAK,EAAc,EAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAOjD,MALA,GAAU,UAAU,sBAAwB,EAAS,KAAK,KAAK,CAAG,4DAA8D,EAAQ,IAAI,CAC5I,EAAI,KAAO,CACT,SAAU,WACV,OAAQ,EACT,CACM,EAQT,SAAS,EAAmB,EAAO,CACjC,IAAI,EAAM,EAAS,OAAS,EAC5B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,MAAM,OAAQ,IACtC,EAAM,KAAK,IAAI,EAAK,EAAM,MAAM,GAAG,UAAU,CAE/C,OAAO,EAST,SAAS,EAAyB,EAAO,CACvC,IAAI,EAAM,EAAe,EACzB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,MAAM,OAAQ,IACjC,EAAY,EAAM,MAAM,GAAG,GAC9B,EAAM,KAAK,IAAI,EAAK,EAAM,MAAM,GAAG,gBAAgB,EAGvD,OAAO,EAiBT,SAAS,GAAc,EAAQ,EAAQ,CAGrC,GAAI,EAAO,WACL,CAAC,EAAO,OACV,MAAO,YAEA,EAAO,OAChB,MAAO,IAIT,GAAI,EAAO,cACL,CAAC,EAAO,UACV,MAAO,aAEA,EAAO,UAChB,MAAO,KAIT,IAAM,EAAW,EAAmB,EAAO,CAAG,EAAmB,EAAO,CACxE,GAAI,EAAW,EACb,MAAO,MAET,GAAI,EAAW,EACb,MAAO,MAKT,IAAM,EAAQ,EAAyB,EAAO,CACxC,EAAQ,EAAyB,EAAO,CAC9C,GAAI,EAAO,kBACL,CAAC,EAAO,cACV,OAAQ,EAAI,GAAS,aAEd,EAAO,cAChB,MAAO,EAAE,EAAI,GAAS,KAIxB,IAAM,EAAW,EAAQ,EASzB,OARI,EAAW,EACN,MAEL,EAAW,EACN,KAIF,EAgBT,SAAS,EAAkB,EAAY,EAAY,CACjD,IAAM,EAAQ,EAAW,OACnB,EAAQ,EAAW,OACnB,EAAQ,EAAK,EAAM,CACnB,EAAQ,EAAK,EAAM,CACnB,EAAW,EAAa,EAAM,CAC9B,EAAW,EAAa,EAAM,CAGpC,GAAI,GAAY,EAAM,WAChB,CAAC,GAAY,CAAC,EAAM,OACtB,MAAO,aAEA,GAAY,EAAM,OAC3B,MAAO,KAIT,IAAI,EAAO,EACP,EAAQ,EACR,EACJ,IAAK,KAAO,EACN,EAAI,QAAQ,EAAE,EACd,EAAI,eAAe,EAAE,EAE3B,IAAI,EAAO,EACP,EAAQ,EACZ,IAAK,KAAO,EACN,EAAI,QAAQ,EAAE,EACd,EAAI,eAAe,EAAE,EAE3B,GAAI,IAAS,EACX,OAAQ,EAAO,GAAQ,IAIzB,GAAI,GAAY,EAAM,kBAChB,CAAC,GAAY,CAAC,EAAM,cACtB,MAAO,aAEA,GAAY,EAAM,cAC3B,MAAO,KAIT,GAAI,IAAU,EACZ,OAAQ,EAAQ,GAAS,IAI3B,GAAI,MACE,CAAC,EACH,MAAO,aAEA,EACT,MAAO,KAIT,IAAM,GAAmB,EAAM,OAAS,EAAM,SAAW,EAAW,KAAO,KAC3E,GAAI,IAAoB,EACtB,OAAO,EAOT,IAAM,EAAc,EAAE,CAClB,EAAK,EACT,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAAG,CACrC,IAAM,EAAiB,GAAc,EAAM,GAAI,EAAM,GAAG,CACxD,EAAY,KAAK,EAAe,CAChC,GAAM,EAER,GAAI,IAAO,EACT,OAAQ,EAAK,EAAI,IAAM,IAAM,EAO/B,IAAI,EACA,EAAQ,EACN,EAAY,GAAS,EAAY,OAAS,GAChD,IAAK,KAAK,EAAa,CACrB,GAAI,IAAM,EACR,OAAQ,EAAI,EAAI,CAAC,EAAQ,GAAS,EAEpC,GAAS,EAIX,MAAO,GAWT,SAAS,GAAqB,EAAW,CACvC,GAAI,EAAU,SAAW,EACvB,MAAO,EAAE,CAEX,IAAM,EAAQ,EAAU,IAAI,EAAS,CACrC,GAAI,EAAU,SAAW,EAAG,OAAO,EAAM,GAAG,cAK5C,IAAM,EAAa,IAAI,IAAI,EAAU,CAC/B,EAAmB,IAAI,IAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAClC,IAAK,IAAM,KAAS,EAAM,GAAG,cACtB,EAAW,IAAI,EAAM,KAAK,EAAE,EAAiB,IAAI,EAAM,KAAK,CAKrE,IAAM,EAAU,EAAE,CAClB,IAAK,IAAM,KAAY,EAAkB,CACvC,IAAI,EAAY,EAAe,EAC3B,EAAiB,KACrB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAClC,IAAK,IAAM,KAAS,EAAM,GAAG,cACvB,EAAM,OAAS,GAAY,EAAM,MAAQ,IAC3C,EAAY,EAAM,MAClB,EAAiB,GAIvB,EAAQ,KAAK,EAAe,CAE9B,OAAO,EAaT,SAAS,GAAyB,EAAQ,EAAI,CAC5C,IAAI,EAAY,EAIZA,EAAO,GACX,GAAI,EAAO,KAAK,GAAK,EAAE,cAAc,CAAE,CACrC,IAAM,EAAY,EAAa,EAAO,CAChC,EAAsB,EAAO,IAAI,EAAqB,CAC5D,EAAO,EAAoB,IAAI,GAAQ,EAAK,KAAK,CAAC,KAAK,IAAI,CAC3D,EAAY,UAAuB,CACjC,IAAM,EAAO,EAAE,CACTC,EAAO,EAAY,UAAU,OAAS,EAAI,UAAU,OAC1D,IAAK,IAAI,EAAI,EAAG,EAAIA,EAAM,IACxB,EAAK,GAAK,EAAoB,GAAG,UAAU,GAAG,CAKhD,OAHI,IACF,EAAKA,GAAQ,UAAUA,GAAM,IAAI,EAAoBA,GAAM,EAEtD,EAAG,MAAM,KAAM,EAAK,EAG/B,IAAI,EAAe,EACnB,GAAI,EAAa,EAAO,CAAE,CACxB,IAAM,EAAS,EAAO,OAAS,EAC/B,EAAe,UAAgC,CAC7C,OAAO,EAAU,MAAM,KAAM,GAAM,UAAW,EAAG,EAAO,CAAC,OAAO,CAAC,GAAM,UAAW,EAAO,CAAC,CAAC,CAAC,EAMhG,OAHID,GAAM,OAAO,eAAe,EAAc,OAAQ,CACpD,MAAOA,EACR,CAAC,CACK,EAST,SAAS,EAAqB,EAAO,CACnC,IAAI,EAAO,EAAO,EAAa,EACzB,EAAQ,EAAE,CACV,EAAc,EAAE,CAClBA,EAAO,GACX,EAAM,MAAM,QAAQ,SAAU,EAAM,CAC9B,EAAK,aACP,GAAQ,EAAK,WAAW,KAAO,KAAO,EAAK,WAAW,GAAK,IAC3D,EAAM,KAAK,EAAS,EAAK,WAAW,KAAK,CAAC,KAAK,CAC/C,EAAY,KAAK,EAAK,WAAW,QAAQ,GAE3C,CACF,AAAwC,EAApCA,EAAaA,EAAK,MAAM,EAAG,GAAG,CAAa,OAG/C,IAAI,EAAY,GAAO,EACvB,OAAQ,EAAY,OAApB,CACE,IAAK,GACH,MACF,IAAK,GACH,EAAQ,EAAM,GACd,EAAc,EAAY,GAC1B,EAAY,SAAoB,EAAK,CAInC,OAHI,EAAM,EAAI,CACL,EAAY,EAAI,CAElB,GAET,MACF,IAAK,GACH,EAAQ,EAAM,GACd,EAAQ,EAAM,GACd,EAAc,EAAY,GAC1B,EAAc,EAAY,GAC1B,EAAY,SAAoB,EAAK,CAOnC,OANI,EAAM,EAAI,CACL,EAAY,EAAI,CAErB,EAAM,EAAI,CACL,EAAY,EAAI,CAElB,GAET,MACF,QACE,EAAY,SAAoB,EAAK,CACnC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,OAAQ,IACtC,GAAI,EAAM,GAAG,EAAI,CACf,OAAO,EAAY,GAAG,EAAI,CAG9B,OAAO,GAMb,OAHA,OAAO,eAAe,EAAW,OAAQ,CACvC,MAAOA,EACR,CAAC,CACK,EAoBT,SAAS,GAAY,EAAQ,CAC3B,SAAS,EAAa,EAAQ,EAAO,EAAa,CAChD,GAAI,EAAQE,EAAO,OAAQ,CACzB,IAAM,EAAQA,EAAO,GACjB,EAAkB,EAAE,CACxB,GAAI,EAAM,UAAW,CAGnB,IAAM,EAAa,EAAM,MAAM,OAAO,EAAY,CAC9C,EAAW,OAAS,EAAM,MAAM,QAClC,EAAgB,KAAK,CACnB,MAAO,EACP,KAAM,MAAQ,EAAW,IAAI,GAAK,EAAE,KAAK,CAAC,KAAK,IAAI,CACnD,OAAQ,EAAW,KAAK,GAAK,EAAE,MAAM,CACrC,cAAe,GACf,UAAW,GACZ,CAAC,CAEJ,EAAgB,KAAK,EAAM,MAG3B,EAAkB,EAAM,MAAM,IAAI,SAAU,EAAM,CAChD,MAAO,CACL,MAAO,CAAC,EAAK,CACb,KAAM,EAAK,KACX,OAAQ,EAAK,MACb,cAAe,EAAK,WACpB,UAAW,GACZ,EACD,CAIJ,OAAO,GAAQ,EAAiB,SAAU,EAAW,CACnD,OAAO,EAAaA,EAAQ,EAAQ,EAAG,EAAY,OAAO,CAAC,EAAU,CAAC,CAAC,EACvE,MAGF,MAAO,CAAC,EAAY,CAGxB,OAAO,EAAa,EAAQ,EAAG,EAAE,CAAC,CASpC,SAAS,GAAY,EAAS,EAAS,CACrC,IAAM,EAAK,KAAK,IAAI,EAAQ,OAAQ,EAAQ,OAAO,CACnD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,IAAK,CAC3B,IAAM,EAAW,EAAkB,EAAS,EAAE,CACxC,EAAW,EAAkB,EAAS,EAAE,CAC1C,EAAU,GACVF,EACJ,IAAKA,KAAQ,EACX,GAAI,EAAS,IAAIA,EAAK,CAAE,CACtB,EAAU,GACV,MAGJ,GAAI,CAAC,EACH,MAAO,GAGX,IAAM,EAAO,EAAQ,OACf,EAAO,EAAQ,OACf,EAAa,EAAa,EAAQ,CAClC,EAAa,EAAa,EAAQ,CACxC,OAAO,EAAa,EAAa,IAAS,EAAO,GAAQ,EAAO,EAAa,GAAQ,EAAO,IAAS,EAWvG,SAAS,GAAiB,EAAc,CACtC,OAAO,EAAa,IAAI,GAClB,GAAc,EAAG,CACZ,GAAY,EAAG,YAAY,SAAS,CAEzC,EAAU,EAAG,CACR,GAAY,EAAG,QAAQ,WAAY,EAAG,QAAQ,SAAS,CAEzD,EACP,CAcJ,SAAS,GAAmB,EAAY,EAAc,EAAc,CAClE,IAAM,EAAqB,EAAE,CACzB,EACJ,IAAK,KAAa,EAAY,CAC5B,IAAI,EAAa,EAAa,GAC9B,GAAI,OAAO,GAAe,SACxB,MAAU,UAAU,2CAA6C,EAAY,IAAI,CAGnF,GADA,EAAa,EAAa,GACtB,OAAO,GAAe,WACxB,MAAO,GAET,EAAmB,KAAK,EAAW,CAErC,OAAO,EAcT,SAAS,GAAkB,EAAc,EAAc,EAAM,CAC3D,IAAM,EAAoB,GAAiB,EAAa,CAClD,EAAiB,MAAM,EAAkB,OAAO,CAAC,KAAK,GAAM,CAC9D,EAAiB,GACrB,KAAO,GAAgB,CACrB,EAAiB,GACjB,IAAI,EAAkB,GACtB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAkB,OAAQ,EAAE,EAAG,CACjD,GAAI,EAAW,GAAI,SACnB,IAAM,EAAK,EAAkB,GAC7B,GAAI,GAAc,EAAG,CACnB,EAAkB,GAAK,EAAG,YAAY,SAASG,EAAK,CAEpD,EAAkB,GAAG,YAAc,EAAG,YACtC,EAAW,GAAK,GAChB,EAAkB,WACT,EAAU,EAAG,CAAE,CACxB,IAAM,EAAqB,GAAmB,EAAG,QAAQ,WAAY,EAAmB,EAAa,CACjG,GACF,EAAkB,GAAK,EAAG,QAAQ,SAAS,MAAM,KAAM,EAAmB,CAE1E,EAAkB,GAAG,QAAU,EAAG,QAClC,EAAW,GAAK,GAChB,EAAkB,IAElB,EAAiB,IAIvB,GAAI,GAAmB,EACrB,MAAU,YAAY,yDAAyD,CAGnF,OAAO,EAUT,SAAS,EAAuB,EAAe,CAI7C,IAAM,EAAsB,4BAC5B,OAAO,KAAK,EAAc,CAAC,QAAQ,GAAa,CAC9C,IAAM,EAAK,EAAc,GACzB,GAAI,EAAoB,KAAK,EAAG,UAAU,CAAC,CACzC,MAAU,YAAY,mIAA6I,EAErK,CAaJ,SAAS,EAAoB,EAAM,EAAkB,CAEnD,GADA,EAAM,cACF,OAAO,KAAK,EAAiB,CAAC,SAAW,EAC3C,MAAU,YAAY,yBAAyB,CAE7C,EAAM,2BACR,EAAuB,EAAiB,CAI1C,IAAM,EAAe,EAAE,CACjB,EAAoB,EAAE,CACtB,EAAgB,EAAE,CAClB,EAAwB,EAAE,CAC5B,EACJ,IAAK,KAAa,EAAkB,CAElC,GAAI,CAAC,OAAO,UAAU,eAAe,KAAK,EAAkB,EAAU,CACpE,SAGF,IAAM,EAAS,GAAe,EAAU,CACxC,GAAI,CAAC,EAAQ,SAEb,EAAa,QAAQ,SAAU,EAAI,CACjC,GAAI,GAAY,EAAI,EAAO,CACzB,MAAU,UAAU,2BAA6B,EAAgB,EAAG,CAAG,UAAY,EAAgB,EAAO,CAAG,KAAK,EAEpH,CACF,EAAa,KAAK,EAAO,CAEzB,IAAM,EAAgB,EAAkB,OACxC,EAAkB,KAAK,EAAiB,GAAW,CACnD,IAAM,EAAmB,EAAO,IAAI,GAAY,CAE5C,EACJ,IAAK,KAAM,GAAY,EAAiB,CAAE,CACxC,IAAM,EAAS,EAAgB,EAAG,CAClC,EAAsB,KAAK,CACzB,OAAQ,EACR,KAAM,EACN,GAAI,EACL,CAAC,CACE,EAAG,MAAM,GAAK,CAAC,EAAE,cAAc,GACjC,EAAc,GAAU,IAI9B,EAAsB,KAAK,EAAkB,CAG7C,IAAM,EAAoB,GAAkB,EAAmB,EAAe,EAAW,CAGrF,EACJ,IAAK,KAAK,EACJ,OAAO,UAAU,eAAe,KAAK,EAAe,EAAE,GACxD,EAAc,GAAK,EAAkB,EAAc,KAGvD,IAAM,EAAa,EAAE,CACf,EAAuB,IAAI,IACjC,IAAK,KAAK,EAIH,EAAqB,IAAI,EAAE,KAAK,GACnC,EAAE,GAAK,EAAkB,EAAE,IAC3B,EAAW,KAAK,EAAE,CAClB,EAAqB,IAAI,EAAE,KAAM,EAAE,EAKvC,IAAM,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAQ,GAAO,GAAO,GAAO,GAAO,GAAO,EAGjD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,EAAE,EACvC,EAAW,GAAG,KAAO,GAAa,EAAW,GAAG,OAAO,CAEzD,IAAM,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,GAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,GAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,GAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EAG5D,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,EAAE,EACvC,EAAW,GAAG,eAAiB,GAAyB,EAAW,GAAG,OAAQ,EAAW,GAAG,GAAG,CAEjG,IAAM,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,EAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAG3C,EAAS,EAAQ,EAAI,EACrB,GAAO,EAAW,OAElB,GAAQ,EAAW,IAAI,GAAKC,EAAE,KAAK,CACnC,GAAM,EAAW,IAAI,GAAKA,EAAE,eAAe,CAC3C,EAAU,UAAmB,CAEjC,IAAK,IAAI,EAAI,EAAQ,EAAI,GAAM,IAC7B,GAAI,GAAM,GAAG,UAAU,CACrB,OAAO,GAAI,GAAG,MAAM,KAAM,UAAU,CAGxC,OAAO,EAAM,WAAWJ,EAAM,UAAW,EAAW,EAKtD,SAAS,EAAW,EAAM,EAAM,CAoB9B,OAlBI,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,EAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,GAAQ,GAAO,EAAK,EAAI,EAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,EAAO,EAAK,CACpD,EAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,GAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,GAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,EAAO,EAAK,CACpD,EAAI,MAAM,KAAM,UAAU,CAE5B,EAAQ,MAAM,KAAM,UAAU,CAIvC,GAAI,CACF,OAAO,eAAe,EAAY,OAAQ,CACxC,MAAOA,EACR,CAAC,MACU,EAiBd,MARA,GAAW,WAAa,EAIxB,EAAW,mBAAqB,CAC9B,aACA,aAAc,EACf,CACM,EAST,SAAS,GAAY,EAAM,EAAM,EAAY,CAC3C,MAAM,EAAYA,EAAM,EAAM,EAAW,CAQ3C,SAAS,GAAQ,EAAK,CACpB,OAAO,GAAM,EAAK,EAAG,EAAI,OAAS,EAAE,CAQtC,SAAS,EAAK,EAAK,CACjB,OAAO,EAAI,EAAI,OAAS,GAU1B,SAAS,GAAM,EAAK,EAAO,EAAK,CAC9B,OAAO,MAAM,UAAU,MAAM,KAAK,EAAK,EAAO,EAAI,CAUpD,SAAS,EAAY,EAAK,EAAM,CAC9B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,EAAK,EAAI,GAAG,CACd,OAAO,EAAI,GAajB,SAAS,GAAQ,EAAK,EAAU,CAC9B,OAAO,MAAM,UAAU,OAAO,MAAM,EAAE,CAAE,EAAI,IAAI,EAAS,CAAC,CAc5D,SAAS,IAAU,CACjB,IAAM,EAAa,GAAQ,UAAU,CAAC,IAAI,GAAK,EAAgB,GAAe,EAAE,CAAC,CAAC,CAC5E,EAAW,EAAK,UAAU,CAChC,GAAI,OAAO,GAAa,WACtB,MAAU,UAAU,8CAA8C,CAEpE,OAAO,GAAY,EAAY,EAAS,CAE1C,SAAS,GAAY,EAAY,EAAU,CACzC,MAAO,CACL,QAAS,CACP,aACA,WACD,CACF,CASH,SAAS,GAAY,EAAU,CAC7B,GAAI,OAAO,GAAa,WACtB,MAAU,UAAU,+CAA+C,CAErE,MAAO,CACL,YAAa,CACX,WACD,CACF,CAUH,SAAS,EAAU,EAAY,CAC7B,OAAO,GAAc,OAAO,EAAW,SAAY,UAAY,MAAM,QAAQ,EAAW,QAAQ,WAAW,EAAI,OAAO,EAAW,QAAQ,UAAa,WAUxJ,SAAS,GAAc,EAAY,CACjC,OAAO,GAAc,OAAO,EAAW,aAAgB,UAAY,OAAO,EAAW,YAAY,UAAa,WAWhH,SAAS,GAAU,EAAW,EAAS,CACrC,GAAI,CAAC,EACH,OAAO,EAET,GAAI,GAAW,IAAY,EAAW,CACpC,IAAM,EAAU,MAAM,0CAA4C,EAAY,aAAe,EAAU,IAAI,CAK3G,KAJA,GAAI,KAAO,CACT,OAAQ,EACR,SAAU,EACX,CACK,EAER,OAAO,EAST,SAAS,GAAc,EAAK,CAC1B,IAAIA,EACJ,IAAK,IAAM,KAAO,EAGZ,OAAO,UAAU,eAAe,KAAK,EAAK,EAAI,GAAK,EAAgB,EAAI,GAAK,EAAI,OAAO,EAAI,GAAK,WAAc,YAChH,EAAO,GAAUA,EAAM,EAAI,GAAK,KAAK,EAGzC,OAAOA,EAUT,SAAS,EAAgB,EAAM,EAAQ,CACrC,IAAI,EACJ,IAAK,KAAO,EACV,GAAI,OAAO,UAAU,eAAe,KAAK,EAAQ,EAAI,CAAE,CACrD,GAAI,KAAO,GACL,EAAO,KAAS,EAAK,GAAM,CAC7B,IAAM,EAAU,MAAM,cAAgB,EAAM,qBAAqB,CAMjE,KALA,GAAI,KAAO,CACT,UAAW,EACX,eAAgB,EAAO,GACvB,aAAc,EAAK,GACpB,CACK,EAIV,EAAK,GAAO,EAAO,IAIzB,IAAM,EAAY,EAwBlB,EAAQ,SAAU,EAAW,CAC3B,IAAM,EAAQ,OAAO,GAAc,SAC7B,EAAQ,EAAQ,EAAI,EACtBA,EAAO,EAAQ,EAAY,GACzB,EAAgB,EAAE,CACxB,IAAK,IAAI,EAAI,EAAO,EAAI,UAAU,OAAQ,EAAE,EAAG,CAC7C,IAAM,EAAO,UAAU,GACnB,EAAkB,EAAE,CACpB,EAiBJ,GAhBI,OAAO,GAAS,YAClB,EAAW,EAAK,KACZ,OAAO,EAAK,WAAc,SAE5B,EAAgB,EAAK,WAAa,EACzB,EAAgB,EAAK,GAE9B,EAAkB,EAAK,aAEhBD,EAAc,EAAK,GAE5B,EAAkB,EACb,IACH,EAAW,GAAc,EAAK,GAG9B,OAAO,KAAK,EAAgB,CAAC,SAAW,EAAG,CAC7C,IAAM,EAAU,UAAU,gCAAoC,EAAI,6FAAkG,CAKpK,KAJA,GAAI,KAAO,CACT,MAAO,EACP,SAAU,EACX,CACK,EAEH,IACH,EAAO,GAAUC,EAAM,EAAS,EAElC,EAAgB,EAAe,EAAgB,CAEjD,OAAO,EAAoBA,GAAQ,GAAI,EAAc,EAEvD,EAAM,OAASF,EACf,EAAM,YAAc,EAAU,YAC9B,EAAM,WAAa,GACnB,EAAM,mBAAqB,GAC3B,EAAM,YAAc,EACpB,EAAM,MAAQ,EACd,EAAM,iBAAmB,EACzB,EAAM,SAAW,EACjB,EAAM,UAAY,EAClB,EAAM,QAAU,GAChB,EAAM,YAAc,GACpB,EAAM,QAAU,EAChB,EAAM,cAAgB,EACtB,EAAM,KAAO,EACb,EAAM,gBAAkB,EACxB,EAAM,0BAA4B,GAUlC,EAAM,QAAU,SAAU,EAAM,EAAkB,CAChD,IAAI,EAAS,MACT,IAAqB,IAAS,EAAQ,IAAI,SAAS,GACrD,EAAS,UAEX,EAAM,SAAS,CAAC,EAAK,CAAE,EAAO,EAUhC,SAAS,GAAoB,EAAY,CACvC,GAAI,CAAC,GAAc,OAAO,EAAW,MAAS,UAAY,OAAO,EAAW,IAAO,UAAY,OAAO,EAAW,SAAY,WAC3H,MAAU,UAAU,gFAAgF,CAEtG,GAAI,EAAW,KAAO,EAAW,KAC/B,MAAU,YAAY,sCAAwC,EAAW,KAAO,eAAe,CA+FnG,MAnFA,GAAM,cAAgB,SAAU,EAAY,CAC1C,IAAI,EAAU,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,CAChF,SAAU,GACX,CACD,GAAoB,EAAW,CAC/B,IAAM,EAAK,EAAS,EAAW,GAAG,CAC5B,EAAW,EAAG,cAAc,KAAK,GAAS,EAAM,OAAS,EAAW,KAAK,CAC/E,GAAI,EACF,GAAI,GAAW,EAAQ,SACrB,EAAM,iBAAiB,CACrB,KAAM,EAAS,KACf,GAAI,EAAW,GACf,QAAS,EAAS,QACnB,CAAC,MAEF,MAAU,MAAM,uCAAyC,EAAW,KAAO,SAAW,EAAG,KAAO,IAAI,CAGxG,EAAG,cAAc,KAAK,CACpB,KAAM,EAAW,KACjB,GAAI,EAAG,KACP,QAAS,EAAW,QACpB,MAAO,IACR,CAAC,EAWJ,EAAM,eAAiB,SAAU,EAAa,EAAS,CACrD,EAAY,QAAQ,GAAc,EAAM,cAAc,EAAY,EAAQ,CAAC,EAY7E,EAAM,iBAAmB,SAAU,EAAY,CAC7C,GAAoB,EAAW,CAC/B,IAAM,EAAK,EAAS,EAAW,GAAG,CAC5B,EAAqB,EAAY,EAAG,cAAe,GAAK,EAAE,OAAS,EAAW,KAAK,CACzF,GAAI,CAAC,EACH,MAAU,MAAM,iDAAmD,EAAW,KAAO,OAAS,EAAW,GAAG,CAE9G,GAAI,EAAmB,UAAY,EAAW,QAC5C,MAAU,MAAM,0DAA0D,CAE5E,IAAM,EAAQ,EAAG,cAAc,QAAQ,EAAmB,CAC1D,EAAG,cAAc,OAAO,EAAO,EAAE,EAanC,EAAM,QAAU,SAAU,EAAI,EAAS,CACrC,GAAI,CAAC,EAAgB,EAAG,CACtB,MAAU,UAAU,EAAmB,CAEzC,IAAM,EAAO,EAAG,mBAAmB,WACnC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EACjC,GAAI,EAAK,GAAG,KAAK,EAAQ,CACvB,OAAO,EAAK,GAGhB,OAAO,MAEF,EAIT,OAFoBA,GAAQ,GAI3B,iBCp3DC,GAAgB,UAAwB,CAI1C,MADA,IAAgBQ,GAAAA,QAAc,OACvBA,GAAAA,SASE,GAA6B,EAAQ,QAP7B,CAAC,aAAc,WAAY,eAAgB,YAAY,CAOH,SAAqB,EAAM,CAChG,GAAI,CACF,YACA,UACA,cACA,YACE,EAIA,EAAQ,IAAe,CAsX3B,OAjXA,EAAM,OAAO,CACb,EAAM,SAAS,CAAC,CACd,KAAM,SACN,KAAM,EACP,CAAE,CACD,KAAM,UACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,EACP,CAAE,CACD,KAAM,SACN,KAAM,GACP,CAAE,CACD,KAAM,WACN,KAAM,EACP,CAAE,CACD,KAAM,OACN,KAAM,EACP,CAMD,CACE,KAAM,aACN,KAAM,GAAK,GAAY,ypgBAAypgB,KAAK,EAAE,CACxrgB,CAAE,CACD,KAAM,SACN,KAAM,EACP,CAAE,CACD,KAAM,QACN,KAAM,GACP,CAAE,CACD,KAAM,QACN,KAAM,EACP,CAAE,CACD,KAAM,SACN,KAAM,EACP,CAAE,CACD,KAAM,cACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,EACP,CAAE,CACD,KAAM,QACN,KAAM,GACP,CAAE,CACD,KAAM,QACN,KAAM,GACP,CAAE,CACD,KAAM,UACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,OACN,KAAM,GACP,CAAE,CACD,KAAM,WACN,KAAM,GACP,CAAE,CACD,KAAM,OACN,KAAM,GACP,CAAE,CACD,KAAM,SACN,KAAM,GACP,CAAE,CACD,KAAM,OACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,iBACN,KAAM,GACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,kBACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,EACP,CAAE,CACD,KAAM,eACN,KAAM,GACP,CAAE,CACD,KAAM,yBACN,KAAM,GACP,CAAE,CACD,KAAM,YACN,KAAM,EACP,CAAE,CACD,KAAM,OACN,KAAM,EACP,CAAE,CACD,KAAM,aACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,GACP,CAAE,CACD,KAAM,kBACN,KAAM,GACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,iBACN,KAAM,GACP,CAAE,CACD,KAAM,aACN,KAAM,EACP,CAAE,CACD,KAAM,MACN,KAAM,EACP,CAAE,CACD,KAAM,SACN,KAAM,EACP,CACA,CAAC,CACF,EAAM,eAAe,CAAC,CACpB,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAM3B,GALK,GACH,GAAiB,EAAE,CAIjB,GAAO,EAAE,CAAG,GACd,MAAU,UAAU,uFAA8F,EAAI,wDAA6D,CAErL,OAAO,IAAI,EAAU,EAAE,EAE1B,CAAE,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAe,EAAE,CAEZ,IAAI,EAAQ,EAAG,EAAE,EAE3B,CAAE,CACD,KAAM,YACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAe,EAAE,CAEZ,IAAI,EAAQ,EAAE,UAAU,CAAE,EAAE,EAEtC,CAAE,CACD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,GAAI,UACF,MAAU,UAAU,gGAAuG,EAAI,IAAI,CAErI,OAAO,OAAO,EAAE,EAEnB,CAAE,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAiB,EAAE,CAEd,IAAI,EAAU,EAAE,UAAU,CAAC,EAErC,CAAE,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAgB,EAAE,CAEb,IAAI,EAAS,EAAE,EAEzB,CAAE,CACD,KAAM,WACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAC3B,MAAU,UAAU,4JAAiK,EAExL,CAAE,CACD,KAAM,WACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAe,EAAE,CAEZ,IAAI,EAAQ,EAAE,SAAS,CAAE,EAAE,EAErC,CAAE,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAgB,EAAE,CAEpB,IAAI,EAAI,IAAI,EAAS,EAAE,CACvB,GAAI,EAAE,SAAS,GAAK,EAClB,MAAU,UAAU,mGAA0G,EAAI,sDAA2D,CAE/L,OAAO,GAEV,CAAE,CAQD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,IAAI,EAAI,OAAO,EAAE,CACjB,GAAI,MAAM,EAAE,CACV,MAAU,MAAM,mBAAqB,EAAI,gBAAgB,CAE3D,OAAO,GAEV,CAAE,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAiB,EAAE,CAErB,GAAI,CACF,OAAO,IAAI,EAAU,EAAE,MACX,CACZ,MAAU,MAAM,mBAAqB,EAAI,iBAAiB,GAG/D,CAAE,CACD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,GAAI,CACF,OAAO,OAAO,EAAE,MACJ,CACZ,MAAU,MAAM,mBAAqB,EAAI,cAAc,GAG5D,CAAE,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAgB,EAAE,CAEpB,GAAI,CACF,OAAO,IAAI,EAAS,EAAE,MACV,CACZ,MAAU,MAAM,mBAAqB,EAAI,gBAAgB,GAG9D,CAAE,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAe,EAAE,CAEnB,GAAI,CACF,OAAO,IAAI,EAAQ,EAAE,MACT,CACZ,MAAU,MAAM,mBAAqB,EAAI,eAAe,GAG7D,CAAE,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,MAAO,CAAC,GAEX,CAAE,CACD,KAAM,UACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAiB,EAAE,CAEd,IAAI,EAAU,CAAC,EAAE,EAE3B,CAAE,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,OAAO,OAAO,CAAC,EAAE,EAEpB,CAAE,CACD,KAAM,UACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAgB,EAAE,CAEb,IAAI,EAAS,CAAC,EAAE,EAE1B,CAAE,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,OAAO,OAAO,EAAE,EAEnB,CAAE,CACD,KAAM,QACN,GAAI,SACJ,QAAS,SAAiB,EAAO,CAI/B,OAHK,GACH,IAAe,CAEV,IAAI,EAAY,EAAM,EAEhC,CAAE,CACD,KAAM,SACN,GAAI,QACJ,QAAS,SAAiB,EAAQ,CAChC,OAAO,EAAO,SAAS,EAE1B,CAAC,CAAC,CAMH,EAAM,YAAc,EAAM,EAAM,IAAe,CAC7C,IAAI,EAAa,EAAM,YAAYG,EAAM,EAAM,EAAW,CAC1D,GAAI,CAAC,YAAa,WAAW,CAAC,SAAS,EAAW,KAAK,SAAS,EAAI,EAAK,SAAW,GAAK,EAAa,EAAK,GAAG,EAE9G,EAAW,KAAK,GAAO,CAAC,EAAI,OAAO,SAAS,IAAI,CAAC,CAAE,CACjD,IAAI,EAAU,UAAU,aAAoBA,qFAAuGA,OAAa,CAEhK,KADA,GAAI,KAAO,EAAW,KAChB,EAER,MAAM,GAOR,EAAM,YAAc,EAAM,EAAM,IAAe,CAC7C,IAAI,EAAa,EAAM,YAAYA,EAAM,EAAM,EAAW,CAC1D,GAAI,CAAC,YAAa,WAAW,CAAC,SAAS,EAAW,KAAK,SAAS,EAAI,EAAK,SAAW,GAAK,EAAa,EAAK,GAAG,EAE9G,EAAW,KAAK,GAAO,CAAC,EAAI,OAAO,SAAS,IAAI,CAAC,CAAE,CACjD,IAAI,EAAU,UAAU,aAAoBA,qFAAuGA,OAAa,CAEhK,KADA,GAAI,KAAO,EAAW,KAChB,EAER,MAAM,GAED,GACP,CACF,SAAS,GAAiB,EAAG,CAC3B,MAAU,MAAM,wBAA+B,oDAAuD,CAExG,SAAS,GAAe,EAAG,CACzB,MAAU,MAAM,wBAA+B,uDAA0D,CAE3G,SAAS,IAAgB,CACvB,MAAU,MAAM,sEAAwE,CAE1F,SAAS,GAAgB,EAAG,CAC1B,MAAU,MAAM,wBAA+B,mDAAsD,CClcvG,IAAW,GAAiC,EAFjC,YACQ,EAAE,KACyD,CAO5E,SAAS,EAAU,EAAS,CAC1B,GAAI,EAAE,gBAAgB,GACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,QAAU,GAAW,EAAE,CAkD9B,MA5CA,GAAU,UAAU,KAAO,YAC3B,EAAU,UAAU,YAAc,GAOlC,EAAU,UAAU,QAAU,UAAY,CACxC,OAAO,KAAK,SAQd,EAAU,UAAU,SAAW,UAAY,CACzC,MAAO,IAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,KAAK,CAAG,KASrD,EAAU,UAAU,OAAS,UAAY,CACvC,MAAO,CACL,OAAQ,YACR,QAAS,KAAK,QACf,EAUH,EAAU,SAAW,SAAU,EAAM,CACnC,OAAO,IAAI,EAAU,EAAK,QAAQ,EAE7B,GACN,CACD,QAAS,GACV,CAAC,CCzDF,SAAS,GAAsB,EAAG,EAAM,EAAM,CAC5C,IAAI,EAAgB,EAAE,YAClB,EAAO,IAAI,EAAc,EAAE,CAC3B,EAAS,GACb,GAAI,EAAM,CACR,GAAI,EAAO,EACT,MAAU,MAAM,iCAAiC,CAEnD,GAAI,CAAC,EAAU,EAAK,CAClB,MAAU,MAAM,0BAA0B,CAE5C,GAAI,EAAE,YAAY,EAAK,IAAI,EAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAI,EAAE,SAAS,EAAK,IAAI,EAAO,EAAE,CAAC,IAAI,GAAG,CAAC,CACpF,MAAU,MAAM,8BAAqC,EAAO,QAAkB,EAAO,OAAU,CAEjG,GAAI,CAAC,EAAE,WAAW,CAChB,MAAU,MAAM,2BAA2B,CAEzC,EAAE,SAAS,EAAE,GACf,EAAI,EAAE,IAAI,EAAK,IAAI,EAAK,CAAC,EAE3B,EAAS,IAAW,IAEtB,OAAQ,EAAR,CACE,IAAK,GACH,MAAO,GAAU,EAAE,UAAU,GAAS,IACxC,IAAK,GACH,MAAO,GAAU,EAAE,SAAS,GAAS,IACvC,IAAK,IACH,MAAO,GAAU,EAAE,eAAe,GAAS,IAC7C,QACE,MAAU,MAAM,QAAe,mBAAyB,EAqF9D,SAAgBG,GAAO,EAAO,EAAS,CACrC,GAAI,OAAO,GAAY,WAErB,OAAO,EAAQ,EAAM,CAIvB,GAAI,CAAC,EAAM,UAAU,CACnB,OAAO,EAAM,OAAO,CAAG,MAAQ,EAAM,GAAG,EAAE,CAAG,WAAa,YAE5D,GAAI,CACF,WACA,YACA,YACE,GAAuB,EAAQ,CAGnC,OAAQ,EAAR,CACE,IAAK,QACH,OAAO,GAAQ,EAAO,EAAU,CAClC,IAAK,cACH,OAAO,GAAc,EAAO,EAAU,CACxC,IAAK,cACH,OAAO,GAAc,EAAO,EAAU,CACxC,IAAK,MACH,OAAO,GAAsB,EAAO,EAAG,EAAS,CAClD,IAAK,MACH,OAAO,GAAsB,EAAO,EAAG,EAAS,CAClD,IAAK,MACH,OAAO,GAAsB,EAAO,GAAI,EAAS,CACnD,IAAK,OAID,IAAI,EAAW,GAAmB,GAA0D,SAAU,GAAG,CACrG,EAAW,GAAmB,GAA0D,SAAU,EAAE,CAGxG,GAAI,EAAM,QAAQ,CAAE,MAAO,IAG3B,IAAI,EACA,EAAU,EAAM,oBAAoB,EAAU,CAC9C,EAAM,EAAQ,EAUlB,MATA,CAKE,EALE,GAAO,GAAY,EAAM,EAErB,EAAQ,SAAS,CAGjB,GAAc,EAAO,EAAU,CAIhC,EAAI,QAAQ,sBAAuB,UAAY,CACpD,IAAIC,EAAS,UAAU,GACnBC,EAAI,UAAU,GAClB,OAAOD,IAAW,IAAmBC,EAAbD,EAASC,GACjC,CAEN,QACE,MAAU,MAAM,qBAAuB,EAAW,mEAAwE,EAShI,SAAgB,GAAc,EAAO,EAAW,CAE9C,IAAIA,EAAI,EAAM,EACV,EAASA,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAI3D,EADkB,EAAM,IAAa,IAAI,CAAC,EAAQ,CACvB,YAAY,EAAU,CACrD,GAAI,EAAS,SAAS,IAAI,CAAE,CAC1B,IAAI,EAAY,EAAM,YACtB,EAAW,IAAI,EAAU,EAAS,CAAC,SAAS,CAE9C,OAAO,EAAW,KAAOA,GAAK,EAAI,IAAM,IAAM,EAAO,UAAU,CAWjE,SAAgB,GAAc,EAAO,EAAW,CAI5C,OAHE,IAAc,IAAA,GAGT,EAAM,eAAe,CAFrB,EAAM,cAAc,EAAY,EAAE,CAY7C,SAAgB,GAAQ,EAAO,EAAW,CACxC,OAAO,EAAM,QAAQ,EAAU,CAEjC,SAAS,GAAmB,EAAO,EAAc,CAM7C,OALE,EAAS,EAAM,CACV,EACE,EAAY,EAAM,CACpB,EAAM,UAAU,CAEhB,EC3LX,SAAgB,GAAO,EAAO,EAAS,CACrC,IAAI,EAAS,GAAQ,EAAO,EAAQ,CAIpC,OAHI,GAAW,OAAO,GAAY,UAAY,aAAc,GAAW,EAAO,OAAS,EAAQ,SACtF,EAAO,UAAU,EAAG,EAAQ,SAAW,EAAE,CAAG,MAE9C,EAET,SAAS,GAAQ,EAAO,EAAS,CAyC/B,OAxCI,OAAO,GAAU,SACZC,GAAa,EAAO,EAAQ,CAEjC,EAAY,EAAM,CACbC,GAAgB,EAAO,EAAQ,CAKpC,GAAkB,EAAM,CACtB,CAAC,GAAW,EAAQ,WAAa,UAE5B,GAAU,EAAM,EAAI,EAAM,KAAe,EAAM,IAG/C,EAAM,UAAU,CAGvB,MAAM,QAAQ,EAAM,CACf,GAAY,EAAO,EAAQ,CAEhC,EAAS,EAAM,CACV,GAAU,EAAM,CAErB,OAAO,GAAU,WACZ,EAAM,OAAS,OAAO,EAAM,OAAO,CAAG,WAE3C,GAAS,OAAO,GAAU,SACxB,OAAO,EAAM,QAAW,WACnB,EAAM,OAAO,EAAQ,CACnB,GAAS,EAAM,SAAS,EAAQ,GAAK,EAAE,CAAC,UAAU,CAEpD,EAAM,SAAS,EAAQ,CAKvB,IAHO,OAAO,KAAK,EAAM,CAAC,IAAI,GAC5B,GAAU,EAAI,CAAG,KAAO,GAAO,EAAM,GAAM,EAAQ,CAC1D,CACmB,KAAK,KAAK,CAAG,IAG/B,OAAO,EAAM,CAStB,SAAgB,GAAU,EAAO,CAI/B,IAHA,IAAI,EAAO,OAAO,EAAM,CACpB,EAAU,GACV,EAAI,EACD,EAAI,EAAK,QAAQ,CACtB,IAAI,EAAI,EAAK,OAAO,EAAE,CACtB,GAAW,KAAK,GAAoB,GAAkB,GAAK,EAC3D,IAEF,MAAO,IAAM,EAAU,IAEzB,IAAI,GAAoB,CACtB,IAAK,MACL,KAAM,OACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,IAAM,MACP,CAOD,SAAgB,EAAO,EAAO,CAC5B,IAAI,EAAO,OAAO,EAAM,CAExB,MADA,GAAO,EAAK,QAAQ,KAAM,QAAQ,CAAC,QAAQ,KAAM,SAAS,CAAC,QAAQ,KAAM,QAAQ,CAAC,QAAQ,KAAM,OAAO,CAAC,QAAQ,KAAM,OAAO,CACtH,EAaT,SAAS,GAAY,EAAO,EAAS,CACnC,GAAI,MAAM,QAAQ,EAAM,CAAE,CAGxB,IAAK,IAFD,EAAM,IACN,EAAM,EAAM,OACP,EAAI,EAAG,EAAI,EAAK,IACnB,IAAM,IACR,GAAO,MAET,GAAO,GAAY,EAAM,GAAI,EAAQ,CAGvC,MADA,IAAO,IACA,OAEP,OAAO,GAAO,EAAO,EAAQ,CASjC,SAAS,GAAkB,EAAO,CAChC,OAAO,GAAS,OAAO,GAAU,UAAY,OAAO,EAAM,GAAM,UAAY,OAAO,EAAM,GAAM,UAAY,OAAO,EAAM,GAAM,UAAY,GC/K5I,SAAS,GAAQ,EAAG,CAClB,0BAEA,MAAO,IAAwB,OAAO,QAArB,YAA2C,OAAO,OAAO,UAA1B,SAAqC,SAAU,EAAG,CAChG,OAAO,OAAOC,GACZ,SAAU,EAAG,CACf,OAAOA,GAAmB,OAAO,QAArB,YAA+BA,EAAE,cAAgB,QAAUA,IAAM,OAAO,UAAY,SAAW,OAAOA,GACjH,GAAQ,EAAE,CCNf,SAAS,GAAY,EAAG,EAAG,CACzB,GAAgB,GAAQ,EAAE,EAAtB,UAA0B,CAAC,EAAG,OAAO,EACzC,IAAIC,EAAI,EAAE,OAAO,aACjB,GAAeA,IAAX,IAAK,GAAS,CAChB,IAAI,EAAIA,EAAE,KAAK,EAAG,GAAK,UAAU,CACjC,GAAgB,GAAQ,EAAE,EAAtB,SAAwB,OAAO,EACnC,MAAU,UAAU,+CAA+C,CAErE,OAAqB,IAAb,SAAiB,OAAS,QAAQ,EAAE,CCP9C,SAAS,GAAc,EAAG,CACxB,IAAI,EAAI,GAAY,EAAG,SAAS,CAChC,OAAmB,GAAQ,EAAE,EAAtB,SAAyB,EAAI,EAAI,GCH1C,SAAS,EAAgB,EAAG,EAAG,EAAG,CAChC,OAAQ,EAAI,GAAc,EAAE,IAAKC,EAAI,OAAO,eAAeA,EAAG,EAAG,CAC/D,MAAO,EACP,WAAY,CAAC,EACb,aAAc,CAAC,EACf,SAAU,CAAC,EACZ,CAAC,CAAG,EAAE,GAAK,EAAGA,ECajB,IAAW,GAAa,CAAC,CAEvB,eAAgB,EAAE,CAClB,uBAAwB,EAAE,CAC3B,CAAE,CAED,gBAAiB,CACf,gBAAiB,GACjB,iBAAkB,GAClB,YAAa,GAGd,CACF,CAAE,CAED,kBAAmB,CACjB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,qBAAsB,CACpB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,sBAAuB,CACrB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,qBAAsB,CACpB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,uBAAwB,CACtB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,uBAAwB,CACtB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,wBAAyB,CACvB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,eAAgB,CACd,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,+BAAgC,CAC9B,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,6BAA8B,CAC5B,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,kBAAmB,CACjB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,UAAW,EAAE,CACd,CAAE,CAED,mBAAoB,CAClB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAC,mBAAoB,wBAAwB,CAC/D,CACD,wBAAyB,CACvB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,wBAAyB,CACvB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,qBAAqB,CAChH,CACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACnB,gBAAiB,GACjB,iBAAkB,GAClB,YAAa,GAId,CACD,2BAA4B,CAC1B,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,2BAA4B,wBAAwB,CACvH,CACD,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,wBAAyB,CACvB,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,qBAAqB,CAChH,CACF,CAAE,CAED,yBAA0B,CACxB,GAAI,IACJ,cAAe,QAChB,CACD,0BAA2B,CACzB,GAAI,IACJ,cAAe,QAChB,CACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,QAChB,CACD,mBAAoB,CAClB,GAAI,MACJ,cAAe,QAChB,CACF,CAAE,CAED,mBAAoB,CAClB,GAAI,IACJ,cAAe,QACf,gBAAiB,EAAE,CACnB,iBAAkB,GAInB,CACD,sBAAuB,CACrB,GAAI,KACJ,cAAe,QACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,uBAAwB,CACtB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,yBAA0B,CACxB,GAAI,IACJ,cAAe,OAChB,CACF,CAAE,CAED,0BAA2B,CACzB,GAAI,IACJ,cAAe,OAChB,CACF,CAAC,CASF,SAAS,GAAY,EAAO,EAAa,CACvC,GAAI,CAAC,GAAe,IAAgB,OAAQ,OAAO,EAEnD,IADA,IAAI,EAAO,EACJ,GAAkB,EAAK,EAAE,EAAO,EAAK,QAC5C,OAAO,EAcT,SAAgB,EAAc,EAAO,EAAa,EAAU,EAAQ,CAClE,IAAI,EAAO,EACP,IAAgB,SAElB,EAAO,EAAM,YAAY,EAI3B,IAAK,IAFD,EAAa,EAAK,eAAe,CACjC,EAAa,KACR,EAAI,EAAG,EAAI,GAAW,OAAQ,IACrC,GAAI,KAAc,GAAW,GAAI,CAC/B,EAAa,EACb,MAKJ,GAAI,IAAe,yBAA2B,EAAK,UAAY,IAAa,OAAQ,CAClF,IAAI,EAAU,GAAY,EAAK,KAAK,GAAI,EAAY,CAChD,EAAE,EAAe,EAAQ,EAAI,GAAU,EAAO,eAAe,GAAK,uBAAyB,GAAU,GAAY,EAAO,KAAK,GAAI,EAAY,CAAC,GAAK,EAAE,EAAQ,eAAe,GAAK,uBAAyB,GAAU,GAAY,EAAQ,KAAK,GAAI,EAAY,CAAC,EAAI,EAAe,GAAY,EAAQ,KAAK,GAAG,CAAC,IAChT,GAAc,GAGlB,OAAO,EAaT,SAAgB,GAAiB,EAAO,EAAa,CACnD,IAAI,EAAO,EACP,IAAgB,SAElB,EAAO,EAAM,YAAY,EAE3B,IAAI,EAAa,EAAK,eAAe,CACjC,EAAQ,EAAc,EAAM,EAAY,CAC5C,GAAI,IAAU,KAEZ,OAAO,KAET,IAAI,EAAW,GAAW,GAAO,GACjC,GAAI,EAAe,EAAU,gBAAgB,CAAE,CAC7C,GAAI,EAAS,gBAAkB,OAC7B,MAAO,OAET,GAAI,EAAS,gBAAkB,QAC7B,MAAO,QAGT,MAAM,MAAM,IAAO,EAAa,oCAAwC,EAAS,cAAgB,KAAM,CAIzG,OAAO,KAYT,SAAgB,GAAkB,EAAO,EAAO,EAAa,CAE3D,IAAI,EAAI,IAAgB,OAA8B,EAArB,EAAM,YAAY,CAC/C,EAAI,IAAgB,OAA8B,EAArB,EAAM,YAAY,CAC/C,EAAc,EAAE,eAAe,CAC/B,EAAc,EAAE,eAAe,CAC/B,EAAQ,EAAc,EAAG,EAAY,CACzC,GAAI,IAAU,KAEZ,OAAO,KAET,IAAI,EAAW,GAAW,GAAO,GACjC,GAAI,EAAe,EAAU,kBAAkB,EAAI,EAAS,2BAA2B,MAAO,CAC5F,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,gBAAgB,OAAQ,IACnD,GAAI,EAAS,gBAAgB,KAAO,EAClC,MAAO,GAGX,MAAO,GAIT,OAAO,KCjWT,SAAgB,GAAW,EAAO,EAAK,EAAK,CAC1C,GAAI,EAAE,gBAAgB,IACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,MAAQ,EACT,UAAU,OAAS,GACrB,KAAK,IAAM,EACX,KAAK,IAAM,IAEX,KAAK,IAAM,EACX,KAAK,IAAM,GAET,KAAK,MAAQ,IAAA,IAAa,KAAK,MAAQ,KAAK,IAC9C,KAAK,QAAU,uBAAyB,KAAK,MAAQ,MAAQ,KAAK,IAAM,IAC/D,KAAK,MAAQ,IAAA,IAAa,KAAK,OAAS,KAAK,IACtD,KAAK,QAAU,uBAAyB,KAAK,MAAQ,OAAS,KAAK,IAAM,GAAK,IAE9E,KAAK,QAAU,uBAAyB,KAAK,MAAQ,IAEvD,KAAK,MAAY,OAAO,CAAC,MAE3B,GAAW,UAAgB,YAAY,CACvC,GAAW,UAAU,YAAc,WACnC,GAAW,UAAU,KAAO,aAC5B,GAAW,UAAU,aAAe,GCzBpC,SAAgB,GAAe,EAAQ,EAAU,EAAU,CACzD,GAAI,EAAE,gBAAgB,IACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,OAAS,EACd,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,QAAU,wBAA0B,MAAM,QAAQ,EAAO,CAAG,IAAM,EAAO,KAAK,KAAK,CAAG,IAAM,GAAU,KAAO,KAAK,UAAY,MAAQ,KAAO,MAAM,QAAQ,EAAS,CAAG,IAAM,EAAS,KAAK,KAAK,CAAG,IAAM,GAAY,IAC1N,KAAK,MAAY,OAAO,CAAC,MAE3B,GAAe,UAAgB,YAAY,CAC3C,GAAe,UAAU,YAAc,WACvC,GAAe,UAAU,KAAO,iBAChC,GAAe,UAAU,iBAAmB,GCP5C,SAAgB,GAAU,EAAG,CAE3B,IADA,IAAI,EAAI,EAAE,CACH,MAAM,QAAQ,EAAE,EACrB,EAAE,KAAK,EAAE,OAAO,CAChB,EAAI,EAAE,GAER,OAAO,EAmdT,SAAgB,GAAI,EAAO,EAAU,CACnC,OAAO,MAAM,UAAU,IAAI,KAAK,EAAO,EAAS,CAQlD,SAAgB,GAAQ,EAAO,EAAU,CACvC,MAAM,UAAU,QAAQ,KAAK,EAAO,EAAS,CAkC/C,SAAgB,GAAK,EAAO,EAAW,CACrC,OAAO,MAAM,UAAU,KAAK,KAAK,EAAO,EAAU,CAsTpD,SAAgBC,GAAQ,EAAO,EAAU,CACvC,IAAI,EAAY,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,GACpF,GAAI,EAAM,SAAW,EACnB,MAAO,EAAE,CAEX,GAAI,EACF,OAAO,EAAa,EAAM,CAE5B,IAAI,EAAQ,EAAE,CACd,OAAO,EAAsB,EAAO,EAAE,CACtC,SAAS,EAAsB,EAAO,EAAO,CAC3C,GAAI,MAAM,QAAQ,EAAM,CAAE,CAGxB,IAAK,IAFD,EAAI,EAAM,OACV,EAAS,MAAM,EAAE,CACZ,EAAI,EAAG,EAAI,EAAG,IACrB,EAAM,GAAS,EACf,EAAO,GAAK,EAAsB,EAAM,GAAI,EAAQ,EAAE,CAExD,OAAO,OAEP,OAAO,EAAS,EAAO,EAAM,MAAM,EAAG,EAAM,CAAE,EAAM,CAGxD,SAAS,EAAa,EAAO,CAC3B,GAAI,MAAM,QAAQ,EAAM,CAAE,CAGxB,IAAK,IAFD,EAAI,EAAM,OACV,EAAS,MAAM,EAAE,CACZ,EAAI,EAAG,EAAI,EAAG,IACrB,EAAO,GAAK,EAAa,EAAM,GAAG,CAEpC,OAAO,OAEP,OAAO,EAAS,EAAM,EC5zB5B,SAAgB,GAAQ,EAAO,EAAU,EAAW,CAClD,GAAI,CAAC,EAID,OAHE,EAAS,EAAM,CACV,EAAM,IAAI,GAAK,EAAS,EAAE,CAAE,GAAO,GAAK,CAExCC,GAAa,EAAO,EAAU,GAAK,CAG9C,IAAI,EAAoB,GAAK,IAAM,EAAI,EAAI,EAAS,EAAE,CAIpD,OAHE,EAAS,EAAM,CACV,EAAM,IAAI,GAAK,EAAkB,EAAE,CAAE,GAAO,GAAK,CAEjDA,GAAa,EAAO,EAAmB,GAAK,CCxDvD,SAAgB,GAAS,EAAO,CAC9B,IAAI,EAAO,EACP,EAAO,EACP,EAAQ,OAAO,OAAO,KAAK,CAC3BC,EAAM,OAAO,OAAO,KAAK,CACzB,EAAQ,EACR,EAAM,SAAa,EAAI,CACzB,IAAI,EAAWA,EAAI,GACd,OACL,OAAO,EAAM,GACb,OAAOA,EAAI,GACX,EAAE,EACE,IAAS,GACb,IAAI,CAAC,EAAM,CACT,EAAQ,EACR,EAAO,EACP,OAEF,KAAO,CAAC,OAAO,UAAU,eAAe,KAAK,EAAO,EAAE,EAAK,MAG7D,MADA,GAAQ,KAAK,IAAI,EAAM,CAChB,CACL,IAAK,SAAa,EAAI,CACpB,IAAI,EAAWA,EAAI,GACf,EAAU,EAAE,EAGhB,GAFA,EAAM,GAAW,EACjB,EAAI,GAAM,EACN,CAAC,EAKH,MAJA,EAAE,EACE,GAAQ,EAAO,QACnB,EAAK,EAAM,GACX,EAAI,EAAG,CACA,GAET,UAAO,EAAM,GACT,IAAS,EACb,KAAO,CAAC,OAAO,UAAU,eAAe,KAAK,EAAO,EAAE,EAAK,KAG7D,OAAQ,EACR,MAAO,UAAiB,CACtB,EAAO,EAAQ,EACf,EAAO,EACP,EAAQ,OAAO,OAAO,KAAK,CAC3B,EAAM,OAAO,OAAO,KAAK,EAE5B,CC9BH,SAAgB,GAAQ,EAAI,CAC1B,GAAI,CACF,OAAA,EACA,SACE,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAAE,CAG1E,MAFA,KAAwB,IACxB,IAA0B,KAAK,UACxB,SAASG,GAAU,CACpB,OAAOA,EAAQ,OAAU,WAC3B,EAAQ,MAAQ,CACd,OAAQ,IAAI,IACZ,IAAK,GAAS,GAAS,IAAyB,CACjD,EAGE,IADD,MAEQ,WAER,EAAOD,EAAO,EAAK,CACvB,GAAIC,EAAQ,MAAM,OAAO,IAAI,EAAK,CAEhC,OADA,EAAQ,MAAM,IAAI,IAAI,EAAK,CACpBA,EAAQ,MAAM,OAAO,IAAI,EAAK,CAEvC,IAAI,EAAS,EAAG,MAAM,EAAI,EAAK,CAG/B,OAFA,EAAQ,MAAM,OAAO,IAAI,EAAM,EAAO,CACtC,EAAQ,MAAM,OAAO,OAAOA,EAAQ,MAAM,IAAI,IAAI,EAAK,CAAC,CACjD,GCtCX,IAAW,GAAmB,GAAQ,SAAU,EAAW,CACzD,OAAO,IAAI,EAAU,EAAE,CAAC,KAAK,EAC5B,CACD,UACD,CAAC,CAO8B,GAAQ,SAAU,EAAW,CAC3D,OAAO,IAAI,EAAU,EAAE,CAAC,KAAK,IAAI,EAAU,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAC3D,CACD,UACD,CAAC,CAOF,IAAW,GAAoB,GAAQ,SAAU,EAAW,CAC1D,OAAO,EAAU,KAAK,GAAG,EACxB,CACD,UACD,CAAC,CAO8B,GAAQ,SAAU,EAAW,CAC3D,OAAO,GAAkB,EAAU,CAAC,MAAM,EAAE,EAC3C,CACD,UACD,CAAC,CAUF,SAAS,GAAO,EAAM,CACpB,OAAO,EAAK,GAAG,UClCjB,IAAW,GAA0B,GAAgB,KAAM,CAAC,SAAU,aAAa,CAAE,GAAS,CAC5F,GAAI,CACF,SACA,aACE,EACJ,OAAO,EAAO,SAAW,YAAc,GAAkB,EAAU,CAAG,IACtE,CAQS,GAAyB,GAAgB,IAAK,CAAC,SAAU,aAAa,CAAE,GAAS,CAC1F,GAAI,CACF,SACA,aACE,EACJ,OAAO,EAAO,SAAW,YAAc,GAAiB,EAAU,CAAG,IACrE,CA8EF,SAAS,GAAgB,EAAM,EAAc,EAAQ,CACnD,OAAO,EAAQC,EAAMC,EAAcC,EAAQ,CACzC,uBAAwB,GACzB,CAAC,CCxHJ,IAAIC,GAAO,SACPC,GAAe,CAAC,QAAQ,CAO5B,SAAS,GAAyB,EAAO,CACvC,IAAI,EAA2B,EAAM,MAAM,yCAAyC,CAgBlF,OAfE,EAQK,CACL,QACA,MATU,CACV,KAAM,EACN,KAAM,EACN,KAAM,GACP,CAAC,EAAyB,IAMzB,YALgB,EAAyB,GAMzC,eALmB,EAAyB,GAM7C,CAEM,KASX,SAAS,GAA8B,EAAO,CAG5C,IAAK,IAFD,EAAI,SAAS,EAAM,YAAa,EAAM,MAAM,CAC5C,EAAI,EACC,EAAI,EAAG,EAAI,EAAM,eAAe,OAAQ,IAAK,CACpD,IAAI,EAAa,SAAS,EAAM,eAAe,GAAI,EAAM,MAAM,CAC/D,GAAK,EAAsB,EAAM,SAAO,EAAI,GAE9C,IAAI,EAAS,EAAI,EACjB,GAAI,MAAM,EAAO,CACf,MAAU,YAAY,WAAa,EAAM,MAAQ,0BAA0B,CAE7E,OAAO,EAET,IAAW,GAA8B,EAAQD,GAAMC,GAAc,GAAQ,CAC3E,GAAI,CACF,SACE,EA0BA,EAAS,EAAM,SAAU,CAC3B,GAAI,UAAa,CACf,MAAO,IAET,OAAQ,SAAgB,EAAG,CACzB,OAAO,GAET,OAAQ,SAAgB,EAAG,CACzB,GAAI,IAAM,MAAO,MAAO,KACxB,IAAI,EAAwB,GAAyB,EAAE,CACvD,GAAI,EACF,OAAO,GAA8B,EAAsB,CAE7D,IAAI,EAAO,EACP,EAAsB,EAAE,MAAM,gCAAgC,CAC9D,IAGF,EAAO,OAAO,EAAoB,GAAG,CACrC,EAAI,EAAoB,IAE1B,IAAI,EAAM,OAAO,EAAE,CACnB,GAAI,MAAM,EAAI,CACZ,MAAU,YAAY,WAAa,EAAI,0BAA0B,CAEnE,GAAI,EAAqB,CAGvB,GAAI,EAAM,GAAK,EAAO,EAEpB,MAAU,YAAY,WAAmB,qBAAyB,CAGhE,GAAO,IAAM,EAAO,KACtB,GAAY,GAAK,GAGrB,OAAO,GAET,UAAW,SAAmB,EAAG,CAC/B,OAAO,EAAE,UAAU,EAErB,OAAQ,SAAgB,EAAG,CACzB,OAAO,OAAO,EAAE,EAElB,SAAU,SAAkB,EAAG,CAC7B,OAAO,EAAE,SAAS,EAEpB,KAAM,EAAM,YAAY,GAAQ,GAAK,CACnC,IAAIE,EAAQ,EAAE,OAAO,CAErB,MADA,GAAM,MAAQC,EAAK,EAAE,MAAM,CACpBD,GACP,CACF,KAAM,SAAe,EAAG,CACtB,MAAO,IAET,sBAAuB,SAA2B,EAAM,EAAe,CACrE,OAAO,EAAK,SAAS,EAAc,EAErC,iBAAkB,EAAM,YAAY,GAAQ,GAAK,GAAQ,EAAGC,EAAK,CAAC,CACnE,CAAC,CAUF,MAHA,GAAO,SAAW,SAAU,EAAM,CAChC,OAAO,WAAW,EAAK,MAAM,EAExB,GACP,CCpJS,GAAW,IAAI,IAAI,CAAC,MAAM,CAAC,CCM3B,GAA4B,EAF5B,OACQ,CAAC,oBAAoB,CAC2B,GAAQ,CACzE,GAAI,CACF,qBACE,EAMJ,SAAS,EAAe,EAAO,CAC7B,IAAK,IAAI,IAAU,CAAC,GAAG,GAAS,CAC9B,GAAI,EAAM,IAAI,EAAO,CACnB,MAAU,MAAM,sCAAwC,EAAS,0BAA0B,CAIjG,MAAM,CAAK,CACT,IAAI,MAAO,CACT,MAAO,OAET,IAAI,QAAS,CACX,MAAO,GAQT,SAAS,EAAO,CACd,OAAO,KAAK,SAAS,CAAC,SAAS,EAAM,CAWvC,SAAU,CACR,IAAI,EAAO,KAAK,SAAS,EAAmB,EAAE,CAAC,CAC3C,EAAO,EAAE,CACT,EAAU,KACd,SAAS,EAAS,EAAO,CACvB,IAAI,EAAI,GAAU,EAAM,CAExB,OADA,EAAe,EAAE,CACV,EAAK,EAAG,EAAM,EAAQ,CAE/B,MAAO,CACL,WACD,CAgBH,SAAS,EAAM,EAAU,CACvB,MAAU,MAAM,+CAAiD,KAAK,KAAK,CAO7E,QAAQ,EAAU,CAEhB,MAAU,MAAM,yCAAyC,CAS3D,IAAI,EAAU,CAEZ,MAAU,MAAM,qCAAqC,CASvD,QAAQ,EAAM,CACZ,GAAI,CAAC,EAAO,EAAK,CACf,MAAU,UAAU,uCAAuC,CAE7D,OAAO,EAST,SAAS,EAAU,CAGjB,EAAS,KAAM,KAAM,KAAK,CAG1B,SAAS,EAAU,EAAM,EAAU,CACjC,EAAK,QAAQ,SAAU,EAAO,EAAM,EAAQ,CAC1C,EAAS,EAAO,EAAM,EAAO,CAC7B,EAAU,EAAOG,EAAS,EAC1B,CAEJ,EAAU,KAAM,EAAS,CAyB3B,UAAU,EAAU,CAClB,SAAS,EAAW,EAAO,EAAM,EAAQ,CACvC,IAAI,EAAc,EAAS,EAAO,EAAM,EAAO,CAK/C,OAJI,IAAgB,EAIb,EAAM,IAAI,EAAW,CAFnB,EAIX,OAAO,EAAW,KAAM,KAAM,KAAK,CAkBrC,OAAO,EAAU,CACf,IAAI,EAAQ,EAAE,CAMd,OALA,KAAK,SAAS,SAAU,EAAM,EAAM,EAAQ,CACtC,EAAS,EAAM,EAAM,EAAO,EAC9B,EAAM,KAAK,EAAK,EAElB,CACK,EAOT,OAAQ,CAEN,MAAU,MAAM,gCAAgC,CAOlD,WAAY,CACV,OAAO,KAAK,IAAI,SAAU,EAAM,CAC9B,OAAO,EAAK,WAAW,EACvB,CASJ,OAAO,EAAO,CACZ,OAAO,EAAQ,KAAK,OAAS,EAAM,MAAQ,GAAgB,KAAM,EAAM,CAAG,GAkB5E,SAAS,EAAS,CAChB,IAAI,EAAe,KAAK,iBAAiB,EAAQ,CAIjD,OAHW,IAAiB,OAGrB,KAAK,UAAU,EAAQ,CAFrB,EAWX,WAAY,CAEV,MAAU,MAAM,iCAAmC,KAAK,KAAK,CAS/D,QAAS,CACP,MAAU,MAAM,sDAAwD,KAAK,KAAK,CAkBpF,OAAO,EAAS,CACd,IAAI,EAAe,KAAK,iBAAiB,EAAQ,CAIjD,OAHW,IAAiB,OAGrB,KAAK,QAAQ,EAAQ,CAFnB,EAWX,SAAU,CAER,MAAU,MAAM,+BAAiC,KAAK,KAAK,CAkB7D,MAAM,EAAS,CACb,IAAI,EAAe,KAAK,iBAAiB,EAAQ,CAIjD,OAHW,IAAiB,OAGrB,KAAK,OAAO,EAAQ,CAFlB,EAYX,OAAO,EAAS,CAEd,MAAU,MAAM,8BAAgC,KAAK,KAAK,CAM5D,iBAAiB,EAAS,CACxB,GAAI,GAAW,OAAO,GAAY,SAChC,OAAQ,OAAO,EAAQ,QAAvB,CACE,IAAK,SACL,IAAK,YACH,OACF,IAAK,WACH,OAAO,EAAQ,QAAQ,KAAM,EAAQ,CACvC,QACE,MAAU,UAAU,0CAA0C,EAStE,eAAgB,CACd,OAAO,KAAK,KAOd,YAAa,CACX,OAAO,MAGX,OAAO,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC5WF,SAAgB,GAAe,EAAK,CAIlC,OAHI,GAAO,EAAI,aACN,IAAI,GAAW,EAAI,MAAQ,EAAG,EAAI,IAAM,EAAG,EAAI,MAAQ,IAAA,GAA0B,IAAA,GAAd,EAAI,IAAM,EAAc,CAE7F,ECTT,SAAgB,GAAc,EAAM,CAClC,GAAI,CACF,UACE,EAYJ,OAAO,SAAgB,EAAQ,EAAO,CACpC,GAAI,CACF,GAAI,MAAM,QAAQ,EAAO,CACvB,OAAO,EAAO,EAAQ,EAAM,IACnB,GAAU,OAAO,EAAO,QAAW,WAE5C,OAAO,EAAO,OAAO,EAAM,IAClB,OAAO,GAAW,SAE3B,OAAO,EAAO,EAAQ,EAAM,IACnB,OAAO,GAAW,SAAU,CACrC,GAAI,CAAC,EAAM,kBAAkB,CAC3B,MAAU,UAAU,kDAAkD,CAExE,OAAO,EAAgB,EAAQ,EAAM,mBAAmB,CAAC,MAEzD,MAAU,UAAU,iDAAiD,OAEhE,EAAK,CACZ,MAAM,GAAe,EAAI,GC/B/B,IAAIC,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,SAAU,OAAO,CACsC,GAAQ,CACjF,GAAI,CACF,SACA,QACE,EACA,EAAS,GAAc,CACzB,SACD,CAAC,CAMF,SAAS,EAAgB,EAAM,CAE7B,MAAO,EAAE,EAAe,EAAK,EAAI,GAAY,EAAK,EAAI,EAAe,EAAK,EAAI,GAAe,EAAK,EAAI,GAAa,EAAK,EAAI,GAAkB,EAAK,EAAI,EAAa,EAAK,EAE3K,MAAM,UAAqB,CAAK,CAc9B,YAAY,EAAQ,EAAO,CACzB,IAAI,EAAmB,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,GAE3F,GADA,OAAO,CACH,CAAC,EAAO,EAAO,CACjB,MAAU,UAAU,uCAAuC,CAE7D,GAAI,CAAC,EAAY,EAAM,CACrB,MAAU,UAAU,2CAA2C,CAEjE,KAAK,OAAS,EACd,KAAK,MAAQ,EACb,KAAK,iBAAmB,EAI1B,IAAI,MAAO,CAIP,OAHE,KAAK,MACA,KAAK,MAAM,kBAAkB,CAAG,KAAK,MAAM,mBAAmB,CAAG,GAEjE,KAAK,OAAO,MAAQ,GAG/B,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAa,KAAK,OAAO,SAAS,EAAM,EAAS,CACjD,EAAY,KAAK,MAAM,SAAS,EAAM,EAAS,CAC/C,EAAmB,KAAK,iBACxB,EAAuB,EAAe,KAAK,OAAO,EAAI,KAAK,OAAO,iBACtE,GAAI,KAAK,MAAM,kBAAkB,CAAE,CACjC,IAAI,EAAO,KAAK,MAAM,mBAAmB,CACzC,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAI,EAAM,GAAW,EAAE,CACnB,EAAS,EAAW,EAAO,EAAM,EAAI,CACzC,GAAI,GAAoB,GAAU,KAAM,CACtC,EAAI,qBAAuB,GAC3B,OAEE,QAAwB,GAAQ,MAA0B,EAAI,sBAKlE,OAAO,EAAgB,EAAQ,EAAK,OAGtC,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAI,EAAM,GAAW,EAAE,CACnB,EAAS,EAAW,EAAO,EAAM,EAAI,CACzC,GAAI,GAAoB,GAAU,KAAM,CACtC,EAAI,qBAAuB,GAC3B,OAEE,QAAwB,GAAQ,MAA0B,EAAI,sBAMlE,OAAO,EAAO,EADF,EAAU,EAAO,EAAM,EAAO,CACd,EASlC,QAAQ,EAAU,CAChB,EAAS,KAAK,OAAQ,SAAU,KAAK,CACrC,EAAS,KAAK,MAAO,QAAS,KAAK,CASrC,IAAI,EAAU,CACZ,OAAO,IAAI,EAAa,KAAK,QAAQ,EAAS,KAAK,OAAQ,SAAU,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CAAE,KAAK,iBAAiB,CAOxJ,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,OAAQ,KAAK,MAAO,KAAK,iBAAiB,CAQzE,UAAU,EAAS,CACjB,IAAI,EAAS,KAAK,OAAO,SAAS,EAAQ,CACtC,EAAgB,KAAK,OAAO,GAC9B,EAAS,IAAM,EAAS,KAE1B,IAAI,EAAmB,KAAK,iBAAmB,KAAK,MAAM,YAAc,IAAM,KAAO,GACrF,OAAO,EAAS,EAAmB,KAAK,MAAM,SAAS,EAAQ,CAQjE,QAAQ,EAAS,CACf,IAAI,EAAS,KAAK,OAAO,OAAO,EAAQ,CAIxC,OAHI,EAAgB,KAAK,OAAO,GAC9B,EAAS,iEAAmE,EAAS,kEAEhF,EAAS,KAAK,MAAM,OAAO,EAAQ,CAQ5C,OAAO,EAAS,CACd,IAAI,EAAS,KAAK,OAAO,MAAM,EAAQ,CAIvC,OAHI,EAAgB,KAAK,OAAO,GAC9B,EAAS,iCAEJ,EAAS,KAAK,MAAM,MAAM,EAAQ,CAO3C,QAAS,CACP,MAAO,CACL,OAAQA,GACR,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,iBAAkB,KAAK,iBACxB,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAa,EAAK,OAAQ,EAAK,MAAO,EAAK,iBAAiB,EAI3E,OADA,EAAgB,EAAc,OAAQA,GAAK,CACpC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCrNEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,OAAO,CAC6C,GAAQ,CAC9E,GAAI,CACF,QACE,EACJ,MAAM,UAAkB,CAAK,CAO3B,YAAY,EAAO,CAKjB,GAJA,OAAO,CACP,KAAK,MAAQ,GAAS,EAAE,CAGpB,CAAC,MAAM,QAAQ,KAAK,MAAM,EAAI,CAAC,KAAK,MAAM,MAAM,EAAO,CACzD,MAAU,UAAU,kCAAkC,CAG1D,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAY,GAAI,KAAK,MAAO,SAAU,EAAM,CAC9C,OAAO,EAAK,SAAS,EAAM,EAAS,EACpC,CAEF,GADe,EAAK,OAAO,SAAW,QACxB,CACZ,IAAI,EAAS,EAAK,OAClB,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,EAAO,GAAI,EAAW,SAAU,EAAU,CAC/C,OAAO,EAAS,EAAO,EAAM,EAAQ,EACrC,CAAC,OAGL,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,GAAI,EAAW,SAAU,EAAU,CACxC,OAAO,EAAS,EAAO,EAAM,EAAQ,EACrC,EASR,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,IAAK,CAC1C,IAAI,EAAO,KAAK,MAAM,GACtB,EAAS,EAAM,SAAW,EAAI,IAAK,KAAK,EAU5C,IAAI,EAAU,CAEZ,IAAK,IADD,EAAQ,EAAE,CACL,EAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,IACrC,EAAM,GAAK,KAAK,QAAQ,EAAS,KAAK,MAAM,GAAI,SAAW,EAAI,IAAK,KAAK,CAAC,CAE5E,OAAO,IAAI,EAAU,EAAM,CAO7B,OAAQ,CACN,OAAO,IAAI,EAAU,KAAK,MAAM,MAAM,EAAE,CAAC,CAS3C,UAAU,EAAS,CAIjB,MAAO,IAHK,KAAK,MAAM,IAAI,SAAU,EAAM,CACzC,OAAO,EAAK,SAAS,EAAQ,EAC7B,CACiB,KAAK,KAAK,CAAG,IAOlC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,MAAO,KAAK,MACb,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,MAAM,CASlC,QAAQ,EAAS,CAIf,MAAO,kEAHK,KAAK,MAAM,IAAI,SAAU,EAAM,CACzC,OAAO,EAAK,OAAO,EAAQ,EAC3B,CAC+E,KAAK,wCAAwC,CAAG,kEAQnI,OAAO,EAAS,CACd,SAAS,EAAW,EAAO,EAAQ,CACjC,IAAI,EAAa,EAAM,KAAK,GAAY,EAAI,CAAC,EAAM,MAAM,GAAY,CACjE,EAAe,GAAU,EACzB,EAAU,EAAe,IAAM,OAC/B,EAAW,EAAM,IAAI,SAAU,EAAM,CAIrC,OAHE,EAAK,MACA,EAAW,EAAK,MAAO,CAAC,EAAO,CAE/B,EAAK,MAAM,EAAQ,EAE5B,CAAC,KAAK,EAAQ,CAChB,OAAO,GAAc,CAAC,GAAgB,GAAgB,CAAC,EAAS,mBAAqB,EAAW,iBAAmB,EAErH,OAAO,EAAW,KAAK,MAAO,GAAM,EAIxC,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC7KF,SAAgB,GAAc,EAAM,CAClC,GAAI,CACF,SACA,UACE,EAeJ,OAAO,SAAgB,EAAQ,EAAO,EAAO,CAC3C,GAAI,CACF,GAAI,MAAM,QAAQ,EAAO,CAOvB,OANa,EAAO,EAAO,CAAC,OAAO,EAAO,EAAM,CAAC,SAAS,CAGnD,SAAS,EAAM,IAAU,CAC9B,EAAOE,GAAS,GAChB,CACK,KACE,GAAU,OAAO,EAAO,QAAW,WAE5C,OAAO,EAAO,OAAO,EAAO,EAAM,IACzB,OAAO,GAAW,SAE3B,OAAO,EAAO,EAAQ,EAAO,EAAM,IAC1B,OAAO,GAAW,SAAU,CACrC,GAAI,CAAC,EAAM,kBAAkB,CAC3B,MAAM,UAAU,kDAAkD,CAGpE,OADA,EAAgB,EAAQ,EAAM,mBAAmB,CAAE,EAAM,CAClD,OAEP,MAAU,UAAU,iDAAiD,OAEhE,EAAK,CACZ,MAAM,GAAe,EAAI,GCxC/B,IAAIC,GAAO,iBAIA,GAAsC,EAAQA,GAHtC,CAAC,SAAU,UAE9B,OAAO,CACsE,GAAQ,CACnF,GAAI,CACF,SACA,SACA,QACE,EACA,EAAS,GAAc,CACzB,SACD,CAAC,CACE,EAAS,GAAc,CACzB,SACA,SACD,CAAC,CASF,SAAS,EAAgB,EAAM,EAAa,EAAU,CACpD,AACE,IAAc,OAEhB,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAiB,EAAc,EAAK,MAAO,EAAa,EAAS,CACrE,OAAO,IAAgB,OAAS,IAAmB,MAAQ,GAAkB,EAE/E,MAAM,UAAuB,CAAK,CAgChC,YAAY,EAAQ,EAAO,EAAO,CAOhC,GANA,OAAO,CACP,KAAK,OAAS,EACd,KAAK,MAAQ,EAAQ,EAAQ,KAC7B,KAAK,MAAQ,GAAS,EAGlB,CAAC,EAAa,EAAO,EAAI,CAAC,EAAe,EAAO,CAClD,MAAU,UAAU,kDAAkD,CAExE,GAAI,EAAa,EAAO,EAAI,EAAO,OAAS,MAC1C,MAAU,MAAM,gCAAgC,CAElD,GAAI,KAAK,OAAS,CAAC,EAAY,KAAK,MAAM,CAExC,MAAU,UAAU,gCAAgC,CAEtD,GAAI,CAAC,EAAO,KAAK,MAAM,CACrB,MAAU,UAAU,2BAA2B,CAOnD,IAAI,MAAO,CAIP,OAHE,KAAK,MACA,KAAK,MAAM,kBAAkB,CAAG,KAAK,MAAM,mBAAmB,CAAG,GAEjE,KAAK,OAAO,MAAQ,GAG/B,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,kBAAmB,CACrB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAa,KAAK,OAAO,SAAS,EAAM,EAAS,CACjD,EAAY,KAAK,MAAQ,KAAK,MAAM,SAAS,EAAM,EAAS,CAAG,KAC/D,EAAY,KAAK,MAAM,SAAS,EAAM,EAAS,CAC/CA,EAAO,KAAK,OAAO,KACvB,GAAK,KAAK,SAUC,KAAK,MAAM,kBAAkB,CAAE,CAExC,IAAI,EAAO,KAAK,MAAM,mBAAmB,CACzC,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAS,EAAW,EAAO,EAAM,EAAQ,CACzC,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAgB,EAAQ,EAAM,EAAM,CAC7B,WAEA,EAAa,KAAK,OAAO,CAElC,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAc,EAAW,EAAO,EAAM,EAAQ,CAC9C,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAEvC,EAAQ,EAAU,EAAO,EAAM,EAAY,CAE/C,OADA,EAAM,IAAIA,EAAM,EAAO,EAAa,EAAO,EAAM,CAAC,CAC3C,OAEJ,CAQL,IAAI,EAAmB,KAAK,OAAO,OAAO,SAAS,EAAM,EAAS,CAClE,GAAI,KAAK,OAAO,MAAM,kBAAkB,CAAE,CACxC,IAAI,EAAa,KAAK,OAAO,MAAM,mBAAmB,CACtD,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAS,EAAiB,EAAO,EAAM,EAAQ,CAC/C,EAAc,EAAgB,EAAQ,EAAW,CAEjD,EAAQ,EAAU,EAAO,EAAM,EAAY,CAC3C,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAgB,EAAQ,EAAY,EAAO,EAAa,EAAO,EAAM,CAAC,CAC/D,OAEJ,CAGL,IAAI,EAAkB,KAAK,OAAO,MAAM,SAAS,EAAM,EAAS,CAChE,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAS,EAAiB,EAAO,EAAM,EAAQ,CAE/C,EAAc,EAAgB,EAAO,EAAM,EAAO,CAClD,EAAc,EAAO,EAAQ,EAAY,CAEzC,EAAQ,EAAU,EAAO,EAAM,EAAY,CAC3C,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAO,EAAQ,EAAa,EAAO,EAAa,EAAO,EAAM,CAAC,CACvD,QA9DI,CAEf,GAAI,CAAC,EAAa,KAAK,OAAO,CAC5B,MAAU,UAAU,gCAAgC,CAEtD,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAM,IAAIA,EAAM,EAAM,CACf,IAgEb,QAAQ,EAAU,CAChB,EAAS,KAAK,OAAQ,SAAU,KAAK,CACjC,KAAK,OACP,EAAS,KAAK,MAAO,QAAS,KAAK,CAErC,EAAS,KAAK,MAAO,QAAS,KAAK,CASrC,IAAI,EAAU,CAIZ,OAAO,IAAI,EAHE,KAAK,QAAQ,EAAS,KAAK,OAAQ,SAAU,KAAK,CAAC,CACpD,KAAK,MAAQ,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CAAG,KACjE,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CACd,CAOjD,OAAQ,CACN,OAAO,IAAI,EAAe,KAAK,OAAQ,KAAK,MAAO,KAAK,MAAM,CAQhE,UAAU,EAAS,CACjB,IAAI,EAAS,KAAK,OAAO,SAAS,EAAQ,CACtC,EAAQ,KAAK,MAAQ,KAAK,MAAM,SAAS,EAAQ,CAAG,GACpD,EAAQ,KAAK,MAAM,SAAS,EAAQ,CAIxC,OAHI,EAAgB,KAAM,GAAW,EAAQ,YAAa,GAAW,EAAQ,SAAS,GACpF,EAAQ,IAAM,EAAQ,KAEjB,EAAS,EAAQ,MAAQ,EAOlC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,MAAO,KAAK,MACb,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAe,EAAK,OAAQ,EAAK,MAAO,EAAK,MAAM,CAQhE,QAAQ,EAAS,CACf,IAAI,EAAS,KAAK,OAAO,OAAO,EAAQ,CACpC,EAAQ,KAAK,MAAQ,KAAK,MAAM,OAAO,EAAQ,CAAG,GAClD,EAAQ,KAAK,MAAM,OAAO,EAAQ,CAItC,OAHI,EAAgB,KAAM,GAAW,EAAQ,YAAa,GAAW,EAAQ,SAAS,GACpF,EAAQ,iEAAmE,EAAQ,kEAE9E,EAAS,EAAQ,uHAA8H,EAQxJ,OAAO,EAAS,CACd,IAAI,EAAS,KAAK,OAAO,MAAM,EAAQ,CACnC,EAAQ,KAAK,MAAQ,KAAK,MAAM,MAAM,EAAQ,CAAG,GACjD,EAAQ,KAAK,MAAM,MAAM,EAAQ,CAIrC,OAHI,EAAgB,KAAM,GAAW,EAAQ,YAAa,GAAW,EAAQ,SAAS,GACpF,EAAQ,UAAiB,aAEpB,EAAS,EAAQ,IAAM,GAIlC,OADA,EAAgB,EAAgB,OAAQA,GAAK,CACtC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC7SEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,YAAa,OAAO,CACgC,GAAQ,CAC9E,GAAI,CACF,YACA,QACE,EACJ,MAAM,UAAkB,CAAK,CAW3B,YAAY,EAAQ,CAGlB,GAFA,OAAO,CAEH,CAAC,MAAM,QAAQ,EAAO,CAAE,MAAU,MAAM,iBAAiB,CAC7D,KAAK,OAAS,EAAO,IAAI,SAAU,EAAO,CACxC,IAAI,EAAO,GAAS,EAAM,KACtB,EAAU,GAAS,EAAM,UAAY,IAAA,GAAY,EAAM,QAAU,GACrE,GAAI,CAAC,EAAO,EAAK,CAAE,MAAU,UAAU,iCAAiC,CACxE,GAAI,OAAO,GAAY,UACrB,MAAU,UAAU,uCAAuC,CAE7D,MAAO,CACL,OACA,UACD,EACD,CAEJ,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAa,GAAI,KAAK,OAAQ,SAAU,EAAO,CACjD,MAAO,CACL,SAAU,EAAM,KAAK,SAAS,EAAM,EAAS,CAC7C,QAAS,EAAM,QAChB,EACD,CACF,OAAO,SAAwB,EAAO,EAAM,EAAS,CACnD,IAAI,EAAU,EAAE,CAOhB,OANA,GAAQ,EAAY,SAAuB,EAAO,CAChD,IAAI,EAAS,EAAM,SAAS,EAAO,EAAM,EAAQ,CAC7C,EAAM,SACR,EAAQ,KAAK,EAAO,EAEtB,CACK,IAAI,EAAU,EAAQ,EAQjC,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IACtC,EAAS,KAAK,OAAO,GAAG,KAAM,UAAY,EAAI,SAAU,KAAK,CAUjE,IAAI,EAAU,CAEZ,IAAK,IADD,EAAS,EAAE,CACN,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IAAK,CAC3C,IAAI,EAAQ,KAAK,OAAO,GAExB,EAAO,GAAK,CACV,KAFS,KAAK,QAAQ,EAAS,EAAM,KAAM,UAAY,EAAI,SAAU,KAAK,CAAC,CAG3E,QAAS,EAAM,QAChB,CAEH,OAAO,IAAI,EAAU,EAAO,CAO9B,OAAQ,CAON,OAAO,IAAI,EANE,KAAK,OAAO,IAAI,SAAU,EAAO,CAC5C,MAAO,CACL,KAAM,EAAM,KACZ,QAAS,EAAM,QAChB,EACD,CAC0B,CAS9B,UAAU,EAAS,CACjB,OAAO,KAAK,OAAO,IAAI,SAAU,EAAO,CACtC,OAAO,EAAM,KAAK,SAAS,EAAQ,EAAI,EAAM,QAAU,GAAK,MAC5D,CAAC,KAAK;EAAK,CAOf,QAAS,CACP,MAAO,CACL,OAAQA,GACR,OAAQ,KAAK,OACd,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,OAAO,CASnC,QAAQ,EAAS,CACf,OAAO,KAAK,OAAO,IAAI,SAAU,EAAO,CACtC,OAAO,EAAM,KAAK,OAAO,EAAQ,EAAI,EAAM,QAAU,GAAK,0CAC1D,CAAC,KAAK,6CAA6C,CAQvD,OAAO,EAAS,CACd,OAAO,KAAK,OAAO,IAAI,SAAU,EAAO,CACtC,OAAO,EAAM,KAAK,MAAM,EAAQ,EAAI,EAAM,QAAU,GAAK,MACzD,CAAC,KAAK;EAAW,EAIvB,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCpLEE,GAAO,kBAEA,GAAuC,EAAQA,GADvC,CAAC,OAAO,CACmD,GAAQ,CACpF,GAAI,CACF,QACE,EAMJ,SAAS,EAAc,EAAW,CAChC,GAAI,OAAO,GAAc,UAAY,OAAO,GAAc,WAAa,OAAO,GAAc,SAC1F,MAAO,CAAC,CAAC,EAEX,GAAI,EAAW,CACb,GAAI,EAAY,EAAU,CACxB,MAAO,CAAC,EAAU,QAAQ,CAE5B,GAAI,EAAU,EAAU,CACtB,MAAO,CAAC,EAAE,EAAU,IAAM,EAAU,IAEtC,GAAI,EAAO,EAAU,CACnB,MAAO,CAAC,CAAC,EAAU,MAGvB,GAAI,GAAc,KAChB,MAAO,GAET,MAAU,UAAU,kCAAoC,GAAO,EAAU,CAAG,IAAI,CAElF,MAAM,UAAwB,CAAK,CAWjC,YAAY,EAAW,EAAU,EAAW,CAE1C,GADA,OAAO,CACH,CAAC,EAAO,EAAU,CACpB,MAAU,UAAU,qCAAqC,CAE3D,GAAI,CAAC,EAAO,EAAS,CACnB,MAAU,UAAU,oCAAoC,CAE1D,GAAI,CAAC,EAAO,EAAU,CACpB,MAAU,UAAU,qCAAqC,CAE3D,KAAK,UAAY,EACjB,KAAK,SAAW,EAChB,KAAK,UAAY,EAEnB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,mBAAoB,CACtB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAgB,KAAK,UAAU,SAAS,EAAM,EAAS,CACvD,EAAe,KAAK,SAAS,SAAS,EAAM,EAAS,CACrD,EAAgB,KAAK,UAAU,SAAS,EAAM,EAAS,CAC3D,OAAO,SAA6B,EAAO,EAAM,EAAS,CACxD,OAAO,EAAc,EAAc,EAAO,EAAM,EAAQ,CAAC,CAAG,EAAa,EAAO,EAAM,EAAQ,CAAG,EAAc,EAAO,EAAM,EAAQ,EAQxI,QAAQ,EAAU,CAChB,EAAS,KAAK,UAAW,YAAa,KAAK,CAC3C,EAAS,KAAK,SAAU,WAAY,KAAK,CACzC,EAAS,KAAK,UAAW,YAAa,KAAK,CAS7C,IAAI,EAAU,CACZ,OAAO,IAAI,EAAgB,KAAK,QAAQ,EAAS,KAAK,UAAW,YAAa,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,SAAU,WAAY,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,UAAW,YAAa,KAAK,CAAC,CAAC,CAO3M,OAAQ,CACN,OAAO,IAAI,EAAgB,KAAK,UAAW,KAAK,SAAU,KAAK,UAAU,CAQ3E,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAM1E,EAAY,KAAK,UAAU,SAAS,EAAQ,CAC5C,EAAsB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,EAC7F,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAwB,MAAQ,GAAuB,KAC5H,EAAY,IAAM,EAAY,KAEhC,IAAI,EAAW,KAAK,SAAS,SAAS,EAAQ,CAC1C,EAAiB,EAAc,KAAK,SAAU,EAAa,GAAW,EAAQ,SAAS,EACvF,IAAgB,OAAS,KAAK,SAAS,OAAS,gBAAkB,IAAmB,MAAQ,GAAkB,KACjH,EAAW,IAAM,EAAW,KAE9B,IAAI,EAAY,KAAK,UAAU,SAAS,EAAQ,CAC5C,EAAkB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,CAI7F,OAHI,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAoB,MAAQ,GAAmB,KACpH,EAAY,IAAM,EAAY,KAEzB,EAAY,MAAQ,EAAW,MAAQ,EAOhD,QAAS,CACP,MAAO,CACL,OAAQA,GACR,UAAW,KAAK,UAChB,SAAU,KAAK,SACf,UAAW,KAAK,UACjB,CAgBH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAgB,EAAK,UAAW,EAAK,SAAU,EAAK,UAAU,CAQ3E,QAAQ,EAAS,CACf,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAM1E,EAAY,KAAK,UAAU,OAAO,EAAQ,CAC1C,EAAsB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,EAC7F,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAwB,MAAQ,GAAuB,KAC5H,EAAY,iEAAmE,EAAY,kEAE7F,IAAI,EAAW,KAAK,SAAS,OAAO,EAAQ,CACxC,EAAiB,EAAc,KAAK,SAAU,EAAa,GAAW,EAAQ,SAAS,EACvF,IAAgB,OAAS,KAAK,SAAS,OAAS,gBAAkB,IAAmB,MAAQ,GAAkB,KACjH,EAAW,iEAAmE,EAAW,kEAE3F,IAAI,EAAY,KAAK,UAAU,OAAO,EAAQ,CAC1C,EAAkB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,CAI7F,OAHI,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAoB,MAAQ,GAAmB,KACpH,EAAY,iEAAmE,EAAY,kEAEtF,EAAY,iEAAmE,EAAW,iEAAmE,EAQtK,OAAO,EAAS,CACd,MAAO,mBAAqB,KAAK,SAAS,MAAM,EAAQ,CAAG,4BAA8B,KAAK,UAAU,MAAM,EAAQ,CAAG,SAAW,KAAK,UAAU,MAAM,EAAQ,CAAG,6CAIxK,OADA,EAAgB,EAAiB,OAAQA,GAAK,CACvC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,iBC3NF,IAAIE,EAAW,OAAO,QAAU,SAAU,EAAQ,CAAE,IAAK,IAAI,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,CAAE,IAAI,EAAS,UAAU,GAAI,IAAK,IAAI,KAAO,EAAc,OAAO,UAAU,eAAe,KAAK,EAAQ,EAAI,GAAI,EAAO,GAAO,EAAO,IAAY,OAAO,GAEnP,EAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACL,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACL,EAAG,MACH,IAAK,qBACN,CACG,EAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,IAAM,YACN,OAAQ,cACR,KAAM,cACP,CAEG,EAAqB,SAA4B,EAAgB,EAAe,CAClF,OAAOA,EAAS,EAAE,CAAEE,EAAgBC,EAAc,EAWpD,EAAO,QAAU,SAAU,EAAK,CAmC9B,IAlCA,IAAI,EAAO,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAAE,CAC7E,EAAwB,EAAK,mBAC7B,EAAqB,IAA0B,IAAA,GAAY,GAAQ,EACnE,EAAmB,EAAK,YACxB,EAAc,IAAqB,IAAA,GAAY,EAAqB,EAEpE,EAAa,OAAO,EAAI,CACxB,EAAS,GAET,EAAU,EAAYH,EAAS,EAAE,CAAE,EAAe,CAAE,EAAqBA,EAAS,EAAE,CAAE,EAAc,CAAG,EAAE,CAAC,CAC1G,EAAa,OAAO,KAAK,EAAQ,CAMjC,EAAQ,UAAiB,CAC3B,IAAI,EAAmB,GACvB,EAAW,QAAQ,SAAU,EAAK,EAAO,CACnC,GAGA,EAAW,QAAU,EAAI,QAAU,EAAW,MAAM,EAAG,EAAI,OAAO,GAAK,IACzE,GAAU,EAAQ,EAAW,IAC7B,EAAa,EAAW,MAAM,EAAI,OAAQ,EAAW,OAAO,CAC5D,EAAmB,KAErB,CACG,IACH,GAAU,EAAW,MAAM,EAAG,EAAE,CAChC,EAAa,EAAW,MAAM,EAAG,EAAW,OAAO,GAIhD,GACL,GAAO,CAET,OAAO,WC1EE,GAAe,CAExB,MAAO,IACP,MAAO,UACP,KAAM,IACN,KAAM,SACN,MAAO,UACP,MAAO,UACP,MAAO,UACP,MAAO,UACP,QAAS,IACT,QAAS,YACT,WAAY,eACZ,KAAM,IACN,KAAM,SACN,IAAK,IACL,IAAK,QACL,MAAO,UACP,MAAO,UACP,SAAU,aACV,KAAM,IACN,KAAM,SACN,MAAO,IACP,MAAO,UACP,SAAU,aACV,OAAQ,WACR,OAAQ,WACR,GAAI,IACJ,GAAI,OACJ,GAAI,IACJ,GAAI,OACJ,GAAI,OACJ,GAAI,OACJ,QAAS,IACT,QAAS,IACT,GAAI,OACJ,GAAI,OACJ,MAAO,UACP,IAAK,IACL,IAAK,QACL,OAAQ,WACR,MAAO,UACP,MAAO,UACP,SAAU,aACV,IAAK,IACL,IAAK,QACL,QAAS,YACT,QAAS,YACT,IAAK,QACL,IAAK,QACL,OAAQ,WACR,IAAK,IACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,MAAO,UACP,MAAO,UAEP,KAAM,iBACN,MAAO,kBAEP,EAAG,IAEH,IAAK,UACL,IAAK,UACL,SAAU,UACV,SAAU,UACV,GAAI,UACJ,IAAK,QACL,UAAW,cACZ,CACU,EAAiB,CAC1B,UAAW,SACX,WAAY,KACZ,UAAW,IACX,IAAK,IACL,OAAQ,YAER,UAAW,IACX,WAAY,IACZ,OAAQ,MAER,IAAK,QACL,SAAU,SACV,OAAQ,SAER,YAAa,UAEb,UAAW,KAEX,IAAK,QACL,IAAK,IACL,SAAU,IACV,GAAI,eACJ,UAAW,KACX,gBAAiB,KACjB,cAAe,MACf,MAAO,IACP,QAAS,QACT,QAAS,IACT,OAAQ,IACR,UAAW,QACX,SAAU,QACV,OAAQ,MACR,OAAQ,iBACR,MAAO,IACP,IAAK,UACL,IAAK,WACL,GAAI,QACL,CACU,GAAiB,CAE1B,IAAK,CACH,EAAG,4BACJ,CACD,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CACD,KAAM,CACJ,EAAG,wBACJ,CACD,KAAM,CACJ,EAAG,wCACJ,CACD,KAAM,CACJ,EAAG,8BACJ,CACD,OAAQ,CACN,EAAG,iCACJ,CACD,UAAW,CACT,EAAG,qBAA2B,EAAe,+BAC9C,CACD,YAAa,CACX,EAAG,qBAA2B,EAAe,iCAC9C,CACD,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,IAAK,CACH,EAAG,iCACJ,CACD,MAAO,WAAkB,EAAe,6BACxC,IAAK,CACH,EAAG,6CACJ,CACD,MAAO,CACL,EAAG,0CACJ,CACD,SAAU,CACR,EAAG,iCACJ,CACD,IAAK,8BACL,MAAO,gCACP,IAAK,CACH,EAAG,gCACH,EAAG,8CACJ,CACD,MAAO,CACL,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,kCACH,EAAG,gDACJ,CACD,KAAM,qCACN,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CACD,SAAU,CACR,EAAG,qBAA2B,EAAe,8BAC9C,CACD,KAAM,CACJ,EAAG,gCACH,EAAG,IAAA,GACJ,CACD,QAAS,CACP,EAAG,iCACJ,CACD,SAAU,CACR,EAAG,wCACJ,CACD,IAAK,CACH,EAAG,6BAAmC,EAAe,mBACtD,CACD,MAAO,CACL,EAAG,yCACH,EAAG,IAAA,GACJ,CACD,KAAM,CACJ,EAAG,6CACJ,CACD,KAAM,CACJ,EAAG,qBACJ,CACD,OAAQ,CACN,EAAG,8BACJ,CACD,SAAU,CACR,EAAG,qBAA2B,EAAe,8BAC9C,CACD,WAAY,CACV,EAAG,GAAU,EAAe,uCAC7B,CACD,UAAW,CACT,EAAG,GAAU,EAAe,sCAC7B,CAED,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,OAAQ,CACN,EAAG,EAAe,OAAS,4BAC5B,CACD,MAAO,CACL,EAAG,qBAA2B,EAAe,2BAC9C,CACD,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,UAAW,CACT,EAAG,qBAA2B,EAAe,+BAC9C,CACD,gBAAiB,CACf,EAAG,qBAA2B,EAAe,qCAC9C,CACD,cAAe,CACb,EAAG,qBAA2B,EAAe,mCAC9C,CAED,YAAa,CACX,EAAG,2BACJ,CACD,QAAS,CACP,EAAG,2BACJ,CACD,WAAY,CACV,EAAG,oCACJ,CAED,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,8BACJ,CACD,GAAI,CACF,EAAG,8CACJ,CACD,GAAI,CACF,EAAG,8CACJ,CAED,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CACD,IAAK,CACH,EAAG,EAAe,IAAM,4BACzB,CACD,GAAI,CACF,EAAG,qBAA2B,EAAe,wBAC9C,CACD,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CAED,MAAO,CACL,EAAG,4DACJ,CACD,WAAY,CACV,EAAG,6BAAmC,EAAe,aACtD,CACD,IAAK,CACH,EAAG,iCACJ,CACD,IAAK,CACH,EAAG,4CACJ,CACD,KAAM,CACJ,EAAG,iCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,gCACJ,CACD,MAAO,CACL,EAAG,gBAAsB,EAAe,oBACzC,CACD,MAAO,CACL,EAAG,wCACJ,CACD,UAAW,CACT,EAAG,6BAAmC,EAAe,YACtD,CAED,aAAc,CACZ,EAAG,kCACJ,CACD,oBAAqB,CACnB,EAAG,+DACJ,CACD,UAAW,CACT,EAAG,6BAAmC,EAAe,YACtD,CACD,MAAO,CACL,EAAG,mCACJ,CACD,OAAQ,CACN,EAAG,uCACJ,CAED,MAAO,CACL,EAAG,qBAA2B,EAAe,2BAC9C,CACD,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,SAAU,CACR,EAAG,qBAA2B,EAAe,8BAC9C,CACD,QAAS,CACP,EAAG,qBAA2B,EAAe,6BAC9C,CACD,UAAW,CACT,EAAG,qBAA2B,EAAe,+BAC9C,CACD,QAAS,CACP,EAAG,qBAA2B,EAAe,6BAC9C,CAED,IAAK,CACH,EAAG,+BACJ,CAED,IAAK,8BACL,IAAK,8BACL,SAAU,sCAEV,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,+CACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,+CACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,wCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,0CACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,0CACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CAED,GAAI,CACF,EAAG,qBAA2B,EAAe,wBAC9C,CAED,QAAS,SAAiB,EAAM,EAAS,CAEvC,OAAO,EAAK,KAAK,GAAG,OAAO,EAG7B,OAAQ,CACN,EAAG,IACH,EAAG,4BACH,EAAG,qDACJ,CACD,OAAQ,CACN,EAAG,eACH,EAAG,4CACJ,CACD,UAAW,CACT,EAAG,IACH,EAAG,4BACJ,CACD,OAAQ,CACN,EAAG,IACH,EAAG,4BACJ,CACD,QAAS,CACP,EAAG,IACH,EAAG,4BACH,EAAG,qCAA2C,GAAa,4CAC5D,CACD,OAAQ,CACN,EAAG,iCACH,EAAG,4BACH,EAAG,4BACJ,CACD,OAAQ,CACN,EAAG,iCACH,EAAG,4BACJ,CACD,KAAM,CACJ,EAAG,4BACH,EAAG,qDACJ,CACF,CACU,GAAkB,0CACzB,GAAa,CACf,IAAK,UACN,CACD,SAAgB,GAAY,EAAQ,CAClC,OAAA,EAAA,GAAA,SAAsB,EAAQ,CAC5B,mBAAoB,GACrB,CAAC,CAKJ,SAAgB,GAAS,EAAM,EAAQ,CAWrC,MAVA,GAAgBK,IAAW,OAAc,GAAQA,EAC7CA,EACE,EAAe,GAAYC,EAAK,CAC3B,GAAWA,GAEb,YAAc,GAAYA,EAAK,CAAG,IAEvC,EAAe,GAAcA,EAAK,CAC7B,GAAaA,GAEf,GAAYA,EAAK,CCne1B,IAAIC,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,OAAQ,YAAY,CACmC,GAAQ,CACjF,GAAI,CACF,OACA,aACE,EACJ,MAAM,UAAqB,CAAK,CAa9B,YAAY,EAAO,CACjB,OAAO,CACP,KAAK,MAAQ,EAEf,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAQ,KAAK,MACjB,OAAO,UAA4B,CACjC,OAAO,GAQX,QAAQ,EAAU,EAUlB,IAAI,EAAU,CACZ,OAAO,KAAK,OAAO,CAOrB,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,MAAM,CAQrC,UAAU,EAAS,CACjB,OAAO,GAAO,KAAK,MAAO,EAAQ,CAQpC,QAAQ,EAAS,CACf,IAAI,EAAQ,KAAK,UAAU,EAAQ,CACnC,OAAQ,GAAO,KAAK,MAAM,CAA1B,CACE,IAAK,SACL,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+B,EAAQ,UAChD,IAAK,SACH,MAAO,6BAA+B,EAAQ,UAChD,IAAK,UACH,MAAO,8BAAgC,EAAQ,UACjD,IAAK,OACH,MAAO,kCAAoC,EAAQ,UACrD,IAAK,YACH,MAAO,gCAAkC,EAAQ,UACnD,QACE,MAAO,6BAA+B,EAAQ,WAQpD,QAAS,CACP,MAAO,CACL,OAAQA,GACR,MAAO,KAAK,MACb,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAa,EAAK,MAAM,CAQrC,OAAO,EAAS,CACd,IAAI,EAAQ,KAAK,UAAU,EAAQ,CAEnC,OADW,GAAO,KAAK,MAAM,CAC7B,CACE,IAAK,SACH,MAAO,YAAc,GAAY,EAAM,CAAG,IAC5C,IAAK,SACL,IAAK,YAED,GAAI,CAAC,EAAU,KAAK,MAAM,CACxB,OAAO,KAAK,MAAM,SAAS,CAAG,EAAI,WAAa,UAEjD,IAAI,EAAQ,EAAM,aAAa,CAAC,QAAQ,IAAI,CAI5C,OAHI,IAAU,GAGP,EAFE,EAAM,UAAU,EAAG,EAAM,CAAG,aAAe,EAAM,UAAU,EAAQ,EAAE,CAAG,IAIrF,IAAK,SAED,OAAO,EAAM,UAAU,CAE3B,IAAK,WACH,OAAO,KAAK,MAAM,SAAS,CAC7B,QACE,OAAO,IAKf,OADA,EAAgB,EAAc,OAAQA,GAAK,CACpC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC1KEE,GAAO,yBAEA,GAA8C,EAAQA,GAD9C,CAAC,QAAS,OAAO,CACiD,GAAQ,CAC3F,GAAI,CACF,QACA,QACE,EAQJ,SAAS,EAAgB,EAAM,EAAa,EAAU,CACpD,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAiB,EAAc,EAAK,KAAM,EAAa,EAAS,CACpE,OAAO,IAAgB,OAAS,IAAmB,MAAQ,GAAkB,EAE/E,MAAM,UAA+B,CAAK,CAaxC,YAAY,EAAM,EAAQ,EAAM,CAG9B,GAFA,OAAO,CAEH,OAAOA,GAAS,SAClB,MAAU,UAAU,uCAAuC,CAE7D,GAAI,CAAC,MAAM,QAAQ,EAAO,CACxB,MAAU,UAAU,sEAAsE,CAE5F,GAAI,CAAC,EAAO,EAAK,CACf,MAAU,UAAU,qCAAqC,CAE3D,GAAI,GAAS,IAAIA,EAAK,CACpB,MAAU,MAAM,2BAA6BA,EAAO,0BAA0B,CAEhF,IAAI,EAAa,IAAI,IACrB,IAAK,IAAI,KAAS,EAAQ,CACxB,IAAI,EAAQ,OAAO,GAAU,SAAW,EAAQ,EAAM,KACtD,GAAI,EAAW,IAAI,EAAM,CACvB,MAAU,MAAM,6BAAqC,KAAa,CAElE,EAAW,IAAI,EAAM,CAGzB,KAAK,KAAOA,EACZ,KAAK,OAAS,EAAO,IAAI,SAAU,EAAO,CACxC,OAAOE,GAASA,EAAM,MAAQA,GAC9B,CACF,KAAK,MAAQ,EAAO,IAAI,SAAU,EAAO,CACvC,OAAOA,GAASA,EAAM,MAAQ,OAC9B,CACF,KAAK,KAAO,EAEd,IAAI,MAAO,CACT,OAAOF,GAET,IAAI,0BAA2B,CAC7B,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAgB,OAAO,OAAO,EAAS,CAC3C,GAAQ,KAAK,OAAQ,SAAU,EAAO,CACpC,EAAc,GAAS,IACvB,CAGF,IAAI,EAAO,KAAK,KACZ,EAAW,EAAK,SAAS,EAAM,EAAc,CAC7CA,EAAO,KAAK,KACZ,EAAS,KAAK,OACd,EAAY,GAAK,KAAK,MAAO,IAAI,CACjC,EAASA,EAAO,IAAM,GAAK,KAAK,OAAQ,KAAK,CAAG,IACpD,OAAO,SAAoC,EAAO,EAAM,EAAS,CAC/D,IAAI,EAAa,EAAE,CACnB,EAAW,GAAa,UAAY,CAElC,IAAK,IADD,EAAY,OAAO,OAAO,EAAK,CAC1B,EAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAU,EAAO,IAAM,UAAU,GAEnC,OAAO,EAAS,EAAO,EAAW,EAAQ,EAE5C,IAAI,EAAK,EAAMA,EAAM,EAAW,CAIhC,MAHA,GAAG,OAAS,EACZ,EAAG,KAAO,EAAK,UAAU,CACzB,EAAM,IAAIA,EAAM,EAAG,CACZ,GAQX,QAAQ,EAAU,CAChB,EAAS,KAAK,KAAM,OAAQ,KAAK,CAUnC,IAAI,EAAU,CACZ,IAAI,EAAO,KAAK,QAAQ,EAAS,KAAK,KAAM,OAAQ,KAAK,CAAC,CAC1D,OAAO,IAAI,EAAuB,KAAK,KAAM,KAAK,OAAO,MAAM,EAAE,CAAE,EAAK,CAO1E,OAAQ,CACN,OAAO,IAAI,EAAuB,KAAK,KAAM,KAAK,OAAO,MAAM,EAAE,CAAE,KAAK,KAAK,CAQ/E,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAO,KAAK,KAAK,SAAS,EAAQ,CAItC,OAHI,EAAgB,KAAM,EAAa,GAAW,EAAQ,SAAS,GACjE,EAAO,IAAM,EAAO,KAEf,KAAK,KAAO,IAAM,KAAK,OAAO,KAAK,KAAK,CAAG,OAAS,EAO7D,QAAS,CACP,IAAI,EAAQ,KAAK,MACjB,MAAO,CACL,OAAQA,GACR,KAAM,KAAK,KACX,OAAQ,KAAK,OAAO,IAAI,SAAU,EAAO,EAAO,CAC9C,MAAO,CACL,KAAM,EACN,KAAM,EAAM,GACb,EACD,CACF,KAAM,KAAK,KACZ,CAcH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAuB,EAAK,KAAM,EAAK,OAAQ,EAAK,KAAK,CAQtE,QAAQ,EAAS,CAGf,IAAK,IAFD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAAE,CACN,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IACtC,EAAO,KAAK,4CAA8C,EAAO,KAAK,OAAO,GAAG,CAAG,UAAU,CAE/F,IAAI,EAAO,KAAK,KAAK,OAAO,EAAQ,CAIpC,OAHI,EAAgB,KAAM,EAAa,GAAW,EAAQ,SAAS,GACjE,EAAO,iEAAmE,EAAO,kEAE5E,+BAAiC,EAAO,KAAK,KAAK,CAAG,wEAA+E,EAAO,KAAK,wCAAwC,CAAG,qLAAiM,EAQrY,OAAO,EAAS,CACd,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAO,KAAK,KAAK,MAAM,EAAQ,CAInC,OAHI,EAAgB,KAAM,EAAa,GAAW,EAAQ,SAAS,GACjE,EAAO,UAAiB,aAEnB,YAAc,KAAK,KAAO,WAAa,KAAK,OAAO,IAAI,GAAS,CAAC,KAAK,IAAI,CAAG,YAAc,GAItG,OADA,EAAgB,EAAwB,OAAQA,GAAK,CAC9C,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCtOEG,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,OAAQ,OAAO,CACqC,GAAQ,CAC9E,GAAI,CACF,OACA,QACE,EACJ,MAAM,UAAkB,CAAK,CAe3B,YAAY,EAAY,EAAa,CAMnC,GALA,OAAO,CACP,KAAK,WAAa,EAClB,KAAK,YAAc,GAAe,GAG9B,CAAC,MAAM,QAAQ,EAAW,EAAI,CAAC,EAAW,MAAM,EAAO,CACzD,MAAU,UAAU,6DAA6D,CAEnF,GAAI,KAAK,aAAe,CAAC,KAAK,kBAAkB,CAC9C,MAAU,MAAM,oDAAoD,CAGxE,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAgBT,SAAS,EAAM,EAAU,CAQvB,IAAI,EAAiB,GAAI,KAAK,WAAY,SAAU,EAAW,EAAG,CAEhE,GADe,EAAU,OAAO,GAAQ,EAAK,cAAgB,EAAK,OAAS,MAAM,CAAC,OAAS,EAC7E,CAGZ,IAAI,EAAgB,OAAO,OAAO,EAAS,CAC3C,EAAc,IAAM,GACpB,IAAI,EAAiB,EAAU,SAAS,EAAM,EAAc,CAC5D,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,GAAI,CAAC,EAAS,EAAQ,EAAI,CAAC,EAAQ,EAAQ,EAAI,CAAC,EAAS,EAAQ,CAC/D,MAAU,UAAU,2EAAkF,GAAO,EAAQ,CAAC,CAExH,IAAI,EAAI,EAAK,EAAQ,CACjB,EAAY,OAAO,OAAO,EAAK,CAEnC,MADA,GAAU,IAAM,EAAE,GACX,EAAe,EAAO,EAAW,EAAQ,OAIlD,OAAO,EAAU,SAAS,EAAM,EAAS,EAE3C,CACE,EAAQ,EAAgB,EAAM,QAAQ,CAC1C,OAAO,SAAuB,EAAO,EAAM,EAAS,CAIlD,OAAO,EAAM,GAHI,GAAI,EAAgB,SAAU,EAAe,CAC5D,OAAO,EAAc,EAAO,EAAM,EAAQ,EAC1C,CACyB,EAQ/B,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IAC1C,EAAS,KAAK,WAAW,GAAI,cAAgB,EAAI,IAAK,KAAK,CAU/D,IAAI,EAAU,CAEZ,IAAK,IADD,EAAa,EAAE,CACV,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IAC1C,EAAW,GAAK,KAAK,QAAQ,EAAS,KAAK,WAAW,GAAI,cAAgB,EAAI,IAAK,KAAK,CAAC,CAE3F,OAAO,IAAI,EAAU,EAAY,KAAK,YAAY,CAOpD,OAAQ,CACN,OAAO,IAAI,EAAU,KAAK,WAAW,MAAM,EAAE,CAAE,KAAK,YAAY,CAOlE,kBAAmB,CACjB,OAAO,KAAK,WAAW,SAAW,GAAK,EAAe,KAAK,WAAW,GAAG,EAAI,OAAO,KAAK,WAAW,GAAG,OAAU,SAQnH,mBAAoB,CAClB,OAAO,KAAK,kBAAkB,CAAG,KAAK,WAAW,GAAG,MAAQ,KAQ9D,UAAU,EAAS,CAEjB,OAAO,KAAK,YAAc,IAAM,KAAK,mBAAmB,CAAG,IAAM,KAAK,WAAW,KAAK,KAAK,CAAG,IAOhG,QAAS,CACP,MAAO,CACL,OAAQA,GACR,WAAY,KAAK,WACjB,YAAa,KAAK,YACnB,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,WAAY,EAAK,YAAY,CAQzD,QAAQ,EAAS,CAGf,IAAK,IADD,EAAa,EAAE,CACV,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IAC1C,EAAW,GAAK,KAAK,WAAW,GAAG,QAAQ,CAK3C,OAHE,KAAK,YACA,sGAA6G,EAAO,KAAK,mBAAmB,CAAC,CAAG,UAEhJ,kEAAoE,EAAW,KAAK,wCAAwC,CAAG,kEAS1I,OAAO,EAAS,CACd,IAAI,EAAa,KAAK,WAAW,IAAI,SAAU,EAAO,CACpD,OAAO,EAAM,MAAM,EAAQ,EAC3B,CACF,OAAO,KAAK,YAAc,IAAM,KAAK,mBAAmB,CAAQ,KAAO,EAAW,KAAK,IAAI,CAAG,KAIlG,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCpNEE,GAAO,aAEA,GAAkC,EAAQA,GADlC,CAAC,OAAO,CAC8C,GAAQ,CAC/E,GAAI,CACF,QACE,EACJ,MAAM,UAAmB,CAAK,CAO5B,YAAY,EAAY,CAKtB,GAJA,OAAO,CACP,KAAK,WAAaE,GAAc,EAAE,CAG9BA,IACI,OAAOA,GAAe,UAAa,CAAC,OAAO,KAAKA,EAAW,CAAC,MAAM,SAAU,EAAK,CACrF,OAAO,EAAOA,EAAW,GAAK,EAC9B,EACA,MAAU,UAAU,mCAAmC,CAI7D,IAAI,MAAO,CACT,OAAOF,GAET,IAAI,cAAe,CACjB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAc,EAAE,CACpB,IAAK,IAAI,KAAO,KAAK,WACnB,GAAI,EAAe,KAAK,WAAY,EAAI,CAAE,CAGxC,IAAI,EAAiB,GAAU,EAAI,CAC/B,EAAY,KAAK,MAAM,EAAe,CAE1C,EAAY,GADD,EAAgB,KAAK,WAAY,EAAI,CAClB,SAAS,EAAM,EAAS,CAG1D,OAAO,SAAwB,EAAO,EAAM,EAAS,CACnD,IAAI,EAAM,EAAE,CACZ,IAAK,IAAI,KAAQ,EACX,EAAe,EAAa,EAAK,GACnC,EAAI,GAAQ,EAAY,GAAM,EAAO,EAAM,EAAQ,EAGvD,OAAO,GAQX,QAAQ,EAAU,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAS,KAAK,WAAW,GAAM,cAAgB,GAAU,EAAI,CAAG,IAAK,KAAK,CAWhF,IAAI,EAAU,CACZ,IAAIE,EAAa,EAAE,CACnB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,GACtC,EAAW,GAAO,KAAK,QAAQ,EAAS,KAAK,WAAW,GAAM,cAAgB,GAAU,EAAI,CAAG,IAAK,KAAK,CAAC,EAG9G,OAAO,IAAI,EAAWA,EAAW,CAOnC,OAAQ,CACN,IAAIA,EAAa,EAAE,CACnB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,GACtC,EAAW,GAAO,KAAK,WAAW,IAGtC,OAAO,IAAI,EAAWA,EAAW,CASnC,UAAU,EAAS,CACjB,IAAI,EAAU,EAAE,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAQ,KAAK,GAAU,EAAI,CAAG,KAAO,KAAK,WAAW,GAAK,SAAS,EAAQ,CAAC,CAGhF,MAAO,IAAM,EAAQ,KAAK,KAAK,CAAG,IAOpC,QAAS,CACP,MAAO,CACL,OAAQF,GACR,WAAY,KAAK,WAClB,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAW,EAAK,WAAW,CASxC,QAAQ,EAAS,CACf,IAAI,EAAU,EAAE,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAQ,KAAK,2CAA6C,EAAO,EAAI,CAAG,8HAA+I,KAAK,WAAW,GAAK,OAAO,EAAQ,CAAC,CAGhQ,MAAO,iEAAmE,EAAQ,KAAK,wCAAwC,CAAG,iEAQpI,OAAO,EAAS,CACd,IAAI,EAAU,EAAE,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAQ,KAAK,YAAc,EAAM,QAAU,KAAK,WAAW,GAAK,MAAM,EAAQ,CAAG,OAAO,CAI5F,MADU,8BAAgC,EAAQ,KAAK;EAAK,CAAG,0BAKnE,OADA,EAAgB,EAAY,OAAQA,GAAK,CAClC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCjLF,SAAgB,GAAe,EAAa,EAAM,CAChD,OAAO,IAAI,EAAe,EAAa,IAAI,EAAkB,EAAK,CAAE,IAAI,IAAI,OAAO,KAAK,EAAK,CAAC,CAAC,CCPjG,IAAIG,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,OAAO,CACgD,GAAQ,CACjF,GAAI,CACF,QACE,EAQJ,SAAS,EAAmB,EAAM,EAAa,CAC7C,IAAI,EAAU,EACd,GAAI,IAAgB,OAClB,KAAO,GAAkB,EAAQ,EAAE,EAAU,EAAQ,QAMvD,OAJI,EAAe,EAAQ,CAAS,GAChC,GAAe,EAAQ,CAClB,EAAmB,EAAQ,KAAK,GAAI,EAAY,CAElD,GAgBT,SAAS,EAA8B,EAAM,EAAa,EAAU,EAAM,EAAO,CAE/E,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAgB,GAAiB,EAAM,EAAY,CACvD,GAAI,IAAgB,OAAS,EAAK,OAAS,GAAK,EAAK,eAAe,GAAK,oBAAsB,EAAK,eAAe,GAAK,wBACtH,OAAO,EAAK,IAAI,SAAU,EAAK,CAC7B,OAAQ,EAAI,YAAY,CAAC,KAAzB,CAEE,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,MAAO,GACT,QACE,MAAO,KAEX,CAEJ,IAAI,EACJ,OAAQ,EAAK,OAAb,CACE,IAAK,GACH,EAAS,EAAE,CACX,MACF,IAAK,GAID,IAAI,EAAoB,EAAc,EAAK,GAAI,EAAa,EAAU,EAAK,CAG3E,GAAI,GAAS,IAAsB,KAAM,CACvC,IAAI,EACA,EASJ,GARI,IAAgB,QAClB,EAAoB,EAAK,GAAG,eAAe,CAC3C,EAAiB,EAAK,eAAe,GAGrC,EAAoB,EAAK,GAAG,YAAY,CAAC,eAAe,CACxD,EAAiB,EAAK,YAAY,CAAC,eAAe,EAEhD,GAAW,GAAY,GAAgB,kBAAoB,GAAO,CACpE,EAAS,CAAC,GAAM,CAChB,MAEF,GAAI,GAAW,GAAmB,GAAmB,cAAgB,GAAO,CAC1E,EAAS,CAAC,GAAM,CAChB,OAGJ,GAAI,IAAsB,KAAM,CAE9B,EAAS,CAAC,GAAM,CAChB,MAEF,GAAI,GAAqB,EAAY,CAEnC,EAAS,CAAC,GAAK,CACf,MAIF,EAAS,CAAC,GAAM,CAElB,MACF,IAAK,GAGD,IAAI,EAEA,EAAgB,EAAc,EAAK,GAAI,EAAa,EAAU,EAAK,CAEnE,EAAe,GAAkB,EAAM,EAAK,GAAI,EAAY,CAChE,AAaE,EAbE,IAAkB,KAGR,GACH,IAAkB,GAAc,IAAkB,SAAW,CAAC,EAK3D,GACH,EAAgB,EAK3B,IAAI,EAEA,EAAgB,EAAc,EAAK,GAAI,EAAa,EAAU,EAAK,CAEnE,EAAe,GAAkB,EAAM,EAAK,GAAI,EAAY,CAkBhE,GAjBA,AAaE,EAbE,IAAkB,KAGR,GACH,IAAkB,GAAc,IAAkB,QAAU,CAAC,EAK1D,GACH,EAAgB,EAOvB,EAAO,CACT,IAAI,EACA,EACA,EACA,IAAgB,QAClB,EAAkB,EAAK,eAAe,CACtC,EAAgB,EAAK,KAAK,GAAG,eAAe,CAC5C,EAAgB,EAAK,KAAK,GAAG,eAAe,GAG5C,EAAkB,EAAK,YAAY,CAAC,eAAe,CACnD,EAAgB,EAAK,KAAK,GAAG,YAAY,CAAC,eAAe,CACzD,EAAgB,EAAK,KAAK,GAAG,YAAY,CAAC,eAAe,EAEvD,IAAkB,OAChB,GAAW,GAAY,GAAiB,kBAAoB,KAC9D,EAAY,IAEV,GAAW,GAAe,GAAe,cAAgB,KAC3D,EAAY,KAGZ,IAAkB,OAChB,GAAW,GAAY,GAAiB,mBAAqB,KAC/D,EAAY,IAEV,GAAW,GAAe,GAAe,cAAgB,KAC3D,EAAY,KAIlB,EAAS,CAAC,EAAW,EAAU,CAEjC,MACF,SACM,EAAK,eAAe,GAAK,oBAAsB,EAAK,eAAe,GAAK,2BAC1E,EAAS,EAAK,IAAI,SAAU,EAAK,CAC/B,IAAI,EAAgB,EAAc,EAAK,EAAa,EAAU,EAAK,CAC/D,EAAe,GAAkB,EAAM,EAAK,EAAY,CACxD,EAAmB,GAAiB,EAAK,EAAY,CASzD,OARI,IAAkB,KAEb,GACE,IAAe,GAAiB,IAAkB,GAAoB,CAAC,EACzE,GACE,EAAgB,GAI3B,EAEJ,MAOJ,GAAI,EAAK,QAAU,GAAK,EAAK,eAAe,GAAK,yBAA2B,EAAK,UAAY,IAAgB,OAAS,IAAa,WAC5H,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EAC/B,EAAmB,EAAK,GAAI,EAAY,EAAI,CAAC,EAAO,EAAI,KAAO,IAAgB,QAAU,CAAC,GAAkB,EAAK,EAAI,GAAG,IAC1H,EAAO,GAAK,IAIlB,OAAO,EAET,MAAM,UAAqB,CAAK,CAY9B,YAAY,EAAI,EAAI,EAAM,EAAU,EAAc,CAGhD,GAFA,OAAO,CAEH,OAAO,GAAO,SAChB,MAAU,UAAU,qCAAqC,CAE3D,GAAI,OAAO,GAAO,SAChB,MAAU,UAAU,qCAAqC,CAE3D,GAAI,CAAC,MAAM,QAAQ,EAAK,EAAI,CAAC,EAAK,MAAM,EAAO,CAC7C,MAAU,UAAU,uDAAuD,CAE7E,KAAK,SAAW,IAAa,GAC7B,KAAK,aAAe,IAAiB,GACrC,KAAK,GAAK,EACV,KAAK,GAAK,EACV,KAAK,KAAO,GAAQ,EAAE,CAExB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CAEvB,GAAI,OAAO,KAAK,IAAO,UAAY,CAAC,EAAa,EAAM,KAAK,GAAG,CAE3D,MADG,EAAK,KAAK,IAGH,MAAM,0BAA4B,KAAK,GAAK,IAAI,CAFhD,MAAM,YAAc,KAAK,GAAK,wCAAwC,CAKpF,IAAI,EAAK,EAAgB,EAAM,KAAK,GAAG,CACnC,EAAW,GAAI,KAAK,KAAM,SAAU,EAAK,CAC3C,OAAO,EAAI,SAAS,EAAM,EAAS,EACnC,CACF,GAAI,OAAO,GAAO,YAAc,EAAG,UAAY,GAAM,CAGnD,IAAI,EAAU,KAAK,KACnB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,EAAS,EAAM,GAAe,EAAO,EAAK,CAAC,UAE9C,EAAS,SAAW,EAAG,CAChC,IAAI,EAAW,EAAS,GACxB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAC,UAElC,EAAS,SAAW,EAAG,CAChC,IAAI,EAAW,EAAS,GACpB,EAAW,EAAS,GACxB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAE,EAAS,EAAO,EAAM,EAAQ,CAAC,OAG3E,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,MAAM,KAAM,GAAI,EAAU,SAAU,EAAS,CACrD,OAAO,EAAQ,EAAO,EAAM,EAAQ,EACpC,CAAC,EAST,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAUnD,IAAI,EAAU,CAEZ,IAAK,IADD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAK,GAAK,KAAK,QAAQ,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAAC,CAEzE,OAAO,IAAI,EAAa,KAAK,GAAI,KAAK,GAAI,EAAM,KAAK,SAAU,KAAK,aAAa,CAOnF,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,GAAI,KAAK,GAAI,KAAK,KAAK,MAAM,EAAE,CAAE,KAAK,SAAU,KAAK,aAAa,CASjG,SAAU,CACR,OAAO,KAAK,KAAK,SAAW,EAS9B,UAAW,CACT,OAAO,KAAK,KAAK,SAAW,EAQ9B,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAW,GAAW,EAAQ,SAAW,EAAQ,SAAW,OAC5D,EAAO,KAAK,KACZ,EAAS,EAA8B,KAAM,EAAa,EAAU,EAAM,GAAM,CACpF,GAAI,EAAK,SAAW,EAAG,CAErB,IAAI,EAAQ,GAAiB,KAAM,EAAY,CAC3C,EAAU,EAAK,GAAG,SAAS,EAAQ,CACnC,EAAO,KACT,EAAU,IAAM,EAAU,KAI5B,IAAI,EAAY,YAAY,KAAK,KAAK,GAAG,CAUzC,OATI,IAAU,QAEL,KAAK,IAAM,EAAY,IAAM,IAAM,EACjC,IAAU,OAEZ,GAAW,EAAY,IAAM,IAAM,KAAK,GAI1C,EAAU,KAAK,WACb,EAAK,SAAW,EAAG,CAC5B,IAAI,EAAM,EAAK,GAAG,SAAS,EAAQ,CAC/B,EAAM,EAAK,GAAG,SAAS,EAAQ,CAYnC,OAXI,EAAO,KAET,EAAM,IAAM,EAAM,KAEhB,EAAO,KAET,EAAM,IAAM,EAAM,KAEhB,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAM,IAAM,EAEd,EAAM,IAAM,KAAK,GAAK,IAAM,UAC1B,EAAK,OAAS,IAAM,KAAK,eAAe,GAAK,oBAAsB,KAAK,eAAe,GAAK,yBAA0B,CAC/H,IAAI,EAAkB,EAAK,IAAI,SAAU,EAAK,EAAO,CAMnD,MALA,GAAM,EAAI,SAAS,EAAQ,CACvB,EAAO,KAET,EAAM,IAAM,EAAM,KAEb,GACP,CAIF,OAHI,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAgB,KAAK,IAAI,CAE3B,EAAgB,KAAK,IAAM,KAAK,GAAK,IAAI,MAGhD,OAAO,KAAK,GAAK,IAAM,KAAK,KAAK,KAAK,KAAK,CAAG,IAQlD,QAAS,CACP,MAAO,CACL,OAAQA,GACR,GAAI,KAAK,GACT,GAAI,KAAK,GACT,KAAM,KAAK,KACX,SAAU,KAAK,SACf,aAAc,KAAK,aACpB,CAgBH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAa,EAAK,GAAI,EAAK,GAAI,EAAK,KAAM,EAAK,SAAU,EAAK,aAAa,CAQxF,QAAQ,EAAS,CACf,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAW,GAAW,EAAQ,SAAW,EAAQ,SAAW,OAC5D,EAAO,KAAK,KACZ,EAAS,EAA8B,KAAM,EAAa,EAAU,EAAM,GAAM,CACpF,GAAI,EAAK,SAAW,EAAG,CAErB,IAAI,EAAQ,GAAiB,KAAM,EAAY,CAC3C,EAAU,EAAK,GAAG,OAAO,EAAQ,CASnC,OARE,EAAO,KACT,EAAU,iEAAmE,EAAU,kEAErF,IAAU,QAEL,gFAAuF,EAAO,KAAK,GAAG,CAAG,UAAY,EAGrH,EAAU,iFAAwF,EAAO,KAAK,GAAG,CAAG,kBAEpH,EAAK,SAAW,EAAG,CAE5B,IAAI,EAAM,EAAK,GAAG,OAAO,EAAQ,CAC7B,EAAM,EAAK,GAAG,OAAO,EAAQ,CAYjC,OAXI,EAAO,KAET,EAAM,iEAAmE,EAAM,kEAE7E,EAAO,KAET,EAAM,iEAAmE,EAAM,kEAE7E,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAM,yFAAgG,EAExG,EAAM,kFAAyF,EAAO,KAAK,GAAG,CAAG,UAAY,MAC/H,CACL,IAAI,EAAkB,EAAK,IAAI,SAAU,EAAK,EAAO,CAMnD,MALA,GAAM,EAAI,OAAO,EAAQ,CACrB,EAAO,KAET,EAAM,iEAAmE,EAAM,kEAE1E,GACP,CAQA,OAPE,EAAK,OAAS,IAAM,KAAK,eAAe,GAAK,oBAAsB,KAAK,eAAe,GAAK,yBAC1F,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAgB,KAAK,yFAA8F,CAErH,EAAgB,KAAK,kFAAyF,EAAO,KAAK,GAAG,CAAG,UAAU,CAG1I,+BAAiC,EAAO,KAAK,GAAG,CAAG,wEAA+E,EAAgB,KAAK,wCAAwC,CAAG,kEAU/M,OAAO,EAAS,CACd,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAW,GAAW,EAAQ,SAAW,EAAQ,SAAW,OAC5D,EAAO,KAAK,KACZ,EAAS,EAA8B,KAAM,EAAa,EAAU,EAAM,GAAK,CAC/E,EAAK,EAAe,KAAK,IAG7B,GAFA,EAAY,IAAO,OAAc,KAAK,GAAK,EAEvC,EAAK,SAAW,EAAG,CAErB,IAAI,EAAQ,GAAiB,KAAM,EAAY,CAC3C,EAAU,EAAK,GAAG,MAAM,EAAQ,CAapC,OAZI,EAAO,KACT,EAAU,UAAiB,aAEzB,IAAU,QAEL,EAAK,EAGL,EAAU,UAKV,EAAK,SAAW,EAAG,CAE5B,IAAI,EAAM,EAAK,GACX,EAAS,EAAI,MAAM,EAAQ,CAC3B,EAAO,KACT,EAAS,UAAiB,aAG5B,IAAI,EADM,EAAK,GACE,MAAM,EAAQ,CAC3B,EAAO,KACT,EAAS,UAAiB,aAI5B,IAAI,EACA,IAAgB,OACF,EAAI,eAAe,CAGnB,EAAI,YAAY,CAAC,eAAe,CAElD,OAAQ,KAAK,eAAe,CAA5B,CACE,IAAK,sBAEH,OAAO,EAAK,IAAM,EAAS,KAAY,EAAS,IAClD,IAAK,mBAGH,OAFA,EAAS,IAAM,EAAS,IACxB,EAAS,IAAM,EAAS,IAChB,EAAR,CACE,IAAK,kBACL,IAAK,sBACH,EAAS,UAAiB,YAE9B,MACF,IAAK,wBACH,GAAI,KAAK,UAAY,IAAa,OAChC,OAAO,EAAS,IAAM,EAG5B,OAAO,EAAS,EAAK,UACZ,EAAK,OAAS,IAAM,KAAK,eAAe,GAAK,oBAAsB,KAAK,eAAe,GAAK,yBAA0B,CAC/H,IAAI,EAAe,EAAK,IAAI,SAAU,EAAK,EAAO,CAKhD,MAJA,GAAM,EAAI,MAAM,EAAQ,CACpB,EAAO,KACT,EAAM,UAAiB,aAElB,GACP,CAIF,OAHI,KAAK,eAAe,GAAK,yBAA2B,KAAK,UAAY,IAAa,OAC7E,EAAa,KAAK,IAAI,CAExB,EAAa,KAAK,EAAG,MAK5B,MAAO,YAAc,KAAK,GAAK,WAAa,EAAK,IAAI,SAAU,EAAK,CAClE,OAAO,EAAI,MAAM,EAAQ,EACzB,CAAC,KAAK,IAAI,CAAG,WAQnB,eAAgB,CACd,OAAO,KAAK,KAAO,IAAM,KAAK,IAIlC,OADA,EAAgB,EAAc,OAAQA,GAAK,CACpC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCjnBEE,GAAO,kBAEA,GAAuC,EAAQA,GADvC,CAAC,OAAO,CACmD,GAAQ,CACpF,GAAI,CACF,QACE,EACJ,MAAM,UAAwB,CAAK,CAQjC,YAAY,EAAS,CAGnB,GAFA,OAAO,CAEH,CAAC,EAAO,EAAQ,CAClB,MAAU,UAAU,wCAAwC,CAE9D,KAAK,QAAU,EAEjB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,mBAAoB,CACtB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,OAAO,KAAK,QAAQ,SAAS,EAAM,EAAS,CAQ9C,YAAa,CACX,OAAO,KAAK,QAAQ,YAAY,CAOlC,QAAQ,EAAU,CAChB,EAAS,KAAK,QAAS,UAAW,KAAK,CASzC,IAAI,EAAU,CAEZ,OAAO,IAAI,EADG,EAAS,KAAK,QAAS,UAAW,KAAK,CAClB,CAOrC,OAAQ,CACN,OAAO,IAAI,EAAgB,KAAK,QAAQ,CAS1C,UAAU,EAAS,CAIjB,MAHI,CAAC,GAAW,GAAW,CAAC,EAAQ,aAAe,GAAW,EAAQ,cAAgB,OAC7E,IAAM,KAAK,QAAQ,SAAS,EAAQ,CAAG,IAEzC,KAAK,QAAQ,SAAS,EAAQ,CAOvC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,QAAS,KAAK,QACf,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAgB,EAAK,QAAQ,CAS1C,QAAQ,EAAS,CAIf,MAHI,CAAC,GAAW,GAAW,CAAC,EAAQ,aAAe,GAAW,EAAQ,cAAgB,OAC7E,iEAAmE,KAAK,QAAQ,OAAO,EAAQ,CAAG,iEAEpG,KAAK,QAAQ,OAAO,EAAQ,CASrC,OAAO,EAAS,CAId,MAHI,CAAC,GAAW,GAAW,CAAC,EAAQ,aAAe,GAAW,EAAQ,cAAgB,OAC7E,UAAiB,KAAK,QAAQ,MAAM,EAAQ,WAE9C,KAAK,QAAQ,MAAM,EAAQ,EAItC,OADA,EAAgB,EAAiB,OAAQA,GAAK,CACvC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCnJEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,OAAO,CAC6C,GAAQ,CAC9E,GAAI,CACF,QACE,EASJ,SAAS,EAA8B,EAAM,EAAa,EAAU,CAClE,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAS,EAAE,CACX,EAAkB,EAAc,EAAK,MAAO,EAAa,EAAS,CAEtE,GADA,EAAO,MAAQ,IAAoB,MAAQ,GAAmB,GAAc,IAAgB,MACxF,EAAK,KAAM,CACb,IAAI,EAAiB,EAAc,EAAK,KAAM,EAAa,EAAS,CACpE,EAAO,KAAO,IAAmB,MAAQ,GAAkB,GAAc,IAAgB,MAE3F,IAAI,EAAgB,EAAc,EAAK,IAAK,EAAa,EAAS,CAElE,MADA,GAAO,IAAM,IAAkB,MAAQ,GAAiB,GAAc,IAAgB,MAC/E,EAET,MAAM,UAAkB,CAAK,CAS3B,YAAY,EAAO,EAAK,EAAM,CAK5B,GAJA,OAAO,CAEH,CAAC,EAAO,EAAM,EACd,CAAC,EAAO,EAAI,EACZ,GAAQ,CAAC,EAAO,EAAK,CAAE,MAAU,UAAU,gBAAgB,CAC/D,GAAI,UAAU,OAAS,EAAG,MAAU,MAAM,qBAAqB,CAC/D,KAAK,MAAQ,EACb,KAAK,IAAM,EACX,KAAK,KAAO,GAAQ,KAEtB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAQT,UAAW,CAKT,OAHiB,KAAK,OAAO,SAAU,EAAM,CAC3C,OAAO,EAAa,EAAK,EAAI,EAAK,OAAS,OAC3C,CACgB,OAAS,EAgB7B,SAAS,EAAM,EAAU,CACvB,IAAI,EAAQ,EAAK,MACb,EAAY,KAAK,MAAM,SAAS,EAAM,EAAS,CAC/C,EAAU,KAAK,IAAI,SAAS,EAAM,EAAS,CAC/C,GAAI,KAAK,KAAM,CACb,IAAI,EAAW,KAAK,KAAK,SAAS,EAAM,EAAS,CACjD,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,EAAM,EAAU,EAAO,EAAM,EAAQ,CAAE,EAAQ,EAAO,EAAM,EAAQ,CAAE,EAAS,EAAO,EAAM,EAAQ,CAAC,OAG9G,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,EAAM,EAAU,EAAO,EAAM,EAAQ,CAAE,EAAQ,EAAO,EAAM,EAAQ,CAAC,EASlF,QAAQ,EAAU,CAChB,EAAS,KAAK,MAAO,QAAS,KAAK,CACnC,EAAS,KAAK,IAAK,MAAO,KAAK,CAC3B,KAAK,MACP,EAAS,KAAK,KAAM,OAAQ,KAAK,CAUrC,IAAI,EAAU,CACZ,OAAO,IAAI,EAAU,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,IAAK,MAAO,KAAK,CAAC,CAAE,KAAK,MAAQ,KAAK,QAAQ,EAAS,KAAK,KAAM,OAAQ,KAAK,CAAC,CAAC,CAOtL,OAAQ,CACN,OAAO,IAAI,EAAU,KAAK,MAAO,KAAK,IAAK,KAAK,MAAQ,KAAK,KAAK,CAQpE,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAA8B,KAAM,EAAa,GAAW,EAAQ,SAAS,CAGtF,EACA,EAAQ,KAAK,MAAM,SAAS,EAAQ,CAKxC,GAJI,EAAO,QACT,EAAQ,IAAM,EAAQ,KAExB,EAAM,EACF,KAAK,KAAM,CACb,IAAI,EAAO,KAAK,KAAK,SAAS,EAAQ,CAClC,EAAO,OACT,EAAO,IAAM,EAAO,KAEtB,GAAO,IAAM,EAEf,IAAI,EAAM,KAAK,IAAI,SAAS,EAAQ,CAKpC,OAJI,EAAO,MACT,EAAM,IAAM,EAAM,KAEpB,GAAO,IAAM,EACN,EAOT,QAAS,CACP,MAAO,CACL,OAAQA,GACR,MAAO,KAAK,MACZ,IAAK,KAAK,IACV,KAAM,KAAK,KACZ,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,MAAO,EAAK,IAAK,EAAK,KAAK,CAQvD,QAAQ,EAAS,CACf,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAA8B,KAAM,EAAa,GAAW,EAAQ,SAAS,CAGtF,EACA,EAAQ,KAAK,MAAM,OAAO,EAAQ,CAKtC,GAJI,EAAO,QACT,EAAQ,iEAAmE,EAAQ,kEAErF,EAAM,EACF,KAAK,KAAM,CACb,IAAI,EAAO,KAAK,KAAK,OAAO,EAAQ,CAChC,EAAO,OACT,EAAO,iEAAmE,EAAO,kEAEnF,GAAO,2DAA6D,EAEtE,IAAI,EAAM,KAAK,IAAI,OAAO,EAAQ,CAKlC,OAJI,EAAO,MACT,EAAM,iEAAmE,EAAM,kEAEjF,GAAO,2DAA6D,EAC7D,EAQT,OAAO,EAAS,CACd,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAA8B,KAAM,EAAa,GAAW,EAAQ,SAAS,CACtF,EAAM,KAAK,MAAM,MAAM,EAAQ,CAInC,GAHI,EAAO,QACT,EAAM,UAAiB,aAErB,KAAK,KAAM,CACb,IAAI,EAAO,KAAK,KAAK,MAAM,EAAQ,CAC/B,EAAO,OACT,EAAO,UAAiB,aAE1B,GAAO,IAAM,EAEf,IAAI,EAAM,KAAK,IAAI,MAAM,EAAQ,CAKjC,OAJI,EAAO,MACT,EAAM,UAAiB,aAEzB,GAAO,IAAM,EACN,GAIX,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCnPEE,GAAO,iBAEA,GAAsC,EAAQA,GADtC,CAAC,OAAO,CACkD,GAAQ,CACnF,GAAI,CACF,QACE,EACA,EAAc,CAChB,MAAO,KACP,QAAS,KACT,QAAS,IACT,OAAQ,IACR,UAAW,KACX,SAAU,KACX,CACD,MAAM,UAAuB,CAAK,CAYhC,YAAY,EAAc,EAAQ,CAEhC,GADA,OAAO,CACH,CAAC,MAAM,QAAQ,EAAa,CAC9B,MAAU,UAAU,0CAA0C,CAEhE,GAAI,CAAC,MAAM,QAAQ,EAAO,CACxB,MAAU,UAAU,oCAAoC,CAE1D,GAAI,EAAa,SAAW,EAAO,OAAS,EAC1C,MAAU,UAAU,qFAA0F,CAEhH,KAAK,aAAe,EACpB,KAAK,OAAS,EAEhB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,kBAAmB,CACrB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAIE,EAAO,KACP,EAAW,KAAK,OAAO,IAAI,GAAK,EAAE,SAAS,EAAM,EAAS,CAAC,CAC/D,OAAO,SAA4B,EAAO,EAAM,EAAS,CAGvD,IAAK,IAFD,EACA,EAAU,EAAS,GAAG,EAAO,EAAM,EAAQ,CACtC,EAAI,EAAG,EAAIA,EAAK,aAAa,OAAQ,IAI5C,GAHA,EAAU,EACV,EAAU,EAAS,EAAI,GAAG,EAAO,EAAM,EAAQ,CAE3C,CADS,EAAgB,EAAMA,EAAK,aAAa,GAAG,CAC5C,EAAS,EAAQ,CAC3B,MAAO,GAGX,MAAO,IAQX,QAAQ,EAAU,CAChB,KAAK,OAAO,SAAS,EAAG,IAAM,EAAS,EAAG,UAAY,EAAI,IAAK,KAAK,CAAE,KAAK,CAS7E,IAAI,EAAU,CACZ,OAAO,IAAI,EAAe,KAAK,aAAa,OAAO,CAAE,KAAK,OAAO,KAAK,EAAG,IAAM,KAAK,QAAQ,EAAS,EAAG,UAAY,EAAI,IAAK,KAAK,CAAC,CAAE,KAAK,CAAC,CAO7I,OAAQ,CACN,OAAO,IAAI,EAAe,KAAK,aAAc,KAAK,OAAO,CAQ3D,UAAU,EAAS,CAQjB,IAAK,IAPD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAC1E,EAAe,KAAK,OAAO,IAAI,SAAU,EAAG,EAAO,CACrD,IAAI,EAAkB,EAAc,EAAG,EAAa,GAAW,EAAQ,SAAS,CAChF,OAAO,IAAgB,OAAS,IAAoB,MAAQ,GAAmB,EAAa,IAAM,EAAE,SAAS,EAAQ,CAAG,IAAM,EAAE,SAAS,EAAQ,EACjJ,CACE,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,KAAK,aAAa,OAAQ,IAC5C,GAAO,IAAM,EAAY,KAAK,aAAa,IAC3C,GAAO,IAAM,EAAa,EAAI,GAEhC,OAAO,EAOT,QAAS,CACP,MAAO,CACL,OAAQF,GACR,aAAc,KAAK,aACnB,OAAQ,KAAK,OACd,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAe,EAAK,aAAc,EAAK,OAAO,CAQ3D,QAAQ,EAAS,CAQf,IAAK,IAPD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAC1E,EAAe,KAAK,OAAO,IAAI,SAAU,EAAG,EAAO,CACrD,IAAI,EAAkB,EAAc,EAAG,EAAa,GAAW,EAAQ,SAAS,CAChF,OAAO,IAAgB,OAAS,IAAoB,MAAQ,GAAmB,EAAa,iEAAmE,EAAE,OAAO,EAAQ,CAAG,iEAAmE,EAAE,OAAO,EAAQ,EACvQ,CACE,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,KAAK,aAAa,OAAQ,IAC5C,GAAO,kFAAyF,EAAO,EAAY,KAAK,aAAa,IAAI,CAAG,UAAY,EAAa,EAAI,GAE3K,OAAO,EAQT,OAAO,EAAS,CAQd,IAAK,IAPD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAC1E,EAAe,KAAK,OAAO,IAAI,SAAU,EAAG,EAAO,CACrD,IAAI,EAAkB,EAAc,EAAG,EAAa,GAAW,EAAQ,SAAS,CAChF,OAAO,IAAgB,OAAS,IAAoB,MAAQ,GAAmB,EAAa,UAAY,EAAE,MAAM,EAAQ,CAAG,UAAY,EAAE,MAAM,EAAQ,EACvJ,CACE,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,KAAK,aAAa,OAAQ,IAC5C,GAAO,EAAe,KAAK,aAAa,IAAM,EAAa,EAAI,GAEjE,OAAO,GAIX,OADA,EAAgB,EAAgB,OAAQA,GAAK,CACtC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC/LS,GAAkC,EAFlC,aACQ,CAAC,OAAQ,QAAS,OAAO,CAC6B,GAAQ,CAC/E,GAAI,CACF,OACA,OACA,QACE,EAMJ,SAAS,EAAgB,EAAM,CAC7B,OAAO,EAAO,EAAK,gBAAgBG,EAAK,CAAG,GAE7C,MAAM,UAAmB,CAAK,CAQ5B,YAAY,EAAM,CAGhB,GAFA,OAAO,CAEH,OAAOA,GAAS,SAClB,MAAU,UAAU,uCAAuC,CAE7D,KAAK,KAAOA,EAEd,IAAI,MAAO,CACT,MAAO,aAET,IAAI,cAAe,CACjB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAIA,EAAO,KAAK,KAChB,GAAI,EAASA,KAAU,GAIrB,OAAO,SAAU,EAAO,EAAM,EAAS,CACrC,OAAO,EAAgB,EAAMA,EAAK,KAE3BA,KAAQE,EACjB,OAAO,SAAU,EAAO,EAAM,EAAS,CACrC,OAAO,EAAM,IAAIF,EAAK,CAAG,EAAM,IAAIA,EAAK,CAAG,EAAgBE,EAAMF,EAAK,EAGxE,IAAIG,EAAS,EAAgBH,EAAK,CAClC,OAAO,SAAU,EAAO,EAAM,EAAS,CACrC,OAAO,EAAM,IAAIA,EAAK,CAAG,EAAM,IAAIA,EAAK,CAAGG,EAAS,IAAI,EAAK,KAAMH,EAAK,CAAG,EAAW,kBAAkBA,EAAK,EASnH,QAAQ,EAAU,EAUlB,IAAI,EAAU,CACZ,OAAO,KAAK,OAAO,CAOrB,OAAO,kBAAkB,EAAM,CAC7B,MAAU,MAAM,oBAAsBA,EAAK,CAO7C,OAAQ,CACN,OAAO,IAAI,EAAW,KAAK,KAAK,CASlC,UAAU,EAAS,CACjB,OAAO,KAAK,KASd,QAAQ,EAAS,CACf,IAAIA,EAAO,EAAO,KAAK,KAAK,CAc5B,OAbIA,IAAS,QAAUA,IAAS,QACvB,0CAA4CA,EAAO,UACjDA,IAAS,IACX,mDAAqDA,EAAO,UAC1DA,IAAS,WACX,kDAAoDA,EAAO,UACzDA,IAAS,MACX,6CAA+CA,EAAO,UACpDA,IAAS,OACX,8CAAgDA,EAAO,UACrDA,IAAS,YACX,mDAAqDA,EAAO,UAE9D,6BAA+BA,EAAO,UAO/C,QAAS,CACP,MAAO,CACL,OAAQ,aACR,KAAM,KAAK,KACZ,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAW,EAAK,KAAK,CASlC,OAAO,EAAS,CACd,IAAIG,EAAS,GACF,EAAK,KAAK,QAAU,QAAe,EAAgB,KAAK,KAAK,GACtE,EAAS,IAEX,IAAI,EAAS,GAAS,KAAK,KAAMA,EAAO,CAOxC,OANI,EAAO,KAAO,KAET,EAIF,IAAM,GAGjB,OAAO,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCxLEC,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,OAAQ,OAAQ,aAAa,CAC0B,GAAQ,CACjF,IAAI,EACA,CACF,OACA,OACA,cACE,EAEA,EAAQ,GAAU,GAAO,EAAQ,CACnC,SAAU,GACX,CAAC,CAUF,SAAS,EAAe,EAAU,EAAM,EAAS,CAQ/C,IAPA,IAAI,EAAQ,GAIR,EAAQ,qDACR,EAAW,EACX,GACI,EAAQ,EAAM,KAAK,EAAS,IAAM,MAKxC,GAFA,GAAS,EAAS,UAAU,EAAU,EAAM,MAAM,CAClD,EAAW,EAAM,MACb,EAAM,KAAO,KAEf,GAAS,IACT,QACK,CAEL,GAAY,EAAM,GAAG,OACrB,IAAI,EAAW,EAAK,EAAM,IAC1B,GAAI,CAAC,EACH,MAAU,eAAe,sBAAwB,EAAM,GAAK,mBAAmB,CAEjF,GAAI,EAAM,KAAO,IAAA,GAEf,OAAQ,OAAO,EAAf,CACE,IAAK,SACH,GAAS,EACT,MACF,IAAK,SACH,GAAI,EAAO,EAAS,CAClB,GAAS,EAAS,MAAM,EAAQ,SACvB,MAAM,QAAQ,EAAS,CAEhC,GAAS,EAAS,IAAI,SAAU,EAAK,EAAO,CAC1C,GAAI,EAAO,EAAI,CACb,OAAO,EAAI,MAAM,EAAQ,CAE3B,MAAU,UAAU,aAAe,EAAM,GAAK,IAAM,EAAQ,mBAAmB,EAC/E,CAAC,KAAK,IAAI,MAEZ,MAAU,UAAU,aAAe,EAAM,GAAK,8CAA8C,CAE9F,MACF,QACE,MAAU,UAAU,aAAe,EAAM,GAAK,8CAA8C,SAI5F,EAAO,EAAS,EAAM,KAAO,EAAS,EAAM,IAAI,CAClD,GAAS,EAAS,EAAM,IAAI,MAAM,EAAQ,MAE1C,MAAU,UAAU,aAAe,EAAM,GAAK,IAAM,EAAM,GAAK,mBAAmB,CAO1F,MAFA,IAAS,EAAS,MAAM,EAAS,CAE1B,EAET,MAAM,UAAqB,CAAK,CAU9B,YAAY,EAAI,EAAM,EAAU,CAO9B,GANA,OAAO,CACH,OAAO,GAAO,WAChB,EAAK,IAAI,EAAW,EAAG,EAIrB,CAAC,EAAO,EAAG,CAAE,MAAU,UAAU,kCAAkC,CACvE,GAAI,CAAC,MAAM,QAAQ,EAAK,EAAI,CAAC,EAAK,MAAM,EAAO,CAC7C,MAAU,UAAU,uDAAuD,CAE7E,IAAI,EAAe,OAAO,EAC1B,GAAI,EAAE,IAAiB,aAAe,IAAiB,WACrD,MAAU,UAAU,+CAA+C,CAErE,KAAK,GAAK,EACV,KAAK,KAAO,GAAQ,EAAE,CACtB,KAAK,SAAW,CAAC,CAAC,EAIpB,IAAI,MAAO,CACT,OAAO,KAAK,GAAG,MAAQ,GAEzB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CAEvB,IAAI,EAAW,KAAK,KAAK,IAAI,GAAO,EAAI,SAASE,EAAM,EAAS,CAAC,CAC7D,EAAuB,KAAK,UAAY,EAAe,KAAK,GAAG,EAAI,KAAK,GAAG,iBAC/E,GAAI,EAAa,KAAK,GAAG,CAAE,CACzB,IAAI,EAAQ,KAAK,GAAG,KACpB,GAAK,EAAS,GAkEP,CAEL,IAAI,EAAW,KAAK,KACpB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIC,EAAK,EAAgB,EAAM,EAAM,CACjC,QAAwBA,IAAO,IAAA,IACnC,IAAI,OAAOA,GAAO,WAChB,MAAU,UAAU,aAAoB,oCAAkD,EAAMA,EAAG,GAAE,CAEvG,GAAIA,EAAG,QAEL,OAAOA,EAAG,EAAUD,EAAM,GAAe,EAAO,EAAK,CAAC,CAEtD,IAAI,EAAS,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CACnE,OAAOC,EAAG,MAAMA,EAAI,EAAO,OAhFX,CAGpB,IAAI,EAAK,KAASD,EAAO,EAAgBA,EAAM,EAAM,CAAG,IAAA,GACpD,EAAQ,OAAO,GAAO,YAAc,EAAG,UAAY,GACnD,EAAY,GAAS,CACvB,IAAI,EACJ,GAAI,EAAM,IAAI,EAAM,CAClB,EAAQ,EAAM,IAAI,EAAM,SACf,KAASA,EAClB,EAAQ,EAAgBA,EAAM,EAAM,SAC3B,EAAsB,EAAQ,IAAA,QAAe,OAAO,EAAa,oBAAoB,EAAM,CACtG,GAAI,OAAO,GAAU,YAAc,GAAwB,IAAU,IAAA,GACnE,OAAO,EAET,MAAU,UAAU,IAAW;IAAwD,EAAM,EAAM,GAAE,EAEvG,GAAI,EAAO,CAGT,IAAI,EAAU,KAAK,KACnB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIC,EAAK,EAAU,EAAM,CAQvB,OALEA,EAAG,UAAY,GACVA,EAAG,EAASD,EAAM,GAAe,EAAO,EAAK,CAAC,CAI9CC,EAAG,GADG,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CAC/C,OAKxB,OAAQ,EAAS,OAAjB,CACE,IAAK,GACH,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IACnC,OAAOA,GAAI,EAEf,IAAK,GACH,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IACnC,KAAI,EAAW,EAAS,GACxB,OAAOA,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAC,GAE7C,IAAK,GACH,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IACnC,KAAI,EAAW,EAAS,GACpB,EAAW,EAAS,GACxB,OAAOA,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAE,EAAS,EAAO,EAAM,EAAQ,CAAC,GAE7E,QACE,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IAEnC,OAAOA,EAAG,GADG,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CAC/C,YAsBrB,EAAe,KAAK,GAAG,EAAI,EAAY,KAAK,GAAG,MAAM,EAAI,KAAK,GAAG,MAAM,kBAAkB,CAAE,CAIpG,IAAI,EAAa,KAAK,GAAG,OAAO,SAASD,EAAM,EAAS,CACpD,EAAO,KAAK,GAAG,MAAM,mBAAmB,CACxC,EAAY,KAAK,KACrB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAI,EAAS,EAAW,EAAO,EAAM,EAAQ,CAGzC,SAAyB,GAAU,MAAQ,EAAO,KAAU,IAAA,KAGhE,KAAIC,EAAK,EAAc,EAAQ,EAAK,CACpC,GAAIA,GAAO,MAAyBA,EAAG,QAErC,OAAOA,EAAG,EAAWD,EAAM,GAAe,EAAO,EAAK,CAAC,CAGvD,IAAI,EAAS,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CACnE,OAAOC,EAAG,MAAM,EAAQ,EAAO,OAG9B,CAIL,IAAI,EAAS,KAAK,GAAG,UAAU,CAC3B,EAAS,KAAK,GAAG,SAASD,EAAM,EAAS,CACzC,EAAY,KAAK,KACrB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIC,EAAK,EAAO,EAAO,EAAM,EAAQ,CACjC,QAAwBA,IAAO,IAAA,IACnC,IAAI,OAAOA,GAAO,WAChB,MAAU,UAAU,eAAsB;IAAuE,EAAMA,EAAG,GAAE,CAE9H,GAAIA,EAAG,QAEL,OAAOA,EAAG,EAAWD,EAAM,GAAe,EAAO,EAAK,CAAC,CAGvD,IAAI,EAAS,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CACnE,OAAOC,EAAG,MAAMA,EAAI,EAAO,IAUnC,QAAQ,EAAU,CAChB,EAAS,KAAK,GAAI,KAAM,KAAK,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAUnD,IAAI,EAAU,CAGZ,IAAK,IAFD,EAAK,KAAK,QAAQ,EAAS,KAAK,GAAI,KAAM,KAAK,CAAC,CAChD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAK,GAAK,KAAK,QAAQ,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAAC,CAEzE,OAAO,IAAI,EAAa,EAAI,EAAK,CAOnC,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,GAAI,KAAK,KAAK,MAAM,EAAE,CAAC,CAoBtD,SAAS,EAAS,CAChB,IAAI,EACAH,EAAO,KAAK,GAAG,SAAS,EAAQ,CAUpC,OATI,GAAW,OAAO,EAAQ,SAAY,UAAY,EAAe,EAAQ,QAASA,EAAK,GAEzF,EAAe,EAAQ,QAAQA,GAAM,KAAM,EAAQ,EAE1C,IAAiB,OAKrB,MAAM,SAAS,EAAQ,CAJrB,EAYX,UAAU,EAAS,CACjB,IAAI,EAAO,KAAK,KAAK,IAAI,SAAU,EAAK,CACtC,OAAO,EAAI,SAAS,EAAQ,EAC5B,CAIF,OAHS,GAAyB,KAAK,GAAG,CAAG,IAAM,KAAK,GAAG,SAAS,EAAQ,CAAG,IAAM,KAAK,GAAG,SAAS,EAAQ,EAGlG,IAAM,EAAK,KAAK,KAAK,CAAG,IAOtC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,GAAI,KAAK,GACT,KAAM,KAAK,KACZ,CAgBH,QAAQ,EAAS,CACf,IAAI,EAAO,KAAK,KAAK,IAAI,SAAU,EAAK,CACtC,OAAO,EAAI,OAAO,EAAQ,EAC1B,CAGF,MAAO,+BAAiC,EAAO,KAAK,GAAG,CAAG,wEAA0E,EAAK,KAAK,wCAAwC,CAAG,iEAc3L,MAAM,EAAS,CACb,IAAI,EAUJ,OATI,GAAW,OAAO,EAAQ,SAAY,UAAY,EAAe,EAAQ,QAAS,KAAK,KAAK,GAE9F,EAAY,EAAQ,QAAQ,KAAK,MAAM,KAAM,EAAQ,EAE5C,IAAc,OAKlB,MAAM,MAAM,EAAQ,CAJlB,EAYX,OAAO,EAAS,CACd,IAAI,EAAO,KAAK,KAAK,IAAI,SAAU,EAAK,CAEtC,OAAO,EAAI,MAAM,EAAQ,EACzB,CACE,EACA,GAAe,KAAK,QACtB,EAAiB,GAAe,KAAK,OAInC,EAAK,KAAK,QAAU,OAAO,EAAK,KAAK,MAAM,OAAU,YAAc,OAAO,EAAK,KAAK,MAAM,OAAU,UAAY,OAAO,EAAK,KAAK,MAAM,OAAU,YAEnJ,EAAiB,EAAK,KAAK,MAAM,OAEnC,IAAI,EACJ,OAAQ,OAAO,EAAf,CACE,IAAK,WAEH,EAAc,EAAe,KAAM,EAAQ,CAC3C,MACF,IAAK,SAEH,EAAc,EAAe,EAAgB,KAAM,EAAQ,CAC3D,MACF,IAAK,SAGH,OAAQ,OAAO,EAAe,EAAK,QAAnC,CACE,IAAK,WACH,EAAc,EAAe,EAAK,QAAQ,KAAM,EAAQ,CACxD,MACF,IAAK,SACH,EAAc,EAAe,EAAe,EAAK,QAAS,KAAM,EAAQ,CACxE,OAMR,OAHW,IAAgB,OAGpB,EAAe,GAAiB,KAAM,EAAQ,CAF5C,EASX,eAAgB,CACd,OAAO,KAAK,KAAO,IAAM,KAAK,MAWlC,MARA,GAAgB,EAChB,EAAgB,EAAc,OAAQA,GAAK,CAC3C,EAAgB,EAAc,sBAAuB,SAAU,EAAM,CACnE,MAAU,MAAM,sBAAwBA,EAAK,EAC7C,CACF,EAAgB,EAAc,WAAY,SAAU,EAAM,CACxD,OAAO,IAAI,EAAc,EAAK,GAAI,EAAK,KAAK,EAC5C,CACK,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCveEI,GAAO,QAEA,GAA6B,EAAQA,GAD7B,CAAC,QAAS,UAAW,SAAU,eAAgB,YAAa,iBAAkB,YAAa,kBAAmB,eAAgB,yBAA0B,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAa,iBAAkB,aAAa,CACjO,GAAQ,CAC1E,GAAI,CACF,QACA,UACA,SACA,eACA,YACA,iBACA,YACA,kBACA,eACA,yBACA,eACA,YACA,aACA,eACA,kBACA,YACA,iBACA,cACE,EAyCA,EAAQ,EAAMA,GAAM,CACtB,OAAQ,SAAgB,EAAY,CAClC,OAAO,GAAW,EAAY,EAAE,CAAC,EAEnC,iBAAkB,SAAuB,EAAa,CACpD,OAAO,EAAc,EAAa,EAAE,CAAC,EAEvC,iBAAkB,SAAuB,EAAY,EAAS,CAE5D,OAAO,GAAW,EADD,EAAQ,QAAU,IAAA,GAA4B,EAAE,CAAlB,EAAQ,MACd,EAE3C,yBAA0B,EAC3B,CAAC,CACF,SAAS,EAAc,EAAa,CAClC,IAAI,EAAU,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAAE,CAChF,EAAa,EAAQ,QAAU,IAAA,GAA4B,EAAE,CAAlB,EAAQ,MAGvD,OAAO,GAAQ,EAAa,SAAU,EAAM,CAC1C,GAAI,OAAO,GAAS,SAAU,MAAU,UAAU,kBAAkB,CACpE,OAAO,GAAW,EAAM,EAAW,EACnC,CAIJ,IAAI,EAAY,CACd,KAAM,EACN,UAAW,EACX,OAAQ,EACR,OAAQ,EACR,QAAS,EACV,CAGG,GAAa,CACf,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,KAAM,GACN,KAAM,GACN,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,KAAM,GACN,KAAM,GACN,MAAO,GACR,CAGG,GAAmB,CACrB,IAAK,GACL,GAAI,GACJ,GAAI,GACJ,IAAK,GACL,IAAK,GACL,GAAI,GACJ,IAAK,GACN,CACG,GAAY,CACd,KAAM,GACN,MAAO,GACP,KAAM,KACN,UAAA,IAAA,GACD,CACG,EAAoB,CAAC,MAAO,WAAW,CACvC,EAAoB,CACtB,IAAK,IACL,IAAK,IACL,KAAM,KACN,IAAK,IACL,EAAG,KACH,EAAG,KACH,EAAG;EACH,EAAG,KACH,EAAG,IAEJ,CACD,SAAS,IAAe,CACtB,MAAO,CACL,WAAY,EAAE,CAEd,WAAY,GAEZ,QAAS,GAET,MAAO,EAEP,MAAO,GAEP,UAAW,EAAU,KAErB,aAAc,EAEd,iBAAkB,KACnB,CAWH,SAAS,EAAc,EAAO,EAAQ,CACpC,OAAO,EAAM,WAAW,OAAO,EAAM,MAAO,EAAO,CAUrD,SAAS,EAAiB,EAAO,CAC/B,OAAO,EAAc,EAAO,EAAE,CAShC,SAAS,EAAK,EAAO,CACnB,EAAM,QAQR,SAAS,EAAc,EAAO,CAC5B,OAAO,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAQjD,SAAS,EAAc,EAAO,CAC5B,OAAO,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAQjD,SAAS,EAAS,EAAO,CAMvB,IALA,EAAM,UAAY,EAAU,KAC5B,EAAM,MAAQ,GACd,EAAM,QAAU,KAGH,CAEX,GAAI,EAAiB,EAAM,GAAK,IAC9B,KAAO,EAAiB,EAAM,GAAK;GAAQ,EAAiB,EAAM,GAAK,IACrE,EAAM,SAAW,EAAiB,EAAM,CACxC,EAAK,EAAM,CAIf,GAAI,EAAM,aAAa,EAAiB,EAAM,CAAE,EAAM,aAAa,CACjE,EAAK,EAAM,MAEX,MAKJ,GAAI,EAAiB,EAAM,GAAK,GAAI,CAElC,EAAM,UAAY,EAAU,UAC5B,OAIF,GAAI,EAAiB,EAAM,GAAK;GAAQ,CAAC,EAAM,aAAc,CAC3D,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EAAiB,EAAM,CACrC,EAAK,EAAM,CACX,OAEF,IAAI,EAAK,EAAiB,EAAM,CAC5B,EAAK,EAAc,EAAO,EAAE,CAC5B,EAAK,EAAc,EAAO,EAAE,CAChC,GAAI,EAAG,SAAW,GAAK,GAAW,GAAK,CACrC,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EACd,EAAK,EAAM,CACX,EAAK,EAAM,CACX,EAAK,EAAM,CACX,OAMF,GAAI,EAAG,SAAW,GAAK,GAAW,KAAQ,IAAO,MAAQ,CAAC,EAAM,QAAQ,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAAC,EAAG,CAClH,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EACd,EAAK,EAAM,CACX,EAAK,EAAM,CACX,OAIF,GAAI,GAAW,GAAK,CAClB,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EACd,EAAK,EAAM,CACX,OAIF,GAAI,EAAM,WAAW,EAAG,CAAE,CACxB,EAAM,UAAY,EAAU,OAG5B,IAAI,EAAK,EAAc,EAAO,EAAE,CAChC,GAAI,IAAO,MAAQ,IAAO,MAAQ,IAAO,KAAM,CAK7C,IAJA,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CACX,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CACJ,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,EAAI,EAAM,QAAQ,EAAiB,EAAM,CAAC,EACjI,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAEb,GAAI,EAAiB,EAAM,GAAK,IAK9B,IAHA,EAAM,OAAS,IACf,EAAK,EAAM,CAEJ,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,EAAI,EAAM,QAAQ,EAAiB,EAAM,CAAC,EACjI,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,SAEJ,EAAiB,EAAM,GAAK,IAKrC,IAHA,EAAM,OAAS,IACf,EAAK,EAAM,CAEJ,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAGf,OAIF,GAAI,EAAiB,EAAM,GAAK,IAG9B,IAFA,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CACP,CAAC,EAAM,QAAQ,EAAiB,EAAM,CAAC,CAAE,CAE3C,EAAM,UAAY,EAAU,UAC5B,YAEG,CACL,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAET,EAAM,cAAc,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAC,GACpE,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,EAGf,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAGb,GAAI,EAAiB,EAAM,GAAK,KAAO,EAAiB,EAAM,GAAK,QAC7D,EAAM,QAAQ,EAAc,EAAM,CAAC,EAAI,EAAc,EAAM,GAAK,KAAO,EAAc,EAAM,GAAK,IAAK,CAQvG,GAPA,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,EACP,EAAiB,EAAM,GAAK,KAAO,EAAiB,EAAM,GAAK,OACjE,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,EAGT,CAAC,EAAM,QAAQ,EAAiB,EAAM,CAAC,CACzC,MAAM,EAAkB,EAAO,wBAA0B,EAAiB,EAAM,CAAG,IAAI,CAEzF,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAEb,GAAI,EAAM,cAAc,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAC,CACpE,MAAM,EAAkB,EAAO,wBAA0B,EAAiB,EAAM,CAAG,IAAI,SAEhF,EAAM,cAAc,EAAc,EAAM,CAAE,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAAC,CAE5F,MADA,EAAK,EAAM,CACL,EAAkB,EAAO,wBAA0B,EAAiB,EAAM,CAAG,IAAI,CAG3F,OAIF,GAAI,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,CAAE,CACtF,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,EAAI,EAAM,QAAQ,EAAiB,EAAM,CAAC,EACjI,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAET,EAAe,GAAkB,EAAM,MAAM,CAC/C,EAAM,UAAY,EAAU,UAE5B,EAAM,UAAY,EAAU,OAE9B,OAKF,IADA,EAAM,UAAY,EAAU,QACrB,EAAiB,EAAM,GAAK,IACjC,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAEb,MAAM,EAAkB,EAAO,yBAA2B,EAAM,MAAQ,IAAI,CAM9E,SAAS,EAAoB,EAAO,CAClC,GACE,EAAS,EAAM,OACR,EAAM,QAAU;GAO3B,SAAS,GAAW,EAAO,CACzB,EAAM,eAOR,SAAS,EAAY,EAAO,CAC1B,EAAM,eAqBR,EAAM,QAAU,SAAiB,EAAG,EAAO,EAAO,CAChD,OAAO,EAAM,oBAAoB,EAAE,EAAI,EAAM,kBAAkB,EAAG,EAAM,EAAI,EAAM,kBAAkB,EAAO,EAAE,EAQ/G,EAAM,oBAAsB,SAA6B,EAAG,CAC1D,MAAO,sDAAsD,KAAK,EAAE,EAkBtE,EAAM,kBAAoB,SAA2B,EAAM,EAAK,CAC9D,MAAO,aAAa,KAAK,EAAK,EAAI,oBAAoB,KAAK,EAAI,EAAI,2KAA2K,KAAK,EAAI,EASzP,EAAM,aAAe,SAAsB,EAAG,EAAc,CAE1D,OAAO,IAAM,KAAO,IAAM,KAAQ,IAAM,QAAY,IAAM;GAAQ,EAAe,GAUnF,EAAM,cAAgB,SAAuB,EAAG,EAAO,CACrD,OAAO,IAAM,KAAO,IAAU,KAAO,IAAU,KAAO,IAAU,KAQlE,EAAM,WAAa,SAAoB,EAAG,CACxC,OAAO,GAAK,KAAO,GAAK,KAAO,IAAM,KAQvC,EAAM,QAAU,SAAiB,EAAG,CAClC,OAAO,GAAK,KAAO,GAAK,KAQ1B,SAAS,GAAW,EAAY,EAAY,CAC1C,IAAI,EAAQ,IAAc,CAC1B,EAAS,EAAO,CACd,aACA,aACD,CAAC,CACF,EAAS,EAAM,CACf,IAAI,EAAO,GAAW,EAAM,CAI5B,GAAI,EAAM,QAAU,GAOhB,MANE,EAAM,YAAc,EAAU,UAI1B,GAAY,EAAO,uBAAyB,EAAM,MAAM,CAExD,EAAkB,EAAO,oBAAsB,EAAM,MAAQ,IAAI,CAG3E,OAAO,EAUT,SAAS,GAAW,EAAO,CACzB,IAAI,EACA,EAAS,EAAE,CACX,EASJ,IARI,EAAM,QAAU,IAAM,EAAM,QAAU;GAAQ,EAAM,QAAU,MAChE,EAAO,EAAgB,EAAM,CACzB,EAAM,UACR,EAAK,QAAU,EAAM,UAKlB,EAAM,QAAU;GAAQ,EAAM,QAAU,KAEzC,EAAO,SAAW,GAAK,IACzB,EAAU,EAAM,QAAU,IAC1B,EAAO,KAAK,CACV,OACA,UACD,CAAC,EAEJ,EAAS,EAAM,CACX,EAAM,QAAU;GAAQ,EAAM,QAAU,KAAO,EAAM,QAAU,KACjE,EAAO,EAAgB,EAAM,CACzB,EAAM,UACR,EAAK,QAAU,EAAM,SAEvB,EAAU,EAAM,QAAU,IAC1B,EAAO,KAAK,CACV,OACA,UACD,CAAC,EAYJ,OATE,EAAO,OAAS,EACX,IAAI,EAAU,EAAO,EAEvB,IACH,EAAO,IAAI,EAAa,IAAA,GAAU,CAC9B,EAAM,UACR,EAAK,QAAU,EAAM,UAGlB,GAYX,SAAS,EAAgB,EAAO,CAC9B,IAAIA,EAAM,EAAM,EAAO,EACnB,EAAO,GAAiB,EAAM,CAClC,GAAI,EAAM,QAAU,IAAK,CACvB,GAAI,EAAa,EAAK,CAKpB,MAHA,GAAO,EAAK,KACZ,EAAoB,EAAM,CAC1B,EAAQ,EAAgB,EAAM,CACvB,IAAI,EAAe,IAAI,EAAWA,EAAK,CAAE,EAAM,IAC7C,EAAe,EAAK,CAAE,CAE/B,GAAI,EAAK,iBACP,MAAM,EAAkB,EAAO,kCAAkC,CAInE,OAFA,EAAoB,EAAM,CAC1B,EAAQ,EAAgB,EAAM,CACvB,IAAI,EAAe,EAAK,OAAQ,EAAK,MAAO,EAAM,SAChD,GAAe,EAAK,EAAI,EAAa,EAAK,GAAG,GAEtD,EAAQ,GACR,EAAO,EAAE,CACT,EAAO,EAAK,KACZ,EAAK,KAAK,QAAQ,SAAU,EAAK,EAAO,CAClC,EAAa,EAAI,CACnB,EAAK,GAAS,EAAI,KAElB,EAAQ,IAEV,CACE,GAGF,OAFA,EAAoB,EAAM,CAC1B,EAAQ,EAAgB,EAAM,CACvB,IAAI,EAAuBA,EAAM,EAAM,EAAM,CAGxD,MAAM,EAAkB,EAAO,kDAAkD,CAEnF,OAAO,EAaT,SAAS,GAAiB,EAAO,CAE/B,IADA,IAAI,EAAO,GAAe,EAAM,CACzB,EAAM,QAAU,KAAK,CAI1B,IAAI,EAAO,EAAM,iBACjB,EAAM,iBAAmB,EAAM,aAC/B,EAAoB,EAAM,CAC1B,IAAI,EAAY,EACZ,EAAW,EAAgB,EAAM,CACrC,GAAI,EAAM,QAAU,IAAK,MAAM,EAAkB,EAAO,gDAAgD,CACxG,EAAM,iBAAmB,KACzB,EAAoB,EAAM,CAG1B,EAAO,IAAI,EAAgB,EAAW,EAFtB,EAAgB,EAAM,CAEoB,CAG1D,EAAM,iBAAmB,EAE3B,OAAO,EAQT,SAAS,GAAe,EAAO,CAE7B,IADA,IAAI,EAAO,GAAgB,EAAM,CAC1B,EAAM,QAAU,MAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,KAAM,KAAM,CAAC,EAAM,GAAgB,EAAM,CAAC,CAAC,CAErE,OAAO,EAQT,SAAS,GAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,GAAgB,EAAM,CAC1B,EAAM,QAAU,OAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,MAAO,MAAO,CAAC,EAAM,GAAgB,EAAM,CAAC,CAAC,CAEvE,OAAO,EAQT,SAAS,GAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,GAAe,EAAM,CACzB,EAAM,QAAU,OAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,MAAO,MAAO,CAAC,EAAM,GAAe,EAAM,CAAC,CAAC,CAEtE,OAAO,EAQT,SAAS,GAAe,EAAO,CAE7B,IADA,IAAI,EAAO,EAAgB,EAAM,CAC1B,EAAM,QAAU,KAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,IAAK,QAAS,CAAC,EAAM,EAAgB,EAAM,CAAC,CAAC,CAEvE,OAAO,EAQT,SAAS,EAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,EAAgB,EAAM,CAC1B,EAAM,QAAU,MAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,KAAM,SAAU,CAAC,EAAM,EAAgB,EAAM,CAAC,CAAC,CAEzE,OAAO,EAQT,SAAS,EAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,GAAgB,EAAM,CAC1B,EAAM,QAAU,KAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,IAAK,SAAU,CAAC,EAAM,GAAgB,EAAM,CAAC,CAAC,CAExE,OAAO,EAOT,SAAS,GAAgB,EAAO,CAW9B,IAVA,IAAI,EAAS,CAAC,GAAW,EAAM,CAAC,CAC5B,EAAe,EAAE,CACjB,EAAY,CACd,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,WACP,CACM,EAAe,EAAW,EAAM,MAAM,EAAE,CAE7C,IAAI,EAAO,CACT,KAAM,EAAM,MACZ,GAAI,EAAU,EAAM,OACrB,CACD,EAAa,KAAK,EAAK,CACvB,EAAoB,EAAM,CAC1B,EAAO,KAAK,GAAW,EAAM,CAAC,CAO9B,OALE,EAAO,SAAW,EACb,EAAO,GACL,EAAO,SAAW,EACpB,IAAI,EAAa,EAAa,GAAG,KAAM,EAAa,GAAG,GAAI,EAAO,CAElE,IAAI,EAAe,EAAa,IAAI,GAAK,EAAE,GAAG,CAAE,EAAO,CASlE,SAAS,GAAW,EAAO,CAQzB,IAPA,IAAI,EACG,EAAgB,EAAM,CADnBA,EAAM,EAAI,EAEhB,EAAY,CACd,KAAM,YACN,KAAM,kBACN,MAAO,gBACR,CACM,EAAe,EAAW,EAAM,MAAM,EAC3C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CAC1B,EAAS,CAAC,EAAM,EAAgB,EAAM,CAAC,CACvC,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,CAE3C,OAAO,EAQT,SAAS,EAAgB,EAAO,CAO9B,IANA,IAAI,EACG,GAAW,EAAM,CADdA,EAAM,EAAI,EAEhB,EAAY,CACd,GAAI,KACJ,GAAI,KACL,CACM,EAAe,EAAW,EAAM,MAAM,EAC3C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CACtBA,IAAS,MAAQ,QAAQ,SAAS,EAAM,MAAM,CAEhD,EAAO,IAAI,EAAa,IAAK,WAAY,CAAC,EAAM,IAAI,EAAW,KAAK,CAAC,CAAE,GAAK,EAG5E,EAAS,CAAC,EAAM,GAAW,EAAM,CAAC,CAClC,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,EAG7C,OAAO,EAQT,SAAS,GAAW,EAAO,CACzB,IAAI,EACA,EAAS,EAAE,CAQf,GAPA,AAKE,EALE,EAAM,QAAU,IAEX,IAAI,EAAa,EAAE,CAGnB,GAAiB,EAAM,CAE5B,EAAM,QAAU,KAAO,EAAM,mBAAqB,EAAM,aAAc,CAKxE,IAHA,EAAO,KAAK,EAAK,CAGV,EAAM,QAAU,KAAO,EAAO,OAAS,GAE5C,EAAoB,EAAM,CACtB,EAAM,QAAU,KAAO,EAAM,QAAU,KAAO,EAAM,QAAU,KAAO,EAAM,QAAU,GAEvF,EAAO,KAAK,IAAI,EAAW,MAAM,CAAC,CAGlC,EAAO,KAAK,GAAiB,EAAM,CAAC,CAGxC,AAME,EANE,EAAO,SAAW,EAEb,IAAI,EAAU,EAAO,GAAI,EAAO,GAAI,EAAO,GAAG,CAI9C,IAAI,EAAU,EAAO,GAAI,EAAO,GAAG,CAG9C,OAAO,EAQT,SAAS,GAAiB,EAAO,CAO/B,IANA,IAAI,EACG,GAA2B,EAAM,CAD9BA,EAAM,EAAI,EAEhB,EAAY,CACd,IAAK,MACL,IAAK,WACN,CACM,EAAe,EAAW,EAAM,MAAM,EAAE,CAC7C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CAC1B,IAAI,EAAY,GAA2B,EAAM,CACjD,AAGE,EAHE,EAAU,aACH,CAAC,EAAM,IAAI,EAAa,IAAK,WAAY,CAAC,EAAM,EAAU,CAAC,CAAC,CAE5D,CAAC,EAAM,EAAU,CAE5B,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,CAE3C,OAAO,EAQT,SAAS,GAA2B,EAAO,CAYzC,IAXA,IAAI,EACG,GAA4B,EAAM,CAD/B,EAEH,EAFSA,EAAM,EAGlB,EAAY,CACd,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,YACN,IAAK,MACL,IAAK,MACN,CAEK,EAAe,EAAW,EAAM,MAAM,EAExC,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CAC1B,EAAO,GAA4B,EAAM,CACzC,EAAO,IAAI,EAAaA,EAAM,EAAI,CAAC,EAAM,EAAK,CAAC,CAKnD,OAAO,EAQT,SAAS,GAA4B,EAAO,CAI1C,IAHA,IAAI,EACG,GAAW,EAAM,CADd,EAEH,EAED,EAAM,YAAc,EAAU,QAAU,EAAM,QAAU,MAAQ,EAAe,EAAK,EAAI,EAAM,QAAU,MAAQ,GAAe,EAAK,EAAI,EAAK,KAAO,cAAgB,EAAe,EAAK,KAAK,GAAG,EAAI,EAAM,YAAc,EAAU,QAAU,CAAC,EAAe,EAAK,GAAK,CAAC,GAAe,EAAK,EAAI,EAAK,KAAO,MAAQ,EAAM,QAAU,KAMrU,EAAO,GAAW,EAAM,CACxB,EAAO,IAAI,EAAa,IAAK,WAAY,CAAC,EAAM,EAAK,CAAE,GAAoB,CAK/E,OAAO,EAYT,SAAS,GAAW,EAAO,CAIzB,IAHA,IAAI,EAAO,GAAqB,EAAM,CAClC,EAAO,EACP,EAAc,EAAE,CAGd,EAAM,QAAU,KAAO,GAAU,EAAK,EAMxC,GAJA,EAAY,KAAK,EAAS,EAAE,CAAE,EAAM,CAAC,CACrC,EAAoB,EAAM,CAGtB,EAAM,YAAc,EAAU,OAMhC,GAJA,EAAY,KAAK,EAAS,EAAE,CAAE,EAAM,CAAC,CACrC,EAAoB,EAAM,CAGtB,EAAM,YAAc,EAAU,QAAU,EAAM,QAAU,KAAO,EAAM,QAAU,KAGjF,EAAS,EAAO,EAAY,KAAK,CAAC,CAClC,EAAY,KAAK,CACjB,EAAO,GAAqB,EAAM,CAClC,EAAO,IAAI,EAAa,IAAK,SAAU,CAAC,EAAM,EAAK,CAAC,KAC/C,CAEL,EAAY,KAAK,CACjB,EAAS,EAAO,EAAY,KAAK,CAAC,CAClC,UAEG,CAEL,EAAS,EAAO,EAAY,KAAK,CAAC,CAClC,MAMN,OAAO,EAQT,SAAS,GAAqB,EAAO,CACnC,IAAI,EAAO,EAAW,EAAM,CAC5B,GAAI,EAAM,QAAU,IAAK,CACvB,IAAI,EAAgB,EAAS,EAAE,CAAE,EAAM,CACvC,EAAoB,EAAM,CAM1B,GAAI,CACF,EAAW,EAAM,CAGjB,EAAS,EAAO,EAAc,MACd,CAEhB,EAAO,IAAI,EAAa,IAAK,SAAU,CAAC,EAAM,IAAI,EAAa,IAAI,CAAC,CAAE,GAAO,GAAK,EAGtF,OAAO,EAQT,SAAS,EAAW,EAAO,CACzB,IAAIA,EAAM,EAAQ,EACd,EAAY,CACd,IAAK,aACL,IAAK,YACL,IAAK,SACL,IAAK,MACN,CAQD,OAPI,EAAe,EAAW,EAAM,MAAM,EACxC,EAAK,EAAU,EAAM,OACrB,EAAO,EAAM,MACb,EAAoB,EAAM,CAC1B,EAAS,CAAC,EAAW,EAAM,CAAC,CACrB,IAAI,EAAaA,EAAM,EAAI,EAAO,EAEpC,EAAS,EAAM,CASxB,SAAS,EAAS,EAAO,CACvB,IAAI,EACG,GAAuB,EAAM,CAD1BA,EAAM,EAAI,EASpB,OAPI,EAAM,QAAU,KAAO,EAAM,QAAU,QACzC,EAAO,EAAM,MACb,EAAKA,IAAS,IAAM,MAAQ,SAC5B,EAAoB,EAAM,CAC1B,EAAS,CAAC,EAAM,EAAW,EAAM,CAAC,CAClC,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,EAEpC,EAQT,SAAS,GAAuB,EAAO,CAErC,IADA,IAAI,EAAO,GAAuB,EAAM,CACjC,EAAM,QAAU,MAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,KAAM,UAAW,CAAC,EAAM,GAAuB,EAAM,CAAC,CAAC,CAEjF,OAAO,EAQT,SAAS,GAAuB,EAAO,CAOrC,IANA,IAAI,EACG,GAAiB,EAAM,CADpBA,EAAM,EAAI,EAEhB,EAAY,CACd,IAAK,YACL,IAAM,aACP,CACM,EAAe,EAAW,EAAM,MAAM,EAC3C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAS,EAAM,CACf,EAAS,CAAC,EAAK,CACf,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,CACzC,EAAO,GAAe,EAAO,EAAK,CAEpC,OAAO,EA+BT,SAAS,GAAiB,EAAO,CAC/B,IAAI,EAAS,EAAE,CACf,GAAI,EAAM,YAAc,EAAU,QAAU,EAAe,EAAM,WAAY,EAAM,MAAM,CAAE,CACzF,IAAI,EAAa,EAAM,WAAW,EAAM,OAIxC,GAHA,EAAS,EAAM,CAGX,EAAM,QAAU,IAAK,CAIvB,GAHA,EAAS,EAAE,CACX,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAIlB,IAHA,EAAO,KAAK,EAAgB,EAAM,CAAC,CAG5B,EAAM,QAAU,KAErB,EAAS,EAAM,CACf,EAAO,KAAK,EAAgB,EAAM,CAAC,CAGvC,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAE1D,EAAY,EAAM,CAClB,EAAS,EAAM,CAKjB,OAAO,IAAI,EAAW,EAAO,CAE/B,OAAO,GAAY,EAAM,CAQ3B,SAAS,GAAY,EAAO,CAC1B,IAAI,EAAMA,EAkBV,OAjBI,EAAM,YAAc,EAAU,QAAU,EAAM,YAAc,EAAU,WAAa,EAAM,SAAS,IACpG,EAAO,EAAM,MACb,EAAS,EAAM,CACf,AAOE,EAPE,EAAe,GAAWA,EAAK,CAE1B,IAAI,EAAa,GAAUA,GAAM,CAC/B,EAAkB,SAASA,EAAK,CAElC,IAAI,EAAa,EAAQA,EAAM,SAAS,CAAC,CAEzC,IAAI,EAAWA,EAAK,CAI7B,EAAO,GAAe,EAAO,EAAK,CAC3B,GAEF,GAAY,EAAM,CAiB3B,SAAS,GAAe,EAAO,EAAM,EAAO,CAI1C,IAHA,IAAI,IAGS,CAGX,IAAI,EAAW,GAGX,EAAM,QAAU,OAClB,EAAW,GAEX,EAAS,EAAM,EAEjB,IAAI,GAAmB,EAAM,QAAU,KAAO,EAAM,QAAU,KAAO,EAAM,QAAU,OAAS,CAAC,GAAS,EAAM,SAAS,EAAM,MAAM,EACnI,GAAI,EAAE,GAAY,GAChB,MAGF,GADA,EAAS,EAAE,CACP,EAAM,QAAU,IAClB,GAAI,GAAY,EAAa,EAAK,EAAI,EAAe,EAAK,CAAE,CAI1D,GAFA,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAIlB,IAHA,EAAO,KAAK,EAAgB,EAAM,CAAC,CAG5B,EAAM,QAAU,KAErB,EAAS,EAAM,CACf,EAAO,KAAK,EAAgB,EAAM,CAAC,CAGvC,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAE1D,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAO,IAAI,EAAa,EAAM,EAAQ,EAAS,MAK/C,OAAO,UAEA,EAAM,QAAU,IAAK,CAI9B,GAFA,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAIlB,IAHA,EAAO,KAAK,EAAgB,EAAM,CAAC,CAG5B,EAAM,QAAU,KAErB,EAAS,EAAM,CACf,EAAO,KAAK,EAAgB,EAAM,CAAC,CAGvC,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAE1D,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAO,IAAI,EAAa,EAAM,IAAI,EAAU,EAAO,CAAE,EAAS,KACzD,CAKL,GAFK,GAAU,EAAS,EAAM,CAE1B,EADiB,EAAM,YAAc,EAAU,QAAU,EAAM,YAAc,EAAU,WAAa,EAAM,SAAS,IAClG,CACnB,IAAI,EAAU,gCAEd,KADA,IAAW,EAAW,iBAAmB,MACnC,EAAkB,EAAO,EAAQ,CAEzC,EAAO,KAAK,IAAI,EAAa,EAAM,MAAM,CAAC,CAC1C,EAAS,EAAM,CAEf,EAAO,IAAI,EAAa,EAAM,IAAI,EAAU,EAD1B,GAC8C,CAAE,EAAS,EAG/E,OAAO,EAQT,SAAS,GAAY,EAAO,CAC1B,IAAI,EAAM,EAWV,OAVI,EAAM,QAAU,KAAO,EAAM,QAAU,KACzC,EAAM,GAAiB,EAAO,EAAM,MAAM,CAG1C,EAAO,IAAI,EAAa,EAAI,CAG5B,EAAO,GAAe,EAAO,EAAK,CAC3B,GAEF,GAAY,EAAM,CAS3B,SAAS,GAAiB,EAAO,EAAO,CAEtC,IADA,IAAI,EAAM,GACH,EAAiB,EAAM,GAAK,IAAM,EAAiB,EAAM,GAAK,GACnE,GAAI,EAAiB,EAAM,GAAK,KAAM,CACpC,EAAK,EAAM,CACX,IAAI,EAAO,EAAiB,EAAM,CAC9B,EAAa,EAAkB,GACnC,GAAI,IAAe,IAAA,GAEjB,GAAO,EACP,EAAM,OAAS,UACN,IAAS,IAAK,CAEvB,IAAI,EAAU,EAAM,WAAW,MAAM,EAAM,MAAQ,EAAG,EAAM,MAAQ,EAAE,CACtE,GAAI,mBAAmB,KAAK,EAAQ,CAElC,GAAO,OAAO,aAAa,SAAS,EAAS,GAAG,CAAC,CACjD,EAAM,OAAS,OAEf,MAAM,EAAkB,EAAO,gCAAuC,IAAS,MAGjF,MAAM,EAAkB,EAAO,0BAAiC,IAAM,MAIxE,GAAO,EAAiB,EAAM,CAC9B,EAAK,EAAM,CAIf,GADA,EAAS,EAAM,CACX,EAAM,QAAU,EAClB,MAAM,EAAkB,EAAO,iBAAwB,aAAoB,CAG7E,OADA,EAAS,EAAM,CACR,EAQT,SAAS,GAAY,EAAO,CAC1B,IAAI,EAAO,EAAQ,EAAM,EACzB,GAAI,EAAM,QAAU,IAAK,CAIvB,GAFA,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAAK,CAEvB,IAAI,EAAM,GAAS,EAAM,CACzB,GAAI,EAAM,QAAU,IAAK,CAMvB,IAJA,EAAO,EACP,EAAS,CAAC,EAAI,CAGP,EAAM,QAAU,KAErB,EAAS,EAAM,CACX,EAAM,QAAU,MAClB,EAAO,GAAQ,GAAS,EAAM,CAC9B,KAGJ,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,2BAA2B,CAE5D,EAAY,EAAM,CAClB,EAAS,EAAM,CAGf,EAAO,EAAO,GAAG,MAAM,OACvB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IACxB,GAAI,EAAO,GAAG,MAAM,SAAW,EAC7B,MAAM,GAAY,EAAO,+BAAsC,EAAO,GAAG,MAAM,OAAS,QAAU,EAAO,IAAI,CAGjH,EAAQ,IAAI,EAAU,EAAO,KACxB,CAEL,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,2BAA2B,CAE5D,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAQ,QAIV,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAQ,IAAI,EAAU,EAAE,CAAC,CAE3B,OAAO,GAAe,EAAO,EAAM,CAErC,OAAO,GAAY,EAAM,CAO3B,SAAS,GAAS,EAAO,CAGvB,IAFA,IAAI,EAAS,CAAC,EAAgB,EAAM,CAAC,CACjC,EAAM,EACH,EAAM,QAAU,KAErB,EAAS,EAAM,CAGX,EAAM,QAAU,KAAO,EAAM,QAAU,MACzC,EAAO,GAAO,EAAgB,EAAM,CACpC,KAGJ,OAAO,IAAI,EAAU,EAAO,CAQ9B,SAAS,GAAY,EAAO,CAC1B,GAAI,EAAM,QAAU,IAAK,CACvB,GAAW,EAAM,CACjB,IAAI,EACAE,EAAa,EAAE,CACnB,EAEE,IADA,EAAS,EAAM,CACX,EAAM,QAAU,IAAK,CAEvB,GAAI,EAAM,QAAU,KAAO,EAAM,QAAU,IACzC,EAAM,GAAiB,EAAO,EAAM,MAAM,SACjC,EAAM,YAAc,EAAU,QAAU,EAAM,YAAc,EAAU,WAAa,EAAM,SAAS,GAC3G,EAAM,EAAM,MACZ,EAAS,EAAM,MAEf,MAAM,EAAkB,EAAO,0CAA0C,CAI3E,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,oCAAoC,CAErE,EAAS,EAAM,CAGf,EAAW,GAAO,EAAgB,EAAM,OAEnC,EAAM,QAAU,KAEzB,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,mDAAmD,CAEpF,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,IAAI,EAAO,IAAI,EAAWA,EAAW,CAIrC,MADA,GAAO,GAAe,EAAO,EAAK,CAC3B,EAET,OAAO,GAAY,EAAM,CAQ3B,SAAS,GAAY,EAAO,CAC1B,IAAI,EACJ,GAAI,EAAM,YAAc,EAAU,OAAQ,CAExC,EAAY,EAAM,MAClB,EAAS,EAAM,CACf,IAAI,EAAc,GAAe,EAAW,EAAO,CAEnD,OAAO,IAAI,EADC,EAAQ,EAAW,EAAY,CACb,CAEhC,OAAO,GAAiB,EAAM,CAQhC,SAAS,GAAiB,EAAO,CAC/B,IAAI,EAGJ,GAAI,EAAM,QAAU,IAAK,CAMvB,GAJA,GAAW,EAAM,CACjB,EAAS,EAAM,CACf,EAAO,EAAgB,EAAM,CAEzB,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAM1D,OAJA,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAO,IAAI,EAAgB,EAAK,CAChC,EAAO,GAAe,EAAO,EAAK,CAC3B,EAET,OAAO,GAAS,EAAM,CAQxB,SAAS,GAAS,EAAO,CAKrB,MAJE,EAAM,QAAU,GAEZ,EAAkB,EAAO,+BAA+B,CAExD,EAAkB,EAAO,iBAAiB,CAoBpD,SAAS,GAAI,EAAO,CAClB,OAAO,EAAM,MAAQ,EAAM,MAAM,OAAS,EAU5C,SAAS,EAAkB,EAAO,EAAS,CACzC,IAAI,EAAI,GAAI,EAAM,CACd,EAAY,YAAY,EAAU,UAAY,EAAI,IAAI,CAE1D,MADA,GAAM,KAAO,EACN,EAUT,SAAS,GAAY,EAAO,EAAS,CACnC,IAAI,EAAI,GAAI,EAAM,CACd,EAAY,YAAY,EAAU,UAAY,EAAI,IAAI,CAE1D,MADA,GAAM,KAAO,EACN,EAST,OALA,EAAM,cAAc,CAClB,KAAM,SACN,GAAI,OACJ,QAAS,EACV,CAAC,CACK,GACP,CCjoDEC,GAAO,WAEA,GAAgC,EAAQA,GADhC,CAAC,QAAS,QAAQ,CACkC,GAAQ,CAC7E,GAAI,CACF,QACA,SACE,EAsCJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,SAAgB,EAAM,CAC5B,IAAI,EAAQ,IAAgB,CAC5B,OAAO,EAAM,EAAK,CAAC,SAAS,CAAC,SAAS,EAAM,EAE9C,uBAAwB,SAA4B,EAAM,EAAO,CAC/D,OAAO,EAAM,EAAK,CAAC,SAAS,CAAC,SAAS,EAAM,EAE9C,iBAAkB,SAAuB,EAAM,CAC7C,IAAI,EAAQ,IAAgB,CAC5B,OAAO,GAAQ,EAAM,SAAU,EAAO,CACpC,OAAO,EAAM,EAAM,CAAC,SAAS,CAAC,SAAS,EAAM,EAC7C,EAEJ,+BAAgC,SAAmC,EAAM,EAAO,CAC9E,OAAO,GAAQ,EAAM,SAAU,EAAO,CACpC,OAAO,EAAM,EAAM,CAAC,SAAS,CAAC,SAAS,EAAM,EAC7C,EAEL,CAAC,EACF,CCjEEE,GAAO,OAEA,GAA4B,EAAQA,GAD5B,CAAC,QAAQ,CACuC,GAAQ,CACzE,GAAI,CACF,SACE,EA2BJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,GAAK,EAAE,MAAM,CACrB,MAAO,GACP,OAAQ,GAAK,CAAC,EAAE,OAAO,CAEvB,uDAAwD,GAAM,EAAE,CACjE,CAAC,EACF,CCvCEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,QAAS,QAAQ,CACmC,GAAQ,CAC9E,GAAI,CACF,QACA,SACE,EAuBJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,SAAgB,EAAG,CACzB,GAAI,EAAI,EACN,MAAU,MAAM,6BAA6B,CAE/C,OAAO,EAAM,EAAI,EAAE,EAErB,UAAW,SAAmB,EAAG,CAC/B,GAAI,EAAE,YAAY,CAChB,MAAU,MAAM,6BAA6B,CAE/C,OAAO,EAAM,EAAE,KAAK,EAAE,CAAC,EAEzB,iBAAkB,EAAM,YAAY,GAAQ,GAAK,GAAQ,EAAGE,EAAK,CAAC,CACnE,CAAC,EACF,CC7CEC,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,QAAQ,CAC4C,GAAQ,CAC9E,GAAI,CACF,SACE,EA8BJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,GAAK,OAAO,SAAS,EAAE,CAC/B,sBAAuB,GAAK,EAAE,UAAU,CACxC,wBAA2B,GAC3B,uBAA0B,GAC1B,KAAM,EAAM,YAAY,GAAQ,GAAKE,EAAK,EAAE,MAAM,CAAC,CACnD,iBAAkB,EAAM,YAAY,GAAQ,IACrC,MAAM,QAAQ,EAAE,GAAE,EAAI,EAAE,SAAS,EAC/B,EAAE,MAAM,GAASA,EAAK,EAAM,CAAC,EACpC,CACH,CAAC,EACF,CC1CS,GAA+B,EAF/B,UACQ,CAAC,SAAU,aAAc,YAAY,CACc,GAAQ,CAC5E,GAAI,CACF,OAAQ,EACR,YACA,YACE,EACA,EAAkB,CACpB,OAAQ,GACR,OAAQ,GACR,UAAW,GACX,SAAU,GACX,CAGG,EAAmB,CACrB,OAAQ,GAAK,EAAQ,EAAE,CACvB,UAAW,EAAY,GAAK,EAAU,EAAE,CAAG,GAC3C,OAAQ,GAAK,OAAO,EAAE,CACtB,SAAU,EAAW,GAAK,EAAS,EAAE,CAAG,GACzC,CAgCD,OAAO,SAAiB,EAAO,CAC7B,IAAI,EAAa,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,SAErF,IADY,UAAU,OAAS,EAAI,UAAU,GAAK,IAAA,MACpC,IAAA,GACZ,MAAU,YAAY,uCAAuC,CAE/D,IAAI,EAAY,GAAO,EAAM,CAC7B,GAAI,EAAE,KAAa,GACjB,MAAU,UAAU,kBAAoB,EAAQ,aAAe,EAAY,4BAA8B,OAAO,KAAK,EAAgB,CAAC,KAAK,KAAK,CAAC,CAEnJ,GAAI,EAAE,KAAc,GAClB,MAAU,UAAU,kBAAoB,EAAQ,aAAe,EAAa,6BAA+B,OAAO,KAAK,EAAiB,CAAC,KAAK,KAAK,CAAC,CAKpJ,OAHE,IAAe,EACV,EAEA,EAAiB,GAAY,EAAM,GAG9C,CC9CS,GAA2B,EAAoB,MAAO,GAAU,CAMhE,GAA2B,EAAoB,MAAO,GAAU,CAIhE,GAA2B,EAAoB,MAAO,GAAU,CAChE,GAA2B,EAAoB,MAAO,GAAU,CAChE,GAA6B,EAAoB,QAAS,GAAY,CACtE,GAA4B,EAAoB,OAAQ,GAAW,CACnE,GAA2B,EAAoB,MAAO,GAAU,CAEhE,GAAgC,EAAoB,WAAY,GAAe,CAC/E,GACX,GAAqC,UAAW,GAAc,CACnD,GAA4B,EAAoB,OAAQ,GAAW,CACnE,GAA4B,EAAoB,OAAQ,GAAW,CAEnE,GAAgC,EAAoB,WAAY,GAAe,CAG/E,GAA2B,EAAoB,MAAO,GAAU,CAChE,GACX,GAAqC,QAAS,GAAY,CAC/C,GACX,GAAqC,MAAO,GAAU,CAC3C,GAA6B,EAAoB,QAAS,GAAY,CACtE,GAA2B,EAAoB,MAAO,GAAU,CAGhE,GAA8B,EAAoB,SAAU,GAAa,CAoEzE,GAA8B,EAAQ,SAAU,EAAE,KAAQ,GAAS,CACnE,GAA8B,EAAQ,SAAU,EAAE,KAAQ,GAAS,CAO9C,EAAoB,eAAgB,GAAmB,CACvF,IAAW,GAAc,EAAoB,QAAS,GAAY,CACxC,EAAoB,SAAU,GAAa,CA6GrE,SAAS,EAAoB,EAAM,EAAI,CACrC,OAAO,EAAQC,EAAM,CAAC,QAAQ,CAAE,GAAQ,CACtC,GAAI,CACF,SACE,EACJ,OAAO,EAAM,EAAG,EAChB,CAEJ,SAAS,GAAqC,EAAM,EAAI,CACtD,OAAO,EAAQA,EAAM,CAAC,QAAQ,CAAE,GAAS,CACvC,GAAI,CACF,SACE,EACJ,OAAO,EAAM,CACX,OAAQ,EACR,gBAAiB,EAClB,CAAC,EACF,CClQJ,SAAgB,GAAe,EAAI,EAAO,EAAK,EAAK,CAClD,GAAI,EAAE,gBAAgB,IACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,GAAK,EACV,KAAK,MAAQ,EACb,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,QAAU,yCAA2C,EAAK,KAAO,EAAQ,cAAgB,GAAO,GAA6B,KAAmB,GAAZ,IAAM,GAAY,aAC3J,KAAK,MAAY,OAAO,CAAC,MAE3B,GAAe,UAAgB,OAAO,CACtC,GAAe,UAAU,YAAc,MACvC,GAAe,UAAU,KAAO,iBAChC,GAAe,UAAU,iBAAmB,GClB5C,IAAW,EAAoB,CAC7B,eACD,CCDU,GAAkB,CAC3B,oBACA,aACD,CCJU,EAAmB,CAC5B,cACD,CCFU,GAAqB,CAC9B,gBACD,CCAU,GAA2B,CACpC,mBACA,sBACA,sBACD,CCLU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAwB,CACjC,mBACA,mBACD,CEDU,GAA6B,CACtC,mBDJ8B,CAC9B,gBACD,CCGC,mBACA,sBACA,wBACD,CENU,GAAwB,CACjC,kBDF6B,CAC7B,oBACA,eACD,CCAC,oBACA,mBACD,CCLU,GAAqB,CAC9B,oBACA,gBACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CEFU,GAAwB,CACjC,mBACA,sBDJiC,CACjC,mBACD,CCGC,mBACD,CCLU,GAAoB,CAC7B,oBACA,eACD,CCHU,GAA8B,CACvC,mBACA,yBACD,CEFU,GAA2B,CACpC,mBACA,sBDHiC,CACjC,oBACA,mBACD,CCCC,sBACD,CCJU,GAAqC,CAC9C,mBACA,oBACA,gCACD,CCLU,GAAyB,CAClC,mBACA,oBACD,CUaU,GAAoB,CAC7B,4BACA,yBACA,8BACA,yBACA,+BACA,4BACA,sCACA,yBTvBoC,CACpC,mBACA,0BACA,sBACD,CSoBC,sBPxBiC,CACjC,mBACA,iBDH4B,CAC5B,oBACA,cACD,CCCC,mBACD,COqBC,uBN1BkC,CAClC,mBACA,oBACD,CMwBC,yBL3BoC,CACpC,mBACA,sBACD,CKyBC,4BJ5BuC,CACvC,mBACA,yBACD,CI0BC,sBH7BiC,CACjC,mBACA,mBACD,CG2BC,2BF9BsC,CACtC,mBACA,wBACD,CE4BC,0BACA,oBDhC+B,CAC/B,sBACA,iBACD,CC8BC,oBACA,eACD,CCnCU,GAAqB,CAC9B,oBACA,gBACD,CCHU,GAAuB,CAChC,oBACA,kBACD,CCHU,GAAmB,CAC5B,oBACA,cACD,CCHU,GAAuB,CAChC,oBACA,kBACD,CCJU,GAAgB,CACzB,WACD,CCAU,GAAuB,CAChC,qBACA,oBACA,kBACD,CCLU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAoB,CAC7B,oBACA,eACD,CCHU,GAAoB,CAC7B,oBACA,eACD,CCHU,GAAmB,CAC5B,oBACA,cACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAsB,CAC/B,oBACA,iBACD,CCJU,GAAiB,CAC1B,YACD,CCDU,GAAmB,CAC5B,oBACA,cACD,iBCTD,SAAS,GAAK,EAKd,EAAE,UAAY,CACZ,GAAI,SAAU,EAAM,EAAU,EAAK,CACjC,IAAIC,EAAI,AAAW,KAAK,IAAI,EAAE,CAO9B,OALCA,EAAEC,KAAU,EAAEA,GAAQ,EAAE,GAAG,KAAK,CAC/B,GAAI,EACC,MACN,CAAC,CAEK,MAGT,KAAM,SAAU,EAAM,EAAU,EAAK,CACnC,IAAIC,EAAO,KACX,SAAS,GAAY,CACnB,EAAK,IAAID,EAAM,EAAS,CACxB,EAAS,MAAM,EAAK,UAAU,CAIhC,MADA,GAAS,EAAI,EACN,KAAK,GAAGA,EAAM,EAAU,EAAI,EAGrC,KAAM,SAAU,EAAM,CAMpB,IALA,IAAI,EAAO,EAAE,CAAC,MAAM,KAAK,UAAW,EAAE,CAClC,IAAW,AAAW,KAAK,IAAI,EAAE,EAAGA,IAAS,EAAE,EAAE,OAAO,CACxD,EAAI,EACJ,EAAM,EAAO,OAET,EAAI,EAAK,IACf,EAAO,GAAG,GAAG,MAAM,EAAO,GAAG,IAAK,EAAK,CAGzC,OAAO,MAGT,IAAK,SAAU,EAAM,EAAU,CAC7B,IAAID,EAAI,AAAW,KAAK,IAAI,EAAE,CAC1B,EAAOA,EAAEC,GACT,EAAa,EAAE,CAEnB,GAAI,GAAQ,MACL,IAAI,EAAI,EAAG,EAAM,EAAK,OAAQ,EAAI,EAAK,IACtC,EAAK,GAAG,KAAO,GAAY,EAAK,GAAG,GAAG,IAAM,GAC9C,EAAW,KAAK,EAAK,GAAG,CAY9B,OAJC,EAAW,OACR,EAAEA,GAAQ,EACV,OAAOD,EAAEC,GAEN,MAEV,CAED,EAAO,QAAU,EACjB,EAAO,QAAQ,YAAc,UC3D7B,SAAgB,GAAM,EAAK,CAEzB,IAAI,EAAU,IAAIE,GAAAA,QAOlB,MAJA,GAAI,GAAK,EAAQ,GAAG,KAAK,EAAQ,CACjC,EAAI,IAAM,EAAQ,IAAI,KAAK,EAAQ,CACnC,EAAI,KAAO,EAAQ,KAAK,KAAK,EAAQ,CACrC,EAAI,KAAO,EAAQ,KAAK,KAAK,EAAQ,CAC9B,ECZT,SAAgB,GAAc,EAAO,EAAM,EAAM,EAAmB,CAwDlE,SAAS,EAAW,EAAW,EAAS,CACtC,IAAI,EAAM,UAAU,OACpB,GAAI,IAAQ,GAAK,IAAQ,EACvB,MAAM,IAAI,GAAe,SAAU,EAAK,EAAG,EAAE,CAE/C,AACE,IAAU,EAAE,CAEd,SAAS,EAAe,EAAY,EAAO,EAAM,CAC/C,GAAI,MAAM,QAAQC,EAAM,CACtB,EAAM,QAAQ,GAAQ,EAAeC,EAAY,EAAK,CAAC,SAC9C,EAASD,EAAM,EAAI,EAASA,EAAM,KACtC,IAAI,KAASA,EACZ,EAAeA,EAAO,EAAM,EAC9B,EAAeC,EAAYD,EAAM,GAAQ,EAAM,SAG1C,GAAUA,EAAM,EAAIE,IAAS,IAAA,GAAW,CACjD,IAAI,EAAW,GAAUF,EAAM,CAAG,EAA2BA,EAAM,CAAGA,EAAM,GAAK,aAC/EA,EAAM,GAAKE,EAGb,GAAI,EAAeD,EAAY,EAAS,EAAIA,EAAW,KAAcD,GAAS,CAAC,EAAQ,OACrF,MAAU,MAAM,kBAAoB,EAAW,UAAU,CAE3D,EAAW,GAAYA,UAEnB,CAAC,EAAQ,OACX,MAAU,UAAU,qCAAqC,CAI/D,IAAI,EAAa,EAAE,CAEnB,IAAK,IAAIE,KADT,EAAe,EAAY,EAAU,CACpB,EACf,GAAI,EAAe,EAAYA,EAAK,CAAE,CAEpC,IAAI,EAAQ,EAAWA,GACvB,GAAI,GAAU,EAAM,CAIlB,EAAe,EAAO,EAAQ,SACrB,EAAgB,EAAM,CAC/B,EAAQA,EAAM,EAAO,EAAQ,SAEzB,CAAC,EAAQ,OACX,MAAU,UAAU,qCAAqC,EAcnE,SAAS,EAAQ,EAAM,EAAO,EAAS,CAcrC,GAXI,EAAQ,MAAQ,OAAO,GAAU,aAEnC,EAAQ,EAAM,EAAM,EAIlB,EAA0B,EAAM,GAClC,EAAQ,EAAMA,EAAM,EACjB,EAAM,WAAY,EACpB,CAAC,EAEA,EAAM,gBAAgB,EAAKA,GAAM,EAAI,EAAM,gBAAgB,EAAM,CAAE,CACrE,AAKE,EALE,EAAQ,SAEF,EAAMA,EAAM,EAAM,WAAW,CAG7B,EAAM,EAAKA,GAAO,EAAM,CAElC,EAAKA,GAAQ,EACb,OAAO,EAAkBA,GACzB,EAAiBA,EAAM,EAAM,CAC7B,EAAK,KAAK,SAAUA,EAAM,UAAoB,CAC5C,OAAO,GACP,CACF,OAEF,IAAI,EAAY,EAAKA,KAAU,IAAA,GAC3B,EAAgC,EAAK,MAA8D,gBAAgBA,EAAK,CAC5H,GAAI,CAAC,GAAa,CAAC,GAAmB,EAAQ,SAAU,CACtD,EAAKA,GAAQ,EACb,OAAO,EAAkBA,GACzB,EAAiBA,EAAM,EAAM,CAC7B,EAAK,KAAK,SAAUA,EAAM,UAAoB,CAC5C,OAAO,GACP,CACF,OAEF,GAAI,CAAC,EAAQ,OACX,MAAU,MAAM,kBAAoBA,EAAO,oBAAoB,CAGnE,SAAS,EAAiB,EAAM,EAAO,CACjC,GAAS,OAAO,EAAM,WAAc,YACtC,EAAK,WAAW,UAAUA,GAAQ,EAAM,UACpC,EAAqBA,EAAK,GAC5B,EAAK,WAAW,kBAAkBA,GAAQ,EAAM,aAIlD,OAAO,EAAK,WAAW,UAAUA,GAC7B,EAAqBA,EAAK,GAC5B,EAAK,WAAW,kBAAkBA,GAAQ,IAIhD,SAAS,EAAiB,EAAM,CAC9B,OAAO,EAAK,WAAW,UAAUA,GAC7B,EAAqBA,EAAK,CAC5B,EAAK,WAAW,kBAAkBA,GAAQ,EAAKA,GAE/C,OAAO,EAAK,WAAW,kBAAkBA,GAW7C,SAAS,EAAM,EAAI,CACjB,IAAI,EAAU,UAAmB,CAE/B,IAAK,IADD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAM,UAAU,OAAQ,EAAI,EAAK,IAAK,CACpD,IAAI,EAAM,UAAU,GACpB,EAAK,GAAK,GAAO,EAAI,SAAS,CAEhC,OAAO,EAAG,MAAM,EAAM,EAAK,EAK7B,OAHI,EAAG,YACL,EAAQ,UAAY,EAAG,WAElB,EAUT,SAAS,EAAe,EAAS,EAAS,CACxC,IACIA,EAAO,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAKE,EAAQ,GACvF,GAAIF,EAAK,SAAS,IAAI,CACpB,MAAU,MAAM,wDAA+D,KAAK,UAAUA,EAAK,CAAC,CAEtG,IAAI,EAAY,EAA2BE,EAAQ,CAAG,EAAK,WAAW,UAAY,EAC9E,EAAoBF,KAAQ,EAAK,WAAW,UAC5C,EAAW,EAAe,EAAWA,EAAK,CAAG,EAAUA,GAAQ,IAAA,GAC/D,EAAW,UAAoB,CAEjC,IAAII,EAAe,EAAE,CACrB,EAAQ,aAAa,IAAI,GAAsB,CAAC,QAAQ,GAAc,CACpE,GAAI,EAAW,SAAS,IAAI,CAC1B,MAAU,MAAM,8DAAqE,KAAK,UAAU,EAAW,CAAC,CAE9G,IAAe,OACjB,EAAa,KAAO,EACX,IAAe,oBACxB,EAAa,kBAAoB,EAAK,WAAW,kBACxC,IAAe,UAExB,EAAa,QAAU,EAEvB,EAAa,GAAc,EAAK,IAElC,CACF,IAAI,EAA0B,EAAQA,EAAa,CACnD,GAAI,GAAY,OAAO,EAAS,WAAc,WAC5C,MAAU,MAAM,+IAAoJ,CAEtK,GAAI,IAAa,IAAA,IAAa,EAAQ,SACpC,OAAO,EAET,GAAI,EAAM,gBAAgB,EAAS,EAAI,EAAM,gBAAgB,EAAS,CAEpE,OAAO,EAAM,EAAU,EAAS,CAElC,GAAI,EAAQ,OAEV,OAAO,EAEP,MAAU,MAAM,kBAAoBJ,EAAO,oBAAoB,EAG/D,EAAmDE,EAAQ,MAAoE,UAAiF,GAChN,EAAiB,EAA2BA,EAAQ,EAAI,EAA4BA,EAAQ,CAC5F,EAAgB,EAAK,WAAW,kBAGhC,CAACA,EAAQ,MAAQA,EAAQ,KAAK,OAAS,IACzC,GAAK,EAAWF,EAAM,EAAS,CAC3B,GAAQ,GAAK,EAAW,EAAQ,EAAS,CAGzC,GAAY,GACd,EAAiBA,EAAK,CAClB,GAAQ,EAAiB,EAAO,EAEhC,IACF,GAAK,EAAeA,MAAY,EAAUA,GAAM,CAC5C,GAAQ,GAAK,EAAe,MAAc,EAAUA,GAAM,IAIlE,EAAUA,GAAQ,GAAU,CACxB,IAAQ,EAAU,GAAU,EAAUA,IAGtC,GAAY,GACd,EAAiBA,EAAK,CAClB,GAAQ,EAAiB,EAAO,EAEhC,IACF,GAAK,EAAeA,MAAY,EAAUA,GAAM,CAC5C,GAAQ,GAAK,EAAe,MAAc,EAAUA,GAAM,GAMpE,EAAkBA,GAAQE,EAC1B,EAAK,KAAK,SAAUF,EAAM,EAAS,CASrC,SAAS,EAAgB,EAAQ,CAC/B,OAAO,OAAO,GAAW,YAAc,OAAO,GAAW,UAAY,OAAO,GAAW,UAAY,OAAO,GAAW,WAAa,IAAW,MAAQ,EAAO,EAAO,EAAI,EAAU,EAAO,EAAI,EAAY,EAAO,EAAI,EAAW,EAAO,EAAI,EAAS,EAAO,EAAI,MAAM,QAAQ,EAAO,CAEpR,SAAS,EAAS,EAAQ,CACxB,OAAO,OAAO,GAAW,UAAY,EAAO,OAAO,eAAiB,SAEtE,SAAS,EAA0B,EAAI,CACrC,OAAO,OAAO,GAAO,YAAc,OAAO,EAAG,WAAc,SAE7D,SAAS,EAAqB,EAAM,CAClC,MAAO,CAAC,EAAe,EAAQA,EAAK,CAEtC,SAAS,EAA4B,EAAS,CAC5C,MAAO,CAACE,EAAQ,GAAG,SAAS,IAAI,EAEhC,CAAC,EAAe,EAAQA,EAAQ,GAAG,GAAK,CAACA,EAAQ,MAAQ,CAACA,EAAQ,KAAK,SAEzE,SAAS,EAA2B,EAAS,CAC3C,OAAOA,IAAY,IAAA,IAAaA,EAAQ,OAAS,IAAA,IAAaA,EAAQ,KAAK,sBAAwB,IAAQ,GAI7G,IAAI,EAAS,CACX,WAAY,GACZ,KAAM,GACN,KAAM,GACN,MAAO,GACP,KAAM,GACN,MAAO,GACR,CACD,OAAO,mBC5RT,SAAgB,GAAO,EAAW,EAAQ,CACxC,IAAI,EAAiB,EAAS,EAAE,CAAE,EAAgB,EAAO,CAGzD,GAAI,OAAO,OAAO,QAAW,WAC3B,MAAU,MAAM,gHAAqH,CAIvI,IAAI,EAAOG,GAAc,CAEvB,WACA,YACA,cACA,YACA,aACA,SACA,WACA,UACA,WACA,eACA,iBACA,iBACA,WACA,WACA,YACA,eACA,UACA,cACA,UACA,YACA,WACA,QACA,oBACA,uBACA,SACA,eACA,iBACA,eACA,oBACA,eACA,qBACA,iBACA,4BACA,kBACA,cACA,SACA,gBACA,kBACA,qBACA,eACA,oBACA,eACA,WACD,CAAC,CAGF,EAAK,OAAS,GAAc,EAAgB,EAAK,KAAK,CACtD,EAAK,WAAa,CAChB,UAAW,EAAE,CACb,kBAAmB,CACjB,OAAQ,EAAK,OACd,CACF,CAGD,IAAI,EAAkB,EAAE,CACpB,EAAkB,EAAE,CASxB,SAAS,EAAK,EAAS,CACrB,GAAI,GAAUC,EAAQ,CACpB,OAAOA,EAAQ,EAAK,CAEtB,IAAI,EAAgBA,EAAQ,OAAO,KAAKA,EAAQ,CAAC,IACjD,GAAI,GAAU,EAAc,CAC1B,OAAO,EAAc,EAAK,CAE5B,GAAI,CAAC,GAAgBA,EAAQ,CAE3B,MADA,QAAQ,KAAK,wEAAyEA,EAAQ,CACpF,MAAM,wEAAwE,CAE1F,IAAI,EAAQ,EAAgB,QAAQA,EAAQ,CACxC,EAiBJ,OAhBI,IAAU,IAEZ,AAIE,EAJEA,EAAQ,OAAS,GAERA,EAAQ,QAAQ,EAAK,KAAM,EAAgB,EAAM,EAAK,MAAO,EAAK,CAElEA,EAAQ,QAAQ,EAAK,KAAM,EAAgB,EAAM,EAAK,MAAM,CAIzE,EAAgB,KAAKA,EAAQ,CAC7B,EAAgB,KAAK,EAAS,EAG9B,EAAW,EAAgB,GAEtB,EAET,IAAI,EAAoB,EAAE,CAG1B,SAAS,GAAY,CACd,IAA6B,MACnB,WAEf,OAAO,EAAK,MAAM,MAAM,EAAK,MAAO,EAAK,CAE3C,EAAU,gBAAkBC,GAAAA,QAAc,gBAC1C,IAAI,EAAiB,GAAc,EAAW,EAAM,EAAM,EAAkB,CA8B5E,MA7BA,GAAK,OAAS,EAId,EAAK,GAAG,aAAgB,CACtB,OAAO,OAAO,EAAkB,CAAC,QAAQ,GAAW,CAC9CD,GAAWA,EAAQ,MAAQA,EAAQ,KAAK,wBAG1C,EAAeA,EAAS,CACtB,SAAU,GACX,CAAC,EAEJ,EACF,CAIF,EAAK,OAAS,GAAO,KAAK,KAAM,EAAU,CAG1C,EAAK,QAAU,EAIf,EAAK,OAAO,OAAO,OAAO,GAAY,EAAU,CAAC,CAAC,CAClD,EAAK,eAAiB,GACtB,EAAK,eAAiB,GACtB,EAAK,WAAa,GACX,ECvMT,MAAa,GAAuB,GAAiD,CACnF,IAAM,EAAU,EAA2B,UAAU,CAGjD,EAAU,EAA2B,UAAW,CAAE,OAAQ,GAAO,CAAC,CACtE,GAAI,CAAC,EAAS,CAEZ,IAAM,EAAe,SAAS,cAAc,KAAK,CACjD,EAAa,aAAa,QAAS,QAAQ,CAC3C,EAAa,aAAa,KAAM,gBAAgB,CAChD,EAAa,YAAc,aAE3B,EAAU,SAAS,cAAc,MAAM,CACvC,EAAQ,aAAa,KAAM,UAAU,CACrC,EAAQ,aAAa,OAAQ,gBAAgB,CAC7C,EAAQ,aAAa,kBAAmB,gBAAgB,CACxD,EAAQ,YAAY,EAAa,CAGnC,GAAI,EAAE,aAAmB,aAAc,CACrC,IAAM,EAAO,SAAS,cAAc,OAAO,CAC3C,EAAK,UAAY,EAAQ,UAAU,CAEnC,EAAU,EAGZ,EAAQ,YAAY,EAAQ,CAE5B,EAAQ,sBAAsB,aAAc,EAAQ,ECWtD,IAAqB,GAArB,MAAqB,UAAmB,CAAO,CAC7C,aAAqB,CACnB,MAAM,aAAa,CAOrB,OAAwB,KAAO,GAAO,CACpC,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACJ,CAAC,CAEF,MAAgB,KAAmC,CACjD,IAAM,EAAc,EAA6B,IAAI,CAC/C,EAAO,EAAW,KAAK,MAAM,EAAY,MAAM,CAErD,GAAI,CACF,MAAO,GAAG,EAAK,UAAU,CAAC,KAAK,EAAK,UAAU,QACxC,CAEN,QAIJ,MAAgB,KAAK,EAA+B,CAClD,GAAoB,EAAO"} \ No newline at end of file +{"version":3,"file":"CGazvOKw.min.js","names":["e","clone","properties","name","log2","log10","cbrt","expm1","sign","format","toFixed","toExponential","toEngineering","digits","e","zeros","_toNumberOrDefault","toFixed","dependencies","name","create","factory","create","isPlainObject","name","last","params","self","s","generic","typedFunction","dependencies","createTyped","name","name","dependencies","format","digits","e","formatNumber","formatBigNumber","o","e","e","deepMap","arrayDeepMap","map","del","hasher","memoize","name","dependencies","create","name","dependencies","number","clone","self","name","dependencies","callback","name","dependencies","name","dependencies","index","name","dependencies","name","dependencies","name","dependencies","_extends","defaultEscapeMapFn","defaultEscapes","formatEscapes","_loop","isUnit","name","name","dependencies","name","dependencies","param","name","dependencies","name","dependencies","properties","name","dependencies","name","dependencies","name","dependencies","name","dependencies","self","name","dependencies","math","isUnit","name","dependencies","math","fn","name","dependencies","properties","name","dependencies","name","dependencies","name","dependencies","self","name","dependencies","self","name","e","name","self","Emitter","value","flatValues","name","wrapper","factory","resolver","dependencies","emitter.mixin","factory","typedFunction"],"sources":["../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/extends.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/config.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/customs.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/map.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/is.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/object.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/function/config.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/number.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/arithmetic.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/product.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/combinations.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/constants.js","../../../../../client/simple/node_modules/mathjs/lib/esm/plain/number/probability.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/factory.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/noop.js","../../../../../client/simple/node_modules/typed-function/lib/umd/typed-function.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/function/typed.js","../../../../../client/simple/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/string.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/typeof.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/toPrimitive.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","../../../../../client/simple/node_modules/@babel/runtime/helpers/esm/defineProperty.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/operators.js","../../../../../client/simple/node_modules/mathjs/lib/esm/error/IndexError.js","../../../../../client/simple/node_modules/mathjs/lib/esm/error/DimensionError.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/array.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/collection.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/lruQueue.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/function.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/bignumber/constants.js","../../../../../client/simple/node_modules/mathjs/lib/esm/constants.js","../../../../../client/simple/node_modules/mathjs/lib/esm/type/number.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/keywords.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/Node.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/utils/access.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/utils/assign.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/BlockNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js","../../../../../client/simple/node_modules/escape-latex/dist/index.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/latex.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/IndexNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/scope.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/RangeNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/parse.js","../../../../../client/simple/node_modules/mathjs/lib/esm/expression/function/evaluate.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/matrix/size.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/probability/factorial.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/utils/isBounded.js","../../../../../client/simple/node_modules/mathjs/lib/esm/function/utils/numeric.js","../../../../../client/simple/node_modules/mathjs/lib/esm/factoriesNumber.js","../../../../../client/simple/node_modules/mathjs/lib/esm/error/ArgumentsError.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsBounded.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js","../../../../../client/simple/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js","../../../../../client/simple/node_modules/tiny-emitter/index.js","../../../../../client/simple/node_modules/mathjs/lib/esm/utils/emitter.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/function/import.js","../../../../../client/simple/node_modules/mathjs/lib/esm/core/create.js","../../../../../client/simple/src/js/util/appendAnswerElement.ts","../../../../../client/simple/src/js/plugin/Calculator.ts"],"sourcesContent":["function _extends() {\n return _extends = Object.assign ? Object.assign.bind() : function (n) {\n for (var e = 1; e < arguments.length; e++) {\n var t = arguments[e];\n for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n }\n return n;\n }, _extends.apply(null, arguments);\n}\nexport { _extends as default };","export var DEFAULT_CONFIG = {\n // minimum relative difference between two compared values,\n // used by all comparison functions\n relTol: 1e-12,\n // minimum absolute difference between two compared values,\n // used by all comparison functions\n absTol: 1e-15,\n // type of default matrix output. Choose 'matrix' (default) or 'array'\n matrix: 'Matrix',\n // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'\n number: 'number',\n // type of fallback used for config { number: 'bigint' } when a value cannot be represented\n // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.\n numberFallback: '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 // legacy behavior for matrix subset. When true, the subset function\n // returns a matrix or array with the same size as the index (except for scalars).\n // When false, it returns a matrix or array with a size depending on the type of index.\n legacySubset: false\n};","import { hasOwnProperty } from './object.js';\n\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\nfunction getSafeProperty(object, prop) {\n // only allow getting safe properties of a plain object\n if (isSafeProperty(object, prop)) {\n return object[prop];\n }\n if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n throw new Error('Cannot access method \"' + prop + '\" as a property');\n }\n throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\nfunction setSafeProperty(object, prop, value) {\n // only allow setting safe properties of a plain object\n if (isSafeProperty(object, prop)) {\n object[prop] = value;\n return value;\n }\n throw new Error('No access to property \"' + prop + '\"');\n}\n\n/**\n * Test whether a property is safe to use on an object or Array.\n * For example .toString and .constructor are not safe\n * @param {Object | Array} object\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty(object, prop) {\n if (!isPlainObject(object) && !Array.isArray(object)) {\n return false;\n }\n // SAFE: whitelisted\n // e.g length\n if (hasOwnProperty(safeNativeProperties, prop)) {\n return true;\n }\n // UNSAFE: inherited from Object prototype\n // e.g constructor\n if (prop in Object.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Object.prototype is a root object\n return false;\n }\n // UNSAFE: inherited from Function prototype\n // e.g call, apply\n if (prop in Function.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Function.prototype is a root object\n return false;\n }\n return true;\n}\n\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n * @return {function} Returns the method when valid\n */\nfunction getSafeMethod(object, method) {\n if (!isSafeMethod(object, method)) {\n throw new Error('No access to method \"' + method + '\"');\n }\n return object[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 */\nfunction isSafeMethod(object, method) {\n if (object === null || object === undefined || typeof object[method] !== 'function') {\n return false;\n }\n // UNSAFE: ghosted\n // e.g overridden toString\n // Note that IE10 doesn't support __proto__ and we can't do this check there.\n if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {\n return false;\n }\n // SAFE: whitelisted\n // e.g toString\n if (hasOwnProperty(safeNativeMethods, method)) {\n return true;\n }\n // UNSAFE: inherited from Object prototype\n // e.g constructor\n if (method in Object.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Object.prototype is a root object\n return false;\n }\n // UNSAFE: inherited from Function prototype\n // e.g call, apply\n if (method in Function.prototype) {\n // 'in' is used instead of hasOwnProperty for nodejs v0.10\n // which is inconsistent on root prototypes. It is safe\n // here because Function.prototype is a root object\n return false;\n }\n return true;\n}\nfunction isPlainObject(object) {\n return typeof object === 'object' && object && object.constructor === Object;\n}\nvar safeNativeProperties = {\n length: true,\n name: true\n};\nvar safeNativeMethods = {\n toString: true,\n valueOf: true,\n toLocaleString: true\n};\nexport { getSafeProperty };\nexport { setSafeProperty };\nexport { isSafeProperty };\nexport { getSafeMethod };\nexport { isSafeMethod };\nexport { isPlainObject };","import { getSafeProperty, isSafeProperty, setSafeProperty } from './customs.js';\nimport { isMap, isObject } from './is.js';\n\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nexport class ObjectWrappingMap {\n constructor(object) {\n this.wrappedObject = object;\n this[Symbol.iterator] = this.entries;\n }\n keys() {\n return Object.keys(this.wrappedObject).filter(key => this.has(key)).values();\n }\n get(key) {\n return getSafeProperty(this.wrappedObject, key);\n }\n set(key, value) {\n setSafeProperty(this.wrappedObject, key, value);\n return this;\n }\n has(key) {\n return isSafeProperty(this.wrappedObject, key) && key in this.wrappedObject;\n }\n entries() {\n return mapIterator(this.keys(), key => [key, this.get(key)]);\n }\n forEach(callback) {\n for (var key of this.keys()) {\n callback(this.get(key), key, this);\n }\n }\n delete(key) {\n if (isSafeProperty(this.wrappedObject, key)) {\n delete this.wrappedObject[key];\n }\n }\n clear() {\n for (var key of this.keys()) {\n this.delete(key);\n }\n }\n get size() {\n return Object.keys(this.wrappedObject).length;\n }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n * const a = new Map()\n * const b = new Map()\n * const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n /**\n * @param {Map} a\n * @param {Map} b\n * @param {Set} bKeys\n */\n constructor(a, b, bKeys) {\n this.a = a;\n this.b = b;\n this.bKeys = bKeys;\n this[Symbol.iterator] = this.entries;\n }\n get(key) {\n return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);\n }\n set(key, value) {\n if (this.bKeys.has(key)) {\n this.b.set(key, value);\n } else {\n this.a.set(key, value);\n }\n return this;\n }\n has(key) {\n return this.b.has(key) || this.a.has(key);\n }\n keys() {\n return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();\n }\n entries() {\n return mapIterator(this.keys(), key => [key, this.get(key)]);\n }\n forEach(callback) {\n for (var key of this.keys()) {\n callback(this.get(key), key, this);\n }\n }\n delete(key) {\n return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);\n }\n clear() {\n this.a.clear();\n this.b.clear();\n }\n get size() {\n return [...this.keys()].length;\n }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator(it, callback) {\n return {\n next: () => {\n var n = it.next();\n return n.done ? n : {\n value: callback(n.value),\n done: false\n };\n }\n };\n}\n\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexport function createEmptyMap() {\n return new Map();\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap(mapOrObject) {\n if (!mapOrObject) {\n return createEmptyMap();\n }\n if (isMap(mapOrObject)) {\n return mapOrObject;\n }\n if (isObject(mapOrObject)) {\n return new ObjectWrappingMap(mapOrObject);\n }\n throw new Error('createMap can create maps from objects or Maps');\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject(map) {\n if (map instanceof ObjectWrappingMap) {\n return map.wrappedObject;\n }\n var object = {};\n for (var key of map.keys()) {\n var value = map.get(key);\n setSafeProperty(object, key, value);\n }\n return object;\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nexport function assign(map) {\n for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n objects[_key - 1] = arguments[_key];\n }\n for (var args of objects) {\n if (!args) {\n continue;\n }\n if (isMap(args)) {\n for (var key of args.keys()) {\n map.set(key, args.get(key));\n }\n } else if (isObject(args)) {\n for (var _key2 of Object.keys(args)) {\n map.set(_key2, args[_key2]);\n }\n }\n }\n return map;\n}","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n// instanceof cannot be used because that would not allow to pass data from\n// one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n// matches for \"fake\" instances like plain objects with a property `isUnit`.\n// That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n// for security reasons, so these functions are not exposed in the expression\n// parser.\n\nimport { ObjectWrappingMap } from './map.js';\nexport function isNumber(x) {\n return typeof x === 'number';\n}\nexport function isBigNumber(x) {\n if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {\n return false;\n }\n if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {\n return true;\n }\n if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {\n return true;\n }\n return false;\n}\nexport function isBigInt(x) {\n return typeof x === 'bigint';\n}\nexport function isComplex(x) {\n return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;\n}\nexport function isFraction(x) {\n return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;\n}\nexport function isUnit(x) {\n return x && x.constructor.prototype.isUnit === true || false;\n}\nexport function isString(x) {\n return typeof x === 'string';\n}\nexport var isArray = Array.isArray;\nexport function isMatrix(x) {\n return x && x.constructor.prototype.isMatrix === true || false;\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nexport function isCollection(x) {\n return Array.isArray(x) || isMatrix(x);\n}\nexport function isDenseMatrix(x) {\n return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isSparseMatrix(x) {\n return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;\n}\nexport function isRange(x) {\n return x && x.constructor.prototype.isRange === true || false;\n}\nexport function isIndex(x) {\n return x && x.constructor.prototype.isIndex === true || false;\n}\nexport function isBoolean(x) {\n return typeof x === 'boolean';\n}\nexport function isResultSet(x) {\n return x && x.constructor.prototype.isResultSet === true || false;\n}\nexport function isHelp(x) {\n return x && x.constructor.prototype.isHelp === true || false;\n}\nexport function isFunction(x) {\n return typeof x === 'function';\n}\nexport function isDate(x) {\n return x instanceof Date;\n}\nexport function isRegExp(x) {\n return x instanceof RegExp;\n}\nexport function isObject(x) {\n return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nexport function isMap(object) {\n // We can use the fast instanceof, or a slower duck typing check.\n // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n if (!object) {\n return false;\n }\n return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';\n}\nexport function isPartitionedMap(object) {\n return isMap(object) && isMap(object.a) && isMap(object.b);\n}\nexport function isObjectWrappingMap(object) {\n return isMap(object) && isObject(object.wrappedObject);\n}\nexport function isNull(x) {\n return x === null;\n}\nexport function isUndefined(x) {\n return x === undefined;\n}\nexport function isAccessorNode(x) {\n return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isArrayNode(x) {\n return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isAssignmentNode(x) {\n return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isBlockNode(x) {\n return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConditionalNode(x) {\n return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isConstantNode(x) {\n return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n a fraction means that the division in that fraction has precedence over implicit\n multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n 6!/8 x parses as 6! / (8x). It is located here because it is shared between\n parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n This should *not* be exported from mathjs, unlike most of the tests here.\n Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n it should be exported.\n*/\nexport function rule2Node(node) {\n return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);\n}\nexport function isFunctionAssignmentNode(x) {\n return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isFunctionNode(x) {\n return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isIndexNode(x) {\n return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isNode(x) {\n return x && x.isNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isObjectNode(x) {\n return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isOperatorNode(x) {\n return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isParenthesisNode(x) {\n return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRangeNode(x) {\n return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isRelationalNode(x) {\n return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isSymbolNode(x) {\n return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;\n}\nexport function isChain(x) {\n return x && x.constructor.prototype.isChain === true || false;\n}\nexport function typeOf(x) {\n var t = typeof x;\n if (t === 'object') {\n if (x === null) return 'null';\n if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal\n if (x.constructor && x.constructor.name) return x.constructor.name;\n return 'Object'; // just in case\n }\n return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}","import { isBigNumber, isObject } from './is.js';\n\n/**\n * Clone an object\n *\n * clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\nexport function clone(x) {\n var type = typeof x;\n\n // immutable primitive types\n if (type === 'number' || type === 'bigint' || type === 'string' || type === 'boolean' || x === null || x === undefined) {\n return x;\n }\n\n // use clone function of the object when available\n if (typeof x.clone === 'function') {\n return x.clone();\n }\n\n // array\n if (Array.isArray(x)) {\n return x.map(function (value) {\n return clone(value);\n });\n }\n if (x instanceof Date) return new Date(x.valueOf());\n if (isBigNumber(x)) return x; // bignumbers are immutable\n\n // object\n if (isObject(x)) {\n return mapObject(x, clone);\n }\n if (type === 'function') {\n // we assume that the function is immutable\n return x;\n }\n throw new TypeError(\"Cannot clone: unknown type of value (value: \".concat(x, \")\"));\n}\n\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\nexport function mapObject(object, callback) {\n var clone = {};\n for (var key in object) {\n if (hasOwnProperty(object, key)) {\n clone[key] = callback(object[key]);\n }\n }\n return clone;\n}\n\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\nexport function extend(a, b) {\n for (var prop in b) {\n if (hasOwnProperty(b, prop)) {\n a[prop] = b[prop];\n }\n }\n return a;\n}\n\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\nexport function deepExtend(a, b) {\n // TODO: add support for Arrays to deepExtend\n if (Array.isArray(b)) {\n throw new TypeError('Arrays are not supported by deepExtend');\n }\n for (var prop in b) {\n // We check against prop not being in Object.prototype or Function.prototype\n // to prevent polluting for example Object.__proto__.\n if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n if (b[prop] && b[prop].constructor === Object) {\n if (a[prop] === undefined) {\n a[prop] = {};\n }\n if (a[prop] && a[prop].constructor === Object) {\n deepExtend(a[prop], b[prop]);\n } else {\n a[prop] = b[prop];\n }\n } else if (Array.isArray(b[prop])) {\n throw new TypeError('Arrays are not supported by deepExtend');\n } else {\n a[prop] = b[prop];\n }\n }\n }\n return a;\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nexport function deepStrictEqual(a, b) {\n var prop, i, len;\n if (Array.isArray(a)) {\n if (!Array.isArray(b)) {\n return false;\n }\n if (a.length !== b.length) {\n return false;\n }\n for (i = 0, len = a.length; i < len; i++) {\n if (!deepStrictEqual(a[i], b[i])) {\n return false;\n }\n }\n return true;\n } else if (typeof a === 'function') {\n return a === b;\n } else if (a instanceof Object) {\n if (Array.isArray(b) || !(b instanceof Object)) {\n return false;\n }\n for (prop in a) {\n // noinspection JSUnfilteredForInLoop\n if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n return false;\n }\n }\n for (prop in b) {\n // noinspection JSUnfilteredForInLoop\n if (!(prop in a)) {\n return false;\n }\n }\n return true;\n } else {\n return a === b;\n }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten(nestedObject) {\n var flattenedObject = {};\n _deepFlatten(nestedObject, flattenedObject);\n return flattenedObject;\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten(nestedObject, flattenedObject) {\n for (var prop in nestedObject) {\n if (hasOwnProperty(nestedObject, prop)) {\n var value = nestedObject[prop];\n if (typeof value === 'object' && value !== null) {\n _deepFlatten(value, flattenedObject);\n } else {\n flattenedObject[prop] = value;\n }\n }\n }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nexport function canDefineProperty() {\n // test needed for broken IE8 implementation\n try {\n if (Object.defineProperty) {\n Object.defineProperty({}, 'x', {\n get: function get() {\n return null;\n }\n });\n return true;\n }\n } catch (e) {}\n return false;\n}\n\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object Object where to add the property\n * @param {string} prop Property name\n * @param {Function} valueResolver Function returning the property value. Called\n * without arguments.\n */\nexport function lazy(object, prop, valueResolver) {\n var _uninitialized = true;\n var _value;\n Object.defineProperty(object, prop, {\n get: function get() {\n if (_uninitialized) {\n _value = valueResolver();\n _uninitialized = false;\n }\n return _value;\n },\n set: function set(value) {\n _value = value;\n _uninitialized = false;\n },\n configurable: true,\n enumerable: true\n });\n}\n\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nexport function traverse(object, path) {\n if (path && typeof path === 'string') {\n return traverse(object, path.split('.'));\n }\n var obj = object;\n if (path) {\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n if (!(key in obj)) {\n obj[key] = {};\n }\n obj = obj[key];\n }\n }\n return obj;\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty(object, property) {\n return object && Object.hasOwnProperty.call(object, property);\n}\n\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object]) (required)\n * - name: string (optional)\n * - path: string A dot separated path (optional)\n * - math: boolean If true (false by default), the math namespace is passed\n * as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\nexport function isLegacyFactory(object) {\n return object && typeof object.factory === 'function';\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nexport function get(object, path) {\n if (typeof path === 'string') {\n if (isPath(path)) {\n return get(object, path.split('.'));\n } else {\n return object[path];\n }\n }\n var child = object;\n for (var i = 0; i < path.length; i++) {\n var key = path[i];\n child = child ? child[key] : undefined;\n }\n return child;\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nexport function set(object, path, value) {\n if (typeof path === 'string') {\n if (isPath(path)) {\n return set(object, path.split('.'), value);\n } else {\n object[path] = value;\n return object;\n }\n }\n var child = object;\n for (var i = 0; i < path.length - 1; i++) {\n var key = path[i];\n if (child[key] === undefined) {\n child[key] = {};\n }\n child = child[key];\n }\n if (path.length > 0) {\n var lastKey = path[path.length - 1];\n child[lastKey] = value;\n }\n return object;\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nexport function pick(object, properties, transform) {\n var copy = {};\n for (var i = 0; i < properties.length; i++) {\n var key = properties[i];\n var value = get(object, key);\n if (value !== undefined) {\n set(copy, key, transform ? transform(value, key) : value);\n }\n }\n return copy;\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nexport function pickShallow(object, properties) {\n var copy = {};\n for (var i = 0; i < properties.length; i++) {\n var key = properties[i];\n var value = object[key];\n if (value !== undefined) {\n copy[key] = value;\n }\n }\n return copy;\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath(str) {\n return str.includes('.');\n}","import { clone, deepExtend } from '../../utils/object.js';\nimport { DEFAULT_CONFIG } from '../config.js';\nexport var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix\nexport var NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', '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 * 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} relTol\n * Minimum relative difference between two\n * compared values, used by all comparison functions.\n * {number} absTol\n * Minimum absolute 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', 'bigint', 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 if (options.epsilon !== undefined) {\n // this if is only for backwards compatibility, it can be removed in the future.\n console.warn('Warning: The configuration option \"epsilon\" is deprecated. Use \"relTol\" and \"absTol\" instead.');\n var optionsFix = clone(options);\n optionsFix.relTol = options.epsilon;\n optionsFix.absTol = options.epsilon * 1e-3;\n delete optionsFix.epsilon;\n return _config(optionsFix);\n }\n if (options.legacySubset === true) {\n // this if is only for backwards compatibility, it can be removed in the future.\n console.warn('Warning: The configuration option \"legacySubset\" is for compatibility only and might be deprecated in the future.');\n }\n var prev = clone(config);\n\n // validate some of the options\n validateOption(options, 'matrix', MATRIX_OPTIONS);\n validateOption(options, 'number', NUMBER_OPTIONS);\n\n // merge options\n deepExtend(config, options);\n var curr = clone(config);\n var changes = clone(options);\n\n // emit 'config' event\n emit('config', curr, prev, changes);\n return curr;\n } else {\n return clone(config);\n }\n }\n\n // attach the valid options to the function so they can be extended\n _config.MATRIX_OPTIONS = MATRIX_OPTIONS;\n _config.NUMBER_OPTIONS = NUMBER_OPTIONS;\n\n // attach the config properties as readonly properties to the config function\n Object.keys(DEFAULT_CONFIG).forEach(key => {\n Object.defineProperty(_config, key, {\n get: () => config[key],\n enumerable: true,\n configurable: true\n });\n });\n return _config;\n}\n\n/**\n * Validate an option\n * @param {Object} options Object with options\n * @param {string} name Name of the option to validate\n * @param {Array.} values Array with valid values for this option\n */\nfunction validateOption(options, name, values) {\n if (options[name] !== undefined && !values.includes(options[name])) {\n // unknown value\n console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');\n }\n}","import { isBigNumber, isNumber, isObject } from './is.js';\n\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nexport function isInteger(value) {\n if (typeof value === 'boolean') {\n return true;\n }\n return Number.isFinite(value) ? value === Math.round(value) : false;\n}\n\n/**\n * Ensure the number type is compatible with the provided value.\n * If not, return 'number' instead.\n *\n * For example:\n *\n * safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })\n *\n * will return 'number' and not 'bigint' because trying to create a bigint with\n * value 2.3 would throw an exception.\n *\n * @param {string} numberStr\n * @param {{\n * number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'\n * numberFallback: 'number' | 'BigNumber'\n * }} config\n * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}\n */\nexport function safeNumberType(numberStr, config) {\n if (config.number === 'bigint') {\n try {\n BigInt(numberStr);\n } catch (_unused) {\n return config.numberFallback;\n }\n }\n return config.number;\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sign = Math.sign || function (x) {\n if (x > 0) {\n return 1;\n } else if (x < 0) {\n return -1;\n } else {\n return 0;\n }\n};\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log2 = Math.log2 || function log2(x) {\n return Math.log(x) / Math.LN2;\n};\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport var log10 = Math.log10 || function log10(x) {\n return Math.log(x) / Math.LN10;\n};\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport var log1p = Math.log1p || function (x) {\n return Math.log(x + 1);\n};\n\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n * https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\nexport var cbrt = Math.cbrt || function cbrt(x) {\n if (x === 0) {\n return x;\n }\n var negate = x < 0;\n var result;\n if (negate) {\n x = -x;\n }\n if (Number.isFinite(x)) {\n result = Math.exp(Math.log(x) / 3);\n // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n result = (x / (result * result) + 2 * result) / 3;\n } else {\n result = x;\n }\n return negate ? -result : result;\n};\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport var expm1 = Math.expm1 || function expm1(x) {\n return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;\n};\n\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatNumberToBase(n, base, size) {\n var prefixes = {\n 2: '0b',\n 8: '0o',\n 16: '0x'\n };\n var prefix = prefixes[base];\n var suffix = '';\n if (size) {\n if (size < 1) {\n throw new Error('size must be in greater than 0');\n }\n if (!isInteger(size)) {\n throw new Error('size must be an integer');\n }\n if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n }\n if (!isInteger(n)) {\n throw new Error('Value must be an integer');\n }\n if (n < 0) {\n n = n + 2 ** size;\n }\n suffix = \"i\".concat(size);\n }\n var sign = '';\n if (n < 0) {\n n = -n;\n sign = '-';\n }\n return \"\".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);\n}\n\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n * format(value)\n * format(value, options)\n * format(value, precision)\n * format(value, fn)\n *\n * Where:\n *\n * {number} value The value to be formatted\n * {Object} options An object with formatting options. Available options:\n * {string} notation\n * Number notation. Choose from:\n * 'fixed' Always use regular number notation.\n * For example '123.40' and '14000000'\n * 'exponential' Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * 'engineering' Always use engineering notation.\n * For example '123.4e+0' and '14.0e+6'\n * 'auto' (default) Regular number notation for numbers\n * having an absolute value between\n * `lowerExp` and `upperExp` bounds, and\n * uses exponential notation elsewhere.\n * Lower bound is included, upper bound\n * is excluded.\n * For example '123.4' and '1.4e7'.\n * 'bin', 'oct, or\n * 'hex' Format the number using binary, octal,\n * or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * {number} wordSize The word size in bits to use for formatting\n * in binary, octal, or hexadecimal notation.\n * To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option\n * is defined the value is formatted as a signed\n * twos complement integer of the given word size\n * and the size suffix is appended to the output.\n * For example\n * format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * {number} precision A number between 0 and 16 to round\n * the digits of the number.\n * In case of notations 'exponential',\n * 'engineering', and 'auto',\n * `precision` defines the total\n * number of significant digits returned.\n * In case of notation 'fixed',\n * `precision` defines the number of\n * significant digits after the decimal\n * point.\n * `precision` is undefined by default,\n * not rounding any digits.\n * {number} lowerExp Exponent determining the lower boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `-3`.\n * {number} upperExp Exponent determining the upper boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `5`.\n * {Function} fn A custom formatting function. Can be used to override the\n * built-in notations. Function `fn` is called with `value` as\n * parameter and must return a string. Is useful for example to\n * format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n * format(6.4) // '6.4'\n * format(1240000) // '1.24e6'\n * format(1/3) // '0.3333333333333333'\n * format(1/3, 3) // '0.333'\n * format(21385, 2) // '21000'\n * format(12.071, {notation: 'fixed'}) // '12'\n * format(2.3, {notation: 'fixed', precision: 2}) // '2.30'\n * format(52.8, {notation: 'exponential'}) // '5.28e+1'\n * format(12345678, {notation: 'engineering'}) // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n if (typeof options === 'function') {\n // handle format(value, fn)\n return options(value);\n }\n\n // handle special cases\n if (value === Infinity) {\n return 'Infinity';\n } else if (value === -Infinity) {\n return '-Infinity';\n } else if (isNaN(value)) {\n return 'NaN';\n }\n var {\n notation,\n precision,\n wordSize\n } = normalizeFormatOptions(options);\n\n // handle the various notations\n switch (notation) {\n case 'fixed':\n return toFixed(value, precision);\n case 'exponential':\n return toExponential(value, precision);\n case 'engineering':\n return toEngineering(value, precision);\n case 'bin':\n return formatNumberToBase(value, 2, wordSize);\n case 'oct':\n return formatNumberToBase(value, 8, wordSize);\n case 'hex':\n return formatNumberToBase(value, 16, wordSize);\n case 'auto':\n // remove trailing zeros after the decimal point\n return toPrecision(value, precision, options).replace(/((\\.\\d*?)(0+))($|e)/, function () {\n var digits = arguments[2];\n var e = arguments[4];\n return digits !== '.' ? digits + e : e;\n });\n default:\n throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n }\n}\n\n/**\n * Normalize format options into an object:\n * {\n * notation: string,\n * precision: number | undefined,\n * wordSize: number | undefined\n * }\n */\nexport function normalizeFormatOptions(options) {\n // default values for options\n var notation = 'auto';\n var precision;\n var wordSize;\n if (options !== undefined) {\n if (isNumber(options)) {\n precision = options;\n } else if (isBigNumber(options)) {\n precision = options.toNumber();\n } else if (isObject(options)) {\n if (options.precision !== undefined) {\n precision = _toNumberOrThrow(options.precision, () => {\n throw new Error('Option \"precision\" must be a number or BigNumber');\n });\n }\n if (options.wordSize !== undefined) {\n wordSize = _toNumberOrThrow(options.wordSize, () => {\n throw new Error('Option \"wordSize\" must be a number or BigNumber');\n });\n }\n if (options.notation) {\n notation = options.notation;\n }\n } else {\n throw new Error('Unsupported type of options, number, BigNumber, or object expected');\n }\n }\n return {\n notation,\n precision,\n wordSize\n };\n}\n\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n * Returns an object containing sign, coefficients, and exponent\n */\nexport function splitNumber(value) {\n // parse the input value\n var match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/);\n if (!match) {\n throw new SyntaxError('Invalid number ' + value);\n }\n var sign = match[1];\n var digits = match[2];\n var exponent = parseFloat(match[4] || '0');\n var dot = digits.indexOf('.');\n exponent += dot !== -1 ? dot - 1 : digits.length - 1;\n var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)\n .replace(/^0*/, function (zeros) {\n // remove leading zeros, add their count to the exponent\n exponent -= zeros.length;\n return '';\n }).replace(/0*$/, '') // remove trailing zeros\n .split('').map(function (d) {\n return parseInt(d);\n });\n if (coefficients.length === 0) {\n coefficients.push(0);\n exponent++;\n }\n return {\n sign,\n coefficients,\n exponent\n };\n}\n\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision] Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n if (isNaN(value) || !Number.isFinite(value)) {\n return String(value);\n }\n var split = splitNumber(value);\n var rounded = roundDigits(split, precision);\n var e = rounded.exponent;\n var c = rounded.coefficients;\n\n // find nearest lower multiple of 3 for exponent\n var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n if (isNumber(precision)) {\n // add zeroes to give correct sig figs\n while (precision > c.length || e - newExp + 1 > c.length) {\n c.push(0);\n }\n } else {\n // concatenate coefficients with necessary zeros\n // add zeros if necessary (for example: 1e+8 -> 100e+6)\n var missingZeros = Math.abs(e - newExp) - (c.length - 1);\n for (var i = 0; i < missingZeros; i++) {\n c.push(0);\n }\n }\n\n // find difference in exponents\n var expDiff = Math.abs(e - newExp);\n var decimalIdx = 1;\n\n // push decimal index over by expDiff times\n while (expDiff > 0) {\n decimalIdx++;\n expDiff--;\n }\n\n // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n // otherwise concat with the rest of the coefficients\n var decimals = c.slice(decimalIdx).join('');\n var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';\n var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n return rounded.sign + str;\n}\n\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n * decimal point. null by default.\n */\nexport function toFixed(value, precision) {\n if (isNaN(value) || !Number.isFinite(value)) {\n return String(value);\n }\n var splitValue = splitNumber(value);\n var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;\n var c = rounded.coefficients;\n var p = rounded.exponent + 1; // exponent may have changed\n\n // append zeros if needed\n var pp = p + (precision || 0);\n if (c.length < pp) {\n c = c.concat(zeros(pp - c.length));\n }\n\n // prepend zeros if needed\n if (p < 0) {\n c = zeros(-p + 1).concat(c);\n p = 1;\n }\n\n // insert a dot if needed\n if (p < c.length) {\n c.splice(p, 0, p === 0 ? '0.' : '.');\n }\n return rounded.sign + c.join('');\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision] Number of digits in formatted output.\n * If not provided, the maximum available digits\n * is used.\n */\nexport function toExponential(value, precision) {\n if (isNaN(value) || !Number.isFinite(Number(value))) {\n return String(value);\n }\n\n // round if needed, else create a clone\n var split = splitNumber(value);\n var rounded = precision ? roundDigits(split, precision) : split;\n var c = rounded.coefficients;\n var e = rounded.exponent;\n\n // append zeros if needed\n if (c.length < precision) {\n c = c.concat(zeros(precision - c.length));\n }\n\n // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n var first = c.shift();\n return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n * By default:\n * lowerExp = -3 (incl)\n * upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision(value, precision, options) {\n if (isNaN(value) || !Number.isFinite(value)) {\n return String(value);\n }\n\n // determine lower and upper bound for exponential notation.\n var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n var split = splitNumber(value);\n var rounded = precision ? roundDigits(split, precision) : split;\n if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n // exponential notation\n return toExponential(value, precision);\n } else {\n var c = rounded.coefficients;\n var e = rounded.exponent;\n\n // append trailing zeros\n if (c.length < precision) {\n c = c.concat(zeros(precision - c.length));\n }\n\n // append trailing zeros\n // TODO: simplify the next statement\n c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));\n\n // prepend zeros\n c = zeros(-e).concat(c);\n var dot = e > 0 ? e : 0;\n if (dot < c.length - 1) {\n c.splice(dot + 1, 0, '.');\n }\n return rounded.sign + c.join('');\n }\n}\n\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split A value split with .splitNumber(value)\n * @param {number} precision A positive integer\n * @return {SplitValue}\n * Returns an object containing sign, coefficients, and exponent\n * with rounded digits\n */\nexport function roundDigits(split, precision) {\n // create a clone\n var rounded = {\n sign: split.sign,\n coefficients: split.coefficients,\n exponent: split.exponent\n };\n var c = rounded.coefficients;\n\n // prepend zeros if needed\n while (precision <= 0) {\n c.unshift(0);\n rounded.exponent++;\n precision++;\n }\n if (c.length > precision) {\n var removed = c.splice(precision, c.length - precision);\n if (removed[0] >= 5) {\n var i = precision - 1;\n c[i]++;\n while (c[i] === 10) {\n c.pop();\n if (i === 0) {\n c.unshift(0);\n rounded.exponent++;\n i++;\n }\n i--;\n c[i]++;\n }\n }\n }\n return rounded;\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros(length) {\n var arr = [];\n for (var i = 0; i < length; i++) {\n arr.push(0);\n }\n return arr;\n}\n\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n * 2.34 returns 3\n * 0.0034 returns 2\n * 120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits Number of significant digits\n */\nexport function digits(value) {\n return value.toExponential().replace(/e.*$/, '') // remove exponential notation\n .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n .length;\n}\n\n/**\n * Compares two floating point numbers.\n * @param {number} a - First value to compare\n * @param {number} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @return {boolean} whether the two numbers are nearly equal\n *\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-8); // true\n * nearlyEqual(1.000000002, 1.0, 0); // false\n * nearlyEqual(1.0, 1.009, undefined, 0.01); // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual(a, b) {\n var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-8;\n var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;\n if (relTol <= 0) {\n throw new Error('Relative tolerance must be greater than 0');\n }\n if (absTol < 0) {\n throw new Error('Absolute tolerance must be at least 0');\n }\n\n // NaN\n if (isNaN(a) || isNaN(b)) {\n return false;\n }\n if (!Number.isFinite(a) || !Number.isFinite(b)) {\n return a === b;\n }\n if (a === b) {\n return true;\n }\n\n // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)\n return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol);\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport var acosh = Math.acosh || function (x) {\n return Math.log(Math.sqrt(x * x - 1) + x);\n};\nexport var asinh = Math.asinh || function (x) {\n return Math.log(Math.sqrt(x * x + 1) + x);\n};\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport var atanh = Math.atanh || function (x) {\n return Math.log((1 + x) / (1 - x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var cosh = Math.cosh || function (x) {\n return (Math.exp(x) + Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport var sinh = Math.sinh || function (x) {\n return (Math.exp(x) - Math.exp(-x)) / 2;\n};\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport var tanh = Math.tanh || function (x) {\n var e = Math.exp(2 * x);\n return (e - 1) / (e + 1);\n};\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign(x, y) {\n var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;\n var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;\n return signx ^ signy ? -x : x;\n}\nfunction _toNumberOrThrow(value, onError) {\n if (isNumber(value)) {\n return value;\n } else if (isBigNumber(value)) {\n return value.toNumber();\n } else {\n onError();\n }\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n if (isNumber(value)) {\n return value;\n } else if (isBigNumber(value)) {\n return value.toNumber();\n } else {\n return defaultValue;\n }\n}","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';\nvar n1 = 'number';\nvar n2 = 'number, number';\nexport function absNumber(a) {\n return Math.abs(a);\n}\nabsNumber.signature = n1;\nexport function addNumber(a, b) {\n return a + b;\n}\naddNumber.signature = n2;\nexport function subtractNumber(a, b) {\n return a - b;\n}\nsubtractNumber.signature = n2;\nexport function multiplyNumber(a, b) {\n return a * b;\n}\nmultiplyNumber.signature = n2;\nexport function divideNumber(a, b) {\n return a / b;\n}\ndivideNumber.signature = n2;\nexport function unaryMinusNumber(x) {\n return -x;\n}\nunaryMinusNumber.signature = n1;\nexport function unaryPlusNumber(x) {\n return x;\n}\nunaryPlusNumber.signature = n1;\nexport function cbrtNumber(x) {\n return cbrt(x);\n}\ncbrtNumber.signature = n1;\nexport function cubeNumber(x) {\n return x * x * x;\n}\ncubeNumber.signature = n1;\nexport function expNumber(x) {\n return Math.exp(x);\n}\nexpNumber.signature = n1;\nexport function expm1Number(x) {\n return expm1(x);\n}\nexpm1Number.signature = n1;\n\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\nexport function gcdNumber(a, b) {\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function gcd must be integer numbers');\n }\n\n // https://en.wikipedia.org/wiki/Euclidean_algorithm\n var r;\n while (b !== 0) {\n r = a % b;\n a = b;\n b = r;\n }\n return a < 0 ? -a : a;\n}\ngcdNumber.signature = n2;\n\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\nexport function lcmNumber(a, b) {\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function lcm must be integer numbers');\n }\n if (a === 0 || b === 0) {\n return 0;\n }\n\n // https://en.wikipedia.org/wiki/Euclidean_algorithm\n // evaluate lcm here inline to reduce overhead\n var t;\n var prod = a * b;\n while (b !== 0) {\n t = b;\n b = a % t;\n a = t;\n }\n return Math.abs(prod / a);\n}\nlcmNumber.signature = n2;\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber(x, y) {\n if (y) {\n return Math.log(x) / Math.log(y);\n }\n return Math.log(x);\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number(x) {\n return log10(x);\n}\nlog10Number.signature = n1;\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number(x) {\n return log2(x);\n}\nlog2Number.signature = n1;\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber(x) {\n return log1p(x);\n}\nlog1pNumber.signature = n1;\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber(x, y) {\n // 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 y === 0 ? x : x - y * Math.floor(x / y);\n}\nmodNumber.signature = n2;\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nexport function nthRootNumber(a) {\n var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;\n var inv = root < 0;\n if (inv) {\n root = -root;\n }\n if (root === 0) {\n throw new Error('Root must be non-zero');\n }\n if (a < 0 && Math.abs(root) % 2 !== 1) {\n throw new Error('Root must be odd when a is negative.');\n }\n\n // edge cases zero and infinity\n if (a === 0) {\n return inv ? Infinity : 0;\n }\n if (!isFinite(a)) {\n return inv ? 0 : a;\n }\n var x = Math.pow(Math.abs(a), 1 / root);\n // If a < 0, we require that root is an odd integer,\n // so (-1) ^ (1/root) = -1\n x = a < 0 ? -x : x;\n return inv ? 1 / x : x;\n\n // Very nice algorithm, but fails with nthRoot(-2, 3).\n // Newton's method has some well-known problems at times:\n // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n /*\n let x = 1 // Initial guess\n let xPrev = 1\n let i = 0\n const iMax = 10000\n do {\n const delta = (a / Math.pow(x, root - 1) - x) / root\n xPrev = x\n x = x + delta\n i++\n }\n while (xPrev !== x && i < iMax)\n if (xPrev !== x) {\n throw new Error('Function nthRoot failed to converge')\n }\n return inv ? 1 / x : x\n */\n}\nexport function signNumber(x) {\n return sign(x);\n}\nsignNumber.signature = n1;\nexport function sqrtNumber(x) {\n return Math.sqrt(x);\n}\nsqrtNumber.signature = n1;\nexport function squareNumber(x) {\n return x * x;\n}\nsquareNumber.signature = n1;\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nexport function xgcdNumber(a, b) {\n // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n var t; // used to swap two variables\n var q; // quotient\n var r; // remainder\n var x = 0;\n var lastx = 1;\n var y = 1;\n var lasty = 0;\n if (!isInteger(a) || !isInteger(b)) {\n throw new Error('Parameters in function xgcd must be integer numbers');\n }\n while (b) {\n q = Math.floor(a / b);\n r = a - q * b;\n t = x;\n x = lastx - q * x;\n lastx = t;\n t = y;\n y = lasty - q * y;\n lasty = t;\n a = b;\n b = r;\n }\n var res;\n if (a < 0) {\n res = [-a, -lastx, -lasty];\n } else {\n res = [a, a ? lastx : 0, lasty];\n }\n return res;\n}\nxgcdNumber.signature = n2;\n\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\nexport function powNumber(x, y) {\n // x^Infinity === 0 if -1 < x < 1\n // A real number 0 is returned instead of complex(0)\n if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {\n return 0;\n }\n return Math.pow(x, y);\n}\npowNumber.signature = n2;\n\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\nexport function roundNumber(value) {\n var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');\n }\n return parseFloat(toFixed(value, decimals));\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber(x) {\n return Math.abs(x);\n}\nnormNumber.signature = n1;","/** @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 if (n === i) {\n return n;\n }\n var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer\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 if (!isInteger(k) || k < 0) {\n throw new TypeError('Positive integer value expected in function combinations');\n }\n if (k > n) {\n throw new TypeError('k must be less than or equal to n');\n }\n var nMinusk = n - k;\n var answer = 1;\n var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;\n var nextdivisor = 2;\n var lastdivisor = k < nMinusk ? k : nMinusk;\n // balance multiplications and divisions to try to keep intermediate values\n // in exact-integer range as long as possible\n for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {\n answer *= nextnumerator;\n while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {\n answer /= nextdivisor;\n ++nextdivisor;\n }\n }\n // for big n, k, floating point may have caused weirdness in remainder\n if (nextdivisor <= lastdivisor) {\n answer /= product(nextdivisor, lastdivisor);\n }\n return answer;\n}\ncombinationsNumber.signature = 'number, number';","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","/* eslint-disable no-loss-of-precision */\n\nimport { isInteger } from '../../utils/number.js';\nimport { product } from '../../utils/product.js';\nexport function gammaNumber(n) {\n var x;\n if (isInteger(n)) {\n if (n <= 0) {\n return Number.isFinite(n) ? Infinity : NaN;\n }\n if (n > 171) {\n return Infinity; // Will overflow\n }\n return product(1, n - 1);\n }\n if (n < 0.5) {\n return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));\n }\n if (n >= 171.35) {\n return Infinity; // will overflow\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 x = gammaP[0];\n for (var i = 1; i < gammaP.length; ++i) {\n x += gammaP[i] / (n + i);\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';\n\n// 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];\n\n// lgamma implementation ref: https://mrob.com/pub/ries/lanczos-gamma.html#code\n\n// log(2 * pi) / 2\nexport var lnSqrt2PI = 0.91893853320467274178;\nexport var lgammaG = 5; // Lanczos parameter \"g\"\nexport var lgammaN = 7; // Range of coefficients \"n\"\n\nexport var lgammaSeries = [1.000000000190015, 76.18009172947146, -86.50532032941677, 24.01409824083091, -1.231739572450155, 0.1208650973866179e-2, -0.5395239384953e-5];\nexport function lgammaNumber(n) {\n if (n < 0) return NaN;\n if (n === 0) return Infinity;\n if (!Number.isFinite(n)) return n;\n if (n < 0.5) {\n // Use Euler's reflection formula:\n // gamma(z) = PI / (sin(PI * z) * gamma(1 - z))\n return Math.log(Math.PI / Math.sin(Math.PI * n)) - lgammaNumber(1 - n);\n }\n\n // Compute the logarithm of the Gamma function using the Lanczos method\n\n n = n - 1;\n var base = n + lgammaG + 0.5; // Base of the Lanczos exponential\n var sum = lgammaSeries[0];\n\n // We start with the terms that have the smallest coefficients and largest denominator\n for (var i = lgammaN - 1; i >= 1; i--) {\n sum += lgammaSeries[i] / (n + i);\n }\n return lnSqrt2PI + (n + 0.5) * Math.log(base) - base + Math.log(sum);\n}\nlgammaNumber.signature = 'number';","import { pickShallow } from './object.js';\n\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n * const name = 'log'\n * const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n * export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n * // ... create the function log here and return it\n * }\n *\n * @param {string} name Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create Callback function called with an object with all dependencies\n * @param {Object} [meta]\n * Optional object with meta information that will be attached\n * to the created factory function as property `meta`. For explanation\n * of what meta properties can be specified and what they mean, see\n * docs/core/extension.md.\n * @returns {function}\n */\nexport function factory(name, dependencies, create, meta) {\n function assertAndCreate(scope) {\n // we only pass the requested dependencies to the factory function\n // to prevent functions to rely on dependencies that are not explicitly\n // requested.\n var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));\n assertDependencies(name, dependencies, scope);\n return create(deps);\n }\n assertAndCreate.isFactory = true;\n assertAndCreate.fn = name;\n assertAndCreate.dependencies = dependencies.slice().sort();\n if (meta) {\n assertAndCreate.meta = meta;\n }\n return assertAndCreate;\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nexport function sortFactories(factories) {\n var factoriesByName = {};\n factories.forEach(factory => {\n factoriesByName[factory.fn] = factory;\n });\n function containsDependency(factory, dependency) {\n // TODO: detect circular references\n if (isFactory(factory)) {\n if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n return true;\n }\n if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n return true;\n }\n }\n return false;\n }\n var sorted = [];\n function addFactory(factory) {\n var index = 0;\n while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n index++;\n }\n sorted.splice(index, 0, factory);\n }\n\n // sort regular factory functions\n factories.filter(isFactory).forEach(addFactory);\n\n // sort legacy factory functions AFTER the regular factory functions\n factories.filter(factory => !isFactory(factory)).forEach(addFactory);\n return sorted;\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create(factories) {\n var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n sortFactories(factories).forEach(factory => factory(scope));\n return scope;\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nexport function isFactory(obj) {\n return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nexport function assertDependencies(name, dependencies, scope) {\n var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n .every(dependency => scope[dependency] !== undefined);\n if (!allDefined) {\n var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);\n\n // TODO: create a custom error class for this, a MathjsError or something like that\n throw new Error(\"Cannot create function \\\"\".concat(name, \"\\\", \") + \"some dependencies are missing: \".concat(missingDependencies.map(d => \"\\\"\".concat(d, \"\\\"\")).join(', '), \".\"));\n }\n}\nexport function isOptionalDependency(dependency) {\n return dependency && dependency[0] === '?';\n}\nexport function stripOptionalNotation(dependency) {\n return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;\n}","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}","(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.typed = factory());\n})(this, (function () { 'use strict';\n\n function ok() {\n return true;\n }\n function notOk() {\n return false;\n }\n function undef() {\n return undefined;\n }\n const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n\n /**\n * @typedef {{\n * params: Param[],\n * fn: function,\n * test: function,\n * implementation: function\n * }} Signature\n *\n * @typedef {{\n * types: Type[],\n * hasAny: boolean,\n * hasConversion: boolean,\n * restParam: boolean\n * }} Param\n *\n * @typedef {{\n * name: string,\n * typeIndex: number,\n * test: function,\n * isAny: boolean,\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 * isAny?: boolean\n * }} TypeDef\n */\n\n /**\n * @returns {() => function}\n */\n function create() {\n // data type tests\n\n /**\n * Returns true if the argument is a non-null \"plain\" object\n */\n function isPlainObject(x) {\n return typeof x === 'object' && x !== null && x.constructor === Object;\n }\n const _types = [{\n name: 'number',\n test: function (x) {\n return typeof x === 'number';\n }\n }, {\n name: 'string',\n test: function (x) {\n return typeof x === 'string';\n }\n }, {\n name: 'boolean',\n test: function (x) {\n return typeof x === 'boolean';\n }\n }, {\n name: 'Function',\n test: function (x) {\n return typeof x === 'function';\n }\n }, {\n name: 'Array',\n test: Array.isArray\n }, {\n name: 'Date',\n test: function (x) {\n return x instanceof Date;\n }\n }, {\n name: 'RegExp',\n test: function (x) {\n return x instanceof RegExp;\n }\n }, {\n name: 'Object',\n test: isPlainObject\n }, {\n name: 'null',\n test: function (x) {\n return x === null;\n }\n }, {\n name: 'undefined',\n test: function (x) {\n return x === undefined;\n }\n }];\n const anyType = {\n name: 'any',\n test: ok,\n isAny: true\n };\n\n // Data structures to track the types. As these are local variables in\n // create(), each typed universe will get its own copy, but the variables\n // will only be accessible through the (closures of the) functions supplied\n // as properties of the typed object, not directly.\n // These will be initialized in clear() below\n let typeMap; // primary store of all types\n let typeList; // Array of just type names, for the sake of ordering\n\n // And similar data structures for the type conversions:\n let nConversions = 0;\n // the actual conversions are stored on a property of the destination types\n\n // This is a temporary object, will be replaced with a function at the end\n let typed = {\n createCount: 0\n };\n\n /**\n * Takes a type name and returns the corresponding official type object\n * for that type.\n *\n * @param {string} typeName\n * @returns {TypeDef} type\n */\n function findType(typeName) {\n const type = typeMap.get(typeName);\n if (type) {\n return type;\n }\n // Remainder is error handling\n let message = 'Unknown type \"' + typeName + '\"';\n const name = typeName.toLowerCase();\n let otherName;\n for (otherName of typeList) {\n if (otherName.toLowerCase() === name) {\n message += '. Did you mean \"' + otherName + '\" ?';\n break;\n }\n }\n throw new TypeError(message);\n }\n\n /**\n * Adds an array `types` of type definitions to this typed instance.\n * Each type definition should be an object with properties:\n * 'name' - a string giving the name of the type; 'test' - function\n * returning a boolean that tests membership in the type; and optionally\n * 'isAny' - true only for the 'any' type.\n *\n * The second optional argument, `before`, gives the name of a type that\n * these types should be added before. The new types are added in the\n * order specified.\n * @param {TypeDef[]} types\n * @param {string | boolean} [beforeSpec='any'] before\n */\n function addTypes(types) {\n let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n const newTypes = [];\n for (let i = 0; i < types.length; ++i) {\n if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n throw new TypeError('Object with properties {name: string, test: function} expected');\n }\n const typeName = types[i].name;\n if (typeMap.has(typeName)) {\n throw new TypeError('Duplicate type name \"' + typeName + '\"');\n }\n newTypes.push(typeName);\n typeMap.set(typeName, {\n name: typeName,\n test: types[i].test,\n isAny: types[i].isAny,\n index: beforeIndex + i,\n conversionsTo: [] // Newly added type can't have any conversions to it\n });\n }\n // update the typeList\n const affectedTypes = typeList.slice(beforeIndex);\n typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);\n // Fix the indices\n for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n typeMap.get(typeList[i]).index = i;\n }\n }\n\n /**\n * Removes all types and conversions from this typed instance.\n * May cause previously constructed typed-functions to throw\n * strange errors when they are called with types that do not\n * match any of their signatures.\n */\n function clear() {\n typeMap = new Map();\n typeList = [];\n nConversions = 0;\n addTypes([anyType], false);\n }\n\n // initialize the types to the default list\n clear();\n addTypes(_types);\n\n /**\n * Removes all conversions, leaving the types alone.\n */\n function clearConversions() {\n let typeName;\n for (typeName of typeList) {\n typeMap.get(typeName).conversionsTo = [];\n }\n nConversions = 0;\n }\n\n /**\n * Find the type names that match a value.\n * @param {*} value\n * @return {string[]} Array of names of types for which\n * the type test matches the value.\n */\n function findTypeNames(value) {\n const matches = typeList.filter(name => {\n const type = typeMap.get(name);\n return !type.isAny && type.test(value);\n });\n if (matches.length) {\n return matches;\n }\n return ['any'];\n }\n\n /**\n * Check if an entity is a typed function created by any instance\n * @param {any} entity\n * @returns {boolean}\n */\n function isTypedFunction(entity) {\n return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n }\n\n /**\n * Find a specific signature from a (composed) typed function, for example:\n *\n * typed.findSignature(fn, ['number', 'string'])\n * typed.findSignature(fn, 'number, string')\n * typed.findSignature(fn, 'number,string', {exact: true})\n *\n * This function findSignature will by default return the best match to\n * the given signature, possibly employing type conversions.\n *\n * The (optional) third argument is a plain object giving options\n * controlling the signature search. Currently the only implemented\n * option is `exact`: if specified as true (default is false), only\n * exact matches will be returned (i.e. signatures for which `fn` was\n * directly defined). Note that a (possibly different) type matching\n * `any`, or one or more instances of TYPE matching `...TYPE` are\n * considered exact matches in this regard, as no conversions are used.\n *\n * This function returns a \"signature\" object, as does `typed.resolve()`,\n * which is a plain object with four keys: `params` (the array of parameters\n * for this signature), `fn` (the originally supplied function for this\n * signature), `test` (a generated function that determines if an argument\n * list matches this signature, and `implementation` (the function to call\n * on a matching argument list, that performs conversions if necessary and\n * then calls the originally supplied function).\n *\n * @param {Function} fn A typed-function\n * @param {string | string[]} signature\n * Signature to be found, can be an array or a comma separated string.\n * @param {object} options Controls the signature search as documented\n * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n * Returns the matching signature, or throws an error when no signature\n * is found.\n */\n function findSignature(fn, signature, options) {\n if (!isTypedFunction(fn)) {\n throw new TypeError(NOT_TYPED_FUNCTION);\n }\n\n // Canonicalize input\n const exact = options && options.exact;\n const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n const params = parseSignature(stringSignature);\n const canonicalSignature = stringifyParams(params);\n\n // First hope we get lucky and exactly match a signature\n if (!exact || canonicalSignature in fn.signatures) {\n // OK, we can check the internal signatures\n const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n if (match) {\n return match;\n }\n }\n\n // Oh well, we did not; so we have to go back and check the parameters\n // one by one, in order to catch things like `any` and rest params.\n // Note here we can assume there is at least one parameter, because\n // the empty signature would have matched successfully above.\n const nParams = params.length;\n let remainingSignatures;\n if (exact) {\n remainingSignatures = [];\n let name;\n for (name in fn.signatures) {\n remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n }\n } else {\n remainingSignatures = fn._typedFunctionData.signatures;\n }\n for (let i = 0; i < nParams; ++i) {\n const want = params[i];\n const filteredSignatures = [];\n let possibility;\n for (possibility of remainingSignatures) {\n const have = getParamAtIndex(possibility.params, i);\n if (!have || want.restParam && !have.restParam) {\n continue;\n }\n if (!have.hasAny) {\n // have to check all of the wanted types are available\n const haveTypes = paramTypeSet(have);\n if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n continue;\n }\n }\n // OK, this looks good\n filteredSignatures.push(possibility);\n }\n remainingSignatures = filteredSignatures;\n if (remainingSignatures.length === 0) break;\n }\n // Return the first remaining signature that was totally matched:\n let candidate;\n for (candidate of remainingSignatures) {\n if (candidate.params.length <= nParams) {\n return candidate;\n }\n }\n throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n }\n\n /**\n * Find the proper function to call for a specific signature from\n * a (composed) typed function, for example:\n *\n * typed.find(fn, ['number', 'string'])\n * typed.find(fn, 'number, string')\n * typed.find(fn, 'number,string', {exact: true})\n *\n * This function find will by default return the best match to\n * the given signature, possibly employing type conversions (and returning\n * a function that will perform those conversions as needed). The\n * (optional) third argument is a plain object giving options contolling\n * the signature search. Currently only the option `exact` is implemented,\n * which defaults to \"false\". If `exact` is specified as true, then only\n * exact matches will be returned (i.e. signatures for which `fn` was\n * directly defined). Uses of `any` and `...TYPE` are considered exact if\n * no conversions are necessary to apply the corresponding function.\n *\n * @param {Function} fn A typed-function\n * @param {string | string[]} signature\n * Signature to be found, can be an array or a comma separated string.\n * @param {object} options Controls the signature match as documented\n * @return {function}\n * Returns the function to call for the given signature, or throws an\n * error if no match is found.\n */\n function find(fn, signature, options) {\n return findSignature(fn, signature, options).implementation;\n }\n\n /**\n * Convert a given value to another data type, specified by type name.\n *\n * @param {*} value\n * @param {string} typeName\n */\n function convert(value, typeName) {\n // check conversion is needed\n const type = findType(typeName);\n if (type.test(value)) {\n return value;\n }\n const conversions = type.conversionsTo;\n if (conversions.length === 0) {\n throw new Error('There are no conversions to ' + typeName + ' defined.');\n }\n for (let i = 0; i < conversions.length; i++) {\n const fromType = findType(conversions[i].from);\n if (fromType.test(value)) {\n return conversions[i].convert(value);\n }\n }\n throw new Error('Cannot convert ' + value + ' to ' + typeName);\n }\n\n /**\n * Stringify parameters in a normalized way\n * @param {Param[]} params\n * @param {string} [','] separator\n * @return {string}\n */\n function stringifyParams(params) {\n let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n return params.map(p => p.name).join(separator);\n }\n\n /**\n * Parse a parameter, like \"...number | boolean\"\n * @param {string} param\n * @return {Param} param\n */\n function parseParam(param) {\n const restParam = param.indexOf('...') === 0;\n const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n const typeDefs = types.split('|').map(s => findType(s.trim()));\n let hasAny = false;\n let paramName = restParam ? '...' : '';\n const exactTypes = typeDefs.map(function (type) {\n hasAny = type.isAny || hasAny;\n paramName += type.name + '|';\n return {\n name: type.name,\n typeIndex: type.index,\n test: type.test,\n isAny: type.isAny,\n conversion: null,\n conversionIndex: -1\n };\n });\n return {\n types: exactTypes,\n name: paramName.slice(0, -1),\n // remove trailing '|' from above\n hasAny,\n hasConversion: false,\n restParam\n };\n }\n\n /**\n * Expands a parsed parameter with the types available from currently\n * defined conversions.\n * @param {Param} param\n * @return {Param} param\n */\n function expandParam(param) {\n const typeNames = param.types.map(t => t.name);\n const matchingConversions = availableConversions(typeNames);\n let hasAny = param.hasAny;\n let newName = param.name;\n const convertibleTypes = matchingConversions.map(function (conversion) {\n const type = findType(conversion.from);\n hasAny = type.isAny || hasAny;\n newName += '|' + conversion.from;\n return {\n name: conversion.from,\n typeIndex: type.index,\n test: type.test,\n isAny: type.isAny,\n conversion,\n conversionIndex: conversion.index\n };\n });\n return {\n types: param.types.concat(convertibleTypes),\n name: newName,\n hasAny,\n hasConversion: convertibleTypes.length > 0,\n restParam: param.restParam\n };\n }\n\n /**\n * Return the set of type names in a parameter.\n * Caches the result for efficiency\n *\n * @param {Param} param\n * @return {Set} typenames\n */\n function paramTypeSet(param) {\n if (!param.typeSet) {\n param.typeSet = new Set();\n param.types.forEach(type => param.typeSet.add(type.name));\n }\n return param.typeSet;\n }\n\n /**\n * Parse a signature with comma separated parameters,\n * like \"number | boolean, ...string\"\n *\n * @param {string} signature\n * @return {Param[]} params\n */\n function parseSignature(rawSignature) {\n const params = [];\n if (typeof rawSignature !== 'string') {\n throw new TypeError('Signatures must be strings');\n }\n const signature = rawSignature.trim();\n if (signature === '') {\n return params;\n }\n const rawParams = signature.split(',');\n for (let i = 0; i < rawParams.length; ++i) {\n const parsedParam = parseParam(rawParams[i].trim());\n if (parsedParam.restParam && i !== rawParams.length - 1) {\n throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n }\n // if invalid, short-circuit (all the types may have been filtered)\n if (parsedParam.types.length === 0) {\n return null;\n }\n params.push(parsedParam);\n }\n return params;\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 const param = last(params);\n return param ? param.restParam : false;\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 } else if (param.types.length === 1) {\n return findType(param.types[0].name).test;\n } else if (param.types.length === 2) {\n const test0 = findType(param.types[0].name).test;\n const test1 = findType(param.types[1].name).test;\n return function or(x) {\n return test0(x) || test1(x);\n };\n } else {\n // param.types.length > 2\n const tests = param.types.map(function (type) {\n return findType(type.name).test;\n });\n return function or(x) {\n for (let 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 let tests, test0, test1;\n if (hasRestParam(params)) {\n // variable arguments like '...number'\n tests = initial(params).map(compileTest);\n const varIndex = tests.length;\n const lastTest = compileTest(last(params));\n const testRestParam = function (args) {\n for (let i = varIndex; i < args.length; i++) {\n if (!lastTest(args[i])) {\n return false;\n }\n }\n return true;\n };\n return function testArgs(args) {\n for (let 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 } else {\n // no variable arguments\n if (params.length === 0) {\n return function testArgs(args) {\n return args.length === 0;\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 } 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 } else {\n // arguments.length > 2\n tests = params.map(compileTest);\n return function testArgs(args) {\n for (let 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 Params list.\n * Handles rest parameters.\n * @param {Param[]} params\n * @param {number} index\n * @return {Param | null} Returns the matching parameter when found,\n * null otherwise.\n */\n function getParamAtIndex(params, index) {\n return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n }\n\n /**\n * Get all type names of a parameter\n * @param {Params[]} params\n * @param {number} index\n * @return {string[]} Returns an array with type names\n */\n function getTypeSetAtIndex(params, index) {\n const param = getParamAtIndex(params, index);\n if (!param) {\n return new Set();\n }\n return paramTypeSet(param);\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 const typeSet = new Set();\n signatures.forEach(signature => {\n const paramSet = getTypeSetAtIndex(signature.params, index);\n let name;\n for (name of paramSet) {\n typeSet.add(name);\n }\n });\n return typeSet.has('any') ? ['any'] : Array.from(typeSet);\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 let err, expected;\n const _name = name || 'unnamed';\n\n // test for wrong type at some index\n let matchingSignatures = signatures;\n let index;\n for (index = 0; index < args.length; index++) {\n const nextMatchingDefs = [];\n matchingSignatures.forEach(signature => {\n const param = getParamAtIndex(signature.params, index);\n const test = compileTest(param);\n if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n nextMatchingDefs.push(signature);\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 const actualTypes = findTypeNames(args[index]);\n err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n err.data = {\n category: 'wrongType',\n fn: _name,\n index,\n actual: actualTypes,\n expected\n };\n return err;\n }\n } else {\n matchingSignatures = nextMatchingDefs;\n }\n }\n\n // test for too few arguments\n const 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 + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n err.data = {\n category: 'tooFewArgs',\n fn: _name,\n index: args.length,\n expected\n };\n return err;\n }\n\n // test for too many arguments\n const maxLength = Math.max.apply(null, lengths);\n if (args.length > maxLength) {\n err = new TypeError('Too many arguments in function ' + _name + ' (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 // Generic error\n const argTypes = [];\n for (let i = 0; i < args.length; ++i) {\n argTypes.push(findTypeNames(args[i]).join('|'));\n }\n err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n err.data = {\n category: 'mismatch',\n actual: argTypes\n };\n return err;\n }\n\n /**\n * Find the lowest index of all types of a parameter\n * @param {Param} param\n * @return {number} Returns the index of the lowest type in typed.types\n */\n function getLowestTypeIndex(param) {\n let min = typeList.length + 1;\n for (let i = 0; i < param.types.length; i++) {\n min = Math.min(min, param.types[i].typeIndex);\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 let min = nConversions + 1;\n for (let 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 return min;\n }\n\n /**\n * Compare two params. The return value is a number that is\n * negative when param1 should be considered first, positive\n * when param2 should be considered first, and zero when the\n * params are indistinguishable. Primarily as a debugging aid,\n * the value is always less than one in absolute value, and\n * a smaller absolute value indicates a less important distinction\n * between the parameters.\n * @param {Param} param1\n * @param {Param} param2\n * @return {number} negative, positive, or zero depending on whether\n * param1 should be ordered before, after, or equivalently\n * to param2\n */\n function compareParams(param1, param2) {\n // We compare a number of metrics on a param in turn:\n // 1) 'any' parameters are the least preferred\n if (param1.hasAny) {\n if (!param2.hasAny) {\n return 0.1;\n }\n } else if (param2.hasAny) {\n return -0.1;\n }\n\n // 2) Prefer non-rest to rest parameters\n if (param1.restParam) {\n if (!param2.restParam) {\n return 0.01;\n }\n } else if (param2.restParam) {\n return -0.01;\n }\n\n // 3) Prefer lower type index:\n const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n if (typeDiff < 0) {\n return -1e-3;\n }\n if (typeDiff > 0) {\n return 0.001;\n }\n\n // 4) Prefer exact type match to conversions, with a strength that\n // grows with the conversion index\n const conv1 = getLowestConversionIndex(param1);\n const conv2 = getLowestConversionIndex(param2);\n if (param1.hasConversion) {\n if (!param2.hasConversion) {\n return (1 + conv1) * 0.000001;\n }\n } else if (param2.hasConversion) {\n return -(1 + conv2) * 0.000001;\n }\n\n // 5) Prefer lower conversion index\n const convDiff = conv1 - conv2;\n if (convDiff < 0) {\n return -1e-7;\n }\n if (convDiff > 0) {\n return 0.0000001;\n }\n\n // Don't have a basis for preference\n return 0;\n }\n\n /**\n * Compare two signatures. The result is a number that is negative\n * when the first signature should be preferred to the second, positive\n * when the second signature should be preferred, and zero in case the\n * two signatures are essentially equivalent. Primarily as a debugging\n * aid, a larger absolute value indicates a more \"important\" difference.\n *\n * @param {Signature} signature1\n * @param {Signature} signature2\n * @return {number} returns a negative number when signature1 must get a\n * lower index than signature2, a positive number when the\n * opposite holds, or zero when both are equivalent.\n */\n function compareSignatures(signature1, signature2) {\n const pars1 = signature1.params;\n const pars2 = signature2.params;\n const last1 = last(pars1);\n const last2 = last(pars2);\n const hasRest1 = hasRestParam(pars1);\n const hasRest2 = hasRestParam(pars2);\n // We compare a number of metrics on signatures in turn:\n // 1) An \"any rest param\" is least preferred\n if (hasRest1 && last1.hasAny) {\n if (!hasRest2 || !last2.hasAny) {\n return 10000000;\n }\n } else if (hasRest2 && last2.hasAny) {\n return -1e7;\n }\n\n // 2) Minimize the number of 'any' parameters\n let any1 = 0;\n let conv1 = 0;\n let par;\n for (par of pars1) {\n if (par.hasAny) ++any1;\n if (par.hasConversion) ++conv1;\n }\n let any2 = 0;\n let conv2 = 0;\n for (par of pars2) {\n if (par.hasAny) ++any2;\n if (par.hasConversion) ++conv2;\n }\n if (any1 !== any2) {\n return (any1 - any2) * 1000000;\n }\n\n // 3) A conversion rest param is less preferred\n if (hasRest1 && last1.hasConversion) {\n if (!hasRest2 || !last2.hasConversion) {\n return 100000;\n }\n } else if (hasRest2 && last2.hasConversion) {\n return -1e5;\n }\n\n // 4) Minimize the number of conversions\n if (conv1 !== conv2) {\n return (conv1 - conv2) * 10000;\n }\n\n // 5) Prefer no rest param\n if (hasRest1) {\n if (!hasRest2) {\n return 1000;\n }\n } else if (hasRest2) {\n return -1e3;\n }\n\n // 6) Prefer shorter with rest param, longer without\n const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);\n if (lengthCriterion !== 0) {\n return lengthCriterion;\n }\n\n // Signatures are identical in each of the above metrics.\n // In particular, they are the same length.\n // We can therefore compare the parameters one by one.\n // First we count which signature has more preferred parameters.\n const comparisons = [];\n let tc = 0;\n for (let i = 0; i < pars1.length; ++i) {\n const thisComparison = compareParams(pars1[i], pars2[i]);\n comparisons.push(thisComparison);\n tc += thisComparison;\n }\n if (tc !== 0) {\n return (tc < 0 ? -10 : 10) + tc;\n }\n\n // They have the same number of preferred parameters, so go by the\n // earliest parameter in which we have a preference.\n // In other words, dispatch is driven somewhat more by earlier\n // parameters than later ones.\n let c;\n let bonus = 9;\n const decrement = bonus / (comparisons.length + 1);\n for (c of comparisons) {\n if (c !== 0) {\n return (c < 0 ? -bonus : bonus) + c;\n }\n bonus -= decrement;\n }\n\n // It's a tossup:\n return 0;\n }\n\n /**\n * Produce a list of all conversions from distinct types to one of\n * the given types.\n *\n * @param {string[]} typeNames\n * @return {ConversionDef[]} Returns the conversions that are available\n * resulting in any given type (if any)\n */\n function availableConversions(typeNames) {\n if (typeNames.length === 0) {\n return [];\n }\n const types = typeNames.map(findType);\n if (typeNames.length === 1) return types[0].conversionsTo;\n\n // Here, for each type that occurs as the from-type of any conversion\n // to any of the types found, we must select the conversion of\n // lowest index from that type. So first collect the types.\n const knownTypes = new Set(typeNames);\n const convertibleTypes = new Set();\n for (let i = 0; i < types.length; ++i) {\n for (const match of types[i].conversionsTo) {\n if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);\n }\n }\n\n // Now get the lowest-index conversion for each type\n const matches = [];\n for (const typeName of convertibleTypes) {\n let bestIndex = nConversions + 1;\n let bestConversion = null;\n for (let i = 0; i < types.length; ++i) {\n for (const match of types[i].conversionsTo) {\n if (match.from === typeName && match.index < bestIndex) {\n bestIndex = match.index;\n bestConversion = match;\n }\n }\n }\n matches.push(bestConversion);\n }\n return matches;\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 fn or a wrapped function if needed. If it\n * has conversions, the function will be named to indicate\n * what conversions are occurring.\n */\n function compileArgsPreprocessing(params, fn) {\n let fnConvert = fn;\n\n // TODO: can we make this wrapper function smarter/simpler?\n\n let name = '';\n if (params.some(p => p.hasConversion)) {\n const restParam = hasRestParam(params);\n const compiledConversions = params.map(compileArgConversion);\n name = compiledConversions.map(conv => conv.name).join(';');\n fnConvert = function convertArgs() {\n const args = [];\n const last = restParam ? arguments.length - 1 : arguments.length;\n for (let 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 return fn.apply(this, args);\n };\n }\n let fnPreprocess = fnConvert;\n if (hasRestParam(params)) {\n const offset = params.length - 1;\n fnPreprocess = function preprocessRestParams() {\n return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n };\n }\n if (name) Object.defineProperty(fnPreprocess, 'name', {\n value: name\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 let test0, test1, conversion0, conversion1;\n const tests = [];\n const conversions = [];\n let name = '';\n param.types.forEach(function (type) {\n if (type.conversion) {\n name += type.conversion.from + '~>' + type.conversion.to + ',';\n tests.push(findType(type.conversion.from).test);\n conversions.push(type.conversion.convert);\n }\n });\n if (name) name = name.slice(0, -1);else name = 'pass';\n\n // create optimized conversion functions depending on the number of conversions\n let convertor = arg => arg;\n switch (conversions.length) {\n case 0:\n break;\n case 1:\n test0 = tests[0];\n conversion0 = conversions[0];\n convertor = function convertArg(arg) {\n if (test0(arg)) {\n return conversion0(arg);\n }\n return arg;\n };\n break;\n case 2:\n test0 = tests[0];\n test1 = tests[1];\n conversion0 = conversions[0];\n conversion1 = conversions[1];\n convertor = 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 break;\n default:\n convertor = function convertArg(arg) {\n for (let i = 0; i < conversions.length; i++) {\n if (tests[i](arg)) {\n return conversions[i](arg);\n }\n }\n return arg;\n };\n }\n Object.defineProperty(convertor, 'name', {\n value: name\n });\n return convertor;\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 * @return {Param[]}\n */\n function splitParams(params) {\n function _splitParams(params, index, paramsSoFar) {\n if (index < params.length) {\n const param = params[index];\n let resultingParams = [];\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 const exactTypes = param.types.filter(isExactType);\n if (exactTypes.length < param.types.length) {\n resultingParams.push({\n types: exactTypes,\n name: '...' + exactTypes.map(t => t.name).join('|'),\n hasAny: exactTypes.some(t => t.isAny),\n hasConversion: false,\n restParam: true\n });\n }\n resultingParams.push(param);\n } else {\n // split all the types of a regular parameter into one type per param\n resultingParams = param.types.map(function (type) {\n return {\n types: [type],\n name: type.name,\n hasAny: type.isAny,\n hasConversion: type.conversion,\n restParam: false\n };\n });\n }\n\n // recurse over the groups with types\n return flatMap(resultingParams, function (nextParam) {\n return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n });\n } else {\n // we've reached the end of the parameters.\n return [paramsSoFar];\n }\n }\n return _splitParams(params, 0, []);\n }\n\n /**\n * Test whether two param lists represent conflicting signatures\n * @param {Param[]} params1\n * @param {Param[]} params2\n * @return {boolean} Returns true when the signatures conflict, false otherwise.\n */\n function conflicting(params1, params2) {\n const ii = Math.max(params1.length, params2.length);\n for (let i = 0; i < ii; i++) {\n const typeSet1 = getTypeSetAtIndex(params1, i);\n const typeSet2 = getTypeSetAtIndex(params2, i);\n let overlap = false;\n let name;\n for (name of typeSet2) {\n if (typeSet1.has(name)) {\n overlap = true;\n break;\n }\n }\n if (!overlap) {\n return false;\n }\n }\n const len1 = params1.length;\n const len2 = params2.length;\n const restParam1 = hasRestParam(params1);\n const restParam2 = hasRestParam(params2);\n return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n }\n\n /**\n * Helper function for `resolveReferences` that returns a copy of\n * functionList wihe any prior resolutions cleared out, in case we are\n * recycling signatures from a prior typed function construction.\n *\n * @param {Array.} functionList\n * @return {Array.}\n */\n function clearResolutions(functionList) {\n return functionList.map(fn => {\n if (isReferToSelf(fn)) {\n return referToSelf(fn.referToSelf.callback);\n }\n if (isReferTo(fn)) {\n return makeReferTo(fn.referTo.references, fn.referTo.callback);\n }\n return fn;\n });\n }\n\n /**\n * Take a list of references, a list of functions functionList, and a\n * signatureMap indexing signatures into functionList, and return\n * the list of resolutions, or a false-y value if they don't all\n * resolve in a valid way (yet).\n *\n * @param {string[]} references\n * @param {Array} signatureMap\n * @return {function[] | false} resolutions\n */\n function collectResolutions(references, functionList, signatureMap) {\n const resolvedReferences = [];\n let reference;\n for (reference of references) {\n let resolution = signatureMap[reference];\n if (typeof resolution !== 'number') {\n throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n }\n resolution = functionList[resolution];\n if (typeof resolution !== 'function') {\n return false;\n }\n resolvedReferences.push(resolution);\n }\n return resolvedReferences;\n }\n\n /**\n * Resolve any references in the functionList for the typed function\n * itself. The signatureMap tells which index in the functionList a\n * given signature should be mapped to (for use in resolving typed.referTo)\n * and self provides the destions of a typed.referToSelf.\n *\n * @param {Array} functionList\n * @param {Object.} signatureMap\n * @param {function} self The typed-function itself\n * @return {Array} The list of resolved functions\n */\n function resolveReferences(functionList, signatureMap, self) {\n const resolvedFunctions = clearResolutions(functionList);\n const isResolved = new Array(resolvedFunctions.length).fill(false);\n let leftUnresolved = true;\n while (leftUnresolved) {\n leftUnresolved = false;\n let nothingResolved = true;\n for (let i = 0; i < resolvedFunctions.length; ++i) {\n if (isResolved[i]) continue;\n const fn = resolvedFunctions[i];\n if (isReferToSelf(fn)) {\n resolvedFunctions[i] = fn.referToSelf.callback(self);\n // Preserve reference in case signature is reused someday:\n resolvedFunctions[i].referToSelf = fn.referToSelf;\n isResolved[i] = true;\n nothingResolved = false;\n } else if (isReferTo(fn)) {\n const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n if (resolvedReferences) {\n resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);\n // Preserve reference in case signature is reused someday:\n resolvedFunctions[i].referTo = fn.referTo;\n isResolved[i] = true;\n nothingResolved = false;\n } else {\n leftUnresolved = true;\n }\n }\n }\n if (nothingResolved && leftUnresolved) {\n throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n }\n }\n return resolvedFunctions;\n }\n\n /**\n * Validate whether any of the function bodies contains a self-reference\n * usage like `this(...)` or `this.signatures`. This self-referencing is\n * deprecated since typed-function v3. It has been replaced with\n * the functions typed.referTo and typed.referToSelf.\n * @param {Object.} signaturesMap\n */\n function validateDeprecatedThis(signaturesMap) {\n // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n // match occurrences like 'this(' and 'this.signatures'\n const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n Object.keys(signaturesMap).forEach(signature => {\n const fn = signaturesMap[signature];\n if (deprecatedThisRegex.test(fn.toString())) {\n throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n }\n });\n }\n\n /**\n * Create a typed function\n * @param {String} name The name for the typed function\n * @param {Object.} rawSignaturesMap\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, rawSignaturesMap) {\n typed.createCount++;\n if (Object.keys(rawSignaturesMap).length === 0) {\n throw new SyntaxError('No signatures provided');\n }\n if (typed.warnAgainstDeprecatedThis) {\n validateDeprecatedThis(rawSignaturesMap);\n }\n\n // Main processing loop for signatures\n const parsedParams = [];\n const originalFunctions = [];\n const signaturesMap = {};\n const preliminarySignatures = []; // may have duplicates from conversions\n let signature;\n for (signature in rawSignaturesMap) {\n // A) Protect against polluted Object prototype:\n if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n continue;\n }\n // B) Parse the signature\n const params = parseSignature(signature);\n if (!params) continue;\n // C) Check for conflicts\n parsedParams.forEach(function (pp) {\n if (conflicting(pp, params)) {\n throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n }\n });\n parsedParams.push(params);\n // D) Store the provided function and add conversions\n const functionIndex = originalFunctions.length;\n originalFunctions.push(rawSignaturesMap[signature]);\n const conversionParams = params.map(expandParam);\n // E) Split the signatures and collect them up\n let sp;\n for (sp of splitParams(conversionParams)) {\n const spName = stringifyParams(sp);\n preliminarySignatures.push({\n params: sp,\n name: spName,\n fn: functionIndex\n });\n if (sp.every(p => !p.hasConversion)) {\n signaturesMap[spName] = functionIndex;\n }\n }\n }\n preliminarySignatures.sort(compareSignatures);\n\n // Note the forward reference to theTypedFn\n const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);\n\n // Fill in the proper function for each signature\n let s;\n for (s in signaturesMap) {\n if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n }\n }\n const signatures = [];\n const internalSignatureMap = new Map(); // benchmarks faster than object\n for (s of preliminarySignatures) {\n // Note it's only safe to eliminate duplicates like this\n // _after_ the signature sorting step above; otherwise we might\n // remove the wrong one.\n if (!internalSignatureMap.has(s.name)) {\n s.fn = resolvedFunctions[s.fn];\n signatures.push(s);\n internalSignatureMap.set(s.name, s);\n }\n }\n\n // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n // compile the tests\n for (let i = 0; i < signatures.length; ++i) {\n signatures[i].test = compileTests(signatures[i].params);\n }\n const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n // compile the functions\n for (let i = 0; i < signatures.length; ++i) {\n signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n }\n const fn0 = ok0 ? signatures[0].implementation : undef;\n const fn1 = ok1 ? signatures[1].implementation : undef;\n const fn2 = ok2 ? signatures[2].implementation : undef;\n const fn3 = ok3 ? signatures[3].implementation : undef;\n const fn4 = ok4 ? signatures[4].implementation : undef;\n const fn5 = ok5 ? signatures[5].implementation : undef;\n const len0 = ok0 ? signatures[0].params.length : -1;\n const len1 = ok1 ? signatures[1].params.length : -1;\n const len2 = ok2 ? signatures[2].params.length : -1;\n const len3 = ok3 ? signatures[3].params.length : -1;\n const len4 = ok4 ? signatures[4].params.length : -1;\n const len5 = ok5 ? signatures[5].params.length : -1;\n\n // simple and generic, but also slow\n const iStart = allOk ? 6 : 0;\n const iEnd = signatures.length;\n // de-reference ahead for execution speed:\n const tests = signatures.map(s => s.test);\n const fns = signatures.map(s => s.implementation);\n const generic = function generic() {\n\n for (let i = iStart; i < iEnd; i++) {\n if (tests[i](arguments)) {\n return fns[i].apply(this, arguments);\n }\n }\n return typed.onMismatch(name, arguments, signatures);\n };\n\n // create the typed function\n // fast, specialized version. Falls back to the slower, generic one if needed\n function theTypedFn(arg0, arg1) {\n\n if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n return fn0.apply(this, arguments);\n }\n if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n return fn1.apply(this, arguments);\n }\n if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n return fn2.apply(this, arguments);\n }\n if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n return fn3.apply(this, arguments);\n }\n if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n return fn4.apply(this, arguments);\n }\n if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n return fn5.apply(this, arguments);\n }\n return generic.apply(this, arguments);\n }\n\n // attach name the typed function\n try {\n Object.defineProperty(theTypedFn, 'name', {\n 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 // This property is close to the original collection of signatures\n // used to create the typed-function, just with unions split:\n theTypedFn.signatures = signaturesMap;\n\n // Store internal data for functions like resolve, find, etc.\n // Also serves as the flag that this is a typed-function\n theTypedFn._typedFunctionData = {\n signatures,\n signatureMap: internalSignatureMap\n };\n return theTypedFn;\n }\n\n /**\n * Action to take on mismatch\n * @param {string} name Name of function that was attempted to be called\n * @param {Array} args Actual arguments to the call\n * @param {Array} signatures Known signatures of the named typed-function\n */\n function _onMismatch(name, args, signatures) {\n throw createError(name, args, signatures);\n }\n\n /**\n * Return all but the last items of an array or function Arguments\n * @param {Array | Arguments} arr\n * @return {Array}\n */\n function initial(arr) {\n return slice(arr, 0, arr.length - 1);\n }\n\n /**\n * return the last item of an array or function Arguments\n * @param {Array | Arguments} 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 * 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 (let i = 0; i < arr.length; i++) {\n if (test(arr[i])) {\n return arr[i];\n }\n }\n return undefined;\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 * Create a reference callback to one or multiple signatures\n *\n * Syntax:\n *\n * typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n * // ...\n * })\n *\n * @returns {{referTo: {references: string[], callback}}}\n */\n function referTo() {\n const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n const callback = last(arguments);\n if (typeof callback !== 'function') {\n throw new TypeError('Callback function expected as last argument');\n }\n return makeReferTo(references, callback);\n }\n function makeReferTo(references, callback) {\n return {\n referTo: {\n references,\n callback\n }\n };\n }\n\n /**\n * Create a reference callback to the typed-function itself\n *\n * @param {(self: function) => function} callback\n * @returns {{referToSelf: { callback: function }}}\n */\n function referToSelf(callback) {\n if (typeof callback !== 'function') {\n throw new TypeError('Callback function expected as first argument');\n }\n return {\n referToSelf: {\n callback\n }\n };\n }\n\n /**\n * Test whether something is a referTo object, holding a list with reference\n * signatures and a callback.\n *\n * @param {Object | function} objectOrFn\n * @returns {boolean}\n */\n function isReferTo(objectOrFn) {\n return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n }\n\n /**\n * Test whether something is a referToSelf object, holding a callback where\n * to pass `self`.\n *\n * @param {Object | function} objectOrFn\n * @returns {boolean}\n */\n function isReferToSelf(objectOrFn) {\n return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n }\n\n /**\n * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n * an error in case (C).\n *\n * @param { string | undefined } nameSoFar\n * @param { string | undefined } newName\n * @returns { string } updated name\n */\n function checkName(nameSoFar, newName) {\n if (!nameSoFar) {\n return newName;\n }\n if (newName && newName !== nameSoFar) {\n const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n err.data = {\n actual: newName,\n expected: nameSoFar\n };\n throw err;\n }\n return nameSoFar;\n }\n\n /**\n * Retrieve the implied name from an object with signature keys\n * and function values, checking whether all value names match\n *\n * @param { {string: function} } obj\n */\n function getObjectName(obj) {\n let name;\n for (const key in obj) {\n // Only pay attention to own properties, and only if their values\n // are typed functions or functions with a signature property\n if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n name = checkName(name, obj[key].name);\n }\n }\n return name;\n }\n\n /**\n * Copy all of the signatures from the second argument into the first,\n * which is modified by side effect, checking for conflicts\n *\n * @param {Object.} dest\n * @param {Object.} source\n */\n function mergeSignatures(dest, source) {\n let key;\n for (key in source) {\n if (Object.prototype.hasOwnProperty.call(source, key)) {\n if (key in dest) {\n if (source[key] !== dest[key]) {\n const err = new Error('Signature \"' + key + '\" is defined twice');\n err.data = {\n signature: key,\n sourceFunction: source[key],\n destFunction: dest[key]\n };\n throw err;\n }\n // else: both signatures point to the same function, that's fine\n }\n dest[key] = source[key];\n }\n }\n }\n const saveTyped = typed;\n\n /**\n * Originally the main function was a typed function itself, but then\n * it might not be able to generate error messages if the client\n * replaced the type system with different names.\n *\n * Main entry: typed([name], functions/objects with signatures...)\n *\n * Assembles and returns a new typed-function from the given items\n * that provide signatures and implementations, each of which may be\n * * a plain object mapping (string) signatures to implementing functions,\n * * a previously constructed typed function, or\n * * any other single function with a string-valued property `signature`.\n * The name of the resulting typed-function will be given by the\n * string-valued name argument if present, or if not, by the name\n * of any of the arguments that have one, as long as any that do are\n * consistent with each other. If no name is specified, the name will be\n * an empty string.\n *\n * @param {string} maybeName [optional]\n * @param {(function|object)[]} signature providers\n * @returns {typed-function}\n */\n typed = function (maybeName) {\n const named = typeof maybeName === 'string';\n const start = named ? 1 : 0;\n let name = named ? maybeName : '';\n const allSignatures = {};\n for (let i = start; i < arguments.length; ++i) {\n const item = arguments[i];\n let theseSignatures = {};\n let thisName;\n if (typeof item === 'function') {\n thisName = item.name;\n if (typeof item.signature === 'string') {\n // Case 1: Ordinary function with a string 'signature' property\n theseSignatures[item.signature] = item;\n } else if (isTypedFunction(item)) {\n // Case 2: Existing typed function\n theseSignatures = item.signatures;\n }\n } else if (isPlainObject(item)) {\n // Case 3: Plain object, assume keys = signatures, values = functions\n theseSignatures = item;\n if (!named) {\n thisName = getObjectName(item);\n }\n }\n if (Object.keys(theseSignatures).length === 0) {\n const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n err.data = {\n index: i,\n argument: item\n };\n throw err;\n }\n if (!named) {\n name = checkName(name, thisName);\n }\n mergeSignatures(allSignatures, theseSignatures);\n }\n return createTypedFunction(name || '', allSignatures);\n };\n typed.create = create;\n typed.createCount = saveTyped.createCount;\n typed.onMismatch = _onMismatch;\n typed.throwMismatchError = _onMismatch;\n typed.createError = createError;\n typed.clear = clear;\n typed.clearConversions = clearConversions;\n typed.addTypes = addTypes;\n typed._findType = findType; // For unit testing only\n typed.referTo = referTo;\n typed.referToSelf = referToSelf;\n typed.convert = convert;\n typed.findSignature = findSignature;\n typed.find = find;\n typed.isTypedFunction = isTypedFunction;\n typed.warnAgainstDeprecatedThis = true;\n\n /**\n * add a type (convenience wrapper for typed.addTypes)\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 let before = 'any';\n if (beforeObjectTest !== false && typeMap.has('Object')) {\n before = 'Object';\n }\n typed.addTypes([type], before);\n };\n\n /**\n * Verify that the ConversionDef conversion has a valid format.\n *\n * @param {conversionDef} conversion\n * @return {void}\n * @throws {TypeError|SyntaxError}\n */\n function _validateConversion(conversion) {\n if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n }\n if (conversion.to === conversion.from) {\n throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n }\n }\n\n /**\n * Add a conversion\n *\n * @param {ConversionDef} conversion\n * @param {{override: boolean}} [options]\n * @returns {void}\n * @throws {TypeError}\n */\n typed.addConversion = function (conversion) {\n let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n override: false\n };\n _validateConversion(conversion);\n const to = findType(conversion.to);\n const existing = to.conversionsTo.find(other => other.from === conversion.from);\n if (existing) {\n if (options && options.override) {\n typed.removeConversion({\n from: existing.from,\n to: conversion.to,\n convert: existing.convert\n });\n } else {\n throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n }\n }\n to.conversionsTo.push({\n from: conversion.from,\n to: to.name,\n convert: conversion.convert,\n index: nConversions++\n });\n };\n\n /**\n * Convenience wrapper to call addConversion on each conversion in a list.\n *\n * @param {ConversionDef[]} conversions\n * @param {{override: boolean}} [options]\n * @returns {void}\n * @throws {TypeError}\n */\n typed.addConversions = function (conversions, options) {\n conversions.forEach(conversion => typed.addConversion(conversion, options));\n };\n\n /**\n * Remove the specified conversion. The format is the same as for\n * addConversion, and the convert function must match or an error\n * is thrown.\n *\n * @param {{from: string, to: string, convert: function}} conversion\n * @returns {void}\n * @throws {TypeError|SyntaxError|Error}\n */\n typed.removeConversion = function (conversion) {\n _validateConversion(conversion);\n const to = findType(conversion.to);\n const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n if (!existingConversion) {\n throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n }\n if (existingConversion.convert !== conversion.convert) {\n throw new Error('Conversion to remove does not match existing conversion');\n }\n const index = to.conversionsTo.indexOf(existingConversion);\n to.conversionsTo.splice(index, 1);\n };\n\n /**\n * Produce the specific signature that a typed function\n * will execute on the given arguments. Here, a \"signature\" is an\n * object with properties 'params', 'test', 'fn', and 'implementation'.\n * This last property is a function that converts params as necessary\n * and then calls 'fn'. Returns null if there is no matching signature.\n * @param {typed-function} tf\n * @param {any[]} argList\n * @returns {{params: string, test: function, fn: function, implementation: function}}\n */\n typed.resolve = function (tf, argList) {\n if (!isTypedFunction(tf)) {\n throw new TypeError(NOT_TYPED_FUNCTION);\n }\n const sigs = tf._typedFunctionData.signatures;\n for (let i = 0; i < sigs.length; ++i) {\n if (sigs[i].test(argList)) {\n return sigs[i];\n }\n }\n return null;\n };\n return typed;\n }\n var typedFunction = create();\n\n return typedFunction;\n\n}));\n//# sourceMappingURL=typed-function.js.map\n","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n * math.typed(name, signatures) : function\n * math.typed(signatures) : function\n *\n * Examples:\n *\n * // create a typed function with multiple types per argument (type union)\n * const fn2 = typed({\n * 'number | boolean': function (b) {\n * return 'b is a number or boolean'\n * },\n * 'string, number | boolean': function (a, b) {\n * return 'a is a string, b is a number or boolean'\n * }\n * })\n *\n * // create a typed function with an any type argument\n * const log = typed({\n * 'string, any': function (event, data) {\n * console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n * }\n * })\n *\n * @param {string} [name] Optional name for the typed-function\n * @param {Object} signatures Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\nimport typedFunction from 'typed-function';\nimport { factory } from '../../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';\nimport { digits } from '../../utils/number.js';\n\n// returns a new instance of typed-function\nvar _createTyped2 = function _createTyped() {\n // initially, return the original instance of typed-function\n // consecutively, return a new instance from typed.create.\n _createTyped2 = typedFunction.create;\n return typedFunction;\n};\nvar dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nexport var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {\n var {\n BigNumber,\n Complex,\n DenseMatrix,\n Fraction\n } = _ref;\n // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n // get a new instance of typed-function\n var typed = _createTyped2();\n\n // define all types. The order of the types determines in which order function\n // arguments are type-checked (so for performance it's important to put the\n // most used types first).\n typed.clear();\n typed.addTypes([{\n name: 'number',\n test: isNumber\n }, {\n name: 'Complex',\n test: isComplex\n }, {\n name: 'BigNumber',\n test: isBigNumber\n }, {\n name: 'bigint',\n test: isBigInt\n }, {\n name: 'Fraction',\n test: isFraction\n }, {\n name: 'Unit',\n test: isUnit\n },\n // The following type matches a valid variable name, i.e., an alphanumeric\n // string starting with an alphabetic character. It is used (at least)\n // in the definition of the derivative() function, as the argument telling\n // what to differentiate over must (currently) be a variable.\n // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)\n {\n name: 'identifier',\n test: s => isString && /^(?:[A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CD\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7DC\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDDC0-\\uDDF3\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC4\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\u1C8A\\u1C90-\\u1CBA\\u1CBD-\\u1CBF\\u1CE9-\\u1CEC\\u1CEE-\\u1CF3\\u1CF5\\u1CF6\\u1CFA\\u1D00-\\u1DBF\\u1E00-\\u1F15\\u1F18-\\u1F1D\\u1F20-\\u1F45\\u1F48-\\u1F4D\\u1F50-\\u1F57\\u1F59\\u1F5B\\u1F5D\\u1F5F-\\u1F7D\\u1F80-\\u1FB4\\u1FB6-\\u1FBC\\u1FBE\\u1FC2-\\u1FC4\\u1FC6-\\u1FCC\\u1FD0-\\u1FD3\\u1FD6-\\u1FDB\\u1FE0-\\u1FEC\\u1FF2-\\u1FF4\\u1FF6-\\u1FFC\\u2071\\u207F\\u2090-\\u209C\\u2102\\u2107\\u210A-\\u2113\\u2115\\u2119-\\u211D\\u2124\\u2126\\u2128\\u212A-\\u212D\\u212F-\\u2139\\u213C-\\u213F\\u2145-\\u2149\\u214E\\u2183\\u2184\\u2C00-\\u2CE4\\u2CEB-\\u2CEE\\u2CF2\\u2CF3\\u2D00-\\u2D25\\u2D27\\u2D2D\\u2D30-\\u2D67\\u2D6F\\u2D80-\\u2D96\\u2DA0-\\u2DA6\\u2DA8-\\u2DAE\\u2DB0-\\u2DB6\\u2DB8-\\u2DBE\\u2DC0-\\u2DC6\\u2DC8-\\u2DCE\\u2DD0-\\u2DD6\\u2DD8-\\u2DDE\\u2E2F\\u3005\\u3006\\u3031-\\u3035\\u303B\\u303C\\u3041-\\u3096\\u309D-\\u309F\\u30A1-\\u30FA\\u30FC-\\u30FF\\u3105-\\u312F\\u3131-\\u318E\\u31A0-\\u31BF\\u31F0-\\u31FF\\u3400-\\u4DBF\\u4E00-\\uA48C\\uA4D0-\\uA4FD\\uA500-\\uA60C\\uA610-\\uA61F\\uA62A\\uA62B\\uA640-\\uA66E\\uA67F-\\uA69D\\uA6A0-\\uA6E5\\uA717-\\uA71F\\uA722-\\uA788\\uA78B-\\uA7CD\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7DC\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\uDDC0-\\uDDF3\\uDE00-\\uDF36\\uDF40-\\uDF55\\uDF60-\\uDF67\\uDF80-\\uDF85\\uDF87-\\uDFB0\\uDFB2-\\uDFBA]|\\uD802[\\uDC00-\\uDC05\\uDC08\\uDC0A-\\uDC35\\uDC37\\uDC38\\uDC3C\\uDC3F-\\uDC55\\uDC60-\\uDC76\\uDC80-\\uDC9E\\uDCE0-\\uDCF2\\uDCF4\\uDCF5\\uDD00-\\uDD15\\uDD20-\\uDD39\\uDD80-\\uDDB7\\uDDBE\\uDDBF\\uDE00\\uDE10-\\uDE13\\uDE15-\\uDE17\\uDE19-\\uDE35\\uDE60-\\uDE7C\\uDE80-\\uDE9C\\uDEC0-\\uDEC7\\uDEC9-\\uDEE4\\uDF00-\\uDF35\\uDF40-\\uDF55\\uDF60-\\uDF72\\uDF80-\\uDF91]|\\uD803[\\uDC00-\\uDC48\\uDC80-\\uDCB2\\uDCC0-\\uDCF2\\uDD00-\\uDD23\\uDD4A-\\uDD65\\uDD6F-\\uDD85\\uDE80-\\uDEA9\\uDEB0\\uDEB1\\uDEC2-\\uDEC4\\uDF00-\\uDF1C\\uDF27\\uDF30-\\uDF45\\uDF70-\\uDF81\\uDFB0-\\uDFC4\\uDFE0-\\uDFF6]|\\uD804[\\uDC03-\\uDC37\\uDC71\\uDC72\\uDC75\\uDC83-\\uDCAF\\uDCD0-\\uDCE8\\uDD03-\\uDD26\\uDD44\\uDD47\\uDD50-\\uDD72\\uDD76\\uDD83-\\uDDB2\\uDDC1-\\uDDC4\\uDDDA\\uDDDC\\uDE00-\\uDE11\\uDE13-\\uDE2B\\uDE3F\\uDE40\\uDE80-\\uDE86\\uDE88\\uDE8A-\\uDE8D\\uDE8F-\\uDE9D\\uDE9F-\\uDEA8\\uDEB0-\\uDEDE\\uDF05-\\uDF0C\\uDF0F\\uDF10\\uDF13-\\uDF28\\uDF2A-\\uDF30\\uDF32\\uDF33\\uDF35-\\uDF39\\uDF3D\\uDF50\\uDF5D-\\uDF61\\uDF80-\\uDF89\\uDF8B\\uDF8E\\uDF90-\\uDFB5\\uDFB7\\uDFD1\\uDFD3]|\\uD805[\\uDC00-\\uDC34\\uDC47-\\uDC4A\\uDC5F-\\uDC61\\uDC80-\\uDCAF\\uDCC4\\uDCC5\\uDCC7\\uDD80-\\uDDAE\\uDDD8-\\uDDDB\\uDE00-\\uDE2F\\uDE44\\uDE80-\\uDEAA\\uDEB8\\uDF00-\\uDF1A\\uDF40-\\uDF46]|\\uD806[\\uDC00-\\uDC2B\\uDCA0-\\uDCDF\\uDCFF-\\uDD06\\uDD09\\uDD0C-\\uDD13\\uDD15\\uDD16\\uDD18-\\uDD2F\\uDD3F\\uDD41\\uDDA0-\\uDDA7\\uDDAA-\\uDDD0\\uDDE1\\uDDE3\\uDE00\\uDE0B-\\uDE32\\uDE3A\\uDE50\\uDE5C-\\uDE89\\uDE9D\\uDEB0-\\uDEF8\\uDFC0-\\uDFE0]|\\uD807[\\uDC00-\\uDC08\\uDC0A-\\uDC2E\\uDC40\\uDC72-\\uDC8F\\uDD00-\\uDD06\\uDD08\\uDD09\\uDD0B-\\uDD30\\uDD46\\uDD60-\\uDD65\\uDD67\\uDD68\\uDD6A-\\uDD89\\uDD98\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\uDC00-\\uDFFF]|\\uD80D[\\uDC00-\\uDC2F\\uDC41-\\uDC46\\uDC60-\\uDFFF]|\\uD810[\\uDC00-\\uDFFA]|\\uD811[\\uDC00-\\uDE46]|\\uD818[\\uDD00-\\uDD1D]|\\uD81A[\\uDC00-\\uDE38\\uDE40-\\uDE5E\\uDE70-\\uDEBE\\uDED0-\\uDEED\\uDF00-\\uDF2F\\uDF40-\\uDF43\\uDF63-\\uDF77\\uDF7D-\\uDF8F]|\\uD81B[\\uDD40-\\uDD6C\\uDE40-\\uDE7F\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD08]|\\uD82B[\\uDFF0-\\uDFF3\\uDFF5-\\uDFFB\\uDFFD\\uDFFE]|\\uD82C[\\uDC00-\\uDD22\\uDD32\\uDD50-\\uDD52\\uDD55\\uDD64-\\uDD67\\uDD70-\\uDEFB]|\\uD82F[\\uDC00-\\uDC6A\\uDC70-\\uDC7C\\uDC80-\\uDC88\\uDC90-\\uDC99]|\\uD835[\\uDC00-\\uDC54\\uDC56-\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDEA5\\uDEA8-\\uDEC0\\uDEC2-\\uDEDA\\uDEDC-\\uDEFA\\uDEFC-\\uDF14\\uDF16-\\uDF34\\uDF36-\\uDF4E\\uDF50-\\uDF6E\\uDF70-\\uDF88\\uDF8A-\\uDFA8\\uDFAA-\\uDFC2\\uDFC4-\\uDFCB]|\\uD837[\\uDF00-\\uDF1E\\uDF25-\\uDF2A]|\\uD838[\\uDC30-\\uDC6D\\uDD00-\\uDD2C\\uDD37-\\uDD3D\\uDD4E\\uDE90-\\uDEAD\\uDEC0-\\uDEEB]|\\uD839[\\uDCD0-\\uDCEB\\uDDD0-\\uDDED\\uDDF0\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])*$/.test(s)\n }, {\n name: 'string',\n test: isString\n }, {\n name: 'Chain',\n test: isChain\n }, {\n name: 'Array',\n test: isArray\n }, {\n name: 'Matrix',\n test: isMatrix\n }, {\n name: 'DenseMatrix',\n test: isDenseMatrix\n }, {\n name: 'SparseMatrix',\n test: isSparseMatrix\n }, {\n name: 'Range',\n test: isRange\n }, {\n name: 'Index',\n test: isIndex\n }, {\n name: 'boolean',\n test: isBoolean\n }, {\n name: 'ResultSet',\n test: isResultSet\n }, {\n name: 'Help',\n test: isHelp\n }, {\n name: 'function',\n test: isFunction\n }, {\n name: 'Date',\n test: isDate\n }, {\n name: 'RegExp',\n test: isRegExp\n }, {\n name: 'null',\n test: isNull\n }, {\n name: 'undefined',\n test: isUndefined\n }, {\n name: 'AccessorNode',\n test: isAccessorNode\n }, {\n name: 'ArrayNode',\n test: isArrayNode\n }, {\n name: 'AssignmentNode',\n test: isAssignmentNode\n }, {\n name: 'BlockNode',\n test: isBlockNode\n }, {\n name: 'ConditionalNode',\n test: isConditionalNode\n }, {\n name: 'ConstantNode',\n test: isConstantNode\n }, {\n name: 'FunctionNode',\n test: isFunctionNode\n }, {\n name: 'FunctionAssignmentNode',\n test: isFunctionAssignmentNode\n }, {\n name: 'IndexNode',\n test: isIndexNode\n }, {\n name: 'Node',\n test: isNode\n }, {\n name: 'ObjectNode',\n test: isObjectNode\n }, {\n name: 'OperatorNode',\n test: isOperatorNode\n }, {\n name: 'ParenthesisNode',\n test: isParenthesisNode\n }, {\n name: 'RangeNode',\n test: isRangeNode\n }, {\n name: 'RelationalNode',\n test: isRelationalNode\n }, {\n name: 'SymbolNode',\n test: isSymbolNode\n }, {\n name: 'Map',\n test: isMap\n }, {\n name: 'Object',\n test: isObject\n } // order 'Object' last, it matches on other classes too\n ]);\n typed.addConversions([{\n from: 'number',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n\n // note: conversion from number to BigNumber can fail if x has >15 digits\n if (digits(x) > 15) {\n throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');\n }\n return new BigNumber(x);\n }\n }, {\n from: 'number',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n return new Complex(x, 0);\n }\n }, {\n from: 'BigNumber',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n return new Complex(x.toNumber(), 0);\n }\n }, {\n from: 'bigint',\n to: 'number',\n convert: function convert(x) {\n if (x > Number.MAX_SAFE_INTEGER) {\n throw new TypeError('Cannot implicitly convert bigint to number: ' + 'value exceeds the max safe integer value (value: ' + x + ')');\n }\n return Number(x);\n }\n }, {\n from: 'bigint',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n return new BigNumber(x.toString());\n }\n }, {\n from: 'bigint',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n return new Fraction(x);\n }\n }, {\n from: 'Fraction',\n to: 'BigNumber',\n convert: function convert(x) {\n throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');\n }\n }, {\n from: 'Fraction',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n return new Complex(x.valueOf(), 0);\n }\n }, {\n from: 'number',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n var f = new Fraction(x);\n if (f.valueOf() !== x) {\n throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');\n }\n return f;\n }\n }, {\n // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n // from: 'Fraction',\n // to: 'number',\n // convert: function (x) {\n // return x.valueOf()\n // }\n // }, {\n from: 'string',\n to: 'number',\n convert: function convert(x) {\n var n = Number(x);\n if (isNaN(n)) {\n throw new Error('Cannot convert \"' + x + '\" to a number');\n }\n return n;\n }\n }, {\n from: 'string',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n try {\n return new BigNumber(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to BigNumber');\n }\n }\n }, {\n from: 'string',\n to: 'bigint',\n convert: function convert(x) {\n try {\n return BigInt(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to BigInt');\n }\n }\n }, {\n from: 'string',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n try {\n return new Fraction(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to Fraction');\n }\n }\n }, {\n from: 'string',\n to: 'Complex',\n convert: function convert(x) {\n if (!Complex) {\n throwNoComplex(x);\n }\n try {\n return new Complex(x);\n } catch (err) {\n throw new Error('Cannot convert \"' + x + '\" to Complex');\n }\n }\n }, {\n from: 'boolean',\n to: 'number',\n convert: function convert(x) {\n return +x;\n }\n }, {\n from: 'boolean',\n to: 'BigNumber',\n convert: function convert(x) {\n if (!BigNumber) {\n throwNoBignumber(x);\n }\n return new BigNumber(+x);\n }\n }, {\n from: 'boolean',\n to: 'bigint',\n convert: function convert(x) {\n return BigInt(+x);\n }\n }, {\n from: 'boolean',\n to: 'Fraction',\n convert: function convert(x) {\n if (!Fraction) {\n throwNoFraction(x);\n }\n return new Fraction(+x);\n }\n }, {\n from: 'boolean',\n to: 'string',\n convert: function convert(x) {\n return String(x);\n }\n }, {\n from: 'Array',\n to: 'Matrix',\n convert: function convert(array) {\n if (!DenseMatrix) {\n throwNoMatrix();\n }\n return new DenseMatrix(array);\n }\n }, {\n from: 'Matrix',\n to: 'Array',\n convert: function convert(matrix) {\n return matrix.valueOf();\n }\n }]);\n\n // Provide a suggestion on how to call a function elementwise\n // This was added primarily as guidance for the v10 -> v11 transition,\n // and could potentially be removed in the future if it no longer seems\n // to be helpful.\n typed.onMismatch = (name, args, signatures) => {\n var usualError = typed.createError(name, args, signatures);\n if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n // check if the function can be unary:\n signatures.some(sig => !sig.params.includes(','))) {\n var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n err.data = usualError.data;\n throw err;\n }\n throw usualError;\n };\n\n // Provide a suggestion on how to call a function elementwise\n // This was added primarily as guidance for the v10 -> v11 transition,\n // and could potentially be removed in the future if it no longer seems\n // to be helpful.\n typed.onMismatch = (name, args, signatures) => {\n var usualError = typed.createError(name, args, signatures);\n if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&\n // check if the function can be unary:\n signatures.some(sig => !sig.params.includes(','))) {\n var err = new TypeError(\"Function '\".concat(name, \"' doesn't apply to matrices. To call it \") + \"elementwise on a matrix 'M', try 'map(M, \".concat(name, \")'.\"));\n err.data = usualError.data;\n throw err;\n }\n throw usualError;\n };\n return typed;\n});\nfunction throwNoBignumber(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a BigNumber: no class 'BigNumber' provided\"));\n}\nfunction throwNoComplex(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a Complex number: no class 'Complex' provided\"));\n}\nfunction throwNoMatrix() {\n throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided');\n}\nfunction throwNoFraction(x) {\n throw new Error(\"Cannot convert value \".concat(x, \" into a Fraction, no class 'Fraction' provided.\"));\n}","import { 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 this.entries = entries || [];\n }\n\n /**\n * Attach type information\n */\n ResultSet.prototype.type = 'ResultSet';\n ResultSet.prototype.isResultSet = true;\n\n /**\n * Returns the array with results hold by this ResultSet\n * @memberof ResultSet\n * @returns {Array} entries\n */\n ResultSet.prototype.valueOf = function () {\n return this.entries;\n };\n\n /**\n * Returns the stringified results of the ResultSet\n * @memberof ResultSet\n * @returns {string} string\n */\n ResultSet.prototype.toString = function () {\n return '[' + this.entries.map(String).join(', ') + ']';\n };\n\n /**\n * Get a JSON representation of the ResultSet\n * @memberof ResultSet\n * @returns {Object} Returns a JSON object structured as:\n * `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n */\n ResultSet.prototype.toJSON = function () {\n return {\n mathjs: 'ResultSet',\n entries: this.entries\n };\n };\n\n /**\n * Instantiate a ResultSet from a JSON object\n * @memberof ResultSet\n * @param {Object} json A JSON object structured as:\n * `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n * @return {ResultSet}\n */\n ResultSet.fromJSON = function (json) {\n return new ResultSet(json.entries);\n };\n return ResultSet;\n}, {\n isClass: true\n});","import { isBigNumber, isNumber } from '../is.js';\nimport { isInteger, normalizeFormatOptions } from '../number.js';\n\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase(n, base, size) {\n var BigNumberCtor = n.constructor;\n var big2 = new BigNumberCtor(2);\n var suffix = '';\n if (size) {\n if (size < 1) {\n throw new Error('size must be in greater than 0');\n }\n if (!isInteger(size)) {\n throw new Error('size must be an integer');\n }\n if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n throw new Error(\"Value must be in range [-2^\".concat(size - 1, \", 2^\").concat(size - 1, \"-1]\"));\n }\n if (!n.isInteger()) {\n throw new Error('Value must be an integer');\n }\n if (n.lessThan(0)) {\n n = n.add(big2.pow(size));\n }\n suffix = \"i\".concat(size);\n }\n switch (base) {\n case 2:\n return \"\".concat(n.toBinary()).concat(suffix);\n case 8:\n return \"\".concat(n.toOctal()).concat(suffix);\n case 16:\n return \"\".concat(n.toHexadecimal()).concat(suffix);\n default:\n throw new Error(\"Base \".concat(base, \" not supported \"));\n }\n}\n\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n * format(value)\n * format(value, options)\n * format(value, precision)\n * format(value, fn)\n *\n * Where:\n *\n * {number} value The value to be formatted\n * {Object} options An object with formatting options. Available options:\n * {string} notation\n * Number notation. Choose from:\n * 'fixed' Always use regular number notation.\n * For example '123.40' and '14000000'\n * 'exponential' Always use exponential notation.\n * For example '1.234e+2' and '1.4e+7'\n * 'auto' (default) Regular number notation for numbers\n * having an absolute value between\n * `lower` and `upper` bounds, and uses\n * exponential notation elsewhere.\n * Lower bound is included, upper bound\n * is excluded.\n * For example '123.4' and '1.4e7'.\n * 'bin', 'oct, or\n * 'hex' Format the number using binary, octal,\n * or hexadecimal notation.\n * For example '0b1101' and '0x10fe'.\n * {number} wordSize The word size in bits to use for formatting\n * in binary, octal, or hexadecimal notation.\n * To be used only with 'bin', 'oct', or 'hex'\n * values for 'notation' option. When this option\n * is defined the value is formatted as a signed\n * twos complement integer of the given word size\n * and the size suffix is appended to the output.\n * For example\n * format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n * Default value is undefined.\n * {number} precision A number between 0 and 16 to round\n * the digits of the number.\n * In case of notations 'exponential',\n * 'engineering', and 'auto',\n * `precision` defines the total\n * number of significant digits returned.\n * In case of notation 'fixed',\n * `precision` defines the number of\n * significant digits after the decimal\n * point.\n * `precision` is undefined by default.\n * {number} lowerExp Exponent determining the lower boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `-3`.\n * {number} upperExp Exponent determining the upper boundary\n * for formatting a value with an exponent\n * when `notation='auto`.\n * Default value is `5`.\n * {Function} fn A custom formatting function. Can be used to override the\n * built-in notations. Function `fn` is called with `value` as\n * parameter and must return a string. Is useful for example to\n * format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n * format(6.4) // '6.4'\n * format(1240000) // '1.24e6'\n * format(1/3) // '0.3333333333333333'\n * format(1/3, 3) // '0.333'\n * format(21385, 2) // '21000'\n * format(12e8, {notation: 'fixed'}) // returns '1200000000'\n * format(2.3, {notation: 'fixed', precision: 4}) // returns '2.3000'\n * format(52.8, {notation: 'exponential'}) // returns '5.28e+1'\n * format(12400, {notation: 'engineering'}) // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function format(value, options) {\n if (typeof options === 'function') {\n // handle format(value, fn)\n return options(value);\n }\n\n // handle special cases\n if (!value.isFinite()) {\n return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';\n }\n var {\n notation,\n precision,\n wordSize\n } = normalizeFormatOptions(options);\n\n // handle the various notations\n switch (notation) {\n case 'fixed':\n return toFixed(value, precision);\n case 'exponential':\n return toExponential(value, precision);\n case 'engineering':\n return toEngineering(value, precision);\n case 'bin':\n return formatBigNumberToBase(value, 2, wordSize);\n case 'oct':\n return formatBigNumberToBase(value, 8, wordSize);\n case 'hex':\n return formatBigNumberToBase(value, 16, wordSize);\n case 'auto':\n {\n // determine lower and upper bound for exponential notation.\n // TODO: implement support for upper and lower to be BigNumbers themselves\n var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);\n var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);\n\n // handle special case zero\n if (value.isZero()) return '0';\n\n // determine whether or not to output exponential notation\n var str;\n var rounded = value.toSignificantDigits(precision);\n var exp = rounded.e;\n if (exp >= lowerExp && exp < upperExp) {\n // normal number notation\n str = rounded.toFixed();\n } else {\n // exponential notation\n str = toExponential(value, precision);\n }\n\n // remove trailing zeros after the decimal point\n return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n var digits = arguments[2];\n var e = arguments[4];\n return digits !== '.' ? digits + e : e;\n });\n }\n default:\n throw new Error('Unknown notation \"' + notation + '\". ' + 'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.');\n }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision] Optional number of significant figures to return.\n */\nexport function toEngineering(value, precision) {\n // find nearest lower multiple of 3 for exponent\n var e = value.e;\n var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;\n\n // find difference in exponents, and calculate the value without exponent\n var valueWithoutExp = value.mul(Math.pow(10, -newExp));\n var valueStr = valueWithoutExp.toPrecision(precision);\n if (valueStr.includes('e')) {\n var BigNumber = value.constructor;\n valueStr = new BigNumber(valueStr).toFixed();\n }\n return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision] Number of digits in formatted output.\n * If not provided, the maximum available digits\n * is used.\n * @returns {string} str\n */\nexport function toExponential(value, precision) {\n if (precision !== undefined) {\n return value.toExponential(precision - 1); // Note the offset of one\n } else {\n return value.toExponential();\n }\n}\n\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n * decimal point. Undefined by default.\n */\nexport function toFixed(value, precision) {\n return value.toFixed(precision);\n}\nfunction _toNumberOrDefault(value, defaultValue) {\n if (isNumber(value)) {\n return value;\n } else if (isBigNumber(value)) {\n return value.toNumber();\n } else {\n return defaultValue;\n }\n}","import { isBigNumber, isString, typeOf } from './is.js';\nimport { format as formatNumber } from './number.js';\nimport { format as formatBigNumber } from './bignumber/formatter.js';\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function endsWith(text, search) {\n var start = text.length - search.length;\n var end = text.length;\n return text.substring(start, end) === search;\n}\n\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n * math.format(value)\n * math.format(value, precision)\n * math.format(value, options)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n * syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n * function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n * and the result is returned.\n * - In other cases the function will loop over all object properties and\n * return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n * math.format(2/7) // '0.2857142857142857'\n * math.format(math.pi, 3) // '3.14'\n * math.format(new Complex(2, 3)) // '2 + 3i'\n * math.format('hello') // '\"hello\"'\n *\n * @param {*} value Value to be stringified\n * @param {Object | number | Function} [options]\n * Formatting options. See src/utils/number.js:format for a\n * description of the available options controlling number output.\n * This generic \"format\" also supports the option property `truncate: NN`\n * giving the maximum number NN of characters to return (if there would\n * have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format(value, options) {\n var result = _format(value, options);\n if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {\n return result.substring(0, options.truncate - 3) + '...';\n }\n return result;\n}\nfunction _format(value, options) {\n if (typeof value === 'number') {\n return formatNumber(value, options);\n }\n if (isBigNumber(value)) {\n return formatBigNumber(value, options);\n }\n\n // note: we use unsafe duck-typing here to check for Fractions, this is\n // ok here since we're only invoking toString or concatenating its values\n if (looksLikeFraction(value)) {\n if (!options || options.fraction !== 'decimal') {\n // output as ratio, like '1/3'\n return \"\".concat(value.s * value.n, \"/\").concat(value.d);\n } else {\n // output as decimal, like '0.(3)'\n return value.toString();\n }\n }\n if (Array.isArray(value)) {\n return formatArray(value, options);\n }\n if (isString(value)) {\n return stringify(value);\n }\n if (typeof value === 'function') {\n return value.syntax ? String(value.syntax) : 'function';\n }\n if (value && typeof value === 'object') {\n if (typeof value.format === 'function') {\n return value.format(options);\n } else if (value && value.toString(options) !== {}.toString()) {\n // this object has a non-native toString method, use that one\n return value.toString(options);\n } else {\n var entries = Object.keys(value).map(key => {\n return stringify(key) + ': ' + format(value[key], options);\n });\n return '{' + entries.join(', ') + '}';\n }\n }\n return String(value);\n}\n\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\nexport function stringify(value) {\n var text = String(value);\n var escaped = '';\n var i = 0;\n while (i < text.length) {\n var c = text.charAt(i);\n escaped += c in controlCharacters ? controlCharacters[c] : c;\n i++;\n }\n return '\"' + escaped + '\"';\n}\nvar controlCharacters = {\n '\"': '\\\\\"',\n '\\\\': '\\\\\\\\',\n '\\b': '\\\\b',\n '\\f': '\\\\f',\n '\\n': '\\\\n',\n '\\r': '\\\\r',\n '\\t': '\\\\t'\n};\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape(value) {\n var text = String(value);\n text = text.replace(/&/g, '&').replace(/\"/g, '"').replace(/'/g, ''').replace(//g, '>');\n return text;\n}\n\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options] Formatting options. See\n * lib/utils/number:format for a\n * description of the available\n * options.\n * @returns {string} str\n */\nfunction formatArray(array, options) {\n if (Array.isArray(array)) {\n var str = '[';\n var len = array.length;\n for (var i = 0; i < len; i++) {\n if (i !== 0) {\n str += ', ';\n }\n str += formatArray(array[i], options);\n }\n str += ']';\n return str;\n } else {\n return format(array, options);\n }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction(value) {\n return value && typeof value === 'object' && typeof value.s === 'bigint' && typeof value.n === 'bigint' && typeof value.d === 'bigint' || false;\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText(x, y) {\n // we don't want to convert numbers to string, only accept string input\n if (!isString(x)) {\n throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');\n }\n if (!isString(y)) {\n throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');\n }\n return x === y ? 0 : x > y ? 1 : -1;\n}","function _typeof(o) {\n \"@babel/helpers - typeof\";\n\n return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n return typeof o;\n } : function (o) {\n return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n }, _typeof(o);\n}\nexport { _typeof as default };","import _typeof from \"./typeof.js\";\nfunction toPrimitive(t, r) {\n if (\"object\" != _typeof(t) || !t) return t;\n var e = t[Symbol.toPrimitive];\n if (void 0 !== e) {\n var i = e.call(t, r || \"default\");\n if (\"object\" != _typeof(i)) return i;\n throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n }\n return (\"string\" === r ? String : Number)(t);\n}\nexport { toPrimitive as default };","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n var i = toPrimitive(t, \"string\");\n return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n value: t,\n enumerable: !0,\n configurable: !0,\n writable: !0\n }) : e[r] = t, e;\n}\nexport { _defineProperty as default };","// 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';\nimport { isConstantNode, isParenthesisNode, rule2Node } from '../utils/is.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\n // conditionals don't need parentheses in LaTeX because\n // they are 2 dimensional\n }\n}, {\n // logical or\n 'OperatorNode:or': {\n op: 'or',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // logical xor\n 'OperatorNode:xor': {\n op: 'xor',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // logical and\n 'OperatorNode:and': {\n op: 'and',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise or\n 'OperatorNode:bitOr': {\n op: '|',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise xor\n 'OperatorNode:bitXor': {\n op: '^|',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitwise and\n 'OperatorNode:bitAnd': {\n op: '&',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // relational operators\n 'OperatorNode:equal': {\n op: '==',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:unequal': {\n op: '!=',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:smaller': {\n op: '<',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:larger': {\n op: '>',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:smallerEq': {\n op: '<=',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:largerEq': {\n op: '>=',\n associativity: 'left',\n associativeWith: []\n },\n RelationalNode: {\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // bitshift operators\n 'OperatorNode:leftShift': {\n op: '<<',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:rightArithShift': {\n op: '>>',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:rightLogShift': {\n op: '>>>',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // unit conversion\n 'OperatorNode:to': {\n op: 'to',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // range\n RangeNode: {}\n}, {\n // addition, subtraction\n 'OperatorNode:add': {\n op: '+',\n associativity: 'left',\n associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n },\n 'OperatorNode:subtract': {\n op: '-',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // multiply, divide, modulus\n 'OperatorNode:multiply': {\n op: '*',\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n },\n 'OperatorNode:divide': {\n op: '/',\n associativity: 'left',\n associativeWith: [],\n latexLeftParens: false,\n latexRightParens: false,\n latexParens: false\n // fractions don't require parentheses because\n // they're 2 dimensional, so parens aren't needed\n // in LaTeX\n },\n 'OperatorNode:dotMultiply': {\n op: '.*',\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']\n },\n 'OperatorNode:dotDivide': {\n op: './',\n associativity: 'left',\n associativeWith: []\n },\n 'OperatorNode:mod': {\n op: 'mod',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // Repeat multiplication for implicit multiplication\n 'OperatorNode:multiply': {\n associativity: 'left',\n associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']\n }\n}, {\n // unary prefix operators\n 'OperatorNode:unaryPlus': {\n op: '+',\n associativity: 'right'\n },\n 'OperatorNode:unaryMinus': {\n op: '-',\n associativity: 'right'\n },\n 'OperatorNode:bitNot': {\n op: '~',\n associativity: 'right'\n },\n 'OperatorNode:not': {\n op: 'not',\n associativity: 'right'\n }\n}, {\n // exponentiation\n 'OperatorNode:pow': {\n op: '^',\n associativity: 'right',\n associativeWith: [],\n latexRightParens: false\n // the exponent doesn't need parentheses in\n // LaTeX because it's 2 dimensional\n // (it's on top)\n },\n 'OperatorNode:dotPow': {\n op: '.^',\n associativity: 'right',\n associativeWith: []\n }\n}, {\n // nullish coalescing\n 'OperatorNode:nullish': {\n op: '??',\n associativity: 'left',\n associativeWith: []\n }\n}, {\n // factorial\n 'OperatorNode:factorial': {\n op: '!',\n associativity: 'left'\n }\n}, {\n // matrix transpose\n 'OperatorNode:ctranspose': {\n op: \"'\",\n associativity: 'left'\n }\n}];\n\n/**\n * Returns the first non-parenthesis internal node, but only\n * when the 'parenthesis' option is unset or auto.\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {Node}\n */\nfunction unwrapParen(_node, parenthesis) {\n if (!parenthesis || parenthesis !== 'auto') return _node;\n var node = _node;\n while (isParenthesisNode(node)) node = node.content;\n return node;\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 * @param {string} implicit\n * @param {Node} parent (for determining context for implicit multiplication)\n * @return {number | null}\n */\nexport function getPrecedence(_node, parenthesis, implicit, parent) {\n var node = _node;\n if (parenthesis !== 'keep') {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n node = _node.getContent();\n }\n var identifier = node.getIdentifier();\n var precedence = null;\n for (var i = 0; i < properties.length; i++) {\n if (identifier in properties[i]) {\n precedence = i;\n break;\n }\n }\n // Bump up precedence of implicit multiplication, except when preceded\n // by a \"Rule 2\" fraction ( [unaryOp]constant / constant )\n if (identifier === 'OperatorNode:multiply' && node.implicit && implicit !== 'show') {\n var leftArg = unwrapParen(node.args[0], parenthesis);\n if (!(isConstantNode(leftArg) && parent && parent.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(parent.args[0], parenthesis))) && !(leftArg.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(leftArg.args[0], parenthesis)) && isConstantNode(unwrapParen(leftArg.args[1])))) {\n precedence += 1;\n }\n }\n return precedence;\n}\n\n/**\n * Get the associativity of an operator (left or right).\n * Returns a string containing 'left' or 'right' or null if\n * the associativity is not defined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\nexport function getAssociativity(_node, parenthesis) {\n var node = _node;\n if (parenthesis !== 'keep') {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n node = _node.getContent();\n }\n var identifier = node.getIdentifier();\n var index = getPrecedence(node, parenthesis);\n if (index === null) {\n // node isn't in the list\n return null;\n }\n var property = properties[index][identifier];\n if (hasOwnProperty(property, 'associativity')) {\n if (property.associativity === 'left') {\n return 'left';\n }\n if (property.associativity === 'right') {\n return 'right';\n }\n // associativity is invalid\n throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' + property.associativity + '\\'.');\n }\n\n // associativity is undefined\n return null;\n}\n\n/**\n * Check if an operator is associative with another operator.\n * Returns either true or false or null if not defined.\n *\n * @param {Node} nodeA\n * @param {Node} nodeB\n * @param {string} parenthesis\n * @return {boolean | null}\n */\nexport function isAssociativeWith(nodeA, nodeB, parenthesis) {\n // ParenthesisNodes are only ignored when not in 'keep' mode\n 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 if (index === null) {\n // node isn't in the list\n return null;\n }\n var property = properties[index][identifierA];\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 return false;\n }\n\n // associativeWith is not defined\n return null;\n}\n\n/**\n * Get the operator associated with a function name.\n * Returns a string with the operator symbol, or null if the\n * input is not the name of a function associated with an\n * operator.\n *\n * @param {string} Function name\n * @return {string | null} Associated operator symbol, if any\n */\nexport function getOperator(fn) {\n var identifier = 'OperatorNode:' + fn;\n for (var group of properties) {\n if (identifier in group) {\n return group[identifier].op;\n }\n }\n return null;\n}","/**\n * Create a range error with the message:\n * 'Index out of range (index < min)'\n * 'Index out of range (index < max)'\n *\n * @param {number} index The actual index\n * @param {number} [min=0] Minimum index (included)\n * @param {number} [max] Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError(index, min, max) {\n if (!(this instanceof IndexError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n this.index = index;\n if (arguments.length < 3) {\n this.min = 0;\n this.max = min;\n } else {\n this.min = min;\n this.max = max;\n }\n if (this.min !== undefined && this.index < this.min) {\n this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';\n } else if (this.max !== undefined && this.index >= this.max) {\n this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';\n } else {\n this.message = 'Index out of range (' + this.index + ')';\n }\n this.stack = new Error().stack;\n}\nIndexError.prototype = new RangeError();\nIndexError.prototype.constructor = RangeError;\nIndexError.prototype.name = 'IndexError';\nIndexError.prototype.isIndexError = true;","/**\n * Create a range error with the message:\n * 'Dimension mismatch ( != )'\n * @param {number | number[]} actual The actual size\n * @param {number | number[]} expected The expected size\n * @param {string} [relation='!='] Optional relation between actual\n * and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError(actual, expected, relation) {\n if (!(this instanceof DimensionError)) {\n throw new SyntaxError('Constructor must be called with the new operator');\n }\n this.actual = actual;\n this.expected = expected;\n this.relation = relation;\n this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';\n this.stack = new Error().stack;\n}\nDimensionError.prototype = new RangeError();\nDimensionError.prototype.constructor = RangeError;\nDimensionError.prototype.name = 'DimensionError';\nDimensionError.prototype.isDimensionError = true;","import _extends from \"@babel/runtime/helpers/extends\";\nimport { isInteger } from './number.js';\nimport { isNumber, isBigNumber, isArray, isString } from './is.js';\nimport { format } from './string.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { deepStrictEqual } from './object.js';\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @return {number[]} size\n */\nexport function arraySize(x) {\n var s = [];\n while (Array.isArray(x)) {\n s.push(x.length);\n x = x[0];\n }\n return s;\n}\n\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array Array to be validated\n * @param {number[]} size Array with the size of each dimension\n * @param {number} dim Current dimension\n * @throws DimensionError\n * @private\n */\nfunction _validate(array, size, dim) {\n var i;\n var len = array.length;\n if (len !== size[dim]) {\n throw new DimensionError(len, size[dim]);\n }\n if (dim < size.length - 1) {\n // recursively validate each child array\n var dimNext = dim + 1;\n for (i = 0; i < len; i++) {\n var child = array[i];\n if (!Array.isArray(child)) {\n throw new DimensionError(size.length - 1, size.length, '<');\n }\n _validate(array[i], size, dimNext);\n }\n } else {\n // last dimension. none of the children may be an array\n for (i = 0; i < len; i++) {\n if (Array.isArray(array[i])) {\n throw new DimensionError(size.length + 1, size.length, '>');\n }\n }\n }\n}\n\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array Array to be validated\n * @param {number[]} size Array with the size of each dimension\n * @throws DimensionError\n */\nexport function validate(array, size) {\n var isScalar = size.length === 0;\n if (isScalar) {\n // scalar\n if (Array.isArray(array)) {\n throw new DimensionError(array.length, 0);\n }\n } else {\n // array\n _validate(array, size, 0);\n }\n}\n\n/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} value Array to be validated\n * @param {Index} index Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize(value, index) {\n var valueSize = value.isMatrix ? value._size : arraySize(value);\n var sourceSize = index._sourceSize;\n // checks if the source size is not null and matches the valueSize\n sourceSize.forEach((sourceDim, i) => {\n if (sourceDim !== null && sourceDim !== valueSize[i]) {\n throw new DimensionError(sourceDim, valueSize[i]);\n }\n });\n}\n\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index Zero-based index\n * @param {number} [length] Length of the array\n */\nexport function validateIndex(index, length) {\n if (index !== undefined) {\n if (!isNumber(index) || !isInteger(index)) {\n throw new TypeError('Index must be an integer (value: ' + index + ')');\n }\n if (index < 0 || typeof length === 'number' && index >= length) {\n throw new IndexError(index, length);\n }\n }\n}\n\n/**\n * Test if an index has empty values\n * @param {Index} index Zero-based index\n */\nexport function isEmptyIndex(index) {\n for (var i = 0; i < index._dimensions.length; ++i) {\n var dimension = index._dimensions[i];\n if (dimension._data && isArray(dimension._data)) {\n if (dimension._size[0] === 0) {\n return true;\n }\n } else if (dimension.isRange) {\n if (dimension.start === dimension.end) {\n return true;\n }\n } else if (isString(dimension)) {\n if (dimension.length === 0) {\n return true;\n }\n }\n }\n return false;\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {*} [defaultValue=0] Value to be filled in new entries,\n * zero by default. Specify for example `null`,\n * to clearly see entries that are not explicitly\n * set.\n * @return {Array} array The resized array\n */\nexport function resize(array, size, defaultValue) {\n // check the type of the arguments\n if (!Array.isArray(size)) {\n throw new TypeError('Array expected');\n }\n if (size.length === 0) {\n throw new Error('Resizing to scalar is not supported');\n }\n\n // check whether size contains positive integers\n size.forEach(function (value) {\n if (!isNumber(value) || !isInteger(value) || value < 0) {\n throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');\n }\n });\n\n // convert number to an array\n if (isNumber(array) || isBigNumber(array)) {\n array = [array];\n }\n\n // recursively resize the array\n var _defaultValue = defaultValue !== undefined ? defaultValue : 0;\n _resize(array, size, 0, _defaultValue);\n return array;\n}\n\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {number} dim Current dimension\n * @param {*} [defaultValue] Value to be filled in new entries,\n * undefined by default.\n * @private\n */\nfunction _resize(array, size, dim, defaultValue) {\n var i;\n var elem;\n var oldLen = array.length;\n var newLen = size[dim];\n var minLen = Math.min(oldLen, newLen);\n\n // apply new length\n array.length = newLen;\n if (dim < size.length - 1) {\n // non-last dimension\n var dimNext = dim + 1;\n\n // resize existing child arrays\n for (i = 0; i < minLen; i++) {\n // resize child array\n elem = array[i];\n if (!Array.isArray(elem)) {\n elem = [elem]; // add a dimension\n array[i] = elem;\n }\n _resize(elem, size, dimNext, defaultValue);\n }\n\n // create new child arrays\n for (i = minLen; i < newLen; i++) {\n // get child array\n elem = [];\n array[i] = elem;\n\n // resize new child array\n _resize(elem, size, dimNext, defaultValue);\n }\n } else {\n // last dimension\n\n // remove dimensions of existing values\n for (i = 0; i < minLen; i++) {\n while (Array.isArray(array[i])) {\n array[i] = array[i][0];\n }\n }\n\n // fill new elements with the default value\n for (i = minLen; i < newLen; i++) {\n array[i] = defaultValue;\n }\n }\n}\n\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array Array to be reshaped\n * @param {number[]} sizes List of sizes for each dimension\n * @returns {Array} Array whose data has been formatted to fit the\n * specified dimensions\n *\n * @throws {DimensionError} If the product of the new dimension sizes does\n * not equal that of the old ones\n */\nexport function reshape(array, sizes) {\n var flatArray = flatten(array, true); // since it has rectangular\n var currentLength = flatArray.length;\n if (!Array.isArray(array) || !Array.isArray(sizes)) {\n throw new TypeError('Array expected');\n }\n if (sizes.length === 0) {\n throw new DimensionError(0, currentLength, '!=');\n }\n sizes = processSizesWildcard(sizes, currentLength);\n var newLength = product(sizes);\n if (currentLength !== newLength) {\n throw new DimensionError(newLength, currentLength, '!=');\n }\n try {\n return _reshape(flatArray, sizes);\n } catch (e) {\n if (e instanceof DimensionError) {\n throw new DimensionError(newLength, currentLength, '!=');\n }\n throw e;\n }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {number[]} sizes List of sizes for each dimension. At most one 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 {number[]} The sizes array with wildcard replaced.\n */\nexport function processSizesWildcard(sizes, currentLength) {\n var newLength = product(sizes);\n var processedSizes = sizes.slice();\n var WILDCARD = -1;\n var wildCardIndex = sizes.indexOf(WILDCARD);\n var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;\n if (isMoreThanOneWildcard) {\n throw new Error('More than one wildcard in sizes');\n }\n var hasWildcard = wildCardIndex >= 0;\n var canReplaceWildcard = currentLength % newLength === 0;\n if (hasWildcard) {\n if (canReplaceWildcard) {\n processedSizes[wildCardIndex] = -currentLength / newLength;\n } else {\n throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);\n }\n }\n return processedSizes;\n}\n\n/**\n * Computes the product of all array elements.\n * @param {number[]} array Array of factors\n * @returns {number} Product of all elements\n */\nfunction product(array) {\n return array.reduce((prev, curr) => prev * curr, 1);\n}\n\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array Array to be reshaped\n * @param {number[]} sizes List of sizes for each dimension\n * @returns {Array} Array whose data has been formatted to fit the\n * specified dimensions\n */\n\nfunction _reshape(array, sizes) {\n // testing if there are enough elements for the requested shape\n var tmpArray = array;\n var tmpArray2;\n // for each dimension starting by the last one and ignoring the first one\n for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n var size = sizes[sizeIndex];\n tmpArray2 = [];\n\n // aggregate the elements of the current tmpArray in elements of the requested size\n var length = tmpArray.length / size;\n for (var i = 0; i < length; i++) {\n tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));\n }\n // set it as the new tmpArray for the next loop turn or for return\n tmpArray = tmpArray2;\n }\n return tmpArray;\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze(array, size) {\n var s = size || arraySize(array);\n\n // squeeze outer dimensions\n while (Array.isArray(array) && array.length === 1) {\n array = array[0];\n s.shift();\n }\n\n // find the first dimension to be squeezed\n var dims = s.length;\n while (s[dims - 1] === 1) {\n dims--;\n }\n\n // squeeze inner dimensions\n if (dims < s.length) {\n array = _squeeze(array, dims, 0);\n s.length = dims;\n }\n return array;\n}\n\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _squeeze(array, dims, dim) {\n var i, ii;\n if (dim < dims) {\n var next = dim + 1;\n for (i = 0, ii = array.length; i < ii; i++) {\n array[i] = _squeeze(array[i], dims, next);\n }\n } else {\n while (Array.isArray(array)) {\n array = array[0];\n }\n }\n return array;\n}\n\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Parameter `size` will be mutated to match the new, unsqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims Desired number of dimensions of the array\n * @param {number} [outer] Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nexport function unsqueeze(array, dims, outer, size) {\n var s = size || arraySize(array);\n\n // unsqueeze outer dimensions\n if (outer) {\n for (var i = 0; i < outer; i++) {\n array = [array];\n s.unshift(1);\n }\n }\n\n // unsqueeze inner dimensions\n array = _unsqueeze(array, dims, 0);\n while (s.length < dims) {\n s.push(1);\n }\n return array;\n}\n\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim Current dimension\n * @returns {Array | *} Returns the unsqueezed array\n * @private\n */\nfunction _unsqueeze(array, dims, dim) {\n var i, ii;\n if (Array.isArray(array)) {\n var next = dim + 1;\n for (i = 0, ii = array.length; i < ii; i++) {\n array[i] = _unsqueeze(array[i], dims, next);\n }\n } else {\n for (var d = dim; d < dims; d++) {\n array = [array];\n }\n }\n return array;\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array A multi dimensional array\n * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)\n * @return {Array} The flattened array (1 dimensional)\n */\nexport function flatten(array) {\n var isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n if (!Array.isArray(array)) {\n // if not an array, return as is\n return array;\n }\n if (typeof isRectangular !== 'boolean') {\n throw new TypeError('Boolean expected for second argument of flatten');\n }\n var flat = [];\n if (isRectangular) {\n _flattenRectangular(array);\n } else {\n _flatten(array);\n }\n return flat;\n function _flatten(array) {\n for (var i = 0; i < array.length; i++) {\n var item = array[i];\n if (Array.isArray(item)) {\n _flatten(item);\n } else {\n flat.push(item);\n }\n }\n }\n function _flattenRectangular(array) {\n if (Array.isArray(array[0])) {\n for (var i = 0; i < array.length; i++) {\n _flattenRectangular(array[i]);\n }\n } else {\n for (var _i = 0; _i < array.length; _i++) {\n flat.push(array[_i]);\n }\n }\n }\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map(array, callback) {\n return Array.prototype.map.call(array, callback);\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach(array, callback) {\n Array.prototype.forEach.call(array, callback);\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter(array, callback) {\n if (arraySize(array).length !== 1) {\n throw new Error('Only one dimensional matrices supported');\n }\n return Array.prototype.filter.call(array, callback);\n}\n\n/**\n * Filter values in an array given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function filterRegExp(array, regexp) {\n if (arraySize(array).length !== 1) {\n throw new Error('Only one dimensional matrices supported');\n }\n return Array.prototype.filter.call(array, entry => regexp.test(entry));\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join(array, separator) {\n return Array.prototype.join.call(array, separator);\n}\n\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\nexport function identify(a) {\n if (!Array.isArray(a)) {\n throw new TypeError('Array input expected');\n }\n if (a.length === 0) {\n return a;\n }\n var b = [];\n var count = 0;\n b[0] = {\n value: a[0],\n identifier: 0\n };\n for (var i = 1; i < a.length; i++) {\n if (a[i] === a[i - 1]) {\n count++;\n } else {\n count = 0;\n }\n b.push({\n value: a[i],\n identifier: count\n });\n }\n return b;\n}\n\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a An array\n * @return {array} An array of values without identifiers\n */\nexport function generalize(a) {\n if (!Array.isArray(a)) {\n throw new TypeError('Array input expected');\n }\n if (a.length === 0) {\n return a;\n }\n var b = [];\n for (var i = 0; i < a.length; i++) {\n b.push(a[i].value);\n }\n return b;\n}\n\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf Callback function to use to determine the type of a value\n * @return {string}\n */\nexport function getArrayDataType(array, typeOf) {\n var type; // to hold type info\n var length = 0; // to hold length value to ensure it has consistent sizes\n\n for (var i = 0; i < array.length; i++) {\n var item = array[i];\n var _isArray = Array.isArray(item);\n\n // Saving the target matrix row size\n if (i === 0 && _isArray) {\n length = item.length;\n }\n\n // If the current item is an array but the length does not equal the targetVectorSize\n if (_isArray && item.length !== length) {\n return undefined;\n }\n var itemType = _isArray ? getArrayDataType(item, typeOf) // recurse into a nested array\n : typeOf(item);\n if (type === undefined) {\n type = itemType; // first item\n } else if (type !== itemType) {\n return 'mixed';\n } else {\n // we're good, everything has the same type so far\n }\n }\n return type;\n}\n\n/**\n * Return the last item from an array\n * @param {Array} array\n * @returns {*}\n */\nexport function last(array) {\n return array[array.length - 1];\n}\n\n/**\n * Get all but the last element of array.\n * @param {Array} array\n * @returns {Array}\n */\nexport function initial(array) {\n return array.slice(0, array.length - 1);\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices are not cloned.\n * @param {Array} a Multi dimensional array\n * @param {Array} b Multi dimensional array\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @param {number} dim The current dim (zero-based)\n * @return {Array} c The concatenated matrix\n * @private\n */\nfunction concatRecursive(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 var c = [];\n for (var i = 0; i < a.length; i++) {\n c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);\n }\n return c;\n } else {\n // concatenate this dimension\n return a.concat(b);\n }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns {Array}\n */\nexport function concat() {\n var arrays = Array.prototype.slice.call(arguments, 0, -1);\n var concatDim = Array.prototype.slice.call(arguments, -1);\n if (arrays.length === 1) {\n return arrays[0];\n }\n if (arrays.length > 1) {\n return arrays.slice(1).reduce(function (A, B) {\n return concatRecursive(A, B, concatDim, 0);\n }, arrays[0]);\n } else {\n throw new Error('Wrong number of arguments in function concat');\n }\n}\n\n/**\n * Receives two or more sizes and gets the broadcasted size for both.\n * @param {...number[]} sizes Sizes to broadcast together\n * @returns {number[]} The broadcasted size\n */\nexport function broadcastSizes() {\n for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {\n sizes[_key] = arguments[_key];\n }\n var dimensions = sizes.map(s => s.length);\n var N = Math.max(...dimensions);\n var sizeMax = new Array(N).fill(null);\n // check for every size\n for (var i = 0; i < sizes.length; i++) {\n var size = sizes[i];\n var dim = dimensions[i];\n for (var j = 0; j < dim; j++) {\n var n = N - dim + j;\n if (size[j] > sizeMax[n]) {\n sizeMax[n] = size[j];\n }\n }\n }\n for (var _i2 = 0; _i2 < sizes.length; _i2++) {\n checkBroadcastingRules(sizes[_i2], sizeMax);\n }\n return sizeMax;\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules(size, toSize) {\n var N = toSize.length;\n var dim = size.length;\n for (var j = 0; j < dim; j++) {\n var n = N - dim + j;\n if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {\n throw new Error(\"shape mismatch: mismatch is found in arg with shape (\".concat(size, \") not possible to broadcast dimension \").concat(dim, \" with size \").concat(size[j], \" to size \").concat(toSize[n]));\n }\n }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {Array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns {Array} The broadcasted array\n */\nexport function broadcastTo(array, toSize) {\n var Asize = arraySize(array);\n if (deepStrictEqual(Asize, toSize)) {\n return array;\n }\n checkBroadcastingRules(Asize, toSize);\n var broadcastedSize = broadcastSizes(Asize, toSize);\n var N = broadcastedSize.length;\n var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];\n var A = clone(array);\n // reshape A if needed to make it ready for concat\n if (Asize.length < N) {\n A = reshape(A, paddedSize);\n Asize = arraySize(A);\n }\n\n // stretches the array on each dimension to make it the same size as index\n for (var dim = 0; dim < N; dim++) {\n if (Asize[dim] < broadcastedSize[dim]) {\n A = stretch(A, broadcastedSize[dim], dim);\n Asize = arraySize(A);\n }\n }\n return A;\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param {...Array | any} arrays\n * @returns {Array[]} The broadcasted arrays\n */\nexport function broadcastArrays() {\n for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n arrays[_key2] = arguments[_key2];\n }\n if (arrays.length === 0) {\n throw new Error('Insufficient number of arguments in function broadcastArrays');\n }\n if (arrays.length === 1) {\n return arrays[0];\n }\n var sizes = arrays.map(function (array) {\n return arraySize(array);\n });\n var broadcastedSize = broadcastSizes(...sizes);\n var broadcastedArrays = [];\n arrays.forEach(function (array) {\n broadcastedArrays.push(broadcastTo(array, broadcastedSize));\n });\n return broadcastedArrays;\n}\n\n/**\n * Stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns {Array} The stretched array\n */\nexport function stretch(arrayToStretch, sizeToStretch, dimToStretch) {\n return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);\n}\n\n/**\n* Retrieves a single element from an array given an index.\n*\n* @param {Array} array - The array from which to retrieve the value.\n* @param {Array} index - An array of indices specifying the position of the desired element in each dimension.\n* @returns {*} - The value at the specified position in the array.\n*\n* @example\n* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];\n* const index = [1, 0, 1];\n* console.log(get(arr, index)); // 6\n*/\nexport function get(array, index) {\n if (!Array.isArray(array)) {\n throw new Error('Array expected');\n }\n var size = arraySize(array);\n if (index.length !== size.length) {\n throw new DimensionError(index.length, size.length);\n }\n for (var x = 0; x < index.length; x++) {\n validateIndex(index[x], size[x]);\n }\n return index.reduce((acc, curr) => acc[curr], array);\n}\n\n/**\n * Recursively maps over each element of nested array using a provided callback function.\n *\n * @param {Array} array - The array to be mapped.\n * @param {Function} callback - The function to execute on each element, taking three arguments:\n * - `value` (any): The current element being processed in the array.\n * - `index` (Array): The index of the current element being processed in the array.\n * - `array` (Array): The array `deepMap` was called upon.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n * @returns {Array} A new array with each element being the result of the callback function.\n */\nexport function deepMap(array, callback) {\n var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n if (array.length === 0) {\n return [];\n }\n if (skipIndex) {\n return recursiveMap(array);\n }\n var index = [];\n return recursiveMapWithIndex(array, 0);\n function recursiveMapWithIndex(value, depth) {\n if (Array.isArray(value)) {\n var N = value.length;\n var result = Array(N);\n for (var i = 0; i < N; i++) {\n index[depth] = i;\n result[i] = recursiveMapWithIndex(value[i], depth + 1);\n }\n return result;\n } else {\n return callback(value, index.slice(0, depth), array);\n }\n }\n function recursiveMap(value) {\n if (Array.isArray(value)) {\n var N = value.length;\n var result = Array(N);\n for (var i = 0; i < N; i++) {\n result[i] = recursiveMap(value[i]);\n }\n return result;\n } else {\n return callback(value);\n }\n }\n}\n\n/**\n * Recursively iterates over each element in a multi-dimensional array and applies a callback function.\n *\n * @param {Array} array - The multi-dimensional array to iterate over.\n * @param {Function} callback - The function to execute for each element. It receives three arguments:\n * - {any} value: The current element being processed in the array.\n * - {Array} index: The index of the current element in each dimension.\n * - {Array} array: The original array being processed.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n */\nexport function deepForEach(array, callback) {\n var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n if (array.length === 0) {\n return;\n }\n if (skipIndex) {\n recursiveForEach(array);\n return;\n }\n var index = [];\n recursiveForEachWithIndex(array, 0);\n function recursiveForEachWithIndex(value, depth) {\n if (Array.isArray(value)) {\n var N = value.length;\n for (var i = 0; i < N; i++) {\n index[depth] = i;\n recursiveForEachWithIndex(value[i], depth + 1);\n }\n } else {\n callback(value, index.slice(0, depth), array);\n }\n }\n function recursiveForEach(value) {\n if (Array.isArray(value)) {\n var N = value.length;\n for (var i = 0; i < N; i++) {\n recursiveForEach(value[i]);\n }\n } else {\n callback(value);\n }\n }\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns {Array} cloned array\n */\nexport function clone(array) {\n return _extends([], array);\n}","import { isCollection, isMatrix } from './is.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { arraySize, deepMap as arrayDeepMap, deepForEach as arrayDeepForEach } from './array.js';\nimport { _switch } from './switch.js';\n\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n * collections (Arrays or Matrices). Returns false otherwise.\n */\nexport function containsCollections(array) {\n for (var i = 0; i < array.length; i++) {\n if (isCollection(array[i])) {\n return true;\n }\n }\n return false;\n}\n\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback The callback method is invoked with one\n * parameter: the current element in the array\n */\nexport function deepForEach(array, callback) {\n if (isMatrix(array)) {\n array.forEach(x => callback(x), false, true);\n } else {\n arrayDeepForEach(array, callback, true);\n }\n}\n\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback The callback is called with two parameters:\n * value1 and value2, which contain the current\n * element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\nexport function deepMap(array, callback, skipZeros) {\n if (!skipZeros) {\n if (isMatrix(array)) {\n return array.map(x => callback(x), false, true);\n } else {\n return arrayDeepMap(array, callback, true);\n }\n }\n var skipZerosCallback = x => x === 0 ? x : callback(x);\n if (isMatrix(array)) {\n return array.map(x => skipZerosCallback(x), false, true);\n } else {\n return arrayDeepMap(array, skipZerosCallback, true);\n }\n}\n\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\nexport function reduce(mat, dim, callback) {\n var size = Array.isArray(mat) ? arraySize(mat) : mat.size();\n if (dim < 0 || dim >= size.length) {\n // TODO: would be more clear when throwing a DimensionError here\n throw new IndexError(dim, size.length);\n }\n if (isMatrix(mat)) {\n return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype());\n } else {\n return _reduce(mat, dim, callback);\n }\n}\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _reduce(mat, dim, callback) {\n var i, ret, val, tran;\n if (dim <= 0) {\n if (!Array.isArray(mat[0])) {\n val = mat[0];\n for (i = 1; i < mat.length; i++) {\n val = callback(val, mat[i]);\n }\n return val;\n } else {\n tran = _switch(mat);\n ret = [];\n for (i = 0; i < tran.length; i++) {\n ret[i] = _reduce(tran[i], dim - 1, callback);\n }\n return ret;\n }\n } else {\n ret = [];\n for (i = 0; i < mat.length; i++) {\n ret[i] = _reduce(mat[i], dim - 1, callback);\n }\n return ret;\n }\n}\n\n// TODO: document function scatter\nexport function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n // a arrays\n var avalues = a._values;\n var aindex = a._index;\n var aptr = a._ptr;\n\n // vars\n var k, k0, k1, i;\n\n // check we need to process values (pattern matrix)\n if (x) {\n // values in j\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k];\n // check value exists in current j\n if (w[i] !== mark) {\n // i is new entry in j\n w[i] = mark;\n // add i to pattern of C\n cindex.push(i);\n // x(i) = A, check we need to call function this time\n if (update) {\n // copy value to workspace calling callback function\n x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);\n // function was called on current row\n u[i] = mark;\n } else {\n // copy value to workspace\n x[i] = avalues[k];\n }\n } else {\n // i exists in C already\n x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);\n // function was called on current row\n u[i] = mark;\n }\n }\n } else {\n // values in j\n for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n // row\n i = aindex[k];\n // check value exists in current j\n if (w[i] !== mark) {\n // i is new entry in j\n w[i] = mark;\n // add i to pattern of C\n cindex.push(i);\n } else {\n // indicate function was called on current row\n u[i] = mark;\n }\n }\n }\n}","// (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 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 if (!size) {\n index = 0;\n base = 1;\n return;\n }\n while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}\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 if (!oldIndex) {\n ++size;\n if (size <= limit) return undefined;\n id = queue[base];\n del(id);\n return id;\n }\n delete queue[oldIndex];\n if (base !== oldIndex) return undefined;\n while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}\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}","// function utils\n\nimport { lruQueue } from './lruQueue.js';\n\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn The function to be memoized.\n * Must be a pure function.\n * @param {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n * A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n * Maximum number of values that may be cached. Undefined indicates\n * unlimited (default)\n * @return {function} Returns the memoized function\n */\nexport function memoize(fn) {\n var {\n hasher,\n limit\n } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n limit = limit == null ? Number.POSITIVE_INFINITY : limit;\n hasher = hasher == null ? JSON.stringify : hasher;\n return function memoize() {\n if (typeof memoize.cache !== 'object') {\n memoize.cache = {\n values: new Map(),\n lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n };\n }\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args[i] = arguments[i];\n }\n var hash = hasher(args);\n if (memoize.cache.values.has(hash)) {\n memoize.cache.lru.hit(hash);\n return memoize.cache.values.get(hash);\n }\n var newVal = fn.apply(fn, args);\n memoize.cache.values.set(hash, newVal);\n memoize.cache.values.delete(memoize.cache.lru.hit(hash));\n return newVal;\n };\n}\n\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\nexport function memoizeCompare(fn, isEqual) {\n var memoize = function memoize() {\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args[i] = arguments[i];\n }\n for (var c = 0; c < memoize.cache.length; c++) {\n var cached = memoize.cache[c];\n if (isEqual(args, cached.args)) {\n // TODO: move this cache entry to the top so recently used entries move up?\n return cached.res;\n }\n }\n var res = fn.apply(fn, args);\n memoize.cache.unshift({\n args,\n res\n });\n return res;\n };\n memoize.cache = [];\n return memoize;\n}","import { memoize } from '../function.js';\n\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns e\n */\nexport var createBigNumberE = memoize(function (BigNumber) {\n return new BigNumber(1).exp();\n}, {\n hasher\n});\n\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\nexport var createBigNumberPhi = memoize(function (BigNumber) {\n return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);\n}, {\n hasher\n});\n\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\nexport var createBigNumberPi = memoize(function (BigNumber) {\n return BigNumber.acos(-1);\n}, {\n hasher\n});\n\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\nexport var createBigNumberTau = memoize(function (BigNumber) {\n return createBigNumberPi(BigNumber).times(2);\n}, {\n hasher\n});\n\n/**\n * Create a hash for a BigNumber constructor function. The created has is\n * the configured precision\n * @param {Array} args Supposed to contain a single entry with\n * a BigNumber constructor\n * @return {number} precision\n * @private\n */\nfunction hasher(args) {\n return args[0].precision;\n}","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});\n\n// golden ratio, (1+sqrt(5))/2\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'], _ref0 => {\n var {\n config,\n BigNumber\n } = _ref0;\n return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;\n});\nexport var createSQRT1_2 = /* #__PURE__ */recreateFactory(\n// eslint-disable-line camelcase\n'SQRT1_2', ['config', '?BigNumber'], _ref1 => {\n var {\n config,\n BigNumber\n } = _ref1;\n return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;\n});\nexport var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], _ref10 => {\n var {\n config,\n BigNumber\n } = _ref10;\n return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;\n});\nexport var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], _ref11 => {\n var {\n Complex\n } = _ref11;\n return Complex.I;\n});\n\n// for backward compatibility with v5\nexport var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], _ref12 => {\n var {\n pi\n } = _ref12;\n return pi;\n});\nexport var createUppercaseE = /* #__PURE__ */factory('E', ['e'], _ref13 => {\n var {\n e\n } = _ref13;\n return e;\n});\nexport var createVersion = /* #__PURE__ */factory('version', [], () => version);\n\n// helper function to create a factory with a flag recreateOnConfigChange\n// idea: allow passing optional properties to be attached to the factory function as 4th argument?\nfunction recreateFactory(name, dependencies, create) {\n return factory(name, dependencies, create, {\n recreateOnConfigChange: true\n });\n}","import { factory } from '../utils/factory.js';\nimport { deepMap } from '../utils/collection.js';\nvar name = 'number';\nvar dependencies = ['typed'];\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts(input) {\n var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/);\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/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts(parts) {\n var n = parseInt(parts.integerPart, parts.radix);\n var f = 0;\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 var result = n + f;\n if (isNaN(result)) {\n throw new SyntaxError('String \"' + parts.input + '\" is not a valid number');\n }\n return result;\n}\nexport var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\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, bigint, boolean, numeric, 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 if (nonDecimalNumberParts) {\n return makeNumberFromNonDecimalParts(nonDecimalNumberParts);\n }\n var size = 0;\n var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);\n if (wordSizeSuffixMatch) {\n // x includes a size suffix like 0xffffi32, so we extract\n // the suffix and remove it from x\n size = Number(wordSizeSuffixMatch[2]);\n x = wordSizeSuffixMatch[1];\n }\n var num = Number(x);\n if (isNaN(num)) {\n throw new SyntaxError('String \"' + x + '\" is not a valid number');\n }\n if (wordSizeSuffixMatch) {\n // x is a signed bin, oct, or hex literal\n // num is the value of string x if x is interpreted as unsigned\n if (num > 2 ** size - 1) {\n // literal is too large for size suffix\n throw new SyntaxError(\"String \\\"\".concat(x, \"\\\" is out of range\"));\n }\n // check if the bit at index size - 1 is set and if so do the twos complement\n if (num >= 2 ** (size - 1)) {\n num = num - 2 ** size;\n }\n }\n return num;\n },\n BigNumber: function BigNumber(x) {\n return x.toNumber();\n },\n bigint: function bigint(x) {\n return Number(x);\n },\n Fraction: function Fraction(x) {\n return x.valueOf();\n },\n Unit: typed.referToSelf(self => x => {\n var clone = x.clone();\n clone.value = self(x.value);\n return clone;\n }),\n null: function _null(x) {\n return 0;\n },\n 'Unit, string | Unit': function Unit_string__Unit(unit, valuelessUnit) {\n return unit.toNumber(valuelessUnit);\n },\n 'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n });\n\n // reviver function to parse a JSON object like:\n //\n // {\"mathjs\":\"number\",\"value\":\"2.3\"}\n //\n // into a number 2.3\n number.fromJSON = function (json) {\n return parseFloat(json.value);\n };\n return number;\n});","// Reserved keywords not allowed to use in the parser\nexport var keywords = new Set(['end']);","import { isNode } from '../../utils/is.js';\nimport { keywords } from '../keywords.js';\nimport { deepStrictEqual } from '../../utils/object.js';\nimport { factory } from '../../utils/factory.js';\nimport { createMap } from '../../utils/map.js';\nvar name = 'Node';\nvar dependencies = ['mathWithTransform'];\nexport var createNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n mathWithTransform\n } = _ref;\n /**\n * Validate the symbol names of a scope.\n * Throws an error when the scope contains an illegal symbol.\n * @param {Object} scope\n */\n function _validateScope(scope) {\n for (var symbol of [...keywords]) {\n if (scope.has(symbol)) {\n throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword');\n }\n }\n }\n class Node {\n get type() {\n return 'Node';\n }\n get isNode() {\n return true;\n }\n\n /**\n * Evaluate the node\n * @param {Object} [scope] Scope to read/write variables\n * @return {*} Returns the result\n */\n evaluate(scope) {\n return this.compile().evaluate(scope);\n }\n\n /**\n * Compile the node into an optimized, evauatable JavaScript function\n * @return {{evaluate: function([Object])}} object\n * Returns an object with a function 'evaluate',\n * which can be invoked as expr.evaluate([scope: Object]),\n * where scope is an optional object with\n * variables.\n */\n compile() {\n var expr = this._compile(mathWithTransform, {});\n var args = {};\n var context = null;\n function evaluate(scope) {\n var s = createMap(scope);\n _validateScope(s);\n return expr(s, args, context);\n }\n return {\n evaluate\n };\n }\n\n /**\n * Compile a node into a JavaScript function.\n * This basically pre-calculates as much as possible and only leaves open\n * calculations which depend on a dynamic scope with variables.\n * @param {Object} math Math.js namespace with functions and constants.\n * @param {Object} argNames An object with argument names as key and `true`\n * as value. Used in the SymbolNode to optimize\n * for arguments from user assigned functions\n * (see FunctionAssignmentNode) or special symbols\n * like `end` (see IndexNode).\n * @return {function} Returns a function which can be called like:\n * evalNode(scope: Object, args: Object, context: *)\n */\n _compile(math, argNames) {\n throw new Error('Method _compile must be implemented by type ' + this.type);\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot run forEach on a Node interface');\n }\n\n /**\n * Create a new Node whose children are the results of calling the\n * provided callback function for each child 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 map(callback) {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot run map on a Node interface');\n }\n\n /**\n * Validate whether an object is a Node, for use with map\n * @param {Node} node\n * @returns {Node} Returns the input if it's a node, else throws an Error\n * @protected\n */\n _ifNode(node) {\n if (!isNode(node)) {\n throw new TypeError('Callback function must return a Node');\n }\n return node;\n }\n\n /**\n * Recursively traverse all nodes in a node tree. Executes given callback for\n * this node and each of its child nodes.\n * @param {function(node: Node, path: string, parent: Node)} callback\n * A callback called for every node in the node tree.\n */\n traverse(callback) {\n // execute callback for itself\n // eslint-disable-next-line\n callback(this, null, null);\n\n // recursively traverse over all children of a node\n function _traverse(node, callback) {\n node.forEach(function (child, path, parent) {\n callback(child, path, parent);\n _traverse(child, callback);\n });\n }\n _traverse(this, callback);\n }\n\n /**\n * Recursively transform a node tree via a transform function.\n *\n * For example, to replace all nodes of type SymbolNode having name 'x' with\n * a 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. The \"signature\"\n * of the callback must be:\n * callback(node: Node, index: string, parent: Node) : Node\n * @return {Node} Returns the original node or its replacement\n */\n transform(callback) {\n function _transform(child, path, parent) {\n var replacement = callback(child, path, parent);\n if (replacement !== child) {\n // stop iterating when the node is replaced\n return replacement;\n }\n return child.map(_transform);\n }\n return _transform(this, null, null);\n }\n\n /**\n * Find any node in the node tree matching given filter function. For\n * example, to 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\n * An array with nodes matching given filter criteria\n */\n filter(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 /**\n * Create a shallow clone of this node\n * @return {Node}\n */\n clone() {\n // must be implemented by each of the Node implementations\n throw new Error('Cannot clone a Node interface');\n }\n\n /**\n * Create a deep clone of this node\n * @return {Node}\n */\n cloneDeep() {\n return this.map(function (node) {\n return node.cloneDeep();\n });\n }\n\n /**\n * Deep compare this node with another node.\n * @param {Node} other\n * @return {boolean} Returns true when both nodes are of the same type and\n * contain the same values (as do their childs)\n */\n equals(other) {\n return other ? this.type === other.type && deepStrictEqual(this, other) : false;\n }\n\n /**\n * Get string representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\"or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n toString(options) {\n var customString = this._getCustomString(options);\n if (typeof customString !== 'undefined') {\n return customString;\n }\n return this._toString(options);\n }\n\n /**\n * Internal function to generate the string output.\n * This has to be implemented by every Node\n *\n * @throws {Error}\n */\n _toString() {\n // must be implemented by each of the Node implementations\n throw new Error('_toString not implemented for ' + this.type);\n }\n\n /**\n * Get 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 toJSON() {\n throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);\n }\n\n /**\n * Get HTML representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\" or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n toHTML(options) {\n var customString = this._getCustomString(options);\n if (typeof customString !== 'undefined') {\n return customString;\n }\n return this._toHTML(options);\n }\n\n /**\n * Internal function to generate the HTML output.\n * This has to be implemented by every Node\n *\n * @throws {Error}\n */\n _toHTML() {\n // must be implemented by each of the Node implementations\n throw new Error('_toHTML not implemented for ' + this.type);\n }\n\n /**\n * Get LaTeX representation. (wrapper function)\n *\n * This function can get an object of the following form:\n * {\n * handler: //This can be a callback function of the form\n * // \"function callback(node, options)\"or\n * // a map that maps function names (used in FunctionNodes)\n * // to callbacks\n * parenthesis: \"keep\" //the parenthesis option (This is optional)\n * }\n *\n * @param {Object} [options]\n * @return {string}\n */\n toTex(options) {\n var customString = this._getCustomString(options);\n if (typeof customString !== 'undefined') {\n return customString;\n }\n return this._toTex(options);\n }\n\n /**\n * Internal function to generate the LaTeX output.\n * This has to be implemented by every Node\n *\n * @param {Object} [options]\n * @throws {Error}\n */\n _toTex(options) {\n // must be implemented by each of the Node implementations\n throw new Error('_toTex not implemented for ' + this.type);\n }\n\n /**\n * Helper used by `to...` functions.\n */\n _getCustomString(options) {\n if (options && typeof options === 'object') {\n switch (typeof options.handler) {\n case 'object':\n case 'undefined':\n return;\n case 'function':\n return options.handler(this, options);\n default:\n throw new TypeError('Object or function expected as callback');\n }\n }\n }\n\n /**\n * Get identifier.\n * @return {string}\n */\n getIdentifier() {\n return this.type;\n }\n\n /**\n * Get the content of the current Node.\n * @return {Node} node\n **/\n getContent() {\n return this;\n }\n }\n return Node;\n}, {\n isClass: true,\n isNode: true\n});","import { IndexError } from '../../../error/IndexError.js';\n\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error | IndexError} Returns the transformed error\n */\nexport function errorTransform(err) {\n if (err && err.isIndexError) {\n return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);\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 * 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 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 _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 /**\n * Are parenthesis needed?\n * @private\n */\n function needParenthesis(node) {\n // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));\n }\n class AccessorNode extends Node {\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 * @param {boolean} [optionalChaining=false]\n * Optional property, if the accessor was written as optional-chaining\n * using `a?.b`, or `a?.[\"b\"] with bracket notation.\n * Forces evaluate to undefined if the given object is undefined or null.\n */\n constructor(object, index) {\n var optionalChaining = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n super();\n if (!isNode(object)) {\n throw new TypeError('Node expected for parameter \"object\"');\n }\n if (!isIndexNode(index)) {\n throw new TypeError('IndexNode expected for parameter \"index\"');\n }\n this.object = object;\n this.index = index;\n this.optionalChaining = optionalChaining;\n }\n\n // readonly property name\n get name() {\n if (this.index) {\n return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n } else {\n return this.object.name || '';\n }\n }\n get type() {\n return name;\n }\n get isAccessorNode() {\n return true;\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 _compile(math, argNames) {\n var evalObject = this.object._compile(math, argNames);\n var evalIndex = this.index._compile(math, argNames);\n var optionalChaining = this.optionalChaining;\n var prevOptionalChaining = isAccessorNode(this.object) && this.object.optionalChaining;\n if (this.index.isObjectProperty()) {\n var prop = this.index.getObjectProperty();\n return function evalAccessorNode(scope, args, context) {\n var ctx = context || {};\n var object = evalObject(scope, args, ctx);\n if (optionalChaining && object == null) {\n ctx.optionalShortCircuit = true;\n return undefined;\n }\n if (prevOptionalChaining && ctx !== null && ctx !== void 0 && ctx.optionalShortCircuit) {\n return undefined;\n }\n\n // get a property from an object evaluated using the scope.\n return getSafeProperty(object, prop);\n };\n } else {\n return function evalAccessorNode(scope, args, context) {\n var ctx = context || {};\n var object = evalObject(scope, args, ctx);\n if (optionalChaining && object == null) {\n ctx.optionalShortCircuit = true;\n return undefined;\n }\n if (prevOptionalChaining && ctx !== null && ctx !== void 0 && ctx.optionalShortCircuit) {\n return undefined;\n }\n\n // we pass just object here instead of context:\n var index = evalIndex(scope, args, object);\n return access(object, index);\n };\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.object, 'object', this);\n callback(this.index, 'index', this);\n }\n\n /**\n * Create a new AccessorNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)), this.optionalChaining);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {AccessorNode}\n */\n clone() {\n return new AccessorNode(this.object, this.index, this.optionalChaining);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string}\n */\n _toString(options) {\n var object = this.object.toString(options);\n if (needParenthesis(this.object)) {\n object = '(' + object + ')';\n }\n var optionalChaining = this.optionalChaining ? this.index.dotNotation ? '?' : '?.' : '';\n return object + optionalChaining + this.index.toString(options);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string}\n */\n _toHTML(options) {\n var object = this.object.toHTML(options);\n if (needParenthesis(this.object)) {\n object = '(' + object + ')';\n }\n return object + this.index.toHTML(options);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string}\n */\n _toTex(options) {\n var object = this.object.toTex(options);\n if (needParenthesis(this.object)) {\n object = '\\\\left(\\' + object + \\'\\\\right)';\n }\n return object + this.index.toTex(options);\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n object: this.object,\n index: this.index,\n optionalChaining: this.optionalChaining\n };\n }\n\n /**\n * Instantiate an AccessorNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n * where mathjs is optional\n * @returns {AccessorNode}\n */\n static fromJSON(json) {\n return new AccessorNode(json.object, json.index, json.optionalChaining);\n }\n }\n _defineProperty(AccessorNode, \"name\", name);\n return AccessorNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isArrayNode, 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 class ArrayNode extends Node {\n /**\n * @constructor ArrayNode\n * @extends {Node}\n * Holds an 1-dimensional array with items\n * @param {Node[]} [items] 1 dimensional array with items\n */\n constructor(items) {\n super();\n this.items = items || [];\n\n // validate input\n if (!Array.isArray(this.items) || !this.items.every(isNode)) {\n throw new TypeError('Array containing Nodes expected');\n }\n }\n get type() {\n return name;\n }\n get isArrayNode() {\n return true;\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 _compile(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 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 /**\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 forEach(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 /**\n * Create a new ArrayNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var items = [];\n for (var i = 0; i < this.items.length; i++) {\n items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));\n }\n return new ArrayNode(items);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ArrayNode}\n */\n clone() {\n return new ArrayNode(this.items.slice(0));\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n var items = this.items.map(function (node) {\n return node.toString(options);\n });\n return '[' + items.join(', ') + ']';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n items: this.items\n };\n }\n\n /**\n * Instantiate an ArrayNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ArrayNode\", items: [...]}`,\n * where mathjs is optional\n * @returns {ArrayNode}\n */\n static fromJSON(json) {\n return new ArrayNode(json.items);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n var items = this.items.map(function (node) {\n return node.toHTML(options);\n });\n return '[' + items.join(',') + ']';\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n function itemsToTex(items, nested) {\n var mixedItems = items.some(isArrayNode) && !items.every(isArrayNode);\n var itemsFormRow = nested || mixedItems;\n var itemSep = itemsFormRow ? '&' : '\\\\\\\\';\n var itemsTex = items.map(function (node) {\n if (node.items) {\n return itemsToTex(node.items, !nested);\n } else {\n return node.toTex(options);\n }\n }).join(itemSep);\n return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\\\begin{bmatrix}' + itemsTex + '\\\\end{bmatrix}' : itemsTex;\n }\n return itemsToTex(this.items, false);\n }\n }\n _defineProperty(ArrayNode, \"name\", name);\n return ArrayNode;\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 * 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 var result = matrix(object).subset(index, value).valueOf();\n\n // shallow copy all (updated) items into the original array\n result.forEach((item, index) => {\n object[index] = item;\n });\n return object;\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 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 _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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',\n// 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 /*\n * Is parenthesis needed?\n * @param {node} node\n * @param {string} [parenthesis='keep']\n * @param {string} implicit\n * @private\n */\n function needParenthesis(node, parenthesis, implicit) {\n if (!parenthesis) {\n parenthesis = 'keep';\n }\n var precedence = getPrecedence(node, parenthesis, implicit);\n var exprPrecedence = getPrecedence(node.value, parenthesis, implicit);\n return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n }\n class AssignmentNode extends Node {\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'),\n * new IndexNode('b'),\n * new ConstantNode(2)) // a.b=2\n * new AssignmentNode(new SymbolNode('a'),\n * new IndexNode(1, 2),\n * new ConstantNode(3)) // a[1,2]=3\n *\n * @param {SymbolNode | AccessorNode} object\n * Object on which to assign a value\n * @param {IndexNode} [index=null]\n * Index, property name or matrix index. Optional. If not provided\n * and `object` is a SymbolNode, the property is assigned to the\n * global scope.\n * @param {Node} value\n * The value to be assigned\n */\n constructor(object, index, value) {\n super();\n this.object = object;\n this.index = value ? index : null;\n this.value = value || index;\n\n // validate input\n if (!isSymbolNode(object) && !isAccessorNode(object)) {\n throw new TypeError('SymbolNode or AccessorNode expected as \"object\"');\n }\n if (isSymbolNode(object) && object.name === 'end') {\n throw new Error('Cannot assign to symbol \"end\"');\n }\n if (this.index && !isIndexNode(this.index)) {\n // index is optional\n throw new TypeError('IndexNode expected as \"index\"');\n }\n if (!isNode(this.value)) {\n throw new TypeError('Node expected as \"value\"');\n }\n }\n\n // class name for typing purposes:\n\n // readonly property name\n get name() {\n if (this.index) {\n return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';\n } else {\n return this.object.name || '';\n }\n }\n get type() {\n return name;\n }\n get isAssignmentNode() {\n return true;\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 _compile(math, argNames) {\n var evalObject = this.object._compile(math, argNames);\n var evalIndex = this.index ? this.index._compile(math, argNames) : null;\n var evalValue = this.value._compile(math, argNames);\n var name = this.object.name;\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 return function evalAssignmentNode(scope, args, context) {\n var value = evalValue(scope, args, context);\n scope.set(name, value);\n return value;\n };\n } else if (this.index.isObjectProperty()) {\n // apply an object property for example `a.b=2`\n 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 setSafeProperty(object, prop, value);\n return value;\n };\n } else if (isSymbolNode(this.object)) {\n // update a matrix subset, for example `a[2]=3`\n return function evalAssignmentNode(scope, args, context) {\n var childObject = evalObject(scope, args, context);\n var value = evalValue(scope, args, context);\n // Important: we pass childObject instead of context:\n var index = evalIndex(scope, args, childObject);\n scope.set(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\n // we will not use the compile function of the AccessorNode, but\n // compile it ourselves here as we need the parent object of the\n // AccessorNode:\n // wee need to apply the updated object to parent object\n var evalParentObject = this.object.object._compile(math, argNames);\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 // Important: we pass childObject instead of context:\n var index = evalIndex(scope, args, childObject);\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\n // the size\n var evalParentIndex = this.object.index._compile(math, argNames);\n return function evalAssignmentNode(scope, args, context) {\n var parent = evalParentObject(scope, args, context);\n // Important: we pass parent instead of context:\n var parentIndex = evalParentIndex(scope, args, parent);\n var childObject = access(parent, parentIndex);\n // Important: we pass childObject instead of context\n var index = evalIndex(scope, args, childObject);\n var value = evalValue(scope, args, context);\n assign(parent, parentIndex, assign(childObject, index, value));\n return value;\n };\n }\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.object, 'object', this);\n if (this.index) {\n callback(this.index, 'index', this);\n }\n callback(this.value, 'value', this);\n }\n\n /**\n * Create a new AssignmentNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var object = this._ifNode(callback(this.object, 'object', this));\n var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;\n var value = this._ifNode(callback(this.value, 'value', this));\n return new AssignmentNode(object, index, value);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {AssignmentNode}\n */\n clone() {\n return new AssignmentNode(this.object, this.index, this.value);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string}\n */\n _toString(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 if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n value = '(' + value + ')';\n }\n return object + index + ' = ' + value;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n object: this.object,\n index: this.index,\n value: this.value\n };\n }\n\n /**\n * Instantiate an AssignmentNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n * where mathjs is optional\n * @returns {AssignmentNode}\n */\n static fromJSON(json) {\n return new AssignmentNode(json.object, json.index, json.value);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string}\n */\n _toHTML(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 if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n value = '(' + value + ')';\n }\n return object + index + '=' + value;\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string}\n */\n _toTex(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 if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {\n value = \"\\\\left(\".concat(value, \"\\\\right)\");\n }\n return object + index + '=' + value;\n }\n }\n _defineProperty(AssignmentNode, \"name\", name);\n return AssignmentNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 class BlockNode extends Node {\n /**\n * @constructor BlockNode\n * @extends {Node}\n * Holds a set with blocks\n * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks\n * An array with blocks, where a block is constructed as an\n * Object with properties block, which is a Node, and visible,\n * which is a boolean. The property visible is optional and\n * is true by default\n */\n constructor(blocks) {\n super();\n // validate input, copy blocks\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') {\n throw new TypeError('Property \"visible\" must be a boolean');\n }\n return {\n node,\n visible\n };\n });\n }\n get type() {\n return name;\n }\n get isBlockNode() {\n return true;\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 _compile(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 if (block.visible) {\n results.push(result);\n }\n });\n return new ResultSet(results);\n };\n }\n\n /**\n * Execute a callback for each of the child blocks of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(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 /**\n * Create a new BlockNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var blocks = [];\n for (var i = 0; i < this.blocks.length; i++) {\n var block = this.blocks[i];\n var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));\n blocks[i] = {\n node,\n visible: block.visible\n };\n }\n return new BlockNode(blocks);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {BlockNode}\n */\n clone() {\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 /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n return this.blocks.map(function (param) {\n return param.node.toString(options) + (param.visible ? '' : ';');\n }).join('\\n');\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n blocks: this.blocks\n };\n }\n\n /**\n * Instantiate an BlockNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n * where mathjs is optional\n * @returns {BlockNode}\n */\n static fromJSON(json) {\n return new BlockNode(json.blocks);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n return this.blocks.map(function (param) {\n return param.node.toHTML(options) + (param.visible ? '' : ';');\n }).join('
');\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n return this.blocks.map(function (param) {\n return param.node.toTex(options) + (param.visible ? '' : ';');\n }).join('\\\\;\\\\;\\n');\n }\n }\n _defineProperty(BlockNode, \"name\", name);\n return BlockNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 * Test whether a condition is met\n * @param {*} condition\n * @returns {boolean} true if condition is true or non-zero, else false\n */\n function testCondition(condition) {\n if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {\n return !!condition;\n }\n if (condition) {\n if (isBigNumber(condition)) {\n return !condition.isZero();\n }\n if (isComplex(condition)) {\n return !!(condition.re || condition.im);\n }\n if (isUnit(condition)) {\n return !!condition.value;\n }\n }\n if (condition === null || condition === undefined) {\n return false;\n }\n throw new TypeError('Unsupported type of condition \"' + typeOf(condition) + '\"');\n }\n class ConditionalNode extends Node {\n /**\n * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'\n *\n * @param {Node} condition Condition, must result in a boolean\n * @param {Node} trueExpr Expression evaluated when condition is true\n * @param {Node} falseExpr Expression evaluated when condition is true\n *\n * @constructor ConditionalNode\n * @extends {Node}\n */\n constructor(condition, trueExpr, falseExpr) {\n super();\n if (!isNode(condition)) {\n throw new TypeError('Parameter condition must be a Node');\n }\n if (!isNode(trueExpr)) {\n throw new TypeError('Parameter trueExpr must be a Node');\n }\n if (!isNode(falseExpr)) {\n throw new TypeError('Parameter falseExpr must be a Node');\n }\n this.condition = condition;\n this.trueExpr = trueExpr;\n this.falseExpr = falseExpr;\n }\n get type() {\n return name;\n }\n get isConditionalNode() {\n return true;\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 _compile(math, argNames) {\n var evalCondition = this.condition._compile(math, argNames);\n var evalTrueExpr = this.trueExpr._compile(math, argNames);\n var evalFalseExpr = this.falseExpr._compile(math, argNames);\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 /**\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 forEach(callback) {\n callback(this.condition, 'condition', this);\n callback(this.trueExpr, 'trueExpr', this);\n callback(this.falseExpr, 'falseExpr', this);\n }\n\n /**\n * Create a new ConditionalNode whose children are the results of calling\n * the provided callback function for each child 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 map(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 /**\n * Create a clone of this node, a shallow copy\n * @return {ConditionalNode}\n */\n clone() {\n return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n\n // Enclose Arguments in parentheses if they are an OperatorNode\n // or have lower or equal precedence\n // NOTE: enclosing all OperatorNodes in parentheses is a decision\n // purely based on aesthetics and readability\n var condition = this.condition.toString(options);\n var conditionPrecedence = getPrecedence(this.condition, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n condition = '(' + condition + ')';\n }\n var trueExpr = this.trueExpr.toString(options);\n var truePrecedence = getPrecedence(this.trueExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n trueExpr = '(' + trueExpr + ')';\n }\n var falseExpr = this.falseExpr.toString(options);\n var falsePrecedence = getPrecedence(this.falseExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n falseExpr = '(' + falseExpr + ')';\n }\n return condition + ' ? ' + trueExpr + ' : ' + falseExpr;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n condition: this.condition,\n trueExpr: this.trueExpr,\n falseExpr: this.falseExpr\n };\n }\n\n /**\n * Instantiate an ConditionalNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * ```\n * {\"mathjs\": \"ConditionalNode\",\n * \"condition\": ...,\n * \"trueExpr\": ...,\n * \"falseExpr\": ...}\n * ```\n * where mathjs is optional\n * @returns {ConditionalNode}\n */\n static fromJSON(json) {\n return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n\n // Enclose Arguments in parentheses if they are an OperatorNode\n // or have lower or equal precedence\n // NOTE: enclosing all OperatorNodes in parentheses is a decision\n // purely based on aesthetics and readability\n var condition = this.condition.toHTML(options);\n var conditionPrecedence = getPrecedence(this.condition, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {\n condition = '(' + condition + ')';\n }\n var trueExpr = this.trueExpr.toHTML(options);\n var truePrecedence = getPrecedence(this.trueExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {\n trueExpr = '(' + trueExpr + ')';\n }\n var falseExpr = this.falseExpr.toHTML(options);\n var falsePrecedence = getPrecedence(this.falseExpr, parenthesis, options && options.implicit);\n if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {\n falseExpr = '(' + falseExpr + ')';\n }\n return condition + '?' + trueExpr + ':' + falseExpr;\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(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 _defineProperty(ConditionalNode, \"name\", name);\n return ConditionalNode;\n}, {\n isClass: true,\n isNode: true\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};","/* eslint no-template-curly-in-string: \"off\" */\n\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 fraction: {\n 2: '\\\\frac{${args[0]}}{${args[1]}}'\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 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 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 pinv: {\n 1: '\\\\left(${args[0]}\\\\right)^{+}'\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 lgamma: {\n 1: '\\\\ln\\\\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 bigint: {\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}\n\n// @param {string} name\n// @param {boolean} isUnit\nexport function toSymbol(name, isUnit) {\n isUnit = typeof isUnit === 'undefined' ? false : isUnit;\n if (isUnit) {\n if (hasOwnProperty(latexUnits, name)) {\n return latexUnits[name];\n }\n return '\\\\mathrm{' + escapeLatex(name) + '}';\n }\n if (hasOwnProperty(latexSymbols, name)) {\n return latexSymbols[name];\n }\n return escapeLatex(name);\n}","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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', 'isBounded'];\nexport var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node,\n isBounded\n } = _ref;\n class ConstantNode extends Node {\n /**\n * A ConstantNode holds a constant value like a number or string.\n *\n * Usage:\n *\n * new ConstantNode(2.3)\n * new ConstantNode('hello')\n *\n * @param {*} value Value can be any type (number, BigNumber, bigint, string, ...)\n * @constructor ConstantNode\n * @extends {Node}\n */\n constructor(value) {\n super();\n this.value = value;\n }\n get type() {\n return name;\n }\n get isConstantNode() {\n return true;\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 _compile(math, argNames) {\n var value = this.value;\n return function evalConstantNode() {\n return value;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n // nothing to do, we don't have any children\n }\n\n /**\n * Create a new ConstantNode with children produced by the given callback.\n * Trivial because there are no children.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {ConstantNode} Returns a clone of the node\n */\n map(callback) {\n return this.clone();\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ConstantNode}\n */\n clone() {\n return new ConstantNode(this.value);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n return format(this.value, options);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var value = this._toString(options);\n switch (typeOf(this.value)) {\n case 'number':\n case 'bigint':\n case 'BigNumber':\n case 'Fraction':\n return '' + value + '';\n case 'string':\n return '' + value + '';\n case 'boolean':\n return '' + value + '';\n case 'null':\n return '' + value + '';\n case 'undefined':\n return '' + value + '';\n default:\n return '' + value + '';\n }\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n value: this.value\n };\n }\n\n /**\n * Instantiate a ConstantNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SymbolNode\", value: 2.3}`,\n * where mathjs is optional\n * @returns {ConstantNode}\n */\n static fromJSON(json) {\n return new ConstantNode(json.value);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var value = this._toString(options);\n var type = typeOf(this.value);\n switch (type) {\n case 'string':\n return '\\\\mathtt{' + escapeLatex(value) + '}';\n case 'number':\n case 'BigNumber':\n {\n if (!isBounded(this.value)) {\n return this.value.valueOf() < 0 ? '-\\\\infty' : '\\\\infty';\n }\n var index = value.toLowerCase().indexOf('e');\n if (index !== -1) {\n return value.substring(0, index) + '\\\\cdot10^{' + value.substring(index + 1) + '}';\n }\n return value;\n }\n case 'bigint':\n {\n return value.toString();\n }\n case 'Fraction':\n return this.value.toLatex();\n default:\n return value;\n }\n }\n }\n _defineProperty(ConstantNode, \"name\", name);\n return ConstantNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 { 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 * Is parenthesis needed?\n * @param {Node} node\n * @param {Object} parenthesis\n * @param {string} implicit\n * @private\n */\n function needParenthesis(node, parenthesis, implicit) {\n var precedence = getPrecedence(node, parenthesis, implicit);\n var exprPrecedence = getPrecedence(node.expr, parenthesis, implicit);\n return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;\n }\n class FunctionAssignmentNode extends Node {\n /**\n * @constructor FunctionAssignmentNode\n * @extends {Node}\n * Function assignment\n *\n * @param {string} name Function name\n * @param {string[] | Array.<{name: string, type: string}>} params\n * Array with function parameter names, or an\n * array with objects containing the name\n * and type of the parameter\n * @param {Node} expr The function expression\n */\n constructor(name, params, expr) {\n super();\n // validate input\n if (typeof name !== 'string') {\n throw new TypeError('String expected for parameter \"name\"');\n }\n if (!Array.isArray(params)) {\n throw new TypeError('Array containing strings or objects expected for parameter \"params\"');\n }\n if (!isNode(expr)) {\n throw new TypeError('Node expected for parameter \"expr\"');\n }\n if (keywords.has(name)) {\n throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword');\n }\n var paramNames = new Set();\n for (var param of params) {\n var _name = typeof param === 'string' ? param : param.name;\n if (paramNames.has(_name)) {\n throw new Error(\"Duplicate parameter name \\\"\".concat(_name, \"\\\"\"));\n } else {\n paramNames.add(_name);\n }\n }\n this.name = name;\n this.params = params.map(function (param) {\n return param && param.name || param;\n });\n this.types = params.map(function (param) {\n return param && param.type || 'any';\n });\n this.expr = expr;\n }\n get type() {\n return name;\n }\n get isFunctionAssignmentNode() {\n return true;\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 _compile(math, argNames) {\n var childArgNames = Object.create(argNames);\n forEach(this.params, function (param) {\n childArgNames[param] = true;\n });\n\n // compile the function expression with the child args\n var expr = this.expr;\n var evalExpr = expr._compile(math, childArgNames);\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 signatures[signature] = function () {\n var childArgs = Object.create(args);\n for (var i = 0; i < params.length; i++) {\n childArgs[params[i]] = arguments[i];\n }\n return evalExpr(scope, childArgs, context);\n };\n var fn = typed(name, signatures);\n fn.syntax = syntax;\n fn.expr = expr.toString();\n scope.set(name, fn);\n return fn;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.expr, 'expr', this);\n }\n\n /**\n * Create a new FunctionAssignmentNode whose children are the results of\n * calling the provided callback function for each child of the original\n * node.\n * @param {function(child: Node, path: string, parent: Node): Node} callback\n * @returns {FunctionAssignmentNode} Returns a transformed copy of the node\n */\n map(callback) {\n var expr = this._ifNode(callback(this.expr, 'expr', this));\n return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {FunctionAssignmentNode}\n */\n clone() {\n return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);\n }\n\n /**\n * get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var expr = this.expr.toString(options);\n if (needParenthesis(this, parenthesis, options && options.implicit)) {\n expr = '(' + expr + ')';\n }\n return this.name + '(' + this.params.join(', ') + ') = ' + expr;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n var types = this.types;\n return {\n mathjs: name,\n name: this.name,\n params: this.params.map(function (param, index) {\n return {\n name: param,\n type: types[index]\n };\n }),\n expr: this.expr\n };\n }\n\n /**\n * Instantiate an FunctionAssignmentNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * ```\n * {\"mathjs\": \"FunctionAssignmentNode\",\n * name: ..., params: ..., expr: ...}\n * ```\n * where mathjs is optional\n * @returns {FunctionAssignmentNode}\n */\n static fromJSON(json) {\n return new FunctionAssignmentNode(json.name, json.params, json.expr);\n }\n\n /**\n * get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var params = [];\n for (var i = 0; i < this.params.length; i++) {\n params.push('' + escape(this.params[i]) + '');\n }\n var expr = this.expr.toHTML(options);\n if (needParenthesis(this, parenthesis, options && options.implicit)) {\n expr = '(' + expr + ')';\n }\n return '' + escape(this.name) + '' + '(' + params.join(',') + ')' + '=' + expr;\n }\n\n /**\n * get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var expr = this.expr.toTex(options);\n if (needParenthesis(this, parenthesis, options && options.implicit)) {\n expr = \"\\\\left(\".concat(expr, \"\\\\right)\");\n }\n return '\\\\mathrm{' + this.name + '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right)=' + expr;\n }\n }\n _defineProperty(FunctionAssignmentNode, \"name\", name);\n return FunctionAssignmentNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { map } from '../../utils/array.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { isArray, isConstantNode, isMatrix, isNode, isString, typeOf } from '../../utils/is.js';\nimport { escape } from '../../utils/string.js';\nvar name = 'IndexNode';\nvar dependencies = ['Node', 'size'];\nexport var createIndexNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node,\n size\n } = _ref;\n class IndexNode extends Node {\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]\n * Optional property describing whether this index was written using dot\n * notation like `a.b`, or using bracket notation like `a[\"b\"]`\n * (which is the default). This property is used for string conversion.\n */\n constructor(dimensions, dotNotation) {\n super();\n this.dimensions = dimensions;\n this.dotNotation = dotNotation || false;\n\n // validate input\n if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"dimensions\"');\n }\n if (this.dotNotation && !this.isObjectProperty()) {\n throw new Error('dotNotation only applicable for object properties');\n }\n }\n get type() {\n return name;\n }\n get isIndexNode() {\n return true;\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 _compile(math, argNames) {\n // TODO: implement support for bignumber (currently bignumbers are silently\n // reduced to numbers when changing the value to zero-based)\n\n // TODO: Optimization: when the range values are ConstantNodes,\n // we can beforehand resolve the zero-based value\n\n // optimization for a simple object property\n var evalDimensions = map(this.dimensions, function (dimension, i) {\n var needsEnd = dimension.filter(node => node.isSymbolNode && node.name === 'end').length > 0;\n if (needsEnd) {\n // SymbolNode 'end' is used inside the index,\n // like in `A[end]` or `A[end - 2]`\n var childArgNames = Object.create(argNames);\n childArgNames.end = true;\n var _evalDimension = dimension._compile(math, childArgNames);\n return function evalDimension(scope, args, context) {\n if (!isMatrix(context) && !isArray(context) && !isString(context)) {\n throw new TypeError('Cannot resolve \"end\": ' + 'context must be a Matrix, Array, or string but is ' + typeOf(context));\n }\n var s = size(context);\n var childArgs = Object.create(args);\n childArgs.end = s[i];\n return _evalDimension(scope, childArgs, context);\n };\n } else {\n // SymbolNode `end` not used\n return dimension._compile(math, argNames);\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 /**\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 forEach(callback) {\n for (var i = 0; i < this.dimensions.length; i++) {\n callback(this.dimensions[i], 'dimensions[' + i + ']', this);\n }\n }\n\n /**\n * Create a new IndexNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var dimensions = [];\n for (var i = 0; i < this.dimensions.length; i++) {\n dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));\n }\n return new IndexNode(dimensions, this.dotNotation);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {IndexNode}\n */\n clone() {\n return new IndexNode(this.dimensions.slice(0), this.dotNotation);\n }\n\n /**\n * Test whether this IndexNode contains a single property name\n * @return {boolean}\n */\n isObjectProperty() {\n return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';\n }\n\n /**\n * Returns the property name if IndexNode contains a property.\n * If not, returns null.\n * @return {string | null}\n */\n getObjectProperty() {\n return this.isObjectProperty() ? this.dimensions[0].value : null;\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n // format the parameters like \"[1, 0:5]\"\n return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n dimensions: this.dimensions,\n dotNotation: this.dotNotation\n };\n }\n\n /**\n * Instantiate an IndexNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n * where mathjs is optional\n * @returns {IndexNode}\n */\n static fromJSON(json) {\n return new IndexNode(json.dimensions, json.dotNotation);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n // format the parameters like \"[1, 0:5]\"\n var dimensions = [];\n for (var i = 0; i < this.dimensions.length; i++) {\n dimensions[i] = this.dimensions[i].toHTML();\n }\n if (this.dotNotation) {\n return '.' + '' + escape(this.getObjectProperty()) + '';\n } else {\n return '[' + dimensions.join(',') + ']';\n }\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var dimensions = this.dimensions.map(function (range) {\n return range.toTex(options);\n });\n return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';\n }\n }\n _defineProperty(IndexNode, \"name\", name);\n return IndexNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { isNode } from '../../utils/is.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { escape, stringify } from '../../utils/string.js';\nvar name = 'ObjectNode';\nvar dependencies = ['Node'];\nexport var createObjectNode = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n Node\n } = _ref;\n class ObjectNode extends Node {\n /**\n * @constructor ObjectNode\n * @extends {Node}\n * Holds an object with keys/values\n * @param {Object.} [properties] object with key/value pairs\n */\n constructor(properties) {\n super();\n this.properties = properties || {};\n\n // validate input\n if (properties) {\n if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {\n return isNode(properties[key]);\n })) {\n throw new TypeError('Object containing Nodes expected');\n }\n }\n }\n get type() {\n return name;\n }\n get isObjectNode() {\n return true;\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 _compile(math, argNames) {\n var evalEntries = {};\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 var prop = getSafeProperty(this.properties, key);\n evalEntries[parsedKey] = prop._compile(math, argNames);\n }\n }\n return function evalObjectNode(scope, args, context) {\n var obj = {};\n for (var _key in evalEntries) {\n if (hasOwnProperty(evalEntries, _key)) {\n obj[_key] = evalEntries[_key](scope, args, context);\n }\n }\n return obj;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(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 /**\n * Create a new ObjectNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var properties = {};\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 return new ObjectNode(properties);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ObjectNode}\n */\n clone() {\n var properties = {};\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n properties[key] = this.properties[key];\n }\n }\n return new ObjectNode(properties);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n var entries = [];\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 return '{' + entries.join(', ') + '}';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n properties: this.properties\n };\n }\n\n /**\n * Instantiate an OperatorNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ObjectNode\", \"properties\": {...}}`,\n * where mathjs is optional\n * @returns {ObjectNode}\n */\n static fromJSON(json) {\n return new ObjectNode(json.properties);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n var entries = [];\n for (var key in this.properties) {\n if (hasOwnProperty(this.properties, key)) {\n entries.push('' + escape(key) + '' + '' + ':' + this.properties[key].toHTML(options));\n }\n }\n return '{' + entries.join(',') + '}';\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var entries = [];\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 var tex = '\\\\left\\\\{\\\\begin{array}{ll}' + entries.join('\\n') + '\\\\end{array}\\\\right\\\\}';\n return tex;\n }\n }\n _defineProperty(ObjectNode, \"name\", name);\n return ObjectNode;\n}, {\n isClass: true,\n isNode: true\n});","import { ObjectWrappingMap, PartitionedMap } from './map.js';\n\n/**\n * Create a new scope which can access the parent scope,\n * but does not affect it when written. This is suitable for variable definitions\n * within a block node, or function definition.\n *\n * If parent scope has a createSubScope method, it delegates to that. Otherwise,\n * creates an empty map, and copies the parent scope to it, adding in\n * the remaining `args`.\n *\n * @param {Map} parentScope\n * @param {Object} args\n * @returns {PartitionedMap}\n */\nexport function createSubScope(parentScope, args) {\n return new PartitionedMap(parentScope, new ObjectWrappingMap(args), new Set(Object.keys(args)));\n}","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isNode, isConstantNode, isOperatorNode, isParenthesisNode } from '../../utils/is.js';\nimport { map } from '../../utils/array.js';\nimport { createSubScope } from '../../utils/scope.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 * Returns true if the expression starts with a constant, under\n * the current parenthesization:\n * @param {Node} expression\n * @param {string} parenthesis\n * @return {boolean}\n */\n function startsWithConstant(expr, parenthesis) {\n var curNode = expr;\n if (parenthesis === 'auto') {\n while (isParenthesisNode(curNode)) curNode = curNode.content;\n }\n if (isConstantNode(curNode)) return true;\n if (isOperatorNode(curNode)) {\n return startsWithConstant(curNode.args[0], parenthesis);\n }\n return false;\n }\n\n /**\n * Calculate which parentheses are necessary. Gets an OperatorNode\n * (which is the root of the tree) and an Array of Nodes\n * (this.args) and returns an array where 'true' means that an argument\n * has to be enclosed in parentheses whereas 'false' means the opposite.\n *\n * @param {OperatorNode} root\n * @param {string} parenthesis\n * @param {Node[]} args\n * @param {boolean} latex\n * @return {boolean[]}\n * @private\n */\n function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {\n // precedence of the root OperatorNode\n var precedence = getPrecedence(root, parenthesis, implicit);\n var associativity = getAssociativity(root, parenthesis);\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 default:\n return true;\n }\n });\n }\n var result;\n switch (args.length) {\n case 0:\n result = [];\n break;\n case 1:\n // unary operators\n {\n // precedence of the operand\n var operandPrecedence = getPrecedence(args[0], parenthesis, implicit, root);\n\n // handle special cases for LaTeX, where some of the parentheses aren't needed\n if (latex && operandPrecedence !== null) {\n var operandIdentifier;\n var rootIdentifier;\n if (parenthesis === 'keep') {\n operandIdentifier = args[0].getIdentifier();\n rootIdentifier = root.getIdentifier();\n } else {\n // Ignore Parenthesis Nodes when not in 'keep' mode\n operandIdentifier = args[0].getContent().getIdentifier();\n rootIdentifier = root.getContent().getIdentifier();\n }\n if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n result = [false];\n break;\n }\n if (properties[operandPrecedence][operandIdentifier].latexParens === false) {\n result = [false];\n break;\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 if (operandPrecedence <= precedence) {\n // if the operands precedence is lower, parens are needed\n result = [true];\n break;\n }\n\n // otherwise, no parens needed\n result = [false];\n }\n break;\n case 2:\n // binary operators\n {\n var lhsParens; // left hand side needs parenthesis?\n // precedence of the left hand side\n var lhsPrecedence = getPrecedence(args[0], parenthesis, implicit, root);\n // is the root node associative with the left hand side\n var assocWithLhs = isAssociativeWith(root, args[0], parenthesis);\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 var rhsParens; // right hand side needs parenthesis?\n // precedence of the right hand side\n var rhsPrecedence = getPrecedence(args[1], parenthesis, implicit, root);\n // is the root node associative with the right hand side?\n var assocWithRhs = isAssociativeWith(root, args[1], parenthesis);\n if (rhsPrecedence === null) {\n // if the right hand side has no defined precedence, no parens are needed\n // FunctionNode for example\n rhsParens = false;\n } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {\n // In case of equal precedence, if the root node is right associative\n // parens are **never** necessary for the right hand side.\n // If it is left associative however, parens are necessary\n // if the root node isn't associative with the right hand side\n rhsParens = true;\n } else if (rhsPrecedence < precedence) {\n rhsParens = true;\n } else {\n rhsParens = false;\n }\n\n // handle special cases for LaTeX, where some of the parentheses aren't needed\n if (latex) {\n var _rootIdentifier;\n var lhsIdentifier;\n var rhsIdentifier;\n if (parenthesis === 'keep') {\n _rootIdentifier = root.getIdentifier();\n lhsIdentifier = root.args[0].getIdentifier();\n rhsIdentifier = root.args[1].getIdentifier();\n } else {\n // Ignore ParenthesisNodes when not in 'keep' mode\n _rootIdentifier = root.getContent().getIdentifier();\n lhsIdentifier = root.args[0].getContent().getIdentifier();\n rhsIdentifier = root.args[1].getContent().getIdentifier();\n }\n if (lhsPrecedence !== null) {\n if (properties[precedence][_rootIdentifier].latexLeftParens === false) {\n lhsParens = false;\n }\n if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n lhsParens = false;\n }\n }\n if (rhsPrecedence !== null) {\n if (properties[precedence][_rootIdentifier].latexRightParens === false) {\n rhsParens = false;\n }\n if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n rhsParens = false;\n }\n }\n }\n result = [lhsParens, rhsParens];\n }\n break;\n default:\n if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {\n result = args.map(function (arg) {\n var argPrecedence = getPrecedence(arg, parenthesis, implicit, root);\n var assocWithArg = isAssociativeWith(root, arg, parenthesis);\n var argAssociativity = getAssociativity(arg, parenthesis);\n if (argPrecedence === null) {\n // if the argument has no defined precedence, no parens are needed\n return false;\n } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {\n return true;\n } else if (argPrecedence < precedence) {\n return true;\n }\n return false;\n });\n }\n break;\n }\n\n // Handles an edge case of parentheses with implicit multiplication\n // of ConstantNode.\n // In that case, parenthesize ConstantNodes that follow an unparenthesized\n // expression, even though they normally wouldn't be printed.\n if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis !== 'all' && implicit === 'hide') {\n for (var i = 1; i < result.length; ++i) {\n if (startsWithConstant(args[i], parenthesis) && !result[i - 1] && (parenthesis !== 'keep' || !isParenthesisNode(args[i - 1]))) {\n result[i] = true;\n }\n }\n }\n return result;\n }\n class OperatorNode extends Node {\n /**\n * @constructor OperatorNode\n * @extends {Node}\n * An operator with two arguments, like 2+3\n *\n * @param {string} op Operator name, for example '+'\n * @param {string} fn Function name, for example 'add'\n * @param {Node[]} args Operator arguments\n * @param {boolean} [implicit] Is this an implicit multiplication?\n * @param {boolean} [isPercentage] Is this an percentage Operation?\n */\n constructor(op, fn, args, implicit, isPercentage) {\n super();\n // validate input\n if (typeof op !== 'string') {\n throw new TypeError('string expected for parameter \"op\"');\n }\n if (typeof fn !== 'string') {\n throw new TypeError('string expected for parameter \"fn\"');\n }\n if (!Array.isArray(args) || !args.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n }\n this.implicit = implicit === true;\n this.isPercentage = isPercentage === true;\n this.op = op;\n this.fn = fn;\n this.args = args || [];\n }\n get type() {\n return name;\n }\n get isOperatorNode() {\n return true;\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 _compile(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 var fn = getSafeProperty(math, this.fn);\n var evalArgs = map(this.args, function (arg) {\n return arg._compile(math, argNames);\n });\n if (typeof fn === 'function' && fn.rawArgs === true) {\n // pass unevaluated parameters (nodes) to the function\n // \"raw\" evaluation\n var rawArgs = this.args;\n return function evalOperatorNode(scope, args, context) {\n return fn(rawArgs, math, createSubScope(scope, args));\n };\n } else 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 /**\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 forEach(callback) {\n for (var i = 0; i < this.args.length; i++) {\n callback(this.args[i], 'args[' + i + ']', this);\n }\n }\n\n /**\n * Create a new OperatorNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var args = [];\n for (var i = 0; i < this.args.length; i++) {\n args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n }\n return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {OperatorNode}\n */\n clone() {\n return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);\n }\n\n /**\n * Check whether this is an unary OperatorNode:\n * has exactly one argument, like `-a`.\n * @return {boolean}\n * Returns true when an unary operator node, false otherwise.\n */\n isUnary() {\n return this.args.length === 1;\n }\n\n /**\n * Check whether this is a binary OperatorNode:\n * has exactly two arguments, like `a + b`.\n * @return {boolean}\n * Returns true when a binary operator node, false otherwise.\n */\n isBinary() {\n return this.args.length === 2;\n }\n\n /**\n * Get string representation.\n * @param {Object} options\n * @return {string} str\n */\n _toString(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 if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toString(options);\n if (parens[0]) {\n operand = '(' + operand + ')';\n }\n\n // for example for \"not\", we want a space between operand and argument\n var opIsNamed = /[a-zA-Z]+/.test(this.op);\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 }\n\n // fall back to postfix\n return operand + this.op;\n } else if (args.length === 2) {\n var lhs = args[0].toString(options); // left hand side\n var rhs = args[1].toString(options); // right hand side\n if (parens[0]) {\n // left hand side in parenthesis?\n lhs = '(' + lhs + ')';\n }\n if (parens[1]) {\n // right hand side in parenthesis?\n rhs = '(' + rhs + ')';\n }\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return lhs + ' ' + rhs;\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 if (parens[index]) {\n // put in parenthesis?\n arg = '(' + arg + ')';\n }\n return arg;\n });\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return stringifiedArgs.join(' ');\n }\n return stringifiedArgs.join(' ' + this.op + ' ');\n } else {\n // fallback to formatting as a function call\n return this.fn + '(' + this.args.join(', ') + ')';\n }\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n op: this.op,\n fn: this.fn,\n args: this.args,\n implicit: this.implicit,\n isPercentage: this.isPercentage\n };\n }\n\n /**\n * Instantiate an OperatorNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * ```\n * {\"mathjs\": \"OperatorNode\",\n * \"op\": \"+\", \"fn\": \"add\", \"args\": [...],\n * \"implicit\": false,\n * \"isPercentage\":false}\n * ```\n * where mathjs is optional\n * @returns {OperatorNode}\n */\n static fromJSON(json) {\n return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);\n }\n\n /**\n * Get HTML representation.\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(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 if (args.length === 1) {\n // unary operators\n var assoc = getAssociativity(this, parenthesis);\n var operand = args[0].toHTML(options);\n if (parens[0]) {\n operand = '(' + operand + ')';\n }\n if (assoc === 'right') {\n // prefix operator\n return '' + escape(this.op) + '' + operand;\n } else {\n // postfix when assoc === 'left' or undefined\n return operand + '' + escape(this.op) + '';\n }\n } else if (args.length === 2) {\n // binary operatoes\n var lhs = args[0].toHTML(options); // left hand side\n var rhs = args[1].toHTML(options); // right hand side\n if (parens[0]) {\n // left hand side in parenthesis?\n lhs = '(' + lhs + ')';\n }\n if (parens[1]) {\n // right hand side in parenthesis?\n rhs = '(' + rhs + ')';\n }\n if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {\n return lhs + '' + rhs;\n }\n return lhs + '' + escape(this.op) + '' + rhs;\n } else {\n var stringifiedArgs = args.map(function (arg, index) {\n arg = arg.toHTML(options);\n if (parens[index]) {\n // put in parenthesis?\n arg = '(' + arg + ')';\n }\n return arg;\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('');\n }\n return stringifiedArgs.join('' + escape(this.op) + '');\n } else {\n // fallback to formatting as a function call\n return '' + escape(this.fn) + '' + '(' + stringifiedArgs.join(',') + ')';\n }\n }\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(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 if (parens[0]) {\n operand = \"\\\\left(\".concat(operand, \"\\\\right)\");\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 }\n\n // fall back to postfix\n return operand + op;\n } else if (args.length === 2) {\n // binary operators\n var lhs = args[0]; // left hand side\n var lhsTex = lhs.toTex(options);\n if (parens[0]) {\n lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n }\n var rhs = args[1]; // right hand side\n var rhsTex = rhs.toTex(options);\n if (parens[1]) {\n rhsTex = \"\\\\left(\".concat(rhsTex, \"\\\\right)\");\n }\n\n // handle some exceptions (due to the way LaTeX works)\n var lhsIdentifier;\n if (parenthesis === 'keep') {\n lhsIdentifier = lhs.getIdentifier();\n } else {\n // Ignore ParenthesisNodes if in 'keep' mode\n lhsIdentifier = lhs.getContent().getIdentifier();\n }\n switch (this.getIdentifier()) {\n case 'OperatorNode:divide':\n // op contains '\\\\frac' at this point\n return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';\n case 'OperatorNode:pow':\n lhsTex = '{' + lhsTex + '}';\n rhsTex = '{' + rhsTex + '}';\n switch (lhsIdentifier) {\n case 'ConditionalNode': //\n case 'OperatorNode:divide':\n lhsTex = \"\\\\left(\".concat(lhsTex, \"\\\\right)\");\n }\n break;\n case 'OperatorNode:multiply':\n if (this.implicit && implicit === 'hide') {\n return lhsTex + '~' + rhsTex;\n }\n }\n return lhsTex + op + rhsTex;\n } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {\n var texifiedArgs = args.map(function (arg, index) {\n arg = arg.toTex(options);\n if (parens[index]) {\n arg = \"\\\\left(\".concat(arg, \"\\\\right)\");\n }\n return arg;\n });\n if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit && implicit === 'hide') {\n return texifiedArgs.join('~');\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 /**\n * Get identifier.\n * @return {string}\n */\n getIdentifier() {\n return this.type + ':' + this.fn;\n }\n }\n _defineProperty(OperatorNode, \"name\", name);\n return OperatorNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 class ParenthesisNode extends Node {\n /**\n * @constructor ParenthesisNode\n * @extends {Node}\n * A parenthesis node describes manual parenthesis from the user input\n * @param {Node} content\n * @extends {Node}\n */\n constructor(content) {\n super();\n // validate input\n if (!isNode(content)) {\n throw new TypeError('Node expected for parameter \"content\"');\n }\n this.content = content;\n }\n get type() {\n return name;\n }\n get isParenthesisNode() {\n return true;\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 _compile(math, argNames) {\n return this.content._compile(math, argNames);\n }\n\n /**\n * Get the content of the current Node.\n * @return {Node} content\n * @override\n **/\n getContent() {\n return this.content.getContent();\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.content, 'content', this);\n }\n\n /**\n * Create a new ParenthesisNode whose child is the result of calling\n * the provided callback function on the child of this node.\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {ParenthesisNode} Returns a clone of the node\n */\n map(callback) {\n var content = callback(this.content, 'content', this);\n return new ParenthesisNode(content);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {ParenthesisNode}\n */\n clone() {\n return new ParenthesisNode(this.content);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return '(' + this.content.toString(options) + ')';\n }\n return this.content.toString(options);\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n content: this.content\n };\n }\n\n /**\n * Instantiate an ParenthesisNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"ParenthesisNode\", \"content\": ...}`,\n * where mathjs is optional\n * @returns {ParenthesisNode}\n */\n static fromJSON(json) {\n return new ParenthesisNode(json.content);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return '(' + this.content.toHTML(options) + ')';\n }\n return this.content.toHTML(options);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toTex(options) {\n if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {\n return \"\\\\left(\".concat(this.content.toTex(options), \"\\\\right)\");\n }\n return this.content.toTex(options);\n }\n }\n _defineProperty(ParenthesisNode, \"name\", name);\n return ParenthesisNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 * Calculate the necessary parentheses\n * @param {Node} node\n * @param {string} parenthesis\n * @param {string} implicit\n * @return {Object} parentheses\n * @private\n */\n function calculateNecessaryParentheses(node, parenthesis, implicit) {\n var precedence = getPrecedence(node, parenthesis, implicit);\n var parens = {};\n var startPrecedence = getPrecedence(node.start, parenthesis, implicit);\n parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';\n if (node.step) {\n var stepPrecedence = getPrecedence(node.step, parenthesis, implicit);\n parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';\n }\n var endPrecedence = getPrecedence(node.end, parenthesis, implicit);\n parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';\n return parens;\n }\n class RangeNode extends Node {\n /**\n * @constructor RangeNode\n * @extends {Node}\n * create a range\n * @param {Node} start included lower-bound\n * @param {Node} end included upper-bound\n * @param {Node} [step] optional step\n */\n constructor(start, end, step) {\n super();\n // validate inputs\n if (!isNode(start)) throw new TypeError('Node expected');\n if (!isNode(end)) throw new TypeError('Node expected');\n if (step && !isNode(step)) throw new TypeError('Node expected');\n if (arguments.length > 3) throw new Error('Too many arguments');\n this.start = start; // included lower-bound\n this.end = end; // included upper-bound\n this.step = step || null; // optional step\n }\n get type() {\n return name;\n }\n get isRangeNode() {\n return true;\n }\n\n /**\n * Check whether the RangeNode needs the `end` symbol to be defined.\n * This end is the size of the Matrix in current dimension.\n * @return {boolean}\n */\n needsEnd() {\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 /**\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 _compile(math, argNames) {\n var range = math.range;\n var evalStart = this.start._compile(math, argNames);\n var evalEnd = this.end._compile(math, argNames);\n if (this.step) {\n var evalStep = this.step._compile(math, argNames);\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 /**\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 forEach(callback) {\n callback(this.start, 'start', this);\n callback(this.end, 'end', this);\n if (this.step) {\n callback(this.step, 'step', this);\n }\n }\n\n /**\n * Create a new RangeNode whose children are the results of calling\n * the provided callback function for each child 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 map(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 /**\n * Create a clone of this node, a shallow copy\n * @return {RangeNode}\n */\n clone() {\n return new RangeNode(this.start, this.end, this.step && this.step);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n\n // format string as start:step:stop\n var str;\n var start = this.start.toString(options);\n if (parens.start) {\n start = '(' + start + ')';\n }\n str = start;\n if (this.step) {\n var step = this.step.toString(options);\n if (parens.step) {\n step = '(' + step + ')';\n }\n str += ':' + step;\n }\n var end = this.end.toString(options);\n if (parens.end) {\n end = '(' + end + ')';\n }\n str += ':' + end;\n return str;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n start: this.start,\n end: this.end,\n step: this.step\n };\n }\n\n /**\n * Instantiate an RangeNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n * where mathjs is optional\n * @returns {RangeNode}\n */\n static fromJSON(json) {\n return new RangeNode(json.start, json.end, json.step);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n\n // format string as start:step:stop\n var str;\n var start = this.start.toHTML(options);\n if (parens.start) {\n start = '(' + start + ')';\n }\n str = start;\n if (this.step) {\n var step = this.step.toHTML(options);\n if (parens.step) {\n step = '(' + step + ')';\n }\n str += ':' + step;\n }\n var end = this.end.toHTML(options);\n if (parens.end) {\n end = '(' + end + ')';\n }\n str += ':' + end;\n return str;\n }\n\n /**\n * Get LaTeX representation\n * @params {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);\n var str = this.start.toTex(options);\n if (parens.start) {\n str = \"\\\\left(\".concat(str, \"\\\\right)\");\n }\n if (this.step) {\n var step = this.step.toTex(options);\n if (parens.step) {\n step = \"\\\\left(\".concat(step, \"\\\\right)\");\n }\n str += ':' + step;\n }\n var end = this.end.toTex(options);\n if (parens.end) {\n end = \"\\\\left(\".concat(end, \"\\\\right)\");\n }\n str += ':' + end;\n return str;\n }\n }\n _defineProperty(RangeNode, \"name\", name);\n return RangeNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { 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 var operatorMap = {\n equal: '==',\n unequal: '!=',\n smaller: '<',\n larger: '>',\n smallerEq: '<=',\n largerEq: '>='\n };\n class RelationalNode extends Node {\n /**\n * A node representing a chained conditional expression, such as 'x > y > z'\n *\n * @param {String[]} conditionals\n * An array of conditional operators used to compare the parameters\n * @param {Node[]} params\n * The parameters that will be compared\n *\n * @constructor RelationalNode\n * @extends {Node}\n */\n constructor(conditionals, params) {\n super();\n if (!Array.isArray(conditionals)) {\n throw new TypeError('Parameter conditionals must be an array');\n }\n if (!Array.isArray(params)) {\n throw new TypeError('Parameter params must be an array');\n }\n if (conditionals.length !== params.length - 1) {\n throw new TypeError('Parameter params must contain exactly one more element ' + 'than parameter conditionals');\n }\n this.conditionals = conditionals;\n this.params = params;\n }\n get type() {\n return name;\n }\n get isRelationalNode() {\n return true;\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 _compile(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 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 if (!condFn(evalLhs, evalRhs)) {\n return false;\n }\n }\n return true;\n };\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);\n }\n\n /**\n * Create a new RelationalNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {RelationalNode}\n */\n clone() {\n return new RelationalNode(this.conditionals, this.params);\n }\n\n /**\n * Get string representation.\n * @param {Object} options\n * @return {string} str\n */\n _toString(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);\n });\n var ret = paramStrings[0];\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += ' ' + operatorMap[this.conditionals[i]];\n ret += ' ' + paramStrings[i + 1];\n }\n return ret;\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n conditionals: this.conditionals,\n params: this.params\n };\n }\n\n /**\n * Instantiate a RelationalNode from its JSON representation\n * @param {Object} json\n * An object structured like\n * `{\"mathjs\": \"RelationalNode\", \"conditionals\": ..., \"params\": ...}`,\n * where mathjs is optional\n * @returns {RelationalNode}\n */\n static fromJSON(json) {\n return new RelationalNode(json.conditionals, json.params);\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toHTML(options) + ')' : p.toHTML(options);\n });\n var ret = paramStrings[0];\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += '' + escape(operatorMap[this.conditionals[i]]) + '' + paramStrings[i + 1];\n }\n return ret;\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(options) {\n var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';\n var precedence = getPrecedence(this, parenthesis, options && options.implicit);\n var paramStrings = this.params.map(function (p, index) {\n var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);\n return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\\\left(' + p.toTex(options) + '\\right)' : p.toTex(options);\n });\n var ret = paramStrings[0];\n for (var i = 0; i < this.conditionals.length; i++) {\n ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1];\n }\n return ret;\n }\n }\n _defineProperty(RelationalNode, \"name\", name);\n return RelationalNode;\n}, {\n isClass: true,\n isNode: true\n});","import { escape } from '../../utils/string.js';\nimport { getSafeProperty } from '../../utils/customs.js';\nimport { factory } from '../../utils/factory.js';\nimport { toSymbol } from '../../utils/latex.js';\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 * 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 class SymbolNode extends Node {\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 constructor(name) {\n super();\n // validate input\n if (typeof name !== 'string') {\n throw new TypeError('String expected for parameter \"name\"');\n }\n this.name = name;\n }\n get type() {\n return 'SymbolNode';\n }\n get isSymbolNode() {\n return true;\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 _compile(math, argNames) {\n var name = this.name;\n if (argNames[name] === true) {\n // this is a FunctionAssignment argument\n // (like an x when inside the expression of a function\n // assignment `f(x) = ...`)\n return function (scope, args, context) {\n return getSafeProperty(args, name);\n };\n } else if (name in math) {\n return function (scope, args, context) {\n return scope.has(name) ? scope.get(name) : getSafeProperty(math, name);\n };\n } else {\n var isUnit = isValuelessUnit(name);\n return function (scope, args, context) {\n return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);\n };\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n // nothing to do, we don't have any children\n }\n\n /**\n * Create a new SymbolNode with children produced by the given callback.\n * Trivial since a SymbolNode has no children\n * @param {function(child: Node, path: string, parent: Node) : Node} callback\n * @returns {SymbolNode} Returns a clone of the node\n */\n map(callback) {\n return this.clone();\n }\n\n /**\n * Throws an error 'Undefined symbol {name}'\n * @param {string} name\n */\n static onUndefinedSymbol(name) {\n throw new Error('Undefined symbol ' + name);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {SymbolNode}\n */\n clone() {\n return new SymbolNode(this.name);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toString(options) {\n return this.name;\n }\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toHTML(options) {\n var name = escape(this.name);\n if (name === 'true' || name === 'false') {\n return '' + name + '';\n } else if (name === 'i') {\n return '' + name + '';\n } else if (name === 'Infinity') {\n return '' + name + '';\n } else if (name === 'NaN') {\n return '' + name + '';\n } else if (name === 'null') {\n return '' + name + '';\n } else if (name === 'undefined') {\n return '' + name + '';\n }\n return '' + name + '';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: 'SymbolNode',\n name: this.name\n };\n }\n\n /**\n * Instantiate a SymbolNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"SymbolNode\", name: \"x\"}`,\n * where mathjs is optional\n * @returns {SymbolNode}\n */\n static fromJSON(json) {\n return new SymbolNode(json.name);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n * @override\n */\n _toTex(options) {\n var isUnit = false;\n if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {\n isUnit = true;\n }\n var symbol = toSymbol(this.name, isUnit);\n if (symbol[0] === '\\\\') {\n // no space needed if the symbol starts with '\\'\n return symbol;\n }\n // the space prevents symbols from breaking stuff like '\\cdot'\n // if it's written right before the symbol\n return ' ' + symbol;\n }\n }\n return SymbolNode;\n}, {\n isClass: true,\n isNode: true\n});","import _defineProperty from \"@babel/runtime/helpers/defineProperty\";\nimport { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';\nimport { escape, format } from '../../utils/string.js';\nimport { hasOwnProperty } from '../../utils/object.js';\nimport { getSafeProperty, getSafeMethod } from '../../utils/customs.js';\nimport { createSubScope } from '../../utils/scope.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 _FunctionNode;\n var {\n math,\n Node,\n SymbolNode\n } = _ref;\n /* format to fixed length */\n var strin = entity => format(entity, {\n truncate: 78\n });\n\n /*\n * Expand a LaTeX template\n *\n * @param {string} template\n * @param {Node} node\n * @param {Object} options\n * @private\n **/\n function expandTemplate(template, node, options) {\n var latex = '';\n\n // Match everything of the form ${identifier} or ${identifier[2]} or $$\n // while submatching identifier and 2 (in the second case)\n var regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi;\n var inputPos = 0; // position in the input string\n var match;\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 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 if (!property) {\n throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');\n }\n if (match[2] === undefined) {\n // no square brackets\n switch (typeof property) {\n case 'string':\n latex += property;\n break;\n case 'object':\n if (isNode(property)) {\n latex += property.toTex(options);\n } else if (Array.isArray(property)) {\n // make array of Nodes into comma separated list\n latex += property.map(function (arg, index) {\n if (isNode(arg)) {\n return arg.toTex(options);\n }\n throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');\n }).join(',');\n } else {\n throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n }\n break;\n default:\n throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');\n }\n } else {\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 latex += template.slice(inputPos); // append rest of the template\n\n return latex;\n }\n class FunctionNode extends Node {\n /**\n * @constructor FunctionNode\n * @extends {./Node}\n * invoke a list with arguments on a node\n * @param {./Node | string} fn\n * Item resolving to a function on which to invoke\n * the arguments, typically a SymbolNode or AccessorNode\n * @param {./Node[]} args\n */\n constructor(fn, args, optional) {\n super();\n if (typeof fn === 'string') {\n fn = new SymbolNode(fn);\n }\n\n // validate input\n if (!isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"');\n if (!Array.isArray(args) || !args.every(isNode)) {\n throw new TypeError('Array containing Nodes expected for parameter \"args\"');\n }\n var optionalType = typeof optional;\n if (!(optionalType === 'undefined' || optionalType === 'boolean')) {\n throw new TypeError('optional flag, if specified, must be boolean');\n }\n this.fn = fn;\n this.args = args || [];\n this.optional = !!optional;\n }\n\n // readonly property name\n get name() {\n return this.fn.name || '';\n }\n get type() {\n return name;\n }\n get isFunctionNode() {\n return true;\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 _compile(math, argNames) {\n // compile arguments\n var evalArgs = this.args.map(arg => arg._compile(math, argNames));\n var fromOptionalChaining = this.optional || isAccessorNode(this.fn) && this.fn.optionalChaining;\n if (isSymbolNode(this.fn)) {\n var _name = this.fn.name;\n if (!argNames[_name]) {\n // we can statically determine whether the function\n // has the rawArgs property\n var fn = _name in math ? getSafeProperty(math, _name) : undefined;\n var isRaw = typeof fn === 'function' && fn.rawArgs === true;\n var resolveFn = scope => {\n var value;\n if (scope.has(_name)) {\n value = scope.get(_name);\n } else if (_name in math) {\n value = getSafeProperty(math, _name);\n } else if (fromOptionalChaining) value = undefined;else return FunctionNode.onUndefinedFunction(_name);\n if (typeof value === 'function' || fromOptionalChaining && value === undefined) {\n return value;\n }\n throw new TypeError(\"'\".concat(_name, \"' is not a function; its value is:\\n \").concat(strin(value)));\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 var fn = resolveFn(scope);\n\n // the original function can be overwritten in the scope with a non-rawArgs function\n if (fn.rawArgs === true) {\n return fn(rawArgs, math, createSubScope(scope, args));\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn(...values);\n }\n };\n } else {\n // \"regular\" evaluation\n switch (evalArgs.length) {\n case 0:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n return fn();\n };\n case 1:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n var evalArg0 = evalArgs[0];\n return fn(evalArg0(scope, args, context));\n };\n case 2:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n var evalArg0 = evalArgs[0];\n var evalArg1 = evalArgs[1];\n return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));\n };\n default:\n return function evalFunctionNode(scope, args, context) {\n var fn = resolveFn(scope);\n if (fromOptionalChaining && fn === undefined) return undefined;\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn(...values);\n };\n }\n }\n } else {\n // the function symbol is an argName\n var _rawArgs = this.args;\n return function evalFunctionNode(scope, args, context) {\n var fn = getSafeProperty(args, _name);\n if (fromOptionalChaining && fn === undefined) return undefined;\n if (typeof fn !== 'function') {\n throw new TypeError(\"Argument '\".concat(_name, \"' was not a function; received: \").concat(strin(fn)));\n }\n if (fn.rawArgs) {\n // \"Raw\" evaluation\n return fn(_rawArgs, math, createSubScope(scope, args));\n } else {\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(fn, values);\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:\n // the object of the AccessorNode\n\n var evalObject = this.fn.object._compile(math, argNames);\n var prop = this.fn.index.getObjectProperty();\n var _rawArgs2 = this.args;\n return function evalFunctionNode(scope, args, context) {\n var object = evalObject(scope, args, context);\n\n // Optional chaining: if the base object is nullish, short-circuit to undefined\n if (fromOptionalChaining && (object == null || object[prop] === undefined)) {\n return undefined;\n }\n var fn = getSafeMethod(object, prop);\n if (fn !== null && fn !== void 0 && fn.rawArgs) {\n // \"Raw\" evaluation\n return fn(_rawArgs2, math, createSubScope(scope, args));\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(object, values);\n }\n };\n } else {\n // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n // we have to dynamically determine whether the function has the\n // rawArgs property\n var fnExpr = this.fn.toString();\n var evalFn = this.fn._compile(math, argNames);\n var _rawArgs3 = this.args;\n return function evalFunctionNode(scope, args, context) {\n var fn = evalFn(scope, args, context);\n if (fromOptionalChaining && fn === undefined) return undefined;\n if (typeof fn !== 'function') {\n throw new TypeError(\"Expression '\".concat(fnExpr, \"' did not evaluate to a function; value is:\") + \"\\n \".concat(strin(fn)));\n }\n if (fn.rawArgs) {\n // \"Raw\" evaluation\n return fn(_rawArgs3, math, createSubScope(scope, args));\n } else {\n // \"regular\" evaluation\n var values = evalArgs.map(evalArg => evalArg(scope, args, context));\n return fn.apply(fn, values);\n }\n };\n }\n }\n\n /**\n * Execute a callback for each of the child nodes of this node\n * @param {function(child: Node, path: string, parent: Node)} callback\n */\n forEach(callback) {\n callback(this.fn, 'fn', this);\n for (var i = 0; i < this.args.length; i++) {\n callback(this.args[i], 'args[' + i + ']', this);\n }\n }\n\n /**\n * Create a new FunctionNode whose children are the results of calling\n * the provided callback function for each child 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 map(callback) {\n var fn = this._ifNode(callback(this.fn, 'fn', this));\n var args = [];\n for (var i = 0; i < this.args.length; i++) {\n args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));\n }\n return new FunctionNode(fn, args);\n }\n\n /**\n * Create a clone of this node, a shallow copy\n * @return {FunctionNode}\n */\n clone() {\n return new FunctionNode(this.fn, this.args.slice(0));\n }\n\n /**\n * Throws an error 'Undefined function {name}'\n * @param {string} name\n */\n\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 toString(options) {\n var customString;\n var name = this.fn.toString(options);\n if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, name)) {\n // callback is a map of callback functions\n customString = options.handler[name](this, options);\n }\n if (typeof customString !== 'undefined') {\n return customString;\n }\n\n // fall back to Node's toString\n return super.toString(options);\n }\n\n /**\n * Get string representation\n * @param {Object} options\n * @return {string} str\n */\n _toString(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);\n\n // format the arguments like \"add(2, 4.2)\"\n return fn + '(' + args.join(', ') + ')';\n }\n\n /**\n * Get a JSON representation of the node\n * @returns {Object}\n */\n toJSON() {\n return {\n mathjs: name,\n fn: this.fn,\n args: this.args\n };\n }\n\n /**\n * Instantiate an AssignmentNode from its JSON representation\n * @param {Object} json An object structured like\n * `{\"mathjs\": \"FunctionNode\", fn: ..., args: ...}`,\n * where mathjs is optional\n * @returns {FunctionNode}\n */\n\n /**\n * Get HTML representation\n * @param {Object} options\n * @return {string} str\n */\n _toHTML(options) {\n var args = this.args.map(function (arg) {\n return arg.toHTML(options);\n });\n\n // format the arguments like \"add(2, 4.2)\"\n return '' + escape(this.fn) + '(' + args.join(',') + ')';\n }\n\n /**\n * Get LaTeX representation. (wrapper function)\n * This overrides parts of Node's toTex function.\n * If callback is an object containing callbacks, it\n * calls the correct callback for the current node,\n * otherwise it falls back to calling Node's toTex\n * function.\n *\n * @param {Object} options\n * @return {string}\n */\n toTex(options) {\n var customTex;\n if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, this.name)) {\n // callback is a map of callback functions\n customTex = options.handler[this.name](this, options);\n }\n if (typeof customTex !== 'undefined') {\n return customTex;\n }\n\n // fall back to Node's toTex\n return super.toTex(options);\n }\n\n /**\n * Get LaTeX representation\n * @param {Object} options\n * @return {string} str\n */\n _toTex(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 if (latexFunctions[this.name]) {\n latexConverter = latexFunctions[this.name];\n }\n\n // toTex property on the function itself\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 var customToTex;\n switch (typeof latexConverter) {\n case 'function':\n // a callback function\n customToTex = latexConverter(this, options);\n break;\n case 'string':\n // a template string\n customToTex = expandTemplate(latexConverter, this, options);\n break;\n case 'object':\n // an object with different \"converters\" for different\n // numbers of arguments\n switch (typeof latexConverter[args.length]) {\n case 'function':\n customToTex = latexConverter[args.length](this, options);\n break;\n case 'string':\n customToTex = expandTemplate(latexConverter[args.length], this, options);\n break;\n }\n }\n if (typeof customToTex !== 'undefined') {\n return customToTex;\n }\n return expandTemplate(defaultTemplate, this, options);\n }\n\n /**\n * Get identifier.\n * @return {string}\n */\n getIdentifier() {\n return this.type + ':' + this.name;\n }\n }\n _FunctionNode = FunctionNode;\n _defineProperty(FunctionNode, \"name\", name);\n _defineProperty(FunctionNode, \"onUndefinedFunction\", function (name) {\n throw new Error('Undefined function ' + name);\n });\n _defineProperty(FunctionNode, \"fromJSON\", function (json) {\n return new _FunctionNode(json.fn, json.args);\n });\n return FunctionNode;\n}, {\n isClass: true,\n isNode: true\n});","import _extends from \"@babel/runtime/helpers/extends\";\nimport { factory } from '../utils/factory.js';\nimport { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode, rule2Node } from '../utils/is.js';\nimport { deepMap } from '../utils/collection.js';\nimport { safeNumberType } from '../utils/number.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 * Parse an expression. Returns a node tree, which can be evaluated by\n * invoking node.evaluate() or transformed into a functional object via node.compile().\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')\n * node2.evaluate(scope) // 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}} [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 Array__Matrix(expressions) {\n return parseMultiple(expressions, {});\n },\n 'string, Object': function string_Object(expression, options) {\n var extraNodes = options.nodes !== undefined ? options.nodes : {};\n return parseStart(expression, extraNodes);\n },\n 'Array | Matrix, Object': parseMultiple\n });\n function parseMultiple(expressions) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n var extraNodes = options.nodes !== undefined ? options.nodes : {};\n\n // parse an array or matrix with expressions\n return deepMap(expressions, function (elem) {\n if (typeof elem !== 'string') throw new TypeError('String expected');\n return parseStart(elem, extraNodes);\n });\n }\n\n // token types enumeration\n var TOKENTYPE = {\n NULL: 0,\n DELIMITER: 1,\n NUMBER: 2,\n SYMBOL: 3,\n UNKNOWN: 4\n };\n\n // map with all delimiters\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 '>>': true,\n '>>>': true\n };\n\n // map with all named delimiters\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\n };\n var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];\n var ESCAPE_CHARACTERS = {\n '\"': '\"',\n \"'\": \"'\",\n '\\\\': '\\\\',\n '/': '/',\n b: '\\b',\n f: '\\f',\n n: '\\n',\n r: '\\r',\n t: '\\t'\n // note that \\u is handled separately in parseStringToken()\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 function currentString(state, length) {\n return state.expression.substr(state.index, length);\n }\n\n /**\n * View the current character. Returns '' if end of expression is reached.\n *\n * @param {Object} state\n * @returns {string}\n * @private\n */\n function currentCharacter(state) {\n return currentString(state, 1);\n }\n\n /**\n * Get the next character from the expression.\n * The character is stored into the char c. If the end of the expression is\n * reached, the function puts an empty string in c.\n * @private\n */\n function next(state) {\n state.index++;\n }\n\n /**\n * Preview the previous character from the expression.\n * @return {string} cNext\n * @private\n */\n function prevCharacter(state) {\n return state.expression.charAt(state.index - 1);\n }\n\n /**\n * Preview the next character from the expression.\n * @return {string} cNext\n * @private\n */\n function nextCharacter(state) {\n return state.expression.charAt(state.index + 1);\n }\n\n /**\n * Get next token in the current string expr.\n * The token and token type are available as token and tokenType\n * @private\n */\n function getToken(state) {\n state.tokenType = TOKENTYPE.NULL;\n state.token = '';\n state.comment = '';\n\n // skip over ignored characters:\n while (true) {\n // comments:\n if (currentCharacter(state) === '#') {\n while (currentCharacter(state) !== '\\n' && currentCharacter(state) !== '') {\n state.comment += currentCharacter(state);\n next(state);\n }\n }\n // whitespace: space, tab, and newline when inside parameters\n if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n next(state);\n } else {\n break;\n }\n }\n\n // check for end of expression\n if (currentCharacter(state) === '') {\n // token is still empty\n state.tokenType = TOKENTYPE.DELIMITER;\n return;\n }\n\n // check for new line character\n if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = currentCharacter(state);\n next(state);\n return;\n }\n var c1 = currentCharacter(state);\n var c2 = currentString(state, 2);\n var c3 = currentString(state, 3);\n if (c3.length === 3 && DELIMITERS[c3]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c3;\n next(state);\n next(state);\n next(state);\n return;\n }\n\n // check for delimiters consisting of 2 characters\n // Special case: the check for '?.' is to prevent a case like 'a?.3:.7' from being interpreted as optional chaining\n // TODO: refactor the tokenization into some better way to deal with cases like 'a?.3:.7', see https://github.com/josdejong/mathjs/pull/3584\n if (c2.length === 2 && DELIMITERS[c2] && (c2 !== '?.' || !parse.isDigit(state.expression.charAt(state.index + 2)))) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c2;\n next(state);\n next(state);\n return;\n }\n\n // check for delimiters consisting of 1 character\n if (DELIMITERS[c1]) {\n state.tokenType = TOKENTYPE.DELIMITER;\n state.token = c1;\n next(state);\n return;\n }\n\n // check for a number\n if (parse.isDigitDot(c1)) {\n state.tokenType = TOKENTYPE.NUMBER;\n\n // check for binary, octal, or hex\n var _c = currentString(state, 2);\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 while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (currentCharacter(state) === '.') {\n // this number has a radix point\n state.token += '.';\n next(state);\n // get the digits after the radix\n while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n } else if (currentCharacter(state) === 'i') {\n // this number has a word size suffix\n state.token += 'i';\n next(state);\n // get the word size\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n }\n return;\n }\n\n // get number, can have a single dot\n if (currentCharacter(state) === '.') {\n state.token += currentCharacter(state);\n next(state);\n if (!parse.isDigit(currentCharacter(state))) {\n // this is no number, it is just a dot (can be dot notation)\n state.tokenType = TOKENTYPE.DELIMITER;\n return;\n }\n } else {\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n }\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {\n if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {\n state.token += currentCharacter(state);\n next(state);\n if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n state.token += currentCharacter(state);\n next(state);\n }\n // Scientific notation MUST be followed by an exponent\n if (!parse.isDigit(currentCharacter(state))) {\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n while (parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n } else if (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {\n next(state);\n throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"');\n }\n }\n return;\n }\n\n // check for variables, functions, named operators\n if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {\n while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n state.token += currentCharacter(state);\n next(state);\n }\n if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {\n state.tokenType = TOKENTYPE.DELIMITER;\n } else {\n state.tokenType = TOKENTYPE.SYMBOL;\n }\n return;\n }\n\n // something unknown is found, wrong characters -> a syntax error\n state.tokenType = TOKENTYPE.UNKNOWN;\n while (currentCharacter(state) !== '') {\n state.token += currentCharacter(state);\n next(state);\n }\n throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"');\n }\n\n /**\n * Get next token and skip newline tokens\n */\n function getTokenSkipNewline(state) {\n do {\n getToken(state);\n } while (state.token === '\\n'); // eslint-disable-line no-unmodified-loop-condition\n }\n\n /**\n * Open parameters.\n * New line characters will be ignored until closeParams(state) is called\n */\n function openParams(state) {\n state.nestingLevel++;\n }\n\n /**\n * Close parameters.\n * New line characters will no longer be ignored\n */\n function closeParams(state) {\n state.nestingLevel--;\n }\n\n /**\n * Checks whether the current character `c` is a valid alpha character:\n *\n * - A latin letter (upper or lower case) Ascii: a-z, A-Z\n * - An underscore Ascii: _\n * - A dollar sign Ascii: $\n * - A latin letter with accents Unicode: \\u00C0 - \\u02AF\n * - A greek letter Unicode: \\u0370 - \\u03FF\n * - A mathematical alphanumeric symbol Unicode: \\u{1D400} - \\u{1D7FF} excluding invalid code points\n *\n * The previous and next characters are needed to determine whether\n * this character is part of a unicode surrogate pair.\n *\n * @param {string} c Current character in the expression\n * @param {string} cPrev Previous character\n * @param {string} cNext Next character\n * @return {boolean}\n */\n parse.isAlpha = function isAlpha(c, cPrev, cNext) {\n return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);\n };\n\n /**\n * Test whether a character is a valid latin, greek, or letter-like character\n * @param {string} c\n * @return {boolean}\n */\n parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {\n return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c);\n };\n\n /**\n * Test whether two given 16 bit characters form a surrogate pair of a\n * unicode math symbol.\n *\n * https://unicode-table.com/en/\n * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode\n *\n * Note: In ES6 will be unicode aware:\n * https://stackoverflow.com/questions/280712/javascript-unicode-regexes\n * https://mathiasbynens.be/notes/es6-unicode-regex\n *\n * @param {string} high\n * @param {string} low\n * @return {boolean}\n */\n parse.isValidMathSymbol = function isValidMathSymbol(high, low) {\n return /^[\\uD835]$/.test(high) && /^[\\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 /**\n * Check whether given character c is a white space character: space, tab, or enter\n * @param {string} c\n * @param {number} nestingLevel\n * @return {boolean}\n */\n parse.isWhitespace = function isWhitespace(c, nestingLevel) {\n // TODO: also take '\\r' carriage return as newline? Or does that give problems on mac?\n return c === ' ' || c === '\\t' || c === '\\u00A0' || c === '\\n' && nestingLevel > 0;\n };\n\n /**\n * Test whether the character c is a decimal mark (dot).\n * This is the case when it's not the start of a delimiter '.*', './', or '.^'\n * @param {string} c\n * @param {string} cNext\n * @return {boolean}\n */\n parse.isDecimalMark = function isDecimalMark(c, cNext) {\n return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';\n };\n\n /**\n * checks if the given char c is a digit or dot\n * @param {string} c a string with one character\n * @return {boolean}\n */\n parse.isDigitDot = function isDigitDot(c) {\n return c >= '0' && c <= '9' || c === '.';\n };\n\n /**\n * checks if the given char c is a digit\n * @param {string} c a string with one character\n * @return {boolean}\n */\n parse.isDigit = function isDigit(c) {\n return c >= '0' && c <= '9';\n };\n\n /**\n * Start of the parse levels below, in order of precedence\n * @return {Node} node\n * @private\n */\n function parseStart(expression, extraNodes) {\n var state = initialState();\n _extends(state, {\n expression,\n extraNodes\n });\n getToken(state);\n var node = parseBlock(state);\n\n // check for garbage at the end of the expression\n // an expression ends with a empty character '' and tokenType DELIMITER\n if (state.token !== '') {\n if (state.tokenType === TOKENTYPE.DELIMITER) {\n // user entered a not existing operator like \"//\"\n\n // TODO: give hints for aliases, for example with \"<>\" give as hint \" did you mean !== ?\"\n throw createError(state, 'Unexpected operator ' + state.token);\n } else {\n throw createSyntaxError(state, 'Unexpected part \"' + state.token + '\"');\n }\n }\n return node;\n }\n\n /**\n * Parse a block with expressions. Expressions can be separated by a newline\n * character '\\n', or by a semicolon ';'. In case of a semicolon, no output\n * of the preceding line is returned.\n * @return {Node} node\n * @private\n */\n function parseBlock(state) {\n var node;\n var blocks = [];\n var visible;\n if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n node = parseAssignment(state);\n if (state.comment) {\n node.comment = state.comment;\n }\n }\n\n // TODO: simplify this loop\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,\n visible\n });\n }\n getToken(state);\n if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n node = parseAssignment(state);\n if (state.comment) {\n node.comment = state.comment;\n }\n visible = state.token !== ';';\n blocks.push({\n node,\n visible\n });\n }\n }\n if (blocks.length > 0) {\n return new BlockNode(blocks);\n } else {\n if (!node) {\n node = new ConstantNode(undefined);\n if (state.comment) {\n node.comment = state.comment;\n }\n }\n return node;\n }\n }\n\n /**\n * Assignment of a function or variable,\n * - can be a variable like 'a=2.3'\n * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'\n * - defining a function like 'f(x) = x^2'\n * @return {Node} node\n * @private\n */\n function parseAssignment(state) {\n var name, args, value, valid;\n var node = parseConditional(state);\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 if (node.optionalChaining) {\n throw createSyntaxError(state, 'Cannot assign to optional chain');\n }\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 if (valid) {\n getTokenSkipNewline(state);\n value = parseAssignment(state);\n return new FunctionAssignmentNode(name, args, value);\n }\n }\n throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');\n }\n return node;\n }\n\n /**\n * conditional operation\n *\n * condition ? truePart : falsePart\n *\n * Note: conditional operator is right-associative\n *\n * @return {Node} node\n * @private\n */\n function parseConditional(state) {\n var node = parseLogicalOr(state);\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);\n\n // restore the previous conditional level\n state.conditionalLevel = prev;\n }\n return node;\n }\n\n /**\n * logical or, 'x or y'\n * @return {Node} node\n * @private\n */\n function parseLogicalOr(state) {\n var node = parseLogicalXor(state);\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 return node;\n }\n\n /**\n * logical exclusive or, 'x xor y'\n * @return {Node} node\n * @private\n */\n function parseLogicalXor(state) {\n var node = parseLogicalAnd(state);\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 return node;\n }\n\n /**\n * logical and, 'x and y'\n * @return {Node} node\n * @private\n */\n function parseLogicalAnd(state) {\n var node = parseBitwiseOr(state);\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 return node;\n }\n\n /**\n * bitwise or, 'x | y'\n * @return {Node} node\n * @private\n */\n function parseBitwiseOr(state) {\n var node = parseBitwiseXor(state);\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 return node;\n }\n\n /**\n * bitwise exclusive or (xor), 'x ^| y'\n * @return {Node} node\n * @private\n */\n function parseBitwiseXor(state) {\n var node = parseBitwiseAnd(state);\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 return node;\n }\n\n /**\n * bitwise and, 'x & y'\n * @return {Node} node\n * @private\n */\n function parseBitwiseAnd(state) {\n var node = parseRelational(state);\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 return node;\n }\n\n /**\n * Parse a chained conditional, like 'a > b >= c'\n * @return {Node} node\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 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 if (params.length === 1) {\n return params[0];\n } else if (params.length === 2) {\n return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);\n } else {\n return new RelationalNode(conditionals.map(c => c.fn), params);\n }\n }\n\n /**\n * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n * @return {Node} node\n * @private\n */\n function parseShift(state) {\n var node, name, fn, params;\n node = parseConversion(state);\n var operators = {\n '<<': 'leftShift',\n '>>': 'rightArithShift',\n '>>>': 'rightLogShift'\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 return node;\n }\n\n /**\n * conversion operators 'to' and 'in'\n * @return {Node} node\n * @private\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 while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n if (name === 'in' && '])},;'.includes(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 return node;\n }\n\n /**\n * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n * @return {Node} node\n * @private\n */\n function parseRange(state) {\n var node;\n var params = [];\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 if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {\n // we ignore the range operator when a conditional operator is being processed on the same level\n params.push(node);\n\n // parse step and end\n while (state.token === ':' && params.length < 3) {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\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 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 return node;\n }\n\n /**\n * add or subtract\n * @return {Node} node\n * @private\n */\n function parseAddSubtract(state) {\n var node, name, fn, params;\n node = parseMultiplyDivideModulus(state);\n var operators = {\n '+': 'add',\n '-': 'subtract'\n };\n while (hasOwnProperty(operators, state.token)) {\n name = state.token;\n fn = operators[name];\n getTokenSkipNewline(state);\n var rightNode = parseMultiplyDivideModulus(state);\n if (rightNode.isPercentage) {\n params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];\n } else {\n params = [node, rightNode];\n }\n node = new OperatorNode(name, fn, params);\n }\n return node;\n }\n\n /**\n * multiply, divide, modulus\n * @return {Node} node\n * @private\n */\n function parseMultiplyDivideModulus(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 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 return node;\n }\n\n /**\n * implicit multiplication\n * @return {Node} node\n * @private\n */\n function parseImplicitMultiplication(state) {\n var node, last;\n node = parseRule2(state);\n last = node;\n while (true) {\n if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.token === 'in' && isOperatorNode(node) && node.fn === 'unaryMinus' && isConstantNode(node.args[0]) || 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 /* implicit */);\n } else {\n break;\n }\n }\n return node;\n }\n\n /**\n * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n * And as amended in https://github.com/josdejong/mathjs/issues/2370#issuecomment-1054052164\n * Explicit division gets higher precedence than implicit multiplication\n * when the division matches this pattern:\n * [unaryPrefixOp]?[number] / [number] [symbol]\n * @return {Node} node\n * @private\n */\n function parseRule2(state) {\n var node = parseUnaryPercentage(state);\n var last = node;\n var tokenStates = [];\n while (true) {\n // Match the \"number /\" part of the pattern \"number / number symbol\"\n if (state.token === '/' && rule2Node(last)) {\n // Look ahead to see if the next token is a number\n tokenStates.push(_extends({}, state));\n getTokenSkipNewline(state);\n\n // Match the \"number / number\" part of the pattern\n if (state.tokenType === TOKENTYPE.NUMBER) {\n // Look ahead again\n tokenStates.push(_extends({}, state));\n getTokenSkipNewline(state);\n\n // Match the \"symbol\" part of the pattern, or a left parenthesis\n if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(' || state.token === 'in') {\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 tokenStates.pop();\n last = parseUnaryPercentage(state);\n node = new OperatorNode('/', 'divide', [node, last]);\n } else {\n // Not a match, so rewind\n tokenStates.pop();\n _extends(state, tokenStates.pop());\n break;\n }\n } else {\n // Not a match, so rewind\n _extends(state, tokenStates.pop());\n break;\n }\n } else {\n break;\n }\n }\n return node;\n }\n\n /**\n * Unary percentage operator (treated as `value / 100`)\n * @return {Node} node\n * @private\n */\n function parseUnaryPercentage(state) {\n var node = parseUnary(state);\n if (state.token === '%') {\n var previousState = _extends({}, state);\n getTokenSkipNewline(state);\n // We need to decide if this is a unary percentage % or binary modulo %\n // So we attempt to parse a unary expression at this point.\n // If it fails, then the only possibility is that this is a unary percentage.\n // If it succeeds, then we presume that this must be binary modulo, since the\n // only things that parseUnary can handle are _higher_ precedence than unary %.\n try {\n parseUnary(state);\n // Not sure if we could somehow use the result of that parseUnary? Without\n // further analysis/testing, safer just to discard and let the parse proceed\n _extends(state, previousState);\n } catch (_unused) {\n // Not seeing a term at this point, so was a unary %\n node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);\n }\n }\n return node;\n }\n\n /**\n * Unary plus and minus, and logical and bitwise not\n * @return {Node} node\n * @private\n */\n function parseUnary(state) {\n var name, params, fn;\n var operators = {\n '-': 'unaryMinus',\n '+': 'unaryPlus',\n '~': 'bitNot',\n not: 'not'\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 return parsePow(state);\n }\n\n /**\n * power\n * Note: power operator is right associative\n * @return {Node} node\n * @private\n */\n function parsePow(state) {\n var node, name, fn, params;\n node = parseNullishCoalescing(state);\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 node = new OperatorNode(name, fn, params);\n }\n return node;\n }\n\n /**\n * nullish coalescing operator\n * @return {Node} node\n * @private\n */\n function parseNullishCoalescing(state) {\n var node = parseLeftHandOperators(state);\n while (state.token === '??') {\n // eslint-disable-line no-unmodified-loop-condition\n getTokenSkipNewline(state);\n node = new OperatorNode('??', 'nullish', [node, parseLeftHandOperators(state)]);\n }\n return node;\n }\n\n /**\n * Left hand operators: factorial x!, ctranspose x'\n * @return {Node} node\n * @private\n */\n function parseLeftHandOperators(state) {\n var node, name, fn, params;\n node = parseCustomNodes(state);\n var operators = {\n '!': 'factorial',\n '\\'': 'ctranspose'\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 return node;\n }\n\n /**\n * Parse a custom node handler. A node handler can be used to process\n * nodes in a custom way, for example for handling a plot.\n *\n * A handler must be passed as second argument of the parse function.\n * - must extend math.Node\n * - must contain a function _compile(defs: Object) : string\n * - must contain a function find(filter: Object) : Node[]\n * - must contain a function toString() : string\n * - the constructor is called with a single argument containing all parameters\n *\n * For example:\n *\n * nodes = {\n * 'plot': PlotHandler\n * }\n *\n * The constructor of the handler is called as:\n *\n * node = new PlotHandler(params)\n *\n * The handler will be invoked when evaluating an expression like:\n *\n * node = math.parse('plot(sin(x), x)', nodes)\n *\n * @return {Node} node\n * @private\n */\n function parseCustomNodes(state) {\n var params = [];\n if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n var CustomNode = state.extraNodes[state.token];\n getToken(state);\n\n // parse parameters\n if (state.token === '(') {\n params = [];\n openParams(state);\n getToken(state);\n if (state.token !== ')') {\n params.push(parseAssignment(state));\n\n // parse a list with parameters\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n closeParams(state);\n getToken(state);\n }\n\n // create a new custom node\n // noinspection JSValidateTypes\n return new CustomNode(params);\n }\n return parseSymbol(state);\n }\n\n /**\n * parse symbols: functions, variables, constants, units\n * @return {Node} node\n * @private\n */\n function parseSymbol(state) {\n var node, name;\n if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n name = state.token;\n getToken(state);\n if (hasOwnProperty(CONSTANTS, name)) {\n // true, false, null, ...\n node = new ConstantNode(CONSTANTS[name]);\n } else if (NUMERIC_CONSTANTS.includes(name)) {\n // NaN, Infinity\n node = new ConstantNode(numeric(name, 'number'));\n } else {\n node = new SymbolNode(name);\n }\n\n // parse function parameters and matrix index\n node = parseAccessors(state, node);\n return node;\n }\n return parseString(state);\n }\n\n /**\n * parse accessors:\n * - function invocation in round brackets (...), for example sqrt(2) or sqrt?.(2) with optional chaining\n * - index enclosed in square brackets [...], for example A[2,3] or A?.[2,3] with optional chaining\n * - dot notation for properties, like foo.bar or foo?.bar with optional chaining\n * @param {Object} state\n * @param {Node} node Node on which to apply the parameters. If there\n * are no parameters in the expression, the node\n * itself is returned\n * @param {string[]} [types] Filter the types of notations\n * can be ['(', '[', '.']\n * @return {Node} node\n * @private\n */\n function parseAccessors(state, node, types) {\n var params;\n\n // Iterate and handle chained accessors, including repeated optional chaining\n while (true) {\n // eslint-disable-line no-unmodified-loop-condition\n // Track whether an optional chaining operator precedes the next accessor\n var optional = false;\n\n // Consume an optional chaining operator if present\n if (state.token === '?.') {\n optional = true;\n // consume the '?.' token\n getToken(state);\n }\n var hasNextAccessor = (state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.includes(state.token));\n if (!(optional || hasNextAccessor)) {\n break;\n }\n params = [];\n if (state.token === '(') {\n if (optional || isSymbolNode(node) || isAccessorNode(node)) {\n // function invocation: fn(2, 3) or obj.fn(2, 3) or (anything)?.(2, 3)\n openParams(state);\n getToken(state);\n if (state.token !== ')') {\n params.push(parseAssignment(state));\n\n // parse a list with parameters\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n if (state.token !== ')') {\n throw createSyntaxError(state, 'Parenthesis ) expected');\n }\n closeParams(state);\n getToken(state);\n node = new FunctionNode(node, params, optional);\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 if (state.token !== ']') {\n params.push(parseAssignment(state));\n\n // parse a list with parameters\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n params.push(parseAssignment(state));\n }\n }\n if (state.token !== ']') {\n throw createSyntaxError(state, 'Parenthesis ] expected');\n }\n closeParams(state);\n getToken(state);\n node = new AccessorNode(node, new IndexNode(params), optional);\n } else {\n // dot notation like variable.prop\n // consume the `.` (if it was ?., already consumed):\n if (!optional) getToken(state);\n var isPropertyName = state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS;\n if (!isPropertyName) {\n var message = 'Property name expected after ';\n message += optional ? 'optional chain' : 'dot';\n throw createSyntaxError(state, message);\n }\n params.push(new ConstantNode(state.token));\n getToken(state);\n var dotNotation = true;\n node = new AccessorNode(node, new IndexNode(params, dotNotation), optional);\n }\n }\n return node;\n }\n\n /**\n * Parse a single or double quoted string.\n * @return {Node} node\n * @private\n */\n function parseString(state) {\n var node, str;\n if (state.token === '\"' || state.token === \"'\") {\n str = parseStringToken(state, state.token);\n\n // create constant\n node = new ConstantNode(str);\n\n // parse index parameters\n node = parseAccessors(state, node);\n return node;\n }\n return parseMatrix(state);\n }\n\n /**\n * Parse a string surrounded by single or double quotes\n * @param {Object} state\n * @param {\"'\" | \"\\\"\"} quote\n * @return {string}\n */\n function parseStringToken(state, quote) {\n var str = '';\n while (currentCharacter(state) !== '' && currentCharacter(state) !== quote) {\n if (currentCharacter(state) === '\\\\') {\n next(state);\n var char = currentCharacter(state);\n var escapeChar = ESCAPE_CHARACTERS[char];\n if (escapeChar !== undefined) {\n // an escaped control character like \\\" or \\n\n str += escapeChar;\n state.index += 1;\n } else if (char === 'u') {\n // escaped unicode character\n var unicode = state.expression.slice(state.index + 1, state.index + 5);\n if (/^[0-9A-Fa-f]{4}$/.test(unicode)) {\n // test whether the string holds four hexadecimal values\n str += String.fromCharCode(parseInt(unicode, 16));\n state.index += 5;\n } else {\n throw createSyntaxError(state, \"Invalid unicode character \\\\u\".concat(unicode));\n }\n } else {\n throw createSyntaxError(state, \"Bad escape character \\\\\".concat(char));\n }\n } else {\n // any regular character\n str += currentCharacter(state);\n next(state);\n }\n }\n getToken(state);\n if (state.token !== quote) {\n throw createSyntaxError(state, \"End of string \".concat(quote, \" expected\"));\n }\n getToken(state);\n return str;\n }\n\n /**\n * parse the matrix\n * @return {Node} node\n * @private\n */\n function parseMatrix(state) {\n var array, params, rows, cols;\n if (state.token === '[') {\n // matrix [...]\n openParams(state);\n getToken(state);\n if (state.token !== ']') {\n // this is a non-empty matrix\n var row = parseRow(state);\n if (state.token === ';') {\n // 2 dimensional array\n rows = 1;\n params = [row];\n\n // the rows of the matrix are separated by dot-comma's\n while (state.token === ';') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n if (state.token !== ']') {\n params[rows] = parseRow(state);\n rows++;\n }\n }\n if (state.token !== ']') {\n throw createSyntaxError(state, 'End of matrix ] expected');\n }\n closeParams(state);\n getToken(state);\n\n // check if the number of columns matches in all rows\n cols = params[0].items.length;\n for (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 array = new ArrayNode(params);\n } else {\n // 1 dimensional vector\n if (state.token !== ']') {\n throw createSyntaxError(state, 'End of matrix ] expected');\n }\n closeParams(state);\n getToken(state);\n array = row;\n }\n } else {\n // this is an empty matrix \"[ ]\"\n closeParams(state);\n getToken(state);\n array = new ArrayNode([]);\n }\n return parseAccessors(state, array);\n }\n return parseObject(state);\n }\n\n /**\n * Parse a single comma-separated row from a matrix, like 'a, b, c'\n * @return {ArrayNode} node\n */\n function parseRow(state) {\n var params = [parseAssignment(state)];\n var len = 1;\n while (state.token === ',') {\n // eslint-disable-line no-unmodified-loop-condition\n getToken(state);\n\n // parse expression\n if (state.token !== ']' && state.token !== ';') {\n params[len] = parseAssignment(state);\n len++;\n }\n }\n return new ArrayNode(params);\n }\n\n /**\n * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n * @return {Node} node\n * @private\n */\n function parseObject(state) {\n if (state.token === '{') {\n openParams(state);\n var key;\n var properties = {};\n do {\n getToken(state);\n if (state.token !== '}') {\n // parse key\n if (state.token === '\"' || state.token === \"'\") {\n key = parseStringToken(state, state.token);\n } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {\n key = state.token;\n getToken(state);\n } else {\n throw createSyntaxError(state, 'Symbol or string expected as object key');\n }\n\n // parse key/value separator\n if (state.token !== ':') {\n throw createSyntaxError(state, 'Colon : expected after object key');\n }\n getToken(state);\n\n // parse key\n properties[key] = parseAssignment(state);\n }\n } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition\n\n if (state.token !== '}') {\n throw createSyntaxError(state, 'Comma , or bracket } expected after object value');\n }\n closeParams(state);\n getToken(state);\n var node = new ObjectNode(properties);\n\n // parse index parameters\n node = parseAccessors(state, node);\n return node;\n }\n return parseNumber(state);\n }\n\n /**\n * parse a number\n * @return {Node} node\n * @private\n */\n function parseNumber(state) {\n var numberStr;\n if (state.tokenType === TOKENTYPE.NUMBER) {\n // this is a number\n numberStr = state.token;\n getToken(state);\n var numericType = safeNumberType(numberStr, config);\n var value = numeric(numberStr, numericType);\n return new ConstantNode(value);\n }\n return parseParentheses(state);\n }\n\n /**\n * parentheses\n * @return {Node} node\n * @private\n */\n function parseParentheses(state) {\n var node;\n\n // check if it is a parenthesized expression\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 closeParams(state);\n getToken(state);\n node = new ParenthesisNode(node);\n node = parseAccessors(state, node);\n return node;\n }\n return parseEnd(state);\n }\n\n /**\n * Evaluated when the expression is not yet ended but expected to end\n * @return {Node} res\n * @private\n */\n function parseEnd(state) {\n if (state.token === '') {\n // syntax error or unexpected end of expression\n throw createSyntaxError(state, 'Unexpected end of expression');\n } else {\n throw createSyntaxError(state, 'Value expected');\n }\n }\n\n /**\n * Shortcut for getting the current row value (one based)\n * Returns the line of the currently handled expression\n * @private\n */\n /* TODO: implement keeping track on the row number\n function row () {\n return null\n }\n */\n\n /**\n * Shortcut for getting the current col value (one based)\n * Returns the column (position) where the last state.token starts\n * @private\n */\n function col(state) {\n return state.index - state.token.length + 1;\n }\n\n /**\n * Create an error\n * @param {Object} state\n * @param {string} message\n * @return {SyntaxError} instantiated error\n * @private\n */\n function createSyntaxError(state, message) {\n var c = col(state);\n var error = new SyntaxError(message + ' (char ' + c + ')');\n error.char = c;\n return error;\n }\n\n /**\n * Create an error\n * @param {Object} state\n * @param {string} message\n * @return {Error} instantiated error\n * @private\n */\n function createError(state, message) {\n var c = col(state);\n var error = new SyntaxError(message + ' (char ' + c + ')');\n error.char = c;\n return error;\n }\n\n // Now that we can parse, automatically convert strings to Nodes by parsing\n typed.addConversion({\n from: 'string',\n to: 'Node',\n convert: parse\n });\n return parse;\n});","import { deepMap } from '../../utils/collection.js';\nimport { factory } from '../../utils/factory.js';\nimport { createEmptyMap } from '../../utils/map.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 * Evaluate an expression.\n *\n * The expression parser does not use JavaScript. Its syntax is close\n * to JavaScript but more suited for mathematical expressions.\n * See [https://mathjs.org/docs/expressions/syntax.html](https://mathjs.org/docs/expressions/syntax.html) to learn\n * the syntax and get an overview of the exact differences from JavaScript.\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 = createEmptyMap();\n return parse(expr).compile().evaluate(scope);\n },\n 'string, Map | Object': function string_Map__Object(expr, scope) {\n return parse(expr).compile().evaluate(scope);\n },\n 'Array | Matrix': function Array__Matrix(expr) {\n var scope = createEmptyMap();\n return deepMap(expr, function (entry) {\n return parse(entry).compile().evaluate(scope);\n });\n },\n 'Array | Matrix, Map | Object': function Array__Matrix_Map__Object(expr, scope) {\n return deepMap(expr, function (entry) {\n return parse(entry).compile().evaluate(scope);\n });\n }\n });\n});","import { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nvar name = 'size';\nvar dependencies = ['typed'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n /**\n * Calculate the size of a matrix or scalar. Always returns an Array containing numbers.\n *\n * Note that in mathjs v14 and older, function size could return a Matrix depending on\n * the input type and configuration.\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).toArray()) // 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} A vector with size of `x`.\n */\n return typed(name, {\n Matrix: x => x.size(),\n Array: arraySize,\n string: x => [x.length],\n // scalar\n 'number | Complex | BigNumber | Unit | boolean | null': _x => []\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 * 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 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 return gamma(n.plus(1));\n },\n 'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))\n });\n});","import { factory } from '../../utils/factory.js';\nvar name = 'isBounded';\nvar dependencies = ['typed'];\nexport var createIsBounded = /* #__PURE__ */factory(name, dependencies, _ref => {\n var {\n typed\n } = _ref;\n /**\n * Test whether a value is bounded. For scalars, this test is equivalent\n * to the isFinite finiteness test. On the other hand, a Matrix or Array\n * is defined to be bounded if every entry is finite.\n *\n * Syntax:\n *\n * math.isBounded(x)\n *\n * Examples:\n *\n * math.isBounded(0) // returns true\n * math.isBounded(NaN) // returns false\n * math.isBounded(math.bignumber(Infinity)) // returns false\n * math.isBounded(math.fraction(1,3)) // returns true\n * math.isBounded(math.complex('2 - 4i')) // returns true\n * math.isBounded(-10000000000000000n) // returns true\n * math.isBounded(undefined) // returns false\n * math.isBounded(null) // returns false\n * math.isBounded([0.001, -3n, 0]) // returns true\n * math.isBounded([2, -Infinity, -3]) // returns false\n *\n * See also:\n *\n * isFinite, isNumeric, isPositive, isNegative, isNaN\n *\n * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x Value to be tested\n * @return {boolean} Returns true when `x` is bounded.\n */\n return typed(name, {\n number: n => Number.isFinite(n),\n 'BigNumber | Complex': x => x.isFinite(),\n 'bigint | Fraction': () => true,\n 'null | undefined': () => false,\n Unit: typed.referToSelf(self => x => self(x.value)),\n 'Array | Matrix': typed.referToSelf(self => A => {\n if (!Array.isArray(A)) A = A.valueOf();\n return A.every(entry => self(entry));\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 };\n\n // Load the conversion functions for each output type\n var validOutputTypes = {\n number: x => _number(x),\n BigNumber: bignumber ? x => bignumber(x) : noBignumber,\n bigint: x => BigInt(x),\n Fraction: fraction ? x => fraction(x) : noFraction\n };\n\n /**\n * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.\n *\n * Syntax:\n *\n * math.numeric(x)\n * math.numeric(value, outputType)\n *\n * Examples:\n *\n * math.numeric('4') // returns 4\n * math.numeric('4', 'number') // returns 4\n * math.numeric('4', 'bigint') // returns 4n\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 0.4\n *\n * See also:\n *\n * number, fraction, bignumber, bigint, string, format\n *\n * @param {string | number | BigNumber | bigint | 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 | bigint | Fraction}\n * Returns an instance of the numeric in the requested type\n */\n return function numeric(value) {\n var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';\n var check = arguments.length > 2 ? arguments[2] : undefined;\n if (check !== undefined) {\n throw new SyntaxError('numeric() takes one or two arguments');\n }\n var inputType = typeOf(value);\n if (!(inputType in validInputTypes)) {\n throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '));\n }\n if (!(outputType in validOutputTypes)) {\n throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '));\n }\n if (outputType === inputType) {\n return value;\n } else {\n return validOutputTypes[outputType](value);\n }\n };\n});","import { absNumber, acoshNumber, acosNumber, acothNumber, acotNumber, acschNumber, acscNumber, addNumber, andNumber, asechNumber, asecNumber, asinhNumber, asinNumber, atan2Number, atanhNumber, atanNumber, bitAndNumber, bitNotNumber, bitOrNumber, bitXorNumber, cbrtNumber, combinationsNumber, coshNumber, cosNumber, cothNumber, cotNumber, cschNumber, cscNumber, cubeNumber, divideNumber, expm1Number, expNumber, gammaNumber, gcdNumber, isIntegerNumber, isNaNNumber, isNegativeNumber, isPositiveNumber, isZeroNumber, lcmNumber, leftShiftNumber, lgammaNumber, log10Number, log1pNumber, log2Number, logNumber, modNumber, multiplyNumber, normNumber, notNumber, nthRootNumber, orNumber, powNumber, rightArithShiftNumber, rightLogShiftNumber, roundNumber, sechNumber, secNumber, signNumber, sinhNumber, sinNumber, sqrtNumber, squareNumber, subtractNumber, tanhNumber, tanNumber, unaryMinusNumber, unaryPlusNumber, xgcdNumber, xorNumber } from './plain/number/index.js';\nimport { factory } from './utils/factory.js';\nimport { noIndex, noMatrix, noSubset } from './utils/noop.js';\n\n// ----------------------------------------------------------------------------\n// classes and functions\n\n// core\nexport { createTyped } from './core/function/typed.js';\n\n// classes\nexport { createResultSet } from './type/resultset/ResultSet.js';\nexport { createRangeClass } from './type/matrix/Range.js';\nexport { createHelpClass } from './expression/Help.js';\nexport { createChainClass } from './type/chain/Chain.js';\nexport { createHelp } from './expression/function/help.js';\nexport { createChain } from './type/chain/function/chain.js';\n\n// algebra\nexport { createResolve } from './function/algebra/resolve.js';\nexport { createSimplify } from './function/algebra/simplify.js';\nexport { createSimplifyConstant } from './function/algebra/simplifyConstant.js';\nexport { createSimplifyCore } from './function/algebra/simplifyCore.js';\nexport { createDerivative } from './function/algebra/derivative.js';\nexport { createRationalize } from './function/algebra/rationalize.js';\n\n// arithmetic\nexport var createUnaryMinus = /* #__PURE__ */createNumberFactory('unaryMinus', unaryMinusNumber);\nexport var createUnaryPlus = /* #__PURE__ */createNumberFactory('unaryPlus', unaryPlusNumber);\nexport var createAbs = /* #__PURE__ */createNumberFactory('abs', absNumber);\nexport var createAddScalar = /* #__PURE__ */createNumberFactory('addScalar', addNumber);\nexport var createSubtractScalar = /* #__PURE__ */createNumberFactory('subtractScalar', subtractNumber);\nexport var createCbrt = /* #__PURE__ */createNumberFactory('cbrt', cbrtNumber);\nexport { createCeilNumber as createCeil } from './function/arithmetic/ceil.js';\nexport var createCube = /* #__PURE__ */createNumberFactory('cube', cubeNumber);\nexport var createExp = /* #__PURE__ */createNumberFactory('exp', expNumber);\nexport var createExpm1 = /* #__PURE__ */createNumberFactory('expm1', expm1Number);\nexport { createFixNumber as createFix } from './function/arithmetic/fix.js';\nexport { createFloorNumber as createFloor } from './function/arithmetic/floor.js';\nexport var createGcd = /* #__PURE__ */createNumberFactory('gcd', gcdNumber);\nexport var createLcm = /* #__PURE__ */createNumberFactory('lcm', lcmNumber);\nexport var createLog10 = /* #__PURE__ */createNumberFactory('log10', log10Number);\nexport var createLog2 = /* #__PURE__ */createNumberFactory('log2', log2Number);\nexport var createMod = /* #__PURE__ */createNumberFactory('mod', modNumber);\nexport var createMultiplyScalar = /* #__PURE__ */createNumberFactory('multiplyScalar', multiplyNumber);\nexport var createMultiply = /* #__PURE__ */createNumberFactory('multiply', multiplyNumber);\nexport var createNthRoot = /* #__PURE__ */\ncreateNumberOptionalSecondArgFactory('nthRoot', nthRootNumber);\nexport var createSign = /* #__PURE__ */createNumberFactory('sign', signNumber);\nexport var createSqrt = /* #__PURE__ */createNumberFactory('sqrt', sqrtNumber);\nexport var createSquare = /* #__PURE__ */createNumberFactory('square', squareNumber);\nexport var createSubtract = /* #__PURE__ */createNumberFactory('subtract', subtractNumber);\nexport var createXgcd = /* #__PURE__ */createNumberFactory('xgcd', xgcdNumber);\nexport var createDivideScalar = /* #__PURE__ */createNumberFactory('divideScalar', divideNumber);\nexport var createPow = /* #__PURE__ */createNumberFactory('pow', powNumber);\nexport var createRound = /* #__PURE__ */\ncreateNumberOptionalSecondArgFactory('round', roundNumber);\nexport var createLog = /* #__PURE__ */\ncreateNumberOptionalSecondArgFactory('log', logNumber);\nexport var createLog1p = /* #__PURE__ */createNumberFactory('log1p', log1pNumber);\nexport var createAdd = /* #__PURE__ */createNumberFactory('add', addNumber);\nexport { createHypot } from './function/arithmetic/hypot.js';\nexport var createNorm = /* #__PURE__ */createNumberFactory('norm', normNumber);\nexport var createDivide = /* #__PURE__ */createNumberFactory('divide', divideNumber);\n\n// bitwise\nexport var createBitAnd = /* #__PURE__ */createNumberFactory('bitAnd', bitAndNumber);\nexport var createBitNot = /* #__PURE__ */createNumberFactory('bitNot', bitNotNumber);\nexport var createBitOr = /* #__PURE__ */createNumberFactory('bitOr', bitOrNumber);\nexport var createBitXor = /* #__PURE__ */createNumberFactory('bitXor', bitXorNumber);\nexport var createLeftShift = /* #__PURE__ */createNumberFactory('leftShift', leftShiftNumber);\nexport var createRightArithShift = /* #__PURE__ */createNumberFactory('rightArithShift', rightArithShiftNumber);\nexport var createRightLogShift = /* #__PURE__ */createNumberFactory('rightLogShift', rightLogShiftNumber);\n\n// combinatorics\nexport { createStirlingS2 } from './function/combinatorics/stirlingS2.js';\nexport { createBellNumbers } from './function/combinatorics/bellNumbers.js';\nexport { createCatalan } from './function/combinatorics/catalan.js';\nexport { createComposition } from './function/combinatorics/composition.js';\n\n// constants\nexport { createE, createUppercaseE, createFalse,\n// createI,\ncreateInfinity, createLN10, createLN2, createLOG10E, createLOG2E, createNaN, createNull, createPhi, createPi, createUppercasePi, createSQRT1_2,\n// eslint-disable-line camelcase\ncreateSQRT2, createTau, createTrue, createVersion } from './constants.js';\n\n// create\nexport { createNumber } from './type/number.js';\nexport { createBigint } from './type/bigint.js';\nexport { createString } from './type/string.js';\nexport { createBoolean } from './type/boolean.js';\nexport { createParser } from './expression/function/parser.js';\n\n// expression\nexport { createNode } from './expression/node/Node.js';\nexport { createAccessorNode } from './expression/node/AccessorNode.js';\nexport { createArrayNode } from './expression/node/ArrayNode.js';\nexport { createAssignmentNode } from './expression/node/AssignmentNode.js';\nexport { createBlockNode } from './expression/node/BlockNode.js';\nexport { createConditionalNode } from './expression/node/ConditionalNode.js';\nexport { createConstantNode } from './expression/node/ConstantNode.js';\nexport { createFunctionAssignmentNode } from './expression/node/FunctionAssignmentNode.js';\nexport { createIndexNode } from './expression/node/IndexNode.js';\nexport { createObjectNode } from './expression/node/ObjectNode.js';\nexport { createOperatorNode } from './expression/node/OperatorNode.js';\nexport { createParenthesisNode } from './expression/node/ParenthesisNode.js';\nexport { createRangeNode } from './expression/node/RangeNode.js';\nexport { createRelationalNode } from './expression/node/RelationalNode.js';\nexport { createSymbolNode } from './expression/node/SymbolNode.js';\nexport { createFunctionNode } from './expression/node/FunctionNode.js';\nexport { createParse } from './expression/parse.js';\nexport { createCompile } from './expression/function/compile.js';\nexport { createEvaluate } from './expression/function/evaluate.js';\nexport { createParserClass } from './expression/Parser.js';\n\n// logical\nexport var createAnd = /* #__PURE__ */createNumberFactory('and', andNumber);\nexport var createNot = /* #__PURE__ */createNumberFactory('not', notNumber);\nexport var createOr = /* #__PURE__ */createNumberFactory('or', orNumber);\nexport var createXor = /* #__PURE__ */createNumberFactory('xor', xorNumber);\n\n// matrix\nexport { createMapSlices } from './function/matrix/mapSlices.js';\nexport { createFilter } from './function/matrix/filter.js';\nexport { createForEach } from './function/matrix/forEach.js';\nexport { createMap } from './function/matrix/map.js';\nexport { createRange } from './function/matrix/range.js';\nexport { createSize } from './function/matrix/size.js';\n// FIXME: create a lightweight \"number\" implementation of subset only supporting plain objects/arrays\nexport var createIndex = /* #__PURE__ */factory('index', [], () => noIndex);\nexport var createMatrix = /* #__PURE__ */factory('matrix', [], () => noMatrix); // FIXME: needed now because subset transform needs it. Remove the need for it in subset\nexport var createSubset = /* #__PURE__ */factory('subset', [], () => noSubset);\n// TODO: provide number+array implementations for map, filter, forEach, zeros, ...?\n// TODO: create range implementation for range?\nexport { createPartitionSelect } from './function/matrix/partitionSelect.js';\n\n// probability\nexport { createBernoulli } from './function/probability/bernoulli.js';\nexport var createCombinations = createNumberFactory('combinations', combinationsNumber);\nexport var createGamma = createNumberFactory('gamma', gammaNumber);\nexport var createLgamma = createNumberFactory('lgamma', lgammaNumber);\nexport { createCombinationsWithRep } from './function/probability/combinationsWithRep.js';\nexport { createFactorial } from './function/probability/factorial.js';\nexport { createMultinomial } from './function/probability/multinomial.js';\nexport { createPermutations } from './function/probability/permutations.js';\nexport { createPickRandom } from './function/probability/pickRandom.js';\nexport { createRandomNumber as createRandom } from './function/probability/random.js';\nexport { createRandomInt } from './function/probability/randomInt.js';\n\n// relational\nexport { createEqualScalarNumber as createEqualScalar } from './function/relational/equalScalar.js';\nexport { createCompareNumber as createCompare } from './function/relational/compare.js';\nexport { createCompareNatural } from './function/relational/compareNatural.js';\nexport { createCompareTextNumber as createCompareText } from './function/relational/compareText.js';\nexport { createEqualNumber as createEqual } from './function/relational/equal.js';\nexport { createEqualText } from './function/relational/equalText.js';\nexport { createSmallerNumber as createSmaller } from './function/relational/smaller.js';\nexport { createSmallerEqNumber as createSmallerEq } from './function/relational/smallerEq.js';\nexport { createLargerNumber as createLarger } from './function/relational/larger.js';\nexport { createLargerEqNumber as createLargerEq } from './function/relational/largerEq.js';\nexport { createDeepEqual } from './function/relational/deepEqual.js';\nexport { createUnequalNumber as createUnequal } from './function/relational/unequal.js';\n\n// special\nexport { createErf } from './function/special/erf.js';\nexport { createZeta } from './function/special/zeta.js';\n// statistics\nexport { createMode } from './function/statistics/mode.js';\nexport { createProd } from './function/statistics/prod.js';\nexport { createMax } from './function/statistics/max.js';\nexport { createMin } from './function/statistics/min.js';\nexport { createSum } from './function/statistics/sum.js';\nexport { createCumSum } from './function/statistics/cumsum.js';\nexport { createMean } from './function/statistics/mean.js';\nexport { createMedian } from './function/statistics/median.js';\nexport { createMad } from './function/statistics/mad.js';\nexport { createVariance } from './function/statistics/variance.js';\nexport { createQuantileSeq } from './function/statistics/quantileSeq.js';\nexport { createStd } from './function/statistics/std.js';\nexport { createCorr } from './function/statistics/corr.js';\n\n// string\nexport { createFormat } from './function/string/format.js';\nexport { createPrint } from './function/string/print.js';\n\n// trigonometry\nexport var createAcos = /* #__PURE__ */createNumberFactory('acos', acosNumber);\nexport var createAcosh = /* #__PURE__ */createNumberFactory('acosh', acoshNumber);\nexport var createAcot = /* #__PURE__ */createNumberFactory('acot', acotNumber);\nexport var createAcoth = /* #__PURE__ */createNumberFactory('acoth', acothNumber);\nexport var createAcsc = /* #__PURE__ */createNumberFactory('acsc', acscNumber);\nexport var createAcsch = /* #__PURE__ */createNumberFactory('acsch', acschNumber);\nexport var createAsec = /* #__PURE__ */createNumberFactory('asec', asecNumber);\nexport var createAsech = /* #__PURE__ */createNumberFactory('asech', asechNumber);\nexport var createAsin = /* #__PURE__ */createNumberFactory('asin', asinNumber);\nexport var createAsinh = /* #__PURE__ */createNumberFactory('asinh', asinhNumber);\nexport var createAtan = /* #__PURE__ */createNumberFactory('atan', atanNumber);\nexport var createAtan2 = /* #__PURE__ */createNumberFactory('atan2', atan2Number);\nexport var createAtanh = /* #__PURE__ */createNumberFactory('atanh', atanhNumber);\nexport var createCos = /* #__PURE__ */createNumberFactory('cos', cosNumber);\nexport var createCosh = /* #__PURE__ */createNumberFactory('cosh', coshNumber);\nexport var createCot = /* #__PURE__ */createNumberFactory('cot', cotNumber);\nexport var createCoth = /* #__PURE__ */createNumberFactory('coth', cothNumber);\nexport var createCsc = /* #__PURE__ */createNumberFactory('csc', cscNumber);\nexport var createCsch = /* #__PURE__ */createNumberFactory('csch', cschNumber);\nexport var createSec = /* #__PURE__ */createNumberFactory('sec', secNumber);\nexport var createSech = /* #__PURE__ */createNumberFactory('sech', sechNumber);\nexport var createSin = /* #__PURE__ */createNumberFactory('sin', sinNumber);\nexport var createSinh = /* #__PURE__ */createNumberFactory('sinh', sinhNumber);\nexport var createTan = /* #__PURE__ */createNumberFactory('tan', tanNumber);\nexport var createTanh = /* #__PURE__ */createNumberFactory('tanh', tanhNumber);\n\n// transforms\nexport { createMapSlicesTransform } from './expression/transform/mapSlices.transform.js';\nexport { createFilterTransform } from './expression/transform/filter.transform.js';\nexport { createForEachTransform } from './expression/transform/forEach.transform.js';\nexport { createMapTransform } from './expression/transform/map.transform.js';\nexport { createMaxTransform } from './expression/transform/max.transform.js';\nexport { createMeanTransform } from './expression/transform/mean.transform.js';\nexport { createMinTransform } from './expression/transform/min.transform.js';\nexport { createRangeTransform } from './expression/transform/range.transform.js';\nexport var createSubsetTransform = /* #__PURE__ */factory('subset', [], () => noSubset, {\n isTransformFunction: true\n});\nexport { createStdTransform } from './expression/transform/std.transform.js';\nexport { createSumTransform } from './expression/transform/sum.transform.js';\nexport { createCumSumTransform } from './expression/transform/cumsum.transform.js';\nexport { createVarianceTransform } from './expression/transform/variance.transform.js';\n\n// utils\nexport { createClone } from './function/utils/clone.js';\nexport var createIsInteger = /* #__PURE__ */createNumberFactory('isInteger', isIntegerNumber);\nexport var createIsNegative = /* #__PURE__ */createNumberFactory('isNegative', isNegativeNumber);\nexport { createIsNumeric } from './function/utils/isNumeric.js';\nexport { createHasNumericValue } from './function/utils/hasNumericValue.js';\nexport var createIsPositive = /* #__PURE__ */createNumberFactory('isPositive', isPositiveNumber);\nexport var createIsZero = /* #__PURE__ */createNumberFactory('isZero', isZeroNumber);\nexport var createIsNaN = /* #__PURE__ */createNumberFactory('isNaN', isNaNNumber);\nexport { createIsBounded } from './function/utils/isBounded.js';\nexport { createIsFinite } from './function/utils/isFinite.js';\nexport { createTypeOf } from './function/utils/typeOf.js';\nexport { createIsPrime } from './function/utils/isPrime.js';\nexport { createNumeric } from './function/utils/numeric.js';\n\n// json\nexport { createReviver } from './json/reviver.js';\nexport { createReplacer } from './json/replacer.js';\n\n// helper functions to create a factory function for a function which only needs typed-function\nfunction createNumberFactory(name, fn) {\n return factory(name, ['typed'], _ref => {\n var {\n typed\n } = _ref;\n return typed(fn);\n });\n}\nfunction createNumberOptionalSecondArgFactory(name, fn) {\n return factory(name, ['typed'], _ref2 => {\n var {\n typed\n } = _ref2;\n return typed({\n number: fn,\n 'number,number': fn\n });\n });\n}","/**\n * Create a syntax error with the message:\n * 'Wrong number of arguments in function ( provided, - 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 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;","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createTyped } from '../../factoriesNumber.js';\nexport var typedDependencies = {\n createTyped\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAbs } from '../../factoriesNumber.js';\nexport var absDependencies = {\n typedDependencies,\n createAbs\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createNode } from '../../factoriesNumber.js';\nexport var NodeDependencies = {\n createNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createSubset } from '../../factoriesNumber.js';\nexport var subsetDependencies = {\n createSubset\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { subsetDependencies } from './dependenciesSubset.generated.js';\nimport { createAccessorNode } from '../../factoriesNumber.js';\nexport var AccessorNodeDependencies = {\n NodeDependencies,\n subsetDependencies,\n createAccessorNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createAdd } from '../../factoriesNumber.js';\nexport var addDependencies = {\n typedDependencies,\n createAdd\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createArrayNode } from '../../factoriesNumber.js';\nexport var ArrayNodeDependencies = {\n NodeDependencies,\n createArrayNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createMatrix } from '../../factoriesNumber.js';\nexport var matrixDependencies = {\n createMatrix\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { matrixDependencies } from './dependenciesMatrix.generated.js';\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { subsetDependencies } from './dependenciesSubset.generated.js';\nimport { createAssignmentNode } from '../../factoriesNumber.js';\nexport var AssignmentNodeDependencies = {\n matrixDependencies,\n NodeDependencies,\n subsetDependencies,\n createAssignmentNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createGamma } from '../../factoriesNumber.js';\nexport var gammaDependencies = {\n typedDependencies,\n createGamma\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { gammaDependencies } from './dependenciesGamma.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFactorial } from '../../factoriesNumber.js';\nexport var factorialDependencies = {\n gammaDependencies,\n typedDependencies,\n createFactorial\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createNumber } from '../../factoriesNumber.js';\nexport var numberDependencies = {\n typedDependencies,\n createNumber\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createPow } from '../../factoriesNumber.js';\nexport var powDependencies = {\n typedDependencies,\n createPow\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createResultSet } from '../../factoriesNumber.js';\nexport var ResultSetDependencies = {\n createResultSet\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { ResultSetDependencies } from './dependenciesResultSet.generated.js';\nimport { createBlockNode } from '../../factoriesNumber.js';\nexport var BlockNodeDependencies = {\n NodeDependencies,\n ResultSetDependencies,\n createBlockNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createRound } from '../../factoriesNumber.js';\nexport var roundDependencies = {\n typedDependencies,\n createRound\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createConditionalNode } from '../../factoriesNumber.js';\nexport var ConditionalNodeDependencies = {\n NodeDependencies,\n createConditionalNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createIsBounded } from '../../factoriesNumber.js';\nexport var isBoundedDependencies = {\n typedDependencies,\n createIsBounded\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { isBoundedDependencies } from './dependenciesIsBounded.generated.js';\nimport { createConstantNode } from '../../factoriesNumber.js';\nexport var ConstantNodeDependencies = {\n NodeDependencies,\n isBoundedDependencies,\n createConstantNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createFunctionAssignmentNode } from '../../factoriesNumber.js';\nexport var FunctionAssignmentNodeDependencies = {\n NodeDependencies,\n typedDependencies,\n createFunctionAssignmentNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createSymbolNode } from '../../factoriesNumber.js';\nexport var SymbolNodeDependencies = {\n NodeDependencies,\n createSymbolNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';\nimport { createFunctionNode } from '../../factoriesNumber.js';\nexport var FunctionNodeDependencies = {\n NodeDependencies,\n SymbolNodeDependencies,\n createFunctionNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSize } from '../../factoriesNumber.js';\nexport var sizeDependencies = {\n typedDependencies,\n createSize\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { sizeDependencies } from './dependenciesSize.generated.js';\nimport { createIndexNode } from '../../factoriesNumber.js';\nexport var IndexNodeDependencies = {\n NodeDependencies,\n sizeDependencies,\n createIndexNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createObjectNode } from '../../factoriesNumber.js';\nexport var ObjectNodeDependencies = {\n NodeDependencies,\n createObjectNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createOperatorNode } from '../../factoriesNumber.js';\nexport var OperatorNodeDependencies = {\n NodeDependencies,\n createOperatorNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createParenthesisNode } from '../../factoriesNumber.js';\nexport var ParenthesisNodeDependencies = {\n NodeDependencies,\n createParenthesisNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createRangeNode } from '../../factoriesNumber.js';\nexport var RangeNodeDependencies = {\n NodeDependencies,\n createRangeNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { NodeDependencies } from './dependenciesNode.generated.js';\nimport { createRelationalNode } from '../../factoriesNumber.js';\nexport var RelationalNodeDependencies = {\n NodeDependencies,\n createRelationalNode\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { numberDependencies } from './dependenciesNumber.generated.js';\nimport { createNumeric } from '../../factoriesNumber.js';\nexport var numericDependencies = {\n numberDependencies,\n createNumeric\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';\nimport { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';\nimport { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';\nimport { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';\nimport { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';\nimport { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';\nimport { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';\nimport { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';\nimport { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';\nimport { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';\nimport { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';\nimport { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';\nimport { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';\nimport { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';\nimport { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';\nimport { numericDependencies } from './dependenciesNumeric.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createParse } from '../../factoriesNumber.js';\nexport var parseDependencies = {\n AccessorNodeDependencies,\n ArrayNodeDependencies,\n AssignmentNodeDependencies,\n BlockNodeDependencies,\n ConditionalNodeDependencies,\n ConstantNodeDependencies,\n FunctionAssignmentNodeDependencies,\n FunctionNodeDependencies,\n IndexNodeDependencies,\n ObjectNodeDependencies,\n OperatorNodeDependencies,\n ParenthesisNodeDependencies,\n RangeNodeDependencies,\n RelationalNodeDependencies,\n SymbolNodeDependencies,\n numericDependencies,\n typedDependencies,\n createParse\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createDivide } from '../../factoriesNumber.js';\nexport var divideDependencies = {\n typedDependencies,\n createDivide\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMultiply } from '../../factoriesNumber.js';\nexport var multiplyDependencies = {\n typedDependencies,\n createMultiply\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSqrt } from '../../factoriesNumber.js';\nexport var sqrtDependencies = {\n typedDependencies,\n createSqrt\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSubtract } from '../../factoriesNumber.js';\nexport var subtractDependencies = {\n typedDependencies,\n createSubtract\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createE } from '../../factoriesNumber.js';\nexport var eDependencies = {\n createE\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { parseDependencies } from './dependenciesParse.generated.js';\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createEvaluate } from '../../factoriesNumber.js';\nexport var evaluateDependencies = {\n parseDependencies,\n typedDependencies,\n createEvaluate\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createExp } from '../../factoriesNumber.js';\nexport var expDependencies = {\n typedDependencies,\n createExp\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createGcd } from '../../factoriesNumber.js';\nexport var gcdDependencies = {\n typedDependencies,\n createGcd\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLcm } from '../../factoriesNumber.js';\nexport var lcmDependencies = {\n typedDependencies,\n createLcm\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog } from '../../factoriesNumber.js';\nexport var logDependencies = {\n typedDependencies,\n createLog\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog10 } from '../../factoriesNumber.js';\nexport var log10Dependencies = {\n typedDependencies,\n createLog10\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog1p } from '../../factoriesNumber.js';\nexport var log1pDependencies = {\n typedDependencies,\n createLog1p\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createLog2 } from '../../factoriesNumber.js';\nexport var log2Dependencies = {\n typedDependencies,\n createLog2\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createMod } from '../../factoriesNumber.js';\nexport var modDependencies = {\n typedDependencies,\n createMod\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createNthRoot } from '../../factoriesNumber.js';\nexport var nthRootDependencies = {\n typedDependencies,\n createNthRoot\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { createPi } from '../../factoriesNumber.js';\nexport var piDependencies = {\n createPi\n};","/**\n * THIS FILE IS AUTO-GENERATED\n * DON'T MAKE CHANGES HERE\n */\nimport { typedDependencies } from './dependenciesTyped.generated.js';\nimport { createSign } from '../../factoriesNumber.js';\nexport var signDependencies = {\n typedDependencies,\n createSign\n};","function E () {\n // Keep this empty so it's easier to inherit from\n // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n on: function (name, callback, ctx) {\n var e = this.e || (this.e = {});\n\n (e[name] || (e[name] = [])).push({\n fn: callback,\n ctx: ctx\n });\n\n return this;\n },\n\n once: function (name, callback, ctx) {\n var self = this;\n function listener () {\n self.off(name, listener);\n callback.apply(ctx, arguments);\n };\n\n listener._ = callback\n return this.on(name, listener, ctx);\n },\n\n emit: function (name) {\n var data = [].slice.call(arguments, 1);\n var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n var i = 0;\n var len = evtArr.length;\n\n for (i; i < len; i++) {\n evtArr[i].fn.apply(evtArr[i].ctx, data);\n }\n\n return this;\n },\n\n off: function (name, callback) {\n var e = this.e || (this.e = {});\n var evts = e[name];\n var liveEvents = [];\n\n if (evts && callback) {\n for (var i = 0, len = evts.length; i < len; i++) {\n if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n liveEvents.push(evts[i]);\n }\n }\n\n // Remove event from queue to prevent memory leak\n // Suggested by https://github.com/lazd\n // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n (liveEvents.length)\n ? e[name] = liveEvents\n : delete e[name];\n\n return this;\n }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n","import Emitter from 'tiny-emitter';\n\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\nexport function mixin(obj) {\n // create event emitter\n var emitter = new Emitter();\n\n // bind methods to obj (we don't want to expose the emitter.e Array...)\n obj.on = emitter.on.bind(emitter);\n obj.off = emitter.off.bind(emitter);\n obj.once = emitter.once.bind(emitter);\n obj.emit = emitter.emit.bind(emitter);\n return obj;\n}","import { isBigNumber, isComplex, isFraction, isMatrix, isObject, isUnit } from '../../utils/is.js';\nimport { isFactory, stripOptionalNotation } from '../../utils/factory.js';\nimport { hasOwnProperty, lazy } from '../../utils/object.js';\nimport { ArgumentsError } from '../../error/ArgumentsError.js';\nexport function importFactory(typed, load, math, importedFactories) {\n /**\n * Import functions from an object or a module.\n *\n * This function is only available on a mathjs instance created using `create`.\n *\n * Syntax:\n *\n * math.import(functions)\n * math.import(functions, options)\n *\n * Where:\n *\n * - `functions: Object`\n * An object with functions or factories to be imported.\n * - `options: Object` An object with import options. Available options:\n * - `override: boolean`\n * If true, existing functions will be overwritten. False by default.\n * - `silent: boolean`\n * If true, the function will not throw errors on duplicates or invalid\n * types. False by default.\n * - `wrap: boolean`\n * If true, the functions will be wrapped in a wrapper function\n * which converts data types like Matrix to primitive data types like Array.\n * The wrapper is needed when extending math.js with libraries which do not\n * support these data type. False by default.\n *\n * Examples:\n *\n * import { create, all } from 'mathjs'\n * import * as numbers from 'numbers'\n *\n * // create a mathjs instance\n * const math = create(all)\n *\n * // define new functions and variables\n * math.import({\n * myvalue: 42,\n * hello: function (name) {\n * return 'hello, ' + name + '!'\n * }\n * })\n *\n * // use the imported function and variable\n * math.myvalue * 2 // 84\n * math.hello('user') // 'hello, user!'\n *\n * // import the npm module 'numbers'\n * // (must be installed first with `npm install numbers`)\n * math.import(numbers, {wrap: true})\n *\n * math.fibonacci(7) // returns 13\n *\n * @param {Object | Array} functions Object with functions to be imported.\n * @param {Object} [options] Import options.\n */\n function mathImport(functions, options) {\n var num = arguments.length;\n if (num !== 1 && num !== 2) {\n throw new ArgumentsError('import', num, 1, 2);\n }\n if (!options) {\n options = {};\n }\n function flattenImports(flatValues, value, name) {\n if (Array.isArray(value)) {\n value.forEach(item => flattenImports(flatValues, item));\n } else if (isObject(value) || isModule(value)) {\n for (var _name in value) {\n if (hasOwnProperty(value, _name)) {\n flattenImports(flatValues, value[_name], _name);\n }\n }\n } else if (isFactory(value) || name !== undefined) {\n var flatName = isFactory(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly\n : value.fn : name;\n\n // we allow importing the same function twice if it points to the same implementation\n if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {\n throw new Error('Cannot import \"' + flatName + '\" twice');\n }\n flatValues[flatName] = value;\n } else {\n if (!options.silent) {\n throw new TypeError('Factory, Object, or Array expected');\n }\n }\n }\n var flatValues = {};\n flattenImports(flatValues, functions);\n for (var name in flatValues) {\n if (hasOwnProperty(flatValues, name)) {\n // console.log('import', name)\n var value = flatValues[name];\n if (isFactory(value)) {\n // we ignore name here and enforce the name of the factory\n // maybe at some point we do want to allow overriding it\n // in that case we can implement an option overrideFactoryNames: true\n _importFactory(value, options);\n } else if (isSupportedType(value)) {\n _import(name, value, options);\n } else {\n if (!options.silent) {\n throw new TypeError('Factory, Object, or Array expected');\n }\n }\n }\n }\n }\n\n /**\n * Add a property to the math namespace\n * @param {string} name\n * @param {*} value\n * @param {Object} options See import for a description of the options\n * @private\n */\n function _import(name, value, options) {\n var _math$Unit;\n // TODO: refactor this function, it's to complicated and contains duplicate code\n if (options.wrap && typeof value === 'function') {\n // create a wrapper around the function\n value = _wrap(value);\n }\n\n // turn a plain function with a typed-function signature into a typed-function\n if (hasTypedFunctionSignature(value)) {\n value = typed(name, {\n [value.signature]: value\n });\n }\n if (typed.isTypedFunction(math[name]) && typed.isTypedFunction(value)) {\n if (options.override) {\n // give the typed function the right name\n value = typed(name, value.signatures);\n } else {\n // merge the existing and typed function\n value = typed(math[name], value);\n }\n math[name] = value;\n delete importedFactories[name];\n _importTransform(name, value);\n math.emit('import', name, function resolver() {\n return value;\n });\n return;\n }\n var isDefined = math[name] !== undefined;\n var isValuelessUnit = (_math$Unit = math.Unit) === null || _math$Unit === void 0 ? void 0 : _math$Unit.isValuelessUnit(name);\n if (!isDefined && !isValuelessUnit || options.override) {\n math[name] = value;\n delete importedFactories[name];\n _importTransform(name, value);\n math.emit('import', name, function resolver() {\n return value;\n });\n return;\n }\n if (!options.silent) {\n throw new Error('Cannot import \"' + name + '\": already exists');\n }\n }\n function _importTransform(name, value) {\n if (value && typeof value.transform === 'function') {\n math.expression.transform[name] = value.transform;\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = value.transform;\n }\n } else {\n // remove existing transform\n delete math.expression.transform[name];\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = value;\n }\n }\n }\n function _deleteTransform(name) {\n delete math.expression.transform[name];\n if (allowedInExpressions(name)) {\n math.expression.mathWithTransform[name] = math[name];\n } else {\n delete math.expression.mathWithTransform[name];\n }\n }\n\n /**\n * Create a wrapper a round an function which converts the arguments\n * to their primitive values (like convert a Matrix to Array)\n * @param {Function} fn\n * @return {Function} Returns the wrapped function\n * @private\n */\n function _wrap(fn) {\n var wrapper = function wrapper() {\n var args = [];\n for (var i = 0, len = arguments.length; i < len; i++) {\n var arg = arguments[i];\n args[i] = arg && arg.valueOf();\n }\n return fn.apply(math, args);\n };\n if (fn.transform) {\n wrapper.transform = fn.transform;\n }\n return wrapper;\n }\n\n /**\n * Import an instance of a factory into math.js\n * @param {function(scope: object)} factory\n * @param {Object} options See import for a description of the options\n * @param {string} [name=factory.name] Optional custom name\n * @private\n */\n function _importFactory(factory, options) {\n var _factory$meta$formerl, _factory$meta;\n var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;\n if (name.includes('.')) {\n throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));\n }\n var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;\n var existingTransform = name in math.expression.transform;\n var existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined;\n var resolver = function resolver() {\n // collect all dependencies, handle finding both functions and classes and other special cases\n var dependencies = {};\n factory.dependencies.map(stripOptionalNotation).forEach(dependency => {\n if (dependency.includes('.')) {\n throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));\n }\n if (dependency === 'math') {\n dependencies.math = math;\n } else if (dependency === 'mathWithTransform') {\n dependencies.mathWithTransform = math.expression.mathWithTransform;\n } else if (dependency === 'classes') {\n // special case for json reviver\n dependencies.classes = math;\n } else {\n dependencies[dependency] = math[dependency];\n }\n });\n var instance = /* #__PURE__ */factory(dependencies);\n if (instance && typeof instance.transform === 'function') {\n throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with export const path = \"expression.transform\"');\n }\n if (existing === undefined || options.override) {\n return instance;\n }\n if (typed.isTypedFunction(existing) && typed.isTypedFunction(instance)) {\n // merge the existing and new typed function\n return typed(existing, instance);\n }\n if (options.silent) {\n // keep existing, ignore imported function\n return existing;\n } else {\n throw new Error('Cannot import \"' + name + '\": already exists');\n }\n };\n var former = (_factory$meta$formerl = (_factory$meta = factory.meta) === null || _factory$meta === void 0 ? void 0 : _factory$meta.formerly) !== null && _factory$meta$formerl !== void 0 ? _factory$meta$formerl : '';\n var needsTransform = isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory);\n var withTransform = math.expression.mathWithTransform;\n\n // TODO: add unit test with non-lazy factory\n if (!factory.meta || factory.meta.lazy !== false) {\n lazy(namespace, name, resolver);\n if (former) lazy(namespace, former, resolver);\n\n // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n if (existing && existingTransform) {\n _deleteTransform(name);\n if (former) _deleteTransform(former);\n } else {\n if (needsTransform) {\n lazy(withTransform, name, () => namespace[name]);\n if (former) lazy(withTransform, former, () => namespace[name]);\n }\n }\n } else {\n namespace[name] = resolver();\n if (former) namespace[former] = namespace[name];\n\n // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n if (existing && existingTransform) {\n _deleteTransform(name);\n if (former) _deleteTransform(former);\n } else {\n if (needsTransform) {\n lazy(withTransform, name, () => namespace[name]);\n if (former) lazy(withTransform, former, () => namespace[name]);\n }\n }\n }\n\n // TODO: improve factories, store a list with imports instead which can be re-played\n importedFactories[name] = factory;\n math.emit('import', name, resolver);\n }\n\n /**\n * Check whether given object is a type which can be imported\n * @param {Function | number | string | boolean | null | Unit | Complex} object\n * @return {boolean}\n * @private\n */\n function isSupportedType(object) {\n return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || isUnit(object) || isComplex(object) || isBigNumber(object) || isFraction(object) || isMatrix(object) || Array.isArray(object);\n }\n function isModule(object) {\n return typeof object === 'object' && object[Symbol.toStringTag] === 'Module';\n }\n function hasTypedFunctionSignature(fn) {\n return typeof fn === 'function' && typeof fn.signature === 'string';\n }\n function allowedInExpressions(name) {\n return !hasOwnProperty(unsafe, name);\n }\n function factoryAllowedInExpressions(factory) {\n return !factory.fn.includes('.') &&\n // FIXME: make checking on path redundant, check on meta data instead\n !hasOwnProperty(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);\n }\n function isTransformFunctionFactory(factory) {\n return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;\n }\n\n // namespaces and functions not available in the parser for safety reasons\n var unsafe = {\n expression: true,\n type: true,\n docs: true,\n error: true,\n json: true,\n chain: true // chain method not supported. Note that there is a unit chain too.\n };\n return mathImport;\n}","import _extends from \"@babel/runtime/helpers/extends\";\nimport typedFunction from 'typed-function';\nimport { ArgumentsError } from '../error/ArgumentsError.js';\nimport { DimensionError } from '../error/DimensionError.js';\nimport { IndexError } from '../error/IndexError.js';\nimport { factory, isFactory } from '../utils/factory.js';\nimport { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isObjectWrappingMap, isOperatorNode, isParenthesisNode, isPartitionedMap, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../utils/is.js';\nimport { deepFlatten, isLegacyFactory } from '../utils/object.js';\nimport * as emitter from './../utils/emitter.js';\nimport { DEFAULT_CONFIG } from './config.js';\nimport { configFactory } from './function/config.js';\nimport { importFactory } from './function/import.js';\n\n/**\n * Create a mathjs instance from given factory functions and optionally config\n *\n * Usage:\n *\n * const mathjs1 = create({ createAdd, createMultiply, ...})\n * const config = { number: 'BigNumber' }\n * const mathjs2 = create(all, config)\n *\n * @param {Object} [factories] An object with factory functions\n * The object can contain nested objects,\n * all nested objects will be flattened.\n * @param {Object} [config] Available options:\n * {number} relTol\n * Minimum relative difference between two\n * compared values, used by all comparison functions.\n * {number} absTol\n * Minimum absolute difference between two\n * compared values, used by all comparison functions.\n * {string} matrix\n * A string 'Matrix' (default) or 'Array'.\n * {string} number\n * A string 'number' (default), 'BigNumber', or 'Fraction'\n * {number} precision\n * The number of significant digits for BigNumbers.\n * Not applicable for Numbers.\n * {boolean} predictable\n * Predictable output type of functions. When true,\n * output type depends only on the input types. When\n * false (default), output type can vary depending\n * on input values. For example `math.sqrt(-4)`\n * returns `complex('2i')` when predictable is false, and\n * returns `NaN` when true.\n * {string} randomSeed\n * Random seed for seeded pseudo random number generator.\n * Set to null to randomly seed.\n * @returns {Object} Returns a bare-bone math.js instance containing\n * functions:\n * - `import` to add new functions\n * - `config` to change configuration\n * - `on`, `off`, `once`, `emit` for events\n */\nexport function create(factories, config) {\n var configInternal = _extends({}, DEFAULT_CONFIG, config);\n\n // simple test for ES5 support\n if (typeof Object.create !== 'function') {\n throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');\n }\n\n // create the mathjs instance\n var math = emitter.mixin({\n // only here for backward compatibility for legacy factory functions\n isNumber,\n isComplex,\n isBigNumber,\n isBigInt,\n isFraction,\n isUnit,\n isString,\n isArray,\n isMatrix,\n isCollection,\n isDenseMatrix,\n isSparseMatrix,\n isRange,\n isIndex,\n isBoolean,\n isResultSet,\n isHelp,\n isFunction,\n isDate,\n isRegExp,\n isObject,\n isMap,\n isPartitionedMap,\n isObjectWrappingMap,\n isNull,\n isUndefined,\n isAccessorNode,\n isArrayNode,\n isAssignmentNode,\n isBlockNode,\n isConditionalNode,\n isConstantNode,\n isFunctionAssignmentNode,\n isFunctionNode,\n isIndexNode,\n isNode,\n isObjectNode,\n isOperatorNode,\n isParenthesisNode,\n isRangeNode,\n isRelationalNode,\n isSymbolNode,\n isChain\n });\n\n // load config function and apply provided config\n math.config = configFactory(configInternal, math.emit);\n math.expression = {\n transform: {},\n mathWithTransform: {\n config: math.config\n }\n };\n\n // cached factories and instances used by function load\n var legacyFactories = [];\n var legacyInstances = [];\n\n /**\n * Load a function or data type from a factory.\n * If the function or data type already exists, the existing instance is\n * returned.\n * @param {Function} factory\n * @returns {*}\n */\n function load(factory) {\n if (isFactory(factory)) {\n return factory(math);\n }\n var firstProperty = factory[Object.keys(factory)[0]];\n if (isFactory(firstProperty)) {\n return firstProperty(math);\n }\n if (!isLegacyFactory(factory)) {\n console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);\n throw new Error('Factory object with properties `type`, `name`, and `factory` expected');\n }\n var index = legacyFactories.indexOf(factory);\n var instance;\n if (index === -1) {\n // doesn't yet exist\n if (factory.math === true) {\n // pass with math namespace\n instance = factory.factory(math.type, configInternal, load, math.typed, math);\n } else {\n instance = factory.factory(math.type, configInternal, load, math.typed);\n }\n\n // append to the cache\n legacyFactories.push(factory);\n legacyInstances.push(instance);\n } else {\n // already existing function, return the cached instance\n instance = legacyInstances[index];\n }\n return instance;\n }\n var importedFactories = {};\n\n // load the import function\n function lazyTyped() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n return math.typed.apply(math.typed, args);\n }\n lazyTyped.isTypedFunction = typedFunction.isTypedFunction;\n var internalImport = importFactory(lazyTyped, load, math, importedFactories);\n math.import = internalImport;\n\n // listen for changes in config, import all functions again when changed\n // TODO: move this listener into the import function?\n math.on('config', () => {\n Object.values(importedFactories).forEach(factory => {\n if (factory && factory.meta && factory.meta.recreateOnConfigChange) {\n // FIXME: only re-create when the current instance is the same as was initially created\n // FIXME: delete the functions/constants before importing them again?\n internalImport(factory, {\n override: true\n });\n }\n });\n });\n\n // the create function exposed on the mathjs instance is bound to\n // the factory functions passed before\n math.create = create.bind(null, factories);\n\n // export factory function\n math.factory = factory;\n\n // import the factory functions like createAdd as an array instead of object,\n // else they will get a different naming (`createAdd` instead of `add`).\n math.import(Object.values(deepFlatten(factories)));\n math.ArgumentsError = ArgumentsError;\n math.DimensionError = DimensionError;\n math.IndexError = IndexError;\n return math;\n}","// SPDX-License-Identifier: AGPL-3.0-or-later\n\nimport { getElement } from \"./getElement.ts\";\n\nexport const appendAnswerElement = (element: HTMLElement | string | number): void => {\n const results = getElement(\"results\");\n\n // ./searx/templates/elements/answers.html\n let answers = getElement(\"answers\", { assert: false });\n if (!answers) {\n // what is this?\n const answersTitle = document.createElement(\"h4\");\n answersTitle.setAttribute(\"class\", \"title\");\n answersTitle.setAttribute(\"id\", \"answers-title\");\n answersTitle.textContent = \"Answers : \";\n\n answers = document.createElement(\"div\");\n answers.setAttribute(\"id\", \"answers\");\n answers.setAttribute(\"role\", \"complementary\");\n answers.setAttribute(\"aria-labelledby\", \"answers-title\");\n answers.appendChild(answersTitle);\n }\n\n if (!(element instanceof HTMLElement)) {\n const span = document.createElement(\"span\");\n span.innerHTML = element.toString();\n // biome-ignore lint/style/noParameterAssign: TODO\n element = span;\n }\n\n answers.appendChild(element);\n\n results.insertAdjacentElement(\"afterbegin\", answers);\n};\n","// SPDX-License-Identifier: AGPL-3.0-or-later\n\nimport {\n absDependencies,\n addDependencies,\n create,\n divideDependencies,\n eDependencies,\n evaluateDependencies,\n expDependencies,\n factorialDependencies,\n gcdDependencies,\n lcmDependencies,\n log1pDependencies,\n log2Dependencies,\n log10Dependencies,\n logDependencies,\n modDependencies,\n multiplyDependencies,\n nthRootDependencies,\n piDependencies,\n powDependencies,\n roundDependencies,\n signDependencies,\n sqrtDependencies,\n subtractDependencies\n} from \"mathjs/number\";\nimport { Plugin } from \"../Plugin.ts\";\nimport { appendAnswerElement } from \"../util/appendAnswerElement.ts\";\nimport { getElement } from \"../util/getElement.ts\";\n\n/**\n * Parses and solves mathematical expressions. Can do basic arithmetic and\n * evaluate some functions.\n *\n * @example\n * \"(3 + 5) / 2\" = \"4\"\n * \"e ^ 2 + pi\" = \"10.530648752520442\"\n * \"gcd(48, 18) + lcm(4, 5)\" = \"26\"\n *\n * @remarks\n * Depends on `mathjs` library.\n */\nexport default class Calculator extends Plugin {\n public constructor() {\n super(\"calculator\");\n }\n\n /**\n * @remarks\n * Compare bundle size after adding or removing features.\n */\n private static readonly math = create({\n ...absDependencies,\n ...addDependencies,\n ...divideDependencies,\n ...eDependencies,\n ...evaluateDependencies,\n ...expDependencies,\n ...factorialDependencies,\n ...gcdDependencies,\n ...lcmDependencies,\n ...log10Dependencies,\n ...log1pDependencies,\n ...log2Dependencies,\n ...logDependencies,\n ...modDependencies,\n ...multiplyDependencies,\n ...nthRootDependencies,\n ...piDependencies,\n ...powDependencies,\n ...roundDependencies,\n ...signDependencies,\n ...sqrtDependencies,\n ...subtractDependencies\n });\n\n protected async run(): Promise {\n const searchInput = getElement(\"q\");\n const node = Calculator.math.parse(searchInput.value);\n\n try {\n return `${node.toString()} = ${node.evaluate()}`;\n } catch {\n // not a compatible math expression\n return;\n }\n }\n\n protected async post(result: string): Promise {\n appendAnswerElement(result);\n }\n}\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116],"mappings":"imBAAA,SAAS,GAAW,CAClB,MAAO,GAAW,OAAO,OAAS,OAAO,OAAO,MAAM,CAAG,SAAU,EAAG,CACpE,IAAK,IAAIA,EAAI,EAAGA,EAAI,UAAU,OAAQ,IAAK,CACzC,IAAI,EAAI,UAAUA,GAClB,IAAK,IAAI,KAAK,GAAI,EAAE,EAAE,eAAe,KAAK,EAAG,EAAE,GAAK,EAAE,GAAK,EAAE,IAE/D,OAAO,GACN,EAAS,MAAM,KAAM,UAAU,CCPpC,IAAW,EAAiB,CAG1B,OAAQ,MAGR,OAAQ,MAER,OAAQ,SAER,OAAQ,SAGR,eAAgB,SAEhB,UAAW,GAKX,YAAa,GAGb,WAAY,KAIZ,aAAc,GACf,CClBD,SAAS,EAAgB,EAAQ,EAAM,CAErC,GAAI,EAAe,EAAQ,EAAK,CAC9B,OAAO,EAAO,GAKhB,MAHI,OAAO,EAAO,IAAU,YAAc,EAAa,EAAQ,EAAK,CACxD,MAAM,yBAA2B,EAAO,kBAAkB,CAE5D,MAAM,0BAA4B,EAAO,IAAI,CAazD,SAAS,EAAgB,EAAQ,EAAM,EAAO,CAE5C,GAAI,EAAe,EAAQ,EAAK,CAE9B,MADA,GAAO,GAAQ,EACR,EAET,MAAU,MAAM,0BAA4B,EAAO,IAAI,CAUzD,SAAS,EAAe,EAAQ,EAAM,CAyBpC,MAxBI,CAAC,EAAc,EAAO,EAAI,CAAC,MAAM,QAAQ,EAAO,CAC3C,GAIL,EAAe,EAAsB,EAAK,CACrC,GAYT,EARI,KAAQ,OAAO,WAQf,KAAQ,SAAS,WAgBvB,SAAS,EAAc,EAAQ,EAAQ,CACrC,GAAI,CAAC,EAAa,EAAQ,EAAO,CAC/B,MAAU,MAAM,wBAA0B,EAAS,IAAI,CAEzD,OAAO,EAAO,GAUhB,SAAS,EAAa,EAAQ,EAAQ,CA+BpC,OA9BI,GAAW,MAAgC,OAAO,EAAO,IAAY,YAMrE,EAAe,EAAQ,EAAO,EAAI,OAAO,gBAAkB,KAAU,OAAO,eAAe,EAAO,CAC7F,GAIL,EAAe,EAAmB,EAAO,CACpC,GAYT,EARI,KAAU,OAAO,WAQjB,KAAU,SAAS,WAQzB,SAAS,EAAc,EAAQ,CAC7B,OAAO,OAAO,GAAW,UAAY,GAAU,EAAO,cAAgB,OAExE,IAAI,EAAuB,CACzB,OAAQ,GACR,KAAM,GACP,CACG,EAAoB,CACtB,SAAU,GACV,QAAS,GACT,eAAgB,GACjB,CCjIY,EAAb,KAA+B,CAC7B,YAAY,EAAQ,CAClB,KAAK,cAAgB,EACrB,KAAK,OAAO,UAAY,KAAK,QAE/B,MAAO,CACL,OAAO,OAAO,KAAK,KAAK,cAAc,CAAC,OAAO,GAAO,KAAK,IAAI,EAAI,CAAC,CAAC,QAAQ,CAE9E,IAAI,EAAK,CACP,OAAO,EAAgB,KAAK,cAAe,EAAI,CAEjD,IAAI,EAAK,EAAO,CAEd,OADA,EAAgB,KAAK,cAAe,EAAK,EAAM,CACxC,KAET,IAAI,EAAK,CACP,OAAO,EAAe,KAAK,cAAe,EAAI,EAAI,KAAO,KAAK,cAEhE,SAAU,CACR,OAAO,GAAY,KAAK,MAAM,CAAE,GAAO,CAAC,EAAK,KAAK,IAAI,EAAI,CAAC,CAAC,CAE9D,QAAQ,EAAU,CAChB,IAAK,IAAI,KAAO,KAAK,MAAM,CACzB,EAAS,KAAK,IAAI,EAAI,CAAE,EAAK,KAAK,CAGtC,OAAO,EAAK,CACN,EAAe,KAAK,cAAe,EAAI,EACzC,OAAO,KAAK,cAAc,GAG9B,OAAQ,CACN,IAAK,IAAI,KAAO,KAAK,MAAM,CACzB,KAAK,OAAO,EAAI,CAGpB,IAAI,MAAO,CACT,OAAO,OAAO,KAAK,KAAK,cAAc,CAAC,SAkB9B,EAAb,KAA4B,CAM1B,YAAY,EAAG,EAAG,EAAO,CACvB,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,MAAQ,EACb,KAAK,OAAO,UAAY,KAAK,QAE/B,IAAI,EAAK,CACP,OAAO,KAAK,MAAM,IAAI,EAAI,CAAG,KAAK,EAAE,IAAI,EAAI,CAAG,KAAK,EAAE,IAAI,EAAI,CAEhE,IAAI,EAAK,EAAO,CAMd,OALI,KAAK,MAAM,IAAI,EAAI,CACrB,KAAK,EAAE,IAAI,EAAK,EAAM,CAEtB,KAAK,EAAE,IAAI,EAAK,EAAM,CAEjB,KAET,IAAI,EAAK,CACP,OAAO,KAAK,EAAE,IAAI,EAAI,EAAI,KAAK,EAAE,IAAI,EAAI,CAE3C,MAAO,CACL,OAAO,IAAI,IAAI,CAAC,GAAG,KAAK,EAAE,MAAM,CAAE,GAAG,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,WAAW,CAEzE,SAAU,CACR,OAAO,GAAY,KAAK,MAAM,CAAE,GAAO,CAAC,EAAK,KAAK,IAAI,EAAI,CAAC,CAAC,CAE9D,QAAQ,EAAU,CAChB,IAAK,IAAI,KAAO,KAAK,MAAM,CACzB,EAAS,KAAK,IAAI,EAAI,CAAE,EAAK,KAAK,CAGtC,OAAO,EAAK,CACV,OAAO,KAAK,MAAM,IAAI,EAAI,CAAG,KAAK,EAAE,OAAO,EAAI,CAAG,KAAK,EAAE,OAAO,EAAI,CAEtE,OAAQ,CACN,KAAK,EAAE,OAAO,CACd,KAAK,EAAE,OAAO,CAEhB,IAAI,MAAO,CACT,MAAO,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC,SAO5B,SAAS,GAAY,EAAI,EAAU,CACjC,MAAO,CACL,SAAY,CACV,IAAI,EAAI,EAAG,MAAM,CACjB,OAAO,EAAE,KAAO,EAAI,CAClB,MAAO,EAAS,EAAE,MAAM,CACxB,KAAM,GACP,EAEJ,CAQH,SAAgB,IAAiB,CAC/B,OAAO,IAAI,IASb,SAAgB,GAAU,EAAa,CACrC,GAAI,CAAC,EACH,OAAO,IAAgB,CAEzB,GAAI,EAAM,EAAY,CACpB,OAAO,EAET,GAAI,EAAS,EAAY,CACvB,OAAO,IAAI,EAAkB,EAAY,CAE3C,MAAU,MAAM,iDAAiD,CC5InE,SAAgB,EAAS,EAAG,CAC1B,OAAO,OAAO,GAAM,SAEtB,SAAgB,EAAY,EAAG,CAU7B,MATI,CAAC,GAAK,OAAO,GAAM,UAAY,OAAO,EAAE,aAAgB,WACnD,GAEL,EAAE,cAAgB,IAAQ,OAAO,EAAE,YAAY,WAAc,UAAY,EAAE,YAAY,UAAU,cAAgB,IAGjH,OAAO,EAAE,YAAY,WAAc,YAAc,EAAE,YAAY,UAAU,EAAE,GAAK,GAKtF,SAAgB,GAAS,EAAG,CAC1B,OAAO,OAAO,GAAM,SAEtB,SAAgB,EAAU,EAAG,CAC3B,OAAO,GAAK,OAAO,GAAM,UAAY,OAAO,eAAe,EAAE,CAAC,YAAc,IAAQ,GAEtF,SAAgB,EAAW,EAAG,CAC5B,OAAO,GAAK,OAAO,GAAM,UAAY,OAAO,eAAe,EAAE,CAAC,aAAe,IAAQ,GAEvF,SAAgB,EAAO,EAAG,CACxB,OAAO,GAAK,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzD,SAAgB,EAAS,EAAG,CAC1B,OAAO,OAAO,GAAM,SAEtB,IAAW,EAAU,MAAM,QAC3B,SAAgB,EAAS,EAAG,CAC1B,OAAO,GAAK,EAAE,YAAY,UAAU,WAAa,IAAQ,GAQ3D,SAAgB,EAAa,EAAG,CAC9B,OAAO,MAAM,QAAQ,EAAE,EAAI,EAAS,EAAE,CAExC,SAAgB,GAAc,EAAG,CAC/B,OAAO,GAAK,EAAE,eAAiB,EAAE,YAAY,UAAU,WAAa,IAAQ,GAE9E,SAAgB,EAAe,EAAG,CAChC,OAAO,GAAK,EAAE,gBAAkB,EAAE,YAAY,UAAU,WAAa,IAAQ,GAE/E,SAAgB,GAAQ,EAAG,CACzB,OAAO,GAAK,EAAE,YAAY,UAAU,UAAY,IAAQ,GAE1D,SAAgB,GAAQ,EAAG,CACzB,OAAO,GAAK,EAAE,YAAY,UAAU,UAAY,IAAQ,GAE1D,SAAgB,EAAU,EAAG,CAC3B,OAAO,OAAO,GAAM,UAEtB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,YAAY,UAAU,cAAgB,IAAQ,GAE9D,SAAgB,GAAO,EAAG,CACxB,OAAO,GAAK,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzD,SAAgB,GAAW,EAAG,CAC5B,OAAO,OAAO,GAAM,WAEtB,SAAgB,GAAO,EAAG,CACxB,OAAO,aAAa,KAEtB,SAAgB,GAAS,EAAG,CAC1B,OAAO,aAAa,OAEtB,SAAgB,EAAS,EAAG,CAC1B,MAAO,CAAC,EAAE,GAAK,OAAO,GAAM,UAAY,EAAE,cAAgB,QAAU,CAAC,EAAU,EAAE,EAAI,CAAC,EAAW,EAAE,EAWrG,SAAgB,EAAM,EAAQ,CAM5B,OAHK,EAGE,aAAkB,KAAO,aAAkB,GAAqB,OAAO,EAAO,KAAQ,YAAc,OAAO,EAAO,KAAQ,YAAc,OAAO,EAAO,MAAS,YAAc,OAAO,EAAO,KAAQ,WAFjM,GAIX,SAAgB,GAAiB,EAAQ,CACvC,OAAO,EAAM,EAAO,EAAI,EAAM,EAAO,EAAE,EAAI,EAAM,EAAO,EAAE,CAE5D,SAAgB,GAAoB,EAAQ,CAC1C,OAAO,EAAM,EAAO,EAAI,EAAS,EAAO,cAAc,CAExD,SAAgB,EAAO,EAAG,CACxB,OAAO,IAAM,KAEf,SAAgB,GAAY,EAAG,CAC7B,OAAO,IAAM,IAAA,GAEf,SAAgB,EAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEtF,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,GAAiB,EAAG,CAClC,OAAO,GAAK,EAAE,mBAAqB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAExF,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,GAAkB,EAAG,CACnC,OAAO,GAAK,EAAE,oBAAsB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzF,SAAgB,EAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAatF,SAAgB,GAAU,EAAM,CAC9B,OAAO,EAAe,EAAK,EAAI,GAAe,EAAK,EAAI,EAAK,KAAK,SAAW,GAAK,EAAe,EAAK,KAAK,GAAG,EAAI,MAAM,SAAS,EAAK,GAAG,CAE1I,SAAgB,GAAyB,EAAG,CAC1C,OAAO,GAAK,EAAE,2BAA6B,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEhG,SAAgB,GAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEtF,SAAgB,EAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,EAAO,EAAG,CACxB,OAAO,GAAK,EAAE,SAAW,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAE9E,SAAgB,GAAa,EAAG,CAC9B,OAAO,GAAK,EAAE,eAAiB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEpF,SAAgB,GAAe,EAAG,CAChC,OAAO,GAAK,EAAE,iBAAmB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEtF,SAAgB,GAAkB,EAAG,CACnC,OAAO,GAAK,EAAE,oBAAsB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEzF,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAK,EAAE,cAAgB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEnF,SAAgB,GAAiB,EAAG,CAClC,OAAO,GAAK,EAAE,mBAAqB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAExF,SAAgB,EAAa,EAAG,CAC9B,OAAO,GAAK,EAAE,eAAiB,IAAQ,EAAE,YAAY,UAAU,SAAW,IAAQ,GAEpF,SAAgB,GAAQ,EAAG,CACzB,OAAO,GAAK,EAAE,YAAY,UAAU,UAAY,IAAQ,GAE1D,SAAgB,GAAO,EAAG,CACxB,IAAI,EAAI,OAAO,EAOf,OANI,IAAM,SACJ,IAAM,KAAa,OACnB,EAAY,EAAE,CAAS,YACvB,EAAE,aAAe,EAAE,YAAY,KAAa,EAAE,YAAY,KACvD,SAEF,ECpLT,SAAgB,GAAM,EAAG,CACvB,IAAI,EAAO,OAAO,EAGlB,GAAI,IAAS,UAAY,IAAS,UAAY,IAAS,UAAY,IAAS,WAAa,GAAM,KAC7F,OAAO,EAIT,GAAI,OAAO,EAAE,OAAU,WACrB,OAAO,EAAE,OAAO,CAIlB,GAAI,MAAM,QAAQ,EAAE,CAClB,OAAO,EAAE,IAAI,SAAU,EAAO,CAC5B,OAAO,GAAM,EAAM,EACnB,CAEJ,GAAI,aAAa,KAAM,OAAO,IAAI,KAAK,EAAE,SAAS,CAAC,CACnD,GAAI,EAAY,EAAE,CAAE,OAAO,EAG3B,GAAI,EAAS,EAAE,CACb,OAAO,GAAU,EAAG,GAAM,CAE5B,GAAI,IAAS,WAEX,OAAO,EAET,MAAU,UAAU,+CAAsD,KAAQ,CASpF,SAAgB,GAAU,EAAQ,EAAU,CAC1C,IAAIC,EAAQ,EAAE,CACd,IAAK,IAAI,KAAO,EACV,EAAe,EAAQ,EAAI,GAC7B,EAAM,GAAO,EAAS,EAAO,GAAK,EAGtC,OAAOA,EAwBT,SAAgB,GAAW,EAAG,EAAG,CAE/B,GAAI,MAAM,QAAQ,EAAE,CAClB,MAAU,UAAU,yCAAyC,CAE/D,IAAK,IAAI,KAAQ,EAGf,GAAI,EAAe,EAAG,EAAK,EAAI,EAAE,KAAQ,OAAO,YAAc,EAAE,KAAQ,SAAS,WAC/E,GAAI,EAAE,IAAS,EAAE,GAAM,cAAgB,OACjC,EAAE,KAAU,IAAA,KACd,EAAE,GAAQ,EAAE,EAEV,EAAE,IAAS,EAAE,GAAM,cAAgB,OACrC,GAAW,EAAE,GAAO,EAAE,GAAM,CAE5B,EAAE,GAAQ,EAAE,WAEL,MAAM,QAAQ,EAAE,GAAM,CAC/B,MAAU,UAAU,yCAAyC,MAE7D,EAAE,GAAQ,EAAE,GAIlB,OAAO,EAUT,SAAgB,GAAgB,EAAG,EAAG,CACpC,IAAI,EAAM,EAAG,EACb,GAAI,MAAM,QAAQ,EAAE,CAAE,CAIpB,GAHI,CAAC,MAAM,QAAQ,EAAE,EAGjB,EAAE,SAAW,EAAE,OACjB,MAAO,GAET,IAAK,EAAI,EAAG,EAAM,EAAE,OAAQ,EAAI,EAAK,IACnC,GAAI,CAAC,GAAgB,EAAE,GAAI,EAAE,GAAG,CAC9B,MAAO,GAGX,MAAO,WACE,OAAO,GAAM,WACtB,OAAO,IAAM,UACJ,aAAa,OAAQ,CAC9B,GAAI,MAAM,QAAQ,EAAE,EAAI,EAAE,aAAa,QACrC,MAAO,GAET,IAAK,KAAQ,EAEX,GAAI,EAAE,KAAQ,IAAM,CAAC,GAAgB,EAAE,GAAO,EAAE,GAAM,CACpD,MAAO,GAGX,IAAK,KAAQ,EAEX,GAAI,EAAE,KAAQ,GACZ,MAAO,GAGX,MAAO,QAEP,OAAO,IAAM,EASjB,SAAgB,GAAY,EAAc,CACxC,IAAI,EAAkB,EAAE,CAExB,OADA,GAAa,EAAc,EAAgB,CACpC,EAIT,SAAS,GAAa,EAAc,EAAiB,CACnD,IAAK,IAAI,KAAQ,EACf,GAAI,EAAe,EAAc,EAAK,CAAE,CACtC,IAAI,EAAQ,EAAa,GACrB,OAAO,GAAU,UAAY,EAC/B,GAAa,EAAO,EAAgB,CAEpC,EAAgB,GAAQ,GAkChC,SAAgB,GAAK,EAAQ,EAAM,EAAe,CAChD,IAAI,EAAiB,GACjB,EACJ,OAAO,eAAe,EAAQ,EAAM,CAClC,IAAK,UAAe,CAKlB,MAJA,CAEE,KADA,EAAS,GAAe,CACP,IAEZ,GAET,IAAK,SAAa,EAAO,CACvB,EAAS,EACT,EAAiB,IAEnB,aAAc,GACd,WAAY,GACb,CAAC,CAgCJ,SAAgB,EAAe,EAAQ,EAAU,CAC/C,OAAO,GAAU,OAAO,eAAe,KAAK,EAAQ,EAAS,CAe/D,SAAgB,GAAgB,EAAQ,CACtC,OAAO,GAAU,OAAO,EAAO,SAAY,WAoF7C,SAAgB,EAAY,EAAQ,EAAY,CAE9C,IAAK,IADD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAIC,EAAW,OAAQ,IAAK,CAC1C,IAAI,EAAMA,EAAW,GACjB,EAAQ,EAAO,GACf,IAAU,IAAA,KACZ,EAAK,GAAO,GAGhB,OAAO,EC/WT,IAAW,GAAiB,CAAC,SAAU,QAAQ,CACpC,GAAiB,CAAC,SAAU,YAAa,SAAU,WAAW,CAEzE,SAAgB,GAAc,EAAQ,EAAM,CA6C1C,SAAS,EAAQ,EAAS,CACxB,GAAI,EAAS,CACX,GAAI,EAAQ,UAAY,IAAA,GAAW,CAEjC,QAAQ,KAAK,gGAAgG,CAC7G,IAAI,EAAa,GAAM,EAAQ,CAI/B,MAHA,GAAW,OAAS,EAAQ,QAC5B,EAAW,OAAS,EAAQ,QAAU,KACtC,OAAO,EAAW,QACX,EAAQ,EAAW,CAExB,EAAQ,eAAiB,IAE3B,QAAQ,KAAK,oHAAoH,CAEnI,IAAI,EAAO,GAAM,EAAO,CAGxB,GAAe,EAAS,SAAU,GAAe,CACjD,GAAe,EAAS,SAAU,GAAe,CAGjD,GAAW,EAAQ,EAAQ,CAC3B,IAAI,EAAO,GAAM,EAAO,CAKxB,OADA,EAAK,SAAU,EAAM,EAHP,GAAM,EAAQ,CAGO,CAC5B,OAEP,OAAO,GAAM,EAAO,CAgBxB,MAXA,GAAQ,eAAiB,GACzB,EAAQ,eAAiB,GAGzB,OAAO,KAAK,EAAe,CAAC,QAAQ,GAAO,CACzC,OAAO,eAAe,EAAS,EAAK,CAClC,QAAW,EAAO,GAClB,WAAY,GACZ,aAAc,GACf,CAAC,EACF,CACK,EAST,SAAS,GAAe,EAAS,EAAM,EAAQ,CACzC,EAAQC,KAAU,IAAA,IAAa,CAAC,EAAO,SAAS,EAAQA,GAAM,EAEhE,QAAQ,KAAK,2BAA6B,EAAQA,GAAQ,+BAAiCA,EAAO,yBAAgC,EAAO,IAAI,GAAS,KAAK,UAAU,EAAM,CAAC,CAAC,KAAK,KAAK,CAAG,IAAI,CCjGlM,SAAgB,EAAU,EAAO,CAI/B,OAHI,OAAO,GAAU,UACZ,GAEF,OAAO,SAAS,EAAM,CAAG,IAAU,KAAK,MAAM,EAAM,CAAG,GAqBhE,SAAgB,GAAe,EAAW,EAAQ,CAChD,GAAI,EAAO,SAAW,SACpB,GAAI,CACF,OAAO,EAAU,MACD,CAChB,OAAO,EAAO,eAGlB,OAAO,EAAO,OAQhB,IAAW,GAAO,KAAK,MAAQ,SAAU,EAAG,CAMxC,OALE,EAAI,EACC,EACE,EAAI,EACN,GAEA,GASA,GAAO,KAAK,MAAQ,SAAc,EAAG,CAC9C,OAAO,KAAK,IAAI,EAAE,CAAG,KAAK,KAQjB,GAAQ,KAAK,OAAS,SAAe,EAAG,CACjD,OAAO,KAAK,IAAI,EAAE,CAAG,KAAK,MAQjB,GAAQ,KAAK,OAAS,SAAU,EAAG,CAC5C,OAAO,KAAK,IAAI,EAAI,EAAE,EAYb,GAAO,KAAK,MAAQ,SAAc,EAAG,CAC9C,GAAI,IAAM,EACR,OAAO,EAET,IAAI,EAAS,EAAI,EACb,EAWJ,OAVI,IACF,EAAI,CAAC,GAEH,OAAO,SAAS,EAAE,EACpB,EAAS,KAAK,IAAI,KAAK,IAAI,EAAE,CAAG,EAAE,CAElC,GAAU,GAAK,EAAS,GAAU,EAAI,GAAU,GAEhD,EAAS,EAEJ,EAAS,CAAC,EAAS,GAQjB,GAAQ,KAAK,OAAS,SAAe,EAAG,CACjD,OAAO,GAAK,MAAQ,GAAK,MAAQ,KAAK,IAAI,EAAE,CAAG,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,GAUjF,SAAS,GAAmB,EAAG,EAAM,EAAM,CAMzC,IAAI,EALW,CACb,EAAG,KACH,EAAG,KACH,GAAI,KACL,CACqB,GAClB,EAAS,GACb,GAAI,EAAM,CACR,GAAI,EAAO,EACT,MAAU,MAAM,iCAAiC,CAEnD,GAAI,CAAC,EAAU,EAAK,CAClB,MAAU,MAAM,0BAA0B,CAE5C,GAAI,EAAI,IAAM,EAAO,GAAK,GAAK,EAAI,EAAE,IAAM,EAAO,IAChD,MAAU,MAAM,8BAAqC,EAAO,QAAkB,EAAO,OAAU,CAEjG,GAAI,CAAC,EAAU,EAAE,CACf,MAAU,MAAM,2BAA2B,CAEzC,EAAI,IACN,GAAQ,GAAK,GAEf,EAAS,IAAW,IAEtB,IAAIK,EAAO,GAKX,OAJI,EAAI,IACN,EAAI,CAAC,EACL,EAAO,KAEF,GAAUA,IAAa,IAAe,EAAE,SAAS,EAAK,GAAS,IAuFxE,SAAgBC,GAAO,EAAO,EAAS,CACrC,GAAI,OAAO,GAAY,WAErB,OAAO,EAAQ,EAAM,CAIvB,GAAI,IAAU,IACZ,MAAO,cACE,IAAU,KACnB,MAAO,eACE,MAAM,EAAM,CACrB,MAAO,MAET,GAAI,CACF,WACA,YACA,YACE,GAAuB,EAAQ,CAGnC,OAAQ,EAAR,CACE,IAAK,QACH,OAAOC,GAAQ,EAAO,EAAU,CAClC,IAAK,cACH,OAAOC,GAAc,EAAO,EAAU,CACxC,IAAK,cACH,OAAOC,GAAc,EAAO,EAAU,CACxC,IAAK,MACH,OAAO,GAAmB,EAAO,EAAG,EAAS,CAC/C,IAAK,MACH,OAAO,GAAmB,EAAO,EAAG,EAAS,CAC/C,IAAK,MACH,OAAO,GAAmB,EAAO,GAAI,EAAS,CAChD,IAAK,OAEH,OAAO,GAAY,EAAO,EAAW,EAAQ,CAAC,QAAQ,sBAAuB,UAAY,CACvF,IAAIC,EAAS,UAAU,GACnBC,EAAI,UAAU,GAClB,OAAOD,IAAW,IAAmBC,EAAbD,EAASC,GACjC,CACJ,QACE,MAAU,MAAM,qBAAuB,EAAW,mEAAwE,EAYhI,SAAgB,GAAuB,EAAS,CAE9C,IAAI,EAAW,OACX,EACA,EACJ,GAAI,IAAY,IAAA,GACd,GAAI,EAAS,EAAQ,CACnB,EAAY,UACH,EAAY,EAAQ,CAC7B,EAAY,EAAQ,UAAU,SACrB,EAAS,EAAQ,CACtB,EAAQ,YAAc,IAAA,KACxB,EAAY,GAAiB,EAAQ,cAAiB,CACpD,MAAU,MAAM,mDAAmD,EACnE,EAEA,EAAQ,WAAa,IAAA,KACvB,EAAW,GAAiB,EAAQ,aAAgB,CAClD,MAAU,MAAM,kDAAkD,EAClE,EAEA,EAAQ,WACV,EAAW,EAAQ,eAGrB,MAAU,MAAM,qEAAqE,CAGzF,MAAO,CACL,WACA,YACA,WACD,CASH,SAAgB,GAAY,EAAO,CAEjC,IAAI,EAAQ,OAAO,EAAM,CAAC,aAAa,CAAC,MAAM,kCAAkC,CAChF,GAAI,CAAC,EACH,MAAU,YAAY,kBAAoB,EAAM,CAElD,IAAIN,EAAO,EAAM,GACbK,EAAS,EAAM,GACf,EAAW,WAAW,EAAM,IAAM,IAAI,CACtC,EAAMA,EAAO,QAAQ,IAAI,CAC7B,GAAY,IAAQ,GAAeA,EAAO,OAAS,EAA1B,EAAM,EAC/B,IAAI,EAAeA,EAAO,QAAQ,IAAK,GAAG,CACzC,QAAQ,MAAO,SAAU,EAAO,CAG/B,MADA,IAAYE,EAAM,OACX,IACP,CAAC,QAAQ,MAAO,GAAG,CACpB,MAAM,GAAG,CAAC,IAAI,SAAU,EAAG,CAC1B,OAAO,SAAS,EAAE,EAClB,CAKF,OAJI,EAAa,SAAW,IAC1B,EAAa,KAAK,EAAE,CACpB,KAEK,CACL,KAAA,EACA,eACA,WACD,CAQH,SAAgBH,GAAc,EAAO,EAAW,CAC9C,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CACzC,OAAO,OAAO,EAAM,CAGtB,IAAI,EAAU,GADF,GAAY,EAAM,CACG,EAAU,CACvCE,EAAI,EAAQ,SACZ,EAAI,EAAQ,aAGZ,EAASA,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAC/D,GAAI,EAAS,EAAU,CAErB,KAAO,EAAY,EAAE,QAAUA,EAAI,EAAS,EAAI,EAAE,QAChD,EAAE,KAAK,EAAE,MAMX,IAAK,IADD,EAAe,KAAK,IAAIA,EAAI,EAAO,EAAI,EAAE,OAAS,GAC7C,EAAI,EAAG,EAAI,EAAc,IAChC,EAAE,KAAK,EAAE,CASb,IAJA,IAAI,EAAU,KAAK,IAAIA,EAAI,EAAO,CAC9B,EAAa,EAGV,EAAU,GACf,IACA,IAKF,IAAI,EAAW,EAAE,MAAM,EAAW,CAAC,KAAK,GAAG,CACvC,EAAa,EAAS,EAAU,EAAI,EAAS,QAAU,EAAS,MAAM,QAAQ,CAAG,IAAM,EAAW,GAClG,EAAM,EAAE,MAAM,EAAG,EAAW,CAAC,KAAK,GAAG,CAAG,EAAa,KAAOA,GAAK,EAAI,IAAM,IAAM,EAAO,UAAU,CACtG,OAAO,EAAQ,KAAO,EASxB,SAAgBJ,GAAQ,EAAO,EAAW,CACxC,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CACzC,OAAO,OAAO,EAAM,CAEtB,IAAI,EAAa,GAAY,EAAM,CAC/B,EAAU,OAAO,GAAc,SAAW,GAAY,EAAY,EAAW,SAAW,EAAI,EAAU,CAAG,EACzG,EAAI,EAAQ,aACZ,EAAI,EAAQ,SAAW,EAGvB,EAAK,GAAK,GAAa,GAe3B,OAdI,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAK,EAAE,OAAO,CAAC,EAIhC,EAAI,IACN,EAAI,GAAM,CAAC,EAAI,EAAE,CAAC,OAAO,EAAE,CAC3B,EAAI,GAIF,EAAI,EAAE,QACR,EAAE,OAAO,EAAG,EAAG,IAAM,EAAI,KAAO,IAAI,CAE/B,EAAQ,KAAO,EAAE,KAAK,GAAG,CAUlC,SAAgBC,GAAc,EAAO,EAAW,CAC9C,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,OAAO,EAAM,CAAC,CACjD,OAAO,OAAO,EAAM,CAItB,IAAI,EAAQ,GAAY,EAAM,CAC1B,EAAU,EAAY,GAAY,EAAO,EAAU,CAAG,EACtD,EAAI,EAAQ,aACZG,EAAI,EAAQ,SAGZ,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAY,EAAE,OAAO,CAAC,EAI3C,IAAI,EAAQ,EAAE,OAAO,CACrB,OAAO,EAAQ,KAAO,GAAS,EAAE,OAAS,EAAI,IAAM,EAAE,KAAK,GAAG,CAAG,IAAM,KAAOA,GAAK,EAAI,IAAM,IAAMA,EAarG,SAAgB,GAAY,EAAO,EAAW,EAAS,CACrD,GAAI,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CACzC,OAAO,OAAO,EAAM,CAItB,IAAI,EAAWE,GAAmB,GAA0D,SAAU,GAAG,CACrG,EAAWA,GAAmB,GAA0D,SAAU,EAAE,CACpG,EAAQ,GAAY,EAAM,CAC1B,EAAU,EAAY,GAAY,EAAO,EAAU,CAAG,EAC1D,GAAI,EAAQ,SAAW,GAAY,EAAQ,UAAY,EAErD,OAAOL,GAAc,EAAO,EAAU,CAEtC,IAAI,EAAI,EAAQ,aACZG,EAAI,EAAQ,SAGZ,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAY,EAAE,OAAO,CAAC,EAK3C,EAAI,EAAE,OAAO,GAAMA,EAAI,EAAE,OAAS,GAAK,EAAE,OAAS,EAAY,EAAY,EAAE,OAAS,GAAG,CAAC,CAGzF,EAAI,GAAM,CAACA,EAAE,CAAC,OAAO,EAAE,CACvB,IAAI,EAAMA,EAAI,EAAIA,EAAI,EAItB,OAHI,EAAM,EAAE,OAAS,GACnB,EAAE,OAAO,EAAM,EAAG,EAAG,IAAI,CAEpB,EAAQ,KAAO,EAAE,KAAK,GAAG,CAYpC,SAAgB,GAAY,EAAO,EAAW,CAU5C,IARA,IAAI,EAAU,CACZ,KAAM,EAAM,KACZ,aAAc,EAAM,aACpB,SAAU,EAAM,SACjB,CACG,EAAI,EAAQ,aAGT,GAAa,GAClB,EAAE,QAAQ,EAAE,CACZ,EAAQ,WACR,IAEF,GAAI,EAAE,OAAS,GACC,EAAE,OAAO,EAAW,EAAE,OAAS,EAAU,CAC3C,IAAM,EAAG,CACnB,IAAI,EAAI,EAAY,EAEpB,IADA,EAAE,KACK,EAAE,KAAO,IACd,EAAE,KAAK,CACH,IAAM,IACR,EAAE,QAAQ,EAAE,CACZ,EAAQ,WACR,KAEF,IACA,EAAE,KAIR,OAAO,EAQT,SAAS,GAAM,EAAQ,CAErB,IAAK,IADD,EAAM,EAAE,CACH,EAAI,EAAG,EAAI,EAAQ,IAC1B,EAAI,KAAK,EAAE,CAEb,OAAO,EAcT,SAAgB,GAAO,EAAO,CAC5B,OAAO,EAAM,eAAe,CAAC,QAAQ,OAAQ,GAAG,CAC/C,QAAQ,aAAc,GAAG,CACzB,OAyGH,SAAS,GAAiB,EAAO,EAAS,CACxC,GAAI,EAAS,EAAM,CACjB,OAAO,KACE,EAAY,EAAM,CAC3B,OAAO,EAAM,UAAU,CAEvB,GAAS,CAGb,SAASE,GAAmB,EAAO,EAAc,CAM7C,OALE,EAAS,EAAM,CACV,EACE,EAAY,EAAM,CACpB,EAAM,UAAU,CAEhB,ECltBX,IAAI,EAAK,SACL,GAAK,iBACT,SAAgB,GAAU,EAAG,CAC3B,OAAO,KAAK,IAAI,EAAE,CAEpB,GAAU,UAAY,EACtB,SAAgB,GAAU,EAAG,EAAG,CAC9B,OAAO,EAAI,EAEb,GAAU,UAAY,GACtB,SAAgB,GAAe,EAAG,EAAG,CACnC,OAAO,EAAI,EAEb,GAAe,UAAY,GAC3B,SAAgB,GAAe,EAAG,EAAG,CACnC,OAAO,EAAI,EAEb,GAAe,UAAY,GAC3B,SAAgB,GAAa,EAAG,EAAG,CACjC,OAAO,EAAI,EAEb,GAAa,UAAY,GACzB,SAAgB,GAAiB,EAAG,CAClC,MAAO,CAAC,EAEV,GAAiB,UAAY,EAC7B,SAAgB,GAAgB,EAAG,CACjC,OAAO,EAET,GAAgB,UAAY,EAC5B,SAAgB,GAAW,EAAG,CAC5B,OAAO,GAAK,EAAE,CAEhB,GAAW,UAAY,EACvB,SAAgB,GAAW,EAAG,CAC5B,OAAO,EAAI,EAAI,EAEjB,GAAW,UAAY,EACvB,SAAgB,GAAU,EAAG,CAC3B,OAAO,KAAK,IAAI,EAAE,CAEpB,GAAU,UAAY,EACtB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAM,EAAE,CAEjB,GAAY,UAAY,EAQxB,SAAgB,GAAU,EAAG,EAAG,CAC9B,GAAI,CAAC,EAAU,EAAE,EAAI,CAAC,EAAU,EAAE,CAChC,MAAU,MAAM,qDAAqD,CAKvE,IADA,IAAI,EACG,IAAM,GACX,EAAI,EAAI,EACR,EAAI,EACJ,EAAI,EAEN,OAAO,EAAI,EAAI,CAAC,EAAI,EAEtB,GAAU,UAAY,GAQtB,SAAgB,GAAU,EAAG,EAAG,CAC9B,GAAI,CAAC,EAAU,EAAE,EAAI,CAAC,EAAU,EAAE,CAChC,MAAU,MAAM,qDAAqD,CAEvE,GAAI,IAAM,GAAK,IAAM,EACnB,MAAO,GAOT,IAFA,IAAI,EACA,EAAO,EAAI,EACR,IAAM,GACX,EAAI,EACJ,EAAI,EAAI,EACR,EAAI,EAEN,OAAO,KAAK,IAAI,EAAO,EAAE,CAE3B,GAAU,UAAY,GAQtB,SAAgB,GAAU,EAAG,EAAG,CAI9B,OAHI,EACK,KAAK,IAAI,EAAE,CAAG,KAAK,IAAI,EAAE,CAE3B,KAAK,IAAI,EAAE,CAQpB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAM,EAAE,CAEjB,GAAY,UAAY,EAOxB,SAAgB,GAAW,EAAG,CAC5B,OAAO,GAAK,EAAE,CAEhB,GAAW,UAAY,EAOvB,SAAgB,GAAY,EAAG,CAC7B,OAAO,GAAM,EAAE,CAEjB,GAAY,UAAY,EASxB,SAAgB,GAAU,EAAG,EAAG,CAI9B,OAAO,IAAM,EAAI,EAAI,EAAI,EAAI,KAAK,MAAM,EAAI,EAAE,CAEhD,GAAU,UAAY,GAStB,SAAgB,GAAc,EAAG,CAC/B,IAAI,EAAO,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAC3E,EAAM,EAAO,EAIjB,GAHI,IACF,EAAO,CAAC,GAEN,IAAS,EACX,MAAU,MAAM,wBAAwB,CAE1C,GAAI,EAAI,GAAK,KAAK,IAAI,EAAK,CAAG,GAAM,EAClC,MAAU,MAAM,uCAAuC,CAIzD,GAAI,IAAM,EACR,OAAO,EAAM,IAAW,EAE1B,GAAI,CAAC,SAAS,EAAE,CACd,OAAO,EAAM,EAAI,EAEnB,IAAI,EAAa,KAAK,IAAI,EAAE,GAAE,EAAI,GAIlC,MADA,GAAI,EAAI,EAAI,CAAC,EAAI,EACV,EAAM,EAAI,EAAI,EAuBvB,SAAgB,GAAW,EAAG,CAC5B,OAAO,GAAK,EAAE,CAEhB,GAAW,UAAY,EACvB,SAAgB,GAAW,EAAG,CAC5B,OAAO,KAAK,KAAK,EAAE,CAErB,GAAW,UAAY,EACvB,SAAgB,GAAa,EAAG,CAC9B,OAAO,EAAI,EAEb,GAAa,UAAY,EASzB,SAAgB,GAAW,EAAG,EAAG,CAE/B,IAAI,EACA,EACA,EACA,EAAI,EACJ,EAAQ,EACR,EAAI,EACJ,EAAQ,EACZ,GAAI,CAAC,EAAU,EAAE,EAAI,CAAC,EAAU,EAAE,CAChC,MAAU,MAAM,sDAAsD,CAExE,KAAO,GACL,EAAI,KAAK,MAAM,EAAI,EAAE,CACrB,EAAI,EAAI,EAAI,EACZ,EAAI,EACJ,EAAI,EAAQ,EAAI,EAChB,EAAQ,EACR,EAAI,EACJ,EAAI,EAAQ,EAAI,EAChB,EAAQ,EACR,EAAI,EACJ,EAAI,EAQN,OALI,EAAI,EACA,CAAC,CAAC,EAAG,CAAC,EAAO,CAAC,EAAM,CAEpB,CAAC,EAAG,EAAI,EAAQ,EAAG,EAAM,CAInC,GAAW,UAAY,GAQvB,SAAgB,GAAU,EAAG,EAAG,CAM9B,OAHI,EAAI,EAAI,GAAK,IAAM,KAAY,EAAI,EAAI,GAAK,IAAM,KAC7C,EAEO,IAAG,EAErB,GAAU,UAAY,GAStB,SAAgB,GAAY,EAAO,CACjC,IAAI,EAAW,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EACnF,GAAI,CAAC,EAAU,EAAS,EAAI,EAAW,GAAK,EAAW,GACrD,MAAU,MAAM,iFAAiF,CAEnG,OAAO,WAAWC,GAAQ,EAAO,EAAS,CAAC,CAQ7C,SAAgB,GAAW,EAAG,CAC5B,OAAO,KAAK,IAAI,EAAE,CAEpB,GAAW,UAAY,EC1SvB,SAAgB,GAAQ,EAAG,EAAG,CAC5B,GAAI,EAAI,EACN,MAAO,GAET,GAAI,IAAM,EACR,OAAO,EAET,IAAI,EAAO,EAAI,GAAK,EACpB,OAAO,GAAQ,EAAG,EAAK,CAAG,GAAQ,EAAO,EAAG,EAAE,CCVhD,SAAgB,GAAmB,EAAG,EAAG,CAIvC,GAHI,CAAC,EAAU,EAAE,EAAI,EAAI,GAGrB,CAAC,EAAU,EAAE,EAAI,EAAI,EACvB,MAAU,UAAU,2DAA2D,CAEjF,GAAI,EAAI,EACN,MAAU,UAAU,oCAAoC,CAS1D,IAAK,IAPD,EAAU,EAAI,EACd,EAAS,EACT,EAAiB,EAAI,EAAU,EAAU,EAAI,EAAI,EACjD,EAAc,EACd,EAAc,EAAI,EAAU,EAAI,EAG3B,EAAgB,EAAgB,GAAiB,EAAG,EAAE,EAE7D,IADA,GAAU,EACH,GAAe,GAAe,EAAS,IAAgB,GAC5D,GAAU,EACV,EAAE,EAON,OAHI,GAAe,IACjB,GAAU,GAAQ,EAAa,EAAY,EAEtC,EAET,GAAmB,UAAY,iBChC/B,IAAW,GAAK,KAAK,GACJ,EAAI,KAAK,GAC1B,IAAW,GAAI,KAAK,ECEpB,SAAgB,GAAY,EAAG,CAC7B,IAAI,EACJ,GAAI,EAAU,EAAE,CAOd,OANI,GAAK,EACA,OAAO,SAAS,EAAE,CAAG,IAAW,IAErC,EAAI,IACC,IAEF,GAAQ,EAAG,EAAI,EAAE,CAE1B,GAAI,EAAI,GACN,OAAO,KAAK,IAAM,KAAK,IAAI,KAAK,GAAK,EAAE,CAAG,GAAY,EAAI,EAAE,EAE9D,GAAI,GAAK,OACP,MAAO,KAET,GAAI,EAAI,GAAM,CAEZ,IAAI,EAAO,EAAI,EACX,EAAS,EAAO,EAChB,EAAQ,EAAS,EACjB,EAAQ,EAAQ,EACpB,OAAO,KAAK,KAAK,EAAI,KAAK,GAAK,EAAE,EAAY,EAAI,KAAK,KAAG,GAAM,EAAI,GAAK,GAAK,GAAK,GAAK,IAAM,GAAQ,KAAO,MAAQ,GAAU,KAAO,QAAU,GAAS,QAAU,UAAY,GAAS,SAAW,YAAc,EAAQ,IAE1N,EAAE,EACF,EAAI,GAAO,GACX,IAAK,IAAI,EAAI,EAAG,EAAI,GAAO,OAAQ,EAAE,EACnC,GAAK,GAAO,IAAM,EAAI,GAExB,IAAI,EAAI,EAAI,GAAS,GACrB,OAAO,KAAK,KAAK,EAAI,KAAK,GAAG,CAAY,KAAG,EAAI,IAAO,KAAK,IAAI,CAAC,EAAE,CAAG,EAExE,GAAY,UAAY,SAIxB,IAAW,GAAS,UACT,GAAS,CAAC,kBAAwB,kBAAuB,mBAAwB,mBAAuB,mBAAyB,qBAA2B,qBAA2B,sBAA4B,qBAA2B,uBAA4B,sBAA2B,sBAA4B,qBAA2B,uBAA4B,sBAA0B,CAKlZ,GAAY,kBAIZ,GAAe,CAAC,kBAAmB,kBAAmB,mBAAoB,kBAAmB,mBAAoB,oBAAuB,mBAAoB,CACvK,SAAgB,GAAa,EAAG,CAC9B,GAAI,EAAI,EAAG,MAAO,KAClB,GAAI,IAAM,EAAG,MAAO,KACpB,GAAI,CAAC,OAAO,SAAS,EAAE,CAAE,OAAO,EAChC,GAAI,EAAI,GAGN,OAAO,KAAK,IAAI,KAAK,GAAK,KAAK,IAAI,KAAK,GAAK,EAAE,CAAC,CAAG,GAAa,EAAI,EAAE,CAKxE,IAKA,IAAK,IAJD,EAAO,EAAA,EAAc,GACrB,EAAM,GAAa,GAGd,EAAA,EAAiB,GAAK,EAAG,IAChC,GAAO,GAAa,IAAM,EAAI,GAEhC,OAAO,IAAa,EAAI,IAAO,KAAK,IAAI,EAAK,CAAG,EAAO,KAAK,IAAI,EAAI,CAEtE,GAAa,UAAY,SC7CzB,SAAgB,EAAQ,EAAM,EAAc,EAAQ,EAAM,CACxD,SAAS,EAAgB,EAAO,CAI9B,IAAI,EAAO,EAAY,EAAOC,EAAa,IAAI,GAAsB,CAAC,CAEtE,OADA,GAAmBC,EAAMD,EAAc,EAAM,CACtCE,EAAO,EAAK,CAQrB,MANA,GAAgB,UAAY,GAC5B,EAAgB,GAAKD,EACrB,EAAgB,aAAeD,EAAa,OAAO,CAAC,MAAM,CACtD,IACF,EAAgB,KAAO,GAElB,EAwDT,SAAgB,GAAU,EAAK,CAC7B,OAAO,OAAO,GAAQ,YAAc,OAAO,EAAI,IAAO,UAAY,MAAM,QAAQ,EAAI,aAAa,CAYnG,SAAgB,GAAmB,EAAM,EAAc,EAAO,CAG5D,GAAI,CAFaA,EAAa,OAAO,GAAc,CAAC,GAAqB,EAAW,CAAC,CACpF,MAAM,GAAc,EAAM,KAAgB,IAAA,GAAU,CACpC,CACf,IAAI,EAAsBA,EAAa,OAAO,GAAc,EAAM,KAAgB,IAAA,GAAU,CAG5F,MAAU,MAAM,2BAAmCC,sCAAyD,EAAoB,IAAI,GAAK,IAAY,KAAS,CAAC,KAAK,KAAK,IAAO,EAGpL,SAAgB,GAAqB,EAAY,CAC/C,OAAO,GAAc,EAAW,KAAO,IAEzC,SAAgB,GAAsB,EAAY,CAChD,OAAO,GAAc,EAAW,KAAO,IAAM,EAAW,MAAM,EAAE,CAAG,EC/HrE,SAAgB,IAAc,CAC5B,MAAU,MAAM,0CAA0C,CAE5D,SAAgB,IAAa,CAC3B,MAAU,MAAM,yCAAyC,CAE3D,SAAgB,IAAW,CACzB,MAAU,MAAM,uCAAuC,CAKzD,SAAgB,IAAW,CACzB,MAAU,MAAM,uCAAuC,oBCbxD,SAAU,EAAQ,EAAS,CAC1B,OAAO,GAAY,UAAmB,IAAW,OAAc,EAAO,QAAUE,GAAS,CACzF,OAAO,QAAW,YAAc,OAAO,IAAM,OAAOA,EAAQ,EAC3D,EAAS,OAAO,WAAe,IAAc,WAAa,GAAU,KAAM,EAAO,MAAQA,GAAS,OAC3F,UAAY,CAEpB,SAAS,GAAK,CACZ,MAAO,GAET,SAAS,GAAQ,CACf,MAAO,GAET,SAAS,GAAQ,EAGjB,IAAM,EAAqB,oCA0C3B,SAASC,GAAS,CAMhB,SAASC,EAAc,EAAG,CACxB,OAAO,OAAO,GAAM,YAAY,GAAc,EAAE,cAAgB,OAElE,IAAM,EAAS,CAAC,CACd,KAAM,SACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,UAEvB,CAAE,CACD,KAAM,SACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,UAEvB,CAAE,CACD,KAAM,UACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,WAEvB,CAAE,CACD,KAAM,WACN,KAAM,SAAU,EAAG,CACjB,OAAO,OAAO,GAAM,YAEvB,CAAE,CACD,KAAM,QACN,KAAM,MAAM,QACb,CAAE,CACD,KAAM,OACN,KAAM,SAAU,EAAG,CACjB,OAAO,aAAa,MAEvB,CAAE,CACD,KAAM,SACN,KAAM,SAAU,EAAG,CACjB,OAAO,aAAa,QAEvB,CAAE,CACD,KAAM,SACN,KAAMA,EACP,CAAE,CACD,KAAM,OACN,KAAM,SAAU,EAAG,CACjB,OAAO,IAAM,MAEhB,CAAE,CACD,KAAM,YACN,KAAM,SAAU,EAAG,CACjB,OAAO,IAAM,IAAA,IAEhB,CAAC,CACI,EAAU,CACd,KAAM,MACN,KAAM,EACN,MAAO,GACR,CAOG,EACA,EAGA,EAAe,EAIf,EAAQ,CACV,YAAa,EACd,CASD,SAAS,EAAS,EAAU,CAC1B,IAAM,EAAO,EAAQ,IAAI,EAAS,CAClC,GAAI,EACF,OAAO,EAGT,IAAI,EAAU,iBAAmB,EAAW,IACtCC,EAAO,EAAS,aAAa,CAC/B,EACJ,IAAK,KAAa,EAChB,GAAI,EAAU,aAAa,GAAKA,EAAM,CACpC,GAAW,mBAAqB,EAAY,MAC5C,MAGJ,MAAU,UAAU,EAAQ,CAgB9B,SAAS,EAAS,EAAO,CACvB,IAAI,EAAa,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,MAC/E,EAAc,EAAa,EAAS,EAAW,CAAC,MAAQ,EAAS,OACjE,EAAW,EAAE,CACnB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAAG,CACrC,GAAI,CAAC,EAAM,IAAM,OAAO,EAAM,GAAG,MAAS,UAAY,OAAO,EAAM,GAAG,MAAS,WAC7E,MAAU,UAAU,iEAAiE,CAEvF,IAAM,EAAW,EAAM,GAAG,KAC1B,GAAI,EAAQ,IAAI,EAAS,CACvB,MAAU,UAAU,wBAA0B,EAAW,IAAI,CAE/D,EAAS,KAAK,EAAS,CACvB,EAAQ,IAAI,EAAU,CACpB,KAAM,EACN,KAAM,EAAM,GAAG,KACf,MAAO,EAAM,GAAG,MAChB,MAAO,EAAc,EACrB,cAAe,EAAE,CAClB,CAAC,CAGJ,IAAM,EAAgB,EAAS,MAAM,EAAY,CACjD,EAAW,EAAS,MAAM,EAAG,EAAY,CAAC,OAAO,EAAS,CAAC,OAAO,EAAc,CAEhF,IAAK,IAAI,EAAI,EAAc,EAAS,OAAQ,EAAI,EAAS,OAAQ,EAAE,EACjE,EAAQ,IAAI,EAAS,GAAG,CAAC,MAAQ,EAUrC,SAAS,GAAQ,CACf,EAAU,IAAI,IACd,EAAW,EAAE,CACb,EAAe,EACf,EAAS,CAAC,EAAQ,CAAE,GAAM,CAI5B,GAAO,CACP,EAAS,EAAO,CAKhB,SAAS,GAAmB,CAC1B,IAAI,EACJ,IAAK,KAAY,EACf,EAAQ,IAAI,EAAS,CAAC,cAAgB,EAAE,CAE1C,EAAe,EASjB,SAAS,EAAc,EAAO,CAC5B,IAAM,EAAU,EAAS,OAAO,GAAQ,CACtC,IAAM,EAAO,EAAQ,IAAIA,EAAK,CAC9B,MAAO,CAAC,EAAK,OAAS,EAAK,KAAK,EAAM,EACtC,CAIF,OAHI,EAAQ,OACH,EAEF,CAAC,MAAM,CAQhB,SAAS,EAAgB,EAAQ,CAC/B,OAAO,GAAU,OAAO,GAAW,YAAc,uBAAwB,EAqC3E,SAAS,EAAc,EAAI,EAAW,EAAS,CAC7C,GAAI,CAAC,EAAgB,EAAG,CACtB,MAAU,UAAU,EAAmB,CAIzC,IAAM,EAAQ,GAAW,EAAQ,MAE3B,EAAS,GADS,MAAM,QAAQ,EAAU,CAAG,EAAU,KAAK,IAAI,CAAG,EAC3B,CACxC,EAAqB,EAAgB,EAAO,CAGlD,GAAI,CAAC,GAAS,KAAsB,EAAG,WAAY,CAEjD,IAAM,EAAQ,EAAG,mBAAmB,aAAa,IAAI,EAAmB,CACxE,GAAI,EACF,OAAO,EAQX,IAAM,EAAU,EAAO,OACnB,EACJ,GAAI,EAAO,CACT,EAAsB,EAAE,CACxB,IAAIA,EACJ,IAAKA,KAAQ,EAAG,WACd,EAAoB,KAAK,EAAG,mBAAmB,aAAa,IAAIA,EAAK,CAAC,MAGxE,EAAsB,EAAG,mBAAmB,WAE9C,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,EAAE,EAAG,CAChC,IAAM,EAAO,EAAO,GACd,EAAqB,EAAE,CACzB,EACJ,IAAK,KAAe,EAAqB,CACvC,IAAM,EAAO,EAAgB,EAAY,OAAQ,EAAE,CAC/C,MAAC,GAAQ,EAAK,WAAa,CAAC,EAAK,WAGrC,IAAI,CAAC,EAAK,OAAQ,CAEhB,IAAM,EAAY,GAAa,EAAK,CACpC,GAAI,EAAK,MAAM,KAAK,GAAS,CAAC,EAAU,IAAI,EAAM,KAAK,CAAC,CACtD,SAIJ,EAAmB,KAAK,EAAY,EAGtC,GADA,EAAsB,EAClB,EAAoB,SAAW,EAAG,MAGxC,IAAI,EACJ,IAAK,KAAa,EAChB,GAAI,EAAU,OAAO,QAAU,EAC7B,OAAO,EAGX,MAAU,UAAU,oCAAsC,EAAG,MAAQ,WAAa,IAAM,EAAgB,EAAQ,KAAK,CAAG,KAAK,CA6B/H,SAAS,EAAK,EAAI,EAAW,EAAS,CACpC,OAAO,EAAc,EAAI,EAAW,EAAQ,CAAC,eAS/C,SAAS,EAAQ,EAAO,EAAU,CAEhC,IAAM,EAAO,EAAS,EAAS,CAC/B,GAAI,EAAK,KAAK,EAAM,CAClB,OAAO,EAET,IAAM,EAAc,EAAK,cACzB,GAAI,EAAY,SAAW,EACzB,MAAU,MAAM,+BAAiC,EAAW,YAAY,CAE1E,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,OAAQ,IAEtC,GADiB,EAAS,EAAY,GAAG,KAAK,CACjC,KAAK,EAAM,CACtB,OAAO,EAAY,GAAG,QAAQ,EAAM,CAGxC,MAAU,MAAM,kBAAoB,EAAQ,OAAS,EAAS,CAShE,SAAS,EAAgB,EAAQ,CAC/B,IAAI,EAAY,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,IACpF,OAAO,EAAO,IAAI,GAAK,EAAE,KAAK,CAAC,KAAK,EAAU,CAQhD,SAAS,EAAW,EAAO,CACzB,IAAM,EAAY,EAAM,QAAQ,MAAM,GAAK,EAErC,GADS,EAAoB,EAAM,OAAS,EAAI,EAAM,MAAM,EAAE,CAAG,MAA5C,GACJ,MAAM,IAAI,CAAC,IAAI,GAAK,EAAS,EAAE,MAAM,CAAC,CAAC,CAC1D,EAAS,GACT,EAAY,EAAY,MAAQ,GAapC,MAAO,CACL,MAbiB,EAAS,IAAI,SAAU,EAAM,CAG9C,MAFA,GAAS,EAAK,OAAS,EACvB,GAAa,EAAK,KAAO,IAClB,CACL,KAAM,EAAK,KACX,UAAW,EAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,MACZ,WAAY,KACZ,gBAAiB,GAClB,EACD,CAGA,KAAM,EAAU,MAAM,EAAG,GAAG,CAE5B,SACA,cAAe,GACf,YACD,CASH,SAAS,GAAY,EAAO,CAE1B,IAAM,EAAsB,GADV,EAAM,MAAM,IAAI,GAAK,EAAE,KAAK,CACa,CACvD,EAAS,EAAM,OACf,EAAU,EAAM,KACd,EAAmB,EAAoB,IAAI,SAAU,EAAY,CACrE,IAAM,EAAO,EAAS,EAAW,KAAK,CAGtC,MAFA,GAAS,EAAK,OAAS,EACvB,GAAW,IAAM,EAAW,KACrB,CACL,KAAM,EAAW,KACjB,UAAW,EAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,MACZ,aACA,gBAAiB,EAAW,MAC7B,EACD,CACF,MAAO,CACL,MAAO,EAAM,MAAM,OAAO,EAAiB,CAC3C,KAAM,EACN,SACA,cAAe,EAAiB,OAAS,EACzC,UAAW,EAAM,UAClB,CAUH,SAAS,GAAa,EAAO,CAK3B,OAJK,EAAM,UACT,EAAM,QAAU,IAAI,IACpB,EAAM,MAAM,QAAQ,GAAQ,EAAM,QAAQ,IAAI,EAAK,KAAK,CAAC,EAEpD,EAAM,QAUf,SAAS,GAAe,EAAc,CACpC,IAAM,EAAS,EAAE,CACjB,GAAI,OAAO,GAAiB,SAC1B,MAAU,UAAU,6BAA6B,CAEnD,IAAM,EAAY,EAAa,MAAM,CACrC,GAAI,IAAc,GAChB,OAAO,EAET,IAAM,EAAY,EAAU,MAAM,IAAI,CACtC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAU,OAAQ,EAAE,EAAG,CACzC,IAAM,EAAc,EAAW,EAAU,GAAG,MAAM,CAAC,CACnD,GAAI,EAAY,WAAa,IAAM,EAAU,OAAS,EACpD,MAAU,YAAY,8BAAgC,EAAU,GAAK,yCAA8C,CAGrH,GAAI,EAAY,MAAM,SAAW,EAC/B,OAAO,KAET,EAAO,KAAK,EAAY,CAE1B,OAAO,EAQT,SAAS,EAAa,EAAQ,CAC5B,IAAM,EAAQ,EAAK,EAAO,CAC1B,OAAO,EAAQ,EAAM,UAAY,GASnC,SAAS,EAAY,EAAO,CAC1B,GAAI,CAAC,GAAS,EAAM,MAAM,SAAW,EAEnC,OAAO,KACE,EAAM,MAAM,SAAW,EAChC,OAAO,EAAS,EAAM,MAAM,GAAG,KAAK,CAAC,QAC5B,EAAM,MAAM,SAAW,EAAG,CACnC,IAAM,EAAQ,EAAS,EAAM,MAAM,GAAG,KAAK,CAAC,KACtC,EAAQ,EAAS,EAAM,MAAM,GAAG,KAAK,CAAC,KAC5C,OAAO,SAAY,EAAG,CACpB,OAAO,EAAM,EAAE,EAAI,EAAM,EAAE,MAExB,CAEL,IAAM,EAAQ,EAAM,MAAM,IAAI,SAAU,EAAM,CAC5C,OAAO,EAAS,EAAK,KAAK,CAAC,MAC3B,CACF,OAAO,SAAY,EAAG,CACpB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,EAAM,GAAG,EAAE,CACb,MAAO,GAGX,MAAO,KAUb,SAAS,GAAa,EAAQ,CAC5B,IAAI,EAAO,EAAO,EAClB,GAAI,EAAa,EAAO,CAAE,CAExB,EAAQ,GAAQ,EAAO,CAAC,IAAI,EAAY,CACxC,IAAM,EAAW,EAAM,OACjB,EAAW,EAAY,EAAK,EAAO,CAAC,CACpC,EAAgB,SAAU,EAAM,CACpC,IAAK,IAAI,EAAI,EAAU,EAAI,EAAK,OAAQ,IACtC,GAAI,CAAC,EAAS,EAAK,GAAG,CACpB,MAAO,GAGX,MAAO,IAET,OAAO,SAAkB,EAAM,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,CAAC,EAAM,GAAG,EAAK,GAAG,CACpB,MAAO,GAGX,OAAO,EAAc,EAAK,EAAI,EAAK,QAAU,EAAW,WAItD,EAAO,SAAW,EACpB,OAAO,SAAkB,EAAM,CAC7B,OAAO,EAAK,SAAW,WAEhB,EAAO,SAAW,EAE3B,MADA,GAAQ,EAAY,EAAO,GAAG,CACvB,SAAkB,EAAM,CAC7B,OAAO,EAAM,EAAK,GAAG,EAAI,EAAK,SAAW,WAElC,EAAO,SAAW,EAG3B,MAFA,GAAQ,EAAY,EAAO,GAAG,CAC9B,EAAQ,EAAY,EAAO,GAAG,CACvB,SAAkB,EAAM,CAC7B,OAAO,EAAM,EAAK,GAAG,EAAI,EAAM,EAAK,GAAG,EAAI,EAAK,SAAW,QAK7D,MADA,GAAQ,EAAO,IAAI,EAAY,CACxB,SAAkB,EAAM,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,CAAC,EAAM,GAAG,EAAK,GAAG,CACpB,MAAO,GAGX,OAAO,EAAK,SAAW,EAAM,QAcrC,SAAS,EAAgB,EAAQ,EAAO,CACtC,OAAO,EAAQ,EAAO,OAAS,EAAO,GAAS,EAAa,EAAO,CAAG,EAAK,EAAO,CAAG,KASvF,SAAS,EAAkB,EAAQ,EAAO,CACxC,IAAM,EAAQ,EAAgB,EAAQ,EAAM,CAI5C,OAHK,EAGE,GAAa,EAAM,CAFjB,IAAI,IAUf,SAAS,EAAY,EAAM,CACzB,OAAO,EAAK,aAAe,MAAQ,EAAK,aAAe,IAAA,GAUzD,SAAS,EAAoB,EAAY,EAAO,CAC9C,IAAM,EAAU,IAAI,IAQpB,OAPA,EAAW,QAAQ,GAAa,CAC9B,IAAM,EAAW,EAAkB,EAAU,OAAQ,EAAM,CACvDA,EACJ,IAAKA,KAAQ,EACX,EAAQ,IAAIA,EAAK,EAEnB,CACK,EAAQ,IAAI,MAAM,CAAG,CAAC,MAAM,CAAG,MAAM,KAAK,EAAQ,CAW3D,SAAS,EAAY,EAAM,EAAM,EAAY,CAC3C,IAAI,EAAK,EACH,EAAQA,GAAQ,UAGlB,EAAqB,EACrB,EACJ,IAAK,EAAQ,EAAG,EAAQ,EAAK,OAAQ,IAAS,CAC5C,IAAM,EAAmB,EAAE,CAQ3B,GAPA,EAAmB,QAAQ,GAAa,CAEtC,IAAM,EAAO,EADC,EAAgB,EAAU,OAAQ,EAAM,CACvB,EAC1B,EAAQ,EAAU,OAAO,QAAU,EAAa,EAAU,OAAO,GAAK,EAAK,EAAK,GAAO,EAC1F,EAAiB,KAAK,EAAU,EAElC,CACE,EAAiB,SAAW,EAG9B,IADA,EAAW,EAAoB,EAAoB,EAAM,CACrD,EAAS,OAAS,EAAG,CACvB,IAAM,EAAc,EAAc,EAAK,GAAO,CAS9C,MARA,GAAU,UAAU,2CAA6C,EAAQ,eAAiB,EAAS,KAAK,OAAO,CAAG,aAAe,EAAY,KAAK,MAAM,CAAG,YAAc,EAAQ,IAAI,CACrL,EAAI,KAAO,CACT,SAAU,YACV,GAAI,EACJ,QACA,OAAQ,EACR,WACD,CACM,QAGT,EAAqB,EAKzB,IAAM,EAAU,EAAmB,IAAI,SAAU,EAAW,CAC1D,OAAO,EAAa,EAAU,OAAO,CAAG,IAAW,EAAU,OAAO,QACpE,CACF,GAAI,EAAK,OAAS,KAAK,IAAI,MAAM,KAAM,EAAQ,CAS7C,MARA,GAAW,EAAoB,EAAoB,EAAM,CACzD,EAAU,UAAU,iCAAmC,EAAQ,eAAiB,EAAS,KAAK,OAAO,CAAG,YAAc,EAAK,OAAS,IAAI,CACxI,EAAI,KAAO,CACT,SAAU,aACV,GAAI,EACJ,MAAO,EAAK,OACZ,WACD,CACM,EAIT,IAAM,EAAY,KAAK,IAAI,MAAM,KAAM,EAAQ,CAC/C,GAAI,EAAK,OAAS,EAQhB,MAPA,GAAU,UAAU,kCAAoC,EAAQ,eAAiB,EAAY,aAAe,EAAK,OAAS,IAAI,CAC9H,EAAI,KAAO,CACT,SAAU,cACV,GAAI,EACJ,MAAO,EAAK,OACZ,eAAgB,EACjB,CACM,EAIT,IAAM,EAAW,EAAE,CACnB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EACjC,EAAS,KAAK,EAAc,EAAK,GAAG,CAAC,KAAK,IAAI,CAAC,CAOjD,MALA,GAAU,UAAU,sBAAwB,EAAS,KAAK,KAAK,CAAG,4DAA8D,EAAQ,IAAI,CAC5I,EAAI,KAAO,CACT,SAAU,WACV,OAAQ,EACT,CACM,EAQT,SAAS,EAAmB,EAAO,CACjC,IAAI,EAAM,EAAS,OAAS,EAC5B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,MAAM,OAAQ,IACtC,EAAM,KAAK,IAAI,EAAK,EAAM,MAAM,GAAG,UAAU,CAE/C,OAAO,EAST,SAAS,EAAyB,EAAO,CACvC,IAAI,EAAM,EAAe,EACzB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,MAAM,OAAQ,IACjC,EAAY,EAAM,MAAM,GAAG,GAC9B,EAAM,KAAK,IAAI,EAAK,EAAM,MAAM,GAAG,gBAAgB,EAGvD,OAAO,EAiBT,SAAS,GAAc,EAAQ,EAAQ,CAGrC,GAAI,EAAO,WACL,CAAC,EAAO,OACV,MAAO,YAEA,EAAO,OAChB,MAAO,IAIT,GAAI,EAAO,cACL,CAAC,EAAO,UACV,MAAO,aAEA,EAAO,UAChB,MAAO,KAIT,IAAM,EAAW,EAAmB,EAAO,CAAG,EAAmB,EAAO,CACxE,GAAI,EAAW,EACb,MAAO,MAET,GAAI,EAAW,EACb,MAAO,MAKT,IAAM,EAAQ,EAAyB,EAAO,CACxC,EAAQ,EAAyB,EAAO,CAC9C,GAAI,EAAO,kBACL,CAAC,EAAO,cACV,OAAQ,EAAI,GAAS,aAEd,EAAO,cAChB,MAAO,EAAE,EAAI,GAAS,KAIxB,IAAM,EAAW,EAAQ,EASzB,OARI,EAAW,EACN,MAEL,EAAW,EACN,KAIF,EAgBT,SAAS,EAAkB,EAAY,EAAY,CACjD,IAAM,EAAQ,EAAW,OACnB,EAAQ,EAAW,OACnB,EAAQ,EAAK,EAAM,CACnB,EAAQ,EAAK,EAAM,CACnB,EAAW,EAAa,EAAM,CAC9B,EAAW,EAAa,EAAM,CAGpC,GAAI,GAAY,EAAM,WAChB,CAAC,GAAY,CAAC,EAAM,OACtB,MAAO,aAEA,GAAY,EAAM,OAC3B,MAAO,KAIT,IAAI,EAAO,EACP,EAAQ,EACR,EACJ,IAAK,KAAO,EACN,EAAI,QAAQ,EAAE,EACd,EAAI,eAAe,EAAE,EAE3B,IAAI,EAAO,EACP,EAAQ,EACZ,IAAK,KAAO,EACN,EAAI,QAAQ,EAAE,EACd,EAAI,eAAe,EAAE,EAE3B,GAAI,IAAS,EACX,OAAQ,EAAO,GAAQ,IAIzB,GAAI,GAAY,EAAM,kBAChB,CAAC,GAAY,CAAC,EAAM,cACtB,MAAO,aAEA,GAAY,EAAM,cAC3B,MAAO,KAIT,GAAI,IAAU,EACZ,OAAQ,EAAQ,GAAS,IAI3B,GAAI,MACE,CAAC,EACH,MAAO,aAEA,EACT,MAAO,KAIT,IAAM,GAAmB,EAAM,OAAS,EAAM,SAAW,EAAW,KAAO,KAC3E,GAAI,IAAoB,EACtB,OAAO,EAOT,IAAM,EAAc,EAAE,CAClB,EAAK,EACT,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAAG,CACrC,IAAM,EAAiB,GAAc,EAAM,GAAI,EAAM,GAAG,CACxD,EAAY,KAAK,EAAe,CAChC,GAAM,EAER,GAAI,IAAO,EACT,OAAQ,EAAK,EAAI,IAAM,IAAM,EAO/B,IAAI,EACA,EAAQ,EACN,EAAY,GAAS,EAAY,OAAS,GAChD,IAAK,KAAK,EAAa,CACrB,GAAI,IAAM,EACR,OAAQ,EAAI,EAAI,CAAC,EAAQ,GAAS,EAEpC,GAAS,EAIX,MAAO,GAWT,SAAS,GAAqB,EAAW,CACvC,GAAI,EAAU,SAAW,EACvB,MAAO,EAAE,CAEX,IAAM,EAAQ,EAAU,IAAI,EAAS,CACrC,GAAI,EAAU,SAAW,EAAG,OAAO,EAAM,GAAG,cAK5C,IAAM,EAAa,IAAI,IAAI,EAAU,CAC/B,EAAmB,IAAI,IAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAClC,IAAK,IAAM,KAAS,EAAM,GAAG,cACtB,EAAW,IAAI,EAAM,KAAK,EAAE,EAAiB,IAAI,EAAM,KAAK,CAKrE,IAAM,EAAU,EAAE,CAClB,IAAK,IAAM,KAAY,EAAkB,CACvC,IAAI,EAAY,EAAe,EAC3B,EAAiB,KACrB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAClC,IAAK,IAAM,KAAS,EAAM,GAAG,cACvB,EAAM,OAAS,GAAY,EAAM,MAAQ,IAC3C,EAAY,EAAM,MAClB,EAAiB,GAIvB,EAAQ,KAAK,EAAe,CAE9B,OAAO,EAaT,SAAS,GAAyB,EAAQ,EAAI,CAC5C,IAAI,EAAY,EAIZA,EAAO,GACX,GAAI,EAAO,KAAK,GAAK,EAAE,cAAc,CAAE,CACrC,IAAM,EAAY,EAAa,EAAO,CAChC,EAAsB,EAAO,IAAI,EAAqB,CAC5D,EAAO,EAAoB,IAAI,GAAQ,EAAK,KAAK,CAAC,KAAK,IAAI,CAC3D,EAAY,UAAuB,CACjC,IAAM,EAAO,EAAE,CACTC,EAAO,EAAY,UAAU,OAAS,EAAI,UAAU,OAC1D,IAAK,IAAI,EAAI,EAAG,EAAIA,EAAM,IACxB,EAAK,GAAK,EAAoB,GAAG,UAAU,GAAG,CAKhD,OAHI,IACF,EAAKA,GAAQ,UAAUA,GAAM,IAAI,EAAoBA,GAAM,EAEtD,EAAG,MAAM,KAAM,EAAK,EAG/B,IAAI,EAAe,EACnB,GAAI,EAAa,EAAO,CAAE,CACxB,IAAM,EAAS,EAAO,OAAS,EAC/B,EAAe,UAAgC,CAC7C,OAAO,EAAU,MAAM,KAAM,GAAM,UAAW,EAAG,EAAO,CAAC,OAAO,CAAC,GAAM,UAAW,EAAO,CAAC,CAAC,CAAC,EAMhG,OAHID,GAAM,OAAO,eAAe,EAAc,OAAQ,CACpD,MAAOA,EACR,CAAC,CACK,EAST,SAAS,EAAqB,EAAO,CACnC,IAAI,EAAO,EAAO,EAAa,EACzB,EAAQ,EAAE,CACV,EAAc,EAAE,CAClBA,EAAO,GACX,EAAM,MAAM,QAAQ,SAAU,EAAM,CAC9B,EAAK,aACP,GAAQ,EAAK,WAAW,KAAO,KAAO,EAAK,WAAW,GAAK,IAC3D,EAAM,KAAK,EAAS,EAAK,WAAW,KAAK,CAAC,KAAK,CAC/C,EAAY,KAAK,EAAK,WAAW,QAAQ,GAE3C,CACF,AAAwC,EAApCA,EAAaA,EAAK,MAAM,EAAG,GAAG,CAAa,OAG/C,IAAI,EAAY,GAAO,EACvB,OAAQ,EAAY,OAApB,CACE,IAAK,GACH,MACF,IAAK,GACH,EAAQ,EAAM,GACd,EAAc,EAAY,GAC1B,EAAY,SAAoB,EAAK,CAInC,OAHI,EAAM,EAAI,CACL,EAAY,EAAI,CAElB,GAET,MACF,IAAK,GACH,EAAQ,EAAM,GACd,EAAQ,EAAM,GACd,EAAc,EAAY,GAC1B,EAAc,EAAY,GAC1B,EAAY,SAAoB,EAAK,CAOnC,OANI,EAAM,EAAI,CACL,EAAY,EAAI,CAErB,EAAM,EAAI,CACL,EAAY,EAAI,CAElB,GAET,MACF,QACE,EAAY,SAAoB,EAAK,CACnC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAY,OAAQ,IACtC,GAAI,EAAM,GAAG,EAAI,CACf,OAAO,EAAY,GAAG,EAAI,CAG9B,OAAO,GAMb,OAHA,OAAO,eAAe,EAAW,OAAQ,CACvC,MAAOA,EACR,CAAC,CACK,EAoBT,SAAS,GAAY,EAAQ,CAC3B,SAAS,EAAa,EAAQ,EAAO,EAAa,CAChD,GAAI,EAAQE,EAAO,OAAQ,CACzB,IAAM,EAAQA,EAAO,GACjB,EAAkB,EAAE,CACxB,GAAI,EAAM,UAAW,CAGnB,IAAM,EAAa,EAAM,MAAM,OAAO,EAAY,CAC9C,EAAW,OAAS,EAAM,MAAM,QAClC,EAAgB,KAAK,CACnB,MAAO,EACP,KAAM,MAAQ,EAAW,IAAI,GAAK,EAAE,KAAK,CAAC,KAAK,IAAI,CACnD,OAAQ,EAAW,KAAK,GAAK,EAAE,MAAM,CACrC,cAAe,GACf,UAAW,GACZ,CAAC,CAEJ,EAAgB,KAAK,EAAM,MAG3B,EAAkB,EAAM,MAAM,IAAI,SAAU,EAAM,CAChD,MAAO,CACL,MAAO,CAAC,EAAK,CACb,KAAM,EAAK,KACX,OAAQ,EAAK,MACb,cAAe,EAAK,WACpB,UAAW,GACZ,EACD,CAIJ,OAAO,GAAQ,EAAiB,SAAU,EAAW,CACnD,OAAO,EAAaA,EAAQ,EAAQ,EAAG,EAAY,OAAO,CAAC,EAAU,CAAC,CAAC,EACvE,MAGF,MAAO,CAAC,EAAY,CAGxB,OAAO,EAAa,EAAQ,EAAG,EAAE,CAAC,CASpC,SAAS,GAAY,EAAS,EAAS,CACrC,IAAM,EAAK,KAAK,IAAI,EAAQ,OAAQ,EAAQ,OAAO,CACnD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,IAAK,CAC3B,IAAM,EAAW,EAAkB,EAAS,EAAE,CACxC,EAAW,EAAkB,EAAS,EAAE,CAC1C,EAAU,GACVF,EACJ,IAAKA,KAAQ,EACX,GAAI,EAAS,IAAIA,EAAK,CAAE,CACtB,EAAU,GACV,MAGJ,GAAI,CAAC,EACH,MAAO,GAGX,IAAM,EAAO,EAAQ,OACf,EAAO,EAAQ,OACf,EAAa,EAAa,EAAQ,CAClC,EAAa,EAAa,EAAQ,CACxC,OAAO,EAAa,EAAa,IAAS,EAAO,GAAQ,EAAO,EAAa,GAAQ,EAAO,IAAS,EAWvG,SAAS,GAAiB,EAAc,CACtC,OAAO,EAAa,IAAI,GAClB,GAAc,EAAG,CACZ,GAAY,EAAG,YAAY,SAAS,CAEzC,EAAU,EAAG,CACR,GAAY,EAAG,QAAQ,WAAY,EAAG,QAAQ,SAAS,CAEzD,EACP,CAcJ,SAAS,GAAmB,EAAY,EAAc,EAAc,CAClE,IAAM,EAAqB,EAAE,CACzB,EACJ,IAAK,KAAa,EAAY,CAC5B,IAAI,EAAa,EAAa,GAC9B,GAAI,OAAO,GAAe,SACxB,MAAU,UAAU,2CAA6C,EAAY,IAAI,CAGnF,GADA,EAAa,EAAa,GACtB,OAAO,GAAe,WACxB,MAAO,GAET,EAAmB,KAAK,EAAW,CAErC,OAAO,EAcT,SAAS,GAAkB,EAAc,EAAc,EAAM,CAC3D,IAAM,EAAoB,GAAiB,EAAa,CAClD,EAAiB,MAAM,EAAkB,OAAO,CAAC,KAAK,GAAM,CAC9D,EAAiB,GACrB,KAAO,GAAgB,CACrB,EAAiB,GACjB,IAAI,EAAkB,GACtB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAkB,OAAQ,EAAE,EAAG,CACjD,GAAI,EAAW,GAAI,SACnB,IAAM,EAAK,EAAkB,GAC7B,GAAI,GAAc,EAAG,CACnB,EAAkB,GAAK,EAAG,YAAY,SAASG,EAAK,CAEpD,EAAkB,GAAG,YAAc,EAAG,YACtC,EAAW,GAAK,GAChB,EAAkB,WACT,EAAU,EAAG,CAAE,CACxB,IAAM,EAAqB,GAAmB,EAAG,QAAQ,WAAY,EAAmB,EAAa,CACjG,GACF,EAAkB,GAAK,EAAG,QAAQ,SAAS,MAAM,KAAM,EAAmB,CAE1E,EAAkB,GAAG,QAAU,EAAG,QAClC,EAAW,GAAK,GAChB,EAAkB,IAElB,EAAiB,IAIvB,GAAI,GAAmB,EACrB,MAAU,YAAY,yDAAyD,CAGnF,OAAO,EAUT,SAAS,EAAuB,EAAe,CAI7C,IAAM,EAAsB,4BAC5B,OAAO,KAAK,EAAc,CAAC,QAAQ,GAAa,CAC9C,IAAM,EAAK,EAAc,GACzB,GAAI,EAAoB,KAAK,EAAG,UAAU,CAAC,CACzC,MAAU,YAAY,mIAA6I,EAErK,CAaJ,SAAS,EAAoB,EAAM,EAAkB,CAEnD,GADA,EAAM,cACF,OAAO,KAAK,EAAiB,CAAC,SAAW,EAC3C,MAAU,YAAY,yBAAyB,CAE7C,EAAM,2BACR,EAAuB,EAAiB,CAI1C,IAAM,EAAe,EAAE,CACjB,EAAoB,EAAE,CACtB,EAAgB,EAAE,CAClB,EAAwB,EAAE,CAC5B,EACJ,IAAK,KAAa,EAAkB,CAElC,GAAI,CAAC,OAAO,UAAU,eAAe,KAAK,EAAkB,EAAU,CACpE,SAGF,IAAM,EAAS,GAAe,EAAU,CACxC,GAAI,CAAC,EAAQ,SAEb,EAAa,QAAQ,SAAU,EAAI,CACjC,GAAI,GAAY,EAAI,EAAO,CACzB,MAAU,UAAU,2BAA6B,EAAgB,EAAG,CAAG,UAAY,EAAgB,EAAO,CAAG,KAAK,EAEpH,CACF,EAAa,KAAK,EAAO,CAEzB,IAAM,EAAgB,EAAkB,OACxC,EAAkB,KAAK,EAAiB,GAAW,CACnD,IAAM,EAAmB,EAAO,IAAI,GAAY,CAE5C,EACJ,IAAK,KAAM,GAAY,EAAiB,CAAE,CACxC,IAAM,EAAS,EAAgB,EAAG,CAClC,EAAsB,KAAK,CACzB,OAAQ,EACR,KAAM,EACN,GAAI,EACL,CAAC,CACE,EAAG,MAAM,GAAK,CAAC,EAAE,cAAc,GACjC,EAAc,GAAU,IAI9B,EAAsB,KAAK,EAAkB,CAG7C,IAAM,EAAoB,GAAkB,EAAmB,EAAe,EAAW,CAGrF,EACJ,IAAK,KAAK,EACJ,OAAO,UAAU,eAAe,KAAK,EAAe,EAAE,GACxD,EAAc,GAAK,EAAkB,EAAc,KAGvD,IAAM,EAAa,EAAE,CACf,EAAuB,IAAI,IACjC,IAAK,KAAK,EAIH,EAAqB,IAAI,EAAE,KAAK,GACnC,EAAE,GAAK,EAAkB,EAAE,IAC3B,EAAW,KAAK,EAAE,CAClB,EAAqB,IAAI,EAAE,KAAM,EAAE,EAKvC,IAAM,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,GAAK,CAAC,EAAa,EAAW,GAAG,OAAO,CAC9F,EAAQ,GAAO,GAAO,GAAO,GAAO,GAAO,EAGjD,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,EAAE,EACvC,EAAW,GAAG,KAAO,GAAa,EAAW,GAAG,OAAO,CAEzD,IAAM,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,GAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,GAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,GAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,GAAG,CAAG,EAG5D,IAAK,IAAI,EAAI,EAAG,EAAI,EAAW,OAAQ,EAAE,EACvC,EAAW,GAAG,eAAiB,GAAyB,EAAW,GAAG,OAAQ,EAAW,GAAG,GAAG,CAEjG,IAAM,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,EAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,EAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAC3C,GAAO,EAAM,EAAW,GAAG,OAAO,OAAS,GAG3C,EAAS,EAAQ,EAAI,EACrB,GAAO,EAAW,OAElB,GAAQ,EAAW,IAAI,GAAKC,EAAE,KAAK,CACnC,GAAM,EAAW,IAAI,GAAKA,EAAE,eAAe,CAC3C,EAAU,UAAmB,CAEjC,IAAK,IAAI,EAAI,EAAQ,EAAI,GAAM,IAC7B,GAAI,GAAM,GAAG,UAAU,CACrB,OAAO,GAAI,GAAG,MAAM,KAAM,UAAU,CAGxC,OAAO,EAAM,WAAWJ,EAAM,UAAW,EAAW,EAKtD,SAAS,EAAW,EAAM,EAAM,CAoB9B,OAlBI,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,EAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,GAAQ,GAAO,EAAK,EAAI,EAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,EAAO,EAAK,CACpD,EAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,GAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,GAAO,EAAK,CACpD,GAAI,MAAM,KAAM,UAAU,CAE/B,UAAU,SAAW,IAAQ,EAAO,EAAK,EAAI,EAAO,EAAK,CACpD,EAAI,MAAM,KAAM,UAAU,CAE5B,EAAQ,MAAM,KAAM,UAAU,CAIvC,GAAI,CACF,OAAO,eAAe,EAAY,OAAQ,CACxC,MAAOA,EACR,CAAC,MACU,EAiBd,MARA,GAAW,WAAa,EAIxB,EAAW,mBAAqB,CAC9B,aACA,aAAc,EACf,CACM,EAST,SAAS,GAAY,EAAM,EAAM,EAAY,CAC3C,MAAM,EAAYA,EAAM,EAAM,EAAW,CAQ3C,SAAS,GAAQ,EAAK,CACpB,OAAO,GAAM,EAAK,EAAG,EAAI,OAAS,EAAE,CAQtC,SAAS,EAAK,EAAK,CACjB,OAAO,EAAI,EAAI,OAAS,GAU1B,SAAS,GAAM,EAAK,EAAO,EAAK,CAC9B,OAAO,MAAM,UAAU,MAAM,KAAK,EAAK,EAAO,EAAI,CAUpD,SAAS,EAAY,EAAK,EAAM,CAC9B,IAAK,IAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,EAAK,EAAI,GAAG,CACd,OAAO,EAAI,GAajB,SAAS,GAAQ,EAAK,EAAU,CAC9B,OAAO,MAAM,UAAU,OAAO,MAAM,EAAE,CAAE,EAAI,IAAI,EAAS,CAAC,CAc5D,SAAS,IAAU,CACjB,IAAM,EAAa,GAAQ,UAAU,CAAC,IAAI,GAAK,EAAgB,GAAe,EAAE,CAAC,CAAC,CAC5E,EAAW,EAAK,UAAU,CAChC,GAAI,OAAO,GAAa,WACtB,MAAU,UAAU,8CAA8C,CAEpE,OAAO,GAAY,EAAY,EAAS,CAE1C,SAAS,GAAY,EAAY,EAAU,CACzC,MAAO,CACL,QAAS,CACP,aACA,WACD,CACF,CASH,SAAS,GAAY,EAAU,CAC7B,GAAI,OAAO,GAAa,WACtB,MAAU,UAAU,+CAA+C,CAErE,MAAO,CACL,YAAa,CACX,WACD,CACF,CAUH,SAAS,EAAU,EAAY,CAC7B,OAAO,GAAc,OAAO,EAAW,SAAY,UAAY,MAAM,QAAQ,EAAW,QAAQ,WAAW,EAAI,OAAO,EAAW,QAAQ,UAAa,WAUxJ,SAAS,GAAc,EAAY,CACjC,OAAO,GAAc,OAAO,EAAW,aAAgB,UAAY,OAAO,EAAW,YAAY,UAAa,WAWhH,SAAS,GAAU,EAAW,EAAS,CACrC,GAAI,CAAC,EACH,OAAO,EAET,GAAI,GAAW,IAAY,EAAW,CACpC,IAAM,EAAU,MAAM,0CAA4C,EAAY,aAAe,EAAU,IAAI,CAK3G,KAJA,GAAI,KAAO,CACT,OAAQ,EACR,SAAU,EACX,CACK,EAER,OAAO,EAST,SAAS,GAAc,EAAK,CAC1B,IAAIA,EACJ,IAAK,IAAM,KAAO,EAGZ,OAAO,UAAU,eAAe,KAAK,EAAK,EAAI,GAAK,EAAgB,EAAI,GAAK,EAAI,OAAO,EAAI,GAAK,WAAc,YAChH,EAAO,GAAUA,EAAM,EAAI,GAAK,KAAK,EAGzC,OAAOA,EAUT,SAAS,EAAgB,EAAM,EAAQ,CACrC,IAAI,EACJ,IAAK,KAAO,EACV,GAAI,OAAO,UAAU,eAAe,KAAK,EAAQ,EAAI,CAAE,CACrD,GAAI,KAAO,GACL,EAAO,KAAS,EAAK,GAAM,CAC7B,IAAM,EAAU,MAAM,cAAgB,EAAM,qBAAqB,CAMjE,KALA,GAAI,KAAO,CACT,UAAW,EACX,eAAgB,EAAO,GACvB,aAAc,EAAK,GACpB,CACK,EAIV,EAAK,GAAO,EAAO,IAIzB,IAAM,EAAY,EAwBlB,EAAQ,SAAU,EAAW,CAC3B,IAAM,EAAQ,OAAO,GAAc,SAC7B,EAAQ,EAAQ,EAAI,EACtBA,EAAO,EAAQ,EAAY,GACzB,EAAgB,EAAE,CACxB,IAAK,IAAI,EAAI,EAAO,EAAI,UAAU,OAAQ,EAAE,EAAG,CAC7C,IAAM,EAAO,UAAU,GACnB,EAAkB,EAAE,CACpB,EAiBJ,GAhBI,OAAO,GAAS,YAClB,EAAW,EAAK,KACZ,OAAO,EAAK,WAAc,SAE5B,EAAgB,EAAK,WAAa,EACzB,EAAgB,EAAK,GAE9B,EAAkB,EAAK,aAEhBD,EAAc,EAAK,GAE5B,EAAkB,EACb,IACH,EAAW,GAAc,EAAK,GAG9B,OAAO,KAAK,EAAgB,CAAC,SAAW,EAAG,CAC7C,IAAM,EAAU,UAAU,gCAAoC,EAAI,6FAAkG,CAKpK,KAJA,GAAI,KAAO,CACT,MAAO,EACP,SAAU,EACX,CACK,EAEH,IACH,EAAO,GAAUC,EAAM,EAAS,EAElC,EAAgB,EAAe,EAAgB,CAEjD,OAAO,EAAoBA,GAAQ,GAAI,EAAc,EAEvD,EAAM,OAASF,EACf,EAAM,YAAc,EAAU,YAC9B,EAAM,WAAa,GACnB,EAAM,mBAAqB,GAC3B,EAAM,YAAc,EACpB,EAAM,MAAQ,EACd,EAAM,iBAAmB,EACzB,EAAM,SAAW,EACjB,EAAM,UAAY,EAClB,EAAM,QAAU,GAChB,EAAM,YAAc,GACpB,EAAM,QAAU,EAChB,EAAM,cAAgB,EACtB,EAAM,KAAO,EACb,EAAM,gBAAkB,EACxB,EAAM,0BAA4B,GAUlC,EAAM,QAAU,SAAU,EAAM,EAAkB,CAChD,IAAI,EAAS,MACT,IAAqB,IAAS,EAAQ,IAAI,SAAS,GACrD,EAAS,UAEX,EAAM,SAAS,CAAC,EAAK,CAAE,EAAO,EAUhC,SAAS,GAAoB,EAAY,CACvC,GAAI,CAAC,GAAc,OAAO,EAAW,MAAS,UAAY,OAAO,EAAW,IAAO,UAAY,OAAO,EAAW,SAAY,WAC3H,MAAU,UAAU,gFAAgF,CAEtG,GAAI,EAAW,KAAO,EAAW,KAC/B,MAAU,YAAY,sCAAwC,EAAW,KAAO,eAAe,CA+FnG,MAnFA,GAAM,cAAgB,SAAU,EAAY,CAC1C,IAAI,EAAU,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,CAChF,SAAU,GACX,CACD,GAAoB,EAAW,CAC/B,IAAM,EAAK,EAAS,EAAW,GAAG,CAC5B,EAAW,EAAG,cAAc,KAAK,GAAS,EAAM,OAAS,EAAW,KAAK,CAC/E,GAAI,EACF,GAAI,GAAW,EAAQ,SACrB,EAAM,iBAAiB,CACrB,KAAM,EAAS,KACf,GAAI,EAAW,GACf,QAAS,EAAS,QACnB,CAAC,MAEF,MAAU,MAAM,uCAAyC,EAAW,KAAO,SAAW,EAAG,KAAO,IAAI,CAGxG,EAAG,cAAc,KAAK,CACpB,KAAM,EAAW,KACjB,GAAI,EAAG,KACP,QAAS,EAAW,QACpB,MAAO,IACR,CAAC,EAWJ,EAAM,eAAiB,SAAU,EAAa,EAAS,CACrD,EAAY,QAAQ,GAAc,EAAM,cAAc,EAAY,EAAQ,CAAC,EAY7E,EAAM,iBAAmB,SAAU,EAAY,CAC7C,GAAoB,EAAW,CAC/B,IAAM,EAAK,EAAS,EAAW,GAAG,CAC5B,EAAqB,EAAY,EAAG,cAAe,GAAK,EAAE,OAAS,EAAW,KAAK,CACzF,GAAI,CAAC,EACH,MAAU,MAAM,iDAAmD,EAAW,KAAO,OAAS,EAAW,GAAG,CAE9G,GAAI,EAAmB,UAAY,EAAW,QAC5C,MAAU,MAAM,0DAA0D,CAE5E,IAAM,EAAQ,EAAG,cAAc,QAAQ,EAAmB,CAC1D,EAAG,cAAc,OAAO,EAAO,EAAE,EAanC,EAAM,QAAU,SAAU,EAAI,EAAS,CACrC,GAAI,CAAC,EAAgB,EAAG,CACtB,MAAU,UAAU,EAAmB,CAEzC,IAAM,EAAO,EAAG,mBAAmB,WACnC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EACjC,GAAI,EAAK,GAAG,KAAK,EAAQ,CACvB,OAAO,EAAK,GAGhB,OAAO,MAEF,EAIT,OAFoBA,GAAQ,GAI3B,iBCp3DC,GAAgB,UAAwB,CAI1C,MADA,IAAgBQ,GAAAA,QAAc,OACvBA,GAAAA,SASE,GAA6B,EAAQ,QAP7B,CAAC,aAAc,WAAY,eAAgB,YAAY,CAOH,SAAqB,EAAM,CAChG,GAAI,CACF,YACA,UACA,cACA,YACE,EAIA,EAAQ,IAAe,CAsX3B,OAjXA,EAAM,OAAO,CACb,EAAM,SAAS,CAAC,CACd,KAAM,SACN,KAAM,EACP,CAAE,CACD,KAAM,UACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,EACP,CAAE,CACD,KAAM,SACN,KAAM,GACP,CAAE,CACD,KAAM,WACN,KAAM,EACP,CAAE,CACD,KAAM,OACN,KAAM,EACP,CAMD,CACE,KAAM,aACN,KAAM,GAAK,GAAY,ypgBAAypgB,KAAK,EAAE,CACxrgB,CAAE,CACD,KAAM,SACN,KAAM,EACP,CAAE,CACD,KAAM,QACN,KAAM,GACP,CAAE,CACD,KAAM,QACN,KAAM,EACP,CAAE,CACD,KAAM,SACN,KAAM,EACP,CAAE,CACD,KAAM,cACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,EACP,CAAE,CACD,KAAM,QACN,KAAM,GACP,CAAE,CACD,KAAM,QACN,KAAM,GACP,CAAE,CACD,KAAM,UACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,OACN,KAAM,GACP,CAAE,CACD,KAAM,WACN,KAAM,GACP,CAAE,CACD,KAAM,OACN,KAAM,GACP,CAAE,CACD,KAAM,SACN,KAAM,GACP,CAAE,CACD,KAAM,OACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,EACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,iBACN,KAAM,GACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,kBACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,EACP,CAAE,CACD,KAAM,eACN,KAAM,GACP,CAAE,CACD,KAAM,yBACN,KAAM,GACP,CAAE,CACD,KAAM,YACN,KAAM,EACP,CAAE,CACD,KAAM,OACN,KAAM,EACP,CAAE,CACD,KAAM,aACN,KAAM,GACP,CAAE,CACD,KAAM,eACN,KAAM,GACP,CAAE,CACD,KAAM,kBACN,KAAM,GACP,CAAE,CACD,KAAM,YACN,KAAM,GACP,CAAE,CACD,KAAM,iBACN,KAAM,GACP,CAAE,CACD,KAAM,aACN,KAAM,EACP,CAAE,CACD,KAAM,MACN,KAAM,EACP,CAAE,CACD,KAAM,SACN,KAAM,EACP,CACA,CAAC,CACF,EAAM,eAAe,CAAC,CACpB,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAM3B,GALK,GACH,GAAiB,EAAE,CAIjB,GAAO,EAAE,CAAG,GACd,MAAU,UAAU,uFAA8F,EAAI,wDAA6D,CAErL,OAAO,IAAI,EAAU,EAAE,EAE1B,CAAE,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAe,EAAE,CAEZ,IAAI,EAAQ,EAAG,EAAE,EAE3B,CAAE,CACD,KAAM,YACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAe,EAAE,CAEZ,IAAI,EAAQ,EAAE,UAAU,CAAE,EAAE,EAEtC,CAAE,CACD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,GAAI,UACF,MAAU,UAAU,gGAAuG,EAAI,IAAI,CAErI,OAAO,OAAO,EAAE,EAEnB,CAAE,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAiB,EAAE,CAEd,IAAI,EAAU,EAAE,UAAU,CAAC,EAErC,CAAE,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAgB,EAAE,CAEb,IAAI,EAAS,EAAE,EAEzB,CAAE,CACD,KAAM,WACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAC3B,MAAU,UAAU,4JAAiK,EAExL,CAAE,CACD,KAAM,WACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAe,EAAE,CAEZ,IAAI,EAAQ,EAAE,SAAS,CAAE,EAAE,EAErC,CAAE,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAgB,EAAE,CAEpB,IAAI,EAAI,IAAI,EAAS,EAAE,CACvB,GAAI,EAAE,SAAS,GAAK,EAClB,MAAU,UAAU,mGAA0G,EAAI,sDAA2D,CAE/L,OAAO,GAEV,CAAE,CAQD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,IAAI,EAAI,OAAO,EAAE,CACjB,GAAI,MAAM,EAAE,CACV,MAAU,MAAM,mBAAqB,EAAI,gBAAgB,CAE3D,OAAO,GAEV,CAAE,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAiB,EAAE,CAErB,GAAI,CACF,OAAO,IAAI,EAAU,EAAE,MACX,CACZ,MAAU,MAAM,mBAAqB,EAAI,iBAAiB,GAG/D,CAAE,CACD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,GAAI,CACF,OAAO,OAAO,EAAE,MACJ,CACZ,MAAU,MAAM,mBAAqB,EAAI,cAAc,GAG5D,CAAE,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAgB,EAAE,CAEpB,GAAI,CACF,OAAO,IAAI,EAAS,EAAE,MACV,CACZ,MAAU,MAAM,mBAAqB,EAAI,gBAAgB,GAG9D,CAAE,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiB,EAAG,CACtB,GACH,GAAe,EAAE,CAEnB,GAAI,CACF,OAAO,IAAI,EAAQ,EAAE,MACT,CACZ,MAAU,MAAM,mBAAqB,EAAI,eAAe,GAG7D,CAAE,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,MAAO,CAAC,GAEX,CAAE,CACD,KAAM,UACN,GAAI,YACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAiB,EAAE,CAEd,IAAI,EAAU,CAAC,EAAE,EAE3B,CAAE,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,OAAO,OAAO,CAAC,EAAE,EAEpB,CAAE,CACD,KAAM,UACN,GAAI,WACJ,QAAS,SAAiB,EAAG,CAI3B,OAHK,GACH,GAAgB,EAAE,CAEb,IAAI,EAAS,CAAC,EAAE,EAE1B,CAAE,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,EAAG,CAC3B,OAAO,OAAO,EAAE,EAEnB,CAAE,CACD,KAAM,QACN,GAAI,SACJ,QAAS,SAAiB,EAAO,CAI/B,OAHK,GACH,IAAe,CAEV,IAAI,EAAY,EAAM,EAEhC,CAAE,CACD,KAAM,SACN,GAAI,QACJ,QAAS,SAAiB,EAAQ,CAChC,OAAO,EAAO,SAAS,EAE1B,CAAC,CAAC,CAMH,EAAM,YAAc,EAAM,EAAM,IAAe,CAC7C,IAAI,EAAa,EAAM,YAAYG,EAAM,EAAM,EAAW,CAC1D,GAAI,CAAC,YAAa,WAAW,CAAC,SAAS,EAAW,KAAK,SAAS,EAAI,EAAK,SAAW,GAAK,EAAa,EAAK,GAAG,EAE9G,EAAW,KAAK,GAAO,CAAC,EAAI,OAAO,SAAS,IAAI,CAAC,CAAE,CACjD,IAAI,EAAU,UAAU,aAAoBA,qFAAuGA,OAAa,CAEhK,KADA,GAAI,KAAO,EAAW,KAChB,EAER,MAAM,GAOR,EAAM,YAAc,EAAM,EAAM,IAAe,CAC7C,IAAI,EAAa,EAAM,YAAYA,EAAM,EAAM,EAAW,CAC1D,GAAI,CAAC,YAAa,WAAW,CAAC,SAAS,EAAW,KAAK,SAAS,EAAI,EAAK,SAAW,GAAK,EAAa,EAAK,GAAG,EAE9G,EAAW,KAAK,GAAO,CAAC,EAAI,OAAO,SAAS,IAAI,CAAC,CAAE,CACjD,IAAI,EAAU,UAAU,aAAoBA,qFAAuGA,OAAa,CAEhK,KADA,GAAI,KAAO,EAAW,KAChB,EAER,MAAM,GAED,GACP,CACF,SAAS,GAAiB,EAAG,CAC3B,MAAU,MAAM,wBAA+B,oDAAuD,CAExG,SAAS,GAAe,EAAG,CACzB,MAAU,MAAM,wBAA+B,uDAA0D,CAE3G,SAAS,IAAgB,CACvB,MAAU,MAAM,sEAAwE,CAE1F,SAAS,GAAgB,EAAG,CAC1B,MAAU,MAAM,wBAA+B,mDAAsD,CClcvG,IAAW,GAAiC,EAFjC,YACQ,EAAE,KACyD,CAO5E,SAAS,EAAU,EAAS,CAC1B,GAAI,EAAE,gBAAgB,GACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,QAAU,GAAW,EAAE,CAkD9B,MA5CA,GAAU,UAAU,KAAO,YAC3B,EAAU,UAAU,YAAc,GAOlC,EAAU,UAAU,QAAU,UAAY,CACxC,OAAO,KAAK,SAQd,EAAU,UAAU,SAAW,UAAY,CACzC,MAAO,IAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,KAAK,CAAG,KASrD,EAAU,UAAU,OAAS,UAAY,CACvC,MAAO,CACL,OAAQ,YACR,QAAS,KAAK,QACf,EAUH,EAAU,SAAW,SAAU,EAAM,CACnC,OAAO,IAAI,EAAU,EAAK,QAAQ,EAE7B,GACN,CACD,QAAS,GACV,CAAC,CCzDF,SAAS,GAAsB,EAAG,EAAM,EAAM,CAC5C,IAAI,EAAgB,EAAE,YAClB,EAAO,IAAI,EAAc,EAAE,CAC3B,EAAS,GACb,GAAI,EAAM,CACR,GAAI,EAAO,EACT,MAAU,MAAM,iCAAiC,CAEnD,GAAI,CAAC,EAAU,EAAK,CAClB,MAAU,MAAM,0BAA0B,CAE5C,GAAI,EAAE,YAAY,EAAK,IAAI,EAAO,EAAE,CAAC,IAAI,EAAE,CAAC,EAAI,EAAE,SAAS,EAAK,IAAI,EAAO,EAAE,CAAC,IAAI,GAAG,CAAC,CACpF,MAAU,MAAM,8BAAqC,EAAO,QAAkB,EAAO,OAAU,CAEjG,GAAI,CAAC,EAAE,WAAW,CAChB,MAAU,MAAM,2BAA2B,CAEzC,EAAE,SAAS,EAAE,GACf,EAAI,EAAE,IAAI,EAAK,IAAI,EAAK,CAAC,EAE3B,EAAS,IAAW,IAEtB,OAAQ,EAAR,CACE,IAAK,GACH,MAAO,GAAU,EAAE,UAAU,GAAS,IACxC,IAAK,GACH,MAAO,GAAU,EAAE,SAAS,GAAS,IACvC,IAAK,IACH,MAAO,GAAU,EAAE,eAAe,GAAS,IAC7C,QACE,MAAU,MAAM,QAAe,mBAAyB,EAqF9D,SAAgBG,GAAO,EAAO,EAAS,CACrC,GAAI,OAAO,GAAY,WAErB,OAAO,EAAQ,EAAM,CAIvB,GAAI,CAAC,EAAM,UAAU,CACnB,OAAO,EAAM,OAAO,CAAG,MAAQ,EAAM,GAAG,EAAE,CAAG,WAAa,YAE5D,GAAI,CACF,WACA,YACA,YACE,GAAuB,EAAQ,CAGnC,OAAQ,EAAR,CACE,IAAK,QACH,OAAO,GAAQ,EAAO,EAAU,CAClC,IAAK,cACH,OAAO,GAAc,EAAO,EAAU,CACxC,IAAK,cACH,OAAO,GAAc,EAAO,EAAU,CACxC,IAAK,MACH,OAAO,GAAsB,EAAO,EAAG,EAAS,CAClD,IAAK,MACH,OAAO,GAAsB,EAAO,EAAG,EAAS,CAClD,IAAK,MACH,OAAO,GAAsB,EAAO,GAAI,EAAS,CACnD,IAAK,OAID,IAAI,EAAW,GAAmB,GAA0D,SAAU,GAAG,CACrG,EAAW,GAAmB,GAA0D,SAAU,EAAE,CAGxG,GAAI,EAAM,QAAQ,CAAE,MAAO,IAG3B,IAAI,EACA,EAAU,EAAM,oBAAoB,EAAU,CAC9C,EAAM,EAAQ,EAUlB,MATA,CAKE,EALE,GAAO,GAAY,EAAM,EAErB,EAAQ,SAAS,CAGjB,GAAc,EAAO,EAAU,CAIhC,EAAI,QAAQ,sBAAuB,UAAY,CACpD,IAAIC,EAAS,UAAU,GACnBC,EAAI,UAAU,GAClB,OAAOD,IAAW,IAAmBC,EAAbD,EAASC,GACjC,CAEN,QACE,MAAU,MAAM,qBAAuB,EAAW,mEAAwE,EAShI,SAAgB,GAAc,EAAO,EAAW,CAE9C,IAAIA,EAAI,EAAM,EACV,EAASA,EAAI,GAAM,EAAIA,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAI,EAAIA,EAAIA,EAAI,EAI3D,EADkB,EAAM,IAAa,IAAI,CAAC,EAAQ,CACvB,YAAY,EAAU,CACrD,GAAI,EAAS,SAAS,IAAI,CAAE,CAC1B,IAAI,EAAY,EAAM,YACtB,EAAW,IAAI,EAAU,EAAS,CAAC,SAAS,CAE9C,OAAO,EAAW,KAAOA,GAAK,EAAI,IAAM,IAAM,EAAO,UAAU,CAWjE,SAAgB,GAAc,EAAO,EAAW,CAI5C,OAHE,IAAc,IAAA,GAGT,EAAM,eAAe,CAFrB,EAAM,cAAc,EAAY,EAAE,CAY7C,SAAgB,GAAQ,EAAO,EAAW,CACxC,OAAO,EAAM,QAAQ,EAAU,CAEjC,SAAS,GAAmB,EAAO,EAAc,CAM7C,OALE,EAAS,EAAM,CACV,EACE,EAAY,EAAM,CACpB,EAAM,UAAU,CAEhB,EC3LX,SAAgB,GAAO,EAAO,EAAS,CACrC,IAAI,EAAS,GAAQ,EAAO,EAAQ,CAIpC,OAHI,GAAW,OAAO,GAAY,UAAY,aAAc,GAAW,EAAO,OAAS,EAAQ,SACtF,EAAO,UAAU,EAAG,EAAQ,SAAW,EAAE,CAAG,MAE9C,EAET,SAAS,GAAQ,EAAO,EAAS,CAyC/B,OAxCI,OAAO,GAAU,SACZC,GAAa,EAAO,EAAQ,CAEjC,EAAY,EAAM,CACbC,GAAgB,EAAO,EAAQ,CAKpC,GAAkB,EAAM,CACtB,CAAC,GAAW,EAAQ,WAAa,UAE5B,GAAU,EAAM,EAAI,EAAM,KAAe,EAAM,IAG/C,EAAM,UAAU,CAGvB,MAAM,QAAQ,EAAM,CACf,GAAY,EAAO,EAAQ,CAEhC,EAAS,EAAM,CACV,GAAU,EAAM,CAErB,OAAO,GAAU,WACZ,EAAM,OAAS,OAAO,EAAM,OAAO,CAAG,WAE3C,GAAS,OAAO,GAAU,SACxB,OAAO,EAAM,QAAW,WACnB,EAAM,OAAO,EAAQ,CACnB,GAAS,EAAM,SAAS,EAAQ,GAAK,EAAE,CAAC,UAAU,CAEpD,EAAM,SAAS,EAAQ,CAKvB,IAHO,OAAO,KAAK,EAAM,CAAC,IAAI,GAC5B,GAAU,EAAI,CAAG,KAAO,GAAO,EAAM,GAAM,EAAQ,CAC1D,CACmB,KAAK,KAAK,CAAG,IAG/B,OAAO,EAAM,CAStB,SAAgB,GAAU,EAAO,CAI/B,IAHA,IAAI,EAAO,OAAO,EAAM,CACpB,EAAU,GACV,EAAI,EACD,EAAI,EAAK,QAAQ,CACtB,IAAI,EAAI,EAAK,OAAO,EAAE,CACtB,GAAW,KAAK,GAAoB,GAAkB,GAAK,EAC3D,IAEF,MAAO,IAAM,EAAU,IAEzB,IAAI,GAAoB,CACtB,IAAK,MACL,KAAM,OACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,IAAM,MACP,CAOD,SAAgB,EAAO,EAAO,CAC5B,IAAI,EAAO,OAAO,EAAM,CAExB,MADA,GAAO,EAAK,QAAQ,KAAM,QAAQ,CAAC,QAAQ,KAAM,SAAS,CAAC,QAAQ,KAAM,QAAQ,CAAC,QAAQ,KAAM,OAAO,CAAC,QAAQ,KAAM,OAAO,CACtH,EAaT,SAAS,GAAY,EAAO,EAAS,CACnC,GAAI,MAAM,QAAQ,EAAM,CAAE,CAGxB,IAAK,IAFD,EAAM,IACN,EAAM,EAAM,OACP,EAAI,EAAG,EAAI,EAAK,IACnB,IAAM,IACR,GAAO,MAET,GAAO,GAAY,EAAM,GAAI,EAAQ,CAGvC,MADA,IAAO,IACA,OAEP,OAAO,GAAO,EAAO,EAAQ,CASjC,SAAS,GAAkB,EAAO,CAChC,OAAO,GAAS,OAAO,GAAU,UAAY,OAAO,EAAM,GAAM,UAAY,OAAO,EAAM,GAAM,UAAY,OAAO,EAAM,GAAM,UAAY,GC/K5I,SAAS,GAAQ,EAAG,CAClB,0BAEA,MAAO,IAAwB,OAAO,QAArB,YAA2C,OAAO,OAAO,UAA1B,SAAqC,SAAU,EAAG,CAChG,OAAO,OAAOC,GACZ,SAAU,EAAG,CACf,OAAOA,GAAmB,OAAO,QAArB,YAA+BA,EAAE,cAAgB,QAAUA,IAAM,OAAO,UAAY,SAAW,OAAOA,GACjH,GAAQ,EAAE,CCNf,SAAS,GAAY,EAAG,EAAG,CACzB,GAAgB,GAAQ,EAAE,EAAtB,UAA0B,CAAC,EAAG,OAAO,EACzC,IAAIC,EAAI,EAAE,OAAO,aACjB,GAAeA,IAAX,IAAK,GAAS,CAChB,IAAI,EAAIA,EAAE,KAAK,EAAG,GAAK,UAAU,CACjC,GAAgB,GAAQ,EAAE,EAAtB,SAAwB,OAAO,EACnC,MAAU,UAAU,+CAA+C,CAErE,OAAqB,IAAb,SAAiB,OAAS,QAAQ,EAAE,CCP9C,SAAS,GAAc,EAAG,CACxB,IAAI,EAAI,GAAY,EAAG,SAAS,CAChC,OAAmB,GAAQ,EAAE,EAAtB,SAAyB,EAAI,EAAI,GCH1C,SAAS,EAAgB,EAAG,EAAG,EAAG,CAChC,OAAQ,EAAI,GAAc,EAAE,IAAKC,EAAI,OAAO,eAAeA,EAAG,EAAG,CAC/D,MAAO,EACP,WAAY,CAAC,EACb,aAAc,CAAC,EACf,SAAU,CAAC,EACZ,CAAC,CAAG,EAAE,GAAK,EAAGA,ECajB,IAAW,GAAa,CAAC,CAEvB,eAAgB,EAAE,CAClB,uBAAwB,EAAE,CAC3B,CAAE,CAED,gBAAiB,CACf,gBAAiB,GACjB,iBAAkB,GAClB,YAAa,GAGd,CACF,CAAE,CAED,kBAAmB,CACjB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,qBAAsB,CACpB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,sBAAuB,CACrB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,qBAAsB,CACpB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,uBAAwB,CACtB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,uBAAwB,CACtB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,wBAAyB,CACvB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,eAAgB,CACd,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,+BAAgC,CAC9B,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,6BAA8B,CAC5B,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,kBAAmB,CACjB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,UAAW,EAAE,CACd,CAAE,CAED,mBAAoB,CAClB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAC,mBAAoB,wBAAwB,CAC/D,CACD,wBAAyB,CACvB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,wBAAyB,CACvB,GAAI,IACJ,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,qBAAqB,CAChH,CACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,OACf,gBAAiB,EAAE,CACnB,gBAAiB,GACjB,iBAAkB,GAClB,YAAa,GAId,CACD,2BAA4B,CAC1B,GAAI,KACJ,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,2BAA4B,wBAAwB,CACvH,CACD,yBAA0B,CACxB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACD,mBAAoB,CAClB,GAAI,MACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,wBAAyB,CACvB,cAAe,OACf,gBAAiB,CAAC,wBAAyB,sBAAuB,uBAAwB,qBAAqB,CAChH,CACF,CAAE,CAED,yBAA0B,CACxB,GAAI,IACJ,cAAe,QAChB,CACD,0BAA2B,CACzB,GAAI,IACJ,cAAe,QAChB,CACD,sBAAuB,CACrB,GAAI,IACJ,cAAe,QAChB,CACD,mBAAoB,CAClB,GAAI,MACJ,cAAe,QAChB,CACF,CAAE,CAED,mBAAoB,CAClB,GAAI,IACJ,cAAe,QACf,gBAAiB,EAAE,CACnB,iBAAkB,GAInB,CACD,sBAAuB,CACrB,GAAI,KACJ,cAAe,QACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,uBAAwB,CACtB,GAAI,KACJ,cAAe,OACf,gBAAiB,EAAE,CACpB,CACF,CAAE,CAED,yBAA0B,CACxB,GAAI,IACJ,cAAe,OAChB,CACF,CAAE,CAED,0BAA2B,CACzB,GAAI,IACJ,cAAe,OAChB,CACF,CAAC,CASF,SAAS,GAAY,EAAO,EAAa,CACvC,GAAI,CAAC,GAAe,IAAgB,OAAQ,OAAO,EAEnD,IADA,IAAI,EAAO,EACJ,GAAkB,EAAK,EAAE,EAAO,EAAK,QAC5C,OAAO,EAcT,SAAgB,EAAc,EAAO,EAAa,EAAU,EAAQ,CAClE,IAAI,EAAO,EACP,IAAgB,SAElB,EAAO,EAAM,YAAY,EAI3B,IAAK,IAFD,EAAa,EAAK,eAAe,CACjC,EAAa,KACR,EAAI,EAAG,EAAI,GAAW,OAAQ,IACrC,GAAI,KAAc,GAAW,GAAI,CAC/B,EAAa,EACb,MAKJ,GAAI,IAAe,yBAA2B,EAAK,UAAY,IAAa,OAAQ,CAClF,IAAI,EAAU,GAAY,EAAK,KAAK,GAAI,EAAY,CAChD,EAAE,EAAe,EAAQ,EAAI,GAAU,EAAO,eAAe,GAAK,uBAAyB,GAAU,GAAY,EAAO,KAAK,GAAI,EAAY,CAAC,GAAK,EAAE,EAAQ,eAAe,GAAK,uBAAyB,GAAU,GAAY,EAAQ,KAAK,GAAI,EAAY,CAAC,EAAI,EAAe,GAAY,EAAQ,KAAK,GAAG,CAAC,IAChT,GAAc,GAGlB,OAAO,EAaT,SAAgB,GAAiB,EAAO,EAAa,CACnD,IAAI,EAAO,EACP,IAAgB,SAElB,EAAO,EAAM,YAAY,EAE3B,IAAI,EAAa,EAAK,eAAe,CACjC,EAAQ,EAAc,EAAM,EAAY,CAC5C,GAAI,IAAU,KAEZ,OAAO,KAET,IAAI,EAAW,GAAW,GAAO,GACjC,GAAI,EAAe,EAAU,gBAAgB,CAAE,CAC7C,GAAI,EAAS,gBAAkB,OAC7B,MAAO,OAET,GAAI,EAAS,gBAAkB,QAC7B,MAAO,QAGT,MAAM,MAAM,IAAO,EAAa,oCAAwC,EAAS,cAAgB,KAAM,CAIzG,OAAO,KAYT,SAAgB,GAAkB,EAAO,EAAO,EAAa,CAE3D,IAAI,EAAI,IAAgB,OAA8B,EAArB,EAAM,YAAY,CAC/C,EAAI,IAAgB,OAA8B,EAArB,EAAM,YAAY,CAC/C,EAAc,EAAE,eAAe,CAC/B,EAAc,EAAE,eAAe,CAC/B,EAAQ,EAAc,EAAG,EAAY,CACzC,GAAI,IAAU,KAEZ,OAAO,KAET,IAAI,EAAW,GAAW,GAAO,GACjC,GAAI,EAAe,EAAU,kBAAkB,EAAI,EAAS,2BAA2B,MAAO,CAC5F,IAAK,IAAI,EAAI,EAAG,EAAI,EAAS,gBAAgB,OAAQ,IACnD,GAAI,EAAS,gBAAgB,KAAO,EAClC,MAAO,GAGX,MAAO,GAIT,OAAO,KCjWT,SAAgB,GAAW,EAAO,EAAK,EAAK,CAC1C,GAAI,EAAE,gBAAgB,IACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,MAAQ,EACT,UAAU,OAAS,GACrB,KAAK,IAAM,EACX,KAAK,IAAM,IAEX,KAAK,IAAM,EACX,KAAK,IAAM,GAET,KAAK,MAAQ,IAAA,IAAa,KAAK,MAAQ,KAAK,IAC9C,KAAK,QAAU,uBAAyB,KAAK,MAAQ,MAAQ,KAAK,IAAM,IAC/D,KAAK,MAAQ,IAAA,IAAa,KAAK,OAAS,KAAK,IACtD,KAAK,QAAU,uBAAyB,KAAK,MAAQ,OAAS,KAAK,IAAM,GAAK,IAE9E,KAAK,QAAU,uBAAyB,KAAK,MAAQ,IAEvD,KAAK,MAAY,OAAO,CAAC,MAE3B,GAAW,UAAgB,YAAY,CACvC,GAAW,UAAU,YAAc,WACnC,GAAW,UAAU,KAAO,aAC5B,GAAW,UAAU,aAAe,GCzBpC,SAAgB,GAAe,EAAQ,EAAU,EAAU,CACzD,GAAI,EAAE,gBAAgB,IACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,OAAS,EACd,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,QAAU,wBAA0B,MAAM,QAAQ,EAAO,CAAG,IAAM,EAAO,KAAK,KAAK,CAAG,IAAM,GAAU,KAAO,KAAK,UAAY,MAAQ,KAAO,MAAM,QAAQ,EAAS,CAAG,IAAM,EAAS,KAAK,KAAK,CAAG,IAAM,GAAY,IAC1N,KAAK,MAAY,OAAO,CAAC,MAE3B,GAAe,UAAgB,YAAY,CAC3C,GAAe,UAAU,YAAc,WACvC,GAAe,UAAU,KAAO,iBAChC,GAAe,UAAU,iBAAmB,GCP5C,SAAgB,GAAU,EAAG,CAE3B,IADA,IAAI,EAAI,EAAE,CACH,MAAM,QAAQ,EAAE,EACrB,EAAE,KAAK,EAAE,OAAO,CAChB,EAAI,EAAE,GAER,OAAO,EAmdT,SAAgB,GAAI,EAAO,EAAU,CACnC,OAAO,MAAM,UAAU,IAAI,KAAK,EAAO,EAAS,CAQlD,SAAgB,GAAQ,EAAO,EAAU,CACvC,MAAM,UAAU,QAAQ,KAAK,EAAO,EAAS,CAkC/C,SAAgB,GAAK,EAAO,EAAW,CACrC,OAAO,MAAM,UAAU,KAAK,KAAK,EAAO,EAAU,CAsTpD,SAAgBC,GAAQ,EAAO,EAAU,CACvC,IAAI,EAAY,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,GACpF,GAAI,EAAM,SAAW,EACnB,MAAO,EAAE,CAEX,GAAI,EACF,OAAO,EAAa,EAAM,CAE5B,IAAI,EAAQ,EAAE,CACd,OAAO,EAAsB,EAAO,EAAE,CACtC,SAAS,EAAsB,EAAO,EAAO,CAC3C,GAAI,MAAM,QAAQ,EAAM,CAAE,CAGxB,IAAK,IAFD,EAAI,EAAM,OACV,EAAS,MAAM,EAAE,CACZ,EAAI,EAAG,EAAI,EAAG,IACrB,EAAM,GAAS,EACf,EAAO,GAAK,EAAsB,EAAM,GAAI,EAAQ,EAAE,CAExD,OAAO,OAEP,OAAO,EAAS,EAAO,EAAM,MAAM,EAAG,EAAM,CAAE,EAAM,CAGxD,SAAS,EAAa,EAAO,CAC3B,GAAI,MAAM,QAAQ,EAAM,CAAE,CAGxB,IAAK,IAFD,EAAI,EAAM,OACV,EAAS,MAAM,EAAE,CACZ,EAAI,EAAG,EAAI,EAAG,IACrB,EAAO,GAAK,EAAa,EAAM,GAAG,CAEpC,OAAO,OAEP,OAAO,EAAS,EAAM,EC5zB5B,SAAgB,GAAQ,EAAO,EAAU,EAAW,CAClD,GAAI,CAAC,EAID,OAHE,EAAS,EAAM,CACV,EAAM,IAAI,GAAK,EAAS,EAAE,CAAE,GAAO,GAAK,CAExCC,GAAa,EAAO,EAAU,GAAK,CAG9C,IAAI,EAAoB,GAAK,IAAM,EAAI,EAAI,EAAS,EAAE,CAIpD,OAHE,EAAS,EAAM,CACV,EAAM,IAAI,GAAK,EAAkB,EAAE,CAAE,GAAO,GAAK,CAEjDA,GAAa,EAAO,EAAmB,GAAK,CCxDvD,SAAgB,GAAS,EAAO,CAC9B,IAAI,EAAO,EACP,EAAO,EACP,EAAQ,OAAO,OAAO,KAAK,CAC3BC,EAAM,OAAO,OAAO,KAAK,CACzB,EAAQ,EACR,EAAM,SAAa,EAAI,CACzB,IAAI,EAAWA,EAAI,GACd,OACL,OAAO,EAAM,GACb,OAAOA,EAAI,GACX,EAAE,EACE,IAAS,GACb,IAAI,CAAC,EAAM,CACT,EAAQ,EACR,EAAO,EACP,OAEF,KAAO,CAAC,OAAO,UAAU,eAAe,KAAK,EAAO,EAAE,EAAK,MAG7D,MADA,GAAQ,KAAK,IAAI,EAAM,CAChB,CACL,IAAK,SAAa,EAAI,CACpB,IAAI,EAAWA,EAAI,GACf,EAAU,EAAE,EAGhB,GAFA,EAAM,GAAW,EACjB,EAAI,GAAM,EACN,CAAC,EAKH,MAJA,EAAE,EACE,GAAQ,EAAO,QACnB,EAAK,EAAM,GACX,EAAI,EAAG,CACA,GAET,UAAO,EAAM,GACT,IAAS,EACb,KAAO,CAAC,OAAO,UAAU,eAAe,KAAK,EAAO,EAAE,EAAK,KAG7D,OAAQ,EACR,MAAO,UAAiB,CACtB,EAAO,EAAQ,EACf,EAAO,EACP,EAAQ,OAAO,OAAO,KAAK,CAC3B,EAAM,OAAO,OAAO,KAAK,EAE5B,CC9BH,SAAgB,GAAQ,EAAI,CAC1B,GAAI,CACF,OAAA,EACA,SACE,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAAE,CAG1E,MAFA,KAAwB,IACxB,IAA0B,KAAK,UACxB,SAASG,GAAU,CACpB,OAAOA,EAAQ,OAAU,WAC3B,EAAQ,MAAQ,CACd,OAAQ,IAAI,IACZ,IAAK,GAAS,GAAS,IAAyB,CACjD,EAGE,IADD,MAEQ,WAER,EAAOD,EAAO,EAAK,CACvB,GAAIC,EAAQ,MAAM,OAAO,IAAI,EAAK,CAEhC,OADA,EAAQ,MAAM,IAAI,IAAI,EAAK,CACpBA,EAAQ,MAAM,OAAO,IAAI,EAAK,CAEvC,IAAI,EAAS,EAAG,MAAM,EAAI,EAAK,CAG/B,OAFA,EAAQ,MAAM,OAAO,IAAI,EAAM,EAAO,CACtC,EAAQ,MAAM,OAAO,OAAOA,EAAQ,MAAM,IAAI,IAAI,EAAK,CAAC,CACjD,GCtCX,IAAW,GAAmB,GAAQ,SAAU,EAAW,CACzD,OAAO,IAAI,EAAU,EAAE,CAAC,KAAK,EAC5B,CACD,UACD,CAAC,CAO8B,GAAQ,SAAU,EAAW,CAC3D,OAAO,IAAI,EAAU,EAAE,CAAC,KAAK,IAAI,EAAU,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAC3D,CACD,UACD,CAAC,CAOF,IAAW,GAAoB,GAAQ,SAAU,EAAW,CAC1D,OAAO,EAAU,KAAK,GAAG,EACxB,CACD,UACD,CAAC,CAO8B,GAAQ,SAAU,EAAW,CAC3D,OAAO,GAAkB,EAAU,CAAC,MAAM,EAAE,EAC3C,CACD,UACD,CAAC,CAUF,SAAS,GAAO,EAAM,CACpB,OAAO,EAAK,GAAG,UClCjB,IAAW,GAA0B,GAAgB,KAAM,CAAC,SAAU,aAAa,CAAE,GAAS,CAC5F,GAAI,CACF,SACA,aACE,EACJ,OAAO,EAAO,SAAW,YAAc,GAAkB,EAAU,CAAG,IACtE,CAQS,GAAyB,GAAgB,IAAK,CAAC,SAAU,aAAa,CAAE,GAAS,CAC1F,GAAI,CACF,SACA,aACE,EACJ,OAAO,EAAO,SAAW,YAAc,GAAiB,EAAU,CAAG,IACrE,CA8EF,SAAS,GAAgB,EAAM,EAAc,EAAQ,CACnD,OAAO,EAAQC,EAAMC,EAAcC,EAAQ,CACzC,uBAAwB,GACzB,CAAC,CCxHJ,IAAIC,GAAO,SACPC,GAAe,CAAC,QAAQ,CAO5B,SAAS,GAAyB,EAAO,CACvC,IAAI,EAA2B,EAAM,MAAM,yCAAyC,CAgBlF,OAfE,EAQK,CACL,QACA,MATU,CACV,KAAM,EACN,KAAM,EACN,KAAM,GACP,CAAC,EAAyB,IAMzB,YALgB,EAAyB,GAMzC,eALmB,EAAyB,GAM7C,CAEM,KASX,SAAS,GAA8B,EAAO,CAG5C,IAAK,IAFD,EAAI,SAAS,EAAM,YAAa,EAAM,MAAM,CAC5C,EAAI,EACC,EAAI,EAAG,EAAI,EAAM,eAAe,OAAQ,IAAK,CACpD,IAAI,EAAa,SAAS,EAAM,eAAe,GAAI,EAAM,MAAM,CAC/D,GAAK,EAAsB,EAAM,SAAO,EAAI,GAE9C,IAAI,EAAS,EAAI,EACjB,GAAI,MAAM,EAAO,CACf,MAAU,YAAY,WAAa,EAAM,MAAQ,0BAA0B,CAE7E,OAAO,EAET,IAAW,GAA8B,EAAQD,GAAMC,GAAc,GAAQ,CAC3E,GAAI,CACF,SACE,EA0BA,EAAS,EAAM,SAAU,CAC3B,GAAI,UAAa,CACf,MAAO,IAET,OAAQ,SAAgB,EAAG,CACzB,OAAO,GAET,OAAQ,SAAgB,EAAG,CACzB,GAAI,IAAM,MAAO,MAAO,KACxB,IAAI,EAAwB,GAAyB,EAAE,CACvD,GAAI,EACF,OAAO,GAA8B,EAAsB,CAE7D,IAAI,EAAO,EACP,EAAsB,EAAE,MAAM,gCAAgC,CAC9D,IAGF,EAAO,OAAO,EAAoB,GAAG,CACrC,EAAI,EAAoB,IAE1B,IAAI,EAAM,OAAO,EAAE,CACnB,GAAI,MAAM,EAAI,CACZ,MAAU,YAAY,WAAa,EAAI,0BAA0B,CAEnE,GAAI,EAAqB,CAGvB,GAAI,EAAM,GAAK,EAAO,EAEpB,MAAU,YAAY,WAAmB,qBAAyB,CAGhE,GAAO,IAAM,EAAO,KACtB,GAAY,GAAK,GAGrB,OAAO,GAET,UAAW,SAAmB,EAAG,CAC/B,OAAO,EAAE,UAAU,EAErB,OAAQ,SAAgB,EAAG,CACzB,OAAO,OAAO,EAAE,EAElB,SAAU,SAAkB,EAAG,CAC7B,OAAO,EAAE,SAAS,EAEpB,KAAM,EAAM,YAAY,GAAQ,GAAK,CACnC,IAAIE,EAAQ,EAAE,OAAO,CAErB,MADA,GAAM,MAAQC,EAAK,EAAE,MAAM,CACpBD,GACP,CACF,KAAM,SAAe,EAAG,CACtB,MAAO,IAET,sBAAuB,SAA2B,EAAM,EAAe,CACrE,OAAO,EAAK,SAAS,EAAc,EAErC,iBAAkB,EAAM,YAAY,GAAQ,GAAK,GAAQ,EAAGC,EAAK,CAAC,CACnE,CAAC,CAUF,MAHA,GAAO,SAAW,SAAU,EAAM,CAChC,OAAO,WAAW,EAAK,MAAM,EAExB,GACP,CCpJS,GAAW,IAAI,IAAI,CAAC,MAAM,CAAC,CCM3B,GAA4B,EAF5B,OACQ,CAAC,oBAAoB,CAC2B,GAAQ,CACzE,GAAI,CACF,qBACE,EAMJ,SAAS,EAAe,EAAO,CAC7B,IAAK,IAAI,IAAU,CAAC,GAAG,GAAS,CAC9B,GAAI,EAAM,IAAI,EAAO,CACnB,MAAU,MAAM,sCAAwC,EAAS,0BAA0B,CAIjG,MAAM,CAAK,CACT,IAAI,MAAO,CACT,MAAO,OAET,IAAI,QAAS,CACX,MAAO,GAQT,SAAS,EAAO,CACd,OAAO,KAAK,SAAS,CAAC,SAAS,EAAM,CAWvC,SAAU,CACR,IAAI,EAAO,KAAK,SAAS,EAAmB,EAAE,CAAC,CAC3C,EAAO,EAAE,CACT,EAAU,KACd,SAAS,EAAS,EAAO,CACvB,IAAI,EAAI,GAAU,EAAM,CAExB,OADA,EAAe,EAAE,CACV,EAAK,EAAG,EAAM,EAAQ,CAE/B,MAAO,CACL,WACD,CAgBH,SAAS,EAAM,EAAU,CACvB,MAAU,MAAM,+CAAiD,KAAK,KAAK,CAO7E,QAAQ,EAAU,CAEhB,MAAU,MAAM,yCAAyC,CAS3D,IAAI,EAAU,CAEZ,MAAU,MAAM,qCAAqC,CASvD,QAAQ,EAAM,CACZ,GAAI,CAAC,EAAO,EAAK,CACf,MAAU,UAAU,uCAAuC,CAE7D,OAAO,EAST,SAAS,EAAU,CAGjB,EAAS,KAAM,KAAM,KAAK,CAG1B,SAAS,EAAU,EAAM,EAAU,CACjC,EAAK,QAAQ,SAAU,EAAO,EAAM,EAAQ,CAC1C,EAAS,EAAO,EAAM,EAAO,CAC7B,EAAU,EAAOG,EAAS,EAC1B,CAEJ,EAAU,KAAM,EAAS,CAyB3B,UAAU,EAAU,CAClB,SAAS,EAAW,EAAO,EAAM,EAAQ,CACvC,IAAI,EAAc,EAAS,EAAO,EAAM,EAAO,CAK/C,OAJI,IAAgB,EAIb,EAAM,IAAI,EAAW,CAFnB,EAIX,OAAO,EAAW,KAAM,KAAM,KAAK,CAkBrC,OAAO,EAAU,CACf,IAAI,EAAQ,EAAE,CAMd,OALA,KAAK,SAAS,SAAU,EAAM,EAAM,EAAQ,CACtC,EAAS,EAAM,EAAM,EAAO,EAC9B,EAAM,KAAK,EAAK,EAElB,CACK,EAOT,OAAQ,CAEN,MAAU,MAAM,gCAAgC,CAOlD,WAAY,CACV,OAAO,KAAK,IAAI,SAAU,EAAM,CAC9B,OAAO,EAAK,WAAW,EACvB,CASJ,OAAO,EAAO,CACZ,OAAO,EAAQ,KAAK,OAAS,EAAM,MAAQ,GAAgB,KAAM,EAAM,CAAG,GAkB5E,SAAS,EAAS,CAChB,IAAI,EAAe,KAAK,iBAAiB,EAAQ,CAIjD,OAHW,IAAiB,OAGrB,KAAK,UAAU,EAAQ,CAFrB,EAWX,WAAY,CAEV,MAAU,MAAM,iCAAmC,KAAK,KAAK,CAS/D,QAAS,CACP,MAAU,MAAM,sDAAwD,KAAK,KAAK,CAkBpF,OAAO,EAAS,CACd,IAAI,EAAe,KAAK,iBAAiB,EAAQ,CAIjD,OAHW,IAAiB,OAGrB,KAAK,QAAQ,EAAQ,CAFnB,EAWX,SAAU,CAER,MAAU,MAAM,+BAAiC,KAAK,KAAK,CAkB7D,MAAM,EAAS,CACb,IAAI,EAAe,KAAK,iBAAiB,EAAQ,CAIjD,OAHW,IAAiB,OAGrB,KAAK,OAAO,EAAQ,CAFlB,EAYX,OAAO,EAAS,CAEd,MAAU,MAAM,8BAAgC,KAAK,KAAK,CAM5D,iBAAiB,EAAS,CACxB,GAAI,GAAW,OAAO,GAAY,SAChC,OAAQ,OAAO,EAAQ,QAAvB,CACE,IAAK,SACL,IAAK,YACH,OACF,IAAK,WACH,OAAO,EAAQ,QAAQ,KAAM,EAAQ,CACvC,QACE,MAAU,UAAU,0CAA0C,EAStE,eAAgB,CACd,OAAO,KAAK,KAOd,YAAa,CACX,OAAO,MAGX,OAAO,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC5WF,SAAgB,GAAe,EAAK,CAIlC,OAHI,GAAO,EAAI,aACN,IAAI,GAAW,EAAI,MAAQ,EAAG,EAAI,IAAM,EAAG,EAAI,MAAQ,IAAA,GAA0B,IAAA,GAAd,EAAI,IAAM,EAAc,CAE7F,ECTT,SAAgB,GAAc,EAAM,CAClC,GAAI,CACF,UACE,EAYJ,OAAO,SAAgB,EAAQ,EAAO,CACpC,GAAI,CACF,GAAI,MAAM,QAAQ,EAAO,CACvB,OAAO,EAAO,EAAQ,EAAM,IACnB,GAAU,OAAO,EAAO,QAAW,WAE5C,OAAO,EAAO,OAAO,EAAM,IAClB,OAAO,GAAW,SAE3B,OAAO,EAAO,EAAQ,EAAM,IACnB,OAAO,GAAW,SAAU,CACrC,GAAI,CAAC,EAAM,kBAAkB,CAC3B,MAAU,UAAU,kDAAkD,CAExE,OAAO,EAAgB,EAAQ,EAAM,mBAAmB,CAAC,MAEzD,MAAU,UAAU,iDAAiD,OAEhE,EAAK,CACZ,MAAM,GAAe,EAAI,GC/B/B,IAAIC,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,SAAU,OAAO,CACsC,GAAQ,CACjF,GAAI,CACF,SACA,QACE,EACA,EAAS,GAAc,CACzB,SACD,CAAC,CAMF,SAAS,EAAgB,EAAM,CAE7B,MAAO,EAAE,EAAe,EAAK,EAAI,GAAY,EAAK,EAAI,EAAe,EAAK,EAAI,GAAe,EAAK,EAAI,GAAa,EAAK,EAAI,GAAkB,EAAK,EAAI,EAAa,EAAK,EAE3K,MAAM,UAAqB,CAAK,CAc9B,YAAY,EAAQ,EAAO,CACzB,IAAI,EAAmB,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,GAE3F,GADA,OAAO,CACH,CAAC,EAAO,EAAO,CACjB,MAAU,UAAU,uCAAuC,CAE7D,GAAI,CAAC,EAAY,EAAM,CACrB,MAAU,UAAU,2CAA2C,CAEjE,KAAK,OAAS,EACd,KAAK,MAAQ,EACb,KAAK,iBAAmB,EAI1B,IAAI,MAAO,CAIP,OAHE,KAAK,MACA,KAAK,MAAM,kBAAkB,CAAG,KAAK,MAAM,mBAAmB,CAAG,GAEjE,KAAK,OAAO,MAAQ,GAG/B,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAa,KAAK,OAAO,SAAS,EAAM,EAAS,CACjD,EAAY,KAAK,MAAM,SAAS,EAAM,EAAS,CAC/C,EAAmB,KAAK,iBACxB,EAAuB,EAAe,KAAK,OAAO,EAAI,KAAK,OAAO,iBACtE,GAAI,KAAK,MAAM,kBAAkB,CAAE,CACjC,IAAI,EAAO,KAAK,MAAM,mBAAmB,CACzC,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAI,EAAM,GAAW,EAAE,CACnB,EAAS,EAAW,EAAO,EAAM,EAAI,CACzC,GAAI,GAAoB,GAAU,KAAM,CACtC,EAAI,qBAAuB,GAC3B,OAEE,QAAwB,GAAQ,MAA0B,EAAI,sBAKlE,OAAO,EAAgB,EAAQ,EAAK,OAGtC,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAI,EAAM,GAAW,EAAE,CACnB,EAAS,EAAW,EAAO,EAAM,EAAI,CACzC,GAAI,GAAoB,GAAU,KAAM,CACtC,EAAI,qBAAuB,GAC3B,OAEE,QAAwB,GAAQ,MAA0B,EAAI,sBAMlE,OAAO,EAAO,EADF,EAAU,EAAO,EAAM,EAAO,CACd,EASlC,QAAQ,EAAU,CAChB,EAAS,KAAK,OAAQ,SAAU,KAAK,CACrC,EAAS,KAAK,MAAO,QAAS,KAAK,CASrC,IAAI,EAAU,CACZ,OAAO,IAAI,EAAa,KAAK,QAAQ,EAAS,KAAK,OAAQ,SAAU,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CAAE,KAAK,iBAAiB,CAOxJ,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,OAAQ,KAAK,MAAO,KAAK,iBAAiB,CAQzE,UAAU,EAAS,CACjB,IAAI,EAAS,KAAK,OAAO,SAAS,EAAQ,CACtC,EAAgB,KAAK,OAAO,GAC9B,EAAS,IAAM,EAAS,KAE1B,IAAI,EAAmB,KAAK,iBAAmB,KAAK,MAAM,YAAc,IAAM,KAAO,GACrF,OAAO,EAAS,EAAmB,KAAK,MAAM,SAAS,EAAQ,CAQjE,QAAQ,EAAS,CACf,IAAI,EAAS,KAAK,OAAO,OAAO,EAAQ,CAIxC,OAHI,EAAgB,KAAK,OAAO,GAC9B,EAAS,iEAAmE,EAAS,kEAEhF,EAAS,KAAK,MAAM,OAAO,EAAQ,CAQ5C,OAAO,EAAS,CACd,IAAI,EAAS,KAAK,OAAO,MAAM,EAAQ,CAIvC,OAHI,EAAgB,KAAK,OAAO,GAC9B,EAAS,iCAEJ,EAAS,KAAK,MAAM,MAAM,EAAQ,CAO3C,QAAS,CACP,MAAO,CACL,OAAQA,GACR,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,iBAAkB,KAAK,iBACxB,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAa,EAAK,OAAQ,EAAK,MAAO,EAAK,iBAAiB,EAI3E,OADA,EAAgB,EAAc,OAAQA,GAAK,CACpC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCrNEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,OAAO,CAC6C,GAAQ,CAC9E,GAAI,CACF,QACE,EACJ,MAAM,UAAkB,CAAK,CAO3B,YAAY,EAAO,CAKjB,GAJA,OAAO,CACP,KAAK,MAAQ,GAAS,EAAE,CAGpB,CAAC,MAAM,QAAQ,KAAK,MAAM,EAAI,CAAC,KAAK,MAAM,MAAM,EAAO,CACzD,MAAU,UAAU,kCAAkC,CAG1D,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAY,GAAI,KAAK,MAAO,SAAU,EAAM,CAC9C,OAAO,EAAK,SAAS,EAAM,EAAS,EACpC,CAEF,GADe,EAAK,OAAO,SAAW,QACxB,CACZ,IAAI,EAAS,EAAK,OAClB,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,EAAO,GAAI,EAAW,SAAU,EAAU,CAC/C,OAAO,EAAS,EAAO,EAAM,EAAQ,EACrC,CAAC,OAGL,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,GAAI,EAAW,SAAU,EAAU,CACxC,OAAO,EAAS,EAAO,EAAM,EAAQ,EACrC,EASR,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,IAAK,CAC1C,IAAI,EAAO,KAAK,MAAM,GACtB,EAAS,EAAM,SAAW,EAAI,IAAK,KAAK,EAU5C,IAAI,EAAU,CAEZ,IAAK,IADD,EAAQ,EAAE,CACL,EAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,IACrC,EAAM,GAAK,KAAK,QAAQ,EAAS,KAAK,MAAM,GAAI,SAAW,EAAI,IAAK,KAAK,CAAC,CAE5E,OAAO,IAAI,EAAU,EAAM,CAO7B,OAAQ,CACN,OAAO,IAAI,EAAU,KAAK,MAAM,MAAM,EAAE,CAAC,CAS3C,UAAU,EAAS,CAIjB,MAAO,IAHK,KAAK,MAAM,IAAI,SAAU,EAAM,CACzC,OAAO,EAAK,SAAS,EAAQ,EAC7B,CACiB,KAAK,KAAK,CAAG,IAOlC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,MAAO,KAAK,MACb,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,MAAM,CASlC,QAAQ,EAAS,CAIf,MAAO,kEAHK,KAAK,MAAM,IAAI,SAAU,EAAM,CACzC,OAAO,EAAK,OAAO,EAAQ,EAC3B,CAC+E,KAAK,wCAAwC,CAAG,kEAQnI,OAAO,EAAS,CACd,SAAS,EAAW,EAAO,EAAQ,CACjC,IAAI,EAAa,EAAM,KAAK,GAAY,EAAI,CAAC,EAAM,MAAM,GAAY,CACjE,EAAe,GAAU,EACzB,EAAU,EAAe,IAAM,OAC/B,EAAW,EAAM,IAAI,SAAU,EAAM,CAIrC,OAHE,EAAK,MACA,EAAW,EAAK,MAAO,CAAC,EAAO,CAE/B,EAAK,MAAM,EAAQ,EAE5B,CAAC,KAAK,EAAQ,CAChB,OAAO,GAAc,CAAC,GAAgB,GAAgB,CAAC,EAAS,mBAAqB,EAAW,iBAAmB,EAErH,OAAO,EAAW,KAAK,MAAO,GAAM,EAIxC,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC7KF,SAAgB,GAAc,EAAM,CAClC,GAAI,CACF,SACA,UACE,EAeJ,OAAO,SAAgB,EAAQ,EAAO,EAAO,CAC3C,GAAI,CACF,GAAI,MAAM,QAAQ,EAAO,CAOvB,OANa,EAAO,EAAO,CAAC,OAAO,EAAO,EAAM,CAAC,SAAS,CAGnD,SAAS,EAAM,IAAU,CAC9B,EAAOE,GAAS,GAChB,CACK,KACE,GAAU,OAAO,EAAO,QAAW,WAE5C,OAAO,EAAO,OAAO,EAAO,EAAM,IACzB,OAAO,GAAW,SAE3B,OAAO,EAAO,EAAQ,EAAO,EAAM,IAC1B,OAAO,GAAW,SAAU,CACrC,GAAI,CAAC,EAAM,kBAAkB,CAC3B,MAAM,UAAU,kDAAkD,CAGpE,OADA,EAAgB,EAAQ,EAAM,mBAAmB,CAAE,EAAM,CAClD,OAEP,MAAU,UAAU,iDAAiD,OAEhE,EAAK,CACZ,MAAM,GAAe,EAAI,GCxC/B,IAAIC,GAAO,iBAIA,GAAsC,EAAQA,GAHtC,CAAC,SAAU,UAE9B,OAAO,CACsE,GAAQ,CACnF,GAAI,CACF,SACA,SACA,QACE,EACA,EAAS,GAAc,CACzB,SACD,CAAC,CACE,EAAS,GAAc,CACzB,SACA,SACD,CAAC,CASF,SAAS,EAAgB,EAAM,EAAa,EAAU,CACpD,AACE,IAAc,OAEhB,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAiB,EAAc,EAAK,MAAO,EAAa,EAAS,CACrE,OAAO,IAAgB,OAAS,IAAmB,MAAQ,GAAkB,EAE/E,MAAM,UAAuB,CAAK,CAgChC,YAAY,EAAQ,EAAO,EAAO,CAOhC,GANA,OAAO,CACP,KAAK,OAAS,EACd,KAAK,MAAQ,EAAQ,EAAQ,KAC7B,KAAK,MAAQ,GAAS,EAGlB,CAAC,EAAa,EAAO,EAAI,CAAC,EAAe,EAAO,CAClD,MAAU,UAAU,kDAAkD,CAExE,GAAI,EAAa,EAAO,EAAI,EAAO,OAAS,MAC1C,MAAU,MAAM,gCAAgC,CAElD,GAAI,KAAK,OAAS,CAAC,EAAY,KAAK,MAAM,CAExC,MAAU,UAAU,gCAAgC,CAEtD,GAAI,CAAC,EAAO,KAAK,MAAM,CACrB,MAAU,UAAU,2BAA2B,CAOnD,IAAI,MAAO,CAIP,OAHE,KAAK,MACA,KAAK,MAAM,kBAAkB,CAAG,KAAK,MAAM,mBAAmB,CAAG,GAEjE,KAAK,OAAO,MAAQ,GAG/B,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,kBAAmB,CACrB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAa,KAAK,OAAO,SAAS,EAAM,EAAS,CACjD,EAAY,KAAK,MAAQ,KAAK,MAAM,SAAS,EAAM,EAAS,CAAG,KAC/D,EAAY,KAAK,MAAM,SAAS,EAAM,EAAS,CAC/CA,EAAO,KAAK,OAAO,KACvB,GAAK,KAAK,SAUC,KAAK,MAAM,kBAAkB,CAAE,CAExC,IAAI,EAAO,KAAK,MAAM,mBAAmB,CACzC,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAS,EAAW,EAAO,EAAM,EAAQ,CACzC,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAgB,EAAQ,EAAM,EAAM,CAC7B,WAEA,EAAa,KAAK,OAAO,CAElC,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAc,EAAW,EAAO,EAAM,EAAQ,CAC9C,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAEvC,EAAQ,EAAU,EAAO,EAAM,EAAY,CAE/C,OADA,EAAM,IAAIA,EAAM,EAAO,EAAa,EAAO,EAAM,CAAC,CAC3C,OAEJ,CAQL,IAAI,EAAmB,KAAK,OAAO,OAAO,SAAS,EAAM,EAAS,CAClE,GAAI,KAAK,OAAO,MAAM,kBAAkB,CAAE,CACxC,IAAI,EAAa,KAAK,OAAO,MAAM,mBAAmB,CACtD,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAS,EAAiB,EAAO,EAAM,EAAQ,CAC/C,EAAc,EAAgB,EAAQ,EAAW,CAEjD,EAAQ,EAAU,EAAO,EAAM,EAAY,CAC3C,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAgB,EAAQ,EAAY,EAAO,EAAa,EAAO,EAAM,CAAC,CAC/D,OAEJ,CAGL,IAAI,EAAkB,KAAK,OAAO,MAAM,SAAS,EAAM,EAAS,CAChE,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAS,EAAiB,EAAO,EAAM,EAAQ,CAE/C,EAAc,EAAgB,EAAO,EAAM,EAAO,CAClD,EAAc,EAAO,EAAQ,EAAY,CAEzC,EAAQ,EAAU,EAAO,EAAM,EAAY,CAC3C,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAO,EAAQ,EAAa,EAAO,EAAa,EAAO,EAAM,CAAC,CACvD,QA9DI,CAEf,GAAI,CAAC,EAAa,KAAK,OAAO,CAC5B,MAAU,UAAU,gCAAgC,CAEtD,OAAO,SAA4B,EAAO,EAAM,EAAS,CACvD,IAAI,EAAQ,EAAU,EAAO,EAAM,EAAQ,CAE3C,OADA,EAAM,IAAIA,EAAM,EAAM,CACf,IAgEb,QAAQ,EAAU,CAChB,EAAS,KAAK,OAAQ,SAAU,KAAK,CACjC,KAAK,OACP,EAAS,KAAK,MAAO,QAAS,KAAK,CAErC,EAAS,KAAK,MAAO,QAAS,KAAK,CASrC,IAAI,EAAU,CAIZ,OAAO,IAAI,EAHE,KAAK,QAAQ,EAAS,KAAK,OAAQ,SAAU,KAAK,CAAC,CACpD,KAAK,MAAQ,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CAAG,KACjE,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CACd,CAOjD,OAAQ,CACN,OAAO,IAAI,EAAe,KAAK,OAAQ,KAAK,MAAO,KAAK,MAAM,CAQhE,UAAU,EAAS,CACjB,IAAI,EAAS,KAAK,OAAO,SAAS,EAAQ,CACtC,EAAQ,KAAK,MAAQ,KAAK,MAAM,SAAS,EAAQ,CAAG,GACpD,EAAQ,KAAK,MAAM,SAAS,EAAQ,CAIxC,OAHI,EAAgB,KAAM,GAAW,EAAQ,YAAa,GAAW,EAAQ,SAAS,GACpF,EAAQ,IAAM,EAAQ,KAEjB,EAAS,EAAQ,MAAQ,EAOlC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,OAAQ,KAAK,OACb,MAAO,KAAK,MACZ,MAAO,KAAK,MACb,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAe,EAAK,OAAQ,EAAK,MAAO,EAAK,MAAM,CAQhE,QAAQ,EAAS,CACf,IAAI,EAAS,KAAK,OAAO,OAAO,EAAQ,CACpC,EAAQ,KAAK,MAAQ,KAAK,MAAM,OAAO,EAAQ,CAAG,GAClD,EAAQ,KAAK,MAAM,OAAO,EAAQ,CAItC,OAHI,EAAgB,KAAM,GAAW,EAAQ,YAAa,GAAW,EAAQ,SAAS,GACpF,EAAQ,iEAAmE,EAAQ,kEAE9E,EAAS,EAAQ,uHAA8H,EAQxJ,OAAO,EAAS,CACd,IAAI,EAAS,KAAK,OAAO,MAAM,EAAQ,CACnC,EAAQ,KAAK,MAAQ,KAAK,MAAM,MAAM,EAAQ,CAAG,GACjD,EAAQ,KAAK,MAAM,MAAM,EAAQ,CAIrC,OAHI,EAAgB,KAAM,GAAW,EAAQ,YAAa,GAAW,EAAQ,SAAS,GACpF,EAAQ,UAAiB,aAEpB,EAAS,EAAQ,IAAM,GAIlC,OADA,EAAgB,EAAgB,OAAQA,GAAK,CACtC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC7SEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,YAAa,OAAO,CACgC,GAAQ,CAC9E,GAAI,CACF,YACA,QACE,EACJ,MAAM,UAAkB,CAAK,CAW3B,YAAY,EAAQ,CAGlB,GAFA,OAAO,CAEH,CAAC,MAAM,QAAQ,EAAO,CAAE,MAAU,MAAM,iBAAiB,CAC7D,KAAK,OAAS,EAAO,IAAI,SAAU,EAAO,CACxC,IAAI,EAAO,GAAS,EAAM,KACtB,EAAU,GAAS,EAAM,UAAY,IAAA,GAAY,EAAM,QAAU,GACrE,GAAI,CAAC,EAAO,EAAK,CAAE,MAAU,UAAU,iCAAiC,CACxE,GAAI,OAAO,GAAY,UACrB,MAAU,UAAU,uCAAuC,CAE7D,MAAO,CACL,OACA,UACD,EACD,CAEJ,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAa,GAAI,KAAK,OAAQ,SAAU,EAAO,CACjD,MAAO,CACL,SAAU,EAAM,KAAK,SAAS,EAAM,EAAS,CAC7C,QAAS,EAAM,QAChB,EACD,CACF,OAAO,SAAwB,EAAO,EAAM,EAAS,CACnD,IAAI,EAAU,EAAE,CAOhB,OANA,GAAQ,EAAY,SAAuB,EAAO,CAChD,IAAI,EAAS,EAAM,SAAS,EAAO,EAAM,EAAQ,CAC7C,EAAM,SACR,EAAQ,KAAK,EAAO,EAEtB,CACK,IAAI,EAAU,EAAQ,EAQjC,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IACtC,EAAS,KAAK,OAAO,GAAG,KAAM,UAAY,EAAI,SAAU,KAAK,CAUjE,IAAI,EAAU,CAEZ,IAAK,IADD,EAAS,EAAE,CACN,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IAAK,CAC3C,IAAI,EAAQ,KAAK,OAAO,GAExB,EAAO,GAAK,CACV,KAFS,KAAK,QAAQ,EAAS,EAAM,KAAM,UAAY,EAAI,SAAU,KAAK,CAAC,CAG3E,QAAS,EAAM,QAChB,CAEH,OAAO,IAAI,EAAU,EAAO,CAO9B,OAAQ,CAON,OAAO,IAAI,EANE,KAAK,OAAO,IAAI,SAAU,EAAO,CAC5C,MAAO,CACL,KAAM,EAAM,KACZ,QAAS,EAAM,QAChB,EACD,CAC0B,CAS9B,UAAU,EAAS,CACjB,OAAO,KAAK,OAAO,IAAI,SAAU,EAAO,CACtC,OAAO,EAAM,KAAK,SAAS,EAAQ,EAAI,EAAM,QAAU,GAAK,MAC5D,CAAC,KAAK;EAAK,CAOf,QAAS,CACP,MAAO,CACL,OAAQA,GACR,OAAQ,KAAK,OACd,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,OAAO,CASnC,QAAQ,EAAS,CACf,OAAO,KAAK,OAAO,IAAI,SAAU,EAAO,CACtC,OAAO,EAAM,KAAK,OAAO,EAAQ,EAAI,EAAM,QAAU,GAAK,0CAC1D,CAAC,KAAK,6CAA6C,CAQvD,OAAO,EAAS,CACd,OAAO,KAAK,OAAO,IAAI,SAAU,EAAO,CACtC,OAAO,EAAM,KAAK,MAAM,EAAQ,EAAI,EAAM,QAAU,GAAK,MACzD,CAAC,KAAK;EAAW,EAIvB,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCpLEE,GAAO,kBAEA,GAAuC,EAAQA,GADvC,CAAC,OAAO,CACmD,GAAQ,CACpF,GAAI,CACF,QACE,EAMJ,SAAS,EAAc,EAAW,CAChC,GAAI,OAAO,GAAc,UAAY,OAAO,GAAc,WAAa,OAAO,GAAc,SAC1F,MAAO,CAAC,CAAC,EAEX,GAAI,EAAW,CACb,GAAI,EAAY,EAAU,CACxB,MAAO,CAAC,EAAU,QAAQ,CAE5B,GAAI,EAAU,EAAU,CACtB,MAAO,CAAC,EAAE,EAAU,IAAM,EAAU,IAEtC,GAAI,EAAO,EAAU,CACnB,MAAO,CAAC,CAAC,EAAU,MAGvB,GAAI,GAAc,KAChB,MAAO,GAET,MAAU,UAAU,kCAAoC,GAAO,EAAU,CAAG,IAAI,CAElF,MAAM,UAAwB,CAAK,CAWjC,YAAY,EAAW,EAAU,EAAW,CAE1C,GADA,OAAO,CACH,CAAC,EAAO,EAAU,CACpB,MAAU,UAAU,qCAAqC,CAE3D,GAAI,CAAC,EAAO,EAAS,CACnB,MAAU,UAAU,oCAAoC,CAE1D,GAAI,CAAC,EAAO,EAAU,CACpB,MAAU,UAAU,qCAAqC,CAE3D,KAAK,UAAY,EACjB,KAAK,SAAW,EAChB,KAAK,UAAY,EAEnB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,mBAAoB,CACtB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAgB,KAAK,UAAU,SAAS,EAAM,EAAS,CACvD,EAAe,KAAK,SAAS,SAAS,EAAM,EAAS,CACrD,EAAgB,KAAK,UAAU,SAAS,EAAM,EAAS,CAC3D,OAAO,SAA6B,EAAO,EAAM,EAAS,CACxD,OAAO,EAAc,EAAc,EAAO,EAAM,EAAQ,CAAC,CAAG,EAAa,EAAO,EAAM,EAAQ,CAAG,EAAc,EAAO,EAAM,EAAQ,EAQxI,QAAQ,EAAU,CAChB,EAAS,KAAK,UAAW,YAAa,KAAK,CAC3C,EAAS,KAAK,SAAU,WAAY,KAAK,CACzC,EAAS,KAAK,UAAW,YAAa,KAAK,CAS7C,IAAI,EAAU,CACZ,OAAO,IAAI,EAAgB,KAAK,QAAQ,EAAS,KAAK,UAAW,YAAa,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,SAAU,WAAY,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,UAAW,YAAa,KAAK,CAAC,CAAC,CAO3M,OAAQ,CACN,OAAO,IAAI,EAAgB,KAAK,UAAW,KAAK,SAAU,KAAK,UAAU,CAQ3E,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAM1E,EAAY,KAAK,UAAU,SAAS,EAAQ,CAC5C,EAAsB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,EAC7F,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAwB,MAAQ,GAAuB,KAC5H,EAAY,IAAM,EAAY,KAEhC,IAAI,EAAW,KAAK,SAAS,SAAS,EAAQ,CAC1C,EAAiB,EAAc,KAAK,SAAU,EAAa,GAAW,EAAQ,SAAS,EACvF,IAAgB,OAAS,KAAK,SAAS,OAAS,gBAAkB,IAAmB,MAAQ,GAAkB,KACjH,EAAW,IAAM,EAAW,KAE9B,IAAI,EAAY,KAAK,UAAU,SAAS,EAAQ,CAC5C,EAAkB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,CAI7F,OAHI,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAoB,MAAQ,GAAmB,KACpH,EAAY,IAAM,EAAY,KAEzB,EAAY,MAAQ,EAAW,MAAQ,EAOhD,QAAS,CACP,MAAO,CACL,OAAQA,GACR,UAAW,KAAK,UAChB,SAAU,KAAK,SACf,UAAW,KAAK,UACjB,CAgBH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAgB,EAAK,UAAW,EAAK,SAAU,EAAK,UAAU,CAQ3E,QAAQ,EAAS,CACf,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAM1E,EAAY,KAAK,UAAU,OAAO,EAAQ,CAC1C,EAAsB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,EAC7F,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAwB,MAAQ,GAAuB,KAC5H,EAAY,iEAAmE,EAAY,kEAE7F,IAAI,EAAW,KAAK,SAAS,OAAO,EAAQ,CACxC,EAAiB,EAAc,KAAK,SAAU,EAAa,GAAW,EAAQ,SAAS,EACvF,IAAgB,OAAS,KAAK,SAAS,OAAS,gBAAkB,IAAmB,MAAQ,GAAkB,KACjH,EAAW,iEAAmE,EAAW,kEAE3F,IAAI,EAAY,KAAK,UAAU,OAAO,EAAQ,CAC1C,EAAkB,EAAc,KAAK,UAAW,EAAa,GAAW,EAAQ,SAAS,CAI7F,OAHI,IAAgB,OAAS,KAAK,UAAU,OAAS,gBAAkB,IAAoB,MAAQ,GAAmB,KACpH,EAAY,iEAAmE,EAAY,kEAEtF,EAAY,iEAAmE,EAAW,iEAAmE,EAQtK,OAAO,EAAS,CACd,MAAO,mBAAqB,KAAK,SAAS,MAAM,EAAQ,CAAG,4BAA8B,KAAK,UAAU,MAAM,EAAQ,CAAG,SAAW,KAAK,UAAU,MAAM,EAAQ,CAAG,6CAIxK,OADA,EAAgB,EAAiB,OAAQA,GAAK,CACvC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,iBC3NF,IAAIE,EAAW,OAAO,QAAU,SAAU,EAAQ,CAAE,IAAK,IAAI,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,CAAE,IAAI,EAAS,UAAU,GAAI,IAAK,IAAI,KAAO,EAAc,OAAO,UAAU,eAAe,KAAK,EAAQ,EAAI,GAAI,EAAO,GAAO,EAAO,IAAY,OAAO,GAEnP,EAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACL,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACL,EAAG,MACH,IAAK,qBACN,CACG,EAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,IAAM,YACN,OAAQ,cACR,KAAM,cACP,CAEG,EAAqB,SAA4B,EAAgB,EAAe,CAClF,OAAOA,EAAS,EAAE,CAAEE,EAAgBC,EAAc,EAWpD,EAAO,QAAU,SAAU,EAAK,CAmC9B,IAlCA,IAAI,EAAO,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAAE,CAC7E,EAAwB,EAAK,mBAC7B,EAAqB,IAA0B,IAAA,GAAY,GAAQ,EACnE,EAAmB,EAAK,YACxB,EAAc,IAAqB,IAAA,GAAY,EAAqB,EAEpE,EAAa,OAAO,EAAI,CACxB,EAAS,GAET,EAAU,EAAYH,EAAS,EAAE,CAAE,EAAe,CAAE,EAAqBA,EAAS,EAAE,CAAE,EAAc,CAAG,EAAE,CAAC,CAC1G,EAAa,OAAO,KAAK,EAAQ,CAMjC,EAAQ,UAAiB,CAC3B,IAAI,EAAmB,GACvB,EAAW,QAAQ,SAAU,EAAK,EAAO,CACnC,GAGA,EAAW,QAAU,EAAI,QAAU,EAAW,MAAM,EAAG,EAAI,OAAO,GAAK,IACzE,GAAU,EAAQ,EAAW,IAC7B,EAAa,EAAW,MAAM,EAAI,OAAQ,EAAW,OAAO,CAC5D,EAAmB,KAErB,CACG,IACH,GAAU,EAAW,MAAM,EAAG,EAAE,CAChC,EAAa,EAAW,MAAM,EAAG,EAAW,OAAO,GAIhD,GACL,GAAO,CAET,OAAO,WC1EE,GAAe,CAExB,MAAO,IACP,MAAO,UACP,KAAM,IACN,KAAM,SACN,MAAO,UACP,MAAO,UACP,MAAO,UACP,MAAO,UACP,QAAS,IACT,QAAS,YACT,WAAY,eACZ,KAAM,IACN,KAAM,SACN,IAAK,IACL,IAAK,QACL,MAAO,UACP,MAAO,UACP,SAAU,aACV,KAAM,IACN,KAAM,SACN,MAAO,IACP,MAAO,UACP,SAAU,aACV,OAAQ,WACR,OAAQ,WACR,GAAI,IACJ,GAAI,OACJ,GAAI,IACJ,GAAI,OACJ,GAAI,OACJ,GAAI,OACJ,QAAS,IACT,QAAS,IACT,GAAI,OACJ,GAAI,OACJ,MAAO,UACP,IAAK,IACL,IAAK,QACL,OAAQ,WACR,MAAO,UACP,MAAO,UACP,SAAU,aACV,IAAK,IACL,IAAK,QACL,QAAS,YACT,QAAS,YACT,IAAK,QACL,IAAK,QACL,OAAQ,WACR,IAAK,IACL,IAAK,QACL,IAAK,QACL,IAAK,QACL,MAAO,UACP,MAAO,UAEP,KAAM,iBACN,MAAO,kBAEP,EAAG,IAEH,IAAK,UACL,IAAK,UACL,SAAU,UACV,SAAU,UACV,GAAI,UACJ,IAAK,QACL,UAAW,cACZ,CACU,EAAiB,CAC1B,UAAW,SACX,WAAY,KACZ,UAAW,IACX,IAAK,IACL,OAAQ,YAER,UAAW,IACX,WAAY,IACZ,OAAQ,MAER,IAAK,QACL,SAAU,SACV,OAAQ,SAER,YAAa,UAEb,UAAW,KAEX,IAAK,QACL,IAAK,IACL,SAAU,IACV,GAAI,eACJ,UAAW,KACX,gBAAiB,KACjB,cAAe,MACf,MAAO,IACP,QAAS,QACT,QAAS,IACT,OAAQ,IACR,UAAW,QACX,SAAU,QACV,OAAQ,MACR,OAAQ,iBACR,MAAO,IACP,IAAK,UACL,IAAK,WACL,GAAI,QACL,CACU,GAAiB,CAE1B,IAAK,CACH,EAAG,4BACJ,CACD,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CACD,KAAM,CACJ,EAAG,wBACJ,CACD,KAAM,CACJ,EAAG,wCACJ,CACD,KAAM,CACJ,EAAG,8BACJ,CACD,OAAQ,CACN,EAAG,iCACJ,CACD,UAAW,CACT,EAAG,qBAA2B,EAAe,+BAC9C,CACD,YAAa,CACX,EAAG,qBAA2B,EAAe,iCAC9C,CACD,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,IAAK,CACH,EAAG,iCACJ,CACD,MAAO,WAAkB,EAAe,6BACxC,IAAK,CACH,EAAG,6CACJ,CACD,MAAO,CACL,EAAG,0CACJ,CACD,SAAU,CACR,EAAG,iCACJ,CACD,IAAK,8BACL,MAAO,gCACP,IAAK,CACH,EAAG,gCACH,EAAG,8CACJ,CACD,MAAO,CACL,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,kCACH,EAAG,gDACJ,CACD,KAAM,qCACN,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CACD,SAAU,CACR,EAAG,qBAA2B,EAAe,8BAC9C,CACD,KAAM,CACJ,EAAG,gCACH,EAAG,IAAA,GACJ,CACD,QAAS,CACP,EAAG,iCACJ,CACD,SAAU,CACR,EAAG,wCACJ,CACD,IAAK,CACH,EAAG,6BAAmC,EAAe,mBACtD,CACD,MAAO,CACL,EAAG,yCACH,EAAG,IAAA,GACJ,CACD,KAAM,CACJ,EAAG,6CACJ,CACD,KAAM,CACJ,EAAG,qBACJ,CACD,OAAQ,CACN,EAAG,8BACJ,CACD,SAAU,CACR,EAAG,qBAA2B,EAAe,8BAC9C,CACD,WAAY,CACV,EAAG,GAAU,EAAe,uCAC7B,CACD,UAAW,CACT,EAAG,GAAU,EAAe,sCAC7B,CAED,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,OAAQ,CACN,EAAG,EAAe,OAAS,4BAC5B,CACD,MAAO,CACL,EAAG,qBAA2B,EAAe,2BAC9C,CACD,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,UAAW,CACT,EAAG,qBAA2B,EAAe,+BAC9C,CACD,gBAAiB,CACf,EAAG,qBAA2B,EAAe,qCAC9C,CACD,cAAe,CACb,EAAG,qBAA2B,EAAe,mCAC9C,CAED,YAAa,CACX,EAAG,2BACJ,CACD,QAAS,CACP,EAAG,2BACJ,CACD,WAAY,CACV,EAAG,oCACJ,CAED,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,8BACJ,CACD,GAAI,CACF,EAAG,8CACJ,CACD,GAAI,CACF,EAAG,8CACJ,CAED,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CACD,IAAK,CACH,EAAG,EAAe,IAAM,4BACzB,CACD,GAAI,CACF,EAAG,qBAA2B,EAAe,wBAC9C,CACD,IAAK,CACH,EAAG,qBAA2B,EAAe,yBAC9C,CAED,MAAO,CACL,EAAG,4DACJ,CACD,WAAY,CACV,EAAG,6BAAmC,EAAe,aACtD,CACD,IAAK,CACH,EAAG,iCACJ,CACD,IAAK,CACH,EAAG,4CACJ,CACD,KAAM,CACJ,EAAG,iCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,gCACJ,CACD,MAAO,CACL,EAAG,gBAAsB,EAAe,oBACzC,CACD,MAAO,CACL,EAAG,wCACJ,CACD,UAAW,CACT,EAAG,6BAAmC,EAAe,YACtD,CAED,aAAc,CACZ,EAAG,kCACJ,CACD,oBAAqB,CACnB,EAAG,+DACJ,CACD,UAAW,CACT,EAAG,6BAAmC,EAAe,YACtD,CACD,MAAO,CACL,EAAG,mCACJ,CACD,OAAQ,CACN,EAAG,uCACJ,CAED,MAAO,CACL,EAAG,qBAA2B,EAAe,2BAC9C,CACD,OAAQ,CACN,EAAG,qBAA2B,EAAe,4BAC9C,CACD,SAAU,CACR,EAAG,qBAA2B,EAAe,8BAC9C,CACD,QAAS,CACP,EAAG,qBAA2B,EAAe,6BAC9C,CACD,UAAW,CACT,EAAG,qBAA2B,EAAe,+BAC9C,CACD,QAAS,CACP,EAAG,qBAA2B,EAAe,6BAC9C,CAED,IAAK,CACH,EAAG,+BACJ,CAED,IAAK,8BACL,IAAK,8BACL,SAAU,sCAEV,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,+CACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,+CACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,KAAM,CACJ,EAAG,sCACJ,CACD,MAAO,CACL,EAAG,wCACJ,CACD,MAAO,CACL,EAAG,uCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,0CACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,0CACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CACD,IAAK,CACH,EAAG,iCACJ,CACD,KAAM,CACJ,EAAG,kCACJ,CAED,GAAI,CACF,EAAG,qBAA2B,EAAe,wBAC9C,CAED,QAAS,SAAiB,EAAM,EAAS,CAEvC,OAAO,EAAK,KAAK,GAAG,OAAO,EAG7B,OAAQ,CACN,EAAG,IACH,EAAG,4BACH,EAAG,qDACJ,CACD,OAAQ,CACN,EAAG,eACH,EAAG,4CACJ,CACD,UAAW,CACT,EAAG,IACH,EAAG,4BACJ,CACD,OAAQ,CACN,EAAG,IACH,EAAG,4BACJ,CACD,QAAS,CACP,EAAG,IACH,EAAG,4BACH,EAAG,qCAA2C,GAAa,4CAC5D,CACD,OAAQ,CACN,EAAG,iCACH,EAAG,4BACH,EAAG,4BACJ,CACD,OAAQ,CACN,EAAG,iCACH,EAAG,4BACJ,CACD,KAAM,CACJ,EAAG,4BACH,EAAG,qDACJ,CACF,CACU,GAAkB,0CACzB,GAAa,CACf,IAAK,UACN,CACD,SAAgB,GAAY,EAAQ,CAClC,OAAA,EAAA,GAAA,SAAsB,EAAQ,CAC5B,mBAAoB,GACrB,CAAC,CAKJ,SAAgB,GAAS,EAAM,EAAQ,CAWrC,MAVA,GAAgBK,IAAW,OAAc,GAAQA,EAC7CA,EACE,EAAe,GAAYC,EAAK,CAC3B,GAAWA,GAEb,YAAc,GAAYA,EAAK,CAAG,IAEvC,EAAe,GAAcA,EAAK,CAC7B,GAAaA,GAEf,GAAYA,EAAK,CCne1B,IAAIC,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,OAAQ,YAAY,CACmC,GAAQ,CACjF,GAAI,CACF,OACA,aACE,EACJ,MAAM,UAAqB,CAAK,CAa9B,YAAY,EAAO,CACjB,OAAO,CACP,KAAK,MAAQ,EAEf,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAQ,KAAK,MACjB,OAAO,UAA4B,CACjC,OAAO,GAQX,QAAQ,EAAU,EAUlB,IAAI,EAAU,CACZ,OAAO,KAAK,OAAO,CAOrB,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,MAAM,CAQrC,UAAU,EAAS,CACjB,OAAO,GAAO,KAAK,MAAO,EAAQ,CAQpC,QAAQ,EAAS,CACf,IAAI,EAAQ,KAAK,UAAU,EAAQ,CACnC,OAAQ,GAAO,KAAK,MAAM,CAA1B,CACE,IAAK,SACL,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+B,EAAQ,UAChD,IAAK,SACH,MAAO,6BAA+B,EAAQ,UAChD,IAAK,UACH,MAAO,8BAAgC,EAAQ,UACjD,IAAK,OACH,MAAO,kCAAoC,EAAQ,UACrD,IAAK,YACH,MAAO,gCAAkC,EAAQ,UACnD,QACE,MAAO,6BAA+B,EAAQ,WAQpD,QAAS,CACP,MAAO,CACL,OAAQA,GACR,MAAO,KAAK,MACb,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAa,EAAK,MAAM,CAQrC,OAAO,EAAS,CACd,IAAI,EAAQ,KAAK,UAAU,EAAQ,CAEnC,OADW,GAAO,KAAK,MAAM,CAC7B,CACE,IAAK,SACH,MAAO,YAAc,GAAY,EAAM,CAAG,IAC5C,IAAK,SACL,IAAK,YAED,GAAI,CAAC,EAAU,KAAK,MAAM,CACxB,OAAO,KAAK,MAAM,SAAS,CAAG,EAAI,WAAa,UAEjD,IAAI,EAAQ,EAAM,aAAa,CAAC,QAAQ,IAAI,CAI5C,OAHI,IAAU,GAGP,EAFE,EAAM,UAAU,EAAG,EAAM,CAAG,aAAe,EAAM,UAAU,EAAQ,EAAE,CAAG,IAIrF,IAAK,SAED,OAAO,EAAM,UAAU,CAE3B,IAAK,WACH,OAAO,KAAK,MAAM,SAAS,CAC7B,QACE,OAAO,IAKf,OADA,EAAgB,EAAc,OAAQA,GAAK,CACpC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC1KEE,GAAO,yBAEA,GAA8C,EAAQA,GAD9C,CAAC,QAAS,OAAO,CACiD,GAAQ,CAC3F,GAAI,CACF,QACA,QACE,EAQJ,SAAS,EAAgB,EAAM,EAAa,EAAU,CACpD,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAiB,EAAc,EAAK,KAAM,EAAa,EAAS,CACpE,OAAO,IAAgB,OAAS,IAAmB,MAAQ,GAAkB,EAE/E,MAAM,UAA+B,CAAK,CAaxC,YAAY,EAAM,EAAQ,EAAM,CAG9B,GAFA,OAAO,CAEH,OAAOA,GAAS,SAClB,MAAU,UAAU,uCAAuC,CAE7D,GAAI,CAAC,MAAM,QAAQ,EAAO,CACxB,MAAU,UAAU,sEAAsE,CAE5F,GAAI,CAAC,EAAO,EAAK,CACf,MAAU,UAAU,qCAAqC,CAE3D,GAAI,GAAS,IAAIA,EAAK,CACpB,MAAU,MAAM,2BAA6BA,EAAO,0BAA0B,CAEhF,IAAI,EAAa,IAAI,IACrB,IAAK,IAAI,KAAS,EAAQ,CACxB,IAAI,EAAQ,OAAO,GAAU,SAAW,EAAQ,EAAM,KACtD,GAAI,EAAW,IAAI,EAAM,CACvB,MAAU,MAAM,6BAAqC,KAAa,CAElE,EAAW,IAAI,EAAM,CAGzB,KAAK,KAAOA,EACZ,KAAK,OAAS,EAAO,IAAI,SAAU,EAAO,CACxC,OAAOE,GAASA,EAAM,MAAQA,GAC9B,CACF,KAAK,MAAQ,EAAO,IAAI,SAAU,EAAO,CACvC,OAAOA,GAASA,EAAM,MAAQ,OAC9B,CACF,KAAK,KAAO,EAEd,IAAI,MAAO,CACT,OAAOF,GAET,IAAI,0BAA2B,CAC7B,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAgB,OAAO,OAAO,EAAS,CAC3C,GAAQ,KAAK,OAAQ,SAAU,EAAO,CACpC,EAAc,GAAS,IACvB,CAGF,IAAI,EAAO,KAAK,KACZ,EAAW,EAAK,SAAS,EAAM,EAAc,CAC7CA,EAAO,KAAK,KACZ,EAAS,KAAK,OACd,EAAY,GAAK,KAAK,MAAO,IAAI,CACjC,EAASA,EAAO,IAAM,GAAK,KAAK,OAAQ,KAAK,CAAG,IACpD,OAAO,SAAoC,EAAO,EAAM,EAAS,CAC/D,IAAI,EAAa,EAAE,CACnB,EAAW,GAAa,UAAY,CAElC,IAAK,IADD,EAAY,OAAO,OAAO,EAAK,CAC1B,EAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAU,EAAO,IAAM,UAAU,GAEnC,OAAO,EAAS,EAAO,EAAW,EAAQ,EAE5C,IAAI,EAAK,EAAMA,EAAM,EAAW,CAIhC,MAHA,GAAG,OAAS,EACZ,EAAG,KAAO,EAAK,UAAU,CACzB,EAAM,IAAIA,EAAM,EAAG,CACZ,GAQX,QAAQ,EAAU,CAChB,EAAS,KAAK,KAAM,OAAQ,KAAK,CAUnC,IAAI,EAAU,CACZ,IAAI,EAAO,KAAK,QAAQ,EAAS,KAAK,KAAM,OAAQ,KAAK,CAAC,CAC1D,OAAO,IAAI,EAAuB,KAAK,KAAM,KAAK,OAAO,MAAM,EAAE,CAAE,EAAK,CAO1E,OAAQ,CACN,OAAO,IAAI,EAAuB,KAAK,KAAM,KAAK,OAAO,MAAM,EAAE,CAAE,KAAK,KAAK,CAQ/E,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAO,KAAK,KAAK,SAAS,EAAQ,CAItC,OAHI,EAAgB,KAAM,EAAa,GAAW,EAAQ,SAAS,GACjE,EAAO,IAAM,EAAO,KAEf,KAAK,KAAO,IAAM,KAAK,OAAO,KAAK,KAAK,CAAG,OAAS,EAO7D,QAAS,CACP,IAAI,EAAQ,KAAK,MACjB,MAAO,CACL,OAAQA,GACR,KAAM,KAAK,KACX,OAAQ,KAAK,OAAO,IAAI,SAAU,EAAO,EAAO,CAC9C,MAAO,CACL,KAAM,EACN,KAAM,EAAM,GACb,EACD,CACF,KAAM,KAAK,KACZ,CAcH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAuB,EAAK,KAAM,EAAK,OAAQ,EAAK,KAAK,CAQtE,QAAQ,EAAS,CAGf,IAAK,IAFD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAAE,CACN,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IACtC,EAAO,KAAK,4CAA8C,EAAO,KAAK,OAAO,GAAG,CAAG,UAAU,CAE/F,IAAI,EAAO,KAAK,KAAK,OAAO,EAAQ,CAIpC,OAHI,EAAgB,KAAM,EAAa,GAAW,EAAQ,SAAS,GACjE,EAAO,iEAAmE,EAAO,kEAE5E,+BAAiC,EAAO,KAAK,KAAK,CAAG,wEAA+E,EAAO,KAAK,wCAAwC,CAAG,qLAAiM,EAQrY,OAAO,EAAS,CACd,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAO,KAAK,KAAK,MAAM,EAAQ,CAInC,OAHI,EAAgB,KAAM,EAAa,GAAW,EAAQ,SAAS,GACjE,EAAO,UAAiB,aAEnB,YAAc,KAAK,KAAO,WAAa,KAAK,OAAO,IAAI,GAAS,CAAC,KAAK,IAAI,CAAG,YAAc,GAItG,OADA,EAAgB,EAAwB,OAAQA,GAAK,CAC9C,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCtOEG,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,OAAQ,OAAO,CACqC,GAAQ,CAC9E,GAAI,CACF,OACA,QACE,EACJ,MAAM,UAAkB,CAAK,CAe3B,YAAY,EAAY,EAAa,CAMnC,GALA,OAAO,CACP,KAAK,WAAa,EAClB,KAAK,YAAc,GAAe,GAG9B,CAAC,MAAM,QAAQ,EAAW,EAAI,CAAC,EAAW,MAAM,EAAO,CACzD,MAAU,UAAU,6DAA6D,CAEnF,GAAI,KAAK,aAAe,CAAC,KAAK,kBAAkB,CAC9C,MAAU,MAAM,oDAAoD,CAGxE,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAgBT,SAAS,EAAM,EAAU,CAQvB,IAAI,EAAiB,GAAI,KAAK,WAAY,SAAU,EAAW,EAAG,CAEhE,GADe,EAAU,OAAO,GAAQ,EAAK,cAAgB,EAAK,OAAS,MAAM,CAAC,OAAS,EAC7E,CAGZ,IAAI,EAAgB,OAAO,OAAO,EAAS,CAC3C,EAAc,IAAM,GACpB,IAAI,EAAiB,EAAU,SAAS,EAAM,EAAc,CAC5D,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,GAAI,CAAC,EAAS,EAAQ,EAAI,CAAC,EAAQ,EAAQ,EAAI,CAAC,EAAS,EAAQ,CAC/D,MAAU,UAAU,2EAAkF,GAAO,EAAQ,CAAC,CAExH,IAAI,EAAI,EAAK,EAAQ,CACjB,EAAY,OAAO,OAAO,EAAK,CAEnC,MADA,GAAU,IAAM,EAAE,GACX,EAAe,EAAO,EAAW,EAAQ,OAIlD,OAAO,EAAU,SAAS,EAAM,EAAS,EAE3C,CACE,EAAQ,EAAgB,EAAM,QAAQ,CAC1C,OAAO,SAAuB,EAAO,EAAM,EAAS,CAIlD,OAAO,EAAM,GAHI,GAAI,EAAgB,SAAU,EAAe,CAC5D,OAAO,EAAc,EAAO,EAAM,EAAQ,EAC1C,CACyB,EAQ/B,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IAC1C,EAAS,KAAK,WAAW,GAAI,cAAgB,EAAI,IAAK,KAAK,CAU/D,IAAI,EAAU,CAEZ,IAAK,IADD,EAAa,EAAE,CACV,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IAC1C,EAAW,GAAK,KAAK,QAAQ,EAAS,KAAK,WAAW,GAAI,cAAgB,EAAI,IAAK,KAAK,CAAC,CAE3F,OAAO,IAAI,EAAU,EAAY,KAAK,YAAY,CAOpD,OAAQ,CACN,OAAO,IAAI,EAAU,KAAK,WAAW,MAAM,EAAE,CAAE,KAAK,YAAY,CAOlE,kBAAmB,CACjB,OAAO,KAAK,WAAW,SAAW,GAAK,EAAe,KAAK,WAAW,GAAG,EAAI,OAAO,KAAK,WAAW,GAAG,OAAU,SAQnH,mBAAoB,CAClB,OAAO,KAAK,kBAAkB,CAAG,KAAK,WAAW,GAAG,MAAQ,KAQ9D,UAAU,EAAS,CAEjB,OAAO,KAAK,YAAc,IAAM,KAAK,mBAAmB,CAAG,IAAM,KAAK,WAAW,KAAK,KAAK,CAAG,IAOhG,QAAS,CACP,MAAO,CACL,OAAQA,GACR,WAAY,KAAK,WACjB,YAAa,KAAK,YACnB,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,WAAY,EAAK,YAAY,CAQzD,QAAQ,EAAS,CAGf,IAAK,IADD,EAAa,EAAE,CACV,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,IAC1C,EAAW,GAAK,KAAK,WAAW,GAAG,QAAQ,CAK3C,OAHE,KAAK,YACA,sGAA6G,EAAO,KAAK,mBAAmB,CAAC,CAAG,UAEhJ,kEAAoE,EAAW,KAAK,wCAAwC,CAAG,kEAS1I,OAAO,EAAS,CACd,IAAI,EAAa,KAAK,WAAW,IAAI,SAAU,EAAO,CACpD,OAAO,EAAM,MAAM,EAAQ,EAC3B,CACF,OAAO,KAAK,YAAc,IAAM,KAAK,mBAAmB,CAAQ,KAAO,EAAW,KAAK,IAAI,CAAG,KAIlG,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCpNEE,GAAO,aAEA,GAAkC,EAAQA,GADlC,CAAC,OAAO,CAC8C,GAAQ,CAC/E,GAAI,CACF,QACE,EACJ,MAAM,UAAmB,CAAK,CAO5B,YAAY,EAAY,CAKtB,GAJA,OAAO,CACP,KAAK,WAAaE,GAAc,EAAE,CAG9BA,IACI,OAAOA,GAAe,UAAa,CAAC,OAAO,KAAKA,EAAW,CAAC,MAAM,SAAU,EAAK,CACrF,OAAO,EAAOA,EAAW,GAAK,EAC9B,EACA,MAAU,UAAU,mCAAmC,CAI7D,IAAI,MAAO,CACT,OAAOF,GAET,IAAI,cAAe,CACjB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAI,EAAc,EAAE,CACpB,IAAK,IAAI,KAAO,KAAK,WACnB,GAAI,EAAe,KAAK,WAAY,EAAI,CAAE,CAGxC,IAAI,EAAiB,GAAU,EAAI,CAC/B,EAAY,KAAK,MAAM,EAAe,CAE1C,EAAY,GADD,EAAgB,KAAK,WAAY,EAAI,CAClB,SAAS,EAAM,EAAS,CAG1D,OAAO,SAAwB,EAAO,EAAM,EAAS,CACnD,IAAI,EAAM,EAAE,CACZ,IAAK,IAAI,KAAQ,EACX,EAAe,EAAa,EAAK,GACnC,EAAI,GAAQ,EAAY,GAAM,EAAO,EAAM,EAAQ,EAGvD,OAAO,GAQX,QAAQ,EAAU,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAS,KAAK,WAAW,GAAM,cAAgB,GAAU,EAAI,CAAG,IAAK,KAAK,CAWhF,IAAI,EAAU,CACZ,IAAIE,EAAa,EAAE,CACnB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,GACtC,EAAW,GAAO,KAAK,QAAQ,EAAS,KAAK,WAAW,GAAM,cAAgB,GAAU,EAAI,CAAG,IAAK,KAAK,CAAC,EAG9G,OAAO,IAAI,EAAWA,EAAW,CAOnC,OAAQ,CACN,IAAIA,EAAa,EAAE,CACnB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,GACtC,EAAW,GAAO,KAAK,WAAW,IAGtC,OAAO,IAAI,EAAWA,EAAW,CASnC,UAAU,EAAS,CACjB,IAAI,EAAU,EAAE,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAQ,KAAK,GAAU,EAAI,CAAG,KAAO,KAAK,WAAW,GAAK,SAAS,EAAQ,CAAC,CAGhF,MAAO,IAAM,EAAQ,KAAK,KAAK,CAAG,IAOpC,QAAS,CACP,MAAO,CACL,OAAQF,GACR,WAAY,KAAK,WAClB,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAW,EAAK,WAAW,CASxC,QAAQ,EAAS,CACf,IAAI,EAAU,EAAE,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAQ,KAAK,2CAA6C,EAAO,EAAI,CAAG,8HAA+I,KAAK,WAAW,GAAK,OAAO,EAAQ,CAAC,CAGhQ,MAAO,iEAAmE,EAAQ,KAAK,wCAAwC,CAAG,iEAQpI,OAAO,EAAS,CACd,IAAI,EAAU,EAAE,CAChB,IAAK,IAAI,KAAO,KAAK,WACf,EAAe,KAAK,WAAY,EAAI,EACtC,EAAQ,KAAK,YAAc,EAAM,QAAU,KAAK,WAAW,GAAK,MAAM,EAAQ,CAAG,OAAO,CAI5F,MADU,8BAAgC,EAAQ,KAAK;EAAK,CAAG,0BAKnE,OADA,EAAgB,EAAY,OAAQA,GAAK,CAClC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCjLF,SAAgB,GAAe,EAAa,EAAM,CAChD,OAAO,IAAI,EAAe,EAAa,IAAI,EAAkB,EAAK,CAAE,IAAI,IAAI,OAAO,KAAK,EAAK,CAAC,CAAC,CCPjG,IAAIG,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,OAAO,CACgD,GAAQ,CACjF,GAAI,CACF,QACE,EAQJ,SAAS,EAAmB,EAAM,EAAa,CAC7C,IAAI,EAAU,EACd,GAAI,IAAgB,OAClB,KAAO,GAAkB,EAAQ,EAAE,EAAU,EAAQ,QAMvD,OAJI,EAAe,EAAQ,CAAS,GAChC,GAAe,EAAQ,CAClB,EAAmB,EAAQ,KAAK,GAAI,EAAY,CAElD,GAgBT,SAAS,EAA8B,EAAM,EAAa,EAAU,EAAM,EAAO,CAE/E,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAgB,GAAiB,EAAM,EAAY,CACvD,GAAI,IAAgB,OAAS,EAAK,OAAS,GAAK,EAAK,eAAe,GAAK,oBAAsB,EAAK,eAAe,GAAK,wBACtH,OAAO,EAAK,IAAI,SAAU,EAAK,CAC7B,OAAQ,EAAI,YAAY,CAAC,KAAzB,CAEE,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,MAAO,GACT,QACE,MAAO,KAEX,CAEJ,IAAI,EACJ,OAAQ,EAAK,OAAb,CACE,IAAK,GACH,EAAS,EAAE,CACX,MACF,IAAK,GAID,IAAI,EAAoB,EAAc,EAAK,GAAI,EAAa,EAAU,EAAK,CAG3E,GAAI,GAAS,IAAsB,KAAM,CACvC,IAAI,EACA,EASJ,GARI,IAAgB,QAClB,EAAoB,EAAK,GAAG,eAAe,CAC3C,EAAiB,EAAK,eAAe,GAGrC,EAAoB,EAAK,GAAG,YAAY,CAAC,eAAe,CACxD,EAAiB,EAAK,YAAY,CAAC,eAAe,EAEhD,GAAW,GAAY,GAAgB,kBAAoB,GAAO,CACpE,EAAS,CAAC,GAAM,CAChB,MAEF,GAAI,GAAW,GAAmB,GAAmB,cAAgB,GAAO,CAC1E,EAAS,CAAC,GAAM,CAChB,OAGJ,GAAI,IAAsB,KAAM,CAE9B,EAAS,CAAC,GAAM,CAChB,MAEF,GAAI,GAAqB,EAAY,CAEnC,EAAS,CAAC,GAAK,CACf,MAIF,EAAS,CAAC,GAAM,CAElB,MACF,IAAK,GAGD,IAAI,EAEA,EAAgB,EAAc,EAAK,GAAI,EAAa,EAAU,EAAK,CAEnE,EAAe,GAAkB,EAAM,EAAK,GAAI,EAAY,CAChE,AAaE,EAbE,IAAkB,KAGR,GACH,IAAkB,GAAc,IAAkB,SAAW,CAAC,EAK3D,GACH,EAAgB,EAK3B,IAAI,EAEA,EAAgB,EAAc,EAAK,GAAI,EAAa,EAAU,EAAK,CAEnE,EAAe,GAAkB,EAAM,EAAK,GAAI,EAAY,CAkBhE,GAjBA,AAaE,EAbE,IAAkB,KAGR,GACH,IAAkB,GAAc,IAAkB,QAAU,CAAC,EAK1D,GACH,EAAgB,EAOvB,EAAO,CACT,IAAI,EACA,EACA,EACA,IAAgB,QAClB,EAAkB,EAAK,eAAe,CACtC,EAAgB,EAAK,KAAK,GAAG,eAAe,CAC5C,EAAgB,EAAK,KAAK,GAAG,eAAe,GAG5C,EAAkB,EAAK,YAAY,CAAC,eAAe,CACnD,EAAgB,EAAK,KAAK,GAAG,YAAY,CAAC,eAAe,CACzD,EAAgB,EAAK,KAAK,GAAG,YAAY,CAAC,eAAe,EAEvD,IAAkB,OAChB,GAAW,GAAY,GAAiB,kBAAoB,KAC9D,EAAY,IAEV,GAAW,GAAe,GAAe,cAAgB,KAC3D,EAAY,KAGZ,IAAkB,OAChB,GAAW,GAAY,GAAiB,mBAAqB,KAC/D,EAAY,IAEV,GAAW,GAAe,GAAe,cAAgB,KAC3D,EAAY,KAIlB,EAAS,CAAC,EAAW,EAAU,CAEjC,MACF,SACM,EAAK,eAAe,GAAK,oBAAsB,EAAK,eAAe,GAAK,2BAC1E,EAAS,EAAK,IAAI,SAAU,EAAK,CAC/B,IAAI,EAAgB,EAAc,EAAK,EAAa,EAAU,EAAK,CAC/D,EAAe,GAAkB,EAAM,EAAK,EAAY,CACxD,EAAmB,GAAiB,EAAK,EAAY,CASzD,OARI,IAAkB,KAEb,GACE,IAAe,GAAiB,IAAkB,GAAoB,CAAC,EACzE,GACE,EAAgB,GAI3B,EAEJ,MAOJ,GAAI,EAAK,QAAU,GAAK,EAAK,eAAe,GAAK,yBAA2B,EAAK,UAAY,IAAgB,OAAS,IAAa,WAC5H,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EAC/B,EAAmB,EAAK,GAAI,EAAY,EAAI,CAAC,EAAO,EAAI,KAAO,IAAgB,QAAU,CAAC,GAAkB,EAAK,EAAI,GAAG,IAC1H,EAAO,GAAK,IAIlB,OAAO,EAET,MAAM,UAAqB,CAAK,CAY9B,YAAY,EAAI,EAAI,EAAM,EAAU,EAAc,CAGhD,GAFA,OAAO,CAEH,OAAO,GAAO,SAChB,MAAU,UAAU,qCAAqC,CAE3D,GAAI,OAAO,GAAO,SAChB,MAAU,UAAU,qCAAqC,CAE3D,GAAI,CAAC,MAAM,QAAQ,EAAK,EAAI,CAAC,EAAK,MAAM,EAAO,CAC7C,MAAU,UAAU,uDAAuD,CAE7E,KAAK,SAAW,IAAa,GAC7B,KAAK,aAAe,IAAiB,GACrC,KAAK,GAAK,EACV,KAAK,GAAK,EACV,KAAK,KAAO,GAAQ,EAAE,CAExB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CAEvB,GAAI,OAAO,KAAK,IAAO,UAAY,CAAC,EAAa,EAAM,KAAK,GAAG,CAE3D,MADG,EAAK,KAAK,IAGH,MAAM,0BAA4B,KAAK,GAAK,IAAI,CAFhD,MAAM,YAAc,KAAK,GAAK,wCAAwC,CAKpF,IAAI,EAAK,EAAgB,EAAM,KAAK,GAAG,CACnC,EAAW,GAAI,KAAK,KAAM,SAAU,EAAK,CAC3C,OAAO,EAAI,SAAS,EAAM,EAAS,EACnC,CACF,GAAI,OAAO,GAAO,YAAc,EAAG,UAAY,GAAM,CAGnD,IAAI,EAAU,KAAK,KACnB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,EAAS,EAAM,GAAe,EAAO,EAAK,CAAC,UAE9C,EAAS,SAAW,EAAG,CAChC,IAAI,EAAW,EAAS,GACxB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAC,UAElC,EAAS,SAAW,EAAG,CAChC,IAAI,EAAW,EAAS,GACpB,EAAW,EAAS,GACxB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAE,EAAS,EAAO,EAAM,EAAQ,CAAC,OAG3E,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,OAAO,EAAG,MAAM,KAAM,GAAI,EAAU,SAAU,EAAS,CACrD,OAAO,EAAQ,EAAO,EAAM,EAAQ,EACpC,CAAC,EAST,QAAQ,EAAU,CAChB,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAUnD,IAAI,EAAU,CAEZ,IAAK,IADD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAK,GAAK,KAAK,QAAQ,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAAC,CAEzE,OAAO,IAAI,EAAa,KAAK,GAAI,KAAK,GAAI,EAAM,KAAK,SAAU,KAAK,aAAa,CAOnF,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,GAAI,KAAK,GAAI,KAAK,KAAK,MAAM,EAAE,CAAE,KAAK,SAAU,KAAK,aAAa,CASjG,SAAU,CACR,OAAO,KAAK,KAAK,SAAW,EAS9B,UAAW,CACT,OAAO,KAAK,KAAK,SAAW,EAQ9B,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAW,GAAW,EAAQ,SAAW,EAAQ,SAAW,OAC5D,EAAO,KAAK,KACZ,EAAS,EAA8B,KAAM,EAAa,EAAU,EAAM,GAAM,CACpF,GAAI,EAAK,SAAW,EAAG,CAErB,IAAI,EAAQ,GAAiB,KAAM,EAAY,CAC3C,EAAU,EAAK,GAAG,SAAS,EAAQ,CACnC,EAAO,KACT,EAAU,IAAM,EAAU,KAI5B,IAAI,EAAY,YAAY,KAAK,KAAK,GAAG,CAUzC,OATI,IAAU,QAEL,KAAK,IAAM,EAAY,IAAM,IAAM,EACjC,IAAU,OAEZ,GAAW,EAAY,IAAM,IAAM,KAAK,GAI1C,EAAU,KAAK,WACb,EAAK,SAAW,EAAG,CAC5B,IAAI,EAAM,EAAK,GAAG,SAAS,EAAQ,CAC/B,EAAM,EAAK,GAAG,SAAS,EAAQ,CAYnC,OAXI,EAAO,KAET,EAAM,IAAM,EAAM,KAEhB,EAAO,KAET,EAAM,IAAM,EAAM,KAEhB,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAM,IAAM,EAEd,EAAM,IAAM,KAAK,GAAK,IAAM,UAC1B,EAAK,OAAS,IAAM,KAAK,eAAe,GAAK,oBAAsB,KAAK,eAAe,GAAK,yBAA0B,CAC/H,IAAI,EAAkB,EAAK,IAAI,SAAU,EAAK,EAAO,CAMnD,MALA,GAAM,EAAI,SAAS,EAAQ,CACvB,EAAO,KAET,EAAM,IAAM,EAAM,KAEb,GACP,CAIF,OAHI,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAgB,KAAK,IAAI,CAE3B,EAAgB,KAAK,IAAM,KAAK,GAAK,IAAI,MAGhD,OAAO,KAAK,GAAK,IAAM,KAAK,KAAK,KAAK,KAAK,CAAG,IAQlD,QAAS,CACP,MAAO,CACL,OAAQA,GACR,GAAI,KAAK,GACT,GAAI,KAAK,GACT,KAAM,KAAK,KACX,SAAU,KAAK,SACf,aAAc,KAAK,aACpB,CAgBH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAa,EAAK,GAAI,EAAK,GAAI,EAAK,KAAM,EAAK,SAAU,EAAK,aAAa,CAQxF,QAAQ,EAAS,CACf,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAW,GAAW,EAAQ,SAAW,EAAQ,SAAW,OAC5D,EAAO,KAAK,KACZ,EAAS,EAA8B,KAAM,EAAa,EAAU,EAAM,GAAM,CACpF,GAAI,EAAK,SAAW,EAAG,CAErB,IAAI,EAAQ,GAAiB,KAAM,EAAY,CAC3C,EAAU,EAAK,GAAG,OAAO,EAAQ,CASnC,OARE,EAAO,KACT,EAAU,iEAAmE,EAAU,kEAErF,IAAU,QAEL,gFAAuF,EAAO,KAAK,GAAG,CAAG,UAAY,EAGrH,EAAU,iFAAwF,EAAO,KAAK,GAAG,CAAG,kBAEpH,EAAK,SAAW,EAAG,CAE5B,IAAI,EAAM,EAAK,GAAG,OAAO,EAAQ,CAC7B,EAAM,EAAK,GAAG,OAAO,EAAQ,CAYjC,OAXI,EAAO,KAET,EAAM,iEAAmE,EAAM,kEAE7E,EAAO,KAET,EAAM,iEAAmE,EAAM,kEAE7E,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAM,yFAAgG,EAExG,EAAM,kFAAyF,EAAO,KAAK,GAAG,CAAG,UAAY,MAC/H,CACL,IAAI,EAAkB,EAAK,IAAI,SAAU,EAAK,EAAO,CAMnD,MALA,GAAM,EAAI,OAAO,EAAQ,CACrB,EAAO,KAET,EAAM,iEAAmE,EAAM,kEAE1E,GACP,CAQA,OAPE,EAAK,OAAS,IAAM,KAAK,eAAe,GAAK,oBAAsB,KAAK,eAAe,GAAK,yBAC1F,KAAK,UAAY,KAAK,eAAe,GAAK,yBAA2B,IAAa,OAC7E,EAAgB,KAAK,yFAA8F,CAErH,EAAgB,KAAK,kFAAyF,EAAO,KAAK,GAAG,CAAG,UAAU,CAG1I,+BAAiC,EAAO,KAAK,GAAG,CAAG,wEAA+E,EAAgB,KAAK,wCAAwC,CAAG,kEAU/M,OAAO,EAAS,CACd,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAW,GAAW,EAAQ,SAAW,EAAQ,SAAW,OAC5D,EAAO,KAAK,KACZ,EAAS,EAA8B,KAAM,EAAa,EAAU,EAAM,GAAK,CAC/E,EAAK,EAAe,KAAK,IAG7B,GAFA,EAAY,IAAO,OAAc,KAAK,GAAK,EAEvC,EAAK,SAAW,EAAG,CAErB,IAAI,EAAQ,GAAiB,KAAM,EAAY,CAC3C,EAAU,EAAK,GAAG,MAAM,EAAQ,CAapC,OAZI,EAAO,KACT,EAAU,UAAiB,aAEzB,IAAU,QAEL,EAAK,EAGL,EAAU,UAKV,EAAK,SAAW,EAAG,CAE5B,IAAI,EAAM,EAAK,GACX,EAAS,EAAI,MAAM,EAAQ,CAC3B,EAAO,KACT,EAAS,UAAiB,aAG5B,IAAI,EADM,EAAK,GACE,MAAM,EAAQ,CAC3B,EAAO,KACT,EAAS,UAAiB,aAI5B,IAAI,EACA,IAAgB,OACF,EAAI,eAAe,CAGnB,EAAI,YAAY,CAAC,eAAe,CAElD,OAAQ,KAAK,eAAe,CAA5B,CACE,IAAK,sBAEH,OAAO,EAAK,IAAM,EAAS,KAAY,EAAS,IAClD,IAAK,mBAGH,OAFA,EAAS,IAAM,EAAS,IACxB,EAAS,IAAM,EAAS,IAChB,EAAR,CACE,IAAK,kBACL,IAAK,sBACH,EAAS,UAAiB,YAE9B,MACF,IAAK,wBACH,GAAI,KAAK,UAAY,IAAa,OAChC,OAAO,EAAS,IAAM,EAG5B,OAAO,EAAS,EAAK,UACZ,EAAK,OAAS,IAAM,KAAK,eAAe,GAAK,oBAAsB,KAAK,eAAe,GAAK,yBAA0B,CAC/H,IAAI,EAAe,EAAK,IAAI,SAAU,EAAK,EAAO,CAKhD,MAJA,GAAM,EAAI,MAAM,EAAQ,CACpB,EAAO,KACT,EAAM,UAAiB,aAElB,GACP,CAIF,OAHI,KAAK,eAAe,GAAK,yBAA2B,KAAK,UAAY,IAAa,OAC7E,EAAa,KAAK,IAAI,CAExB,EAAa,KAAK,EAAG,MAK5B,MAAO,YAAc,KAAK,GAAK,WAAa,EAAK,IAAI,SAAU,EAAK,CAClE,OAAO,EAAI,MAAM,EAAQ,EACzB,CAAC,KAAK,IAAI,CAAG,WAQnB,eAAgB,CACd,OAAO,KAAK,KAAO,IAAM,KAAK,IAIlC,OADA,EAAgB,EAAc,OAAQA,GAAK,CACpC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCjnBEE,GAAO,kBAEA,GAAuC,EAAQA,GADvC,CAAC,OAAO,CACmD,GAAQ,CACpF,GAAI,CACF,QACE,EACJ,MAAM,UAAwB,CAAK,CAQjC,YAAY,EAAS,CAGnB,GAFA,OAAO,CAEH,CAAC,EAAO,EAAQ,CAClB,MAAU,UAAU,wCAAwC,CAE9D,KAAK,QAAU,EAEjB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,mBAAoB,CACtB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,OAAO,KAAK,QAAQ,SAAS,EAAM,EAAS,CAQ9C,YAAa,CACX,OAAO,KAAK,QAAQ,YAAY,CAOlC,QAAQ,EAAU,CAChB,EAAS,KAAK,QAAS,UAAW,KAAK,CASzC,IAAI,EAAU,CAEZ,OAAO,IAAI,EADG,EAAS,KAAK,QAAS,UAAW,KAAK,CAClB,CAOrC,OAAQ,CACN,OAAO,IAAI,EAAgB,KAAK,QAAQ,CAS1C,UAAU,EAAS,CAIjB,MAHI,CAAC,GAAW,GAAW,CAAC,EAAQ,aAAe,GAAW,EAAQ,cAAgB,OAC7E,IAAM,KAAK,QAAQ,SAAS,EAAQ,CAAG,IAEzC,KAAK,QAAQ,SAAS,EAAQ,CAOvC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,QAAS,KAAK,QACf,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAgB,EAAK,QAAQ,CAS1C,QAAQ,EAAS,CAIf,MAHI,CAAC,GAAW,GAAW,CAAC,EAAQ,aAAe,GAAW,EAAQ,cAAgB,OAC7E,iEAAmE,KAAK,QAAQ,OAAO,EAAQ,CAAG,iEAEpG,KAAK,QAAQ,OAAO,EAAQ,CASrC,OAAO,EAAS,CAId,MAHI,CAAC,GAAW,GAAW,CAAC,EAAQ,aAAe,GAAW,EAAQ,cAAgB,OAC7E,UAAiB,KAAK,QAAQ,MAAM,EAAQ,WAE9C,KAAK,QAAQ,MAAM,EAAQ,EAItC,OADA,EAAgB,EAAiB,OAAQA,GAAK,CACvC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCnJEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,OAAO,CAC6C,GAAQ,CAC9E,GAAI,CACF,QACE,EASJ,SAAS,EAA8B,EAAM,EAAa,EAAU,CAClE,IAAI,EAAa,EAAc,EAAM,EAAa,EAAS,CACvD,EAAS,EAAE,CACX,EAAkB,EAAc,EAAK,MAAO,EAAa,EAAS,CAEtE,GADA,EAAO,MAAQ,IAAoB,MAAQ,GAAmB,GAAc,IAAgB,MACxF,EAAK,KAAM,CACb,IAAI,EAAiB,EAAc,EAAK,KAAM,EAAa,EAAS,CACpE,EAAO,KAAO,IAAmB,MAAQ,GAAkB,GAAc,IAAgB,MAE3F,IAAI,EAAgB,EAAc,EAAK,IAAK,EAAa,EAAS,CAElE,MADA,GAAO,IAAM,IAAkB,MAAQ,GAAiB,GAAc,IAAgB,MAC/E,EAET,MAAM,UAAkB,CAAK,CAS3B,YAAY,EAAO,EAAK,EAAM,CAK5B,GAJA,OAAO,CAEH,CAAC,EAAO,EAAM,EACd,CAAC,EAAO,EAAI,EACZ,GAAQ,CAAC,EAAO,EAAK,CAAE,MAAU,UAAU,gBAAgB,CAC/D,GAAI,UAAU,OAAS,EAAG,MAAU,MAAM,qBAAqB,CAC/D,KAAK,MAAQ,EACb,KAAK,IAAM,EACX,KAAK,KAAO,GAAQ,KAEtB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,aAAc,CAChB,MAAO,GAQT,UAAW,CAKT,OAHiB,KAAK,OAAO,SAAU,EAAM,CAC3C,OAAO,EAAa,EAAK,EAAI,EAAK,OAAS,OAC3C,CACgB,OAAS,EAgB7B,SAAS,EAAM,EAAU,CACvB,IAAI,EAAQ,EAAK,MACb,EAAY,KAAK,MAAM,SAAS,EAAM,EAAS,CAC/C,EAAU,KAAK,IAAI,SAAS,EAAM,EAAS,CAC/C,GAAI,KAAK,KAAM,CACb,IAAI,EAAW,KAAK,KAAK,SAAS,EAAM,EAAS,CACjD,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,EAAM,EAAU,EAAO,EAAM,EAAQ,CAAE,EAAQ,EAAO,EAAM,EAAQ,CAAE,EAAS,EAAO,EAAM,EAAQ,CAAC,OAG9G,OAAO,SAAuB,EAAO,EAAM,EAAS,CAClD,OAAO,EAAM,EAAU,EAAO,EAAM,EAAQ,CAAE,EAAQ,EAAO,EAAM,EAAQ,CAAC,EASlF,QAAQ,EAAU,CAChB,EAAS,KAAK,MAAO,QAAS,KAAK,CACnC,EAAS,KAAK,IAAK,MAAO,KAAK,CAC3B,KAAK,MACP,EAAS,KAAK,KAAM,OAAQ,KAAK,CAUrC,IAAI,EAAU,CACZ,OAAO,IAAI,EAAU,KAAK,QAAQ,EAAS,KAAK,MAAO,QAAS,KAAK,CAAC,CAAE,KAAK,QAAQ,EAAS,KAAK,IAAK,MAAO,KAAK,CAAC,CAAE,KAAK,MAAQ,KAAK,QAAQ,EAAS,KAAK,KAAM,OAAQ,KAAK,CAAC,CAAC,CAOtL,OAAQ,CACN,OAAO,IAAI,EAAU,KAAK,MAAO,KAAK,IAAK,KAAK,MAAQ,KAAK,KAAK,CAQpE,UAAU,EAAS,CACjB,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAA8B,KAAM,EAAa,GAAW,EAAQ,SAAS,CAGtF,EACA,EAAQ,KAAK,MAAM,SAAS,EAAQ,CAKxC,GAJI,EAAO,QACT,EAAQ,IAAM,EAAQ,KAExB,EAAM,EACF,KAAK,KAAM,CACb,IAAI,EAAO,KAAK,KAAK,SAAS,EAAQ,CAClC,EAAO,OACT,EAAO,IAAM,EAAO,KAEtB,GAAO,IAAM,EAEf,IAAI,EAAM,KAAK,IAAI,SAAS,EAAQ,CAKpC,OAJI,EAAO,MACT,EAAM,IAAM,EAAM,KAEpB,GAAO,IAAM,EACN,EAOT,QAAS,CACP,MAAO,CACL,OAAQA,GACR,MAAO,KAAK,MACZ,IAAK,KAAK,IACV,KAAM,KAAK,KACZ,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAU,EAAK,MAAO,EAAK,IAAK,EAAK,KAAK,CAQvD,QAAQ,EAAS,CACf,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAA8B,KAAM,EAAa,GAAW,EAAQ,SAAS,CAGtF,EACA,EAAQ,KAAK,MAAM,OAAO,EAAQ,CAKtC,GAJI,EAAO,QACT,EAAQ,iEAAmE,EAAQ,kEAErF,EAAM,EACF,KAAK,KAAM,CACb,IAAI,EAAO,KAAK,KAAK,OAAO,EAAQ,CAChC,EAAO,OACT,EAAO,iEAAmE,EAAO,kEAEnF,GAAO,2DAA6D,EAEtE,IAAI,EAAM,KAAK,IAAI,OAAO,EAAQ,CAKlC,OAJI,EAAO,MACT,EAAM,iEAAmE,EAAM,kEAEjF,GAAO,2DAA6D,EAC7D,EAQT,OAAO,EAAS,CACd,IAAI,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAS,EAA8B,KAAM,EAAa,GAAW,EAAQ,SAAS,CACtF,EAAM,KAAK,MAAM,MAAM,EAAQ,CAInC,GAHI,EAAO,QACT,EAAM,UAAiB,aAErB,KAAK,KAAM,CACb,IAAI,EAAO,KAAK,KAAK,MAAM,EAAQ,CAC/B,EAAO,OACT,EAAO,UAAiB,aAE1B,GAAO,IAAM,EAEf,IAAI,EAAM,KAAK,IAAI,MAAM,EAAQ,CAKjC,OAJI,EAAO,MACT,EAAM,UAAiB,aAEzB,GAAO,IAAM,EACN,GAIX,OADA,EAAgB,EAAW,OAAQA,GAAK,CACjC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCnPEE,GAAO,iBAEA,GAAsC,EAAQA,GADtC,CAAC,OAAO,CACkD,GAAQ,CACnF,GAAI,CACF,QACE,EACA,EAAc,CAChB,MAAO,KACP,QAAS,KACT,QAAS,IACT,OAAQ,IACR,UAAW,KACX,SAAU,KACX,CACD,MAAM,UAAuB,CAAK,CAYhC,YAAY,EAAc,EAAQ,CAEhC,GADA,OAAO,CACH,CAAC,MAAM,QAAQ,EAAa,CAC9B,MAAU,UAAU,0CAA0C,CAEhE,GAAI,CAAC,MAAM,QAAQ,EAAO,CACxB,MAAU,UAAU,oCAAoC,CAE1D,GAAI,EAAa,SAAW,EAAO,OAAS,EAC1C,MAAU,UAAU,qFAA0F,CAEhH,KAAK,aAAe,EACpB,KAAK,OAAS,EAEhB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,kBAAmB,CACrB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAIE,EAAO,KACP,EAAW,KAAK,OAAO,IAAI,GAAK,EAAE,SAAS,EAAM,EAAS,CAAC,CAC/D,OAAO,SAA4B,EAAO,EAAM,EAAS,CAGvD,IAAK,IAFD,EACA,EAAU,EAAS,GAAG,EAAO,EAAM,EAAQ,CACtC,EAAI,EAAG,EAAIA,EAAK,aAAa,OAAQ,IAI5C,GAHA,EAAU,EACV,EAAU,EAAS,EAAI,GAAG,EAAO,EAAM,EAAQ,CAE3C,CADS,EAAgB,EAAMA,EAAK,aAAa,GAAG,CAC5C,EAAS,EAAQ,CAC3B,MAAO,GAGX,MAAO,IAQX,QAAQ,EAAU,CAChB,KAAK,OAAO,SAAS,EAAG,IAAM,EAAS,EAAG,UAAY,EAAI,IAAK,KAAK,CAAE,KAAK,CAS7E,IAAI,EAAU,CACZ,OAAO,IAAI,EAAe,KAAK,aAAa,OAAO,CAAE,KAAK,OAAO,KAAK,EAAG,IAAM,KAAK,QAAQ,EAAS,EAAG,UAAY,EAAI,IAAK,KAAK,CAAC,CAAE,KAAK,CAAC,CAO7I,OAAQ,CACN,OAAO,IAAI,EAAe,KAAK,aAAc,KAAK,OAAO,CAQ3D,UAAU,EAAS,CAQjB,IAAK,IAPD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAC1E,EAAe,KAAK,OAAO,IAAI,SAAU,EAAG,EAAO,CACrD,IAAI,EAAkB,EAAc,EAAG,EAAa,GAAW,EAAQ,SAAS,CAChF,OAAO,IAAgB,OAAS,IAAoB,MAAQ,GAAmB,EAAa,IAAM,EAAE,SAAS,EAAQ,CAAG,IAAM,EAAE,SAAS,EAAQ,EACjJ,CACE,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,KAAK,aAAa,OAAQ,IAC5C,GAAO,IAAM,EAAY,KAAK,aAAa,IAC3C,GAAO,IAAM,EAAa,EAAI,GAEhC,OAAO,EAOT,QAAS,CACP,MAAO,CACL,OAAQF,GACR,aAAc,KAAK,aACnB,OAAQ,KAAK,OACd,CAWH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAe,EAAK,aAAc,EAAK,OAAO,CAQ3D,QAAQ,EAAS,CAQf,IAAK,IAPD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAC1E,EAAe,KAAK,OAAO,IAAI,SAAU,EAAG,EAAO,CACrD,IAAI,EAAkB,EAAc,EAAG,EAAa,GAAW,EAAQ,SAAS,CAChF,OAAO,IAAgB,OAAS,IAAoB,MAAQ,GAAmB,EAAa,iEAAmE,EAAE,OAAO,EAAQ,CAAG,iEAAmE,EAAE,OAAO,EAAQ,EACvQ,CACE,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,KAAK,aAAa,OAAQ,IAC5C,GAAO,kFAAyF,EAAO,EAAY,KAAK,aAAa,IAAI,CAAG,UAAY,EAAa,EAAI,GAE3K,OAAO,EAQT,OAAO,EAAS,CAQd,IAAK,IAPD,EAAc,GAAW,EAAQ,YAAc,EAAQ,YAAc,OACrE,EAAa,EAAc,KAAM,EAAa,GAAW,EAAQ,SAAS,CAC1E,EAAe,KAAK,OAAO,IAAI,SAAU,EAAG,EAAO,CACrD,IAAI,EAAkB,EAAc,EAAG,EAAa,GAAW,EAAQ,SAAS,CAChF,OAAO,IAAgB,OAAS,IAAoB,MAAQ,GAAmB,EAAa,UAAY,EAAE,MAAM,EAAQ,CAAG,UAAY,EAAE,MAAM,EAAQ,EACvJ,CACE,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,KAAK,aAAa,OAAQ,IAC5C,GAAO,EAAe,KAAK,aAAa,IAAM,EAAa,EAAI,GAEjE,OAAO,GAIX,OADA,EAAgB,EAAgB,OAAQA,GAAK,CACtC,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CC/LS,GAAkC,EAFlC,aACQ,CAAC,OAAQ,QAAS,OAAO,CAC6B,GAAQ,CAC/E,GAAI,CACF,OACA,OACA,QACE,EAMJ,SAAS,EAAgB,EAAM,CAC7B,OAAO,EAAO,EAAK,gBAAgBG,EAAK,CAAG,GAE7C,MAAM,UAAmB,CAAK,CAQ5B,YAAY,EAAM,CAGhB,GAFA,OAAO,CAEH,OAAOA,GAAS,SAClB,MAAU,UAAU,uCAAuC,CAE7D,KAAK,KAAOA,EAEd,IAAI,MAAO,CACT,MAAO,aAET,IAAI,cAAe,CACjB,MAAO,GAgBT,SAAS,EAAM,EAAU,CACvB,IAAIA,EAAO,KAAK,KAChB,GAAI,EAASA,KAAU,GAIrB,OAAO,SAAU,EAAO,EAAM,EAAS,CACrC,OAAO,EAAgB,EAAMA,EAAK,KAE3BA,KAAQE,EACjB,OAAO,SAAU,EAAO,EAAM,EAAS,CACrC,OAAO,EAAM,IAAIF,EAAK,CAAG,EAAM,IAAIA,EAAK,CAAG,EAAgBE,EAAMF,EAAK,EAGxE,IAAIG,EAAS,EAAgBH,EAAK,CAClC,OAAO,SAAU,EAAO,EAAM,EAAS,CACrC,OAAO,EAAM,IAAIA,EAAK,CAAG,EAAM,IAAIA,EAAK,CAAGG,EAAS,IAAI,EAAK,KAAMH,EAAK,CAAG,EAAW,kBAAkBA,EAAK,EASnH,QAAQ,EAAU,EAUlB,IAAI,EAAU,CACZ,OAAO,KAAK,OAAO,CAOrB,OAAO,kBAAkB,EAAM,CAC7B,MAAU,MAAM,oBAAsBA,EAAK,CAO7C,OAAQ,CACN,OAAO,IAAI,EAAW,KAAK,KAAK,CASlC,UAAU,EAAS,CACjB,OAAO,KAAK,KASd,QAAQ,EAAS,CACf,IAAIA,EAAO,EAAO,KAAK,KAAK,CAc5B,OAbIA,IAAS,QAAUA,IAAS,QACvB,0CAA4CA,EAAO,UACjDA,IAAS,IACX,mDAAqDA,EAAO,UAC1DA,IAAS,WACX,kDAAoDA,EAAO,UACzDA,IAAS,MACX,6CAA+CA,EAAO,UACpDA,IAAS,OACX,8CAAgDA,EAAO,UACrDA,IAAS,YACX,mDAAqDA,EAAO,UAE9D,6BAA+BA,EAAO,UAO/C,QAAS,CACP,MAAO,CACL,OAAQ,aACR,KAAM,KAAK,KACZ,CAUH,OAAO,SAAS,EAAM,CACpB,OAAO,IAAI,EAAW,EAAK,KAAK,CASlC,OAAO,EAAS,CACd,IAAIG,EAAS,GACF,EAAK,KAAK,QAAU,QAAe,EAAgB,KAAK,KAAK,GACtE,EAAS,IAEX,IAAI,EAAS,GAAS,KAAK,KAAMA,EAAO,CAOxC,OANI,EAAO,KAAO,KAET,EAIF,IAAM,GAGjB,OAAO,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCxLEC,GAAO,eAEA,GAAoC,EAAQA,GADpC,CAAC,OAAQ,OAAQ,aAAa,CAC0B,GAAQ,CACjF,IAAI,EACA,CACF,OACA,OACA,cACE,EAEA,EAAQ,GAAU,GAAO,EAAQ,CACnC,SAAU,GACX,CAAC,CAUF,SAAS,EAAe,EAAU,EAAM,EAAS,CAQ/C,IAPA,IAAI,EAAQ,GAIR,EAAQ,qDACR,EAAW,EACX,GACI,EAAQ,EAAM,KAAK,EAAS,IAAM,MAKxC,GAFA,GAAS,EAAS,UAAU,EAAU,EAAM,MAAM,CAClD,EAAW,EAAM,MACb,EAAM,KAAO,KAEf,GAAS,IACT,QACK,CAEL,GAAY,EAAM,GAAG,OACrB,IAAI,EAAW,EAAK,EAAM,IAC1B,GAAI,CAAC,EACH,MAAU,eAAe,sBAAwB,EAAM,GAAK,mBAAmB,CAEjF,GAAI,EAAM,KAAO,IAAA,GAEf,OAAQ,OAAO,EAAf,CACE,IAAK,SACH,GAAS,EACT,MACF,IAAK,SACH,GAAI,EAAO,EAAS,CAClB,GAAS,EAAS,MAAM,EAAQ,SACvB,MAAM,QAAQ,EAAS,CAEhC,GAAS,EAAS,IAAI,SAAU,EAAK,EAAO,CAC1C,GAAI,EAAO,EAAI,CACb,OAAO,EAAI,MAAM,EAAQ,CAE3B,MAAU,UAAU,aAAe,EAAM,GAAK,IAAM,EAAQ,mBAAmB,EAC/E,CAAC,KAAK,IAAI,MAEZ,MAAU,UAAU,aAAe,EAAM,GAAK,8CAA8C,CAE9F,MACF,QACE,MAAU,UAAU,aAAe,EAAM,GAAK,8CAA8C,SAI5F,EAAO,EAAS,EAAM,KAAO,EAAS,EAAM,IAAI,CAClD,GAAS,EAAS,EAAM,IAAI,MAAM,EAAQ,MAE1C,MAAU,UAAU,aAAe,EAAM,GAAK,IAAM,EAAM,GAAK,mBAAmB,CAO1F,MAFA,IAAS,EAAS,MAAM,EAAS,CAE1B,EAET,MAAM,UAAqB,CAAK,CAU9B,YAAY,EAAI,EAAM,EAAU,CAO9B,GANA,OAAO,CACH,OAAO,GAAO,WAChB,EAAK,IAAI,EAAW,EAAG,EAIrB,CAAC,EAAO,EAAG,CAAE,MAAU,UAAU,kCAAkC,CACvE,GAAI,CAAC,MAAM,QAAQ,EAAK,EAAI,CAAC,EAAK,MAAM,EAAO,CAC7C,MAAU,UAAU,uDAAuD,CAE7E,IAAI,EAAe,OAAO,EAC1B,GAAI,EAAE,IAAiB,aAAe,IAAiB,WACrD,MAAU,UAAU,+CAA+C,CAErE,KAAK,GAAK,EACV,KAAK,KAAO,GAAQ,EAAE,CACtB,KAAK,SAAW,CAAC,CAAC,EAIpB,IAAI,MAAO,CACT,OAAO,KAAK,GAAG,MAAQ,GAEzB,IAAI,MAAO,CACT,OAAOA,GAET,IAAI,gBAAiB,CACnB,MAAO,GAgBT,SAAS,EAAM,EAAU,CAEvB,IAAI,EAAW,KAAK,KAAK,IAAI,GAAO,EAAI,SAASE,EAAM,EAAS,CAAC,CAC7D,EAAuB,KAAK,UAAY,EAAe,KAAK,GAAG,EAAI,KAAK,GAAG,iBAC/E,GAAI,EAAa,KAAK,GAAG,CAAE,CACzB,IAAI,EAAQ,KAAK,GAAG,KACpB,GAAK,EAAS,GAkEP,CAEL,IAAI,EAAW,KAAK,KACpB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIC,EAAK,EAAgB,EAAM,EAAM,CACjC,QAAwBA,IAAO,IAAA,IACnC,IAAI,OAAOA,GAAO,WAChB,MAAU,UAAU,aAAoB,oCAAkD,EAAMA,EAAG,GAAE,CAEvG,GAAIA,EAAG,QAEL,OAAOA,EAAG,EAAUD,EAAM,GAAe,EAAO,EAAK,CAAC,CAEtD,IAAI,EAAS,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CACnE,OAAOC,EAAG,MAAMA,EAAI,EAAO,OAhFX,CAGpB,IAAI,EAAK,KAASD,EAAO,EAAgBA,EAAM,EAAM,CAAG,IAAA,GACpD,EAAQ,OAAO,GAAO,YAAc,EAAG,UAAY,GACnD,EAAY,GAAS,CACvB,IAAI,EACJ,GAAI,EAAM,IAAI,EAAM,CAClB,EAAQ,EAAM,IAAI,EAAM,SACf,KAASA,EAClB,EAAQ,EAAgBA,EAAM,EAAM,SAC3B,EAAsB,EAAQ,IAAA,QAAe,OAAO,EAAa,oBAAoB,EAAM,CACtG,GAAI,OAAO,GAAU,YAAc,GAAwB,IAAU,IAAA,GACnE,OAAO,EAET,MAAU,UAAU,IAAW;IAAwD,EAAM,EAAM,GAAE,EAEvG,GAAI,EAAO,CAGT,IAAI,EAAU,KAAK,KACnB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIC,EAAK,EAAU,EAAM,CAQvB,OALEA,EAAG,UAAY,GACVA,EAAG,EAASD,EAAM,GAAe,EAAO,EAAK,CAAC,CAI9CC,EAAG,GADG,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CAC/C,OAKxB,OAAQ,EAAS,OAAjB,CACE,IAAK,GACH,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IACnC,OAAOA,GAAI,EAEf,IAAK,GACH,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IACnC,KAAI,EAAW,EAAS,GACxB,OAAOA,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAC,GAE7C,IAAK,GACH,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IACnC,KAAI,EAAW,EAAS,GACpB,EAAW,EAAS,GACxB,OAAOA,EAAG,EAAS,EAAO,EAAM,EAAQ,CAAE,EAAS,EAAO,EAAM,EAAQ,CAAC,GAE7E,QACE,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIA,EAAK,EAAU,EAAM,CACrB,QAAwBA,IAAO,IAAA,IAEnC,OAAOA,EAAG,GADG,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CAC/C,YAsBrB,EAAe,KAAK,GAAG,EAAI,EAAY,KAAK,GAAG,MAAM,EAAI,KAAK,GAAG,MAAM,kBAAkB,CAAE,CAIpG,IAAI,EAAa,KAAK,GAAG,OAAO,SAASD,EAAM,EAAS,CACpD,EAAO,KAAK,GAAG,MAAM,mBAAmB,CACxC,EAAY,KAAK,KACrB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAI,EAAS,EAAW,EAAO,EAAM,EAAQ,CAGzC,SAAyB,GAAU,MAAQ,EAAO,KAAU,IAAA,KAGhE,KAAIC,EAAK,EAAc,EAAQ,EAAK,CACpC,GAAIA,GAAO,MAAyBA,EAAG,QAErC,OAAOA,EAAG,EAAWD,EAAM,GAAe,EAAO,EAAK,CAAC,CAGvD,IAAI,EAAS,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CACnE,OAAOC,EAAG,MAAM,EAAQ,EAAO,OAG9B,CAIL,IAAI,EAAS,KAAK,GAAG,UAAU,CAC3B,EAAS,KAAK,GAAG,SAASD,EAAM,EAAS,CACzC,EAAY,KAAK,KACrB,OAAO,SAA0B,EAAO,EAAM,EAAS,CACrD,IAAIC,EAAK,EAAO,EAAO,EAAM,EAAQ,CACjC,QAAwBA,IAAO,IAAA,IACnC,IAAI,OAAOA,GAAO,WAChB,MAAU,UAAU,eAAsB;IAAuE,EAAMA,EAAG,GAAE,CAE9H,GAAIA,EAAG,QAEL,OAAOA,EAAG,EAAWD,EAAM,GAAe,EAAO,EAAK,CAAC,CAGvD,IAAI,EAAS,EAAS,IAAI,GAAW,EAAQ,EAAO,EAAM,EAAQ,CAAC,CACnE,OAAOC,EAAG,MAAMA,EAAI,EAAO,IAUnC,QAAQ,EAAU,CAChB,EAAS,KAAK,GAAI,KAAM,KAAK,CAC7B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAUnD,IAAI,EAAU,CAGZ,IAAK,IAFD,EAAK,KAAK,QAAQ,EAAS,KAAK,GAAI,KAAM,KAAK,CAAC,CAChD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,EAAK,GAAK,KAAK,QAAQ,EAAS,KAAK,KAAK,GAAI,QAAU,EAAI,IAAK,KAAK,CAAC,CAEzE,OAAO,IAAI,EAAa,EAAI,EAAK,CAOnC,OAAQ,CACN,OAAO,IAAI,EAAa,KAAK,GAAI,KAAK,KAAK,MAAM,EAAE,CAAC,CAoBtD,SAAS,EAAS,CAChB,IAAI,EACAH,EAAO,KAAK,GAAG,SAAS,EAAQ,CAUpC,OATI,GAAW,OAAO,EAAQ,SAAY,UAAY,EAAe,EAAQ,QAASA,EAAK,GAEzF,EAAe,EAAQ,QAAQA,GAAM,KAAM,EAAQ,EAE1C,IAAiB,OAKrB,MAAM,SAAS,EAAQ,CAJrB,EAYX,UAAU,EAAS,CACjB,IAAI,EAAO,KAAK,KAAK,IAAI,SAAU,EAAK,CACtC,OAAO,EAAI,SAAS,EAAQ,EAC5B,CAIF,OAHS,GAAyB,KAAK,GAAG,CAAG,IAAM,KAAK,GAAG,SAAS,EAAQ,CAAG,IAAM,KAAK,GAAG,SAAS,EAAQ,EAGlG,IAAM,EAAK,KAAK,KAAK,CAAG,IAOtC,QAAS,CACP,MAAO,CACL,OAAQA,GACR,GAAI,KAAK,GACT,KAAM,KAAK,KACZ,CAgBH,QAAQ,EAAS,CACf,IAAI,EAAO,KAAK,KAAK,IAAI,SAAU,EAAK,CACtC,OAAO,EAAI,OAAO,EAAQ,EAC1B,CAGF,MAAO,+BAAiC,EAAO,KAAK,GAAG,CAAG,wEAA0E,EAAK,KAAK,wCAAwC,CAAG,iEAc3L,MAAM,EAAS,CACb,IAAI,EAUJ,OATI,GAAW,OAAO,EAAQ,SAAY,UAAY,EAAe,EAAQ,QAAS,KAAK,KAAK,GAE9F,EAAY,EAAQ,QAAQ,KAAK,MAAM,KAAM,EAAQ,EAE5C,IAAc,OAKlB,MAAM,MAAM,EAAQ,CAJlB,EAYX,OAAO,EAAS,CACd,IAAI,EAAO,KAAK,KAAK,IAAI,SAAU,EAAK,CAEtC,OAAO,EAAI,MAAM,EAAQ,EACzB,CACE,EACA,GAAe,KAAK,QACtB,EAAiB,GAAe,KAAK,OAInC,EAAK,KAAK,QAAU,OAAO,EAAK,KAAK,MAAM,OAAU,YAAc,OAAO,EAAK,KAAK,MAAM,OAAU,UAAY,OAAO,EAAK,KAAK,MAAM,OAAU,YAEnJ,EAAiB,EAAK,KAAK,MAAM,OAEnC,IAAI,EACJ,OAAQ,OAAO,EAAf,CACE,IAAK,WAEH,EAAc,EAAe,KAAM,EAAQ,CAC3C,MACF,IAAK,SAEH,EAAc,EAAe,EAAgB,KAAM,EAAQ,CAC3D,MACF,IAAK,SAGH,OAAQ,OAAO,EAAe,EAAK,QAAnC,CACE,IAAK,WACH,EAAc,EAAe,EAAK,QAAQ,KAAM,EAAQ,CACxD,MACF,IAAK,SACH,EAAc,EAAe,EAAe,EAAK,QAAS,KAAM,EAAQ,CACxE,OAMR,OAHW,IAAgB,OAGpB,EAAe,GAAiB,KAAM,EAAQ,CAF5C,EASX,eAAgB,CACd,OAAO,KAAK,KAAO,IAAM,KAAK,MAWlC,MARA,GAAgB,EAChB,EAAgB,EAAc,OAAQA,GAAK,CAC3C,EAAgB,EAAc,sBAAuB,SAAU,EAAM,CACnE,MAAU,MAAM,sBAAwBA,EAAK,EAC7C,CACF,EAAgB,EAAc,WAAY,SAAU,EAAM,CACxD,OAAO,IAAI,EAAc,EAAK,GAAI,EAAK,KAAK,EAC5C,CACK,GACN,CACD,QAAS,GACT,OAAQ,GACT,CAAC,CCveEI,GAAO,QAEA,GAA6B,EAAQA,GAD7B,CAAC,QAAS,UAAW,SAAU,eAAgB,YAAa,iBAAkB,YAAa,kBAAmB,eAAgB,yBAA0B,eAAgB,YAAa,aAAc,eAAgB,kBAAmB,YAAa,iBAAkB,aAAa,CACjO,GAAQ,CAC1E,GAAI,CACF,QACA,UACA,SACA,eACA,YACA,iBACA,YACA,kBACA,eACA,yBACA,eACA,YACA,aACA,eACA,kBACA,YACA,iBACA,cACE,EAyCA,EAAQ,EAAMA,GAAM,CACtB,OAAQ,SAAgB,EAAY,CAClC,OAAO,GAAW,EAAY,EAAE,CAAC,EAEnC,iBAAkB,SAAuB,EAAa,CACpD,OAAO,EAAc,EAAa,EAAE,CAAC,EAEvC,iBAAkB,SAAuB,EAAY,EAAS,CAE5D,OAAO,GAAW,EADD,EAAQ,QAAU,IAAA,GAA4B,EAAE,CAAlB,EAAQ,MACd,EAE3C,yBAA0B,EAC3B,CAAC,CACF,SAAS,EAAc,EAAa,CAClC,IAAI,EAAU,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,EAAE,CAChF,EAAa,EAAQ,QAAU,IAAA,GAA4B,EAAE,CAAlB,EAAQ,MAGvD,OAAO,GAAQ,EAAa,SAAU,EAAM,CAC1C,GAAI,OAAO,GAAS,SAAU,MAAU,UAAU,kBAAkB,CACpE,OAAO,GAAW,EAAM,EAAW,EACnC,CAIJ,IAAI,EAAY,CACd,KAAM,EACN,UAAW,EACX,OAAQ,EACR,OAAQ,EACR,QAAS,EACV,CAGG,GAAa,CACf,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,IAAK,GACL,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,KAAM,GACN,KAAM,GACN,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,KAAM,GACN,KAAM,GACN,MAAO,GACR,CAGG,GAAmB,CACrB,IAAK,GACL,GAAI,GACJ,GAAI,GACJ,IAAK,GACL,IAAK,GACL,GAAI,GACJ,IAAK,GACN,CACG,GAAY,CACd,KAAM,GACN,MAAO,GACP,KAAM,KACN,UAAA,IAAA,GACD,CACG,EAAoB,CAAC,MAAO,WAAW,CACvC,EAAoB,CACtB,IAAK,IACL,IAAK,IACL,KAAM,KACN,IAAK,IACL,EAAG,KACH,EAAG,KACH,EAAG;EACH,EAAG,KACH,EAAG,IAEJ,CACD,SAAS,IAAe,CACtB,MAAO,CACL,WAAY,EAAE,CAEd,WAAY,GAEZ,QAAS,GAET,MAAO,EAEP,MAAO,GAEP,UAAW,EAAU,KAErB,aAAc,EAEd,iBAAkB,KACnB,CAWH,SAAS,EAAc,EAAO,EAAQ,CACpC,OAAO,EAAM,WAAW,OAAO,EAAM,MAAO,EAAO,CAUrD,SAAS,EAAiB,EAAO,CAC/B,OAAO,EAAc,EAAO,EAAE,CAShC,SAAS,EAAK,EAAO,CACnB,EAAM,QAQR,SAAS,EAAc,EAAO,CAC5B,OAAO,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAQjD,SAAS,EAAc,EAAO,CAC5B,OAAO,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAQjD,SAAS,EAAS,EAAO,CAMvB,IALA,EAAM,UAAY,EAAU,KAC5B,EAAM,MAAQ,GACd,EAAM,QAAU,KAGH,CAEX,GAAI,EAAiB,EAAM,GAAK,IAC9B,KAAO,EAAiB,EAAM,GAAK;GAAQ,EAAiB,EAAM,GAAK,IACrE,EAAM,SAAW,EAAiB,EAAM,CACxC,EAAK,EAAM,CAIf,GAAI,EAAM,aAAa,EAAiB,EAAM,CAAE,EAAM,aAAa,CACjE,EAAK,EAAM,MAEX,MAKJ,GAAI,EAAiB,EAAM,GAAK,GAAI,CAElC,EAAM,UAAY,EAAU,UAC5B,OAIF,GAAI,EAAiB,EAAM,GAAK;GAAQ,CAAC,EAAM,aAAc,CAC3D,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EAAiB,EAAM,CACrC,EAAK,EAAM,CACX,OAEF,IAAI,EAAK,EAAiB,EAAM,CAC5B,EAAK,EAAc,EAAO,EAAE,CAC5B,EAAK,EAAc,EAAO,EAAE,CAChC,GAAI,EAAG,SAAW,GAAK,GAAW,GAAK,CACrC,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EACd,EAAK,EAAM,CACX,EAAK,EAAM,CACX,EAAK,EAAM,CACX,OAMF,GAAI,EAAG,SAAW,GAAK,GAAW,KAAQ,IAAO,MAAQ,CAAC,EAAM,QAAQ,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAAC,EAAG,CAClH,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EACd,EAAK,EAAM,CACX,EAAK,EAAM,CACX,OAIF,GAAI,GAAW,GAAK,CAClB,EAAM,UAAY,EAAU,UAC5B,EAAM,MAAQ,EACd,EAAK,EAAM,CACX,OAIF,GAAI,EAAM,WAAW,EAAG,CAAE,CACxB,EAAM,UAAY,EAAU,OAG5B,IAAI,EAAK,EAAc,EAAO,EAAE,CAChC,GAAI,IAAO,MAAQ,IAAO,MAAQ,IAAO,KAAM,CAK7C,IAJA,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CACX,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CACJ,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,EAAI,EAAM,QAAQ,EAAiB,EAAM,CAAC,EACjI,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAEb,GAAI,EAAiB,EAAM,GAAK,IAK9B,IAHA,EAAM,OAAS,IACf,EAAK,EAAM,CAEJ,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,EAAI,EAAM,QAAQ,EAAiB,EAAM,CAAC,EACjI,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,SAEJ,EAAiB,EAAM,GAAK,IAKrC,IAHA,EAAM,OAAS,IACf,EAAK,EAAM,CAEJ,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAGf,OAIF,GAAI,EAAiB,EAAM,GAAK,IAG9B,IAFA,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CACP,CAAC,EAAM,QAAQ,EAAiB,EAAM,CAAC,CAAE,CAE3C,EAAM,UAAY,EAAU,UAC5B,YAEG,CACL,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAET,EAAM,cAAc,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAC,GACpE,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,EAGf,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAGb,GAAI,EAAiB,EAAM,GAAK,KAAO,EAAiB,EAAM,GAAK,QAC7D,EAAM,QAAQ,EAAc,EAAM,CAAC,EAAI,EAAc,EAAM,GAAK,KAAO,EAAc,EAAM,GAAK,IAAK,CAQvG,GAPA,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,EACP,EAAiB,EAAM,GAAK,KAAO,EAAiB,EAAM,GAAK,OACjE,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,EAGT,CAAC,EAAM,QAAQ,EAAiB,EAAM,CAAC,CACzC,MAAM,EAAkB,EAAO,wBAA0B,EAAiB,EAAM,CAAG,IAAI,CAEzF,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAC,EAC3C,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAEb,GAAI,EAAM,cAAc,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAC,CACpE,MAAM,EAAkB,EAAO,wBAA0B,EAAiB,EAAM,CAAG,IAAI,SAEhF,EAAM,cAAc,EAAc,EAAM,CAAE,EAAM,WAAW,OAAO,EAAM,MAAQ,EAAE,CAAC,CAE5F,MADA,EAAK,EAAM,CACL,EAAkB,EAAO,wBAA0B,EAAiB,EAAM,CAAG,IAAI,CAG3F,OAIF,GAAI,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,CAAE,CACtF,KAAO,EAAM,QAAQ,EAAiB,EAAM,CAAE,EAAc,EAAM,CAAE,EAAc,EAAM,CAAC,EAAI,EAAM,QAAQ,EAAiB,EAAM,CAAC,EACjI,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAET,EAAe,GAAkB,EAAM,MAAM,CAC/C,EAAM,UAAY,EAAU,UAE5B,EAAM,UAAY,EAAU,OAE9B,OAKF,IADA,EAAM,UAAY,EAAU,QACrB,EAAiB,EAAM,GAAK,IACjC,EAAM,OAAS,EAAiB,EAAM,CACtC,EAAK,EAAM,CAEb,MAAM,EAAkB,EAAO,yBAA2B,EAAM,MAAQ,IAAI,CAM9E,SAAS,EAAoB,EAAO,CAClC,GACE,EAAS,EAAM,OACR,EAAM,QAAU;GAO3B,SAAS,GAAW,EAAO,CACzB,EAAM,eAOR,SAAS,EAAY,EAAO,CAC1B,EAAM,eAqBR,EAAM,QAAU,SAAiB,EAAG,EAAO,EAAO,CAChD,OAAO,EAAM,oBAAoB,EAAE,EAAI,EAAM,kBAAkB,EAAG,EAAM,EAAI,EAAM,kBAAkB,EAAO,EAAE,EAQ/G,EAAM,oBAAsB,SAA6B,EAAG,CAC1D,MAAO,sDAAsD,KAAK,EAAE,EAkBtE,EAAM,kBAAoB,SAA2B,EAAM,EAAK,CAC9D,MAAO,aAAa,KAAK,EAAK,EAAI,oBAAoB,KAAK,EAAI,EAAI,2KAA2K,KAAK,EAAI,EASzP,EAAM,aAAe,SAAsB,EAAG,EAAc,CAE1D,OAAO,IAAM,KAAO,IAAM,KAAQ,IAAM,QAAY,IAAM;GAAQ,EAAe,GAUnF,EAAM,cAAgB,SAAuB,EAAG,EAAO,CACrD,OAAO,IAAM,KAAO,IAAU,KAAO,IAAU,KAAO,IAAU,KAQlE,EAAM,WAAa,SAAoB,EAAG,CACxC,OAAO,GAAK,KAAO,GAAK,KAAO,IAAM,KAQvC,EAAM,QAAU,SAAiB,EAAG,CAClC,OAAO,GAAK,KAAO,GAAK,KAQ1B,SAAS,GAAW,EAAY,EAAY,CAC1C,IAAI,EAAQ,IAAc,CAC1B,EAAS,EAAO,CACd,aACA,aACD,CAAC,CACF,EAAS,EAAM,CACf,IAAI,EAAO,GAAW,EAAM,CAI5B,GAAI,EAAM,QAAU,GAOhB,MANE,EAAM,YAAc,EAAU,UAI1B,GAAY,EAAO,uBAAyB,EAAM,MAAM,CAExD,EAAkB,EAAO,oBAAsB,EAAM,MAAQ,IAAI,CAG3E,OAAO,EAUT,SAAS,GAAW,EAAO,CACzB,IAAI,EACA,EAAS,EAAE,CACX,EASJ,IARI,EAAM,QAAU,IAAM,EAAM,QAAU;GAAQ,EAAM,QAAU,MAChE,EAAO,EAAgB,EAAM,CACzB,EAAM,UACR,EAAK,QAAU,EAAM,UAKlB,EAAM,QAAU;GAAQ,EAAM,QAAU,KAEzC,EAAO,SAAW,GAAK,IACzB,EAAU,EAAM,QAAU,IAC1B,EAAO,KAAK,CACV,OACA,UACD,CAAC,EAEJ,EAAS,EAAM,CACX,EAAM,QAAU;GAAQ,EAAM,QAAU,KAAO,EAAM,QAAU,KACjE,EAAO,EAAgB,EAAM,CACzB,EAAM,UACR,EAAK,QAAU,EAAM,SAEvB,EAAU,EAAM,QAAU,IAC1B,EAAO,KAAK,CACV,OACA,UACD,CAAC,EAYJ,OATE,EAAO,OAAS,EACX,IAAI,EAAU,EAAO,EAEvB,IACH,EAAO,IAAI,EAAa,IAAA,GAAU,CAC9B,EAAM,UACR,EAAK,QAAU,EAAM,UAGlB,GAYX,SAAS,EAAgB,EAAO,CAC9B,IAAIA,EAAM,EAAM,EAAO,EACnB,EAAO,GAAiB,EAAM,CAClC,GAAI,EAAM,QAAU,IAAK,CACvB,GAAI,EAAa,EAAK,CAKpB,MAHA,GAAO,EAAK,KACZ,EAAoB,EAAM,CAC1B,EAAQ,EAAgB,EAAM,CACvB,IAAI,EAAe,IAAI,EAAWA,EAAK,CAAE,EAAM,IAC7C,EAAe,EAAK,CAAE,CAE/B,GAAI,EAAK,iBACP,MAAM,EAAkB,EAAO,kCAAkC,CAInE,OAFA,EAAoB,EAAM,CAC1B,EAAQ,EAAgB,EAAM,CACvB,IAAI,EAAe,EAAK,OAAQ,EAAK,MAAO,EAAM,SAChD,GAAe,EAAK,EAAI,EAAa,EAAK,GAAG,GAEtD,EAAQ,GACR,EAAO,EAAE,CACT,EAAO,EAAK,KACZ,EAAK,KAAK,QAAQ,SAAU,EAAK,EAAO,CAClC,EAAa,EAAI,CACnB,EAAK,GAAS,EAAI,KAElB,EAAQ,IAEV,CACE,GAGF,OAFA,EAAoB,EAAM,CAC1B,EAAQ,EAAgB,EAAM,CACvB,IAAI,EAAuBA,EAAM,EAAM,EAAM,CAGxD,MAAM,EAAkB,EAAO,kDAAkD,CAEnF,OAAO,EAaT,SAAS,GAAiB,EAAO,CAE/B,IADA,IAAI,EAAO,GAAe,EAAM,CACzB,EAAM,QAAU,KAAK,CAI1B,IAAI,EAAO,EAAM,iBACjB,EAAM,iBAAmB,EAAM,aAC/B,EAAoB,EAAM,CAC1B,IAAI,EAAY,EACZ,EAAW,EAAgB,EAAM,CACrC,GAAI,EAAM,QAAU,IAAK,MAAM,EAAkB,EAAO,gDAAgD,CACxG,EAAM,iBAAmB,KACzB,EAAoB,EAAM,CAG1B,EAAO,IAAI,EAAgB,EAAW,EAFtB,EAAgB,EAAM,CAEoB,CAG1D,EAAM,iBAAmB,EAE3B,OAAO,EAQT,SAAS,GAAe,EAAO,CAE7B,IADA,IAAI,EAAO,GAAgB,EAAM,CAC1B,EAAM,QAAU,MAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,KAAM,KAAM,CAAC,EAAM,GAAgB,EAAM,CAAC,CAAC,CAErE,OAAO,EAQT,SAAS,GAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,GAAgB,EAAM,CAC1B,EAAM,QAAU,OAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,MAAO,MAAO,CAAC,EAAM,GAAgB,EAAM,CAAC,CAAC,CAEvE,OAAO,EAQT,SAAS,GAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,GAAe,EAAM,CACzB,EAAM,QAAU,OAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,MAAO,MAAO,CAAC,EAAM,GAAe,EAAM,CAAC,CAAC,CAEtE,OAAO,EAQT,SAAS,GAAe,EAAO,CAE7B,IADA,IAAI,EAAO,EAAgB,EAAM,CAC1B,EAAM,QAAU,KAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,IAAK,QAAS,CAAC,EAAM,EAAgB,EAAM,CAAC,CAAC,CAEvE,OAAO,EAQT,SAAS,EAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,EAAgB,EAAM,CAC1B,EAAM,QAAU,MAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,KAAM,SAAU,CAAC,EAAM,EAAgB,EAAM,CAAC,CAAC,CAEzE,OAAO,EAQT,SAAS,EAAgB,EAAO,CAE9B,IADA,IAAI,EAAO,GAAgB,EAAM,CAC1B,EAAM,QAAU,KAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,IAAK,SAAU,CAAC,EAAM,GAAgB,EAAM,CAAC,CAAC,CAExE,OAAO,EAOT,SAAS,GAAgB,EAAO,CAW9B,IAVA,IAAI,EAAS,CAAC,GAAW,EAAM,CAAC,CAC5B,EAAe,EAAE,CACjB,EAAY,CACd,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,WACP,CACM,EAAe,EAAW,EAAM,MAAM,EAAE,CAE7C,IAAI,EAAO,CACT,KAAM,EAAM,MACZ,GAAI,EAAU,EAAM,OACrB,CACD,EAAa,KAAK,EAAK,CACvB,EAAoB,EAAM,CAC1B,EAAO,KAAK,GAAW,EAAM,CAAC,CAO9B,OALE,EAAO,SAAW,EACb,EAAO,GACL,EAAO,SAAW,EACpB,IAAI,EAAa,EAAa,GAAG,KAAM,EAAa,GAAG,GAAI,EAAO,CAElE,IAAI,EAAe,EAAa,IAAI,GAAK,EAAE,GAAG,CAAE,EAAO,CASlE,SAAS,GAAW,EAAO,CAQzB,IAPA,IAAI,EACG,EAAgB,EAAM,CADnBA,EAAM,EAAI,EAEhB,EAAY,CACd,KAAM,YACN,KAAM,kBACN,MAAO,gBACR,CACM,EAAe,EAAW,EAAM,MAAM,EAC3C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CAC1B,EAAS,CAAC,EAAM,EAAgB,EAAM,CAAC,CACvC,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,CAE3C,OAAO,EAQT,SAAS,EAAgB,EAAO,CAO9B,IANA,IAAI,EACG,GAAW,EAAM,CADdA,EAAM,EAAI,EAEhB,EAAY,CACd,GAAI,KACJ,GAAI,KACL,CACM,EAAe,EAAW,EAAM,MAAM,EAC3C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CACtBA,IAAS,MAAQ,QAAQ,SAAS,EAAM,MAAM,CAEhD,EAAO,IAAI,EAAa,IAAK,WAAY,CAAC,EAAM,IAAI,EAAW,KAAK,CAAC,CAAE,GAAK,EAG5E,EAAS,CAAC,EAAM,GAAW,EAAM,CAAC,CAClC,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,EAG7C,OAAO,EAQT,SAAS,GAAW,EAAO,CACzB,IAAI,EACA,EAAS,EAAE,CAQf,GAPA,AAKE,EALE,EAAM,QAAU,IAEX,IAAI,EAAa,EAAE,CAGnB,GAAiB,EAAM,CAE5B,EAAM,QAAU,KAAO,EAAM,mBAAqB,EAAM,aAAc,CAKxE,IAHA,EAAO,KAAK,EAAK,CAGV,EAAM,QAAU,KAAO,EAAO,OAAS,GAE5C,EAAoB,EAAM,CACtB,EAAM,QAAU,KAAO,EAAM,QAAU,KAAO,EAAM,QAAU,KAAO,EAAM,QAAU,GAEvF,EAAO,KAAK,IAAI,EAAW,MAAM,CAAC,CAGlC,EAAO,KAAK,GAAiB,EAAM,CAAC,CAGxC,AAME,EANE,EAAO,SAAW,EAEb,IAAI,EAAU,EAAO,GAAI,EAAO,GAAI,EAAO,GAAG,CAI9C,IAAI,EAAU,EAAO,GAAI,EAAO,GAAG,CAG9C,OAAO,EAQT,SAAS,GAAiB,EAAO,CAO/B,IANA,IAAI,EACG,GAA2B,EAAM,CAD9BA,EAAM,EAAI,EAEhB,EAAY,CACd,IAAK,MACL,IAAK,WACN,CACM,EAAe,EAAW,EAAM,MAAM,EAAE,CAC7C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CAC1B,IAAI,EAAY,GAA2B,EAAM,CACjD,AAGE,EAHE,EAAU,aACH,CAAC,EAAM,IAAI,EAAa,IAAK,WAAY,CAAC,EAAM,EAAU,CAAC,CAAC,CAE5D,CAAC,EAAM,EAAU,CAE5B,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,CAE3C,OAAO,EAQT,SAAS,GAA2B,EAAO,CAYzC,IAXA,IAAI,EACG,GAA4B,EAAM,CAD/B,EAEH,EAFSA,EAAM,EAGlB,EAAY,CACd,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,YACN,IAAK,MACL,IAAK,MACN,CAEK,EAAe,EAAW,EAAM,MAAM,EAExC,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAoB,EAAM,CAC1B,EAAO,GAA4B,EAAM,CACzC,EAAO,IAAI,EAAaA,EAAM,EAAI,CAAC,EAAM,EAAK,CAAC,CAKnD,OAAO,EAQT,SAAS,GAA4B,EAAO,CAI1C,IAHA,IAAI,EACG,GAAW,EAAM,CADd,EAEH,EAED,EAAM,YAAc,EAAU,QAAU,EAAM,QAAU,MAAQ,EAAe,EAAK,EAAI,EAAM,QAAU,MAAQ,GAAe,EAAK,EAAI,EAAK,KAAO,cAAgB,EAAe,EAAK,KAAK,GAAG,EAAI,EAAM,YAAc,EAAU,QAAU,CAAC,EAAe,EAAK,GAAK,CAAC,GAAe,EAAK,EAAI,EAAK,KAAO,MAAQ,EAAM,QAAU,KAMrU,EAAO,GAAW,EAAM,CACxB,EAAO,IAAI,EAAa,IAAK,WAAY,CAAC,EAAM,EAAK,CAAE,GAAoB,CAK/E,OAAO,EAYT,SAAS,GAAW,EAAO,CAIzB,IAHA,IAAI,EAAO,GAAqB,EAAM,CAClC,EAAO,EACP,EAAc,EAAE,CAGd,EAAM,QAAU,KAAO,GAAU,EAAK,EAMxC,GAJA,EAAY,KAAK,EAAS,EAAE,CAAE,EAAM,CAAC,CACrC,EAAoB,EAAM,CAGtB,EAAM,YAAc,EAAU,OAMhC,GAJA,EAAY,KAAK,EAAS,EAAE,CAAE,EAAM,CAAC,CACrC,EAAoB,EAAM,CAGtB,EAAM,YAAc,EAAU,QAAU,EAAM,QAAU,KAAO,EAAM,QAAU,KAGjF,EAAS,EAAO,EAAY,KAAK,CAAC,CAClC,EAAY,KAAK,CACjB,EAAO,GAAqB,EAAM,CAClC,EAAO,IAAI,EAAa,IAAK,SAAU,CAAC,EAAM,EAAK,CAAC,KAC/C,CAEL,EAAY,KAAK,CACjB,EAAS,EAAO,EAAY,KAAK,CAAC,CAClC,UAEG,CAEL,EAAS,EAAO,EAAY,KAAK,CAAC,CAClC,MAMN,OAAO,EAQT,SAAS,GAAqB,EAAO,CACnC,IAAI,EAAO,EAAW,EAAM,CAC5B,GAAI,EAAM,QAAU,IAAK,CACvB,IAAI,EAAgB,EAAS,EAAE,CAAE,EAAM,CACvC,EAAoB,EAAM,CAM1B,GAAI,CACF,EAAW,EAAM,CAGjB,EAAS,EAAO,EAAc,MACd,CAEhB,EAAO,IAAI,EAAa,IAAK,SAAU,CAAC,EAAM,IAAI,EAAa,IAAI,CAAC,CAAE,GAAO,GAAK,EAGtF,OAAO,EAQT,SAAS,EAAW,EAAO,CACzB,IAAIA,EAAM,EAAQ,EACd,EAAY,CACd,IAAK,aACL,IAAK,YACL,IAAK,SACL,IAAK,MACN,CAQD,OAPI,EAAe,EAAW,EAAM,MAAM,EACxC,EAAK,EAAU,EAAM,OACrB,EAAO,EAAM,MACb,EAAoB,EAAM,CAC1B,EAAS,CAAC,EAAW,EAAM,CAAC,CACrB,IAAI,EAAaA,EAAM,EAAI,EAAO,EAEpC,EAAS,EAAM,CASxB,SAAS,EAAS,EAAO,CACvB,IAAI,EACG,GAAuB,EAAM,CAD1BA,EAAM,EAAI,EASpB,OAPI,EAAM,QAAU,KAAO,EAAM,QAAU,QACzC,EAAO,EAAM,MACb,EAAKA,IAAS,IAAM,MAAQ,SAC5B,EAAoB,EAAM,CAC1B,EAAS,CAAC,EAAM,EAAW,EAAM,CAAC,CAClC,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,EAEpC,EAQT,SAAS,GAAuB,EAAO,CAErC,IADA,IAAI,EAAO,GAAuB,EAAM,CACjC,EAAM,QAAU,MAErB,EAAoB,EAAM,CAC1B,EAAO,IAAI,EAAa,KAAM,UAAW,CAAC,EAAM,GAAuB,EAAM,CAAC,CAAC,CAEjF,OAAO,EAQT,SAAS,GAAuB,EAAO,CAOrC,IANA,IAAI,EACG,GAAiB,EAAM,CADpBA,EAAM,EAAI,EAEhB,EAAY,CACd,IAAK,YACL,IAAM,aACP,CACM,EAAe,EAAW,EAAM,MAAM,EAC3C,EAAO,EAAM,MACb,EAAK,EAAUA,GACf,EAAS,EAAM,CACf,EAAS,CAAC,EAAK,CACf,EAAO,IAAI,EAAaA,EAAM,EAAI,EAAO,CACzC,EAAO,GAAe,EAAO,EAAK,CAEpC,OAAO,EA+BT,SAAS,GAAiB,EAAO,CAC/B,IAAI,EAAS,EAAE,CACf,GAAI,EAAM,YAAc,EAAU,QAAU,EAAe,EAAM,WAAY,EAAM,MAAM,CAAE,CACzF,IAAI,EAAa,EAAM,WAAW,EAAM,OAIxC,GAHA,EAAS,EAAM,CAGX,EAAM,QAAU,IAAK,CAIvB,GAHA,EAAS,EAAE,CACX,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAIlB,IAHA,EAAO,KAAK,EAAgB,EAAM,CAAC,CAG5B,EAAM,QAAU,KAErB,EAAS,EAAM,CACf,EAAO,KAAK,EAAgB,EAAM,CAAC,CAGvC,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAE1D,EAAY,EAAM,CAClB,EAAS,EAAM,CAKjB,OAAO,IAAI,EAAW,EAAO,CAE/B,OAAO,GAAY,EAAM,CAQ3B,SAAS,GAAY,EAAO,CAC1B,IAAI,EAAMA,EAkBV,OAjBI,EAAM,YAAc,EAAU,QAAU,EAAM,YAAc,EAAU,WAAa,EAAM,SAAS,IACpG,EAAO,EAAM,MACb,EAAS,EAAM,CACf,AAOE,EAPE,EAAe,GAAWA,EAAK,CAE1B,IAAI,EAAa,GAAUA,GAAM,CAC/B,EAAkB,SAASA,EAAK,CAElC,IAAI,EAAa,EAAQA,EAAM,SAAS,CAAC,CAEzC,IAAI,EAAWA,EAAK,CAI7B,EAAO,GAAe,EAAO,EAAK,CAC3B,GAEF,GAAY,EAAM,CAiB3B,SAAS,GAAe,EAAO,EAAM,EAAO,CAI1C,IAHA,IAAI,IAGS,CAGX,IAAI,EAAW,GAGX,EAAM,QAAU,OAClB,EAAW,GAEX,EAAS,EAAM,EAEjB,IAAI,GAAmB,EAAM,QAAU,KAAO,EAAM,QAAU,KAAO,EAAM,QAAU,OAAS,CAAC,GAAS,EAAM,SAAS,EAAM,MAAM,EACnI,GAAI,EAAE,GAAY,GAChB,MAGF,GADA,EAAS,EAAE,CACP,EAAM,QAAU,IAClB,GAAI,GAAY,EAAa,EAAK,EAAI,EAAe,EAAK,CAAE,CAI1D,GAFA,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAIlB,IAHA,EAAO,KAAK,EAAgB,EAAM,CAAC,CAG5B,EAAM,QAAU,KAErB,EAAS,EAAM,CACf,EAAO,KAAK,EAAgB,EAAM,CAAC,CAGvC,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAE1D,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAO,IAAI,EAAa,EAAM,EAAQ,EAAS,MAK/C,OAAO,UAEA,EAAM,QAAU,IAAK,CAI9B,GAFA,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAIlB,IAHA,EAAO,KAAK,EAAgB,EAAM,CAAC,CAG5B,EAAM,QAAU,KAErB,EAAS,EAAM,CACf,EAAO,KAAK,EAAgB,EAAM,CAAC,CAGvC,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAE1D,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAO,IAAI,EAAa,EAAM,IAAI,EAAU,EAAO,CAAE,EAAS,KACzD,CAKL,GAFK,GAAU,EAAS,EAAM,CAE1B,EADiB,EAAM,YAAc,EAAU,QAAU,EAAM,YAAc,EAAU,WAAa,EAAM,SAAS,IAClG,CACnB,IAAI,EAAU,gCAEd,KADA,IAAW,EAAW,iBAAmB,MACnC,EAAkB,EAAO,EAAQ,CAEzC,EAAO,KAAK,IAAI,EAAa,EAAM,MAAM,CAAC,CAC1C,EAAS,EAAM,CAEf,EAAO,IAAI,EAAa,EAAM,IAAI,EAAU,EAD1B,GAC8C,CAAE,EAAS,EAG/E,OAAO,EAQT,SAAS,GAAY,EAAO,CAC1B,IAAI,EAAM,EAWV,OAVI,EAAM,QAAU,KAAO,EAAM,QAAU,KACzC,EAAM,GAAiB,EAAO,EAAM,MAAM,CAG1C,EAAO,IAAI,EAAa,EAAI,CAG5B,EAAO,GAAe,EAAO,EAAK,CAC3B,GAEF,GAAY,EAAM,CAS3B,SAAS,GAAiB,EAAO,EAAO,CAEtC,IADA,IAAI,EAAM,GACH,EAAiB,EAAM,GAAK,IAAM,EAAiB,EAAM,GAAK,GACnE,GAAI,EAAiB,EAAM,GAAK,KAAM,CACpC,EAAK,EAAM,CACX,IAAI,EAAO,EAAiB,EAAM,CAC9B,EAAa,EAAkB,GACnC,GAAI,IAAe,IAAA,GAEjB,GAAO,EACP,EAAM,OAAS,UACN,IAAS,IAAK,CAEvB,IAAI,EAAU,EAAM,WAAW,MAAM,EAAM,MAAQ,EAAG,EAAM,MAAQ,EAAE,CACtE,GAAI,mBAAmB,KAAK,EAAQ,CAElC,GAAO,OAAO,aAAa,SAAS,EAAS,GAAG,CAAC,CACjD,EAAM,OAAS,OAEf,MAAM,EAAkB,EAAO,gCAAuC,IAAS,MAGjF,MAAM,EAAkB,EAAO,0BAAiC,IAAM,MAIxE,GAAO,EAAiB,EAAM,CAC9B,EAAK,EAAM,CAIf,GADA,EAAS,EAAM,CACX,EAAM,QAAU,EAClB,MAAM,EAAkB,EAAO,iBAAwB,aAAoB,CAG7E,OADA,EAAS,EAAM,CACR,EAQT,SAAS,GAAY,EAAO,CAC1B,IAAI,EAAO,EAAQ,EAAM,EACzB,GAAI,EAAM,QAAU,IAAK,CAIvB,GAFA,GAAW,EAAM,CACjB,EAAS,EAAM,CACX,EAAM,QAAU,IAAK,CAEvB,IAAI,EAAM,GAAS,EAAM,CACzB,GAAI,EAAM,QAAU,IAAK,CAMvB,IAJA,EAAO,EACP,EAAS,CAAC,EAAI,CAGP,EAAM,QAAU,KAErB,EAAS,EAAM,CACX,EAAM,QAAU,MAClB,EAAO,GAAQ,GAAS,EAAM,CAC9B,KAGJ,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,2BAA2B,CAE5D,EAAY,EAAM,CAClB,EAAS,EAAM,CAGf,EAAO,EAAO,GAAG,MAAM,OACvB,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,IACxB,GAAI,EAAO,GAAG,MAAM,SAAW,EAC7B,MAAM,GAAY,EAAO,+BAAsC,EAAO,GAAG,MAAM,OAAS,QAAU,EAAO,IAAI,CAGjH,EAAQ,IAAI,EAAU,EAAO,KACxB,CAEL,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,2BAA2B,CAE5D,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAQ,QAIV,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAQ,IAAI,EAAU,EAAE,CAAC,CAE3B,OAAO,GAAe,EAAO,EAAM,CAErC,OAAO,GAAY,EAAM,CAO3B,SAAS,GAAS,EAAO,CAGvB,IAFA,IAAI,EAAS,CAAC,EAAgB,EAAM,CAAC,CACjC,EAAM,EACH,EAAM,QAAU,KAErB,EAAS,EAAM,CAGX,EAAM,QAAU,KAAO,EAAM,QAAU,MACzC,EAAO,GAAO,EAAgB,EAAM,CACpC,KAGJ,OAAO,IAAI,EAAU,EAAO,CAQ9B,SAAS,GAAY,EAAO,CAC1B,GAAI,EAAM,QAAU,IAAK,CACvB,GAAW,EAAM,CACjB,IAAI,EACAE,EAAa,EAAE,CACnB,EAEE,IADA,EAAS,EAAM,CACX,EAAM,QAAU,IAAK,CAEvB,GAAI,EAAM,QAAU,KAAO,EAAM,QAAU,IACzC,EAAM,GAAiB,EAAO,EAAM,MAAM,SACjC,EAAM,YAAc,EAAU,QAAU,EAAM,YAAc,EAAU,WAAa,EAAM,SAAS,GAC3G,EAAM,EAAM,MACZ,EAAS,EAAM,MAEf,MAAM,EAAkB,EAAO,0CAA0C,CAI3E,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,oCAAoC,CAErE,EAAS,EAAM,CAGf,EAAW,GAAO,EAAgB,EAAM,OAEnC,EAAM,QAAU,KAEzB,GAAI,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,mDAAmD,CAEpF,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,IAAI,EAAO,IAAI,EAAWA,EAAW,CAIrC,MADA,GAAO,GAAe,EAAO,EAAK,CAC3B,EAET,OAAO,GAAY,EAAM,CAQ3B,SAAS,GAAY,EAAO,CAC1B,IAAI,EACJ,GAAI,EAAM,YAAc,EAAU,OAAQ,CAExC,EAAY,EAAM,MAClB,EAAS,EAAM,CACf,IAAI,EAAc,GAAe,EAAW,EAAO,CAEnD,OAAO,IAAI,EADC,EAAQ,EAAW,EAAY,CACb,CAEhC,OAAO,GAAiB,EAAM,CAQhC,SAAS,GAAiB,EAAO,CAC/B,IAAI,EAGJ,GAAI,EAAM,QAAU,IAAK,CAMvB,GAJA,GAAW,EAAM,CACjB,EAAS,EAAM,CACf,EAAO,EAAgB,EAAM,CAEzB,EAAM,QAAU,IAClB,MAAM,EAAkB,EAAO,yBAAyB,CAM1D,OAJA,EAAY,EAAM,CAClB,EAAS,EAAM,CACf,EAAO,IAAI,EAAgB,EAAK,CAChC,EAAO,GAAe,EAAO,EAAK,CAC3B,EAET,OAAO,GAAS,EAAM,CAQxB,SAAS,GAAS,EAAO,CAKrB,MAJE,EAAM,QAAU,GAEZ,EAAkB,EAAO,+BAA+B,CAExD,EAAkB,EAAO,iBAAiB,CAoBpD,SAAS,GAAI,EAAO,CAClB,OAAO,EAAM,MAAQ,EAAM,MAAM,OAAS,EAU5C,SAAS,EAAkB,EAAO,EAAS,CACzC,IAAI,EAAI,GAAI,EAAM,CACd,EAAY,YAAY,EAAU,UAAY,EAAI,IAAI,CAE1D,MADA,GAAM,KAAO,EACN,EAUT,SAAS,GAAY,EAAO,EAAS,CACnC,IAAI,EAAI,GAAI,EAAM,CACd,EAAY,YAAY,EAAU,UAAY,EAAI,IAAI,CAE1D,MADA,GAAM,KAAO,EACN,EAST,OALA,EAAM,cAAc,CAClB,KAAM,SACN,GAAI,OACJ,QAAS,EACV,CAAC,CACK,GACP,CCjoDEC,GAAO,WAEA,GAAgC,EAAQA,GADhC,CAAC,QAAS,QAAQ,CACkC,GAAQ,CAC7E,GAAI,CACF,QACA,SACE,EAsCJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,SAAgB,EAAM,CAC5B,IAAI,EAAQ,IAAgB,CAC5B,OAAO,EAAM,EAAK,CAAC,SAAS,CAAC,SAAS,EAAM,EAE9C,uBAAwB,SAA4B,EAAM,EAAO,CAC/D,OAAO,EAAM,EAAK,CAAC,SAAS,CAAC,SAAS,EAAM,EAE9C,iBAAkB,SAAuB,EAAM,CAC7C,IAAI,EAAQ,IAAgB,CAC5B,OAAO,GAAQ,EAAM,SAAU,EAAO,CACpC,OAAO,EAAM,EAAM,CAAC,SAAS,CAAC,SAAS,EAAM,EAC7C,EAEJ,+BAAgC,SAAmC,EAAM,EAAO,CAC9E,OAAO,GAAQ,EAAM,SAAU,EAAO,CACpC,OAAO,EAAM,EAAM,CAAC,SAAS,CAAC,SAAS,EAAM,EAC7C,EAEL,CAAC,EACF,CCjEEE,GAAO,OAEA,GAA4B,EAAQA,GAD5B,CAAC,QAAQ,CACuC,GAAQ,CACzE,GAAI,CACF,SACE,EA2BJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,GAAK,EAAE,MAAM,CACrB,MAAO,GACP,OAAQ,GAAK,CAAC,EAAE,OAAO,CAEvB,uDAAwD,GAAM,EAAE,CACjE,CAAC,EACF,CCvCEE,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,QAAS,QAAQ,CACmC,GAAQ,CAC9E,GAAI,CACF,QACA,SACE,EAuBJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,SAAgB,EAAG,CACzB,GAAI,EAAI,EACN,MAAU,MAAM,6BAA6B,CAE/C,OAAO,EAAM,EAAI,EAAE,EAErB,UAAW,SAAmB,EAAG,CAC/B,GAAI,EAAE,YAAY,CAChB,MAAU,MAAM,6BAA6B,CAE/C,OAAO,EAAM,EAAE,KAAK,EAAE,CAAC,EAEzB,iBAAkB,EAAM,YAAY,GAAQ,GAAK,GAAQ,EAAGE,EAAK,CAAC,CACnE,CAAC,EACF,CC7CEC,GAAO,YAEA,GAAiC,EAAQA,GADjC,CAAC,QAAQ,CAC4C,GAAQ,CAC9E,GAAI,CACF,SACE,EA8BJ,OAAO,EAAMA,GAAM,CACjB,OAAQ,GAAK,OAAO,SAAS,EAAE,CAC/B,sBAAuB,GAAK,EAAE,UAAU,CACxC,wBAA2B,GAC3B,uBAA0B,GAC1B,KAAM,EAAM,YAAY,GAAQ,GAAKE,EAAK,EAAE,MAAM,CAAC,CACnD,iBAAkB,EAAM,YAAY,GAAQ,IACrC,MAAM,QAAQ,EAAE,GAAE,EAAI,EAAE,SAAS,EAC/B,EAAE,MAAM,GAASA,EAAK,EAAM,CAAC,EACpC,CACH,CAAC,EACF,CC1CS,GAA+B,EAF/B,UACQ,CAAC,SAAU,aAAc,YAAY,CACc,GAAQ,CAC5E,GAAI,CACF,OAAQ,EACR,YACA,YACE,EACA,EAAkB,CACpB,OAAQ,GACR,OAAQ,GACR,UAAW,GACX,SAAU,GACX,CAGG,EAAmB,CACrB,OAAQ,GAAK,EAAQ,EAAE,CACvB,UAAW,EAAY,GAAK,EAAU,EAAE,CAAG,GAC3C,OAAQ,GAAK,OAAO,EAAE,CACtB,SAAU,EAAW,GAAK,EAAS,EAAE,CAAG,GACzC,CAgCD,OAAO,SAAiB,EAAO,CAC7B,IAAI,EAAa,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAK,SAErF,IADY,UAAU,OAAS,EAAI,UAAU,GAAK,IAAA,MACpC,IAAA,GACZ,MAAU,YAAY,uCAAuC,CAE/D,IAAI,EAAY,GAAO,EAAM,CAC7B,GAAI,EAAE,KAAa,GACjB,MAAU,UAAU,kBAAoB,EAAQ,aAAe,EAAY,4BAA8B,OAAO,KAAK,EAAgB,CAAC,KAAK,KAAK,CAAC,CAEnJ,GAAI,EAAE,KAAc,GAClB,MAAU,UAAU,kBAAoB,EAAQ,aAAe,EAAa,6BAA+B,OAAO,KAAK,EAAiB,CAAC,KAAK,KAAK,CAAC,CAKpJ,OAHE,IAAe,EACV,EAEA,EAAiB,GAAY,EAAM,GAG9C,CC9CS,GAA2B,EAAoB,MAAO,GAAU,CAMhE,GAA2B,EAAoB,MAAO,GAAU,CAIhE,GAA2B,EAAoB,MAAO,GAAU,CAChE,GAA2B,EAAoB,MAAO,GAAU,CAChE,GAA6B,EAAoB,QAAS,GAAY,CACtE,GAA4B,EAAoB,OAAQ,GAAW,CACnE,GAA2B,EAAoB,MAAO,GAAU,CAEhE,GAAgC,EAAoB,WAAY,GAAe,CAC/E,GACX,GAAqC,UAAW,GAAc,CACnD,GAA4B,EAAoB,OAAQ,GAAW,CACnE,GAA4B,EAAoB,OAAQ,GAAW,CAEnE,GAAgC,EAAoB,WAAY,GAAe,CAG/E,GAA2B,EAAoB,MAAO,GAAU,CAChE,GACX,GAAqC,QAAS,GAAY,CAC/C,GACX,GAAqC,MAAO,GAAU,CAC3C,GAA6B,EAAoB,QAAS,GAAY,CACtE,GAA2B,EAAoB,MAAO,GAAU,CAGhE,GAA8B,EAAoB,SAAU,GAAa,CAoEzE,GAA8B,EAAQ,SAAU,EAAE,KAAQ,GAAS,CACnE,GAA8B,EAAQ,SAAU,EAAE,KAAQ,GAAS,CAO9C,EAAoB,eAAgB,GAAmB,CACvF,IAAW,GAAc,EAAoB,QAAS,GAAY,CACxC,EAAoB,SAAU,GAAa,CA6GrE,SAAS,EAAoB,EAAM,EAAI,CACrC,OAAO,EAAQC,EAAM,CAAC,QAAQ,CAAE,GAAQ,CACtC,GAAI,CACF,SACE,EACJ,OAAO,EAAM,EAAG,EAChB,CAEJ,SAAS,GAAqC,EAAM,EAAI,CACtD,OAAO,EAAQA,EAAM,CAAC,QAAQ,CAAE,GAAS,CACvC,GAAI,CACF,SACE,EACJ,OAAO,EAAM,CACX,OAAQ,EACR,gBAAiB,EAClB,CAAC,EACF,CClQJ,SAAgB,GAAe,EAAI,EAAO,EAAK,EAAK,CAClD,GAAI,EAAE,gBAAgB,IACpB,MAAU,YAAY,mDAAmD,CAE3E,KAAK,GAAK,EACV,KAAK,MAAQ,EACb,KAAK,IAAM,EACX,KAAK,IAAM,EACX,KAAK,QAAU,yCAA2C,EAAK,KAAO,EAAQ,cAAgB,GAAO,GAA6B,KAAmB,GAAZ,IAAM,GAAY,aAC3J,KAAK,MAAY,OAAO,CAAC,MAE3B,GAAe,UAAgB,OAAO,CACtC,GAAe,UAAU,YAAc,MACvC,GAAe,UAAU,KAAO,iBAChC,GAAe,UAAU,iBAAmB,GClB5C,IAAW,EAAoB,CAC7B,eACD,CCDU,GAAkB,CAC3B,oBACA,aACD,CCJU,EAAmB,CAC5B,cACD,CCFU,GAAqB,CAC9B,gBACD,CCAU,GAA2B,CACpC,mBACA,sBACA,sBACD,CCLU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAwB,CACjC,mBACA,mBACD,CEDU,GAA6B,CACtC,mBDJ8B,CAC9B,gBACD,CCGC,mBACA,sBACA,wBACD,CENU,GAAwB,CACjC,kBDF6B,CAC7B,oBACA,eACD,CCAC,oBACA,mBACD,CCLU,GAAqB,CAC9B,oBACA,gBACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CEFU,GAAwB,CACjC,mBACA,sBDJiC,CACjC,mBACD,CCGC,mBACD,CCLU,GAAoB,CAC7B,oBACA,eACD,CCHU,GAA8B,CACvC,mBACA,yBACD,CEFU,GAA2B,CACpC,mBACA,sBDHiC,CACjC,oBACA,mBACD,CCCC,sBACD,CCJU,GAAqC,CAC9C,mBACA,oBACA,gCACD,CCLU,GAAyB,CAClC,mBACA,oBACD,CUaU,GAAoB,CAC7B,4BACA,yBACA,8BACA,yBACA,+BACA,4BACA,sCACA,yBTvBoC,CACpC,mBACA,0BACA,sBACD,CSoBC,sBPxBiC,CACjC,mBACA,iBDH4B,CAC5B,oBACA,cACD,CCCC,mBACD,COqBC,uBN1BkC,CAClC,mBACA,oBACD,CMwBC,yBL3BoC,CACpC,mBACA,sBACD,CKyBC,4BJ5BuC,CACvC,mBACA,yBACD,CI0BC,sBH7BiC,CACjC,mBACA,mBACD,CG2BC,2BF9BsC,CACtC,mBACA,wBACD,CE4BC,0BACA,oBDhC+B,CAC/B,sBACA,iBACD,CC8BC,oBACA,eACD,CCnCU,GAAqB,CAC9B,oBACA,gBACD,CCHU,GAAuB,CAChC,oBACA,kBACD,CCHU,GAAmB,CAC5B,oBACA,cACD,CCHU,GAAuB,CAChC,oBACA,kBACD,CCJU,GAAgB,CACzB,WACD,CCAU,GAAuB,CAChC,qBACA,oBACA,kBACD,CCLU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAoB,CAC7B,oBACA,eACD,CCHU,GAAoB,CAC7B,oBACA,eACD,CCHU,GAAmB,CAC5B,oBACA,cACD,CCHU,GAAkB,CAC3B,oBACA,aACD,CCHU,GAAsB,CAC/B,oBACA,iBACD,CCJU,GAAiB,CAC1B,YACD,CCDU,GAAmB,CAC5B,oBACA,cACD,iBCTD,SAAS,GAAK,EAKd,EAAE,UAAY,CACZ,GAAI,SAAU,EAAM,EAAU,EAAK,CACjC,IAAIC,EAAI,AAAW,KAAK,IAAI,EAAE,CAO9B,OALCA,EAAEC,KAAU,EAAEA,GAAQ,EAAE,GAAG,KAAK,CAC/B,GAAI,EACC,MACN,CAAC,CAEK,MAGT,KAAM,SAAU,EAAM,EAAU,EAAK,CACnC,IAAIC,EAAO,KACX,SAAS,GAAY,CACnB,EAAK,IAAID,EAAM,EAAS,CACxB,EAAS,MAAM,EAAK,UAAU,CAIhC,MADA,GAAS,EAAI,EACN,KAAK,GAAGA,EAAM,EAAU,EAAI,EAGrC,KAAM,SAAU,EAAM,CAMpB,IALA,IAAI,EAAO,EAAE,CAAC,MAAM,KAAK,UAAW,EAAE,CAClC,IAAW,AAAW,KAAK,IAAI,EAAE,EAAGA,IAAS,EAAE,EAAE,OAAO,CACxD,EAAI,EACJ,EAAM,EAAO,OAET,EAAI,EAAK,IACf,EAAO,GAAG,GAAG,MAAM,EAAO,GAAG,IAAK,EAAK,CAGzC,OAAO,MAGT,IAAK,SAAU,EAAM,EAAU,CAC7B,IAAID,EAAI,AAAW,KAAK,IAAI,EAAE,CAC1B,EAAOA,EAAEC,GACT,EAAa,EAAE,CAEnB,GAAI,GAAQ,MACL,IAAI,EAAI,EAAG,EAAM,EAAK,OAAQ,EAAI,EAAK,IACtC,EAAK,GAAG,KAAO,GAAY,EAAK,GAAG,GAAG,IAAM,GAC9C,EAAW,KAAK,EAAK,GAAG,CAY9B,OAJC,EAAW,OACR,EAAEA,GAAQ,EACV,OAAOD,EAAEC,GAEN,MAEV,CAED,EAAO,QAAU,EACjB,EAAO,QAAQ,YAAc,UC3D7B,SAAgB,GAAM,EAAK,CAEzB,IAAI,EAAU,IAAIE,GAAAA,QAOlB,MAJA,GAAI,GAAK,EAAQ,GAAG,KAAK,EAAQ,CACjC,EAAI,IAAM,EAAQ,IAAI,KAAK,EAAQ,CACnC,EAAI,KAAO,EAAQ,KAAK,KAAK,EAAQ,CACrC,EAAI,KAAO,EAAQ,KAAK,KAAK,EAAQ,CAC9B,ECZT,SAAgB,GAAc,EAAO,EAAM,EAAM,EAAmB,CAwDlE,SAAS,EAAW,EAAW,EAAS,CACtC,IAAI,EAAM,UAAU,OACpB,GAAI,IAAQ,GAAK,IAAQ,EACvB,MAAM,IAAI,GAAe,SAAU,EAAK,EAAG,EAAE,CAE/C,AACE,IAAU,EAAE,CAEd,SAAS,EAAe,EAAY,EAAO,EAAM,CAC/C,GAAI,MAAM,QAAQC,EAAM,CACtB,EAAM,QAAQ,GAAQ,EAAeC,EAAY,EAAK,CAAC,SAC9C,EAASD,EAAM,EAAI,EAASA,EAAM,KACtC,IAAI,KAASA,EACZ,EAAeA,EAAO,EAAM,EAC9B,EAAeC,EAAYD,EAAM,GAAQ,EAAM,SAG1C,GAAUA,EAAM,EAAIE,IAAS,IAAA,GAAW,CACjD,IAAI,EAAW,GAAUF,EAAM,CAAG,EAA2BA,EAAM,CAAGA,EAAM,GAAK,aAC/EA,EAAM,GAAKE,EAGb,GAAI,EAAeD,EAAY,EAAS,EAAIA,EAAW,KAAcD,GAAS,CAAC,EAAQ,OACrF,MAAU,MAAM,kBAAoB,EAAW,UAAU,CAE3D,EAAW,GAAYA,UAEnB,CAAC,EAAQ,OACX,MAAU,UAAU,qCAAqC,CAI/D,IAAI,EAAa,EAAE,CAEnB,IAAK,IAAIE,KADT,EAAe,EAAY,EAAU,CACpB,EACf,GAAI,EAAe,EAAYA,EAAK,CAAE,CAEpC,IAAI,EAAQ,EAAWA,GACvB,GAAI,GAAU,EAAM,CAIlB,EAAe,EAAO,EAAQ,SACrB,EAAgB,EAAM,CAC/B,EAAQA,EAAM,EAAO,EAAQ,SAEzB,CAAC,EAAQ,OACX,MAAU,UAAU,qCAAqC,EAcnE,SAAS,EAAQ,EAAM,EAAO,EAAS,CAcrC,GAXI,EAAQ,MAAQ,OAAO,GAAU,aAEnC,EAAQ,EAAM,EAAM,EAIlB,EAA0B,EAAM,GAClC,EAAQ,EAAMA,EAAM,EACjB,EAAM,WAAY,EACpB,CAAC,EAEA,EAAM,gBAAgB,EAAKA,GAAM,EAAI,EAAM,gBAAgB,EAAM,CAAE,CACrE,AAKE,EALE,EAAQ,SAEF,EAAMA,EAAM,EAAM,WAAW,CAG7B,EAAM,EAAKA,GAAO,EAAM,CAElC,EAAKA,GAAQ,EACb,OAAO,EAAkBA,GACzB,EAAiBA,EAAM,EAAM,CAC7B,EAAK,KAAK,SAAUA,EAAM,UAAoB,CAC5C,OAAO,GACP,CACF,OAEF,IAAI,EAAY,EAAKA,KAAU,IAAA,GAC3B,EAAgC,EAAK,MAA8D,gBAAgBA,EAAK,CAC5H,GAAI,CAAC,GAAa,CAAC,GAAmB,EAAQ,SAAU,CACtD,EAAKA,GAAQ,EACb,OAAO,EAAkBA,GACzB,EAAiBA,EAAM,EAAM,CAC7B,EAAK,KAAK,SAAUA,EAAM,UAAoB,CAC5C,OAAO,GACP,CACF,OAEF,GAAI,CAAC,EAAQ,OACX,MAAU,MAAM,kBAAoBA,EAAO,oBAAoB,CAGnE,SAAS,EAAiB,EAAM,EAAO,CACjC,GAAS,OAAO,EAAM,WAAc,YACtC,EAAK,WAAW,UAAUA,GAAQ,EAAM,UACpC,EAAqBA,EAAK,GAC5B,EAAK,WAAW,kBAAkBA,GAAQ,EAAM,aAIlD,OAAO,EAAK,WAAW,UAAUA,GAC7B,EAAqBA,EAAK,GAC5B,EAAK,WAAW,kBAAkBA,GAAQ,IAIhD,SAAS,EAAiB,EAAM,CAC9B,OAAO,EAAK,WAAW,UAAUA,GAC7B,EAAqBA,EAAK,CAC5B,EAAK,WAAW,kBAAkBA,GAAQ,EAAKA,GAE/C,OAAO,EAAK,WAAW,kBAAkBA,GAW7C,SAAS,EAAM,EAAI,CACjB,IAAI,EAAU,UAAmB,CAE/B,IAAK,IADD,EAAO,EAAE,CACJ,EAAI,EAAG,EAAM,UAAU,OAAQ,EAAI,EAAK,IAAK,CACpD,IAAI,EAAM,UAAU,GACpB,EAAK,GAAK,GAAO,EAAI,SAAS,CAEhC,OAAO,EAAG,MAAM,EAAM,EAAK,EAK7B,OAHI,EAAG,YACL,EAAQ,UAAY,EAAG,WAElB,EAUT,SAAS,EAAe,EAAS,EAAS,CACxC,IACIA,EAAO,UAAU,OAAS,GAAK,UAAU,KAAO,IAAA,GAAY,UAAU,GAAKE,EAAQ,GACvF,GAAIF,EAAK,SAAS,IAAI,CACpB,MAAU,MAAM,wDAA+D,KAAK,UAAUA,EAAK,CAAC,CAEtG,IAAI,EAAY,EAA2BE,EAAQ,CAAG,EAAK,WAAW,UAAY,EAC9E,EAAoBF,KAAQ,EAAK,WAAW,UAC5C,EAAW,EAAe,EAAWA,EAAK,CAAG,EAAUA,GAAQ,IAAA,GAC/D,EAAW,UAAoB,CAEjC,IAAII,EAAe,EAAE,CACrB,EAAQ,aAAa,IAAI,GAAsB,CAAC,QAAQ,GAAc,CACpE,GAAI,EAAW,SAAS,IAAI,CAC1B,MAAU,MAAM,8DAAqE,KAAK,UAAU,EAAW,CAAC,CAE9G,IAAe,OACjB,EAAa,KAAO,EACX,IAAe,oBACxB,EAAa,kBAAoB,EAAK,WAAW,kBACxC,IAAe,UAExB,EAAa,QAAU,EAEvB,EAAa,GAAc,EAAK,IAElC,CACF,IAAI,EAA0B,EAAQA,EAAa,CACnD,GAAI,GAAY,OAAO,EAAS,WAAc,WAC5C,MAAU,MAAM,+IAAoJ,CAEtK,GAAI,IAAa,IAAA,IAAa,EAAQ,SACpC,OAAO,EAET,GAAI,EAAM,gBAAgB,EAAS,EAAI,EAAM,gBAAgB,EAAS,CAEpE,OAAO,EAAM,EAAU,EAAS,CAElC,GAAI,EAAQ,OAEV,OAAO,EAEP,MAAU,MAAM,kBAAoBJ,EAAO,oBAAoB,EAG/D,EAAmDE,EAAQ,MAAoE,UAAiF,GAChN,EAAiB,EAA2BA,EAAQ,EAAI,EAA4BA,EAAQ,CAC5F,EAAgB,EAAK,WAAW,kBAGhC,CAACA,EAAQ,MAAQA,EAAQ,KAAK,OAAS,IACzC,GAAK,EAAWF,EAAM,EAAS,CAC3B,GAAQ,GAAK,EAAW,EAAQ,EAAS,CAGzC,GAAY,GACd,EAAiBA,EAAK,CAClB,GAAQ,EAAiB,EAAO,EAEhC,IACF,GAAK,EAAeA,MAAY,EAAUA,GAAM,CAC5C,GAAQ,GAAK,EAAe,MAAc,EAAUA,GAAM,IAIlE,EAAUA,GAAQ,GAAU,CACxB,IAAQ,EAAU,GAAU,EAAUA,IAGtC,GAAY,GACd,EAAiBA,EAAK,CAClB,GAAQ,EAAiB,EAAO,EAEhC,IACF,GAAK,EAAeA,MAAY,EAAUA,GAAM,CAC5C,GAAQ,GAAK,EAAe,MAAc,EAAUA,GAAM,GAMpE,EAAkBA,GAAQE,EAC1B,EAAK,KAAK,SAAUF,EAAM,EAAS,CASrC,SAAS,EAAgB,EAAQ,CAC/B,OAAO,OAAO,GAAW,YAAc,OAAO,GAAW,UAAY,OAAO,GAAW,UAAY,OAAO,GAAW,WAAa,IAAW,MAAQ,EAAO,EAAO,EAAI,EAAU,EAAO,EAAI,EAAY,EAAO,EAAI,EAAW,EAAO,EAAI,EAAS,EAAO,EAAI,MAAM,QAAQ,EAAO,CAEpR,SAAS,EAAS,EAAQ,CACxB,OAAO,OAAO,GAAW,UAAY,EAAO,OAAO,eAAiB,SAEtE,SAAS,EAA0B,EAAI,CACrC,OAAO,OAAO,GAAO,YAAc,OAAO,EAAG,WAAc,SAE7D,SAAS,EAAqB,EAAM,CAClC,MAAO,CAAC,EAAe,EAAQA,EAAK,CAEtC,SAAS,EAA4B,EAAS,CAC5C,MAAO,CAACE,EAAQ,GAAG,SAAS,IAAI,EAEhC,CAAC,EAAe,EAAQA,EAAQ,GAAG,GAAK,CAACA,EAAQ,MAAQ,CAACA,EAAQ,KAAK,SAEzE,SAAS,EAA2B,EAAS,CAC3C,OAAOA,IAAY,IAAA,IAAaA,EAAQ,OAAS,IAAA,IAAaA,EAAQ,KAAK,sBAAwB,IAAQ,GAI7G,IAAI,EAAS,CACX,WAAY,GACZ,KAAM,GACN,KAAM,GACN,MAAO,GACP,KAAM,GACN,MAAO,GACR,CACD,OAAO,mBC5RT,SAAgB,GAAO,EAAW,EAAQ,CACxC,IAAI,EAAiB,EAAS,EAAE,CAAE,EAAgB,EAAO,CAGzD,GAAI,OAAO,OAAO,QAAW,WAC3B,MAAU,MAAM,gHAAqH,CAIvI,IAAI,EAAOG,GAAc,CAEvB,WACA,YACA,cACA,YACA,aACA,SACA,WACA,UACA,WACA,eACA,iBACA,iBACA,WACA,WACA,YACA,eACA,UACA,cACA,UACA,YACA,WACA,QACA,oBACA,uBACA,SACA,eACA,iBACA,eACA,oBACA,eACA,qBACA,iBACA,4BACA,kBACA,cACA,SACA,gBACA,kBACA,qBACA,eACA,oBACA,eACA,WACD,CAAC,CAGF,EAAK,OAAS,GAAc,EAAgB,EAAK,KAAK,CACtD,EAAK,WAAa,CAChB,UAAW,EAAE,CACb,kBAAmB,CACjB,OAAQ,EAAK,OACd,CACF,CAGD,IAAI,EAAkB,EAAE,CACpB,EAAkB,EAAE,CASxB,SAAS,EAAK,EAAS,CACrB,GAAI,GAAUC,EAAQ,CACpB,OAAOA,EAAQ,EAAK,CAEtB,IAAI,EAAgBA,EAAQ,OAAO,KAAKA,EAAQ,CAAC,IACjD,GAAI,GAAU,EAAc,CAC1B,OAAO,EAAc,EAAK,CAE5B,GAAI,CAAC,GAAgBA,EAAQ,CAE3B,MADA,QAAQ,KAAK,wEAAyEA,EAAQ,CACpF,MAAM,wEAAwE,CAE1F,IAAI,EAAQ,EAAgB,QAAQA,EAAQ,CACxC,EAiBJ,OAhBI,IAAU,IAEZ,AAIE,EAJEA,EAAQ,OAAS,GAERA,EAAQ,QAAQ,EAAK,KAAM,EAAgB,EAAM,EAAK,MAAO,EAAK,CAElEA,EAAQ,QAAQ,EAAK,KAAM,EAAgB,EAAM,EAAK,MAAM,CAIzE,EAAgB,KAAKA,EAAQ,CAC7B,EAAgB,KAAK,EAAS,EAG9B,EAAW,EAAgB,GAEtB,EAET,IAAI,EAAoB,EAAE,CAG1B,SAAS,GAAY,CACd,IAA6B,MACnB,WAEf,OAAO,EAAK,MAAM,MAAM,EAAK,MAAO,EAAK,CAE3C,EAAU,gBAAkBC,GAAAA,QAAc,gBAC1C,IAAI,EAAiB,GAAc,EAAW,EAAM,EAAM,EAAkB,CA8B5E,MA7BA,GAAK,OAAS,EAId,EAAK,GAAG,aAAgB,CACtB,OAAO,OAAO,EAAkB,CAAC,QAAQ,GAAW,CAC9CD,GAAWA,EAAQ,MAAQA,EAAQ,KAAK,wBAG1C,EAAeA,EAAS,CACtB,SAAU,GACX,CAAC,EAEJ,EACF,CAIF,EAAK,OAAS,GAAO,KAAK,KAAM,EAAU,CAG1C,EAAK,QAAU,EAIf,EAAK,OAAO,OAAO,OAAO,GAAY,EAAU,CAAC,CAAC,CAClD,EAAK,eAAiB,GACtB,EAAK,eAAiB,GACtB,EAAK,WAAa,GACX,ECvMT,MAAa,GAAuB,GAAiD,CACnF,IAAM,EAAU,EAA2B,UAAU,CAGjD,EAAU,EAA2B,UAAW,CAAE,OAAQ,GAAO,CAAC,CACtE,GAAI,CAAC,EAAS,CAEZ,IAAM,EAAe,SAAS,cAAc,KAAK,CACjD,EAAa,aAAa,QAAS,QAAQ,CAC3C,EAAa,aAAa,KAAM,gBAAgB,CAChD,EAAa,YAAc,aAE3B,EAAU,SAAS,cAAc,MAAM,CACvC,EAAQ,aAAa,KAAM,UAAU,CACrC,EAAQ,aAAa,OAAQ,gBAAgB,CAC7C,EAAQ,aAAa,kBAAmB,gBAAgB,CACxD,EAAQ,YAAY,EAAa,CAGnC,GAAI,EAAE,aAAmB,aAAc,CACrC,IAAM,EAAO,SAAS,cAAc,OAAO,CAC3C,EAAK,UAAY,EAAQ,UAAU,CAEnC,EAAU,EAGZ,EAAQ,YAAY,EAAQ,CAE5B,EAAQ,sBAAsB,aAAc,EAAQ,ECWtD,IAAqB,GAArB,MAAqB,UAAmB,CAAO,CAC7C,aAAqB,CACnB,MAAM,aAAa,CAOrB,OAAwB,KAAO,GAAO,CACpC,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACH,GAAG,GACJ,CAAC,CAEF,MAAgB,KAAmC,CACjD,IAAM,EAAc,EAA6B,IAAI,CAC/C,EAAO,EAAW,KAAK,MAAM,EAAY,MAAM,CAErD,GAAI,CACF,MAAO,GAAG,EAAK,UAAU,CAAC,KAAK,EAAK,UAAU,QACxC,CAEN,QAIJ,MAAgB,KAAK,EAA+B,CAClD,GAAoB,EAAO"} \ No newline at end of file diff --git a/searx/static/themes/simple/chunk/DxJxX49r.min.js b/searx/static/themes/simple/chunk/DxJxX49r.min.js deleted file mode 100644 index 7bce17750..000000000 --- a/searx/static/themes/simple/chunk/DxJxX49r.min.js +++ /dev/null @@ -1,2 +0,0 @@ -import{n as e}from"../sxng-core.min.js";import"./13gvpunf.min.js";import{t}from"./gZqIRpW1.min.js";var n=t(`search`),r=t(`q`),i=t(`clear_search`),a=window.matchMedia(`(max-width: 50em)`).matches,o=document.querySelector(`main`)?.id===`main_results`,s=Array.from(document.querySelectorAll(`#categories_container button.category`));r.value.length===0&&i.classList.add(`empty`),a||o||r.focus(),a&&e(`focus`,r,()=>{requestAnimationFrame(()=>{let e=r.value.length;r.setSelectionRange(e,e),r.scrollLeft=r.scrollWidth})}),e(`input`,r,()=>{i.classList.toggle(`empty`,r.value.length===0)}),e(`click`,i,()=>{i.classList.add(`empty`),r.focus()});for(let t of s)e(`click`,t,e=>{if(e.shiftKey){e.preventDefault(),t.classList.toggle(`selected`);return}for(let e of s)e.classList.toggle(`selected`,e===t)});if(document.querySelector(`div.search_filters`)){let t=document.getElementById(`safesearch`);t&&e(`change`,t,()=>n.submit());let r=document.getElementById(`time_range`);r&&e(`change`,r,()=>n.submit());let i=document.getElementById(`language`);i&&e(`change`,i,()=>n.submit())}e(`submit`,n,e=>{if(e.preventDefault(),s.length>0){let e=t(`selected-categories`);e.value=s.filter(e=>e.classList.contains(`selected`)).map(e=>e.name.replace(`category_`,``)).join(`,`)}n.submit()}); -//# sourceMappingURL=DxJxX49r.min.js.map \ No newline at end of file diff --git a/searx/static/themes/simple/manifest.json b/searx/static/themes/simple/manifest.json index a79d52814..576028792 100644 --- a/searx/static/themes/simple/manifest.json +++ b/searx/static/themes/simple/manifest.json @@ -67,24 +67,22 @@ ] }, "src/js/main/search.ts": { - "file": "chunk/DxJxX49r.min.js", + "file": "chunk/BVhnhCXf.min.js", "name": "search", "src": "src/js/main/search.ts", "isDynamicEntry": true, "imports": [ "src/js/index.ts", - "_13gvpunf.min.js", "_gZqIRpW1.min.js" ] }, "src/js/plugin/Calculator.ts": { - "file": "chunk/CEKii0mQ.min.js", + "file": "chunk/CGazvOKw.min.js", "name": "calculator", "src": "src/js/plugin/Calculator.ts", "isDynamicEntry": true, "imports": [ "src/js/index.ts", - "_13gvpunf.min.js", "_gZqIRpW1.min.js" ] }, diff --git a/searx/static/themes/simple/sxng-core.min.js b/searx/static/themes/simple/sxng-core.min.js index 8d2c151e1..a6b465438 100644 --- a/searx/static/themes/simple/sxng-core.min.js +++ b/searx/static/themes/simple/sxng-core.min.js @@ -1,3 +1,3 @@ -const __vite__mapDeps=(i,m=__vite__mapDeps,d=(m.f||(m.f=["chunk/DBO1tjH7.min.js","chunk/13gvpunf.min.js","chunk/gZqIRpW1.min.js","chunk/CEKii0mQ.min.js","chunk/Db5v-hxx.min.js","chunk/DxJxX49r.min.js","chunk/KPZlR0ib.min.js","chunk/Q2SRo2ED.min.js","chunk/CyyZ9XJS.min.js"])))=>i.map(i=>d[i]); -var e=class{id;constructor(e){this.id=e,this.invoke()}async invoke(){try{console.debug(`[PLUGIN] ${this.id}: Running...`);let e=await this.run();if(!e)return;console.debug(`[PLUGIN] ${this.id}: Running post-exec...`),await this.post(e)}catch(e){console.error(`[PLUGIN] ${this.id}:`,e)}finally{console.debug(`[PLUGIN] ${this.id}: Done.`)}}};const t={index:`index`,results:`results`,preferences:`preferences`,unknown:`unknown`},n={closeDetail:void 0,scrollPageToSelected:void 0,selectImage:void 0,selectNext:void 0,selectPrevious:void 0};var r=()=>{let e=document.querySelector(`meta[name="endpoint"]`)?.getAttribute(`content`);return e&&e in t?e:t.unknown},i=()=>{let e=document.querySelector(`script[client_settings]`)?.getAttribute(`client_settings`);if(!e)return{};try{return JSON.parse(atob(e))}catch(e){return console.error(`Failed to load client_settings:`,e),{}}};const a=async(e,t,n)=>{let r=new AbortController,i=setTimeout(()=>r.abort(),n?.timeout??3e4),a=await fetch(t,{body:n?.body,method:e,signal:r.signal}).finally(()=>clearTimeout(i));if(!a.ok)throw Error(a.statusText);return a},o=(e,t,n,r)=>{if(typeof t!=`string`){t.addEventListener(e,n,r);return}document.addEventListener(e,e=>{for(let r of e.composedPath())if(r instanceof HTMLElement&&r.matches(t)){try{n.call(r,e)}catch(e){console.error(e)}break}},r)},s=(e,t)=>{for(let e of t?.on??[])if(!e)return;document.readyState===`loading`?o(`DOMContentLoaded`,document,e,{once:!0}):e()},c=r(),l=i(),u=(e,t)=>{d(t)&&e()};var d=e=>{switch(e.on){case`global`:return!0;case`endpoint`:return!!e.where.includes(c)}},f=`modulepreload`,p=function(e){return`/static/themes/simple/`+e},m={};const h=function(e,t,n){let r=Promise.resolve();if(t&&t.length>0){let e=document.getElementsByTagName(`link`),i=document.querySelector(`meta[property=csp-nonce]`),a=i?.nonce||i?.getAttribute(`nonce`);function o(e){return Promise.all(e.map(e=>Promise.resolve(e).then(e=>({status:`fulfilled`,value:e}),e=>({status:`rejected`,reason:e}))))}r=o(t.map(t=>{if(t=p(t,n),t in m)return;m[t]=!0;let r=t.endsWith(`.css`),i=r?`[rel="stylesheet"]`:``;if(n)for(let n=e.length-1;n>=0;n--){let i=e[n];if(i.href===t&&(!r||i.rel===`stylesheet`))return}else if(document.querySelector(`link[href="${t}"]${i}`))return;let o=document.createElement(`link`);if(o.rel=r?`stylesheet`:f,r||(o.as=`script`),o.crossOrigin=``,o.href=t,a&&o.setAttribute(`nonce`,a),document.head.appendChild(o),r)return new Promise((e,n)=>{o.addEventListener(`load`,e),o.addEventListener(`error`,()=>n(Error(`Unable to preload CSS for ${t}`)))})}))}function i(e){let t=new Event(`vite:preloadError`,{cancelable:!0});if(t.payload=e,window.dispatchEvent(t),!t.defaultPrevented)throw e}return r.then(t=>{for(let e of t||[])e.status===`rejected`&&i(e.reason);return e().catch(i)})};s(()=>{document.documentElement.classList.remove(`no-js`),document.documentElement.classList.add(`js`),o(`click`,`.close`,function(){this.parentNode?.classList.add(`invisible`)}),o(`click`,`.searxng_init_map`,async function(e){e.preventDefault(),this.classList.remove(`searxng_init_map`),u(()=>h(async()=>{let{default:e}=await import(`./chunk/BAcZkB_P.min.js`);return{default:e}},[]).then(({default:e})=>new e(this)),{on:`endpoint`,where:[t.results]})}),l.plugins?.includes(`infiniteScroll`)&&u(()=>h(async()=>{let{default:e}=await import(`./chunk/DBO1tjH7.min.js`);return{default:e}},__vite__mapDeps([0,1,2])).then(({default:e})=>new e),{on:`endpoint`,where:[t.results]}),l.plugins?.includes(`calculator`)&&u(()=>h(async()=>{let{default:e}=await import(`./chunk/CEKii0mQ.min.js`);return{default:e}},__vite__mapDeps([3,1,2])).then(({default:e})=>new e),{on:`endpoint`,where:[t.results]})}),s(()=>{h(()=>import(`./chunk/Db5v-hxx.min.js`),__vite__mapDeps([4,1])),h(()=>import(`./chunk/DxJxX49r.min.js`),__vite__mapDeps([5,1,2])),l.autocomplete&&h(()=>import(`./chunk/KPZlR0ib.min.js`),__vite__mapDeps([6,1]))},{on:[c===t.index]}),s(()=>{h(()=>import(`./chunk/Db5v-hxx.min.js`),__vite__mapDeps([4,1])),h(()=>import(`./chunk/Q2SRo2ED.min.js`),__vite__mapDeps([7,1])),h(()=>import(`./chunk/DxJxX49r.min.js`),__vite__mapDeps([5,1,2])),l.autocomplete&&h(()=>import(`./chunk/KPZlR0ib.min.js`),__vite__mapDeps([6,1]))},{on:[c===t.results]}),s(()=>{h(()=>import(`./chunk/CyyZ9XJS.min.js`),__vite__mapDeps([8,1]))},{on:[c===t.preferences]});export{e as a,l as i,o as n,n as r,a as t}; +const __vite__mapDeps=(i,m=__vite__mapDeps,d=(m.f||(m.f=["chunk/DBO1tjH7.min.js","chunk/13gvpunf.min.js","chunk/gZqIRpW1.min.js","chunk/CGazvOKw.min.js","chunk/Db5v-hxx.min.js","chunk/BVhnhCXf.min.js","chunk/KPZlR0ib.min.js","chunk/Q2SRo2ED.min.js","chunk/CyyZ9XJS.min.js"])))=>i.map(i=>d[i]); +var e=class{id;constructor(e){this.id=e,this.invoke()}async invoke(){try{console.debug(`[PLUGIN] ${this.id}: Running...`);let e=await this.run();if(!e)return;console.debug(`[PLUGIN] ${this.id}: Running post-exec...`),await this.post(e)}catch(e){console.error(`[PLUGIN] ${this.id}:`,e)}finally{console.debug(`[PLUGIN] ${this.id}: Done.`)}}};const t={index:`index`,results:`results`,preferences:`preferences`,unknown:`unknown`},n={closeDetail:void 0,scrollPageToSelected:void 0,selectImage:void 0,selectNext:void 0,selectPrevious:void 0};var r=()=>{let e=document.querySelector(`meta[name="endpoint"]`)?.getAttribute(`content`);return e&&e in t?e:t.unknown},i=()=>{let e=document.querySelector(`script[client_settings]`)?.getAttribute(`client_settings`);if(!e)return{};try{return JSON.parse(atob(e))}catch(e){return console.error(`Failed to load client_settings:`,e),{}}};const a=async(e,t,n)=>{let r=new AbortController,i=setTimeout(()=>r.abort(),n?.timeout??3e4),a=await fetch(t,{body:n?.body,method:e,signal:r.signal}).finally(()=>clearTimeout(i));if(!a.ok)throw Error(a.statusText);return a},o=(e,t,n,r)=>{if(typeof t!=`string`){t.addEventListener(e,n,r);return}document.addEventListener(e,e=>{for(let r of e.composedPath())if(r instanceof HTMLElement&&r.matches(t)){try{n.call(r,e)}catch(e){console.error(e)}break}},r)},s=(e,t)=>{for(let e of t?.on??[])if(!e)return;document.readyState===`loading`?o(`DOMContentLoaded`,document,e,{once:!0}):e()},c=r(),l=i(),u=(e,t)=>{d(t)&&e()};var d=e=>{switch(e.on){case`global`:return!0;case`endpoint`:return!!e.where.includes(c)}},f=`modulepreload`,p=function(e){return`/static/themes/simple/`+e},m={};const h=function(e,t,n){let r=Promise.resolve();if(t&&t.length>0){let e=document.getElementsByTagName(`link`),i=document.querySelector(`meta[property=csp-nonce]`),a=i?.nonce||i?.getAttribute(`nonce`);function o(e){return Promise.all(e.map(e=>Promise.resolve(e).then(e=>({status:`fulfilled`,value:e}),e=>({status:`rejected`,reason:e}))))}r=o(t.map(t=>{if(t=p(t,n),t in m)return;m[t]=!0;let r=t.endsWith(`.css`),i=r?`[rel="stylesheet"]`:``;if(n)for(let n=e.length-1;n>=0;n--){let i=e[n];if(i.href===t&&(!r||i.rel===`stylesheet`))return}else if(document.querySelector(`link[href="${t}"]${i}`))return;let o=document.createElement(`link`);if(o.rel=r?`stylesheet`:f,r||(o.as=`script`),o.crossOrigin=``,o.href=t,a&&o.setAttribute(`nonce`,a),document.head.appendChild(o),r)return new Promise((e,n)=>{o.addEventListener(`load`,e),o.addEventListener(`error`,()=>n(Error(`Unable to preload CSS for ${t}`)))})}))}function i(e){let t=new Event(`vite:preloadError`,{cancelable:!0});if(t.payload=e,window.dispatchEvent(t),!t.defaultPrevented)throw e}return r.then(t=>{for(let e of t||[])e.status===`rejected`&&i(e.reason);return e().catch(i)})};s(()=>{document.documentElement.classList.remove(`no-js`),document.documentElement.classList.add(`js`),o(`click`,`.close`,function(){this.parentNode?.classList.add(`invisible`)}),o(`click`,`.searxng_init_map`,async function(e){e.preventDefault(),this.classList.remove(`searxng_init_map`),u(()=>h(async()=>{let{default:e}=await import(`./chunk/BAcZkB_P.min.js`);return{default:e}},[]).then(({default:e})=>new e(this)),{on:`endpoint`,where:[t.results]})}),l.plugins?.includes(`infiniteScroll`)&&u(()=>h(async()=>{let{default:e}=await import(`./chunk/DBO1tjH7.min.js`);return{default:e}},__vite__mapDeps([0,1,2])).then(({default:e})=>new e),{on:`endpoint`,where:[t.results]}),l.plugins?.includes(`calculator`)&&u(()=>h(async()=>{let{default:e}=await import(`./chunk/CGazvOKw.min.js`);return{default:e}},__vite__mapDeps([3,2,1])).then(({default:e})=>new e),{on:`endpoint`,where:[t.results]})}),s(()=>{h(()=>import(`./chunk/Db5v-hxx.min.js`),__vite__mapDeps([4,1])),h(()=>import(`./chunk/BVhnhCXf.min.js`),__vite__mapDeps([5,2,1])),l.autocomplete&&h(()=>import(`./chunk/KPZlR0ib.min.js`),__vite__mapDeps([6,1]))},{on:[c===t.index]}),s(()=>{h(()=>import(`./chunk/Db5v-hxx.min.js`),__vite__mapDeps([4,1])),h(()=>import(`./chunk/Q2SRo2ED.min.js`),__vite__mapDeps([7,1])),h(()=>import(`./chunk/BVhnhCXf.min.js`),__vite__mapDeps([5,2,1])),l.autocomplete&&h(()=>import(`./chunk/KPZlR0ib.min.js`),__vite__mapDeps([6,1]))},{on:[c===t.results]}),s(()=>{h(()=>import(`./chunk/CyyZ9XJS.min.js`),__vite__mapDeps([8,1]))},{on:[c===t.preferences]});export{e as a,l as i,o as n,n as r,a as t}; //# sourceMappingURL=sxng-core.min.js.map \ No newline at end of file