@feedmepos/mf-menu 0.32.66 → 0.32.67
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/{App-CLFnWEv5.js → App-D_2YPsjs.js} +8 -8
- package/dist/{ApplyProduct.vue_vue_type_script_setup_true_lang-CVlLKIvY.js → ApplyProduct.vue_vue_type_script_setup_true_lang-CXrcvUd0.js} +3 -3
- package/dist/{ApplyProductDialog.vue_vue_type_script_setup_true_lang-CifmNu2u.js → ApplyProductDialog.vue_vue_type_script_setup_true_lang-CjJbz-O2.js} +3 -3
- package/dist/{Catalog-BC3jLsPs.js → Catalog-CU71hh7s.js} +6 -6
- package/dist/{Category-DMkvEdKc.js → Category-C4Q-L3Yi.js} +8 -8
- package/dist/{Category-Bmwlq6nL.js → Category-DCwub7ud.js} +22 -22
- package/dist/{CookingGuide-qy0LTm-D.js → CookingGuide-C7NaktZm.js} +5 -5
- package/dist/{CustomAttributeChip.vue_vue_type_script_setup_true_lang-JiZiBeEH.js → CustomAttributeChip.vue_vue_type_script_setup_true_lang-DtilpqIC.js} +1 -1
- package/dist/{Group-D0Xv55no.js → Group-CkrDqz-T.js} +8 -8
- package/dist/{Group-BPwmyZZp.js → Group-xFpNJyeL.js} +1 -1
- package/dist/{Group.vue_vue_type_script_setup_true_lang-D8nAO7h0.js → Group.vue_vue_type_script_setup_true_lang-DE-G70ge.js} +20 -20
- package/dist/{GroupMarkupPriceDialog.vue_vue_type_script_setup_true_lang-CjEnnnQj.js → GroupMarkupPriceDialog.vue_vue_type_script_setup_true_lang-k128rAg7.js} +5 -5
- package/dist/{ImportProductDialog.vue_vue_type_script_setup_true_lang-DMzqbxts.js → ImportProductDialog.vue_vue_type_script_setup_true_lang-BIU52Vn_.js} +212 -212
- package/dist/{Ingredient-BqaX4rlX.js → Ingredient-CPwli_hU.js} +4 -4
- package/dist/{InventoryBinding.vue_vue_type_script_setup_true_lang-sKJRkcCq.js → InventoryBinding.vue_vue_type_script_setup_true_lang-ePTUodR2.js} +2 -2
- package/dist/{LinkProductSideSheet-C6R0KLzF.js → LinkProductSideSheet-nNfalLk5.js} +4 -4
- package/dist/{MenuSetting-BedGpIZE.js → MenuSetting-CaH0Jwpr.js} +7 -7
- package/dist/{OrderPacing-C7i8LWNy.js → OrderPacing-tKw6IiKL.js} +5 -5
- package/dist/{PrintRoute-CIuQv57y.js → PrintRoute-C5kwNbLp.js} +5 -5
- package/dist/{Product-DRcYcCoB.js → Product-Bkijtii9.js} +1 -1
- package/dist/{Product.vue_vue_type_script_setup_true_lang-C1jETJyk.js → Product.vue_vue_type_script_setup_true_lang-EbAb7OeV.js} +14 -14
- package/dist/{ProductInternalTools-BKZ3Z3o8.js → ProductInternalTools-DeQRgaM0.js} +7 -7
- package/dist/{Products-BOz9WFoU.js → Products-DPMui6GK.js} +69 -69
- package/dist/{Publish-COiwVeUS.js → Publish-OZXQ__8_.js} +4 -4
- package/dist/{Recipe-DNFAMy0c.js → Recipe-BHrVAyTR.js} +5 -5
- package/dist/{RestaurantAttributesSelector.vue_vue_type_script_setup_true_lang-B8P0xkMT.js → RestaurantAttributesSelector.vue_vue_type_script_setup_true_lang-DEIMshQI.js} +1 -1
- package/dist/{RuleView.vue_vue_type_script_setup_true_lang-DxpvosGG.js → RuleView.vue_vue_type_script_setup_true_lang-CLXOUQg9.js} +462 -462
- package/dist/{Scheduler-DFc4fCB9.js → Scheduler-B9Kq4p5M.js} +3 -3
- package/dist/{ServingSequence-DjIUv0-b.js → ServingSequence-B2Aw-upP.js} +3 -3
- package/dist/{Setting-DnTMpvqy.js → Setting-DSYnGvjj.js} +5 -5
- package/dist/{Subcategory-B3HfpruL.js → Subcategory-CKal75fY.js} +6 -6
- package/dist/{Takeaway-DYoO1ATi.js → Takeaway-Cw5TTOni.js} +1 -1
- package/dist/{Takeaway-CCJDLPwz.js → Takeaway-DjLT1gYN.js} +4 -4
- package/dist/{Takeaway.vue_vue_type_script_setup_true_lang-B8RUqBww.js → Takeaway.vue_vue_type_script_setup_true_lang-S6t7pYz6.js} +5 -5
- package/dist/{TranslationFieldSection.vue_vue_type_script_setup_true_lang-D1gjP1Yk.js → TranslationFieldSection.vue_vue_type_script_setup_true_lang-B7Yhp4h2.js} +1 -1
- package/dist/{TranslationSideSheet.vue_vue_type_script_setup_true_lang-Cixm7NMC.js → TranslationSideSheet.vue_vue_type_script_setup_true_lang-PnQkA8fx.js} +2 -2
- package/dist/TreeEditorOpenner.vue_vue_type_script_setup_true_lang-BfLH0-S8.js +5865 -0
- package/dist/{Unit-DTswZFER.js → Unit-CvJEOGMo.js} +2 -2
- package/dist/{Variant-hqEsHL1u.js → Variant-DWnjN60q.js} +3 -3
- package/dist/{_id_-CGEwOGPW.js → _id_-Bu84Ve7O.js} +10 -10
- package/dist/{app-Bl1kXtqs.js → app-0tvJEHUj.js} +1 -1
- package/dist/{app-Da1XriaA.js → app-dZVL_rA1.js} +32 -32
- package/dist/app.js +1 -1
- package/dist/apps/mf-menu/src/helper/overrideForm.d.ts +17 -0
- package/dist/apps/mf-menu/tsconfig.app.tsbuildinfo +1 -1
- package/dist/assets/{override-menu-6Z3zlZar.js → linked-status-DMV-szyA.js} +4 -4
- package/dist/assets/{menu-export-Do1iuDTl.js → menu-export-CzJKI_ET.js} +4 -4
- package/dist/assets/{linked-status-BvskCt3K.js → override-menu-RB3jwvEO.js} +4 -4
- package/dist/assets/{validate-menu-B5dZxzSc.js → validate-menu-DOu-uzwh.js} +3 -3
- package/dist/{catalog-UnHoIEYX.js → catalog-B2oSduuM.js} +1 -1
- package/dist/{catalogSetting-DNkG_w_s.js → catalogSetting-C6Mik03T.js} +1 -1
- package/dist/{currency-DI_9wOEf.js → currency-ByYvKCl5.js} +1 -1
- package/dist/{dayjs.min-B1nGfqJL.js → dayjs.min-BCNrR3Ec.js} +2 -2
- package/dist/{discardConfirm-C65bh13g.js → discardConfirm-L8BYIlMr.js} +1 -1
- package/dist/{index-CJoXwoxN.js → index-BHFbkGuw.js} +5 -5
- package/dist/{index-Uv8d5BUd.js → index-BwNMtsmy.js} +1 -1
- package/dist/{index-rj_-6l1M.js → index-yvD73o51.js} +6 -6
- package/dist/{index.vue_vue_type_script_setup_true_lang-BRtju05_.js → index.vue_vue_type_script_setup_true_lang-BfHbH6Pn.js} +900 -900
- package/dist/{item-Cl-8exj2.js → item-stn12R2q.js} +2956 -2943
- package/dist/{jszip.min-5yjRwCyp.js → jszip.min-BqxWwDPE.js} +167 -167
- package/dist/{linkProducts-CimT6rLW.js → linkProducts-Yrb4YuNq.js} +4 -4
- package/dist/{memberPricing-CZwLOzMR.js → memberPricing-DDlCH6ho.js} +1 -1
- package/dist/{menu-C4c62Xvw.js → menu-D-13zF8j.js} +1 -1
- package/dist/{menuV2-BxVmtfZ3.js → menuV2-Cy2ON3fQ.js} +42 -42
- package/dist/mf-menu.css +1 -1
- package/dist/{order_pacing-C0bYumFm.js → order_pacing-CrqISlaL.js} +5 -5
- package/dist/{priceTier-C08rb71L.js → priceTier-BzSDcc7G.js} +1 -1
- package/dist/{rules-DEd-yB4f.js → rules-BRNrxcD3.js} +3 -3
- package/dist/{scheduler-B_-N10Gf.js → scheduler-Csj6ZYJU.js} +5 -5
- package/dist/{toExcel-Ca_J-aHT.js → toExcel-DmUuut1S.js} +2 -2
- package/dist/{unit-CDMOEbey.js → unit-eBpDTpWL.js} +3 -3
- package/package.json +1 -1
- package/dist/TreeEditorOpenner.vue_vue_type_script_setup_true_lang-CNs2BM3V.js +0 -5861
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { c as ct, g as Bt } from "./app-
|
|
2
|
-
import { y as wt } from "./index.vue_vue_type_script_setup_true_lang-
|
|
1
|
+
import { c as ct, g as Bt } from "./app-dZVL_rA1.js";
|
|
2
|
+
import { y as wt } from "./index.vue_vue_type_script_setup_true_lang-BfHbH6Pn.js";
|
|
3
3
|
var yt = { exports: {} }, Nt = yt.exports, It;
|
|
4
4
|
function Dt() {
|
|
5
5
|
return It || (It = 1, function(kt, Ot) {
|
|
@@ -74,7 +74,7 @@ function Dt() {
|
|
|
74
74
|
var Mt = Dt(), At = { exports: {} }, Rt;
|
|
75
75
|
function Ut() {
|
|
76
76
|
return Rt || (Rt = 1, function(kt, Ot) {
|
|
77
|
-
var gt = { env: { GITHUB_STATE: "/home/runner/work/_temp/_runner_file_commands/
|
|
77
|
+
var gt = { env: { GITHUB_STATE: "/home/runner/work/_temp/_runner_file_commands/save_state_a26784f3-e098-4330-bf0d-064058a00132", DOTNET_NOLOGO: "1", USER: "runner", npm_config_user_agent: "pnpm/10.8.0 npm/? node/v18.20.8 linux x64", CI: "true", USE_BAZEL_FALLBACK_VERSION: "silent:", RUNNER_ENVIRONMENT: "github-hosted", GITHUB_ENV: "/home/runner/work/_temp/_runner_file_commands/set_env_a26784f3-e098-4330-bf0d-064058a00132", PIPX_HOME: "/opt/pipx", FIREBASE_DATABASE_URL: "https://feedme-dev-4c3ef.firebaseio.com", npm_node_execpath: "/opt/hostedtoolcache/node/18.20.8/x64/bin/node", JAVA_HOME_8_X64: "/usr/lib/jvm/temurin-8-jdk-amd64", SHLVL: "1", HCA_CLOUD_PROVIDER: "azure", GTM_ID: "GTM-P7Z9FMS6", FIREBASE_MESSAGING_SENDER_ID: "458797803788", HOME: "/home/runner", VITE_FEED_ME_NAMESPACE: "development", RUNNER_TEMP: "/home/runner/work/_temp", GITHUB_EVENT_PATH: "/home/runner/work/_temp/_github_workflow/event.json", JAVA_HOME_11_X64: "/usr/lib/jvm/temurin-11-jdk-amd64", PIPX_BIN_DIR: "/opt/pipx_bin", GITHUB_REPOSITORY_OWNER: "feedmepos", NODE_OPTIONS: "--max-old-space-size=10240", GRADLE_HOME: "/usr/share/gradle-9.7.0", ANDROID_NDK_LATEST_HOME: "/usr/local/lib/android/sdk/ndk/29.0.14206865", JAVA_HOME_21_X64: "/usr/lib/jvm/temurin-21-jdk-amd64", GITHUB_RETENTION_DAYS: "90", GITHUB_REPOSITORY_OWNER_ID: "54831515", POWERSHELL_DISTRIBUTION_CHANNEL: "GitHub-Actions-Linux", AZURE_EXTENSION_DIR: "/opt/az/azcliextensions", GITHUB_HEAD_REF: "", GTM_SERVER_URL: "https://server-side-tagging-rsrq3ogsuq-as.a.run.app", VITE_FEATURE_FLAG_API_KEY: "MaGoXrEWuEJNpWgKTqseee", SYSTEMD_EXEC_PID: "1742", ACTIONS_ORCHESTRATION_ID: "843c1816-66e2-42f6-9558-58926f7fc6ee.publish.deploy.__default", GITHUB_GRAPHQL_URL: "https://api.github.com/graphql", JAVA_HOME_25_X64: "/usr/lib/jvm/temurin-25-jdk-amd64", NVM_DIR: "/home/runner/.nvm", DOTNET_SKIP_FIRST_TIME_EXPERIENCE: "1", JAVA_HOME_17_X64: "/usr/lib/jvm/temurin-17-jdk-amd64", ImageVersion: "20260816.277.1", LOGNAME: "runner", RUNNER_OS: "Linux", GITHUB_API_URL: "https://api.github.com", GITHUB_ARTIFACTS: "/home/runner/work/_temp/_runner_file_commands/artifacts_a26784f3-e098-4330-bf0d-064058a00132", SWIFT_PATH: "/usr/share/swift/usr/bin", PORTAL_BACKEND_URL: "https://portal-v2-dev.feedmeapi.com", CHROMEWEBDRIVER: "/usr/local/share/chromedriver-linux64", JOURNAL_STREAM: "9:11408", GITHUB_WORKFLOW: "Publish mf-menu dev", _: "/home/runner/setup-pnpm/node_modules/.bin/pnpm", MEMORY_PRESSURE_WATCH: "/sys/fs/cgroup/system.slice/hosted-compute-agent.service/memory.pressure", GOROOT_1_24_X64: "/opt/hostedtoolcache/go/1.24.13/x64", REMY_URL: "https://remy-dev.feedmeapi.com/v1", npm_config_registry: "https://registry.npmjs.org/", ACTIONS_RUNNER_ACTION_ARCHIVE_CACHE: "/opt/actionarchivecache", GOROOT_1_25_X64: "/opt/hostedtoolcache/go/1.25.13/x64", GITHUB_RUN_ID: "32922946497", VITE_REMY_BACKEND_URL: "https://remy-agent-api.feedmeapidev.com", GITHUB_REF_TYPE: "branch", BOOTSTRAP_HASKELL_NONINTERACTIVE: "1", GITHUB_WORKFLOW_SHA: "c8a6a7085e7e7a268767d322145508f1733a2998", GOROOT_1_26_X64: "/opt/hostedtoolcache/go/1.26.6/x64", GITHUB_BASE_REF: "", ImageOS: "ubuntu24", GTM_ENV: "development", FIREBASE_STORAGE_BUCKET: "image.feedmedev.cc", FIREBASE_MEASUREMENT_ID: "G-J2QG09D2Q7", GITHUB_WORKFLOW_REF: "feedmepos/portal/.github/workflows/publish-mf-menu.yml@refs/heads/main", GITHUB_ACTION_REPOSITORY: "", ENABLE_RUNNER_TRACING: "true", FIREBASE_AUTH_DOMAIN: "feedme-dev-4c3ef.firebaseapp.com", npm_config_node_gyp: "/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/dist/node_modules/node-gyp/bin/node-gyp.js", PATH: "/home/runner/work/portal/portal/apps/mf-menu/node_modules/.bin:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/dist/node-gyp-bin:/home/runner/work/portal/portal/node_modules/.bin:/home/runner/work/portal/portal/apps/mf-menu/node_modules/.bin:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/dist/node-gyp-bin:/home/runner/work/portal/portal/node_modules/.bin:/home/runner/work/portal/portal/apps/mf-menu/node_modules/.bin:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/dist/node-gyp-bin:/home/runner/work/portal/portal/node_modules/.bin:/home/runner/setup-pnpm/node_modules/.bin:/opt/hostedtoolcache/node/18.20.8/x64/bin:/snap/bin:/home/runner/.local/bin:/opt/pipx_bin:/home/runner/.cargo/bin:/home/runner/.config/composer/vendor/bin:/usr/local/.ghcup/bin:/home/runner/.dotnet/tools:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/usr/local/games:/snap/bin", ANT_HOME: "/usr/share/ant", DOTNET_MULTILEVEL_LOOKUP: "0", RUNNER_TRACKING_ID: "github_c7d1708f-9da3-4dcc-afb1-38b303611de7", INVOCATION_ID: "385935793fc44dccbb007a5cb1fbb85f", RUNNER_TOOL_CACHE: "/opt/hostedtoolcache", NODE: "/opt/hostedtoolcache/node/18.20.8/x64/bin/node", npm_package_name: "@feedmepos/mf-menu", GITHUB_ACTION: "__run_4", GITHUB_RUN_NUMBER: "591", GITHUB_TRIGGERING_ACTOR: "heiseshandian", RUNNER_ARCH: "X64", XDG_RUNTIME_DIR: "/run/user/1001", AGENT_TOOLSDIRECTORY: "/opt/hostedtoolcache", GTM_SERVER_MEASUREMENT_ID: "G-759WBZPF06", npm_config_frozen_lockfile: "", LANG: "C.UTF-8", VCPKG_INSTALLATION_ROOT: "/usr/local/share/vcpkg", VITE_LICENSE_API_URL: "https://license-v2-dev.feedmeapi.com", CONDA: "/usr/share/miniconda", RUNNER_NAME: "GitHub Actions 1000122094", XDG_CONFIG_HOME: "/home/runner/.config", GITHUB_REF_NAME: "main", GITHUB_REPOSITORY: "feedmepos/portal", npm_lifecycle_script: "vite build --mode fmmf", ANDROID_NDK_ROOT: "/usr/local/lib/android/sdk/ndk/27.3.13750724", GITHUB_ACTION_REF: "", DEBIAN_FRONTEND: "noninteractive", SHELL: "/bin/bash", GITHUB_REPOSITORY_ID: "705534668", GITHUB_ACTIONS: "true", NODE_PATH: "/home/runner/work/portal/portal/node_modules/.pnpm/vite@6.3.5_@types+node@18.19.110_jiti@1.21.7_sass@1.69.5_terser@5.40.0_yaml@2.8.0/node_modules/vite/bin/node_modules:/home/runner/work/portal/portal/node_modules/.pnpm/vite@6.3.5_@types+node@18.19.110_jiti@1.21.7_sass@1.69.5_terser@5.40.0_yaml@2.8.0/node_modules/vite/node_modules:/home/runner/work/portal/portal/node_modules/.pnpm/vite@6.3.5_@types+node@18.19.110_jiti@1.21.7_sass@1.69.5_terser@5.40.0_yaml@2.8.0/node_modules:/home/runner/work/portal/portal/node_modules/.pnpm/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/bin/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/bin/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/node_modules:/home/runner/work/portal/portal/node_modules/.pnpm/dotenv-cli@7.4.4/node_modules/dotenv-cli/node_modules:/home/runner/work/portal/portal/node_modules/.pnpm/dotenv-cli@7.4.4/node_modules:/home/runner/work/portal/portal/node_modules/.pnpm/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/bin/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules:/home/runner/setup-pnpm/node_modules/.pnpm/node_modules", npm_package_version: "0.32.67", npm_config_verify_deps_before_run: "false", npm_lifecycle_event: "build:mf", GITHUB_REF_PROTECTED: "true", GTM_DEBUG: "true", FIREBASE_PROJECT_ID: "feedme-dev-4c3ef", GITHUB_WORKSPACE: "/home/runner/work/portal/portal", ACCEPT_EULA: "Y", GITHUB_JOB: "deploy", GITHUB_SHA: "c8a6a7085e7e7a268767d322145508f1733a2998", GITHUB_RUN_ATTEMPT: "1", FIREBASE_APP_ID: "1:458797803788:web:37f2af2926a84288f0c129", ACTIONS_RUNNER_RETURN_JOB_RESULT_FOR_HOSTED: "1", GITHUB_REF: "refs/heads/main", GITHUB_ACTOR: "heiseshandian", ANDROID_SDK_ROOT: "/usr/local/lib/android/sdk", GITHUB_PATH: "/home/runner/work/_temp/_runner_file_commands/add_path_a26784f3-e098-4330-bf0d-064058a00132", JAVA_HOME: "/usr/lib/jvm/temurin-17-jdk-amd64", PWD: "/home/runner/work/portal/portal/apps/mf-menu", GITHUB_ACTOR_ID: "7780463", RUNNER_WORKSPACE: "/home/runner/work/portal", npm_execpath: "/home/runner/setup-pnpm/node_modules/.pnpm/pnpm@10.8.0/node_modules/pnpm/bin/pnpm.cjs", HOMEBREW_CLEANUP_PERIODIC_FULL_DAYS: "3650", GITHUB_EVENT_NAME: "workflow_dispatch", HOMEBREW_NO_AUTO_UPDATE: "1", ANDROID_HOME: "/usr/local/lib/android/sdk", GITHUB_SERVER_URL: "https://github.com", GECKOWEBDRIVER: "/usr/local/share/gecko_driver", GHCUP_INSTALL_BASE_PREFIX: "/usr/local", GITHUB_OUTPUT: "/home/runner/work/_temp/_runner_file_commands/set_output_a26784f3-e098-4330-bf0d-064058a00132", EDGEWEBDRIVER: "/usr/local/share/edge_driver", PNPM_SCRIPT_SRC_DIR: "/home/runner/work/portal/portal/apps/mf-menu", npm_command: "run-script", ANDROID_NDK: "/usr/local/lib/android/sdk/ndk/27.3.13750724", GITHUB_ARTIFACTS_LIST: "/home/runner/work/_temp/_runner_file_commands/artifacts_list_a26784f3-e098-4330-bf0d-064058a00132", SGX_AESM_ADDR: "1", PSModulePath: "/root/.local/share/powershell/Modules:/usr/local/share/powershell/Modules:/opt/microsoft/powershell/7/Modules:/usr/share/az_15.6.1", CHROME_BIN: "/usr/bin/google-chrome", VITE_FEED_ME_CLIENT_ID: "1a362d621873497b277ea55258cc82594ba148d235257f7bd44ea2acc132d8a4", SELENIUM_JAR_PATH: "/usr/share/java/selenium-server.jar", MEMORY_PRESSURE_WRITE: "c29tZSAyMDAwMDAgMjAwMDAwMAA=", PNPM_HOME: "/home/runner/setup-pnpm/node_modules/.bin", FIREBASE_API_KEY: "AIzaSyAj8JdCHtP0Vc5vZobCfgoLzWxPIn0WUG4", ANDROID_NDK_HOME: "/usr/local/lib/android/sdk/ndk/27.3.13750724", GITHUB_STEP_SUMMARY: "/home/runner/work/_temp/_runner_file_commands/step_summary_a26784f3-e098-4330-bf0d-064058a00132", INIT_CWD: "/home/runner/work/portal/portal/apps/mf-menu", NODE_ENV: "production" } };
|
|
78
78
|
/*!
|
|
79
79
|
|
|
80
80
|
JSZip v3.10.1 - A JavaScript class for generating and reading zip files
|
|
@@ -200,7 +200,7 @@ function Ut() {
|
|
|
200
200
|
return h;
|
|
201
201
|
}
|
|
202
202
|
function l(i, c, r, h, s, p) {
|
|
203
|
-
var w, A, E = i.file, N = i.compression, T = p !== m.utf8encode,
|
|
203
|
+
var w, A, E = i.file, N = i.compression, T = p !== m.utf8encode, L = n.transformTo("string", p(E.name)), O = n.transformTo("string", m.utf8encode(E.name)), H = E.comment, Y = n.transformTo("string", p(H)), g = n.transformTo("string", m.utf8encode(H)), C = O.length !== E.name.length, e = g.length !== H.length, B = "", q = "", P = "", Q = E.dir, M = E.date, J = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
|
|
204
204
|
c && !r || (J.crc32 = i.crc32, J.compressedSize = i.compressedSize, J.uncompressedSize = i.uncompressedSize);
|
|
205
205
|
var I = 0;
|
|
206
206
|
c && (I |= 8), T || !C && !e || (I |= 2048);
|
|
@@ -210,10 +210,10 @@ function Ut() {
|
|
|
210
210
|
return W || (ot = nt ? 16893 : 33204), (65535 & ot) << 16;
|
|
211
211
|
}(E.unixPermissions, Q)) : (X = 20, x |= function(W) {
|
|
212
212
|
return 63 & (W || 0);
|
|
213
|
-
}(E.dosPermissions)), w = M.getUTCHours(), w <<= 6, w |= M.getUTCMinutes(), w <<= 5, w |= M.getUTCSeconds() / 2, A = M.getUTCFullYear() - 1980, A <<= 4, A |= M.getUTCMonth() + 1, A <<= 5, A |= M.getUTCDate(), C && (q = u(1, 1) + u(v(
|
|
213
|
+
}(E.dosPermissions)), w = M.getUTCHours(), w <<= 6, w |= M.getUTCMinutes(), w <<= 5, w |= M.getUTCSeconds() / 2, A = M.getUTCFullYear() - 1980, A <<= 4, A |= M.getUTCMonth() + 1, A <<= 5, A |= M.getUTCDate(), C && (q = u(1, 1) + u(v(L), 4) + O, B += "up" + u(q.length, 2) + q), e && (P = u(1, 1) + u(v(Y), 4) + g, B += "uc" + u(P.length, 2) + P);
|
|
214
214
|
var Z = "";
|
|
215
215
|
return Z += `
|
|
216
|
-
\0`, Z += u(I, 2), Z += N.magic, Z += u(w, 2), Z += u(A, 2), Z += u(J.crc32, 4), Z += u(J.compressedSize, 4), Z += u(J.uncompressedSize, 4), Z += u(
|
|
216
|
+
\0`, Z += u(I, 2), Z += N.magic, Z += u(w, 2), Z += u(A, 2), Z += u(J.crc32, 4), Z += u(J.compressedSize, 4), Z += u(J.uncompressedSize, 4), Z += u(L.length, 2), Z += u(B.length, 2), { fileRecord: f.LOCAL_FILE_HEADER + Z + L + B, dirRecord: f.CENTRAL_FILE_HEADER + u(X, 2) + Z + u(Y.length, 2) + "\0\0\0\0" + u(x, 4) + u(h, 4) + L + B + Y };
|
|
217
217
|
}
|
|
218
218
|
var n = b("../utils"), a = b("../stream/GenericWorker"), m = b("../utf8"), v = b("../crc32"), f = b("../signature");
|
|
219
219
|
function _(i, c, r, h) {
|
|
@@ -382,8 +382,8 @@ function Ut() {
|
|
|
382
382
|
} };
|
|
383
383
|
}, {}], 15: [function(b, F, y) {
|
|
384
384
|
function u(E, N, T) {
|
|
385
|
-
var
|
|
386
|
-
H.date = H.date || /* @__PURE__ */ new Date(), H.compression !== null && (H.compression = H.compression.toUpperCase()), typeof H.unixPermissions == "string" && (H.unixPermissions = parseInt(H.unixPermissions, 8)), H.unixPermissions && 16384 & H.unixPermissions && (H.dir = !0), H.dosPermissions && 16 & H.dosPermissions && (H.dir = !0), H.dir && (E = s(E)), H.createFolders && (
|
|
385
|
+
var L, O = n.getTypeOf(N), H = n.extend(T || {}, v);
|
|
386
|
+
H.date = H.date || /* @__PURE__ */ new Date(), H.compression !== null && (H.compression = H.compression.toUpperCase()), typeof H.unixPermissions == "string" && (H.unixPermissions = parseInt(H.unixPermissions, 8)), H.unixPermissions && 16384 & H.unixPermissions && (H.dir = !0), H.dosPermissions && 16 & H.dosPermissions && (H.dir = !0), H.dir && (E = s(E)), H.createFolders && (L = h(E)) && p.call(this, L, !0);
|
|
387
387
|
var Y = O === "string" && H.binary === !1 && H.base64 === !1;
|
|
388
388
|
T && T.binary !== void 0 || (H.binary = !Y), (N instanceof f && N.uncompressedSize === 0 || H.dir || !N || N.length === 0) && (H.base64 = !1, H.binary = !0, N = "", H.compression = "STORE", O = "string");
|
|
389
389
|
var g = null;
|
|
@@ -406,19 +406,19 @@ function Ut() {
|
|
|
406
406
|
var A = { load: function() {
|
|
407
407
|
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
408
408
|
}, forEach: function(E) {
|
|
409
|
-
var N, T,
|
|
410
|
-
for (N in this.files)
|
|
409
|
+
var N, T, L;
|
|
410
|
+
for (N in this.files) L = this.files[N], (T = N.slice(this.root.length, N.length)) && N.slice(0, this.root.length) === this.root && E(T, L);
|
|
411
411
|
}, filter: function(E) {
|
|
412
412
|
var N = [];
|
|
413
|
-
return this.forEach(function(T,
|
|
414
|
-
E(T,
|
|
413
|
+
return this.forEach(function(T, L) {
|
|
414
|
+
E(T, L) && N.push(L);
|
|
415
415
|
}), N;
|
|
416
416
|
}, file: function(E, N, T) {
|
|
417
417
|
if (arguments.length !== 1) return E = this.root + E, u.call(this, E, N, T), this;
|
|
418
418
|
if (w(E)) {
|
|
419
|
-
var
|
|
419
|
+
var L = E;
|
|
420
420
|
return this.filter(function(H, Y) {
|
|
421
|
-
return !Y.dir &&
|
|
421
|
+
return !Y.dir && L.test(H);
|
|
422
422
|
});
|
|
423
423
|
}
|
|
424
424
|
var O = this.files[this.root + E];
|
|
@@ -428,15 +428,15 @@ function Ut() {
|
|
|
428
428
|
if (w(E)) return this.filter(function(O, H) {
|
|
429
429
|
return H.dir && E.test(O);
|
|
430
430
|
});
|
|
431
|
-
var N = this.root + E, T = p.call(this, N),
|
|
432
|
-
return
|
|
431
|
+
var N = this.root + E, T = p.call(this, N), L = this.clone();
|
|
432
|
+
return L.root = T.name, L;
|
|
433
433
|
}, remove: function(E) {
|
|
434
434
|
E = this.root + E;
|
|
435
435
|
var N = this.files[E];
|
|
436
436
|
if (N || (E.slice(-1) !== "/" && (E += "/"), N = this.files[E]), N && !N.dir) delete this.files[E];
|
|
437
437
|
else for (var T = this.filter(function(O, H) {
|
|
438
438
|
return H.name.slice(0, E.length) === E;
|
|
439
|
-
}),
|
|
439
|
+
}), L = 0; L < T.length; L++) delete this.files[T[L].name];
|
|
440
440
|
return this;
|
|
441
441
|
}, generate: function() {
|
|
442
442
|
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
@@ -445,8 +445,8 @@ function Ut() {
|
|
|
445
445
|
try {
|
|
446
446
|
if ((T = n.extend(E || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: l.utf8encode })).type = T.type.toLowerCase(), T.compression = T.compression.toUpperCase(), T.type === "binarystring" && (T.type = "string"), !T.type) throw new Error("No output type specified.");
|
|
447
447
|
n.checkSupport(T.type), T.platform !== "darwin" && T.platform !== "freebsd" && T.platform !== "linux" && T.platform !== "sunos" || (T.platform = "UNIX"), T.platform === "win32" && (T.platform = "DOS");
|
|
448
|
-
var
|
|
449
|
-
N = i.generateWorker(this, T,
|
|
448
|
+
var L = T.comment || this.comment || "";
|
|
449
|
+
N = i.generateWorker(this, T, L);
|
|
450
450
|
} catch (O) {
|
|
451
451
|
(N = new a("error")).error(O);
|
|
452
452
|
}
|
|
@@ -682,28 +682,28 @@ function Ut() {
|
|
|
682
682
|
p = [], s(N);
|
|
683
683
|
}).on("end", function() {
|
|
684
684
|
try {
|
|
685
|
-
var N = function(T,
|
|
685
|
+
var N = function(T, L, O) {
|
|
686
686
|
switch (T) {
|
|
687
687
|
case "blob":
|
|
688
|
-
return u.newBlob(u.transformTo("arraybuffer",
|
|
688
|
+
return u.newBlob(u.transformTo("arraybuffer", L), O);
|
|
689
689
|
case "base64":
|
|
690
|
-
return a.encode(
|
|
690
|
+
return a.encode(L);
|
|
691
691
|
default:
|
|
692
|
-
return u.transformTo(T,
|
|
692
|
+
return u.transformTo(T, L);
|
|
693
693
|
}
|
|
694
|
-
}(A, function(T,
|
|
694
|
+
}(A, function(T, L) {
|
|
695
695
|
var O, H = 0, Y = null, g = 0;
|
|
696
|
-
for (O = 0; O <
|
|
696
|
+
for (O = 0; O < L.length; O++) g += L[O].length;
|
|
697
697
|
switch (T) {
|
|
698
698
|
case "string":
|
|
699
|
-
return
|
|
699
|
+
return L.join("");
|
|
700
700
|
case "array":
|
|
701
|
-
return Array.prototype.concat.apply([],
|
|
701
|
+
return Array.prototype.concat.apply([], L);
|
|
702
702
|
case "uint8array":
|
|
703
|
-
for (Y = new Uint8Array(g), O = 0; O <
|
|
703
|
+
for (Y = new Uint8Array(g), O = 0; O < L.length; O++) Y.set(L[O], H), H += L[O].length;
|
|
704
704
|
return Y;
|
|
705
705
|
case "nodebuffer":
|
|
706
|
-
return Buffer.concat(
|
|
706
|
+
return Buffer.concat(L);
|
|
707
707
|
default:
|
|
708
708
|
throw new Error("concat : unsupported type '" + T + "'");
|
|
709
709
|
}
|
|
@@ -943,10 +943,10 @@ function Ut() {
|
|
|
943
943
|
return a.Promise.resolve(h).then(function(A) {
|
|
944
944
|
return u.blob && (A instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(A)) !== -1) && typeof FileReader < "u" ? new a.Promise(function(E, N) {
|
|
945
945
|
var T = new FileReader();
|
|
946
|
-
T.onload = function(
|
|
947
|
-
E(
|
|
948
|
-
}, T.onerror = function(
|
|
949
|
-
N(
|
|
946
|
+
T.onload = function(L) {
|
|
947
|
+
E(L.target.result);
|
|
948
|
+
}, T.onerror = function(L) {
|
|
949
|
+
N(L.target.error);
|
|
950
950
|
}, T.readAsArrayBuffer(A);
|
|
951
951
|
}) : A;
|
|
952
952
|
}).then(function(A) {
|
|
@@ -1244,13 +1244,13 @@ function Ut() {
|
|
|
1244
1244
|
if (Object.prototype.toString.call(s) !== "[object Array]") return this.reject(new TypeError("must be an array"));
|
|
1245
1245
|
var w = s.length, A = !1;
|
|
1246
1246
|
if (!w) return this.resolve([]);
|
|
1247
|
-
for (var E = new Array(w), N = 0, T = -1,
|
|
1248
|
-
return
|
|
1247
|
+
for (var E = new Array(w), N = 0, T = -1, L = new this(l); ++T < w; ) O(s[T], T);
|
|
1248
|
+
return L;
|
|
1249
1249
|
function O(H, Y) {
|
|
1250
1250
|
p.resolve(H).then(function(g) {
|
|
1251
|
-
E[Y] = g, ++N !== w || A || (A = !0, n.resolve(
|
|
1251
|
+
E[Y] = g, ++N !== w || A || (A = !0, n.resolve(L, E));
|
|
1252
1252
|
}, function(g) {
|
|
1253
|
-
A || (A = !0, n.reject(
|
|
1253
|
+
A || (A = !0, n.reject(L, g));
|
|
1254
1254
|
});
|
|
1255
1255
|
}
|
|
1256
1256
|
}, f.race = function(s) {
|
|
@@ -1258,10 +1258,10 @@ function Ut() {
|
|
|
1258
1258
|
if (Object.prototype.toString.call(s) !== "[object Array]") return this.reject(new TypeError("must be an array"));
|
|
1259
1259
|
var w = s.length, A = !1;
|
|
1260
1260
|
if (!w) return this.resolve([]);
|
|
1261
|
-
for (var E = -1, N = new this(l); ++E < w; ) T = s[E], p.resolve(T).then(function(
|
|
1262
|
-
A || (A = !0, n.resolve(N,
|
|
1263
|
-
}, function(
|
|
1264
|
-
A || (A = !0, n.reject(N,
|
|
1261
|
+
for (var E = -1, N = new this(l); ++E < w; ) T = s[E], p.resolve(T).then(function(L) {
|
|
1262
|
+
A || (A = !0, n.resolve(N, L));
|
|
1263
|
+
}, function(L) {
|
|
1264
|
+
A || (A = !0, n.reject(N, L));
|
|
1265
1265
|
});
|
|
1266
1266
|
var T;
|
|
1267
1267
|
return N;
|
|
@@ -1324,12 +1324,12 @@ function Ut() {
|
|
|
1324
1324
|
return s.result;
|
|
1325
1325
|
}
|
|
1326
1326
|
i.prototype.push = function(r, h) {
|
|
1327
|
-
var s, p, w, A, E, N, T = this.strm,
|
|
1327
|
+
var s, p, w, A, E, N, T = this.strm, L = this.options.chunkSize, O = this.options.dictionary, H = !1;
|
|
1328
1328
|
if (this.ended) return !1;
|
|
1329
1329
|
p = h === ~~h ? h : h === !0 ? a.Z_FINISH : a.Z_NO_FLUSH, typeof r == "string" ? T.input = n.binstring2buf(r) : _.call(r) === "[object ArrayBuffer]" ? T.input = new Uint8Array(r) : T.input = r, T.next_in = 0, T.avail_in = T.input.length;
|
|
1330
1330
|
do {
|
|
1331
|
-
if (T.avail_out === 0 && (T.output = new l.Buf8(
|
|
1332
|
-
T.next_out && (T.avail_out !== 0 && s !== a.Z_STREAM_END && (T.avail_in !== 0 || p !== a.Z_FINISH && p !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (w = n.utf8border(T.output, T.next_out), A = T.next_out - w, E = n.buf2string(T.output, w), T.next_out = A, T.avail_out =
|
|
1331
|
+
if (T.avail_out === 0 && (T.output = new l.Buf8(L), T.next_out = 0, T.avail_out = L), (s = u.inflate(T, a.Z_NO_FLUSH)) === a.Z_NEED_DICT && O && (N = typeof O == "string" ? n.string2buf(O) : _.call(O) === "[object ArrayBuffer]" ? new Uint8Array(O) : O, s = u.inflateSetDictionary(this.strm, N)), s === a.Z_BUF_ERROR && H === !0 && (s = a.Z_OK, H = !1), s !== a.Z_STREAM_END && s !== a.Z_OK) return this.onEnd(s), !(this.ended = !0);
|
|
1332
|
+
T.next_out && (T.avail_out !== 0 && s !== a.Z_STREAM_END && (T.avail_in !== 0 || p !== a.Z_FINISH && p !== a.Z_SYNC_FLUSH) || (this.options.to === "string" ? (w = n.utf8border(T.output, T.next_out), A = T.next_out - w, E = n.buf2string(T.output, w), T.next_out = A, T.avail_out = L - A, A && l.arraySet(T.output, T.output, w, A, 0), this.onData(E)) : this.onData(l.shrinkBuf(T.output, T.next_out)))), T.avail_in === 0 && T.avail_out === 0 && (H = !0);
|
|
1333
1333
|
} while ((0 < T.avail_in || T.avail_out === 0) && s !== a.Z_STREAM_END);
|
|
1334
1334
|
return s === a.Z_STREAM_END && (p = a.Z_FINISH), p === a.Z_FINISH ? (s = u.inflateEnd(this.strm), this.onEnd(s), this.ended = !0, s === a.Z_OK) : p !== a.Z_SYNC_FLUSH || (this.onEnd(a.Z_OK), !(T.avail_out = 0));
|
|
1335
1335
|
}, i.prototype.onData = function(r) {
|
|
@@ -1437,7 +1437,7 @@ function Ut() {
|
|
|
1437
1437
|
return -1 ^ l;
|
|
1438
1438
|
};
|
|
1439
1439
|
}, {}], 46: [function(b, F, y) {
|
|
1440
|
-
var u, l = b("../utils/common"), n = b("./trees"), a = b("./adler32"), m = b("./crc32"), v = b("./messages"), f = 0, _ = 4, i = 0, c = -2, r = -1, h = 4, s = 2, p = 8, w = 9, A = 286, E = 30, N = 19, T = 2 * A + 1,
|
|
1440
|
+
var u, l = b("../utils/common"), n = b("./trees"), a = b("./adler32"), m = b("./crc32"), v = b("./messages"), f = 0, _ = 4, i = 0, c = -2, r = -1, h = 4, s = 2, p = 8, w = 9, A = 286, E = 30, N = 19, T = 2 * A + 1, L = 15, O = 3, H = 258, Y = H + O + 1, g = 42, C = 113, e = 1, B = 2, q = 3, P = 4;
|
|
1441
1441
|
function Q(t, z) {
|
|
1442
1442
|
return t.msg = v[z], z;
|
|
1443
1443
|
}
|
|
@@ -1461,24 +1461,24 @@ function Ut() {
|
|
|
1461
1461
|
t.pending_buf[t.pending++] = z >>> 8 & 255, t.pending_buf[t.pending++] = 255 & z;
|
|
1462
1462
|
}
|
|
1463
1463
|
function W(t, z) {
|
|
1464
|
-
var R, d, o = t.max_chain_length, k = t.strstart, D = t.prev_length, U = t.nice_match, S = t.strstart > t.w_size - Y ? t.strstart - (t.w_size - Y) : 0, j = t.window,
|
|
1464
|
+
var R, d, o = t.max_chain_length, k = t.strstart, D = t.prev_length, U = t.nice_match, S = t.strstart > t.w_size - Y ? t.strstart - (t.w_size - Y) : 0, j = t.window, V = t.w_mask, G = t.prev, K = t.strstart + H, rt = j[k + D - 1], tt = j[k + D];
|
|
1465
1465
|
t.prev_length >= t.good_match && (o >>= 2), U > t.lookahead && (U = t.lookahead);
|
|
1466
1466
|
do
|
|
1467
1467
|
if (j[(R = z) + D] === tt && j[R + D - 1] === rt && j[R] === j[k] && j[++R] === j[k + 1]) {
|
|
1468
1468
|
k += 2, R++;
|
|
1469
1469
|
do
|
|
1470
1470
|
;
|
|
1471
|
-
while (j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && k <
|
|
1472
|
-
if (d = H - (
|
|
1471
|
+
while (j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && j[++k] === j[++R] && k < K);
|
|
1472
|
+
if (d = H - (K - k), k = K - H, D < d) {
|
|
1473
1473
|
if (t.match_start = z, U <= (D = d)) break;
|
|
1474
1474
|
rt = j[k + D - 1], tt = j[k + D];
|
|
1475
1475
|
}
|
|
1476
1476
|
}
|
|
1477
|
-
while ((z = G[z &
|
|
1477
|
+
while ((z = G[z & V]) > S && --o != 0);
|
|
1478
1478
|
return D <= t.lookahead ? D : t.lookahead;
|
|
1479
1479
|
}
|
|
1480
1480
|
function nt(t) {
|
|
1481
|
-
var z, R, d, o, k, D, U, S, j,
|
|
1481
|
+
var z, R, d, o, k, D, U, S, j, V, G = t.w_size;
|
|
1482
1482
|
do {
|
|
1483
1483
|
if (o = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - Y)) {
|
|
1484
1484
|
for (l.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, z = R = t.hash_size; d = t.head[--z], t.head[z] = G <= d ? d - G : 0, --R; ) ;
|
|
@@ -1486,7 +1486,7 @@ function Ut() {
|
|
|
1486
1486
|
o += G;
|
|
1487
1487
|
}
|
|
1488
1488
|
if (t.strm.avail_in === 0) break;
|
|
1489
|
-
if (D = t.strm, U = t.window, S = t.strstart + t.lookahead, j = o,
|
|
1489
|
+
if (D = t.strm, U = t.window, S = t.strstart + t.lookahead, j = o, V = void 0, V = D.avail_in, j < V && (V = j), R = V === 0 ? 0 : (D.avail_in -= V, l.arraySet(U, D.input, D.next_in, V, S), D.state.wrap === 1 ? D.adler = a(D.adler, U, V, S) : D.state.wrap === 2 && (D.adler = m(D.adler, U, V, S)), D.next_in += V, D.total_in += V, V), t.lookahead += R, t.lookahead + t.insert >= O) for (k = t.strstart - t.insert, t.ins_h = t.window[k], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + O - 1]) & t.hash_mask, t.prev[k & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = k, k++, t.insert--, !(t.lookahead + t.insert < O)); ) ;
|
|
1490
1490
|
} while (t.lookahead < Y && t.strm.avail_in !== 0);
|
|
1491
1491
|
}
|
|
1492
1492
|
function ot(t, z) {
|
|
@@ -1502,7 +1502,7 @@ function Ut() {
|
|
|
1502
1502
|
else d = n._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
|
|
1503
1503
|
if (d && (x(t, !1), t.strm.avail_out === 0)) return e;
|
|
1504
1504
|
}
|
|
1505
|
-
return t.insert = t.strstart < O - 1 ? t.strstart : O - 1, z === _ ? (x(t, !0), t.strm.avail_out === 0 ? q :
|
|
1505
|
+
return t.insert = t.strstart < O - 1 ? t.strstart : O - 1, z === _ ? (x(t, !0), t.strm.avail_out === 0 ? q : P) : t.last_lit && (x(t, !1), t.strm.avail_out === 0) ? e : B;
|
|
1506
1506
|
}
|
|
1507
1507
|
function $(t, z) {
|
|
1508
1508
|
for (var R, d, o; ; ) {
|
|
@@ -1517,13 +1517,13 @@ function Ut() {
|
|
|
1517
1517
|
if ((d = n._tr_tally(t, 0, t.window[t.strstart - 1])) && x(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0) return e;
|
|
1518
1518
|
} else t.match_available = 1, t.strstart++, t.lookahead--;
|
|
1519
1519
|
}
|
|
1520
|
-
return t.match_available && (d = n._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < O - 1 ? t.strstart : O - 1, z === _ ? (x(t, !0), t.strm.avail_out === 0 ? q :
|
|
1520
|
+
return t.match_available && (d = n._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < O - 1 ? t.strstart : O - 1, z === _ ? (x(t, !0), t.strm.avail_out === 0 ? q : P) : t.last_lit && (x(t, !1), t.strm.avail_out === 0) ? e : B;
|
|
1521
1521
|
}
|
|
1522
1522
|
function et(t, z, R, d, o) {
|
|
1523
1523
|
this.good_length = t, this.max_lazy = z, this.nice_length = R, this.max_chain = d, this.func = o;
|
|
1524
1524
|
}
|
|
1525
1525
|
function st() {
|
|
1526
|
-
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = p, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new l.Buf16(2 * T), this.dyn_dtree = new l.Buf16(2 * (2 * E + 1)), this.bl_tree = new l.Buf16(2 * (2 * N + 1)), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new l.Buf16(
|
|
1526
|
+
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = p, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new l.Buf16(2 * T), this.dyn_dtree = new l.Buf16(2 * (2 * E + 1)), this.bl_tree = new l.Buf16(2 * (2 * N + 1)), J(this.dyn_ltree), J(this.dyn_dtree), J(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new l.Buf16(L + 1), this.heap = new l.Buf16(2 * A + 1), J(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new l.Buf16(2 * A + 1), J(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
|
|
1527
1527
|
}
|
|
1528
1528
|
function it(t) {
|
|
1529
1529
|
var z;
|
|
@@ -1554,7 +1554,7 @@ function Ut() {
|
|
|
1554
1554
|
var d = t.block_start + R;
|
|
1555
1555
|
if ((t.strstart === 0 || t.strstart >= d) && (t.lookahead = t.strstart - d, t.strstart = d, x(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - Y && (x(t, !1), t.strm.avail_out === 0)) return e;
|
|
1556
1556
|
}
|
|
1557
|
-
return t.insert = 0, z === _ ? (x(t, !0), t.strm.avail_out === 0 ? q :
|
|
1557
|
+
return t.insert = 0, z === _ ? (x(t, !0), t.strm.avail_out === 0 ? q : P) : (t.strstart > t.block_start && (x(t, !1), t.strm.avail_out), e);
|
|
1558
1558
|
}), new et(4, 4, 8, 4, ot), new et(4, 5, 16, 8, ot), new et(4, 6, 32, 32, ot), new et(4, 4, 16, 16, $), new et(8, 16, 32, 32, $), new et(8, 16, 128, 128, $), new et(8, 32, 128, 256, $), new et(32, 128, 258, 1024, $), new et(32, 258, 258, 4096, $)], y.deflateInit = function(t, z) {
|
|
1559
1559
|
return lt(t, z, p, 15, 8, 0);
|
|
1560
1560
|
}, y.deflateInit2 = lt, y.deflateReset = ht, y.deflateResetKeep = it, y.deflateSetHeader = function(t, z) {
|
|
@@ -1600,32 +1600,32 @@ function Ut() {
|
|
|
1600
1600
|
if (d.status === 666 && t.avail_in !== 0) return Q(t, -5);
|
|
1601
1601
|
if (t.avail_in !== 0 || d.lookahead !== 0 || z !== f && d.status !== 666) {
|
|
1602
1602
|
var U = d.strategy === 2 ? function(S, j) {
|
|
1603
|
-
for (var
|
|
1603
|
+
for (var V; ; ) {
|
|
1604
1604
|
if (S.lookahead === 0 && (nt(S), S.lookahead === 0)) {
|
|
1605
1605
|
if (j === f) return e;
|
|
1606
1606
|
break;
|
|
1607
1607
|
}
|
|
1608
|
-
if (S.match_length = 0,
|
|
1608
|
+
if (S.match_length = 0, V = n._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++, V && (x(S, !1), S.strm.avail_out === 0)) return e;
|
|
1609
1609
|
}
|
|
1610
|
-
return S.insert = 0, j === _ ? (x(S, !0), S.strm.avail_out === 0 ? q :
|
|
1610
|
+
return S.insert = 0, j === _ ? (x(S, !0), S.strm.avail_out === 0 ? q : P) : S.last_lit && (x(S, !1), S.strm.avail_out === 0) ? e : B;
|
|
1611
1611
|
}(d, z) : d.strategy === 3 ? function(S, j) {
|
|
1612
|
-
for (var
|
|
1612
|
+
for (var V, G, K, rt, tt = S.window; ; ) {
|
|
1613
1613
|
if (S.lookahead <= H) {
|
|
1614
1614
|
if (nt(S), S.lookahead <= H && j === f) return e;
|
|
1615
1615
|
if (S.lookahead === 0) break;
|
|
1616
1616
|
}
|
|
1617
|
-
if (S.match_length = 0, S.lookahead >= O && 0 < S.strstart && (G = tt[
|
|
1617
|
+
if (S.match_length = 0, S.lookahead >= O && 0 < S.strstart && (G = tt[K = S.strstart - 1]) === tt[++K] && G === tt[++K] && G === tt[++K]) {
|
|
1618
1618
|
rt = S.strstart + H;
|
|
1619
1619
|
do
|
|
1620
1620
|
;
|
|
1621
|
-
while (G === tt[++
|
|
1622
|
-
S.match_length = H - (rt -
|
|
1621
|
+
while (G === tt[++K] && G === tt[++K] && G === tt[++K] && G === tt[++K] && G === tt[++K] && G === tt[++K] && G === tt[++K] && G === tt[++K] && K < rt);
|
|
1622
|
+
S.match_length = H - (rt - K), S.match_length > S.lookahead && (S.match_length = S.lookahead);
|
|
1623
1623
|
}
|
|
1624
|
-
if (S.match_length >= O ? (
|
|
1624
|
+
if (S.match_length >= O ? (V = n._tr_tally(S, 1, S.match_length - O), S.lookahead -= S.match_length, S.strstart += S.match_length, S.match_length = 0) : (V = n._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++), V && (x(S, !1), S.strm.avail_out === 0)) return e;
|
|
1625
1625
|
}
|
|
1626
|
-
return S.insert = 0, j === _ ? (x(S, !0), S.strm.avail_out === 0 ? q :
|
|
1626
|
+
return S.insert = 0, j === _ ? (x(S, !0), S.strm.avail_out === 0 ? q : P) : S.last_lit && (x(S, !1), S.strm.avail_out === 0) ? e : B;
|
|
1627
1627
|
}(d, z) : u[d.level].func(d, z);
|
|
1628
|
-
if (U !== q && U !==
|
|
1628
|
+
if (U !== q && U !== P || (d.status = 666), U === e || U === q) return t.avail_out === 0 && (d.last_flush = -1), i;
|
|
1629
1629
|
if (U === B && (z === 1 ? n._tr_align(d) : z !== 5 && (n._tr_stored_block(d, 0, 0, !1), z === 3 && (J(d.head), d.lookahead === 0 && (d.strstart = 0, d.block_start = 0, d.insert = 0))), I(t), t.avail_out === 0)) return d.last_flush = -1, i;
|
|
1630
1630
|
}
|
|
1631
1631
|
return z !== _ ? i : d.wrap <= 0 ? 1 : (d.wrap === 2 ? (X(d, 255 & t.adler), X(d, t.adler >> 8 & 255), X(d, t.adler >> 16 & 255), X(d, t.adler >> 24 & 255), X(d, 255 & t.total_in), X(d, t.total_in >> 8 & 255), X(d, t.total_in >> 16 & 255), X(d, t.total_in >> 24 & 255)) : (Z(d, t.adler >>> 16), Z(d, 65535 & t.adler)), I(t), 0 < d.wrap && (d.wrap = -d.wrap), d.pending !== 0 ? i : 1);
|
|
@@ -1633,9 +1633,9 @@ function Ut() {
|
|
|
1633
1633
|
var z;
|
|
1634
1634
|
return t && t.state ? (z = t.state.status) !== g && z !== 69 && z !== 73 && z !== 91 && z !== 103 && z !== C && z !== 666 ? Q(t, c) : (t.state = null, z === C ? Q(t, -3) : i) : c;
|
|
1635
1635
|
}, y.deflateSetDictionary = function(t, z) {
|
|
1636
|
-
var R, d, o, k, D, U, S, j,
|
|
1636
|
+
var R, d, o, k, D, U, S, j, V = z.length;
|
|
1637
1637
|
if (!t || !t.state || (k = (R = t.state).wrap) === 2 || k === 1 && R.status !== g || R.lookahead) return c;
|
|
1638
|
-
for (k === 1 && (t.adler = a(t.adler, z,
|
|
1638
|
+
for (k === 1 && (t.adler = a(t.adler, z, V, 0)), R.wrap = 0, V >= R.w_size && (k === 0 && (J(R.head), R.strstart = 0, R.block_start = 0, R.insert = 0), j = new l.Buf8(R.w_size), l.arraySet(j, z, V - R.w_size, R.w_size, 0), z = j, V = R.w_size), D = t.avail_in, U = t.next_in, S = t.input, t.avail_in = V, t.next_in = 0, t.input = z, nt(R); R.lookahead >= O; ) {
|
|
1639
1639
|
for (d = R.strstart, o = R.lookahead - (O - 1); R.ins_h = (R.ins_h << R.hash_shift ^ R.window[d + O - 1]) & R.hash_mask, R.prev[d & R.w_mask] = R.head[R.ins_h], R.head[R.ins_h] = d, d++, --o; ) ;
|
|
1640
1640
|
R.strstart = d, R.lookahead = O - 1, nt(R);
|
|
1641
1641
|
}
|
|
@@ -1647,16 +1647,16 @@ function Ut() {
|
|
|
1647
1647
|
};
|
|
1648
1648
|
}, {}], 48: [function(b, F, y) {
|
|
1649
1649
|
F.exports = function(u, l) {
|
|
1650
|
-
var n, a, m, v, f, _, i, c, r, h, s, p, w, A, E, N, T,
|
|
1650
|
+
var n, a, m, v, f, _, i, c, r, h, s, p, w, A, E, N, T, L, O, H, Y, g, C, e, B;
|
|
1651
1651
|
n = u.state, a = u.next_in, e = u.input, m = a + (u.avail_in - 5), v = u.next_out, B = u.output, f = v - (l - u.avail_out), _ = v + (u.avail_out - 257), i = n.dmax, c = n.wsize, r = n.whave, h = n.wnext, s = n.window, p = n.hold, w = n.bits, A = n.lencode, E = n.distcode, N = (1 << n.lenbits) - 1, T = (1 << n.distbits) - 1;
|
|
1652
1652
|
t: do {
|
|
1653
|
-
w < 15 && (p += e[a++] << w, w += 8, p += e[a++] << w, w += 8),
|
|
1653
|
+
w < 15 && (p += e[a++] << w, w += 8, p += e[a++] << w, w += 8), L = A[p & N];
|
|
1654
1654
|
e: for (; ; ) {
|
|
1655
|
-
if (p >>>= O =
|
|
1655
|
+
if (p >>>= O = L >>> 24, w -= O, (O = L >>> 16 & 255) === 0) B[v++] = 65535 & L;
|
|
1656
1656
|
else {
|
|
1657
1657
|
if (!(16 & O)) {
|
|
1658
1658
|
if ((64 & O) == 0) {
|
|
1659
|
-
|
|
1659
|
+
L = A[(65535 & L) + (p & (1 << O) - 1)];
|
|
1660
1660
|
continue e;
|
|
1661
1661
|
}
|
|
1662
1662
|
if (32 & O) {
|
|
@@ -1666,17 +1666,17 @@ function Ut() {
|
|
|
1666
1666
|
u.msg = "invalid literal/length code", n.mode = 30;
|
|
1667
1667
|
break t;
|
|
1668
1668
|
}
|
|
1669
|
-
H = 65535 &
|
|
1669
|
+
H = 65535 & L, (O &= 15) && (w < O && (p += e[a++] << w, w += 8), H += p & (1 << O) - 1, p >>>= O, w -= O), w < 15 && (p += e[a++] << w, w += 8, p += e[a++] << w, w += 8), L = E[p & T];
|
|
1670
1670
|
r: for (; ; ) {
|
|
1671
|
-
if (p >>>= O =
|
|
1671
|
+
if (p >>>= O = L >>> 24, w -= O, !(16 & (O = L >>> 16 & 255))) {
|
|
1672
1672
|
if ((64 & O) == 0) {
|
|
1673
|
-
|
|
1673
|
+
L = E[(65535 & L) + (p & (1 << O) - 1)];
|
|
1674
1674
|
continue r;
|
|
1675
1675
|
}
|
|
1676
1676
|
u.msg = "invalid distance code", n.mode = 30;
|
|
1677
1677
|
break t;
|
|
1678
1678
|
}
|
|
1679
|
-
if (Y = 65535 &
|
|
1679
|
+
if (Y = 65535 & L, w < (O &= 15) && (p += e[a++] << w, (w += 8) < O && (p += e[a++] << w, w += 8)), i < (Y += p & (1 << O) - 1)) {
|
|
1680
1680
|
u.msg = "invalid distance too far back", n.mode = 30;
|
|
1681
1681
|
break t;
|
|
1682
1682
|
}
|
|
@@ -1740,29 +1740,29 @@ function Ut() {
|
|
|
1740
1740
|
var e, B;
|
|
1741
1741
|
return g ? (B = new p(), (g.state = B).window = null, (e = E(g, C)) !== _ && (g.state = null), e) : i;
|
|
1742
1742
|
}
|
|
1743
|
-
var T,
|
|
1743
|
+
var T, L, O = !0;
|
|
1744
1744
|
function H(g) {
|
|
1745
1745
|
if (O) {
|
|
1746
1746
|
var C;
|
|
1747
|
-
for (T = new u.Buf32(512),
|
|
1747
|
+
for (T = new u.Buf32(512), L = new u.Buf32(32), C = 0; C < 144; ) g.lens[C++] = 8;
|
|
1748
1748
|
for (; C < 256; ) g.lens[C++] = 9;
|
|
1749
1749
|
for (; C < 280; ) g.lens[C++] = 7;
|
|
1750
1750
|
for (; C < 288; ) g.lens[C++] = 8;
|
|
1751
1751
|
for (m(v, g.lens, 0, 288, T, 0, g.work, { bits: 9 }), C = 0; C < 32; ) g.lens[C++] = 5;
|
|
1752
|
-
m(f, g.lens, 0, 32,
|
|
1752
|
+
m(f, g.lens, 0, 32, L, 0, g.work, { bits: 5 }), O = !1;
|
|
1753
1753
|
}
|
|
1754
|
-
g.lencode = T, g.lenbits = 9, g.distcode =
|
|
1754
|
+
g.lencode = T, g.lenbits = 9, g.distcode = L, g.distbits = 5;
|
|
1755
1755
|
}
|
|
1756
1756
|
function Y(g, C, e, B) {
|
|
1757
|
-
var q,
|
|
1758
|
-
return
|
|
1757
|
+
var q, P = g.state;
|
|
1758
|
+
return P.window === null && (P.wsize = 1 << P.wbits, P.wnext = 0, P.whave = 0, P.window = new u.Buf8(P.wsize)), B >= P.wsize ? (u.arraySet(P.window, C, e - P.wsize, P.wsize, 0), P.wnext = 0, P.whave = P.wsize) : (B < (q = P.wsize - P.wnext) && (q = B), u.arraySet(P.window, C, e - B, q, P.wnext), (B -= q) ? (u.arraySet(P.window, C, e - B, B, 0), P.wnext = B, P.whave = P.wsize) : (P.wnext += q, P.wnext === P.wsize && (P.wnext = 0), P.whave < P.wsize && (P.whave += q))), 0;
|
|
1759
1759
|
}
|
|
1760
1760
|
y.inflateReset = A, y.inflateReset2 = E, y.inflateResetKeep = w, y.inflateInit = function(g) {
|
|
1761
1761
|
return N(g, 15);
|
|
1762
1762
|
}, y.inflateInit2 = N, y.inflate = function(g, C) {
|
|
1763
|
-
var e, B, q,
|
|
1763
|
+
var e, B, q, P, Q, M, J, I, x, X, Z, W, nt, ot, $, et, st, it, ht, lt, t, z, R, d, o = 0, k = new u.Buf8(4), D = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
|
|
1764
1764
|
if (!g || !g.state || !g.output || !g.input && g.avail_in !== 0) return i;
|
|
1765
|
-
(e = g.state).mode === 12 && (e.mode = 13), Q = g.next_out, q = g.output, J = g.avail_out,
|
|
1765
|
+
(e = g.state).mode === 12 && (e.mode = 13), Q = g.next_out, q = g.output, J = g.avail_out, P = g.next_in, B = g.input, M = g.avail_in, I = e.hold, x = e.bits, X = M, Z = J, z = _;
|
|
1766
1766
|
t: for (; ; ) switch (e.mode) {
|
|
1767
1767
|
case c:
|
|
1768
1768
|
if (e.wrap === 0) {
|
|
@@ -1771,7 +1771,7 @@ function Ut() {
|
|
|
1771
1771
|
}
|
|
1772
1772
|
for (; x < 16; ) {
|
|
1773
1773
|
if (M === 0) break t;
|
|
1774
|
-
M--, I += B[
|
|
1774
|
+
M--, I += B[P++] << x, x += 8;
|
|
1775
1775
|
}
|
|
1776
1776
|
if (2 & e.wrap && I === 35615) {
|
|
1777
1777
|
k[e.check = 0] = 255 & I, k[1] = I >>> 8 & 255, e.check = n(e.check, k, 2, 0), x = I = 0, e.mode = 2;
|
|
@@ -1795,7 +1795,7 @@ function Ut() {
|
|
|
1795
1795
|
case 2:
|
|
1796
1796
|
for (; x < 16; ) {
|
|
1797
1797
|
if (M === 0) break t;
|
|
1798
|
-
M--, I += B[
|
|
1798
|
+
M--, I += B[P++] << x, x += 8;
|
|
1799
1799
|
}
|
|
1800
1800
|
if (e.flags = I, (255 & e.flags) != 8) {
|
|
1801
1801
|
g.msg = "unknown compression method", e.mode = 30;
|
|
@@ -1809,46 +1809,46 @@ function Ut() {
|
|
|
1809
1809
|
case 3:
|
|
1810
1810
|
for (; x < 32; ) {
|
|
1811
1811
|
if (M === 0) break t;
|
|
1812
|
-
M--, I += B[
|
|
1812
|
+
M--, I += B[P++] << x, x += 8;
|
|
1813
1813
|
}
|
|
1814
1814
|
e.head && (e.head.time = I), 512 & e.flags && (k[0] = 255 & I, k[1] = I >>> 8 & 255, k[2] = I >>> 16 & 255, k[3] = I >>> 24 & 255, e.check = n(e.check, k, 4, 0)), x = I = 0, e.mode = 4;
|
|
1815
1815
|
case 4:
|
|
1816
1816
|
for (; x < 16; ) {
|
|
1817
1817
|
if (M === 0) break t;
|
|
1818
|
-
M--, I += B[
|
|
1818
|
+
M--, I += B[P++] << x, x += 8;
|
|
1819
1819
|
}
|
|
1820
1820
|
e.head && (e.head.xflags = 255 & I, e.head.os = I >> 8), 512 & e.flags && (k[0] = 255 & I, k[1] = I >>> 8 & 255, e.check = n(e.check, k, 2, 0)), x = I = 0, e.mode = 5;
|
|
1821
1821
|
case 5:
|
|
1822
1822
|
if (1024 & e.flags) {
|
|
1823
1823
|
for (; x < 16; ) {
|
|
1824
1824
|
if (M === 0) break t;
|
|
1825
|
-
M--, I += B[
|
|
1825
|
+
M--, I += B[P++] << x, x += 8;
|
|
1826
1826
|
}
|
|
1827
1827
|
e.length = I, e.head && (e.head.extra_len = I), 512 & e.flags && (k[0] = 255 & I, k[1] = I >>> 8 & 255, e.check = n(e.check, k, 2, 0)), x = I = 0;
|
|
1828
1828
|
} else e.head && (e.head.extra = null);
|
|
1829
1829
|
e.mode = 6;
|
|
1830
1830
|
case 6:
|
|
1831
|
-
if (1024 & e.flags && (M < (W = e.length) && (W = M), W && (e.head && (t = e.head.extra_len - e.length, e.head.extra || (e.head.extra = new Array(e.head.extra_len)), u.arraySet(e.head.extra, B,
|
|
1831
|
+
if (1024 & e.flags && (M < (W = e.length) && (W = M), W && (e.head && (t = e.head.extra_len - e.length, e.head.extra || (e.head.extra = new Array(e.head.extra_len)), u.arraySet(e.head.extra, B, P, W, t)), 512 & e.flags && (e.check = n(e.check, B, W, P)), M -= W, P += W, e.length -= W), e.length)) break t;
|
|
1832
1832
|
e.length = 0, e.mode = 7;
|
|
1833
1833
|
case 7:
|
|
1834
1834
|
if (2048 & e.flags) {
|
|
1835
1835
|
if (M === 0) break t;
|
|
1836
|
-
for (W = 0; t = B[
|
|
1837
|
-
if (512 & e.flags && (e.check = n(e.check, B, W,
|
|
1836
|
+
for (W = 0; t = B[P + W++], e.head && t && e.length < 65536 && (e.head.name += String.fromCharCode(t)), t && W < M; ) ;
|
|
1837
|
+
if (512 & e.flags && (e.check = n(e.check, B, W, P)), M -= W, P += W, t) break t;
|
|
1838
1838
|
} else e.head && (e.head.name = null);
|
|
1839
1839
|
e.length = 0, e.mode = 8;
|
|
1840
1840
|
case 8:
|
|
1841
1841
|
if (4096 & e.flags) {
|
|
1842
1842
|
if (M === 0) break t;
|
|
1843
|
-
for (W = 0; t = B[
|
|
1844
|
-
if (512 & e.flags && (e.check = n(e.check, B, W,
|
|
1843
|
+
for (W = 0; t = B[P + W++], e.head && t && e.length < 65536 && (e.head.comment += String.fromCharCode(t)), t && W < M; ) ;
|
|
1844
|
+
if (512 & e.flags && (e.check = n(e.check, B, W, P)), M -= W, P += W, t) break t;
|
|
1845
1845
|
} else e.head && (e.head.comment = null);
|
|
1846
1846
|
e.mode = 9;
|
|
1847
1847
|
case 9:
|
|
1848
1848
|
if (512 & e.flags) {
|
|
1849
1849
|
for (; x < 16; ) {
|
|
1850
1850
|
if (M === 0) break t;
|
|
1851
|
-
M--, I += B[
|
|
1851
|
+
M--, I += B[P++] << x, x += 8;
|
|
1852
1852
|
}
|
|
1853
1853
|
if (I !== (65535 & e.check)) {
|
|
1854
1854
|
g.msg = "header crc mismatch", e.mode = 30;
|
|
@@ -1861,11 +1861,11 @@ function Ut() {
|
|
|
1861
1861
|
case 10:
|
|
1862
1862
|
for (; x < 32; ) {
|
|
1863
1863
|
if (M === 0) break t;
|
|
1864
|
-
M--, I += B[
|
|
1864
|
+
M--, I += B[P++] << x, x += 8;
|
|
1865
1865
|
}
|
|
1866
1866
|
g.adler = e.check = s(I), x = I = 0, e.mode = 11;
|
|
1867
1867
|
case 11:
|
|
1868
|
-
if (e.havedict === 0) return g.next_out = Q, g.avail_out = J, g.next_in =
|
|
1868
|
+
if (e.havedict === 0) return g.next_out = Q, g.avail_out = J, g.next_in = P, g.avail_in = M, e.hold = I, e.bits = x, 2;
|
|
1869
1869
|
g.adler = e.check = 1, e.mode = 12;
|
|
1870
1870
|
case 12:
|
|
1871
1871
|
if (C === 5 || C === 6) break t;
|
|
@@ -1876,7 +1876,7 @@ function Ut() {
|
|
|
1876
1876
|
}
|
|
1877
1877
|
for (; x < 3; ) {
|
|
1878
1878
|
if (M === 0) break t;
|
|
1879
|
-
M--, I += B[
|
|
1879
|
+
M--, I += B[P++] << x, x += 8;
|
|
1880
1880
|
}
|
|
1881
1881
|
switch (e.last = 1 & I, x -= 1, 3 & (I >>>= 1)) {
|
|
1882
1882
|
case 0:
|
|
@@ -1897,7 +1897,7 @@ function Ut() {
|
|
|
1897
1897
|
case 14:
|
|
1898
1898
|
for (I >>>= 7 & x, x -= 7 & x; x < 32; ) {
|
|
1899
1899
|
if (M === 0) break t;
|
|
1900
|
-
M--, I += B[
|
|
1900
|
+
M--, I += B[P++] << x, x += 8;
|
|
1901
1901
|
}
|
|
1902
1902
|
if ((65535 & I) != (I >>> 16 ^ 65535)) {
|
|
1903
1903
|
g.msg = "invalid stored block lengths", e.mode = 30;
|
|
@@ -1909,7 +1909,7 @@ function Ut() {
|
|
|
1909
1909
|
case 16:
|
|
1910
1910
|
if (W = e.length) {
|
|
1911
1911
|
if (M < W && (W = M), J < W && (W = J), W === 0) break t;
|
|
1912
|
-
u.arraySet(q, B,
|
|
1912
|
+
u.arraySet(q, B, P, W, Q), M -= W, P += W, J -= W, Q += W, e.length -= W;
|
|
1913
1913
|
break;
|
|
1914
1914
|
}
|
|
1915
1915
|
e.mode = 12;
|
|
@@ -1917,7 +1917,7 @@ function Ut() {
|
|
|
1917
1917
|
case 17:
|
|
1918
1918
|
for (; x < 14; ) {
|
|
1919
1919
|
if (M === 0) break t;
|
|
1920
|
-
M--, I += B[
|
|
1920
|
+
M--, I += B[P++] << x, x += 8;
|
|
1921
1921
|
}
|
|
1922
1922
|
if (e.nlen = 257 + (31 & I), I >>>= 5, x -= 5, e.ndist = 1 + (31 & I), I >>>= 5, x -= 5, e.ncode = 4 + (15 & I), I >>>= 4, x -= 4, 286 < e.nlen || 30 < e.ndist) {
|
|
1923
1923
|
g.msg = "too many length or distance symbols", e.mode = 30;
|
|
@@ -1928,7 +1928,7 @@ function Ut() {
|
|
|
1928
1928
|
for (; e.have < e.ncode; ) {
|
|
1929
1929
|
for (; x < 3; ) {
|
|
1930
1930
|
if (M === 0) break t;
|
|
1931
|
-
M--, I += B[
|
|
1931
|
+
M--, I += B[P++] << x, x += 8;
|
|
1932
1932
|
}
|
|
1933
1933
|
e.lens[D[e.have++]] = 7 & I, I >>>= 3, x -= 3;
|
|
1934
1934
|
}
|
|
@@ -1942,14 +1942,14 @@ function Ut() {
|
|
|
1942
1942
|
for (; e.have < e.nlen + e.ndist; ) {
|
|
1943
1943
|
for (; et = (o = e.lencode[I & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & o, !(($ = o >>> 24) <= x); ) {
|
|
1944
1944
|
if (M === 0) break t;
|
|
1945
|
-
M--, I += B[
|
|
1945
|
+
M--, I += B[P++] << x, x += 8;
|
|
1946
1946
|
}
|
|
1947
1947
|
if (st < 16) I >>>= $, x -= $, e.lens[e.have++] = st;
|
|
1948
1948
|
else {
|
|
1949
1949
|
if (st === 16) {
|
|
1950
1950
|
for (d = $ + 2; x < d; ) {
|
|
1951
1951
|
if (M === 0) break t;
|
|
1952
|
-
M--, I += B[
|
|
1952
|
+
M--, I += B[P++] << x, x += 8;
|
|
1953
1953
|
}
|
|
1954
1954
|
if (I >>>= $, x -= $, e.have === 0) {
|
|
1955
1955
|
g.msg = "invalid bit length repeat", e.mode = 30;
|
|
@@ -1959,13 +1959,13 @@ function Ut() {
|
|
|
1959
1959
|
} else if (st === 17) {
|
|
1960
1960
|
for (d = $ + 3; x < d; ) {
|
|
1961
1961
|
if (M === 0) break t;
|
|
1962
|
-
M--, I += B[
|
|
1962
|
+
M--, I += B[P++] << x, x += 8;
|
|
1963
1963
|
}
|
|
1964
1964
|
x -= $, t = 0, W = 3 + (7 & (I >>>= $)), I >>>= 3, x -= 3;
|
|
1965
1965
|
} else {
|
|
1966
1966
|
for (d = $ + 7; x < d; ) {
|
|
1967
1967
|
if (M === 0) break t;
|
|
1968
|
-
M--, I += B[
|
|
1968
|
+
M--, I += B[P++] << x, x += 8;
|
|
1969
1969
|
}
|
|
1970
1970
|
x -= $, t = 0, W = 11 + (127 & (I >>>= $)), I >>>= 7, x -= 7;
|
|
1971
1971
|
}
|
|
@@ -1994,17 +1994,17 @@ function Ut() {
|
|
|
1994
1994
|
e.mode = 21;
|
|
1995
1995
|
case 21:
|
|
1996
1996
|
if (6 <= M && 258 <= J) {
|
|
1997
|
-
g.next_out = Q, g.avail_out = J, g.next_in =
|
|
1997
|
+
g.next_out = Q, g.avail_out = J, g.next_in = P, g.avail_in = M, e.hold = I, e.bits = x, a(g, Z), Q = g.next_out, q = g.output, J = g.avail_out, P = g.next_in, B = g.input, M = g.avail_in, I = e.hold, x = e.bits, e.mode === 12 && (e.back = -1);
|
|
1998
1998
|
break;
|
|
1999
1999
|
}
|
|
2000
2000
|
for (e.back = 0; et = (o = e.lencode[I & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & o, !(($ = o >>> 24) <= x); ) {
|
|
2001
2001
|
if (M === 0) break t;
|
|
2002
|
-
M--, I += B[
|
|
2002
|
+
M--, I += B[P++] << x, x += 8;
|
|
2003
2003
|
}
|
|
2004
2004
|
if (et && (240 & et) == 0) {
|
|
2005
2005
|
for (it = $, ht = et, lt = st; et = (o = e.lencode[lt + ((I & (1 << it + ht) - 1) >> it)]) >>> 16 & 255, st = 65535 & o, !(it + ($ = o >>> 24) <= x); ) {
|
|
2006
2006
|
if (M === 0) break t;
|
|
2007
|
-
M--, I += B[
|
|
2007
|
+
M--, I += B[P++] << x, x += 8;
|
|
2008
2008
|
}
|
|
2009
2009
|
I >>>= it, x -= it, e.back += it;
|
|
2010
2010
|
}
|
|
@@ -2025,7 +2025,7 @@ function Ut() {
|
|
|
2025
2025
|
if (e.extra) {
|
|
2026
2026
|
for (d = e.extra; x < d; ) {
|
|
2027
2027
|
if (M === 0) break t;
|
|
2028
|
-
M--, I += B[
|
|
2028
|
+
M--, I += B[P++] << x, x += 8;
|
|
2029
2029
|
}
|
|
2030
2030
|
e.length += I & (1 << e.extra) - 1, I >>>= e.extra, x -= e.extra, e.back += e.extra;
|
|
2031
2031
|
}
|
|
@@ -2033,12 +2033,12 @@ function Ut() {
|
|
|
2033
2033
|
case 23:
|
|
2034
2034
|
for (; et = (o = e.distcode[I & (1 << e.distbits) - 1]) >>> 16 & 255, st = 65535 & o, !(($ = o >>> 24) <= x); ) {
|
|
2035
2035
|
if (M === 0) break t;
|
|
2036
|
-
M--, I += B[
|
|
2036
|
+
M--, I += B[P++] << x, x += 8;
|
|
2037
2037
|
}
|
|
2038
2038
|
if ((240 & et) == 0) {
|
|
2039
2039
|
for (it = $, ht = et, lt = st; et = (o = e.distcode[lt + ((I & (1 << it + ht) - 1) >> it)]) >>> 16 & 255, st = 65535 & o, !(it + ($ = o >>> 24) <= x); ) {
|
|
2040
2040
|
if (M === 0) break t;
|
|
2041
|
-
M--, I += B[
|
|
2041
|
+
M--, I += B[P++] << x, x += 8;
|
|
2042
2042
|
}
|
|
2043
2043
|
I >>>= it, x -= it, e.back += it;
|
|
2044
2044
|
}
|
|
@@ -2051,7 +2051,7 @@ function Ut() {
|
|
|
2051
2051
|
if (e.extra) {
|
|
2052
2052
|
for (d = e.extra; x < d; ) {
|
|
2053
2053
|
if (M === 0) break t;
|
|
2054
|
-
M--, I += B[
|
|
2054
|
+
M--, I += B[P++] << x, x += 8;
|
|
2055
2055
|
}
|
|
2056
2056
|
e.offset += I & (1 << e.extra) - 1, I >>>= e.extra, x -= e.extra, e.back += e.extra;
|
|
2057
2057
|
}
|
|
@@ -2080,7 +2080,7 @@ function Ut() {
|
|
|
2080
2080
|
if (e.wrap) {
|
|
2081
2081
|
for (; x < 32; ) {
|
|
2082
2082
|
if (M === 0) break t;
|
|
2083
|
-
M--, I |= B[
|
|
2083
|
+
M--, I |= B[P++] << x, x += 8;
|
|
2084
2084
|
}
|
|
2085
2085
|
if (Z -= J, g.total_out += Z, e.total += Z, Z && (g.adler = e.check = e.flags ? n(e.check, q, Z, Q - Z) : l(e.check, q, Z, Q - Z)), Z = J, (e.flags ? I : s(I)) !== e.check) {
|
|
2086
2086
|
g.msg = "incorrect data check", e.mode = 30;
|
|
@@ -2093,7 +2093,7 @@ function Ut() {
|
|
|
2093
2093
|
if (e.wrap && e.flags) {
|
|
2094
2094
|
for (; x < 32; ) {
|
|
2095
2095
|
if (M === 0) break t;
|
|
2096
|
-
M--, I += B[
|
|
2096
|
+
M--, I += B[P++] << x, x += 8;
|
|
2097
2097
|
}
|
|
2098
2098
|
if (I !== (4294967295 & e.total)) {
|
|
2099
2099
|
g.msg = "incorrect length check", e.mode = 30;
|
|
@@ -2114,7 +2114,7 @@ function Ut() {
|
|
|
2114
2114
|
default:
|
|
2115
2115
|
return i;
|
|
2116
2116
|
}
|
|
2117
|
-
return g.next_out = Q, g.avail_out = J, g.next_in =
|
|
2117
|
+
return g.next_out = Q, g.avail_out = J, g.next_in = P, g.avail_in = M, e.hold = I, e.bits = x, (e.wsize || Z !== g.avail_out && e.mode < 30 && (e.mode < 27 || C !== 4)) && Y(g, g.output, g.next_out, Z - g.avail_out) ? (e.mode = 31, -4) : (X -= g.avail_in, Z -= g.avail_out, g.total_in += X, g.total_out += Z, e.total += Z, e.wrap && Z && (g.adler = e.check = e.flags ? n(e.check, q, Z, g.next_out - Z) : l(e.check, q, Z, g.next_out - Z)), g.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (X == 0 && Z === 0 || C === 4) && z === _ && (z = -5), z);
|
|
2118
2118
|
}, y.inflateEnd = function(g) {
|
|
2119
2119
|
if (!g || !g.state) return i;
|
|
2120
2120
|
var C = g.state;
|
|
@@ -2129,7 +2129,7 @@ function Ut() {
|
|
|
2129
2129
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(b, F, y) {
|
|
2130
2130
|
var u = b("../utils/common"), l = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], n = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78], a = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], m = [16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
|
|
2131
2131
|
F.exports = function(v, f, _, i, c, r, h, s) {
|
|
2132
|
-
var p, w, A, E, N, T,
|
|
2132
|
+
var p, w, A, E, N, T, L, O, H, Y = s.bits, g = 0, C = 0, e = 0, B = 0, q = 0, P = 0, Q = 0, M = 0, J = 0, I = 0, x = null, X = 0, Z = new u.Buf16(16), W = new u.Buf16(16), nt = null, ot = 0;
|
|
2133
2133
|
for (g = 0; g <= 15; g++) Z[g] = 0;
|
|
2134
2134
|
for (C = 0; C < i; C++) Z[f[_ + C]]++;
|
|
2135
2135
|
for (q = Y, B = 15; 1 <= B && Z[B] === 0; B--) ;
|
|
@@ -2139,18 +2139,18 @@ function Ut() {
|
|
|
2139
2139
|
if (0 < M && (v === 0 || B !== 1)) return -1;
|
|
2140
2140
|
for (W[1] = 0, g = 1; g < 15; g++) W[g + 1] = W[g] + Z[g];
|
|
2141
2141
|
for (C = 0; C < i; C++) f[_ + C] !== 0 && (h[W[f[_ + C]]++] = C);
|
|
2142
|
-
if (T = v === 0 ? (x = nt = h, 19) : v === 1 ? (x = l, X -= 257, nt = n, ot -= 257, 256) : (x = a, nt = m, -1), g = e, N = r, Q = C = I = 0, A = -1, E = (J = 1 << (
|
|
2142
|
+
if (T = v === 0 ? (x = nt = h, 19) : v === 1 ? (x = l, X -= 257, nt = n, ot -= 257, 256) : (x = a, nt = m, -1), g = e, N = r, Q = C = I = 0, A = -1, E = (J = 1 << (P = q)) - 1, v === 1 && 852 < J || v === 2 && 592 < J) return 1;
|
|
2143
2143
|
for (; ; ) {
|
|
2144
|
-
for (
|
|
2144
|
+
for (L = g - Q, H = h[C] < T ? (O = 0, h[C]) : h[C] > T ? (O = nt[ot + h[C]], x[X + h[C]]) : (O = 96, 0), p = 1 << g - Q, e = w = 1 << P; c[N + (I >> Q) + (w -= p)] = L << 24 | O << 16 | H | 0, w !== 0; ) ;
|
|
2145
2145
|
for (p = 1 << g - 1; I & p; ) p >>= 1;
|
|
2146
2146
|
if (p !== 0 ? (I &= p - 1, I += p) : I = 0, C++, --Z[g] == 0) {
|
|
2147
2147
|
if (g === B) break;
|
|
2148
2148
|
g = f[_ + h[C]];
|
|
2149
2149
|
}
|
|
2150
2150
|
if (q < g && (I & E) !== A) {
|
|
2151
|
-
for (Q === 0 && (Q = q), N += e, M = 1 << (
|
|
2152
|
-
if (J += 1 <<
|
|
2153
|
-
c[A = I & E] = q << 24 |
|
|
2151
|
+
for (Q === 0 && (Q = q), N += e, M = 1 << (P = g - Q); P + Q < B && !((M -= Z[P + Q]) <= 0); ) P++, M <<= 1;
|
|
2152
|
+
if (J += 1 << P, v === 1 && 852 < J || v === 2 && 592 < J) return 1;
|
|
2153
|
+
c[A = I & E] = q << 24 | P << 16 | N - r | 0;
|
|
2154
2154
|
}
|
|
2155
2155
|
}
|
|
2156
2156
|
return I !== 0 && (c[N + I] = g - Q << 24 | 64 << 16 | 0), s.bits = q, 0;
|
|
@@ -2162,7 +2162,7 @@ function Ut() {
|
|
|
2162
2162
|
function a(o) {
|
|
2163
2163
|
for (var k = o.length; 0 <= --k; ) o[k] = 0;
|
|
2164
2164
|
}
|
|
2165
|
-
var m = 0, v = 29, f = 256, _ = f + 1 + v, i = 30, c = 19, r = 2 * _ + 1, h = 15, s = 16, p = 7, w = 256, A = 16, E = 17, N = 18, T = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0],
|
|
2165
|
+
var m = 0, v = 29, f = 256, _ = f + 1 + v, i = 30, c = 19, r = 2 * _ + 1, h = 15, s = 16, p = 7, w = 256, A = 16, E = 17, N = 18, T = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], L = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], O = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], H = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Y = new Array(2 * (_ + 2));
|
|
2166
2166
|
a(Y);
|
|
2167
2167
|
var g = new Array(2 * i);
|
|
2168
2168
|
a(g);
|
|
@@ -2172,7 +2172,7 @@ function Ut() {
|
|
|
2172
2172
|
a(e);
|
|
2173
2173
|
var B = new Array(v);
|
|
2174
2174
|
a(B);
|
|
2175
|
-
var q,
|
|
2175
|
+
var q, P, Q, M = new Array(i);
|
|
2176
2176
|
function J(o, k, D, U, S) {
|
|
2177
2177
|
this.static_tree = o, this.extra_bits = k, this.extra_base = D, this.elems = U, this.max_length = S, this.has_stree = o && o.length;
|
|
2178
2178
|
}
|
|
@@ -2196,8 +2196,8 @@ function Ut() {
|
|
|
2196
2196
|
return D >>> 1;
|
|
2197
2197
|
}
|
|
2198
2198
|
function ot(o, k, D) {
|
|
2199
|
-
var U, S, j = new Array(h + 1),
|
|
2200
|
-
for (U = 1; U <= h; U++) j[U] =
|
|
2199
|
+
var U, S, j = new Array(h + 1), V = 0;
|
|
2200
|
+
for (U = 1; U <= h; U++) j[U] = V = V + D[U - 1] << 1;
|
|
2201
2201
|
for (S = 0; S <= k; S++) {
|
|
2202
2202
|
var G = o[2 * S + 1];
|
|
2203
2203
|
G !== 0 && (o[2 * S] = nt(j[G]++, G));
|
|
@@ -2222,16 +2222,16 @@ function Ut() {
|
|
|
2222
2222
|
o.heap[D] = U;
|
|
2223
2223
|
}
|
|
2224
2224
|
function ht(o, k, D) {
|
|
2225
|
-
var U, S, j,
|
|
2226
|
-
if (o.last_lit !== 0) for (; U = o.pending_buf[o.d_buf + 2 * G] << 8 | o.pending_buf[o.d_buf + 2 * G + 1], S = o.pending_buf[o.l_buf + G], G++, U === 0 ? W(o, S, k) : (W(o, (j = e[S]) + f + 1, k), (
|
|
2225
|
+
var U, S, j, V, G = 0;
|
|
2226
|
+
if (o.last_lit !== 0) for (; U = o.pending_buf[o.d_buf + 2 * G] << 8 | o.pending_buf[o.d_buf + 2 * G + 1], S = o.pending_buf[o.l_buf + G], G++, U === 0 ? W(o, S, k) : (W(o, (j = e[S]) + f + 1, k), (V = T[j]) !== 0 && Z(o, S -= B[j], V), W(o, j = x(--U), D), (V = L[j]) !== 0 && Z(o, U -= M[j], V)), G < o.last_lit; ) ;
|
|
2227
2227
|
W(o, w, k);
|
|
2228
2228
|
}
|
|
2229
2229
|
function lt(o, k) {
|
|
2230
|
-
var D, U, S, j = k.dyn_tree,
|
|
2231
|
-
for (o.heap_len = 0, o.heap_max = r, D = 0; D <
|
|
2232
|
-
for (; o.heap_len < 2; ) j[2 * (S = o.heap[++o.heap_len] = rt < 2 ? ++rt : 0)] = 1, o.depth[S] = 0, o.opt_len--, G && (o.static_len -=
|
|
2230
|
+
var D, U, S, j = k.dyn_tree, V = k.stat_desc.static_tree, G = k.stat_desc.has_stree, K = k.stat_desc.elems, rt = -1;
|
|
2231
|
+
for (o.heap_len = 0, o.heap_max = r, D = 0; D < K; D++) j[2 * D] !== 0 ? (o.heap[++o.heap_len] = rt = D, o.depth[D] = 0) : j[2 * D + 1] = 0;
|
|
2232
|
+
for (; o.heap_len < 2; ) j[2 * (S = o.heap[++o.heap_len] = rt < 2 ? ++rt : 0)] = 1, o.depth[S] = 0, o.opt_len--, G && (o.static_len -= V[2 * S + 1]);
|
|
2233
2233
|
for (k.max_code = rt, D = o.heap_len >> 1; 1 <= D; D--) it(o, j, D);
|
|
2234
|
-
for (S =
|
|
2234
|
+
for (S = K; D = o.heap[1], o.heap[1] = o.heap[o.heap_len--], it(o, j, 1), U = o.heap[1], o.heap[--o.heap_max] = D, o.heap[--o.heap_max] = U, j[2 * S] = j[2 * D] + j[2 * U], o.depth[S] = (o.depth[D] >= o.depth[U] ? o.depth[D] : o.depth[U]) + 1, j[2 * D + 1] = j[2 * U + 1] = S, o.heap[1] = S++, it(o, j, 1), 2 <= o.heap_len; ) ;
|
|
2235
2235
|
o.heap[--o.heap_max] = o.heap[1], function(tt, ut) {
|
|
2236
2236
|
var pt, dt, mt, at, bt, Et, ft = ut.dyn_tree, St = ut.max_code, Tt = ut.stat_desc.static_tree, Ct = ut.stat_desc.has_stree, zt = ut.stat_desc.extra_bits, xt = ut.stat_desc.extra_base, _t = ut.stat_desc.max_length, vt = 0;
|
|
2237
2237
|
for (at = 0; at <= h; at++) tt.bl_count[at] = 0;
|
|
@@ -2246,55 +2246,55 @@ function Ut() {
|
|
|
2246
2246
|
}(o, k), ot(j, rt, o.bl_count);
|
|
2247
2247
|
}
|
|
2248
2248
|
function t(o, k, D) {
|
|
2249
|
-
var U, S, j = -1,
|
|
2250
|
-
for (
|
|
2249
|
+
var U, S, j = -1, V = k[1], G = 0, K = 7, rt = 4;
|
|
2250
|
+
for (V === 0 && (K = 138, rt = 3), k[2 * (D + 1) + 1] = 65535, U = 0; U <= D; U++) S = V, V = k[2 * (U + 1) + 1], ++G < K && S === V || (G < rt ? o.bl_tree[2 * S] += G : S !== 0 ? (S !== j && o.bl_tree[2 * S]++, o.bl_tree[2 * A]++) : G <= 10 ? o.bl_tree[2 * E]++ : o.bl_tree[2 * N]++, j = S, rt = (G = 0) === V ? (K = 138, 3) : S === V ? (K = 6, 3) : (K = 7, 4));
|
|
2251
2251
|
}
|
|
2252
2252
|
function z(o, k, D) {
|
|
2253
|
-
var U, S, j = -1,
|
|
2254
|
-
for (
|
|
2253
|
+
var U, S, j = -1, V = k[1], G = 0, K = 7, rt = 4;
|
|
2254
|
+
for (V === 0 && (K = 138, rt = 3), U = 0; U <= D; U++) if (S = V, V = k[2 * (U + 1) + 1], !(++G < K && S === V)) {
|
|
2255
2255
|
if (G < rt) for (; W(o, S, o.bl_tree), --G != 0; ) ;
|
|
2256
2256
|
else S !== 0 ? (S !== j && (W(o, S, o.bl_tree), G--), W(o, A, o.bl_tree), Z(o, G - 3, 2)) : G <= 10 ? (W(o, E, o.bl_tree), Z(o, G - 3, 3)) : (W(o, N, o.bl_tree), Z(o, G - 11, 7));
|
|
2257
|
-
j = S, rt = (G = 0) ===
|
|
2257
|
+
j = S, rt = (G = 0) === V ? (K = 138, 3) : S === V ? (K = 6, 3) : (K = 7, 4);
|
|
2258
2258
|
}
|
|
2259
2259
|
}
|
|
2260
2260
|
a(M);
|
|
2261
2261
|
var R = !1;
|
|
2262
2262
|
function d(o, k, D, U) {
|
|
2263
|
-
Z(o, (m << 1) + (U ? 1 : 0), 3), function(S, j,
|
|
2264
|
-
et(S), X(S,
|
|
2263
|
+
Z(o, (m << 1) + (U ? 1 : 0), 3), function(S, j, V, G) {
|
|
2264
|
+
et(S), X(S, V), X(S, ~V), u.arraySet(S.pending_buf, S.window, j, V, S.pending), S.pending += V;
|
|
2265
2265
|
}(o, k, D);
|
|
2266
2266
|
}
|
|
2267
2267
|
y._tr_init = function(o) {
|
|
2268
2268
|
R || (function() {
|
|
2269
|
-
var k, D, U, S, j,
|
|
2269
|
+
var k, D, U, S, j, V = new Array(h + 1);
|
|
2270
2270
|
for (S = U = 0; S < v - 1; S++) for (B[S] = U, k = 0; k < 1 << T[S]; k++) e[U++] = S;
|
|
2271
|
-
for (e[U - 1] = S, S = j = 0; S < 16; S++) for (M[S] = j, k = 0; k < 1 <<
|
|
2272
|
-
for (j >>= 7; S < i; S++) for (M[S] = j << 7, k = 0; k < 1 <<
|
|
2273
|
-
for (D = 0; D <= h; D++)
|
|
2274
|
-
for (k = 0; k <= 143; ) Y[2 * k + 1] = 8, k++,
|
|
2275
|
-
for (; k <= 255; ) Y[2 * k + 1] = 9, k++,
|
|
2276
|
-
for (; k <= 279; ) Y[2 * k + 1] = 7, k++,
|
|
2277
|
-
for (; k <= 287; ) Y[2 * k + 1] = 8, k++,
|
|
2278
|
-
for (ot(Y, _ + 1,
|
|
2279
|
-
q = new J(Y, T, f + 1, _, h),
|
|
2280
|
-
}(), R = !0), o.l_desc = new I(o.dyn_ltree, q), o.d_desc = new I(o.dyn_dtree,
|
|
2271
|
+
for (e[U - 1] = S, S = j = 0; S < 16; S++) for (M[S] = j, k = 0; k < 1 << L[S]; k++) C[j++] = S;
|
|
2272
|
+
for (j >>= 7; S < i; S++) for (M[S] = j << 7, k = 0; k < 1 << L[S] - 7; k++) C[256 + j++] = S;
|
|
2273
|
+
for (D = 0; D <= h; D++) V[D] = 0;
|
|
2274
|
+
for (k = 0; k <= 143; ) Y[2 * k + 1] = 8, k++, V[8]++;
|
|
2275
|
+
for (; k <= 255; ) Y[2 * k + 1] = 9, k++, V[9]++;
|
|
2276
|
+
for (; k <= 279; ) Y[2 * k + 1] = 7, k++, V[7]++;
|
|
2277
|
+
for (; k <= 287; ) Y[2 * k + 1] = 8, k++, V[8]++;
|
|
2278
|
+
for (ot(Y, _ + 1, V), k = 0; k < i; k++) g[2 * k + 1] = 5, g[2 * k] = nt(k, 5);
|
|
2279
|
+
q = new J(Y, T, f + 1, _, h), P = new J(g, L, 0, i, h), Q = new J(new Array(0), O, 0, c, p);
|
|
2280
|
+
}(), R = !0), o.l_desc = new I(o.dyn_ltree, q), o.d_desc = new I(o.dyn_dtree, P), o.bl_desc = new I(o.bl_tree, Q), o.bi_buf = 0, o.bi_valid = 0, $(o);
|
|
2281
2281
|
}, y._tr_stored_block = d, y._tr_flush_block = function(o, k, D, U) {
|
|
2282
|
-
var S, j,
|
|
2282
|
+
var S, j, V = 0;
|
|
2283
2283
|
0 < o.level ? (o.strm.data_type === 2 && (o.strm.data_type = function(G) {
|
|
2284
|
-
var
|
|
2285
|
-
for (
|
|
2284
|
+
var K, rt = 4093624447;
|
|
2285
|
+
for (K = 0; K <= 31; K++, rt >>>= 1) if (1 & rt && G.dyn_ltree[2 * K] !== 0) return l;
|
|
2286
2286
|
if (G.dyn_ltree[18] !== 0 || G.dyn_ltree[20] !== 0 || G.dyn_ltree[26] !== 0) return n;
|
|
2287
|
-
for (
|
|
2287
|
+
for (K = 32; K < f; K++) if (G.dyn_ltree[2 * K] !== 0) return n;
|
|
2288
2288
|
return l;
|
|
2289
|
-
}(o)), lt(o, o.l_desc), lt(o, o.d_desc),
|
|
2290
|
-
var
|
|
2291
|
-
for (t(G, G.dyn_ltree, G.l_desc.max_code), t(G, G.dyn_dtree, G.d_desc.max_code), lt(G, G.bl_desc),
|
|
2292
|
-
return G.opt_len += 3 * (
|
|
2293
|
-
}(o), S = o.opt_len + 3 + 7 >>> 3, (j = o.static_len + 3 + 7 >>> 3) <= S && (S = j)) : S = j = D + 5, D + 4 <= S && k !== -1 ? d(o, k, D, U) : o.strategy === 4 || j === S ? (Z(o, 2 + (U ? 1 : 0), 3), ht(o, Y, g)) : (Z(o, 4 + (U ? 1 : 0), 3), function(G,
|
|
2289
|
+
}(o)), lt(o, o.l_desc), lt(o, o.d_desc), V = function(G) {
|
|
2290
|
+
var K;
|
|
2291
|
+
for (t(G, G.dyn_ltree, G.l_desc.max_code), t(G, G.dyn_dtree, G.d_desc.max_code), lt(G, G.bl_desc), K = c - 1; 3 <= K && G.bl_tree[2 * H[K] + 1] === 0; K--) ;
|
|
2292
|
+
return G.opt_len += 3 * (K + 1) + 5 + 5 + 4, K;
|
|
2293
|
+
}(o), S = o.opt_len + 3 + 7 >>> 3, (j = o.static_len + 3 + 7 >>> 3) <= S && (S = j)) : S = j = D + 5, D + 4 <= S && k !== -1 ? d(o, k, D, U) : o.strategy === 4 || j === S ? (Z(o, 2 + (U ? 1 : 0), 3), ht(o, Y, g)) : (Z(o, 4 + (U ? 1 : 0), 3), function(G, K, rt, tt) {
|
|
2294
2294
|
var ut;
|
|
2295
|
-
for (Z(G,
|
|
2296
|
-
z(G, G.dyn_ltree,
|
|
2297
|
-
}(o, o.l_desc.max_code + 1, o.d_desc.max_code + 1,
|
|
2295
|
+
for (Z(G, K - 257, 5), Z(G, rt - 1, 5), Z(G, tt - 4, 4), ut = 0; ut < tt; ut++) Z(G, G.bl_tree[2 * H[ut] + 1], 3);
|
|
2296
|
+
z(G, G.dyn_ltree, K - 1), z(G, G.dyn_dtree, rt - 1);
|
|
2297
|
+
}(o, o.l_desc.max_code + 1, o.d_desc.max_code + 1, V + 1), ht(o, o.dyn_ltree, o.dyn_dtree)), $(o), U && et(o);
|
|
2298
2298
|
}, y._tr_tally = function(o, k, D) {
|
|
2299
2299
|
return o.pending_buf[o.d_buf + 2 * o.last_lit] = k >>> 8 & 255, o.pending_buf[o.d_buf + 2 * o.last_lit + 1] = 255 & k, o.pending_buf[o.l_buf + o.last_lit] = 255 & D, o.last_lit++, k === 0 ? o.dyn_ltree[2 * D]++ : (o.matches++, k--, o.dyn_ltree[2 * (e[D] + f + 1)]++, o.dyn_dtree[2 * x(k)]++), o.last_lit === o.lit_bufsize - 1;
|
|
2300
2300
|
}, y._tr_align = function(o) {
|
|
@@ -2353,22 +2353,22 @@ function Ut() {
|
|
|
2353
2353
|
c = !0;
|
|
2354
2354
|
try {
|
|
2355
2355
|
(function(N) {
|
|
2356
|
-
var T = N.callback,
|
|
2357
|
-
switch (
|
|
2356
|
+
var T = N.callback, L = N.args;
|
|
2357
|
+
switch (L.length) {
|
|
2358
2358
|
case 0:
|
|
2359
2359
|
T();
|
|
2360
2360
|
break;
|
|
2361
2361
|
case 1:
|
|
2362
|
-
T(
|
|
2362
|
+
T(L[0]);
|
|
2363
2363
|
break;
|
|
2364
2364
|
case 2:
|
|
2365
|
-
T(
|
|
2365
|
+
T(L[0], L[1]);
|
|
2366
2366
|
break;
|
|
2367
2367
|
case 3:
|
|
2368
|
-
T(
|
|
2368
|
+
T(L[0], L[1], L[2]);
|
|
2369
2369
|
break;
|
|
2370
2370
|
default:
|
|
2371
|
-
T.apply(n,
|
|
2371
|
+
T.apply(n, L);
|
|
2372
2372
|
}
|
|
2373
2373
|
})(E);
|
|
2374
2374
|
} finally {
|