@ontos-ai/knowhere-claw 0.2.0 → 0.2.2
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/__tests__/channel-route.test.d.ts +1 -0
- package/dist/__tests__/ingest-tool.test.d.ts +1 -0
- package/dist/__tests__/kg-service-test-helper.d.ts +2 -0
- package/dist/__tests__/kg-service.test.d.ts +1 -0
- package/dist/__tests__/read-result-file-tool.test.d.ts +1 -0
- package/dist/__tests__/tracker-progress.test.d.ts +1 -0
- package/dist/_virtual/_rolldown/runtime.js +1 -35
- package/dist/channel-delivery.d.ts +21 -0
- package/dist/client.d.ts +33 -0
- package/dist/client.js +1 -1
- package/dist/config.d.ts +13 -0
- package/dist/connect-builder.d.ts +48 -0
- package/dist/connect-builder.js +1 -2
- package/dist/error-message.d.ts +1 -0
- package/dist/graph-builder.d.ts +75 -0
- package/dist/graph-builder.js +9 -5
- package/dist/index.d.ts +9 -0
- package/dist/kg-service.d.ts +38 -0
- package/dist/kg-service.js +39 -33
- package/dist/parser.d.ts +16 -0
- package/dist/parser.js +1 -1
- package/dist/session.d.ts +11 -0
- package/dist/store.d.ts +79 -0
- package/dist/text.d.ts +10 -0
- package/dist/tools.d.ts +10 -0
- package/dist/tracker-progress.d.ts +10 -0
- package/dist/types.d.ts +320 -0
- package/openclaw.plugin.json +1 -1
- package/package.json +4 -3
- package/dist/node_modules/.pnpm/@knowhere-ai_sdk@0.1.1/node_modules/@knowhere-ai/sdk/dist/index.js +0 -717
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/lib/node-pre-gyp.js +0 -212
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/lib/pre-binding.js +0 -35
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/lib/util/abi_crosswalk.js +0 -2609
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/lib/util/napi.js +0 -142
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/lib/util/s3_setup.js +0 -103
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/lib/util/versioning.js +0 -199
- package/dist/node_modules/.pnpm/@mapbox_node-pre-gyp@1.0.11/node_modules/@mapbox/node-pre-gyp/package.js +0 -67
- package/dist/node_modules/.pnpm/abbrev@1.1.1/node_modules/abbrev/abbrev.js +0 -59
- package/dist/node_modules/.pnpm/ansi-regex@5.0.1/node_modules/ansi-regex/index.js +0 -11
- package/dist/node_modules/.pnpm/aproba@2.1.0/node_modules/aproba/index.js +0 -119
- package/dist/node_modules/.pnpm/are-we-there-yet@2.0.0/node_modules/are-we-there-yet/lib/index.js +0 -13
- package/dist/node_modules/.pnpm/are-we-there-yet@2.0.0/node_modules/are-we-there-yet/lib/tracker-base.js +0 -16
- package/dist/node_modules/.pnpm/are-we-there-yet@2.0.0/node_modules/are-we-there-yet/lib/tracker-group.js +0 -98
- package/dist/node_modules/.pnpm/are-we-there-yet@2.0.0/node_modules/are-we-there-yet/lib/tracker-stream.js +0 -37
- package/dist/node_modules/.pnpm/are-we-there-yet@2.0.0/node_modules/are-we-there-yet/lib/tracker.js +0 -32
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/adapters/adapters.js +0 -83
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/adapters/fetch.js +0 -170
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/adapters/xhr.js +0 -106
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/axios.js +0 -57
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/cancel/CancelToken.js +0 -90
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/cancel/CanceledError.js +0 -20
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/cancel/isCancel.js +0 -6
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/Axios.js +0 -174
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/AxiosError.js +0 -70
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/AxiosHeaders.js +0 -204
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/InterceptorManager.js +0 -60
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/buildFullPath.js +0 -20
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/dispatchRequest.js +0 -52
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/mergeConfig.js +0 -81
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/settle.js +0 -18
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/core/transformData.js +0 -25
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/defaults/index.js +0 -107
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/defaults/transitional.js +0 -9
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/env/data.js +0 -4
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/AxiosURLSearchParams.js +0 -50
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/HttpStatusCode.js +0 -77
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/bind.js +0 -15
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/buildURL.js +0 -40
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/combineURLs.js +0 -14
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/composeSignals.js +0 -39
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/cookies.js +0 -31
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/formDataToJSON.js +0 -67
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/isAbsoluteURL.js +0 -14
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/isAxiosError.js +0 -14
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/isURLSameOrigin.js +0 -8
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/parseHeaders.js +0 -53
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/parseProtocol.js +0 -7
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/progressEventReducer.js +0 -38
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/resolveConfig.js +0 -36
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/speedometer.js +0 -36
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/spread.js +0 -29
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/throttle.js +0 -38
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/toFormData.js +0 -151
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/toURLEncodedForm.js +0 -18
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/trackStream.js +0 -69
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/helpers/validator.js +0 -76
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/platform/browser/classes/Blob.js +0 -4
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/platform/browser/classes/FormData.js +0 -4
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/platform/browser/classes/URLSearchParams.js +0 -5
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/platform/browser/index.js +0 -22
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/platform/common/utils.js +0 -46
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/platform/index.js +0 -9
- package/dist/node_modules/.pnpm/axios@1.13.6/node_modules/axios/lib/utils.js +0 -698
- package/dist/node_modules/.pnpm/balanced-match@1.0.2/node_modules/balanced-match/index.js +0 -53
- package/dist/node_modules/.pnpm/brace-expansion@1.1.12/node_modules/brace-expansion/index.js +0 -132
- package/dist/node_modules/.pnpm/color-support@1.1.3/node_modules/color-support/browser.js +0 -18
- package/dist/node_modules/.pnpm/concat-map@0.0.1/node_modules/concat-map/index.js +0 -19
- package/dist/node_modules/.pnpm/console-control-strings@1.1.0/node_modules/console-control-strings/index.js +0 -104
- package/dist/node_modules/.pnpm/delegates@1.0.0/node_modules/delegates/index.js +0 -104
- package/dist/node_modules/.pnpm/detect-libc@2.1.2/node_modules/detect-libc/lib/detect-libc.js +0 -221
- package/dist/node_modules/.pnpm/detect-libc@2.1.2/node_modules/detect-libc/lib/elf.js +0 -26
- package/dist/node_modules/.pnpm/detect-libc@2.1.2/node_modules/detect-libc/lib/filesystem.js +0 -48
- package/dist/node_modules/.pnpm/detect-libc@2.1.2/node_modules/detect-libc/lib/process.js +0 -24
- package/dist/node_modules/.pnpm/emoji-regex@8.0.0/node_modules/emoji-regex/index.js +0 -10
- package/dist/node_modules/.pnpm/fflate@0.8.2/node_modules/fflate/esm/browser.js +0 -426
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/copy/copy-sync.js +0 -120
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/copy/copy.js +0 -100
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/copy/index.js +0 -15
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/empty/index.js +0 -43
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/ensure/file.js +0 -53
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/ensure/index.js +0 -27
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/ensure/link.js +0 -56
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/ensure/symlink-paths.js +0 -89
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/ensure/symlink-type.js +0 -35
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/ensure/symlink.js +0 -81
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/fs/index.js +0 -113
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/index.js +0 -29
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/json/index.js +0 -22
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/json/jsonfile.js +0 -15
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/json/output-json-sync.js +0 -15
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/json/output-json.js +0 -15
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/mkdirs/index.js +0 -20
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/mkdirs/make-dir.js +0 -33
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/mkdirs/utils.js +0 -17
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/move/index.js +0 -15
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/move/move-sync.js +0 -56
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/move/move.js +0 -49
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/output-file/index.js +0 -30
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/path-exists/index.js +0 -18
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/remove/index.js +0 -27
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/util/async.js +0 -15
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/util/stat.js +0 -131
- package/dist/node_modules/.pnpm/fs-extra@11.3.4/node_modules/fs-extra/lib/util/utimes.js +0 -34
- package/dist/node_modules/.pnpm/fs.realpath@1.0.0/node_modules/fs.realpath/index.js +0 -51
- package/dist/node_modules/.pnpm/fs.realpath@1.0.0/node_modules/fs.realpath/old.js +0 -171
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/base-theme.js +0 -21
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/error.js +0 -27
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/has-color.js +0 -9
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/index.js +0 -224
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/plumbing.js +0 -48
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/process.js +0 -8
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/progress-bar.js +0 -46
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/render-template.js +0 -155
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/set-immediate.js +0 -14
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/set-interval.js +0 -8
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/spin.js +0 -10
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/template-item.js +0 -58
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/theme-set.js +0 -99
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/themes.js +0 -67
- package/dist/node_modules/.pnpm/gauge@3.0.2/node_modules/gauge/wide-truncate.js +0 -22
- package/dist/node_modules/.pnpm/glob@7.2.3/node_modules/glob/common.js +0 -162
- package/dist/node_modules/.pnpm/glob@7.2.3/node_modules/glob/glob.js +0 -451
- package/dist/node_modules/.pnpm/glob@7.2.3/node_modules/glob/sync.js +0 -280
- package/dist/node_modules/.pnpm/graceful-fs@4.2.11/node_modules/graceful-fs/clone.js +0 -20
- package/dist/node_modules/.pnpm/graceful-fs@4.2.11/node_modules/graceful-fs/graceful-fs.js +0 -362
- package/dist/node_modules/.pnpm/graceful-fs@4.2.11/node_modules/graceful-fs/legacy-streams.js +0 -92
- package/dist/node_modules/.pnpm/graceful-fs@4.2.11/node_modules/graceful-fs/polyfills.js +0 -255
- package/dist/node_modules/.pnpm/has-unicode@2.0.1/node_modules/has-unicode/index.js +0 -14
- package/dist/node_modules/.pnpm/inflight@1.0.6/node_modules/inflight/inflight.js +0 -45
- package/dist/node_modules/.pnpm/inherits@2.0.4/node_modules/inherits/inherits_browser.js +0 -27
- package/dist/node_modules/.pnpm/is-fullwidth-code-point@3.0.0/node_modules/is-fullwidth-code-point/index.js +0 -14
- package/dist/node_modules/.pnpm/jsonfile@6.2.0/node_modules/jsonfile/index.js +0 -68
- package/dist/node_modules/.pnpm/jsonfile@6.2.0/node_modules/jsonfile/utils.js +0 -19
- package/dist/node_modules/.pnpm/jszip@3.10.1/node_modules/jszip/dist/jszip.min.js +0 -3110
- package/dist/node_modules/.pnpm/minimatch@3.1.5/node_modules/minimatch/minimatch.js +0 -578
- package/dist/node_modules/.pnpm/nodejieba@2.6.0/node_modules/nodejieba/index.js +0 -46
- package/dist/node_modules/.pnpm/nopt@5.0.0/node_modules/nopt/lib/nopt.js +0 -330
- package/dist/node_modules/.pnpm/npmlog@5.0.1/node_modules/npmlog/log.js +0 -305
- package/dist/node_modules/.pnpm/object-assign@4.1.1/node_modules/object-assign/index.js +0 -54
- package/dist/node_modules/.pnpm/once@1.4.0/node_modules/once/once.js +0 -44
- package/dist/node_modules/.pnpm/path-is-absolute@1.0.1/node_modules/path-is-absolute/index.js +0 -19
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/errors-browser.js +0 -88
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_duplex.js +0 -75
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_passthrough.js +0 -19
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_readable.js +0 -666
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_transform.js +0 -89
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/_stream_writable.js +0 -423
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/async_iterator.js +0 -172
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/buffer_list.js +0 -243
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/destroy.js +0 -77
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/end-of-stream.js +0 -87
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/from-browser.js +0 -10
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/pipeline.js +0 -80
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/state.js +0 -21
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/lib/internal/streams/stream-browser.js +0 -8
- package/dist/node_modules/.pnpm/readable-stream@3.6.2/node_modules/readable-stream/readable-browser.js +0 -23
- package/dist/node_modules/.pnpm/rimraf@3.0.2/node_modules/rimraf/rimraf.js +0 -229
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/comparator.js +0 -79
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/range.js +0 -282
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/classes/semver.js +0 -186
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/clean.js +0 -14
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/cmp.js +0 -41
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/coerce.js +0 -34
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare-build.js +0 -15
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare-loose.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/compare.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/diff.js +0 -32
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/eq.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/gt.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/gte.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/inc.js +0 -22
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/lt.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/lte.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/major.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/minor.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/neq.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/parse.js +0 -19
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/patch.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/prerelease.js +0 -14
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/rcompare.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/rsort.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/satisfies.js +0 -18
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/sort.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/functions/valid.js +0 -14
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/index.js +0 -99
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/constants.js +0 -28
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/debug.js +0 -8
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/identifiers.js +0 -23
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/lrucache.js +0 -36
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/parse-options.js +0 -15
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/internal/re.js +0 -84
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/gtr.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/intersects.js +0 -15
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/ltr.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/max-satisfying.js +0 -31
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/min-satisfying.js +0 -31
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/min-version.js +0 -45
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/outside.js +0 -64
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/simplify.js +0 -35
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/subset.js +0 -102
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/to-comparators.js +0 -11
- package/dist/node_modules/.pnpm/semver@7.7.4/node_modules/semver/ranges/valid.js +0 -17
- package/dist/node_modules/.pnpm/set-blocking@2.0.0/node_modules/set-blocking/index.js +0 -12
- package/dist/node_modules/.pnpm/signal-exit@3.0.7/node_modules/signal-exit/index.js +0 -130
- package/dist/node_modules/.pnpm/signal-exit@3.0.7/node_modules/signal-exit/signals.js +0 -16
- package/dist/node_modules/.pnpm/string-width@4.2.3/node_modules/string-width/index.js +0 -30
- package/dist/node_modules/.pnpm/strip-ansi@6.0.1/node_modules/strip-ansi/index.js +0 -10
- package/dist/node_modules/.pnpm/universalify@2.0.1/node_modules/universalify/index.js +0 -26
- package/dist/node_modules/.pnpm/util-deprecate@1.0.2/node_modules/util-deprecate/browser.js +0 -59
- package/dist/node_modules/.pnpm/wide-align@1.1.5/node_modules/wide-align/align.js +0 -52
- package/dist/node_modules/.pnpm/wrappy@1.0.2/node_modules/wrappy/wrappy.js +0 -26
|
@@ -1,3110 +0,0 @@
|
|
|
1
|
-
import { __commonJSMin, __require } from "../../../../../../_virtual/_rolldown/runtime.js";
|
|
2
|
-
//#region node_modules/.pnpm/jszip@3.10.1/node_modules/jszip/dist/jszip.min.js
|
|
3
|
-
var require_jszip_min = /* @__PURE__ */ __commonJSMin(((exports, module) => {
|
|
4
|
-
/*!
|
|
5
|
-
|
|
6
|
-
JSZip v3.10.1 - A JavaScript class for generating and reading zip files
|
|
7
|
-
<http://stuartk.com/jszip>
|
|
8
|
-
|
|
9
|
-
(c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
|
|
10
|
-
Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/main/LICENSE.markdown.
|
|
11
|
-
|
|
12
|
-
JSZip uses the library pako released under the MIT license :
|
|
13
|
-
https://github.com/nodeca/pako/blob/main/LICENSE
|
|
14
|
-
*/
|
|
15
|
-
(function(e) {
|
|
16
|
-
if ("object" == typeof exports && "undefined" != typeof module) module.exports = e();
|
|
17
|
-
else if ("function" == typeof define && define.amd) define([], e);
|
|
18
|
-
else ("undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : this).JSZip = e();
|
|
19
|
-
})(function() {
|
|
20
|
-
return function s(a, o, h) {
|
|
21
|
-
function u(r, e) {
|
|
22
|
-
if (!o[r]) {
|
|
23
|
-
if (!a[r]) {
|
|
24
|
-
var t = "function" == typeof __require && __require;
|
|
25
|
-
if (!e && t) return t(r, !0);
|
|
26
|
-
if (l) return l(r, !0);
|
|
27
|
-
var n = /* @__PURE__ */ new Error("Cannot find module '" + r + "'");
|
|
28
|
-
throw n.code = "MODULE_NOT_FOUND", n;
|
|
29
|
-
}
|
|
30
|
-
var i = o[r] = { exports: {} };
|
|
31
|
-
a[r][0].call(i.exports, function(e) {
|
|
32
|
-
var t = a[r][1][e];
|
|
33
|
-
return u(t || e);
|
|
34
|
-
}, i, i.exports, s, a, o, h);
|
|
35
|
-
}
|
|
36
|
-
return o[r].exports;
|
|
37
|
-
}
|
|
38
|
-
for (var l = "function" == typeof __require && __require, e = 0; e < h.length; e++) u(h[e]);
|
|
39
|
-
return u;
|
|
40
|
-
}({
|
|
41
|
-
1: [function(e, t, r) {
|
|
42
|
-
"use strict";
|
|
43
|
-
var d = e("./utils"), c = e("./support"), p = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
|
|
44
|
-
r.encode = function(e) {
|
|
45
|
-
for (var t, r, n, i, s, a, o, h = [], u = 0, l = e.length, f = l, c = "string" !== d.getTypeOf(e); u < e.length;) f = l - u, n = c ? (t = e[u++], r = u < l ? e[u++] : 0, u < l ? e[u++] : 0) : (t = e.charCodeAt(u++), r = u < l ? e.charCodeAt(u++) : 0, u < l ? e.charCodeAt(u++) : 0), i = t >> 2, s = (3 & t) << 4 | r >> 4, a = 1 < f ? (15 & r) << 2 | n >> 6 : 64, o = 2 < f ? 63 & n : 64, h.push(p.charAt(i) + p.charAt(s) + p.charAt(a) + p.charAt(o));
|
|
46
|
-
return h.join("");
|
|
47
|
-
}, r.decode = function(e) {
|
|
48
|
-
var t, r, n, i, s, a, o = 0, h = 0, u = "data:";
|
|
49
|
-
if (e.substr(0, u.length) === u) throw new Error("Invalid base64 input, it looks like a data url.");
|
|
50
|
-
var l, f = 3 * (e = e.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
|
|
51
|
-
if (e.charAt(e.length - 1) === p.charAt(64) && f--, e.charAt(e.length - 2) === p.charAt(64) && f--, f % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
|
|
52
|
-
for (l = c.uint8array ? new Uint8Array(0 | f) : new Array(0 | f); o < e.length;) t = p.indexOf(e.charAt(o++)) << 2 | (i = p.indexOf(e.charAt(o++))) >> 4, r = (15 & i) << 4 | (s = p.indexOf(e.charAt(o++))) >> 2, n = (3 & s) << 6 | (a = p.indexOf(e.charAt(o++))), l[h++] = t, 64 !== s && (l[h++] = r), 64 !== a && (l[h++] = n);
|
|
53
|
-
return l;
|
|
54
|
-
};
|
|
55
|
-
}, {
|
|
56
|
-
"./support": 30,
|
|
57
|
-
"./utils": 32
|
|
58
|
-
}],
|
|
59
|
-
2: [function(e, t, r) {
|
|
60
|
-
"use strict";
|
|
61
|
-
var n = e("./external"), i = e("./stream/DataWorker"), s = e("./stream/Crc32Probe"), a = e("./stream/DataLengthProbe");
|
|
62
|
-
function o(e, t, r, n, i) {
|
|
63
|
-
this.compressedSize = e, this.uncompressedSize = t, this.crc32 = r, this.compression = n, this.compressedContent = i;
|
|
64
|
-
}
|
|
65
|
-
o.prototype = {
|
|
66
|
-
getContentWorker: function() {
|
|
67
|
-
var e = new i(n.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new a("data_length")), t = this;
|
|
68
|
-
return e.on("end", function() {
|
|
69
|
-
if (this.streamInfo.data_length !== t.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
|
|
70
|
-
}), e;
|
|
71
|
-
},
|
|
72
|
-
getCompressedWorker: function() {
|
|
73
|
-
return new i(n.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
|
|
74
|
-
}
|
|
75
|
-
}, o.createWorkerFrom = function(e, t, r) {
|
|
76
|
-
return e.pipe(new s()).pipe(new a("uncompressedSize")).pipe(t.compressWorker(r)).pipe(new a("compressedSize")).withStreamInfo("compression", t);
|
|
77
|
-
}, t.exports = o;
|
|
78
|
-
}, {
|
|
79
|
-
"./external": 6,
|
|
80
|
-
"./stream/Crc32Probe": 25,
|
|
81
|
-
"./stream/DataLengthProbe": 26,
|
|
82
|
-
"./stream/DataWorker": 27
|
|
83
|
-
}],
|
|
84
|
-
3: [function(e, t, r) {
|
|
85
|
-
"use strict";
|
|
86
|
-
var n = e("./stream/GenericWorker");
|
|
87
|
-
r.STORE = {
|
|
88
|
-
magic: "\0\0",
|
|
89
|
-
compressWorker: function() {
|
|
90
|
-
return new n("STORE compression");
|
|
91
|
-
},
|
|
92
|
-
uncompressWorker: function() {
|
|
93
|
-
return new n("STORE decompression");
|
|
94
|
-
}
|
|
95
|
-
}, r.DEFLATE = e("./flate");
|
|
96
|
-
}, {
|
|
97
|
-
"./flate": 7,
|
|
98
|
-
"./stream/GenericWorker": 28
|
|
99
|
-
}],
|
|
100
|
-
4: [function(e, t, r) {
|
|
101
|
-
"use strict";
|
|
102
|
-
var n = e("./utils");
|
|
103
|
-
var o = function() {
|
|
104
|
-
for (var e, t = [], r = 0; r < 256; r++) {
|
|
105
|
-
e = r;
|
|
106
|
-
for (var n = 0; n < 8; n++) e = 1 & e ? 3988292384 ^ e >>> 1 : e >>> 1;
|
|
107
|
-
t[r] = e;
|
|
108
|
-
}
|
|
109
|
-
return t;
|
|
110
|
-
}();
|
|
111
|
-
t.exports = function(e, t) {
|
|
112
|
-
return void 0 !== e && e.length ? "string" !== n.getTypeOf(e) ? function(e, t, r, n) {
|
|
113
|
-
var i = o, s = n + r;
|
|
114
|
-
e ^= -1;
|
|
115
|
-
for (var a = n; a < s; a++) e = e >>> 8 ^ i[255 & (e ^ t[a])];
|
|
116
|
-
return -1 ^ e;
|
|
117
|
-
}(0 | t, e, e.length, 0) : function(e, t, r, n) {
|
|
118
|
-
var i = o, s = n + r;
|
|
119
|
-
e ^= -1;
|
|
120
|
-
for (var a = n; a < s; a++) e = e >>> 8 ^ i[255 & (e ^ t.charCodeAt(a))];
|
|
121
|
-
return -1 ^ e;
|
|
122
|
-
}(0 | t, e, e.length, 0) : 0;
|
|
123
|
-
};
|
|
124
|
-
}, { "./utils": 32 }],
|
|
125
|
-
5: [function(e, t, r) {
|
|
126
|
-
"use strict";
|
|
127
|
-
r.base64 = !1, r.binary = !1, r.dir = !1, r.createFolders = !0, r.date = null, r.compression = null, r.compressionOptions = null, r.comment = null, r.unixPermissions = null, r.dosPermissions = null;
|
|
128
|
-
}, {}],
|
|
129
|
-
6: [function(e, t, r) {
|
|
130
|
-
"use strict";
|
|
131
|
-
var n = null;
|
|
132
|
-
n = "undefined" != typeof Promise ? Promise : e("lie"), t.exports = { Promise: n };
|
|
133
|
-
}, { lie: 37 }],
|
|
134
|
-
7: [function(e, t, r) {
|
|
135
|
-
"use strict";
|
|
136
|
-
var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Uint32Array, i = e("pako"), s = e("./utils"), a = e("./stream/GenericWorker"), o = n ? "uint8array" : "array";
|
|
137
|
-
function h(e, t) {
|
|
138
|
-
a.call(this, "FlateWorker/" + e), this._pako = null, this._pakoAction = e, this._pakoOptions = t, this.meta = {};
|
|
139
|
-
}
|
|
140
|
-
r.magic = "\b\0", s.inherits(h, a), h.prototype.processChunk = function(e) {
|
|
141
|
-
this.meta = e.meta, null === this._pako && this._createPako(), this._pako.push(s.transformTo(o, e.data), !1);
|
|
142
|
-
}, h.prototype.flush = function() {
|
|
143
|
-
a.prototype.flush.call(this), null === this._pako && this._createPako(), this._pako.push([], !0);
|
|
144
|
-
}, h.prototype.cleanUp = function() {
|
|
145
|
-
a.prototype.cleanUp.call(this), this._pako = null;
|
|
146
|
-
}, h.prototype._createPako = function() {
|
|
147
|
-
this._pako = new i[this._pakoAction]({
|
|
148
|
-
raw: !0,
|
|
149
|
-
level: this._pakoOptions.level || -1
|
|
150
|
-
});
|
|
151
|
-
var t = this;
|
|
152
|
-
this._pako.onData = function(e) {
|
|
153
|
-
t.push({
|
|
154
|
-
data: e,
|
|
155
|
-
meta: t.meta
|
|
156
|
-
});
|
|
157
|
-
};
|
|
158
|
-
}, r.compressWorker = function(e) {
|
|
159
|
-
return new h("Deflate", e);
|
|
160
|
-
}, r.uncompressWorker = function() {
|
|
161
|
-
return new h("Inflate", {});
|
|
162
|
-
};
|
|
163
|
-
}, {
|
|
164
|
-
"./stream/GenericWorker": 28,
|
|
165
|
-
"./utils": 32,
|
|
166
|
-
pako: 38
|
|
167
|
-
}],
|
|
168
|
-
8: [function(e, t, r) {
|
|
169
|
-
"use strict";
|
|
170
|
-
function A(e, t) {
|
|
171
|
-
var r, n = "";
|
|
172
|
-
for (r = 0; r < t; r++) n += String.fromCharCode(255 & e), e >>>= 8;
|
|
173
|
-
return n;
|
|
174
|
-
}
|
|
175
|
-
function n(e, t, r, n, i, s) {
|
|
176
|
-
var a, o, h = e.file, u = e.compression, l = s !== O.utf8encode, f = I.transformTo("string", s(h.name)), c = I.transformTo("string", O.utf8encode(h.name)), d = h.comment, p = I.transformTo("string", s(d)), m = I.transformTo("string", O.utf8encode(d)), _ = c.length !== h.name.length, g = m.length !== d.length, b = "", v = "", y = "", w = h.dir, k = h.date, x = {
|
|
177
|
-
crc32: 0,
|
|
178
|
-
compressedSize: 0,
|
|
179
|
-
uncompressedSize: 0
|
|
180
|
-
};
|
|
181
|
-
t && !r || (x.crc32 = e.crc32, x.compressedSize = e.compressedSize, x.uncompressedSize = e.uncompressedSize);
|
|
182
|
-
var S = 0;
|
|
183
|
-
t && (S |= 8), l || !_ && !g || (S |= 2048);
|
|
184
|
-
var z = 0, C = 0;
|
|
185
|
-
w && (z |= 16), "UNIX" === i ? (C = 798, z |= function(e, t) {
|
|
186
|
-
var r = e;
|
|
187
|
-
return e || (r = t ? 16893 : 33204), (65535 & r) << 16;
|
|
188
|
-
}(h.unixPermissions, w)) : (C = 20, z |= function(e) {
|
|
189
|
-
return 63 & (e || 0);
|
|
190
|
-
}(h.dosPermissions)), a = k.getUTCHours(), a <<= 6, a |= k.getUTCMinutes(), a <<= 5, a |= k.getUTCSeconds() / 2, o = k.getUTCFullYear() - 1980, o <<= 4, o |= k.getUTCMonth() + 1, o <<= 5, o |= k.getUTCDate(), _ && (v = A(1, 1) + A(B(f), 4) + c, b += "up" + A(v.length, 2) + v), g && (y = A(1, 1) + A(B(p), 4) + m, b += "uc" + A(y.length, 2) + y);
|
|
191
|
-
var E = "";
|
|
192
|
-
return E += "\n\0", E += A(S, 2), E += u.magic, E += A(a, 2), E += A(o, 2), E += A(x.crc32, 4), E += A(x.compressedSize, 4), E += A(x.uncompressedSize, 4), E += A(f.length, 2), E += A(b.length, 2), {
|
|
193
|
-
fileRecord: R.LOCAL_FILE_HEADER + E + f + b,
|
|
194
|
-
dirRecord: R.CENTRAL_FILE_HEADER + A(C, 2) + E + A(p.length, 2) + "\0\0\0\0" + A(z, 4) + A(n, 4) + f + b + p
|
|
195
|
-
};
|
|
196
|
-
}
|
|
197
|
-
var I = e("../utils"), i = e("../stream/GenericWorker"), O = e("../utf8"), B = e("../crc32"), R = e("../signature");
|
|
198
|
-
function s(e, t, r, n) {
|
|
199
|
-
i.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = t, this.zipPlatform = r, this.encodeFileName = n, this.streamFiles = e, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
|
|
200
|
-
}
|
|
201
|
-
I.inherits(s, i), s.prototype.push = function(e) {
|
|
202
|
-
var t = e.meta.percent || 0, r = this.entriesCount, n = this._sources.length;
|
|
203
|
-
this.accumulate ? this.contentBuffer.push(e) : (this.bytesWritten += e.data.length, i.prototype.push.call(this, {
|
|
204
|
-
data: e.data,
|
|
205
|
-
meta: {
|
|
206
|
-
currentFile: this.currentFile,
|
|
207
|
-
percent: r ? (t + 100 * (r - n - 1)) / r : 100
|
|
208
|
-
}
|
|
209
|
-
}));
|
|
210
|
-
}, s.prototype.openedSource = function(e) {
|
|
211
|
-
this.currentSourceOffset = this.bytesWritten, this.currentFile = e.file.name;
|
|
212
|
-
var t = this.streamFiles && !e.file.dir;
|
|
213
|
-
if (t) {
|
|
214
|
-
var r = n(e, t, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
|
215
|
-
this.push({
|
|
216
|
-
data: r.fileRecord,
|
|
217
|
-
meta: { percent: 0 }
|
|
218
|
-
});
|
|
219
|
-
} else this.accumulate = !0;
|
|
220
|
-
}, s.prototype.closedSource = function(e) {
|
|
221
|
-
this.accumulate = !1;
|
|
222
|
-
var t = this.streamFiles && !e.file.dir, r = n(e, t, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
|
223
|
-
if (this.dirRecords.push(r.dirRecord), t) this.push({
|
|
224
|
-
data: function(e) {
|
|
225
|
-
return R.DATA_DESCRIPTOR + A(e.crc32, 4) + A(e.compressedSize, 4) + A(e.uncompressedSize, 4);
|
|
226
|
-
}(e),
|
|
227
|
-
meta: { percent: 100 }
|
|
228
|
-
});
|
|
229
|
-
else for (this.push({
|
|
230
|
-
data: r.fileRecord,
|
|
231
|
-
meta: { percent: 0 }
|
|
232
|
-
}); this.contentBuffer.length;) this.push(this.contentBuffer.shift());
|
|
233
|
-
this.currentFile = null;
|
|
234
|
-
}, s.prototype.flush = function() {
|
|
235
|
-
for (var e = this.bytesWritten, t = 0; t < this.dirRecords.length; t++) this.push({
|
|
236
|
-
data: this.dirRecords[t],
|
|
237
|
-
meta: { percent: 100 }
|
|
238
|
-
});
|
|
239
|
-
var r = this.bytesWritten - e, n = function(e, t, r, n, i) {
|
|
240
|
-
var s = I.transformTo("string", i(n));
|
|
241
|
-
return R.CENTRAL_DIRECTORY_END + "\0\0\0\0" + A(e, 2) + A(e, 2) + A(t, 4) + A(r, 4) + A(s.length, 2) + s;
|
|
242
|
-
}(this.dirRecords.length, r, e, this.zipComment, this.encodeFileName);
|
|
243
|
-
this.push({
|
|
244
|
-
data: n,
|
|
245
|
-
meta: { percent: 100 }
|
|
246
|
-
});
|
|
247
|
-
}, s.prototype.prepareNextSource = function() {
|
|
248
|
-
this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
|
|
249
|
-
}, s.prototype.registerPrevious = function(e) {
|
|
250
|
-
this._sources.push(e);
|
|
251
|
-
var t = this;
|
|
252
|
-
return e.on("data", function(e) {
|
|
253
|
-
t.processChunk(e);
|
|
254
|
-
}), e.on("end", function() {
|
|
255
|
-
t.closedSource(t.previous.streamInfo), t._sources.length ? t.prepareNextSource() : t.end();
|
|
256
|
-
}), e.on("error", function(e) {
|
|
257
|
-
t.error(e);
|
|
258
|
-
}), this;
|
|
259
|
-
}, s.prototype.resume = function() {
|
|
260
|
-
return !!i.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
|
|
261
|
-
}, s.prototype.error = function(e) {
|
|
262
|
-
var t = this._sources;
|
|
263
|
-
if (!i.prototype.error.call(this, e)) return !1;
|
|
264
|
-
for (var r = 0; r < t.length; r++) try {
|
|
265
|
-
t[r].error(e);
|
|
266
|
-
} catch (e) {}
|
|
267
|
-
return !0;
|
|
268
|
-
}, s.prototype.lock = function() {
|
|
269
|
-
i.prototype.lock.call(this);
|
|
270
|
-
for (var e = this._sources, t = 0; t < e.length; t++) e[t].lock();
|
|
271
|
-
}, t.exports = s;
|
|
272
|
-
}, {
|
|
273
|
-
"../crc32": 4,
|
|
274
|
-
"../signature": 23,
|
|
275
|
-
"../stream/GenericWorker": 28,
|
|
276
|
-
"../utf8": 31,
|
|
277
|
-
"../utils": 32
|
|
278
|
-
}],
|
|
279
|
-
9: [function(e, t, r) {
|
|
280
|
-
"use strict";
|
|
281
|
-
var u = e("../compressions"), n = e("./ZipFileWorker");
|
|
282
|
-
r.generateWorker = function(e, a, t) {
|
|
283
|
-
var o = new n(a.streamFiles, t, a.platform, a.encodeFileName), h = 0;
|
|
284
|
-
try {
|
|
285
|
-
e.forEach(function(e, t) {
|
|
286
|
-
h++;
|
|
287
|
-
var r = function(e, t) {
|
|
288
|
-
var r = e || t, n = u[r];
|
|
289
|
-
if (!n) throw new Error(r + " is not a valid compression method !");
|
|
290
|
-
return n;
|
|
291
|
-
}(t.options.compression, a.compression), n = t.options.compressionOptions || a.compressionOptions || {}, i = t.dir, s = t.date;
|
|
292
|
-
t._compressWorker(r, n).withStreamInfo("file", {
|
|
293
|
-
name: e,
|
|
294
|
-
dir: i,
|
|
295
|
-
date: s,
|
|
296
|
-
comment: t.comment || "",
|
|
297
|
-
unixPermissions: t.unixPermissions,
|
|
298
|
-
dosPermissions: t.dosPermissions
|
|
299
|
-
}).pipe(o);
|
|
300
|
-
}), o.entriesCount = h;
|
|
301
|
-
} catch (e) {
|
|
302
|
-
o.error(e);
|
|
303
|
-
}
|
|
304
|
-
return o;
|
|
305
|
-
};
|
|
306
|
-
}, {
|
|
307
|
-
"../compressions": 3,
|
|
308
|
-
"./ZipFileWorker": 8
|
|
309
|
-
}],
|
|
310
|
-
10: [function(e, t, r) {
|
|
311
|
-
"use strict";
|
|
312
|
-
function n() {
|
|
313
|
-
if (!(this instanceof n)) return new n();
|
|
314
|
-
if (arguments.length) throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
315
|
-
this.files = Object.create(null), this.comment = null, this.root = "", this.clone = function() {
|
|
316
|
-
var e = new n();
|
|
317
|
-
for (var t in this) "function" != typeof this[t] && (e[t] = this[t]);
|
|
318
|
-
return e;
|
|
319
|
-
};
|
|
320
|
-
}
|
|
321
|
-
(n.prototype = e("./object")).loadAsync = e("./load"), n.support = e("./support"), n.defaults = e("./defaults"), n.version = "3.10.1", n.loadAsync = function(e, t) {
|
|
322
|
-
return new n().loadAsync(e, t);
|
|
323
|
-
}, n.external = e("./external"), t.exports = n;
|
|
324
|
-
}, {
|
|
325
|
-
"./defaults": 5,
|
|
326
|
-
"./external": 6,
|
|
327
|
-
"./load": 11,
|
|
328
|
-
"./object": 15,
|
|
329
|
-
"./support": 30
|
|
330
|
-
}],
|
|
331
|
-
11: [function(e, t, r) {
|
|
332
|
-
"use strict";
|
|
333
|
-
var u = e("./utils"), i = e("./external"), n = e("./utf8"), s = e("./zipEntries"), a = e("./stream/Crc32Probe"), l = e("./nodejsUtils");
|
|
334
|
-
function f(n) {
|
|
335
|
-
return new i.Promise(function(e, t) {
|
|
336
|
-
var r = n.decompressed.getContentWorker().pipe(new a());
|
|
337
|
-
r.on("error", function(e) {
|
|
338
|
-
t(e);
|
|
339
|
-
}).on("end", function() {
|
|
340
|
-
r.streamInfo.crc32 !== n.decompressed.crc32 ? t(/* @__PURE__ */ new Error("Corrupted zip : CRC32 mismatch")) : e();
|
|
341
|
-
}).resume();
|
|
342
|
-
});
|
|
343
|
-
}
|
|
344
|
-
t.exports = function(e, o) {
|
|
345
|
-
var h = this;
|
|
346
|
-
return o = u.extend(o || {}, {
|
|
347
|
-
base64: !1,
|
|
348
|
-
checkCRC32: !1,
|
|
349
|
-
optimizedBinaryString: !1,
|
|
350
|
-
createFolders: !1,
|
|
351
|
-
decodeFileName: n.utf8decode
|
|
352
|
-
}), l.isNode && l.isStream(e) ? i.Promise.reject(/* @__PURE__ */ new Error("JSZip can't accept a stream when loading a zip file.")) : u.prepareContent("the loaded zip file", e, !0, o.optimizedBinaryString, o.base64).then(function(e) {
|
|
353
|
-
var t = new s(o);
|
|
354
|
-
return t.load(e), t;
|
|
355
|
-
}).then(function(e) {
|
|
356
|
-
var t = [i.Promise.resolve(e)], r = e.files;
|
|
357
|
-
if (o.checkCRC32) for (var n = 0; n < r.length; n++) t.push(f(r[n]));
|
|
358
|
-
return i.Promise.all(t);
|
|
359
|
-
}).then(function(e) {
|
|
360
|
-
for (var t = e.shift(), r = t.files, n = 0; n < r.length; n++) {
|
|
361
|
-
var i = r[n], s = i.fileNameStr, a = u.resolve(i.fileNameStr);
|
|
362
|
-
h.file(a, i.decompressed, {
|
|
363
|
-
binary: !0,
|
|
364
|
-
optimizedBinaryString: !0,
|
|
365
|
-
date: i.date,
|
|
366
|
-
dir: i.dir,
|
|
367
|
-
comment: i.fileCommentStr.length ? i.fileCommentStr : null,
|
|
368
|
-
unixPermissions: i.unixPermissions,
|
|
369
|
-
dosPermissions: i.dosPermissions,
|
|
370
|
-
createFolders: o.createFolders
|
|
371
|
-
}), i.dir || (h.file(a).unsafeOriginalName = s);
|
|
372
|
-
}
|
|
373
|
-
return t.zipComment.length && (h.comment = t.zipComment), h;
|
|
374
|
-
});
|
|
375
|
-
};
|
|
376
|
-
}, {
|
|
377
|
-
"./external": 6,
|
|
378
|
-
"./nodejsUtils": 14,
|
|
379
|
-
"./stream/Crc32Probe": 25,
|
|
380
|
-
"./utf8": 31,
|
|
381
|
-
"./utils": 32,
|
|
382
|
-
"./zipEntries": 33
|
|
383
|
-
}],
|
|
384
|
-
12: [function(e, t, r) {
|
|
385
|
-
"use strict";
|
|
386
|
-
var n = e("../utils"), i = e("../stream/GenericWorker");
|
|
387
|
-
function s(e, t) {
|
|
388
|
-
i.call(this, "Nodejs stream input adapter for " + e), this._upstreamEnded = !1, this._bindStream(t);
|
|
389
|
-
}
|
|
390
|
-
n.inherits(s, i), s.prototype._bindStream = function(e) {
|
|
391
|
-
var t = this;
|
|
392
|
-
(this._stream = e).pause(), e.on("data", function(e) {
|
|
393
|
-
t.push({
|
|
394
|
-
data: e,
|
|
395
|
-
meta: { percent: 0 }
|
|
396
|
-
});
|
|
397
|
-
}).on("error", function(e) {
|
|
398
|
-
t.isPaused ? this.generatedError = e : t.error(e);
|
|
399
|
-
}).on("end", function() {
|
|
400
|
-
t.isPaused ? t._upstreamEnded = !0 : t.end();
|
|
401
|
-
});
|
|
402
|
-
}, s.prototype.pause = function() {
|
|
403
|
-
return !!i.prototype.pause.call(this) && (this._stream.pause(), !0);
|
|
404
|
-
}, s.prototype.resume = function() {
|
|
405
|
-
return !!i.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
|
|
406
|
-
}, t.exports = s;
|
|
407
|
-
}, {
|
|
408
|
-
"../stream/GenericWorker": 28,
|
|
409
|
-
"../utils": 32
|
|
410
|
-
}],
|
|
411
|
-
13: [function(e, t, r) {
|
|
412
|
-
"use strict";
|
|
413
|
-
var i = e("readable-stream").Readable;
|
|
414
|
-
function n(e, t, r) {
|
|
415
|
-
i.call(this, t), this._helper = e;
|
|
416
|
-
var n = this;
|
|
417
|
-
e.on("data", function(e, t) {
|
|
418
|
-
n.push(e) || n._helper.pause(), r && r(t);
|
|
419
|
-
}).on("error", function(e) {
|
|
420
|
-
n.emit("error", e);
|
|
421
|
-
}).on("end", function() {
|
|
422
|
-
n.push(null);
|
|
423
|
-
});
|
|
424
|
-
}
|
|
425
|
-
e("../utils").inherits(n, i), n.prototype._read = function() {
|
|
426
|
-
this._helper.resume();
|
|
427
|
-
}, t.exports = n;
|
|
428
|
-
}, {
|
|
429
|
-
"../utils": 32,
|
|
430
|
-
"readable-stream": 16
|
|
431
|
-
}],
|
|
432
|
-
14: [function(e, t, r) {
|
|
433
|
-
"use strict";
|
|
434
|
-
t.exports = {
|
|
435
|
-
isNode: "undefined" != typeof Buffer,
|
|
436
|
-
newBufferFrom: function(e, t) {
|
|
437
|
-
if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(e, t);
|
|
438
|
-
if ("number" == typeof e) throw new Error("The \"data\" argument must not be a number");
|
|
439
|
-
return new Buffer(e, t);
|
|
440
|
-
},
|
|
441
|
-
allocBuffer: function(e) {
|
|
442
|
-
if (Buffer.alloc) return Buffer.alloc(e);
|
|
443
|
-
var t = new Buffer(e);
|
|
444
|
-
return t.fill(0), t;
|
|
445
|
-
},
|
|
446
|
-
isBuffer: function(e) {
|
|
447
|
-
return Buffer.isBuffer(e);
|
|
448
|
-
},
|
|
449
|
-
isStream: function(e) {
|
|
450
|
-
return e && "function" == typeof e.on && "function" == typeof e.pause && "function" == typeof e.resume;
|
|
451
|
-
}
|
|
452
|
-
};
|
|
453
|
-
}, {}],
|
|
454
|
-
15: [function(e, t, r) {
|
|
455
|
-
"use strict";
|
|
456
|
-
function s(e, t, r) {
|
|
457
|
-
var n, i = u.getTypeOf(t), s = u.extend(r || {}, f);
|
|
458
|
-
s.date = s.date || /* @__PURE__ */ new Date(), null !== s.compression && (s.compression = s.compression.toUpperCase()), "string" == typeof s.unixPermissions && (s.unixPermissions = parseInt(s.unixPermissions, 8)), s.unixPermissions && 16384 & s.unixPermissions && (s.dir = !0), s.dosPermissions && 16 & s.dosPermissions && (s.dir = !0), s.dir && (e = g(e)), s.createFolders && (n = _(e)) && b.call(this, n, !0);
|
|
459
|
-
var a = "string" === i && !1 === s.binary && !1 === s.base64;
|
|
460
|
-
r && void 0 !== r.binary || (s.binary = !a), (t instanceof c && 0 === t.uncompressedSize || s.dir || !t || 0 === t.length) && (s.base64 = !1, s.binary = !0, t = "", s.compression = "STORE", i = "string");
|
|
461
|
-
var o = null;
|
|
462
|
-
o = t instanceof c || t instanceof l ? t : p.isNode && p.isStream(t) ? new m(e, t) : u.prepareContent(e, t, s.binary, s.optimizedBinaryString, s.base64);
|
|
463
|
-
var h = new d(e, o, s);
|
|
464
|
-
this.files[e] = h;
|
|
465
|
-
}
|
|
466
|
-
var i = e("./utf8"), u = e("./utils"), l = e("./stream/GenericWorker"), a = e("./stream/StreamHelper"), f = e("./defaults"), c = e("./compressedObject"), d = e("./zipObject"), o = e("./generate"), p = e("./nodejsUtils"), m = e("./nodejs/NodejsStreamInputAdapter"), _ = function(e) {
|
|
467
|
-
"/" === e.slice(-1) && (e = e.substring(0, e.length - 1));
|
|
468
|
-
var t = e.lastIndexOf("/");
|
|
469
|
-
return 0 < t ? e.substring(0, t) : "";
|
|
470
|
-
}, g = function(e) {
|
|
471
|
-
return "/" !== e.slice(-1) && (e += "/"), e;
|
|
472
|
-
}, b = function(e, t) {
|
|
473
|
-
return t = void 0 !== t ? t : f.createFolders, e = g(e), this.files[e] || s.call(this, e, null, {
|
|
474
|
-
dir: !0,
|
|
475
|
-
createFolders: t
|
|
476
|
-
}), this.files[e];
|
|
477
|
-
};
|
|
478
|
-
function h(e) {
|
|
479
|
-
return "[object RegExp]" === Object.prototype.toString.call(e);
|
|
480
|
-
}
|
|
481
|
-
t.exports = {
|
|
482
|
-
load: function() {
|
|
483
|
-
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
484
|
-
},
|
|
485
|
-
forEach: function(e) {
|
|
486
|
-
var t, r, n;
|
|
487
|
-
for (t in this.files) n = this.files[t], (r = t.slice(this.root.length, t.length)) && t.slice(0, this.root.length) === this.root && e(r, n);
|
|
488
|
-
},
|
|
489
|
-
filter: function(r) {
|
|
490
|
-
var n = [];
|
|
491
|
-
return this.forEach(function(e, t) {
|
|
492
|
-
r(e, t) && n.push(t);
|
|
493
|
-
}), n;
|
|
494
|
-
},
|
|
495
|
-
file: function(e, t, r) {
|
|
496
|
-
if (1 !== arguments.length) return e = this.root + e, s.call(this, e, t, r), this;
|
|
497
|
-
if (h(e)) {
|
|
498
|
-
var n = e;
|
|
499
|
-
return this.filter(function(e, t) {
|
|
500
|
-
return !t.dir && n.test(e);
|
|
501
|
-
});
|
|
502
|
-
}
|
|
503
|
-
var i = this.files[this.root + e];
|
|
504
|
-
return i && !i.dir ? i : null;
|
|
505
|
-
},
|
|
506
|
-
folder: function(r) {
|
|
507
|
-
if (!r) return this;
|
|
508
|
-
if (h(r)) return this.filter(function(e, t) {
|
|
509
|
-
return t.dir && r.test(e);
|
|
510
|
-
});
|
|
511
|
-
var e = this.root + r, t = b.call(this, e), n = this.clone();
|
|
512
|
-
return n.root = t.name, n;
|
|
513
|
-
},
|
|
514
|
-
remove: function(r) {
|
|
515
|
-
r = this.root + r;
|
|
516
|
-
var e = this.files[r];
|
|
517
|
-
if (e || ("/" !== r.slice(-1) && (r += "/"), e = this.files[r]), e && !e.dir) delete this.files[r];
|
|
518
|
-
else for (var t = this.filter(function(e, t) {
|
|
519
|
-
return t.name.slice(0, r.length) === r;
|
|
520
|
-
}), n = 0; n < t.length; n++) delete this.files[t[n].name];
|
|
521
|
-
return this;
|
|
522
|
-
},
|
|
523
|
-
generate: function() {
|
|
524
|
-
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
525
|
-
},
|
|
526
|
-
generateInternalStream: function(e) {
|
|
527
|
-
var t, r = {};
|
|
528
|
-
try {
|
|
529
|
-
if ((r = u.extend(e || {}, {
|
|
530
|
-
streamFiles: !1,
|
|
531
|
-
compression: "STORE",
|
|
532
|
-
compressionOptions: null,
|
|
533
|
-
type: "",
|
|
534
|
-
platform: "DOS",
|
|
535
|
-
comment: null,
|
|
536
|
-
mimeType: "application/zip",
|
|
537
|
-
encodeFileName: i.utf8encode
|
|
538
|
-
})).type = r.type.toLowerCase(), r.compression = r.compression.toUpperCase(), "binarystring" === r.type && (r.type = "string"), !r.type) throw new Error("No output type specified.");
|
|
539
|
-
u.checkSupport(r.type), "darwin" !== r.platform && "freebsd" !== r.platform && "linux" !== r.platform && "sunos" !== r.platform || (r.platform = "UNIX"), "win32" === r.platform && (r.platform = "DOS");
|
|
540
|
-
var n = r.comment || this.comment || "";
|
|
541
|
-
t = o.generateWorker(this, r, n);
|
|
542
|
-
} catch (e) {
|
|
543
|
-
(t = new l("error")).error(e);
|
|
544
|
-
}
|
|
545
|
-
return new a(t, r.type || "string", r.mimeType);
|
|
546
|
-
},
|
|
547
|
-
generateAsync: function(e, t) {
|
|
548
|
-
return this.generateInternalStream(e).accumulate(t);
|
|
549
|
-
},
|
|
550
|
-
generateNodeStream: function(e, t) {
|
|
551
|
-
return (e = e || {}).type || (e.type = "nodebuffer"), this.generateInternalStream(e).toNodejsStream(t);
|
|
552
|
-
}
|
|
553
|
-
};
|
|
554
|
-
}, {
|
|
555
|
-
"./compressedObject": 2,
|
|
556
|
-
"./defaults": 5,
|
|
557
|
-
"./generate": 9,
|
|
558
|
-
"./nodejs/NodejsStreamInputAdapter": 12,
|
|
559
|
-
"./nodejsUtils": 14,
|
|
560
|
-
"./stream/GenericWorker": 28,
|
|
561
|
-
"./stream/StreamHelper": 29,
|
|
562
|
-
"./utf8": 31,
|
|
563
|
-
"./utils": 32,
|
|
564
|
-
"./zipObject": 35
|
|
565
|
-
}],
|
|
566
|
-
16: [function(e, t, r) {
|
|
567
|
-
"use strict";
|
|
568
|
-
t.exports = e("stream");
|
|
569
|
-
}, { stream: void 0 }],
|
|
570
|
-
17: [function(e, t, r) {
|
|
571
|
-
"use strict";
|
|
572
|
-
var n = e("./DataReader");
|
|
573
|
-
function i(e) {
|
|
574
|
-
n.call(this, e);
|
|
575
|
-
for (var t = 0; t < this.data.length; t++) e[t] = 255 & e[t];
|
|
576
|
-
}
|
|
577
|
-
e("../utils").inherits(i, n), i.prototype.byteAt = function(e) {
|
|
578
|
-
return this.data[this.zero + e];
|
|
579
|
-
}, i.prototype.lastIndexOfSignature = function(e) {
|
|
580
|
-
for (var t = e.charCodeAt(0), r = e.charCodeAt(1), n = e.charCodeAt(2), i = e.charCodeAt(3), s = this.length - 4; 0 <= s; --s) if (this.data[s] === t && this.data[s + 1] === r && this.data[s + 2] === n && this.data[s + 3] === i) return s - this.zero;
|
|
581
|
-
return -1;
|
|
582
|
-
}, i.prototype.readAndCheckSignature = function(e) {
|
|
583
|
-
var t = e.charCodeAt(0), r = e.charCodeAt(1), n = e.charCodeAt(2), i = e.charCodeAt(3), s = this.readData(4);
|
|
584
|
-
return t === s[0] && r === s[1] && n === s[2] && i === s[3];
|
|
585
|
-
}, i.prototype.readData = function(e) {
|
|
586
|
-
if (this.checkOffset(e), 0 === e) return [];
|
|
587
|
-
var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
|
|
588
|
-
return this.index += e, t;
|
|
589
|
-
}, t.exports = i;
|
|
590
|
-
}, {
|
|
591
|
-
"../utils": 32,
|
|
592
|
-
"./DataReader": 18
|
|
593
|
-
}],
|
|
594
|
-
18: [function(e, t, r) {
|
|
595
|
-
"use strict";
|
|
596
|
-
var n = e("../utils");
|
|
597
|
-
function i(e) {
|
|
598
|
-
this.data = e, this.length = e.length, this.index = 0, this.zero = 0;
|
|
599
|
-
}
|
|
600
|
-
i.prototype = {
|
|
601
|
-
checkOffset: function(e) {
|
|
602
|
-
this.checkIndex(this.index + e);
|
|
603
|
-
},
|
|
604
|
-
checkIndex: function(e) {
|
|
605
|
-
if (this.length < this.zero + e || e < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + e + "). Corrupted zip ?");
|
|
606
|
-
},
|
|
607
|
-
setIndex: function(e) {
|
|
608
|
-
this.checkIndex(e), this.index = e;
|
|
609
|
-
},
|
|
610
|
-
skip: function(e) {
|
|
611
|
-
this.setIndex(this.index + e);
|
|
612
|
-
},
|
|
613
|
-
byteAt: function() {},
|
|
614
|
-
readInt: function(e) {
|
|
615
|
-
var t, r = 0;
|
|
616
|
-
for (this.checkOffset(e), t = this.index + e - 1; t >= this.index; t--) r = (r << 8) + this.byteAt(t);
|
|
617
|
-
return this.index += e, r;
|
|
618
|
-
},
|
|
619
|
-
readString: function(e) {
|
|
620
|
-
return n.transformTo("string", this.readData(e));
|
|
621
|
-
},
|
|
622
|
-
readData: function() {},
|
|
623
|
-
lastIndexOfSignature: function() {},
|
|
624
|
-
readAndCheckSignature: function() {},
|
|
625
|
-
readDate: function() {
|
|
626
|
-
var e = this.readInt(4);
|
|
627
|
-
return new Date(Date.UTC(1980 + (e >> 25 & 127), (e >> 21 & 15) - 1, e >> 16 & 31, e >> 11 & 31, e >> 5 & 63, (31 & e) << 1));
|
|
628
|
-
}
|
|
629
|
-
}, t.exports = i;
|
|
630
|
-
}, { "../utils": 32 }],
|
|
631
|
-
19: [function(e, t, r) {
|
|
632
|
-
"use strict";
|
|
633
|
-
var n = e("./Uint8ArrayReader");
|
|
634
|
-
function i(e) {
|
|
635
|
-
n.call(this, e);
|
|
636
|
-
}
|
|
637
|
-
e("../utils").inherits(i, n), i.prototype.readData = function(e) {
|
|
638
|
-
this.checkOffset(e);
|
|
639
|
-
var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
|
|
640
|
-
return this.index += e, t;
|
|
641
|
-
}, t.exports = i;
|
|
642
|
-
}, {
|
|
643
|
-
"../utils": 32,
|
|
644
|
-
"./Uint8ArrayReader": 21
|
|
645
|
-
}],
|
|
646
|
-
20: [function(e, t, r) {
|
|
647
|
-
"use strict";
|
|
648
|
-
var n = e("./DataReader");
|
|
649
|
-
function i(e) {
|
|
650
|
-
n.call(this, e);
|
|
651
|
-
}
|
|
652
|
-
e("../utils").inherits(i, n), i.prototype.byteAt = function(e) {
|
|
653
|
-
return this.data.charCodeAt(this.zero + e);
|
|
654
|
-
}, i.prototype.lastIndexOfSignature = function(e) {
|
|
655
|
-
return this.data.lastIndexOf(e) - this.zero;
|
|
656
|
-
}, i.prototype.readAndCheckSignature = function(e) {
|
|
657
|
-
return e === this.readData(4);
|
|
658
|
-
}, i.prototype.readData = function(e) {
|
|
659
|
-
this.checkOffset(e);
|
|
660
|
-
var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
|
|
661
|
-
return this.index += e, t;
|
|
662
|
-
}, t.exports = i;
|
|
663
|
-
}, {
|
|
664
|
-
"../utils": 32,
|
|
665
|
-
"./DataReader": 18
|
|
666
|
-
}],
|
|
667
|
-
21: [function(e, t, r) {
|
|
668
|
-
"use strict";
|
|
669
|
-
var n = e("./ArrayReader");
|
|
670
|
-
function i(e) {
|
|
671
|
-
n.call(this, e);
|
|
672
|
-
}
|
|
673
|
-
e("../utils").inherits(i, n), i.prototype.readData = function(e) {
|
|
674
|
-
if (this.checkOffset(e), 0 === e) return new Uint8Array(0);
|
|
675
|
-
var t = this.data.subarray(this.zero + this.index, this.zero + this.index + e);
|
|
676
|
-
return this.index += e, t;
|
|
677
|
-
}, t.exports = i;
|
|
678
|
-
}, {
|
|
679
|
-
"../utils": 32,
|
|
680
|
-
"./ArrayReader": 17
|
|
681
|
-
}],
|
|
682
|
-
22: [function(e, t, r) {
|
|
683
|
-
"use strict";
|
|
684
|
-
var n = e("../utils"), i = e("../support"), s = e("./ArrayReader"), a = e("./StringReader"), o = e("./NodeBufferReader"), h = e("./Uint8ArrayReader");
|
|
685
|
-
t.exports = function(e) {
|
|
686
|
-
var t = n.getTypeOf(e);
|
|
687
|
-
return n.checkSupport(t), "string" !== t || i.uint8array ? "nodebuffer" === t ? new o(e) : i.uint8array ? new h(n.transformTo("uint8array", e)) : new s(n.transformTo("array", e)) : new a(e);
|
|
688
|
-
};
|
|
689
|
-
}, {
|
|
690
|
-
"../support": 30,
|
|
691
|
-
"../utils": 32,
|
|
692
|
-
"./ArrayReader": 17,
|
|
693
|
-
"./NodeBufferReader": 19,
|
|
694
|
-
"./StringReader": 20,
|
|
695
|
-
"./Uint8ArrayReader": 21
|
|
696
|
-
}],
|
|
697
|
-
23: [function(e, t, r) {
|
|
698
|
-
"use strict";
|
|
699
|
-
r.LOCAL_FILE_HEADER = "PK", r.CENTRAL_FILE_HEADER = "PK", r.CENTRAL_DIRECTORY_END = "PK", r.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", r.ZIP64_CENTRAL_DIRECTORY_END = "PK", r.DATA_DESCRIPTOR = "PK\x07\b";
|
|
700
|
-
}, {}],
|
|
701
|
-
24: [function(e, t, r) {
|
|
702
|
-
"use strict";
|
|
703
|
-
var n = e("./GenericWorker"), i = e("../utils");
|
|
704
|
-
function s(e) {
|
|
705
|
-
n.call(this, "ConvertWorker to " + e), this.destType = e;
|
|
706
|
-
}
|
|
707
|
-
i.inherits(s, n), s.prototype.processChunk = function(e) {
|
|
708
|
-
this.push({
|
|
709
|
-
data: i.transformTo(this.destType, e.data),
|
|
710
|
-
meta: e.meta
|
|
711
|
-
});
|
|
712
|
-
}, t.exports = s;
|
|
713
|
-
}, {
|
|
714
|
-
"../utils": 32,
|
|
715
|
-
"./GenericWorker": 28
|
|
716
|
-
}],
|
|
717
|
-
25: [function(e, t, r) {
|
|
718
|
-
"use strict";
|
|
719
|
-
var n = e("./GenericWorker"), i = e("../crc32");
|
|
720
|
-
function s() {
|
|
721
|
-
n.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
|
|
722
|
-
}
|
|
723
|
-
e("../utils").inherits(s, n), s.prototype.processChunk = function(e) {
|
|
724
|
-
this.streamInfo.crc32 = i(e.data, this.streamInfo.crc32 || 0), this.push(e);
|
|
725
|
-
}, t.exports = s;
|
|
726
|
-
}, {
|
|
727
|
-
"../crc32": 4,
|
|
728
|
-
"../utils": 32,
|
|
729
|
-
"./GenericWorker": 28
|
|
730
|
-
}],
|
|
731
|
-
26: [function(e, t, r) {
|
|
732
|
-
"use strict";
|
|
733
|
-
var n = e("../utils"), i = e("./GenericWorker");
|
|
734
|
-
function s(e) {
|
|
735
|
-
i.call(this, "DataLengthProbe for " + e), this.propName = e, this.withStreamInfo(e, 0);
|
|
736
|
-
}
|
|
737
|
-
n.inherits(s, i), s.prototype.processChunk = function(e) {
|
|
738
|
-
if (e) {
|
|
739
|
-
var t = this.streamInfo[this.propName] || 0;
|
|
740
|
-
this.streamInfo[this.propName] = t + e.data.length;
|
|
741
|
-
}
|
|
742
|
-
i.prototype.processChunk.call(this, e);
|
|
743
|
-
}, t.exports = s;
|
|
744
|
-
}, {
|
|
745
|
-
"../utils": 32,
|
|
746
|
-
"./GenericWorker": 28
|
|
747
|
-
}],
|
|
748
|
-
27: [function(e, t, r) {
|
|
749
|
-
"use strict";
|
|
750
|
-
var n = e("../utils"), i = e("./GenericWorker");
|
|
751
|
-
function s(e) {
|
|
752
|
-
i.call(this, "DataWorker");
|
|
753
|
-
var t = this;
|
|
754
|
-
this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, e.then(function(e) {
|
|
755
|
-
t.dataIsReady = !0, t.data = e, t.max = e && e.length || 0, t.type = n.getTypeOf(e), t.isPaused || t._tickAndRepeat();
|
|
756
|
-
}, function(e) {
|
|
757
|
-
t.error(e);
|
|
758
|
-
});
|
|
759
|
-
}
|
|
760
|
-
n.inherits(s, i), s.prototype.cleanUp = function() {
|
|
761
|
-
i.prototype.cleanUp.call(this), this.data = null;
|
|
762
|
-
}, s.prototype.resume = function() {
|
|
763
|
-
return !!i.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, n.delay(this._tickAndRepeat, [], this)), !0);
|
|
764
|
-
}, s.prototype._tickAndRepeat = function() {
|
|
765
|
-
this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (n.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
|
|
766
|
-
}, s.prototype._tick = function() {
|
|
767
|
-
if (this.isPaused || this.isFinished) return !1;
|
|
768
|
-
var e = null, t = Math.min(this.max, this.index + 16384);
|
|
769
|
-
if (this.index >= this.max) return this.end();
|
|
770
|
-
switch (this.type) {
|
|
771
|
-
case "string":
|
|
772
|
-
e = this.data.substring(this.index, t);
|
|
773
|
-
break;
|
|
774
|
-
case "uint8array":
|
|
775
|
-
e = this.data.subarray(this.index, t);
|
|
776
|
-
break;
|
|
777
|
-
case "array":
|
|
778
|
-
case "nodebuffer": e = this.data.slice(this.index, t);
|
|
779
|
-
}
|
|
780
|
-
return this.index = t, this.push({
|
|
781
|
-
data: e,
|
|
782
|
-
meta: { percent: this.max ? this.index / this.max * 100 : 0 }
|
|
783
|
-
});
|
|
784
|
-
}, t.exports = s;
|
|
785
|
-
}, {
|
|
786
|
-
"../utils": 32,
|
|
787
|
-
"./GenericWorker": 28
|
|
788
|
-
}],
|
|
789
|
-
28: [function(e, t, r) {
|
|
790
|
-
"use strict";
|
|
791
|
-
function n(e) {
|
|
792
|
-
this.name = e || "default", this.streamInfo = {}, this.generatedError = null, this.extraStreamInfo = {}, this.isPaused = !0, this.isFinished = !1, this.isLocked = !1, this._listeners = {
|
|
793
|
-
data: [],
|
|
794
|
-
end: [],
|
|
795
|
-
error: []
|
|
796
|
-
}, this.previous = null;
|
|
797
|
-
}
|
|
798
|
-
n.prototype = {
|
|
799
|
-
push: function(e) {
|
|
800
|
-
this.emit("data", e);
|
|
801
|
-
},
|
|
802
|
-
end: function() {
|
|
803
|
-
if (this.isFinished) return !1;
|
|
804
|
-
this.flush();
|
|
805
|
-
try {
|
|
806
|
-
this.emit("end"), this.cleanUp(), this.isFinished = !0;
|
|
807
|
-
} catch (e) {
|
|
808
|
-
this.emit("error", e);
|
|
809
|
-
}
|
|
810
|
-
return !0;
|
|
811
|
-
},
|
|
812
|
-
error: function(e) {
|
|
813
|
-
return !this.isFinished && (this.isPaused ? this.generatedError = e : (this.isFinished = !0, this.emit("error", e), this.previous && this.previous.error(e), this.cleanUp()), !0);
|
|
814
|
-
},
|
|
815
|
-
on: function(e, t) {
|
|
816
|
-
return this._listeners[e].push(t), this;
|
|
817
|
-
},
|
|
818
|
-
cleanUp: function() {
|
|
819
|
-
this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = [];
|
|
820
|
-
},
|
|
821
|
-
emit: function(e, t) {
|
|
822
|
-
if (this._listeners[e]) for (var r = 0; r < this._listeners[e].length; r++) this._listeners[e][r].call(this, t);
|
|
823
|
-
},
|
|
824
|
-
pipe: function(e) {
|
|
825
|
-
return e.registerPrevious(this);
|
|
826
|
-
},
|
|
827
|
-
registerPrevious: function(e) {
|
|
828
|
-
if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
|
|
829
|
-
this.streamInfo = e.streamInfo, this.mergeStreamInfo(), this.previous = e;
|
|
830
|
-
var t = this;
|
|
831
|
-
return e.on("data", function(e) {
|
|
832
|
-
t.processChunk(e);
|
|
833
|
-
}), e.on("end", function() {
|
|
834
|
-
t.end();
|
|
835
|
-
}), e.on("error", function(e) {
|
|
836
|
-
t.error(e);
|
|
837
|
-
}), this;
|
|
838
|
-
},
|
|
839
|
-
pause: function() {
|
|
840
|
-
return !this.isPaused && !this.isFinished && (this.isPaused = !0, this.previous && this.previous.pause(), !0);
|
|
841
|
-
},
|
|
842
|
-
resume: function() {
|
|
843
|
-
if (!this.isPaused || this.isFinished) return !1;
|
|
844
|
-
var e = this.isPaused = !1;
|
|
845
|
-
return this.generatedError && (this.error(this.generatedError), e = !0), this.previous && this.previous.resume(), !e;
|
|
846
|
-
},
|
|
847
|
-
flush: function() {},
|
|
848
|
-
processChunk: function(e) {
|
|
849
|
-
this.push(e);
|
|
850
|
-
},
|
|
851
|
-
withStreamInfo: function(e, t) {
|
|
852
|
-
return this.extraStreamInfo[e] = t, this.mergeStreamInfo(), this;
|
|
853
|
-
},
|
|
854
|
-
mergeStreamInfo: function() {
|
|
855
|
-
for (var e in this.extraStreamInfo) Object.prototype.hasOwnProperty.call(this.extraStreamInfo, e) && (this.streamInfo[e] = this.extraStreamInfo[e]);
|
|
856
|
-
},
|
|
857
|
-
lock: function() {
|
|
858
|
-
if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
|
|
859
|
-
this.isLocked = !0, this.previous && this.previous.lock();
|
|
860
|
-
},
|
|
861
|
-
toString: function() {
|
|
862
|
-
var e = "Worker " + this.name;
|
|
863
|
-
return this.previous ? this.previous + " -> " + e : e;
|
|
864
|
-
}
|
|
865
|
-
}, t.exports = n;
|
|
866
|
-
}, {}],
|
|
867
|
-
29: [function(e, t, r) {
|
|
868
|
-
"use strict";
|
|
869
|
-
var h = e("../utils"), i = e("./ConvertWorker"), s = e("./GenericWorker"), u = e("../base64"), n = e("../support"), a = e("../external"), o = null;
|
|
870
|
-
if (n.nodestream) try {
|
|
871
|
-
o = e("../nodejs/NodejsStreamOutputAdapter");
|
|
872
|
-
} catch (e) {}
|
|
873
|
-
function l(e, o) {
|
|
874
|
-
return new a.Promise(function(t, r) {
|
|
875
|
-
var n = [], i = e._internalType, s = e._outputType, a = e._mimeType;
|
|
876
|
-
e.on("data", function(e, t) {
|
|
877
|
-
n.push(e), o && o(t);
|
|
878
|
-
}).on("error", function(e) {
|
|
879
|
-
n = [], r(e);
|
|
880
|
-
}).on("end", function() {
|
|
881
|
-
try {
|
|
882
|
-
t(function(e, t, r) {
|
|
883
|
-
switch (e) {
|
|
884
|
-
case "blob": return h.newBlob(h.transformTo("arraybuffer", t), r);
|
|
885
|
-
case "base64": return u.encode(t);
|
|
886
|
-
default: return h.transformTo(e, t);
|
|
887
|
-
}
|
|
888
|
-
}(s, function(e, t) {
|
|
889
|
-
var r, n = 0, i = null, s = 0;
|
|
890
|
-
for (r = 0; r < t.length; r++) s += t[r].length;
|
|
891
|
-
switch (e) {
|
|
892
|
-
case "string": return t.join("");
|
|
893
|
-
case "array": return Array.prototype.concat.apply([], t);
|
|
894
|
-
case "uint8array":
|
|
895
|
-
for (i = new Uint8Array(s), r = 0; r < t.length; r++) i.set(t[r], n), n += t[r].length;
|
|
896
|
-
return i;
|
|
897
|
-
case "nodebuffer": return Buffer.concat(t);
|
|
898
|
-
default: throw new Error("concat : unsupported type '" + e + "'");
|
|
899
|
-
}
|
|
900
|
-
}(i, n), a));
|
|
901
|
-
} catch (e) {
|
|
902
|
-
r(e);
|
|
903
|
-
}
|
|
904
|
-
n = [];
|
|
905
|
-
}).resume();
|
|
906
|
-
});
|
|
907
|
-
}
|
|
908
|
-
function f(e, t, r) {
|
|
909
|
-
var n = t;
|
|
910
|
-
switch (t) {
|
|
911
|
-
case "blob":
|
|
912
|
-
case "arraybuffer":
|
|
913
|
-
n = "uint8array";
|
|
914
|
-
break;
|
|
915
|
-
case "base64": n = "string";
|
|
916
|
-
}
|
|
917
|
-
try {
|
|
918
|
-
this._internalType = n, this._outputType = t, this._mimeType = r, h.checkSupport(n), this._worker = e.pipe(new i(n)), e.lock();
|
|
919
|
-
} catch (e) {
|
|
920
|
-
this._worker = new s("error"), this._worker.error(e);
|
|
921
|
-
}
|
|
922
|
-
}
|
|
923
|
-
f.prototype = {
|
|
924
|
-
accumulate: function(e) {
|
|
925
|
-
return l(this, e);
|
|
926
|
-
},
|
|
927
|
-
on: function(e, t) {
|
|
928
|
-
var r = this;
|
|
929
|
-
return "data" === e ? this._worker.on(e, function(e) {
|
|
930
|
-
t.call(r, e.data, e.meta);
|
|
931
|
-
}) : this._worker.on(e, function() {
|
|
932
|
-
h.delay(t, arguments, r);
|
|
933
|
-
}), this;
|
|
934
|
-
},
|
|
935
|
-
resume: function() {
|
|
936
|
-
return h.delay(this._worker.resume, [], this._worker), this;
|
|
937
|
-
},
|
|
938
|
-
pause: function() {
|
|
939
|
-
return this._worker.pause(), this;
|
|
940
|
-
},
|
|
941
|
-
toNodejsStream: function(e) {
|
|
942
|
-
if (h.checkSupport("nodestream"), "nodebuffer" !== this._outputType) throw new Error(this._outputType + " is not supported by this method");
|
|
943
|
-
return new o(this, { objectMode: "nodebuffer" !== this._outputType }, e);
|
|
944
|
-
}
|
|
945
|
-
}, t.exports = f;
|
|
946
|
-
}, {
|
|
947
|
-
"../base64": 1,
|
|
948
|
-
"../external": 6,
|
|
949
|
-
"../nodejs/NodejsStreamOutputAdapter": 13,
|
|
950
|
-
"../support": 30,
|
|
951
|
-
"../utils": 32,
|
|
952
|
-
"./ConvertWorker": 24,
|
|
953
|
-
"./GenericWorker": 28
|
|
954
|
-
}],
|
|
955
|
-
30: [function(e, t, r) {
|
|
956
|
-
"use strict";
|
|
957
|
-
if (r.base64 = !0, r.array = !0, r.string = !0, r.arraybuffer = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array, r.nodebuffer = "undefined" != typeof Buffer, r.uint8array = "undefined" != typeof Uint8Array, "undefined" == typeof ArrayBuffer) r.blob = !1;
|
|
958
|
-
else {
|
|
959
|
-
var n = /* @__PURE__ */ new ArrayBuffer(0);
|
|
960
|
-
try {
|
|
961
|
-
r.blob = 0 === new Blob([n], { type: "application/zip" }).size;
|
|
962
|
-
} catch (e) {
|
|
963
|
-
try {
|
|
964
|
-
var i = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
|
965
|
-
i.append(n), r.blob = 0 === i.getBlob("application/zip").size;
|
|
966
|
-
} catch (e) {
|
|
967
|
-
r.blob = !1;
|
|
968
|
-
}
|
|
969
|
-
}
|
|
970
|
-
}
|
|
971
|
-
try {
|
|
972
|
-
r.nodestream = !!e("readable-stream").Readable;
|
|
973
|
-
} catch (e) {
|
|
974
|
-
r.nodestream = !1;
|
|
975
|
-
}
|
|
976
|
-
}, { "readable-stream": 16 }],
|
|
977
|
-
31: [function(e, t, s) {
|
|
978
|
-
"use strict";
|
|
979
|
-
for (var o = e("./utils"), h = e("./support"), r = e("./nodejsUtils"), n = e("./stream/GenericWorker"), u = new Array(256), i = 0; i < 256; i++) u[i] = 252 <= i ? 6 : 248 <= i ? 5 : 240 <= i ? 4 : 224 <= i ? 3 : 192 <= i ? 2 : 1;
|
|
980
|
-
u[254] = u[254] = 1;
|
|
981
|
-
function a() {
|
|
982
|
-
n.call(this, "utf-8 decode"), this.leftOver = null;
|
|
983
|
-
}
|
|
984
|
-
function l() {
|
|
985
|
-
n.call(this, "utf-8 encode");
|
|
986
|
-
}
|
|
987
|
-
s.utf8encode = function(e) {
|
|
988
|
-
return h.nodebuffer ? r.newBufferFrom(e, "utf-8") : function(e) {
|
|
989
|
-
var t, r, n, i, s, a = e.length, o = 0;
|
|
990
|
-
for (i = 0; i < a; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4;
|
|
991
|
-
for (t = h.uint8array ? new Uint8Array(o) : new Array(o), i = s = 0; s < o; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), r < 128 ? t[s++] = r : (r < 2048 ? t[s++] = 192 | r >>> 6 : (r < 65536 ? t[s++] = 224 | r >>> 12 : (t[s++] = 240 | r >>> 18, t[s++] = 128 | r >>> 12 & 63), t[s++] = 128 | r >>> 6 & 63), t[s++] = 128 | 63 & r);
|
|
992
|
-
return t;
|
|
993
|
-
}(e);
|
|
994
|
-
}, s.utf8decode = function(e) {
|
|
995
|
-
return h.nodebuffer ? o.transformTo("nodebuffer", e).toString("utf-8") : function(e) {
|
|
996
|
-
var t, r, n, i, s = e.length, a = new Array(2 * s);
|
|
997
|
-
for (t = r = 0; t < s;) if ((n = e[t++]) < 128) a[r++] = n;
|
|
998
|
-
else if (4 < (i = u[n])) a[r++] = 65533, t += i - 1;
|
|
999
|
-
else {
|
|
1000
|
-
for (n &= 2 === i ? 31 : 3 === i ? 15 : 7; 1 < i && t < s;) n = n << 6 | 63 & e[t++], i--;
|
|
1001
|
-
1 < i ? a[r++] = 65533 : n < 65536 ? a[r++] = n : (n -= 65536, a[r++] = 55296 | n >> 10 & 1023, a[r++] = 56320 | 1023 & n);
|
|
1002
|
-
}
|
|
1003
|
-
return a.length !== r && (a.subarray ? a = a.subarray(0, r) : a.length = r), o.applyFromCharCode(a);
|
|
1004
|
-
}(e = o.transformTo(h.uint8array ? "uint8array" : "array", e));
|
|
1005
|
-
}, o.inherits(a, n), a.prototype.processChunk = function(e) {
|
|
1006
|
-
var t = o.transformTo(h.uint8array ? "uint8array" : "array", e.data);
|
|
1007
|
-
if (this.leftOver && this.leftOver.length) {
|
|
1008
|
-
if (h.uint8array) {
|
|
1009
|
-
var r = t;
|
|
1010
|
-
(t = new Uint8Array(r.length + this.leftOver.length)).set(this.leftOver, 0), t.set(r, this.leftOver.length);
|
|
1011
|
-
} else t = this.leftOver.concat(t);
|
|
1012
|
-
this.leftOver = null;
|
|
1013
|
-
}
|
|
1014
|
-
var n = function(e, t) {
|
|
1015
|
-
var r;
|
|
1016
|
-
for ((t = t || e.length) > e.length && (t = e.length), r = t - 1; 0 <= r && 128 == (192 & e[r]);) r--;
|
|
1017
|
-
return r < 0 ? t : 0 === r ? t : r + u[e[r]] > t ? r : t;
|
|
1018
|
-
}(t), i = t;
|
|
1019
|
-
n !== t.length && (h.uint8array ? (i = t.subarray(0, n), this.leftOver = t.subarray(n, t.length)) : (i = t.slice(0, n), this.leftOver = t.slice(n, t.length))), this.push({
|
|
1020
|
-
data: s.utf8decode(i),
|
|
1021
|
-
meta: e.meta
|
|
1022
|
-
});
|
|
1023
|
-
}, a.prototype.flush = function() {
|
|
1024
|
-
this.leftOver && this.leftOver.length && (this.push({
|
|
1025
|
-
data: s.utf8decode(this.leftOver),
|
|
1026
|
-
meta: {}
|
|
1027
|
-
}), this.leftOver = null);
|
|
1028
|
-
}, s.Utf8DecodeWorker = a, o.inherits(l, n), l.prototype.processChunk = function(e) {
|
|
1029
|
-
this.push({
|
|
1030
|
-
data: s.utf8encode(e.data),
|
|
1031
|
-
meta: e.meta
|
|
1032
|
-
});
|
|
1033
|
-
}, s.Utf8EncodeWorker = l;
|
|
1034
|
-
}, {
|
|
1035
|
-
"./nodejsUtils": 14,
|
|
1036
|
-
"./stream/GenericWorker": 28,
|
|
1037
|
-
"./support": 30,
|
|
1038
|
-
"./utils": 32
|
|
1039
|
-
}],
|
|
1040
|
-
32: [function(e, t, a) {
|
|
1041
|
-
"use strict";
|
|
1042
|
-
var o = e("./support"), h = e("./base64"), r = e("./nodejsUtils"), u = e("./external");
|
|
1043
|
-
function n(e) {
|
|
1044
|
-
return e;
|
|
1045
|
-
}
|
|
1046
|
-
function l(e, t) {
|
|
1047
|
-
for (var r = 0; r < e.length; ++r) t[r] = 255 & e.charCodeAt(r);
|
|
1048
|
-
return t;
|
|
1049
|
-
}
|
|
1050
|
-
e("setimmediate"), a.newBlob = function(t, r) {
|
|
1051
|
-
a.checkSupport("blob");
|
|
1052
|
-
try {
|
|
1053
|
-
return new Blob([t], { type: r });
|
|
1054
|
-
} catch (e) {
|
|
1055
|
-
try {
|
|
1056
|
-
var n = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
|
1057
|
-
return n.append(t), n.getBlob(r);
|
|
1058
|
-
} catch (e) {
|
|
1059
|
-
throw new Error("Bug : can't construct the Blob.");
|
|
1060
|
-
}
|
|
1061
|
-
}
|
|
1062
|
-
};
|
|
1063
|
-
var i = {
|
|
1064
|
-
stringifyByChunk: function(e, t, r) {
|
|
1065
|
-
var n = [], i = 0, s = e.length;
|
|
1066
|
-
if (s <= r) return String.fromCharCode.apply(null, e);
|
|
1067
|
-
for (; i < s;) "array" === t || "nodebuffer" === t ? n.push(String.fromCharCode.apply(null, e.slice(i, Math.min(i + r, s)))) : n.push(String.fromCharCode.apply(null, e.subarray(i, Math.min(i + r, s)))), i += r;
|
|
1068
|
-
return n.join("");
|
|
1069
|
-
},
|
|
1070
|
-
stringifyByChar: function(e) {
|
|
1071
|
-
for (var t = "", r = 0; r < e.length; r++) t += String.fromCharCode(e[r]);
|
|
1072
|
-
return t;
|
|
1073
|
-
},
|
|
1074
|
-
applyCanBeUsed: {
|
|
1075
|
-
uint8array: function() {
|
|
1076
|
-
try {
|
|
1077
|
-
return o.uint8array && 1 === String.fromCharCode.apply(null, new Uint8Array(1)).length;
|
|
1078
|
-
} catch (e) {
|
|
1079
|
-
return !1;
|
|
1080
|
-
}
|
|
1081
|
-
}(),
|
|
1082
|
-
nodebuffer: function() {
|
|
1083
|
-
try {
|
|
1084
|
-
return o.nodebuffer && 1 === String.fromCharCode.apply(null, r.allocBuffer(1)).length;
|
|
1085
|
-
} catch (e) {
|
|
1086
|
-
return !1;
|
|
1087
|
-
}
|
|
1088
|
-
}()
|
|
1089
|
-
}
|
|
1090
|
-
};
|
|
1091
|
-
function s(e) {
|
|
1092
|
-
var t = 65536, r = a.getTypeOf(e), n = !0;
|
|
1093
|
-
if ("uint8array" === r ? n = i.applyCanBeUsed.uint8array : "nodebuffer" === r && (n = i.applyCanBeUsed.nodebuffer), n) for (; 1 < t;) try {
|
|
1094
|
-
return i.stringifyByChunk(e, r, t);
|
|
1095
|
-
} catch (e) {
|
|
1096
|
-
t = Math.floor(t / 2);
|
|
1097
|
-
}
|
|
1098
|
-
return i.stringifyByChar(e);
|
|
1099
|
-
}
|
|
1100
|
-
function f(e, t) {
|
|
1101
|
-
for (var r = 0; r < e.length; r++) t[r] = e[r];
|
|
1102
|
-
return t;
|
|
1103
|
-
}
|
|
1104
|
-
a.applyFromCharCode = s;
|
|
1105
|
-
var c = {};
|
|
1106
|
-
c.string = {
|
|
1107
|
-
string: n,
|
|
1108
|
-
array: function(e) {
|
|
1109
|
-
return l(e, new Array(e.length));
|
|
1110
|
-
},
|
|
1111
|
-
arraybuffer: function(e) {
|
|
1112
|
-
return c.string.uint8array(e).buffer;
|
|
1113
|
-
},
|
|
1114
|
-
uint8array: function(e) {
|
|
1115
|
-
return l(e, new Uint8Array(e.length));
|
|
1116
|
-
},
|
|
1117
|
-
nodebuffer: function(e) {
|
|
1118
|
-
return l(e, r.allocBuffer(e.length));
|
|
1119
|
-
}
|
|
1120
|
-
}, c.array = {
|
|
1121
|
-
string: s,
|
|
1122
|
-
array: n,
|
|
1123
|
-
arraybuffer: function(e) {
|
|
1124
|
-
return new Uint8Array(e).buffer;
|
|
1125
|
-
},
|
|
1126
|
-
uint8array: function(e) {
|
|
1127
|
-
return new Uint8Array(e);
|
|
1128
|
-
},
|
|
1129
|
-
nodebuffer: function(e) {
|
|
1130
|
-
return r.newBufferFrom(e);
|
|
1131
|
-
}
|
|
1132
|
-
}, c.arraybuffer = {
|
|
1133
|
-
string: function(e) {
|
|
1134
|
-
return s(new Uint8Array(e));
|
|
1135
|
-
},
|
|
1136
|
-
array: function(e) {
|
|
1137
|
-
return f(new Uint8Array(e), new Array(e.byteLength));
|
|
1138
|
-
},
|
|
1139
|
-
arraybuffer: n,
|
|
1140
|
-
uint8array: function(e) {
|
|
1141
|
-
return new Uint8Array(e);
|
|
1142
|
-
},
|
|
1143
|
-
nodebuffer: function(e) {
|
|
1144
|
-
return r.newBufferFrom(new Uint8Array(e));
|
|
1145
|
-
}
|
|
1146
|
-
}, c.uint8array = {
|
|
1147
|
-
string: s,
|
|
1148
|
-
array: function(e) {
|
|
1149
|
-
return f(e, new Array(e.length));
|
|
1150
|
-
},
|
|
1151
|
-
arraybuffer: function(e) {
|
|
1152
|
-
return e.buffer;
|
|
1153
|
-
},
|
|
1154
|
-
uint8array: n,
|
|
1155
|
-
nodebuffer: function(e) {
|
|
1156
|
-
return r.newBufferFrom(e);
|
|
1157
|
-
}
|
|
1158
|
-
}, c.nodebuffer = {
|
|
1159
|
-
string: s,
|
|
1160
|
-
array: function(e) {
|
|
1161
|
-
return f(e, new Array(e.length));
|
|
1162
|
-
},
|
|
1163
|
-
arraybuffer: function(e) {
|
|
1164
|
-
return c.nodebuffer.uint8array(e).buffer;
|
|
1165
|
-
},
|
|
1166
|
-
uint8array: function(e) {
|
|
1167
|
-
return f(e, new Uint8Array(e.length));
|
|
1168
|
-
},
|
|
1169
|
-
nodebuffer: n
|
|
1170
|
-
}, a.transformTo = function(e, t) {
|
|
1171
|
-
if (t = t || "", !e) return t;
|
|
1172
|
-
a.checkSupport(e);
|
|
1173
|
-
return c[a.getTypeOf(t)][e](t);
|
|
1174
|
-
}, a.resolve = function(e) {
|
|
1175
|
-
for (var t = e.split("/"), r = [], n = 0; n < t.length; n++) {
|
|
1176
|
-
var i = t[n];
|
|
1177
|
-
"." === i || "" === i && 0 !== n && n !== t.length - 1 || (".." === i ? r.pop() : r.push(i));
|
|
1178
|
-
}
|
|
1179
|
-
return r.join("/");
|
|
1180
|
-
}, a.getTypeOf = function(e) {
|
|
1181
|
-
return "string" == typeof e ? "string" : "[object Array]" === Object.prototype.toString.call(e) ? "array" : o.nodebuffer && r.isBuffer(e) ? "nodebuffer" : o.uint8array && e instanceof Uint8Array ? "uint8array" : o.arraybuffer && e instanceof ArrayBuffer ? "arraybuffer" : void 0;
|
|
1182
|
-
}, a.checkSupport = function(e) {
|
|
1183
|
-
if (!o[e.toLowerCase()]) throw new Error(e + " is not supported by this platform");
|
|
1184
|
-
}, a.MAX_VALUE_16BITS = 65535, a.MAX_VALUE_32BITS = -1, a.pretty = function(e) {
|
|
1185
|
-
var t, r, n = "";
|
|
1186
|
-
for (r = 0; r < (e || "").length; r++) n += "\\x" + ((t = e.charCodeAt(r)) < 16 ? "0" : "") + t.toString(16).toUpperCase();
|
|
1187
|
-
return n;
|
|
1188
|
-
}, a.delay = function(e, t, r) {
|
|
1189
|
-
setImmediate(function() {
|
|
1190
|
-
e.apply(r || null, t || []);
|
|
1191
|
-
});
|
|
1192
|
-
}, a.inherits = function(e, t) {
|
|
1193
|
-
function r() {}
|
|
1194
|
-
r.prototype = t.prototype, e.prototype = new r();
|
|
1195
|
-
}, a.extend = function() {
|
|
1196
|
-
var e, t, r = {};
|
|
1197
|
-
for (e = 0; e < arguments.length; e++) for (t in arguments[e]) Object.prototype.hasOwnProperty.call(arguments[e], t) && void 0 === r[t] && (r[t] = arguments[e][t]);
|
|
1198
|
-
return r;
|
|
1199
|
-
}, a.prepareContent = function(r, e, n, i, s) {
|
|
1200
|
-
return u.Promise.resolve(e).then(function(n) {
|
|
1201
|
-
return o.blob && (n instanceof Blob || -1 !== ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(n))) && "undefined" != typeof FileReader ? new u.Promise(function(t, r) {
|
|
1202
|
-
var e = new FileReader();
|
|
1203
|
-
e.onload = function(e) {
|
|
1204
|
-
t(e.target.result);
|
|
1205
|
-
}, e.onerror = function(e) {
|
|
1206
|
-
r(e.target.error);
|
|
1207
|
-
}, e.readAsArrayBuffer(n);
|
|
1208
|
-
}) : n;
|
|
1209
|
-
}).then(function(e) {
|
|
1210
|
-
var t = a.getTypeOf(e);
|
|
1211
|
-
return t ? ("arraybuffer" === t ? e = a.transformTo("uint8array", e) : "string" === t && (s ? e = h.decode(e) : n && !0 !== i && (e = function(e) {
|
|
1212
|
-
return l(e, o.uint8array ? new Uint8Array(e.length) : new Array(e.length));
|
|
1213
|
-
}(e))), e) : u.Promise.reject(/* @__PURE__ */ new Error("Can't read the data of '" + r + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
|
|
1214
|
-
});
|
|
1215
|
-
};
|
|
1216
|
-
}, {
|
|
1217
|
-
"./base64": 1,
|
|
1218
|
-
"./external": 6,
|
|
1219
|
-
"./nodejsUtils": 14,
|
|
1220
|
-
"./support": 30,
|
|
1221
|
-
setimmediate: 54
|
|
1222
|
-
}],
|
|
1223
|
-
33: [function(e, t, r) {
|
|
1224
|
-
"use strict";
|
|
1225
|
-
var n = e("./reader/readerFor"), i = e("./utils"), s = e("./signature"), a = e("./zipEntry"), o = e("./support");
|
|
1226
|
-
function h(e) {
|
|
1227
|
-
this.files = [], this.loadOptions = e;
|
|
1228
|
-
}
|
|
1229
|
-
h.prototype = {
|
|
1230
|
-
checkSignature: function(e) {
|
|
1231
|
-
if (!this.reader.readAndCheckSignature(e)) {
|
|
1232
|
-
this.reader.index -= 4;
|
|
1233
|
-
var t = this.reader.readString(4);
|
|
1234
|
-
throw new Error("Corrupted zip or bug: unexpected signature (" + i.pretty(t) + ", expected " + i.pretty(e) + ")");
|
|
1235
|
-
}
|
|
1236
|
-
},
|
|
1237
|
-
isSignature: function(e, t) {
|
|
1238
|
-
var r = this.reader.index;
|
|
1239
|
-
this.reader.setIndex(e);
|
|
1240
|
-
var n = this.reader.readString(4) === t;
|
|
1241
|
-
return this.reader.setIndex(r), n;
|
|
1242
|
-
},
|
|
1243
|
-
readBlockEndOfCentral: function() {
|
|
1244
|
-
this.diskNumber = this.reader.readInt(2), this.diskWithCentralDirStart = this.reader.readInt(2), this.centralDirRecordsOnThisDisk = this.reader.readInt(2), this.centralDirRecords = this.reader.readInt(2), this.centralDirSize = this.reader.readInt(4), this.centralDirOffset = this.reader.readInt(4), this.zipCommentLength = this.reader.readInt(2);
|
|
1245
|
-
var e = this.reader.readData(this.zipCommentLength), t = o.uint8array ? "uint8array" : "array", r = i.transformTo(t, e);
|
|
1246
|
-
this.zipComment = this.loadOptions.decodeFileName(r);
|
|
1247
|
-
},
|
|
1248
|
-
readBlockZip64EndOfCentral: function() {
|
|
1249
|
-
this.zip64EndOfCentralSize = this.reader.readInt(8), this.reader.skip(4), this.diskNumber = this.reader.readInt(4), this.diskWithCentralDirStart = this.reader.readInt(4), this.centralDirRecordsOnThisDisk = this.reader.readInt(8), this.centralDirRecords = this.reader.readInt(8), this.centralDirSize = this.reader.readInt(8), this.centralDirOffset = this.reader.readInt(8), this.zip64ExtensibleData = {};
|
|
1250
|
-
for (var e, t, r, n = this.zip64EndOfCentralSize - 44; 0 < n;) e = this.reader.readInt(2), t = this.reader.readInt(4), r = this.reader.readData(t), this.zip64ExtensibleData[e] = {
|
|
1251
|
-
id: e,
|
|
1252
|
-
length: t,
|
|
1253
|
-
value: r
|
|
1254
|
-
};
|
|
1255
|
-
},
|
|
1256
|
-
readBlockZip64EndOfCentralLocator: function() {
|
|
1257
|
-
if (this.diskWithZip64CentralDirStart = this.reader.readInt(4), this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8), this.disksCount = this.reader.readInt(4), 1 < this.disksCount) throw new Error("Multi-volumes zip are not supported");
|
|
1258
|
-
},
|
|
1259
|
-
readLocalFiles: function() {
|
|
1260
|
-
var e, t;
|
|
1261
|
-
for (e = 0; e < this.files.length; e++) t = this.files[e], this.reader.setIndex(t.localHeaderOffset), this.checkSignature(s.LOCAL_FILE_HEADER), t.readLocalPart(this.reader), t.handleUTF8(), t.processAttributes();
|
|
1262
|
-
},
|
|
1263
|
-
readCentralDir: function() {
|
|
1264
|
-
var e;
|
|
1265
|
-
for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(s.CENTRAL_FILE_HEADER);) (e = new a({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(e);
|
|
1266
|
-
if (this.centralDirRecords !== this.files.length && 0 !== this.centralDirRecords && 0 === this.files.length) throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length);
|
|
1267
|
-
},
|
|
1268
|
-
readEndOfCentral: function() {
|
|
1269
|
-
var e = this.reader.lastIndexOfSignature(s.CENTRAL_DIRECTORY_END);
|
|
1270
|
-
if (e < 0) throw !this.isSignature(0, s.LOCAL_FILE_HEADER) ? /* @__PURE__ */ new Error("Can't find end of central directory : is this a zip file ? If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html") : /* @__PURE__ */ new Error("Corrupted zip: can't find end of central directory");
|
|
1271
|
-
this.reader.setIndex(e);
|
|
1272
|
-
var t = e;
|
|
1273
|
-
if (this.checkSignature(s.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === i.MAX_VALUE_16BITS || this.diskWithCentralDirStart === i.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === i.MAX_VALUE_16BITS || this.centralDirRecords === i.MAX_VALUE_16BITS || this.centralDirSize === i.MAX_VALUE_32BITS || this.centralDirOffset === i.MAX_VALUE_32BITS) {
|
|
1274
|
-
if (this.zip64 = !0, (e = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
|
|
1275
|
-
if (this.reader.setIndex(e), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, s.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0)) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
|
|
1276
|
-
this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
|
|
1277
|
-
}
|
|
1278
|
-
var r = this.centralDirOffset + this.centralDirSize;
|
|
1279
|
-
this.zip64 && (r += 20, r += 12 + this.zip64EndOfCentralSize);
|
|
1280
|
-
var n = t - r;
|
|
1281
|
-
if (0 < n) this.isSignature(t, s.CENTRAL_FILE_HEADER) || (this.reader.zero = n);
|
|
1282
|
-
else if (n < 0) throw new Error("Corrupted zip: missing " + Math.abs(n) + " bytes.");
|
|
1283
|
-
},
|
|
1284
|
-
prepareReader: function(e) {
|
|
1285
|
-
this.reader = n(e);
|
|
1286
|
-
},
|
|
1287
|
-
load: function(e) {
|
|
1288
|
-
this.prepareReader(e), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
|
|
1289
|
-
}
|
|
1290
|
-
}, t.exports = h;
|
|
1291
|
-
}, {
|
|
1292
|
-
"./reader/readerFor": 22,
|
|
1293
|
-
"./signature": 23,
|
|
1294
|
-
"./support": 30,
|
|
1295
|
-
"./utils": 32,
|
|
1296
|
-
"./zipEntry": 34
|
|
1297
|
-
}],
|
|
1298
|
-
34: [function(e, t, r) {
|
|
1299
|
-
"use strict";
|
|
1300
|
-
var n = e("./reader/readerFor"), s = e("./utils"), i = e("./compressedObject"), a = e("./crc32"), o = e("./utf8"), h = e("./compressions"), u = e("./support");
|
|
1301
|
-
function l(e, t) {
|
|
1302
|
-
this.options = e, this.loadOptions = t;
|
|
1303
|
-
}
|
|
1304
|
-
l.prototype = {
|
|
1305
|
-
isEncrypted: function() {
|
|
1306
|
-
return 1 == (1 & this.bitFlag);
|
|
1307
|
-
},
|
|
1308
|
-
useUTF8: function() {
|
|
1309
|
-
return 2048 == (2048 & this.bitFlag);
|
|
1310
|
-
},
|
|
1311
|
-
readLocalPart: function(e) {
|
|
1312
|
-
var t, r;
|
|
1313
|
-
if (e.skip(22), this.fileNameLength = e.readInt(2), r = e.readInt(2), this.fileName = e.readData(this.fileNameLength), e.skip(r), -1 === this.compressedSize || -1 === this.uncompressedSize) throw new Error("Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)");
|
|
1314
|
-
if (null === (t = function(e) {
|
|
1315
|
-
for (var t in h) if (Object.prototype.hasOwnProperty.call(h, t) && h[t].magic === e) return h[t];
|
|
1316
|
-
return null;
|
|
1317
|
-
}(this.compressionMethod))) throw new Error("Corrupted zip : compression " + s.pretty(this.compressionMethod) + " unknown (inner file : " + s.transformTo("string", this.fileName) + ")");
|
|
1318
|
-
this.decompressed = new i(this.compressedSize, this.uncompressedSize, this.crc32, t, e.readData(this.compressedSize));
|
|
1319
|
-
},
|
|
1320
|
-
readCentralPart: function(e) {
|
|
1321
|
-
this.versionMadeBy = e.readInt(2), e.skip(2), this.bitFlag = e.readInt(2), this.compressionMethod = e.readString(2), this.date = e.readDate(), this.crc32 = e.readInt(4), this.compressedSize = e.readInt(4), this.uncompressedSize = e.readInt(4);
|
|
1322
|
-
var t = e.readInt(2);
|
|
1323
|
-
if (this.extraFieldsLength = e.readInt(2), this.fileCommentLength = e.readInt(2), this.diskNumberStart = e.readInt(2), this.internalFileAttributes = e.readInt(2), this.externalFileAttributes = e.readInt(4), this.localHeaderOffset = e.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
|
|
1324
|
-
e.skip(t), this.readExtraFields(e), this.parseZIP64ExtraField(e), this.fileComment = e.readData(this.fileCommentLength);
|
|
1325
|
-
},
|
|
1326
|
-
processAttributes: function() {
|
|
1327
|
-
this.unixPermissions = null, this.dosPermissions = null;
|
|
1328
|
-
var e = this.versionMadeBy >> 8;
|
|
1329
|
-
this.dir = !!(16 & this.externalFileAttributes), 0 == e && (this.dosPermissions = 63 & this.externalFileAttributes), 3 == e && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || "/" !== this.fileNameStr.slice(-1) || (this.dir = !0);
|
|
1330
|
-
},
|
|
1331
|
-
parseZIP64ExtraField: function() {
|
|
1332
|
-
if (this.extraFields[1]) {
|
|
1333
|
-
var e = n(this.extraFields[1].value);
|
|
1334
|
-
this.uncompressedSize === s.MAX_VALUE_32BITS && (this.uncompressedSize = e.readInt(8)), this.compressedSize === s.MAX_VALUE_32BITS && (this.compressedSize = e.readInt(8)), this.localHeaderOffset === s.MAX_VALUE_32BITS && (this.localHeaderOffset = e.readInt(8)), this.diskNumberStart === s.MAX_VALUE_32BITS && (this.diskNumberStart = e.readInt(4));
|
|
1335
|
-
}
|
|
1336
|
-
},
|
|
1337
|
-
readExtraFields: function(e) {
|
|
1338
|
-
var t, r, n, i = e.index + this.extraFieldsLength;
|
|
1339
|
-
for (this.extraFields || (this.extraFields = {}); e.index + 4 < i;) t = e.readInt(2), r = e.readInt(2), n = e.readData(r), this.extraFields[t] = {
|
|
1340
|
-
id: t,
|
|
1341
|
-
length: r,
|
|
1342
|
-
value: n
|
|
1343
|
-
};
|
|
1344
|
-
e.setIndex(i);
|
|
1345
|
-
},
|
|
1346
|
-
handleUTF8: function() {
|
|
1347
|
-
var e = u.uint8array ? "uint8array" : "array";
|
|
1348
|
-
if (this.useUTF8()) this.fileNameStr = o.utf8decode(this.fileName), this.fileCommentStr = o.utf8decode(this.fileComment);
|
|
1349
|
-
else {
|
|
1350
|
-
var t = this.findExtraFieldUnicodePath();
|
|
1351
|
-
if (null !== t) this.fileNameStr = t;
|
|
1352
|
-
else {
|
|
1353
|
-
var r = s.transformTo(e, this.fileName);
|
|
1354
|
-
this.fileNameStr = this.loadOptions.decodeFileName(r);
|
|
1355
|
-
}
|
|
1356
|
-
var n = this.findExtraFieldUnicodeComment();
|
|
1357
|
-
if (null !== n) this.fileCommentStr = n;
|
|
1358
|
-
else {
|
|
1359
|
-
var i = s.transformTo(e, this.fileComment);
|
|
1360
|
-
this.fileCommentStr = this.loadOptions.decodeFileName(i);
|
|
1361
|
-
}
|
|
1362
|
-
}
|
|
1363
|
-
},
|
|
1364
|
-
findExtraFieldUnicodePath: function() {
|
|
1365
|
-
var e = this.extraFields[28789];
|
|
1366
|
-
if (e) {
|
|
1367
|
-
var t = n(e.value);
|
|
1368
|
-
return 1 !== t.readInt(1) ? null : a(this.fileName) !== t.readInt(4) ? null : o.utf8decode(t.readData(e.length - 5));
|
|
1369
|
-
}
|
|
1370
|
-
return null;
|
|
1371
|
-
},
|
|
1372
|
-
findExtraFieldUnicodeComment: function() {
|
|
1373
|
-
var e = this.extraFields[25461];
|
|
1374
|
-
if (e) {
|
|
1375
|
-
var t = n(e.value);
|
|
1376
|
-
return 1 !== t.readInt(1) ? null : a(this.fileComment) !== t.readInt(4) ? null : o.utf8decode(t.readData(e.length - 5));
|
|
1377
|
-
}
|
|
1378
|
-
return null;
|
|
1379
|
-
}
|
|
1380
|
-
}, t.exports = l;
|
|
1381
|
-
}, {
|
|
1382
|
-
"./compressedObject": 2,
|
|
1383
|
-
"./compressions": 3,
|
|
1384
|
-
"./crc32": 4,
|
|
1385
|
-
"./reader/readerFor": 22,
|
|
1386
|
-
"./support": 30,
|
|
1387
|
-
"./utf8": 31,
|
|
1388
|
-
"./utils": 32
|
|
1389
|
-
}],
|
|
1390
|
-
35: [function(e, t, r) {
|
|
1391
|
-
"use strict";
|
|
1392
|
-
function n(e, t, r) {
|
|
1393
|
-
this.name = e, this.dir = r.dir, this.date = r.date, this.comment = r.comment, this.unixPermissions = r.unixPermissions, this.dosPermissions = r.dosPermissions, this._data = t, this._dataBinary = r.binary, this.options = {
|
|
1394
|
-
compression: r.compression,
|
|
1395
|
-
compressionOptions: r.compressionOptions
|
|
1396
|
-
};
|
|
1397
|
-
}
|
|
1398
|
-
var s = e("./stream/StreamHelper"), i = e("./stream/DataWorker"), a = e("./utf8"), o = e("./compressedObject"), h = e("./stream/GenericWorker");
|
|
1399
|
-
n.prototype = {
|
|
1400
|
-
internalStream: function(e) {
|
|
1401
|
-
var t = null, r = "string";
|
|
1402
|
-
try {
|
|
1403
|
-
if (!e) throw new Error("No output type specified.");
|
|
1404
|
-
var n = "string" === (r = e.toLowerCase()) || "text" === r;
|
|
1405
|
-
"binarystring" !== r && "text" !== r || (r = "string"), t = this._decompressWorker();
|
|
1406
|
-
var i = !this._dataBinary;
|
|
1407
|
-
i && !n && (t = t.pipe(new a.Utf8EncodeWorker())), !i && n && (t = t.pipe(new a.Utf8DecodeWorker()));
|
|
1408
|
-
} catch (e) {
|
|
1409
|
-
(t = new h("error")).error(e);
|
|
1410
|
-
}
|
|
1411
|
-
return new s(t, r, "");
|
|
1412
|
-
},
|
|
1413
|
-
async: function(e, t) {
|
|
1414
|
-
return this.internalStream(e).accumulate(t);
|
|
1415
|
-
},
|
|
1416
|
-
nodeStream: function(e, t) {
|
|
1417
|
-
return this.internalStream(e || "nodebuffer").toNodejsStream(t);
|
|
1418
|
-
},
|
|
1419
|
-
_compressWorker: function(e, t) {
|
|
1420
|
-
if (this._data instanceof o && this._data.compression.magic === e.magic) return this._data.getCompressedWorker();
|
|
1421
|
-
var r = this._decompressWorker();
|
|
1422
|
-
return this._dataBinary || (r = r.pipe(new a.Utf8EncodeWorker())), o.createWorkerFrom(r, e, t);
|
|
1423
|
-
},
|
|
1424
|
-
_decompressWorker: function() {
|
|
1425
|
-
return this._data instanceof o ? this._data.getContentWorker() : this._data instanceof h ? this._data : new i(this._data);
|
|
1426
|
-
}
|
|
1427
|
-
};
|
|
1428
|
-
for (var u = [
|
|
1429
|
-
"asText",
|
|
1430
|
-
"asBinary",
|
|
1431
|
-
"asNodeBuffer",
|
|
1432
|
-
"asUint8Array",
|
|
1433
|
-
"asArrayBuffer"
|
|
1434
|
-
], l = function() {
|
|
1435
|
-
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
1436
|
-
}, f = 0; f < u.length; f++) n.prototype[u[f]] = l;
|
|
1437
|
-
t.exports = n;
|
|
1438
|
-
}, {
|
|
1439
|
-
"./compressedObject": 2,
|
|
1440
|
-
"./stream/DataWorker": 27,
|
|
1441
|
-
"./stream/GenericWorker": 28,
|
|
1442
|
-
"./stream/StreamHelper": 29,
|
|
1443
|
-
"./utf8": 31
|
|
1444
|
-
}],
|
|
1445
|
-
36: [function(e, l, t) {
|
|
1446
|
-
(function(t) {
|
|
1447
|
-
"use strict";
|
|
1448
|
-
var r, n, e = t.MutationObserver || t.WebKitMutationObserver;
|
|
1449
|
-
if (e) {
|
|
1450
|
-
var i = 0, s = new e(u), a = t.document.createTextNode("");
|
|
1451
|
-
s.observe(a, { characterData: !0 }), r = function() {
|
|
1452
|
-
a.data = i = ++i % 2;
|
|
1453
|
-
};
|
|
1454
|
-
} else if (t.setImmediate || void 0 === t.MessageChannel) r = "document" in t && "onreadystatechange" in t.document.createElement("script") ? function() {
|
|
1455
|
-
var e = t.document.createElement("script");
|
|
1456
|
-
e.onreadystatechange = function() {
|
|
1457
|
-
u(), e.onreadystatechange = null, e.parentNode.removeChild(e), e = null;
|
|
1458
|
-
}, t.document.documentElement.appendChild(e);
|
|
1459
|
-
} : function() {
|
|
1460
|
-
setTimeout(u, 0);
|
|
1461
|
-
};
|
|
1462
|
-
else {
|
|
1463
|
-
var o = new t.MessageChannel();
|
|
1464
|
-
o.port1.onmessage = u, r = function() {
|
|
1465
|
-
o.port2.postMessage(0);
|
|
1466
|
-
};
|
|
1467
|
-
}
|
|
1468
|
-
var h = [];
|
|
1469
|
-
function u() {
|
|
1470
|
-
var e, t;
|
|
1471
|
-
n = !0;
|
|
1472
|
-
for (var r = h.length; r;) {
|
|
1473
|
-
for (t = h, h = [], e = -1; ++e < r;) t[e]();
|
|
1474
|
-
r = h.length;
|
|
1475
|
-
}
|
|
1476
|
-
n = !1;
|
|
1477
|
-
}
|
|
1478
|
-
l.exports = function(e) {
|
|
1479
|
-
1 !== h.push(e) || n || r();
|
|
1480
|
-
};
|
|
1481
|
-
}).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {});
|
|
1482
|
-
}, {}],
|
|
1483
|
-
37: [function(e, t, r) {
|
|
1484
|
-
"use strict";
|
|
1485
|
-
var i = e("immediate");
|
|
1486
|
-
function u() {}
|
|
1487
|
-
var l = {}, s = ["REJECTED"], a = ["FULFILLED"], n = ["PENDING"];
|
|
1488
|
-
function o(e) {
|
|
1489
|
-
if ("function" != typeof e) throw new TypeError("resolver must be a function");
|
|
1490
|
-
this.state = n, this.queue = [], this.outcome = void 0, e !== u && d(this, e);
|
|
1491
|
-
}
|
|
1492
|
-
function h(e, t, r) {
|
|
1493
|
-
this.promise = e, "function" == typeof t && (this.onFulfilled = t, this.callFulfilled = this.otherCallFulfilled), "function" == typeof r && (this.onRejected = r, this.callRejected = this.otherCallRejected);
|
|
1494
|
-
}
|
|
1495
|
-
function f(t, r, n) {
|
|
1496
|
-
i(function() {
|
|
1497
|
-
var e;
|
|
1498
|
-
try {
|
|
1499
|
-
e = r(n);
|
|
1500
|
-
} catch (e) {
|
|
1501
|
-
return l.reject(t, e);
|
|
1502
|
-
}
|
|
1503
|
-
e === t ? l.reject(t, /* @__PURE__ */ new TypeError("Cannot resolve promise with itself")) : l.resolve(t, e);
|
|
1504
|
-
});
|
|
1505
|
-
}
|
|
1506
|
-
function c(e) {
|
|
1507
|
-
var t = e && e.then;
|
|
1508
|
-
if (e && ("object" == typeof e || "function" == typeof e) && "function" == typeof t) return function() {
|
|
1509
|
-
t.apply(e, arguments);
|
|
1510
|
-
};
|
|
1511
|
-
}
|
|
1512
|
-
function d(t, e) {
|
|
1513
|
-
var r = !1;
|
|
1514
|
-
function n(e) {
|
|
1515
|
-
r || (r = !0, l.reject(t, e));
|
|
1516
|
-
}
|
|
1517
|
-
function i(e) {
|
|
1518
|
-
r || (r = !0, l.resolve(t, e));
|
|
1519
|
-
}
|
|
1520
|
-
var s = p(function() {
|
|
1521
|
-
e(i, n);
|
|
1522
|
-
});
|
|
1523
|
-
"error" === s.status && n(s.value);
|
|
1524
|
-
}
|
|
1525
|
-
function p(e, t) {
|
|
1526
|
-
var r = {};
|
|
1527
|
-
try {
|
|
1528
|
-
r.value = e(t), r.status = "success";
|
|
1529
|
-
} catch (e) {
|
|
1530
|
-
r.status = "error", r.value = e;
|
|
1531
|
-
}
|
|
1532
|
-
return r;
|
|
1533
|
-
}
|
|
1534
|
-
(t.exports = o).prototype.finally = function(t) {
|
|
1535
|
-
if ("function" != typeof t) return this;
|
|
1536
|
-
var r = this.constructor;
|
|
1537
|
-
return this.then(function(e) {
|
|
1538
|
-
return r.resolve(t()).then(function() {
|
|
1539
|
-
return e;
|
|
1540
|
-
});
|
|
1541
|
-
}, function(e) {
|
|
1542
|
-
return r.resolve(t()).then(function() {
|
|
1543
|
-
throw e;
|
|
1544
|
-
});
|
|
1545
|
-
});
|
|
1546
|
-
}, o.prototype.catch = function(e) {
|
|
1547
|
-
return this.then(null, e);
|
|
1548
|
-
}, o.prototype.then = function(e, t) {
|
|
1549
|
-
if ("function" != typeof e && this.state === a || "function" != typeof t && this.state === s) return this;
|
|
1550
|
-
var r = new this.constructor(u);
|
|
1551
|
-
this.state !== n ? f(r, this.state === a ? e : t, this.outcome) : this.queue.push(new h(r, e, t));
|
|
1552
|
-
return r;
|
|
1553
|
-
}, h.prototype.callFulfilled = function(e) {
|
|
1554
|
-
l.resolve(this.promise, e);
|
|
1555
|
-
}, h.prototype.otherCallFulfilled = function(e) {
|
|
1556
|
-
f(this.promise, this.onFulfilled, e);
|
|
1557
|
-
}, h.prototype.callRejected = function(e) {
|
|
1558
|
-
l.reject(this.promise, e);
|
|
1559
|
-
}, h.prototype.otherCallRejected = function(e) {
|
|
1560
|
-
f(this.promise, this.onRejected, e);
|
|
1561
|
-
}, l.resolve = function(e, t) {
|
|
1562
|
-
var r = p(c, t);
|
|
1563
|
-
if ("error" === r.status) return l.reject(e, r.value);
|
|
1564
|
-
var n = r.value;
|
|
1565
|
-
if (n) d(e, n);
|
|
1566
|
-
else {
|
|
1567
|
-
e.state = a, e.outcome = t;
|
|
1568
|
-
for (var i = -1, s = e.queue.length; ++i < s;) e.queue[i].callFulfilled(t);
|
|
1569
|
-
}
|
|
1570
|
-
return e;
|
|
1571
|
-
}, l.reject = function(e, t) {
|
|
1572
|
-
e.state = s, e.outcome = t;
|
|
1573
|
-
for (var r = -1, n = e.queue.length; ++r < n;) e.queue[r].callRejected(t);
|
|
1574
|
-
return e;
|
|
1575
|
-
}, o.resolve = function(e) {
|
|
1576
|
-
if (e instanceof this) return e;
|
|
1577
|
-
return l.resolve(new this(u), e);
|
|
1578
|
-
}, o.reject = function(e) {
|
|
1579
|
-
var t = new this(u);
|
|
1580
|
-
return l.reject(t, e);
|
|
1581
|
-
}, o.all = function(e) {
|
|
1582
|
-
var r = this;
|
|
1583
|
-
if ("[object Array]" !== Object.prototype.toString.call(e)) return this.reject(/* @__PURE__ */ new TypeError("must be an array"));
|
|
1584
|
-
var n = e.length, i = !1;
|
|
1585
|
-
if (!n) return this.resolve([]);
|
|
1586
|
-
var s = new Array(n), a = 0, t = -1, o = new this(u);
|
|
1587
|
-
for (; ++t < n;) h(e[t], t);
|
|
1588
|
-
return o;
|
|
1589
|
-
function h(e, t) {
|
|
1590
|
-
r.resolve(e).then(function(e) {
|
|
1591
|
-
s[t] = e, ++a !== n || i || (i = !0, l.resolve(o, s));
|
|
1592
|
-
}, function(e) {
|
|
1593
|
-
i || (i = !0, l.reject(o, e));
|
|
1594
|
-
});
|
|
1595
|
-
}
|
|
1596
|
-
}, o.race = function(e) {
|
|
1597
|
-
var t = this;
|
|
1598
|
-
if ("[object Array]" !== Object.prototype.toString.call(e)) return this.reject(/* @__PURE__ */ new TypeError("must be an array"));
|
|
1599
|
-
var r = e.length, n = !1;
|
|
1600
|
-
if (!r) return this.resolve([]);
|
|
1601
|
-
var i = -1, s = new this(u);
|
|
1602
|
-
for (; ++i < r;) a = e[i], t.resolve(a).then(function(e) {
|
|
1603
|
-
n || (n = !0, l.resolve(s, e));
|
|
1604
|
-
}, function(e) {
|
|
1605
|
-
n || (n = !0, l.reject(s, e));
|
|
1606
|
-
});
|
|
1607
|
-
var a;
|
|
1608
|
-
return s;
|
|
1609
|
-
};
|
|
1610
|
-
}, { immediate: 36 }],
|
|
1611
|
-
38: [function(e, t, r) {
|
|
1612
|
-
"use strict";
|
|
1613
|
-
var n = {};
|
|
1614
|
-
(0, e("./lib/utils/common").assign)(n, e("./lib/deflate"), e("./lib/inflate"), e("./lib/zlib/constants")), t.exports = n;
|
|
1615
|
-
}, {
|
|
1616
|
-
"./lib/deflate": 39,
|
|
1617
|
-
"./lib/inflate": 40,
|
|
1618
|
-
"./lib/utils/common": 41,
|
|
1619
|
-
"./lib/zlib/constants": 44
|
|
1620
|
-
}],
|
|
1621
|
-
39: [function(e, t, r) {
|
|
1622
|
-
"use strict";
|
|
1623
|
-
var a = e("./zlib/deflate"), o = e("./utils/common"), h = e("./utils/strings"), i = e("./zlib/messages"), s = e("./zlib/zstream"), u = Object.prototype.toString, l = 0, f = -1, c = 0, d = 8;
|
|
1624
|
-
function p(e) {
|
|
1625
|
-
if (!(this instanceof p)) return new p(e);
|
|
1626
|
-
this.options = o.assign({
|
|
1627
|
-
level: f,
|
|
1628
|
-
method: d,
|
|
1629
|
-
chunkSize: 16384,
|
|
1630
|
-
windowBits: 15,
|
|
1631
|
-
memLevel: 8,
|
|
1632
|
-
strategy: c,
|
|
1633
|
-
to: ""
|
|
1634
|
-
}, e || {});
|
|
1635
|
-
var t = this.options;
|
|
1636
|
-
t.raw && 0 < t.windowBits ? t.windowBits = -t.windowBits : t.gzip && 0 < t.windowBits && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new s(), this.strm.avail_out = 0;
|
|
1637
|
-
var r = a.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
|
|
1638
|
-
if (r !== l) throw new Error(i[r]);
|
|
1639
|
-
if (t.header && a.deflateSetHeader(this.strm, t.header), t.dictionary) {
|
|
1640
|
-
var n;
|
|
1641
|
-
if (n = "string" == typeof t.dictionary ? h.string2buf(t.dictionary) : "[object ArrayBuffer]" === u.call(t.dictionary) ? new Uint8Array(t.dictionary) : t.dictionary, (r = a.deflateSetDictionary(this.strm, n)) !== l) throw new Error(i[r]);
|
|
1642
|
-
this._dict_set = !0;
|
|
1643
|
-
}
|
|
1644
|
-
}
|
|
1645
|
-
function n(e, t) {
|
|
1646
|
-
var r = new p(t);
|
|
1647
|
-
if (r.push(e, !0), r.err) throw r.msg || i[r.err];
|
|
1648
|
-
return r.result;
|
|
1649
|
-
}
|
|
1650
|
-
p.prototype.push = function(e, t) {
|
|
1651
|
-
var r, n, i = this.strm, s = this.options.chunkSize;
|
|
1652
|
-
if (this.ended) return !1;
|
|
1653
|
-
n = t === ~~t ? t : !0 === t ? 4 : 0, "string" == typeof e ? i.input = h.string2buf(e) : "[object ArrayBuffer]" === u.call(e) ? i.input = new Uint8Array(e) : i.input = e, i.next_in = 0, i.avail_in = i.input.length;
|
|
1654
|
-
do {
|
|
1655
|
-
if (0 === i.avail_out && (i.output = new o.Buf8(s), i.next_out = 0, i.avail_out = s), 1 !== (r = a.deflate(i, n)) && r !== l) return this.onEnd(r), !(this.ended = !0);
|
|
1656
|
-
0 !== i.avail_out && (0 !== i.avail_in || 4 !== n && 2 !== n) || ("string" === this.options.to ? this.onData(h.buf2binstring(o.shrinkBuf(i.output, i.next_out))) : this.onData(o.shrinkBuf(i.output, i.next_out)));
|
|
1657
|
-
} while ((0 < i.avail_in || 0 === i.avail_out) && 1 !== r);
|
|
1658
|
-
return 4 === n ? (r = a.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === l) : 2 !== n || (this.onEnd(l), !(i.avail_out = 0));
|
|
1659
|
-
}, p.prototype.onData = function(e) {
|
|
1660
|
-
this.chunks.push(e);
|
|
1661
|
-
}, p.prototype.onEnd = function(e) {
|
|
1662
|
-
e === l && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
|
|
1663
|
-
}, r.Deflate = p, r.deflate = n, r.deflateRaw = function(e, t) {
|
|
1664
|
-
return (t = t || {}).raw = !0, n(e, t);
|
|
1665
|
-
}, r.gzip = function(e, t) {
|
|
1666
|
-
return (t = t || {}).gzip = !0, n(e, t);
|
|
1667
|
-
};
|
|
1668
|
-
}, {
|
|
1669
|
-
"./utils/common": 41,
|
|
1670
|
-
"./utils/strings": 42,
|
|
1671
|
-
"./zlib/deflate": 46,
|
|
1672
|
-
"./zlib/messages": 51,
|
|
1673
|
-
"./zlib/zstream": 53
|
|
1674
|
-
}],
|
|
1675
|
-
40: [function(e, t, r) {
|
|
1676
|
-
"use strict";
|
|
1677
|
-
var c = e("./zlib/inflate"), d = e("./utils/common"), p = e("./utils/strings"), m = e("./zlib/constants"), n = e("./zlib/messages"), i = e("./zlib/zstream"), s = e("./zlib/gzheader"), _ = Object.prototype.toString;
|
|
1678
|
-
function a(e) {
|
|
1679
|
-
if (!(this instanceof a)) return new a(e);
|
|
1680
|
-
this.options = d.assign({
|
|
1681
|
-
chunkSize: 16384,
|
|
1682
|
-
windowBits: 0,
|
|
1683
|
-
to: ""
|
|
1684
|
-
}, e || {});
|
|
1685
|
-
var t = this.options;
|
|
1686
|
-
t.raw && 0 <= t.windowBits && t.windowBits < 16 && (t.windowBits = -t.windowBits, 0 === t.windowBits && (t.windowBits = -15)), !(0 <= t.windowBits && t.windowBits < 16) || e && e.windowBits || (t.windowBits += 32), 15 < t.windowBits && t.windowBits < 48 && 0 == (15 & t.windowBits) && (t.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new i(), this.strm.avail_out = 0;
|
|
1687
|
-
var r = c.inflateInit2(this.strm, t.windowBits);
|
|
1688
|
-
if (r !== m.Z_OK) throw new Error(n[r]);
|
|
1689
|
-
this.header = new s(), c.inflateGetHeader(this.strm, this.header);
|
|
1690
|
-
}
|
|
1691
|
-
function o(e, t) {
|
|
1692
|
-
var r = new a(t);
|
|
1693
|
-
if (r.push(e, !0), r.err) throw r.msg || n[r.err];
|
|
1694
|
-
return r.result;
|
|
1695
|
-
}
|
|
1696
|
-
a.prototype.push = function(e, t) {
|
|
1697
|
-
var r, n, i, s, a, o, h = this.strm, u = this.options.chunkSize, l = this.options.dictionary, f = !1;
|
|
1698
|
-
if (this.ended) return !1;
|
|
1699
|
-
n = t === ~~t ? t : !0 === t ? m.Z_FINISH : m.Z_NO_FLUSH, "string" == typeof e ? h.input = p.binstring2buf(e) : "[object ArrayBuffer]" === _.call(e) ? h.input = new Uint8Array(e) : h.input = e, h.next_in = 0, h.avail_in = h.input.length;
|
|
1700
|
-
do {
|
|
1701
|
-
if (0 === h.avail_out && (h.output = new d.Buf8(u), h.next_out = 0, h.avail_out = u), (r = c.inflate(h, m.Z_NO_FLUSH)) === m.Z_NEED_DICT && l && (o = "string" == typeof l ? p.string2buf(l) : "[object ArrayBuffer]" === _.call(l) ? new Uint8Array(l) : l, r = c.inflateSetDictionary(this.strm, o)), r === m.Z_BUF_ERROR && !0 === f && (r = m.Z_OK, f = !1), r !== m.Z_STREAM_END && r !== m.Z_OK) return this.onEnd(r), !(this.ended = !0);
|
|
1702
|
-
h.next_out && (0 !== h.avail_out && r !== m.Z_STREAM_END && (0 !== h.avail_in || n !== m.Z_FINISH && n !== m.Z_SYNC_FLUSH) || ("string" === this.options.to ? (i = p.utf8border(h.output, h.next_out), s = h.next_out - i, a = p.buf2string(h.output, i), h.next_out = s, h.avail_out = u - s, s && d.arraySet(h.output, h.output, i, s, 0), this.onData(a)) : this.onData(d.shrinkBuf(h.output, h.next_out)))), 0 === h.avail_in && 0 === h.avail_out && (f = !0);
|
|
1703
|
-
} while ((0 < h.avail_in || 0 === h.avail_out) && r !== m.Z_STREAM_END);
|
|
1704
|
-
return r === m.Z_STREAM_END && (n = m.Z_FINISH), n === m.Z_FINISH ? (r = c.inflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === m.Z_OK) : n !== m.Z_SYNC_FLUSH || (this.onEnd(m.Z_OK), !(h.avail_out = 0));
|
|
1705
|
-
}, a.prototype.onData = function(e) {
|
|
1706
|
-
this.chunks.push(e);
|
|
1707
|
-
}, a.prototype.onEnd = function(e) {
|
|
1708
|
-
e === m.Z_OK && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = d.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
|
|
1709
|
-
}, r.Inflate = a, r.inflate = o, r.inflateRaw = function(e, t) {
|
|
1710
|
-
return (t = t || {}).raw = !0, o(e, t);
|
|
1711
|
-
}, r.ungzip = o;
|
|
1712
|
-
}, {
|
|
1713
|
-
"./utils/common": 41,
|
|
1714
|
-
"./utils/strings": 42,
|
|
1715
|
-
"./zlib/constants": 44,
|
|
1716
|
-
"./zlib/gzheader": 47,
|
|
1717
|
-
"./zlib/inflate": 49,
|
|
1718
|
-
"./zlib/messages": 51,
|
|
1719
|
-
"./zlib/zstream": 53
|
|
1720
|
-
}],
|
|
1721
|
-
41: [function(e, t, r) {
|
|
1722
|
-
"use strict";
|
|
1723
|
-
var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array;
|
|
1724
|
-
r.assign = function(e) {
|
|
1725
|
-
for (var t = Array.prototype.slice.call(arguments, 1); t.length;) {
|
|
1726
|
-
var r = t.shift();
|
|
1727
|
-
if (r) {
|
|
1728
|
-
if ("object" != typeof r) throw new TypeError(r + "must be non-object");
|
|
1729
|
-
for (var n in r) r.hasOwnProperty(n) && (e[n] = r[n]);
|
|
1730
|
-
}
|
|
1731
|
-
}
|
|
1732
|
-
return e;
|
|
1733
|
-
}, r.shrinkBuf = function(e, t) {
|
|
1734
|
-
return e.length === t ? e : e.subarray ? e.subarray(0, t) : (e.length = t, e);
|
|
1735
|
-
};
|
|
1736
|
-
var i = {
|
|
1737
|
-
arraySet: function(e, t, r, n, i) {
|
|
1738
|
-
if (t.subarray && e.subarray) e.set(t.subarray(r, r + n), i);
|
|
1739
|
-
else for (var s = 0; s < n; s++) e[i + s] = t[r + s];
|
|
1740
|
-
},
|
|
1741
|
-
flattenChunks: function(e) {
|
|
1742
|
-
var t, r, n, i, s, a;
|
|
1743
|
-
for (t = n = 0, r = e.length; t < r; t++) n += e[t].length;
|
|
1744
|
-
for (a = new Uint8Array(n), t = i = 0, r = e.length; t < r; t++) s = e[t], a.set(s, i), i += s.length;
|
|
1745
|
-
return a;
|
|
1746
|
-
}
|
|
1747
|
-
}, s = {
|
|
1748
|
-
arraySet: function(e, t, r, n, i) {
|
|
1749
|
-
for (var s = 0; s < n; s++) e[i + s] = t[r + s];
|
|
1750
|
-
},
|
|
1751
|
-
flattenChunks: function(e) {
|
|
1752
|
-
return [].concat.apply([], e);
|
|
1753
|
-
}
|
|
1754
|
-
};
|
|
1755
|
-
r.setTyped = function(e) {
|
|
1756
|
-
e ? (r.Buf8 = Uint8Array, r.Buf16 = Uint16Array, r.Buf32 = Int32Array, r.assign(r, i)) : (r.Buf8 = Array, r.Buf16 = Array, r.Buf32 = Array, r.assign(r, s));
|
|
1757
|
-
}, r.setTyped(n);
|
|
1758
|
-
}, {}],
|
|
1759
|
-
42: [function(e, t, r) {
|
|
1760
|
-
"use strict";
|
|
1761
|
-
var h = e("./common"), i = !0, s = !0;
|
|
1762
|
-
try {
|
|
1763
|
-
String.fromCharCode.apply(null, [0]);
|
|
1764
|
-
} catch (e) {
|
|
1765
|
-
i = !1;
|
|
1766
|
-
}
|
|
1767
|
-
try {
|
|
1768
|
-
String.fromCharCode.apply(null, new Uint8Array(1));
|
|
1769
|
-
} catch (e) {
|
|
1770
|
-
s = !1;
|
|
1771
|
-
}
|
|
1772
|
-
for (var u = new h.Buf8(256), n = 0; n < 256; n++) u[n] = 252 <= n ? 6 : 248 <= n ? 5 : 240 <= n ? 4 : 224 <= n ? 3 : 192 <= n ? 2 : 1;
|
|
1773
|
-
function l(e, t) {
|
|
1774
|
-
if (t < 65537 && (e.subarray && s || !e.subarray && i)) return String.fromCharCode.apply(null, h.shrinkBuf(e, t));
|
|
1775
|
-
for (var r = "", n = 0; n < t; n++) r += String.fromCharCode(e[n]);
|
|
1776
|
-
return r;
|
|
1777
|
-
}
|
|
1778
|
-
u[254] = u[254] = 1, r.string2buf = function(e) {
|
|
1779
|
-
var t, r, n, i, s, a = e.length, o = 0;
|
|
1780
|
-
for (i = 0; i < a; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4;
|
|
1781
|
-
for (t = new h.Buf8(o), i = s = 0; s < o; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), r < 128 ? t[s++] = r : (r < 2048 ? t[s++] = 192 | r >>> 6 : (r < 65536 ? t[s++] = 224 | r >>> 12 : (t[s++] = 240 | r >>> 18, t[s++] = 128 | r >>> 12 & 63), t[s++] = 128 | r >>> 6 & 63), t[s++] = 128 | 63 & r);
|
|
1782
|
-
return t;
|
|
1783
|
-
}, r.buf2binstring = function(e) {
|
|
1784
|
-
return l(e, e.length);
|
|
1785
|
-
}, r.binstring2buf = function(e) {
|
|
1786
|
-
for (var t = new h.Buf8(e.length), r = 0, n = t.length; r < n; r++) t[r] = e.charCodeAt(r);
|
|
1787
|
-
return t;
|
|
1788
|
-
}, r.buf2string = function(e, t) {
|
|
1789
|
-
var r, n, i, s, a = t || e.length, o = new Array(2 * a);
|
|
1790
|
-
for (r = n = 0; r < a;) if ((i = e[r++]) < 128) o[n++] = i;
|
|
1791
|
-
else if (4 < (s = u[i])) o[n++] = 65533, r += s - 1;
|
|
1792
|
-
else {
|
|
1793
|
-
for (i &= 2 === s ? 31 : 3 === s ? 15 : 7; 1 < s && r < a;) i = i << 6 | 63 & e[r++], s--;
|
|
1794
|
-
1 < s ? o[n++] = 65533 : i < 65536 ? o[n++] = i : (i -= 65536, o[n++] = 55296 | i >> 10 & 1023, o[n++] = 56320 | 1023 & i);
|
|
1795
|
-
}
|
|
1796
|
-
return l(o, n);
|
|
1797
|
-
}, r.utf8border = function(e, t) {
|
|
1798
|
-
var r;
|
|
1799
|
-
for ((t = t || e.length) > e.length && (t = e.length), r = t - 1; 0 <= r && 128 == (192 & e[r]);) r--;
|
|
1800
|
-
return r < 0 ? t : 0 === r ? t : r + u[e[r]] > t ? r : t;
|
|
1801
|
-
};
|
|
1802
|
-
}, { "./common": 41 }],
|
|
1803
|
-
43: [function(e, t, r) {
|
|
1804
|
-
"use strict";
|
|
1805
|
-
t.exports = function(e, t, r, n) {
|
|
1806
|
-
for (var i = 65535 & e | 0, s = e >>> 16 & 65535 | 0, a = 0; 0 !== r;) {
|
|
1807
|
-
for (r -= a = 2e3 < r ? 2e3 : r; s = s + (i = i + t[n++] | 0) | 0, --a;);
|
|
1808
|
-
i %= 65521, s %= 65521;
|
|
1809
|
-
}
|
|
1810
|
-
return i | s << 16 | 0;
|
|
1811
|
-
};
|
|
1812
|
-
}, {}],
|
|
1813
|
-
44: [function(e, t, r) {
|
|
1814
|
-
"use strict";
|
|
1815
|
-
t.exports = {
|
|
1816
|
-
Z_NO_FLUSH: 0,
|
|
1817
|
-
Z_PARTIAL_FLUSH: 1,
|
|
1818
|
-
Z_SYNC_FLUSH: 2,
|
|
1819
|
-
Z_FULL_FLUSH: 3,
|
|
1820
|
-
Z_FINISH: 4,
|
|
1821
|
-
Z_BLOCK: 5,
|
|
1822
|
-
Z_TREES: 6,
|
|
1823
|
-
Z_OK: 0,
|
|
1824
|
-
Z_STREAM_END: 1,
|
|
1825
|
-
Z_NEED_DICT: 2,
|
|
1826
|
-
Z_ERRNO: -1,
|
|
1827
|
-
Z_STREAM_ERROR: -2,
|
|
1828
|
-
Z_DATA_ERROR: -3,
|
|
1829
|
-
Z_BUF_ERROR: -5,
|
|
1830
|
-
Z_NO_COMPRESSION: 0,
|
|
1831
|
-
Z_BEST_SPEED: 1,
|
|
1832
|
-
Z_BEST_COMPRESSION: 9,
|
|
1833
|
-
Z_DEFAULT_COMPRESSION: -1,
|
|
1834
|
-
Z_FILTERED: 1,
|
|
1835
|
-
Z_HUFFMAN_ONLY: 2,
|
|
1836
|
-
Z_RLE: 3,
|
|
1837
|
-
Z_FIXED: 4,
|
|
1838
|
-
Z_DEFAULT_STRATEGY: 0,
|
|
1839
|
-
Z_BINARY: 0,
|
|
1840
|
-
Z_TEXT: 1,
|
|
1841
|
-
Z_UNKNOWN: 2,
|
|
1842
|
-
Z_DEFLATED: 8
|
|
1843
|
-
};
|
|
1844
|
-
}, {}],
|
|
1845
|
-
45: [function(e, t, r) {
|
|
1846
|
-
"use strict";
|
|
1847
|
-
var o = function() {
|
|
1848
|
-
for (var e, t = [], r = 0; r < 256; r++) {
|
|
1849
|
-
e = r;
|
|
1850
|
-
for (var n = 0; n < 8; n++) e = 1 & e ? 3988292384 ^ e >>> 1 : e >>> 1;
|
|
1851
|
-
t[r] = e;
|
|
1852
|
-
}
|
|
1853
|
-
return t;
|
|
1854
|
-
}();
|
|
1855
|
-
t.exports = function(e, t, r, n) {
|
|
1856
|
-
var i = o, s = n + r;
|
|
1857
|
-
e ^= -1;
|
|
1858
|
-
for (var a = n; a < s; a++) e = e >>> 8 ^ i[255 & (e ^ t[a])];
|
|
1859
|
-
return -1 ^ e;
|
|
1860
|
-
};
|
|
1861
|
-
}, {}],
|
|
1862
|
-
46: [function(e, t, r) {
|
|
1863
|
-
"use strict";
|
|
1864
|
-
var h, c = e("../utils/common"), u = e("./trees"), d = e("./adler32"), p = e("./crc32"), n = e("./messages"), l = 0, f = 4, m = 0, _ = -2, g = -1, b = 4, i = 2, v = 8, y = 9, s = 286, a = 30, o = 19, w = 2 * s + 1, k = 15, x = 3, S = 258, z = S + x + 1, C = 42, E = 113, A = 1, I = 2, O = 3, B = 4;
|
|
1865
|
-
function R(e, t) {
|
|
1866
|
-
return e.msg = n[t], t;
|
|
1867
|
-
}
|
|
1868
|
-
function T(e) {
|
|
1869
|
-
return (e << 1) - (4 < e ? 9 : 0);
|
|
1870
|
-
}
|
|
1871
|
-
function D(e) {
|
|
1872
|
-
for (var t = e.length; 0 <= --t;) e[t] = 0;
|
|
1873
|
-
}
|
|
1874
|
-
function F(e) {
|
|
1875
|
-
var t = e.state, r = t.pending;
|
|
1876
|
-
r > e.avail_out && (r = e.avail_out), 0 !== r && (c.arraySet(e.output, t.pending_buf, t.pending_out, r, e.next_out), e.next_out += r, t.pending_out += r, e.total_out += r, e.avail_out -= r, t.pending -= r, 0 === t.pending && (t.pending_out = 0));
|
|
1877
|
-
}
|
|
1878
|
-
function N(e, t) {
|
|
1879
|
-
u._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, F(e.strm);
|
|
1880
|
-
}
|
|
1881
|
-
function U(e, t) {
|
|
1882
|
-
e.pending_buf[e.pending++] = t;
|
|
1883
|
-
}
|
|
1884
|
-
function P(e, t) {
|
|
1885
|
-
e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = 255 & t;
|
|
1886
|
-
}
|
|
1887
|
-
function L(e, t) {
|
|
1888
|
-
var r, n, i = e.max_chain_length, s = e.strstart, a = e.prev_length, o = e.nice_match, h = e.strstart > e.w_size - z ? e.strstart - (e.w_size - z) : 0, u = e.window, l = e.w_mask, f = e.prev, c = e.strstart + S, d = u[s + a - 1], p = u[s + a];
|
|
1889
|
-
e.prev_length >= e.good_match && (i >>= 2), o > e.lookahead && (o = e.lookahead);
|
|
1890
|
-
do
|
|
1891
|
-
if (u[(r = t) + a] === p && u[r + a - 1] === d && u[r] === u[s] && u[++r] === u[s + 1]) {
|
|
1892
|
-
s += 2, r++;
|
|
1893
|
-
do ;
|
|
1894
|
-
while (u[++s] === u[++r] && u[++s] === u[++r] && u[++s] === u[++r] && u[++s] === u[++r] && u[++s] === u[++r] && u[++s] === u[++r] && u[++s] === u[++r] && u[++s] === u[++r] && s < c);
|
|
1895
|
-
if (n = S - (c - s), s = c - S, a < n) {
|
|
1896
|
-
if (e.match_start = t, o <= (a = n)) break;
|
|
1897
|
-
d = u[s + a - 1], p = u[s + a];
|
|
1898
|
-
}
|
|
1899
|
-
}
|
|
1900
|
-
while ((t = f[t & l]) > h && 0 != --i);
|
|
1901
|
-
return a <= e.lookahead ? a : e.lookahead;
|
|
1902
|
-
}
|
|
1903
|
-
function j(e) {
|
|
1904
|
-
var t, r, n, i, s, a, o, h, u, l, f = e.w_size;
|
|
1905
|
-
do {
|
|
1906
|
-
if (i = e.window_size - e.lookahead - e.strstart, e.strstart >= f + (f - z)) {
|
|
1907
|
-
for (c.arraySet(e.window, e.window, f, f, 0), e.match_start -= f, e.strstart -= f, e.block_start -= f, t = r = e.hash_size; n = e.head[--t], e.head[t] = f <= n ? n - f : 0, --r;);
|
|
1908
|
-
for (t = r = f; n = e.prev[--t], e.prev[t] = f <= n ? n - f : 0, --r;);
|
|
1909
|
-
i += f;
|
|
1910
|
-
}
|
|
1911
|
-
if (0 === e.strm.avail_in) break;
|
|
1912
|
-
if (a = e.strm, o = e.window, h = e.strstart + e.lookahead, u = i, l = void 0, l = a.avail_in, u < l && (l = u), r = 0 === l ? 0 : (a.avail_in -= l, c.arraySet(o, a.input, a.next_in, l, h), 1 === a.state.wrap ? a.adler = d(a.adler, o, l, h) : 2 === a.state.wrap && (a.adler = p(a.adler, o, l, h)), a.next_in += l, a.total_in += l, l), e.lookahead += r, e.lookahead + e.insert >= x) for (s = e.strstart - e.insert, e.ins_h = e.window[s], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[s + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[s + x - 1]) & e.hash_mask, e.prev[s & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = s, s++, e.insert--, !(e.lookahead + e.insert < x)););
|
|
1913
|
-
} while (e.lookahead < z && 0 !== e.strm.avail_in);
|
|
1914
|
-
}
|
|
1915
|
-
function Z(e, t) {
|
|
1916
|
-
for (var r, n;;) {
|
|
1917
|
-
if (e.lookahead < z) {
|
|
1918
|
-
if (j(e), e.lookahead < z && t === l) return A;
|
|
1919
|
-
if (0 === e.lookahead) break;
|
|
1920
|
-
}
|
|
1921
|
-
if (r = 0, e.lookahead >= x && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + x - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), 0 !== r && e.strstart - r <= e.w_size - z && (e.match_length = L(e, r)), e.match_length >= x) if (n = u._tr_tally(e, e.strstart - e.match_start, e.match_length - x), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= x) {
|
|
1922
|
-
for (e.match_length--; e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + x - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart, 0 != --e.match_length;);
|
|
1923
|
-
e.strstart++;
|
|
1924
|
-
} else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask;
|
|
1925
|
-
else n = u._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
|
|
1926
|
-
if (n && (N(e, !1), 0 === e.strm.avail_out)) return A;
|
|
1927
|
-
}
|
|
1928
|
-
return e.insert = e.strstart < x - 1 ? e.strstart : x - 1, t === f ? (N(e, !0), 0 === e.strm.avail_out ? O : B) : e.last_lit && (N(e, !1), 0 === e.strm.avail_out) ? A : I;
|
|
1929
|
-
}
|
|
1930
|
-
function W(e, t) {
|
|
1931
|
-
for (var r, n, i;;) {
|
|
1932
|
-
if (e.lookahead < z) {
|
|
1933
|
-
if (j(e), e.lookahead < z && t === l) return A;
|
|
1934
|
-
if (0 === e.lookahead) break;
|
|
1935
|
-
}
|
|
1936
|
-
if (r = 0, e.lookahead >= x && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + x - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = x - 1, 0 !== r && e.prev_length < e.max_lazy_match && e.strstart - r <= e.w_size - z && (e.match_length = L(e, r), e.match_length <= 5 && (1 === e.strategy || e.match_length === x && 4096 < e.strstart - e.match_start) && (e.match_length = x - 1)), e.prev_length >= x && e.match_length <= e.prev_length) {
|
|
1937
|
-
for (i = e.strstart + e.lookahead - x, n = u._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - x), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; ++e.strstart <= i && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + x - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), 0 != --e.prev_length;);
|
|
1938
|
-
if (e.match_available = 0, e.match_length = x - 1, e.strstart++, n && (N(e, !1), 0 === e.strm.avail_out)) return A;
|
|
1939
|
-
} else if (e.match_available) {
|
|
1940
|
-
if ((n = u._tr_tally(e, 0, e.window[e.strstart - 1])) && N(e, !1), e.strstart++, e.lookahead--, 0 === e.strm.avail_out) return A;
|
|
1941
|
-
} else e.match_available = 1, e.strstart++, e.lookahead--;
|
|
1942
|
-
}
|
|
1943
|
-
return e.match_available && (n = u._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < x - 1 ? e.strstart : x - 1, t === f ? (N(e, !0), 0 === e.strm.avail_out ? O : B) : e.last_lit && (N(e, !1), 0 === e.strm.avail_out) ? A : I;
|
|
1944
|
-
}
|
|
1945
|
-
function M(e, t, r, n, i) {
|
|
1946
|
-
this.good_length = e, this.max_lazy = t, this.nice_length = r, this.max_chain = n, this.func = i;
|
|
1947
|
-
}
|
|
1948
|
-
function H() {
|
|
1949
|
-
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 = v, 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 c.Buf16(2 * w), this.dyn_dtree = new c.Buf16(2 * (2 * a + 1)), this.bl_tree = new c.Buf16(2 * (2 * o + 1)), D(this.dyn_ltree), D(this.dyn_dtree), D(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new c.Buf16(k + 1), this.heap = new c.Buf16(2 * s + 1), D(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new c.Buf16(2 * s + 1), D(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;
|
|
1950
|
-
}
|
|
1951
|
-
function G(e) {
|
|
1952
|
-
var t;
|
|
1953
|
-
return e && e.state ? (e.total_in = e.total_out = 0, e.data_type = i, (t = e.state).pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? C : E, e.adler = 2 === t.wrap ? 0 : 1, t.last_flush = l, u._tr_init(t), m) : R(e, _);
|
|
1954
|
-
}
|
|
1955
|
-
function K(e) {
|
|
1956
|
-
var t = G(e);
|
|
1957
|
-
return t === m && function(e) {
|
|
1958
|
-
e.window_size = 2 * e.w_size, D(e.head), e.max_lazy_match = h[e.level].max_lazy, e.good_match = h[e.level].good_length, e.nice_match = h[e.level].nice_length, e.max_chain_length = h[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = x - 1, e.match_available = 0, e.ins_h = 0;
|
|
1959
|
-
}(e.state), t;
|
|
1960
|
-
}
|
|
1961
|
-
function Y(e, t, r, n, i, s) {
|
|
1962
|
-
if (!e) return _;
|
|
1963
|
-
var a = 1;
|
|
1964
|
-
if (t === g && (t = 6), n < 0 ? (a = 0, n = -n) : 15 < n && (a = 2, n -= 16), i < 1 || y < i || r !== v || n < 8 || 15 < n || t < 0 || 9 < t || s < 0 || b < s) return R(e, _);
|
|
1965
|
-
8 === n && (n = 9);
|
|
1966
|
-
var o = new H();
|
|
1967
|
-
return (e.state = o).strm = e, o.wrap = a, o.gzhead = null, o.w_bits = n, o.w_size = 1 << o.w_bits, o.w_mask = o.w_size - 1, o.hash_bits = i + 7, o.hash_size = 1 << o.hash_bits, o.hash_mask = o.hash_size - 1, o.hash_shift = ~~((o.hash_bits + x - 1) / x), o.window = new c.Buf8(2 * o.w_size), o.head = new c.Buf16(o.hash_size), o.prev = new c.Buf16(o.w_size), o.lit_bufsize = 1 << i + 6, o.pending_buf_size = 4 * o.lit_bufsize, o.pending_buf = new c.Buf8(o.pending_buf_size), o.d_buf = 1 * o.lit_bufsize, o.l_buf = 3 * o.lit_bufsize, o.level = t, o.strategy = s, o.method = r, K(e);
|
|
1968
|
-
}
|
|
1969
|
-
h = [
|
|
1970
|
-
new M(0, 0, 0, 0, function(e, t) {
|
|
1971
|
-
var r = 65535;
|
|
1972
|
-
for (r > e.pending_buf_size - 5 && (r = e.pending_buf_size - 5);;) {
|
|
1973
|
-
if (e.lookahead <= 1) {
|
|
1974
|
-
if (j(e), 0 === e.lookahead && t === l) return A;
|
|
1975
|
-
if (0 === e.lookahead) break;
|
|
1976
|
-
}
|
|
1977
|
-
e.strstart += e.lookahead, e.lookahead = 0;
|
|
1978
|
-
var n = e.block_start + r;
|
|
1979
|
-
if ((0 === e.strstart || e.strstart >= n) && (e.lookahead = e.strstart - n, e.strstart = n, N(e, !1), 0 === e.strm.avail_out)) return A;
|
|
1980
|
-
if (e.strstart - e.block_start >= e.w_size - z && (N(e, !1), 0 === e.strm.avail_out)) return A;
|
|
1981
|
-
}
|
|
1982
|
-
return e.insert = 0, t === f ? (N(e, !0), 0 === e.strm.avail_out ? O : B) : (e.strstart > e.block_start && (N(e, !1), e.strm.avail_out), A);
|
|
1983
|
-
}),
|
|
1984
|
-
new M(4, 4, 8, 4, Z),
|
|
1985
|
-
new M(4, 5, 16, 8, Z),
|
|
1986
|
-
new M(4, 6, 32, 32, Z),
|
|
1987
|
-
new M(4, 4, 16, 16, W),
|
|
1988
|
-
new M(8, 16, 32, 32, W),
|
|
1989
|
-
new M(8, 16, 128, 128, W),
|
|
1990
|
-
new M(8, 32, 128, 256, W),
|
|
1991
|
-
new M(32, 128, 258, 1024, W),
|
|
1992
|
-
new M(32, 258, 258, 4096, W)
|
|
1993
|
-
], r.deflateInit = function(e, t) {
|
|
1994
|
-
return Y(e, t, v, 15, 8, 0);
|
|
1995
|
-
}, r.deflateInit2 = Y, r.deflateReset = K, r.deflateResetKeep = G, r.deflateSetHeader = function(e, t) {
|
|
1996
|
-
return e && e.state ? 2 !== e.state.wrap ? _ : (e.state.gzhead = t, m) : _;
|
|
1997
|
-
}, r.deflate = function(e, t) {
|
|
1998
|
-
var r, n, i, s;
|
|
1999
|
-
if (!e || !e.state || 5 < t || t < 0) return e ? R(e, _) : _;
|
|
2000
|
-
if (n = e.state, !e.output || !e.input && 0 !== e.avail_in || 666 === n.status && t !== f) return R(e, 0 === e.avail_out ? -5 : _);
|
|
2001
|
-
if (n.strm = e, r = n.last_flush, n.last_flush = t, n.status === C) if (2 === n.wrap) e.adler = 0, U(n, 31), U(n, 139), U(n, 8), n.gzhead ? (U(n, (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), U(n, 255 & n.gzhead.time), U(n, n.gzhead.time >> 8 & 255), U(n, n.gzhead.time >> 16 & 255), U(n, n.gzhead.time >> 24 & 255), U(n, 9 === n.level ? 2 : 2 <= n.strategy || n.level < 2 ? 4 : 0), U(n, 255 & n.gzhead.os), n.gzhead.extra && n.gzhead.extra.length && (U(n, 255 & n.gzhead.extra.length), U(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = p(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = 69) : (U(n, 0), U(n, 0), U(n, 0), U(n, 0), U(n, 0), U(n, 9 === n.level ? 2 : 2 <= n.strategy || n.level < 2 ? 4 : 0), U(n, 3), n.status = E);
|
|
2002
|
-
else {
|
|
2003
|
-
var a = v + (n.w_bits - 8 << 4) << 8;
|
|
2004
|
-
a |= (2 <= n.strategy || n.level < 2 ? 0 : n.level < 6 ? 1 : 6 === n.level ? 2 : 3) << 6, 0 !== n.strstart && (a |= 32), a += 31 - a % 31, n.status = E, P(n, a), 0 !== n.strstart && (P(n, e.adler >>> 16), P(n, 65535 & e.adler)), e.adler = 1;
|
|
2005
|
-
}
|
|
2006
|
-
if (69 === n.status) if (n.gzhead.extra) {
|
|
2007
|
-
for (i = n.pending; n.gzindex < (65535 & n.gzhead.extra.length) && (n.pending !== n.pending_buf_size || (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), F(e), i = n.pending, n.pending !== n.pending_buf_size));) U(n, 255 & n.gzhead.extra[n.gzindex]), n.gzindex++;
|
|
2008
|
-
n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), n.gzindex === n.gzhead.extra.length && (n.gzindex = 0, n.status = 73);
|
|
2009
|
-
} else n.status = 73;
|
|
2010
|
-
if (73 === n.status) if (n.gzhead.name) {
|
|
2011
|
-
i = n.pending;
|
|
2012
|
-
do {
|
|
2013
|
-
if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), F(e), i = n.pending, n.pending === n.pending_buf_size)) {
|
|
2014
|
-
s = 1;
|
|
2015
|
-
break;
|
|
2016
|
-
}
|
|
2017
|
-
s = n.gzindex < n.gzhead.name.length ? 255 & n.gzhead.name.charCodeAt(n.gzindex++) : 0, U(n, s);
|
|
2018
|
-
} while (0 !== s);
|
|
2019
|
-
n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), 0 === s && (n.gzindex = 0, n.status = 91);
|
|
2020
|
-
} else n.status = 91;
|
|
2021
|
-
if (91 === n.status) if (n.gzhead.comment) {
|
|
2022
|
-
i = n.pending;
|
|
2023
|
-
do {
|
|
2024
|
-
if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), F(e), i = n.pending, n.pending === n.pending_buf_size)) {
|
|
2025
|
-
s = 1;
|
|
2026
|
-
break;
|
|
2027
|
-
}
|
|
2028
|
-
s = n.gzindex < n.gzhead.comment.length ? 255 & n.gzhead.comment.charCodeAt(n.gzindex++) : 0, U(n, s);
|
|
2029
|
-
} while (0 !== s);
|
|
2030
|
-
n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), 0 === s && (n.status = 103);
|
|
2031
|
-
} else n.status = 103;
|
|
2032
|
-
if (103 === n.status && (n.gzhead.hcrc ? (n.pending + 2 > n.pending_buf_size && F(e), n.pending + 2 <= n.pending_buf_size && (U(n, 255 & e.adler), U(n, e.adler >> 8 & 255), e.adler = 0, n.status = E)) : n.status = E), 0 !== n.pending) {
|
|
2033
|
-
if (F(e), 0 === e.avail_out) return n.last_flush = -1, m;
|
|
2034
|
-
} else if (0 === e.avail_in && T(t) <= T(r) && t !== f) return R(e, -5);
|
|
2035
|
-
if (666 === n.status && 0 !== e.avail_in) return R(e, -5);
|
|
2036
|
-
if (0 !== e.avail_in || 0 !== n.lookahead || t !== l && 666 !== n.status) {
|
|
2037
|
-
var o = 2 === n.strategy ? function(e, t) {
|
|
2038
|
-
for (var r;;) {
|
|
2039
|
-
if (0 === e.lookahead && (j(e), 0 === e.lookahead)) {
|
|
2040
|
-
if (t === l) return A;
|
|
2041
|
-
break;
|
|
2042
|
-
}
|
|
2043
|
-
if (e.match_length = 0, r = u._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, r && (N(e, !1), 0 === e.strm.avail_out)) return A;
|
|
2044
|
-
}
|
|
2045
|
-
return e.insert = 0, t === f ? (N(e, !0), 0 === e.strm.avail_out ? O : B) : e.last_lit && (N(e, !1), 0 === e.strm.avail_out) ? A : I;
|
|
2046
|
-
}(n, t) : 3 === n.strategy ? function(e, t) {
|
|
2047
|
-
for (var r, n, i, s, a = e.window;;) {
|
|
2048
|
-
if (e.lookahead <= S) {
|
|
2049
|
-
if (j(e), e.lookahead <= S && t === l) return A;
|
|
2050
|
-
if (0 === e.lookahead) break;
|
|
2051
|
-
}
|
|
2052
|
-
if (e.match_length = 0, e.lookahead >= x && 0 < e.strstart && (n = a[i = e.strstart - 1]) === a[++i] && n === a[++i] && n === a[++i]) {
|
|
2053
|
-
s = e.strstart + S;
|
|
2054
|
-
do ;
|
|
2055
|
-
while (n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && i < s);
|
|
2056
|
-
e.match_length = S - (s - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
|
|
2057
|
-
}
|
|
2058
|
-
if (e.match_length >= x ? (r = u._tr_tally(e, 1, e.match_length - x), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (r = u._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), r && (N(e, !1), 0 === e.strm.avail_out)) return A;
|
|
2059
|
-
}
|
|
2060
|
-
return e.insert = 0, t === f ? (N(e, !0), 0 === e.strm.avail_out ? O : B) : e.last_lit && (N(e, !1), 0 === e.strm.avail_out) ? A : I;
|
|
2061
|
-
}(n, t) : h[n.level].func(n, t);
|
|
2062
|
-
if (o !== O && o !== B || (n.status = 666), o === A || o === O) return 0 === e.avail_out && (n.last_flush = -1), m;
|
|
2063
|
-
if (o === I && (1 === t ? u._tr_align(n) : 5 !== t && (u._tr_stored_block(n, 0, 0, !1), 3 === t && (D(n.head), 0 === n.lookahead && (n.strstart = 0, n.block_start = 0, n.insert = 0))), F(e), 0 === e.avail_out)) return n.last_flush = -1, m;
|
|
2064
|
-
}
|
|
2065
|
-
return t !== f ? m : n.wrap <= 0 ? 1 : (2 === n.wrap ? (U(n, 255 & e.adler), U(n, e.adler >> 8 & 255), U(n, e.adler >> 16 & 255), U(n, e.adler >> 24 & 255), U(n, 255 & e.total_in), U(n, e.total_in >> 8 & 255), U(n, e.total_in >> 16 & 255), U(n, e.total_in >> 24 & 255)) : (P(n, e.adler >>> 16), P(n, 65535 & e.adler)), F(e), 0 < n.wrap && (n.wrap = -n.wrap), 0 !== n.pending ? m : 1);
|
|
2066
|
-
}, r.deflateEnd = function(e) {
|
|
2067
|
-
var t;
|
|
2068
|
-
return e && e.state ? (t = e.state.status) !== C && 69 !== t && 73 !== t && 91 !== t && 103 !== t && t !== E && 666 !== t ? R(e, _) : (e.state = null, t === E ? R(e, -3) : m) : _;
|
|
2069
|
-
}, r.deflateSetDictionary = function(e, t) {
|
|
2070
|
-
var r, n, i, s, a, o, h, u, l = t.length;
|
|
2071
|
-
if (!e || !e.state) return _;
|
|
2072
|
-
if (2 === (s = (r = e.state).wrap) || 1 === s && r.status !== C || r.lookahead) return _;
|
|
2073
|
-
for (1 === s && (e.adler = d(e.adler, t, l, 0)), r.wrap = 0, l >= r.w_size && (0 === s && (D(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0), u = new c.Buf8(r.w_size), c.arraySet(u, t, l - r.w_size, r.w_size, 0), t = u, l = r.w_size), a = e.avail_in, o = e.next_in, h = e.input, e.avail_in = l, e.next_in = 0, e.input = t, j(r); r.lookahead >= x;) {
|
|
2074
|
-
for (n = r.strstart, i = r.lookahead - (x - 1); r.ins_h = (r.ins_h << r.hash_shift ^ r.window[n + x - 1]) & r.hash_mask, r.prev[n & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = n, n++, --i;);
|
|
2075
|
-
r.strstart = n, r.lookahead = x - 1, j(r);
|
|
2076
|
-
}
|
|
2077
|
-
return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = x - 1, r.match_available = 0, e.next_in = o, e.input = h, e.avail_in = a, r.wrap = s, m;
|
|
2078
|
-
}, r.deflateInfo = "pako deflate (from Nodeca project)";
|
|
2079
|
-
}, {
|
|
2080
|
-
"../utils/common": 41,
|
|
2081
|
-
"./adler32": 43,
|
|
2082
|
-
"./crc32": 45,
|
|
2083
|
-
"./messages": 51,
|
|
2084
|
-
"./trees": 52
|
|
2085
|
-
}],
|
|
2086
|
-
47: [function(e, t, r) {
|
|
2087
|
-
"use strict";
|
|
2088
|
-
t.exports = function() {
|
|
2089
|
-
this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
|
|
2090
|
-
};
|
|
2091
|
-
}, {}],
|
|
2092
|
-
48: [function(e, t, r) {
|
|
2093
|
-
"use strict";
|
|
2094
|
-
t.exports = function(e, t) {
|
|
2095
|
-
var r = e.state, n = e.next_in, i, s, a, o, h, u, l, f, c, d, p, m, _, g, b, v, y, w, k, x, S, z = e.input, C;
|
|
2096
|
-
i = n + (e.avail_in - 5), s = e.next_out, C = e.output, a = s - (t - e.avail_out), o = s + (e.avail_out - 257), h = r.dmax, u = r.wsize, l = r.whave, f = r.wnext, c = r.window, d = r.hold, p = r.bits, m = r.lencode, _ = r.distcode, g = (1 << r.lenbits) - 1, b = (1 << r.distbits) - 1;
|
|
2097
|
-
e: do {
|
|
2098
|
-
p < 15 && (d += z[n++] << p, p += 8, d += z[n++] << p, p += 8), v = m[d & g];
|
|
2099
|
-
t: for (;;) {
|
|
2100
|
-
if (d >>>= y = v >>> 24, p -= y, 0 === (y = v >>> 16 & 255)) C[s++] = 65535 & v;
|
|
2101
|
-
else {
|
|
2102
|
-
if (!(16 & y)) {
|
|
2103
|
-
if (0 == (64 & y)) {
|
|
2104
|
-
v = m[(65535 & v) + (d & (1 << y) - 1)];
|
|
2105
|
-
continue t;
|
|
2106
|
-
}
|
|
2107
|
-
if (32 & y) {
|
|
2108
|
-
r.mode = 12;
|
|
2109
|
-
break e;
|
|
2110
|
-
}
|
|
2111
|
-
e.msg = "invalid literal/length code", r.mode = 30;
|
|
2112
|
-
break e;
|
|
2113
|
-
}
|
|
2114
|
-
w = 65535 & v, (y &= 15) && (p < y && (d += z[n++] << p, p += 8), w += d & (1 << y) - 1, d >>>= y, p -= y), p < 15 && (d += z[n++] << p, p += 8, d += z[n++] << p, p += 8), v = _[d & b];
|
|
2115
|
-
r: for (;;) {
|
|
2116
|
-
if (d >>>= y = v >>> 24, p -= y, !(16 & (y = v >>> 16 & 255))) {
|
|
2117
|
-
if (0 == (64 & y)) {
|
|
2118
|
-
v = _[(65535 & v) + (d & (1 << y) - 1)];
|
|
2119
|
-
continue r;
|
|
2120
|
-
}
|
|
2121
|
-
e.msg = "invalid distance code", r.mode = 30;
|
|
2122
|
-
break e;
|
|
2123
|
-
}
|
|
2124
|
-
if (k = 65535 & v, p < (y &= 15) && (d += z[n++] << p, (p += 8) < y && (d += z[n++] << p, p += 8)), h < (k += d & (1 << y) - 1)) {
|
|
2125
|
-
e.msg = "invalid distance too far back", r.mode = 30;
|
|
2126
|
-
break e;
|
|
2127
|
-
}
|
|
2128
|
-
if (d >>>= y, p -= y, (y = s - a) < k) {
|
|
2129
|
-
if (l < (y = k - y) && r.sane) {
|
|
2130
|
-
e.msg = "invalid distance too far back", r.mode = 30;
|
|
2131
|
-
break e;
|
|
2132
|
-
}
|
|
2133
|
-
if (S = c, (x = 0) === f) {
|
|
2134
|
-
if (x += u - y, y < w) {
|
|
2135
|
-
for (w -= y; C[s++] = c[x++], --y;);
|
|
2136
|
-
x = s - k, S = C;
|
|
2137
|
-
}
|
|
2138
|
-
} else if (f < y) {
|
|
2139
|
-
if (x += u + f - y, (y -= f) < w) {
|
|
2140
|
-
for (w -= y; C[s++] = c[x++], --y;);
|
|
2141
|
-
if (x = 0, f < w) {
|
|
2142
|
-
for (w -= y = f; C[s++] = c[x++], --y;);
|
|
2143
|
-
x = s - k, S = C;
|
|
2144
|
-
}
|
|
2145
|
-
}
|
|
2146
|
-
} else if (x += f - y, y < w) {
|
|
2147
|
-
for (w -= y; C[s++] = c[x++], --y;);
|
|
2148
|
-
x = s - k, S = C;
|
|
2149
|
-
}
|
|
2150
|
-
for (; 2 < w;) C[s++] = S[x++], C[s++] = S[x++], C[s++] = S[x++], w -= 3;
|
|
2151
|
-
w && (C[s++] = S[x++], 1 < w && (C[s++] = S[x++]));
|
|
2152
|
-
} else {
|
|
2153
|
-
for (x = s - k; C[s++] = C[x++], C[s++] = C[x++], C[s++] = C[x++], 2 < (w -= 3););
|
|
2154
|
-
w && (C[s++] = C[x++], 1 < w && (C[s++] = C[x++]));
|
|
2155
|
-
}
|
|
2156
|
-
break;
|
|
2157
|
-
}
|
|
2158
|
-
}
|
|
2159
|
-
break;
|
|
2160
|
-
}
|
|
2161
|
-
} while (n < i && s < o);
|
|
2162
|
-
n -= w = p >> 3, d &= (1 << (p -= w << 3)) - 1, e.next_in = n, e.next_out = s, e.avail_in = n < i ? i - n + 5 : 5 - (n - i), e.avail_out = s < o ? o - s + 257 : 257 - (s - o), r.hold = d, r.bits = p;
|
|
2163
|
-
};
|
|
2164
|
-
}, {}],
|
|
2165
|
-
49: [function(e, t, r) {
|
|
2166
|
-
"use strict";
|
|
2167
|
-
var I = e("../utils/common"), O = e("./adler32"), B = e("./crc32"), R = e("./inffast"), T = e("./inftrees"), D = 1, F = 2, N = 0, U = -2, P = 1, n = 852, i = 592;
|
|
2168
|
-
function L(e) {
|
|
2169
|
-
return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((65280 & e) << 8) + ((255 & e) << 24);
|
|
2170
|
-
}
|
|
2171
|
-
function s() {
|
|
2172
|
-
this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new I.Buf16(320), this.work = new I.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
|
|
2173
|
-
}
|
|
2174
|
-
function a(e) {
|
|
2175
|
-
var t;
|
|
2176
|
-
return e && e.state ? (t = e.state, e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = 1 & t.wrap), t.mode = P, t.last = 0, t.havedict = 0, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new I.Buf32(n), t.distcode = t.distdyn = new I.Buf32(i), t.sane = 1, t.back = -1, N) : U;
|
|
2177
|
-
}
|
|
2178
|
-
function o(e) {
|
|
2179
|
-
var t;
|
|
2180
|
-
return e && e.state ? ((t = e.state).wsize = 0, t.whave = 0, t.wnext = 0, a(e)) : U;
|
|
2181
|
-
}
|
|
2182
|
-
function h(e, t) {
|
|
2183
|
-
var r, n;
|
|
2184
|
-
return e && e.state ? (n = e.state, t < 0 ? (r = 0, t = -t) : (r = 1 + (t >> 4), t < 48 && (t &= 15)), t && (t < 8 || 15 < t) ? U : (null !== n.window && n.wbits !== t && (n.window = null), n.wrap = r, n.wbits = t, o(e))) : U;
|
|
2185
|
-
}
|
|
2186
|
-
function u(e, t) {
|
|
2187
|
-
var r, n;
|
|
2188
|
-
return e ? (n = new s(), (e.state = n).window = null, (r = h(e, t)) !== N && (e.state = null), r) : U;
|
|
2189
|
-
}
|
|
2190
|
-
var l, f, c = !0;
|
|
2191
|
-
function j(e) {
|
|
2192
|
-
if (c) {
|
|
2193
|
-
var t;
|
|
2194
|
-
for (l = new I.Buf32(512), f = new I.Buf32(32), t = 0; t < 144;) e.lens[t++] = 8;
|
|
2195
|
-
for (; t < 256;) e.lens[t++] = 9;
|
|
2196
|
-
for (; t < 280;) e.lens[t++] = 7;
|
|
2197
|
-
for (; t < 288;) e.lens[t++] = 8;
|
|
2198
|
-
for (T(D, e.lens, 0, 288, l, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
|
|
2199
|
-
T(F, e.lens, 0, 32, f, 0, e.work, { bits: 5 }), c = !1;
|
|
2200
|
-
}
|
|
2201
|
-
e.lencode = l, e.lenbits = 9, e.distcode = f, e.distbits = 5;
|
|
2202
|
-
}
|
|
2203
|
-
function Z(e, t, r, n) {
|
|
2204
|
-
var i, s = e.state;
|
|
2205
|
-
return null === s.window && (s.wsize = 1 << s.wbits, s.wnext = 0, s.whave = 0, s.window = new I.Buf8(s.wsize)), n >= s.wsize ? (I.arraySet(s.window, t, r - s.wsize, s.wsize, 0), s.wnext = 0, s.whave = s.wsize) : (n < (i = s.wsize - s.wnext) && (i = n), I.arraySet(s.window, t, r - n, i, s.wnext), (n -= i) ? (I.arraySet(s.window, t, r - n, n, 0), s.wnext = n, s.whave = s.wsize) : (s.wnext += i, s.wnext === s.wsize && (s.wnext = 0), s.whave < s.wsize && (s.whave += i))), 0;
|
|
2206
|
-
}
|
|
2207
|
-
r.inflateReset = o, r.inflateReset2 = h, r.inflateResetKeep = a, r.inflateInit = function(e) {
|
|
2208
|
-
return u(e, 15);
|
|
2209
|
-
}, r.inflateInit2 = u, r.inflate = function(e, t) {
|
|
2210
|
-
var r, n, i, s, a, o, h, u, l, f, c, d, p, m, _, g, b, v, y, w, k, x, S, z, C = 0, E = new I.Buf8(4), A = [
|
|
2211
|
-
16,
|
|
2212
|
-
17,
|
|
2213
|
-
18,
|
|
2214
|
-
0,
|
|
2215
|
-
8,
|
|
2216
|
-
7,
|
|
2217
|
-
9,
|
|
2218
|
-
6,
|
|
2219
|
-
10,
|
|
2220
|
-
5,
|
|
2221
|
-
11,
|
|
2222
|
-
4,
|
|
2223
|
-
12,
|
|
2224
|
-
3,
|
|
2225
|
-
13,
|
|
2226
|
-
2,
|
|
2227
|
-
14,
|
|
2228
|
-
1,
|
|
2229
|
-
15
|
|
2230
|
-
];
|
|
2231
|
-
if (!e || !e.state || !e.output || !e.input && 0 !== e.avail_in) return U;
|
|
2232
|
-
12 === (r = e.state).mode && (r.mode = 13), a = e.next_out, i = e.output, h = e.avail_out, s = e.next_in, n = e.input, o = e.avail_in, u = r.hold, l = r.bits, f = o, c = h, x = N;
|
|
2233
|
-
e: for (;;) switch (r.mode) {
|
|
2234
|
-
case P:
|
|
2235
|
-
if (0 === r.wrap) {
|
|
2236
|
-
r.mode = 13;
|
|
2237
|
-
break;
|
|
2238
|
-
}
|
|
2239
|
-
for (; l < 16;) {
|
|
2240
|
-
if (0 === o) break e;
|
|
2241
|
-
o--, u += n[s++] << l, l += 8;
|
|
2242
|
-
}
|
|
2243
|
-
if (2 & r.wrap && 35615 === u) {
|
|
2244
|
-
E[r.check = 0] = 255 & u, E[1] = u >>> 8 & 255, r.check = B(r.check, E, 2, 0), l = u = 0, r.mode = 2;
|
|
2245
|
-
break;
|
|
2246
|
-
}
|
|
2247
|
-
if (r.flags = 0, r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & u) << 8) + (u >> 8)) % 31) {
|
|
2248
|
-
e.msg = "incorrect header check", r.mode = 30;
|
|
2249
|
-
break;
|
|
2250
|
-
}
|
|
2251
|
-
if (8 != (15 & u)) {
|
|
2252
|
-
e.msg = "unknown compression method", r.mode = 30;
|
|
2253
|
-
break;
|
|
2254
|
-
}
|
|
2255
|
-
if (l -= 4, k = 8 + (15 & (u >>>= 4)), 0 === r.wbits) r.wbits = k;
|
|
2256
|
-
else if (k > r.wbits) {
|
|
2257
|
-
e.msg = "invalid window size", r.mode = 30;
|
|
2258
|
-
break;
|
|
2259
|
-
}
|
|
2260
|
-
r.dmax = 1 << k, e.adler = r.check = 1, r.mode = 512 & u ? 10 : 12, l = u = 0;
|
|
2261
|
-
break;
|
|
2262
|
-
case 2:
|
|
2263
|
-
for (; l < 16;) {
|
|
2264
|
-
if (0 === o) break e;
|
|
2265
|
-
o--, u += n[s++] << l, l += 8;
|
|
2266
|
-
}
|
|
2267
|
-
if (r.flags = u, 8 != (255 & r.flags)) {
|
|
2268
|
-
e.msg = "unknown compression method", r.mode = 30;
|
|
2269
|
-
break;
|
|
2270
|
-
}
|
|
2271
|
-
if (57344 & r.flags) {
|
|
2272
|
-
e.msg = "unknown header flags set", r.mode = 30;
|
|
2273
|
-
break;
|
|
2274
|
-
}
|
|
2275
|
-
r.head && (r.head.text = u >> 8 & 1), 512 & r.flags && (E[0] = 255 & u, E[1] = u >>> 8 & 255, r.check = B(r.check, E, 2, 0)), l = u = 0, r.mode = 3;
|
|
2276
|
-
case 3:
|
|
2277
|
-
for (; l < 32;) {
|
|
2278
|
-
if (0 === o) break e;
|
|
2279
|
-
o--, u += n[s++] << l, l += 8;
|
|
2280
|
-
}
|
|
2281
|
-
r.head && (r.head.time = u), 512 & r.flags && (E[0] = 255 & u, E[1] = u >>> 8 & 255, E[2] = u >>> 16 & 255, E[3] = u >>> 24 & 255, r.check = B(r.check, E, 4, 0)), l = u = 0, r.mode = 4;
|
|
2282
|
-
case 4:
|
|
2283
|
-
for (; l < 16;) {
|
|
2284
|
-
if (0 === o) break e;
|
|
2285
|
-
o--, u += n[s++] << l, l += 8;
|
|
2286
|
-
}
|
|
2287
|
-
r.head && (r.head.xflags = 255 & u, r.head.os = u >> 8), 512 & r.flags && (E[0] = 255 & u, E[1] = u >>> 8 & 255, r.check = B(r.check, E, 2, 0)), l = u = 0, r.mode = 5;
|
|
2288
|
-
case 5:
|
|
2289
|
-
if (1024 & r.flags) {
|
|
2290
|
-
for (; l < 16;) {
|
|
2291
|
-
if (0 === o) break e;
|
|
2292
|
-
o--, u += n[s++] << l, l += 8;
|
|
2293
|
-
}
|
|
2294
|
-
r.length = u, r.head && (r.head.extra_len = u), 512 & r.flags && (E[0] = 255 & u, E[1] = u >>> 8 & 255, r.check = B(r.check, E, 2, 0)), l = u = 0;
|
|
2295
|
-
} else r.head && (r.head.extra = null);
|
|
2296
|
-
r.mode = 6;
|
|
2297
|
-
case 6:
|
|
2298
|
-
if (1024 & r.flags && (o < (d = r.length) && (d = o), d && (r.head && (k = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), I.arraySet(r.head.extra, n, s, d, k)), 512 & r.flags && (r.check = B(r.check, n, d, s)), o -= d, s += d, r.length -= d), r.length)) break e;
|
|
2299
|
-
r.length = 0, r.mode = 7;
|
|
2300
|
-
case 7:
|
|
2301
|
-
if (2048 & r.flags) {
|
|
2302
|
-
if (0 === o) break e;
|
|
2303
|
-
for (d = 0; k = n[s + d++], r.head && k && r.length < 65536 && (r.head.name += String.fromCharCode(k)), k && d < o;);
|
|
2304
|
-
if (512 & r.flags && (r.check = B(r.check, n, d, s)), o -= d, s += d, k) break e;
|
|
2305
|
-
} else r.head && (r.head.name = null);
|
|
2306
|
-
r.length = 0, r.mode = 8;
|
|
2307
|
-
case 8:
|
|
2308
|
-
if (4096 & r.flags) {
|
|
2309
|
-
if (0 === o) break e;
|
|
2310
|
-
for (d = 0; k = n[s + d++], r.head && k && r.length < 65536 && (r.head.comment += String.fromCharCode(k)), k && d < o;);
|
|
2311
|
-
if (512 & r.flags && (r.check = B(r.check, n, d, s)), o -= d, s += d, k) break e;
|
|
2312
|
-
} else r.head && (r.head.comment = null);
|
|
2313
|
-
r.mode = 9;
|
|
2314
|
-
case 9:
|
|
2315
|
-
if (512 & r.flags) {
|
|
2316
|
-
for (; l < 16;) {
|
|
2317
|
-
if (0 === o) break e;
|
|
2318
|
-
o--, u += n[s++] << l, l += 8;
|
|
2319
|
-
}
|
|
2320
|
-
if (u !== (65535 & r.check)) {
|
|
2321
|
-
e.msg = "header crc mismatch", r.mode = 30;
|
|
2322
|
-
break;
|
|
2323
|
-
}
|
|
2324
|
-
l = u = 0;
|
|
2325
|
-
}
|
|
2326
|
-
r.head && (r.head.hcrc = r.flags >> 9 & 1, r.head.done = !0), e.adler = r.check = 0, r.mode = 12;
|
|
2327
|
-
break;
|
|
2328
|
-
case 10:
|
|
2329
|
-
for (; l < 32;) {
|
|
2330
|
-
if (0 === o) break e;
|
|
2331
|
-
o--, u += n[s++] << l, l += 8;
|
|
2332
|
-
}
|
|
2333
|
-
e.adler = r.check = L(u), l = u = 0, r.mode = 11;
|
|
2334
|
-
case 11:
|
|
2335
|
-
if (0 === r.havedict) return e.next_out = a, e.avail_out = h, e.next_in = s, e.avail_in = o, r.hold = u, r.bits = l, 2;
|
|
2336
|
-
e.adler = r.check = 1, r.mode = 12;
|
|
2337
|
-
case 12: if (5 === t || 6 === t) break e;
|
|
2338
|
-
case 13:
|
|
2339
|
-
if (r.last) {
|
|
2340
|
-
u >>>= 7 & l, l -= 7 & l, r.mode = 27;
|
|
2341
|
-
break;
|
|
2342
|
-
}
|
|
2343
|
-
for (; l < 3;) {
|
|
2344
|
-
if (0 === o) break e;
|
|
2345
|
-
o--, u += n[s++] << l, l += 8;
|
|
2346
|
-
}
|
|
2347
|
-
switch (r.last = 1 & u, l -= 1, 3 & (u >>>= 1)) {
|
|
2348
|
-
case 0:
|
|
2349
|
-
r.mode = 14;
|
|
2350
|
-
break;
|
|
2351
|
-
case 1:
|
|
2352
|
-
if (j(r), r.mode = 20, 6 !== t) break;
|
|
2353
|
-
u >>>= 2, l -= 2;
|
|
2354
|
-
break e;
|
|
2355
|
-
case 2:
|
|
2356
|
-
r.mode = 17;
|
|
2357
|
-
break;
|
|
2358
|
-
case 3: e.msg = "invalid block type", r.mode = 30;
|
|
2359
|
-
}
|
|
2360
|
-
u >>>= 2, l -= 2;
|
|
2361
|
-
break;
|
|
2362
|
-
case 14:
|
|
2363
|
-
for (u >>>= 7 & l, l -= 7 & l; l < 32;) {
|
|
2364
|
-
if (0 === o) break e;
|
|
2365
|
-
o--, u += n[s++] << l, l += 8;
|
|
2366
|
-
}
|
|
2367
|
-
if ((65535 & u) != (u >>> 16 ^ 65535)) {
|
|
2368
|
-
e.msg = "invalid stored block lengths", r.mode = 30;
|
|
2369
|
-
break;
|
|
2370
|
-
}
|
|
2371
|
-
if (r.length = 65535 & u, l = u = 0, r.mode = 15, 6 === t) break e;
|
|
2372
|
-
case 15: r.mode = 16;
|
|
2373
|
-
case 16:
|
|
2374
|
-
if (d = r.length) {
|
|
2375
|
-
if (o < d && (d = o), h < d && (d = h), 0 === d) break e;
|
|
2376
|
-
I.arraySet(i, n, s, d, a), o -= d, s += d, h -= d, a += d, r.length -= d;
|
|
2377
|
-
break;
|
|
2378
|
-
}
|
|
2379
|
-
r.mode = 12;
|
|
2380
|
-
break;
|
|
2381
|
-
case 17:
|
|
2382
|
-
for (; l < 14;) {
|
|
2383
|
-
if (0 === o) break e;
|
|
2384
|
-
o--, u += n[s++] << l, l += 8;
|
|
2385
|
-
}
|
|
2386
|
-
if (r.nlen = 257 + (31 & u), u >>>= 5, l -= 5, r.ndist = 1 + (31 & u), u >>>= 5, l -= 5, r.ncode = 4 + (15 & u), u >>>= 4, l -= 4, 286 < r.nlen || 30 < r.ndist) {
|
|
2387
|
-
e.msg = "too many length or distance symbols", r.mode = 30;
|
|
2388
|
-
break;
|
|
2389
|
-
}
|
|
2390
|
-
r.have = 0, r.mode = 18;
|
|
2391
|
-
case 18:
|
|
2392
|
-
for (; r.have < r.ncode;) {
|
|
2393
|
-
for (; l < 3;) {
|
|
2394
|
-
if (0 === o) break e;
|
|
2395
|
-
o--, u += n[s++] << l, l += 8;
|
|
2396
|
-
}
|
|
2397
|
-
r.lens[A[r.have++]] = 7 & u, u >>>= 3, l -= 3;
|
|
2398
|
-
}
|
|
2399
|
-
for (; r.have < 19;) r.lens[A[r.have++]] = 0;
|
|
2400
|
-
if (r.lencode = r.lendyn, r.lenbits = 7, S = { bits: r.lenbits }, x = T(0, r.lens, 0, 19, r.lencode, 0, r.work, S), r.lenbits = S.bits, x) {
|
|
2401
|
-
e.msg = "invalid code lengths set", r.mode = 30;
|
|
2402
|
-
break;
|
|
2403
|
-
}
|
|
2404
|
-
r.have = 0, r.mode = 19;
|
|
2405
|
-
case 19:
|
|
2406
|
-
for (; r.have < r.nlen + r.ndist;) {
|
|
2407
|
-
for (; g = (C = r.lencode[u & (1 << r.lenbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l);) {
|
|
2408
|
-
if (0 === o) break e;
|
|
2409
|
-
o--, u += n[s++] << l, l += 8;
|
|
2410
|
-
}
|
|
2411
|
-
if (b < 16) u >>>= _, l -= _, r.lens[r.have++] = b;
|
|
2412
|
-
else {
|
|
2413
|
-
if (16 === b) {
|
|
2414
|
-
for (z = _ + 2; l < z;) {
|
|
2415
|
-
if (0 === o) break e;
|
|
2416
|
-
o--, u += n[s++] << l, l += 8;
|
|
2417
|
-
}
|
|
2418
|
-
if (u >>>= _, l -= _, 0 === r.have) {
|
|
2419
|
-
e.msg = "invalid bit length repeat", r.mode = 30;
|
|
2420
|
-
break;
|
|
2421
|
-
}
|
|
2422
|
-
k = r.lens[r.have - 1], d = 3 + (3 & u), u >>>= 2, l -= 2;
|
|
2423
|
-
} else if (17 === b) {
|
|
2424
|
-
for (z = _ + 3; l < z;) {
|
|
2425
|
-
if (0 === o) break e;
|
|
2426
|
-
o--, u += n[s++] << l, l += 8;
|
|
2427
|
-
}
|
|
2428
|
-
l -= _, k = 0, d = 3 + (7 & (u >>>= _)), u >>>= 3, l -= 3;
|
|
2429
|
-
} else {
|
|
2430
|
-
for (z = _ + 7; l < z;) {
|
|
2431
|
-
if (0 === o) break e;
|
|
2432
|
-
o--, u += n[s++] << l, l += 8;
|
|
2433
|
-
}
|
|
2434
|
-
l -= _, k = 0, d = 11 + (127 & (u >>>= _)), u >>>= 7, l -= 7;
|
|
2435
|
-
}
|
|
2436
|
-
if (r.have + d > r.nlen + r.ndist) {
|
|
2437
|
-
e.msg = "invalid bit length repeat", r.mode = 30;
|
|
2438
|
-
break;
|
|
2439
|
-
}
|
|
2440
|
-
for (; d--;) r.lens[r.have++] = k;
|
|
2441
|
-
}
|
|
2442
|
-
}
|
|
2443
|
-
if (30 === r.mode) break;
|
|
2444
|
-
if (0 === r.lens[256]) {
|
|
2445
|
-
e.msg = "invalid code -- missing end-of-block", r.mode = 30;
|
|
2446
|
-
break;
|
|
2447
|
-
}
|
|
2448
|
-
if (r.lenbits = 9, S = { bits: r.lenbits }, x = T(D, r.lens, 0, r.nlen, r.lencode, 0, r.work, S), r.lenbits = S.bits, x) {
|
|
2449
|
-
e.msg = "invalid literal/lengths set", r.mode = 30;
|
|
2450
|
-
break;
|
|
2451
|
-
}
|
|
2452
|
-
if (r.distbits = 6, r.distcode = r.distdyn, S = { bits: r.distbits }, x = T(F, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, S), r.distbits = S.bits, x) {
|
|
2453
|
-
e.msg = "invalid distances set", r.mode = 30;
|
|
2454
|
-
break;
|
|
2455
|
-
}
|
|
2456
|
-
if (r.mode = 20, 6 === t) break e;
|
|
2457
|
-
case 20: r.mode = 21;
|
|
2458
|
-
case 21:
|
|
2459
|
-
if (6 <= o && 258 <= h) {
|
|
2460
|
-
e.next_out = a, e.avail_out = h, e.next_in = s, e.avail_in = o, r.hold = u, r.bits = l, R(e, c), a = e.next_out, i = e.output, h = e.avail_out, s = e.next_in, n = e.input, o = e.avail_in, u = r.hold, l = r.bits, 12 === r.mode && (r.back = -1);
|
|
2461
|
-
break;
|
|
2462
|
-
}
|
|
2463
|
-
for (r.back = 0; g = (C = r.lencode[u & (1 << r.lenbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l);) {
|
|
2464
|
-
if (0 === o) break e;
|
|
2465
|
-
o--, u += n[s++] << l, l += 8;
|
|
2466
|
-
}
|
|
2467
|
-
if (g && 0 == (240 & g)) {
|
|
2468
|
-
for (v = _, y = g, w = b; g = (C = r.lencode[w + ((u & (1 << v + y) - 1) >> v)]) >>> 16 & 255, b = 65535 & C, !(v + (_ = C >>> 24) <= l);) {
|
|
2469
|
-
if (0 === o) break e;
|
|
2470
|
-
o--, u += n[s++] << l, l += 8;
|
|
2471
|
-
}
|
|
2472
|
-
u >>>= v, l -= v, r.back += v;
|
|
2473
|
-
}
|
|
2474
|
-
if (u >>>= _, l -= _, r.back += _, r.length = b, 0 === g) {
|
|
2475
|
-
r.mode = 26;
|
|
2476
|
-
break;
|
|
2477
|
-
}
|
|
2478
|
-
if (32 & g) {
|
|
2479
|
-
r.back = -1, r.mode = 12;
|
|
2480
|
-
break;
|
|
2481
|
-
}
|
|
2482
|
-
if (64 & g) {
|
|
2483
|
-
e.msg = "invalid literal/length code", r.mode = 30;
|
|
2484
|
-
break;
|
|
2485
|
-
}
|
|
2486
|
-
r.extra = 15 & g, r.mode = 22;
|
|
2487
|
-
case 22:
|
|
2488
|
-
if (r.extra) {
|
|
2489
|
-
for (z = r.extra; l < z;) {
|
|
2490
|
-
if (0 === o) break e;
|
|
2491
|
-
o--, u += n[s++] << l, l += 8;
|
|
2492
|
-
}
|
|
2493
|
-
r.length += u & (1 << r.extra) - 1, u >>>= r.extra, l -= r.extra, r.back += r.extra;
|
|
2494
|
-
}
|
|
2495
|
-
r.was = r.length, r.mode = 23;
|
|
2496
|
-
case 23:
|
|
2497
|
-
for (; g = (C = r.distcode[u & (1 << r.distbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l);) {
|
|
2498
|
-
if (0 === o) break e;
|
|
2499
|
-
o--, u += n[s++] << l, l += 8;
|
|
2500
|
-
}
|
|
2501
|
-
if (0 == (240 & g)) {
|
|
2502
|
-
for (v = _, y = g, w = b; g = (C = r.distcode[w + ((u & (1 << v + y) - 1) >> v)]) >>> 16 & 255, b = 65535 & C, !(v + (_ = C >>> 24) <= l);) {
|
|
2503
|
-
if (0 === o) break e;
|
|
2504
|
-
o--, u += n[s++] << l, l += 8;
|
|
2505
|
-
}
|
|
2506
|
-
u >>>= v, l -= v, r.back += v;
|
|
2507
|
-
}
|
|
2508
|
-
if (u >>>= _, l -= _, r.back += _, 64 & g) {
|
|
2509
|
-
e.msg = "invalid distance code", r.mode = 30;
|
|
2510
|
-
break;
|
|
2511
|
-
}
|
|
2512
|
-
r.offset = b, r.extra = 15 & g, r.mode = 24;
|
|
2513
|
-
case 24:
|
|
2514
|
-
if (r.extra) {
|
|
2515
|
-
for (z = r.extra; l < z;) {
|
|
2516
|
-
if (0 === o) break e;
|
|
2517
|
-
o--, u += n[s++] << l, l += 8;
|
|
2518
|
-
}
|
|
2519
|
-
r.offset += u & (1 << r.extra) - 1, u >>>= r.extra, l -= r.extra, r.back += r.extra;
|
|
2520
|
-
}
|
|
2521
|
-
if (r.offset > r.dmax) {
|
|
2522
|
-
e.msg = "invalid distance too far back", r.mode = 30;
|
|
2523
|
-
break;
|
|
2524
|
-
}
|
|
2525
|
-
r.mode = 25;
|
|
2526
|
-
case 25:
|
|
2527
|
-
if (0 === h) break e;
|
|
2528
|
-
if (d = c - h, r.offset > d) {
|
|
2529
|
-
if ((d = r.offset - d) > r.whave && r.sane) {
|
|
2530
|
-
e.msg = "invalid distance too far back", r.mode = 30;
|
|
2531
|
-
break;
|
|
2532
|
-
}
|
|
2533
|
-
p = d > r.wnext ? (d -= r.wnext, r.wsize - d) : r.wnext - d, d > r.length && (d = r.length), m = r.window;
|
|
2534
|
-
} else m = i, p = a - r.offset, d = r.length;
|
|
2535
|
-
for (h < d && (d = h), h -= d, r.length -= d; i[a++] = m[p++], --d;);
|
|
2536
|
-
0 === r.length && (r.mode = 21);
|
|
2537
|
-
break;
|
|
2538
|
-
case 26:
|
|
2539
|
-
if (0 === h) break e;
|
|
2540
|
-
i[a++] = r.length, h--, r.mode = 21;
|
|
2541
|
-
break;
|
|
2542
|
-
case 27:
|
|
2543
|
-
if (r.wrap) {
|
|
2544
|
-
for (; l < 32;) {
|
|
2545
|
-
if (0 === o) break e;
|
|
2546
|
-
o--, u |= n[s++] << l, l += 8;
|
|
2547
|
-
}
|
|
2548
|
-
if (c -= h, e.total_out += c, r.total += c, c && (e.adler = r.check = r.flags ? B(r.check, i, c, a - c) : O(r.check, i, c, a - c)), c = h, (r.flags ? u : L(u)) !== r.check) {
|
|
2549
|
-
e.msg = "incorrect data check", r.mode = 30;
|
|
2550
|
-
break;
|
|
2551
|
-
}
|
|
2552
|
-
l = u = 0;
|
|
2553
|
-
}
|
|
2554
|
-
r.mode = 28;
|
|
2555
|
-
case 28:
|
|
2556
|
-
if (r.wrap && r.flags) {
|
|
2557
|
-
for (; l < 32;) {
|
|
2558
|
-
if (0 === o) break e;
|
|
2559
|
-
o--, u += n[s++] << l, l += 8;
|
|
2560
|
-
}
|
|
2561
|
-
if (u !== (4294967295 & r.total)) {
|
|
2562
|
-
e.msg = "incorrect length check", r.mode = 30;
|
|
2563
|
-
break;
|
|
2564
|
-
}
|
|
2565
|
-
l = u = 0;
|
|
2566
|
-
}
|
|
2567
|
-
r.mode = 29;
|
|
2568
|
-
case 29:
|
|
2569
|
-
x = 1;
|
|
2570
|
-
break e;
|
|
2571
|
-
case 30:
|
|
2572
|
-
x = -3;
|
|
2573
|
-
break e;
|
|
2574
|
-
case 31: return -4;
|
|
2575
|
-
case 32:
|
|
2576
|
-
default: return U;
|
|
2577
|
-
}
|
|
2578
|
-
return e.next_out = a, e.avail_out = h, e.next_in = s, e.avail_in = o, r.hold = u, r.bits = l, (r.wsize || c !== e.avail_out && r.mode < 30 && (r.mode < 27 || 4 !== t)) && Z(e, e.output, e.next_out, c - e.avail_out) ? (r.mode = 31, -4) : (f -= e.avail_in, c -= e.avail_out, e.total_in += f, e.total_out += c, r.total += c, r.wrap && c && (e.adler = r.check = r.flags ? B(r.check, i, c, e.next_out - c) : O(r.check, i, c, e.next_out - c)), e.data_type = r.bits + (r.last ? 64 : 0) + (12 === r.mode ? 128 : 0) + (20 === r.mode || 15 === r.mode ? 256 : 0), (0 == f && 0 === c || 4 === t) && x === N && (x = -5), x);
|
|
2579
|
-
}, r.inflateEnd = function(e) {
|
|
2580
|
-
if (!e || !e.state) return U;
|
|
2581
|
-
var t = e.state;
|
|
2582
|
-
return t.window && (t.window = null), e.state = null, N;
|
|
2583
|
-
}, r.inflateGetHeader = function(e, t) {
|
|
2584
|
-
var r;
|
|
2585
|
-
return e && e.state ? 0 == (2 & (r = e.state).wrap) ? U : ((r.head = t).done = !1, N) : U;
|
|
2586
|
-
}, r.inflateSetDictionary = function(e, t) {
|
|
2587
|
-
var r, n = t.length;
|
|
2588
|
-
return e && e.state ? 0 !== (r = e.state).wrap && 11 !== r.mode ? U : 11 === r.mode && O(1, t, n, 0) !== r.check ? -3 : Z(e, t, n, n) ? (r.mode = 31, -4) : (r.havedict = 1, N) : U;
|
|
2589
|
-
}, r.inflateInfo = "pako inflate (from Nodeca project)";
|
|
2590
|
-
}, {
|
|
2591
|
-
"../utils/common": 41,
|
|
2592
|
-
"./adler32": 43,
|
|
2593
|
-
"./crc32": 45,
|
|
2594
|
-
"./inffast": 48,
|
|
2595
|
-
"./inftrees": 50
|
|
2596
|
-
}],
|
|
2597
|
-
50: [function(e, t, r) {
|
|
2598
|
-
"use strict";
|
|
2599
|
-
var D = e("../utils/common"), F = [
|
|
2600
|
-
3,
|
|
2601
|
-
4,
|
|
2602
|
-
5,
|
|
2603
|
-
6,
|
|
2604
|
-
7,
|
|
2605
|
-
8,
|
|
2606
|
-
9,
|
|
2607
|
-
10,
|
|
2608
|
-
11,
|
|
2609
|
-
13,
|
|
2610
|
-
15,
|
|
2611
|
-
17,
|
|
2612
|
-
19,
|
|
2613
|
-
23,
|
|
2614
|
-
27,
|
|
2615
|
-
31,
|
|
2616
|
-
35,
|
|
2617
|
-
43,
|
|
2618
|
-
51,
|
|
2619
|
-
59,
|
|
2620
|
-
67,
|
|
2621
|
-
83,
|
|
2622
|
-
99,
|
|
2623
|
-
115,
|
|
2624
|
-
131,
|
|
2625
|
-
163,
|
|
2626
|
-
195,
|
|
2627
|
-
227,
|
|
2628
|
-
258,
|
|
2629
|
-
0,
|
|
2630
|
-
0
|
|
2631
|
-
], N = [
|
|
2632
|
-
16,
|
|
2633
|
-
16,
|
|
2634
|
-
16,
|
|
2635
|
-
16,
|
|
2636
|
-
16,
|
|
2637
|
-
16,
|
|
2638
|
-
16,
|
|
2639
|
-
16,
|
|
2640
|
-
17,
|
|
2641
|
-
17,
|
|
2642
|
-
17,
|
|
2643
|
-
17,
|
|
2644
|
-
18,
|
|
2645
|
-
18,
|
|
2646
|
-
18,
|
|
2647
|
-
18,
|
|
2648
|
-
19,
|
|
2649
|
-
19,
|
|
2650
|
-
19,
|
|
2651
|
-
19,
|
|
2652
|
-
20,
|
|
2653
|
-
20,
|
|
2654
|
-
20,
|
|
2655
|
-
20,
|
|
2656
|
-
21,
|
|
2657
|
-
21,
|
|
2658
|
-
21,
|
|
2659
|
-
21,
|
|
2660
|
-
16,
|
|
2661
|
-
72,
|
|
2662
|
-
78
|
|
2663
|
-
], U = [
|
|
2664
|
-
1,
|
|
2665
|
-
2,
|
|
2666
|
-
3,
|
|
2667
|
-
4,
|
|
2668
|
-
5,
|
|
2669
|
-
7,
|
|
2670
|
-
9,
|
|
2671
|
-
13,
|
|
2672
|
-
17,
|
|
2673
|
-
25,
|
|
2674
|
-
33,
|
|
2675
|
-
49,
|
|
2676
|
-
65,
|
|
2677
|
-
97,
|
|
2678
|
-
129,
|
|
2679
|
-
193,
|
|
2680
|
-
257,
|
|
2681
|
-
385,
|
|
2682
|
-
513,
|
|
2683
|
-
769,
|
|
2684
|
-
1025,
|
|
2685
|
-
1537,
|
|
2686
|
-
2049,
|
|
2687
|
-
3073,
|
|
2688
|
-
4097,
|
|
2689
|
-
6145,
|
|
2690
|
-
8193,
|
|
2691
|
-
12289,
|
|
2692
|
-
16385,
|
|
2693
|
-
24577,
|
|
2694
|
-
0,
|
|
2695
|
-
0
|
|
2696
|
-
], P = [
|
|
2697
|
-
16,
|
|
2698
|
-
16,
|
|
2699
|
-
16,
|
|
2700
|
-
16,
|
|
2701
|
-
17,
|
|
2702
|
-
17,
|
|
2703
|
-
18,
|
|
2704
|
-
18,
|
|
2705
|
-
19,
|
|
2706
|
-
19,
|
|
2707
|
-
20,
|
|
2708
|
-
20,
|
|
2709
|
-
21,
|
|
2710
|
-
21,
|
|
2711
|
-
22,
|
|
2712
|
-
22,
|
|
2713
|
-
23,
|
|
2714
|
-
23,
|
|
2715
|
-
24,
|
|
2716
|
-
24,
|
|
2717
|
-
25,
|
|
2718
|
-
25,
|
|
2719
|
-
26,
|
|
2720
|
-
26,
|
|
2721
|
-
27,
|
|
2722
|
-
27,
|
|
2723
|
-
28,
|
|
2724
|
-
28,
|
|
2725
|
-
29,
|
|
2726
|
-
29,
|
|
2727
|
-
64,
|
|
2728
|
-
64
|
|
2729
|
-
];
|
|
2730
|
-
t.exports = function(e, t, r, n, i, s, a, o) {
|
|
2731
|
-
var h, u, l, f, c, d, p, m, _, g = o.bits, b = 0, v = 0, y = 0, w = 0, k = 0, x = 0, S = 0, z = 0, C = 0, E = 0, A = null, I = 0, O = new D.Buf16(16), B = new D.Buf16(16), R = null, T = 0;
|
|
2732
|
-
for (b = 0; b <= 15; b++) O[b] = 0;
|
|
2733
|
-
for (v = 0; v < n; v++) O[t[r + v]]++;
|
|
2734
|
-
for (k = g, w = 15; 1 <= w && 0 === O[w]; w--);
|
|
2735
|
-
if (w < k && (k = w), 0 === w) return i[s++] = 20971520, i[s++] = 20971520, o.bits = 1, 0;
|
|
2736
|
-
for (y = 1; y < w && 0 === O[y]; y++);
|
|
2737
|
-
for (k < y && (k = y), b = z = 1; b <= 15; b++) if (z <<= 1, (z -= O[b]) < 0) return -1;
|
|
2738
|
-
if (0 < z && (0 === e || 1 !== w)) return -1;
|
|
2739
|
-
for (B[1] = 0, b = 1; b < 15; b++) B[b + 1] = B[b] + O[b];
|
|
2740
|
-
for (v = 0; v < n; v++) 0 !== t[r + v] && (a[B[t[r + v]]++] = v);
|
|
2741
|
-
if (d = 0 === e ? (A = R = a, 19) : 1 === e ? (A = F, I -= 257, R = N, T -= 257, 256) : (A = U, R = P, -1), b = y, c = s, S = v = E = 0, l = -1, f = (C = 1 << (x = k)) - 1, 1 === e && 852 < C || 2 === e && 592 < C) return 1;
|
|
2742
|
-
for (;;) {
|
|
2743
|
-
for (p = b - S, _ = a[v] < d ? (m = 0, a[v]) : a[v] > d ? (m = R[T + a[v]], A[I + a[v]]) : (m = 96, 0), h = 1 << b - S, y = u = 1 << x; i[c + (E >> S) + (u -= h)] = p << 24 | m << 16 | _ | 0, 0 !== u;);
|
|
2744
|
-
for (h = 1 << b - 1; E & h;) h >>= 1;
|
|
2745
|
-
if (0 !== h ? (E &= h - 1, E += h) : E = 0, v++, 0 == --O[b]) {
|
|
2746
|
-
if (b === w) break;
|
|
2747
|
-
b = t[r + a[v]];
|
|
2748
|
-
}
|
|
2749
|
-
if (k < b && (E & f) !== l) {
|
|
2750
|
-
for (0 === S && (S = k), c += y, z = 1 << (x = b - S); x + S < w && !((z -= O[x + S]) <= 0);) x++, z <<= 1;
|
|
2751
|
-
if (C += 1 << x, 1 === e && 852 < C || 2 === e && 592 < C) return 1;
|
|
2752
|
-
i[l = E & f] = k << 24 | x << 16 | c - s | 0;
|
|
2753
|
-
}
|
|
2754
|
-
}
|
|
2755
|
-
return 0 !== E && (i[c + E] = b - S << 24 | 4194304), o.bits = k, 0;
|
|
2756
|
-
};
|
|
2757
|
-
}, { "../utils/common": 41 }],
|
|
2758
|
-
51: [function(e, t, r) {
|
|
2759
|
-
"use strict";
|
|
2760
|
-
t.exports = {
|
|
2761
|
-
2: "need dictionary",
|
|
2762
|
-
1: "stream end",
|
|
2763
|
-
0: "",
|
|
2764
|
-
"-1": "file error",
|
|
2765
|
-
"-2": "stream error",
|
|
2766
|
-
"-3": "data error",
|
|
2767
|
-
"-4": "insufficient memory",
|
|
2768
|
-
"-5": "buffer error",
|
|
2769
|
-
"-6": "incompatible version"
|
|
2770
|
-
};
|
|
2771
|
-
}, {}],
|
|
2772
|
-
52: [function(e, t, r) {
|
|
2773
|
-
"use strict";
|
|
2774
|
-
var i = e("../utils/common"), o = 0, h = 1;
|
|
2775
|
-
function n(e) {
|
|
2776
|
-
for (var t = e.length; 0 <= --t;) e[t] = 0;
|
|
2777
|
-
}
|
|
2778
|
-
var s = 0, a = 29, u = 256, l = u + 1 + a, f = 30, c = 19, _ = 2 * l + 1, g = 15, d = 16, p = 7, m = 256, b = 16, v = 17, y = 18, w = [
|
|
2779
|
-
0,
|
|
2780
|
-
0,
|
|
2781
|
-
0,
|
|
2782
|
-
0,
|
|
2783
|
-
0,
|
|
2784
|
-
0,
|
|
2785
|
-
0,
|
|
2786
|
-
0,
|
|
2787
|
-
1,
|
|
2788
|
-
1,
|
|
2789
|
-
1,
|
|
2790
|
-
1,
|
|
2791
|
-
2,
|
|
2792
|
-
2,
|
|
2793
|
-
2,
|
|
2794
|
-
2,
|
|
2795
|
-
3,
|
|
2796
|
-
3,
|
|
2797
|
-
3,
|
|
2798
|
-
3,
|
|
2799
|
-
4,
|
|
2800
|
-
4,
|
|
2801
|
-
4,
|
|
2802
|
-
4,
|
|
2803
|
-
5,
|
|
2804
|
-
5,
|
|
2805
|
-
5,
|
|
2806
|
-
5,
|
|
2807
|
-
0
|
|
2808
|
-
], k = [
|
|
2809
|
-
0,
|
|
2810
|
-
0,
|
|
2811
|
-
0,
|
|
2812
|
-
0,
|
|
2813
|
-
1,
|
|
2814
|
-
1,
|
|
2815
|
-
2,
|
|
2816
|
-
2,
|
|
2817
|
-
3,
|
|
2818
|
-
3,
|
|
2819
|
-
4,
|
|
2820
|
-
4,
|
|
2821
|
-
5,
|
|
2822
|
-
5,
|
|
2823
|
-
6,
|
|
2824
|
-
6,
|
|
2825
|
-
7,
|
|
2826
|
-
7,
|
|
2827
|
-
8,
|
|
2828
|
-
8,
|
|
2829
|
-
9,
|
|
2830
|
-
9,
|
|
2831
|
-
10,
|
|
2832
|
-
10,
|
|
2833
|
-
11,
|
|
2834
|
-
11,
|
|
2835
|
-
12,
|
|
2836
|
-
12,
|
|
2837
|
-
13,
|
|
2838
|
-
13
|
|
2839
|
-
], x = [
|
|
2840
|
-
0,
|
|
2841
|
-
0,
|
|
2842
|
-
0,
|
|
2843
|
-
0,
|
|
2844
|
-
0,
|
|
2845
|
-
0,
|
|
2846
|
-
0,
|
|
2847
|
-
0,
|
|
2848
|
-
0,
|
|
2849
|
-
0,
|
|
2850
|
-
0,
|
|
2851
|
-
0,
|
|
2852
|
-
0,
|
|
2853
|
-
0,
|
|
2854
|
-
0,
|
|
2855
|
-
0,
|
|
2856
|
-
2,
|
|
2857
|
-
3,
|
|
2858
|
-
7
|
|
2859
|
-
], S = [
|
|
2860
|
-
16,
|
|
2861
|
-
17,
|
|
2862
|
-
18,
|
|
2863
|
-
0,
|
|
2864
|
-
8,
|
|
2865
|
-
7,
|
|
2866
|
-
9,
|
|
2867
|
-
6,
|
|
2868
|
-
10,
|
|
2869
|
-
5,
|
|
2870
|
-
11,
|
|
2871
|
-
4,
|
|
2872
|
-
12,
|
|
2873
|
-
3,
|
|
2874
|
-
13,
|
|
2875
|
-
2,
|
|
2876
|
-
14,
|
|
2877
|
-
1,
|
|
2878
|
-
15
|
|
2879
|
-
], z = new Array(2 * (l + 2));
|
|
2880
|
-
n(z);
|
|
2881
|
-
var C = new Array(2 * f);
|
|
2882
|
-
n(C);
|
|
2883
|
-
var E = new Array(512);
|
|
2884
|
-
n(E);
|
|
2885
|
-
var A = new Array(256);
|
|
2886
|
-
n(A);
|
|
2887
|
-
var I = new Array(a);
|
|
2888
|
-
n(I);
|
|
2889
|
-
var O, B, R, T = new Array(f);
|
|
2890
|
-
function D(e, t, r, n, i) {
|
|
2891
|
-
this.static_tree = e, this.extra_bits = t, this.extra_base = r, this.elems = n, this.max_length = i, this.has_stree = e && e.length;
|
|
2892
|
-
}
|
|
2893
|
-
function F(e, t) {
|
|
2894
|
-
this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
|
|
2895
|
-
}
|
|
2896
|
-
function N(e) {
|
|
2897
|
-
return e < 256 ? E[e] : E[256 + (e >>> 7)];
|
|
2898
|
-
}
|
|
2899
|
-
function U(e, t) {
|
|
2900
|
-
e.pending_buf[e.pending++] = 255 & t, e.pending_buf[e.pending++] = t >>> 8 & 255;
|
|
2901
|
-
}
|
|
2902
|
-
function P(e, t, r) {
|
|
2903
|
-
e.bi_valid > d - r ? (e.bi_buf |= t << e.bi_valid & 65535, U(e, e.bi_buf), e.bi_buf = t >> d - e.bi_valid, e.bi_valid += r - d) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += r);
|
|
2904
|
-
}
|
|
2905
|
-
function L(e, t, r) {
|
|
2906
|
-
P(e, r[2 * t], r[2 * t + 1]);
|
|
2907
|
-
}
|
|
2908
|
-
function j(e, t) {
|
|
2909
|
-
for (var r = 0; r |= 1 & e, e >>>= 1, r <<= 1, 0 < --t;);
|
|
2910
|
-
return r >>> 1;
|
|
2911
|
-
}
|
|
2912
|
-
function Z(e, t, r) {
|
|
2913
|
-
var n, i, s = new Array(g + 1), a = 0;
|
|
2914
|
-
for (n = 1; n <= g; n++) s[n] = a = a + r[n - 1] << 1;
|
|
2915
|
-
for (i = 0; i <= t; i++) {
|
|
2916
|
-
var o = e[2 * i + 1];
|
|
2917
|
-
0 !== o && (e[2 * i] = j(s[o]++, o));
|
|
2918
|
-
}
|
|
2919
|
-
}
|
|
2920
|
-
function W(e) {
|
|
2921
|
-
var t;
|
|
2922
|
-
for (t = 0; t < l; t++) e.dyn_ltree[2 * t] = 0;
|
|
2923
|
-
for (t = 0; t < f; t++) e.dyn_dtree[2 * t] = 0;
|
|
2924
|
-
for (t = 0; t < c; t++) e.bl_tree[2 * t] = 0;
|
|
2925
|
-
e.dyn_ltree[2 * m] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
|
|
2926
|
-
}
|
|
2927
|
-
function M(e) {
|
|
2928
|
-
8 < e.bi_valid ? U(e, e.bi_buf) : 0 < e.bi_valid && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
|
|
2929
|
-
}
|
|
2930
|
-
function H(e, t, r, n) {
|
|
2931
|
-
var i = 2 * t, s = 2 * r;
|
|
2932
|
-
return e[i] < e[s] || e[i] === e[s] && n[t] <= n[r];
|
|
2933
|
-
}
|
|
2934
|
-
function G(e, t, r) {
|
|
2935
|
-
for (var n = e.heap[r], i = r << 1; i <= e.heap_len && (i < e.heap_len && H(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !H(t, n, e.heap[i], e.depth));) e.heap[r] = e.heap[i], r = i, i <<= 1;
|
|
2936
|
-
e.heap[r] = n;
|
|
2937
|
-
}
|
|
2938
|
-
function K(e, t, r) {
|
|
2939
|
-
var n, i, s, a, o = 0;
|
|
2940
|
-
if (0 !== e.last_lit) for (; n = e.pending_buf[e.d_buf + 2 * o] << 8 | e.pending_buf[e.d_buf + 2 * o + 1], i = e.pending_buf[e.l_buf + o], o++, 0 === n ? L(e, i, t) : (L(e, (s = A[i]) + u + 1, t), 0 !== (a = w[s]) && P(e, i -= I[s], a), L(e, s = N(--n), r), 0 !== (a = k[s]) && P(e, n -= T[s], a)), o < e.last_lit;);
|
|
2941
|
-
L(e, m, t);
|
|
2942
|
-
}
|
|
2943
|
-
function Y(e, t) {
|
|
2944
|
-
var r, n, i, s = t.dyn_tree, a = t.stat_desc.static_tree, o = t.stat_desc.has_stree, h = t.stat_desc.elems, u = -1;
|
|
2945
|
-
for (e.heap_len = 0, e.heap_max = _, r = 0; r < h; r++) 0 !== s[2 * r] ? (e.heap[++e.heap_len] = u = r, e.depth[r] = 0) : s[2 * r + 1] = 0;
|
|
2946
|
-
for (; e.heap_len < 2;) s[2 * (i = e.heap[++e.heap_len] = u < 2 ? ++u : 0)] = 1, e.depth[i] = 0, e.opt_len--, o && (e.static_len -= a[2 * i + 1]);
|
|
2947
|
-
for (t.max_code = u, r = e.heap_len >> 1; 1 <= r; r--) G(e, s, r);
|
|
2948
|
-
for (i = h; r = e.heap[1], e.heap[1] = e.heap[e.heap_len--], G(e, s, 1), n = e.heap[1], e.heap[--e.heap_max] = r, e.heap[--e.heap_max] = n, s[2 * i] = s[2 * r] + s[2 * n], e.depth[i] = (e.depth[r] >= e.depth[n] ? e.depth[r] : e.depth[n]) + 1, s[2 * r + 1] = s[2 * n + 1] = i, e.heap[1] = i++, G(e, s, 1), 2 <= e.heap_len;);
|
|
2949
|
-
e.heap[--e.heap_max] = e.heap[1], function(e, t) {
|
|
2950
|
-
var r, n, i, s, a, o, h = t.dyn_tree, u = t.max_code, l = t.stat_desc.static_tree, f = t.stat_desc.has_stree, c = t.stat_desc.extra_bits, d = t.stat_desc.extra_base, p = t.stat_desc.max_length, m = 0;
|
|
2951
|
-
for (s = 0; s <= g; s++) e.bl_count[s] = 0;
|
|
2952
|
-
for (h[2 * e.heap[e.heap_max] + 1] = 0, r = e.heap_max + 1; r < _; r++) p < (s = h[2 * h[2 * (n = e.heap[r]) + 1] + 1] + 1) && (s = p, m++), h[2 * n + 1] = s, u < n || (e.bl_count[s]++, a = 0, d <= n && (a = c[n - d]), o = h[2 * n], e.opt_len += o * (s + a), f && (e.static_len += o * (l[2 * n + 1] + a)));
|
|
2953
|
-
if (0 !== m) {
|
|
2954
|
-
do {
|
|
2955
|
-
for (s = p - 1; 0 === e.bl_count[s];) s--;
|
|
2956
|
-
e.bl_count[s]--, e.bl_count[s + 1] += 2, e.bl_count[p]--, m -= 2;
|
|
2957
|
-
} while (0 < m);
|
|
2958
|
-
for (s = p; 0 !== s; s--) for (n = e.bl_count[s]; 0 !== n;) u < (i = e.heap[--r]) || (h[2 * i + 1] !== s && (e.opt_len += (s - h[2 * i + 1]) * h[2 * i], h[2 * i + 1] = s), n--);
|
|
2959
|
-
}
|
|
2960
|
-
}(e, t), Z(s, u, e.bl_count);
|
|
2961
|
-
}
|
|
2962
|
-
function X(e, t, r) {
|
|
2963
|
-
var n, i, s = -1, a = t[1], o = 0, h = 7, u = 4;
|
|
2964
|
-
for (0 === a && (h = 138, u = 3), t[2 * (r + 1) + 1] = 65535, n = 0; n <= r; n++) i = a, a = t[2 * (n + 1) + 1], ++o < h && i === a || (o < u ? e.bl_tree[2 * i] += o : 0 !== i ? (i !== s && e.bl_tree[2 * i]++, e.bl_tree[2 * b]++) : o <= 10 ? e.bl_tree[2 * v]++ : e.bl_tree[2 * y]++, s = i, u = (o = 0) === a ? (h = 138, 3) : i === a ? (h = 6, 3) : (h = 7, 4));
|
|
2965
|
-
}
|
|
2966
|
-
function V(e, t, r) {
|
|
2967
|
-
var n, i, s = -1, a = t[1], o = 0, h = 7, u = 4;
|
|
2968
|
-
for (0 === a && (h = 138, u = 3), n = 0; n <= r; n++) if (i = a, a = t[2 * (n + 1) + 1], !(++o < h && i === a)) {
|
|
2969
|
-
if (o < u) for (; L(e, i, e.bl_tree), 0 != --o;);
|
|
2970
|
-
else 0 !== i ? (i !== s && (L(e, i, e.bl_tree), o--), L(e, b, e.bl_tree), P(e, o - 3, 2)) : o <= 10 ? (L(e, v, e.bl_tree), P(e, o - 3, 3)) : (L(e, y, e.bl_tree), P(e, o - 11, 7));
|
|
2971
|
-
s = i, u = (o = 0) === a ? (h = 138, 3) : i === a ? (h = 6, 3) : (h = 7, 4);
|
|
2972
|
-
}
|
|
2973
|
-
}
|
|
2974
|
-
n(T);
|
|
2975
|
-
var q = !1;
|
|
2976
|
-
function J(e, t, r, n) {
|
|
2977
|
-
P(e, (s << 1) + (n ? 1 : 0), 3), function(e, t, r, n) {
|
|
2978
|
-
M(e), n && (U(e, r), U(e, ~r)), i.arraySet(e.pending_buf, e.window, t, r, e.pending), e.pending += r;
|
|
2979
|
-
}(e, t, r, !0);
|
|
2980
|
-
}
|
|
2981
|
-
r._tr_init = function(e) {
|
|
2982
|
-
q || (function() {
|
|
2983
|
-
var e, t, r, n, i, s = new Array(g + 1);
|
|
2984
|
-
for (n = r = 0; n < a - 1; n++) for (I[n] = r, e = 0; e < 1 << w[n]; e++) A[r++] = n;
|
|
2985
|
-
for (A[r - 1] = n, n = i = 0; n < 16; n++) for (T[n] = i, e = 0; e < 1 << k[n]; e++) E[i++] = n;
|
|
2986
|
-
for (i >>= 7; n < f; n++) for (T[n] = i << 7, e = 0; e < 1 << k[n] - 7; e++) E[256 + i++] = n;
|
|
2987
|
-
for (t = 0; t <= g; t++) s[t] = 0;
|
|
2988
|
-
for (e = 0; e <= 143;) z[2 * e + 1] = 8, e++, s[8]++;
|
|
2989
|
-
for (; e <= 255;) z[2 * e + 1] = 9, e++, s[9]++;
|
|
2990
|
-
for (; e <= 279;) z[2 * e + 1] = 7, e++, s[7]++;
|
|
2991
|
-
for (; e <= 287;) z[2 * e + 1] = 8, e++, s[8]++;
|
|
2992
|
-
for (Z(z, l + 1, s), e = 0; e < f; e++) C[2 * e + 1] = 5, C[2 * e] = j(e, 5);
|
|
2993
|
-
O = new D(z, w, u + 1, l, g), B = new D(C, k, 0, f, g), R = new D(new Array(0), x, 0, c, p);
|
|
2994
|
-
}(), q = !0), e.l_desc = new F(e.dyn_ltree, O), e.d_desc = new F(e.dyn_dtree, B), e.bl_desc = new F(e.bl_tree, R), e.bi_buf = 0, e.bi_valid = 0, W(e);
|
|
2995
|
-
}, r._tr_stored_block = J, r._tr_flush_block = function(e, t, r, n) {
|
|
2996
|
-
var i, s, a = 0;
|
|
2997
|
-
0 < e.level ? (2 === e.strm.data_type && (e.strm.data_type = function(e) {
|
|
2998
|
-
var t, r = 4093624447;
|
|
2999
|
-
for (t = 0; t <= 31; t++, r >>>= 1) if (1 & r && 0 !== e.dyn_ltree[2 * t]) return o;
|
|
3000
|
-
if (0 !== e.dyn_ltree[18] || 0 !== e.dyn_ltree[20] || 0 !== e.dyn_ltree[26]) return h;
|
|
3001
|
-
for (t = 32; t < u; t++) if (0 !== e.dyn_ltree[2 * t]) return h;
|
|
3002
|
-
return o;
|
|
3003
|
-
}(e)), Y(e, e.l_desc), Y(e, e.d_desc), a = function(e) {
|
|
3004
|
-
var t;
|
|
3005
|
-
for (X(e, e.dyn_ltree, e.l_desc.max_code), X(e, e.dyn_dtree, e.d_desc.max_code), Y(e, e.bl_desc), t = c - 1; 3 <= t && 0 === e.bl_tree[2 * S[t] + 1]; t--);
|
|
3006
|
-
return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
|
|
3007
|
-
}(e), i = e.opt_len + 3 + 7 >>> 3, (s = e.static_len + 3 + 7 >>> 3) <= i && (i = s)) : i = s = r + 5, r + 4 <= i && -1 !== t ? J(e, t, r, n) : 4 === e.strategy || s === i ? (P(e, 2 + (n ? 1 : 0), 3), K(e, z, C)) : (P(e, 4 + (n ? 1 : 0), 3), function(e, t, r, n) {
|
|
3008
|
-
var i;
|
|
3009
|
-
for (P(e, t - 257, 5), P(e, r - 1, 5), P(e, n - 4, 4), i = 0; i < n; i++) P(e, e.bl_tree[2 * S[i] + 1], 3);
|
|
3010
|
-
V(e, e.dyn_ltree, t - 1), V(e, e.dyn_dtree, r - 1);
|
|
3011
|
-
}(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, a + 1), K(e, e.dyn_ltree, e.dyn_dtree)), W(e), n && M(e);
|
|
3012
|
-
}, r._tr_tally = function(e, t, r) {
|
|
3013
|
-
return e.pending_buf[e.d_buf + 2 * e.last_lit] = t >>> 8 & 255, e.pending_buf[e.d_buf + 2 * e.last_lit + 1] = 255 & t, e.pending_buf[e.l_buf + e.last_lit] = 255 & r, e.last_lit++, 0 === t ? e.dyn_ltree[2 * r]++ : (e.matches++, t--, e.dyn_ltree[2 * (A[r] + u + 1)]++, e.dyn_dtree[2 * N(t)]++), e.last_lit === e.lit_bufsize - 1;
|
|
3014
|
-
}, r._tr_align = function(e) {
|
|
3015
|
-
P(e, 2, 3), L(e, m, z), function(e) {
|
|
3016
|
-
16 === e.bi_valid ? (U(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : 8 <= e.bi_valid && (e.pending_buf[e.pending++] = 255 & e.bi_buf, e.bi_buf >>= 8, e.bi_valid -= 8);
|
|
3017
|
-
}(e);
|
|
3018
|
-
};
|
|
3019
|
-
}, { "../utils/common": 41 }],
|
|
3020
|
-
53: [function(e, t, r) {
|
|
3021
|
-
"use strict";
|
|
3022
|
-
t.exports = function() {
|
|
3023
|
-
this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
|
|
3024
|
-
};
|
|
3025
|
-
}, {}],
|
|
3026
|
-
54: [function(e, t, r) {
|
|
3027
|
-
(function(e) {
|
|
3028
|
-
(function(r, n) {
|
|
3029
|
-
"use strict";
|
|
3030
|
-
if (!r.setImmediate) {
|
|
3031
|
-
var i, s, t, a, o = 1, h = {}, u = !1, l = r.document, e = Object.getPrototypeOf && Object.getPrototypeOf(r);
|
|
3032
|
-
e = e && e.setTimeout ? e : r, i = "[object process]" === {}.toString.call(r.process) ? function(e) {
|
|
3033
|
-
process.nextTick(function() {
|
|
3034
|
-
c(e);
|
|
3035
|
-
});
|
|
3036
|
-
} : function() {
|
|
3037
|
-
if (r.postMessage && !r.importScripts) {
|
|
3038
|
-
var e = !0, t = r.onmessage;
|
|
3039
|
-
return r.onmessage = function() {
|
|
3040
|
-
e = !1;
|
|
3041
|
-
}, r.postMessage("", "*"), r.onmessage = t, e;
|
|
3042
|
-
}
|
|
3043
|
-
}() ? (a = "setImmediate$" + Math.random() + "$", r.addEventListener ? r.addEventListener("message", d, !1) : r.attachEvent("onmessage", d), function(e) {
|
|
3044
|
-
r.postMessage(a + e, "*");
|
|
3045
|
-
}) : r.MessageChannel ? ((t = new MessageChannel()).port1.onmessage = function(e) {
|
|
3046
|
-
c(e.data);
|
|
3047
|
-
}, function(e) {
|
|
3048
|
-
t.port2.postMessage(e);
|
|
3049
|
-
}) : l && "onreadystatechange" in l.createElement("script") ? (s = l.documentElement, function(e) {
|
|
3050
|
-
var t = l.createElement("script");
|
|
3051
|
-
t.onreadystatechange = function() {
|
|
3052
|
-
c(e), t.onreadystatechange = null, s.removeChild(t), t = null;
|
|
3053
|
-
}, s.appendChild(t);
|
|
3054
|
-
}) : function(e) {
|
|
3055
|
-
setTimeout(c, 0, e);
|
|
3056
|
-
}, e.setImmediate = function(e) {
|
|
3057
|
-
"function" != typeof e && (e = new Function("" + e));
|
|
3058
|
-
for (var t = new Array(arguments.length - 1), r = 0; r < t.length; r++) t[r] = arguments[r + 1];
|
|
3059
|
-
return h[o] = {
|
|
3060
|
-
callback: e,
|
|
3061
|
-
args: t
|
|
3062
|
-
}, i(o), o++;
|
|
3063
|
-
}, e.clearImmediate = f;
|
|
3064
|
-
}
|
|
3065
|
-
function f(e) {
|
|
3066
|
-
delete h[e];
|
|
3067
|
-
}
|
|
3068
|
-
function c(e) {
|
|
3069
|
-
if (u) setTimeout(c, 0, e);
|
|
3070
|
-
else {
|
|
3071
|
-
var t = h[e];
|
|
3072
|
-
if (t) {
|
|
3073
|
-
u = !0;
|
|
3074
|
-
try {
|
|
3075
|
-
(function(e) {
|
|
3076
|
-
var t = e.callback, r = e.args;
|
|
3077
|
-
switch (r.length) {
|
|
3078
|
-
case 0:
|
|
3079
|
-
t();
|
|
3080
|
-
break;
|
|
3081
|
-
case 1:
|
|
3082
|
-
t(r[0]);
|
|
3083
|
-
break;
|
|
3084
|
-
case 2:
|
|
3085
|
-
t(r[0], r[1]);
|
|
3086
|
-
break;
|
|
3087
|
-
case 3:
|
|
3088
|
-
t(r[0], r[1], r[2]);
|
|
3089
|
-
break;
|
|
3090
|
-
default: t.apply(n, r);
|
|
3091
|
-
}
|
|
3092
|
-
})(t);
|
|
3093
|
-
} finally {
|
|
3094
|
-
f(e), u = !1;
|
|
3095
|
-
}
|
|
3096
|
-
}
|
|
3097
|
-
}
|
|
3098
|
-
}
|
|
3099
|
-
function d(e) {
|
|
3100
|
-
e.source === r && "string" == typeof e.data && 0 === e.data.indexOf(a) && c(+e.data.slice(a.length));
|
|
3101
|
-
}
|
|
3102
|
-
})("undefined" == typeof self ? void 0 === e ? this : e : self);
|
|
3103
|
-
}).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {});
|
|
3104
|
-
}, {}]
|
|
3105
|
-
}, {}, [10])(10);
|
|
3106
|
-
});
|
|
3107
|
-
}));
|
|
3108
|
-
//#endregion
|
|
3109
|
-
export default require_jszip_min();
|
|
3110
|
-
export { require_jszip_min };
|