diff --git a/_docs/api.md b/_docs/api.md
index 4b938e8d..58ff0bfa 100644
--- a/_docs/api.md
+++ b/_docs/api.md
@@ -2166,7 +2166,16 @@ core.same(a, b)
如果a和b都是数组，则会递归依次比较数组中的值；如果都是对象亦然。
-core.utils.http(type, url, formData, success, error, mimeType, responseType)
+core.unzip(blobOrUrl, success, error, convertToText)
+解压一个zip文件。
+blobOrUrl为传入的二进制zip文件Blob格式，或zip文件的地址。
+success为成功后的回调，接收 文件名-文件内容 形式的对象，即
+{"filename1": ..., "filename2": ...}
+error为失败的回调，接收参数message为错误信息。
+convertToText如果为true则会将每个文件内容转成纯文本而不是二进制格式。
+
+
+core.http(type, url, formData, success, error, mimeType, responseType)
发送一个异步HTTP请求。
type为'GET'或者'POST'；url为目标地址；formData如果是POST请求则为表单数据。
success为成功后的回调，error为失败后的回调。
diff --git a/editor-mobile.html b/editor-mobile.html
index fe371abd..ba8ca496 100644
--- a/editor-mobile.html
+++ b/editor-mobile.html
@@ -585,6 +585,7 @@
+
+
+
diff --git a/libs/loader.js b/libs/loader.js
index 5d4da850..b7e265ae 100644
--- a/libs/loader.js
+++ b/libs/loader.js
@@ -50,7 +50,11 @@ loader.prototype._loadIcons = function () {
}
loader.prototype._loadMaterialImages = function (callback) {
- this.loadImages(core.materials, core.material.images, callback);
+ if (main.useCompress) {
+ this.loadImagesFromZip('project/images/materials.zip', core.materials, core.material.images, callback);
+ } else {
+ this.loadImages(core.materials, core.material.images, callback);
+ }
}
loader.prototype._loadExtraImages = function (callback) {
@@ -60,14 +64,18 @@ loader.prototype._loadExtraImages = function (callback) {
if (images.indexOf("hero.png") < 0)
images.push("hero.png");
- this.loadImages(images, core.material.images.images, callback);
+ if (main.useCompress) {
+ this.loadImagesFromZip('project/images/images.zip', images, core.material.images.images, callback);
+ } else {
+ this.loadImages(images, core.material.images.images, callback);
+ }
}
loader.prototype._loadAutotiles = function (callback) {
core.material.images.autotile = {};
var keys = Object.keys(core.material.icons.autotile);
var autotiles = {};
- this.loadImages(keys, autotiles, function () {
+ var _callback = function () {
keys.forEach(function (v) {
core.material.images.autotile[v] = autotiles[v];
});
@@ -77,13 +85,18 @@ loader.prototype._loadAutotiles = function (callback) {
});
callback();
- });
+ }
+ if (main.useCompress) {
+ this.loadImagesFromZip('project/images/autotiles.zip', keys, autotiles, _callback);
+ } else {
+ this.loadImages(keys, autotiles, _callback);
+ }
}
loader.prototype._loadTilesets = function (callback) {
core.material.images.tilesets = {};
core.tilesets = core.tilesets || [];
- core.loader.loadImages(core.clone(core.tilesets), core.material.images.tilesets, function () {
+ var _callback = function () {
// 检查宽高是32倍数，如果出错在控制台报错
for (var imgName in core.material.images.tilesets) {
var img = core.material.images.tilesets[imgName];
@@ -95,7 +108,12 @@ loader.prototype._loadTilesets = function (callback) {
}
}
callback();
- });
+ }
+ if (main.useCompress) {
+ this.loadImagesFromZip('project/images/tilesets.zip', core.tilesets, core.material.images.tilesets, _callback);
+ } else {
+ this.loadImages(core.tilesets, core.material.images.tilesets, _callback);
+ }
}
loader.prototype.loadImages = function (names, toSave, callback) {
@@ -122,6 +140,34 @@ loader.prototype.loadImages = function (names, toSave, callback) {
}
}
+loader.prototype.loadImagesFromZip = function (url, names, toSave, callback) {
+ if (!names || names.length == 0) {
+ if (callback) callback();
+ return;
+ }
+
+ core.unzip(url + "?v=" + main.version, function (data) {
+ var cnt = 1;
+ names.forEach(function (name) {
+ if (name.indexOf('.') < 0) name += '.png';
+ if (name in data) {
+ var img = new Image();
+ var url = URL.createObjectURL(data[name]);
+ cnt++;
+ img.onload = function () {
+ cnt--;
+ URL.revokeObjectURL(url);
+ if (cnt == 0 && callback) callback();
+ }
+ img.src = url;
+ toSave[name] = img;
+ }
+ });
+ cnt--;
+ if (cnt == 0 && callback) callback();
+ });
+}
+
loader.prototype.loadImage = function (imgName, callback) {
try {
var name = imgName;
@@ -144,58 +190,74 @@ loader.prototype.loadImage = function (imgName, callback) {
}
loader.prototype._loadAnimates = function () {
- core.animates.forEach(function (t) {
- core.http('GET', 'project/animates/' + t + ".animate", null, function (content) {
- try {
- content = JSON.parse(content);
- var data = {};
- data.ratio = content.ratio;
- data.se = content.se;
- data.images = [];
- data.images_rev = [];
- content.bitmaps.forEach(function (t2) {
- if (!t2) {
- data.images.push(null);
- }
- else {
- try {
- var image = new Image();
- image.src = t2;
- data.images.push(image);
- } catch (e) {
- main.log(e);
- data.images.push(null);
- }
- }
- })
- data.frame = content.frame_max;
- data.frames = [];
- content.frames.forEach(function (t2) {
- var info = [];
- t2.forEach(function (t3) {
- info.push({
- 'index': t3[0],
- 'x': t3[1],
- 'y': t3[2],
- 'zoom': t3[3],
- 'opacity': t3[4],
- 'mirror': t3[5] || 0,
- 'angle': t3[6] || 0,
- })
- })
- data.frames.push(info);
- })
- core.material.animates[t] = data;
+ if (main.useCompress) {
+ core.unzip('project/animates/animates.zip?v=' + main.version, function (animates) {
+ for (var name in animates) {
+ if (name.endsWith(".animate")) {
+ var t = name.substring(0, name.length - 8);
+ if (core.animates.indexOf(t) >= 0)
+ core.loader._loadAnimate(t, animates[name]);
+ }
}
- catch (e) {
+ }, null, true);
+ } else {
+ core.animates.forEach(function (t) {
+ core.http('GET', 'project/animates/' + t + ".animate?v=" + main.version, null, function (content) {
+ core.loader._loadAnimate(t, content);
+ }, function (e) {
main.log(e);
core.material.animates[t] = null;
+ }, "text/plain; charset=x-user-defined")
+ })
+ }'application/zip'
+}
+
+loader.prototype._loadAnimate = function (name, content) {
+ try {
+ content = JSON.parse(content);
+ var data = {};
+ data.ratio = content.ratio;
+ data.se = content.se;
+ data.images = [];
+ data.images_rev = [];
+ content.bitmaps.forEach(function (t2) {
+ if (!t2) {
+ data.images.push(null);
}
- }, function (e) {
- main.log(e);
- core.material.animates[t] = null;
- }, "text/plain; charset=x-user-defined")
- })
+ else {
+ try {
+ var image = new Image();
+ image.src = t2;
+ data.images.push(image);
+ } catch (e) {
+ main.log(e);
+ data.images.push(null);
+ }
+ }
+ })
+ data.frame = content.frame_max;
+ data.frames = [];
+ content.frames.forEach(function (t2) {
+ var info = [];
+ t2.forEach(function (t3) {
+ info.push({
+ 'index': t3[0],
+ 'x': t3[1],
+ 'y': t3[2],
+ 'zoom': t3[3],
+ 'opacity': t3[4],
+ 'mirror': t3[5] || 0,
+ 'angle': t3[6] || 0,
+ })
+ })
+ data.frames.push(info);
+ })
+ core.material.animates[name] = data;
+ }
+ catch (e) {
+ main.log(e);
+ core.material.animates[name] = null;
+ }
}
////// 加载音频 //////
@@ -204,9 +266,19 @@ loader.prototype._loadMusic = function () {
core.loader.loadOneMusic(t);
});
- core.sounds.forEach(function (t) {
- core.loader.loadOneSound(t);
- });
+ if (main.useCompress && core.musicStatus.audioContext) {
+ core.unzip('project/sounds/sounds.zip?v=' + main.version, function (data) {
+ for (var name in data) {
+ if (core.sounds.indexOf(name) >= 0) {
+ core.loader._loadOneSound_decodeData(name, data[name]);
+ }
+ }
+ });
+ } else {
+ core.sounds.forEach(function (t) {
+ core.loader.loadOneSound(t);
+ });
+ }
// 直接开始播放
core.playBgm(main.startBgm);
}
@@ -222,19 +294,8 @@ loader.prototype.loadOneMusic = function (name) {
loader.prototype.loadOneSound = function (name) {
if (core.musicStatus.audioContext != null) {
- core.http('GET', 'project/sounds/' + name, null, function (data) {
- try {
- core.musicStatus.audioContext.decodeAudioData(data, function (buffer) {
- core.material.sounds[name] = buffer;
- }, function (e) {
- main.log(e);
- core.material.sounds[name] = null;
- })
- }
- catch (e) {
- main.log(e);
- core.material.sounds[name] = null;
- }
+ core.http('GET', 'project/sounds/' + name + "?v=" + main.version, null, function (data) {
+ core.loader._loadOneSound_decodeData(name, data);
}, function (e) {
main.log(e);
core.material.sounds[name] = null;
@@ -247,6 +308,30 @@ loader.prototype.loadOneSound = function (name) {
}
}
+loader.prototype._loadOneSound_decodeData = function (name, data) {
+ if (data instanceof Blob) {
+ var blobReader = new zip.BlobReader(data);
+ blobReader.init(function () {
+ blobReader.readUint8Array(0, blobReader.size, function (uint8) {
+ core.loader._loadOneSound_decodeData(name, uint8.buffer);
+ })
+ });
+ return;
+ }
+ try {
+ core.musicStatus.audioContext.decodeAudioData(data, function (buffer) {
+ core.material.sounds[name] = buffer;
+ }, function (e) {
+ main.log(e);
+ core.material.sounds[name] = null;
+ })
+ }
+ catch (e) {
+ main.log(e);
+ core.material.sounds[name] = null;
+ }
+}
+
loader.prototype.loadBgm = function (name) {
name = core.getMappedName(name);
if (!core.material.bgms[name]) return;
diff --git a/libs/thirdparty/LICENSE.md b/libs/thirdparty/LICENSE.md
index 33ec4fdc..667f1d31 100644
--- a/libs/thirdparty/LICENSE.md
+++ b/libs/thirdparty/LICENSE.md
@@ -1,3 +1,238 @@
+lzstring
+============
+
+MIT License
+
+Copyright (c) 2013 pieroxy
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+localforage
+============
+
+
+ Apache License
+ Version 2.0, January 2004
+ http://www.apache.org/licenses/
+
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+ 1. Definitions.
+
+ "License" shall mean the terms and conditions for use, reproduction,
+ and distribution as defined by Sections 1 through 9 of this document.
+
+ "Licensor" shall mean the copyright owner or entity authorized by
+ the copyright owner that is granting the License.
+
+ "Legal Entity" shall mean the union of the acting entity and all
+ other entities that control, are controlled by, or are under common
+ control with that entity. For the purposes of this definition,
+ "control" means (i) the power, direct or indirect, to cause the
+ direction or management of such entity, whether by contract or
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
+ outstanding shares, or (iii) beneficial ownership of such entity.
+
+ "You" (or "Your") shall mean an individual or Legal Entity
+ exercising permissions granted by this License.
+
+ "Source" form shall mean the preferred form for making modifications,
+ including but not limited to software source code, documentation
+ source, and configuration files.
+
+ "Object" form shall mean any form resulting from mechanical
+ transformation or translation of a Source form, including but
+ not limited to compiled object code, generated documentation,
+ and conversions to other media types.
+
+ "Work" shall mean the work of authorship, whether in Source or
+ Object form, made available under the License, as indicated by a
+ copyright notice that is included in or attached to the work
+ (an example is provided in the Appendix below).
+
+ "Derivative Works" shall mean any work, whether in Source or Object
+ form, that is based on (or derived from) the Work and for which the
+ editorial revisions, annotations, elaborations, or other modifications
+ represent, as a whole, an original work of authorship. For the purposes
+ of this License, Derivative Works shall not include works that remain
+ separable from, or merely link (or bind by name) to the interfaces of,
+ the Work and Derivative Works thereof.
+
+ "Contribution" shall mean any work of authorship, including
+ the original version of the Work and any modifications or additions
+ to that Work or Derivative Works thereof, that is intentionally
+ submitted to Licensor for inclusion in the Work by the copyright owner
+ or by an individual or Legal Entity authorized to submit on behalf of
+ the copyright owner. For the purposes of this definition, "submitted"
+ means any form of electronic, verbal, or written communication sent
+ to the Licensor or its representatives, including but not limited to
+ communication on electronic mailing lists, source code control systems,
+ and issue tracking systems that are managed by, or on behalf of, the
+ Licensor for the purpose of discussing and improving the Work, but
+ excluding communication that is conspicuously marked or otherwise
+ designated in writing by the copyright owner as "Not a Contribution."
+
+ "Contributor" shall mean Licensor and any individual or Legal Entity
+ on behalf of whom a Contribution has been received by Licensor and
+ subsequently incorporated within the Work.
+
+ 2. Grant of Copyright License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ copyright license to reproduce, prepare Derivative Works of,
+ publicly display, publicly perform, sublicense, and distribute the
+ Work and such Derivative Works in Source or Object form.
+
+ 3. Grant of Patent License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ (except as stated in this section) patent license to make, have made,
+ use, offer to sell, sell, import, and otherwise transfer the Work,
+ where such license applies only to those patent claims licensable
+ by such Contributor that are necessarily infringed by their
+ Contribution(s) alone or by combination of their Contribution(s)
+ with the Work to which such Contribution(s) was submitted. If You
+ institute patent litigation against any entity (including a
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
+ or a Contribution incorporated within the Work constitutes direct
+ or contributory patent infringement, then any patent licenses
+ granted to You under this License for that Work shall terminate
+ as of the date such litigation is filed.
+
+ 4. Redistribution. You may reproduce and distribute copies of the
+ Work or Derivative Works thereof in any medium, with or without
+ modifications, and in Source or Object form, provided that You
+ meet the following conditions:
+
+ (a) You must give any other recipients of the Work or
+ Derivative Works a copy of this License; and
+
+ (b) You must cause any modified files to carry prominent notices
+ stating that You changed the files; and
+
+ (c) You must retain, in the Source form of any Derivative Works
+ that You distribute, all copyright, patent, trademark, and
+ attribution notices from the Source form of the Work,
+ excluding those notices that do not pertain to any part of
+ the Derivative Works; and
+
+ (d) If the Work includes a "NOTICE" text file as part of its
+ distribution, then any Derivative Works that You distribute must
+ include a readable copy of the attribution notices contained
+ within such NOTICE file, excluding those notices that do not
+ pertain to any part of the Derivative Works, in at least one
+ of the following places: within a NOTICE text file distributed
+ as part of the Derivative Works; within the Source form or
+ documentation, if provided along with the Derivative Works; or,
+ within a display generated by the Derivative Works, if and
+ wherever such third-party notices normally appear. The contents
+ of the NOTICE file are for informational purposes only and
+ do not modify the License. You may add Your own attribution
+ notices within Derivative Works that You distribute, alongside
+ or as an addendum to the NOTICE text from the Work, provided
+ that such additional attribution notices cannot be construed
+ as modifying the License.
+
+ You may add Your own copyright statement to Your modifications and
+ may provide additional or different license terms and conditions
+ for use, reproduction, or distribution of Your modifications, or
+ for any such Derivative Works as a whole, provided Your use,
+ reproduction, and distribution of the Work otherwise complies with
+ the conditions stated in this License.
+
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
+ any Contribution intentionally submitted for inclusion in the Work
+ by You to the Licensor shall be under the terms and conditions of
+ this License, without any additional terms or conditions.
+ Notwithstanding the above, nothing herein shall supersede or modify
+ the terms of any separate license agreement you may have executed
+ with Licensor regarding such Contributions.
+
+ 6. Trademarks. This License does not grant permission to use the trade
+ names, trademarks, service marks, or product names of the Licensor,
+ except as required for reasonable and customary use in describing the
+ origin of the Work and reproducing the content of the NOTICE file.
+
+ 7. Disclaimer of Warranty. Unless required by applicable law or
+ agreed to in writing, Licensor provides the Work (and each
+ Contributor provides its Contributions) on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+ implied, including, without limitation, any warranties or conditions
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+ PARTICULAR PURPOSE. You are solely responsible for determining the
+ appropriateness of using or redistributing the Work and assume any
+ risks associated with Your exercise of permissions under this License.
+
+ 8. Limitation of Liability. In no event and under no legal theory,
+ whether in tort (including negligence), contract, or otherwise,
+ unless required by applicable law (such as deliberate and grossly
+ negligent acts) or agreed to in writing, shall any Contributor be
+ liable to You for damages, including any direct, indirect, special,
+ incidental, or consequential damages of any character arising as a
+ result of this License or out of the use or inability to use the
+ Work (including but not limited to damages for loss of goodwill,
+ work stoppage, computer failure or malfunction, or any and all
+ other commercial damages or losses), even if such Contributor
+ has been advised of the possibility of such damages.
+
+ 9. Accepting Warranty or Additional Liability. While redistributing
+ the Work or Derivative Works thereof, You may choose to offer,
+ and charge a fee for, acceptance of support, warranty, indemnity,
+ or other liability obligations and/or rights consistent with this
+ License. However, in accepting such obligations, You may act only
+ on Your own behalf and on Your sole responsibility, not on behalf
+ of any other Contributor, and only if You agree to indemnify,
+ defend, and hold each Contributor harmless for any liability
+ incurred by, or claims asserted against, such Contributor by reason
+ of your accepting any such warranty or additional liability.
+
+ END OF TERMS AND CONDITIONS
+
+ APPENDIX: How to apply the Apache License to your work.
+
+ To apply the Apache License to your work, attach the following
+ boilerplate notice, with the fields enclosed by brackets "{}"
+ replaced with your own identifying information. (Don't include
+ the brackets!) The text should be enclosed in the appropriate
+ comment syntax for the file format. We also recommend that a
+ file or class name and description of purpose be included on the
+ same "printed page" as the copyright notice for easier
+ identification within third-party archives.
+
+ Copyright 2014 Mozilla
+
+ Licensed under the Apache License, Version 2.0 (the "License");
+ you may not use this file except in compliance with the License.
+ You may obtain a copy of the License at
+
+ http://www.apache.org/licenses/LICENSE-2.0
+
+ Unless required by applicable law or agreed to in writing, software
+ distributed under the License is distributed on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ See the License for the specific language governing permissions and
+ limitations under the License.
+
+
+mid
+============
+
Copyright (c) 2010, Matt Westcott & Ben Firshman
All rights reserved.
@@ -21,4 +256,28 @@ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\ No newline at end of file
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+zip
+============
+
+ Copyright (c) 2013 Gildas Lormeau. All rights reserved.
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+ 1. Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+ notice, this list of conditions and the following disclaimer in
+ the documentation and/or other materials provided with the distribution.
+ 3. The names of the authors may not be used to endorse or promote products
+ derived from this software without specific prior written permission.
+ THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
+ INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
+ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
+ OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/libs/thirdparty/zip.js b/libs/thirdparty/zip.js
new file mode 100644
index 00000000..f7f68f47
--- /dev/null
+++ b/libs/thirdparty/zip.js
@@ -0,0 +1,2895 @@
+/*
+ Copyright (c) 2013 Gildas Lormeau. All rights reserved.
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ 1. Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ 2. Redistributions in binary form must reproduce the above copyright
+ notice, this list of conditions and the following disclaimer in
+ the documentation and/or other materials provided with the distribution.
+
+ 3. The names of the authors may not be used to endorse or promote products
+ derived from this software without specific prior written permission.
+
+ THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
+ INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
+ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
+ OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+(function(obj) {
+ "use strict";
+
+ var ERR_BAD_FORMAT = "File format is not recognized.";
+ var ERR_CRC = "CRC failed.";
+ var ERR_ENCRYPTED = "File contains encrypted entry.";
+ var ERR_ZIP64 = "File is using Zip64 (4gb+ file size).";
+ var ERR_READ = "Error while reading zip file.";
+ var ERR_WRITE = "Error while writing zip file.";
+ var ERR_WRITE_DATA = "Error while writing file data.";
+ var ERR_READ_DATA = "Error while reading file data.";
+ var ERR_DUPLICATED_NAME = "File already exists.";
+ var CHUNK_SIZE = 512 * 1024;
+
+ var TEXT_PLAIN = "text/plain";
+
+ var appendABViewSupported;
+ try {
+ appendABViewSupported = new Blob([ new DataView(new ArrayBuffer(0)) ]).size === 0;
+ } catch (e) {
+ }
+
+ function Crc32() {
+ this.crc = -1;
+ }
+ Crc32.prototype.append = function append(data) {
+ var crc = this.crc | 0, table = this.table;
+ for (var offset = 0, len = data.length | 0; offset < len; offset++)
+ crc = (crc >>> 8) ^ table[(crc ^ data[offset]) & 0xFF];
+ this.crc = crc;
+ };
+ Crc32.prototype.get = function get() {
+ return ~this.crc;
+ };
+ Crc32.prototype.table = (function() {
+ var i, j, t, table = []; // Uint32Array is actually slower than []
+ for (i = 0; i < 256; i++) {
+ t = i;
+ for (j = 0; j < 8; j++)
+ if (t & 1)
+ t = (t >>> 1) ^ 0xEDB88320;
+ else
+ t = t >>> 1;
+ table[i] = t;
+ }
+ return table;
+ })();
+
+ // "no-op" codec
+ function NOOP() {}
+ NOOP.prototype.append = function append(bytes, onprogress) {
+ return bytes;
+ };
+ NOOP.prototype.flush = function flush() {};
+
+ function blobSlice(blob, index, length) {
+ if (index < 0 || length < 0 || index + length > blob.size)
+ throw new RangeError('offset:' + index + ', length:' + length + ', size:' + blob.size);
+ if (blob.slice)
+ return blob.slice(index, index + length);
+ else if (blob.webkitSlice)
+ return blob.webkitSlice(index, index + length);
+ else if (blob.mozSlice)
+ return blob.mozSlice(index, index + length);
+ else if (blob.msSlice)
+ return blob.msSlice(index, index + length);
+ }
+
+ function getDataHelper(byteLength, bytes) {
+ var dataBuffer, dataArray;
+ dataBuffer = new ArrayBuffer(byteLength);
+ dataArray = new Uint8Array(dataBuffer);
+ if (bytes)
+ dataArray.set(bytes, 0);
+ return {
+ buffer : dataBuffer,
+ array : dataArray,
+ view : new DataView(dataBuffer)
+ };
+ }
+
+ // Readers
+ function Reader() {
+ }
+
+ function TextReader(text) {
+ var that = this, blobReader;
+
+ function init(callback, onerror) {
+ var blob = new Blob([ text ], {
+ type : TEXT_PLAIN
+ });
+ blobReader = new BlobReader(blob);
+ blobReader.init(function() {
+ that.size = blobReader.size;
+ callback();
+ }, onerror);
+ }
+
+ function readUint8Array(index, length, callback, onerror) {
+ blobReader.readUint8Array(index, length, callback, onerror);
+ }
+
+ that.size = 0;
+ that.init = init;
+ that.readUint8Array = readUint8Array;
+ }
+ TextReader.prototype = new Reader();
+ TextReader.prototype.constructor = TextReader;
+
+ function Data64URIReader(dataURI) {
+ var that = this, dataStart;
+
+ function init(callback) {
+ var dataEnd = dataURI.length;
+ while (dataURI.charAt(dataEnd - 1) == "=")
+ dataEnd--;
+ dataStart = dataURI.indexOf(",") + 1;
+ that.size = Math.floor((dataEnd - dataStart) * 0.75);
+ callback();
+ }
+
+ function readUint8Array(index, length, callback) {
+ var i, data = getDataHelper(length);
+ var start = Math.floor(index / 3) * 4;
+ var end = Math.ceil((index + length) / 3) * 4;
+ var bytes = obj.atob(dataURI.substring(start + dataStart, end + dataStart));
+ var delta = index - Math.floor(start / 4) * 3;
+ for (i = delta; i < delta + length; i++)
+ data.array[i - delta] = bytes.charCodeAt(i);
+ callback(data.array);
+ }
+
+ that.size = 0;
+ that.init = init;
+ that.readUint8Array = readUint8Array;
+ }
+ Data64URIReader.prototype = new Reader();
+ Data64URIReader.prototype.constructor = Data64URIReader;
+
+ function BlobReader(blob) {
+ var that = this;
+
+ function init(callback) {
+ that.size = blob.size;
+ callback();
+ }
+
+ function readUint8Array(index, length, callback, onerror) {
+ var reader = new FileReader();
+ reader.onload = function(e) {
+ callback(new Uint8Array(e.target.result));
+ };
+ reader.onerror = onerror;
+ try {
+ reader.readAsArrayBuffer(blobSlice(blob, index, length));
+ } catch (e) {
+ onerror(e);
+ }
+ }
+
+ that.size = 0;
+ that.init = init;
+ that.readUint8Array = readUint8Array;
+ }
+ BlobReader.prototype = new Reader();
+ BlobReader.prototype.constructor = BlobReader;
+
+ // Writers
+
+ function Writer() {
+ }
+ Writer.prototype.getData = function(callback) {
+ callback(this.data);
+ };
+
+ function TextWriter(encoding) {
+ var that = this, blob;
+
+ function init(callback) {
+ blob = new Blob([], {
+ type : TEXT_PLAIN
+ });
+ callback();
+ }
+
+ function writeUint8Array(array, callback) {
+ blob = new Blob([ blob, appendABViewSupported ? array : array.buffer ], {
+ type : TEXT_PLAIN
+ });
+ callback();
+ }
+
+ function getData(callback, onerror) {
+ var reader = new FileReader();
+ reader.onload = function(e) {
+ callback(e.target.result);
+ };
+ reader.onerror = onerror;
+ reader.readAsText(blob, encoding);
+ }
+
+ that.init = init;
+ that.writeUint8Array = writeUint8Array;
+ that.getData = getData;
+ }
+ TextWriter.prototype = new Writer();
+ TextWriter.prototype.constructor = TextWriter;
+
+ function Data64URIWriter(contentType) {
+ var that = this, data = "", pending = "";
+
+ function init(callback) {
+ data += "data:" + (contentType || "") + ";base64,";
+ callback();
+ }
+
+ function writeUint8Array(array, callback) {
+ var i, delta = pending.length, dataString = pending;
+ pending = "";
+ for (i = 0; i < (Math.floor((delta + array.length) / 3) * 3) - delta; i++)
+ dataString += String.fromCharCode(array[i]);
+ for (; i < array.length; i++)
+ pending += String.fromCharCode(array[i]);
+ if (dataString.length > 2)
+ data += obj.btoa(dataString);
+ else
+ pending = dataString;
+ callback();
+ }
+
+ function getData(callback) {
+ callback(data + obj.btoa(pending));
+ }
+
+ that.init = init;
+ that.writeUint8Array = writeUint8Array;
+ that.getData = getData;
+ }
+ Data64URIWriter.prototype = new Writer();
+ Data64URIWriter.prototype.constructor = Data64URIWriter;
+
+ function BlobWriter(contentType) {
+ var blob, that = this;
+
+ function init(callback) {
+ blob = new Blob([], {
+ type : contentType
+ });
+ callback();
+ }
+
+ function writeUint8Array(array, callback) {
+ blob = new Blob([ blob, appendABViewSupported ? array : array.buffer ], {
+ type : contentType
+ });
+ callback();
+ }
+
+ function getData(callback) {
+ callback(blob);
+ }
+
+ that.init = init;
+ that.writeUint8Array = writeUint8Array;
+ that.getData = getData;
+ }
+ BlobWriter.prototype = new Writer();
+ BlobWriter.prototype.constructor = BlobWriter;
+
+ function launchProcess(process, reader, writer, offset, size, crcType, onprogress, onend, onreaderror, onwriteerror) {
+ var chunkIndex = 0, index, outputSize = 0,
+ crcInput = crcType === 'input',
+ crcOutput = crcType === 'output',
+ crc = new Crc32();
+ function step() {
+ var outputData;
+ index = chunkIndex * CHUNK_SIZE;
+ if (index < size)
+ reader.readUint8Array(offset + index, Math.min(CHUNK_SIZE, size - index), function(inputData) {
+ var outputData;
+ try {
+ outputData = process.append(inputData, function(loaded) {
+ if (onprogress)
+ onprogress(index + loaded, size);
+ });
+ } catch (e) {
+ onreaderror(e);
+ return;
+ }
+ if (outputData) {
+ outputSize += outputData.length;
+ writer.writeUint8Array(outputData, function() {
+ chunkIndex++;
+ setTimeout(step, 1);
+ }, onwriteerror);
+ if (crcOutput)
+ crc.append(outputData);
+ } else {
+ chunkIndex++;
+ setTimeout(step, 1);
+ }
+ if (crcInput)
+ crc.append(inputData);
+ if (onprogress)
+ onprogress(index, size);
+ }, onreaderror);
+ else {
+ try {
+ outputData = process.flush();
+ } catch (e) {
+ onreaderror(e);
+ return;
+ }
+ if (outputData) {
+ if (crcOutput)
+ crc.append(outputData);
+ outputSize += outputData.length;
+ writer.writeUint8Array(outputData, function() {
+ onend(outputSize, crc.get());
+ }, onwriteerror);
+ } else
+ onend(outputSize, crc.get());
+ }
+ }
+
+ step();
+ }
+
+ function inflate(sn, reader, writer, offset, size, computeCrc32, onend, onprogress, onreaderror, onwriteerror) {
+ var crcType = computeCrc32 ? 'output' : 'none';
+ launchProcess(new obj.zip.Inflater(), reader, writer, offset, size, crcType, onprogress, onend, onreaderror, onwriteerror);
+ }
+
+ function deflate(sn, reader, writer, level, onend, onprogress, onreaderror, onwriteerror) {
+ var crcType = 'input';
+ launchProcess(new obj.zip.Deflater(), reader, writer, 0, reader.size, crcType, onprogress, onend, onreaderror, onwriteerror);
+ }
+
+ function copy(sn, reader, writer, offset, size, computeCrc32, onend, onprogress, onreaderror, onwriteerror) {
+ var crcType = 'input';
+ launchProcess(new NOOP(), reader, writer, offset, size, crcType, onprogress, onend, onreaderror, onwriteerror);
+ }
+
+ // ZipReader
+
+ function decodeASCII(str) {
+ var i, out = "", charCode, extendedASCII = [ '\u00C7', '\u00FC', '\u00E9', '\u00E2', '\u00E4', '\u00E0', '\u00E5', '\u00E7', '\u00EA', '\u00EB',
+ '\u00E8', '\u00EF', '\u00EE', '\u00EC', '\u00C4', '\u00C5', '\u00C9', '\u00E6', '\u00C6', '\u00F4', '\u00F6', '\u00F2', '\u00FB', '\u00F9',
+ '\u00FF', '\u00D6', '\u00DC', '\u00F8', '\u00A3', '\u00D8', '\u00D7', '\u0192', '\u00E1', '\u00ED', '\u00F3', '\u00FA', '\u00F1', '\u00D1',
+ '\u00AA', '\u00BA', '\u00BF', '\u00AE', '\u00AC', '\u00BD', '\u00BC', '\u00A1', '\u00AB', '\u00BB', '_', '_', '_', '\u00A6', '\u00A6',
+ '\u00C1', '\u00C2', '\u00C0', '\u00A9', '\u00A6', '\u00A6', '+', '+', '\u00A2', '\u00A5', '+', '+', '-', '-', '+', '-', '+', '\u00E3',
+ '\u00C3', '+', '+', '-', '-', '\u00A6', '-', '+', '\u00A4', '\u00F0', '\u00D0', '\u00CA', '\u00CB', '\u00C8', 'i', '\u00CD', '\u00CE',
+ '\u00CF', '+', '+', '_', '_', '\u00A6', '\u00CC', '_', '\u00D3', '\u00DF', '\u00D4', '\u00D2', '\u00F5', '\u00D5', '\u00B5', '\u00FE',
+ '\u00DE', '\u00DA', '\u00DB', '\u00D9', '\u00FD', '\u00DD', '\u00AF', '\u00B4', '\u00AD', '\u00B1', '_', '\u00BE', '\u00B6', '\u00A7',
+ '\u00F7', '\u00B8', '\u00B0', '\u00A8', '\u00B7', '\u00B9', '\u00B3', '\u00B2', '_', ' ' ];
+ for (i = 0; i < str.length; i++) {
+ charCode = str.charCodeAt(i) & 0xFF;
+ if (charCode > 127)
+ out += extendedASCII[charCode - 128];
+ else
+ out += String.fromCharCode(charCode);
+ }
+ return out;
+ }
+
+ function decodeUTF8(string) {
+ return decodeURIComponent(escape(string));
+ }
+
+ function getString(bytes) {
+ var i, str = "";
+ for (i = 0; i < bytes.length; i++)
+ str += String.fromCharCode(bytes[i]);
+ return str;
+ }
+
+ function getDate(timeRaw) {
+ var date = (timeRaw & 0xffff0000) >> 16, time = timeRaw & 0x0000ffff;
+ try {
+ return new Date(1980 + ((date & 0xFE00) >> 9), ((date & 0x01E0) >> 5) - 1, date & 0x001F, (time & 0xF800) >> 11, (time & 0x07E0) >> 5,
+ (time & 0x001F) * 2, 0);
+ } catch (e) {
+ }
+ }
+
+ function readCommonHeader(entry, data, index, centralDirectory, onerror) {
+ entry.version = data.view.getUint16(index, true);
+ entry.bitFlag = data.view.getUint16(index + 2, true);
+ entry.compressionMethod = data.view.getUint16(index + 4, true);
+ entry.lastModDateRaw = data.view.getUint32(index + 6, true);
+ entry.lastModDate = getDate(entry.lastModDateRaw);
+ if ((entry.bitFlag & 0x01) === 0x01) {
+ onerror(ERR_ENCRYPTED);
+ return;
+ }
+ if (centralDirectory || (entry.bitFlag & 0x0008) != 0x0008) {
+ entry.crc32 = data.view.getUint32(index + 10, true);
+ entry.compressedSize = data.view.getUint32(index + 14, true);
+ entry.uncompressedSize = data.view.getUint32(index + 18, true);
+ }
+ if (entry.compressedSize === 0xFFFFFFFF || entry.uncompressedSize === 0xFFFFFFFF) {
+ onerror(ERR_ZIP64);
+ return;
+ }
+ entry.filenameLength = data.view.getUint16(index + 22, true);
+ entry.extraFieldLength = data.view.getUint16(index + 24, true);
+ }
+
+ function createZipReader(reader, callback, onerror) {
+ var inflateSN = 0;
+
+ function Entry() {
+ }
+
+ Entry.prototype.getData = function(writer, onend, onprogress, checkCrc32) {
+ var that = this;
+
+ function testCrc32(crc32) {
+ var dataCrc32 = getDataHelper(4);
+ dataCrc32.view.setUint32(0, crc32);
+ return that.crc32 == dataCrc32.view.getUint32(0);
+ }
+
+ function getWriterData(uncompressedSize, crc32) {
+ if (checkCrc32 && !testCrc32(crc32))
+ onerror(ERR_CRC);
+ else
+ writer.getData(function(data) {
+ onend(data);
+ });
+ }
+
+ function onreaderror(err) {
+ onerror(err || ERR_READ_DATA);
+ }
+
+ function onwriteerror(err) {
+ onerror(err || ERR_WRITE_DATA);
+ }
+
+ reader.readUint8Array(that.offset, 30, function(bytes) {
+ var data = getDataHelper(bytes.length, bytes), dataOffset;
+ if (data.view.getUint32(0) != 0x504b0304) {
+ onerror(ERR_BAD_FORMAT);
+ return;
+ }
+ readCommonHeader(that, data, 4, false, onerror);
+ dataOffset = that.offset + 30 + that.filenameLength + that.extraFieldLength;
+ writer.init(function() {
+ if (that.compressionMethod === 0)
+ copy(inflateSN++, reader, writer, dataOffset, that.compressedSize, checkCrc32, getWriterData, onprogress, onreaderror, onwriteerror);
+ else
+ inflate(inflateSN++, reader, writer, dataOffset, that.compressedSize, checkCrc32, getWriterData, onprogress, onreaderror, onwriteerror);
+ }, onwriteerror);
+ }, onreaderror);
+ };
+
+ function seekEOCDR(eocdrCallback) {
+ // "End of central directory record" is the last part of a zip archive, and is at least 22 bytes long.
+ // Zip file comment is the last part of EOCDR and has max length of 64KB,
+ // so we only have to search the last 64K + 22 bytes of a archive for EOCDR signature (0x06054b50).
+ var EOCDR_MIN = 22;
+ if (reader.size < EOCDR_MIN) {
+ onerror(ERR_BAD_FORMAT);
+ return;
+ }
+ var ZIP_COMMENT_MAX = 256 * 256, EOCDR_MAX = EOCDR_MIN + ZIP_COMMENT_MAX;
+
+ // In most cases, the EOCDR is EOCDR_MIN bytes long
+ doSeek(EOCDR_MIN, function() {
+ // If not found, try within EOCDR_MAX bytes
+ doSeek(Math.min(EOCDR_MAX, reader.size), function() {
+ onerror(ERR_BAD_FORMAT);
+ });
+ });
+
+ // seek last length bytes of file for EOCDR
+ function doSeek(length, eocdrNotFoundCallback) {
+ reader.readUint8Array(reader.size - length, length, function(bytes) {
+ for (var i = bytes.length - EOCDR_MIN; i >= 0; i--) {
+ if (bytes[i] === 0x50 && bytes[i + 1] === 0x4b && bytes[i + 2] === 0x05 && bytes[i + 3] === 0x06) {
+ eocdrCallback(new DataView(bytes.buffer, i, EOCDR_MIN));
+ return;
+ }
+ }
+ eocdrNotFoundCallback();
+ }, function() {
+ onerror(ERR_READ);
+ });
+ }
+ }
+
+ var zipReader = {
+ getEntries : function(callback) {
+ // look for End of central directory record
+ seekEOCDR(function(dataView) {
+ var datalength, fileslength;
+ datalength = dataView.getUint32(16, true);
+ fileslength = dataView.getUint16(8, true);
+ if (datalength < 0 || datalength >= reader.size) {
+ onerror(ERR_BAD_FORMAT);
+ return;
+ }
+ reader.readUint8Array(datalength, reader.size - datalength, function(bytes) {
+ var i, index = 0, entries = [], entry, filename, comment, data = getDataHelper(bytes.length, bytes);
+ for (i = 0; i < fileslength; i++) {
+ entry = new Entry();
+ if (data.view.getUint32(index) != 0x504b0102) {
+ onerror(ERR_BAD_FORMAT);
+ return;
+ }
+ readCommonHeader(entry, data, index + 6, true, onerror);
+ entry.commentLength = data.view.getUint16(index + 32, true);
+ entry.directory = ((data.view.getUint8(index + 38) & 0x10) == 0x10);
+ entry.offset = data.view.getUint32(index + 42, true);
+ filename = getString(data.array.subarray(index + 46, index + 46 + entry.filenameLength));
+ entry.filename = ((entry.bitFlag & 0x0800) === 0x0800) ? decodeUTF8(filename) : decodeASCII(filename);
+ if (!entry.directory && entry.filename.charAt(entry.filename.length - 1) == "/")
+ entry.directory = true;
+ comment = getString(data.array.subarray(index + 46 + entry.filenameLength + entry.extraFieldLength, index + 46
+ + entry.filenameLength + entry.extraFieldLength + entry.commentLength));
+ entry.comment = ((entry.bitFlag & 0x0800) === 0x0800) ? decodeUTF8(comment) : decodeASCII(comment);
+ entries.push(entry);
+ index += 46 + entry.filenameLength + entry.extraFieldLength + entry.commentLength;
+ }
+ callback(entries);
+ }, function() {
+ onerror(ERR_READ);
+ });
+ });
+ },
+ close : function(callback) {
+ if (callback)
+ callback();
+ },
+ };
+
+ callback(zipReader);
+ }
+
+ // ZipWriter
+
+ function encodeUTF8(string) {
+ return unescape(encodeURIComponent(string));
+ }
+
+ function getBytes(str) {
+ var i, array = [];
+ for (i = 0; i < str.length; i++)
+ array.push(str.charCodeAt(i));
+ return array;
+ }
+
+ function createZipWriter(writer, callback, onerror, dontDeflate) {
+ var files = {}, filenames = [], datalength = 0;
+ var deflateSN = 0;
+
+ function onwriteerror(err) {
+ onerror(err || ERR_WRITE);
+ }
+
+ function onreaderror(err) {
+ onerror(err || ERR_READ_DATA);
+ }
+
+ var zipWriter = {
+ add : function(name, reader, onend, onprogress, options) {
+ var header, filename, date;
+
+ function writeHeader(callback) {
+ var data;
+ date = options.lastModDate || new Date();
+ header = getDataHelper(26);
+ files[name] = {
+ headerArray : header.array,
+ directory : options.directory,
+ filename : filename,
+ offset : datalength,
+ comment : getBytes(encodeUTF8(options.comment || ""))
+ };
+ header.view.setUint32(0, 0x14000808);
+ if (options.version)
+ header.view.setUint8(0, options.version);
+ if (!dontDeflate && options.level !== 0 && !options.directory)
+ header.view.setUint16(4, 0x0800);
+ header.view.setUint16(6, (((date.getHours() << 6) | date.getMinutes()) << 5) | date.getSeconds() / 2, true);
+ header.view.setUint16(8, ((((date.getFullYear() - 1980) << 4) | (date.getMonth() + 1)) << 5) | date.getDate(), true);
+ header.view.setUint16(22, filename.length, true);
+ data = getDataHelper(30 + filename.length);
+ data.view.setUint32(0, 0x504b0304);
+ data.array.set(header.array, 4);
+ data.array.set(filename, 30);
+ datalength += data.array.length;
+ writer.writeUint8Array(data.array, callback, onwriteerror);
+ }
+
+ function writeFooter(compressedLength, crc32) {
+ var footer = getDataHelper(16);
+ datalength += compressedLength || 0;
+ footer.view.setUint32(0, 0x504b0708);
+ if (typeof crc32 != "undefined") {
+ header.view.setUint32(10, crc32, true);
+ footer.view.setUint32(4, crc32, true);
+ }
+ if (reader) {
+ footer.view.setUint32(8, compressedLength, true);
+ header.view.setUint32(14, compressedLength, true);
+ footer.view.setUint32(12, reader.size, true);
+ header.view.setUint32(18, reader.size, true);
+ }
+ writer.writeUint8Array(footer.array, function() {
+ datalength += 16;
+ onend();
+ }, onwriteerror);
+ }
+
+ function writeFile() {
+ options = options || {};
+ name = name.trim();
+ if (options.directory && name.charAt(name.length - 1) != "/")
+ name += "/";
+ if (files.hasOwnProperty(name)) {
+ onerror(ERR_DUPLICATED_NAME);
+ return;
+ }
+ filename = getBytes(encodeUTF8(name));
+ filenames.push(name);
+ writeHeader(function() {
+ if (reader)
+ if (dontDeflate || options.level === 0)
+ copy(deflateSN++, reader, writer, 0, reader.size, true, writeFooter, onprogress, onreaderror, onwriteerror);
+ else
+ deflate(deflateSN++, reader, writer, options.level, writeFooter, onprogress, onreaderror, onwriteerror);
+ else
+ writeFooter();
+ }, onwriteerror);
+ }
+
+ if (reader)
+ reader.init(writeFile, onreaderror);
+ else
+ writeFile();
+ },
+ close : function(callback) {
+
+ var data, length = 0, index = 0, indexFilename, file;
+ for (indexFilename = 0; indexFilename < filenames.length; indexFilename++) {
+ file = files[filenames[indexFilename]];
+ length += 46 + file.filename.length + file.comment.length;
+ }
+ data = getDataHelper(length + 22);
+ for (indexFilename = 0; indexFilename < filenames.length; indexFilename++) {
+ file = files[filenames[indexFilename]];
+ data.view.setUint32(index, 0x504b0102);
+ data.view.setUint16(index + 4, 0x1400);
+ data.array.set(file.headerArray, index + 6);
+ data.view.setUint16(index + 32, file.comment.length, true);
+ if (file.directory)
+ data.view.setUint8(index + 38, 0x10);
+ data.view.setUint32(index + 42, file.offset, true);
+ data.array.set(file.filename, index + 46);
+ data.array.set(file.comment, index + 46 + file.filename.length);
+ index += 46 + file.filename.length + file.comment.length;
+ }
+ data.view.setUint32(index, 0x504b0506);
+ data.view.setUint16(index + 8, filenames.length, true);
+ data.view.setUint16(index + 10, filenames.length, true);
+ data.view.setUint32(index + 12, length, true);
+ data.view.setUint32(index + 16, datalength, true);
+ writer.writeUint8Array(data.array, function() {
+ writer.getData(callback);
+ }, onwriteerror);
+ },
+ };
+
+ callback(zipWriter);
+ }
+
+ function onerror_default(error) {
+ console.error(error);
+ }
+ obj.zip = {
+ Reader : Reader,
+ Writer : Writer,
+ BlobReader : BlobReader,
+ Data64URIReader : Data64URIReader,
+ TextReader : TextReader,
+ BlobWriter : BlobWriter,
+ Data64URIWriter : Data64URIWriter,
+ TextWriter : TextWriter,
+ createReader : function(reader, callback, onerror) {
+ onerror = onerror || onerror_default;
+
+ reader.init(function() {
+ createZipReader(reader, callback, onerror);
+ }, onerror);
+ },
+ createWriter : function(writer, callback, onerror, dontDeflate) {
+ onerror = onerror || onerror_default;
+ dontDeflate = !!dontDeflate;
+
+ writer.init(function() {
+ createZipWriter(writer, callback, onerror, dontDeflate);
+ }, onerror);
+ },
+ };
+
+})(this);
+
+// -- Inflate.js
+
+/*
+ Copyright (c) 2013 Gildas Lormeau. All rights reserved.
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ 1. Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+
+ 2. Redistributions in binary form must reproduce the above copyright
+ notice, this list of conditions and the following disclaimer in
+ the documentation and/or other materials provided with the distribution.
+
+ 3. The names of the authors may not be used to endorse or promote products
+ derived from this software without specific prior written permission.
+
+ THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,
+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
+ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,
+ INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,
+ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,
+ OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/*
+ * This program is based on JZlib 1.0.2 ymnk, JCraft,Inc.
+ * JZlib is based on zlib-1.1.3, so all credit should go authors
+ * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)
+ * and contributors of zlib.
+ */
+
+(function(global) {
+ "use strict";
+
+ // Global
+ var MAX_BITS = 15;
+
+ var Z_OK = 0;
+ var Z_STREAM_END = 1;
+ var Z_NEED_DICT = 2;
+ var Z_STREAM_ERROR = -2;
+ var Z_DATA_ERROR = -3;
+ var Z_MEM_ERROR = -4;
+ var Z_BUF_ERROR = -5;
+
+ var inflate_mask = [ 0x00000000, 0x00000001, 0x00000003, 0x00000007, 0x0000000f, 0x0000001f, 0x0000003f, 0x0000007f, 0x000000ff, 0x000001ff, 0x000003ff,
+ 0x000007ff, 0x00000fff, 0x00001fff, 0x00003fff, 0x00007fff, 0x0000ffff ];
+
+ var MANY = 1440;
+
+ // JZlib version : "1.0.2"
+ var Z_NO_FLUSH = 0;
+ var Z_FINISH = 4;
+
+ // InfTree
+ var fixed_bl = 9;
+ var fixed_bd = 5;
+
+ var fixed_tl = [ 96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9, 192, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 160, 0, 8, 0,
+ 0, 8, 128, 0, 8, 64, 0, 9, 224, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 144, 83, 7, 59, 0, 8, 120, 0, 8, 56, 0, 9, 208, 81, 7, 17, 0, 8, 104, 0, 8, 40,
+ 0, 9, 176, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 240, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8, 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 200, 81, 7, 13,
+ 0, 8, 100, 0, 8, 36, 0, 9, 168, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 232, 80, 7, 8, 0, 8, 92, 0, 8, 28, 0, 9, 152, 84, 7, 83, 0, 8, 124, 0, 8, 60,
+ 0, 9, 216, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 184, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9, 248, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7,
+ 35, 0, 8, 114, 0, 8, 50, 0, 9, 196, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 164, 0, 8, 2, 0, 8, 130, 0, 8, 66, 0, 9, 228, 80, 7, 7, 0, 8, 90, 0, 8,
+ 26, 0, 9, 148, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 212, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9, 180, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 244, 80,
+ 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 204, 81, 7, 15, 0, 8, 102, 0, 8, 38, 0, 9, 172, 0, 8, 6, 0, 8, 134, 0,
+ 8, 70, 0, 9, 236, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 156, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9, 220, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 188, 0,
+ 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 252, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0, 8, 113, 0, 8, 49, 0, 9, 194, 80, 7, 10, 0, 8, 97,
+ 0, 8, 33, 0, 9, 162, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 226, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9, 146, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 210,
+ 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 178, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 242, 80, 7, 4, 0, 8, 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117,
+ 0, 8, 53, 0, 9, 202, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 170, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9, 234, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 154,
+ 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 218, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 186, 0, 8, 13, 0, 8, 141, 0, 8, 77, 0, 9, 250, 80, 7, 3, 0, 8, 83,
+ 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 198, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9, 166, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 230,
+ 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 150, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 214, 82, 7, 19, 0, 8, 107, 0, 8, 43, 0, 9, 182, 0, 8, 11, 0, 8, 139,
+ 0, 8, 75, 0, 9, 246, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9, 206, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 174,
+ 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 238, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 158, 84, 7, 99, 0, 8, 127, 0, 8, 63, 0, 9, 222, 82, 7, 27, 0, 8, 111,
+ 0, 8, 47, 0, 9, 190, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 254, 96, 7, 256, 0, 8, 80, 0, 8, 16, 84, 8, 115, 82, 7, 31, 0, 8, 112, 0, 8, 48, 0, 9,
+ 193, 80, 7, 10, 0, 8, 96, 0, 8, 32, 0, 9, 161, 0, 8, 0, 0, 8, 128, 0, 8, 64, 0, 9, 225, 80, 7, 6, 0, 8, 88, 0, 8, 24, 0, 9, 145, 83, 7, 59, 0, 8,
+ 120, 0, 8, 56, 0, 9, 209, 81, 7, 17, 0, 8, 104, 0, 8, 40, 0, 9, 177, 0, 8, 8, 0, 8, 136, 0, 8, 72, 0, 9, 241, 80, 7, 4, 0, 8, 84, 0, 8, 20, 85, 8,
+ 227, 83, 7, 43, 0, 8, 116, 0, 8, 52, 0, 9, 201, 81, 7, 13, 0, 8, 100, 0, 8, 36, 0, 9, 169, 0, 8, 4, 0, 8, 132, 0, 8, 68, 0, 9, 233, 80, 7, 8, 0, 8,
+ 92, 0, 8, 28, 0, 9, 153, 84, 7, 83, 0, 8, 124, 0, 8, 60, 0, 9, 217, 82, 7, 23, 0, 8, 108, 0, 8, 44, 0, 9, 185, 0, 8, 12, 0, 8, 140, 0, 8, 76, 0, 9,
+ 249, 80, 7, 3, 0, 8, 82, 0, 8, 18, 85, 8, 163, 83, 7, 35, 0, 8, 114, 0, 8, 50, 0, 9, 197, 81, 7, 11, 0, 8, 98, 0, 8, 34, 0, 9, 165, 0, 8, 2, 0, 8,
+ 130, 0, 8, 66, 0, 9, 229, 80, 7, 7, 0, 8, 90, 0, 8, 26, 0, 9, 149, 84, 7, 67, 0, 8, 122, 0, 8, 58, 0, 9, 213, 82, 7, 19, 0, 8, 106, 0, 8, 42, 0, 9,
+ 181, 0, 8, 10, 0, 8, 138, 0, 8, 74, 0, 9, 245, 80, 7, 5, 0, 8, 86, 0, 8, 22, 192, 8, 0, 83, 7, 51, 0, 8, 118, 0, 8, 54, 0, 9, 205, 81, 7, 15, 0, 8,
+ 102, 0, 8, 38, 0, 9, 173, 0, 8, 6, 0, 8, 134, 0, 8, 70, 0, 9, 237, 80, 7, 9, 0, 8, 94, 0, 8, 30, 0, 9, 157, 84, 7, 99, 0, 8, 126, 0, 8, 62, 0, 9,
+ 221, 82, 7, 27, 0, 8, 110, 0, 8, 46, 0, 9, 189, 0, 8, 14, 0, 8, 142, 0, 8, 78, 0, 9, 253, 96, 7, 256, 0, 8, 81, 0, 8, 17, 85, 8, 131, 82, 7, 31, 0,
+ 8, 113, 0, 8, 49, 0, 9, 195, 80, 7, 10, 0, 8, 97, 0, 8, 33, 0, 9, 163, 0, 8, 1, 0, 8, 129, 0, 8, 65, 0, 9, 227, 80, 7, 6, 0, 8, 89, 0, 8, 25, 0, 9,
+ 147, 83, 7, 59, 0, 8, 121, 0, 8, 57, 0, 9, 211, 81, 7, 17, 0, 8, 105, 0, 8, 41, 0, 9, 179, 0, 8, 9, 0, 8, 137, 0, 8, 73, 0, 9, 243, 80, 7, 4, 0, 8,
+ 85, 0, 8, 21, 80, 8, 258, 83, 7, 43, 0, 8, 117, 0, 8, 53, 0, 9, 203, 81, 7, 13, 0, 8, 101, 0, 8, 37, 0, 9, 171, 0, 8, 5, 0, 8, 133, 0, 8, 69, 0, 9,
+ 235, 80, 7, 8, 0, 8, 93, 0, 8, 29, 0, 9, 155, 84, 7, 83, 0, 8, 125, 0, 8, 61, 0, 9, 219, 82, 7, 23, 0, 8, 109, 0, 8, 45, 0, 9, 187, 0, 8, 13, 0, 8,
+ 141, 0, 8, 77, 0, 9, 251, 80, 7, 3, 0, 8, 83, 0, 8, 19, 85, 8, 195, 83, 7, 35, 0, 8, 115, 0, 8, 51, 0, 9, 199, 81, 7, 11, 0, 8, 99, 0, 8, 35, 0, 9,
+ 167, 0, 8, 3, 0, 8, 131, 0, 8, 67, 0, 9, 231, 80, 7, 7, 0, 8, 91, 0, 8, 27, 0, 9, 151, 84, 7, 67, 0, 8, 123, 0, 8, 59, 0, 9, 215, 82, 7, 19, 0, 8,
+ 107, 0, 8, 43, 0, 9, 183, 0, 8, 11, 0, 8, 139, 0, 8, 75, 0, 9, 247, 80, 7, 5, 0, 8, 87, 0, 8, 23, 192, 8, 0, 83, 7, 51, 0, 8, 119, 0, 8, 55, 0, 9,
+ 207, 81, 7, 15, 0, 8, 103, 0, 8, 39, 0, 9, 175, 0, 8, 7, 0, 8, 135, 0, 8, 71, 0, 9, 239, 80, 7, 9, 0, 8, 95, 0, 8, 31, 0, 9, 159, 84, 7, 99, 0, 8,
+ 127, 0, 8, 63, 0, 9, 223, 82, 7, 27, 0, 8, 111, 0, 8, 47, 0, 9, 191, 0, 8, 15, 0, 8, 143, 0, 8, 79, 0, 9, 255 ];
+ var fixed_td = [ 80, 5, 1, 87, 5, 257, 83, 5, 17, 91, 5, 4097, 81, 5, 5, 89, 5, 1025, 85, 5, 65, 93, 5, 16385, 80, 5, 3, 88, 5, 513, 84, 5, 33, 92, 5,
+ 8193, 82, 5, 9, 90, 5, 2049, 86, 5, 129, 192, 5, 24577, 80, 5, 2, 87, 5, 385, 83, 5, 25, 91, 5, 6145, 81, 5, 7, 89, 5, 1537, 85, 5, 97, 93, 5,
+ 24577, 80, 5, 4, 88, 5, 769, 84, 5, 49, 92, 5, 12289, 82, 5, 13, 90, 5, 3073, 86, 5, 193, 192, 5, 24577 ];
+
+ // Tables for deflate from PKZIP's appnote.txt.
+ var cplens = [ // Copy lengths for literal codes 257..285
+ 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 ];
+
+ // see note #13 above about 258
+ var cplext = [ // Extra bits for literal codes 257..285
+ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112 // 112==invalid
+ ];
+
+ var cpdist = [ // Copy offsets for distance codes 0..29
+ 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 ];
+
+ var cpdext = [ // Extra bits for distance codes
+ 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13 ];
+
+ // If BMAX needs to be larger than 16, then h and x[] should be uLong.
+ var BMAX = 15; // maximum bit length of any code
+
+ function InfTree() {
+ var that = this;
+
+ var hn; // hufts used in space
+ var v; // work area for huft_build
+ var c; // bit length count table
+ var r; // table entry for structure assignment
+ var u; // table stack
+ var x; // bit offsets, then code stack
+
+ function huft_build(b, // code lengths in bits (all assumed <=
+ // BMAX)
+ bindex, n, // number of codes (assumed <= 288)
+ s, // number of simple-valued codes (0..s-1)
+ d, // list of base values for non-simple codes
+ e, // list of extra bits for non-simple codes
+ t, // result: starting table
+ m, // maximum lookup bits, returns actual
+ hp,// space for trees
+ hn,// hufts used in space
+ v // working area: values in order of bit length
+ ) {
+ // Given a list of code lengths and a maximum table size, make a set of
+ // tables to decode that set of codes. Return Z_OK on success,
+ // Z_BUF_ERROR
+ // if the given code set is incomplete (the tables are still built in
+ // this
+ // case), Z_DATA_ERROR if the input is invalid (an over-subscribed set
+ // of
+ // lengths), or Z_MEM_ERROR if not enough memory.
+
+ var a; // counter for codes of length k
+ var f; // i repeats in table every f entries
+ var g; // maximum code length
+ var h; // table level
+ var i; // counter, current code
+ var j; // counter
+ var k; // number of bits in current code
+ var l; // bits per table (returned in m)
+ var mask; // (1 << w) - 1, to avoid cc -O bug on HP
+ var p; // pointer into c[], b[], or v[]
+ var q; // points to current table
+ var w; // bits before this table == (l * h)
+ var xp; // pointer into x
+ var y; // number of dummy codes added
+ var z; // number of entries in current table
+
+ // Generate counts for each bit length
+
+ p = 0;
+ i = n;
+ do {
+ c[b[bindex + p]]++;
+ p++;
+ i--; // assume all entries <= BMAX
+ } while (i !== 0);
+
+ if (c[0] == n) { // null input--all zero length codes
+ t[0] = -1;
+ m[0] = 0;
+ return Z_OK;
+ }
+
+ // Find minimum and maximum length, bound *m by those
+ l = m[0];
+ for (j = 1; j <= BMAX; j++)
+ if (c[j] !== 0)
+ break;
+ k = j; // minimum code length
+ if (l < j) {
+ l = j;
+ }
+ for (i = BMAX; i !== 0; i--) {
+ if (c[i] !== 0)
+ break;
+ }
+ g = i; // maximum code length
+ if (l > i) {
+ l = i;
+ }
+ m[0] = l;
+
+ // Adjust last length count to fill out codes, if needed
+ for (y = 1 << j; j < i; j++, y <<= 1) {
+ if ((y -= c[j]) < 0) {
+ return Z_DATA_ERROR;
+ }
+ }
+ if ((y -= c[i]) < 0) {
+ return Z_DATA_ERROR;
+ }
+ c[i] += y;
+
+ // Generate starting offsets into the value table for each length
+ x[1] = j = 0;
+ p = 1;
+ xp = 2;
+ while (--i !== 0) { // note that i == g from above
+ x[xp] = (j += c[p]);
+ xp++;
+ p++;
+ }
+
+ // Make a table of values in order of bit lengths
+ i = 0;
+ p = 0;
+ do {
+ if ((j = b[bindex + p]) !== 0) {
+ v[x[j]++] = i;
+ }
+ p++;
+ } while (++i < n);
+ n = x[g]; // set n to length of v
+
+ // Generate the Huffman codes and for each, make the table entries
+ x[0] = i = 0; // first Huffman code is zero
+ p = 0; // grab values in bit order
+ h = -1; // no tables yet--level -1
+ w = -l; // bits decoded == (l * h)
+ u[0] = 0; // just to keep compilers happy
+ q = 0; // ditto
+ z = 0; // ditto
+
+ // go through the bit lengths (k already is bits in shortest code)
+ for (; k <= g; k++) {
+ a = c[k];
+ while (a-- !== 0) {
+ // here i is the Huffman code of length k bits for value *p
+ // make tables up to required level
+ while (k > w + l) {
+ h++;
+ w += l; // previous table always l bits
+ // compute minimum size table less than or equal to l bits
+ z = g - w;
+ z = (z > l) ? l : z; // table size upper limit
+ if ((f = 1 << (j = k - w)) > a + 1) { // try a k-w bit table
+ // too few codes for
+ // k-w bit table
+ f -= a + 1; // deduct codes from patterns left
+ xp = k;
+ if (j < z) {
+ while (++j < z) { // try smaller tables up to z bits
+ if ((f <<= 1) <= c[++xp])
+ break; // enough codes to use up j bits
+ f -= c[xp]; // else deduct codes from patterns
+ }
+ }
+ }
+ z = 1 << j; // table entries for j-bit table
+
+ // allocate new table
+ if (hn[0] + z > MANY) { // (note: doesn't matter for fixed)
+ return Z_DATA_ERROR; // overflow of MANY
+ }
+ u[h] = q = /* hp+ */hn[0]; // DEBUG
+ hn[0] += z;
+
+ // connect to last table, if there is one
+ if (h !== 0) {
+ x[h] = i; // save pattern for backing up
+ r[0] = /* (byte) */j; // bits in this table
+ r[1] = /* (byte) */l; // bits to dump before this table
+ j = i >>> (w - l);
+ r[2] = /* (int) */(q - u[h - 1] - j); // offset to this table
+ hp.set(r, (u[h - 1] + j) * 3);
+ // to
+ // last
+ // table
+ } else {
+ t[0] = q; // first table is returned result
+ }
+ }
+
+ // set up table entry in r
+ r[1] = /* (byte) */(k - w);
+ if (p >= n) {
+ r[0] = 128 + 64; // out of values--invalid code
+ } else if (v[p] < s) {
+ r[0] = /* (byte) */(v[p] < 256 ? 0 : 32 + 64); // 256 is
+ // end-of-block
+ r[2] = v[p++]; // simple code is just the value
+ } else {
+ r[0] = /* (byte) */(e[v[p] - s] + 16 + 64); // non-simple--look
+ // up in lists
+ r[2] = d[v[p++] - s];
+ }
+
+ // fill code-like entries with r
+ f = 1 << (k - w);
+ for (j = i >>> w; j < z; j += f) {
+ hp.set(r, (q + j) * 3);
+ }
+
+ // backwards increment the k-bit code i
+ for (j = 1 << (k - 1); (i & j) !== 0; j >>>= 1) {
+ i ^= j;
+ }
+ i ^= j;
+
+ // backup over finished tables
+ mask = (1 << w) - 1; // needed on HP, cc -O bug
+ while ((i & mask) != x[h]) {
+ h--; // don't need to update q
+ w -= l;
+ mask = (1 << w) - 1;
+ }
+ }
+ }
+ // Return Z_BUF_ERROR if we were given an incomplete table
+ return y !== 0 && g != 1 ? Z_BUF_ERROR : Z_OK;
+ }
+
+ function initWorkArea(vsize) {
+ var i;
+ if (!hn) {
+ hn = []; // []; //new Array(1);
+ v = []; // new Array(vsize);
+ c = new Int32Array(BMAX + 1); // new Array(BMAX + 1);
+ r = []; // new Array(3);
+ u = new Int32Array(BMAX); // new Array(BMAX);
+ x = new Int32Array(BMAX + 1); // new Array(BMAX + 1);
+ }
+ if (v.length < vsize) {
+ v = []; // new Array(vsize);
+ }
+ for (i = 0; i < vsize; i++) {
+ v[i] = 0;
+ }
+ for (i = 0; i < BMAX + 1; i++) {
+ c[i] = 0;
+ }
+ for (i = 0; i < 3; i++) {
+ r[i] = 0;
+ }
+ // for(int i=0; i