@feedmepos/mf-menu 0.32.49-dev → 0.32.49
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-B01olmCo.js → App-DWwqICgN.js} +7 -7
- package/dist/{ApplyProduct.vue_vue_type_script_setup_true_lang-Bu_IpREq.js → ApplyProduct.vue_vue_type_script_setup_true_lang-DGM-pqCB.js} +3 -3
- package/dist/{ApplyProductDialog.vue_vue_type_script_setup_true_lang-DZwJeAGh.js → ApplyProductDialog.vue_vue_type_script_setup_true_lang-Bt0T0Q9-.js} +2 -2
- package/dist/{Catalog-BgrrIuxf.js → Catalog-Bj04dO46.js} +6 -6
- package/dist/{Category-CDGXCGQN.js → Category-B0c9uXCq.js} +4 -4
- package/dist/{Category-YxTmAvys.js → Category-CvpBi1HT.js} +4 -4
- package/dist/{CookingGuide-BVtJs_Kn.js → CookingGuide-YzbN_xWq.js} +4 -4
- package/dist/{CustomAttributeChip.vue_vue_type_script_setup_true_lang-DfGBraA0.js → CustomAttributeChip.vue_vue_type_script_setup_true_lang-CnspihW3.js} +1 -1
- package/dist/{Group-Bjv6mYE2.js → Group-BqlrVpS1.js} +3 -3
- package/dist/{Group-oZVciF9U.js → Group-CjNy_UQt.js} +1 -1
- package/dist/{Group.vue_vue_type_script_setup_true_lang-DG8xGjYM.js → Group.vue_vue_type_script_setup_true_lang-vST-RMKe.js} +7 -7
- package/dist/{GroupMarkupPriceDialog.vue_vue_type_script_setup_true_lang-B1NvTvHU.js → GroupMarkupPriceDialog.vue_vue_type_script_setup_true_lang-E_WkJitJ.js} +5 -5
- package/dist/{ImportProductDialog.vue_vue_type_script_setup_true_lang-BpgCEGWp.js → ImportProductDialog.vue_vue_type_script_setup_true_lang-Bi8JIOa6.js} +7 -7
- package/dist/{Ingredient-C3w_k7cs.js → Ingredient-CzWptpJk.js} +3 -3
- package/dist/{InventoryBinding.vue_vue_type_script_setup_true_lang-CWzd2Hgc.js → InventoryBinding.vue_vue_type_script_setup_true_lang-CAcRjeYO.js} +2 -2
- package/dist/{LinkProductSideSheet-FMv4heTJ.js → LinkProductSideSheet-Bja4Cszh.js} +3 -3
- package/dist/{MenuSetting-CdG0CM4v.js → MenuSetting-BKz8Lc0o.js} +5 -5
- package/dist/{OrderPacing-DoHRQq6z.js → OrderPacing-hlKmIQe9.js} +5 -5
- package/dist/{PrintRoute-B3ZOdkWb.js → PrintRoute-CIcsTl5w.js} +4 -4
- package/dist/{Product-Bk033TSz.js → Product-DwuCexEe.js} +1 -1
- package/dist/{Product.vue_vue_type_script_setup_true_lang-Cj6YUmHX.js → Product.vue_vue_type_script_setup_true_lang-UwOYzxUw.js} +12 -12
- package/dist/{ProductInternalTools-hksQOO2B.js → ProductInternalTools-DXnnpR8K.js} +6 -6
- package/dist/{Products-Dot3BMR_.js → Products-D9ZEXzTI.js} +51 -51
- package/dist/{Publish-YBItRkDe.js → Publish-RXSNXPhJ.js} +3 -3
- package/dist/{Recipe-CsltmH36.js → Recipe-DVWLtSQ_.js} +4 -4
- package/dist/{RestaurantAttributesSelector.vue_vue_type_script_setup_true_lang-CDFLaIlX.js → RestaurantAttributesSelector.vue_vue_type_script_setup_true_lang-CiZHJDhR.js} +1 -1
- package/dist/{RuleView.vue_vue_type_script_setup_true_lang-DQ59tQmi.js → RuleView.vue_vue_type_script_setup_true_lang-DX9vKQdX.js} +176 -176
- package/dist/{Scheduler-0w8DL3Q_.js → Scheduler-Do-a3Cfo.js} +3 -3
- package/dist/{ServingSequence-CJYonk8g.js → ServingSequence-CwZ325jQ.js} +3 -3
- package/dist/{Setting-D0WgF4wm.js → Setting-BSszW7wy.js} +5 -5
- package/dist/{Subcategory-Byk1LOXo.js → Subcategory-Dht6gqhP.js} +5 -5
- package/dist/{Takeaway-Bn8HxGmV.js → Takeaway-BupuOrs5.js} +1 -1
- package/dist/{Takeaway-DQ-QWxj0.js → Takeaway-CwldkuES.js} +4 -4
- package/dist/{Takeaway.vue_vue_type_script_setup_true_lang-BpTYQzV-.js → Takeaway.vue_vue_type_script_setup_true_lang-CMx4MCzX.js} +5 -5
- package/dist/{Thumbnail.vue_vue_type_script_setup_true_lang-D-FGnIw4.js → Thumbnail.vue_vue_type_script_setup_true_lang-B4F6XwEL.js} +4 -4
- package/dist/{TranslationFieldSection.vue_vue_type_script_setup_true_lang-BhhaNpqT.js → TranslationFieldSection.vue_vue_type_script_setup_true_lang-C1WI2rIi.js} +1 -1
- package/dist/{TranslationSideSheet.vue_vue_type_script_setup_true_lang-B2Nzi_cG.js → TranslationSideSheet.vue_vue_type_script_setup_true_lang-BQn-Iym4.js} +2 -2
- package/dist/{TreeEditorOpenner.vue_vue_type_script_setup_true_lang-Cs-pvp01.js → TreeEditorOpenner.vue_vue_type_script_setup_true_lang-Dn57GJ7T.js} +114 -114
- package/dist/{Unit-DA0hunXt.js → Unit-D3Fpe664.js} +2 -2
- package/dist/{Variant-xzGvnmWi.js → Variant-AtN90DMV.js} +3 -3
- package/dist/{_id_-Bo8nUn6W.js → _id_-B76MDa4v.js} +9 -9
- package/dist/{app-B_pjPiJt.js → app-CDxIgV5P.js} +1 -1
- package/dist/{app-CxwU6oD_.js → app-DpeCSTH8.js} +32 -32
- package/dist/app.js +1 -1
- package/dist/assets/{linked-status-CLi0ZaMP.js → linked-status-BslgSQ_X.js} +2 -2
- package/dist/assets/{menu-export-tgemEoin.js → menu-export-Cz7GqhAg.js} +3 -3
- package/dist/assets/{override-menu-B2_pGKQ5.js → override-menu-DHtDBJkL.js} +2 -2
- package/dist/assets/{validate-menu-zFkBYOrT.js → validate-menu-D2RWU23-.js} +5 -5
- package/dist/{catalog-DCmaXyCR.js → catalog-DggxiDFI.js} +1 -1
- package/dist/{catalogSetting-BMdkGbQA.js → catalogSetting-CsodrJyH.js} +1 -1
- package/dist/{currency-BJl6Cdom.js → currency-Dik39bFt.js} +1 -1
- package/dist/{dayjs.min-CrqXlTYe.js → dayjs.min-CtPRPF6H.js} +2 -2
- package/dist/{index-DCQdFiEM.js → index-CZ0zKCWR.js} +5 -5
- package/dist/{index-5AaSAY-w.js → index-CnD7dG32.js} +4 -4
- package/dist/{index.vue_vue_type_script_setup_true_lang-B1eRJHco.js → index.vue_vue_type_script_setup_true_lang-ayMUXcas.js} +7 -7
- package/dist/{item-Bkin6GCJ.js → item-vne0HbEn.js} +364 -364
- package/dist/{jszip.min-C7u5SEBq.js → jszip.min-CZGbdgZ_.js} +153 -153
- package/dist/{menu-CqrBIw8_.js → menu-BO6E5Ts_.js} +1 -1
- package/dist/{menuV2-DbnFxkWz.js → menuV2-B83JGuiX.js} +53 -53
- package/dist/mf-menu.css +1 -1
- package/dist/{order_pacing-Sk-V86me.js → order_pacing-AsrGCnda.js} +5 -5
- package/dist/{priceTier-0-_3YORa.js → priceTier-BSeu0mIP.js} +1 -1
- package/dist/{rules-CSn8QaHv.js → rules-DrZ6Uil3.js} +3 -3
- package/dist/{scheduler-CrOEXWb4.js → scheduler-CN9BIv5w.js} +4 -4
- package/dist/{toExcel-fLdoWcMu.js → toExcel-4AZNWspR.js} +2 -2
- package/dist/{unit-SuZbxNh5.js → unit-Dn2l5Mz-.js} +2 -2
- package/package.json +1 -1
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
import { c as ct, g as Bt } from "./app-
|
|
2
|
-
import { a1 as wt } from "./index.vue_vue_type_script_setup_true_lang-
|
|
1
|
+
import { c as ct, g as Bt } from "./app-DpeCSTH8.js";
|
|
2
|
+
import { a1 as wt } from "./index.vue_vue_type_script_setup_true_lang-ayMUXcas.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_e62a1121-4c16-4708-b5fe-9e260156ab22", 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_e62a1121-4c16-4708-b5fe-9e260156ab22", PIPX_HOME: "/opt/pipx", FIREBASE_DATABASE_URL: "https://feedme-253402.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", GTM_ID: "GTM-WR8XHXLH", FIREBASE_MESSAGING_SENDER_ID: "128512026847", HOME: "/home/runner", VITE_FEED_ME_NAMESPACE: "production", 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.5.1", 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-zzez732dna-as.a.run.app", VITE_FEATURE_FLAG_API_KEY: "6GhcttsJ9Rj9cTevcdrpin", SYSTEMD_EXEC_PID: "1882", ACTIONS_ORCHESTRATION_ID: "721c02dc-118e-4ffb-94dc-06245c9d523e.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: "20260525.161.1", LOGNAME: "runner", RUNNER_OS: "Linux", GITHUB_API_URL: "https://api.github.com", GOROOT_1_22_X64: "/opt/hostedtoolcache/go/1.22.12/x64", SWIFT_PATH: "/usr/share/swift/usr/bin", PORTAL_BACKEND_URL: "https://portal-v2.feedmeapi.com", CHROMEWEBDRIVER: "/usr/local/share/chromedriver-linux64", GOROOT_1_23_X64: "/opt/hostedtoolcache/go/1.23.12/x64", JOURNAL_STREAM: "9:14953", GITHUB_WORKFLOW: "Publish mf-menu prod", _: "/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.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.10/x64", GITHUB_RUN_ID: "26616293007", VITE_REMY_BACKEND_URL: "https://remy-agent-api.feedmeapi.com", GITHUB_REF_TYPE: "branch", BOOTSTRAP_HASKELL_NONINTERACTIVE: "1", GITHUB_WORKFLOW_SHA: "5acde95f93ba3fe6ab9a125faf12a891225c458d", GITHUB_BASE_REF: "", ImageOS: "ubuntu24", GTM_ENV: "production", FIREBASE_STORAGE_BUCKET: "image.feedme.cc", FIREBASE_MEASUREMENT_ID: "G-LTKS7N2HQS", GITHUB_WORKFLOW_REF: "feedmepos/portal/.github/workflows/publish-mf-menu-prod.yml@refs/heads/main", GITHUB_ACTION_REPOSITORY: "", ENABLE_RUNNER_TRACING: "true", FIREBASE_AUTH_DOMAIN: "feedme-253402.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_27fccce3-7ada-4a9a-bba5-9d06823d49b2", INVOCATION_ID: "7c8e08f3f9814cb4a7f4e7686f7fdc77", 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: "170", GITHUB_TRIGGERING_ACTOR: "CXinyii", RUNNER_ARCH: "X64", XDG_RUNTIME_DIR: "/run/user/1001", AGENT_TOOLSDIRECTORY: "/opt/hostedtoolcache", GTM_SERVER_MEASUREMENT_ID: "G-2MP52PC24R", npm_config_frozen_lockfile: "", LANG: "C.UTF-8", VCPKG_INSTALLATION_ROOT: "/usr/local/share/vcpkg", VITE_LICENSE_API_URL: "https://license-v2.feedmeapi.com", CONDA: "/usr/share/miniconda", RUNNER_NAME: "GitHub Actions 1000073248", 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.49", npm_config_verify_deps_before_run: "false", npm_lifecycle_event: "build:mf", GITHUB_REF_PROTECTED: "true", GTM_DEBUG: "false", FIREBASE_PROJECT_ID: "feedme-253402", GITHUB_WORKSPACE: "/home/runner/work/portal/portal", ACCEPT_EULA: "Y", GITHUB_JOB: "deploy", GITHUB_SHA: "5acde95f93ba3fe6ab9a125faf12a891225c458d", GITHUB_RUN_ATTEMPT: "1", FIREBASE_APP_ID: "1:128512026847:web:7c5c8ab7e8b90502dc616a", ACTIONS_RUNNER_RETURN_JOB_RESULT_FOR_HOSTED: "1", GITHUB_REF: "refs/heads/main", GITHUB_ACTOR: "CXinyii", ANDROID_SDK_ROOT: "/usr/local/lib/android/sdk", GITHUB_PATH: "/home/runner/work/_temp/_runner_file_commands/add_path_e62a1121-4c16-4708-b5fe-9e260156ab22", JAVA_HOME: "/usr/lib/jvm/temurin-17-jdk-amd64", PWD: "/home/runner/work/portal/portal/apps/mf-menu", GITHUB_ACTOR_ID: "139468922", 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_e62a1121-4c16-4708-b5fe-9e260156ab22", 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", SGX_AESM_ADDR: "1", PSModulePath: "/root/.local/share/powershell/Modules:/usr/local/share/powershell/Modules:/opt/microsoft/powershell/7/Modules:/usr/share/az_14.6.0", CHROME_BIN: "/usr/bin/google-chrome", VITE_FEED_ME_CLIENT_ID: "d5f8840d63dbb758b6c4ee2a5e8b013d15dd25e242c457481326062b83962476", 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: "AIzaSyA_isPR1-9bX7UmRiJIhsIRNNwdn6DdmW4", ANDROID_NDK_HOME: "/usr/local/lib/android/sdk/ndk/27.3.13750724", GITHUB_STEP_SUMMARY: "/home/runner/work/_temp/_runner_file_commands/step_summary_e62a1121-4c16-4708-b5fe-9e260156ab22", 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
|
|
@@ -204,16 +204,16 @@ function Ut() {
|
|
|
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);
|
|
207
|
-
var
|
|
208
|
-
Q && (
|
|
207
|
+
var x = 0, X = 0;
|
|
208
|
+
Q && (x |= 16), s === "UNIX" ? (X = 798, x |= function(W, nt) {
|
|
209
209
|
var ot = W;
|
|
210
210
|
return W || (ot = nt ? 16893 : 33204), (65535 & ot) << 16;
|
|
211
|
-
}(E.unixPermissions, Q)) : (X = 20,
|
|
211
|
+
}(E.unixPermissions, Q)) : (X = 20, x |= function(W) {
|
|
212
212
|
return 63 & (W || 0);
|
|
213
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(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(
|
|
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) {
|
|
@@ -1451,7 +1451,7 @@ function Ut() {
|
|
|
1451
1451
|
var z = t.state, R = z.pending;
|
|
1452
1452
|
R > t.avail_out && (R = t.avail_out), R !== 0 && (l.arraySet(t.output, z.pending_buf, z.pending_out, R, t.next_out), t.next_out += R, z.pending_out += R, t.total_out += R, t.avail_out -= R, z.pending -= R, z.pending === 0 && (z.pending_out = 0));
|
|
1453
1453
|
}
|
|
1454
|
-
function
|
|
1454
|
+
function x(t, z) {
|
|
1455
1455
|
n._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, z), t.block_start = t.strstart, I(t.strm);
|
|
1456
1456
|
}
|
|
1457
1457
|
function X(t, z) {
|
|
@@ -1461,7 +1461,7 @@ 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,
|
|
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, K = t.w_mask, G = t.prev, V = 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]) {
|
|
@@ -1474,11 +1474,11 @@ function Ut() {
|
|
|
1474
1474
|
rt = j[k + D - 1], tt = j[k + D];
|
|
1475
1475
|
}
|
|
1476
1476
|
}
|
|
1477
|
-
while ((z = G[z & K]) >
|
|
1477
|
+
while ((z = G[z & K]) > 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,
|
|
1481
|
+
var z, R, d, o, k, D, U, S, j, K, 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,
|
|
1489
|
+
if (D = t.strm, U = t.window, S = t.strstart + t.lookahead, j = o, K = void 0, K = D.avail_in, j < K && (K = j), R = K === 0 ? 0 : (D.avail_in -= K, l.arraySet(U, D.input, D.next_in, K, S), D.state.wrap === 1 ? D.adler = a(D.adler, U, K, S) : D.state.wrap === 2 && (D.adler = m(D.adler, U, K, S)), D.next_in += K, D.total_in += K, K), 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) {
|
|
@@ -1500,9 +1500,9 @@ function Ut() {
|
|
|
1500
1500
|
t.strstart++;
|
|
1501
1501
|
} else t.strstart += t.match_length, t.match_length = 0, t.ins_h = t.window[t.strstart], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 1]) & t.hash_mask;
|
|
1502
1502
|
else d = n._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
|
|
1503
|
-
if (d && (
|
|
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 === _ ? (
|
|
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; ; ) {
|
|
@@ -1512,12 +1512,12 @@ function Ut() {
|
|
|
1512
1512
|
}
|
|
1513
1513
|
if (R = 0, t.lookahead >= O && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = O - 1, R !== 0 && t.prev_length < t.max_lazy_match && t.strstart - R <= t.w_size - Y && (t.match_length = W(t, R), t.match_length <= 5 && (t.strategy === 1 || t.match_length === O && 4096 < t.strstart - t.match_start) && (t.match_length = O - 1)), t.prev_length >= O && t.match_length <= t.prev_length) {
|
|
1514
1514
|
for (o = t.strstart + t.lookahead - O, d = n._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - O), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= o && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, R = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; ) ;
|
|
1515
|
-
if (t.match_available = 0, t.match_length = O - 1, t.strstart++, d && (
|
|
1515
|
+
if (t.match_available = 0, t.match_length = O - 1, t.strstart++, d && (x(t, !1), t.strm.avail_out === 0)) return e;
|
|
1516
1516
|
} else if (t.match_available) {
|
|
1517
|
-
if ((d = n._tr_tally(t, 0, t.window[t.strstart - 1])) &&
|
|
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 === _ ? (
|
|
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;
|
|
@@ -1552,9 +1552,9 @@ function Ut() {
|
|
|
1552
1552
|
}
|
|
1553
1553
|
t.strstart += t.lookahead, t.lookahead = 0;
|
|
1554
1554
|
var d = t.block_start + R;
|
|
1555
|
-
if ((t.strstart === 0 || t.strstart >= d) && (t.lookahead = t.strstart - d, t.strstart = d,
|
|
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 === _ ? (
|
|
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) {
|
|
@@ -1599,31 +1599,31 @@ function Ut() {
|
|
|
1599
1599
|
} else if (t.avail_in === 0 && M(z) <= M(R) && z !== _) return Q(t, -5);
|
|
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
|
-
var U = d.strategy === 2 ? function(
|
|
1602
|
+
var U = d.strategy === 2 ? function(S, j) {
|
|
1603
1603
|
for (var K; ; ) {
|
|
1604
|
-
if (
|
|
1604
|
+
if (S.lookahead === 0 && (nt(S), S.lookahead === 0)) {
|
|
1605
1605
|
if (j === f) return e;
|
|
1606
1606
|
break;
|
|
1607
1607
|
}
|
|
1608
|
-
if (
|
|
1608
|
+
if (S.match_length = 0, K = n._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++, K && (x(S, !1), S.strm.avail_out === 0)) return e;
|
|
1609
1609
|
}
|
|
1610
|
-
return
|
|
1611
|
-
}(d, z) : d.strategy === 3 ? function(
|
|
1612
|
-
for (var K, G, V, rt, tt =
|
|
1613
|
-
if (
|
|
1614
|
-
if (nt(
|
|
1615
|
-
if (
|
|
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
|
+
}(d, z) : d.strategy === 3 ? function(S, j) {
|
|
1612
|
+
for (var K, G, V, rt, tt = S.window; ; ) {
|
|
1613
|
+
if (S.lookahead <= H) {
|
|
1614
|
+
if (nt(S), S.lookahead <= H && j === f) return e;
|
|
1615
|
+
if (S.lookahead === 0) break;
|
|
1616
1616
|
}
|
|
1617
|
-
if (
|
|
1618
|
-
rt =
|
|
1617
|
+
if (S.match_length = 0, S.lookahead >= O && 0 < S.strstart && (G = tt[V = S.strstart - 1]) === tt[++V] && G === tt[++V] && G === tt[++V]) {
|
|
1618
|
+
rt = S.strstart + H;
|
|
1619
1619
|
do
|
|
1620
1620
|
;
|
|
1621
1621
|
while (G === tt[++V] && G === tt[++V] && G === tt[++V] && G === tt[++V] && G === tt[++V] && G === tt[++V] && G === tt[++V] && G === tt[++V] && V < rt);
|
|
1622
|
-
|
|
1622
|
+
S.match_length = H - (rt - V), S.match_length > S.lookahead && (S.match_length = S.lookahead);
|
|
1623
1623
|
}
|
|
1624
|
-
if (
|
|
1624
|
+
if (S.match_length >= O ? (K = n._tr_tally(S, 1, S.match_length - O), S.lookahead -= S.match_length, S.strstart += S.match_length, S.match_length = 0) : (K = n._tr_tally(S, 0, S.window[S.strstart]), S.lookahead--, S.strstart++), K && (x(S, !1), S.strm.avail_out === 0)) return e;
|
|
1625
1625
|
}
|
|
1626
|
-
return
|
|
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
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;
|
|
@@ -1633,13 +1633,13 @@ 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,
|
|
1636
|
+
var R, d, o, k, D, U, S, j, K = 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, K, 0)), R.wrap = 0, K >= 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, K - R.w_size, R.w_size, 0), z = j, K = R.w_size), D = t.avail_in, U = t.next_in,
|
|
1638
|
+
for (k === 1 && (t.adler = a(t.adler, z, K, 0)), R.wrap = 0, K >= 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, K - R.w_size, R.w_size, 0), z = j, K = R.w_size), D = t.avail_in, U = t.next_in, S = t.input, t.avail_in = K, 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
|
}
|
|
1642
|
-
return R.strstart += R.lookahead, R.block_start = R.strstart, R.insert = R.lookahead, R.lookahead = 0, R.match_length = R.prev_length = O - 1, R.match_available = 0, t.next_in = U, t.input =
|
|
1642
|
+
return R.strstart += R.lookahead, R.block_start = R.strstart, R.insert = R.lookahead, R.lookahead = 0, R.match_length = R.prev_length = O - 1, R.match_available = 0, t.next_in = U, t.input = S, t.avail_in = D, R.wrap = k, i;
|
|
1643
1643
|
}, y.deflateInfo = "pako deflate (from Nodeca project)";
|
|
1644
1644
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(b, F, y) {
|
|
1645
1645
|
F.exports = function() {
|
|
@@ -1760,21 +1760,21 @@ function Ut() {
|
|
|
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, P, Q, M, J, I,
|
|
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, P = g.next_in, B = g.input, M = g.avail_in, I = e.hold,
|
|
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) {
|
|
1769
1769
|
e.mode = 13;
|
|
1770
1770
|
break;
|
|
1771
1771
|
}
|
|
1772
|
-
for (;
|
|
1772
|
+
for (; x < 16; ) {
|
|
1773
1773
|
if (M === 0) break t;
|
|
1774
|
-
M--, I += B[P++] <<
|
|
1774
|
+
M--, I += B[P++] << x, x += 8;
|
|
1775
1775
|
}
|
|
1776
1776
|
if (2 & e.wrap && I === 35615) {
|
|
1777
|
-
k[e.check = 0] = 255 & I, k[1] = I >>> 8 & 255, e.check = n(e.check, k, 2, 0),
|
|
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;
|
|
1778
1778
|
break;
|
|
1779
1779
|
}
|
|
1780
1780
|
if (e.flags = 0, e.head && (e.head.done = !1), !(1 & e.wrap) || (((255 & I) << 8) + (I >> 8)) % 31) {
|
|
@@ -1785,17 +1785,17 @@ function Ut() {
|
|
|
1785
1785
|
g.msg = "unknown compression method", e.mode = 30;
|
|
1786
1786
|
break;
|
|
1787
1787
|
}
|
|
1788
|
-
if (
|
|
1788
|
+
if (x -= 4, t = 8 + (15 & (I >>>= 4)), e.wbits === 0) e.wbits = t;
|
|
1789
1789
|
else if (t > e.wbits) {
|
|
1790
1790
|
g.msg = "invalid window size", e.mode = 30;
|
|
1791
1791
|
break;
|
|
1792
1792
|
}
|
|
1793
|
-
e.dmax = 1 << t, g.adler = e.check = 1, e.mode = 512 & I ? 10 : 12,
|
|
1793
|
+
e.dmax = 1 << t, g.adler = e.check = 1, e.mode = 512 & I ? 10 : 12, x = I = 0;
|
|
1794
1794
|
break;
|
|
1795
1795
|
case 2:
|
|
1796
|
-
for (;
|
|
1796
|
+
for (; x < 16; ) {
|
|
1797
1797
|
if (M === 0) break t;
|
|
1798
|
-
M--, I += B[P++] <<
|
|
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;
|
|
@@ -1805,26 +1805,26 @@ function Ut() {
|
|
|
1805
1805
|
g.msg = "unknown header flags set", e.mode = 30;
|
|
1806
1806
|
break;
|
|
1807
1807
|
}
|
|
1808
|
-
e.head && (e.head.text = I >> 8 & 1), 512 & e.flags && (k[0] = 255 & I, k[1] = I >>> 8 & 255, e.check = n(e.check, k, 2, 0)),
|
|
1808
|
+
e.head && (e.head.text = I >> 8 & 1), 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 = 3;
|
|
1809
1809
|
case 3:
|
|
1810
|
-
for (;
|
|
1810
|
+
for (; x < 32; ) {
|
|
1811
1811
|
if (M === 0) break t;
|
|
1812
|
-
M--, I += B[P++] <<
|
|
1812
|
+
M--, I += B[P++] << x, x += 8;
|
|
1813
1813
|
}
|
|
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)),
|
|
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
|
-
for (;
|
|
1816
|
+
for (; x < 16; ) {
|
|
1817
1817
|
if (M === 0) break t;
|
|
1818
|
-
M--, I += B[P++] <<
|
|
1818
|
+
M--, I += B[P++] << x, x += 8;
|
|
1819
1819
|
}
|
|
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)),
|
|
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
|
-
for (;
|
|
1823
|
+
for (; x < 16; ) {
|
|
1824
1824
|
if (M === 0) break t;
|
|
1825
|
-
M--, I += B[P++] <<
|
|
1825
|
+
M--, I += B[P++] << x, x += 8;
|
|
1826
1826
|
}
|
|
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)),
|
|
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:
|
|
@@ -1846,45 +1846,45 @@ function Ut() {
|
|
|
1846
1846
|
e.mode = 9;
|
|
1847
1847
|
case 9:
|
|
1848
1848
|
if (512 & e.flags) {
|
|
1849
|
-
for (;
|
|
1849
|
+
for (; x < 16; ) {
|
|
1850
1850
|
if (M === 0) break t;
|
|
1851
|
-
M--, I += B[P++] <<
|
|
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;
|
|
1855
1855
|
break;
|
|
1856
1856
|
}
|
|
1857
|
-
|
|
1857
|
+
x = I = 0;
|
|
1858
1858
|
}
|
|
1859
1859
|
e.head && (e.head.hcrc = e.flags >> 9 & 1, e.head.done = !0), g.adler = e.check = 0, e.mode = 12;
|
|
1860
1860
|
break;
|
|
1861
1861
|
case 10:
|
|
1862
|
-
for (;
|
|
1862
|
+
for (; x < 32; ) {
|
|
1863
1863
|
if (M === 0) break t;
|
|
1864
|
-
M--, I += B[P++] <<
|
|
1864
|
+
M--, I += B[P++] << x, x += 8;
|
|
1865
1865
|
}
|
|
1866
|
-
g.adler = e.check = s(I),
|
|
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 = P, g.avail_in = M, e.hold = I, e.bits =
|
|
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;
|
|
1872
1872
|
case 13:
|
|
1873
1873
|
if (e.last) {
|
|
1874
|
-
I >>>= 7 &
|
|
1874
|
+
I >>>= 7 & x, x -= 7 & x, e.mode = 27;
|
|
1875
1875
|
break;
|
|
1876
1876
|
}
|
|
1877
|
-
for (;
|
|
1877
|
+
for (; x < 3; ) {
|
|
1878
1878
|
if (M === 0) break t;
|
|
1879
|
-
M--, I += B[P++] <<
|
|
1879
|
+
M--, I += B[P++] << x, x += 8;
|
|
1880
1880
|
}
|
|
1881
|
-
switch (e.last = 1 & I,
|
|
1881
|
+
switch (e.last = 1 & I, x -= 1, 3 & (I >>>= 1)) {
|
|
1882
1882
|
case 0:
|
|
1883
1883
|
e.mode = 14;
|
|
1884
1884
|
break;
|
|
1885
1885
|
case 1:
|
|
1886
1886
|
if (H(e), e.mode = 20, C !== 6) break;
|
|
1887
|
-
I >>>= 2,
|
|
1887
|
+
I >>>= 2, x -= 2;
|
|
1888
1888
|
break t;
|
|
1889
1889
|
case 2:
|
|
1890
1890
|
e.mode = 17;
|
|
@@ -1892,18 +1892,18 @@ function Ut() {
|
|
|
1892
1892
|
case 3:
|
|
1893
1893
|
g.msg = "invalid block type", e.mode = 30;
|
|
1894
1894
|
}
|
|
1895
|
-
I >>>= 2,
|
|
1895
|
+
I >>>= 2, x -= 2;
|
|
1896
1896
|
break;
|
|
1897
1897
|
case 14:
|
|
1898
|
-
for (I >>>= 7 &
|
|
1898
|
+
for (I >>>= 7 & x, x -= 7 & x; x < 32; ) {
|
|
1899
1899
|
if (M === 0) break t;
|
|
1900
|
-
M--, I += B[P++] <<
|
|
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;
|
|
1904
1904
|
break;
|
|
1905
1905
|
}
|
|
1906
|
-
if (e.length = 65535 & I,
|
|
1906
|
+
if (e.length = 65535 & I, x = I = 0, e.mode = 15, C === 6) break t;
|
|
1907
1907
|
case 15:
|
|
1908
1908
|
e.mode = 16;
|
|
1909
1909
|
case 16:
|
|
@@ -1915,22 +1915,22 @@ function Ut() {
|
|
|
1915
1915
|
e.mode = 12;
|
|
1916
1916
|
break;
|
|
1917
1917
|
case 17:
|
|
1918
|
-
for (;
|
|
1918
|
+
for (; x < 14; ) {
|
|
1919
1919
|
if (M === 0) break t;
|
|
1920
|
-
M--, I += B[P++] <<
|
|
1920
|
+
M--, I += B[P++] << x, x += 8;
|
|
1921
1921
|
}
|
|
1922
|
-
if (e.nlen = 257 + (31 & I), I >>>= 5,
|
|
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;
|
|
1924
1924
|
break;
|
|
1925
1925
|
}
|
|
1926
1926
|
e.have = 0, e.mode = 18;
|
|
1927
1927
|
case 18:
|
|
1928
1928
|
for (; e.have < e.ncode; ) {
|
|
1929
|
-
for (;
|
|
1929
|
+
for (; x < 3; ) {
|
|
1930
1930
|
if (M === 0) break t;
|
|
1931
|
-
M--, I += B[P++] <<
|
|
1931
|
+
M--, I += B[P++] << x, x += 8;
|
|
1932
1932
|
}
|
|
1933
|
-
e.lens[D[e.have++]] = 7 & I, I >>>= 3,
|
|
1933
|
+
e.lens[D[e.have++]] = 7 & I, I >>>= 3, x -= 3;
|
|
1934
1934
|
}
|
|
1935
1935
|
for (; e.have < 19; ) e.lens[D[e.have++]] = 0;
|
|
1936
1936
|
if (e.lencode = e.lendyn, e.lenbits = 7, R = { bits: e.lenbits }, z = m(0, e.lens, 0, 19, e.lencode, 0, e.work, R), e.lenbits = R.bits, z) {
|
|
@@ -1940,34 +1940,34 @@ function Ut() {
|
|
|
1940
1940
|
e.have = 0, e.mode = 19;
|
|
1941
1941
|
case 19:
|
|
1942
1942
|
for (; e.have < e.nlen + e.ndist; ) {
|
|
1943
|
-
for (; et = (o = e.lencode[I & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & o, !(($ = o >>> 24) <=
|
|
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[P++] <<
|
|
1945
|
+
M--, I += B[P++] << x, x += 8;
|
|
1946
1946
|
}
|
|
1947
|
-
if (st < 16) I >>>= $,
|
|
1947
|
+
if (st < 16) I >>>= $, x -= $, e.lens[e.have++] = st;
|
|
1948
1948
|
else {
|
|
1949
1949
|
if (st === 16) {
|
|
1950
|
-
for (d = $ + 2;
|
|
1950
|
+
for (d = $ + 2; x < d; ) {
|
|
1951
1951
|
if (M === 0) break t;
|
|
1952
|
-
M--, I += B[P++] <<
|
|
1952
|
+
M--, I += B[P++] << x, x += 8;
|
|
1953
1953
|
}
|
|
1954
|
-
if (I >>>= $,
|
|
1954
|
+
if (I >>>= $, x -= $, e.have === 0) {
|
|
1955
1955
|
g.msg = "invalid bit length repeat", e.mode = 30;
|
|
1956
1956
|
break;
|
|
1957
1957
|
}
|
|
1958
|
-
t = e.lens[e.have - 1], W = 3 + (3 & I), I >>>= 2,
|
|
1958
|
+
t = e.lens[e.have - 1], W = 3 + (3 & I), I >>>= 2, x -= 2;
|
|
1959
1959
|
} else if (st === 17) {
|
|
1960
|
-
for (d = $ + 3;
|
|
1960
|
+
for (d = $ + 3; x < d; ) {
|
|
1961
1961
|
if (M === 0) break t;
|
|
1962
|
-
M--, I += B[P++] <<
|
|
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
|
-
for (d = $ + 7;
|
|
1966
|
+
for (d = $ + 7; x < d; ) {
|
|
1967
1967
|
if (M === 0) break t;
|
|
1968
|
-
M--, I += B[P++] <<
|
|
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
|
}
|
|
1972
1972
|
if (e.have + W > e.nlen + e.ndist) {
|
|
1973
1973
|
g.msg = "invalid bit length repeat", e.mode = 30;
|
|
@@ -1994,21 +1994,21 @@ 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 = P, g.avail_in = M, e.hold = I, e.bits =
|
|
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
|
-
for (e.back = 0; et = (o = e.lencode[I & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & o, !(($ = o >>> 24) <=
|
|
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[P++] <<
|
|
2002
|
+
M--, I += B[P++] << x, x += 8;
|
|
2003
2003
|
}
|
|
2004
2004
|
if (et && (240 & et) == 0) {
|
|
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) <=
|
|
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[P++] <<
|
|
2007
|
+
M--, I += B[P++] << x, x += 8;
|
|
2008
2008
|
}
|
|
2009
|
-
I >>>= it,
|
|
2009
|
+
I >>>= it, x -= it, e.back += it;
|
|
2010
2010
|
}
|
|
2011
|
-
if (I >>>= $,
|
|
2011
|
+
if (I >>>= $, x -= $, e.back += $, e.length = st, et === 0) {
|
|
2012
2012
|
e.mode = 26;
|
|
2013
2013
|
break;
|
|
2014
2014
|
}
|
|
@@ -2023,37 +2023,37 @@ function Ut() {
|
|
|
2023
2023
|
e.extra = 15 & et, e.mode = 22;
|
|
2024
2024
|
case 22:
|
|
2025
2025
|
if (e.extra) {
|
|
2026
|
-
for (d = e.extra;
|
|
2026
|
+
for (d = e.extra; x < d; ) {
|
|
2027
2027
|
if (M === 0) break t;
|
|
2028
|
-
M--, I += B[P++] <<
|
|
2028
|
+
M--, I += B[P++] << x, x += 8;
|
|
2029
2029
|
}
|
|
2030
|
-
e.length += I & (1 << e.extra) - 1, I >>>= e.extra,
|
|
2030
|
+
e.length += I & (1 << e.extra) - 1, I >>>= e.extra, x -= e.extra, e.back += e.extra;
|
|
2031
2031
|
}
|
|
2032
2032
|
e.was = e.length, e.mode = 23;
|
|
2033
2033
|
case 23:
|
|
2034
|
-
for (; et = (o = e.distcode[I & (1 << e.distbits) - 1]) >>> 16 & 255, st = 65535 & o, !(($ = o >>> 24) <=
|
|
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[P++] <<
|
|
2036
|
+
M--, I += B[P++] << x, x += 8;
|
|
2037
2037
|
}
|
|
2038
2038
|
if ((240 & et) == 0) {
|
|
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) <=
|
|
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[P++] <<
|
|
2041
|
+
M--, I += B[P++] << x, x += 8;
|
|
2042
2042
|
}
|
|
2043
|
-
I >>>= it,
|
|
2043
|
+
I >>>= it, x -= it, e.back += it;
|
|
2044
2044
|
}
|
|
2045
|
-
if (I >>>= $,
|
|
2045
|
+
if (I >>>= $, x -= $, e.back += $, 64 & et) {
|
|
2046
2046
|
g.msg = "invalid distance code", e.mode = 30;
|
|
2047
2047
|
break;
|
|
2048
2048
|
}
|
|
2049
2049
|
e.offset = st, e.extra = 15 & et, e.mode = 24;
|
|
2050
2050
|
case 24:
|
|
2051
2051
|
if (e.extra) {
|
|
2052
|
-
for (d = e.extra;
|
|
2052
|
+
for (d = e.extra; x < d; ) {
|
|
2053
2053
|
if (M === 0) break t;
|
|
2054
|
-
M--, I += B[P++] <<
|
|
2054
|
+
M--, I += B[P++] << x, x += 8;
|
|
2055
2055
|
}
|
|
2056
|
-
e.offset += I & (1 << e.extra) - 1, I >>>= e.extra,
|
|
2056
|
+
e.offset += I & (1 << e.extra) - 1, I >>>= e.extra, x -= e.extra, e.back += e.extra;
|
|
2057
2057
|
}
|
|
2058
2058
|
if (e.offset > e.dmax) {
|
|
2059
2059
|
g.msg = "invalid distance too far back", e.mode = 30;
|
|
@@ -2078,28 +2078,28 @@ function Ut() {
|
|
|
2078
2078
|
break;
|
|
2079
2079
|
case 27:
|
|
2080
2080
|
if (e.wrap) {
|
|
2081
|
-
for (;
|
|
2081
|
+
for (; x < 32; ) {
|
|
2082
2082
|
if (M === 0) break t;
|
|
2083
|
-
M--, I |= B[P++] <<
|
|
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;
|
|
2087
2087
|
break;
|
|
2088
2088
|
}
|
|
2089
|
-
|
|
2089
|
+
x = I = 0;
|
|
2090
2090
|
}
|
|
2091
2091
|
e.mode = 28;
|
|
2092
2092
|
case 28:
|
|
2093
2093
|
if (e.wrap && e.flags) {
|
|
2094
|
-
for (;
|
|
2094
|
+
for (; x < 32; ) {
|
|
2095
2095
|
if (M === 0) break t;
|
|
2096
|
-
M--, I += B[P++] <<
|
|
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;
|
|
2100
2100
|
break;
|
|
2101
2101
|
}
|
|
2102
|
-
|
|
2102
|
+
x = I = 0;
|
|
2103
2103
|
}
|
|
2104
2104
|
e.mode = 29;
|
|
2105
2105
|
case 29:
|
|
@@ -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 = P, g.avail_in = M, e.hold = I, e.bits =
|
|
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, 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,
|
|
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,9 +2139,9 @@ 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 ? (
|
|
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 (L = g - Q, H = h[C] < T ? (O = 0, h[C]) : h[C] > T ? (O = nt[ot + h[C]],
|
|
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;
|
|
@@ -2173,13 +2173,13 @@ function Ut() {
|
|
|
2173
2173
|
var B = new Array(v);
|
|
2174
2174
|
a(B);
|
|
2175
2175
|
var q, P, Q, M = new Array(i);
|
|
2176
|
-
function J(o, k, D, U,
|
|
2177
|
-
this.static_tree = o, this.extra_bits = k, this.extra_base = D, this.elems = U, this.max_length =
|
|
2176
|
+
function J(o, k, D, U, S) {
|
|
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
|
}
|
|
2179
2179
|
function I(o, k) {
|
|
2180
2180
|
this.dyn_tree = o, this.max_code = 0, this.stat_desc = k;
|
|
2181
2181
|
}
|
|
2182
|
-
function
|
|
2182
|
+
function x(o) {
|
|
2183
2183
|
return o < 256 ? C[o] : C[256 + (o >>> 7)];
|
|
2184
2184
|
}
|
|
2185
2185
|
function X(o, k) {
|
|
@@ -2196,11 +2196,11 @@ function Ut() {
|
|
|
2196
2196
|
return D >>> 1;
|
|
2197
2197
|
}
|
|
2198
2198
|
function ot(o, k, D) {
|
|
2199
|
-
var U,
|
|
2199
|
+
var U, S, j = new Array(h + 1), K = 0;
|
|
2200
2200
|
for (U = 1; U <= h; U++) j[U] = K = K + D[U - 1] << 1;
|
|
2201
|
-
for (
|
|
2202
|
-
var G = o[2 *
|
|
2203
|
-
G !== 0 && (o[2 *
|
|
2201
|
+
for (S = 0; S <= k; S++) {
|
|
2202
|
+
var G = o[2 * S + 1];
|
|
2203
|
+
G !== 0 && (o[2 * S] = nt(j[G]++, G));
|
|
2204
2204
|
}
|
|
2205
2205
|
}
|
|
2206
2206
|
function $(o) {
|
|
@@ -2214,62 +2214,62 @@ function Ut() {
|
|
|
2214
2214
|
8 < o.bi_valid ? X(o, o.bi_buf) : 0 < o.bi_valid && (o.pending_buf[o.pending++] = o.bi_buf), o.bi_buf = 0, o.bi_valid = 0;
|
|
2215
2215
|
}
|
|
2216
2216
|
function st(o, k, D, U) {
|
|
2217
|
-
var
|
|
2218
|
-
return o[
|
|
2217
|
+
var S = 2 * k, j = 2 * D;
|
|
2218
|
+
return o[S] < o[j] || o[S] === o[j] && U[k] <= U[D];
|
|
2219
2219
|
}
|
|
2220
2220
|
function it(o, k, D) {
|
|
2221
|
-
for (var U = o.heap[D],
|
|
2221
|
+
for (var U = o.heap[D], S = D << 1; S <= o.heap_len && (S < o.heap_len && st(k, o.heap[S + 1], o.heap[S], o.depth) && S++, !st(k, U, o.heap[S], o.depth)); ) o.heap[D] = o.heap[S], D = S, S <<= 1;
|
|
2222
2222
|
o.heap[D] = U;
|
|
2223
2223
|
}
|
|
2224
2224
|
function ht(o, k, D) {
|
|
2225
|
-
var U,
|
|
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],
|
|
2225
|
+
var U, S, j, K, 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), (K = T[j]) !== 0 && Z(o, S -= B[j], K), W(o, j = x(--U), D), (K = L[j]) !== 0 && Z(o, U -= M[j], K)), G < o.last_lit; ) ;
|
|
2227
2227
|
W(o, w, k);
|
|
2228
2228
|
}
|
|
2229
2229
|
function lt(o, k) {
|
|
2230
|
-
var D, U,
|
|
2230
|
+
var D, U, S, j = k.dyn_tree, K = k.stat_desc.static_tree, G = k.stat_desc.has_stree, V = k.stat_desc.elems, rt = -1;
|
|
2231
2231
|
for (o.heap_len = 0, o.heap_max = r, D = 0; D < V; 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 * (
|
|
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 -= K[2 * S + 1]);
|
|
2233
2233
|
for (k.max_code = rt, D = o.heap_len >> 1; 1 <= D; D--) it(o, j, D);
|
|
2234
|
-
for (
|
|
2234
|
+
for (S = V; 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
|
-
var pt, dt, mt, at, bt, Et, ft = ut.dyn_tree,
|
|
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;
|
|
2238
|
-
for (ft[2 * tt.heap[tt.heap_max] + 1] = 0, pt = tt.heap_max + 1; pt < r; pt++) _t < (at = ft[2 * ft[2 * (dt = tt.heap[pt]) + 1] + 1] + 1) && (at = _t, vt++), ft[2 * dt + 1] = at,
|
|
2238
|
+
for (ft[2 * tt.heap[tt.heap_max] + 1] = 0, pt = tt.heap_max + 1; pt < r; pt++) _t < (at = ft[2 * ft[2 * (dt = tt.heap[pt]) + 1] + 1] + 1) && (at = _t, vt++), ft[2 * dt + 1] = at, St < dt || (tt.bl_count[at]++, bt = 0, xt <= dt && (bt = zt[dt - xt]), Et = ft[2 * dt], tt.opt_len += Et * (at + bt), Ct && (tt.static_len += Et * (Tt[2 * dt + 1] + bt)));
|
|
2239
2239
|
if (vt !== 0) {
|
|
2240
2240
|
do {
|
|
2241
2241
|
for (at = _t - 1; tt.bl_count[at] === 0; ) at--;
|
|
2242
2242
|
tt.bl_count[at]--, tt.bl_count[at + 1] += 2, tt.bl_count[_t]--, vt -= 2;
|
|
2243
2243
|
} while (0 < vt);
|
|
2244
|
-
for (at = _t; at !== 0; at--) for (dt = tt.bl_count[at]; dt !== 0; )
|
|
2244
|
+
for (at = _t; at !== 0; at--) for (dt = tt.bl_count[at]; dt !== 0; ) St < (mt = tt.heap[--pt]) || (ft[2 * mt + 1] !== at && (tt.opt_len += (at - ft[2 * mt + 1]) * ft[2 * mt], ft[2 * mt + 1] = at), dt--);
|
|
2245
2245
|
}
|
|
2246
2246
|
}(o, k), ot(j, rt, o.bl_count);
|
|
2247
2247
|
}
|
|
2248
2248
|
function t(o, k, D) {
|
|
2249
|
-
var U,
|
|
2250
|
-
for (K === 0 && (V = 138, rt = 3), k[2 * (D + 1) + 1] = 65535, U = 0; U <= D; U++)
|
|
2249
|
+
var U, S, j = -1, K = k[1], G = 0, V = 7, rt = 4;
|
|
2250
|
+
for (K === 0 && (V = 138, rt = 3), k[2 * (D + 1) + 1] = 65535, U = 0; U <= D; U++) S = K, K = k[2 * (U + 1) + 1], ++G < V && S === K || (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) === K ? (V = 138, 3) : S === K ? (V = 6, 3) : (V = 7, 4));
|
|
2251
2251
|
}
|
|
2252
2252
|
function z(o, k, D) {
|
|
2253
|
-
var U,
|
|
2254
|
-
for (K === 0 && (V = 138, rt = 3), U = 0; U <= D; U++) if (
|
|
2255
|
-
if (G < rt) for (; W(o,
|
|
2256
|
-
else
|
|
2257
|
-
j =
|
|
2253
|
+
var U, S, j = -1, K = k[1], G = 0, V = 7, rt = 4;
|
|
2254
|
+
for (K === 0 && (V = 138, rt = 3), U = 0; U <= D; U++) if (S = K, K = k[2 * (U + 1) + 1], !(++G < V && S === K)) {
|
|
2255
|
+
if (G < rt) for (; W(o, S, o.bl_tree), --G != 0; ) ;
|
|
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) === K ? (V = 138, 3) : S === K ? (V = 6, 3) : (V = 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(
|
|
2264
|
-
et(
|
|
2263
|
+
Z(o, (m << 1) + (U ? 1 : 0), 3), function(S, j, K, G) {
|
|
2264
|
+
et(S), X(S, K), X(S, ~K), u.arraySet(S.pending_buf, S.window, j, K, S.pending), S.pending += K;
|
|
2265
2265
|
}(o, k, D);
|
|
2266
2266
|
}
|
|
2267
2267
|
y._tr_init = function(o) {
|
|
2268
2268
|
R || (function() {
|
|
2269
|
-
var k, D, U,
|
|
2270
|
-
for (
|
|
2271
|
-
for (e[U - 1] =
|
|
2272
|
-
for (j >>= 7;
|
|
2269
|
+
var k, D, U, S, j, K = new Array(h + 1);
|
|
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 << 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
2273
|
for (D = 0; D <= h; D++) K[D] = 0;
|
|
2274
2274
|
for (k = 0; k <= 143; ) Y[2 * k + 1] = 8, k++, K[8]++;
|
|
2275
2275
|
for (; k <= 255; ) Y[2 * k + 1] = 9, k++, K[9]++;
|
|
@@ -2279,7 +2279,7 @@ function Ut() {
|
|
|
2279
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
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
|
|
2282
|
+
var S, j, K = 0;
|
|
2283
2283
|
0 < o.level ? (o.strm.data_type === 2 && (o.strm.data_type = function(G) {
|
|
2284
2284
|
var V, rt = 4093624447;
|
|
2285
2285
|
for (V = 0; V <= 31; V++, rt >>>= 1) if (1 & rt && G.dyn_ltree[2 * V] !== 0) return l;
|
|
@@ -2290,13 +2290,13 @@ function Ut() {
|
|
|
2290
2290
|
var V;
|
|
2291
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), V = c - 1; 3 <= V && G.bl_tree[2 * H[V] + 1] === 0; V--) ;
|
|
2292
2292
|
return G.opt_len += 3 * (V + 1) + 5 + 5 + 4, V;
|
|
2293
|
-
}(o),
|
|
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, V, rt, tt) {
|
|
2294
2294
|
var ut;
|
|
2295
2295
|
for (Z(G, V - 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
2296
|
z(G, G.dyn_ltree, V - 1), z(G, G.dyn_dtree, rt - 1);
|
|
2297
2297
|
}(o, o.l_desc.max_code + 1, o.d_desc.max_code + 1, K + 1), ht(o, o.dyn_ltree, o.dyn_dtree)), $(o), U && et(o);
|
|
2298
2298
|
}, y._tr_tally = function(o, k, D) {
|
|
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 *
|
|
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) {
|
|
2301
2301
|
Z(o, 2, 3), W(o, w, Y), function(k) {
|
|
2302
2302
|
k.bi_valid === 16 ? (X(k, k.bi_buf), k.bi_buf = 0, k.bi_valid = 0) : 8 <= k.bi_valid && (k.pending_buf[k.pending++] = 255 & k.bi_buf, k.bi_buf >>= 8, k.bi_valid -= 8);
|