@corellium/corellium-cli 1.0.2 → 1.0.4
Sign up to get free protection for your applications and to get access to all the features.
- package/README.md +4 -16
- package/docs/OVERVIEW.md +2 -2
- package/example/WebPlayerSample.js +93 -37
- package/jenkinsbuild/build.sh +1 -1
- package/node_modules/@babel/cli/node_modules/commander/package.json +27 -58
- package/node_modules/@babel/cli/node_modules/make-dir/package.json +62 -93
- package/node_modules/@babel/cli/node_modules/pify/package.json +54 -85
- package/node_modules/@babel/cli/node_modules/semver/package.json +20 -51
- package/node_modules/@babel/cli/node_modules/slash/package.json +37 -68
- package/node_modules/@babel/cli/package.json +37 -69
- package/node_modules/@corellium/client-api/package.json +15 -40
- package/node_modules/@jridgewell/resolve-uri/package.json +40 -75
- package/node_modules/@jridgewell/sourcemap-codec/package.json +43 -74
- package/node_modules/@jridgewell/trace-mapping/package.json +40 -72
- package/node_modules/@mapbox/node-pre-gyp/package.json +27 -61
- package/node_modules/@nicolo-ribaudo/chokidar-2/package.json +22 -55
- package/node_modules/abbrev/package.json +18 -52
- package/node_modules/agent-base/package.json +33 -62
- package/node_modules/ansi-regex/package.json +58 -89
- package/node_modules/ansi-styles/package.json +59 -95
- package/node_modules/anymatch/package.json +28 -56
- package/node_modules/aproba/package.json +23 -50
- package/node_modules/are-we-there-yet/node_modules/readable-stream/package.json +32 -60
- package/node_modules/are-we-there-yet/package.json +32 -62
- package/node_modules/ascii-art/package.json +51 -83
- package/node_modules/ascii-art-ansi/package.json +30 -61
- package/node_modules/ascii-art-braille/package.json +7 -32
- package/node_modules/ascii-art-font/package.json +17 -47
- package/node_modules/ascii-art-graph/package.json +10 -34
- package/node_modules/ascii-art-image/node_modules/ascii-art-braille/package.json +7 -32
- package/node_modules/ascii-art-image/package.json +11 -36
- package/node_modules/ascii-art-table/package.json +10 -35
- package/node_modules/ascii-art-utf/package.json +18 -47
- package/node_modules/async/package.json +29 -55
- package/node_modules/async-arrays/package.json +34 -62
- package/node_modules/asynckit/package.json +45 -74
- package/node_modules/axios/package.json +46 -72
- package/node_modules/balanced-match/package.json +22 -49
- package/node_modules/binary-extensions/package.json +41 -73
- package/node_modules/brace-expansion/package.json +23 -50
- package/node_modules/braces/package.json +30 -76
- package/node_modules/call-bind/package.json +83 -125
- package/node_modules/canvas/package.json +43 -86
- package/node_modules/chokidar/package.json +40 -74
- package/node_modules/chownr/package.json +24 -56
- package/node_modules/cli/package.json +23 -70
- package/node_modules/cliui/package.json +53 -87
- package/node_modules/color/node_modules/color-convert/package.json +26 -60
- package/node_modules/color/node_modules/color-name/package.json +18 -45
- package/node_modules/color/package.json +26 -57
- package/node_modules/color-convert/package.json +25 -59
- package/node_modules/color-difference/package.json +26 -52
- package/node_modules/color-model/package.json +17 -44
- package/node_modules/color-name/package.json +32 -60
- package/node_modules/color-string/package.json +26 -67
- package/node_modules/color-support/package.json +26 -60
- package/node_modules/combined-stream/package.json +19 -52
- package/node_modules/component-emitter/package.json +17 -45
- package/node_modules/concat-map/package.json +45 -89
- package/node_modules/console-control-strings/package.json +22 -55
- package/node_modules/convert-source-map/package.json +28 -55
- package/node_modules/cookiejar/package.json +16 -44
- package/node_modules/core-util-is/package.json +21 -51
- package/node_modules/d3/package.json +43 -70
- package/node_modules/d3-array/package.json +24 -55
- package/node_modules/d3-axis/package.json +27 -54
- package/node_modules/d3-brush/package.json +33 -60
- package/node_modules/d3-chord/package.json +28 -55
- package/node_modules/d3-collection/package.json +25 -54
- package/node_modules/d3-color/package.json +2 -2
- package/node_modules/d3-contour/package.json +27 -54
- package/node_modules/d3-dispatch/package.json +28 -60
- package/node_modules/d3-drag/package.json +32 -61
- package/node_modules/d3-dsv/node_modules/commander/package.json +25 -56
- package/node_modules/d3-dsv/package.json +36 -64
- package/node_modules/d3-ease/package.json +28 -56
- package/node_modules/d3-fetch/package.json +31 -58
- package/node_modules/d3-force/package.json +30 -57
- package/node_modules/d3-format/package.json +29 -57
- package/node_modules/d3-geo/package.json +35 -62
- package/node_modules/d3-hierarchy/package.json +33 -60
- package/node_modules/d3-interpolate/package.json +31 -63
- package/node_modules/d3-path/package.json +28 -57
- package/node_modules/d3-polygon/package.json +28 -55
- package/node_modules/d3-quadtree/package.json +29 -57
- package/node_modules/d3-random/package.json +26 -53
- package/node_modules/d3-scale/package.json +29 -56
- package/node_modules/d3-scale-chromatic/package.json +33 -60
- package/node_modules/d3-selection/package.json +29 -60
- package/node_modules/d3-shape/package.json +32 -59
- package/node_modules/d3-time/package.json +28 -57
- package/node_modules/d3-time-format/package.json +33 -61
- package/node_modules/d3-timer/package.json +28 -57
- package/node_modules/d3-transition/package.json +35 -64
- package/node_modules/d3-voronoi/package.json +24 -51
- package/node_modules/d3-zoom/package.json +34 -61
- package/node_modules/debug/package.json +37 -87
- package/node_modules/decompress-response/package.json +53 -84
- package/node_modules/delayed-stream/package.json +19 -53
- package/node_modules/delegates/package.json +11 -45
- package/node_modules/detect-libc/package.json +26 -60
- package/node_modules/dirname-shim/package.json +26 -60
- package/node_modules/dotenv/package.json +37 -64
- package/node_modules/duplexer/package.json +18 -49
- package/node_modules/emoji-regex/package.json +32 -58
- package/node_modules/escalade/package.json +28 -59
- package/node_modules/extended-emitter/package.json +37 -65
- package/node_modules/fast-safe-stringify/package.json +33 -73
- package/node_modules/fill-range/package.json +28 -72
- package/node_modules/follow-redirects/package.json +42 -77
- package/node_modules/form-data/package.json +42 -74
- package/node_modules/formidable/package.json +22 -52
- package/node_modules/fs-minipass/package.json +24 -52
- package/node_modules/fs-readdir-recursive/package.json +20 -50
- package/node_modules/fs.realpath/package.json +21 -53
- package/node_modules/fsevents/package.json +38 -63
- package/node_modules/ftp-response-parser/node_modules/isarray/package.json +22 -54
- package/node_modules/ftp-response-parser/node_modules/readable-stream/package.json +22 -55
- package/node_modules/ftp-response-parser/node_modules/string_decoder/package.json +17 -45
- package/node_modules/ftp-response-parser/package.json +23 -64
- package/node_modules/function-bind/package.json +28 -61
- package/node_modules/gauge/package.json +25 -52
- package/node_modules/generate-password/package.json +28 -54
- package/node_modules/get-caller-file/package.json +27 -53
- package/node_modules/get-intrinsic/package.json +91 -124
- package/node_modules/glob/package.json +34 -68
- package/node_modules/glob-parent/package.json +27 -70
- package/node_modules/has/package.json +26 -55
- package/node_modules/has-symbols/package.json +104 -133
- package/node_modules/has-unicode/package.json +25 -52
- package/node_modules/https-proxy-agent/package.json +30 -59
- package/node_modules/iconv-lite/package.json +48 -77
- package/node_modules/inflight/package.json +20 -48
- package/node_modules/inherits/package.json +17 -54
- package/node_modules/is-binary-path/package.json +43 -75
- package/node_modules/is-extglob/package.json +22 -52
- package/node_modules/is-fullwidth-code-point/package.json +45 -79
- package/node_modules/is-glob/package.json +26 -68
- package/node_modules/is-number/package.json +26 -65
- package/node_modules/jsftp/node_modules/debug/package.json +28 -67
- package/node_modules/jsftp/package.json +22 -59
- package/node_modules/json2csv/node_modules/commander/package.json +25 -56
- package/node_modules/json2csv/package.json +37 -64
- package/node_modules/jsonparse/package.json +18 -53
- package/node_modules/lodash/package.json +15 -61
- package/node_modules/lodash.get/package.json +16 -67
- package/node_modules/lru-cache/package.json +27 -61
- package/node_modules/make-dir/node_modules/semver/package.json +20 -51
- package/node_modules/make-dir/package.json +62 -93
- package/node_modules/maplex/package.json +22 -54
- package/node_modules/methods/package.json +22 -64
- package/node_modules/mime/package.json +20 -48
- package/node_modules/mime-db/package.json +25 -67
- package/node_modules/mime-types/package.json +20 -64
- package/node_modules/mimic-response/package.json +45 -76
- package/node_modules/minimatch/package.json +25 -61
- package/node_modules/minipass/package.json +30 -64
- package/node_modules/minizlib/package.json +27 -59
- package/node_modules/mkdirp/package.json +27 -57
- package/node_modules/ms/package.json +24 -58
- package/node_modules/multi-progress/package.json +20 -46
- package/node_modules/nan/package.json +27 -87
- package/node_modules/node-fetch/package.json +77 -104
- package/node_modules/nopt/package.json +22 -54
- package/node_modules/normalize-path/package.json +25 -63
- package/node_modules/npmlog/package.json +23 -55
- package/node_modules/object-assign/package.json +20 -51
- package/node_modules/object-inspect/package.json +53 -81
- package/node_modules/once/package.json +19 -56
- package/node_modules/parse-listing/package.json +27 -56
- package/node_modules/path-is-absolute/package.json +16 -47
- package/node_modules/picomatch/package.json +28 -60
- package/node_modules/progress/package.json +21 -65
- package/node_modules/qs/package.json +78 -105
- package/node_modules/readdirp/package.json +47 -83
- package/node_modules/require-directory/package.json +29 -57
- package/node_modules/rimraf/package.json +23 -61
- package/node_modules/rw/package.json +19 -46
- package/node_modules/safe-buffer/package.json +10 -38
- package/node_modules/safer-buffer/package.json +18 -43
- package/node_modules/semver/package.json +36 -70
- package/node_modules/set-blocking/package.json +29 -56
- package/node_modules/side-channel/package.json +70 -98
- package/node_modules/sift/package.json +30 -62
- package/node_modules/signal-exit/package.json +29 -58
- package/node_modules/simple-concat/package.json +22 -46
- package/node_modules/simple-get/package.json +9 -33
- package/node_modules/simple-swizzle/node_modules/is-arrayish/package.json +28 -59
- package/node_modules/simple-swizzle/package.json +23 -57
- package/node_modules/strangler/package.json +39 -67
- package/node_modules/stream-combiner/package.json +15 -48
- package/node_modules/string-tools/package.json +16 -50
- package/node_modules/string-width/package.json +59 -97
- package/node_modules/string_decoder/package.json +18 -47
- package/node_modules/strip-ansi/package.json +57 -94
- package/node_modules/superagent/node_modules/form-data/package.json +42 -74
- package/node_modules/superagent/node_modules/readable-stream/package.json +32 -60
- package/node_modules/superagent/package.json +13 -59
- package/node_modules/tar/package.json +27 -59
- package/node_modules/through/package.json +17 -50
- package/node_modules/to-regex-range/package.json +25 -61
- package/node_modules/tr46/package.json +24 -51
- package/node_modules/unorm/package.json +34 -75
- package/node_modules/util-deprecate/package.json +19 -49
- package/node_modules/uuid/package.json +74 -102
- package/node_modules/webidl-conversions/package.json +18 -53
- package/node_modules/whatwg-url/package.json +15 -49
- package/node_modules/wide-align/package.json +21 -53
- package/node_modules/wolfy87-eventemitter/package.json +25 -49
- package/node_modules/wrap-ansi/package.json +65 -97
- package/node_modules/wrappy/package.json +21 -50
- package/node_modules/y18n/package.json +43 -73
- package/node_modules/yallist/package.json +20 -55
- package/node_modules/yargs/package.json +72 -99
- package/node_modules/yargs-parser/package.json +52 -83
- package/package.json +2 -3
- package/src/TrialAccount.js +76 -0
- package/src/commands/agent/Agent.js +10 -19
- package/src/commands/agent/index.js +1 -0
- package/src/commands/agent/ready.js +42 -0
- package/src/commands/instances/list.js +8 -3
- package/src/commands/signup.js +14 -5
- package/src/commands/webplayer/WebPlayer.js +2 -1
- package/src/commands/webplayer/create.js +6 -0
- package/src/commands/webplayer/list.js +17 -16
- package/src/logging.js +1 -1
- package/src/profile.js +12 -9
- package/src/resumable.js +1314 -0
- package/src/table.js +7 -2
- package/src/upload.js +64 -2
- package/test/test.js +89 -0
- package/node_modules/@corellium/corellium-api/README.md +0 -1210
- package/node_modules/@corellium/corellium-api/node_modules/form-data/License +0 -19
- package/node_modules/@corellium/corellium-api/node_modules/form-data/README.md.bak +0 -356
- package/node_modules/@corellium/corellium-api/node_modules/form-data/Readme.md +0 -356
- package/node_modules/@corellium/corellium-api/node_modules/form-data/index.d.ts +0 -62
- package/node_modules/@corellium/corellium-api/node_modules/form-data/lib/browser.js +0 -2
- package/node_modules/@corellium/corellium-api/node_modules/form-data/lib/form_data.js +0 -498
- package/node_modules/@corellium/corellium-api/node_modules/form-data/lib/populate.js +0 -10
- package/node_modules/@corellium/corellium-api/node_modules/form-data/package.json +0 -104
- package/node_modules/@corellium/corellium-api/node_modules/uuid/AUTHORS +0 -5
- package/node_modules/@corellium/corellium-api/node_modules/uuid/CHANGELOG.md +0 -119
- package/node_modules/@corellium/corellium-api/node_modules/uuid/LICENSE.md +0 -21
- package/node_modules/@corellium/corellium-api/node_modules/uuid/README.md +0 -276
- package/node_modules/@corellium/corellium-api/node_modules/uuid/bin/uuid +0 -65
- package/node_modules/@corellium/corellium-api/node_modules/uuid/index.js +0 -8
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/bytesToUuid.js +0 -26
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/md5-browser.js +0 -216
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/md5.js +0 -25
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/rng-browser.js +0 -34
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/rng.js +0 -8
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/sha1-browser.js +0 -89
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/sha1.js +0 -25
- package/node_modules/@corellium/corellium-api/node_modules/uuid/lib/v35.js +0 -57
- package/node_modules/@corellium/corellium-api/node_modules/uuid/package.json +0 -103
- package/node_modules/@corellium/corellium-api/node_modules/uuid/v1.js +0 -109
- package/node_modules/@corellium/corellium-api/node_modules/uuid/v3.js +0 -4
- package/node_modules/@corellium/corellium-api/node_modules/uuid/v4.js +0 -29
- package/node_modules/@corellium/corellium-api/node_modules/uuid/v5.js +0 -3
- package/node_modules/@corellium/corellium-api/package.json +0 -106
- package/node_modules/@corellium/corellium-api/resumable.js +0 -1312
- package/node_modules/@corellium/corellium-api/src/agent.js +0 -962
- package/node_modules/@corellium/corellium-api/src/corellium.js +0 -444
- package/node_modules/@corellium/corellium-api/src/images.js +0 -131
- package/node_modules/@corellium/corellium-api/src/input.js +0 -178
- package/node_modules/@corellium/corellium-api/src/instance-updater.js +0 -56
- package/node_modules/@corellium/corellium-api/src/instance.js +0 -1031
- package/node_modules/@corellium/corellium-api/src/netmon.js +0 -308
- package/node_modules/@corellium/corellium-api/src/project.js +0 -393
- package/node_modules/@corellium/corellium-api/src/role.js +0 -65
- package/node_modules/@corellium/corellium-api/src/snapshot.js +0 -77
- package/node_modules/@corellium/corellium-api/src/team.js +0 -29
- package/node_modules/@corellium/corellium-api/src/user.js +0 -51
- package/node_modules/@corellium/corellium-api/src/util/fetch.js +0 -62
- package/node_modules/@corellium/corellium-api/src/util/sleep.js +0 -7
- package/node_modules/@corellium/corellium-api/test/integration-tests.js +0 -1292
- package/node_modules/@corellium/corellium-api/test/root-hook-set-flag-if-test-failed.js +0 -7
- package/node_modules/async-limiter/.eslintignore +0 -2
- package/node_modules/async-limiter/.nycrc +0 -10
- package/node_modules/async-limiter/.travis.yml +0 -9
- package/node_modules/async-limiter/LICENSE +0 -8
- package/node_modules/async-limiter/index.js +0 -67
- package/node_modules/async-limiter/package.json +0 -72
- package/node_modules/async-limiter/readme.md +0 -132
- package/node_modules/buffer-crc32/LICENSE +0 -19
- package/node_modules/buffer-crc32/README.md +0 -47
- package/node_modules/buffer-crc32/index.js +0 -111
- package/node_modules/buffer-crc32/package.json +0 -72
- package/node_modules/cross-fetch/LICENSE +0 -21
- package/node_modules/cross-fetch/README.md +0 -169
- package/node_modules/cross-fetch/dist/browser-polyfill.js +0 -532
- package/node_modules/cross-fetch/dist/browser-ponyfill.js +0 -554
- package/node_modules/cross-fetch/dist/cross-fetch.js +0 -2
- package/node_modules/cross-fetch/dist/cross-fetch.js.map +0 -1
- package/node_modules/cross-fetch/dist/node-polyfill.js +0 -11
- package/node_modules/cross-fetch/dist/node-ponyfill.js +0 -22
- package/node_modules/cross-fetch/dist/react-native-polyfill.js +0 -12
- package/node_modules/cross-fetch/dist/react-native-ponyfill.js +0 -6
- package/node_modules/cross-fetch/index.d.ts +0 -14
- package/node_modules/cross-fetch/package.json +0 -160
- package/node_modules/cross-fetch/polyfill/package.json +0 -8
- package/node_modules/duplexify/.travis.yml +0 -6
- package/node_modules/duplexify/LICENSE +0 -21
- package/node_modules/duplexify/README.md +0 -97
- package/node_modules/duplexify/example.js +0 -21
- package/node_modules/duplexify/index.js +0 -234
- package/node_modules/duplexify/package.json +0 -69
- package/node_modules/duplexify/test.js +0 -295
- package/node_modules/end-of-stream/LICENSE +0 -21
- package/node_modules/end-of-stream/README.md +0 -54
- package/node_modules/end-of-stream/index.js +0 -94
- package/node_modules/end-of-stream/package.json +0 -69
- package/node_modules/fast-stable-stringify/.npmignore +0 -4
- package/node_modules/fast-stable-stringify/.travis.yml +0 -10
- package/node_modules/fast-stable-stringify/LICENSE +0 -21
- package/node_modules/fast-stable-stringify/README.md +0 -81
- package/node_modules/fast-stable-stringify/cli/files-to-comparison-results.js +0 -67
- package/node_modules/fast-stable-stringify/cli/format-table.js +0 -70
- package/node_modules/fast-stable-stringify/cli/index.js +0 -19
- package/node_modules/fast-stable-stringify/fixtures/index.js +0 -5
- package/node_modules/fast-stable-stringify/fixtures/input-data-types.js +0 -191
- package/node_modules/fast-stable-stringify/fixtures/log-result.json +0 -22
- package/node_modules/fast-stable-stringify/fixtures/log.txt +0 -24
- package/node_modules/fast-stable-stringify/index.js +0 -73
- package/node_modules/fast-stable-stringify/karma.conf.js +0 -124
- package/node_modules/fast-stable-stringify/karma.conf.travis.js +0 -95
- package/node_modules/fast-stable-stringify/package.json +0 -77
- package/node_modules/fast-stable-stringify/results/escape-long/Chrome 60.0.3112 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/Chrome Mobile 55.0.2883 (Android 6.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/Edge 14.14393.0 (Windows 10 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/Firefox 54.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/IE 10.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/IE 11.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/IE 9.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/Mobile Safari 10.0.0 (iOS 10.3.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-long/Safari 10.0.1 (Mac OS X 10.12.1).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/Chrome 60.0.3112 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/Chrome Mobile 55.0.2883 (Android 6.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/Edge 14.14393.0 (Windows 10 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/Firefox 54.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/IE 10.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/IE 11.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/IE 9.0.0 (Windows 7 0.0.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/Mobile Safari 10.0.0 (iOS 10.3.0).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape-short/Safari 10.0.1 (Mac OS X 10.12.1).json +0 -57
- package/node_modules/fast-stable-stringify/results/escape.md +0 -20
- package/node_modules/fast-stable-stringify/results/itar-long/Chrome 60.0.3112 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/Chrome Mobile 55.0.2883 (Android 6.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/Edge 14.14393.0 (Windows 10 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/Firefox 54.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/IE 10.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/IE 11.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/IE 9.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/Mobile Safari 10.0.0 (iOS 10.3.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-long/Safari 10.0.1 (Mac OS X 10.12.1).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/Chrome 60.0.3112 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/Chrome Mobile 55.0.2883 (Android 6.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/Edge 14.14393.0 (Windows 10 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/Firefox 54.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/IE 10.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/IE 11.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/IE 9.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/Mobile Safari 10.0.0 (iOS 10.3.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar-short/Safari 10.0.1 (Mac OS X 10.12.1).json +0 -35
- package/node_modules/fast-stable-stringify/results/itar.md +0 -20
- package/node_modules/fast-stable-stringify/results/iter/Chrome 60.0.3112 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Chrome Mobile 39.0.0 (Android 5.1.1).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Chrome Mobile 55.0.2883 (Android 6.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Edge 14.14393.0 (Windows 10 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Firefox 54.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/IE 10.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/IE 11.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/IE 9.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Mobile Safari 10.0.0 (iOS 10.3.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Mobile Safari 9.0.0 (iOS 9.2.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Safari 10.0.1 (Mac OS X 10.12.1).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter/Safari 9.1.2 (Mac OS X 10.11.6).json +0 -35
- package/node_modules/fast-stable-stringify/results/iter.md +0 -14
- package/node_modules/fast-stable-stringify/results/libs/Chrome 60.0.3112 (Windows 7 0.0.0).json +0 -46
- package/node_modules/fast-stable-stringify/results/libs/Chrome Mobile 55.0.2883 (Android 6.0.0).json +0 -46
- package/node_modules/fast-stable-stringify/results/libs/Edge 14.14393.0 (Windows 10 0.0.0).json +0 -46
- package/node_modules/fast-stable-stringify/results/libs/Firefox 54.0.0 (Windows 7 0.0.0).json +0 -46
- package/node_modules/fast-stable-stringify/results/libs/IE 10.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/libs/IE 11.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/libs/IE 9.0.0 (Windows 7 0.0.0).json +0 -35
- package/node_modules/fast-stable-stringify/results/libs/Mobile Safari 10.0.0 (iOS 10.3.0).json +0 -46
- package/node_modules/fast-stable-stringify/results/libs/Safari 10.0.1 (Mac OS X 10.12.1).json +0 -46
- package/node_modules/fast-stable-stringify/results/libs.md +0 -15
- package/node_modules/fast-stable-stringify/test/escape-long.js +0 -147
- package/node_modules/fast-stable-stringify/test/escape-short.js +0 -147
- package/node_modules/fast-stable-stringify/test/index.js +0 -6
- package/node_modules/fast-stable-stringify/test/itar-long.js +0 -52
- package/node_modules/fast-stable-stringify/test/itar-short.js +0 -52
- package/node_modules/fast-stable-stringify/test/iter.js +0 -84
- package/node_modules/fast-stable-stringify/test/libs.js +0 -57
- package/node_modules/fast-stable-stringify/test/travis.js +0 -43
- package/node_modules/fast-stable-stringify/test/validate.js +0 -24
- package/node_modules/fast-stable-stringify/util/eachRecursive.js +0 -9
- package/node_modules/fast-stable-stringify/util/get-git-hash-sync.js +0 -21
- package/node_modules/fast-stable-stringify/util/get-lib-info.js +0 -22
- package/node_modules/fast-stable-stringify/util/object-path.js +0 -47
- package/node_modules/fast-stable-stringify/v8-profile/bench.js +0 -8
- package/node_modules/fast-stable-stringify/v8-profile/run.sh +0 -2
- package/node_modules/fast-stable-stringify/zuul-local.sh +0 -2
- package/node_modules/hkdf/.npmignore +0 -2
- package/node_modules/hkdf/README.md +0 -23
- package/node_modules/hkdf/hkdf.py +0 -171
- package/node_modules/hkdf/hkdf.pyc +0 -0
- package/node_modules/hkdf/index.js +0 -1
- package/node_modules/hkdf/lib/hkdf.js +0 -55
- package/node_modules/hkdf/package.json +0 -55
- package/node_modules/hkdf/scripts/run_all_tests.sh +0 -19
- package/node_modules/hkdf/test/all-test.js +0 -79
- package/node_modules/hkdf/test.py +0 -11
- package/node_modules/immediate/LICENSE.txt +0 -20
- package/node_modules/immediate/README.md +0 -93
- package/node_modules/immediate/dist/immediate.js +0 -75
- package/node_modules/immediate/dist/immediate.min.js +0 -1
- package/node_modules/immediate/lib/browser.js +0 -69
- package/node_modules/immediate/lib/index.js +0 -73
- package/node_modules/immediate/package.json +0 -86
- package/node_modules/isarray/.npmignore +0 -1
- package/node_modules/isarray/.travis.yml +0 -4
- package/node_modules/isarray/Makefile +0 -6
- package/node_modules/isarray/README.md +0 -60
- package/node_modules/isarray/component.json +0 -19
- package/node_modules/isarray/index.js +0 -5
- package/node_modules/isarray/package.json +0 -77
- package/node_modules/isarray/test.js +0 -20
- package/node_modules/jszip/.codeclimate.yml +0 -16
- package/node_modules/jszip/.editorconfig +0 -8
- package/node_modules/jszip/.github/workflows/pr.yaml +0 -41
- package/node_modules/jszip/.jshintignore +0 -1
- package/node_modules/jszip/.jshintrc +0 -21
- package/node_modules/jszip/.travis.yml +0 -17
- package/node_modules/jszip/CHANGES.md +0 -192
- package/node_modules/jszip/LICENSE.markdown +0 -651
- package/node_modules/jszip/README.markdown +0 -33
- package/node_modules/jszip/dist/jszip.js +0 -11583
- package/node_modules/jszip/dist/jszip.min.js +0 -13
- package/node_modules/jszip/index.d.ts +0 -335
- package/node_modules/jszip/lib/base64.js +0 -106
- package/node_modules/jszip/lib/compressedObject.js +0 -74
- package/node_modules/jszip/lib/compressions.js +0 -14
- package/node_modules/jszip/lib/crc32.js +0 -77
- package/node_modules/jszip/lib/defaults.js +0 -11
- package/node_modules/jszip/lib/external.js +0 -19
- package/node_modules/jszip/lib/flate.js +0 -85
- package/node_modules/jszip/lib/generate/ZipFileWorker.js +0 -540
- package/node_modules/jszip/lib/generate/index.js +0 -57
- package/node_modules/jszip/lib/index.js +0 -55
- package/node_modules/jszip/lib/license_header.js +0 -11
- package/node_modules/jszip/lib/load.js +0 -88
- package/node_modules/jszip/lib/nodejs/NodejsStreamInputAdapter.js +0 -74
- package/node_modules/jszip/lib/nodejs/NodejsStreamOutputAdapter.js +0 -42
- package/node_modules/jszip/lib/nodejsUtils.js +0 -57
- package/node_modules/jszip/lib/object.js +0 -389
- package/node_modules/jszip/lib/readable-stream-browser.js +0 -9
- package/node_modules/jszip/lib/reader/ArrayReader.js +0 -57
- package/node_modules/jszip/lib/reader/DataReader.js +0 -116
- package/node_modules/jszip/lib/reader/NodeBufferReader.js +0 -19
- package/node_modules/jszip/lib/reader/StringReader.js +0 -38
- package/node_modules/jszip/lib/reader/Uint8ArrayReader.js +0 -22
- package/node_modules/jszip/lib/reader/readerFor.js +0 -28
- package/node_modules/jszip/lib/signature.js +0 -7
- package/node_modules/jszip/lib/stream/ConvertWorker.js +0 -26
- package/node_modules/jszip/lib/stream/Crc32Probe.js +0 -24
- package/node_modules/jszip/lib/stream/DataLengthProbe.js +0 -29
- package/node_modules/jszip/lib/stream/DataWorker.js +0 -116
- package/node_modules/jszip/lib/stream/GenericWorker.js +0 -263
- package/node_modules/jszip/lib/stream/StreamHelper.js +0 -212
- package/node_modules/jszip/lib/support.js +0 -38
- package/node_modules/jszip/lib/utf8.js +0 -275
- package/node_modules/jszip/lib/utils.js +0 -501
- package/node_modules/jszip/lib/zipEntries.js +0 -262
- package/node_modules/jszip/lib/zipEntry.js +0 -294
- package/node_modules/jszip/lib/zipObject.js +0 -133
- package/node_modules/jszip/package.json +0 -99
- package/node_modules/jszip/tsconfig.json +0 -101
- package/node_modules/jszip/vendor/FileSaver.js +0 -247
- package/node_modules/lie/README.md +0 -62
- package/node_modules/lie/dist/lie.js +0 -350
- package/node_modules/lie/dist/lie.min.js +0 -1
- package/node_modules/lie/dist/lie.polyfill.js +0 -358
- package/node_modules/lie/dist/lie.polyfill.min.js +0 -1
- package/node_modules/lie/lib/browser.js +0 -273
- package/node_modules/lie/lib/index.js +0 -298
- package/node_modules/lie/license.md +0 -7
- package/node_modules/lie/lie.d.ts +0 -244
- package/node_modules/lie/package.json +0 -98
- package/node_modules/lie/polyfill.js +0 -4
- package/node_modules/p-finally/index.js +0 -15
- package/node_modules/p-finally/license +0 -21
- package/node_modules/p-finally/package.json +0 -77
- package/node_modules/p-finally/readme.md +0 -47
- package/node_modules/p-retry/index.js +0 -52
- package/node_modules/p-retry/license +0 -9
- package/node_modules/p-retry/package.json +0 -83
- package/node_modules/p-retry/readme.md +0 -109
- package/node_modules/p-timeout/index.d.ts +0 -72
- package/node_modules/p-timeout/index.js +0 -57
- package/node_modules/p-timeout/license +0 -9
- package/node_modules/p-timeout/package.json +0 -80
- package/node_modules/p-timeout/readme.md +0 -87
- package/node_modules/pako/CHANGELOG.md +0 -164
- package/node_modules/pako/LICENSE +0 -21
- package/node_modules/pako/README.md +0 -191
- package/node_modules/pako/dist/pako.js +0 -6818
- package/node_modules/pako/dist/pako.min.js +0 -1
- package/node_modules/pako/dist/pako_deflate.js +0 -3997
- package/node_modules/pako/dist/pako_deflate.min.js +0 -1
- package/node_modules/pako/dist/pako_inflate.js +0 -3300
- package/node_modules/pako/dist/pako_inflate.min.js +0 -1
- package/node_modules/pako/index.js +0 -14
- package/node_modules/pako/lib/deflate.js +0 -400
- package/node_modules/pako/lib/inflate.js +0 -423
- package/node_modules/pako/lib/utils/common.js +0 -105
- package/node_modules/pako/lib/utils/strings.js +0 -187
- package/node_modules/pako/lib/zlib/README +0 -59
- package/node_modules/pako/lib/zlib/adler32.js +0 -51
- package/node_modules/pako/lib/zlib/constants.js +0 -68
- package/node_modules/pako/lib/zlib/crc32.js +0 -59
- package/node_modules/pako/lib/zlib/deflate.js +0 -1874
- package/node_modules/pako/lib/zlib/gzheader.js +0 -58
- package/node_modules/pako/lib/zlib/inffast.js +0 -345
- package/node_modules/pako/lib/zlib/inflate.js +0 -1556
- package/node_modules/pako/lib/zlib/inftrees.js +0 -343
- package/node_modules/pako/lib/zlib/messages.js +0 -32
- package/node_modules/pako/lib/zlib/trees.js +0 -1222
- package/node_modules/pako/lib/zlib/zstream.js +0 -47
- package/node_modules/pako/package.json +0 -94
- package/node_modules/process-nextick-args/index.js +0 -45
- package/node_modules/process-nextick-args/license.md +0 -19
- package/node_modules/process-nextick-args/package.json +0 -53
- package/node_modules/process-nextick-args/readme.md +0 -18
- package/node_modules/readable-stream/.travis.yml +0 -34
- package/node_modules/readable-stream/CONTRIBUTING.md +0 -38
- package/node_modules/readable-stream/GOVERNANCE.md +0 -136
- package/node_modules/readable-stream/LICENSE +0 -47
- package/node_modules/readable-stream/README.md +0 -58
- package/node_modules/readable-stream/doc/wg-meetings/2015-01-30.md +0 -60
- package/node_modules/readable-stream/duplex-browser.js +0 -1
- package/node_modules/readable-stream/duplex.js +0 -1
- package/node_modules/readable-stream/lib/_stream_duplex.js +0 -131
- package/node_modules/readable-stream/lib/_stream_passthrough.js +0 -47
- package/node_modules/readable-stream/lib/_stream_readable.js +0 -1019
- package/node_modules/readable-stream/lib/_stream_transform.js +0 -214
- package/node_modules/readable-stream/lib/_stream_writable.js +0 -687
- package/node_modules/readable-stream/lib/internal/streams/BufferList.js +0 -79
- package/node_modules/readable-stream/lib/internal/streams/destroy.js +0 -74
- package/node_modules/readable-stream/lib/internal/streams/stream-browser.js +0 -1
- package/node_modules/readable-stream/lib/internal/streams/stream.js +0 -1
- package/node_modules/readable-stream/package.json +0 -86
- package/node_modules/readable-stream/passthrough.js +0 -1
- package/node_modules/readable-stream/readable-browser.js +0 -7
- package/node_modules/readable-stream/readable.js +0 -19
- package/node_modules/readable-stream/transform.js +0 -1
- package/node_modules/readable-stream/writable-browser.js +0 -1
- package/node_modules/readable-stream/writable.js +0 -8
- package/node_modules/retry/.npmignore +0 -3
- package/node_modules/retry/.travis.yml +0 -15
- package/node_modules/retry/License +0 -21
- package/node_modules/retry/Makefile +0 -18
- package/node_modules/retry/README.md +0 -227
- package/node_modules/retry/equation.gif +0 -0
- package/node_modules/retry/example/dns.js +0 -31
- package/node_modules/retry/example/stop.js +0 -40
- package/node_modules/retry/index.js +0 -1
- package/node_modules/retry/lib/retry.js +0 -100
- package/node_modules/retry/lib/retry_operation.js +0 -158
- package/node_modules/retry/package.json +0 -67
- package/node_modules/retry/test/common.js +0 -10
- package/node_modules/retry/test/integration/test-forever.js +0 -24
- package/node_modules/retry/test/integration/test-retry-operation.js +0 -258
- package/node_modules/retry/test/integration/test-retry-wrap.js +0 -101
- package/node_modules/retry/test/integration/test-timeouts.js +0 -69
- package/node_modules/setimmediate/LICENSE.txt +0 -20
- package/node_modules/setimmediate/package.json +0 -77
- package/node_modules/setimmediate/setImmediate.js +0 -186
- package/node_modules/split/.npmignore +0 -3
- package/node_modules/split/.travis.yml +0 -3
- package/node_modules/split/LICENCE +0 -22
- package/node_modules/split/examples/pretty.js +0 -26
- package/node_modules/split/index.js +0 -63
- package/node_modules/split/package.json +0 -65
- package/node_modules/split/readme.markdown +0 -72
- package/node_modules/split/test/options.asynct.js +0 -46
- package/node_modules/split/test/partitioned_unicode.js +0 -34
- package/node_modules/split/test/split.asynct.js +0 -137
- package/node_modules/split/test/try_catch.asynct.js +0 -51
- package/node_modules/stream-shift/.travis.yml +0 -6
- package/node_modules/stream-shift/LICENSE +0 -21
- package/node_modules/stream-shift/README.md +0 -25
- package/node_modules/stream-shift/index.js +0 -20
- package/node_modules/stream-shift/package.json +0 -56
- package/node_modules/stream-shift/test.js +0 -48
- package/node_modules/ultron/LICENSE +0 -22
- package/node_modules/ultron/README.md +0 -113
- package/node_modules/ultron/index.js +0 -136
- package/node_modules/ultron/package.json +0 -71
- package/node_modules/websocket-stream/LICENSE +0 -8
- package/node_modules/websocket-stream/collaborators.md +0 -11
- package/node_modules/websocket-stream/echo-server.js +0 -51
- package/node_modules/websocket-stream/index.d.ts +0 -27
- package/node_modules/websocket-stream/index.js +0 -6
- package/node_modules/websocket-stream/package.json +0 -82
- package/node_modules/websocket-stream/readme.md +0 -148
- package/node_modules/websocket-stream/server.js +0 -29
- package/node_modules/websocket-stream/stream.js +0 -189
- package/node_modules/websocket-stream/test-client.js +0 -74
- package/node_modules/websocket-stream/test-server.js +0 -56
- package/node_modules/websocket-stream/test.js +0 -338
- package/node_modules/websocket-stream/ts-tests.ts +0 -69
- package/node_modules/websocket-stream/ws-fallback.js +0 -12
- package/node_modules/ws/LICENSE +0 -21
- package/node_modules/ws/README.md +0 -341
- package/node_modules/ws/index.js +0 -15
- package/node_modules/ws/lib/.DS_Store +0 -0
- package/node_modules/ws/lib/BufferUtil.js +0 -71
- package/node_modules/ws/lib/Constants.js +0 -10
- package/node_modules/ws/lib/ErrorCodes.js +0 -28
- package/node_modules/ws/lib/EventTarget.js +0 -151
- package/node_modules/ws/lib/Extensions.js +0 -203
- package/node_modules/ws/lib/PerMessageDeflate.js +0 -507
- package/node_modules/ws/lib/Receiver.js +0 -553
- package/node_modules/ws/lib/Sender.js +0 -412
- package/node_modules/ws/lib/Validation.js +0 -17
- package/node_modules/ws/lib/WebSocket.js +0 -717
- package/node_modules/ws/lib/WebSocketServer.js +0 -326
- package/node_modules/ws/package.json +0 -83
- package/node_modules/xhr2/CONTRIBUTING.md +0 -33
- package/node_modules/xhr2/Cakefile +0 -131
- package/node_modules/xhr2/LICENSE.txt +0 -19
- package/node_modules/xhr2/README.md +0 -142
- package/node_modules/xhr2/lib/browser.js +0 -1
- package/node_modules/xhr2/lib/xhr2.js +0 -1244
- package/node_modules/xhr2/package.json +0 -103
- package/node_modules/xhr2/src/000-xml_http_request_event_target.coffee +0 -89
- package/node_modules/xhr2/src/001-xml_http_request.coffee +0 -781
- package/node_modules/xhr2/src/errors.coffee +0 -31
- package/node_modules/xhr2/src/progress_event.coffee +0 -39
- package/node_modules/xhr2/src/xml_http_request_upload.coffee +0 -95
- package/node_modules/xhr2/test/fixtures/hello.json +0 -1
- package/node_modules/xhr2/test/fixtures/hello.txt +0 -1
- package/node_modules/xhr2/test/fixtures/xhr2.png +0 -0
- package/node_modules/xhr2/test/html/browser_test.html +0 -30
- package/node_modules/xhr2/test/src/event_target_test.coffee +0 -85
- package/node_modules/xhr2/test/src/events_test.coffee +0 -204
- package/node_modules/xhr2/test/src/headers_test.coffee +0 -168
- package/node_modules/xhr2/test/src/helpers/browser_mocha_runner.coffee +0 -10
- package/node_modules/xhr2/test/src/helpers/browser_mocha_setup.coffee +0 -1
- package/node_modules/xhr2/test/src/helpers/setup.coffee +0 -38
- package/node_modules/xhr2/test/src/helpers/xhr_server.coffee +0 -156
- package/node_modules/xhr2/test/src/nodejs_set_test.coffee +0 -162
- package/node_modules/xhr2/test/src/redirect_test.coffee +0 -57
- package/node_modules/xhr2/test/src/response_type_test.coffee +0 -88
- package/node_modules/xhr2/test/src/responseurl_test.coffee +0 -18
- package/node_modules/xhr2/test/src/send_test.coffee +0 -89
- package/node_modules/xhr2/test/src/status_test.coffee +0 -47
- package/node_modules/xhr2/test/src/xhr_test.coffee +0 -102
- package/node_modules/xtend/.jshintrc +0 -30
- package/node_modules/xtend/LICENSE +0 -20
- package/node_modules/xtend/README.md +0 -32
- package/node_modules/xtend/immutable.js +0 -19
- package/node_modules/xtend/mutable.js +0 -17
- package/node_modules/xtend/package.json +0 -89
- package/node_modules/xtend/test.js +0 -103
- package/node_modules/yazl/LICENSE +0 -21
- package/node_modules/yazl/README.md +0 -389
- package/node_modules/yazl/index.js +0 -749
- package/node_modules/yazl/package.json +0 -69
- package/src/commands/CorelliumAPI.js +0 -76
- package/src/subscriberInvite.js +0 -140
@@ -1,1222 +0,0 @@
|
|
1
|
-
'use strict';
|
2
|
-
|
3
|
-
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
|
4
|
-
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
|
5
|
-
//
|
6
|
-
// This software is provided 'as-is', without any express or implied
|
7
|
-
// warranty. In no event will the authors be held liable for any damages
|
8
|
-
// arising from the use of this software.
|
9
|
-
//
|
10
|
-
// Permission is granted to anyone to use this software for any purpose,
|
11
|
-
// including commercial applications, and to alter it and redistribute it
|
12
|
-
// freely, subject to the following restrictions:
|
13
|
-
//
|
14
|
-
// 1. The origin of this software must not be misrepresented; you must not
|
15
|
-
// claim that you wrote the original software. If you use this software
|
16
|
-
// in a product, an acknowledgment in the product documentation would be
|
17
|
-
// appreciated but is not required.
|
18
|
-
// 2. Altered source versions must be plainly marked as such, and must not be
|
19
|
-
// misrepresented as being the original software.
|
20
|
-
// 3. This notice may not be removed or altered from any source distribution.
|
21
|
-
|
22
|
-
/* eslint-disable space-unary-ops */
|
23
|
-
|
24
|
-
var utils = require('../utils/common');
|
25
|
-
|
26
|
-
/* Public constants ==========================================================*/
|
27
|
-
/* ===========================================================================*/
|
28
|
-
|
29
|
-
|
30
|
-
//var Z_FILTERED = 1;
|
31
|
-
//var Z_HUFFMAN_ONLY = 2;
|
32
|
-
//var Z_RLE = 3;
|
33
|
-
var Z_FIXED = 4;
|
34
|
-
//var Z_DEFAULT_STRATEGY = 0;
|
35
|
-
|
36
|
-
/* Possible values of the data_type field (though see inflate()) */
|
37
|
-
var Z_BINARY = 0;
|
38
|
-
var Z_TEXT = 1;
|
39
|
-
//var Z_ASCII = 1; // = Z_TEXT
|
40
|
-
var Z_UNKNOWN = 2;
|
41
|
-
|
42
|
-
/*============================================================================*/
|
43
|
-
|
44
|
-
|
45
|
-
function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
|
46
|
-
|
47
|
-
// From zutil.h
|
48
|
-
|
49
|
-
var STORED_BLOCK = 0;
|
50
|
-
var STATIC_TREES = 1;
|
51
|
-
var DYN_TREES = 2;
|
52
|
-
/* The three kinds of block type */
|
53
|
-
|
54
|
-
var MIN_MATCH = 3;
|
55
|
-
var MAX_MATCH = 258;
|
56
|
-
/* The minimum and maximum match lengths */
|
57
|
-
|
58
|
-
// From deflate.h
|
59
|
-
/* ===========================================================================
|
60
|
-
* Internal compression state.
|
61
|
-
*/
|
62
|
-
|
63
|
-
var LENGTH_CODES = 29;
|
64
|
-
/* number of length codes, not counting the special END_BLOCK code */
|
65
|
-
|
66
|
-
var LITERALS = 256;
|
67
|
-
/* number of literal bytes 0..255 */
|
68
|
-
|
69
|
-
var L_CODES = LITERALS + 1 + LENGTH_CODES;
|
70
|
-
/* number of Literal or Length codes, including the END_BLOCK code */
|
71
|
-
|
72
|
-
var D_CODES = 30;
|
73
|
-
/* number of distance codes */
|
74
|
-
|
75
|
-
var BL_CODES = 19;
|
76
|
-
/* number of codes used to transfer the bit lengths */
|
77
|
-
|
78
|
-
var HEAP_SIZE = 2 * L_CODES + 1;
|
79
|
-
/* maximum heap size */
|
80
|
-
|
81
|
-
var MAX_BITS = 15;
|
82
|
-
/* All codes must not exceed MAX_BITS bits */
|
83
|
-
|
84
|
-
var Buf_size = 16;
|
85
|
-
/* size of bit buffer in bi_buf */
|
86
|
-
|
87
|
-
|
88
|
-
/* ===========================================================================
|
89
|
-
* Constants
|
90
|
-
*/
|
91
|
-
|
92
|
-
var MAX_BL_BITS = 7;
|
93
|
-
/* Bit length codes must not exceed MAX_BL_BITS bits */
|
94
|
-
|
95
|
-
var END_BLOCK = 256;
|
96
|
-
/* end of block literal code */
|
97
|
-
|
98
|
-
var REP_3_6 = 16;
|
99
|
-
/* repeat previous bit length 3-6 times (2 bits of repeat count) */
|
100
|
-
|
101
|
-
var REPZ_3_10 = 17;
|
102
|
-
/* repeat a zero length 3-10 times (3 bits of repeat count) */
|
103
|
-
|
104
|
-
var REPZ_11_138 = 18;
|
105
|
-
/* repeat a zero length 11-138 times (7 bits of repeat count) */
|
106
|
-
|
107
|
-
/* eslint-disable comma-spacing,array-bracket-spacing */
|
108
|
-
var extra_lbits = /* extra bits for each length code */
|
109
|
-
[0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];
|
110
|
-
|
111
|
-
var extra_dbits = /* extra bits for each distance code */
|
112
|
-
[0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];
|
113
|
-
|
114
|
-
var extra_blbits = /* extra bits for each bit length code */
|
115
|
-
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];
|
116
|
-
|
117
|
-
var bl_order =
|
118
|
-
[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];
|
119
|
-
/* eslint-enable comma-spacing,array-bracket-spacing */
|
120
|
-
|
121
|
-
/* The lengths of the bit length codes are sent in order of decreasing
|
122
|
-
* probability, to avoid transmitting the lengths for unused bit length codes.
|
123
|
-
*/
|
124
|
-
|
125
|
-
/* ===========================================================================
|
126
|
-
* Local data. These are initialized only once.
|
127
|
-
*/
|
128
|
-
|
129
|
-
// We pre-fill arrays with 0 to avoid uninitialized gaps
|
130
|
-
|
131
|
-
var DIST_CODE_LEN = 512; /* see definition of array dist_code below */
|
132
|
-
|
133
|
-
// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1
|
134
|
-
var static_ltree = new Array((L_CODES + 2) * 2);
|
135
|
-
zero(static_ltree);
|
136
|
-
/* The static literal tree. Since the bit lengths are imposed, there is no
|
137
|
-
* need for the L_CODES extra codes used during heap construction. However
|
138
|
-
* The codes 286 and 287 are needed to build a canonical tree (see _tr_init
|
139
|
-
* below).
|
140
|
-
*/
|
141
|
-
|
142
|
-
var static_dtree = new Array(D_CODES * 2);
|
143
|
-
zero(static_dtree);
|
144
|
-
/* The static distance tree. (Actually a trivial tree since all codes use
|
145
|
-
* 5 bits.)
|
146
|
-
*/
|
147
|
-
|
148
|
-
var _dist_code = new Array(DIST_CODE_LEN);
|
149
|
-
zero(_dist_code);
|
150
|
-
/* Distance codes. The first 256 values correspond to the distances
|
151
|
-
* 3 .. 258, the last 256 values correspond to the top 8 bits of
|
152
|
-
* the 15 bit distances.
|
153
|
-
*/
|
154
|
-
|
155
|
-
var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);
|
156
|
-
zero(_length_code);
|
157
|
-
/* length code for each normalized match length (0 == MIN_MATCH) */
|
158
|
-
|
159
|
-
var base_length = new Array(LENGTH_CODES);
|
160
|
-
zero(base_length);
|
161
|
-
/* First normalized length for each code (0 = MIN_MATCH) */
|
162
|
-
|
163
|
-
var base_dist = new Array(D_CODES);
|
164
|
-
zero(base_dist);
|
165
|
-
/* First normalized distance for each code (0 = distance of 1) */
|
166
|
-
|
167
|
-
|
168
|
-
function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {
|
169
|
-
|
170
|
-
this.static_tree = static_tree; /* static tree or NULL */
|
171
|
-
this.extra_bits = extra_bits; /* extra bits for each code or NULL */
|
172
|
-
this.extra_base = extra_base; /* base index for extra_bits */
|
173
|
-
this.elems = elems; /* max number of elements in the tree */
|
174
|
-
this.max_length = max_length; /* max bit length for the codes */
|
175
|
-
|
176
|
-
// show if `static_tree` has data or dummy - needed for monomorphic objects
|
177
|
-
this.has_stree = static_tree && static_tree.length;
|
178
|
-
}
|
179
|
-
|
180
|
-
|
181
|
-
var static_l_desc;
|
182
|
-
var static_d_desc;
|
183
|
-
var static_bl_desc;
|
184
|
-
|
185
|
-
|
186
|
-
function TreeDesc(dyn_tree, stat_desc) {
|
187
|
-
this.dyn_tree = dyn_tree; /* the dynamic tree */
|
188
|
-
this.max_code = 0; /* largest code with non zero frequency */
|
189
|
-
this.stat_desc = stat_desc; /* the corresponding static tree */
|
190
|
-
}
|
191
|
-
|
192
|
-
|
193
|
-
|
194
|
-
function d_code(dist) {
|
195
|
-
return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];
|
196
|
-
}
|
197
|
-
|
198
|
-
|
199
|
-
/* ===========================================================================
|
200
|
-
* Output a short LSB first on the stream.
|
201
|
-
* IN assertion: there is enough room in pendingBuf.
|
202
|
-
*/
|
203
|
-
function put_short(s, w) {
|
204
|
-
// put_byte(s, (uch)((w) & 0xff));
|
205
|
-
// put_byte(s, (uch)((ush)(w) >> 8));
|
206
|
-
s.pending_buf[s.pending++] = (w) & 0xff;
|
207
|
-
s.pending_buf[s.pending++] = (w >>> 8) & 0xff;
|
208
|
-
}
|
209
|
-
|
210
|
-
|
211
|
-
/* ===========================================================================
|
212
|
-
* Send a value on a given number of bits.
|
213
|
-
* IN assertion: length <= 16 and value fits in length bits.
|
214
|
-
*/
|
215
|
-
function send_bits(s, value, length) {
|
216
|
-
if (s.bi_valid > (Buf_size - length)) {
|
217
|
-
s.bi_buf |= (value << s.bi_valid) & 0xffff;
|
218
|
-
put_short(s, s.bi_buf);
|
219
|
-
s.bi_buf = value >> (Buf_size - s.bi_valid);
|
220
|
-
s.bi_valid += length - Buf_size;
|
221
|
-
} else {
|
222
|
-
s.bi_buf |= (value << s.bi_valid) & 0xffff;
|
223
|
-
s.bi_valid += length;
|
224
|
-
}
|
225
|
-
}
|
226
|
-
|
227
|
-
|
228
|
-
function send_code(s, c, tree) {
|
229
|
-
send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);
|
230
|
-
}
|
231
|
-
|
232
|
-
|
233
|
-
/* ===========================================================================
|
234
|
-
* Reverse the first len bits of a code, using straightforward code (a faster
|
235
|
-
* method would use a table)
|
236
|
-
* IN assertion: 1 <= len <= 15
|
237
|
-
*/
|
238
|
-
function bi_reverse(code, len) {
|
239
|
-
var res = 0;
|
240
|
-
do {
|
241
|
-
res |= code & 1;
|
242
|
-
code >>>= 1;
|
243
|
-
res <<= 1;
|
244
|
-
} while (--len > 0);
|
245
|
-
return res >>> 1;
|
246
|
-
}
|
247
|
-
|
248
|
-
|
249
|
-
/* ===========================================================================
|
250
|
-
* Flush the bit buffer, keeping at most 7 bits in it.
|
251
|
-
*/
|
252
|
-
function bi_flush(s) {
|
253
|
-
if (s.bi_valid === 16) {
|
254
|
-
put_short(s, s.bi_buf);
|
255
|
-
s.bi_buf = 0;
|
256
|
-
s.bi_valid = 0;
|
257
|
-
|
258
|
-
} else if (s.bi_valid >= 8) {
|
259
|
-
s.pending_buf[s.pending++] = s.bi_buf & 0xff;
|
260
|
-
s.bi_buf >>= 8;
|
261
|
-
s.bi_valid -= 8;
|
262
|
-
}
|
263
|
-
}
|
264
|
-
|
265
|
-
|
266
|
-
/* ===========================================================================
|
267
|
-
* Compute the optimal bit lengths for a tree and update the total bit length
|
268
|
-
* for the current block.
|
269
|
-
* IN assertion: the fields freq and dad are set, heap[heap_max] and
|
270
|
-
* above are the tree nodes sorted by increasing frequency.
|
271
|
-
* OUT assertions: the field len is set to the optimal bit length, the
|
272
|
-
* array bl_count contains the frequencies for each bit length.
|
273
|
-
* The length opt_len is updated; static_len is also updated if stree is
|
274
|
-
* not null.
|
275
|
-
*/
|
276
|
-
function gen_bitlen(s, desc)
|
277
|
-
// deflate_state *s;
|
278
|
-
// tree_desc *desc; /* the tree descriptor */
|
279
|
-
{
|
280
|
-
var tree = desc.dyn_tree;
|
281
|
-
var max_code = desc.max_code;
|
282
|
-
var stree = desc.stat_desc.static_tree;
|
283
|
-
var has_stree = desc.stat_desc.has_stree;
|
284
|
-
var extra = desc.stat_desc.extra_bits;
|
285
|
-
var base = desc.stat_desc.extra_base;
|
286
|
-
var max_length = desc.stat_desc.max_length;
|
287
|
-
var h; /* heap index */
|
288
|
-
var n, m; /* iterate over the tree elements */
|
289
|
-
var bits; /* bit length */
|
290
|
-
var xbits; /* extra bits */
|
291
|
-
var f; /* frequency */
|
292
|
-
var overflow = 0; /* number of elements with bit length too large */
|
293
|
-
|
294
|
-
for (bits = 0; bits <= MAX_BITS; bits++) {
|
295
|
-
s.bl_count[bits] = 0;
|
296
|
-
}
|
297
|
-
|
298
|
-
/* In a first pass, compute the optimal bit lengths (which may
|
299
|
-
* overflow in the case of the bit length tree).
|
300
|
-
*/
|
301
|
-
tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */
|
302
|
-
|
303
|
-
for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {
|
304
|
-
n = s.heap[h];
|
305
|
-
bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
|
306
|
-
if (bits > max_length) {
|
307
|
-
bits = max_length;
|
308
|
-
overflow++;
|
309
|
-
}
|
310
|
-
tree[n * 2 + 1]/*.Len*/ = bits;
|
311
|
-
/* We overwrite tree[n].Dad which is no longer needed */
|
312
|
-
|
313
|
-
if (n > max_code) { continue; } /* not a leaf node */
|
314
|
-
|
315
|
-
s.bl_count[bits]++;
|
316
|
-
xbits = 0;
|
317
|
-
if (n >= base) {
|
318
|
-
xbits = extra[n - base];
|
319
|
-
}
|
320
|
-
f = tree[n * 2]/*.Freq*/;
|
321
|
-
s.opt_len += f * (bits + xbits);
|
322
|
-
if (has_stree) {
|
323
|
-
s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);
|
324
|
-
}
|
325
|
-
}
|
326
|
-
if (overflow === 0) { return; }
|
327
|
-
|
328
|
-
// Trace((stderr,"\nbit length overflow\n"));
|
329
|
-
/* This happens for example on obj2 and pic of the Calgary corpus */
|
330
|
-
|
331
|
-
/* Find the first bit length which could increase: */
|
332
|
-
do {
|
333
|
-
bits = max_length - 1;
|
334
|
-
while (s.bl_count[bits] === 0) { bits--; }
|
335
|
-
s.bl_count[bits]--; /* move one leaf down the tree */
|
336
|
-
s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */
|
337
|
-
s.bl_count[max_length]--;
|
338
|
-
/* The brother of the overflow item also moves one step up,
|
339
|
-
* but this does not affect bl_count[max_length]
|
340
|
-
*/
|
341
|
-
overflow -= 2;
|
342
|
-
} while (overflow > 0);
|
343
|
-
|
344
|
-
/* Now recompute all bit lengths, scanning in increasing frequency.
|
345
|
-
* h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
|
346
|
-
* lengths instead of fixing only the wrong ones. This idea is taken
|
347
|
-
* from 'ar' written by Haruhiko Okumura.)
|
348
|
-
*/
|
349
|
-
for (bits = max_length; bits !== 0; bits--) {
|
350
|
-
n = s.bl_count[bits];
|
351
|
-
while (n !== 0) {
|
352
|
-
m = s.heap[--h];
|
353
|
-
if (m > max_code) { continue; }
|
354
|
-
if (tree[m * 2 + 1]/*.Len*/ !== bits) {
|
355
|
-
// Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
|
356
|
-
s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;
|
357
|
-
tree[m * 2 + 1]/*.Len*/ = bits;
|
358
|
-
}
|
359
|
-
n--;
|
360
|
-
}
|
361
|
-
}
|
362
|
-
}
|
363
|
-
|
364
|
-
|
365
|
-
/* ===========================================================================
|
366
|
-
* Generate the codes for a given tree and bit counts (which need not be
|
367
|
-
* optimal).
|
368
|
-
* IN assertion: the array bl_count contains the bit length statistics for
|
369
|
-
* the given tree and the field len is set for all tree elements.
|
370
|
-
* OUT assertion: the field code is set for all tree elements of non
|
371
|
-
* zero code length.
|
372
|
-
*/
|
373
|
-
function gen_codes(tree, max_code, bl_count)
|
374
|
-
// ct_data *tree; /* the tree to decorate */
|
375
|
-
// int max_code; /* largest code with non zero frequency */
|
376
|
-
// ushf *bl_count; /* number of codes at each bit length */
|
377
|
-
{
|
378
|
-
var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */
|
379
|
-
var code = 0; /* running code value */
|
380
|
-
var bits; /* bit index */
|
381
|
-
var n; /* code index */
|
382
|
-
|
383
|
-
/* The distribution counts are first used to generate the code values
|
384
|
-
* without bit reversal.
|
385
|
-
*/
|
386
|
-
for (bits = 1; bits <= MAX_BITS; bits++) {
|
387
|
-
next_code[bits] = code = (code + bl_count[bits - 1]) << 1;
|
388
|
-
}
|
389
|
-
/* Check that the bit counts in bl_count are consistent. The last code
|
390
|
-
* must be all ones.
|
391
|
-
*/
|
392
|
-
//Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
|
393
|
-
// "inconsistent bit counts");
|
394
|
-
//Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
|
395
|
-
|
396
|
-
for (n = 0; n <= max_code; n++) {
|
397
|
-
var len = tree[n * 2 + 1]/*.Len*/;
|
398
|
-
if (len === 0) { continue; }
|
399
|
-
/* Now reverse the bits */
|
400
|
-
tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);
|
401
|
-
|
402
|
-
//Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
|
403
|
-
// n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
|
404
|
-
}
|
405
|
-
}
|
406
|
-
|
407
|
-
|
408
|
-
/* ===========================================================================
|
409
|
-
* Initialize the various 'constant' tables.
|
410
|
-
*/
|
411
|
-
function tr_static_init() {
|
412
|
-
var n; /* iterates over tree elements */
|
413
|
-
var bits; /* bit counter */
|
414
|
-
var length; /* length value */
|
415
|
-
var code; /* code value */
|
416
|
-
var dist; /* distance index */
|
417
|
-
var bl_count = new Array(MAX_BITS + 1);
|
418
|
-
/* number of codes at each bit length for an optimal tree */
|
419
|
-
|
420
|
-
// do check in _tr_init()
|
421
|
-
//if (static_init_done) return;
|
422
|
-
|
423
|
-
/* For some embedded targets, global variables are not initialized: */
|
424
|
-
/*#ifdef NO_INIT_GLOBAL_POINTERS
|
425
|
-
static_l_desc.static_tree = static_ltree;
|
426
|
-
static_l_desc.extra_bits = extra_lbits;
|
427
|
-
static_d_desc.static_tree = static_dtree;
|
428
|
-
static_d_desc.extra_bits = extra_dbits;
|
429
|
-
static_bl_desc.extra_bits = extra_blbits;
|
430
|
-
#endif*/
|
431
|
-
|
432
|
-
/* Initialize the mapping length (0..255) -> length code (0..28) */
|
433
|
-
length = 0;
|
434
|
-
for (code = 0; code < LENGTH_CODES - 1; code++) {
|
435
|
-
base_length[code] = length;
|
436
|
-
for (n = 0; n < (1 << extra_lbits[code]); n++) {
|
437
|
-
_length_code[length++] = code;
|
438
|
-
}
|
439
|
-
}
|
440
|
-
//Assert (length == 256, "tr_static_init: length != 256");
|
441
|
-
/* Note that the length 255 (match length 258) can be represented
|
442
|
-
* in two different ways: code 284 + 5 bits or code 285, so we
|
443
|
-
* overwrite length_code[255] to use the best encoding:
|
444
|
-
*/
|
445
|
-
_length_code[length - 1] = code;
|
446
|
-
|
447
|
-
/* Initialize the mapping dist (0..32K) -> dist code (0..29) */
|
448
|
-
dist = 0;
|
449
|
-
for (code = 0; code < 16; code++) {
|
450
|
-
base_dist[code] = dist;
|
451
|
-
for (n = 0; n < (1 << extra_dbits[code]); n++) {
|
452
|
-
_dist_code[dist++] = code;
|
453
|
-
}
|
454
|
-
}
|
455
|
-
//Assert (dist == 256, "tr_static_init: dist != 256");
|
456
|
-
dist >>= 7; /* from now on, all distances are divided by 128 */
|
457
|
-
for (; code < D_CODES; code++) {
|
458
|
-
base_dist[code] = dist << 7;
|
459
|
-
for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
|
460
|
-
_dist_code[256 + dist++] = code;
|
461
|
-
}
|
462
|
-
}
|
463
|
-
//Assert (dist == 256, "tr_static_init: 256+dist != 512");
|
464
|
-
|
465
|
-
/* Construct the codes of the static literal tree */
|
466
|
-
for (bits = 0; bits <= MAX_BITS; bits++) {
|
467
|
-
bl_count[bits] = 0;
|
468
|
-
}
|
469
|
-
|
470
|
-
n = 0;
|
471
|
-
while (n <= 143) {
|
472
|
-
static_ltree[n * 2 + 1]/*.Len*/ = 8;
|
473
|
-
n++;
|
474
|
-
bl_count[8]++;
|
475
|
-
}
|
476
|
-
while (n <= 255) {
|
477
|
-
static_ltree[n * 2 + 1]/*.Len*/ = 9;
|
478
|
-
n++;
|
479
|
-
bl_count[9]++;
|
480
|
-
}
|
481
|
-
while (n <= 279) {
|
482
|
-
static_ltree[n * 2 + 1]/*.Len*/ = 7;
|
483
|
-
n++;
|
484
|
-
bl_count[7]++;
|
485
|
-
}
|
486
|
-
while (n <= 287) {
|
487
|
-
static_ltree[n * 2 + 1]/*.Len*/ = 8;
|
488
|
-
n++;
|
489
|
-
bl_count[8]++;
|
490
|
-
}
|
491
|
-
/* Codes 286 and 287 do not exist, but we must include them in the
|
492
|
-
* tree construction to get a canonical Huffman tree (longest code
|
493
|
-
* all ones)
|
494
|
-
*/
|
495
|
-
gen_codes(static_ltree, L_CODES + 1, bl_count);
|
496
|
-
|
497
|
-
/* The static distance tree is trivial: */
|
498
|
-
for (n = 0; n < D_CODES; n++) {
|
499
|
-
static_dtree[n * 2 + 1]/*.Len*/ = 5;
|
500
|
-
static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);
|
501
|
-
}
|
502
|
-
|
503
|
-
// Now data ready and we can init static trees
|
504
|
-
static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);
|
505
|
-
static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);
|
506
|
-
static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);
|
507
|
-
|
508
|
-
//static_init_done = true;
|
509
|
-
}
|
510
|
-
|
511
|
-
|
512
|
-
/* ===========================================================================
|
513
|
-
* Initialize a new block.
|
514
|
-
*/
|
515
|
-
function init_block(s) {
|
516
|
-
var n; /* iterates over tree elements */
|
517
|
-
|
518
|
-
/* Initialize the trees. */
|
519
|
-
for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }
|
520
|
-
for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }
|
521
|
-
for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }
|
522
|
-
|
523
|
-
s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;
|
524
|
-
s.opt_len = s.static_len = 0;
|
525
|
-
s.last_lit = s.matches = 0;
|
526
|
-
}
|
527
|
-
|
528
|
-
|
529
|
-
/* ===========================================================================
|
530
|
-
* Flush the bit buffer and align the output on a byte boundary
|
531
|
-
*/
|
532
|
-
function bi_windup(s)
|
533
|
-
{
|
534
|
-
if (s.bi_valid > 8) {
|
535
|
-
put_short(s, s.bi_buf);
|
536
|
-
} else if (s.bi_valid > 0) {
|
537
|
-
//put_byte(s, (Byte)s->bi_buf);
|
538
|
-
s.pending_buf[s.pending++] = s.bi_buf;
|
539
|
-
}
|
540
|
-
s.bi_buf = 0;
|
541
|
-
s.bi_valid = 0;
|
542
|
-
}
|
543
|
-
|
544
|
-
/* ===========================================================================
|
545
|
-
* Copy a stored block, storing first the length and its
|
546
|
-
* one's complement if requested.
|
547
|
-
*/
|
548
|
-
function copy_block(s, buf, len, header)
|
549
|
-
//DeflateState *s;
|
550
|
-
//charf *buf; /* the input data */
|
551
|
-
//unsigned len; /* its length */
|
552
|
-
//int header; /* true if block header must be written */
|
553
|
-
{
|
554
|
-
bi_windup(s); /* align on byte boundary */
|
555
|
-
|
556
|
-
if (header) {
|
557
|
-
put_short(s, len);
|
558
|
-
put_short(s, ~len);
|
559
|
-
}
|
560
|
-
// while (len--) {
|
561
|
-
// put_byte(s, *buf++);
|
562
|
-
// }
|
563
|
-
utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
|
564
|
-
s.pending += len;
|
565
|
-
}
|
566
|
-
|
567
|
-
/* ===========================================================================
|
568
|
-
* Compares to subtrees, using the tree depth as tie breaker when
|
569
|
-
* the subtrees have equal frequency. This minimizes the worst case length.
|
570
|
-
*/
|
571
|
-
function smaller(tree, n, m, depth) {
|
572
|
-
var _n2 = n * 2;
|
573
|
-
var _m2 = m * 2;
|
574
|
-
return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
|
575
|
-
(tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
|
576
|
-
}
|
577
|
-
|
578
|
-
/* ===========================================================================
|
579
|
-
* Restore the heap property by moving down the tree starting at node k,
|
580
|
-
* exchanging a node with the smallest of its two sons if necessary, stopping
|
581
|
-
* when the heap property is re-established (each father smaller than its
|
582
|
-
* two sons).
|
583
|
-
*/
|
584
|
-
function pqdownheap(s, tree, k)
|
585
|
-
// deflate_state *s;
|
586
|
-
// ct_data *tree; /* the tree to restore */
|
587
|
-
// int k; /* node to move down */
|
588
|
-
{
|
589
|
-
var v = s.heap[k];
|
590
|
-
var j = k << 1; /* left son of k */
|
591
|
-
while (j <= s.heap_len) {
|
592
|
-
/* Set j to the smallest of the two sons: */
|
593
|
-
if (j < s.heap_len &&
|
594
|
-
smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
|
595
|
-
j++;
|
596
|
-
}
|
597
|
-
/* Exit if v is smaller than both sons */
|
598
|
-
if (smaller(tree, v, s.heap[j], s.depth)) { break; }
|
599
|
-
|
600
|
-
/* Exchange v with the smallest son */
|
601
|
-
s.heap[k] = s.heap[j];
|
602
|
-
k = j;
|
603
|
-
|
604
|
-
/* And continue down the tree, setting j to the left son of k */
|
605
|
-
j <<= 1;
|
606
|
-
}
|
607
|
-
s.heap[k] = v;
|
608
|
-
}
|
609
|
-
|
610
|
-
|
611
|
-
// inlined manually
|
612
|
-
// var SMALLEST = 1;
|
613
|
-
|
614
|
-
/* ===========================================================================
|
615
|
-
* Send the block data compressed using the given Huffman trees
|
616
|
-
*/
|
617
|
-
function compress_block(s, ltree, dtree)
|
618
|
-
// deflate_state *s;
|
619
|
-
// const ct_data *ltree; /* literal tree */
|
620
|
-
// const ct_data *dtree; /* distance tree */
|
621
|
-
{
|
622
|
-
var dist; /* distance of matched string */
|
623
|
-
var lc; /* match length or unmatched char (if dist == 0) */
|
624
|
-
var lx = 0; /* running index in l_buf */
|
625
|
-
var code; /* the code to send */
|
626
|
-
var extra; /* number of extra bits to send */
|
627
|
-
|
628
|
-
if (s.last_lit !== 0) {
|
629
|
-
do {
|
630
|
-
dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);
|
631
|
-
lc = s.pending_buf[s.l_buf + lx];
|
632
|
-
lx++;
|
633
|
-
|
634
|
-
if (dist === 0) {
|
635
|
-
send_code(s, lc, ltree); /* send a literal byte */
|
636
|
-
//Tracecv(isgraph(lc), (stderr," '%c' ", lc));
|
637
|
-
} else {
|
638
|
-
/* Here, lc is the match length - MIN_MATCH */
|
639
|
-
code = _length_code[lc];
|
640
|
-
send_code(s, code + LITERALS + 1, ltree); /* send the length code */
|
641
|
-
extra = extra_lbits[code];
|
642
|
-
if (extra !== 0) {
|
643
|
-
lc -= base_length[code];
|
644
|
-
send_bits(s, lc, extra); /* send the extra length bits */
|
645
|
-
}
|
646
|
-
dist--; /* dist is now the match distance - 1 */
|
647
|
-
code = d_code(dist);
|
648
|
-
//Assert (code < D_CODES, "bad d_code");
|
649
|
-
|
650
|
-
send_code(s, code, dtree); /* send the distance code */
|
651
|
-
extra = extra_dbits[code];
|
652
|
-
if (extra !== 0) {
|
653
|
-
dist -= base_dist[code];
|
654
|
-
send_bits(s, dist, extra); /* send the extra distance bits */
|
655
|
-
}
|
656
|
-
} /* literal or match pair ? */
|
657
|
-
|
658
|
-
/* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
|
659
|
-
//Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
|
660
|
-
// "pendingBuf overflow");
|
661
|
-
|
662
|
-
} while (lx < s.last_lit);
|
663
|
-
}
|
664
|
-
|
665
|
-
send_code(s, END_BLOCK, ltree);
|
666
|
-
}
|
667
|
-
|
668
|
-
|
669
|
-
/* ===========================================================================
|
670
|
-
* Construct one Huffman tree and assigns the code bit strings and lengths.
|
671
|
-
* Update the total bit length for the current block.
|
672
|
-
* IN assertion: the field freq is set for all tree elements.
|
673
|
-
* OUT assertions: the fields len and code are set to the optimal bit length
|
674
|
-
* and corresponding code. The length opt_len is updated; static_len is
|
675
|
-
* also updated if stree is not null. The field max_code is set.
|
676
|
-
*/
|
677
|
-
function build_tree(s, desc)
|
678
|
-
// deflate_state *s;
|
679
|
-
// tree_desc *desc; /* the tree descriptor */
|
680
|
-
{
|
681
|
-
var tree = desc.dyn_tree;
|
682
|
-
var stree = desc.stat_desc.static_tree;
|
683
|
-
var has_stree = desc.stat_desc.has_stree;
|
684
|
-
var elems = desc.stat_desc.elems;
|
685
|
-
var n, m; /* iterate over heap elements */
|
686
|
-
var max_code = -1; /* largest code with non zero frequency */
|
687
|
-
var node; /* new node being created */
|
688
|
-
|
689
|
-
/* Construct the initial heap, with least frequent element in
|
690
|
-
* heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
|
691
|
-
* heap[0] is not used.
|
692
|
-
*/
|
693
|
-
s.heap_len = 0;
|
694
|
-
s.heap_max = HEAP_SIZE;
|
695
|
-
|
696
|
-
for (n = 0; n < elems; n++) {
|
697
|
-
if (tree[n * 2]/*.Freq*/ !== 0) {
|
698
|
-
s.heap[++s.heap_len] = max_code = n;
|
699
|
-
s.depth[n] = 0;
|
700
|
-
|
701
|
-
} else {
|
702
|
-
tree[n * 2 + 1]/*.Len*/ = 0;
|
703
|
-
}
|
704
|
-
}
|
705
|
-
|
706
|
-
/* The pkzip format requires that at least one distance code exists,
|
707
|
-
* and that at least one bit should be sent even if there is only one
|
708
|
-
* possible code. So to avoid special checks later on we force at least
|
709
|
-
* two codes of non zero frequency.
|
710
|
-
*/
|
711
|
-
while (s.heap_len < 2) {
|
712
|
-
node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);
|
713
|
-
tree[node * 2]/*.Freq*/ = 1;
|
714
|
-
s.depth[node] = 0;
|
715
|
-
s.opt_len--;
|
716
|
-
|
717
|
-
if (has_stree) {
|
718
|
-
s.static_len -= stree[node * 2 + 1]/*.Len*/;
|
719
|
-
}
|
720
|
-
/* node is 0 or 1 so it does not have extra bits */
|
721
|
-
}
|
722
|
-
desc.max_code = max_code;
|
723
|
-
|
724
|
-
/* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
|
725
|
-
* establish sub-heaps of increasing lengths:
|
726
|
-
*/
|
727
|
-
for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
|
728
|
-
|
729
|
-
/* Construct the Huffman tree by repeatedly combining the least two
|
730
|
-
* frequent nodes.
|
731
|
-
*/
|
732
|
-
node = elems; /* next internal node of the tree */
|
733
|
-
do {
|
734
|
-
//pqremove(s, tree, n); /* n = node of least frequency */
|
735
|
-
/*** pqremove ***/
|
736
|
-
n = s.heap[1/*SMALLEST*/];
|
737
|
-
s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];
|
738
|
-
pqdownheap(s, tree, 1/*SMALLEST*/);
|
739
|
-
/***/
|
740
|
-
|
741
|
-
m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */
|
742
|
-
|
743
|
-
s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
|
744
|
-
s.heap[--s.heap_max] = m;
|
745
|
-
|
746
|
-
/* Create a new node father of n and m */
|
747
|
-
tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
|
748
|
-
s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
|
749
|
-
tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;
|
750
|
-
|
751
|
-
/* and insert the new node in the heap */
|
752
|
-
s.heap[1/*SMALLEST*/] = node++;
|
753
|
-
pqdownheap(s, tree, 1/*SMALLEST*/);
|
754
|
-
|
755
|
-
} while (s.heap_len >= 2);
|
756
|
-
|
757
|
-
s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];
|
758
|
-
|
759
|
-
/* At this point, the fields freq and dad are set. We can now
|
760
|
-
* generate the bit lengths.
|
761
|
-
*/
|
762
|
-
gen_bitlen(s, desc);
|
763
|
-
|
764
|
-
/* The field len is now set, we can generate the bit codes */
|
765
|
-
gen_codes(tree, max_code, s.bl_count);
|
766
|
-
}
|
767
|
-
|
768
|
-
|
769
|
-
/* ===========================================================================
|
770
|
-
* Scan a literal or distance tree to determine the frequencies of the codes
|
771
|
-
* in the bit length tree.
|
772
|
-
*/
|
773
|
-
function scan_tree(s, tree, max_code)
|
774
|
-
// deflate_state *s;
|
775
|
-
// ct_data *tree; /* the tree to be scanned */
|
776
|
-
// int max_code; /* and its largest code of non zero frequency */
|
777
|
-
{
|
778
|
-
var n; /* iterates over all tree elements */
|
779
|
-
var prevlen = -1; /* last emitted length */
|
780
|
-
var curlen; /* length of current code */
|
781
|
-
|
782
|
-
var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */
|
783
|
-
|
784
|
-
var count = 0; /* repeat count of the current code */
|
785
|
-
var max_count = 7; /* max repeat count */
|
786
|
-
var min_count = 4; /* min repeat count */
|
787
|
-
|
788
|
-
if (nextlen === 0) {
|
789
|
-
max_count = 138;
|
790
|
-
min_count = 3;
|
791
|
-
}
|
792
|
-
tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */
|
793
|
-
|
794
|
-
for (n = 0; n <= max_code; n++) {
|
795
|
-
curlen = nextlen;
|
796
|
-
nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
|
797
|
-
|
798
|
-
if (++count < max_count && curlen === nextlen) {
|
799
|
-
continue;
|
800
|
-
|
801
|
-
} else if (count < min_count) {
|
802
|
-
s.bl_tree[curlen * 2]/*.Freq*/ += count;
|
803
|
-
|
804
|
-
} else if (curlen !== 0) {
|
805
|
-
|
806
|
-
if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }
|
807
|
-
s.bl_tree[REP_3_6 * 2]/*.Freq*/++;
|
808
|
-
|
809
|
-
} else if (count <= 10) {
|
810
|
-
s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;
|
811
|
-
|
812
|
-
} else {
|
813
|
-
s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;
|
814
|
-
}
|
815
|
-
|
816
|
-
count = 0;
|
817
|
-
prevlen = curlen;
|
818
|
-
|
819
|
-
if (nextlen === 0) {
|
820
|
-
max_count = 138;
|
821
|
-
min_count = 3;
|
822
|
-
|
823
|
-
} else if (curlen === nextlen) {
|
824
|
-
max_count = 6;
|
825
|
-
min_count = 3;
|
826
|
-
|
827
|
-
} else {
|
828
|
-
max_count = 7;
|
829
|
-
min_count = 4;
|
830
|
-
}
|
831
|
-
}
|
832
|
-
}
|
833
|
-
|
834
|
-
|
835
|
-
/* ===========================================================================
|
836
|
-
* Send a literal or distance tree in compressed form, using the codes in
|
837
|
-
* bl_tree.
|
838
|
-
*/
|
839
|
-
function send_tree(s, tree, max_code)
|
840
|
-
// deflate_state *s;
|
841
|
-
// ct_data *tree; /* the tree to be scanned */
|
842
|
-
// int max_code; /* and its largest code of non zero frequency */
|
843
|
-
{
|
844
|
-
var n; /* iterates over all tree elements */
|
845
|
-
var prevlen = -1; /* last emitted length */
|
846
|
-
var curlen; /* length of current code */
|
847
|
-
|
848
|
-
var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */
|
849
|
-
|
850
|
-
var count = 0; /* repeat count of the current code */
|
851
|
-
var max_count = 7; /* max repeat count */
|
852
|
-
var min_count = 4; /* min repeat count */
|
853
|
-
|
854
|
-
/* tree[max_code+1].Len = -1; */ /* guard already set */
|
855
|
-
if (nextlen === 0) {
|
856
|
-
max_count = 138;
|
857
|
-
min_count = 3;
|
858
|
-
}
|
859
|
-
|
860
|
-
for (n = 0; n <= max_code; n++) {
|
861
|
-
curlen = nextlen;
|
862
|
-
nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
|
863
|
-
|
864
|
-
if (++count < max_count && curlen === nextlen) {
|
865
|
-
continue;
|
866
|
-
|
867
|
-
} else if (count < min_count) {
|
868
|
-
do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);
|
869
|
-
|
870
|
-
} else if (curlen !== 0) {
|
871
|
-
if (curlen !== prevlen) {
|
872
|
-
send_code(s, curlen, s.bl_tree);
|
873
|
-
count--;
|
874
|
-
}
|
875
|
-
//Assert(count >= 3 && count <= 6, " 3_6?");
|
876
|
-
send_code(s, REP_3_6, s.bl_tree);
|
877
|
-
send_bits(s, count - 3, 2);
|
878
|
-
|
879
|
-
} else if (count <= 10) {
|
880
|
-
send_code(s, REPZ_3_10, s.bl_tree);
|
881
|
-
send_bits(s, count - 3, 3);
|
882
|
-
|
883
|
-
} else {
|
884
|
-
send_code(s, REPZ_11_138, s.bl_tree);
|
885
|
-
send_bits(s, count - 11, 7);
|
886
|
-
}
|
887
|
-
|
888
|
-
count = 0;
|
889
|
-
prevlen = curlen;
|
890
|
-
if (nextlen === 0) {
|
891
|
-
max_count = 138;
|
892
|
-
min_count = 3;
|
893
|
-
|
894
|
-
} else if (curlen === nextlen) {
|
895
|
-
max_count = 6;
|
896
|
-
min_count = 3;
|
897
|
-
|
898
|
-
} else {
|
899
|
-
max_count = 7;
|
900
|
-
min_count = 4;
|
901
|
-
}
|
902
|
-
}
|
903
|
-
}
|
904
|
-
|
905
|
-
|
906
|
-
/* ===========================================================================
|
907
|
-
* Construct the Huffman tree for the bit lengths and return the index in
|
908
|
-
* bl_order of the last bit length code to send.
|
909
|
-
*/
|
910
|
-
function build_bl_tree(s) {
|
911
|
-
var max_blindex; /* index of last bit length code of non zero freq */
|
912
|
-
|
913
|
-
/* Determine the bit length frequencies for literal and distance trees */
|
914
|
-
scan_tree(s, s.dyn_ltree, s.l_desc.max_code);
|
915
|
-
scan_tree(s, s.dyn_dtree, s.d_desc.max_code);
|
916
|
-
|
917
|
-
/* Build the bit length tree: */
|
918
|
-
build_tree(s, s.bl_desc);
|
919
|
-
/* opt_len now includes the length of the tree representations, except
|
920
|
-
* the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
|
921
|
-
*/
|
922
|
-
|
923
|
-
/* Determine the number of bit length codes to send. The pkzip format
|
924
|
-
* requires that at least 4 bit length codes be sent. (appnote.txt says
|
925
|
-
* 3 but the actual value used is 4.)
|
926
|
-
*/
|
927
|
-
for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {
|
928
|
-
if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {
|
929
|
-
break;
|
930
|
-
}
|
931
|
-
}
|
932
|
-
/* Update opt_len to include the bit length tree and counts */
|
933
|
-
s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;
|
934
|
-
//Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
|
935
|
-
// s->opt_len, s->static_len));
|
936
|
-
|
937
|
-
return max_blindex;
|
938
|
-
}
|
939
|
-
|
940
|
-
|
941
|
-
/* ===========================================================================
|
942
|
-
* Send the header for a block using dynamic Huffman trees: the counts, the
|
943
|
-
* lengths of the bit length codes, the literal tree and the distance tree.
|
944
|
-
* IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
|
945
|
-
*/
|
946
|
-
function send_all_trees(s, lcodes, dcodes, blcodes)
|
947
|
-
// deflate_state *s;
|
948
|
-
// int lcodes, dcodes, blcodes; /* number of codes for each tree */
|
949
|
-
{
|
950
|
-
var rank; /* index in bl_order */
|
951
|
-
|
952
|
-
//Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
|
953
|
-
//Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
954
|
-
// "too many codes");
|
955
|
-
//Tracev((stderr, "\nbl counts: "));
|
956
|
-
send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */
|
957
|
-
send_bits(s, dcodes - 1, 5);
|
958
|
-
send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */
|
959
|
-
for (rank = 0; rank < blcodes; rank++) {
|
960
|
-
//Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
|
961
|
-
send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);
|
962
|
-
}
|
963
|
-
//Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
|
964
|
-
|
965
|
-
send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */
|
966
|
-
//Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
|
967
|
-
|
968
|
-
send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */
|
969
|
-
//Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
|
970
|
-
}
|
971
|
-
|
972
|
-
|
973
|
-
/* ===========================================================================
|
974
|
-
* Check if the data type is TEXT or BINARY, using the following algorithm:
|
975
|
-
* - TEXT if the two conditions below are satisfied:
|
976
|
-
* a) There are no non-portable control characters belonging to the
|
977
|
-
* "black list" (0..6, 14..25, 28..31).
|
978
|
-
* b) There is at least one printable character belonging to the
|
979
|
-
* "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
|
980
|
-
* - BINARY otherwise.
|
981
|
-
* - The following partially-portable control characters form a
|
982
|
-
* "gray list" that is ignored in this detection algorithm:
|
983
|
-
* (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
|
984
|
-
* IN assertion: the fields Freq of dyn_ltree are set.
|
985
|
-
*/
|
986
|
-
function detect_data_type(s) {
|
987
|
-
/* black_mask is the bit mask of black-listed bytes
|
988
|
-
* set bits 0..6, 14..25, and 28..31
|
989
|
-
* 0xf3ffc07f = binary 11110011111111111100000001111111
|
990
|
-
*/
|
991
|
-
var black_mask = 0xf3ffc07f;
|
992
|
-
var n;
|
993
|
-
|
994
|
-
/* Check for non-textual ("black-listed") bytes. */
|
995
|
-
for (n = 0; n <= 31; n++, black_mask >>>= 1) {
|
996
|
-
if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {
|
997
|
-
return Z_BINARY;
|
998
|
-
}
|
999
|
-
}
|
1000
|
-
|
1001
|
-
/* Check for textual ("white-listed") bytes. */
|
1002
|
-
if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||
|
1003
|
-
s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {
|
1004
|
-
return Z_TEXT;
|
1005
|
-
}
|
1006
|
-
for (n = 32; n < LITERALS; n++) {
|
1007
|
-
if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {
|
1008
|
-
return Z_TEXT;
|
1009
|
-
}
|
1010
|
-
}
|
1011
|
-
|
1012
|
-
/* There are no "black-listed" or "white-listed" bytes:
|
1013
|
-
* this stream either is empty or has tolerated ("gray-listed") bytes only.
|
1014
|
-
*/
|
1015
|
-
return Z_BINARY;
|
1016
|
-
}
|
1017
|
-
|
1018
|
-
|
1019
|
-
var static_init_done = false;
|
1020
|
-
|
1021
|
-
/* ===========================================================================
|
1022
|
-
* Initialize the tree data structures for a new zlib stream.
|
1023
|
-
*/
|
1024
|
-
function _tr_init(s)
|
1025
|
-
{
|
1026
|
-
|
1027
|
-
if (!static_init_done) {
|
1028
|
-
tr_static_init();
|
1029
|
-
static_init_done = true;
|
1030
|
-
}
|
1031
|
-
|
1032
|
-
s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);
|
1033
|
-
s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);
|
1034
|
-
s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);
|
1035
|
-
|
1036
|
-
s.bi_buf = 0;
|
1037
|
-
s.bi_valid = 0;
|
1038
|
-
|
1039
|
-
/* Initialize the first block of the first file: */
|
1040
|
-
init_block(s);
|
1041
|
-
}
|
1042
|
-
|
1043
|
-
|
1044
|
-
/* ===========================================================================
|
1045
|
-
* Send a stored block
|
1046
|
-
*/
|
1047
|
-
function _tr_stored_block(s, buf, stored_len, last)
|
1048
|
-
//DeflateState *s;
|
1049
|
-
//charf *buf; /* input block */
|
1050
|
-
//ulg stored_len; /* length of input block */
|
1051
|
-
//int last; /* one if this is the last block for a file */
|
1052
|
-
{
|
1053
|
-
send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */
|
1054
|
-
copy_block(s, buf, stored_len, true); /* with header */
|
1055
|
-
}
|
1056
|
-
|
1057
|
-
|
1058
|
-
/* ===========================================================================
|
1059
|
-
* Send one empty static block to give enough lookahead for inflate.
|
1060
|
-
* This takes 10 bits, of which 7 may remain in the bit buffer.
|
1061
|
-
*/
|
1062
|
-
function _tr_align(s) {
|
1063
|
-
send_bits(s, STATIC_TREES << 1, 3);
|
1064
|
-
send_code(s, END_BLOCK, static_ltree);
|
1065
|
-
bi_flush(s);
|
1066
|
-
}
|
1067
|
-
|
1068
|
-
|
1069
|
-
/* ===========================================================================
|
1070
|
-
* Determine the best encoding for the current block: dynamic trees, static
|
1071
|
-
* trees or store, and output the encoded block to the zip file.
|
1072
|
-
*/
|
1073
|
-
function _tr_flush_block(s, buf, stored_len, last)
|
1074
|
-
//DeflateState *s;
|
1075
|
-
//charf *buf; /* input block, or NULL if too old */
|
1076
|
-
//ulg stored_len; /* length of input block */
|
1077
|
-
//int last; /* one if this is the last block for a file */
|
1078
|
-
{
|
1079
|
-
var opt_lenb, static_lenb; /* opt_len and static_len in bytes */
|
1080
|
-
var max_blindex = 0; /* index of last bit length code of non zero freq */
|
1081
|
-
|
1082
|
-
/* Build the Huffman trees unless a stored block is forced */
|
1083
|
-
if (s.level > 0) {
|
1084
|
-
|
1085
|
-
/* Check if the file is binary or text */
|
1086
|
-
if (s.strm.data_type === Z_UNKNOWN) {
|
1087
|
-
s.strm.data_type = detect_data_type(s);
|
1088
|
-
}
|
1089
|
-
|
1090
|
-
/* Construct the literal and distance trees */
|
1091
|
-
build_tree(s, s.l_desc);
|
1092
|
-
// Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
|
1093
|
-
// s->static_len));
|
1094
|
-
|
1095
|
-
build_tree(s, s.d_desc);
|
1096
|
-
// Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
|
1097
|
-
// s->static_len));
|
1098
|
-
/* At this point, opt_len and static_len are the total bit lengths of
|
1099
|
-
* the compressed block data, excluding the tree representations.
|
1100
|
-
*/
|
1101
|
-
|
1102
|
-
/* Build the bit length tree for the above two trees, and get the index
|
1103
|
-
* in bl_order of the last bit length code to send.
|
1104
|
-
*/
|
1105
|
-
max_blindex = build_bl_tree(s);
|
1106
|
-
|
1107
|
-
/* Determine the best encoding. Compute the block lengths in bytes. */
|
1108
|
-
opt_lenb = (s.opt_len + 3 + 7) >>> 3;
|
1109
|
-
static_lenb = (s.static_len + 3 + 7) >>> 3;
|
1110
|
-
|
1111
|
-
// Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
|
1112
|
-
// opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
|
1113
|
-
// s->last_lit));
|
1114
|
-
|
1115
|
-
if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }
|
1116
|
-
|
1117
|
-
} else {
|
1118
|
-
// Assert(buf != (char*)0, "lost buf");
|
1119
|
-
opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
|
1120
|
-
}
|
1121
|
-
|
1122
|
-
if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {
|
1123
|
-
/* 4: two words for the lengths */
|
1124
|
-
|
1125
|
-
/* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
|
1126
|
-
* Otherwise we can't have processed more than WSIZE input bytes since
|
1127
|
-
* the last block flush, because compression would have been
|
1128
|
-
* successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
|
1129
|
-
* transform a block into a stored block.
|
1130
|
-
*/
|
1131
|
-
_tr_stored_block(s, buf, stored_len, last);
|
1132
|
-
|
1133
|
-
} else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {
|
1134
|
-
|
1135
|
-
send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);
|
1136
|
-
compress_block(s, static_ltree, static_dtree);
|
1137
|
-
|
1138
|
-
} else {
|
1139
|
-
send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);
|
1140
|
-
send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);
|
1141
|
-
compress_block(s, s.dyn_ltree, s.dyn_dtree);
|
1142
|
-
}
|
1143
|
-
// Assert (s->compressed_len == s->bits_sent, "bad compressed size");
|
1144
|
-
/* The above check is made mod 2^32, for files larger than 512 MB
|
1145
|
-
* and uLong implemented on 32 bits.
|
1146
|
-
*/
|
1147
|
-
init_block(s);
|
1148
|
-
|
1149
|
-
if (last) {
|
1150
|
-
bi_windup(s);
|
1151
|
-
}
|
1152
|
-
// Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
|
1153
|
-
// s->compressed_len-7*last));
|
1154
|
-
}
|
1155
|
-
|
1156
|
-
/* ===========================================================================
|
1157
|
-
* Save the match info and tally the frequency counts. Return true if
|
1158
|
-
* the current block must be flushed.
|
1159
|
-
*/
|
1160
|
-
function _tr_tally(s, dist, lc)
|
1161
|
-
// deflate_state *s;
|
1162
|
-
// unsigned dist; /* distance of matched string */
|
1163
|
-
// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */
|
1164
|
-
{
|
1165
|
-
//var out_length, in_length, dcode;
|
1166
|
-
|
1167
|
-
s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;
|
1168
|
-
s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;
|
1169
|
-
|
1170
|
-
s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;
|
1171
|
-
s.last_lit++;
|
1172
|
-
|
1173
|
-
if (dist === 0) {
|
1174
|
-
/* lc is the unmatched char */
|
1175
|
-
s.dyn_ltree[lc * 2]/*.Freq*/++;
|
1176
|
-
} else {
|
1177
|
-
s.matches++;
|
1178
|
-
/* Here, lc is the match length - MIN_MATCH */
|
1179
|
-
dist--; /* dist = match distance - 1 */
|
1180
|
-
//Assert((ush)dist < (ush)MAX_DIST(s) &&
|
1181
|
-
// (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
|
1182
|
-
// (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
|
1183
|
-
|
1184
|
-
s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;
|
1185
|
-
s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;
|
1186
|
-
}
|
1187
|
-
|
1188
|
-
// (!) This block is disabled in zlib defaults,
|
1189
|
-
// don't enable it for binary compatibility
|
1190
|
-
|
1191
|
-
//#ifdef TRUNCATE_BLOCK
|
1192
|
-
// /* Try to guess if it is profitable to stop the current block here */
|
1193
|
-
// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {
|
1194
|
-
// /* Compute an upper bound for the compressed length */
|
1195
|
-
// out_length = s.last_lit*8;
|
1196
|
-
// in_length = s.strstart - s.block_start;
|
1197
|
-
//
|
1198
|
-
// for (dcode = 0; dcode < D_CODES; dcode++) {
|
1199
|
-
// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);
|
1200
|
-
// }
|
1201
|
-
// out_length >>>= 3;
|
1202
|
-
// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
|
1203
|
-
// // s->last_lit, in_length, out_length,
|
1204
|
-
// // 100L - out_length*100L/in_length));
|
1205
|
-
// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {
|
1206
|
-
// return true;
|
1207
|
-
// }
|
1208
|
-
// }
|
1209
|
-
//#endif
|
1210
|
-
|
1211
|
-
return (s.last_lit === s.lit_bufsize - 1);
|
1212
|
-
/* We avoid equality with lit_bufsize because of wraparound at 64K
|
1213
|
-
* on 16 bit machines and because stored blocks are restricted to
|
1214
|
-
* 64K-1 bytes.
|
1215
|
-
*/
|
1216
|
-
}
|
1217
|
-
|
1218
|
-
exports._tr_init = _tr_init;
|
1219
|
-
exports._tr_stored_block = _tr_stored_block;
|
1220
|
-
exports._tr_flush_block = _tr_flush_block;
|
1221
|
-
exports._tr_tally = _tr_tally;
|
1222
|
-
exports._tr_align = _tr_align;
|