0x5eal/rbxts-pako
1
0
Fork 0
mirror of https://github.com/0x5eal/rbxts-pako.git synced 2025-04-03 02:10:57 +01:00
Code Issues Projects Releases Packages Wiki Activity

remove unnecessary files for fork

Browse source
This commit is contained in:
daimond113 2024-12-26 10:58:51 +01:00
parent 20d3146428
commit 0404f2d333
No known key found for this signature in database
GPG key ID: 3A8ECE51328B513C
123 changed files with 0 additions and 47595 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

134
.eslintrc.yml
View file

@ -1,134 +0,0 @@
env:
node: true
es6: true
parserOptions:
ecmaVersion: 2015
ignorePatterns:
- coverage/
- dist/
- rollup.config.js
rules:
accessor-pairs: 2
array-bracket-spacing: [ 2, "always", { "singleValue": true, "objectsInArrays": true, "arraysInArrays": true } ]
block-scoped-var: 2
block-spacing: 2
#brace-style: [ 2, '1tbs', { "allowSingleLine": true } ]
#callback-return: 2
comma-dangle: 2
comma-spacing: 2
comma-style: 2
computed-property-spacing: [ 2, never ]
#consistent-return: 2
consistent-this: [ 2, self ]
curly: [ 2, 'multi-line' ]
# dot-notation: [ 2, { allowKeywords: true } ]
dot-location: [ 2, 'property' ]
eol-last: 2
eqeqeq: 2
# func-style: [ 2, declaration ]
guard-for-in: 2
handle-callback-err: 2
indent: [ 2, 2, { VariableDeclarator: { var: 2, let: 2, const: 3 }, SwitchCase: 1, ignoreComments: true, MemberExpression: off, ignoredNodes: ["ConditionalExpression"] } ]
# key-spacing: [ 2, { "align": "value" } ]
keyword-spacing: 2
linebreak-style: 2
#max-depth: [ 1, 3 ]
max-nested-callbacks: [ 1, 7 ]
# string can exceed 80 chars, but should not overflow github website :)
#max-len: [ 2, 120, 1000 ]
new-cap: 2
new-parens: 2
no-alert: 2
no-array-constructor: 2
# no-bitwise: 2
no-caller: 2
no-case-declarations: 2
no-catch-shadow: 2
no-cond-assign: 2
no-console: 1
no-constant-condition: 2
no-control-regex: 2
no-debugger: 1
no-delete-var: 2
no-div-regex: 2
no-dupe-args: 2
no-dupe-keys: 2
no-duplicate-case: 2
no-else-return: 2
# no-empty: 1
no-empty-character-class: 2
no-empty-pattern: 2
no-eq-null: 2
no-eval: 2
no-ex-assign: 2
no-extend-native: 2
no-extra-bind: 2
no-extra-boolean-cast: 2
no-extra-semi: 2
no-fallthrough: 2
no-floating-decimal: 2
no-func-assign: 2
no-implied-eval: 2
no-inner-declarations: 2
no-invalid-regexp: 2
no-irregular-whitespace: 2
no-iterator: 2
#no-labels: 2
no-label-var: 2
no-lone-blocks: 1
no-lonely-if: 2
no-loop-func: 2
no-mixed-requires: [ 1, { "grouping": true } ]
no-mixed-spaces-and-tabs: 2
no-native-reassign: 2
no-negated-in-lhs: 2
no-new: 2
no-new-func: 2
no-new-object: 2
no-new-require: 2
no-new-wrappers: 2
no-obj-calls: 2
no-octal: 2
no-octal-escape: 2
no-path-concat: 2
no-proto: 2
no-redeclare: 2
# no-regex-spaces: 2
no-return-assign: 2
no-self-compare: 2
no-sequences: 2
# no-shadow: 2
no-shadow-restricted-names: 2
no-sparse-arrays: 2
no-throw-literal: 2
no-trailing-spaces: 2
no-undef: 2
no-undef-init: 2
no-undefined: 2
no-unexpected-multiline: 2
no-unreachable: 2
no-unused-expressions: 2
no-unused-vars: 2
no-use-before-define: 2
no-void: 2
no-with: 2
object-curly-spacing: [ 2, always, { "objectsInObjects": true, "arraysInObjects": true } ]
operator-assignment: 1
semi: 2
semi-spacing: 2
space-before-blocks: 2
space-before-function-paren: [ 2, { "anonymous": "always", "named": "never" } ]
space-in-parens: [ 2, never ]
space-infix-ops: [ 2, { int32Hint: true } ]
space-unary-ops: 2
#spaced-comment: [ 1, always, { exceptions: [ '/', '=' ] } ]
strict: [ 2, global ]
quotes: [ 2, single, avoid-escape ]
quote-props: [ 1, 'as-needed', { "keywords": true } ]
radix: 2
use-isnan: 2
valid-typeof: 2
yoda: [ 2, never, { "exceptRange": true } ]

32
.github/workflows/ci.yml vendored
View file

@ -1,32 +0,0 @@
name: CI
on:
push:
pull_request:
schedule:
- cron: '0 0 * * 3'
permissions: read-all
jobs:
build:
runs-on: ubuntu-latest
strategy:
matrix:
# This is last node with original zlib.
# It's required to test deflate binary equality.
node-version: [ '12.16' ]
steps:
- uses: actions/checkout@v2
- name: Use Node.js ${{ matrix.node-version }}
uses: actions/setup-node@v1
with:
node-version: ${{ matrix.node-version }}
- run: npm install
- run: npm test

19
.ndocrc
View file

@ -1,19 +0,0 @@
#
# Common config
################################################################################
--index "./README.md"
--package "./package.json"
--gh-ribbon "https://github.com/{package.repository}"
--output "doc"
--render "html"
--broken-links "throw"
#
# Paths with sources
################################################################################
lib/deflate.js
lib/inflate.js
index.js

222
CHANGELOG.md
View file

@ -1,222 +0,0 @@
# Changelog
All notable changes to this project will be documented in this file.
The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
## [2.1.0] - 2022-11-07
### Changed
- Sync with `zlib` 1.2.12.
### Fixed
- Updated comments in `tree.js` for Babel compatibility, #262.
## [2.0.4] - 2021-07-29
### Fixed
- Use TextEncoder and TextDecoder if available, #228.
- Use pre-generated fixtures instead of node.js zlib.
## [2.0.3] - 2021-01-09
### Fixed
- Add all files explicit to package exports (since behaviour changed
after adding .export field)
## [2.0.2] - 2020-11-19
### Fixed
- Fix esm build named exports.
## [2.0.1] - 2020-11-17
### Changed
- Changed esm build `.js` => `.mjs` to fix node.js `import`.
- Added `module` entry in package.json for some bundlers.
## [2.0.0] - 2020-11-17
### Changed
- Removed binary strings and `Array` support.
- Removed fallbacks for TypedArray methods (`.set()`, `.subarray()`).
- Rewritten top-level wrappers.
- Removed support of `Inflate` & `Deflate` instance create without `new`.
- `Inflate.push()` no longer needs second param (end is auto-detected).
- Increased default inflate chunk size to 64K.
- Moved exported constants to `.constants`.
- Switched to es6. Legacy es5 builds available in `/dist`.
- Added esm build.
- Structure of `/dist` folder changed.
- Upgraded build tools to modern ones.
## [1.0.11] - 2020-01-29
### Fixed
- Fix tests in node.js v12+, #179.
## [1.0.10] - 2019-02-28
### Fixed
- Fix minified version, #161.
## [1.0.9] - 2019-02-28
### Fixed
- Fix `new Buffer()` warning, #154.
## [1.0.8] - 2019-01-14
### Fixed
- Fix raw inflate with dictionary, #155.
## [1.0.7] - 2018-11-29
### Fixed
- Fixed RangeError in Crome 72, #150.
## [1.0.6] - 2017-09-14
### Changed
- Improve @std/esm compatibility.
## [1.0.5] - 2017-03-17
### Changed
- Maintenance. More formal `zlib` attribution and related
changes, #93. Thanks to @bastien-roucaries for the help.
## [1.0.4] - 2016-12-15
### Changed
- Bump dev dependencies.
### Fixed
- Make sure `err.message` is filled on throw.
### Added
- Code examples for utf-16 string encoding & object compression.
## [1.0.3] - 2016-07-25
### Fixed
- Maintenance: re-release to properly display latest version in npm registry
and badges. Because `npm publish` timestamp used instead of versions.
## [1.0.2] - 2016-07-21
### Fixed
- Fixed nasty bug in deflate (wrong `d_buf` offset), which could cause
broken data in some rare cases.
- Also released as 0.2.9 to give chance to old dependents, not updated to 1.x
version.
## [1.0.1] - 2016-04-01
### Added
- Added dictionary support. Thanks to @dignifiedquire.
## [1.0.0] - 2016-02-17
### Changed
- Maintenance release (semver, coding style).
## [0.2.8] - 2015-09-14
### Fixed
- Fixed regression after 0.2.4 for edge conditions in inflate wrapper (#65).
Added more tests to cover possible cases.
## [0.2.7] - 2015-06-09
### Added
- Added Z_SYNC_FLUSH support. Thanks to @TinoLange.
## [0.2.6] - 2015-03-24
### Added
- Allow ArrayBuffer input.
## [0.2.5] - 2014-07-19
### Fixed
- Workaround for Chrome 38.0.2096.0 script parser bug, #30.
## [0.2.4] - 2014-07-07
### Fixed
- Fixed bug in inflate wrapper, #29
## [0.2.3] - 2014-06-09
### Changed
- Maintenance release, dependencies update.
## [0.2.2] - 2014-06-04
### Fixed
- Fixed iOS 5.1 Safari issue with `apply(typed_array)`, #26.
## [0.2.1] - 2014-05-01
### Fixed
- Fixed collision on switch dynamic/fixed tables.
## [0.2.0] - 2014-04-18
### Added
- Added custom gzip headers support.
- Added strings support.
- More coverage tests.
### Fixed
- Improved memory allocations for small chunks.
- ZStream properties rename/cleanup.
## [0.1.1] - 2014-03-20
### Fixed
- Bugfixes for inflate/deflate.
## [0.1.0] - 2014-03-15
### Added
- First release.
[2.1.0]: https://github.com/nodeca/pako/compare/2.0.4...2.1.0
[2.0.4]: https://github.com/nodeca/pako/compare/2.0.3...2.0.4
[2.0.3]: https://github.com/nodeca/pako/compare/2.0.2...2.0.3
[2.0.2]: https://github.com/nodeca/pako/compare/2.0.1...2.0.2
[2.0.1]: https://github.com/nodeca/pako/compare/2.0.0...2.0.1
[2.0.0]: https://github.com/nodeca/pako/compare/1.0.11...2.0.0
[1.0.10]: https://github.com/nodeca/pako/compare/1.0.10...1.0.11
[1.0.10]: https://github.com/nodeca/pako/compare/1.0.9...1.0.10
[1.0.9]: https://github.com/nodeca/pako/compare/1.0.8...1.0.9
[1.0.8]: https://github.com/nodeca/pako/compare/1.0.7...1.0.8
[1.0.7]: https://github.com/nodeca/pako/compare/1.0.6...1.0.7
[1.0.6]: https://github.com/nodeca/pako/compare/1.0.5...1.0.6
[1.0.5]: https://github.com/nodeca/pako/compare/1.0.4...1.0.5
[1.0.4]: https://github.com/nodeca/pako/compare/1.0.3...1.0.4
[1.0.3]: https://github.com/nodeca/pako/compare/1.0.2...1.0.3
[1.0.2]: https://github.com/nodeca/pako/compare/1.0.1...1.0.2
[1.0.1]: https://github.com/nodeca/pako/compare/1.0.0...1.0.1
[1.0.0]: https://github.com/nodeca/pako/compare/0.2.8...1.0.0
[0.2.8]: https://github.com/nodeca/pako/compare/0.2.7...0.2.8
[0.2.7]: https://github.com/nodeca/pako/compare/0.2.6...0.2.7
[0.2.6]: https://github.com/nodeca/pako/compare/0.2.5...0.2.6
[0.2.5]: https://github.com/nodeca/pako/compare/0.2.4...0.2.5
[0.2.4]: https://github.com/nodeca/pako/compare/0.2.3...0.2.4
[0.2.3]: https://github.com/nodeca/pako/compare/0.2.2...0.2.3
[0.2.2]: https://github.com/nodeca/pako/compare/0.2.1...0.2.2
[0.2.1]: https://github.com/nodeca/pako/compare/0.2.0...0.2.1
[0.2.0]: https://github.com/nodeca/pako/compare/0.1.1...0.2.0
[0.1.1]: https://github.com/nodeca/pako/compare/0.1.0...0.1.1
[0.1.0]: https://github.com/nodeca/pako/releases/tag/0.1.0

24
benchmark/README.md
View file

@ -1,24 +0,0 @@
# Dev sandbox
Helpers to measure performance & create benchmarks.
## Setup
```sh
npm i
```
## Benchmarking
```sh
./benchmark.js
```
## Profiling
```sh
node --prof profile.js
node --prof-process isolate-0xnnnnnnnnnnnn-v8.log
```

160
benchmark/benchmark.js
View file

@ -1,160 +0,0 @@
#!/usr/bin/env node
'use strict';
const LEVEL = 6;
const path = require('path');
const fs = require('fs');
const util = require('util');
const Benchmark = require('benchmark');
const ansi = require('ansi');
const cursor = ansi(process.stdout);
const pako = require('../');
const IMPLS_DIRECTORY = path.join(__dirname, 'implementations');
const IMPLS_PATHS = {};
const IMPLS = [];
fs.readdirSync(IMPLS_DIRECTORY).sort().forEach(function (name) {
const file = path.join(IMPLS_DIRECTORY, name);
const code = require(file);
IMPLS_PATHS[name] = file;
IMPLS.push({
name: name,
code: code
});
});
/* eslint-disable no-console */
const SAMPLES_DIRECTORY = path.join(__dirname, 'samples');
const SAMPLES = [];
fs.readdirSync(SAMPLES_DIRECTORY).sort().forEach(function (sample) {
const filepath = path.join(SAMPLES_DIRECTORY, sample);
const extname = path.extname(filepath);
const basename = path.basename(filepath, extname);
const content = {}; // raw/compressed data in different formats
content.buffer = fs.readFileSync(filepath);
content.typed = new Uint8Array(content.buffer);
content.string = fs.readFileSync(filepath, 'utf8');
content.deflateTyped = pako.deflate(content.typed, { level: LEVEL });
content.gzipTyped = pako.gzip(content.typed, { level: LEVEL });
content.deflateRawTyped = pako.deflateRaw(content.typed, { level: LEVEL });
const title = util.format('(%d bytes raw / ~%d bytes compressed)', content.typed.length, content.deflateTyped.length);
function onComplete() {
cursor.write('\n');
}
const suite = new Benchmark.Suite(title, {
onStart: function onStart() {
console.log('\nSample: %s %s', sample, title);
},
onComplete: onComplete
});
IMPLS.forEach(function (impl) {
suite.add(impl.name, {
onCycle: function onCycle(event) {
cursor.horizontalAbsolute();
cursor.eraseLine();
cursor.write(' > ' + event.target);
},
onComplete: onComplete,
defer: !!impl.code.async,
fn: function (deferred) {
if (impl.code.async) {
impl.code.run(content, LEVEL, function () {
deferred.resolve();
return;
});
} else {
impl.code.run(content, LEVEL);
return;
}
}
});
});
SAMPLES.push({
name: basename,
title: title,
content: content,
suite: suite
});
});
function select(patterns) {
const result = [];
if (!(patterns instanceof Array)) {
patterns = [ patterns ];
}
function checkName(name) {
return patterns.length === 0 || patterns.some(function (regexp) {
return regexp.test(name);
});
}
SAMPLES.forEach(function (sample) {
if (checkName(sample.name)) {
result.push(sample);
}
});
return result;
}
function run(files) {
const selected = select(files);
if (selected.length > 0) {
console.log('Selected samples: (%d of %d)', selected.length, SAMPLES.length);
selected.forEach(function (sample) {
console.log(' > %s', sample.name);
});
} else {
console.log('There isn\'t any sample matches any of these patterns: %s', util.inspect(files));
}
selected.forEach(function (sample) {
sample.suite.run();
});
}
module.exports.IMPLS_DIRECTORY = IMPLS_DIRECTORY;
module.exports.IMPLS_PATHS = IMPLS_PATHS;
module.exports.IMPLS = IMPLS;
module.exports.SAMPLES_DIRECTORY = SAMPLES_DIRECTORY;
module.exports.SAMPLES = SAMPLES;
module.exports.select = select;
module.exports.run = run;
run(process.argv.slice(2).map(function (source) {
return new RegExp(source, 'i');
}));

8
benchmark/implementations/deflate-imaya/index.js
View file

@ -1,8 +0,0 @@
'use strict';
const deflateSync = require('zlibjs').deflateSync;
exports.run = (data, level) => {
// Compression levels not supported. Use unknown defaults always
return deflateSync(data.typed, { level: level });
};

7
benchmark/implementations/deflate-pako/index.js
View file

@ -1,7 +0,0 @@
'use strict';
const pako = require('../../../');
exports.run = (data, level) => {
return pako.deflate(data.typed, { level: level });
};

7
benchmark/implementations/deflate-zlib/index.js
View file

@ -1,7 +0,0 @@
'use strict';
const zlib = require('zlib');
exports.run = (data, level) => {
zlib.deflateSync(data.buffer, { level:level });
};

7
benchmark/implementations/gzip-pako/index.js
View file

@ -1,7 +0,0 @@
'use strict';
const pako = require('../../../');
exports.run = (data, level) => {
return pako.gzip(data.typed, { level: level });
};

8
benchmark/implementations/inflate-imaya/index.js
View file

@ -1,8 +0,0 @@
'use strict';
const inflateSync = require('zlibjs').inflateSync;
exports.run = (data/*, level*/) => {
// Compression levels not supported. Use unknown defaults always
return inflateSync(data.deflateTyped);
};

7
benchmark/implementations/inflate-pako/index.js
View file

@ -1,7 +0,0 @@
'use strict';
const pako = require('../../../');
exports.run = (data) => {
return pako.inflate(data.deflateTyped, {});
};

7
benchmark/implementations/inflate-zlib/index.js
View file

@ -1,7 +0,0 @@
'use strict';
const zlib = require('zlib');
exports.run = (data) => {
zlib.inflateSync(data.deflateTyped);
};

8
benchmark/implementations/ungzip-pako/index.js
View file

@ -1,8 +0,0 @@
'use strict';
const pako = require('../../../');
exports.run = (data) => {
return pako.ungzip(data.gzipTyped, {
});
};

9
benchmark/package.json
View file

@ -1,9 +0,0 @@
{
"private": true,
"version": "0.0.0",
"dependencies": {
"ansi": "^0.3.1",
"benchmark": "^2.1.4",
"zlibjs": "^0.3.1"
}
}

13
benchmark/profile.js
View file

@ -1,13 +0,0 @@
'use strict';
const fs = require('fs');
const path = require('path');
const pako = require('../');
const data = new Uint8Array(fs.readFileSync(path.join(__dirname, '/samples/lorem_1mb.txt')));
const deflated = pako.deflate(data, { level: 6/*, to: 'string'*/ });
for (let i = 0; i < 200; i++) {
pako.inflate(deflated, { to: 'string' });
}

3140
benchmark/samples/lorem_1mb.txt
View file

File diff suppressed because it is too large Load diff

6688
dist/pako.es5.js vendored
View file

File diff suppressed because it is too large Load diff

2
dist/pako.es5.min.js vendored
View file

File diff suppressed because one or more lines are too long

6877
dist/pako.esm.mjs vendored
View file

File diff suppressed because it is too large Load diff

6896
dist/pako.js vendored
View file

File diff suppressed because it is too large Load diff

2
dist/pako.min.js vendored
View file

File diff suppressed because one or more lines are too long

3924
dist/pako_deflate.es5.js vendored
View file

File diff suppressed because it is too large Load diff

2
dist/pako_deflate.es5.min.js vendored
View file

File diff suppressed because one or more lines are too long

4126
dist/pako_deflate.js vendored
View file

File diff suppressed because it is too large Load diff

2
dist/pako_deflate.min.js vendored
View file

File diff suppressed because one or more lines are too long

3229
dist/pako_inflate.es5.js vendored
View file

File diff suppressed because it is too large Load diff

2
dist/pako_inflate.es5.min.js vendored
View file

File diff suppressed because one or more lines are too long

3239
dist/pako_inflate.js vendored
View file

File diff suppressed because it is too large Load diff

2
dist/pako_inflate.min.js vendored
View file

File diff suppressed because one or more lines are too long

2
examples/.eslintrc.yml
View file

@ -1,2 +0,0 @@
parserOptions:
ecmaVersion: 2017

6
examples/README.md
View file

@ -1,6 +0,0 @@
Demo of sending compressed objects from browser to server.
Run `node server.js` and open `browser.html`.
__Warning!__ This is the sample only, to show data reencoding steps. It does
not have error checks and so on. Don't copy-paste to production code "as is".

54
examples/browser.html
View file

@ -1,54 +0,0 @@
<!DOCTYPE html>
<html>
<meta charset="UTF-8">
<script src="https://cdn.jsdelivr.net/pako/1.0.3/pako.min.js"></script>
<script>
'use strict';
// Initial object //////////////////////////////////////////////////////////////
const obj = [
{ foo: 'bar', baz: 'БАТ' },
{ abra: 1, cadabra: null }
]
// Convert /////////////////////////////////////////////////////////////////////
var str = JSON.stringify(obj);
// Compress ////////////////////////////////////////////////////////////////////
var result = window.pako.deflate(str);
// Send data to server
//
// Use multipart/form-data:
//
// - small overhead
// - well known format, easy to process anywhere
//
/////////////////////////////////////////////////////////
function send() {
var xhr = new XMLHttpRequest;
console.log('Sending data...');
xhr.open('POST', 'http://localhost:8000/', true);
var formData = new FormData(document.forms.person);
var blob = new Blob([ result ], { type: 'application/octet-stream'});
formData.append('binson', blob);
xhr.send(formData);
setTimeout(send, 5000);
}
send();
</script>
</html>
<body>
Sending objects to server, run server code to see result.
</body>

94
examples/server.js
View file

@ -1,94 +0,0 @@
'use strict';
/* eslint-disable no-console */
const http = require('http');
const multiparty = require('multiparty');
const fs = require('fs');
const zlib = require('zlib');
const util = require('util');
const readFile = util.promisify(fs.readFile);
const inflate = util.promisify(zlib.inflate);
const MULTIPART_RE = /^multipart\/form-data(?:;|$)/i;
const MAX_FIELDS_SIZE = 100 * 1024; // 100kb
const MAX_FILES_SIZE = 10 * 1024 * 1024; // 10mb
function error(msg) {
let e = new Error(msg);
e.statusCode = 400;
return e;
}
const server = http.createServer(async (req, res) => {
console.log('--- received request');
// Quick hack to bypass security restrictions when demo html is opened from
// file system. Don't do such things on production.
res.setHeader('Access-Control-Allow-Origin', '*');
try {
//
// Check request size early by header and terminate immediately for big data
//
const length = parseInt((req.headers['content-length'] || '0'), 10);
if (!length || isNaN(length)) throw error('Length required');
if (!MULTIPART_RE.test(req.headers['content-type'])) {
throw error('Expect form data');
}
let err = null;
const form = new multiparty.Form({
maxFieldsSize: MAX_FIELDS_SIZE,
maxFilesSize: MAX_FILES_SIZE
});
const files = await new Promise(resolve => {
form.parse(req, function (e, fields, files) {
if (e) err = e;
resolve(files);
});
});
if (err) {
err.statusCode = err.statusCode || 400;
throw err;
}
const bin = await readFile(files.binson[0].path);
// Kludge - here we should cleanup all files
fs.unlinkSync(files.binson[0].path);
// Decompress binary content
// Note! Can throw error on bad data
const uncompressed = await inflate(bin);
// Convert utf8 buffer -> utf16 string (native JavaScript string format)
const decoded = uncompressed.toString();
// Finally, create an object
// Note! Can throw error on bad data
const obj = JSON.parse(decoded);
console.log('--- received object is: ', obj);
res.end('ok');
}
catch (err) {
console.log(err);
res.statusCode = err.statusCode || 400;
res.end(err.message);
}
});
server.listen(8000);
console.log('Listening browser requests. Open `browser.html` to see');

18
index.js
View file

@ -1,18 +0,0 @@
// Top level file is just a mixin of submodules & constants
'use strict';
const { Deflate, deflate, deflateRaw, gzip } = require('./lib/deflate');
const { Inflate, inflate, inflateRaw, ungzip } = require('./lib/inflate');
const constants = require('./lib/zlib/constants');
module.exports.Deflate = Deflate;
module.exports.deflate = deflate;
module.exports.deflateRaw = deflateRaw;
module.exports.gzip = gzip;
module.exports.Inflate = Inflate;
module.exports.inflate = inflate;
module.exports.inflateRaw = inflateRaw;
module.exports.ungzip = ungzip;
module.exports.constants = constants;

380
lib/deflate.js
View file

@ -1,380 +0,0 @@
'use strict';
const zlib_deflate = require('./zlib/deflate');
const utils = require('./utils/common');
const strings = require('./utils/strings');
const msg = require('./zlib/messages');
const ZStream = require('./zlib/zstream');
const toString = Object.prototype.toString;
/* Public constants ==========================================================*/
/* ===========================================================================*/
const {
Z_NO_FLUSH, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH,
Z_OK, Z_STREAM_END,
Z_DEFAULT_COMPRESSION,
Z_DEFAULT_STRATEGY,
Z_DEFLATED
} = require('./zlib/constants');
/* ===========================================================================*/
/**
* class Deflate
*
* Generic JS-style wrapper for zlib calls. If you don't need
* streaming behaviour - use more simple functions: [[deflate]],
* [[deflateRaw]] and [[gzip]].
**/
/* internal
* Deflate.chunks -> Array
*
* Chunks of output data, if [[Deflate#onData]] not overridden.
**/
/**
* Deflate.result -> Uint8Array
*
* Compressed result, generated by default [[Deflate#onData]]
* and [[Deflate#onEnd]] handlers. Filled after you push last chunk
* (call [[Deflate#push]] with `Z_FINISH` / `true` param).
**/
/**
* Deflate.err -> Number
*
* Error code after deflate finished. 0 (Z_OK) on success.
* You will not need it in real life, because deflate errors
* are possible only on wrong options or bad `onData` / `onEnd`
* custom handlers.
**/
/**
* Deflate.msg -> String
*
* Error message, if [[Deflate.err]] != 0
**/
/**
* new Deflate(options)
* - options (Object): zlib deflate options.
*
* Creates new deflator instance with specified params. Throws exception
* on bad params. Supported options:
*
* - `level`
* - `windowBits`
* - `memLevel`
* - `strategy`
* - `dictionary`
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information on these.
*
* Additional options, for internal needs:
*
* - `chunkSize` - size of generated data chunks (16K by default)
* - `raw` (Boolean) - do raw deflate
* - `gzip` (Boolean) - create gzip wrapper
* - `header` (Object) - custom header for gzip
* - `text` (Boolean) - true if compressed data believed to be text
* - `time` (Number) - modification time, unix timestamp
* - `os` (Number) - operation system code
* - `extra` (Array) - array of bytes with extra data (max 65536)
* - `name` (String) - file name (binary string)
* - `comment` (String) - comment (binary string)
* - `hcrc` (Boolean) - true if header crc should be added
*
* ##### Example:
*
* ```javascript
* const pako = require('pako')
* , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])
* , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);
*
* const deflate = new pako.Deflate({ level: 3});
*
* deflate.push(chunk1, false);
* deflate.push(chunk2, true); // true -> last chunk
*
* if (deflate.err) { throw new Error(deflate.err); }
*
* console.log(deflate.result);
* ```
**/
function Deflate(options) {
this.options = utils.assign({
level: Z_DEFAULT_COMPRESSION,
method: Z_DEFLATED,
chunkSize: 16384,
windowBits: 15,
memLevel: 8,
strategy: Z_DEFAULT_STRATEGY
}, options || {});
let opt = this.options;
if (opt.raw && (opt.windowBits > 0)) {
opt.windowBits = -opt.windowBits;
}
else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {
opt.windowBits += 16;
}
this.err = 0; // error code, if happens (0 = Z_OK)
this.msg = ''; // error message
this.ended = false; // used to avoid multiple onEnd() calls
this.chunks = []; // chunks of compressed data
this.strm = new ZStream();
this.strm.avail_out = 0;
let status = zlib_deflate.deflateInit2(
this.strm,
opt.level,
opt.method,
opt.windowBits,
opt.memLevel,
opt.strategy
);
if (status !== Z_OK) {
throw new Error(msg[status]);
}
if (opt.header) {
zlib_deflate.deflateSetHeader(this.strm, opt.header);
}
if (opt.dictionary) {
let dict;
// Convert data if needed
if (typeof opt.dictionary === 'string') {
// If we need to compress text, change encoding to utf8.
dict = strings.string2buf(opt.dictionary);
} else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {
dict = new Uint8Array(opt.dictionary);
} else {
dict = opt.dictionary;
}
status = zlib_deflate.deflateSetDictionary(this.strm, dict);
if (status !== Z_OK) {
throw new Error(msg[status]);
}
this._dict_set = true;
}
}
/**
* Deflate#push(data[, flush_mode]) -> Boolean
* - data (Uint8Array|ArrayBuffer|String): input data. Strings will be
* converted to utf8 byte sequence.
* - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.
* See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.
*
* Sends input data to deflate pipe, generating [[Deflate#onData]] calls with
* new compressed chunks. Returns `true` on success. The last data block must
* have `flush_mode` Z_FINISH (or `true`). That will flush internal pending
* buffers and call [[Deflate#onEnd]].
*
* On fail call [[Deflate#onEnd]] with error code and return false.
*
* ##### Example
*
* ```javascript
* push(chunk, false); // push one of data chunks
* ...
* push(chunk, true); // push last chunk
* ```
**/
Deflate.prototype.push = function (data, flush_mode) {
const strm = this.strm;
const chunkSize = this.options.chunkSize;
let status, _flush_mode;
if (this.ended) { return false; }
if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;
else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;
// Convert data if needed
if (typeof data === 'string') {
// If we need to compress text, change encoding to utf8.
strm.input = strings.string2buf(data);
} else if (toString.call(data) === '[object ArrayBuffer]') {
strm.input = new Uint8Array(data);
} else {
strm.input = data;
}
strm.next_in = 0;
strm.avail_in = strm.input.length;
for (;;) {
if (strm.avail_out === 0) {
strm.output = new Uint8Array(chunkSize);
strm.next_out = 0;
strm.avail_out = chunkSize;
}
// Make sure avail_out > 6 to avoid repeating markers
if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {
this.onData(strm.output.subarray(0, strm.next_out));
strm.avail_out = 0;
continue;
}
status = zlib_deflate.deflate(strm, _flush_mode);
// Ended => flush and finish
if (status === Z_STREAM_END) {
if (strm.next_out > 0) {
this.onData(strm.output.subarray(0, strm.next_out));
}
status = zlib_deflate.deflateEnd(this.strm);
this.onEnd(status);
this.ended = true;
return status === Z_OK;
}
// Flush if out buffer full
if (strm.avail_out === 0) {
this.onData(strm.output);
continue;
}
// Flush if requested and has data
if (_flush_mode > 0 && strm.next_out > 0) {
this.onData(strm.output.subarray(0, strm.next_out));
strm.avail_out = 0;
continue;
}
if (strm.avail_in === 0) break;
}
return true;
};
/**
* Deflate#onData(chunk) -> Void
* - chunk (Uint8Array): output data.
*
* By default, stores data blocks in `chunks[]` property and glue
* those in `onEnd`. Override this handler, if you need another behaviour.
**/
Deflate.prototype.onData = function (chunk) {
this.chunks.push(chunk);
};
/**
* Deflate#onEnd(status) -> Void
* - status (Number): deflate status. 0 (Z_OK) on success,
* other if not.
*
* Called once after you tell deflate that the input stream is
* complete (Z_FINISH). By default - join collected chunks,
* free memory and fill `results` / `err` properties.
**/
Deflate.prototype.onEnd = function (status) {
// On success - join
if (status === Z_OK) {
this.result = utils.flattenChunks(this.chunks);
}
this.chunks = [];
this.err = status;
this.msg = this.strm.msg;
};
/**
* deflate(data[, options]) -> Uint8Array
* - data (Uint8Array|ArrayBuffer|String): input data to compress.
* - options (Object): zlib deflate options.
*
* Compress `data` with deflate algorithm and `options`.
*
* Supported options are:
*
* - level
* - windowBits
* - memLevel
* - strategy
* - dictionary
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information on these.
*
* Sugar (options):
*
* - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
* negative windowBits implicitly.
*
* ##### Example:
*
* ```javascript
* const pako = require('pako')
* const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);
*
* console.log(pako.deflate(data));
* ```
**/
function deflate(input, options) {
const deflator = new Deflate(options);
deflator.push(input, true);
// That will never happens, if you don't cheat with options :)
if (deflator.err) { throw deflator.msg || msg[deflator.err]; }
return deflator.result;
}
/**
* deflateRaw(data[, options]) -> Uint8Array
* - data (Uint8Array|ArrayBuffer|String): input data to compress.
* - options (Object): zlib deflate options.
*
* The same as [[deflate]], but creates raw data, without wrapper
* (header and adler32 crc).
**/
function deflateRaw(input, options) {
options = options || {};
options.raw = true;
return deflate(input, options);
}
/**
* gzip(data[, options]) -> Uint8Array
* - data (Uint8Array|ArrayBuffer|String): input data to compress.
* - options (Object): zlib deflate options.
*
* The same as [[deflate]], but create gzip wrapper instead of
* deflate one.
**/
function gzip(input, options) {
options = options || {};
options.gzip = true;
return deflate(input, options);
}
module.exports.Deflate = Deflate;
module.exports.deflate = deflate;
module.exports.deflateRaw = deflateRaw;
module.exports.gzip = gzip;
module.exports.constants = require('./zlib/constants');

419
lib/inflate.js
View file

@ -1,419 +0,0 @@
'use strict';
const zlib_inflate = require('./zlib/inflate');
const utils = require('./utils/common');
const strings = require('./utils/strings');
const msg = require('./zlib/messages');
const ZStream = require('./zlib/zstream');
const GZheader = require('./zlib/gzheader');
const toString = Object.prototype.toString;
/* Public constants ==========================================================*/
/* ===========================================================================*/
const {
Z_NO_FLUSH, Z_FINISH,
Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR
} = require('./zlib/constants');
/* ===========================================================================*/
/**
* class Inflate
*
* Generic JS-style wrapper for zlib calls. If you don't need
* streaming behaviour - use more simple functions: [[inflate]]
* and [[inflateRaw]].
**/
/* internal
* inflate.chunks -> Array
*
* Chunks of output data, if [[Inflate#onData]] not overridden.
**/
/**
* Inflate.result -> Uint8Array|String
*
* Uncompressed result, generated by default [[Inflate#onData]]
* and [[Inflate#onEnd]] handlers. Filled after you push last chunk
* (call [[Inflate#push]] with `Z_FINISH` / `true` param).
**/
/**
* Inflate.err -> Number
*
* Error code after inflate finished. 0 (Z_OK) on success.
* Should be checked if broken data possible.
**/
/**
* Inflate.msg -> String
*
* Error message, if [[Inflate.err]] != 0
**/
/**
* new Inflate(options)
* - options (Object): zlib inflate options.
*
* Creates new inflator instance with specified params. Throws exception
* on bad params. Supported options:
*
* - `windowBits`
* - `dictionary`
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information on these.
*
* Additional options, for internal needs:
*
* - `chunkSize` - size of generated data chunks (16K by default)
* - `raw` (Boolean) - do raw inflate
* - `to` (String) - if equal to 'string', then result will be converted
* from utf8 to utf16 (javascript) string. When string output requested,
* chunk length can differ from `chunkSize`, depending on content.
*
* By default, when no options set, autodetect deflate/gzip data format via
* wrapper header.
*
* ##### Example:
*
* ```javascript
* const pako = require('pako')
* const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])
* const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);
*
* const inflate = new pako.Inflate({ level: 3});
*
* inflate.push(chunk1, false);
* inflate.push(chunk2, true); // true -> last chunk
*
* if (inflate.err) { throw new Error(inflate.err); }
*
* console.log(inflate.result);
* ```
**/
function Inflate(options) {
this.options = utils.assign({
chunkSize: 1024 * 64,
windowBits: 15,
to: ''
}, options || {});
const opt = this.options;
// Force window size for `raw` data, if not set directly,
// because we have no header for autodetect.
if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {
opt.windowBits = -opt.windowBits;
if (opt.windowBits === 0) { opt.windowBits = -15; }
}
// If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate
if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&
!(options && options.windowBits)) {
opt.windowBits += 32;
}
// Gzip header has no info about windows size, we can do autodetect only
// for deflate. So, if window size not set, force it to max when gzip possible
if ((opt.windowBits > 15) && (opt.windowBits < 48)) {
// bit 3 (16) -> gzipped data
// bit 4 (32) -> autodetect gzip/deflate
if ((opt.windowBits & 15) === 0) {
opt.windowBits |= 15;
}
}
this.err = 0; // error code, if happens (0 = Z_OK)
this.msg = ''; // error message
this.ended = false; // used to avoid multiple onEnd() calls
this.chunks = []; // chunks of compressed data
this.strm = new ZStream();
this.strm.avail_out = 0;
let status = zlib_inflate.inflateInit2(
this.strm,
opt.windowBits
);
if (status !== Z_OK) {
throw new Error(msg[status]);
}
this.header = new GZheader();
zlib_inflate.inflateGetHeader(this.strm, this.header);
// Setup dictionary
if (opt.dictionary) {
// Convert data if needed
if (typeof opt.dictionary === 'string') {
opt.dictionary = strings.string2buf(opt.dictionary);
} else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {
opt.dictionary = new Uint8Array(opt.dictionary);
}
if (opt.raw) { //In raw mode we need to set the dictionary early
status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);
if (status !== Z_OK) {
throw new Error(msg[status]);
}
}
}
}
/**
* Inflate#push(data[, flush_mode]) -> Boolean
* - data (Uint8Array|ArrayBuffer): input data
* - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE
* flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,
* `true` means Z_FINISH.
*
* Sends input data to inflate pipe, generating [[Inflate#onData]] calls with
* new output chunks. Returns `true` on success. If end of stream detected,
* [[Inflate#onEnd]] will be called.
*
* `flush_mode` is not needed for normal operation, because end of stream
* detected automatically. You may try to use it for advanced things, but
* this functionality was not tested.
*
* On fail call [[Inflate#onEnd]] with error code and return false.
*
* ##### Example
*
* ```javascript
* push(chunk, false); // push one of data chunks
* ...
* push(chunk, true); // push last chunk
* ```
**/
Inflate.prototype.push = function (data, flush_mode) {
const strm = this.strm;
const chunkSize = this.options.chunkSize;
const dictionary = this.options.dictionary;
let status, _flush_mode, last_avail_out;
if (this.ended) return false;
if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;
else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;
// Convert data if needed
if (toString.call(data) === '[object ArrayBuffer]') {
strm.input = new Uint8Array(data);
} else {
strm.input = data;
}
strm.next_in = 0;
strm.avail_in = strm.input.length;
for (;;) {
if (strm.avail_out === 0) {
strm.output = new Uint8Array(chunkSize);
strm.next_out = 0;
strm.avail_out = chunkSize;
}
status = zlib_inflate.inflate(strm, _flush_mode);
if (status === Z_NEED_DICT && dictionary) {
status = zlib_inflate.inflateSetDictionary(strm, dictionary);
if (status === Z_OK) {
status = zlib_inflate.inflate(strm, _flush_mode);
} else if (status === Z_DATA_ERROR) {
// Replace code with more verbose
status = Z_NEED_DICT;
}
}
// Skip snyc markers if more data follows and not raw mode
while (strm.avail_in > 0 &&
status === Z_STREAM_END &&
strm.state.wrap > 0 &&
data[strm.next_in] !== 0)
{
zlib_inflate.inflateReset(strm);
status = zlib_inflate.inflate(strm, _flush_mode);
}
switch (status) {
case Z_STREAM_ERROR:
case Z_DATA_ERROR:
case Z_NEED_DICT:
case Z_MEM_ERROR:
this.onEnd(status);
this.ended = true;
return false;
}
// Remember real `avail_out` value, because we may patch out buffer content
// to align utf8 strings boundaries.
last_avail_out = strm.avail_out;
if (strm.next_out) {
if (strm.avail_out === 0 || status === Z_STREAM_END) {
if (this.options.to === 'string') {
let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);
let tail = strm.next_out - next_out_utf8;
let utf8str = strings.buf2string(strm.output, next_out_utf8);
// move tail & realign counters
strm.next_out = tail;
strm.avail_out = chunkSize - tail;
if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);
this.onData(utf8str);
} else {
this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));
}
}
}
// Must repeat iteration if out buffer is full
if (status === Z_OK && last_avail_out === 0) continue;
// Finalize if end of stream reached.
if (status === Z_STREAM_END) {
status = zlib_inflate.inflateEnd(this.strm);
this.onEnd(status);
this.ended = true;
return true;
}
if (strm.avail_in === 0) break;
}
return true;
};
/**
* Inflate#onData(chunk) -> Void
* - chunk (Uint8Array|String): output data. When string output requested,
* each chunk will be string.
*
* By default, stores data blocks in `chunks[]` property and glue
* those in `onEnd`. Override this handler, if you need another behaviour.
**/
Inflate.prototype.onData = function (chunk) {
this.chunks.push(chunk);
};
/**
* Inflate#onEnd(status) -> Void
* - status (Number): inflate status. 0 (Z_OK) on success,
* other if not.
*
* Called either after you tell inflate that the input stream is
* complete (Z_FINISH). By default - join collected chunks,
* free memory and fill `results` / `err` properties.
**/
Inflate.prototype.onEnd = function (status) {
// On success - join
if (status === Z_OK) {
if (this.options.to === 'string') {
this.result = this.chunks.join('');
} else {
this.result = utils.flattenChunks(this.chunks);
}
}
this.chunks = [];
this.err = status;
this.msg = this.strm.msg;
};
/**
* inflate(data[, options]) -> Uint8Array|String
* - data (Uint8Array|ArrayBuffer): input data to decompress.
* - options (Object): zlib inflate options.
*
* Decompress `data` with inflate/ungzip and `options`. Autodetect
* format via wrapper header by default. That's why we don't provide
* separate `ungzip` method.
*
* Supported options are:
*
* - windowBits
*
* [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)
* for more information.
*
* Sugar (options):
*
* - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify
* negative windowBits implicitly.
* - `to` (String) - if equal to 'string', then result will be converted
* from utf8 to utf16 (javascript) string. When string output requested,
* chunk length can differ from `chunkSize`, depending on content.
*
*
* ##### Example:
*
* ```javascript
* const pako = require('pako');
* const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));
* let output;
*
* try {
* output = pako.inflate(input);
* } catch (err) {
* console.log(err);
* }
* ```
**/
function inflate(input, options) {
const inflator = new Inflate(options);
inflator.push(input);
// That will never happens, if you don't cheat with options :)
if (inflator.err) throw inflator.msg || msg[inflator.err];
return inflator.result;
}
/**
* inflateRaw(data[, options]) -> Uint8Array|String
* - data (Uint8Array|ArrayBuffer): input data to decompress.
* - options (Object): zlib inflate options.
*
* The same as [[inflate]], but creates raw data, without wrapper
* (header and adler32 crc).
**/
function inflateRaw(input, options) {
options = options || {};
options.raw = true;
return inflate(input, options);
}
/**
* ungzip(data[, options]) -> Uint8Array|String
* - data (Uint8Array|ArrayBuffer): input data to decompress.
* - options (Object): zlib inflate options.
*
* Just shortcut to [[inflate]], because it autodetects format
* by header.content. Done for convenience.
**/
module.exports.Inflate = Inflate;
module.exports.inflate = inflate;
module.exports.inflateRaw = inflateRaw;
module.exports.ungzip = inflate;
module.exports.constants = require('./zlib/constants');

48
lib/utils/common.js
View file

@ -1,48 +0,0 @@
'use strict';
const _has = (obj, key) => {
return Object.prototype.hasOwnProperty.call(obj, key);
};
module.exports.assign = function (obj /*from1, from2, from3, ...*/) {
const sources = Array.prototype.slice.call(arguments, 1);
while (sources.length) {
const source = sources.shift();
if (!source) { continue; }
if (typeof source !== 'object') {
throw new TypeError(source + 'must be non-object');
}
for (const p in source) {
if (_has(source, p)) {
obj[p] = source[p];
}
}
}
return obj;
};
// Join array of chunks to single array.
module.exports.flattenChunks = (chunks) => {
// calculate data length
let len = 0;
for (let i = 0, l = chunks.length; i < l; i++) {
len += chunks[i].length;
}
// join chunks
const result = new Uint8Array(len);
for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {
let chunk = chunks[i];
result.set(chunk, pos);
pos += chunk.length;
}
return result;
};

174
lib/utils/strings.js
View file

@ -1,174 +0,0 @@
// String encode/decode helpers
'use strict';
// Quick check if we can use fast array to bin string conversion
//
// - apply(Array) can fail on Android 2.2
// - apply(Uint8Array) can fail on iOS 5.1 Safari
//
let STR_APPLY_UIA_OK = true;
try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }
// Table with utf8 lengths (calculated by first byte of sequence)
// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,
// because max possible codepoint is 0x10ffff
const _utf8len = new Uint8Array(256);
for (let q = 0; q < 256; q++) {
_utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);
}
_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start
// convert string to array (typed, when possible)
module.exports.string2buf = (str) => {
if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {
return new TextEncoder().encode(str);
}
let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;
// count binary size
for (m_pos = 0; m_pos < str_len; m_pos++) {
c = str.charCodeAt(m_pos);
if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {
c2 = str.charCodeAt(m_pos + 1);
if ((c2 & 0xfc00) === 0xdc00) {
c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
m_pos++;
}
}
buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;
}
// allocate buffer
buf = new Uint8Array(buf_len);
// convert
for (i = 0, m_pos = 0; i < buf_len; m_pos++) {
c = str.charCodeAt(m_pos);
if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {
c2 = str.charCodeAt(m_pos + 1);
if ((c2 & 0xfc00) === 0xdc00) {
c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);
m_pos++;
}
}
if (c < 0x80) {
/* one byte */
buf[i++] = c;
} else if (c < 0x800) {
/* two bytes */
buf[i++] = 0xC0 | (c >>> 6);
buf[i++] = 0x80 | (c & 0x3f);
} else if (c < 0x10000) {
/* three bytes */
buf[i++] = 0xE0 | (c >>> 12);
buf[i++] = 0x80 | (c >>> 6 & 0x3f);
buf[i++] = 0x80 | (c & 0x3f);
} else {
/* four bytes */
buf[i++] = 0xf0 | (c >>> 18);
buf[i++] = 0x80 | (c >>> 12 & 0x3f);
buf[i++] = 0x80 | (c >>> 6 & 0x3f);
buf[i++] = 0x80 | (c & 0x3f);
}
}
return buf;
};
// Helper
const buf2binstring = (buf, len) => {
// On Chrome, the arguments in a function call that are allowed is `65534`.
// If the length of the buffer is smaller than that, we can use this optimization,
// otherwise we will take a slower path.
if (len < 65534) {
if (buf.subarray && STR_APPLY_UIA_OK) {
return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));
}
}
let result = '';
for (let i = 0; i < len; i++) {
result += String.fromCharCode(buf[i]);
}
return result;
};
// convert array to string
module.exports.buf2string = (buf, max) => {
const len = max || buf.length;
if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {
return new TextDecoder().decode(buf.subarray(0, max));
}
let i, out;
// Reserve max possible length (2 words per char)
// NB: by unknown reasons, Array is significantly faster for
// String.fromCharCode.apply than Uint16Array.
const utf16buf = new Array(len * 2);
for (out = 0, i = 0; i < len;) {
let c = buf[i++];
// quick process ascii
if (c < 0x80) { utf16buf[out++] = c; continue; }
let c_len = _utf8len[c];
// skip 5 & 6 byte codes
if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }
// apply mask on first byte
c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;
// join the rest
while (c_len > 1 && i < len) {
c = (c << 6) | (buf[i++] & 0x3f);
c_len--;
}
// terminated by end of string?
if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }
if (c < 0x10000) {
utf16buf[out++] = c;
} else {
c -= 0x10000;
utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);
utf16buf[out++] = 0xdc00 | (c & 0x3ff);
}
}
return buf2binstring(utf16buf, out);
};
// Calculate max possible position in utf8 buffer,
// that will not break sequence. If that's not possible
// - (very small limits) return max size as is.
//
// buf[] - utf8 bytes array
// max - length limit (mandatory);
module.exports.utf8border = (buf, max) => {
max = max || buf.length;
if (max > buf.length) { max = buf.length; }
// go back from last position, until start of sequence found
let pos = max - 1;
while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }
// Very small and broken sequence,
// return max, because we should return something anyway.
if (pos < 0) { return max; }
// If we came to start of buffer - that means buffer is too small,
// return max too.
if (pos === 0) { return max; }
return (pos + _utf8len[buf[pos]] > max) ? pos : max;
};

59
lib/zlib/README
View file

@ -1,59 +0,0 @@
Content of this folder follows zlib C sources as close as possible.
That's intended to simplify maintainability and guarantee equal API
and result.
Key differences:
- Everything is in JavaScript.
- No platform-dependent blocks.
- Some things like crc32 rewritten to keep size small and make JIT
work better.
- Some code is different due missed features in JS (macros, pointers,
structures, header files)
- Specific API methods are not implemented (see notes in root readme)
This port is based on zlib 1.2.8.
This port is under zlib license (see below) with contribution and addition of javascript
port under expat license (see LICENSE at root of project)
Copyright:
(C) 1995-2013 Jean-loup Gailly and Mark Adler
(C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
From zlib's README
=============================================================================
Acknowledgments:
The deflate format used by zlib was defined by Phil Katz. The deflate and
zlib specifications were written by L. Peter Deutsch. Thanks to all the
people who reported problems and suggested various improvements in zlib; they
are too numerous to cite here.
Copyright notice:
(C) 1995-2013 Jean-loup Gailly and Mark Adler
Copyright (c) <''year''> <''copyright holders''>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
Jean-loup Gailly Mark Adler
jloup@gzip.org madler@alumni.caltech.edu

51
lib/zlib/adler32.js
View file

@ -1,51 +0,0 @@
'use strict';
// Note: adler32 takes 12% for level 0 and 2% for level 6.
// It isn't worth it to make additional optimizations as in original.
// Small size is preferable.
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
const adler32 = (adler, buf, len, pos) => {
let s1 = (adler & 0xffff) |0,
s2 = ((adler >>> 16) & 0xffff) |0,
n = 0;
while (len !== 0) {
// Set limit ~ twice less than 5552, to keep
// s2 in 31-bits, because we force signed ints.
// in other case %= will fail.
n = len > 2000 ? 2000 : len;
len -= n;
do {
s1 = (s1 + buf[pos++]) |0;
s2 = (s2 + s1) |0;
} while (--n);
s1 %= 65521;
s2 %= 65521;
}
return (s1 | (s2 << 16)) |0;
};
module.exports = adler32;

68
lib/zlib/constants.js
View file

@ -1,68 +0,0 @@
'use strict';
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
module.exports = {
/* Allowed flush values; see deflate() and inflate() below for details */
Z_NO_FLUSH: 0,
Z_PARTIAL_FLUSH: 1,
Z_SYNC_FLUSH: 2,
Z_FULL_FLUSH: 3,
Z_FINISH: 4,
Z_BLOCK: 5,
Z_TREES: 6,
/* Return codes for the compression/decompression functions. Negative values
* are errors, positive values are used for special but normal events.
*/
Z_OK: 0,
Z_STREAM_END: 1,
Z_NEED_DICT: 2,
Z_ERRNO: -1,
Z_STREAM_ERROR: -2,
Z_DATA_ERROR: -3,
Z_MEM_ERROR: -4,
Z_BUF_ERROR: -5,
//Z_VERSION_ERROR: -6,
/* compression levels */
Z_NO_COMPRESSION: 0,
Z_BEST_SPEED: 1,
Z_BEST_COMPRESSION: 9,
Z_DEFAULT_COMPRESSION: -1,
Z_FILTERED: 1,
Z_HUFFMAN_ONLY: 2,
Z_RLE: 3,
Z_FIXED: 4,
Z_DEFAULT_STRATEGY: 0,
/* Possible values of the data_type field (though see inflate()) */
Z_BINARY: 0,
Z_TEXT: 1,
//Z_ASCII: 1, // = Z_TEXT (deprecated)
Z_UNKNOWN: 2,
/* The deflate compression method */
Z_DEFLATED: 8
//Z_NULL: null // Use -1 or null inline, depending on var type
};

59
lib/zlib/crc32.js
View file

@ -1,59 +0,0 @@
'use strict';
// Note: we can't get significant speed boost here.
// So write code to minimize size - no pregenerated tables
// and array tools dependencies.
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
// Use ordinary array, since untyped makes no boost here
const makeTable = () => {
let c, table = [];
for (var n = 0; n < 256; n++) {
c = n;
for (var k = 0; k < 8; k++) {
c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
}
table[n] = c;
}
return table;
};
// Create table on load. Just 255 signed longs. Not a problem.
const crcTable = new Uint32Array(makeTable());
const crc32 = (crc, buf, len, pos) => {
const t = crcTable;
const end = pos + len;
crc ^= -1;
for (let i = pos; i < end; i++) {
crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
}
return (crc ^ (-1)); // >>> 0;
};
module.exports = crc32;

2048
lib/zlib/deflate.js
View file

File diff suppressed because it is too large Load diff

58
lib/zlib/gzheader.js
View file

@ -1,58 +0,0 @@
'use strict';
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
function GZheader() {
/* true if compressed data believed to be text */
this.text = 0;
/* modification time */
this.time = 0;
/* extra flags (not used when writing a gzip file) */
this.xflags = 0;
/* operating system */
this.os = 0;
/* pointer to extra field or Z_NULL if none */
this.extra = null;
/* extra field length (valid if extra != Z_NULL) */
this.extra_len = 0; // Actually, we don't need it in JS,
// but leave for few code modifications
//
// Setup limits is not necessary because in js we should not preallocate memory
// for inflate use constant limit in 65536 bytes
//
/* space at extra (only when reading header) */
// this.extra_max = 0;
/* pointer to zero-terminated file name or Z_NULL */
this.name = '';
/* space at name (only when reading header) */
// this.name_max = 0;
/* pointer to zero-terminated comment or Z_NULL */
this.comment = '';
/* space at comment (only when reading header) */
// this.comm_max = 0;
/* true if there was or will be a header crc */
this.hcrc = 0;
/* true when done reading gzip header (not used when writing a gzip file) */
this.done = false;
}
module.exports = GZheader;

344
lib/zlib/inffast.js
View file

@ -1,344 +0,0 @@
'use strict';
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
// See state defs from inflate.js
const BAD = 16209; /* got a data error -- remain here until reset */
const TYPE = 16191; /* i: waiting for type bits, including last-flag bit */
/*
Decode literal, length, and distance codes and write out the resulting
literal and match bytes until either not enough input or output is
available, an end-of-block is encountered, or a data error is encountered.
When large enough input and output buffers are supplied to inflate(), for
example, a 16K input buffer and a 64K output buffer, more than 95% of the
inflate execution time is spent in this routine.
Entry assumptions:
state.mode === LEN
strm.avail_in >= 6
strm.avail_out >= 258
start >= strm.avail_out
state.bits < 8
On return, state.mode is one of:
LEN -- ran out of enough output space or enough available input
TYPE -- reached end of block code, inflate() to interpret next block
BAD -- error in block data
Notes:
- The maximum input bits used by a length/distance pair is 15 bits for the
length code, 5 bits for the length extra, 15 bits for the distance code,
and 13 bits for the distance extra. This totals 48 bits, or six bytes.
Therefore if strm.avail_in >= 6, then there is enough input to avoid
checking for available input while decoding.
- The maximum bytes that a single length/distance pair can output is 258
bytes, which is the maximum length that can be coded. inflate_fast()
requires strm.avail_out >= 258 for each loop to avoid checking for
output space.
*/
module.exports = function inflate_fast(strm, start) {
let _in; /* local strm.input */
let last; /* have enough input while in < last */
let _out; /* local strm.output */
let beg; /* inflate()'s initial strm.output */
let end; /* while out < end, enough space available */
//#ifdef INFLATE_STRICT
let dmax; /* maximum distance from zlib header */
//#endif
let wsize; /* window size or zero if not using window */
let whave; /* valid bytes in the window */
let wnext; /* window write index */
// Use `s_window` instead `window`, avoid conflict with instrumentation tools
let s_window; /* allocated sliding window, if wsize != 0 */
let hold; /* local strm.hold */
let bits; /* local strm.bits */
let lcode; /* local strm.lencode */
let dcode; /* local strm.distcode */
let lmask; /* mask for first level of length codes */
let dmask; /* mask for first level of distance codes */
let here; /* retrieved table entry */
let op; /* code bits, operation, extra bits, or */
/* window position, window bytes to copy */
let len; /* match length, unused bytes */
let dist; /* match distance */
let from; /* where to copy match from */
let from_source;
let input, output; // JS specific, because we have no pointers
/* copy state to local variables */
const state = strm.state;
//here = state.here;
_in = strm.next_in;
input = strm.input;
last = _in + (strm.avail_in - 5);
_out = strm.next_out;
output = strm.output;
beg = _out - (start - strm.avail_out);
end = _out + (strm.avail_out - 257);
//#ifdef INFLATE_STRICT
dmax = state.dmax;
//#endif
wsize = state.wsize;
whave = state.whave;
wnext = state.wnext;
s_window = state.window;
hold = state.hold;
bits = state.bits;
lcode = state.lencode;
dcode = state.distcode;
lmask = (1 << state.lenbits) - 1;
dmask = (1 << state.distbits) - 1;
/* decode literals and length/distances until end-of-block or not enough
input data or output space */
top:
do {
if (bits < 15) {
hold += input[_in++] << bits;
bits += 8;
hold += input[_in++] << bits;
bits += 8;
}
here = lcode[hold & lmask];
dolen:
for (;;) { // Goto emulation
op = here >>> 24/*here.bits*/;
hold >>>= op;
bits -= op;
op = (here >>> 16) & 0xff/*here.op*/;
if (op === 0) { /* literal */
//Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
// "inflate: literal '%c'\n" :
// "inflate: literal 0x%02x\n", here.val));
output[_out++] = here & 0xffff/*here.val*/;
}
else if (op & 16) { /* length base */
len = here & 0xffff/*here.val*/;
op &= 15; /* number of extra bits */
if (op) {
if (bits < op) {
hold += input[_in++] << bits;
bits += 8;
}
len += hold & ((1 << op) - 1);
hold >>>= op;
bits -= op;
}
//Tracevv((stderr, "inflate: length %u\n", len));
if (bits < 15) {
hold += input[_in++] << bits;
bits += 8;
hold += input[_in++] << bits;
bits += 8;
}
here = dcode[hold & dmask];
dodist:
for (;;) { // goto emulation
op = here >>> 24/*here.bits*/;
hold >>>= op;
bits -= op;
op = (here >>> 16) & 0xff/*here.op*/;
if (op & 16) { /* distance base */
dist = here & 0xffff/*here.val*/;
op &= 15; /* number of extra bits */
if (bits < op) {
hold += input[_in++] << bits;
bits += 8;
if (bits < op) {
hold += input[_in++] << bits;
bits += 8;
}
}
dist += hold & ((1 << op) - 1);
//#ifdef INFLATE_STRICT
if (dist > dmax) {
strm.msg = 'invalid distance too far back';
state.mode = BAD;
break top;
}
//#endif
hold >>>= op;
bits -= op;
//Tracevv((stderr, "inflate: distance %u\n", dist));
op = _out - beg; /* max distance in output */
if (dist > op) { /* see if copy from window */
op = dist - op; /* distance back in window */
if (op > whave) {
if (state.sane) {
strm.msg = 'invalid distance too far back';
state.mode = BAD;
break top;
}
// (!) This block is disabled in zlib defaults,
// don't enable it for binary compatibility
//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
// if (len <= op - whave) {
// do {
// output[_out++] = 0;
// } while (--len);
// continue top;
// }
// len -= op - whave;
// do {
// output[_out++] = 0;
// } while (--op > whave);
// if (op === 0) {
// from = _out - dist;
// do {
// output[_out++] = output[from++];
// } while (--len);
// continue top;
// }
//#endif
}
from = 0; // window index
from_source = s_window;
if (wnext === 0) { /* very common case */
from += wsize - op;
if (op < len) { /* some from window */
len -= op;
do {
output[_out++] = s_window[from++];
} while (--op);
from = _out - dist; /* rest from output */
from_source = output;
}
}
else if (wnext < op) { /* wrap around window */
from += wsize + wnext - op;
op -= wnext;
if (op < len) { /* some from end of window */
len -= op;
do {
output[_out++] = s_window[from++];
} while (--op);
from = 0;
if (wnext < len) { /* some from start of window */
op = wnext;
len -= op;
do {
output[_out++] = s_window[from++];
} while (--op);
from = _out - dist; /* rest from output */
from_source = output;
}
}
}
else { /* contiguous in window */
from += wnext - op;
if (op < len) { /* some from window */
len -= op;
do {
output[_out++] = s_window[from++];
} while (--op);
from = _out - dist; /* rest from output */
from_source = output;
}
}
while (len > 2) {
output[_out++] = from_source[from++];
output[_out++] = from_source[from++];
output[_out++] = from_source[from++];
len -= 3;
}
if (len) {
output[_out++] = from_source[from++];
if (len > 1) {
output[_out++] = from_source[from++];
}
}
}
else {
from = _out - dist; /* copy direct from output */
do { /* minimum length is three */
output[_out++] = output[from++];
output[_out++] = output[from++];
output[_out++] = output[from++];
len -= 3;
} while (len > 2);
if (len) {
output[_out++] = output[from++];
if (len > 1) {
output[_out++] = output[from++];
}
}
}
}
else if ((op & 64) === 0) { /* 2nd level distance code */
here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
continue dodist;
}
else {
strm.msg = 'invalid distance code';
state.mode = BAD;
break top;
}
break; // need to emulate goto via "continue"
}
}
else if ((op & 64) === 0) { /* 2nd level length code */
here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
continue dolen;
}
else if (op & 32) { /* end-of-block */
//Tracevv((stderr, "inflate: end of block\n"));
state.mode = TYPE;
break top;
}
else {
strm.msg = 'invalid literal/length code';
state.mode = BAD;
break top;
}
break; // need to emulate goto via "continue"
}
} while (_in < last && _out < end);
/* return unused bytes (on entry, bits < 8, so in won't go too far back) */
len = bits >> 3;
_in -= len;
bits -= len << 3;
hold &= (1 << bits) - 1;
/* update state and return */
strm.next_in = _in;
strm.next_out = _out;
strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
state.hold = hold;
state.bits = bits;
return;
};

1572
lib/zlib/inflate.js
View file

File diff suppressed because it is too large Load diff

340
lib/zlib/inftrees.js
View file

@ -1,340 +0,0 @@
'use strict';
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
const MAXBITS = 15;
const ENOUGH_LENS = 852;
const ENOUGH_DISTS = 592;
//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);
const CODES = 0;
const LENS = 1;
const DISTS = 2;
const lbase = new Uint16Array([ /* Length codes 257..285 base */
3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
]);
const lext = new Uint8Array([ /* Length codes 257..285 extra */
16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
]);
const dbase = new Uint16Array([ /* Distance codes 0..29 base */
1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
8193, 12289, 16385, 24577, 0, 0
]);
const dext = new Uint8Array([ /* Distance codes 0..29 extra */
16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
28, 28, 29, 29, 64, 64
]);
const inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>
{
const bits = opts.bits;
//here = opts.here; /* table entry for duplication */
let len = 0; /* a code's length in bits */
let sym = 0; /* index of code symbols */
let min = 0, max = 0; /* minimum and maximum code lengths */
let root = 0; /* number of index bits for root table */
let curr = 0; /* number of index bits for current table */
let drop = 0; /* code bits to drop for sub-table */
let left = 0; /* number of prefix codes available */
let used = 0; /* code entries in table used */
let huff = 0; /* Huffman code */
let incr; /* for incrementing code, index */
let fill; /* index for replicating entries */
let low; /* low bits for current root entry */
let mask; /* mask for low root bits */
let next; /* next available space in table */
let base = null; /* base value table to use */
// let shoextra; /* extra bits table to use */
let match; /* use base and extra for symbol >= match */
const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */
const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */
let extra = null;
let here_bits, here_op, here_val;
/*
Process a set of code lengths to create a canonical Huffman code. The
code lengths are lens[0..codes-1]. Each length corresponds to the
symbols 0..codes-1. The Huffman code is generated by first sorting the
symbols by length from short to long, and retaining the symbol order
for codes with equal lengths. Then the code starts with all zero bits
for the first code of the shortest length, and the codes are integer
increments for the same length, and zeros are appended as the length
increases. For the deflate format, these bits are stored backwards
from their more natural integer increment ordering, and so when the
decoding tables are built in the large loop below, the integer codes
are incremented backwards.
This routine assumes, but does not check, that all of the entries in
lens[] are in the range 0..MAXBITS. The caller must assure this.
1..MAXBITS is interpreted as that code length. zero means that that
symbol does not occur in this code.
The codes are sorted by computing a count of codes for each length,
creating from that a table of starting indices for each length in the
sorted table, and then entering the symbols in order in the sorted
table. The sorted table is work[], with that space being provided by
the caller.
The length counts are used for other purposes as well, i.e. finding
the minimum and maximum length codes, determining if there are any
codes at all, checking for a valid set of lengths, and looking ahead
at length counts to determine sub-table sizes when building the
decoding tables.
*/
/* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
for (len = 0; len <= MAXBITS; len++) {
count[len] = 0;
}
for (sym = 0; sym < codes; sym++) {
count[lens[lens_index + sym]]++;
}
/* bound code lengths, force root to be within code lengths */
root = bits;
for (max = MAXBITS; max >= 1; max--) {
if (count[max] !== 0) { break; }
}
if (root > max) {
root = max;
}
if (max === 0) { /* no symbols to code at all */
//table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */
//table.bits[opts.table_index] = 1; //here.bits = (var char)1;
//table.val[opts.table_index++] = 0; //here.val = (var short)0;
table[table_index++] = (1 << 24) | (64 << 16) | 0;
//table.op[opts.table_index] = 64;
//table.bits[opts.table_index] = 1;
//table.val[opts.table_index++] = 0;
table[table_index++] = (1 << 24) | (64 << 16) | 0;
opts.bits = 1;
return 0; /* no symbols, but wait for decoding to report error */
}
for (min = 1; min < max; min++) {
if (count[min] !== 0) { break; }
}
if (root < min) {
root = min;
}
/* check for an over-subscribed or incomplete set of lengths */
left = 1;
for (len = 1; len <= MAXBITS; len++) {
left <<= 1;
left -= count[len];
if (left < 0) {
return -1;
} /* over-subscribed */
}
if (left > 0 && (type === CODES || max !== 1)) {
return -1; /* incomplete set */
}
/* generate offsets into symbol table for each length for sorting */
offs[1] = 0;
for (len = 1; len < MAXBITS; len++) {
offs[len + 1] = offs[len] + count[len];
}
/* sort symbols by length, by symbol order within each length */
for (sym = 0; sym < codes; sym++) {
if (lens[lens_index + sym] !== 0) {
work[offs[lens[lens_index + sym]]++] = sym;
}
}
/*
Create and fill in decoding tables. In this loop, the table being
filled is at next and has curr index bits. The code being used is huff
with length len. That code is converted to an index by dropping drop
bits off of the bottom. For codes where len is less than drop + curr,
those top drop + curr - len bits are incremented through all values to
fill the table with replicated entries.
root is the number of index bits for the root table. When len exceeds
root, sub-tables are created pointed to by the root entry with an index
of the low root bits of huff. This is saved in low to check for when a
new sub-table should be started. drop is zero when the root table is
being filled, and drop is root when sub-tables are being filled.
When a new sub-table is needed, it is necessary to look ahead in the
code lengths to determine what size sub-table is needed. The length
counts are used for this, and so count[] is decremented as codes are
entered in the tables.
used keeps track of how many table entries have been allocated from the
provided *table space. It is checked for LENS and DIST tables against
the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
the initial root table size constants. See the comments in inftrees.h
for more information.
sym increments through all symbols, and the loop terminates when
all codes of length max, i.e. all codes, have been processed. This
routine permits incomplete codes, so another loop after this one fills
in the rest of the decoding tables with invalid code markers.
*/
/* set up for code type */
// poor man optimization - use if-else instead of switch,
// to avoid deopts in old v8
if (type === CODES) {
base = extra = work; /* dummy value--not used */
match = 20;
} else if (type === LENS) {
base = lbase;
extra = lext;
match = 257;
} else { /* DISTS */
base = dbase;
extra = dext;
match = 0;
}
/* initialize opts for loop */
huff = 0; /* starting code */
sym = 0; /* starting code symbol */
len = min; /* starting code length */
next = table_index; /* current table to fill in */
curr = root; /* current table index bits */
drop = 0; /* current bits to drop from code for index */
low = -1; /* trigger new sub-table when len > root */
used = 1 << root; /* use root table entries */
mask = used - 1; /* mask for comparing low */
/* check available table space */
if ((type === LENS && used > ENOUGH_LENS) ||
(type === DISTS && used > ENOUGH_DISTS)) {
return 1;
}
/* process all codes and make table entries */
for (;;) {
/* create table entry */
here_bits = len - drop;
if (work[sym] + 1 < match) {
here_op = 0;
here_val = work[sym];
}
else if (work[sym] >= match) {
here_op = extra[work[sym] - match];
here_val = base[work[sym] - match];
}
else {
here_op = 32 + 64; /* end of block */
here_val = 0;
}
/* replicate for those indices with low len bits equal to huff */
incr = 1 << (len - drop);
fill = 1 << curr;
min = fill; /* save offset to next table */
do {
fill -= incr;
table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;
} while (fill !== 0);
/* backwards increment the len-bit code huff */
incr = 1 << (len - 1);
while (huff & incr) {
incr >>= 1;
}
if (incr !== 0) {
huff &= incr - 1;
huff += incr;
} else {
huff = 0;
}
/* go to next symbol, update count, len */
sym++;
if (--count[len] === 0) {
if (len === max) { break; }
len = lens[lens_index + work[sym]];
}
/* create new sub-table if needed */
if (len > root && (huff & mask) !== low) {
/* if first time, transition to sub-tables */
if (drop === 0) {
drop = root;
}
/* increment past last table */
next += min; /* here min is 1 << curr */
/* determine length of next table */
curr = len - drop;
left = 1 << curr;
while (curr + drop < max) {
left -= count[curr + drop];
if (left <= 0) { break; }
curr++;
left <<= 1;
}
/* check for enough space */
used += 1 << curr;
if ((type === LENS && used > ENOUGH_LENS) ||
(type === DISTS && used > ENOUGH_DISTS)) {
return 1;
}
/* point entry in root table to sub-table */
low = huff & mask;
/*table.op[low] = curr;
table.bits[low] = root;
table.val[low] = next - opts.table_index;*/
table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;
}
}
/* fill in remaining table entry if code is incomplete (guaranteed to have
at most one remaining entry, since if the code is incomplete, the
maximum code length that was allowed to get this far is one bit) */
if (huff !== 0) {
//table.op[next + huff] = 64; /* invalid code marker */
//table.bits[next + huff] = len - drop;
//table.val[next + huff] = 0;
table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
}
/* set return parameters */
//opts.table_index += used;
opts.bits = root;
return 0;
};
module.exports = inflate_table;

32
lib/zlib/messages.js
View file

@ -1,32 +0,0 @@
'use strict';
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
module.exports = {
2: 'need dictionary', /* Z_NEED_DICT 2 */
1: 'stream end', /* Z_STREAM_END 1 */
0: '', /* Z_OK 0 */
'-1': 'file error', /* Z_ERRNO (-1) */
'-2': 'stream error', /* Z_STREAM_ERROR (-2) */
'-3': 'data error', /* Z_DATA_ERROR (-3) */
'-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */
'-5': 'buffer error', /* Z_BUF_ERROR (-5) */
'-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */
};

1179
lib/zlib/trees.js
View file

File diff suppressed because it is too large Load diff

47
lib/zlib/zstream.js
View file

@ -1,47 +0,0 @@
'use strict';
// (C) 1995-2013 Jean-loup Gailly and Mark Adler
// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin
//
// This software is provided 'as-is', without any express or implied
// warranty. In no event will the authors be held liable for any damages
// arising from the use of this software.
//
// Permission is granted to anyone to use this software for any purpose,
// including commercial applications, and to alter it and redistribute it
// freely, subject to the following restrictions:
//
// 1. The origin of this software must not be misrepresented; you must not
// claim that you wrote the original software. If you use this software
// in a product, an acknowledgment in the product documentation would be
// appreciated but is not required.
// 2. Altered source versions must be plainly marked as such, and must not be
// misrepresented as being the original software.
// 3. This notice may not be removed or altered from any source distribution.
function ZStream() {
/* next input byte */
this.input = null; // JS specific, because we have no pointers
this.next_in = 0;
/* number of bytes available at input */
this.avail_in = 0;
/* total number of input bytes read so far */
this.total_in = 0;
/* next output byte should be put there */
this.output = null; // JS specific, because we have no pointers
this.next_out = 0;
/* remaining free space at output */
this.avail_out = 0;
/* total number of bytes output so far */
this.total_out = 0;
/* last error message, NULL if no error */
this.msg = ''/*Z_NULL*/;
/* not visible by applications */
this.state = null;
/* best guess about the data type: binary or text */
this.data_type = 2/*Z_UNKNOWN*/;
/* adler32 value of the uncompressed data */
this.adler = 0;
}
module.exports = ZStream;

89
rollup.config.js
View file

@ -1,89 +0,0 @@
import nodeResolve from '@rollup/plugin-node-resolve';
import commonjs from '@rollup/plugin-commonjs';
import pkg from './package.json';
import { terser } from 'rollup-plugin-terser';
import babel from '@rollup/plugin-babel';
const banner = {
banner() {
return `/*! ${pkg.name} ${pkg.version} https://github.com/${pkg.repository} @license ${pkg.license} */`;
}
}
const plugins = [ nodeResolve(), commonjs(), banner ];
const plugins_es5 = [
nodeResolve(),
commonjs(),
babel({
babelHelpers: 'bundled',
presets: [
[ "@babel/preset-env" ]
]
}),
banner
];
const umd_out_base = { format: 'umd', name: 'pako', exports: 'named' };
export default [
// es6
{
input: 'index.js',
output: [
{ ...umd_out_base, file: 'dist/pako.js' },
{ ...umd_out_base, file: 'dist/pako.min.js', plugins: [ terser() ] }
],
plugins: plugins
},
{
input: 'lib/deflate.js',
output: [
{ ...umd_out_base, file: 'dist/pako_deflate.js' },
{ ...umd_out_base, file: 'dist/pako_deflate.min.js', plugins: [ terser() ] }
],
plugins: plugins
},
{
input: 'lib/inflate.js',
output: [
{ ...umd_out_base, file: 'dist/pako_inflate.js' },
{ ...umd_out_base, file: 'dist/pako_inflate.min.js', plugins: [ terser() ] }
],
plugins: plugins
},
// es5
{
input: 'index.js',
output: [
{ ...umd_out_base, file: 'dist/pako.es5.js' },
{ ...umd_out_base, file: 'dist/pako.es5.min.js', plugins: [ terser() ] }
],
plugins: plugins_es5
},
{
input: 'lib/deflate.js',
output: [
{ ...umd_out_base, file: 'dist/pako_deflate.es5.js' },
{ ...umd_out_base, file: 'dist/pako_deflate.es5.min.js', plugins: [ terser() ] }
],
plugins: plugins_es5
},
{
input: 'lib/inflate.js',
output: [
{ ...umd_out_base, file: 'dist/pako_inflate.es5.js' },
{ ...umd_out_base, file: 'dist/pako_inflate.es5.min.js', plugins: [ terser() ] }
],
plugins: plugins_es5
},
// esm
{
input: 'index.js',
output: [
{ file: 'dist/pako.esm.mjs', format: 'esm' }
],
plugins: plugins
}
];

15
support/build_doc.js
View file

@ -1,15 +0,0 @@
#!/usr/bin/env node
'use strict';
/* eslint-env es6 */
const shell = require('shelljs');
shell.rm('-rf', 'doc');
const head = shell.exec('git show-ref --hash HEAD').stdout.slice(0, 6);
const link_format = `https://github.com/{package.repository}/blob/${head}/{file}#L{line}`;
shell.exec(`node node_modules/.bin/ndoc --link-format "${link_format}"`);

81
support/build_fixtures.js
View file

@ -1,81 +0,0 @@
#!/usr/bin/env node
'use strict';
/* eslint-env es6 */
/* eslint-disable no-console */
// node.js switched to chromium zlib implementation in version v12.17.0,
// which generates slightly different fixtures.
// https://github.com/nodejs/node/pull/31201
//
// so we create fixtures generated by older node.js versions
const ver = process.version.match(/^v(\d+)\.(\d+)\.\d+$/);
if (!(+ver[1] < 12 || +ver[1] === 12 && +ver[2] <= 16)) {
throw new Error('Please use node.js <= 12.16.x to generate these fixtures');
}
const fs = require('fs');
const path = require('path');
const zlib = require('zlib');
const sample = fs.readFileSync(path.join(__dirname, '../test/fixtures/samples/lorem_en_100k.txt'));
let dirname = path.join(__dirname, '../test/fixtures/binary_compare');
if (!fs.existsSync(dirname)) fs.mkdirSync(dirname);
function createSample(method, options, filename) {
let file = path.join(dirname, filename);
let data = zlib[method](sample, options);
fs.writeFileSync(file, zlib[method](sample, options));
console.log(file, data.length);
}
createSample('deflateSync', {}, 'deflate.bin');
createSample('deflateRawSync', {}, 'deflateRaw.bin');
createSample('gzipSync', {}, 'gzip.bin');
createSample('deflateSync', { level: 9 }, 'deflate_level=9.bin');
createSample('deflateSync', { level: 8 }, 'deflate_level=8.bin');
createSample('deflateSync', { level: 7 }, 'deflate_level=7.bin');
createSample('deflateSync', { level: 6 }, 'deflate_level=6.bin');
createSample('deflateSync', { level: 5 }, 'deflate_level=5.bin');
createSample('deflateSync', { level: 4 }, 'deflate_level=4.bin');
createSample('deflateSync', { level: 3 }, 'deflate_level=3.bin');
createSample('deflateSync', { level: 2 }, 'deflate_level=2.bin');
createSample('deflateSync', { level: 1 }, 'deflate_level=1.bin');
createSample('deflateSync', { level: -1 }, 'deflate_level=-1.bin');
createSample('deflateSync', { windowBits: 15 }, 'deflate_windowBits=15.bin');
createSample('deflateSync', { windowBits: 14 }, 'deflate_windowBits=14.bin');
createSample('deflateSync', { windowBits: 13 }, 'deflate_windowBits=13.bin');
createSample('deflateSync', { windowBits: 12 }, 'deflate_windowBits=12.bin');
createSample('deflateSync', { windowBits: 11 }, 'deflate_windowBits=11.bin');
createSample('deflateSync', { windowBits: 10 }, 'deflate_windowBits=10.bin');
createSample('deflateSync', { windowBits: 9 }, 'deflate_windowBits=9.bin');
createSample('deflateSync', { windowBits: 8 }, 'deflate_windowBits=8.bin');
createSample('deflateRawSync', { windowBits: 15 }, 'deflateRaw_windowBits=15.bin');
createSample('deflateSync', { memLevel: 9 }, 'deflate_memLevel=9.bin');
createSample('deflateSync', { memLevel: 8 }, 'deflate_memLevel=8.bin');
createSample('deflateSync', { memLevel: 7 }, 'deflate_memLevel=7.bin');
createSample('deflateSync', { memLevel: 6 }, 'deflate_memLevel=6.bin');
createSample('deflateSync', { memLevel: 5 }, 'deflate_memLevel=5.bin');
createSample('deflateSync', { memLevel: 4 }, 'deflate_memLevel=4.bin');
createSample('deflateSync', { memLevel: 3 }, 'deflate_memLevel=3.bin');
createSample('deflateSync', { memLevel: 2 }, 'deflate_memLevel=2.bin');
createSample('deflateSync', { memLevel: 1 }, 'deflate_memLevel=1.bin');
createSample('deflateSync', { strategy: 0 }, 'deflate_strategy=0.bin');
createSample('deflateSync', { strategy: 1 }, 'deflate_strategy=1.bin');
createSample('deflateSync', { strategy: 2 }, 'deflate_strategy=2.bin');
createSample('deflateSync', { strategy: 3 }, 'deflate_strategy=3.bin');
createSample('deflateSync', { strategy: 4 }, 'deflate_strategy=4.bin');
createSample('deflateRawSync', { level: 4 }, 'deflateRaw_level=4.bin');
createSample('deflateRawSync', { level: 1 }, 'deflateRaw_level=1.bin');
const dict = Buffer.from('abcdefghijklmnoprstuvwxyz');
createSample('deflateSync', { dictionary: dict }, 'deflate_dictionary=trivial.bin');
const spdyDict = fs.readFileSync(path.join(__dirname, '..', 'test', 'fixtures', 'spdy_dict.txt'));
createSample('deflateSync', { dictionary: spdyDict }, 'deflate_dictionary=spdy.bin');

2
test/.eslintrc.yml
View file

@ -1,2 +0,0 @@
env:
mocha: true

200
test/binary_compare.js
View file

@ -1,200 +0,0 @@
'use strict';
const assert = require('assert');
const fs = require('fs');
const path = require('path');
const pako = require('../index');
const loadSamples = require('./helpers').loadSamples;
const sample = loadSamples().lorem_en_100k;
// Helper used to compare pako deflate using various options
// with reference values from old node.js zlib.
//
// node.js switched to chromium zlib implementation in version v12.17.0,
// which generates slightly different fixtures.
// https://github.com/nodejs/node/pull/31201
//
// So we use fixtures generated by node.js versions below v12.17.0.
//
function testSample(pako_method, sample, options, filename) {
const dir = path.join(__dirname, 'fixtures', 'binary_compare');
const pako_result = pako_method(sample, options);
const zlib_result = fs.readFileSync(path.join(dir, filename));
// One more hack: gzip header contains OS code, that can vary.
// Override OS code if requested. For simplicity, we assume it on fixed
// position (= no additional gzip headers used)
if (options.ignore_os) zlib_result[9] = pako_result[9];
assert.deepStrictEqual(pako_result, new Uint8Array(zlib_result));
}
describe('Deflate defaults', () => {
it('deflate, no options', () => {
testSample(pako.deflate, sample, {}, 'deflate.bin');
});
it('deflate raw, no options', () => {
testSample(pako.deflateRaw, sample, {}, 'deflateRaw.bin');
});
// OS code in header can vary. Use hack flag to ignore it.
it('gzip, no options', () => {
testSample(pako.gzip, sample, { ignore_os: true }, 'gzip.bin');
});
});
describe('Deflate levels', () => {
it('level 9', () => {
testSample(pako.deflate, sample, { level: 9 }, 'deflate_level=9.bin');
});
it('level 8', () => {
testSample(pako.deflate, sample, { level: 8 }, 'deflate_level=8.bin');
});
it('level 7', () => {
testSample(pako.deflate, sample, { level: 7 }, 'deflate_level=7.bin');
});
it('level 6', () => {
testSample(pako.deflate, sample, { level: 6 }, 'deflate_level=6.bin');
});
it('level 5', () => {
testSample(pako.deflate, sample, { level: 5 }, 'deflate_level=5.bin');
});
it('level 4', () => {
testSample(pako.deflate, sample, { level: 4 }, 'deflate_level=4.bin');
});
it('level 3', () => {
testSample(pako.deflate, sample, { level: 3 }, 'deflate_level=3.bin');
});
it('level 2', () => {
testSample(pako.deflate, sample, { level: 2 }, 'deflate_level=2.bin');
});
it('level 1', () => {
testSample(pako.deflate, sample, { level: 1 }, 'deflate_level=1.bin');
});
it('level -1 (implicit default)', () => {
testSample(pako.deflate, sample, { level: -1 }, 'deflate_level=-1.bin');
});
});
describe('Deflate windowBits', () => {
it('windowBits 15', () => {
testSample(pako.deflate, sample, { windowBits: 15 }, 'deflate_windowBits=15.bin');
});
it('windowBits 14', () => {
testSample(pako.deflate, sample, { windowBits: 14 }, 'deflate_windowBits=14.bin');
});
it('windowBits 13', () => {
testSample(pako.deflate, sample, { windowBits: 13 }, 'deflate_windowBits=13.bin');
});
it('windowBits 12', () => {
testSample(pako.deflate, sample, { windowBits: 12 }, 'deflate_windowBits=12.bin');
});
it('windowBits 11', () => {
testSample(pako.deflate, sample, { windowBits: 11 }, 'deflate_windowBits=11.bin');
});
it('windowBits 10', () => {
testSample(pako.deflate, sample, { windowBits: 10 }, 'deflate_windowBits=10.bin');
});
it('windowBits 9', () => {
testSample(pako.deflate, sample, { windowBits: 9 }, 'deflate_windowBits=9.bin');
});
it('windowBits 8', () => {
testSample(pako.deflate, sample, { windowBits: 8 }, 'deflate_windowBits=8.bin');
});
it('windowBits -15 (implicit raw)', () => {
testSample(pako.deflate, sample, { windowBits: -15 }, 'deflateRaw_windowBits=15.bin');
});
});
describe('Deflate memLevel', () => {
it('memLevel 9', () => {
testSample(pako.deflate, sample, { memLevel: 9 }, 'deflate_memLevel=9.bin');
});
it('memLevel 8', () => {
testSample(pako.deflate, sample, { memLevel: 8 }, 'deflate_memLevel=8.bin');
});
it('memLevel 7', () => {
testSample(pako.deflate, sample, { memLevel: 7 }, 'deflate_memLevel=7.bin');
});
it('memLevel 6', () => {
testSample(pako.deflate, sample, { memLevel: 6 }, 'deflate_memLevel=6.bin');
});
it('memLevel 5', () => {
testSample(pako.deflate, sample, { memLevel: 5 }, 'deflate_memLevel=5.bin');
});
it('memLevel 4', () => {
testSample(pako.deflate, sample, { memLevel: 4 }, 'deflate_memLevel=4.bin');
});
it('memLevel 3', () => {
testSample(pako.deflate, sample, { memLevel: 3 }, 'deflate_memLevel=3.bin');
});
it('memLevel 2', () => {
testSample(pako.deflate, sample, { memLevel: 2 }, 'deflate_memLevel=2.bin');
});
it('memLevel 1', () => {
testSample(pako.deflate, sample, { memLevel: 1 }, 'deflate_memLevel=1.bin');
});
});
describe('Deflate strategy', () => {
it('Z_DEFAULT_STRATEGY', () => {
testSample(pako.deflate, sample, { strategy: 0 }, 'deflate_strategy=0.bin');
});
it('Z_FILTERED', () => {
testSample(pako.deflate, sample, { strategy: 1 }, 'deflate_strategy=1.bin');
});
it('Z_HUFFMAN_ONLY', () => {
testSample(pako.deflate, sample, { strategy: 2 }, 'deflate_strategy=2.bin');
});
it('Z_RLE', () => {
testSample(pako.deflate, sample, { strategy: 3 }, 'deflate_strategy=3.bin');
});
it('Z_FIXED', () => {
testSample(pako.deflate, sample, { strategy: 4 }, 'deflate_strategy=4.bin');
});
});
describe('Deflate RAW', () => {
// Since difference is only in wrapper, test for store/fast/slow methods are enough
it('level 4', () => {
testSample(pako.deflateRaw, sample, { level: 4 }, 'deflateRaw_level=4.bin');
});
it('level 1', () => {
testSample(pako.deflateRaw, sample, { level: 1 }, 'deflateRaw_level=1.bin');
});
});
describe('Deflate dictionary', () => {
it('trivial dictionary', () => {
const dict = Buffer.from('abcdefghijklmnoprstuvwxyz');
testSample(pako.deflate, sample, { dictionary: dict }, 'deflate_dictionary=trivial.bin');
});
it('spdy dictionary', () => {
const spdyDict = require('fs').readFileSync(require('path').join(__dirname, 'fixtures', 'spdy_dict.txt'));
testSample(pako.deflate, sample, { dictionary: spdyDict }, 'deflate_dictionary=spdy.bin');
});
});

127
test/chunks.js
View file

@ -1,127 +0,0 @@
'use strict';
const assert = require('assert');
const { loadSamples } = require('./helpers');
const pako = require('../index');
const samples = loadSamples();
function randomBuf(size) {
const buf = new Uint8Array(size);
for (let i = 0; i < size; i++) {
buf[i] = Math.round(Math.random() * 256);
}
return buf;
}
function testChunk(buf, expected, packer, chunkSize) {
let i, _in, count, pos, size, expFlushCount;
let onData = packer.onData;
let flushCount = 0;
packer.onData = function () {
flushCount++;
onData.apply(this, arguments);
};
count = Math.ceil(buf.length / chunkSize);
pos = 0;
for (i = 0; i < count; i++) {
size = (buf.length - pos) < chunkSize ? buf.length - pos : chunkSize;
_in = new Uint8Array(size);
_in.set(buf.subarray(pos, pos + size), 0);
packer.push(_in, i === count - 1);
pos += chunkSize;
}
//expected count of onData calls. 16384 output chunk size
expFlushCount = Math.ceil(packer.result.length / packer.options.chunkSize);
assert(!packer.err, 'Packer error: ' + packer.err);
assert.deepStrictEqual(packer.result, expected);
assert.strictEqual(flushCount, expFlushCount, 'onData called ' + flushCount + 'times, expected: ' + expFlushCount);
}
describe('Small input chunks', () => {
it('deflate 100b by 1b chunk', () => {
const buf = randomBuf(100);
const deflated = pako.deflate(buf);
testChunk(buf, deflated, new pako.Deflate(), 1);
});
it('deflate 20000b by 10b chunk', () => {
const buf = randomBuf(20000);
const deflated = pako.deflate(buf);
testChunk(buf, deflated, new pako.Deflate(), 10);
});
it('inflate 100b result by 1b chunk', () => {
const buf = randomBuf(100);
const deflated = pako.deflate(buf);
testChunk(deflated, buf, new pako.Inflate(), 1);
});
it('inflate 20000b result by 10b chunk', () => {
const buf = randomBuf(20000);
const deflated = pako.deflate(buf);
testChunk(deflated, buf, new pako.Inflate(), 10);
});
});
describe('Dummy push (force end)', () => {
it('deflate end', () => {
const data = samples.lorem_utf_100k;
const deflator = new pako.Deflate();
deflator.push(data);
deflator.push([], true);
assert.deepStrictEqual(deflator.result, pako.deflate(data));
});
it('inflate end', () => {
const data = pako.deflate(samples.lorem_utf_100k);
const inflator = new pako.Inflate();
inflator.push(data);
assert.deepStrictEqual(inflator.result, pako.inflate(data));
});
});
describe('Edge condition', () => {
it('should be ok on buffer border', () => {
let i;
const data = new Uint8Array(1024 * 16 + 1);
for (i = 0; i < data.length; i++) {
data[i] = Math.floor(Math.random() * 255.999);
}
const deflated = pako.deflate(data);
const inflator = new pako.Inflate();
for (i = 0; i < deflated.length; i++) {
inflator.push(deflated.subarray(i, i + 1), false);
assert.ok(!inflator.err, 'Inflate failed with status ' + inflator.err);
}
inflator.push(new Uint8Array(0));
assert.ok(!inflator.err, 'Inflate failed with status ' + inflator.err);
assert.deepStrictEqual(data, inflator.result);
});
});

41
test/deflate.js
View file

@ -1,41 +0,0 @@
'use strict';
const pako = require('../index');
const assert = require('assert');
const fs = require('fs');
const path = require('path');
describe('Deflate dictionary', () => {
it('handles multiple pushes', () => {
const dict = Buffer.from('abcd');
const deflate = new pako.Deflate({ dictionary: dict });
deflate.push(Buffer.from('hello'), false);
deflate.push(Buffer.from('hello'), false);
deflate.push(Buffer.from(' world'), true);
if (deflate.err) { throw new Error(deflate.err); }
const uncompressed = pako.inflate(Buffer.from(deflate.result), { dictionary: dict });
assert.deepStrictEqual(
new Uint8Array(Buffer.from('hellohello world')),
uncompressed
);
});
});
describe('Deflate issues', () => {
it('#78', () => {
const data = fs.readFileSync(path.join(__dirname, 'fixtures', 'issue_78.bin'));
const deflatedPakoData = pako.deflate(data, { memLevel: 1 });
const inflatedPakoData = pako.inflate(deflatedPakoData);
assert.strictEqual(data.length, inflatedPakoData.length);
});
});

92
test/deflate_cover.js
View file

@ -1,92 +0,0 @@
// Deflate coverage tests
'use strict';
const assert = require('assert');
const fs = require('fs');
const path = require('path');
const c = require('../lib/zlib/constants');
const msg = require('../lib/zlib/messages');
const zlib_deflate = require('../lib/zlib/deflate');
const ZStream = require('../lib/zlib/zstream');
const pako = require('../index');
const short_sample = 'hello world';
const long_sample = fs.readFileSync(path.join(__dirname, 'fixtures/samples/lorem_en_100k.txt'));
function testDeflate(data, opts, flush) {
const deflator = new pako.Deflate(opts);
deflator.push(data, flush);
deflator.push(data, true);
assert.strictEqual(deflator.err, 0, msg[deflator.err]);
}
describe('Deflate support', () => {
it('stored', () => {
testDeflate(short_sample, { level: 0, chunkSize: 200 }, 0);
testDeflate(short_sample, { level: 0, chunkSize: 10 }, 5);
});
it('fast', () => {
testDeflate(short_sample, { level: 1, chunkSize: 10 }, 5);
testDeflate(long_sample, { level: 1, memLevel: 1, chunkSize: 10 }, 0);
});
it('slow', () => {
testDeflate(short_sample, { level: 4, chunkSize: 10 }, 5);
testDeflate(long_sample, { level: 9, memLevel: 1, chunkSize: 10 }, 0);
});
it('rle', () => {
testDeflate(short_sample, { strategy: 3 }, 0);
testDeflate(short_sample, { strategy: 3, chunkSize: 10 }, 5);
testDeflate(long_sample, { strategy: 3, chunkSize: 10 }, 0);
});
it('huffman', () => {
testDeflate(short_sample, { strategy: 2 }, 0);
testDeflate(short_sample, { strategy: 2, chunkSize: 10 }, 5);
testDeflate(long_sample, { strategy: 2, chunkSize: 10 }, 0);
});
});
describe('Deflate states', () => {
//in port checking input parameters was removed
it('inflate bad parameters', () => {
let ret, strm;
ret = zlib_deflate.deflate(null, 0);
assert(ret === c.Z_STREAM_ERROR);
strm = new ZStream();
ret = zlib_deflate.deflateInit(null);
assert(ret === c.Z_STREAM_ERROR);
ret = zlib_deflate.deflateInit(strm, 6);
assert(ret === c.Z_OK);
ret = zlib_deflate.deflateSetHeader(null);
assert(ret === c.Z_STREAM_ERROR);
strm.state.wrap = 1;
ret = zlib_deflate.deflateSetHeader(strm, null);
assert(ret === c.Z_STREAM_ERROR);
strm.state.wrap = 2;
ret = zlib_deflate.deflateSetHeader(strm, null);
assert(ret === c.Z_OK);
ret = zlib_deflate.deflate(strm, c.Z_FINISH);
assert(ret === c.Z_BUF_ERROR);
ret = zlib_deflate.deflateEnd(null);
assert(ret === c.Z_STREAM_ERROR);
//BS_NEED_MORE
strm.state.status = 5;
ret = zlib_deflate.deflateEnd(strm);
assert(ret === c.Z_STREAM_ERROR);
});
});

BIN
test/fixtures/bad_wbits.deflate vendored
View file

Binary file not shown.

1
test/fixtures/bad_wbits.txt vendored
View file

File diff suppressed because one or more lines are too long

BIN
test/fixtures/binary_compare/deflate.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflateRaw.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflateRaw_level=1.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflateRaw_level=4.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflateRaw_windowBits=15.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_dictionary=spdy.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_dictionary=trivial.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=-1.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=1.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=2.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=3.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=4.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=5.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=6.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=7.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=8.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_level=9.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=1.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=2.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=3.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=4.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=5.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=6.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=7.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=8.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_memLevel=9.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_strategy=0.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_strategy=1.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_strategy=2.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_strategy=3.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_strategy=4.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=10.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=11.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=12.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=13.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=14.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=15.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=8.bin vendored
View file

Binary file not shown.

BIN
test/fixtures/binary_compare/deflate_windowBits=9.bin vendored
View file

Binary file not shown.

Some files were not shown because too many files have changed in this diff Show more