From ea2aaf55d341cc4a46c26497cb5992769560f7e4 Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Thu, 9 May 2013 18:11:13 +0200
Subject: [PATCH 1/9] Lazy decompress data
This commit aims to be as lazy as possible :
When reading a file, we now don't decompress the content, we just keep
a reference to the original compressed file and an offset.
If the user accesses a file, we will decompress it and replace the
content (so we don't have to decompress it again).
When generating a zip, if a file has not been decompressed we check if
we can reuse the compressed content.
This unfortunately means that we won't be backward compatible : the
data attribute may not be calculated yet. Worse, the data now can be a
string, an array or a UInt8Array. The user must use the getters !
The interface for compression/decompression has also changed : we now
specify the input type for each operation.
This has been tested in IE 6 -> 10, firefox, chrome, opera.
If anyone has an apple product with safari, he's welcome to test :)
---
index.html | 44 ++-
jszip-deflate.js | 4 +-
jszip-inflate.js | 4 +-
jszip-load.js | 342 ++++++++++++-----
jszip.js | 731 +++++++++++++++++++++++++++----------
test/browser-test-utils.js | 6 +-
test/test.js | 254 ++++++++-----
7 files changed, 987 insertions(+), 398 deletions(-)
diff --git a/index.html b/index.html
index 42277580..71b04dd1 100644
--- a/index.html
+++ b/index.html
@@ -280,7 +280,6 @@ file(name)
The file if any, null
otherwise. The file has the following structure :
name
the absolute path of the file
- data
the data contained in the file
options
the options of the file. The available options are :
base64
, boolean, cf file(name, data [,options])
@@ -302,12 +301,11 @@ file(name)
zip.file("file.txt", "content");
zip.file("file.txt").name // "file.txt"
-zip.file("file.txt").data // "content"
+zip.file("file.txt").asText() // "content"
zip.file("file.txt").options.dir // false
// utf8 example
var zip = new JSZip(zipFromAjaxWithUTF8);
-zip.file("amount.txt").data // "â¬15"
zip.file("amount.txt").asText() // "€15"
zip.file("amount.txt").asArrayBuffer() // an ArrayBuffer containing €15
zip.file("amount.txt").asUint8Array() // an Uint8Array containing €15
@@ -339,7 +337,7 @@ file(regex)
folder.file(/^file/); // array of size 2, the relative paths start with file
// arrays contain objects in the form:
-// {name: "file2.txt", data: "content", dir: false}
+// {name: "file2.txt", dir: false, asText : function () {...}, ...}
file(name, data [,options])
@@ -464,9 +462,16 @@ generate(options)
HTML5 note : when using type = "uint8array", "arraybuffer" or "blob", be sure to check if the browser supports it (you can use JSZip.support
).
This method will throw an exception otherwise.
-content = zip.generate();
+content = zip.generate(); // base64
location.href="data:application/zip;base64,"+content;
+
+var blobLink = document.getElementById('blobLink');
+blobLink.download = "hello.zip";
+blobLink.href = window.URL.createObjectURL(
+ zip.generate({type:"blob"})
+);
+
content = zip.generate({type:"string"});
for (var c = 0; c < content.length; c++) {
@@ -514,7 +519,7 @@ filter(predicate)
predicate
(function) the predicate to use : function (relativePath, file) {...}
It takes 2 arguments : the relative path and the file.
relativePath
(String) The filename and its path, reliatively to the current folder.
- file
(Object) The file being tested. Like the result of file(name)
, the file has the form {name:"...", data:"...", options:{...}}
.
+ file
(Object) The file being tested. Like the result of file(name)
, the file has the form {name:"...", options:{...}, asText:function,...}
.
- Return true if the file should be included, false otherwise.
@@ -526,7 +531,7 @@ filter(predicate)
zip.file("readme.txt", "content");
zip.filter(function (relativePath, file){
// relativePath == "readme.txt"
- // file = {name:"dir/readme.txt",data:"content",options:{...}}
+ // file = {name:"dir/readme.txt",options:{...},asText:function}
return true/false;
});
@@ -586,6 +591,30 @@ 1.0.0 2013-02-14
First release after a long period without version.
+
+ Migrating Guide
+ From 1.0.x to ?
+
+
+ JSZipBase64
has been renamed to JSZip.base64
.
+ -
+ The
data
attribute doesn't exist anymore :
+ use the getters asText()
, asBinary()
, etc
+
+ -
+ The compression/decompression methods now give their input type with the
+
compressInputType
and uncompressInputType attributes.
+
+
+ Example for the data attribute :
+ // before
+zip.file("test.txt").data;
+zip.files["test.txt"].data;
+
+// after
+zip.file("test.txt").asText();
+zip.files["test.txt"].asText();
+
@@ -598,6 +627,7 @@
License
Version
1.0.1
+
See the migrating guide when updating the library !
Todo
diff --git a/jszip-deflate.js b/jszip-deflate.js
index 54e7e755..58ee4ef1 100644
--- a/jszip-deflate.js
+++ b/jszip-deflate.js
@@ -1685,10 +1685,12 @@ var zip_deflate = function(str, level) {
if(!JSZip.compressions["DEFLATE"]) {
JSZip.compressions["DEFLATE"] = {
magic : "\x08\x00",
- compress : zip_deflate
+ compress : zip_deflate,
+ compressInputType : "string"
}
} else {
JSZip.compressions["DEFLATE"].compress = zip_deflate;
+ JSZip.compressions["DEFLATE"].compressInputType = "string";
}
})();
diff --git a/jszip-inflate.js b/jszip-inflate.js
index f098a6ea..ee54c66e 100644
--- a/jszip-inflate.js
+++ b/jszip-inflate.js
@@ -768,10 +768,12 @@ function zip_inflate(str) {
if(!JSZip.compressions["DEFLATE"]) {
JSZip.compressions["DEFLATE"] = {
magic : "\x08\x00",
- uncompress : zip_inflate
+ uncompress : zip_inflate,
+ uncompressInputType : "string"
}
} else {
JSZip.compressions["DEFLATE"].uncompress = zip_inflate;
+ JSZip.compressions["DEFLATE"].uncompressInputType = "string";
}
})();
diff --git a/jszip-load.js b/jszip-load.js
index f841fe57..7173aeb0 100644
--- a/jszip-load.js
+++ b/jszip-load.js
@@ -7,8 +7,11 @@ JSZip - A Javascript class for generating and reading zip files
Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
**/
-/*global JSZip,JSZipBase64 */
-(function () {
+/*global JSZip */
+"use strict";
+(function (root) {
+
+ var JSZip = root.JSZip;
var MAX_VALUE_16BITS = 65535;
var MAX_VALUE_32BITS = -1; // well, "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFF" is parsed as -1
@@ -42,27 +45,20 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
return null;
};
- // class StreamReader {{{
+ // class DataReader {{{
/**
- * Read bytes from a stream.
- * Developer tip : when debugging, a watch on pretty(this.reader.stream.slice(this.reader.index))
+ * Read bytes from a source.
+ * Developer tip : when debugging, a watch on pretty(this.reader.data.slice(this.reader.index))
* is very useful :)
* @constructor
- * @param {String|ArrayBuffer|Uint8Array} stream the stream to read.
+ * @param {String|ArrayBuffer|Uint8Array} data the data to read.
*/
- function StreamReader(stream) {
- this.stream = "";
- if (JSZip.support.uint8array && stream instanceof Uint8Array) {
- this.stream = JSZip.utils.uint8Array2String(stream);
- } else if (JSZip.support.arraybuffer && stream instanceof ArrayBuffer) {
- var bufferView = new Uint8Array(stream);
- this.stream = JSZip.utils.uint8Array2String(bufferView);
- } else {
- this.stream = JSZip.utils.string2binary(stream);
- }
+ function DataReader(data) {
+ this.data = null; // type : see implementation
+ this.length = 0;
this.index = 0;
}
- StreamReader.prototype = {
+ DataReader.prototype = {
/**
* Check that the offset will not go too far.
* @param {string} offset the additional offset to check.
@@ -77,16 +73,16 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
* @throws {Error} an Error if the index is out of bounds.
*/
checkIndex : function (newIndex) {
- if (this.stream.length < newIndex || newIndex < 0) {
- throw new Error("End of stream reached (stream length = " +
- this.stream.length + ", asked index = " +
+ if (this.length < newIndex || newIndex < 0) {
+ throw new Error("End of data reached (data length = " +
+ this.length + ", asked index = " +
(newIndex) + "). Corrupted zip ?");
}
},
/**
* Change the index.
* @param {number} newIndex The new index.
- * @throws {Error} if the new index is out of the stream.
+ * @throws {Error} if the new index is out of the data.
*/
setIndex : function (newIndex) {
this.checkIndex(newIndex);
@@ -95,7 +91,7 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
/**
* Skip the next n bytes.
* @param {number} n the number of bytes to skip.
- * @throws {Error} if the new index is out of the stream.
+ * @throws {Error} if the new index is out of the data.
*/
skip : function (n) {
this.setIndex(this.index + n);
@@ -106,7 +102,7 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
* @return {number} a byte.
*/
byteAt : function(i) {
- return this.stream.charCodeAt(i);
+ // see implementations
},
/**
* Get the next number with a given byte size.
@@ -128,11 +124,23 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
* @return {string} the corresponding string.
*/
readString : function (size) {
- this.checkOffset(size);
- // this will work because the constructor applied the "& 0xff" mask.
- var result = this.stream.slice(this.index, this.index + size);
- this.index += size;
- return result;
+ return JSZip.utils.transformTo("string", this.readData(size));
+ },
+ /**
+ * Get raw data without conversion, bytes.
+ * @param {number} size the number of bytes to read.
+ * @return {Object} the raw data, implementation specific.
+ */
+ readData : function (size) {
+ // see implementations
+ },
+ /**
+ * Find the last occurence of a zip signature (4 bytes).
+ * @param {string} sig the signature to find.
+ * @return {number} the index of the last occurence, -1 if not found.
+ */
+ lastIndexOfSignature : function (sig) {
+ // see implementations
},
/**
* Get the next date.
@@ -149,14 +157,96 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
(dostime & 0x1f) << 1); // second
}
};
- // }}} end of StreamReader
+
+
+ /**
+ * Read bytes from a string.
+ * @constructor
+ * @param {String} data the data to read.
+ */
+ function StringReader(data, optimizedBinaryString) {
+ this.data = data;
+ if (!optimizedBinaryString) {
+ this.data = JSZip.utils.string2binary(this.data);
+ }
+ this.length = this.data.length;
+ this.index = 0;
+ }
+ StringReader.prototype = new DataReader();
+ /**
+ * @see DataReader.byteAt
+ */
+ StringReader.prototype.byteAt = function(i) {
+ return this.data.charCodeAt(i);
+ };
+ /**
+ * @see DataReader.lastIndexOfSignature
+ */
+ StringReader.prototype.lastIndexOfSignature = function (sig) {
+ return this.data.lastIndexOf(sig);
+ };
+ /**
+ * @see DataReader.readData
+ */
+ StringReader.prototype.readData = function (size) {
+ this.checkOffset(size);
+ // this will work because the constructor applied the "& 0xff" mask.
+ var result = this.data.slice(this.index, this.index + size);
+ this.index += size;
+ return result;
+ };
+
+
+ /**
+ * Read bytes from an Uin8Array.
+ * @constructor
+ * @param {Uint8Array} data the data to read.
+ */
+ function Uint8ArrayReader(data) {
+ this.data = data;
+ this.length = this.data.length;
+ this.index = 0;
+ }
+ Uint8ArrayReader.prototype = new DataReader();
+ /**
+ * @see DataReader.byteAt
+ */
+ Uint8ArrayReader.prototype.byteAt = function(i) {
+ return this.data[i];
+ };
+ /**
+ * @see DataReader.lastIndexOfSignature
+ */
+ Uint8ArrayReader.prototype.lastIndexOfSignature = function (sig) {
+ var sig0 = sig.charCodeAt(0),
+ sig1 = sig.charCodeAt(1),
+ sig2 = sig.charCodeAt(2),
+ sig3 = sig.charCodeAt(3);
+ for(var i = this.length - 4;i >= 0;--i) {
+ if (this.data[i] === sig0 && this.data[i+1] === sig1 && this.data[i+2] === sig2 && this.data[i+3] === sig3) {
+ return i;
+ }
+ }
+
+ return -1;
+ };
+ /**
+ * @see DataReader.readData
+ */
+ Uint8ArrayReader.prototype.readData = function (size) {
+ this.checkOffset(size);
+ var result = this.data.subarray(this.index, this.index + size);
+ this.index += size;
+ return result;
+ };
+ // }}} end of DataReader
// class ZipEntry {{{
/**
* An entry in the zip file.
* @constructor
* @param {Object} options Options of the current file.
- * @param {Object} loadOptions Options for loading the stream.
+ * @param {Object} loadOptions Options for loading the data.
*/
function ZipEntry(options, loadOptions) {
this.options = options;
@@ -179,9 +269,48 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
// bit 11 is set
return (this.bitFlag & 0x0800) === 0x0800;
},
+ /**
+ * Prepare the function used to generate the compressed content from this ZipFile.
+ * @param {DataReader} reader the reader to use.
+ * @param {number} from the offset from where we should read the data.
+ * @param {number} length the length of the data to read.
+ * @return {Function} the callback to get the compressed content (the type depends of the DataReader class).
+ */
+ prepareCompressedContent : function (reader, from, length) {
+ return function () {
+ var previousIndex = reader.index;
+ reader.setIndex(from);
+ var compressedFileData = reader.readData(length);
+ reader.setIndex(previousIndex);
+
+ return compressedFileData;
+ }
+ },
+ /**
+ * Prepare the function used to generate the uncompressed content from this ZipFile.
+ * @param {DataReader} reader the reader to use.
+ * @param {number} from the offset from where we should read the data.
+ * @param {number} length the length of the data to read.
+ * @param {JSZip.compression} compression the compression used on this file.
+ * @param {number} uncompressedSize the uncompressed size to expect.
+ * @return {Function} the callback to get the uncompressed content (the type depends of the DataReader class).
+ */
+ prepareContent : function (reader, from, length, compression, uncompressedSize) {
+ return function () {
+
+ var compressedFileData = JSZip.utils.transformTo(compression.uncompressInputType, this.getCompressedContent());
+ var uncompressedFileData = compression.uncompress(compressedFileData);
+
+ if (uncompressedFileData.length !== uncompressedSize) {
+ throw new Error("Bug : uncompressed data size mismatch");
+ }
+
+ return uncompressedFileData;
+ }
+ },
/**
* Read the local part of a zip file and add the info in this object.
- * @param {StreamReader} reader the reader to use.
+ * @param {DataReader} reader the reader to use.
*/
readLocalPart : function(reader) {
var compression, localExtraFieldsLength;
@@ -212,27 +341,32 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
throw new Error("Bug or corrupted zip : didn't get enough informations from the central directory " +
"(compressedSize == -1 || uncompressedSize == -1)");
}
- this.compressedFileData = reader.readString(this.compressedSize);
compression = findCompression(this.compressionMethod);
if (compression === null) { // no compression found
throw new Error("Corrupted zip : compression " + pretty(this.compressionMethod) +
" unknown (inner file : " + this.fileName + ")");
}
- this.uncompressedFileData = compression.uncompress(this.compressedFileData);
-
- if (this.uncompressedFileData.length !== this.uncompressedSize) {
- throw new Error("Bug : uncompressed data size mismatch");
- }
-
- if (this.loadOptions.checkCRC32 && JSZip.prototype.crc32(this.uncompressedFileData) !== this.crc32) {
- throw new Error("Corrupted zip : CRC32 mismatch");
+ this.decompressed = new JSZip.CompressedObject();
+ this.decompressed.compressedSize = this.compressedSize;
+ this.decompressed.uncompressedSize = this.uncompressedSize;
+ this.decompressed.crc32 = this.crc32;
+ this.decompressed.compressionMethod = this.compressionMethod;
+ this.decompressed.getCompressedContent = this.prepareCompressedContent(reader, reader.index, this.compressedSize, compression);
+ this.decompressed.getContent = this.prepareContent(reader, reader.index, this.compressedSize, compression, this.uncompressedSize);
+
+ // we need to compute the crc32...
+ if (this.loadOptions.checkCRC32) {
+ this.decompressed = JSZip.utils.transformTo("string", this.decompressed.getContent());
+ if (JSZip.prototype.crc32(this.decompressed) !== this.crc32) {
+ throw new Error("Corrupted zip : CRC32 mismatch");
+ }
}
},
/**
* Read the central part of a zip file and add the info in this object.
- * @param {StreamReader} reader the reader to use.
+ * @param {DataReader} reader the reader to use.
*/
readCentralPart : function(reader) {
this.versionMadeBy = reader.readString(2);
@@ -265,7 +399,7 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
},
/**
* Parse the ZIP64 extra field and merge the info in the current ZipEntry.
- * @param {StreamReader} reader the reader to use.
+ * @param {DataReader} reader the reader to use.
*/
parseZIP64ExtraField : function(reader) {
@@ -274,7 +408,7 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
}
// should be something, preparing the extra reader
- var extraReader = new StreamReader(this.extraFields[0x0001].value);
+ var extraReader = new StringReader(this.extraFields[0x0001].value);
// I really hope that these 64bits integer can fit in 32 bits integer, because js
// won't let us have more.
@@ -293,7 +427,7 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
},
/**
* Read the central part of a zip file and add the info in this object.
- * @param {StreamReader} reader the reader to use.
+ * @param {DataReader} reader the reader to use.
*/
readExtraFields : function(reader) {
var start = reader.index,
@@ -331,8 +465,8 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
/**
* All the entries in the zip file.
* @constructor
- * @param {String|ArrayBuffer|Uint8Array} data the binary stream to load.
- * @param {Object} loadOptions Options for loading the stream.
+ * @param {String|ArrayBuffer|Uint8Array} data the binary data to load.
+ * @param {Object} loadOptions Options for loading the data.
*/
function ZipEntries(data, loadOptions) {
this.files = [];
@@ -445,65 +579,71 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
* Read the end of central directory.
*/
readEndOfCentral : function() {
- var offset = this.reader.stream.lastIndexOf(JSZip.signature.CENTRAL_DIRECTORY_END);
+ var offset = this.reader.lastIndexOfSignature(JSZip.signature.CENTRAL_DIRECTORY_END);
+ if (offset === -1) {
+ throw new Error("Corrupted zip : can't find end of central directory");
+ }
+ this.reader.setIndex(offset);
+ this.checkSignature(JSZip.signature.CENTRAL_DIRECTORY_END);
+ this.readBlockEndOfCentral();
+
+
+ /* extract from the zip spec :
+ 4) If one of the fields in the end of central directory
+ record is too small to hold required data, the field
+ should be set to -1 (0xFFFF or 0xFFFFFFFF) and the
+ ZIP64 format record should be created.
+ 5) The end of central directory record and the
+ Zip64 end of central directory locator record must
+ reside on the same disk when splitting or spanning
+ an archive.
+ */
+ if ( this.diskNumber === MAX_VALUE_16BITS
+ || this.diskWithCentralDirStart === MAX_VALUE_16BITS
+ || this.centralDirRecordsOnThisDisk === MAX_VALUE_16BITS
+ || this.centralDirRecords === MAX_VALUE_16BITS
+ || this.centralDirSize === MAX_VALUE_32BITS
+ || this.centralDirOffset === MAX_VALUE_32BITS
+ ) {
+ this.zip64 = true;
+
+ /*
+ Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from
+ the zip file can fit into a 32bits integer. This cannot be solved : Javascript represents
+ all numbers as 64-bit double precision IEEE 754 floating point numbers.
+ So, we have 53bits for integers and bitwise operations treat everything as 32bits.
+ see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators
+ and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5
+ */
+
+ // should look for a zip64 EOCD locator
+ offset = this.reader.lastIndexOfSignature(JSZip.signature.ZIP64_CENTRAL_DIRECTORY_LOCATOR);
if (offset === -1) {
- throw new Error("Corrupted zip : can't find end of central directory");
+ throw new Error("Corrupted zip : can't find the ZIP64 end of central directory locator");
}
this.reader.setIndex(offset);
- this.checkSignature(JSZip.signature.CENTRAL_DIRECTORY_END);
- this.readBlockEndOfCentral();
-
-
- /* extract from the zip spec :
- 4) If one of the fields in the end of central directory
- record is too small to hold required data, the field
- should be set to -1 (0xFFFF or 0xFFFFFFFF) and the
- ZIP64 format record should be created.
- 5) The end of central directory record and the
- Zip64 end of central directory locator record must
- reside on the same disk when splitting or spanning
- an archive.
- */
- if ( this.diskNumber === MAX_VALUE_16BITS
- || this.diskWithCentralDirStart === MAX_VALUE_16BITS
- || this.centralDirRecordsOnThisDisk === MAX_VALUE_16BITS
- || this.centralDirRecords === MAX_VALUE_16BITS
- || this.centralDirSize === MAX_VALUE_32BITS
- || this.centralDirOffset === MAX_VALUE_32BITS
- ) {
- this.zip64 = true;
-
- /*
- Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from
- the zip file can fit into a 32bits integer. This cannot be solved : Javascript represents
- all numbers as 64-bit double precision IEEE 754 floating point numbers.
- So, we have 53bits for integers and bitwise operations treat everything as 32bits.
- see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators
- and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5
- */
-
- // should look for a zip64 EOCD locator
- offset = this.reader.stream.lastIndexOf(JSZip.signature.ZIP64_CENTRAL_DIRECTORY_LOCATOR);
- if (offset === -1) {
- throw new Error("Corrupted zip : can't find the ZIP64 end of central directory locator");
- }
- this.reader.setIndex(offset);
- this.checkSignature(JSZip.signature.ZIP64_CENTRAL_DIRECTORY_LOCATOR);
- this.readBlockZip64EndOfCentralLocator();
-
- // now the zip64 EOCD record
- this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir);
- this.checkSignature(JSZip.signature.ZIP64_CENTRAL_DIRECTORY_END);
- this.readBlockZip64EndOfCentral();
- }
+ this.checkSignature(JSZip.signature.ZIP64_CENTRAL_DIRECTORY_LOCATOR);
+ this.readBlockZip64EndOfCentralLocator();
+
+ // now the zip64 EOCD record
+ this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir);
+ this.checkSignature(JSZip.signature.ZIP64_CENTRAL_DIRECTORY_END);
+ this.readBlockZip64EndOfCentral();
+ }
+ },
+ prepareReader : function (data) {
+ if (JSZip.utils.getTypeOf(data) === "string") {
+ this.reader = new StringReader(data, this.loadOptions.optimizedBinaryString);
+ } else {
+ this.reader = new Uint8ArrayReader(JSZip.utils.transformTo("uint8array", data));
+ }
},
/**
* Read a zip file and create ZipEntries.
* @param {String|ArrayBuffer|Uint8Array} data the binary string representing a zip file.
*/
load : function(data) {
- this.reader = new StreamReader(data);
-
+ this.prepareReader(data);
this.readEndOfCentral();
this.readCentralDir();
this.readLocalFiles();
@@ -515,21 +655,21 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
* Implementation of the load method of JSZip.
* It uses the above classes to decode a zip file, and load every files.
* @param {String|ArrayBuffer|Uint8Array} data the data to load.
- * @param {Object} options Options for loading the stream.
- * options.base64 : is the stream in base64 ? default : false
+ * @param {Object} options Options for loading the data.
+ * options.base64 : is the data in base64 ? default : false
*/
JSZip.prototype.load = function(data, options) {
var files, zipEntries, i, input;
options = options || {};
if(options.base64) {
- data = JSZipBase64.decode(data);
+ data = JSZip.base64.decode(data);
}
zipEntries = new ZipEntries(data, options);
files = zipEntries.files;
for (i = 0; i < files.length; i++) {
input = files[i];
- this.file(input.fileName, input.uncompressedFileData, {
+ this.file(input.fileName, input.decompressed, {
binary:true,
optimizedBinaryString:true,
date:input.date,
@@ -540,6 +680,6 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
return this;
};
-}());
+}(this));
// enforcing Stuk's coding style
// vim: set shiftwidth=3 softtabstop=3 foldmethod=marker:
diff --git a/jszip.js b/jszip.js
index 919f9285..05478e2f 100644
--- a/jszip.js
+++ b/jszip.js
@@ -16,6 +16,7 @@ Usage:
base64zip = zip.generate();
**/
+"use strict";
/**
* Representation a of zip file in js
@@ -59,6 +60,33 @@ JSZip.defaults = {
JSZip.prototype = (function () {
+
+ /**
+ * Transform this._data into a string.
+ * @param {function} filter a function String -> String, applied if not null on the result.
+ * @return {String} the string representing this._data.
+ */
+ var dataToString = function (filter) {
+ var result = this._data;
+ if (result === null || typeof result === "undefined") {
+ return "";
+ }
+ if (result instanceof JSZip.CompressedObject) {
+ result = JSZip.utils.transformTo("string", result.getContent());
+ this._data = result;
+ this.options.binary = true;
+ this.options.base64 = false;
+ } else {
+ result = JSZip.utils.transformTo("string", result);
+ }
+ if (this.options.base64) {
+ result = JSZip.base64.decode(result);
+ }
+ if (filter) {
+ result = filter(result);
+ }
+ return result;
+ };
/**
* A simple object representing a file in the zip file.
* @constructor
@@ -68,7 +96,7 @@ JSZip.prototype = (function () {
*/
var ZipObject = function (name, data, options) {
this.name = name;
- this.data = data;
+ this._data = data;
this.options = options;
};
@@ -78,48 +106,44 @@ JSZip.prototype = (function () {
* @return {string} the UTF8 string.
*/
asText : function () {
- var result = this.data;
- if (result === null || typeof result === "undefined") {
- return "";
- }
- if (this.options.base64) {
- result = JSZipBase64.decode(result);
- }
- if (this.options.binary) {
- result = JSZip.prototype.utf8decode(result);
- }
- return result;
+ return dataToString.call(this, this.options.binary ? JSZip.prototype.utf8decode : null);
},
/**
* Returns the binary content.
* @return {string} the content as binary.
*/
asBinary : function () {
- var result = this.data;
- if (result === null || typeof result === "undefined") {
- return "";
- }
- if (this.options.base64) {
- result = JSZipBase64.decode(result);
- }
- if (!this.options.binary) {
- result = JSZip.prototype.utf8encode(result);
- }
- return result;
+ return dataToString.call(this, !this.options.binary ? JSZip.prototype.utf8encode : null);
},
/**
* Returns the content as an Uint8Array.
* @return {Uint8Array} the content as an Uint8Array.
*/
asUint8Array : function () {
- return JSZip.utils.string2Uint8Array(this.asBinary());
+ var result = this._data;
+ if (result instanceof JSZip.CompressedObject) {
+ result = JSZip.utils.transformTo("uint8array", result.getContent());
+ // when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.
+ // if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).
+ this._data = new Uint8Array(result.length);
+ // with an empty Uint8Array, Opera fails with a "Offset larger than array size"
+ if (result.length !== 0) {
+ this._data.set(result, 0);
+ }
+ // new result !
+ var result = this._data;
+ }
+ if (JSZip.utils.getTypeOf(this._data) === "string") {
+ result = this.asBinary();
+ }
+ return JSZip.utils.transformTo("uint8array", result);
},
/**
* Returns the content as an ArrayBuffer.
* @return {ArrayBuffer} the content as an ArrayBufer.
*/
asArrayBuffer : function () {
- return JSZip.utils.string2Uint8Array(this.asBinary()).buffer;
+ return this.asUint8Array().buffer;
}
};
@@ -176,17 +200,17 @@ JSZip.prototype = (function () {
return o;
};
- /**
- * Add a file in the current folder.
- * @private
- * @param {string} name the name of the file
- * @param {String|ArrayBuffer|Uint8Array} data the data of the file
- * @param {Object} o the options of the file
- * @return {Object} the new file.
- */
+ /**
+ * Add a file in the current folder.
+ * @private
+ * @param {string} name the name of the file
+ * @param {String|ArrayBuffer|Uint8Array} data the data of the file
+ * @param {Object} o the options of the file
+ * @return {Object} the new file.
+ */
var fileAdd = function (name, data, o) {
// be sure sub folders exist
- var parent = parentFolder(name);
+ var parent = parentFolder(name), dataType = JSZip.utils.getTypeOf(data);
if (parent) {
folderAdd.call(this, parent);
}
@@ -197,24 +221,23 @@ JSZip.prototype = (function () {
o.base64 = false;
o.binary = false;
data = null;
- } else if (JSZip.support.uint8array && data instanceof Uint8Array) {
- o.base64 = false;
- o.binary = true;
- data = JSZip.utils.uint8Array2String(data);
- } else if (JSZip.support.arraybuffer && data instanceof ArrayBuffer) {
+ } else if (dataType === "string") {
+ if (o.binary && !o.base64) {
+ // optimizedBinaryString == true means that the file has already been filtered with a 0xFF mask
+ if (o.optimizedBinaryString !== true) {
+ // this is a string, not in a base64 format.
+ // Be sure that this is a correct "binary string"
+ data = JSZip.utils.string2binary(data);
+ }
+ }
+ } else { // arraybuffer, uint8array, ...
o.base64 = false;
o.binary = true;
- var bufferView = new Uint8Array(data);
- data = JSZip.utils.uint8Array2String(bufferView);
- } else if (o.binary && !o.base64) {
- // optimizedBinaryString == true means that the file has already been filtered with a 0xFF mask
- if (o.optimizedBinaryString !== true) {
- // this is a string, not in a base64 format.
- // Be sure that this is a correct "binary string"
- data = JSZip.utils.string2binary(data);
+
+ // special case : it's way easier to work with Uint8Array than with ArrayBuffer
+ if (dataType === "arraybuffer") {
+ data = new Uint8Array(data);
}
- // we remove this option since it's only relevant here
- delete o.optimizedBinaryString;
}
return this.files[name] = new ZipObject(name, data, o);
@@ -249,29 +272,66 @@ JSZip.prototype = (function () {
// Does this folder already exist?
if (!this.files[name]) {
- // be sure sub folders exist
- var parent = parentFolder(name);
- if (parent) {
- folderAdd.call(this, parent);
- }
-
fileAdd.call(this, name, null, {dir:true});
}
return this.files[name];
};
/**
- * Generate the data found in the local header of a zip file.
- * Do not create it now, as some parts are re-used later.
- * @private
- * @param {Object} file the file to use.
- * @param {string} utfEncodedFileName the file name, utf8 encoded.
- * @param {string} compressionType the compression to use.
- * @return {Object} an object containing header and compressedData.
+ * Generate a JSZip.CompressedObject for a given zipOject.
+ * @param {ZipObject} file the object to read.
+ * @param {JSZip.compression} compression the compression to use.
+ * @return {JSZip.CompressedObject} the compressed result.
+ */
+ var generateCompressedObjectFrom = function (file, compression) {
+ var result = new JSZip.CompressedObject(), content;
+
+ // the data has not been decompressed, we might reuse things !
+ if (file._data instanceof JSZip.CompressedObject) {
+ result.uncompressedSize = file._data.uncompressedSize;
+ result.crc32 = file._data.crc32;
+
+ if (result.uncompressedSize === 0 || file.options.dir) {
+ compression = JSZip.compressions['STORE'];
+ result.compressedContent = "";
+ result.crc32 = 0;
+ } else if (file._data.compressionMethod === compression.magic) {
+ result.compressedContent = file._data.getCompressedContent();
+ } else {
+ content = file._data.getContent()
+ // need to decompress / recompress
+ result.compressedContent = compression.compress(JSZip.utils.transformTo(compression.compressInputType, content));
+ }
+ } else {
+ // have uncompressed data
+ content = JSZip.utils.getTypeOf(file._data) === "string" ? file.asBinary() : file._data;
+ if (!content || content.length === 0 || file.options.dir) {
+ compression = JSZip.compressions['STORE'];
+ content = "";
+ }
+ result.uncompressedSize = content.length;
+ result.crc32 = this.crc32(content);
+ result.compressedContent = compression.compress(JSZip.utils.transformTo(compression.compressInputType, content));
+ }
+
+ result.compressedSize = result.compressedContent.length;
+ result.compressionMethod = compression.magic;
+
+ return result;
+ };
+
+ /**
+ * Generate the various parts used in the construction of the final zip file.
+ * @param {string} name the file name.
+ * @param {ZipObject} file the file content.
+ * @param {JSZip.CompressedObject} compressedObject the compressed object.
+ * @param {number} offset the current offset from the start of the zip file.
+ * @return {object} the zip parts.
*/
- var prepareLocalHeaderData = function(file, utfEncodedFileName, compressionType) {
- var useUTF8 = utfEncodedFileName !== file.name,
- data = file.asBinary(),
+ var generateZipParts = function(name, file, compressedObject, offset) {
+ var data = compressedObject.compressedContent,
+ utfEncodedFileName = this.utf8encode(file.name),
+ useUTF8 = utfEncodedFileName !== file.name,
o = file.options,
dosTime,
dosDate;
@@ -293,15 +353,6 @@ JSZip.prototype = (function () {
dosDate = dosDate << 5;
dosDate = dosDate | o.date.getDate();
- var hasData = data !== null && data.length !== 0;
-
- compressionType = o.compression || compressionType;
- if (!JSZip.compressions[compressionType]) {
- throw compressionType + " is not a valid compression method !";
- }
-
- var compression = JSZip.compressions[compressionType];
- var compressedData = hasData ? compression.compress(data) : '';
var header = "";
@@ -311,28 +362,105 @@ JSZip.prototype = (function () {
// set bit 11 if utf8
header += useUTF8 ? "\x00\x08" : "\x00\x00";
// compression method
- header += hasData ? compression.magic : JSZip.compressions['STORE'].magic;
+ header += compressedObject.compressionMethod;
// last mod file time
header += decToHex(dosTime, 2);
// last mod file date
header += decToHex(dosDate, 2);
// crc-32
- header += hasData ? decToHex(this.crc32(data), 4) : '\x00\x00\x00\x00';
+ header += decToHex(compressedObject.crc32, 4);
// compressed size
- header += hasData ? decToHex(compressedData.length, 4) : '\x00\x00\x00\x00';
+ header += decToHex(compressedObject.compressedSize, 4);
// uncompressed size
- header += hasData ? decToHex(data.length, 4) : '\x00\x00\x00\x00';
+ header += decToHex(compressedObject.uncompressedSize, 4);
// file name length
header += decToHex(utfEncodedFileName.length, 2);
// extra field length
header += "\x00\x00";
+
+ var fileRecord = JSZip.signature.LOCAL_FILE_HEADER + header + utfEncodedFileName;
+
+ var dirRecord = JSZip.signature.CENTRAL_FILE_HEADER +
+ // version made by (00: DOS)
+ "\x14\x00" +
+ // file header (common to file and central directory)
+ header +
+ // file comment length
+ "\x00\x00" +
+ // disk number start
+ "\x00\x00" +
+ // internal file attributes TODO
+ "\x00\x00" +
+ // external file attributes
+ (file.options.dir===true?"\x10\x00\x00\x00":"\x00\x00\x00\x00")+
+ // relative offset of local header
+ decToHex(offset, 4) +
+ // file name
+ utfEncodedFileName;
+
+
return {
- header:header,
- compressedData:compressedData
+ fileRecord : fileRecord,
+ dirRecord : dirRecord,
+ compressedObject : compressedObject
};
};
+ /**
+ * An object to write any content to a string.
+ * @constructor
+ */
+ var StringWriter = function () {
+ this.data = [];
+ };
+ StringWriter.prototype = {
+ /**
+ * Append any content to the current string.
+ * @param {Object} input the content to add.
+ */
+ append : function (input) {
+ input = JSZip.utils.transformTo("string", input);
+ this.data.push(input);
+ },
+ /**
+ * Finalize the construction an return the result.
+ * @return {string} the generated string.
+ */
+ finalize : function () {
+ return this.data.join("");
+ }
+ };
+ /**
+ * An object to write any content to an Uint8Array.
+ * @constructor
+ * @param {number} length The length of the array.
+ */
+ var Uint8ArrayWriter = function (length) {
+ this.data = new Uint8Array(length);
+ this.index = 0;
+ };
+ Uint8ArrayWriter.prototype = {
+ /**
+ * Append any content to the current array.
+ * @param {Object} input the content to add.
+ */
+ append : function (input) {
+ if (input.length !== 0) {
+ // with an empty Uint8Array, Opera fails with a "Offset larger than array size"
+ input = JSZip.utils.transformTo("uint8array", input);
+ this.data.set(input, this.index);
+ this.index += input.length;
+ }
+ },
+ /**
+ * Finalize the construction an return the result.
+ * @return {Uint8Array} the generated array.
+ */
+ finalize : function () {
+ return this.data;
+ }
+ };
// return the actual prototype of JSZip
return {
@@ -361,7 +489,7 @@ JSZip.prototype = (function () {
if ( !this.files.hasOwnProperty(filename) ) { continue; }
file = this.files[filename];
// return a new object, don't let the user mess with our internal objects :)
- fileClone = new ZipObject(file.name, file.data, extend(file.options));
+ fileClone = new ZipObject(file.name, file._data, extend(file.options));
relativePath = filename.slice(this.root.length, filename.length);
if (filename.slice(0, this.root.length) === this.root && // the file is in the current root
search(relativePath, fileClone)) { // and the file matches the function
@@ -473,53 +601,30 @@ JSZip.prototype = (function () {
compression : "STORE",
type : "base64"
});
- var compression = options.compression.toUpperCase();
- if (!JSZip.compressions[compression]) {
- throw compression + " is not a valid compression method !";
- }
+ JSZip.utils.checkSupport(options.type);
+
+ var zipData = [], localDirLength = 0, centralDirLength = 0, writer, i;
- // The central directory, and files data
- var directory = [], files = [], fileOffset = 0;
+ // first, generate all the zip parts.
for (var name in this.files) {
if ( !this.files.hasOwnProperty(name) ) { continue; }
-
var file = this.files[name];
- var utfEncodedFileName = this.utf8encode(file.name);
-
- var fileRecord = "",
- dirRecord = "",
- data = prepareLocalHeaderData.call(this, file, utfEncodedFileName, compression);
- fileRecord = JSZip.signature.LOCAL_FILE_HEADER + data.header + utfEncodedFileName + data.compressedData;
-
- dirRecord = JSZip.signature.CENTRAL_FILE_HEADER +
- // version made by (00: DOS)
- "\x14\x00" +
- // file header (common to file and central directory)
- data.header +
- // file comment length
- "\x00\x00" +
- // disk number start
- "\x00\x00" +
- // internal file attributes TODO
- "\x00\x00" +
- // external file attributes
- (this.files[name].options.dir===true?"\x10\x00\x00\x00":"\x00\x00\x00\x00")+
- // relative offset of local header
- decToHex(fileOffset, 4) +
- // file name
- utfEncodedFileName;
-
- fileOffset += fileRecord.length;
-
- files.push(fileRecord);
- directory.push(dirRecord);
- }
+ var compressionName = file.compression || options.compression.toUpperCase();
+ var compression = JSZip.compressions[compressionName];
+ if (!compression) {
+ throw new Error(compressionName + " is not a valid compression method !");
+ }
+
+ var compressedObject = generateCompressedObjectFrom.call(this, file, compression);
- var fileData = files.join("");
- var dirData = directory.join("");
+ var zipPart = generateZipParts.call(this, name, file, compressedObject, localDirLength);
+ localDirLength += zipPart.fileRecord.length + compressedObject.compressedSize;
+ centralDirLength += zipPart.dirRecord.length;
+ zipData.push(zipPart);
+ }
var dirEnd = "";
@@ -530,28 +635,56 @@ JSZip.prototype = (function () {
// number of the disk with the start of the central directory
"\x00\x00" +
// total number of entries in the central directory on this disk
- decToHex(files.length, 2) +
+ decToHex(zipData.length, 2) +
// total number of entries in the central directory
- decToHex(files.length, 2) +
+ decToHex(zipData.length, 2) +
// size of the central directory 4 bytes
- decToHex(dirData.length, 4) +
+ decToHex(centralDirLength, 4) +
// offset of start of central directory with respect to the starting disk number
- decToHex(fileData.length, 4) +
+ decToHex(localDirLength, 4) +
// .ZIP file comment length
"\x00\x00";
- var zip = fileData + dirData + dirEnd;
+
+ // we have all the parts (and the total length)
+ // time to create a writer !
+ switch(options.type.toLowerCase()) {
+ case "uint8array" :
+ case "arraybuffer" :
+ case "blob" :
+ writer = new Uint8ArrayWriter(localDirLength + centralDirLength + dirEnd.length);
+ break;
+ case "base64" :
+ default : // case "string" :
+ writer = new StringWriter(localDirLength + centralDirLength + dirEnd.length);
+ break;
+ }
+
+ for (i = 0; i < zipData.length; i++) {
+ writer.append(zipData[i].fileRecord);
+ writer.append(zipData[i].compressedObject.compressedContent);
+ }
+ for (i = 0; i < zipData.length; i++) {
+ writer.append(zipData[i].dirRecord);
+ }
+
+ writer.append(dirEnd);
+
+ var zip = writer.finalize();
+
switch(options.type.toLowerCase()) {
+ // case "zip is an Uint8Array"
case "uint8array" :
- return JSZip.utils.string2Uint8Array(zip);
case "arraybuffer" :
- return JSZip.utils.string2Uint8Array(zip).buffer;
+ return JSZip.utils.transformTo(options.type.toLowerCase(), zip);
case "blob" :
- return JSZip.utils.string2Blob(zip);
+ return JSZip.utils.arrayBuffer2Blob(zip);
+
+ // case "zip is a string"
case "base64" :
- return (options.base64) ? JSZipBase64.encode(zip) : zip;
+ return (options.base64) ? JSZip.base64.encode(zip) : zip;
default : // case "string" :
return zip;
}
@@ -563,12 +696,13 @@ JSZip.prototype = (function () {
* http://www.webtoolkit.info/
*
*/
- crc32 : function(str, crc) {
-
- if (str === "" || typeof str === "undefined") {
+ crc32 : function crc32(input, crc) {
+ if (typeof input === "undefined" || !input.length) {
return 0;
}
+ var isArray = JSZip.utils.getTypeOf(input) !== "string";
+
var table = [
0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA,
0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
@@ -639,10 +773,12 @@ JSZip.prototype = (function () {
if (typeof(crc) == "undefined") { crc = 0; }
var x = 0;
var y = 0;
+ var byte = 0;
crc = crc ^ (-1);
- for( var i = 0, iTop = str.length; i < iTop; i++ ) {
- y = ( crc ^ str.charCodeAt( i ) ) & 0xFF;
+ for( var i = 0, iTop = input.length; i < iTop; i++ ) {
+ byte = isArray ? input[i] : input.charCodeAt(i);
+ y = ( crc ^ byte ) & 0xFF;
x = table[y];
crc = ( crc >>> 8 ) ^ x;
}
@@ -728,6 +864,8 @@ JSZip.prototype = (function () {
* magic // the 2 bytes indentifying the compression method
* compress // function, take the uncompressed content and return it compressed.
* uncompress // function, take the compressed content and return it uncompressed.
+ * compressInputType // string, the type accepted by the compress method. null to accept everything.
+ * uncompressInputType // string, the type accepted by the uncompress method. null to accept everything.
* }
*
* STORE is the default compression method, so it's included in this file.
@@ -741,7 +879,9 @@ JSZip.compressions = {
},
uncompress : function (content) {
return content; // no compression
- }
+ },
+ compressInputType : null,
+ uncompressInputType : null
}
};
@@ -787,86 +927,291 @@ JSZip.support = {
})()
};
-JSZip.utils = {
+(function () {
+ JSZip.utils = {
+ /**
+ * Convert a string to a "binary string" : a string containing only char codes between 0 and 255.
+ * @param {string} str the string to transform.
+ * @return {String} the binary string.
+ */
+ string2binary : function (str) {
+ var result = "";
+ for (var i = 0; i < str.length; i++) {
+ result += String.fromCharCode(str.charCodeAt(i) & 0xff);
+ }
+ return result;
+ },
+ /**
+ * Create a Uint8Array from the string.
+ * @param {string} str the string to transform.
+ * @return {Uint8Array} the typed array.
+ * @throws {Error} an Error if the browser doesn't support the requested feature.
+ * @deprecated : use JSZip.utils.transformTo instead.
+ */
+ string2Uint8Array : function (str) {
+ return JSZip.utils.transformTo("uint8array", str);
+ },
+
+ /**
+ * Create a string from the Uint8Array.
+ * @param {Uint8Array} array the array to transform.
+ * @return {string} the string.
+ * @throws {Error} an Error if the browser doesn't support the requested feature.
+ * @deprecated : use JSZip.utils.transformTo instead.
+ */
+ uint8Array2String : function (array) {
+ return JSZip.utils.transformTo("string", array);
+ },
+ /**
+ * Create a blob from the given ArrayBuffer.
+ * @param {string} buffer the buffer to transform.
+ * @return {Blob} the result.
+ * @throws {Error} an Error if the browser doesn't support the requested feature.
+ */
+ arrayBuffer2Blob : function (buffer) {
+ JSZip.utils.checkSupport("blob");
+
+ try {
+ // Blob constructor
+ return new Blob([buffer], { type: "application/zip" });
+ }
+ catch(e) {}
+
+ try {
+ // deprecated, browser only, old way
+ var builder = new (window.BlobBuilder || window.WebKitBlobBuilder ||
+ window.MozBlobBuilder || window.MSBlobBuilder)();
+ builder.append(buffer);
+ return builder.getBlob('application/zip');
+ }
+ catch(e) {}
+
+ // well, fuck ?!
+ throw new Error("Bug : can't construct the Blob.");
+ },
+ /**
+ * Create a blob from the given string.
+ * @param {string} str the string to transform.
+ * @return {Blob} the result.
+ * @throws {Error} an Error if the browser doesn't support the requested feature.
+ */
+ string2Blob : function (str) {
+ var buffer = JSZip.utils.transformTo("arraybuffer", str);
+ return JSZip.utils.arrayBuffer2Blob(buffer);
+ }
+ };
+
+ /**
+ * The identity function.
+ * @param {Object} input the input.
+ * @return {Object} the same input.
+ */
+ function identity(input) {
+ return input;
+ };
+
/**
- * Convert a string to a "binary string" : a string containing only char codes between 0 and 255.
- * @param {string} str the string to transform.
- * @return {String} the binary string.
+ * Fill in an array with a string.
+ * @param {String} str the string to use.
+ * @param {Array|ArrayBuffer|Uint8Array} array the array to fill in (will be mutated).
+ * @return {Array|ArrayBuffer|Uint8Array} the updated array.
*/
- string2binary : function (str) {
+ function stringToArrayLike(str, array) {
+ for (var i = 0; i < str.length; ++i) {
+ array[i] = str.charCodeAt(i);
+ }
+ return array;
+ };
+
+ /**
+ * Transform an array-like object to a string.
+ * @param {Array|ArrayBuffer|Uint8Array} array the array to transform.
+ * @return {String} the result.
+ */
+ function arrayLikeToString(array) {
var result = "";
- for (var i = 0; i < str.length; i++) {
- result += String.fromCharCode(str.charCodeAt(i) & 0xff);
+ for(var i = 0; i < array.length; i++) {
+ // yup, String.fromCharCode.apply(null, array); is waaaaaay faster
+ // see http://jsperf.com/converting-a-uint8array-to-a-string/2
+ // but... the stack is limited !
+ // maybe http://jsperf.com/arraybuffer-to-string-apply-performance/2 ?
+ result += String.fromCharCode(array[i]);
}
+
return result;
- },
+ };
+
/**
- * Create a Uint8Array from the string.
- * @param {string} str the string to transform.
- * @return {Uint8Array} the typed array.
- * @throws {Error} an Error if the browser doesn't support the requested feature.
+ * Copy the data from an array-like to an other array-like.
+ * @param {Array|ArrayBuffer|Uint8Array} arrayFrom the origin array.
+ * @param {Array|ArrayBuffer|Uint8Array} arrayTo the destination array which will be mutated.
+ * @return {Array|ArrayBuffer|Uint8Array} the updated destination array.
*/
- string2Uint8Array : function (str) {
- if (!JSZip.support.uint8array) {
- throw new Error("Uint8Array is not supported by this browser");
+ function arrayLikeToArrayLike(arrayFrom, arrayTo) {
+ for(var i = 0; i < arrayFrom.length; i++) {
+ arrayTo[i] = arrayFrom[i];
}
- var buffer = new ArrayBuffer(str.length);
- var bufferView = new Uint8Array(buffer);
- for(var i = 0; i < str.length; i++) {
- bufferView[i] = str.charCodeAt(i);
+ return arrayTo;
+ };
+
+ // a matrix containing functions to transform everything into everything.
+ var transform = {};
+
+ // string to ?
+ transform["string"] = {
+ "string" : identity,
+ "array" : function (input) {
+ return stringToArrayLike(input, []);
+ },
+ "arraybuffer" : function (input) {
+ return transform["string"]["uint8array"](input).buffer;
+ },
+ "uint8array" : function (input) {
+ return stringToArrayLike(input, new Uint8Array(input.length));
}
+ };
- return bufferView;
- },
+ // array to ?
+ transform["array"] = {
+ "string" : arrayLikeToString,
+ "array" : identity,
+ "arraybuffer" : function (input) {
+ return (new Uint8Array(input)).buffer;
+ },
+ "uint8array" : function (input) {
+ return new Uint8Array(input);
+ }
+ };
+
+ // arraybuffer to ?
+ transform["arraybuffer"] = {
+ "string" : function (input) {
+ return arrayLikeToString(new Uint8Array(input));
+ },
+ "array" : function (input) {
+ return arrayLikeToArrayLike(new Uint8Array(input), []);
+ },
+ "arraybuffer" : identity,
+ "uint8array" : function (input) {
+ return new Uint8Array(input);
+ }
+ };
+
+ // uint8array to ?
+ transform["uint8array"] = {
+ "string" : arrayLikeToString,
+ "array" : function (input) {
+ return arrayLikeToArrayLike(input, []);
+ },
+ "arraybuffer" : function (input) {
+ return input.buffer;
+ },
+ "uint8array" : identity
+ };
/**
- * Create a string from the Uint8Array.
- * @param {Uint8Array} array the array to transform.
- * @return {string} the string.
- * @throws {Error} an Error if the browser doesn't support the requested feature.
+ * Transform an input into any type.
+ * The supported output type are : string, array, uint8array, arraybuffer.
+ * If no output type is specified, the unmodified input will be returned.
+ * @param {String} outputType the output type.
+ * @param {String|Array|ArrayBuffer|Uint8Array} input the input to convert.
+ * @throws {Error} an Error if the browser doesn't support the requested output type.
*/
- uint8Array2String : function (array) {
- if (!JSZip.support.uint8array) {
- throw new Error("Uint8Array is not supported by this browser");
+ JSZip.utils.transformTo = function (outputType, input) {
+ if (!input) {
+ // undefined, null, etc
+ // an empty string won't harm.
+ input = "";
}
- var result = "";
- for(var i = 0; i < array.length; i++) {
- result += String.fromCharCode(array[i]);
+ if (!outputType) {
+ return input;
}
-
+ JSZip.utils.checkSupport(outputType);
+ var inputType = JSZip.utils.getTypeOf(input);
+ var result = transform[inputType][outputType](input);
return result;
- },
+ };
+
/**
- * Create a blob from the given string.
- * @param {string} str the string to transform.
- * @return {Blob} the string.
- * @throws {Error} an Error if the browser doesn't support the requested feature.
+ * Return the type of the input.
+ * The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer.
+ * @param {Object} input the input to identify.
+ * @return {String} the (lowercase) type of the input.
*/
- string2Blob : function (str) {
- if (!JSZip.support.blob) {
- throw new Error("Blob is not supported by this browser");
+ JSZip.utils.getTypeOf = function (input) {
+ if (typeof input === "string") {
+ return "string";
}
-
- var buffer = JSZip.utils.string2Uint8Array(str).buffer;
- try {
- // Blob constructor
- return new Blob([buffer], { type: "application/zip" });
+ if (input instanceof Array) {
+ return "array";
}
- catch(e) {}
+ if (JSZip.support.uint8array && input instanceof Uint8Array) {
+ return "uint8array";
+ }
+ if (JSZip.support.arraybuffer && input instanceof ArrayBuffer) {
+ return "arraybuffer";
+ }
+ };
- try {
- // deprecated, browser only, old way
- var builder = new (window.BlobBuilder || window.WebKitBlobBuilder ||
- window.MozBlobBuilder || window.MSBlobBuilder)();
- builder.append(buffer);
- return builder.getBlob('application/zip');
+ /**
+ * Throw an exception if the type is not supported.
+ * @param {String} type the type to check.
+ * @throws {Error} an Error if the browser doesn't support the requested type.
+ */
+ JSZip.utils.checkSupport = function (type) {
+ var supported = true;
+ switch (type.toLowerCase()) {
+ case "uint8array":
+ supported = JSZip.support.uint8array;
+ break;
+ case "arraybuffer":
+ supported = JSZip.support.arraybuffer;
+ break;
+ case "blob":
+ supported = JSZip.support.blob;
+ break;
}
- catch(e) {}
+ if (!supported) {
+ throw new Error(type + " is not supported by this browser");
+ }
+ };
- // well, fuck ?!
- throw new Error("Bug : can't construct the Blob.");
- }
-};
+
+})();
+
+(function (){
+ /**
+ * Represents an entry in the zip.
+ * The content may or may not be compressed.
+ * @constructor
+ */
+ JSZip.CompressedObject = function () {
+ this.compressedSize = 0;
+ this.uncompressedSize = 0;
+ this.crc32 = 0;
+ this.compressionMethod = null;
+ this.compressedContent = null;
+ };
+
+ JSZip.CompressedObject.prototype = {
+ /**
+ * Return the decompressed content in an unspecified format.
+ * The format will depend on the decompressor.
+ * @return {Object} the decompressed content.
+ */
+ getContent : function () {
+ return null; // see implementation
+ },
+ /**
+ * Return the compressed content in an unspecified format.
+ * The format will depend on the compressed conten source.
+ * @return {Object} the compressed content.
+ */
+ getCompressedContent : function () {
+ return null; // see implementation
+ }
+ };
+})();
/**
*
@@ -875,7 +1220,7 @@ JSZip.utils = {
*
* Hacked so that it doesn't utf8 en/decode everything
**/
-var JSZipBase64 = (function() {
+JSZip.base64 = (function() {
// private property
var _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
diff --git a/test/browser-test-utils.js b/test/browser-test-utils.js
index 1f71b7fa..de7bc4fe 100644
--- a/test/browser-test-utils.js
+++ b/test/browser-test-utils.js
@@ -9,7 +9,7 @@
// we skip the & 0xFF part, since this must be tested in the JSZip tests.
if (xhr.response) {
if (JSZip.support.arraybuffer && xhr.response instanceof ArrayBuffer) {
- return JSZip.utils.uint8Array2String(new Uint8Array(xhr.response));
+ return JSZip.utils.transformTo("string", xhr.response);
}
return xhr.response;
} else {
@@ -91,7 +91,7 @@
var file = JSZipTestUtils.getBinaryFromXHR(xhr);
success(file);
} catch(e) {
- error(e.message||e);
+ error(e);
}
} else {
error("Ajax error for " + zipName + " : " + this.status);
@@ -102,7 +102,7 @@
xhr.send();
} catch (e) {
- error("Ajax error for " + zipName + " : " + (e.message||e));
+ error(e);
}
};
diff --git a/test/test.js b/test/test.js
index 92343a5e..1cb48406 100644
--- a/test/test.js
+++ b/test/test.js
@@ -28,7 +28,7 @@ function reload(bytesStream) {
}
// cache for files
-var refZips = [];
+var refZips = {};
function testZipFile(testName, zipName, testFunction) {
test(testName, function () {
@@ -60,12 +60,33 @@ test("JSZip", function(){
QUnit.module("Essential"); // {{{
+test("JSZip.utils.transformTo", function () {
+ var supportedArgs = ['string', 'array'];
+ if (JSZip.support.arraybuffer) {
+ supportedArgs.push("arraybuffer");
+ }
+ if (JSZip.support.uint8array) {
+ supportedArgs.push("uint8array");
+ }
+
+ var txt = 'test text !';
+
+ for (var i = 0; i < supportedArgs.length; i++) {
+ for (var j = 0; j < supportedArgs.length; j++) {
+ var step1 = JSZip.utils.transformTo(supportedArgs[i], txt);
+ var step2 = JSZip.utils.transformTo(supportedArgs[j], step1);
+ var result = JSZip.utils.transformTo("string", step2);
+ equal(result, txt, "The transformation string -> " + supportedArgs[i] + " -> " + supportedArgs[j] + " -> string works");
+ }
+ }
+});
+
testZipFile("Zip text file !", "ref/text.zip", function(expected) {
var zip = new JSZip();
zip.file("Hello.txt", "Hello World\n");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
/*
Expected differing bytes:
@@ -87,7 +108,7 @@ testZipFile("Add a file to overwrite", "ref/text.zip", function(expected) {
zip.file("Hello.txt", "Hello World\n");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
/*
Expected differing bytes:
@@ -128,7 +149,7 @@ testZipFile("Zip text file with date", "ref/text.zip", function(expected) {
zip.file("Hello.txt", "Hello World\n", {date : new Date("July 17, 2009 14:36:57")});
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
/*
Expected differing bytes:
@@ -148,7 +169,7 @@ testZipFile("Zip image file", "ref/image.zip", function(expected) {
zip.file("smile.gif", "R0lGODdhBQAFAIACAAAAAP/eACwAAAAABQAFAAACCIwPkWerClIBADs=", {base64: true});
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
equal(reload(actual), actual, "Generated ZIP can be parsed");
@@ -169,7 +190,7 @@ testZipFile("Zip empty folder", "ref/folder.zip", function(expected) {
zip.folder("folder");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
equal(reload(actual), actual, "Generated ZIP can be parsed");
@@ -181,7 +202,7 @@ testZipFile("Zip text, folder and image", "ref/all.zip", function(expected) {
zip.folder("images").file("smile.gif", "R0lGODdhBQAFAIACAAAAAP/eACwAAAAABQAFAAACCIwPkWerClIBADs=", {base64: true});
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
/*
Expected differing bytes:
@@ -205,7 +226,7 @@ test("Finding a file", function() {
zip.file("Readme.French", "Bonjour tout le monde!\n");
zip.file("Readme.Pirate", "Ahoy m'hearty!\n");
- equal(zip.file("Readme.French").data, "Bonjour tout le monde!\n", "Exact match found");
+ equal(zip.file("Readme.French").asText(), "Bonjour tout le monde!\n", "Exact match found");
equal(zip.file("Readme.Deutch"), null, "Match exactly nothing");
equal(zip.file(/Readme\../).length, 2, "Match regex free text");
equal(zip.file(/pirate/i).length, 1, "Match regex 1 result");
@@ -214,13 +235,12 @@ test("Finding a file", function() {
testZipFile("Finding a file : modifying the result doesn't alter the zip", "ref/text.zip", function(expected) {
var zip = new JSZip();
zip.file("Hello.txt", "Hello World\n");
- zip.file("Hello.txt").data = "new data";
zip.file("Hello.txt").name = "Hello2.txt";
zip.file("Hello.txt").options.dir = true;
// these changes won't be used
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -231,9 +251,9 @@ test("Finding a file (text search) with a relative folder", function() {
zip.folder("files/translation").file("Readme.French", "Bonjour tout le monde!\n");
zip.folder("files").folder("translation").file("Readme.Pirate", "Ahoy m'hearty!\n");
- equal(zip.file("files/translation/Readme.French").data, "Bonjour tout le monde!\n", "finding file with the full path");
- equal(zip.folder("files").file("translation/Readme.French").data, "Bonjour tout le monde!\n", "finding file with a relative path");
- equal(zip.folder("files/translation").file("Readme.French").data, "Bonjour tout le monde!\n", "finding file with a relative path");
+ equal(zip.file("files/translation/Readme.French").asText(), "Bonjour tout le monde!\n", "finding file with the full path");
+ equal(zip.folder("files").file("translation/Readme.French").asText(), "Bonjour tout le monde!\n", "finding file with a relative path");
+ equal(zip.folder("files/translation").file("Readme.French").asText(), "Bonjour tout le monde!\n", "finding file with a relative path");
});
test("Finding files (regex) with a relative folder", function() {
@@ -282,7 +302,7 @@ testZipFile("Delete file", "ref/text.zip", function(expected) {
zip.remove("Remove.txt");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
@@ -294,7 +314,7 @@ testZipFile("Delete file in folder", "ref/folder.zip", function(expected) {
zip.remove("folder/Remove.txt");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -306,7 +326,7 @@ testZipFile("Delete file in folder, with a relative path", "ref/folder.zip", fun
folder.remove("Remove.txt");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -318,7 +338,7 @@ testZipFile("Delete folder", "ref/text.zip", function(expected) {
zip.remove("remove");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -330,7 +350,7 @@ testZipFile("Delete folder with a final /", "ref/text.zip", function(expected) {
zip.remove("remove/");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -342,7 +362,7 @@ testZipFile("Delete unknown path", "ref/text.zip", function(expected) {
zip.remove("unknown_folder/Hello.txt");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -356,7 +376,7 @@ testZipFile("Delete nested folders", "ref/text.zip", function(expected) {
zip.remove("remove");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
@@ -369,7 +389,7 @@ testZipFile("Delete nested folders from relative path", "ref/folder.zip", functi
zip.folder("folder").remove("1");
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
equal(reload(actual), actual, "Generated ZIP can be parsed");
@@ -384,53 +404,68 @@ testZipFile("add file: from XHR (with bytes > 255)", "ref/text.zip", function(te
});
function testFileDataGetters (opts) {
- _actualTestFileDataGetters(opts);
-
- var reloadedZip = new JSZip(opts.zip.generate({type:"string"}), {checkCRC32:true});
-
- _actualTestFileDataGetters({
- name : "reloaded, " + opts.name,
- zip : reloadedZip,
- textData : opts.textData,
- rawData : opts.rawData
- });
-}
-
-function _actualTestFileDataGetters (opts) {
if (typeof opts.rawData === "undefined") {
opts.rawData = opts.textData;
}
+ _actualTestFileDataGetters.asText(opts);
+ _actualTestFileDataGetters.asBinary(opts);
+ _actualTestFileDataGetters.asArrayBuffer(opts);
+ _actualTestFileDataGetters.asUint8Array(opts);
+
+ var reload = function () {
+ return {
+ name : "reloaded, " + opts.name,
+ // no check of crc32, we want to test the CompressedObject code.
+ zip : new JSZip(opts.zip.generate({type:"string"}, {checkCRC32:false})),
+ textData : opts.textData,
+ rawData : opts.rawData
+ };
+ };
- equal(opts.zip.file("file.txt").asText(), opts.textData, opts.name + " : asText()");
- // http://www.fileformat.info/info/unicode/char/20ac/index.htm
- equal(opts.zip.file("file.txt").asBinary(), opts.rawData, opts.name + " : asBinary()");
- if (JSZip.support.arraybuffer) {
- var buffer = opts.zip.file("file.txt").asArrayBuffer();
- ok(buffer instanceof ArrayBuffer, opts.name + " : the result is a instance of ArrayBuffer");
- var actual = String.fromCharCode.apply(null, new Uint8Array(buffer));
- equal(actual, opts.rawData, opts.name + " : asArrayBuffer()");
- } else {
- try {
- opts.zip.file("file.txt").asArrayBuffer();
- ok(false, "no exception thrown");
- } catch (e) {
- ok(e.message.match("not supported by this browser"), opts.name + " : the error message is useful");
+ _actualTestFileDataGetters.asText(reload());
+ _actualTestFileDataGetters.asBinary(reload());
+ _actualTestFileDataGetters.asArrayBuffer(reload());
+ _actualTestFileDataGetters.asUint8Array(reload());
+}
+
+var _actualTestFileDataGetters = {
+ asText : function (opts) {
+ equal(opts.zip.file("file.txt").asText(), opts.textData, opts.name + " : asText()");
+ },
+ asBinary : function (opts) {
+ equal(opts.zip.file("file.txt").asBinary(), opts.rawData, opts.name + " : asBinary()");
+ },
+ asArrayBuffer : function (opts) {
+ if (JSZip.support.arraybuffer) {
+ var buffer = opts.zip.file("file.txt").asArrayBuffer();
+ ok(buffer instanceof ArrayBuffer, opts.name + " : the result is a instance of ArrayBuffer");
+ var actual = String.fromCharCode.apply(null, new Uint8Array(buffer));
+ equal(actual, opts.rawData, opts.name + " : asArrayBuffer()");
+ } else {
+ try {
+ opts.zip.file("file.txt").asArrayBuffer();
+ ok(false, "no exception thrown");
+ } catch (e) {
+ ok(e.message.match("not supported by this browser"), opts.name + " : the error message is useful");
+ }
}
- }
- if (JSZip.support.uint8array) {
- var bufferView = opts.zip.file("file.txt").asUint8Array();
- ok(bufferView instanceof Uint8Array, opts.name + " : the result is a instance of Uint8Array");
- var actual = String.fromCharCode.apply(null, bufferView);
- equal(actual, opts.rawData, opts.name + " : asUint8Array()");
- } else {
- try {
- opts.zip.file("file.txt").asUint8Array();
- ok(false, "no exception thrown");
- } catch (e) {
- ok(e.message.match("not supported by this browser"), opts.name + " : the error message is useful");
+ },
+ asUint8Array : function (opts) {
+ if (JSZip.support.uint8array) {
+ var bufferView = opts.zip.file("file.txt").asUint8Array();
+ ok(bufferView instanceof Uint8Array, opts.name + " : the result is a instance of Uint8Array");
+ var actual = String.fromCharCode.apply(null, bufferView);
+ equal(actual, opts.rawData, opts.name + " : asUint8Array()");
+ } else {
+ try {
+ opts.zip.file("file.txt").asUint8Array();
+ ok(false, "no exception thrown");
+ } catch (e) {
+ ok(e.message.match("not supported by this browser"), opts.name + " : the error message is useful");
+ }
}
}
-}
+};
test("add file: file(name, undefined)", function() {
var zip = new JSZip(), undef;
@@ -498,6 +533,9 @@ if (JSZip.support.uint8array) {
zip = new JSZip();
zip.file("file.txt", str2array("test\r\ntest\r\n"));
testFileDataGetters({name : "\\r\\n", zip : zip, textData : "test\r\ntest\r\n"});
+ zip = new JSZip();
+ zip.file("file.txt", str2array(""));
+ testFileDataGetters({name : "empty content", zip : zip, textData : ""});
});
}
@@ -516,6 +554,9 @@ if (JSZip.support.arraybuffer) {
zip = new JSZip();
zip.file("file.txt", str2buffer("test\r\ntest\r\n"));
testFileDataGetters({name : "\\r\\n", zip : zip, textData : "test\r\ntest\r\n"});
+ zip = new JSZip();
+ zip.file("file.txt", str2buffer(""));
+ testFileDataGetters({name : "empty content", zip : zip, textData : ""});
});
}
@@ -531,7 +572,7 @@ testZipFile("generate : base64:true. Deprecated, but it still works", "ref/text.
var zip = new JSZip();
zip.file("Hello.txt", "Hello World\n");
var content = zip.generate({base64:true});
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -549,7 +590,7 @@ testZipFile("generate : type:base64", "ref/text.zip", function(expected) {
zip.file("Hello.txt", "Hello World\n");
var content = zip.generate({type:"base64"});
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -680,7 +721,7 @@ testZipFile("Filtering a zip : the filter function can't alter the data", "ref/t
});
var content = zip.generate();
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
@@ -689,9 +730,9 @@ testZipFile("Filtering a zip : the filter function can't alter the data", "ref/t
testZipFile("STORE is the default method", "ref/text.zip", function(expected) {
var zip = new JSZip();
zip.file("Hello.txt", "Hello World\n");
- var content = zip.generate({compression:'STORE'});
+ var content = zip.generate({compression:'STORE'});
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
// no difference with the "Zip text file" test.
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
@@ -703,7 +744,7 @@ testZipFile("STORE doesn't compress", "ref/store.zip", function(expected) {
zip.file("Hello.txt", "This a looong file : we need to see the difference between the different compression methods.\n");
var content = zip.generate({compression:'STORE'});
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
@@ -714,11 +755,30 @@ testZipFile("DEFLATE compress", "ref/deflate.zip", function(expected) {
zip.file("Hello.txt", "This a looong file : we need to see the difference between the different compression methods.\n");
var content = zip.generate({compression:'DEFLATE'});
- var actual = JSZipBase64.decode(content);
+ var actual = JSZip.base64.decode(content);
ok(similar(actual, expected, 18) , "Generated ZIP matches reference ZIP");
});
+test("Lazy decompression works", function () {
+ var zip = new JSZip();
+ zip.folder("test/").file("Hello.txt", "hello !");
+
+ var expected = zip.generate({type:"string", compression:"STORE"});
+
+ zip = new JSZip(expected); // lazy
+ equal(zip.generate({type:"string", compression:"STORE"}), expected, "Reloading file, same compression");
+
+ zip = new JSZip(zip.generate({type:"string", compression:"DEFLATE"}));
+ zip = new JSZip(zip.generate({type:"string", compression:"STORE"}));
+
+ var zipData = zip.generate({type:"string", compression:"STORE"});
+ equal(zipData, expected, "Reloading file, different compression");
+
+ // check CRC32
+ new JSZip(zipData, {checkCRC32:true}).generate({type:"string"});
+});
+
test("Empty files / folders are not compressed", function() {
var zip = new JSZip();
zip.file("Hello.txt", "This a looong file : we need to see the difference between the different compression methods.\n");
@@ -742,7 +802,7 @@ test("Empty files / folders are not compressed", function() {
});
test("unknown compression throws an exception", function () {
- var zip = new JSZip();
+ var zip = new JSZip().file("file.txt", "test");
try {
zip.generate({compression:'MAYBE'});
ok(false, "no exception");
@@ -809,7 +869,7 @@ QUnit.module("Load file"); // {{{
testZipFile("load(string) works", "ref/all.zip", function(file) {
ok(typeof file === "string");
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
testZipFile("load(string) handles bytes > 255", "ref/all.zip", function(file) {
@@ -821,7 +881,7 @@ testZipFile("load(string) handles bytes > 255", "ref/all.zip", function(file) {
}
var zip = new JSZip(updatedFile);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
if (JSZip.support.arraybuffer) {
@@ -833,8 +893,13 @@ if (JSZip.support.arraybuffer) {
}
ok(file instanceof ArrayBuffer);
- var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+
+ // when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.
+ // if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).
+ equal(new JSZip(file).file("Hello.txt").asArrayBuffer().byteLength, 12, "don't get the original buffer");
+ equal(new JSZip(file).file("Hello.txt").asUint8Array().buffer.byteLength, 12, "don't get a view of the original buffer");
+
+ equal(new JSZip(file).file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
}
@@ -846,41 +911,46 @@ if (JSZip.support.uint8array) {
}
ok(file instanceof Uint8Array);
- var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+
+ // when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.
+ // if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).
+ equal(new JSZip(file).file("Hello.txt").asArrayBuffer().byteLength, 12, "don't get the original buffer");
+ equal(new JSZip(file).file("Hello.txt").asUint8Array().buffer.byteLength, 12, "don't get a view of the original buffer");
+
+ equal(new JSZip(file).file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
}
// zip -6 -X deflate.zip Hello.txt
testZipFile("zip with DEFLATE", "ref/deflate.zip", function(file) {
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "This a looong file : we need to see the difference between the different compression methods.\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "This a looong file : we need to see the difference between the different compression methods.\n", "the zip was correctly read.");
});
// zip -0 -z -c archive_comment.zip Hello.txt
testZipFile("zip with comment", "ref/archive_comment.zip", function(file) {
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
// zip -0 extra_attributes.zip Hello.txt
testZipFile("zip with extra attributes", "ref/extra_attributes.zip", function(file) {
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
// use -fz to force use of Zip64 format
// zip -fz -0 zip64.zip Hello.txt
testZipFile("zip 64", "ref/zip64.zip", function(file) {
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
// use -fd to force data descriptors as if streaming
// zip -fd -0 data_descriptor.zip Hello.txt
testZipFile("zip with data descriptor", "ref/data_descriptor.zip", function(file) {
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
});
// combo of zip64 and data descriptors :
@@ -891,23 +961,23 @@ testZipFile("zip with data descriptor", "ref/data_descriptor.zip", function(file
// zip -0 -X zip_within_zip.zip Hello.txt && zip -0 -X nested.zip Hello.txt zip_within_zip.zip
testZipFile("nested zip", "ref/nested.zip", function(file) {
var zip = new JSZip(file);
- equal(zip.file("Hello.txt").data, "Hello World\n", "the zip was correctly read.");
- var nested = new JSZip(zip.file("zip_within_zip.zip").data);
- equal(nested.file("Hello.txt").data, "Hello World\n", "the inner zip was correctly read.");
+ equal(zip.file("Hello.txt").asText(), "Hello World\n", "the zip was correctly read.");
+ var nested = new JSZip(zip.file("zip_within_zip.zip").asBinary());
+ equal(nested.file("Hello.txt").asText(), "Hello World\n", "the inner zip was correctly read.");
});
// zip -fd -0 nested_data_descriptor.zip data_descriptor.zip
testZipFile("nested zip with data descriptors", "ref/nested_data_descriptor.zip", function(file) {
var zip = new JSZip(file);
- var nested = new JSZip(zip.file("data_descriptor.zip").data);
- equal(nested.file("Hello.txt").data, "Hello World\n", "the inner zip was correctly read.");
+ var nested = new JSZip(zip.file("data_descriptor.zip").asBinary());
+ equal(nested.file("Hello.txt").asText(), "Hello World\n", "the inner zip was correctly read.");
});
// zip -fz -0 nested_zip64.zip zip64.zip
testZipFile("nested zip 64", "ref/nested_zip64.zip", function(file) {
var zip = new JSZip(file);
- var nested = new JSZip(zip.file("zip64.zip").data);
- equal(nested.file("Hello.txt").data, "Hello World\n", "the inner zip was correctly read.");
+ var nested = new JSZip(zip.file("zip64.zip").asBinary());
+ equal(nested.file("Hello.txt").asText(), "Hello World\n", "the inner zip was correctly read.");
});
// nested zip 64 with data descriptors
@@ -953,9 +1023,9 @@ if (QUnit.urlParams.complexfiles) {
testZipFile("Franz Kafka - The Metamorphosis.epub", "ref/complex_files/Franz Kafka - The Metamorphosis.epub", function(file) {
var zip = new JSZip(file);
equal(zip.filter(function(){return true;}).length, 26, "the zip contains the good number of elements.");
- equal(zip.file("mimetype").data, "application/epub+zip\r\n", "the zip was correctly read.");
+ equal(zip.file("mimetype").asText(), "application/epub+zip\r\n", "the zip was correctly read.");
// the .ncx file tells us that the first chapter is in the main0.xml file.
- ok(zip.file("OPS/main0.xml").data.indexOf("One morning, as Gregor Samsa was waking up from anxious dreams") !== -1, "the zip was correctly read.");
+ ok(zip.file("OPS/main0.xml").asText().indexOf("One morning, as Gregor Samsa was waking up from anxious dreams") !== -1, "the zip was correctly read.");
});
// a showcase in http://msdn.microsoft.com/en-us/windows/hardware/gg463429
@@ -963,7 +1033,7 @@ if (QUnit.urlParams.complexfiles) {
var zip = new JSZip(file);
// the zip file contains 15 entries, but we get 23 when creating all the sub-folders.
equal(zip.filter(function(){return true;}).length, 23, "the zip contains the good number of elements.");
- ok(zip.file("[Content_Types].xml").data.indexOf("application/vnd.ms-package.xps-fixeddocument+xml") !== -1, "the zip was correctly read.");
+ ok(zip.file("[Content_Types].xml").asText().indexOf("application/vnd.ms-package.xps-fixeddocument+xml") !== -1, "the zip was correctly read.");
});
// an example file in http://cheeso.members.winisp.net/srcview.aspx?dir=js-unzip
@@ -972,7 +1042,7 @@ if (QUnit.urlParams.complexfiles) {
var zip = new JSZip(file);
// the zip file contains 16 entries, but we get 27 when creating all the sub-folders.
equal(zip.filter(function(){return true;}).length, 27, "the zip contains the good number of elements.");
- ok(zip.file("[Content_Types].xml").data.indexOf("application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml") !== -1, "the zip was correctly read.");
+ ok(zip.file("[Content_Types].xml").asText().indexOf("application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml") !== -1, "the zip was correctly read.");
});
// same as above, but in the Open Document format
@@ -980,7 +1050,7 @@ if (QUnit.urlParams.complexfiles) {
var zip = new JSZip(file);
// the zip file contains 19 entries, but we get 27 when creating all the sub-folders.
equal(zip.filter(function(){return true;}).length, 27, "the zip contains the good number of elements.");
- ok(zip.file("META-INF/manifest.xml").data.indexOf("application/vnd.oasis.opendocument.spreadsheet") !== -1, "the zip was correctly read.");
+ ok(zip.file("META-INF/manifest.xml").asText().indexOf("application/vnd.oasis.opendocument.spreadsheet") !== -1, "the zip was correctly read.");
});
}
// }}} Load complex files
From 3754a98b6f8f1a181d2f8f99f3c3ddc46db09076 Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Thu, 9 May 2013 18:49:32 +0200
Subject: [PATCH 2/9] Replace the INFLATE/DEFLATE implementations
Use https://github.com/imaya/zlib.js instead of an old implementation.
---
jszip-deflate.js | 1756 ++--------------------------------------------
jszip-inflate.js | 831 ++--------------------
test/test.js | 5 +-
3 files changed, 116 insertions(+), 2476 deletions(-)
diff --git a/jszip-deflate.js b/jszip-deflate.js
index 58ee4ef1..dc93ff42 100644
--- a/jszip-deflate.js
+++ b/jszip-deflate.js
@@ -1,1699 +1,63 @@
-/*
- * Port of a script by Masanao Izumo.
- *
- * Only changes : wrap all the variables in a function and add the
- * main function to JSZip (DEFLATE compression method).
- * Everything else was written by M. Izumo.
- *
- * Original code can be found here: http://www.onicos.com/staff/iz/amuse/javascript/expert/deflate.txt
- */
+"use strict";
-if(!JSZip) {
- throw "JSZip not defined";
-}
-
-/*
- * Original:
- * http://www.onicos.com/staff/iz/amuse/javascript/expert/deflate.txt
- */
-
-(function(){
-
-/* Copyright (C) 1999 Masanao Izumo
- * Version: 1.0.1
- * LastModified: Dec 25 1999
- */
-
-/* Interface:
- * data = zip_deflate(src);
- */
-
-/* constant parameters */
-var zip_WSIZE = 32768; // Sliding Window size
-var zip_STORED_BLOCK = 0;
-var zip_STATIC_TREES = 1;
-var zip_DYN_TREES = 2;
-
-/* for deflate */
-var zip_DEFAULT_LEVEL = 6;
-var zip_FULL_SEARCH = true;
-var zip_INBUFSIZ = 32768; // Input buffer size
-var zip_INBUF_EXTRA = 64; // Extra buffer
-var zip_OUTBUFSIZ = 1024 * 8;
-var zip_window_size = 2 * zip_WSIZE;
-var zip_MIN_MATCH = 3;
-var zip_MAX_MATCH = 258;
-var zip_BITS = 16;
-// for SMALL_MEM
-var zip_LIT_BUFSIZE = 0x2000;
-var zip_HASH_BITS = 13;
-// for MEDIUM_MEM
-// var zip_LIT_BUFSIZE = 0x4000;
-// var zip_HASH_BITS = 14;
-// for BIG_MEM
-// var zip_LIT_BUFSIZE = 0x8000;
-// var zip_HASH_BITS = 15;
-if(zip_LIT_BUFSIZE > zip_INBUFSIZ)
- alert("error: zip_INBUFSIZ is too small");
-if((zip_WSIZE<<1) > (1< zip_BITS-1)
- alert("error: zip_HASH_BITS is too large");
-if(zip_HASH_BITS < 8 || zip_MAX_MATCH != 258)
- alert("error: Code too clever");
-var zip_DIST_BUFSIZE = zip_LIT_BUFSIZE;
-var zip_HASH_SIZE = 1 << zip_HASH_BITS;
-var zip_HASH_MASK = zip_HASH_SIZE - 1;
-var zip_WMASK = zip_WSIZE - 1;
-var zip_NIL = 0; // Tail of hash chains
-var zip_TOO_FAR = 4096;
-var zip_MIN_LOOKAHEAD = zip_MAX_MATCH + zip_MIN_MATCH + 1;
-var zip_MAX_DIST = zip_WSIZE - zip_MIN_LOOKAHEAD;
-var zip_SMALLEST = 1;
-var zip_MAX_BITS = 15;
-var zip_MAX_BL_BITS = 7;
-var zip_LENGTH_CODES = 29;
-var zip_LITERALS =256;
-var zip_END_BLOCK = 256;
-var zip_L_CODES = zip_LITERALS + 1 + zip_LENGTH_CODES;
-var zip_D_CODES = 30;
-var zip_BL_CODES = 19;
-var zip_REP_3_6 = 16;
-var zip_REPZ_3_10 = 17;
-var zip_REPZ_11_138 = 18;
-var zip_HEAP_SIZE = 2 * zip_L_CODES + 1;
-var zip_H_SHIFT = parseInt((zip_HASH_BITS + zip_MIN_MATCH - 1) /
- zip_MIN_MATCH);
-
-/* variables */
-var zip_free_queue;
-var zip_qhead, zip_qtail;
-var zip_initflag;
-var zip_outbuf = null;
-var zip_outcnt, zip_outoff;
-var zip_complete;
-var zip_window;
-var zip_d_buf;
-var zip_l_buf;
-var zip_prev;
-var zip_bi_buf;
-var zip_bi_valid;
-var zip_block_start;
-var zip_ins_h;
-var zip_hash_head;
-var zip_prev_match;
-var zip_match_available;
-var zip_match_length;
-var zip_prev_length;
-var zip_strstart;
-var zip_match_start;
-var zip_eofile;
-var zip_lookahead;
-var zip_max_chain_length;
-var zip_max_lazy_match;
-var zip_compr_level;
-var zip_good_match;
-var zip_nice_match;
-var zip_dyn_ltree;
-var zip_dyn_dtree;
-var zip_static_ltree;
-var zip_static_dtree;
-var zip_bl_tree;
-var zip_l_desc;
-var zip_d_desc;
-var zip_bl_desc;
-var zip_bl_count;
-var zip_heap;
-var zip_heap_len;
-var zip_heap_max;
-var zip_depth;
-var zip_length_code;
-var zip_dist_code;
-var zip_base_length;
-var zip_base_dist;
-var zip_flag_buf;
-var zip_last_lit;
-var zip_last_dist;
-var zip_last_flags;
-var zip_flags;
-var zip_flag_bit;
-var zip_opt_len;
-var zip_static_len;
-var zip_deflate_data;
-var zip_deflate_pos;
-
-/* objects (deflate) */
-
-var zip_DeflateCT = function() {
- this.fc = 0; // frequency count or bit string
- this.dl = 0; // father node in Huffman tree or length of bit string
-}
-
-var zip_DeflateTreeDesc = function() {
- this.dyn_tree = null; // the dynamic tree
- this.static_tree = null; // corresponding static tree or NULL
- this.extra_bits = null; // extra bits for each code or NULL
- this.extra_base = 0; // base index for extra_bits
- this.elems = 0; // max number of elements in the tree
- this.max_length = 0; // max bit length for the codes
- this.max_code = 0; // largest code with non zero frequency
-}
-
-/* Values for max_lazy_match, good_match and max_chain_length, depending on
- * the desired pack level (0..9). The values given below have been tuned to
- * exclude worst case performance for pathological files. Better values may be
- * found for specific files.
- */
-var zip_DeflateConfiguration = function(a, b, c, d) {
- this.good_length = a; // reduce lazy search above this match length
- this.max_lazy = b; // do not perform lazy search above this match length
- this.nice_length = c; // quit search above this match length
- this.max_chain = d;
-}
-
-var zip_DeflateBuffer = function() {
- this.next = null;
- this.len = 0;
- this.ptr = new Array(zip_OUTBUFSIZ);
- this.off = 0;
-}
-
-/* constant tables */
-var zip_extra_lbits = new Array(
- 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);
-var zip_extra_dbits = new Array(
- 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);
-var zip_extra_blbits = new Array(
- 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7);
-var zip_bl_order = new Array(
- 16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15);
-var zip_configuration_table = new Array(
- new zip_DeflateConfiguration(0, 0, 0, 0),
- new zip_DeflateConfiguration(4, 4, 8, 4),
- new zip_DeflateConfiguration(4, 5, 16, 8),
- new zip_DeflateConfiguration(4, 6, 32, 32),
- new zip_DeflateConfiguration(4, 4, 16, 16),
- new zip_DeflateConfiguration(8, 16, 32, 32),
- new zip_DeflateConfiguration(8, 16, 128, 128),
- new zip_DeflateConfiguration(8, 32, 128, 256),
- new zip_DeflateConfiguration(32, 128, 258, 1024),
- new zip_DeflateConfiguration(32, 258, 258, 4096));
-
-
-/* routines (deflate) */
-
-var zip_deflate_start = function(level) {
- var i;
-
- if(!level)
- level = zip_DEFAULT_LEVEL;
- else if(level < 1)
- level = 1;
- else if(level > 9)
- level = 9;
-
- zip_compr_level = level;
- zip_initflag = false;
- zip_eofile = false;
- if(zip_outbuf != null)
- return;
-
- zip_free_queue = zip_qhead = zip_qtail = null;
- zip_outbuf = new Array(zip_OUTBUFSIZ);
- zip_window = new Array(zip_window_size);
- zip_d_buf = new Array(zip_DIST_BUFSIZE);
- zip_l_buf = new Array(zip_INBUFSIZ + zip_INBUF_EXTRA);
- zip_prev = new Array(1 << zip_BITS);
- zip_dyn_ltree = new Array(zip_HEAP_SIZE);
- for(i = 0; i < zip_HEAP_SIZE; i++)
- zip_dyn_ltree[i] = new zip_DeflateCT();
- zip_dyn_dtree = new Array(2*zip_D_CODES+1);
- for(i = 0; i < 2*zip_D_CODES+1; i++)
- zip_dyn_dtree[i] = new zip_DeflateCT();
- zip_static_ltree = new Array(zip_L_CODES+2);
- for(i = 0; i < zip_L_CODES+2; i++)
- zip_static_ltree[i] = new zip_DeflateCT();
- zip_static_dtree = new Array(zip_D_CODES);
- for(i = 0; i < zip_D_CODES; i++)
- zip_static_dtree[i] = new zip_DeflateCT();
- zip_bl_tree = new Array(2*zip_BL_CODES+1);
- for(i = 0; i < 2*zip_BL_CODES+1; i++)
- zip_bl_tree[i] = new zip_DeflateCT();
- zip_l_desc = new zip_DeflateTreeDesc();
- zip_d_desc = new zip_DeflateTreeDesc();
- zip_bl_desc = new zip_DeflateTreeDesc();
- zip_bl_count = new Array(zip_MAX_BITS+1);
- zip_heap = new Array(2*zip_L_CODES+1);
- zip_depth = new Array(2*zip_L_CODES+1);
- zip_length_code = new Array(zip_MAX_MATCH-zip_MIN_MATCH+1);
- zip_dist_code = new Array(512);
- zip_base_length = new Array(zip_LENGTH_CODES);
- zip_base_dist = new Array(zip_D_CODES);
- zip_flag_buf = new Array(parseInt(zip_LIT_BUFSIZE / 8));
-}
-
-var zip_deflate_end = function() {
- zip_free_queue = zip_qhead = zip_qtail = null;
- zip_outbuf = null;
- zip_window = null;
- zip_d_buf = null;
- zip_l_buf = null;
- zip_prev = null;
- zip_dyn_ltree = null;
- zip_dyn_dtree = null;
- zip_static_ltree = null;
- zip_static_dtree = null;
- zip_bl_tree = null;
- zip_l_desc = null;
- zip_d_desc = null;
- zip_bl_desc = null;
- zip_bl_count = null;
- zip_heap = null;
- zip_depth = null;
- zip_length_code = null;
- zip_dist_code = null;
- zip_base_length = null;
- zip_base_dist = null;
- zip_flag_buf = null;
-}
-
-var zip_reuse_queue = function(p) {
- p.next = zip_free_queue;
- zip_free_queue = p;
-}
-
-var zip_new_queue = function() {
- var p;
-
- if(zip_free_queue != null)
- {
- p = zip_free_queue;
- zip_free_queue = zip_free_queue.next;
- }
- else
- p = new zip_DeflateBuffer();
- p.next = null;
- p.len = p.off = 0;
-
- return p;
-}
-
-var zip_head1 = function(i) {
- return zip_prev[zip_WSIZE + i];
-}
-
-var zip_head2 = function(i, val) {
- return zip_prev[zip_WSIZE + i] = val;
-}
-
-/* put_byte is used for the compressed output, put_ubyte for the
- * uncompressed output. However unlzw() uses window for its
- * suffix table instead of its output buffer, so it does not use put_ubyte
- * (to be cleaned up).
- */
-var zip_put_byte = function(c) {
- zip_outbuf[zip_outoff + zip_outcnt++] = c;
- if(zip_outoff + zip_outcnt == zip_OUTBUFSIZ)
- zip_qoutbuf();
-}
-
-/* Output a 16 bit value, lsb first */
-var zip_put_short = function(w) {
- w &= 0xffff;
- if(zip_outoff + zip_outcnt < zip_OUTBUFSIZ - 2) {
- zip_outbuf[zip_outoff + zip_outcnt++] = (w & 0xff);
- zip_outbuf[zip_outoff + zip_outcnt++] = (w >>> 8);
- } else {
- zip_put_byte(w & 0xff);
- zip_put_byte(w >>> 8);
- }
-}
-
-/* ==========================================================================
- * Insert string s in the dictionary and set match_head to the previous head
- * of the hash chain (the most recent string with same hash key). Return
- * the previous length of the hash chain.
- * IN assertion: all calls to to INSERT_STRING are made with consecutive
- * input characters and the first MIN_MATCH bytes of s are valid
- * (except for the last MIN_MATCH-1 bytes of the input file).
- */
-var zip_INSERT_STRING = function() {
- zip_ins_h = ((zip_ins_h << zip_H_SHIFT)
- ^ (zip_window[zip_strstart + zip_MIN_MATCH - 1] & 0xff))
- & zip_HASH_MASK;
- zip_hash_head = zip_head1(zip_ins_h);
- zip_prev[zip_strstart & zip_WMASK] = zip_hash_head;
- zip_head2(zip_ins_h, zip_strstart);
-}
-
-/* Send a code of the given tree. c and tree must not have side effects */
-var zip_SEND_CODE = function(c, tree) {
- zip_send_bits(tree[c].fc, tree[c].dl);
-}
-
-/* Mapping from a distance to a distance code. dist is the distance - 1 and
- * must not have side effects. dist_code[256] and dist_code[257] are never
- * used.
- */
-var zip_D_CODE = function(dist) {
- return (dist < 256 ? zip_dist_code[dist]
- : zip_dist_code[256 + (dist>>7)]) & 0xff;
-}
-
-/* ==========================================================================
- * Compares to subtrees, using the tree depth as tie breaker when
- * the subtrees have equal frequency. This minimizes the worst case length.
- */
-var zip_SMALLER = function(tree, n, m) {
- return tree[n].fc < tree[m].fc ||
- (tree[n].fc == tree[m].fc && zip_depth[n] <= zip_depth[m]);
-}
-
-/* ==========================================================================
- * read string data
- */
-var zip_read_buff = function(buff, offset, n) {
- var i;
- for(i = 0; i < n && zip_deflate_pos < zip_deflate_data.length; i++)
- buff[offset + i] =
- zip_deflate_data.charCodeAt(zip_deflate_pos++) & 0xff;
- return i;
-}
-
-/* ==========================================================================
- * Initialize the "longest match" routines for a new file
- */
-var zip_lm_init = function() {
- var j;
-
- /* Initialize the hash table. */
- for(j = 0; j < zip_HASH_SIZE; j++)
-// zip_head2(j, zip_NIL);
- zip_prev[zip_WSIZE + j] = 0;
- /* prev will be initialized on the fly */
-
- /* Set the default configuration parameters:
- */
- zip_max_lazy_match = zip_configuration_table[zip_compr_level].max_lazy;
- zip_good_match = zip_configuration_table[zip_compr_level].good_length;
- if(!zip_FULL_SEARCH)
- zip_nice_match = zip_configuration_table[zip_compr_level].nice_length;
- zip_max_chain_length = zip_configuration_table[zip_compr_level].max_chain;
-
- zip_strstart = 0;
- zip_block_start = 0;
-
- zip_lookahead = zip_read_buff(zip_window, 0, 2 * zip_WSIZE);
- if(zip_lookahead <= 0) {
- zip_eofile = true;
- zip_lookahead = 0;
- return;
- }
- zip_eofile = false;
- /* Make sure that we always have enough lookahead. This is important
- * if input comes from a device such as a tty.
- */
- while(zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile)
- zip_fill_window();
-
- /* If lookahead < MIN_MATCH, ins_h is garbage, but this is
- * not important since only literal bytes will be emitted.
- */
- zip_ins_h = 0;
- for(j = 0; j < zip_MIN_MATCH - 1; j++) {
-// UPDATE_HASH(ins_h, window[j]);
- zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[j] & 0xff)) & zip_HASH_MASK;
- }
-}
-
-/* ==========================================================================
- * Set match_start to the longest match starting at the given string and
- * return its length. Matches shorter or equal to prev_length are discarded,
- * in which case the result is equal to prev_length and match_start is
- * garbage.
- * IN assertions: cur_match is the head of the hash chain for the current
- * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
- */
-var zip_longest_match = function(cur_match) {
- var chain_length = zip_max_chain_length; // max hash chain length
- var scanp = zip_strstart; // current string
- var matchp; // matched string
- var len; // length of current match
- var best_len = zip_prev_length; // best match length so far
-
- /* Stop when cur_match becomes <= limit. To simplify the code,
- * we prevent matches with the string of window index 0.
- */
- var limit = (zip_strstart > zip_MAX_DIST ? zip_strstart - zip_MAX_DIST : zip_NIL);
-
- var strendp = zip_strstart + zip_MAX_MATCH;
- var scan_end1 = zip_window[scanp + best_len - 1];
- var scan_end = zip_window[scanp + best_len];
-
- /* Do not waste too much time if we already have a good match: */
- if(zip_prev_length >= zip_good_match)
- chain_length >>= 2;
-
-// Assert(encoder->strstart <= window_size-MIN_LOOKAHEAD, "insufficient lookahead");
-
- do {
-// Assert(cur_match < encoder->strstart, "no future");
- matchp = cur_match;
-
- /* Skip to next match if the match length cannot increase
- * or if the match length is less than 2:
- */
- if(zip_window[matchp + best_len] != scan_end ||
- zip_window[matchp + best_len - 1] != scan_end1 ||
- zip_window[matchp] != zip_window[scanp] ||
- zip_window[++matchp] != zip_window[scanp + 1]) {
- continue;
- }
-
- /* The check at best_len-1 can be removed because it will be made
- * again later. (This heuristic is not always a win.)
- * It is not necessary to compare scan[2] and match[2] since they
- * are always equal when the other bytes match, given that
- * the hash keys are equal and that HASH_BITS >= 8.
- */
- scanp += 2;
- matchp++;
-
- /* We check for insufficient lookahead only every 8th comparison;
- * the 256th check will be made at strstart+258.
- */
- do {
- } while(zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- zip_window[++scanp] == zip_window[++matchp] &&
- scanp < strendp);
-
- len = zip_MAX_MATCH - (strendp - scanp);
- scanp = strendp - zip_MAX_MATCH;
-
- if(len > best_len) {
- zip_match_start = cur_match;
- best_len = len;
- if(zip_FULL_SEARCH) {
- if(len >= zip_MAX_MATCH) break;
- } else {
- if(len >= zip_nice_match) break;
- }
-
- scan_end1 = zip_window[scanp + best_len-1];
- scan_end = zip_window[scanp + best_len];
- }
- } while((cur_match = zip_prev[cur_match & zip_WMASK]) > limit
- && --chain_length != 0);
-
- return best_len;
-}
-
-/* ==========================================================================
- * Fill the window when the lookahead becomes insufficient.
- * Updates strstart and lookahead, and sets eofile if end of input file.
- * IN assertion: lookahead < MIN_LOOKAHEAD && strstart + lookahead > 0
- * OUT assertions: at least one byte has been read, or eofile is set;
- * file reads are performed for at least two bytes (required for the
- * translate_eol option).
- */
-var zip_fill_window = function() {
- var n, m;
-
- // Amount of free space at the end of the window.
- var more = zip_window_size - zip_lookahead - zip_strstart;
-
- /* If the window is almost full and there is insufficient lookahead,
- * move the upper half to the lower one to make room in the upper half.
- */
- if(more == -1) {
- /* Very unlikely, but possible on 16 bit machine if strstart == 0
- * and lookahead == 1 (input done one byte at time)
- */
- more--;
- } else if(zip_strstart >= zip_WSIZE + zip_MAX_DIST) {
- /* By the IN assertion, the window is not empty so we can't confuse
- * more == 0 with more == 64K on a 16 bit machine.
- */
-// Assert(window_size == (ulg)2*WSIZE, "no sliding with BIG_MEM");
-
-// System.arraycopy(window, WSIZE, window, 0, WSIZE);
- for(n = 0; n < zip_WSIZE; n++)
- zip_window[n] = zip_window[n + zip_WSIZE];
-
- zip_match_start -= zip_WSIZE;
- zip_strstart -= zip_WSIZE; /* we now have strstart >= MAX_DIST: */
- zip_block_start -= zip_WSIZE;
-
- for(n = 0; n < zip_HASH_SIZE; n++) {
- m = zip_head1(n);
- zip_head2(n, m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL);
- }
- for(n = 0; n < zip_WSIZE; n++) {
- /* If n is not on any hash chain, prev[n] is garbage but
- * its value will never be used.
- */
- m = zip_prev[n];
- zip_prev[n] = (m >= zip_WSIZE ? m - zip_WSIZE : zip_NIL);
- }
- more += zip_WSIZE;
- }
- // At this point, more >= 2
- if(!zip_eofile) {
- n = zip_read_buff(zip_window, zip_strstart + zip_lookahead, more);
- if(n <= 0)
- zip_eofile = true;
- else
- zip_lookahead += n;
- }
-}
-
-/* ==========================================================================
- * Processes a new input file and return its compressed length. This
- * function does not perform lazy evaluationof matches and inserts
- * new strings in the dictionary only for unmatched strings or for short
- * matches. It is used only for the fast compression options.
- */
-var zip_deflate_fast = function() {
- while(zip_lookahead != 0 && zip_qhead == null) {
- var flush; // set if current block must be flushed
-
- /* Insert the string window[strstart .. strstart+2] in the
- * dictionary, and set hash_head to the head of the hash chain:
- */
- zip_INSERT_STRING();
-
- /* Find the longest match, discarding those <= prev_length.
- * At this point we have always match_length < MIN_MATCH
- */
- if(zip_hash_head != zip_NIL &&
- zip_strstart - zip_hash_head <= zip_MAX_DIST) {
- /* To simplify the code, we prevent matches with the string
- * of window index 0 (in particular we have to avoid a match
- * of the string with itself at the start of the input file).
- */
- zip_match_length = zip_longest_match(zip_hash_head);
- /* longest_match() sets match_start */
- if(zip_match_length > zip_lookahead)
- zip_match_length = zip_lookahead;
- }
- if(zip_match_length >= zip_MIN_MATCH) {
-// check_match(strstart, match_start, match_length);
-
- flush = zip_ct_tally(zip_strstart - zip_match_start,
- zip_match_length - zip_MIN_MATCH);
- zip_lookahead -= zip_match_length;
-
- /* Insert new strings in the hash table only if the match length
- * is not too large. This saves time but degrades compression.
- */
- if(zip_match_length <= zip_max_lazy_match) {
- zip_match_length--; // string at strstart already in hash table
- do {
- zip_strstart++;
- zip_INSERT_STRING();
- /* strstart never exceeds WSIZE-MAX_MATCH, so there are
- * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
- * these bytes are garbage, but it does not matter since
- * the next lookahead bytes will be emitted as literals.
- */
- } while(--zip_match_length != 0);
- zip_strstart++;
- } else {
- zip_strstart += zip_match_length;
- zip_match_length = 0;
- zip_ins_h = zip_window[zip_strstart] & 0xff;
-// UPDATE_HASH(ins_h, window[strstart + 1]);
- zip_ins_h = ((zip_ins_h< zip_lookahead)
- zip_match_length = zip_lookahead;
-
- /* Ignore a length 3 match if it is too distant: */
- if(zip_match_length == zip_MIN_MATCH &&
- zip_strstart - zip_match_start > zip_TOO_FAR) {
- /* If prev_match is also MIN_MATCH, match_start is garbage
- * but we will ignore the current match anyway.
- */
- zip_match_length--;
- }
- }
- /* If there was a match at the previous step and the current
- * match is not better, output the previous match:
- */
- if(zip_prev_length >= zip_MIN_MATCH &&
- zip_match_length <= zip_prev_length) {
- var flush; // set if current block must be flushed
-
-// check_match(strstart - 1, prev_match, prev_length);
- flush = zip_ct_tally(zip_strstart - 1 - zip_prev_match,
- zip_prev_length - zip_MIN_MATCH);
-
- /* Insert in hash table all strings up to the end of the match.
- * strstart-1 and strstart are already inserted.
- */
- zip_lookahead -= zip_prev_length - 1;
- zip_prev_length -= 2;
- do {
- zip_strstart++;
- zip_INSERT_STRING();
- /* strstart never exceeds WSIZE-MAX_MATCH, so there are
- * always MIN_MATCH bytes ahead. If lookahead < MIN_MATCH
- * these bytes are garbage, but it does not matter since the
- * next lookahead bytes will always be emitted as literals.
- */
- } while(--zip_prev_length != 0);
- zip_match_available = 0;
- zip_match_length = zip_MIN_MATCH - 1;
- zip_strstart++;
- if(flush) {
- zip_flush_block(0);
- zip_block_start = zip_strstart;
- }
- } else if(zip_match_available != 0) {
- /* If there was no match at the previous position, output a
- * single literal. If there was a match but the current match
- * is longer, truncate the previous match to a single literal.
- */
- if(zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff)) {
- zip_flush_block(0);
- zip_block_start = zip_strstart;
- }
- zip_strstart++;
- zip_lookahead--;
- } else {
- /* There is no previous match to compare with, wait for
- * the next step to decide.
- */
- zip_match_available = 1;
- zip_strstart++;
- zip_lookahead--;
- }
-
- /* Make sure that we always have enough lookahead, except
- * at the end of the input file. We need MAX_MATCH bytes
- * for the next match, plus MIN_MATCH bytes to insert the
- * string following the next match.
- */
- while(zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile)
- zip_fill_window();
- }
-}
-
-var zip_init_deflate = function() {
- if(zip_eofile)
- return;
- zip_bi_buf = 0;
- zip_bi_valid = 0;
- zip_ct_init();
- zip_lm_init();
-
- zip_qhead = null;
- zip_outcnt = 0;
- zip_outoff = 0;
-
- if(zip_compr_level <= 3)
- {
- zip_prev_length = zip_MIN_MATCH - 1;
- zip_match_length = 0;
- }
- else
- {
- zip_match_length = zip_MIN_MATCH - 1;
- zip_match_available = 0;
- }
-
- zip_complete = false;
-}
-
-/* ==========================================================================
- * Same as above, but achieves better compression. We use a lazy
- * evaluation for matches: a match is finally adopted only if there is
- * no better match at the next window position.
- */
-var zip_deflate_internal = function(buff, off, buff_size) {
- var n;
-
- if(!zip_initflag)
- {
- zip_init_deflate();
- zip_initflag = true;
- if(zip_lookahead == 0) { // empty
- zip_complete = true;
- return 0;
- }
- }
-
- if((n = zip_qcopy(buff, off, buff_size)) == buff_size)
- return buff_size;
-
- if(zip_complete)
- return n;
-
- if(zip_compr_level <= 3) // optimized for speed
- zip_deflate_fast();
- else
- zip_deflate_better();
- if(zip_lookahead == 0) {
- if(zip_match_available != 0)
- zip_ct_tally(0, zip_window[zip_strstart - 1] & 0xff);
- zip_flush_block(1);
- zip_complete = true;
- }
- return n + zip_qcopy(buff, n + off, buff_size - n);
-}
-
-var zip_qcopy = function(buff, off, buff_size) {
- var n, i, j;
-
- n = 0;
- while(zip_qhead != null && n < buff_size)
- {
- i = buff_size - n;
- if(i > zip_qhead.len)
- i = zip_qhead.len;
-// System.arraycopy(qhead.ptr, qhead.off, buff, off + n, i);
- for(j = 0; j < i; j++)
- buff[off + n + j] = zip_qhead.ptr[zip_qhead.off + j];
-
- zip_qhead.off += i;
- zip_qhead.len -= i;
- n += i;
- if(zip_qhead.len == 0) {
- var p;
- p = zip_qhead;
- zip_qhead = zip_qhead.next;
- zip_reuse_queue(p);
- }
- }
-
- if(n == buff_size)
- return n;
-
- if(zip_outoff < zip_outcnt) {
- i = buff_size - n;
- if(i > zip_outcnt - zip_outoff)
- i = zip_outcnt - zip_outoff;
- // System.arraycopy(outbuf, outoff, buff, off + n, i);
- for(j = 0; j < i; j++)
- buff[off + n + j] = zip_outbuf[zip_outoff + j];
- zip_outoff += i;
- n += i;
- if(zip_outcnt == zip_outoff)
- zip_outcnt = zip_outoff = 0;
- }
- return n;
-}
-
-/* ==========================================================================
- * Allocate the match buffer, initialize the various tables and save the
- * location of the internal file attribute (ascii/binary) and method
- * (DEFLATE/STORE).
- */
-var zip_ct_init = function() {
- var n; // iterates over tree elements
- var bits; // bit counter
- var length; // length value
- var code; // code value
- var dist; // distance index
-
- if(zip_static_dtree[0].dl != 0) return; // ct_init already called
-
- zip_l_desc.dyn_tree = zip_dyn_ltree;
- zip_l_desc.static_tree = zip_static_ltree;
- zip_l_desc.extra_bits = zip_extra_lbits;
- zip_l_desc.extra_base = zip_LITERALS + 1;
- zip_l_desc.elems = zip_L_CODES;
- zip_l_desc.max_length = zip_MAX_BITS;
- zip_l_desc.max_code = 0;
-
- zip_d_desc.dyn_tree = zip_dyn_dtree;
- zip_d_desc.static_tree = zip_static_dtree;
- zip_d_desc.extra_bits = zip_extra_dbits;
- zip_d_desc.extra_base = 0;
- zip_d_desc.elems = zip_D_CODES;
- zip_d_desc.max_length = zip_MAX_BITS;
- zip_d_desc.max_code = 0;
-
- zip_bl_desc.dyn_tree = zip_bl_tree;
- zip_bl_desc.static_tree = null;
- zip_bl_desc.extra_bits = zip_extra_blbits;
- zip_bl_desc.extra_base = 0;
- zip_bl_desc.elems = zip_BL_CODES;
- zip_bl_desc.max_length = zip_MAX_BL_BITS;
- zip_bl_desc.max_code = 0;
-
- // Initialize the mapping length (0..255) -> length code (0..28)
- length = 0;
- for(code = 0; code < zip_LENGTH_CODES-1; code++) {
- zip_base_length[code] = length;
- for(n = 0; n < (1< dist code (0..29) */
- dist = 0;
- for(code = 0 ; code < 16; code++) {
- zip_base_dist[code] = dist;
- for(n = 0; n < (1<>= 7; // from now on, all distances are divided by 128
- for( ; code < zip_D_CODES; code++) {
- zip_base_dist[code] = dist << 7;
- for(n = 0; n < (1<<(zip_extra_dbits[code]-7)); n++)
- zip_dist_code[256 + dist++] = code;
- }
- // Assert (dist == 256, "ct_init: 256+dist != 512");
-
- // Construct the codes of the static literal tree
- for(bits = 0; bits <= zip_MAX_BITS; bits++)
- zip_bl_count[bits] = 0;
- n = 0;
- while(n <= 143) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; }
- while(n <= 255) { zip_static_ltree[n++].dl = 9; zip_bl_count[9]++; }
- while(n <= 279) { zip_static_ltree[n++].dl = 7; zip_bl_count[7]++; }
- while(n <= 287) { zip_static_ltree[n++].dl = 8; zip_bl_count[8]++; }
- /* Codes 286 and 287 do not exist, but we must include them in the
- * tree construction to get a canonical Huffman tree (longest code
- * all ones)
- */
- zip_gen_codes(zip_static_ltree, zip_L_CODES + 1);
-
- /* The static distance tree is trivial: */
- for(n = 0; n < zip_D_CODES; n++) {
- zip_static_dtree[n].dl = 5;
- zip_static_dtree[n].fc = zip_bi_reverse(n, 5);
- }
-
- // Initialize the first block of the first file:
- zip_init_block();
-}
-
-/* ==========================================================================
- * Initialize a new block.
- */
-var zip_init_block = function() {
- var n; // iterates over tree elements
-
- // Initialize the trees.
- for(n = 0; n < zip_L_CODES; n++) zip_dyn_ltree[n].fc = 0;
- for(n = 0; n < zip_D_CODES; n++) zip_dyn_dtree[n].fc = 0;
- for(n = 0; n < zip_BL_CODES; n++) zip_bl_tree[n].fc = 0;
-
- zip_dyn_ltree[zip_END_BLOCK].fc = 1;
- zip_opt_len = zip_static_len = 0;
- zip_last_lit = zip_last_dist = zip_last_flags = 0;
- zip_flags = 0;
- zip_flag_bit = 1;
-}
-
-/* ==========================================================================
- * Restore the heap property by moving down the tree starting at node k,
- * exchanging a node with the smallest of its two sons if necessary, stopping
- * when the heap property is re-established (each father smaller than its
- * two sons).
- */
-var zip_pqdownheap = function(
- tree, // the tree to restore
- k) { // node to move down
- var v = zip_heap[k];
- var j = k << 1; // left son of k
-
- while(j <= zip_heap_len) {
- // Set j to the smallest of the two sons:
- if(j < zip_heap_len &&
- zip_SMALLER(tree, zip_heap[j + 1], zip_heap[j]))
- j++;
-
- // Exit if v is smaller than both sons
- if(zip_SMALLER(tree, v, zip_heap[j]))
- break;
-
- // Exchange v with the smallest son
- zip_heap[k] = zip_heap[j];
- k = j;
-
- // And continue down the tree, setting j to the left son of k
- j <<= 1;
- }
- zip_heap[k] = v;
-}
-
-/* ==========================================================================
- * Compute the optimal bit lengths for a tree and update the total bit length
- * for the current block.
- * IN assertion: the fields freq and dad are set, heap[heap_max] and
- * above are the tree nodes sorted by increasing frequency.
- * OUT assertions: the field len is set to the optimal bit length, the
- * array bl_count contains the frequencies for each bit length.
- * The length opt_len is updated; static_len is also updated if stree is
- * not null.
- */
-var zip_gen_bitlen = function(desc) { // the tree descriptor
- var tree = desc.dyn_tree;
- var extra = desc.extra_bits;
- var base = desc.extra_base;
- var max_code = desc.max_code;
- var max_length = desc.max_length;
- var stree = desc.static_tree;
- var h; // heap index
- var n, m; // iterate over the tree elements
- var bits; // bit length
- var xbits; // extra bits
- var f; // frequency
- var overflow = 0; // number of elements with bit length too large
-
- for(bits = 0; bits <= zip_MAX_BITS; bits++)
- zip_bl_count[bits] = 0;
-
- /* In a first pass, compute the optimal bit lengths (which may
- * overflow in the case of the bit length tree).
- */
- tree[zip_heap[zip_heap_max]].dl = 0; // root of the heap
-
- for(h = zip_heap_max + 1; h < zip_HEAP_SIZE; h++) {
- n = zip_heap[h];
- bits = tree[tree[n].dl].dl + 1;
- if(bits > max_length) {
- bits = max_length;
- overflow++;
- }
- tree[n].dl = bits;
- // We overwrite tree[n].dl which is no longer needed
-
- if(n > max_code)
- continue; // not a leaf node
-
- zip_bl_count[bits]++;
- xbits = 0;
- if(n >= base)
- xbits = extra[n - base];
- f = tree[n].fc;
- zip_opt_len += f * (bits + xbits);
- if(stree != null)
- zip_static_len += f * (stree[n].dl + xbits);
- }
- if(overflow == 0)
- return;
-
- // This happens for example on obj2 and pic of the Calgary corpus
-
- // Find the first bit length which could increase:
- do {
- bits = max_length - 1;
- while(zip_bl_count[bits] == 0)
- bits--;
- zip_bl_count[bits]--; // move one leaf down the tree
- zip_bl_count[bits + 1] += 2; // move one overflow item as its brother
- zip_bl_count[max_length]--;
- /* The brother of the overflow item also moves one step up,
- * but this does not affect bl_count[max_length]
- */
- overflow -= 2;
- } while(overflow > 0);
-
- /* Now recompute all bit lengths, scanning in increasing frequency.
- * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
- * lengths instead of fixing only the wrong ones. This idea is taken
- * from 'ar' written by Haruhiko Okumura.)
- */
- for(bits = max_length; bits != 0; bits--) {
- n = zip_bl_count[bits];
- while(n != 0) {
- m = zip_heap[--h];
- if(m > max_code)
- continue;
- if(tree[m].dl != bits) {
- zip_opt_len += (bits - tree[m].dl) * tree[m].fc;
- tree[m].fc = bits;
- }
- n--;
- }
- }
-}
-
- /* ==========================================================================
- * Generate the codes for a given tree and bit counts (which need not be
- * optimal).
- * IN assertion: the array bl_count contains the bit length statistics for
- * the given tree and the field len is set for all tree elements.
- * OUT assertion: the field code is set for all tree elements of non
- * zero code length.
- */
-var zip_gen_codes = function(tree, // the tree to decorate
- max_code) { // largest code with non zero frequency
- var next_code = new Array(zip_MAX_BITS+1); // next code value for each bit length
- var code = 0; // running code value
- var bits; // bit index
- var n; // code index
-
- /* The distribution counts are first used to generate the code values
- * without bit reversal.
- */
- for(bits = 1; bits <= zip_MAX_BITS; bits++) {
- code = ((code + zip_bl_count[bits-1]) << 1);
- next_code[bits] = code;
- }
-
- /* Check that the bit counts in bl_count are consistent. The last code
- * must be all ones.
- */
-// Assert (code + encoder->bl_count[MAX_BITS]-1 == (1<> 1; n >= 1; n--)
- zip_pqdownheap(tree, n);
-
- /* Construct the Huffman tree by repeatedly combining the least two
- * frequent nodes.
- */
- do {
- n = zip_heap[zip_SMALLEST];
- zip_heap[zip_SMALLEST] = zip_heap[zip_heap_len--];
- zip_pqdownheap(tree, zip_SMALLEST);
-
- m = zip_heap[zip_SMALLEST]; // m = node of next least frequency
-
- // keep the nodes sorted by frequency
- zip_heap[--zip_heap_max] = n;
- zip_heap[--zip_heap_max] = m;
-
- // Create a new node father of n and m
- tree[node].fc = tree[n].fc + tree[m].fc;
-// depth[node] = (char)(MAX(depth[n], depth[m]) + 1);
- if(zip_depth[n] > zip_depth[m] + 1)
- zip_depth[node] = zip_depth[n];
- else
- zip_depth[node] = zip_depth[m] + 1;
- tree[n].dl = tree[m].dl = node;
-
- // and insert the new node in the heap
- zip_heap[zip_SMALLEST] = node++;
- zip_pqdownheap(tree, zip_SMALLEST);
-
- } while(zip_heap_len >= 2);
-
- zip_heap[--zip_heap_max] = zip_heap[zip_SMALLEST];
-
- /* At this point, the fields freq and dad are set. We can now
- * generate the bit lengths.
- */
- zip_gen_bitlen(desc);
-
- // The field len is now set, we can generate the bit codes
- zip_gen_codes(tree, max_code);
-}
-
-/* ==========================================================================
- * Scan a literal or distance tree to determine the frequencies of the codes
- * in the bit length tree. Updates opt_len to take into account the repeat
- * counts. (The contribution of the bit length codes will be added later
- * during the construction of bl_tree.)
- */
-var zip_scan_tree = function(tree,// the tree to be scanned
- max_code) { // and its largest code of non zero frequency
- var n; // iterates over all tree elements
- var prevlen = -1; // last emitted length
- var curlen; // length of current code
- var nextlen = tree[0].dl; // length of next code
- var count = 0; // repeat count of the current code
- var max_count = 7; // max repeat count
- var min_count = 4; // min repeat count
-
- if(nextlen == 0) {
- max_count = 138;
- min_count = 3;
- }
- tree[max_code + 1].dl = 0xffff; // guard
-
- for(n = 0; n <= max_code; n++) {
- curlen = nextlen;
- nextlen = tree[n + 1].dl;
- if(++count < max_count && curlen == nextlen)
- continue;
- else if(count < min_count)
- zip_bl_tree[curlen].fc += count;
- else if(curlen != 0) {
- if(curlen != prevlen)
- zip_bl_tree[curlen].fc++;
- zip_bl_tree[zip_REP_3_6].fc++;
- } else if(count <= 10)
- zip_bl_tree[zip_REPZ_3_10].fc++;
- else
- zip_bl_tree[zip_REPZ_11_138].fc++;
- count = 0; prevlen = curlen;
- if(nextlen == 0) {
- max_count = 138;
- min_count = 3;
- } else if(curlen == nextlen) {
- max_count = 6;
- min_count = 3;
- } else {
- max_count = 7;
- min_count = 4;
- }
- }
-}
-
- /* ==========================================================================
- * Send a literal or distance tree in compressed form, using the codes in
- * bl_tree.
- */
-var zip_send_tree = function(tree, // the tree to be scanned
- max_code) { // and its largest code of non zero frequency
- var n; // iterates over all tree elements
- var prevlen = -1; // last emitted length
- var curlen; // length of current code
- var nextlen = tree[0].dl; // length of next code
- var count = 0; // repeat count of the current code
- var max_count = 7; // max repeat count
- var min_count = 4; // min repeat count
-
- /* tree[max_code+1].dl = -1; */ /* guard already set */
- if(nextlen == 0) {
- max_count = 138;
- min_count = 3;
- }
-
- for(n = 0; n <= max_code; n++) {
- curlen = nextlen;
- nextlen = tree[n+1].dl;
- if(++count < max_count && curlen == nextlen) {
- continue;
- } else if(count < min_count) {
- do { zip_SEND_CODE(curlen, zip_bl_tree); } while(--count != 0);
- } else if(curlen != 0) {
- if(curlen != prevlen) {
- zip_SEND_CODE(curlen, zip_bl_tree);
- count--;
- }
- // Assert(count >= 3 && count <= 6, " 3_6?");
- zip_SEND_CODE(zip_REP_3_6, zip_bl_tree);
- zip_send_bits(count - 3, 2);
- } else if(count <= 10) {
- zip_SEND_CODE(zip_REPZ_3_10, zip_bl_tree);
- zip_send_bits(count-3, 3);
- } else {
- zip_SEND_CODE(zip_REPZ_11_138, zip_bl_tree);
- zip_send_bits(count-11, 7);
- }
- count = 0;
- prevlen = curlen;
- if(nextlen == 0) {
- max_count = 138;
- min_count = 3;
- } else if(curlen == nextlen) {
- max_count = 6;
- min_count = 3;
- } else {
- max_count = 7;
- min_count = 4;
- }
- }
-}
-
-/* ==========================================================================
- * Construct the Huffman tree for the bit lengths and return the index in
- * bl_order of the last bit length code to send.
- */
-var zip_build_bl_tree = function() {
- var max_blindex; // index of last bit length code of non zero freq
-
- // Determine the bit length frequencies for literal and distance trees
- zip_scan_tree(zip_dyn_ltree, zip_l_desc.max_code);
- zip_scan_tree(zip_dyn_dtree, zip_d_desc.max_code);
-
- // Build the bit length tree:
- zip_build_tree(zip_bl_desc);
- /* opt_len now includes the length of the tree representations, except
- * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
- */
-
- /* Determine the number of bit length codes to send. The pkzip format
- * requires that at least 4 bit length codes be sent. (appnote.txt says
- * 3 but the actual value used is 4.)
- */
- for(max_blindex = zip_BL_CODES-1; max_blindex >= 3; max_blindex--) {
- if(zip_bl_tree[zip_bl_order[max_blindex]].dl != 0) break;
- }
- /* Update opt_len to include the bit length tree and counts */
- zip_opt_len += 3*(max_blindex+1) + 5+5+4;
-// Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
-// encoder->opt_len, encoder->static_len));
-
- return max_blindex;
-}
-
-/* ==========================================================================
- * Send the header for a block using dynamic Huffman trees: the counts, the
- * lengths of the bit length codes, the literal tree and the distance tree.
- * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
- */
-var zip_send_all_trees = function(lcodes, dcodes, blcodes) { // number of codes for each tree
- var rank; // index in bl_order
-
-// Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
-// Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
-// "too many codes");
-// Tracev((stderr, "\nbl counts: "));
- zip_send_bits(lcodes-257, 5); // not +255 as stated in appnote.txt
- zip_send_bits(dcodes-1, 5);
- zip_send_bits(blcodes-4, 4); // not -3 as stated in appnote.txt
- for(rank = 0; rank < blcodes; rank++) {
-// Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
- zip_send_bits(zip_bl_tree[zip_bl_order[rank]].dl, 3);
- }
-
- // send the literal tree
- zip_send_tree(zip_dyn_ltree,lcodes-1);
-
- // send the distance tree
- zip_send_tree(zip_dyn_dtree,dcodes-1);
-}
-
-/* ==========================================================================
- * Determine the best encoding for the current block: dynamic trees, static
- * trees or store, and output the encoded block to the zip file.
- */
-var zip_flush_block = function(eof) { // true if this is the last block for a file
- var opt_lenb, static_lenb; // opt_len and static_len in bytes
- var max_blindex; // index of last bit length code of non zero freq
- var stored_len; // length of input block
-
- stored_len = zip_strstart - zip_block_start;
- zip_flag_buf[zip_last_flags] = zip_flags; // Save the flags for the last 8 items
-
- // Construct the literal and distance trees
- zip_build_tree(zip_l_desc);
-// Tracev((stderr, "\nlit data: dyn %ld, stat %ld",
-// encoder->opt_len, encoder->static_len));
-
- zip_build_tree(zip_d_desc);
-// Tracev((stderr, "\ndist data: dyn %ld, stat %ld",
-// encoder->opt_len, encoder->static_len));
- /* At this point, opt_len and static_len are the total bit lengths of
- * the compressed block data, excluding the tree representations.
- */
-
- /* Build the bit length tree for the above two trees, and get the index
- * in bl_order of the last bit length code to send.
- */
- max_blindex = zip_build_bl_tree();
-
- // Determine the best encoding. Compute first the block length in bytes
- opt_lenb = (zip_opt_len +3+7)>>3;
- static_lenb = (zip_static_len+3+7)>>3;
-
-// Trace((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u dist %u ",
-// opt_lenb, encoder->opt_len,
-// static_lenb, encoder->static_len, stored_len,
-// encoder->last_lit, encoder->last_dist));
-
- if(static_lenb <= opt_lenb)
- opt_lenb = static_lenb;
- if(stored_len + 4 <= opt_lenb // 4: two words for the lengths
- && zip_block_start >= 0) {
- var i;
-
- /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
- * Otherwise we can't have processed more than WSIZE input bytes since
- * the last block flush, because compression would have been
- * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
- * transform a block into a stored block.
- */
- zip_send_bits((zip_STORED_BLOCK<<1)+eof, 3); /* send block type */
- zip_bi_windup(); /* align on byte boundary */
- zip_put_short(stored_len);
- zip_put_short(~stored_len);
-
- // copy block
-/*
- p = &window[block_start];
- for(i = 0; i < stored_len; i++)
- put_byte(p[i]);
-*/
- for(i = 0; i < stored_len; i++)
- zip_put_byte(zip_window[zip_block_start + i]);
-
- } else if(static_lenb == opt_lenb) {
- zip_send_bits((zip_STATIC_TREES<<1)+eof, 3);
- zip_compress_block(zip_static_ltree, zip_static_dtree);
- } else {
- zip_send_bits((zip_DYN_TREES<<1)+eof, 3);
- zip_send_all_trees(zip_l_desc.max_code+1,
- zip_d_desc.max_code+1,
- max_blindex+1);
- zip_compress_block(zip_dyn_ltree, zip_dyn_dtree);
- }
-
- zip_init_block();
-
- if(eof != 0)
- zip_bi_windup();
-}
-
-/* ==========================================================================
- * Save the match info and tally the frequency counts. Return true if
- * the current block must be flushed.
- */
-var zip_ct_tally = function(
- dist, // distance of matched string
- lc) { // match length-MIN_MATCH or unmatched char (if dist==0)
- zip_l_buf[zip_last_lit++] = lc;
- if(dist == 0) {
- // lc is the unmatched char
- zip_dyn_ltree[lc].fc++;
- } else {
- // Here, lc is the match length - MIN_MATCH
- dist--; // dist = match distance - 1
-// Assert((ush)dist < (ush)MAX_DIST &&
-// (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
-// (ush)D_CODE(dist) < (ush)D_CODES, "ct_tally: bad match");
-
- zip_dyn_ltree[zip_length_code[lc]+zip_LITERALS+1].fc++;
- zip_dyn_dtree[zip_D_CODE(dist)].fc++;
-
- zip_d_buf[zip_last_dist++] = dist;
- zip_flags |= zip_flag_bit;
- }
- zip_flag_bit <<= 1;
-
- // Output the flags if they fill a byte
- if((zip_last_lit & 7) == 0) {
- zip_flag_buf[zip_last_flags++] = zip_flags;
- zip_flags = 0;
- zip_flag_bit = 1;
- }
- // Try to guess if it is profitable to stop the current block here
- if(zip_compr_level > 2 && (zip_last_lit & 0xfff) == 0) {
- // Compute an upper bound for the compressed length
- var out_length = zip_last_lit * 8;
- var in_length = zip_strstart - zip_block_start;
- var dcode;
-
- for(dcode = 0; dcode < zip_D_CODES; dcode++) {
- out_length += zip_dyn_dtree[dcode].fc * (5 + zip_extra_dbits[dcode]);
- }
- out_length >>= 3;
-// Trace((stderr,"\nlast_lit %u, last_dist %u, in %ld, out ~%ld(%ld%%) ",
-// encoder->last_lit, encoder->last_dist, in_length, out_length,
-// 100L - out_length*100L/in_length));
- if(zip_last_dist < parseInt(zip_last_lit/2) &&
- out_length < parseInt(in_length/2))
- return true;
- }
- return (zip_last_lit == zip_LIT_BUFSIZE-1 ||
- zip_last_dist == zip_DIST_BUFSIZE);
- /* We avoid equality with LIT_BUFSIZE because of wraparound at 64K
- * on 16 bit machines and because stored blocks are restricted to
- * 64K-1 bytes.
- */
-}
-
- /* ==========================================================================
- * Send the block data compressed using the given Huffman trees
- */
-var zip_compress_block = function(
- ltree, // literal tree
- dtree) { // distance tree
- var dist; // distance of matched string
- var lc; // match length or unmatched char (if dist == 0)
- var lx = 0; // running index in l_buf
- var dx = 0; // running index in d_buf
- var fx = 0; // running index in flag_buf
- var flag = 0; // current flags
- var code; // the code to send
- var extra; // number of extra bits to send
-
- if(zip_last_lit != 0) do {
- if((lx & 7) == 0)
- flag = zip_flag_buf[fx++];
- lc = zip_l_buf[lx++] & 0xff;
- if((flag & 1) == 0) {
- zip_SEND_CODE(lc, ltree); /* send a literal byte */
-// Tracecv(isgraph(lc), (stderr," '%c' ", lc));
- } else {
- // Here, lc is the match length - MIN_MATCH
- code = zip_length_code[lc];
- zip_SEND_CODE(code+zip_LITERALS+1, ltree); // send the length code
- extra = zip_extra_lbits[code];
- if(extra != 0) {
- lc -= zip_base_length[code];
- zip_send_bits(lc, extra); // send the extra length bits
- }
- dist = zip_d_buf[dx++];
- // Here, dist is the match distance - 1
- code = zip_D_CODE(dist);
-// Assert (code < D_CODES, "bad d_code");
-
- zip_SEND_CODE(code, dtree); // send the distance code
- extra = zip_extra_dbits[code];
- if(extra != 0) {
- dist -= zip_base_dist[code];
- zip_send_bits(dist, extra); // send the extra distance bits
- }
- } // literal or match pair ?
- flag >>= 1;
- } while(lx < zip_last_lit);
-
- zip_SEND_CODE(zip_END_BLOCK, ltree);
-}
-
-/* ==========================================================================
- * Send a value on a given number of bits.
- * IN assertion: length <= 16 and value fits in length bits.
- */
-var zip_Buf_size = 16; // bit size of bi_buf
-var zip_send_bits = function(
- value, // value to send
- length) { // number of bits
- /* If not enough room in bi_buf, use (valid) bits from bi_buf and
- * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
- * unused bits in value.
- */
- if(zip_bi_valid > zip_Buf_size - length) {
- zip_bi_buf |= (value << zip_bi_valid);
- zip_put_short(zip_bi_buf);
- zip_bi_buf = (value >> (zip_Buf_size - zip_bi_valid));
- zip_bi_valid += length - zip_Buf_size;
- } else {
- zip_bi_buf |= value << zip_bi_valid;
- zip_bi_valid += length;
- }
-}
-
-/* ==========================================================================
- * Reverse the first len bits of a code, using straightforward code (a faster
- * method would use a table)
- * IN assertion: 1 <= len <= 15
- */
-var zip_bi_reverse = function(
- code, // the value to invert
- len) { // its bit length
- var res = 0;
- do {
- res |= code & 1;
- code >>= 1;
- res <<= 1;
- } while(--len > 0);
- return res >> 1;
-}
-
-/* ==========================================================================
- * Write out any remaining bits in an incomplete byte.
- */
-var zip_bi_windup = function() {
- if(zip_bi_valid > 8) {
- zip_put_short(zip_bi_buf);
- } else if(zip_bi_valid > 0) {
- zip_put_byte(zip_bi_buf);
- }
- zip_bi_buf = 0;
- zip_bi_valid = 0;
-}
-
-var zip_qoutbuf = function() {
- if(zip_outcnt != 0) {
- var q, i;
- q = zip_new_queue();
- if(zip_qhead == null)
- zip_qhead = zip_qtail = q;
- else
- zip_qtail = zip_qtail.next = q;
- q.len = zip_outcnt - zip_outoff;
-// System.arraycopy(zip_outbuf, zip_outoff, q.ptr, 0, q.len);
- for(i = 0; i < q.len; i++)
- q.ptr[i] = zip_outbuf[zip_outoff + i];
- zip_outcnt = zip_outoff = 0;
- }
-}
-
-var zip_deflate = function(str, level) {
- var i, j;
-
- zip_deflate_data = str;
- zip_deflate_pos = 0;
- if(typeof level == "undefined")
- level = zip_DEFAULT_LEVEL;
- zip_deflate_start(level);
-
- var buff = new Array(1024);
- var aout = [];
- while((i = zip_deflate_internal(buff, 0, buff.length)) > 0) {
- var cbuf = new Array(i);
- for(j = 0; j < i; j++){
- cbuf[j] = String.fromCharCode(buff[j]);
- }
- aout[aout.length] = cbuf.join("");
- }
- zip_deflate_data = null; // G.C.
- return aout.join("");
-}
-
-//
-// end of the script of Masanao Izumo.
-//
-
-// we add the compression method for JSZip
-if(!JSZip.compressions["DEFLATE"]) {
- JSZip.compressions["DEFLATE"] = {
- magic : "\x08\x00",
- compress : zip_deflate,
- compressInputType : "string"
+(function () {
+ if(!JSZip) {
+ throw "JSZip not defined";
+ }
+ var context = {};
+ (function () {
+
+ // https://github.com/imaya/zlib.js
+ // commit 4630e858caf90dbe9ca68ef44866eaf286cf7d8a
+ // file bin/deflate.min.js
+
+/** @license zlib.js 2012 - imaya [ https://github.com/imaya/zlib.js ] The MIT License */(function() {'use strict';var n=void 0,u=!0,aa=this;function ba(e,d){var c=e.split("."),f=aa;!(c[0]in f)&&f.execScript&&f.execScript("var "+c[0]);for(var a;c.length&&(a=c.shift());)!c.length&&d!==n?f[a]=d:f=f[a]?f[a]:f[a]={}};var C="undefined"!==typeof Uint8Array&&"undefined"!==typeof Uint16Array&&"undefined"!==typeof Uint32Array;function K(e,d){this.index="number"===typeof d?d:0;this.d=0;this.buffer=e instanceof(C?Uint8Array:Array)?e:new (C?Uint8Array:Array)(32768);if(2*this.buffer.length<=this.index)throw Error("invalid index");this.buffer.length<=this.index&&ca(this)}function ca(e){var d=e.buffer,c,f=d.length,a=new (C?Uint8Array:Array)(f<<1);if(C)a.set(d);else for(c=0;c>>8&255]<<16|L[e>>>16&255]<<8|L[e>>>24&255])>>32-d:L[e]>>8-d);if(8>d+b)k=k<>d-m-1&1,8===++b&&(b=0,f[a++]=L[k],k=0,a===f.length&&(f=ca(this)));f[a]=k;this.buffer=f;this.d=b;this.index=a};K.prototype.finish=function(){var e=this.buffer,d=this.index,c;0M;++M){for(var R=M,S=R,ha=7,R=R>>>1;R;R>>>=1)S<<=1,S|=R&1,--ha;ga[M]=(S<>>0}var L=ga;function ja(e){this.buffer=new (C?Uint16Array:Array)(2*e);this.length=0}ja.prototype.getParent=function(e){return 2*((e-2)/4|0)};ja.prototype.push=function(e,d){var c,f,a=this.buffer,b;c=this.length;a[this.length++]=d;for(a[this.length++]=e;0a[f])b=a[c],a[c]=a[f],a[f]=b,b=a[c+1],a[c+1]=a[f+1],a[f+1]=b,c=f;else break;return this.length};
+ja.prototype.pop=function(){var e,d,c=this.buffer,f,a,b;d=c[0];e=c[1];this.length-=2;c[0]=c[this.length];c[1]=c[this.length+1];for(b=0;;){a=2*b+2;if(a>=this.length)break;a+2c[a]&&(a+=2);if(c[a]>c[b])f=c[b],c[b]=c[a],c[a]=f,f=c[b+1],c[b+1]=c[a+1],c[a+1]=f;else break;b=a}return{index:e,value:d,length:this.length}};function ka(e,d){this.e=ma;this.f=0;this.input=C&&e instanceof Array?new Uint8Array(e):e;this.c=0;d&&(d.lazy&&(this.f=d.lazy),"number"===typeof d.compressionType&&(this.e=d.compressionType),d.outputBuffer&&(this.b=C&&d.outputBuffer instanceof Array?new Uint8Array(d.outputBuffer):d.outputBuffer),"number"===typeof d.outputIndex&&(this.c=d.outputIndex));this.b||(this.b=new (C?Uint8Array:Array)(32768))}var ma=2,T=[],U;
+for(U=0;288>U;U++)switch(u){case 143>=U:T.push([U+48,8]);break;case 255>=U:T.push([U-144+400,9]);break;case 279>=U:T.push([U-256+0,7]);break;case 287>=U:T.push([U-280+192,8]);break;default:throw"invalid literal: "+U;}
+ka.prototype.h=function(){var e,d,c,f,a=this.input;switch(this.e){case 0:c=0;for(f=a.length;c>>8&255;l[h++]=p&255;l[h++]=p>>>8&255;if(C)l.set(b,h),h+=b.length,l=l.subarray(0,h);else{v=0;for(x=b.length;vs)for(;0s?s:138,A>s-3&&A=A?(E[D++]=17,E[D++]=A-3,H[17]++):(E[D++]=18,E[D++]=A-11,H[18]++),s-=A;else if(E[D++]=F[r],H[F[r]]++,s--,3>s)for(;0s?s:6,A>s-3&&Ay;y++)ia[y]=ea[Ia[y]];for(P=19;4=a:return[265,a-11,1];case 14>=a:return[266,a-13,1];case 16>=a:return[267,a-15,1];case 18>=a:return[268,a-17,1];case 22>=a:return[269,a-19,2];case 26>=a:return[270,a-23,2];case 30>=a:return[271,a-27,2];case 34>=a:return[272,
+a-31,2];case 42>=a:return[273,a-35,3];case 50>=a:return[274,a-43,3];case 58>=a:return[275,a-51,3];case 66>=a:return[276,a-59,3];case 82>=a:return[277,a-67,4];case 98>=a:return[278,a-83,4];case 114>=a:return[279,a-99,4];case 130>=a:return[280,a-115,4];case 162>=a:return[281,a-131,5];case 194>=a:return[282,a-163,5];case 226>=a:return[283,a-195,5];case 257>=a:return[284,a-227,5];case 258===a:return[285,a-258,0];default:throw"invalid length: "+a;}}var d=[],c,f;for(c=3;258>=c;c++)f=e(c),d[c]=f[2]<<24|
+f[1]<<16|f[0];return d}(),Ga=C?new Uint32Array(Fa):Fa;
+function na(e,d){function c(a,c){var b=a.g,d=[],f=0,e;e=Ga[a.length];d[f++]=e&65535;d[f++]=e>>16&255;d[f++]=e>>24;var g;switch(u){case 1===b:g=[0,b-1,0];break;case 2===b:g=[1,b-2,0];break;case 3===b:g=[2,b-3,0];break;case 4===b:g=[3,b-4,0];break;case 6>=b:g=[4,b-5,1];break;case 8>=b:g=[5,b-7,1];break;case 12>=b:g=[6,b-9,2];break;case 16>=b:g=[7,b-13,2];break;case 24>=b:g=[8,b-17,3];break;case 32>=b:g=[9,b-25,3];break;case 48>=b:g=[10,b-33,4];break;case 64>=b:g=[11,b-49,4];break;case 96>=b:g=[12,b-
+65,5];break;case 128>=b:g=[13,b-97,5];break;case 192>=b:g=[14,b-129,6];break;case 256>=b:g=[15,b-193,6];break;case 384>=b:g=[16,b-257,7];break;case 512>=b:g=[17,b-385,7];break;case 768>=b:g=[18,b-513,8];break;case 1024>=b:g=[19,b-769,8];break;case 1536>=b:g=[20,b-1025,9];break;case 2048>=b:g=[21,b-1537,9];break;case 3072>=b:g=[22,b-2049,10];break;case 4096>=b:g=[23,b-3073,10];break;case 6144>=b:g=[24,b-4097,11];break;case 8192>=b:g=[25,b-6145,11];break;case 12288>=b:g=[26,b-8193,12];break;case 16384>=
+b:g=[27,b-12289,12];break;case 24576>=b:g=[28,b-16385,13];break;case 32768>=b:g=[29,b-24577,13];break;default:throw"invalid distance";}e=g;d[f++]=e[0];d[f++]=e[1];d[f++]=e[2];var k,m;k=0;for(m=d.length;k=b;)t[b++]=0;for(b=0;29>=b;)w[b++]=0}t[256]=1;f=0;for(a=d.length;f=a){x&&c(x,-1);b=0;for(k=a-f;bk&&d+kb&&(a=f,b=k);if(258===k)break}return new qa(b,d-a)}
+function oa(e,d){var c=e.length,f=new ja(572),a=new (C?Uint8Array:Array)(c),b,k,m,g,p;if(!C)for(g=0;g2*a[h-1]+b[h]&&(a[h]=2*a[h-1]+b[h]),m[h]=Array(a[h]),g[h]=Array(a[h]);for(l=0;le[l]?(m[h][q]=t,g[h][q]=d,w+=2):(m[h][q]=e[l],g[h][q]=l,++l);p[h]=0;1===b[h]&&f(h)}return k}
+function pa(e){var d=new (C?Uint16Array:Array)(e.length),c=[],f=[],a=0,b,k,m,g;b=0;for(k=e.length;b>>=1}return d};ba("Zlib.RawDeflate",ka);ba("Zlib.RawDeflate.prototype.compress",ka.prototype.h);var Ka={NONE:0,FIXED:1,DYNAMIC:ma},V,La,$,Ma;if(Object.keys)V=Object.keys(Ka);else for(La in V=[],$=0,Ka)V[$++]=La;$=0;for(Ma=V.length;$
- * Version: 1.0.0.1
- * LastModified: Dec 25 1999
- */
-
-/* Interface:
- * data = zip_inflate(src);
- */
-
-/* constant parameters */
-var zip_WSIZE = 32768; // Sliding Window size
-var zip_STORED_BLOCK = 0;
-var zip_STATIC_TREES = 1;
-var zip_DYN_TREES = 2;
-
-/* for inflate */
-var zip_lbits = 9; // bits in base literal/length lookup table
-var zip_dbits = 6; // bits in base distance lookup table
-var zip_INBUFSIZ = 32768; // Input buffer size
-var zip_INBUF_EXTRA = 64; // Extra buffer
-
-/* variables (inflate) */
-var zip_slide;
-var zip_wp; // current position in slide
-var zip_fixed_tl = null; // inflate static
-var zip_fixed_td; // inflate static
-var zip_fixed_bl, fixed_bd; // inflate static
-var zip_bit_buf; // bit buffer
-var zip_bit_len; // bits in bit buffer
-var zip_method;
-var zip_eof;
-var zip_copy_leng;
-var zip_copy_dist;
-var zip_tl, zip_td; // literal/length and distance decoder tables
-var zip_bl, zip_bd; // number of bits decoded by tl and td
-
-var zip_inflate_data;
-var zip_inflate_pos;
-
-
-/* constant tables (inflate) */
-var zip_MASK_BITS = new Array(
- 0x0000,
- 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
- 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff);
-// Tables for deflate from PKZIP's appnote.txt.
-var zip_cplens = new Array( // 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);
-/* note: see note #13 above about the 258 in this list. */
-var zip_cplext = new Array( // 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, 99, 99); // 99==invalid
-var zip_cpdist = new Array( // 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 zip_cpdext = new Array( // 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);
-var zip_border = new Array( // Order of the bit length code lengths
- 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15);
-/* objects (inflate) */
-
-function zip_HuftList() {
- this.next = null;
- this.list = null;
-}
-
-function zip_HuftNode() {
- this.e = 0; // number of extra bits or operation
- this.b = 0; // number of bits in this code or subcode
-
- // union
- this.n = 0; // literal, length base, or distance base
- this.t = null; // (zip_HuftNode) pointer to next level of table
-}
-
-function zip_HuftBuild(b, // code lengths in bits (all assumed <= BMAX)
- n, // number of codes (assumed <= N_MAX)
- 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
- mm // maximum lookup bits
- ) {
- this.BMAX = 16; // maximum bit length of any code
- this.N_MAX = 288; // maximum number of codes in any set
- this.status = 0; // 0: success, 1: incomplete table, 2: bad input
- this.root = null; // (zip_HuftList) starting table
- this.m = 0; // maximum lookup bits, returns actual
-
-/* Given a list of code lengths and a maximum table size, make a set of
- tables to decode that set of codes. Return zero on success, one if
- the given code set is incomplete (the tables are still built in this
- case), two if the input is invalid (all zero length codes or an
- oversubscribed set of lengths), and three if not enough memory.
- The code with value 256 is special, and the tables are constructed
- so that no bits beyond that code are fetched when that code is
- decoded. */
- {
- var a; // counter for codes of length k
- var c = new Array(this.BMAX+1); // bit length count table
- var el; // length of EOB code (value 256)
- 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 lx = new Array(this.BMAX+1); // stack of bits per table
- var p; // pointer into c[], b[], or v[]
- var pidx; // index of p
- var q; // (zip_HuftNode) points to current table
- var r = new zip_HuftNode(); // table entry for structure assignment
- var u = new Array(this.BMAX); // zip_HuftNode[BMAX][] table stack
- var v = new Array(this.N_MAX); // values in order of bit length
- var w;
- var x = new Array(this.BMAX+1);// bit offsets, then code stack
- var xp; // pointer into x or c
- var y; // number of dummy codes added
- var z; // number of entries in current table
- var o;
- var tail; // (zip_HuftList)
-
- tail = this.root = null;
- for(i = 0; i < c.length; i++)
- c[i] = 0;
- for(i = 0; i < lx.length; i++)
- lx[i] = 0;
- for(i = 0; i < u.length; i++)
- u[i] = null;
- for(i = 0; i < v.length; i++)
- v[i] = 0;
- for(i = 0; i < x.length; i++)
- x[i] = 0;
-
- // Generate counts for each bit length
- el = n > 256 ? b[256] : this.BMAX; // set length of EOB code, if any
- p = b; pidx = 0;
- i = n;
- do {
- c[p[pidx]]++; // assume all entries <= BMAX
- pidx++;
- } while(--i > 0);
- if(c[0] == n) { // null input--all zero length codes
- this.root = null;
- this.m = 0;
- this.status = 0;
- return;
- }
-
- // Find minimum and maximum length, bound *m by those
- for(j = 1; j <= this.BMAX; j++)
- if(c[j] != 0)
- break;
- k = j; // minimum code length
- if(mm < j)
- mm = j;
- for(i = this.BMAX; i != 0; i--)
- if(c[i] != 0)
- break;
- g = i; // maximum code length
- if(mm > i)
- mm = i;
-
- // Adjust last length count to fill out codes, if needed
- for(y = 1 << j; j < i; j++, y <<= 1)
- if((y -= c[j]) < 0) {
- this.status = 2; // bad input: more codes than bits
- this.m = mm;
- return;
- }
- if((y -= c[i]) < 0) {
- this.status = 2;
- this.m = mm;
- return;
- }
- c[i] += y;
-
- // Generate starting offsets into the value table for each length
- x[1] = j = 0;
- p = c;
- pidx = 1;
- xp = 2;
- while(--i > 0) // note that i == g from above
- x[xp++] = (j += p[pidx++]);
-
- // Make a table of values in order of bit lengths
- p = b; pidx = 0;
- i = 0;
- do {
- if((j = p[pidx++]) != 0)
- v[x[j]++] = i;
- } 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 = v; pidx = 0; // grab values in bit order
- h = -1; // no tables yet--level -1
- w = lx[0] = 0; // no bits decoded yet
- q = null; // 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[pidx]
- // make tables up to required level
- while(k > w + lx[1 + h]) {
- w += lx[1 + h]; // add bits already decoded
- h++;
-
- // compute minimum size table less than or equal to *m bits
- z = (z = g - w) > mm ? mm : z; // 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;
- 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
- }
- }
- if(w + j > el && w < el)
- j = el - w; // make EOB code end at table
- z = 1 << j; // table entries for j-bit table
- lx[1 + h] = j; // set table size in stack
-
- // allocate and link in new table
- q = new Array(z);
- for(o = 0; o < z; o++) {
- q[o] = new zip_HuftNode();
- }
-
- if(tail == null)
- tail = this.root = new zip_HuftList();
- else
- tail = tail.next = new zip_HuftList();
- tail.next = null;
- tail.list = q;
- u[h] = q; // table starts after link
-
- /* connect to last table, if there is one */
- if(h > 0) {
- x[h] = i; // save pattern for backing up
- r.b = lx[h]; // bits to dump before this table
- r.e = 16 + j; // bits in this table
- r.t = q; // pointer to this table
- j = (i & ((1 << w) - 1)) >> (w - lx[h]);
- u[h-1][j].e = r.e;
- u[h-1][j].b = r.b;
- u[h-1][j].n = r.n;
- u[h-1][j].t = r.t;
- }
- }
-
- // set up table entry in r
- r.b = k - w;
- if(pidx >= n)
- r.e = 99; // out of values--invalid code
- else if(p[pidx] < s) {
- r.e = (p[pidx] < 256 ? 16 : 15); // 256 is end-of-block code
- r.n = p[pidx++]; // simple code is just the value
- } else {
- r.e = e[p[pidx] - s]; // non-simple--look up in lists
- r.n = d[p[pidx++] - s];
- }
-
- // fill code-like entries with r //
- f = 1 << (k - w);
- for(j = i >> w; j < z; j += f) {
- q[j].e = r.e;
- q[j].b = r.b;
- q[j].n = r.n;
- q[j].t = r.t;
- }
-
- // 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
- while((i & ((1 << w) - 1)) != x[h]) {
- w -= lx[h]; // don't need to update q
- h--;
- }
- }
- }
-
- /* return actual size of base table */
- this.m = lx[1];
-
- /* Return true (1) if we were given an incomplete table */
- this.status = ((y != 0 && g != 1) ? 1 : 0);
- } /* end of constructor */
-}
-
-
-/* routines (inflate) */
-
-function zip_GET_BYTE() {
- if(zip_inflate_data.length == zip_inflate_pos)
- return -1;
- return zip_inflate_data.charCodeAt(zip_inflate_pos++) & 0xff;
-}
-
-function zip_NEEDBITS(n) {
- while(zip_bit_len < n) {
- zip_bit_buf |= zip_GET_BYTE() << zip_bit_len;
- zip_bit_len += 8;
- }
-}
-
-function zip_GETBITS(n) {
- return zip_bit_buf & zip_MASK_BITS[n];
-}
-
-function zip_DUMPBITS(n) {
- zip_bit_buf >>= n;
- zip_bit_len -= n;
-}
-
-function zip_inflate_codes(buff, off, size) {
- /* inflate (decompress) the codes in a deflated (compressed) block.
- Return an error code or zero if it all goes ok. */
- var e; // table entry flag/number of extra bits
- var t; // (zip_HuftNode) pointer to table entry
- var n;
-
- if(size == 0)
- return 0;
-
- // inflate the coded data
- n = 0;
- for(;;) { // do until end of block
- zip_NEEDBITS(zip_bl);
- t = zip_tl.list[zip_GETBITS(zip_bl)];
- e = t.e;
- while(e > 16) {
- if(e == 99)
- return -1;
- zip_DUMPBITS(t.b);
- e -= 16;
- zip_NEEDBITS(e);
- t = t.t[zip_GETBITS(e)];
- e = t.e;
- }
- zip_DUMPBITS(t.b);
-
- if(e == 16) { // then it's a literal
- zip_wp &= zip_WSIZE - 1;
- buff[off + n++] = zip_slide[zip_wp++] = t.n;
- if(n == size)
- return size;
- continue;
- }
-
- // exit if end of block
- if(e == 15)
- break;
-
- // it's an EOB or a length
-
- // get length of block to copy
- zip_NEEDBITS(e);
- zip_copy_leng = t.n + zip_GETBITS(e);
- zip_DUMPBITS(e);
-
- // decode distance of block to copy
- zip_NEEDBITS(zip_bd);
- t = zip_td.list[zip_GETBITS(zip_bd)];
- e = t.e;
-
- while(e > 16) {
- if(e == 99)
- return -1;
- zip_DUMPBITS(t.b);
- e -= 16;
- zip_NEEDBITS(e);
- t = t.t[zip_GETBITS(e)];
- e = t.e;
- }
- zip_DUMPBITS(t.b);
- zip_NEEDBITS(e);
- zip_copy_dist = zip_wp - t.n - zip_GETBITS(e);
- zip_DUMPBITS(e);
-
- // do the copy
- while(zip_copy_leng > 0 && n < size) {
- zip_copy_leng--;
- zip_copy_dist &= zip_WSIZE - 1;
- zip_wp &= zip_WSIZE - 1;
- buff[off + n++] = zip_slide[zip_wp++]
- = zip_slide[zip_copy_dist++];
- }
-
- if(n == size)
- return size;
- }
-
- zip_method = -1; // done
- return n;
-}
-
-function zip_inflate_stored(buff, off, size) {
- /* "decompress" an inflated type 0 (stored) block. */
- var n;
-
- // go to byte boundary
- n = zip_bit_len & 7;
- zip_DUMPBITS(n);
-
- // get the length and its complement
- zip_NEEDBITS(16);
- n = zip_GETBITS(16);
- zip_DUMPBITS(16);
- zip_NEEDBITS(16);
- if(n != ((~zip_bit_buf) & 0xffff))
- return -1; // error in compressed data
- zip_DUMPBITS(16);
-
- // read and output the compressed data
- zip_copy_leng = n;
-
- n = 0;
- while(zip_copy_leng > 0 && n < size) {
- zip_copy_leng--;
- zip_wp &= zip_WSIZE - 1;
- zip_NEEDBITS(8);
- buff[off + n++] = zip_slide[zip_wp++] =
- zip_GETBITS(8);
- zip_DUMPBITS(8);
- }
-
- if(zip_copy_leng == 0)
- zip_method = -1; // done
- return n;
-}
-
-function zip_inflate_fixed(buff, off, size) {
- /* decompress an inflated type 1 (fixed Huffman codes) block. We should
- either replace this with a custom decoder, or at least precompute the
- Huffman tables. */
-
- // if first time, set up tables for fixed blocks
- if(zip_fixed_tl == null) {
- var i; // temporary variable
- var l = new Array(288); // length list for huft_build
- var h; // zip_HuftBuild
-
- // literal table
- for(i = 0; i < 144; i++)
- l[i] = 8;
- for(; i < 256; i++)
- l[i] = 9;
- for(; i < 280; i++)
- l[i] = 7;
- for(; i < 288; i++) // make a complete, but wrong code set
- l[i] = 8;
- zip_fixed_bl = 7;
-
- h = new zip_HuftBuild(l, 288, 257, zip_cplens, zip_cplext,
- zip_fixed_bl);
- if(h.status != 0) {
- alert("HufBuild error: "+h.status);
- return -1;
- }
- zip_fixed_tl = h.root;
- zip_fixed_bl = h.m;
-
- // distance table
- for(i = 0; i < 30; i++) // make an incomplete code set
- l[i] = 5;
- zip_fixed_bd = 5;
-
- h = new zip_HuftBuild(l, 30, 0, zip_cpdist, zip_cpdext, zip_fixed_bd);
- if(h.status > 1) {
- zip_fixed_tl = null;
- alert("HufBuild error: "+h.status);
- return -1;
- }
- zip_fixed_td = h.root;
- zip_fixed_bd = h.m;
- }
-
- zip_tl = zip_fixed_tl;
- zip_td = zip_fixed_td;
- zip_bl = zip_fixed_bl;
- zip_bd = zip_fixed_bd;
- return zip_inflate_codes(buff, off, size);
-}
-
-function zip_inflate_dynamic(buff, off, size) {
- // decompress an inflated type 2 (dynamic Huffman codes) block.
- var i; // temporary variables
- var j;
- var l; // last length
- var n; // number of lengths to get
- var t; // (zip_HuftNode) literal/length code table
- var nb; // number of bit length codes
- var nl; // number of literal/length codes
- var nd; // number of distance codes
- var ll = new Array(286+30); // literal/length and distance code lengths
- var h; // (zip_HuftBuild)
-
- for(i = 0; i < ll.length; i++)
- ll[i] = 0;
-
- // read in table lengths
- zip_NEEDBITS(5);
- nl = 257 + zip_GETBITS(5); // number of literal/length codes
- zip_DUMPBITS(5);
- zip_NEEDBITS(5);
- nd = 1 + zip_GETBITS(5); // number of distance codes
- zip_DUMPBITS(5);
- zip_NEEDBITS(4);
- nb = 4 + zip_GETBITS(4); // number of bit length codes
- zip_DUMPBITS(4);
- if(nl > 286 || nd > 30)
- return -1; // bad lengths
-
- // read in bit-length-code lengths
- for(j = 0; j < nb; j++)
- {
- zip_NEEDBITS(3);
- ll[zip_border[j]] = zip_GETBITS(3);
- zip_DUMPBITS(3);
- }
- for(; j < 19; j++)
- ll[zip_border[j]] = 0;
-
- // build decoding table for trees--single level, 7 bit lookup
- zip_bl = 7;
- h = new zip_HuftBuild(ll, 19, 19, null, null, zip_bl);
- if(h.status != 0)
- return -1; // incomplete code set
-
- zip_tl = h.root;
- zip_bl = h.m;
-
- // read in literal and distance code lengths
- n = nl + nd;
- i = l = 0;
- while(i < n) {
- zip_NEEDBITS(zip_bl);
- t = zip_tl.list[zip_GETBITS(zip_bl)];
- j = t.b;
- zip_DUMPBITS(j);
- j = t.n;
- if(j < 16) // length of code in bits (0..15)
- ll[i++] = l = j; // save last length in l
- else if(j == 16) { // repeat last length 3 to 6 times
- zip_NEEDBITS(2);
- j = 3 + zip_GETBITS(2);
- zip_DUMPBITS(2);
- if(i + j > n)
- return -1;
- while(j-- > 0)
- ll[i++] = l;
- } else if(j == 17) { // 3 to 10 zero length codes
- zip_NEEDBITS(3);
- j = 3 + zip_GETBITS(3);
- zip_DUMPBITS(3);
- if(i + j > n)
- return -1;
- while(j-- > 0)
- ll[i++] = 0;
- l = 0;
- } else { // j == 18: 11 to 138 zero length codes
- zip_NEEDBITS(7);
- j = 11 + zip_GETBITS(7);
- zip_DUMPBITS(7);
- if(i + j > n)
- return -1;
- while(j-- > 0)
- ll[i++] = 0;
- l = 0;
- }
- }
-
- // build the decoding tables for literal/length and distance codes
- zip_bl = zip_lbits;
- h = new zip_HuftBuild(ll, nl, 257, zip_cplens, zip_cplext, zip_bl);
- if(zip_bl == 0) // no literals or lengths
- h.status = 1;
- if(h.status != 0) {
- if(h.status == 1)
- ;// **incomplete literal tree**
- return -1; // incomplete code set
- }
- zip_tl = h.root;
- zip_bl = h.m;
-
- for(i = 0; i < nd; i++)
- ll[i] = ll[i + nl];
- zip_bd = zip_dbits;
- h = new zip_HuftBuild(ll, nd, 0, zip_cpdist, zip_cpdext, zip_bd);
- zip_td = h.root;
- zip_bd = h.m;
-
- if(zip_bd == 0 && nl > 257) { // lengths but no distances
- // **incomplete distance tree**
- return -1;
- }
-
- if(h.status == 1) {
- ;// **incomplete distance tree**
- }
- if(h.status != 0)
- return -1;
-
- // decompress until an end-of-block code
- return zip_inflate_codes(buff, off, size);
-}
-
-function zip_inflate_start() {
- var i;
-
- if(zip_slide == null)
- zip_slide = new Array(2 * zip_WSIZE);
- zip_wp = 0;
- zip_bit_buf = 0;
- zip_bit_len = 0;
- zip_method = -1;
- zip_eof = false;
- zip_copy_leng = zip_copy_dist = 0;
- zip_tl = null;
-}
-
-function zip_inflate_internal(buff, off, size) {
- // decompress an inflated entry
- var n, i;
-
- n = 0;
- while(n < size) {
- if(zip_eof && zip_method == -1)
- return n;
-
- if(zip_copy_leng > 0) {
- if(zip_method != zip_STORED_BLOCK) {
- // STATIC_TREES or DYN_TREES
- while(zip_copy_leng > 0 && n < size) {
- zip_copy_leng--;
- zip_copy_dist &= zip_WSIZE - 1;
- zip_wp &= zip_WSIZE - 1;
- buff[off + n++] = zip_slide[zip_wp++] =
- zip_slide[zip_copy_dist++];
- }
- } else {
- while(zip_copy_leng > 0 && n < size) {
- zip_copy_leng--;
- zip_wp &= zip_WSIZE - 1;
- zip_NEEDBITS(8);
- buff[off + n++] = zip_slide[zip_wp++] = zip_GETBITS(8);
- zip_DUMPBITS(8);
- }
- if(zip_copy_leng == 0)
- zip_method = -1; // done
- }
- if(n == size)
- return n;
- }
-
- if(zip_method == -1) {
- if(zip_eof)
- break;
-
- // read in last block bit
- zip_NEEDBITS(1);
- if(zip_GETBITS(1) != 0)
- zip_eof = true;
- zip_DUMPBITS(1);
-
- // read in block type
- zip_NEEDBITS(2);
- zip_method = zip_GETBITS(2);
- zip_DUMPBITS(2);
- zip_tl = null;
- zip_copy_leng = 0;
- }
-
- switch(zip_method) {
- case 0: // zip_STORED_BLOCK
- i = zip_inflate_stored(buff, off + n, size - n);
- break;
-
- case 1: // zip_STATIC_TREES
- if(zip_tl != null)
- i = zip_inflate_codes(buff, off + n, size - n);
- else
- i = zip_inflate_fixed(buff, off + n, size - n);
- break;
-
- case 2: // zip_DYN_TREES
- if(zip_tl != null)
- i = zip_inflate_codes(buff, off + n, size - n);
- else
- i = zip_inflate_dynamic(buff, off + n, size - n);
- break;
-
- default: // error
- i = -1;
- break;
- }
-
- if(i == -1) {
- if(zip_eof)
- return 0;
- return -1;
- }
- n += i;
- }
- return n;
-}
-
-function zip_inflate(str) {
- var out, buff;
- var i, j;
-
- zip_inflate_start();
- zip_inflate_data = str;
- zip_inflate_pos = 0;
-
- buff = new Array(1024);
- out = "";
- while((i = zip_inflate_internal(buff, 0, buff.length)) > 0) {
- for(j = 0; j < i; j++)
- out += String.fromCharCode(buff[j]);
- }
- zip_inflate_data = null; // G.C.
- return out;
-}
-
-//
-// end of the script of Masanao Izumo.
-//
-
-// we add the compression method for JSZip
-if(!JSZip.compressions["DEFLATE"]) {
- JSZip.compressions["DEFLATE"] = {
- magic : "\x08\x00",
- uncompress : zip_inflate,
- uncompressInputType : "string"
+(function () {
+ if(!JSZip) {
+ throw "JSZip not defined";
+ }
+ var context = {};
+ (function () {
+
+ // https://github.com/imaya/zlib.js
+ // commit 4630e858caf90dbe9ca68ef44866eaf286cf7d8a
+ // file bin/deflate.min.js
+
+/** @license zlib.js 2012 - imaya [ https://github.com/imaya/zlib.js ] The MIT License */(function() {'use strict';var l=void 0,p=this;function q(c,d){var a=c.split("."),b=p;!(a[0]in b)&&b.execScript&&b.execScript("var "+a[0]);for(var e;a.length&&(e=a.shift());)!a.length&&d!==l?b[e]=d:b=b[e]?b[e]:b[e]={}};var r="undefined"!==typeof Uint8Array&&"undefined"!==typeof Uint16Array&&"undefined"!==typeof Uint32Array;function u(c){var d=c.length,a=0,b=Number.POSITIVE_INFINITY,e,f,g,h,k,m,s,n,t;for(n=0;na&&(a=c[n]),c[n]>=1;for(t=m;t>>=1;switch(c){case 0:var d=this.input,a=this.d,b=this.b,e=this.a,f=l,g=l,h=l,k=b.length,m=l;this.c=this.f=0;f=d[a++];if(f===l)throw Error("invalid uncompressed block header: LEN (first byte)");g=f;f=d[a++];if(f===l)throw Error("invalid uncompressed block header: LEN (second byte)");g|=f<<8;f=d[a++];if(f===l)throw Error("invalid uncompressed block header: NLEN (first byte)");h=f;f=d[a++];if(f===l)throw Error("invalid uncompressed block header: NLEN (second byte)");h|=
+f<<8;if(g===~h)throw Error("invalid uncompressed block header: length verify");if(a+g>d.length)throw Error("input buffer is broken");switch(this.i){case x:for(;e+g>b.length;){m=k-e;g-=m;if(r)b.set(d.subarray(a,a+m),e),e+=m,a+=m;else for(;m--;)b[e++]=d[a++];this.a=e;b=this.e();e=this.a}break;case w:for(;e+g>b.length;)b=this.e({o:2});break;default:throw Error("invalid inflate mode");}if(r)b.set(d.subarray(a,a+g),e),e+=g,a+=g;else for(;g--;)b[e++]=d[a++];this.d=a;this.a=e;this.b=b;break;case 1:this.j(z,
+A);break;case 2:B(this);break;default:throw Error("unknown BTYPE: "+c);}}return this.m()};
+var C=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15],D=r?new Uint16Array(C):C,E=[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,258,258],F=r?new Uint16Array(E):E,G=[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,0,0],H=r?new Uint8Array(G):G,I=[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],J=r?new Uint16Array(I):I,K=[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],L=r?new Uint8Array(K):K,M=new (r?Uint8Array:Array)(288),N,O;N=0;for(O=M.length;N=N?8:255>=N?9:279>=N?7:8;var z=u(M),P=new (r?Uint8Array:Array)(30),Q,R;Q=0;for(R=P.length;Q>>d;c.c=b-d;c.d=f;return g}
+function S(c,d){for(var a=c.f,b=c.c,e=c.input,f=c.d,g=d[0],h=d[1],k,m,s;b>>16;c.f=a>>s;c.c=b-s;c.d=f;return m&65535}
+function B(c){function d(a,c,b){var d,f,e,g;for(g=0;gf)b>=e&&(this.a=b,a=this.e(),b=this.a),a[b++]=f;else{g=f-257;k=F[g];0=e&&(this.a=b,a=this.e(),b=this.a);for(;k--;)a[b]=a[b++-h]}for(;8<=this.c;)this.c-=8,this.d--;this.a=b};
+v.prototype.s=function(c,d){var a=this.b,b=this.a;this.n=c;for(var e=a.length,f,g,h,k;256!==(f=S(this,c));)if(256>f)b>=e&&(a=this.e(),e=a.length),a[b++]=f;else{g=f-257;k=F[g];0e&&(a=this.e(),e=a.length);for(;k--;)a[b]=a[b++-h]}for(;8<=this.c;)this.c-=8,this.d--;this.a=b};
+v.prototype.e=function(){var c=new (r?Uint8Array:Array)(this.a-32768),d=this.a-32768,a,b,e=this.b;if(r)c.set(e.subarray(32768,c.length));else{a=0;for(b=c.length;aa;++a)e[a]=e[d+a];this.a=32768;return e};
+v.prototype.u=function(c){var d,a=this.input.length/this.d+1|0,b,e,f,g=this.input,h=this.b;c&&("number"===typeof c.o&&(a=c.o),"number"===typeof c.q&&(a+=c.q));2>a?(b=(g.length-this.d)/this.n[2],f=258*(b/2)|0,e=fd&&(this.b.length=d),c=this.b);return this.buffer=c};q("Zlib.RawInflate",v);q("Zlib.RawInflate.prototype.decompress",v.prototype.t);var T={ADAPTIVE:w,BLOCK:x},U,V,W,X;if(Object.keys)U=Object.keys(T);else for(V in U=[],W=0,T)U[W++]=V;W=0;for(X=U.length;W
Date: Thu, 9 May 2013 23:30:27 +0200
Subject: [PATCH 3/9] Update documentation
Add the optimizedBinaryString option and hints about performances.
---
index.html | 33 +++++++++++++++++++++++++--------
1 file changed, 25 insertions(+), 8 deletions(-)
diff --git a/index.html b/index.html
index 71b04dd1..4434b236 100644
--- a/index.html
+++ b/index.html
@@ -357,7 +357,7 @@ file(name, data [,options])
date
(Date) use it to specify the last modification date.
If not set the current date is used.
compression
(String), default null. If set, specifies the file compression method to use. If not, the default file compression is used, cf generate(options).
- optimizedBinaryString
(boolean), default false. Set it to true if (and only if) the input
+ optimizedBinaryString
(boolean), default false. Set it to true if (and only if) the input is a string and
has already been prepared with a 0xFF mask.
@@ -489,6 +489,8 @@
load(data, options)
base64
(boolean) true
if the data is base64 encoded, false
for binary. Default : false
.
checkCRC32
(boolean) true
if the read data should be checked against its CRC32. Default : false
.
+ optimizedBinaryString
(boolean), default false. Set it to true if (and only if) the input is a string and
+ has already been prepared with a 0xFF mask.
Returns :
@@ -548,11 +550,13 @@
JSZip.support
Loading zip files, limitations
+
Not supported features
All the features of zip files are not supported.
Classic zip files will work but encrypted zip, multi-volume, etc are not supported
and the load() method will throw an Error
.
+
ZIP64 and 32bit integers
ZIP64 files can be loaded, but only if the zip file is not "too big". ZIP64 uses 64bits integers
but Javascript represents all numbers as
@@ -564,17 +568,30 @@
Loading zip files, limitations
So if all the 64bits integers can fit into 32 bits integers, everything will be fine. If
it's not the case, you will have other problems anyway (see next limitation).
+
Performance issues
An other limitation comes from the browser (and the machine running the browser).
- A compressed zip file of 10M is common and easily opened by desktop application,
- but not in a browser. The processing of such a beast is likely to be painful :
- the browser will eat hundreds of megabytes while using CPU like never.
- If you use an old browser, things will be worse. For example, IE6 and IE7 are
- quite slow to to execute the unit tests, and they completely freeze as soon as
- they try to handle larger files.
- Conclusion : reading small files is OK, reading others is not.
+ A compressed zip file of 10MB is "easily" opened by firefox/chrome/opera/IE10 but
+ will crash older IE. Also keep in mind that strings in javascript are encoded in UTF-16 :
+ a 10MB ascii text file will take 20MB of memory.
+ If you're having performance issues, please consider the following :
+
+ - Don't use IE < 10. Everything is better with WebGL support.
+ -
+ If you load the file from an ajax call, ask your XHR an ArrayBuffer.
+ Loading a string is asking for troubles.
+
+ -
+ If you want to get the content of an ASCII file as a string, consider using
+
asBinary()
instead of asText()
. The transformation
+ "binary string" -> "utf string" is a consuming process.
+
+
+
+
The output zip will differ from the input zip
+
Reading and generating a zip file won't give you back the same file.
Some data are discarded (file metadata) and other are added (subfolders).
From 6c7595530dbee6b3fa9d5c8304468ae41be71875 Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Sat, 11 May 2013 10:37:39 +0200
Subject: [PATCH 4/9] Tests : better display of unexpected errors.
---
test/test.js | 8 +++++---
1 file changed, 5 insertions(+), 3 deletions(-)
diff --git a/test/test.js b/test/test.js
index 07c6eb08..64972966 100644
--- a/test/test.js
+++ b/test/test.js
@@ -40,9 +40,11 @@ function testZipFile(testName, zipName, testFunction) {
start();
refZips[zipName] = file;
testFunction.call(this, file);
- }, function(errorMessage){
- start();
- ok(false, "Ajax error for " + zipName + " : " + this.status);
+ }, function(error){
+ if (QUnit.config.semaphore) {
+ start();
+ }
+ ok(false, error);
});
}
});
From 7f6387fea5d3724c246d5c4f738cb1db0691f4ce Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Sat, 11 May 2013 12:36:13 +0200
Subject: [PATCH 5/9] inflate/deflate : v0.1.6
---
jszip-deflate.js | 59 +++++++++++++++++++++++++-----------------------
jszip-inflate.js | 59 +++++++++++++++++++++++++-----------------------
2 files changed, 62 insertions(+), 56 deletions(-)
diff --git a/jszip-deflate.js b/jszip-deflate.js
index dc93ff42..e8ff0b4a 100644
--- a/jszip-deflate.js
+++ b/jszip-deflate.js
@@ -1,15 +1,15 @@
"use strict";
(function () {
- if(!JSZip) {
- throw "JSZip not defined";
- }
- var context = {};
- (function () {
+ if(!JSZip) {
+ throw "JSZip not defined";
+ }
+ var context = {};
+ (function () {
- // https://github.com/imaya/zlib.js
- // commit 4630e858caf90dbe9ca68ef44866eaf286cf7d8a
- // file bin/deflate.min.js
+ // https://github.com/imaya/zlib.js
+ // tag 0.1.6
+ // file bin/deflate.min.js
/** @license zlib.js 2012 - imaya [ https://github.com/imaya/zlib.js ] The MIT License */(function() {'use strict';var n=void 0,u=!0,aa=this;function ba(e,d){var c=e.split("."),f=aa;!(c[0]in f)&&f.execScript&&f.execScript("var "+c[0]);for(var a;c.length&&(a=c.shift());)!c.length&&d!==n?f[a]=d:f=f[a]?f[a]:f[a]={}};var C="undefined"!==typeof Uint8Array&&"undefined"!==typeof Uint16Array&&"undefined"!==typeof Uint32Array;function K(e,d){this.index="number"===typeof d?d:0;this.d=0;this.buffer=e instanceof(C?Uint8Array:Array)?e:new (C?Uint8Array:Array)(32768);if(2*this.buffer.length<=this.index)throw Error("invalid index");this.buffer.length<=this.index&&ca(this)}function ca(e){var d=e.buffer,c,f=d.length,a=new (C?Uint8Array:Array)(f<<1);if(C)a.set(d);else for(c=0;c>>8&255]<<16|L[e>>>16&255]<<8|L[e>>>24&255])>>32-d:L[e]>>8-d);if(8>d+b)k=k<>d-m-1&1,8===++b&&(b=0,f[a++]=L[k],k=0,a===f.length&&(f=ca(this)));f[a]=k;this.buffer=f;this.d=b;this.index=a};K.prototype.finish=function(){var e=this.buffer,d=this.index,c;0>>=1}return d};ba("Zlib.RawDeflate",ka);ba("Zlib.RawDeflate.prototype.compress",ka.prototype.h);var Ka={NONE:0,FIXED:1,DYNAMIC:ma},V,La,$,Ma;if(Object.keys)V=Object.keys(Ka);else for(La in V=[],$=0,Ka)V[$++]=La;$=0;for(Ma=V.length;$a&&(a=c[n]),c[n]>=1;for(t=m;td&&(this.b.length=d),c=this.b);return this.buffer=c};q("Zlib.RawInflate",v);q("Zlib.RawInflate.prototype.decompress",v.prototype.t);var T={ADAPTIVE:w,BLOCK:x},U,V,W,X;if(Object.keys)U=Object.keys(T);else for(V in U=[],W=0,T)U[W++]=V;W=0;for(X=U.length;W
Date: Sat, 11 May 2013 12:24:45 +0200
Subject: [PATCH 6/9] optimize memory consumption instead of cpu consumption
str += 'char' is faster than array.push && array.join but the difference
is not big.
String are immutable so the concatenation will create n(n-1)/2 objects,
so a memory consumption in O(n^2). The array join is in O(n).
When working with large files (hundreds of Mb), O(n^2) is clearly not a
good idea.
Also, use TextDecoder if available to boost perfs.
---
jszip.js | 107 +++++++++++++++++++++++++++++++++++--------------------
1 file changed, 69 insertions(+), 38 deletions(-)
diff --git a/jszip.js b/jszip.js
index 05478e2f..cdd74a68 100644
--- a/jszip.js
+++ b/jszip.js
@@ -66,24 +66,32 @@ JSZip.prototype = (function () {
* @param {function} filter a function String -> String, applied if not null on the result.
* @return {String} the string representing this._data.
*/
- var dataToString = function (filter) {
+ var dataToString = function (asUTF8) {
var result = this._data;
if (result === null || typeof result === "undefined") {
return "";
}
if (result instanceof JSZip.CompressedObject) {
- result = JSZip.utils.transformTo("string", result.getContent());
- this._data = result;
+ result = result.getContent();
this.options.binary = true;
this.options.base64 = false;
- } else {
- result = JSZip.utils.transformTo("string", result);
+ this._data = result;
}
+ // if the data is a base64 string, we decode it before checking the encoding !
if (this.options.base64) {
result = JSZip.base64.decode(result);
}
- if (filter) {
- result = filter(result);
+ if (asUTF8 && this.options.binary) {
+ // JSZip.prototype.utf8decode supports arrays as input
+ // skip to array => string step, utf8decode will do it.
+ result = JSZip.prototype.utf8decode(result);
+ } else {
+ // no utf8 transformation, do the array => string step.
+ result = JSZip.utils.transformTo("string", result);
+ }
+
+ if (!asUTF8 && !this.options.binary) {
+ result = JSZip.prototype.utf8encode(result);
}
return result;
};
@@ -106,14 +114,14 @@ JSZip.prototype = (function () {
* @return {string} the UTF8 string.
*/
asText : function () {
- return dataToString.call(this, this.options.binary ? JSZip.prototype.utf8decode : null);
+ return dataToString.call(this, true);
},
/**
* Returns the binary content.
* @return {string} the content as binary.
*/
asBinary : function () {
- return dataToString.call(this, !this.options.binary ? JSZip.prototype.utf8encode : null);
+ return dataToString.call(this, false);
},
/**
* Returns the content as an Uint8Array.
@@ -236,7 +244,7 @@ JSZip.prototype = (function () {
// special case : it's way easier to work with Uint8Array than with ArrayBuffer
if (dataType === "arraybuffer") {
- data = new Uint8Array(data);
+ data = JSZip.utils.transformTo("uint8array", data);
}
}
@@ -802,57 +810,65 @@ JSZip.prototype = (function () {
* http://www.webtoolkit.info/javascript-utf8.html
*/
utf8encode : function (string) {
- var utftext = "";
+ var result = [];
for (var n = 0; n < string.length; n++) {
var c = string.charCodeAt(n);
if (c < 128) {
- utftext += String.fromCharCode(c);
+ result.push(String.fromCharCode(c));
} else if ((c > 127) && (c < 2048)) {
- utftext += String.fromCharCode((c >> 6) | 192);
- utftext += String.fromCharCode((c & 63) | 128);
+ result.push(String.fromCharCode((c >> 6) | 192));
+ result.push(String.fromCharCode((c & 63) | 128));
} else {
- utftext += String.fromCharCode((c >> 12) | 224);
- utftext += String.fromCharCode(((c >> 6) & 63) | 128);
- utftext += String.fromCharCode((c & 63) | 128);
+ result.push(String.fromCharCode((c >> 12) | 224));
+ result.push(String.fromCharCode(((c >> 6) & 63) | 128));
+ result.push(String.fromCharCode((c & 63) | 128));
}
}
- return utftext;
+ return result.join("");
},
/**
* http://www.webtoolkit.info/javascript-utf8.html
*/
- utf8decode : function (utftext) {
- var string = "";
+ utf8decode : function (input) {
+ var result = [];
+ var type = JSZip.utils.getTypeOf(input);
+ var isArray = type !== "string";
var i = 0;
var c = 0, c1 = 0, c2 = 0, c3 = 0;
- while ( i < utftext.length ) {
+ // check if we can use the TextDecoder API
+ // see http://encoding.spec.whatwg.org/#api
+ if (JSZip.support.uint8array && type === 'uint8array' && typeof TextDecoder === "function") {
+ return TextDecoder("utf-8").decode(input);
+ }
+
+ while ( i < input.length ) {
- c = utftext.charCodeAt(i);
+ c = isArray ? input[i] : input.charCodeAt(i);
if (c < 128) {
- string += String.fromCharCode(c);
+ result.push(String.fromCharCode(c));
i++;
} else if ((c > 191) && (c < 224)) {
- c2 = utftext.charCodeAt(i+1);
- string += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
+ c2 = isArray ? input[i+1] : input.charCodeAt(i+1);
+ result.push(String.fromCharCode(((c & 31) << 6) | (c2 & 63)));
i += 2;
} else {
- c2 = utftext.charCodeAt(i+1);
- c3 = utftext.charCodeAt(i+2);
- string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
+ c2 = isArray ? input[i+1] : input.charCodeAt(i+1);
+ c3 = isArray ? input[i+2] : input.charCodeAt(i+2);
+ result.push(String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)));
i += 3;
}
}
- return string;
+ return result.join("");
}
};
}());
@@ -1029,16 +1045,31 @@ JSZip.support = {
* @return {String} the result.
*/
function arrayLikeToString(array) {
- var result = "";
- for(var i = 0; i < array.length; i++) {
- // yup, String.fromCharCode.apply(null, array); is waaaaaay faster
- // see http://jsperf.com/converting-a-uint8array-to-a-string/2
- // but... the stack is limited !
- // maybe http://jsperf.com/arraybuffer-to-string-apply-performance/2 ?
- result += String.fromCharCode(array[i]);
+ // Performances notes :
+ // --------------------
+ // String.fromCharCode.apply(null, array) is the fastest, see
+ // see http://jsperf.com/converting-a-uint8array-to-a-string/2
+ // but the stack is limited (and we can get huge arrays !).
+ //
+ // result += String.fromCharCode(array[i]); generate too many strings !
+ //
+ // This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2
+ var chunk = 65536;
+ var result = [], len = array.length, type = JSZip.utils.getTypeOf(array), k = 0;
+
+ while (k < len && chunk > 1) {
+ try {
+ if (type === "array") {
+ result.push(String.fromCharCode.apply(null, array.slice(k, Math.max(k + chunk, len))));
+ } else {
+ result.push(String.fromCharCode.apply(null, array.subarray(k, k + chunk)));
+ }
+ k += chunk;
+ } catch (e) {
+ chunk = Math.floor(chunk / 2);
+ }
}
-
- return result;
+ return result.join("");
};
/**
From 54dcb7e3bc87877b5bc8fe8cf645da75af2f5fe6 Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Fri, 17 May 2013 20:50:28 +0200
Subject: [PATCH 7/9] remove an old file
---
test/crcPerf.html | 89 -----------------------------------------------
1 file changed, 89 deletions(-)
delete mode 100644 test/crcPerf.html
diff --git a/test/crcPerf.html b/test/crcPerf.html
deleted file mode 100644
index 65091b8a..00000000
--- a/test/crcPerf.html
+++ /dev/null
@@ -1,89 +0,0 @@
-
-
-
-
-CRC Performance Testing
-
-
-
-
-
-
-
-
-
-
-
-
- Please wait while tests complete
-
-
Original CRC Method Performance (10000 loops)
-
- ... Waiting ...
-
-
-
-
New CRC Method Performance (10000 loops)
-
- ... Waiting ...
-
-
-
-
-
-
From a98f7ab2d8f17d7feb1f75b8558a09ccd0d63b1a Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Sat, 25 May 2013 19:16:23 +0200
Subject: [PATCH 8/9] Avoid if possible strings manipulation.
Working with strings consumes a lot of resources. For example, the
transformation utf8 string -> binary string is faster with the path
utf8 string -> Uint8Array (via TextEncoder) -> binary string.
---
jszip-load.js | 3 +-
jszip.js | 99 ++++++++++++++++++++++++++++++++++-----------------
2 files changed, 68 insertions(+), 34 deletions(-)
diff --git a/jszip-load.js b/jszip-load.js
index 7173aeb0..fbebe8e2 100644
--- a/jszip-load.js
+++ b/jszip-load.js
@@ -632,7 +632,8 @@ Dual licenced under the MIT license or GPLv3. See LICENSE.markdown.
}
},
prepareReader : function (data) {
- if (JSZip.utils.getTypeOf(data) === "string") {
+ var type = JSZip.utils.getTypeOf(data);
+ if (type === "string" && !JSZip.support.uint8array) {
this.reader = new StringReader(data, this.loadOptions.optimizedBinaryString);
} else {
this.reader = new Uint8ArrayReader(JSZip.utils.transformTo("uint8array", data));
diff --git a/jszip.js b/jszip.js
index cdd74a68..821eccfb 100644
--- a/jszip.js
+++ b/jszip.js
@@ -61,22 +61,61 @@ JSZip.defaults = {
JSZip.prototype = (function () {
+ /**
+ * Returns the raw data of a ZipObject, decompress the content if necessary.
+ * @param {ZipObject} file the file to use.
+ * @return {String|ArrayBuffer|Uint8Array} the data.
+ */
+ var getRawData = function (file) {
+ if (file._data instanceof JSZip.CompressedObject) {
+ file._data = file._data.getContent();
+ file.options.binary = true;
+ file.options.base64 = false;
+
+ if (JSZip.utils.getTypeOf(file._data) === "uint8array") {
+ var copy = file._data;
+ // when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.
+ // if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).
+ file._data = new Uint8Array(copy.length);
+ // with an empty Uint8Array, Opera fails with a "Offset larger than array size"
+ if (copy.length !== 0) {
+ file._data.set(copy, 0);
+ }
+ }
+ }
+ return file._data;
+ };
+
+ /**
+ * Returns the data of a ZipObject in a binary form. If the content is an unicode string, encode it.
+ * @param {ZipObject} file the file to use.
+ * @return {String|ArrayBuffer|Uint8Array} the data.
+ */
+ var getBinaryData = function (file) {
+ var result = getRawData(file), type = JSZip.utils.getTypeOf(result);
+ if (type === "string") {
+ if (!file.options.binary) {
+ // unicode text !
+ // unicode string => binary string is a painful process, check if we can avoid it.
+ if (JSZip.support.uint8array && typeof TextEncoder === "function") {
+ return TextEncoder("utf-8").encode(result);
+ }
+ }
+ return file.asBinary();
+ }
+ return result;
+ }
+
/**
* Transform this._data into a string.
* @param {function} filter a function String -> String, applied if not null on the result.
* @return {String} the string representing this._data.
*/
var dataToString = function (asUTF8) {
- var result = this._data;
+ var result = getRawData(this);
if (result === null || typeof result === "undefined") {
return "";
}
- if (result instanceof JSZip.CompressedObject) {
- result = result.getContent();
- this.options.binary = true;
- this.options.base64 = false;
- this._data = result;
- }
// if the data is a base64 string, we decode it before checking the encoding !
if (this.options.base64) {
result = JSZip.base64.decode(result);
@@ -99,7 +138,7 @@ JSZip.prototype = (function () {
* A simple object representing a file in the zip file.
* @constructor
* @param {string} name the name of the file
- * @param {string} data the data
+ * @param {String|ArrayBuffer|Uint8Array} data the data
* @param {Object} options the options of the file
*/
var ZipObject = function (name, data, options) {
@@ -128,22 +167,7 @@ JSZip.prototype = (function () {
* @return {Uint8Array} the content as an Uint8Array.
*/
asUint8Array : function () {
- var result = this._data;
- if (result instanceof JSZip.CompressedObject) {
- result = JSZip.utils.transformTo("uint8array", result.getContent());
- // when reading an arraybuffer, the CompressedObject mechanism will keep it and subarray() a Uint8Array.
- // if we request a file in the same format, we might get the same Uint8Array or its ArrayBuffer (the original zip file).
- this._data = new Uint8Array(result.length);
- // with an empty Uint8Array, Opera fails with a "Offset larger than array size"
- if (result.length !== 0) {
- this._data.set(result, 0);
- }
- // new result !
- var result = this._data;
- }
- if (JSZip.utils.getTypeOf(this._data) === "string") {
- result = this.asBinary();
- }
+ var result = getBinaryData(this);
return JSZip.utils.transformTo("uint8array", result);
},
/**
@@ -312,7 +336,7 @@ JSZip.prototype = (function () {
}
} else {
// have uncompressed data
- content = JSZip.utils.getTypeOf(file._data) === "string" ? file.asBinary() : file._data;
+ content = getBinaryData(file);
if (!content || content.length === 0 || file.options.dir) {
compression = JSZip.compressions['STORE'];
content = "";
@@ -688,7 +712,7 @@ JSZip.prototype = (function () {
case "arraybuffer" :
return JSZip.utils.transformTo(options.type.toLowerCase(), zip);
case "blob" :
- return JSZip.utils.arrayBuffer2Blob(zip);
+ return JSZip.utils.arrayBuffer2Blob(JSZip.utils.transformTo("arraybuffer", zip));
// case "zip is a string"
case "base64" :
@@ -810,6 +834,13 @@ JSZip.prototype = (function () {
* http://www.webtoolkit.info/javascript-utf8.html
*/
utf8encode : function (string) {
+ // TextEncoder + Uint8Array to binary string is faster than checking every bytes.
+ // http://jsperf.com/utf8encode-vs-textencoder
+ if (JSZip.support.uint8array && typeof TextEncoder === "function") {
+ var u8 = TextEncoder("utf-8").encode(string);
+ return JSZip.utils.transformTo("string", u8);
+ }
+
var result = [];
for (var n = 0; n < string.length; n++) {
@@ -844,8 +875,10 @@ JSZip.prototype = (function () {
// check if we can use the TextDecoder API
// see http://encoding.spec.whatwg.org/#api
- if (JSZip.support.uint8array && type === 'uint8array' && typeof TextDecoder === "function") {
- return TextDecoder("utf-8").decode(input);
+ if (JSZip.support.uint8array && typeof TextDecoder === "function") {
+ return TextDecoder("utf-8").decode(
+ JSZip.utils.transformTo("uint8array", input)
+ );
}
while ( i < input.length ) {
@@ -980,7 +1013,7 @@ JSZip.support = {
},
/**
* Create a blob from the given ArrayBuffer.
- * @param {string} buffer the buffer to transform.
+ * @param {ArrayBuffer} buffer the buffer to transform.
* @return {Blob} the result.
* @throws {Error} an Error if the browser doesn't support the requested feature.
*/
@@ -1034,7 +1067,7 @@ JSZip.support = {
*/
function stringToArrayLike(str, array) {
for (var i = 0; i < str.length; ++i) {
- array[i] = str.charCodeAt(i);
+ array[i] = str.charCodeAt(i) & 0xFF;
}
return array;
};
@@ -1092,7 +1125,7 @@ JSZip.support = {
transform["string"] = {
"string" : identity,
"array" : function (input) {
- return stringToArrayLike(input, []);
+ return stringToArrayLike(input, new Array(input.length));
},
"arraybuffer" : function (input) {
return transform["string"]["uint8array"](input).buffer;
@@ -1120,7 +1153,7 @@ JSZip.support = {
return arrayLikeToString(new Uint8Array(input));
},
"array" : function (input) {
- return arrayLikeToArrayLike(new Uint8Array(input), []);
+ return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength));
},
"arraybuffer" : identity,
"uint8array" : function (input) {
@@ -1132,7 +1165,7 @@ JSZip.support = {
transform["uint8array"] = {
"string" : arrayLikeToString,
"array" : function (input) {
- return arrayLikeToArrayLike(input, []);
+ return arrayLikeToArrayLike(input, new Array(input.length));
},
"arraybuffer" : function (input) {
return input.buffer;
From 14217a0de3f31662ee99af820017592c627cd63e Mon Sep 17 00:00:00 2001
From: David Duponchel
Date: Sun, 30 Jun 2013 15:59:33 +0200
Subject: [PATCH 9/9] performances : small gains on chrome
See http://jsperf.com/array-direct-assignment-vs-push/31, direct
assignment is faster than push.
---
jszip.js | 27 +++++++++++++++------------
1 file changed, 15 insertions(+), 12 deletions(-)
diff --git a/jszip.js b/jszip.js
index 821eccfb..e902cd2f 100644
--- a/jszip.js
+++ b/jszip.js
@@ -834,28 +834,31 @@ JSZip.prototype = (function () {
* http://www.webtoolkit.info/javascript-utf8.html
*/
utf8encode : function (string) {
- // TextEncoder + Uint8Array to binary string is faster than checking every bytes.
+ // TextEncoder + Uint8Array to binary string is faster than checking every bytes on long strings.
// http://jsperf.com/utf8encode-vs-textencoder
+ // On short strings (file names for example), the TextEncoder API is (currently) slower.
if (JSZip.support.uint8array && typeof TextEncoder === "function") {
var u8 = TextEncoder("utf-8").encode(string);
return JSZip.utils.transformTo("string", u8);
}
- var result = [];
+ // array.join may be slower than string concatenation but generates less objects (less time spent garbage collecting).
+ // See also http://jsperf.com/array-direct-assignment-vs-push/31
+ var result = [], resIndex = 0;
for (var n = 0; n < string.length; n++) {
var c = string.charCodeAt(n);
if (c < 128) {
- result.push(String.fromCharCode(c));
+ result[resIndex++] = String.fromCharCode(c);
} else if ((c > 127) && (c < 2048)) {
- result.push(String.fromCharCode((c >> 6) | 192));
- result.push(String.fromCharCode((c & 63) | 128));
+ result[resIndex++] = String.fromCharCode((c >> 6) | 192);
+ result[resIndex++] = String.fromCharCode((c & 63) | 128);
} else {
- result.push(String.fromCharCode((c >> 12) | 224));
- result.push(String.fromCharCode(((c >> 6) & 63) | 128));
- result.push(String.fromCharCode((c & 63) | 128));
+ result[resIndex++] = String.fromCharCode((c >> 12) | 224);
+ result[resIndex++] = String.fromCharCode(((c >> 6) & 63) | 128);
+ result[resIndex++] = String.fromCharCode((c & 63) | 128);
}
}
@@ -867,7 +870,7 @@ JSZip.prototype = (function () {
* http://www.webtoolkit.info/javascript-utf8.html
*/
utf8decode : function (input) {
- var result = [];
+ var result = [], resIndex = 0;
var type = JSZip.utils.getTypeOf(input);
var isArray = type !== "string";
var i = 0;
@@ -886,16 +889,16 @@ JSZip.prototype = (function () {
c = isArray ? input[i] : input.charCodeAt(i);
if (c < 128) {
- result.push(String.fromCharCode(c));
+ result[resIndex++] = String.fromCharCode(c);
i++;
} else if ((c > 191) && (c < 224)) {
c2 = isArray ? input[i+1] : input.charCodeAt(i+1);
- result.push(String.fromCharCode(((c & 31) << 6) | (c2 & 63)));
+ result[resIndex++] = String.fromCharCode(((c & 31) << 6) | (c2 & 63));
i += 2;
} else {
c2 = isArray ? input[i+1] : input.charCodeAt(i+1);
c3 = isArray ? input[i+2] : input.charCodeAt(i+2);
- result.push(String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)));
+ result[resIndex++] = String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
i += 3;
}