OGS-Main
/
ogs-site
2
0
Rozštěpit 0
Zdrojový kód Úkoly 0 Požadavky na natažení 0 Vydání 0 Wiki Aktivita
Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.
127 Revize
2 Větve
123MB
Strom: df4388d88b
Větve Značky
${ item.name }
Vytvořit větev ${ searchTerm }
z „df4388d88b“
${ noResults }
ogs-site/zipbase64/ru/zipbase64_1.0.0+ru.html

7226 řádky
314KB
Surový Blame Historie 

  1. <!DOCTYPE html>

  2. <html>

  3.     <meta charset="utf-8">

  4.     <head>

  5.         <style>

  6.             #header

  7.             {

  8.                 background: #23d86b;

  9.                 padding: 0.7em;

  10.                 text-align: left;

  11.             }

  12.             #header a

  13.             {

  14.                 color: white;

  15.                 text-decoration: none;

  16.                 padding: 0.5em 1em 0.5em 1em;

  17.             }

  18.             #title

  19.             {

  20.                 color: #0f5d2e;

  21.             }

  22.             #footer

  23.             {

  24.                 text-align: center;

  25.             }

  26.             table

  27.             {

  28.                 width: 100%;

  29.             }

  30.             textarea

  31.             {

  32.                 width: 100%;

  33.                 height: 150px;

  34.                 border: 0;

  35.             }

  36.             .section

  37.             {

  38.                 text-align: center;

  39.                 font-weight: bold;

  40.             }

  41.             .contents

  42.             {

  43.                 background: #FFFFFF;

  44.                 width: 720px;

  45.                 padding: 1em;

  46.                 margin-top: 2em;

  47.                 margin-bottom: 2em;

  48.                 border: 1px solid #E0E0E0;

  49.                 text-align: left;

  50.                 color: #444;

  51.             }

  52.             html

  53.             {

  54.                 font-family: sans-serif;

  55.             }

  56.             body

  57.             {

  58.                 line-height: 1.5em;

  59.             }

  60.             body

  61.             {

  62.                 background: #FAFAFA;

  63.             }

  64.             table

  65.             {

  66.                 border-collapse: collapse;

  67.                 width: 100%;

  68.             }

  69.             

  70.             table, th, td

  71.             {

  72.                 border: 1px solid #aaa;

  73.                 padding: 0.5em;

  74.                 margin-top: 0.5em;

  75.                 margin-bottom: 0.5em;

  76.             }

  77.             #lang

  78.             {

  79.                 float: right;

  80.             }

  81.         </style>

  82.         <title>

  83.             zipbase64_1.0.0+ru

  84.         </title>

  85.     </head>

  86.     <body>

  87.         <div id="header">

  88.             <strong id="title">ZipBase64</strong>

  89.             <div id="lang">

  90.                 <a href="../en/zipbase64_1.0.0.html">EN</a>

  91.                 <a href="../ru/zipbase64_1.0.0+ru.html">RU</a>

  92.             </div>

  93.         </div>

  94.         <center><div class="contents">

  95.             <p>

  96.             <strong>ZipBase64</strong> является инструментом (онлайн) для конвертации строк в Base64 или Zip + Base64. Инструмент исполняется в веб-браузере без использования сервера. Вы можете сохранить эту страницу HTML и запустить её локально без Интернета.

  97.             </p>

  98.             <table>

  99.                 <tr><td class="section">Команды:</td></tr>

  100.                 <tr><td>

  101.                     <ol>

  102.                         <li><button onclick="window.toolZipBase64.swap()">Сменить ввод и вывод местами</button></li>

  103.                         <li><button onclick="window.toolZipBase64.toBase64()">Строка -> Base64</button></li>

  104.                         <li><button onclick="window.toolZipBase64.fromBase64()">Base64 -> Строка</button></li>

  105.                         <li><button onclick="window.toolZipBase64.toZipBase64()">Строка -> Zip + Base64</button></li>

  106.                         <li><button onclick="window.toolZipBase64.fromZipBase64()">Zip + Base64 -> Строка</button></li>

  107.                     </ol>

  108.                 </td></tr>

  109.                 <tr><td class="section">Ввод:</td></tr>

  110.                 <tr><td>

  111.                     <textarea id="input" placeholder="Вставьте строку ввода сюда"></textarea>

  112.                 </td></tr>

  113.                 <tr><td class="section">Вывод:</td></tr>

  114.                 <tr><td>

  115.                     <textarea id="output" placeholder="Заберить строку вывода отсюда"></textarea>

  116.                 </td></tr>

  117.                 <tr><td class="section">Журнал:</td></tr>

  118.                 <tr><td id="log"></td></tr>

  119.             </table>

  120.         </div></center>

  121.         <div id="footer">

  122.             Сайт сгенерирован из <a href="http://github.com/ogstudio/site-zipbase64">этого исходного кода</a>.

  123.             Сайт расположен на <a href="https://pages.github.com">GitHub Pages</a>.

  124.         </div>

  125. 

  126.         <!-- External libraries -->

  127.         <script type="text/javascript">

  128.             // SRC: https://github.com/beatgammit/base64-js

  129.             (function(r){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=r()}else if(typeof define==="function"&&define.amd){define([],r)}else{var e;if(typeof window!=="undefined"){e=window}else if(typeof global!=="undefined"){e=global}else if(typeof self!=="undefined"){e=self}else{e=this}e.base64js=r()}})(function(){var r,e,n;return function(){function r(e,n,t){function o(f,i){if(!n[f]){if(!e[f]){var u="function"==typeof require&&require;if(!i&&u)return u(f,!0);if(a)return a(f,!0);var v=new Error("Cannot find module '"+f+"'");throw v.code="MODULE_NOT_FOUND",v}var d=n[f]={exports:{}};e[f][0].call(d.exports,function(r){var n=e[f][1][r];return o(n||r)},d,d.exports,r,e,n,t)}return n[f].exports}for(var a="function"==typeof require&&require,f=0;f<t.length;f++)o(t[f]);return o}return r}()({"/":[function(r,e,n){"use strict";n.byteLength=d;n.toByteArray=h;n.fromByteArray=p;var t=[];var o=[];var a=typeof Uint8Array!=="undefined"?Uint8Array:Array;var f="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";for(var i=0,u=f.length;i<u;++i){t[i]=f[i];o[f.charCodeAt(i)]=i}o["-".charCodeAt(0)]=62;o["_".charCodeAt(0)]=63;function v(r){var e=r.length;if(e%4>0){throw new Error("Invalid string. Length must be a multiple of 4")}var n=r.indexOf("=");if(n===-1)n=e;var t=n===e?0:4-n%4;return[n,t]}function d(r){var e=v(r);var n=e[0];var t=e[1];return(n+t)*3/4-t}function c(r,e,n){return(e+n)*3/4-n}function h(r){var e;var n=v(r);var t=n[0];var f=n[1];var i=new a(c(r,t,f));var u=0;var d=f>0?t-4:t;for(var h=0;h<d;h+=4){e=o[r.charCodeAt(h)]<<18|o[r.charCodeAt(h+1)]<<12|o[r.charCodeAt(h+2)]<<6|o[r.charCodeAt(h+3)];i[u++]=e>>16&255;i[u++]=e>>8&255;i[u++]=e&255}if(f===2){e=o[r.charCodeAt(h)]<<2|o[r.charCodeAt(h+1)]>>4;i[u++]=e&255}if(f===1){e=o[r.charCodeAt(h)]<<10|o[r.charCodeAt(h+1)]<<4|o[r.charCodeAt(h+2)]>>2;i[u++]=e>>8&255;i[u++]=e&255}return i}function s(r){return t[r>>18&63]+t[r>>12&63]+t[r>>6&63]+t[r&63]}function l(r,e,n){var t;var o=[];for(var a=e;a<n;a+=3){t=(r[a]<<16&16711680)+(r[a+1]<<8&65280)+(r[a+2]&255);o.push(s(t))}return o.join("")}function p(r){var e;var n=r.length;var o=n%3;var a=[];var f=16383;for(var i=0,u=n-o;i<u;i+=f){a.push(l(r,i,i+f>u?u:i+f))}if(o===1){e=r[n-1];a.push(t[e>>2]+t[e<<4&63]+"==")}else if(o===2){e=(r[n-2]<<8)+r[n-1];a.push(t[e>>10]+t[e>>4&63]+t[e<<2&63]+"=")}return a.join("")}},{}]},{},[])("/")});

  130.             // SRC: https://github.com/solderjs/TextEncoderLite

  131.             function TextEncoderLite() {

  132.             }

  133.             function TextDecoderLite() {

  134.             }

  135.             

  136.             (function () {

  137.             'use strict';

  138.             

  139.             // Taken from https://github.com/feross/buffer/blob/master/index.js

  140.             // Thanks Feross et al! :-)

  141.             

  142.             function utf8ToBytes (string, units) {

  143.               units = units || Infinity

  144.               var codePoint

  145.               var length = string.length

  146.               var leadSurrogate = null

  147.               var bytes = []

  148.               var i = 0

  149.             

  150.               for (; i < length; i++) {

  151.                 codePoint = string.charCodeAt(i)

  152.             

  153.                 // is surrogate component

  154.                 if (codePoint > 0xD7FF && codePoint < 0xE000) {

  155.                   // last char was a lead

  156.                   if (leadSurrogate) {

  157.                     // 2 leads in a row

  158.                     if (codePoint < 0xDC00) {

  159.                       if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)

  160.                       leadSurrogate = codePoint

  161.                       continue

  162.                     } else {

  163.                       // valid surrogate pair

  164.                       codePoint = leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00 | 0x10000

  165.                       leadSurrogate = null

  166.                     }

  167.                   } else {

  168.                     // no lead yet

  169.             

  170.                     if (codePoint > 0xDBFF) {

  171.                       // unexpected trail

  172.                       if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)

  173.                       continue

  174.                     } else if (i + 1 === length) {

  175.                       // unpaired lead

  176.                       if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)

  177.                       continue

  178.                     } else {

  179.                       // valid lead

  180.                       leadSurrogate = codePoint

  181.                       continue

  182.                     }

  183.                   }

  184.                 } else if (leadSurrogate) {

  185.                   // valid bmp char, but last char was a lead

  186.                   if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)

  187.                   leadSurrogate = null

  188.                 }

  189.             

  190.                 // encode utf8

  191.                 if (codePoint < 0x80) {

  192.                   if ((units -= 1) < 0) break

  193.                   bytes.push(codePoint)

  194.                 } else if (codePoint < 0x800) {

  195.                   if ((units -= 2) < 0) break

  196.                   bytes.push(

  197.                     codePoint >> 0x6 | 0xC0,

  198.                     codePoint & 0x3F | 0x80

  199.                   )

  200.                 } else if (codePoint < 0x10000) {

  201.                   if ((units -= 3) < 0) break

  202.                   bytes.push(

  203.                     codePoint >> 0xC | 0xE0,

  204.                     codePoint >> 0x6 & 0x3F | 0x80,

  205.                     codePoint & 0x3F | 0x80

  206.                   )

  207.                 } else if (codePoint < 0x200000) {

  208.                   if ((units -= 4) < 0) break

  209.                   bytes.push(

  210.                     codePoint >> 0x12 | 0xF0,

  211.                     codePoint >> 0xC & 0x3F | 0x80,

  212.                     codePoint >> 0x6 & 0x3F | 0x80,

  213.                     codePoint & 0x3F | 0x80

  214.                   )

  215.                 } else {

  216.                   throw new Error('Invalid code point')

  217.                 }

  218.               }

  219.             

  220.               return bytes

  221.             }

  222.             

  223.             function utf8Slice (buf, start, end) {

  224.               var res = ''

  225.               var tmp = ''

  226.               end = Math.min(buf.length, end || Infinity)

  227.               start = start || 0;

  228.             

  229.               for (var i = start; i < end; i++) {

  230.                 if (buf[i] <= 0x7F) {

  231.                   res += decodeUtf8Char(tmp) + String.fromCharCode(buf[i])

  232.                   tmp = ''

  233.                 } else {

  234.                   tmp += '%' + buf[i].toString(16)

  235.                 }

  236.               }

  237.             

  238.               return res + decodeUtf8Char(tmp)

  239.             }

  240.             

  241.             function decodeUtf8Char (str) {

  242.               try {

  243.                 return decodeURIComponent(str)

  244.               } catch (err) {

  245.                 return String.fromCharCode(0xFFFD) // UTF 8 invalid char

  246.               }

  247.             }

  248.             

  249.             TextEncoderLite.prototype.encode = function (str) {

  250.               var result;

  251.             

  252.               if ('undefined' === typeof Uint8Array) {

  253.                 result = utf8ToBytes(str);

  254.               } else {

  255.                 result = new Uint8Array(utf8ToBytes(str));

  256.               }

  257.             

  258.               return result;

  259.             };

  260.             

  261.             TextDecoderLite.prototype.decode = function (bytes) {

  262.               return utf8Slice(bytes, 0, bytes.length);

  263.             }

  264.             

  265.             }());

  266.             

  267.             if(typeof module === "object" && module) {

  268.               module.exports.TextDecoderLite = TextDecoderLite;

  269.               module.exports.TextEncoderLite = TextEncoderLite;

  270.             }

  271.             // SRC: https://github.com/nodeca/pako

  272.             /* pako 1.0.10 nodeca/pako */(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.pako = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){

  273.             'use strict';

  274.             

  275.             

  276.             var zlib_deflate = require('./zlib/deflate');

  277.             var utils        = require('./utils/common');

  278.             var strings      = require('./utils/strings');

  279.             var msg          = require('./zlib/messages');

  280.             var ZStream      = require('./zlib/zstream');

  281.             

  282.             var toString = Object.prototype.toString;

  283.             

  284.             /* Public constants ==========================================================*/

  285.             /* ===========================================================================*/

  286.             

  287.             var Z_NO_FLUSH      = 0;

  288.             var Z_FINISH        = 4;

  289.             

  290.             var Z_OK            = 0;

  291.             var Z_STREAM_END    = 1;

  292.             var Z_SYNC_FLUSH    = 2;

  293.             

  294.             var Z_DEFAULT_COMPRESSION = -1;

  295.             

  296.             var Z_DEFAULT_STRATEGY    = 0;

  297.             

  298.             var Z_DEFLATED  = 8;

  299.             

  300.             /* ===========================================================================*/

  301.             

  302.             

  303.             /**

  304.              * class Deflate

  305.              *

  306.              * Generic JS-style wrapper for zlib calls. If you don't need

  307.              * streaming behaviour - use more simple functions: [[deflate]],

  308.              * [[deflateRaw]] and [[gzip]].

  309.              **/

  310.             

  311.             /* internal

  312.              * Deflate.chunks -> Array

  313.              *

  314.              * Chunks of output data, if [[Deflate#onData]] not overridden.

  315.              **/

  316.             

  317.             /**

  318.              * Deflate.result -> Uint8Array|Array

  319.              *

  320.              * Compressed result, generated by default [[Deflate#onData]]

  321.              * and [[Deflate#onEnd]] handlers. Filled after you push last chunk

  322.              * (call [[Deflate#push]] with `Z_FINISH` / `true` param)  or if you

  323.              * push a chunk with explicit flush (call [[Deflate#push]] with

  324.              * `Z_SYNC_FLUSH` param).

  325.              **/

  326.             

  327.             /**

  328.              * Deflate.err -> Number

  329.              *

  330.              * Error code after deflate finished. 0 (Z_OK) on success.

  331.              * You will not need it in real life, because deflate errors

  332.              * are possible only on wrong options or bad `onData` / `onEnd`

  333.              * custom handlers.

  334.              **/

  335.             

  336.             /**

  337.              * Deflate.msg -> String

  338.              *

  339.              * Error message, if [[Deflate.err]] != 0

  340.              **/

  341.             

  342.             

  343.             /**

  344.              * new Deflate(options)

  345.              * - options (Object): zlib deflate options.

  346.              *

  347.              * Creates new deflator instance with specified params. Throws exception

  348.              * on bad params. Supported options:

  349.              *

  350.              * - `level`

  351.              * - `windowBits`

  352.              * - `memLevel`

  353.              * - `strategy`

  354.              * - `dictionary`

  355.              *

  356.              * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)

  357.              * for more information on these.

  358.              *

  359.              * Additional options, for internal needs:

  360.              *

  361.              * - `chunkSize` - size of generated data chunks (16K by default)

  362.              * - `raw` (Boolean) - do raw deflate

  363.              * - `gzip` (Boolean) - create gzip wrapper

  364.              * - `to` (String) - if equal to 'string', then result will be "binary string"

  365.              *    (each char code [0..255])

  366.              * - `header` (Object) - custom header for gzip

  367.              *   - `text` (Boolean) - true if compressed data believed to be text

  368.              *   - `time` (Number) - modification time, unix timestamp

  369.              *   - `os` (Number) - operation system code

  370.              *   - `extra` (Array) - array of bytes with extra data (max 65536)

  371.              *   - `name` (String) - file name (binary string)

  372.              *   - `comment` (String) - comment (binary string)

  373.              *   - `hcrc` (Boolean) - true if header crc should be added

  374.              *

  375.              * ##### Example:

  376.              *

  377.              * ```javascript

  378.              * var pako = require('pako')

  379.              *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])

  380.              *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);

  381.              *

  382.              * var deflate = new pako.Deflate({ level: 3});

  383.              *

  384.              * deflate.push(chunk1, false);

  385.              * deflate.push(chunk2, true);  // true -> last chunk

  386.              *

  387.              * if (deflate.err) { throw new Error(deflate.err); }

  388.              *

  389.              * console.log(deflate.result);

  390.              * ```

  391.              **/

  392.             function Deflate(options) {

  393.               if (!(this instanceof Deflate)) return new Deflate(options);

  394.             

  395.               this.options = utils.assign({

  396.                 level: Z_DEFAULT_COMPRESSION,

  397.                 method: Z_DEFLATED,

  398.                 chunkSize: 16384,

  399.                 windowBits: 15,

  400.                 memLevel: 8,

  401.                 strategy: Z_DEFAULT_STRATEGY,

  402.                 to: ''

  403.               }, options || {});

  404.             

  405.               var opt = this.options;

  406.             

  407.               if (opt.raw && (opt.windowBits > 0)) {

  408.                 opt.windowBits = -opt.windowBits;

  409.               }

  410.             

  411.               else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {

  412.                 opt.windowBits += 16;

  413.               }

  414.             

  415.               this.err    = 0;      // error code, if happens (0 = Z_OK)

  416.               this.msg    = '';     // error message

  417.               this.ended  = false;  // used to avoid multiple onEnd() calls

  418.               this.chunks = [];     // chunks of compressed data

  419.             

  420.               this.strm = new ZStream();

  421.               this.strm.avail_out = 0;

  422.             

  423.               var status = zlib_deflate.deflateInit2(

  424.                 this.strm,

  425.                 opt.level,

  426.                 opt.method,

  427.                 opt.windowBits,

  428.                 opt.memLevel,

  429.                 opt.strategy

  430.               );

  431.             

  432.               if (status !== Z_OK) {

  433.                 throw new Error(msg[status]);

  434.               }

  435.             

  436.               if (opt.header) {

  437.                 zlib_deflate.deflateSetHeader(this.strm, opt.header);

  438.               }

  439.             

  440.               if (opt.dictionary) {

  441.                 var dict;

  442.                 // Convert data if needed

  443.                 if (typeof opt.dictionary === 'string') {

  444.                   // If we need to compress text, change encoding to utf8.

  445.                   dict = strings.string2buf(opt.dictionary);

  446.                 } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {

  447.                   dict = new Uint8Array(opt.dictionary);

  448.                 } else {

  449.                   dict = opt.dictionary;

  450.                 }

  451.             

  452.                 status = zlib_deflate.deflateSetDictionary(this.strm, dict);

  453.             

  454.                 if (status !== Z_OK) {

  455.                   throw new Error(msg[status]);

  456.                 }

  457.             

  458.                 this._dict_set = true;

  459.               }

  460.             }

  461.             

  462.             /**

  463.              * Deflate#push(data[, mode]) -> Boolean

  464.              * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be

  465.              *   converted to utf8 byte sequence.

  466.              * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.

  467.              *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.

  468.              *

  469.              * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with

  470.              * new compressed chunks. Returns `true` on success. The last data block must have

  471.              * mode Z_FINISH (or `true`). That will flush internal pending buffers and call

  472.              * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you

  473.              * can use mode Z_SYNC_FLUSH, keeping the compression context.

  474.              *

  475.              * On fail call [[Deflate#onEnd]] with error code and return false.

  476.              *

  477.              * We strongly recommend to use `Uint8Array` on input for best speed (output

  478.              * array format is detected automatically). Also, don't skip last param and always

  479.              * use the same type in your code (boolean or number). That will improve JS speed.

  480.              *

  481.              * For regular `Array`-s make sure all elements are [0..255].

  482.              *

  483.              * ##### Example

  484.              *

  485.              * ```javascript

  486.              * push(chunk, false); // push one of data chunks

  487.              * ...

  488.              * push(chunk, true);  // push last chunk

  489.              * ```

  490.              **/

  491.             Deflate.prototype.push = function (data, mode) {

  492.               var strm = this.strm;

  493.               var chunkSize = this.options.chunkSize;

  494.               var status, _mode;

  495.             

  496.               if (this.ended) { return false; }

  497.             

  498.               _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);

  499.             

  500.               // Convert data if needed

  501.               if (typeof data === 'string') {

  502.                 // If we need to compress text, change encoding to utf8.

  503.                 strm.input = strings.string2buf(data);

  504.               } else if (toString.call(data) === '[object ArrayBuffer]') {

  505.                 strm.input = new Uint8Array(data);

  506.               } else {

  507.                 strm.input = data;

  508.               }

  509.             

  510.               strm.next_in = 0;

  511.               strm.avail_in = strm.input.length;

  512.             

  513.               do {

  514.                 if (strm.avail_out === 0) {

  515.                   strm.output = new utils.Buf8(chunkSize);

  516.                   strm.next_out = 0;

  517.                   strm.avail_out = chunkSize;

  518.                 }

  519.                 status = zlib_deflate.deflate(strm, _mode);    /* no bad return value */

  520.             

  521.                 if (status !== Z_STREAM_END && status !== Z_OK) {

  522.                   this.onEnd(status);

  523.                   this.ended = true;

  524.                   return false;

  525.                 }

  526.                 if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {

  527.                   if (this.options.to === 'string') {

  528.                     this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));

  529.                   } else {

  530.                     this.onData(utils.shrinkBuf(strm.output, strm.next_out));

  531.                   }

  532.                 }

  533.               } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);

  534.             

  535.               // Finalize on the last chunk.

  536.               if (_mode === Z_FINISH) {

  537.                 status = zlib_deflate.deflateEnd(this.strm);

  538.                 this.onEnd(status);

  539.                 this.ended = true;

  540.                 return status === Z_OK;

  541.               }

  542.             

  543.               // callback interim results if Z_SYNC_FLUSH.

  544.               if (_mode === Z_SYNC_FLUSH) {

  545.                 this.onEnd(Z_OK);

  546.                 strm.avail_out = 0;

  547.                 return true;

  548.               }

  549.             

  550.               return true;

  551.             };

  552.             

  553.             

  554.             /**

  555.              * Deflate#onData(chunk) -> Void

  556.              * - chunk (Uint8Array|Array|String): output data. Type of array depends

  557.              *   on js engine support. When string output requested, each chunk

  558.              *   will be string.

  559.              *

  560.              * By default, stores data blocks in `chunks[]` property and glue

  561.              * those in `onEnd`. Override this handler, if you need another behaviour.

  562.              **/

  563.             Deflate.prototype.onData = function (chunk) {

  564.               this.chunks.push(chunk);

  565.             };

  566.             

  567.             

  568.             /**

  569.              * Deflate#onEnd(status) -> Void

  570.              * - status (Number): deflate status. 0 (Z_OK) on success,

  571.              *   other if not.

  572.              *

  573.              * Called once after you tell deflate that the input stream is

  574.              * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)

  575.              * or if an error happened. By default - join collected chunks,

  576.              * free memory and fill `results` / `err` properties.

  577.              **/

  578.             Deflate.prototype.onEnd = function (status) {

  579.               // On success - join

  580.               if (status === Z_OK) {

  581.                 if (this.options.to === 'string') {

  582.                   this.result = this.chunks.join('');

  583.                 } else {

  584.                   this.result = utils.flattenChunks(this.chunks);

  585.                 }

  586.               }

  587.               this.chunks = [];

  588.               this.err = status;

  589.               this.msg = this.strm.msg;

  590.             };

  591.             

  592.             

  593.             /**

  594.              * deflate(data[, options]) -> Uint8Array|Array|String

  595.              * - data (Uint8Array|Array|String): input data to compress.

  596.              * - options (Object): zlib deflate options.

  597.              *

  598.              * Compress `data` with deflate algorithm and `options`.

  599.              *

  600.              * Supported options are:

  601.              *

  602.              * - level

  603.              * - windowBits

  604.              * - memLevel

  605.              * - strategy

  606.              * - dictionary

  607.              *

  608.              * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)

  609.              * for more information on these.

  610.              *

  611.              * Sugar (options):

  612.              *

  613.              * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify

  614.              *   negative windowBits implicitly.

  615.              * - `to` (String) - if equal to 'string', then result will be "binary string"

  616.              *    (each char code [0..255])

  617.              *

  618.              * ##### Example:

  619.              *

  620.              * ```javascript

  621.              * var pako = require('pako')

  622.              *   , data = Uint8Array([1,2,3,4,5,6,7,8,9]);

  623.              *

  624.              * console.log(pako.deflate(data));

  625.              * ```

  626.              **/

  627.             function deflate(input, options) {

  628.               var deflator = new Deflate(options);

  629.             

  630.               deflator.push(input, true);

  631.             

  632.               // That will never happens, if you don't cheat with options :)

  633.               if (deflator.err) { throw deflator.msg || msg[deflator.err]; }

  634.             

  635.               return deflator.result;

  636.             }

  637.             

  638.             

  639.             /**

  640.              * deflateRaw(data[, options]) -> Uint8Array|Array|String

  641.              * - data (Uint8Array|Array|String): input data to compress.

  642.              * - options (Object): zlib deflate options.

  643.              *

  644.              * The same as [[deflate]], but creates raw data, without wrapper

  645.              * (header and adler32 crc).

  646.              **/

  647.             function deflateRaw(input, options) {

  648.               options = options || {};

  649.               options.raw = true;

  650.               return deflate(input, options);

  651.             }

  652.             

  653.             

  654.             /**

  655.              * gzip(data[, options]) -> Uint8Array|Array|String

  656.              * - data (Uint8Array|Array|String): input data to compress.

  657.              * - options (Object): zlib deflate options.

  658.              *

  659.              * The same as [[deflate]], but create gzip wrapper instead of

  660.              * deflate one.

  661.              **/

  662.             function gzip(input, options) {

  663.               options = options || {};

  664.               options.gzip = true;

  665.               return deflate(input, options);

  666.             }

  667.             

  668.             

  669.             exports.Deflate = Deflate;

  670.             exports.deflate = deflate;

  671.             exports.deflateRaw = deflateRaw;

  672.             exports.gzip = gzip;

  673.             

  674.             },{"./utils/common":3,"./utils/strings":4,"./zlib/deflate":8,"./zlib/messages":13,"./zlib/zstream":15}],2:[function(require,module,exports){

  675.             'use strict';

  676.             

  677.             

  678.             var zlib_inflate = require('./zlib/inflate');

  679.             var utils        = require('./utils/common');

  680.             var strings      = require('./utils/strings');

  681.             var c            = require('./zlib/constants');

  682.             var msg          = require('./zlib/messages');

  683.             var ZStream      = require('./zlib/zstream');

  684.             var GZheader     = require('./zlib/gzheader');

  685.             

  686.             var toString = Object.prototype.toString;

  687.             

  688.             /**

  689.              * class Inflate

  690.              *

  691.              * Generic JS-style wrapper for zlib calls. If you don't need

  692.              * streaming behaviour - use more simple functions: [[inflate]]

  693.              * and [[inflateRaw]].

  694.              **/

  695.             

  696.             /* internal

  697.              * inflate.chunks -> Array

  698.              *

  699.              * Chunks of output data, if [[Inflate#onData]] not overridden.

  700.              **/

  701.             

  702.             /**

  703.              * Inflate.result -> Uint8Array|Array|String

  704.              *

  705.              * Uncompressed result, generated by default [[Inflate#onData]]

  706.              * and [[Inflate#onEnd]] handlers. Filled after you push last chunk

  707.              * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you

  708.              * push a chunk with explicit flush (call [[Inflate#push]] with

  709.              * `Z_SYNC_FLUSH` param).

  710.              **/

  711.             

  712.             /**

  713.              * Inflate.err -> Number

  714.              *

  715.              * Error code after inflate finished. 0 (Z_OK) on success.

  716.              * Should be checked if broken data possible.

  717.              **/

  718.             

  719.             /**

  720.              * Inflate.msg -> String

  721.              *

  722.              * Error message, if [[Inflate.err]] != 0

  723.              **/

  724.             

  725.             

  726.             /**

  727.              * new Inflate(options)

  728.              * - options (Object): zlib inflate options.

  729.              *

  730.              * Creates new inflator instance with specified params. Throws exception

  731.              * on bad params. Supported options:

  732.              *

  733.              * - `windowBits`

  734.              * - `dictionary`

  735.              *

  736.              * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)

  737.              * for more information on these.

  738.              *

  739.              * Additional options, for internal needs:

  740.              *

  741.              * - `chunkSize` - size of generated data chunks (16K by default)

  742.              * - `raw` (Boolean) - do raw inflate

  743.              * - `to` (String) - if equal to 'string', then result will be converted

  744.              *   from utf8 to utf16 (javascript) string. When string output requested,

  745.              *   chunk length can differ from `chunkSize`, depending on content.

  746.              *

  747.              * By default, when no options set, autodetect deflate/gzip data format via

  748.              * wrapper header.

  749.              *

  750.              * ##### Example:

  751.              *

  752.              * ```javascript

  753.              * var pako = require('pako')

  754.              *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])

  755.              *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);

  756.              *

  757.              * var inflate = new pako.Inflate({ level: 3});

  758.              *

  759.              * inflate.push(chunk1, false);

  760.              * inflate.push(chunk2, true);  // true -> last chunk

  761.              *

  762.              * if (inflate.err) { throw new Error(inflate.err); }

  763.              *

  764.              * console.log(inflate.result);

  765.              * ```

  766.              **/

  767.             function Inflate(options) {

  768.               if (!(this instanceof Inflate)) return new Inflate(options);

  769.             

  770.               this.options = utils.assign({

  771.                 chunkSize: 16384,

  772.                 windowBits: 0,

  773.                 to: ''

  774.               }, options || {});

  775.             

  776.               var opt = this.options;

  777.             

  778.               // Force window size for `raw` data, if not set directly,

  779.               // because we have no header for autodetect.

  780.               if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {

  781.                 opt.windowBits = -opt.windowBits;

  782.                 if (opt.windowBits === 0) { opt.windowBits = -15; }

  783.               }

  784.             

  785.               // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate

  786.               if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&

  787.                   !(options && options.windowBits)) {

  788.                 opt.windowBits += 32;

  789.               }

  790.             

  791.               // Gzip header has no info about windows size, we can do autodetect only

  792.               // for deflate. So, if window size not set, force it to max when gzip possible

  793.               if ((opt.windowBits > 15) && (opt.windowBits < 48)) {

  794.                 // bit 3 (16) -> gzipped data

  795.                 // bit 4 (32) -> autodetect gzip/deflate

  796.                 if ((opt.windowBits & 15) === 0) {

  797.                   opt.windowBits |= 15;

  798.                 }

  799.               }

  800.             

  801.               this.err    = 0;      // error code, if happens (0 = Z_OK)

  802.               this.msg    = '';     // error message

  803.               this.ended  = false;  // used to avoid multiple onEnd() calls

  804.               this.chunks = [];     // chunks of compressed data

  805.             

  806.               this.strm   = new ZStream();

  807.               this.strm.avail_out = 0;

  808.             

  809.               var status  = zlib_inflate.inflateInit2(

  810.                 this.strm,

  811.                 opt.windowBits

  812.               );

  813.             

  814.               if (status !== c.Z_OK) {

  815.                 throw new Error(msg[status]);

  816.               }

  817.             

  818.               this.header = new GZheader();

  819.             

  820.               zlib_inflate.inflateGetHeader(this.strm, this.header);

  821.             

  822.               // Setup dictionary

  823.               if (opt.dictionary) {

  824.                 // Convert data if needed

  825.                 if (typeof opt.dictionary === 'string') {

  826.                   opt.dictionary = strings.string2buf(opt.dictionary);

  827.                 } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {

  828.                   opt.dictionary = new Uint8Array(opt.dictionary);

  829.                 }

  830.                 if (opt.raw) { //In raw mode we need to set the dictionary early

  831.                   status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);

  832.                   if (status !== c.Z_OK) {

  833.                     throw new Error(msg[status]);

  834.                   }

  835.                 }

  836.               }

  837.             }

  838.             

  839.             /**

  840.              * Inflate#push(data[, mode]) -> Boolean

  841.              * - data (Uint8Array|Array|ArrayBuffer|String): input data

  842.              * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.

  843.              *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.

  844.              *

  845.              * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with

  846.              * new output chunks. Returns `true` on success. The last data block must have

  847.              * mode Z_FINISH (or `true`). That will flush internal pending buffers and call

  848.              * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you

  849.              * can use mode Z_SYNC_FLUSH, keeping the decompression context.

  850.              *

  851.              * On fail call [[Inflate#onEnd]] with error code and return false.

  852.              *

  853.              * We strongly recommend to use `Uint8Array` on input for best speed (output

  854.              * format is detected automatically). Also, don't skip last param and always

  855.              * use the same type in your code (boolean or number). That will improve JS speed.

  856.              *

  857.              * For regular `Array`-s make sure all elements are [0..255].

  858.              *

  859.              * ##### Example

  860.              *

  861.              * ```javascript

  862.              * push(chunk, false); // push one of data chunks

  863.              * ...

  864.              * push(chunk, true);  // push last chunk

  865.              * ```

  866.              **/

  867.             Inflate.prototype.push = function (data, mode) {

  868.               var strm = this.strm;

  869.               var chunkSize = this.options.chunkSize;

  870.               var dictionary = this.options.dictionary;

  871.               var status, _mode;

  872.               var next_out_utf8, tail, utf8str;

  873.             

  874.               // Flag to properly process Z_BUF_ERROR on testing inflate call

  875.               // when we check that all output data was flushed.

  876.               var allowBufError = false;

  877.             

  878.               if (this.ended) { return false; }

  879.               _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);

  880.             

  881.               // Convert data if needed

  882.               if (typeof data === 'string') {

  883.                 // Only binary strings can be decompressed on practice

  884.                 strm.input = strings.binstring2buf(data);

  885.               } else if (toString.call(data) === '[object ArrayBuffer]') {

  886.                 strm.input = new Uint8Array(data);

  887.               } else {

  888.                 strm.input = data;

  889.               }

  890.             

  891.               strm.next_in = 0;

  892.               strm.avail_in = strm.input.length;

  893.             

  894.               do {

  895.                 if (strm.avail_out === 0) {

  896.                   strm.output = new utils.Buf8(chunkSize);

  897.                   strm.next_out = 0;

  898.                   strm.avail_out = chunkSize;

  899.                 }

  900.             

  901.                 status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);    /* no bad return value */

  902.             

  903.                 if (status === c.Z_NEED_DICT && dictionary) {

  904.                   status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);

  905.                 }

  906.             

  907.                 if (status === c.Z_BUF_ERROR && allowBufError === true) {

  908.                   status = c.Z_OK;

  909.                   allowBufError = false;

  910.                 }

  911.             

  912.                 if (status !== c.Z_STREAM_END && status !== c.Z_OK) {

  913.                   this.onEnd(status);

  914.                   this.ended = true;

  915.                   return false;

  916.                 }

  917.             

  918.                 if (strm.next_out) {

  919.                   if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {

  920.             

  921.                     if (this.options.to === 'string') {

  922.             

  923.                       next_out_utf8 = strings.utf8border(strm.output, strm.next_out);

  924.             

  925.                       tail = strm.next_out - next_out_utf8;

  926.                       utf8str = strings.buf2string(strm.output, next_out_utf8);

  927.             

  928.                       // move tail

  929.                       strm.next_out = tail;

  930.                       strm.avail_out = chunkSize - tail;

  931.                       if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }

  932.             

  933.                       this.onData(utf8str);

  934.             

  935.                     } else {

  936.                       this.onData(utils.shrinkBuf(strm.output, strm.next_out));

  937.                     }

  938.                   }

  939.                 }

  940.             

  941.                 // When no more input data, we should check that internal inflate buffers

  942.                 // are flushed. The only way to do it when avail_out = 0 - run one more

  943.                 // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.

  944.                 // Here we set flag to process this error properly.

  945.                 //

  946.                 // NOTE. Deflate does not return error in this case and does not needs such

  947.                 // logic.

  948.                 if (strm.avail_in === 0 && strm.avail_out === 0) {

  949.                   allowBufError = true;

  950.                 }

  951.             

  952.               } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);

  953.             

  954.               if (status === c.Z_STREAM_END) {

  955.                 _mode = c.Z_FINISH;

  956.               }

  957.             

  958.               // Finalize on the last chunk.

  959.               if (_mode === c.Z_FINISH) {

  960.                 status = zlib_inflate.inflateEnd(this.strm);

  961.                 this.onEnd(status);

  962.                 this.ended = true;

  963.                 return status === c.Z_OK;

  964.               }

  965.             

  966.               // callback interim results if Z_SYNC_FLUSH.

  967.               if (_mode === c.Z_SYNC_FLUSH) {

  968.                 this.onEnd(c.Z_OK);

  969.                 strm.avail_out = 0;

  970.                 return true;

  971.               }

  972.             

  973.               return true;

  974.             };

  975.             

  976.             

  977.             /**

  978.              * Inflate#onData(chunk) -> Void

  979.              * - chunk (Uint8Array|Array|String): output data. Type of array depends

  980.              *   on js engine support. When string output requested, each chunk

  981.              *   will be string.

  982.              *

  983.              * By default, stores data blocks in `chunks[]` property and glue

  984.              * those in `onEnd`. Override this handler, if you need another behaviour.

  985.              **/

  986.             Inflate.prototype.onData = function (chunk) {

  987.               this.chunks.push(chunk);

  988.             };

  989.             

  990.             

  991.             /**

  992.              * Inflate#onEnd(status) -> Void

  993.              * - status (Number): inflate status. 0 (Z_OK) on success,

  994.              *   other if not.

  995.              *

  996.              * Called either after you tell inflate that the input stream is

  997.              * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)

  998.              * or if an error happened. By default - join collected chunks,

  999.              * free memory and fill `results` / `err` properties.

  1000.              **/

  1001.             Inflate.prototype.onEnd = function (status) {

  1002.               // On success - join

  1003.               if (status === c.Z_OK) {

  1004.                 if (this.options.to === 'string') {

  1005.                   // Glue & convert here, until we teach pako to send

  1006.                   // utf8 aligned strings to onData

  1007.                   this.result = this.chunks.join('');

  1008.                 } else {

  1009.                   this.result = utils.flattenChunks(this.chunks);

  1010.                 }

  1011.               }

  1012.               this.chunks = [];

  1013.               this.err = status;

  1014.               this.msg = this.strm.msg;

  1015.             };

  1016.             

  1017.             

  1018.             /**

  1019.              * inflate(data[, options]) -> Uint8Array|Array|String

  1020.              * - data (Uint8Array|Array|String): input data to decompress.

  1021.              * - options (Object): zlib inflate options.

  1022.              *

  1023.              * Decompress `data` with inflate/ungzip and `options`. Autodetect

  1024.              * format via wrapper header by default. That's why we don't provide

  1025.              * separate `ungzip` method.

  1026.              *

  1027.              * Supported options are:

  1028.              *

  1029.              * - windowBits

  1030.              *

  1031.              * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)

  1032.              * for more information.

  1033.              *

  1034.              * Sugar (options):

  1035.              *

  1036.              * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify

  1037.              *   negative windowBits implicitly.

  1038.              * - `to` (String) - if equal to 'string', then result will be converted

  1039.              *   from utf8 to utf16 (javascript) string. When string output requested,

  1040.              *   chunk length can differ from `chunkSize`, depending on content.

  1041.              *

  1042.              *

  1043.              * ##### Example:

  1044.              *

  1045.              * ```javascript

  1046.              * var pako = require('pako')

  1047.              *   , input = pako.deflate([1,2,3,4,5,6,7,8,9])

  1048.              *   , output;

  1049.              *

  1050.              * try {

  1051.              *   output = pako.inflate(input);

  1052.              * } catch (err)

  1053.              *   console.log(err);

  1054.              * }

  1055.              * ```

  1056.              **/

  1057.             function inflate(input, options) {

  1058.               var inflator = new Inflate(options);

  1059.             

  1060.               inflator.push(input, true);

  1061.             

  1062.               // That will never happens, if you don't cheat with options :)

  1063.               if (inflator.err) { throw inflator.msg || msg[inflator.err]; }

  1064.             

  1065.               return inflator.result;

  1066.             }

  1067.             

  1068.             

  1069.             /**

  1070.              * inflateRaw(data[, options]) -> Uint8Array|Array|String

  1071.              * - data (Uint8Array|Array|String): input data to decompress.

  1072.              * - options (Object): zlib inflate options.

  1073.              *

  1074.              * The same as [[inflate]], but creates raw data, without wrapper

  1075.              * (header and adler32 crc).

  1076.              **/

  1077.             function inflateRaw(input, options) {

  1078.               options = options || {};

  1079.               options.raw = true;

  1080.               return inflate(input, options);

  1081.             }

  1082.             

  1083.             

  1084.             /**

  1085.              * ungzip(data[, options]) -> Uint8Array|Array|String

  1086.              * - data (Uint8Array|Array|String): input data to decompress.

  1087.              * - options (Object): zlib inflate options.

  1088.              *

  1089.              * Just shortcut to [[inflate]], because it autodetects format

  1090.              * by header.content. Done for convenience.

  1091.              **/

  1092.             

  1093.             

  1094.             exports.Inflate = Inflate;

  1095.             exports.inflate = inflate;

  1096.             exports.inflateRaw = inflateRaw;

  1097.             exports.ungzip  = inflate;

  1098.             

  1099.             },{"./utils/common":3,"./utils/strings":4,"./zlib/constants":6,"./zlib/gzheader":9,"./zlib/inflate":11,"./zlib/messages":13,"./zlib/zstream":15}],3:[function(require,module,exports){

  1100.             'use strict';

  1101.             

  1102.             

  1103.             var TYPED_OK =  (typeof Uint8Array !== 'undefined') &&

  1104.                             (typeof Uint16Array !== 'undefined') &&

  1105.                             (typeof Int32Array !== 'undefined');

  1106.             

  1107.             function _has(obj, key) {

  1108.               return Object.prototype.hasOwnProperty.call(obj, key);

  1109.             }

  1110.             

  1111.             exports.assign = function (obj /*from1, from2, from3, ...*/) {

  1112.               var sources = Array.prototype.slice.call(arguments, 1);

  1113.               while (sources.length) {

  1114.                 var source = sources.shift();

  1115.                 if (!source) { continue; }

  1116.             

  1117.                 if (typeof source !== 'object') {

  1118.                   throw new TypeError(source + 'must be non-object');

  1119.                 }

  1120.             

  1121.                 for (var p in source) {

  1122.                   if (_has(source, p)) {

  1123.                     obj[p] = source[p];

  1124.                   }

  1125.                 }

  1126.               }

  1127.             

  1128.               return obj;

  1129.             };

  1130.             

  1131.             

  1132.             // reduce buffer size, avoiding mem copy

  1133.             exports.shrinkBuf = function (buf, size) {

  1134.               if (buf.length === size) { return buf; }

  1135.               if (buf.subarray) { return buf.subarray(0, size); }

  1136.               buf.length = size;

  1137.               return buf;

  1138.             };

  1139.             

  1140.             

  1141.             var fnTyped = {

  1142.               arraySet: function (dest, src, src_offs, len, dest_offs) {

  1143.                 if (src.subarray && dest.subarray) {

  1144.                   dest.set(src.subarray(src_offs, src_offs + len), dest_offs);

  1145.                   return;

  1146.                 }

  1147.                 // Fallback to ordinary array

  1148.                 for (var i = 0; i < len; i++) {

  1149.                   dest[dest_offs + i] = src[src_offs + i];

  1150.                 }

  1151.               },

  1152.               // Join array of chunks to single array.

  1153.               flattenChunks: function (chunks) {

  1154.                 var i, l, len, pos, chunk, result;

  1155.             

  1156.                 // calculate data length

  1157.                 len = 0;

  1158.                 for (i = 0, l = chunks.length; i < l; i++) {

  1159.                   len += chunks[i].length;

  1160.                 }

  1161.             

  1162.                 // join chunks

  1163.                 result = new Uint8Array(len);

  1164.                 pos = 0;

  1165.                 for (i = 0, l = chunks.length; i < l; i++) {

  1166.                   chunk = chunks[i];

  1167.                   result.set(chunk, pos);

  1168.                   pos += chunk.length;

  1169.                 }

  1170.             

  1171.                 return result;

  1172.               }

  1173.             };

  1174.             

  1175.             var fnUntyped = {

  1176.               arraySet: function (dest, src, src_offs, len, dest_offs) {

  1177.                 for (var i = 0; i < len; i++) {

  1178.                   dest[dest_offs + i] = src[src_offs + i];

  1179.                 }

  1180.               },

  1181.               // Join array of chunks to single array.

  1182.               flattenChunks: function (chunks) {

  1183.                 return [].concat.apply([], chunks);

  1184.               }

  1185.             };

  1186.             

  1187.             

  1188.             // Enable/Disable typed arrays use, for testing

  1189.             //

  1190.             exports.setTyped = function (on) {

  1191.               if (on) {

  1192.                 exports.Buf8  = Uint8Array;

  1193.                 exports.Buf16 = Uint16Array;

  1194.                 exports.Buf32 = Int32Array;

  1195.                 exports.assign(exports, fnTyped);

  1196.               } else {

  1197.                 exports.Buf8  = Array;

  1198.                 exports.Buf16 = Array;

  1199.                 exports.Buf32 = Array;

  1200.                 exports.assign(exports, fnUntyped);

  1201.               }

  1202.             };

  1203.             

  1204.             exports.setTyped(TYPED_OK);

  1205.             

  1206.             },{}],4:[function(require,module,exports){

  1207.             // String encode/decode helpers

  1208.             'use strict';

  1209.             

  1210.             

  1211.             var utils = require('./common');

  1212.             

  1213.             

  1214.             // Quick check if we can use fast array to bin string conversion

  1215.             //

  1216.             // - apply(Array) can fail on Android 2.2

  1217.             // - apply(Uint8Array) can fail on iOS 5.1 Safari

  1218.             //

  1219.             var STR_APPLY_OK = true;

  1220.             var STR_APPLY_UIA_OK = true;

  1221.             

  1222.             try { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }

  1223.             try { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }

  1224.             

  1225.             

  1226.             // Table with utf8 lengths (calculated by first byte of sequence)

  1227.             // Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,

  1228.             // because max possible codepoint is 0x10ffff

  1229.             var _utf8len = new utils.Buf8(256);

  1230.             for (var q = 0; q < 256; q++) {

  1231.               _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);

  1232.             }

  1233.             _utf8len[254] = _utf8len[254] = 1; // Invalid sequence start

  1234.             

  1235.             

  1236.             // convert string to array (typed, when possible)

  1237.             exports.string2buf = function (str) {

  1238.               var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;

  1239.             

  1240.               // count binary size

  1241.               for (m_pos = 0; m_pos < str_len; m_pos++) {

  1242.                 c = str.charCodeAt(m_pos);

  1243.                 if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {

  1244.                   c2 = str.charCodeAt(m_pos + 1);

  1245.                   if ((c2 & 0xfc00) === 0xdc00) {

  1246.                     c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);

  1247.                     m_pos++;

  1248.                   }

  1249.                 }

  1250.                 buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;

  1251.               }

  1252.             

  1253.               // allocate buffer

  1254.               buf = new utils.Buf8(buf_len);

  1255.             

  1256.               // convert

  1257.               for (i = 0, m_pos = 0; i < buf_len; m_pos++) {

  1258.                 c = str.charCodeAt(m_pos);

  1259.                 if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {

  1260.                   c2 = str.charCodeAt(m_pos + 1);

  1261.                   if ((c2 & 0xfc00) === 0xdc00) {

  1262.                     c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);

  1263.                     m_pos++;

  1264.                   }

  1265.                 }

  1266.                 if (c < 0x80) {

  1267.                   /* one byte */

  1268.                   buf[i++] = c;

  1269.                 } else if (c < 0x800) {

  1270.                   /* two bytes */

  1271.                   buf[i++] = 0xC0 | (c >>> 6);

  1272.                   buf[i++] = 0x80 | (c & 0x3f);

  1273.                 } else if (c < 0x10000) {

  1274.                   /* three bytes */

  1275.                   buf[i++] = 0xE0 | (c >>> 12);

  1276.                   buf[i++] = 0x80 | (c >>> 6 & 0x3f);

  1277.                   buf[i++] = 0x80 | (c & 0x3f);

  1278.                 } else {

  1279.                   /* four bytes */

  1280.                   buf[i++] = 0xf0 | (c >>> 18);

  1281.                   buf[i++] = 0x80 | (c >>> 12 & 0x3f);

  1282.                   buf[i++] = 0x80 | (c >>> 6 & 0x3f);

  1283.                   buf[i++] = 0x80 | (c & 0x3f);

  1284.                 }

  1285.               }

  1286.             

  1287.               return buf;

  1288.             };

  1289.             

  1290.             // Helper (used in 2 places)

  1291.             function buf2binstring(buf, len) {

  1292.               // On Chrome, the arguments in a function call that are allowed is `65534`.

  1293.               // If the length of the buffer is smaller than that, we can use this optimization,

  1294.               // otherwise we will take a slower path.

  1295.               if (len < 65534) {

  1296.                 if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {

  1297.                   return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));

  1298.                 }

  1299.               }

  1300.             

  1301.               var result = '';

  1302.               for (var i = 0; i < len; i++) {

  1303.                 result += String.fromCharCode(buf[i]);

  1304.               }

  1305.               return result;

  1306.             }

  1307.             

  1308.             

  1309.             // Convert byte array to binary string

  1310.             exports.buf2binstring = function (buf) {

  1311.               return buf2binstring(buf, buf.length);

  1312.             };

  1313.             

  1314.             

  1315.             // Convert binary string (typed, when possible)

  1316.             exports.binstring2buf = function (str) {

  1317.               var buf = new utils.Buf8(str.length);

  1318.               for (var i = 0, len = buf.length; i < len; i++) {

  1319.                 buf[i] = str.charCodeAt(i);

  1320.               }

  1321.               return buf;

  1322.             };

  1323.             

  1324.             

  1325.             // convert array to string

  1326.             exports.buf2string = function (buf, max) {

  1327.               var i, out, c, c_len;

  1328.               var len = max || buf.length;

  1329.             

  1330.               // Reserve max possible length (2 words per char)

  1331.               // NB: by unknown reasons, Array is significantly faster for

  1332.               //     String.fromCharCode.apply than Uint16Array.

  1333.               var utf16buf = new Array(len * 2);

  1334.             

  1335.               for (out = 0, i = 0; i < len;) {

  1336.                 c = buf[i++];

  1337.                 // quick process ascii

  1338.                 if (c < 0x80) { utf16buf[out++] = c; continue; }

  1339.             

  1340.                 c_len = _utf8len[c];

  1341.                 // skip 5 & 6 byte codes

  1342.                 if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }

  1343.             

  1344.                 // apply mask on first byte

  1345.                 c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;

  1346.                 // join the rest

  1347.                 while (c_len > 1 && i < len) {

  1348.                   c = (c << 6) | (buf[i++] & 0x3f);

  1349.                   c_len--;

  1350.                 }

  1351.             

  1352.                 // terminated by end of string?

  1353.                 if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }

  1354.             

  1355.                 if (c < 0x10000) {

  1356.                   utf16buf[out++] = c;

  1357.                 } else {

  1358.                   c -= 0x10000;

  1359.                   utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);

  1360.                   utf16buf[out++] = 0xdc00 | (c & 0x3ff);

  1361.                 }

  1362.               }

  1363.             

  1364.               return buf2binstring(utf16buf, out);

  1365.             };

  1366.             

  1367.             

  1368.             // Calculate max possible position in utf8 buffer,

  1369.             // that will not break sequence. If that's not possible

  1370.             // - (very small limits) return max size as is.

  1371.             //

  1372.             // buf[] - utf8 bytes array

  1373.             // max   - length limit (mandatory);

  1374.             exports.utf8border = function (buf, max) {

  1375.               var pos;

  1376.             

  1377.               max = max || buf.length;

  1378.               if (max > buf.length) { max = buf.length; }

  1379.             

  1380.               // go back from last position, until start of sequence found

  1381.               pos = max - 1;

  1382.               while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }

  1383.             

  1384.               // Very small and broken sequence,

  1385.               // return max, because we should return something anyway.

  1386.               if (pos < 0) { return max; }

  1387.             

  1388.               // If we came to start of buffer - that means buffer is too small,

  1389.               // return max too.

  1390.               if (pos === 0) { return max; }

  1391.             

  1392.               return (pos + _utf8len[buf[pos]] > max) ? pos : max;

  1393.             };

  1394.             

  1395.             },{"./common":3}],5:[function(require,module,exports){

  1396.             'use strict';

  1397.             

  1398.             // Note: adler32 takes 12% for level 0 and 2% for level 6.

  1399.             // It isn't worth it to make additional optimizations as in original.

  1400.             // Small size is preferable.

  1401.             

  1402.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  1403.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  1404.             //

  1405.             // This software is provided 'as-is', without any express or implied

  1406.             // warranty. In no event will the authors be held liable for any damages

  1407.             // arising from the use of this software.

  1408.             //

  1409.             // Permission is granted to anyone to use this software for any purpose,

  1410.             // including commercial applications, and to alter it and redistribute it

  1411.             // freely, subject to the following restrictions:

  1412.             //

  1413.             // 1. The origin of this software must not be misrepresented; you must not

  1414.             //   claim that you wrote the original software. If you use this software

  1415.             //   in a product, an acknowledgment in the product documentation would be

  1416.             //   appreciated but is not required.

  1417.             // 2. Altered source versions must be plainly marked as such, and must not be

  1418.             //   misrepresented as being the original software.

  1419.             // 3. This notice may not be removed or altered from any source distribution.

  1420.             

  1421.             function adler32(adler, buf, len, pos) {

  1422.               var s1 = (adler & 0xffff) |0,

  1423.                   s2 = ((adler >>> 16) & 0xffff) |0,

  1424.                   n = 0;

  1425.             

  1426.               while (len !== 0) {

  1427.                 // Set limit ~ twice less than 5552, to keep

  1428.                 // s2 in 31-bits, because we force signed ints.

  1429.                 // in other case %= will fail.

  1430.                 n = len > 2000 ? 2000 : len;

  1431.                 len -= n;

  1432.             

  1433.                 do {

  1434.                   s1 = (s1 + buf[pos++]) |0;

  1435.                   s2 = (s2 + s1) |0;

  1436.                 } while (--n);

  1437.             

  1438.                 s1 %= 65521;

  1439.                 s2 %= 65521;

  1440.               }

  1441.             

  1442.               return (s1 | (s2 << 16)) |0;

  1443.             }

  1444.             

  1445.             

  1446.             module.exports = adler32;

  1447.             

  1448.             },{}],6:[function(require,module,exports){

  1449.             'use strict';

  1450.             

  1451.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  1452.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  1453.             //

  1454.             // This software is provided 'as-is', without any express or implied

  1455.             // warranty. In no event will the authors be held liable for any damages

  1456.             // arising from the use of this software.

  1457.             //

  1458.             // Permission is granted to anyone to use this software for any purpose,

  1459.             // including commercial applications, and to alter it and redistribute it

  1460.             // freely, subject to the following restrictions:

  1461.             //

  1462.             // 1. The origin of this software must not be misrepresented; you must not

  1463.             //   claim that you wrote the original software. If you use this software

  1464.             //   in a product, an acknowledgment in the product documentation would be

  1465.             //   appreciated but is not required.

  1466.             // 2. Altered source versions must be plainly marked as such, and must not be

  1467.             //   misrepresented as being the original software.

  1468.             // 3. This notice may not be removed or altered from any source distribution.

  1469.             

  1470.             module.exports = {

  1471.             

  1472.               /* Allowed flush values; see deflate() and inflate() below for details */

  1473.               Z_NO_FLUSH:         0,

  1474.               Z_PARTIAL_FLUSH:    1,

  1475.               Z_SYNC_FLUSH:       2,

  1476.               Z_FULL_FLUSH:       3,

  1477.               Z_FINISH:           4,

  1478.               Z_BLOCK:            5,

  1479.               Z_TREES:            6,

  1480.             

  1481.               /* Return codes for the compression/decompression functions. Negative values

  1482.               * are errors, positive values are used for special but normal events.

  1483.               */

  1484.               Z_OK:               0,

  1485.               Z_STREAM_END:       1,

  1486.               Z_NEED_DICT:        2,

  1487.               Z_ERRNO:           -1,

  1488.               Z_STREAM_ERROR:    -2,

  1489.               Z_DATA_ERROR:      -3,

  1490.               //Z_MEM_ERROR:     -4,

  1491.               Z_BUF_ERROR:       -5,

  1492.               //Z_VERSION_ERROR: -6,

  1493.             

  1494.               /* compression levels */

  1495.               Z_NO_COMPRESSION:         0,

  1496.               Z_BEST_SPEED:             1,

  1497.               Z_BEST_COMPRESSION:       9,

  1498.               Z_DEFAULT_COMPRESSION:   -1,

  1499.             

  1500.             

  1501.               Z_FILTERED:               1,

  1502.               Z_HUFFMAN_ONLY:           2,

  1503.               Z_RLE:                    3,

  1504.               Z_FIXED:                  4,

  1505.               Z_DEFAULT_STRATEGY:       0,

  1506.             

  1507.               /* Possible values of the data_type field (though see inflate()) */

  1508.               Z_BINARY:                 0,

  1509.               Z_TEXT:                   1,

  1510.               //Z_ASCII:                1, // = Z_TEXT (deprecated)

  1511.               Z_UNKNOWN:                2,

  1512.             

  1513.               /* The deflate compression method */

  1514.               Z_DEFLATED:               8

  1515.               //Z_NULL:                 null // Use -1 or null inline, depending on var type

  1516.             };

  1517.             

  1518.             },{}],7:[function(require,module,exports){

  1519.             'use strict';

  1520.             

  1521.             // Note: we can't get significant speed boost here.

  1522.             // So write code to minimize size - no pregenerated tables

  1523.             // and array tools dependencies.

  1524.             

  1525.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  1526.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  1527.             //

  1528.             // This software is provided 'as-is', without any express or implied

  1529.             // warranty. In no event will the authors be held liable for any damages

  1530.             // arising from the use of this software.

  1531.             //

  1532.             // Permission is granted to anyone to use this software for any purpose,

  1533.             // including commercial applications, and to alter it and redistribute it

  1534.             // freely, subject to the following restrictions:

  1535.             //

  1536.             // 1. The origin of this software must not be misrepresented; you must not

  1537.             //   claim that you wrote the original software. If you use this software

  1538.             //   in a product, an acknowledgment in the product documentation would be

  1539.             //   appreciated but is not required.

  1540.             // 2. Altered source versions must be plainly marked as such, and must not be

  1541.             //   misrepresented as being the original software.

  1542.             // 3. This notice may not be removed or altered from any source distribution.

  1543.             

  1544.             // Use ordinary array, since untyped makes no boost here

  1545.             function makeTable() {

  1546.               var c, table = [];

  1547.             

  1548.               for (var n = 0; n < 256; n++) {

  1549.                 c = n;

  1550.                 for (var k = 0; k < 8; k++) {

  1551.                   c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));

  1552.                 }

  1553.                 table[n] = c;

  1554.               }

  1555.             

  1556.               return table;

  1557.             }

  1558.             

  1559.             // Create table on load. Just 255 signed longs. Not a problem.

  1560.             var crcTable = makeTable();

  1561.             

  1562.             

  1563.             function crc32(crc, buf, len, pos) {

  1564.               var t = crcTable,

  1565.                   end = pos + len;

  1566.             

  1567.               crc ^= -1;

  1568.             

  1569.               for (var i = pos; i < end; i++) {

  1570.                 crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];

  1571.               }

  1572.             

  1573.               return (crc ^ (-1)); // >>> 0;

  1574.             }

  1575.             

  1576.             

  1577.             module.exports = crc32;

  1578.             

  1579.             },{}],8:[function(require,module,exports){

  1580.             'use strict';

  1581.             

  1582.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  1583.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  1584.             //

  1585.             // This software is provided 'as-is', without any express or implied

  1586.             // warranty. In no event will the authors be held liable for any damages

  1587.             // arising from the use of this software.

  1588.             //

  1589.             // Permission is granted to anyone to use this software for any purpose,

  1590.             // including commercial applications, and to alter it and redistribute it

  1591.             // freely, subject to the following restrictions:

  1592.             //

  1593.             // 1. The origin of this software must not be misrepresented; you must not

  1594.             //   claim that you wrote the original software. If you use this software

  1595.             //   in a product, an acknowledgment in the product documentation would be

  1596.             //   appreciated but is not required.

  1597.             // 2. Altered source versions must be plainly marked as such, and must not be

  1598.             //   misrepresented as being the original software.

  1599.             // 3. This notice may not be removed or altered from any source distribution.

  1600.             

  1601.             var utils   = require('../utils/common');

  1602.             var trees   = require('./trees');

  1603.             var adler32 = require('./adler32');

  1604.             var crc32   = require('./crc32');

  1605.             var msg     = require('./messages');

  1606.             

  1607.             /* Public constants ==========================================================*/

  1608.             /* ===========================================================================*/

  1609.             

  1610.             

  1611.             /* Allowed flush values; see deflate() and inflate() below for details */

  1612.             var Z_NO_FLUSH      = 0;

  1613.             var Z_PARTIAL_FLUSH = 1;

  1614.             //var Z_SYNC_FLUSH    = 2;

  1615.             var Z_FULL_FLUSH    = 3;

  1616.             var Z_FINISH        = 4;

  1617.             var Z_BLOCK         = 5;

  1618.             //var Z_TREES         = 6;

  1619.             

  1620.             

  1621.             /* Return codes for the compression/decompression functions. Negative values

  1622.              * are errors, positive values are used for special but normal events.

  1623.              */

  1624.             var Z_OK            = 0;

  1625.             var Z_STREAM_END    = 1;

  1626.             //var Z_NEED_DICT     = 2;

  1627.             //var Z_ERRNO         = -1;

  1628.             var Z_STREAM_ERROR  = -2;

  1629.             var Z_DATA_ERROR    = -3;

  1630.             //var Z_MEM_ERROR     = -4;

  1631.             var Z_BUF_ERROR     = -5;

  1632.             //var Z_VERSION_ERROR = -6;

  1633.             

  1634.             

  1635.             /* compression levels */

  1636.             //var Z_NO_COMPRESSION      = 0;

  1637.             //var Z_BEST_SPEED          = 1;

  1638.             //var Z_BEST_COMPRESSION    = 9;

  1639.             var Z_DEFAULT_COMPRESSION = -1;

  1640.             

  1641.             

  1642.             var Z_FILTERED            = 1;

  1643.             var Z_HUFFMAN_ONLY        = 2;

  1644.             var Z_RLE                 = 3;

  1645.             var Z_FIXED               = 4;

  1646.             var Z_DEFAULT_STRATEGY    = 0;

  1647.             

  1648.             /* Possible values of the data_type field (though see inflate()) */

  1649.             //var Z_BINARY              = 0;

  1650.             //var Z_TEXT                = 1;

  1651.             //var Z_ASCII               = 1; // = Z_TEXT

  1652.             var Z_UNKNOWN             = 2;

  1653.             

  1654.             

  1655.             /* The deflate compression method */

  1656.             var Z_DEFLATED  = 8;

  1657.             

  1658.             /*============================================================================*/

  1659.             

  1660.             

  1661.             var MAX_MEM_LEVEL = 9;

  1662.             /* Maximum value for memLevel in deflateInit2 */

  1663.             var MAX_WBITS = 15;

  1664.             /* 32K LZ77 window */

  1665.             var DEF_MEM_LEVEL = 8;

  1666.             

  1667.             

  1668.             var LENGTH_CODES  = 29;

  1669.             /* number of length codes, not counting the special END_BLOCK code */

  1670.             var LITERALS      = 256;

  1671.             /* number of literal bytes 0..255 */

  1672.             var L_CODES       = LITERALS + 1 + LENGTH_CODES;

  1673.             /* number of Literal or Length codes, including the END_BLOCK code */

  1674.             var D_CODES       = 30;

  1675.             /* number of distance codes */

  1676.             var BL_CODES      = 19;

  1677.             /* number of codes used to transfer the bit lengths */

  1678.             var HEAP_SIZE     = 2 * L_CODES + 1;

  1679.             /* maximum heap size */

  1680.             var MAX_BITS  = 15;

  1681.             /* All codes must not exceed MAX_BITS bits */

  1682.             

  1683.             var MIN_MATCH = 3;

  1684.             var MAX_MATCH = 258;

  1685.             var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);

  1686.             

  1687.             var PRESET_DICT = 0x20;

  1688.             

  1689.             var INIT_STATE = 42;

  1690.             var EXTRA_STATE = 69;

  1691.             var NAME_STATE = 73;

  1692.             var COMMENT_STATE = 91;

  1693.             var HCRC_STATE = 103;

  1694.             var BUSY_STATE = 113;

  1695.             var FINISH_STATE = 666;

  1696.             

  1697.             var BS_NEED_MORE      = 1; /* block not completed, need more input or more output */

  1698.             var BS_BLOCK_DONE     = 2; /* block flush performed */

  1699.             var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */

  1700.             var BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */

  1701.             

  1702.             var OS_CODE = 0x03; // Unix :) . Don't detect, use this default.

  1703.             

  1704.             function err(strm, errorCode) {

  1705.               strm.msg = msg[errorCode];

  1706.               return errorCode;

  1707.             }

  1708.             

  1709.             function rank(f) {

  1710.               return ((f) << 1) - ((f) > 4 ? 9 : 0);

  1711.             }

  1712.             

  1713.             function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }

  1714.             

  1715.             

  1716.             /* =========================================================================

  1717.              * Flush as much pending output as possible. All deflate() output goes

  1718.              * through this function so some applications may wish to modify it

  1719.              * to avoid allocating a large strm->output buffer and copying into it.

  1720.              * (See also read_buf()).

  1721.              */

  1722.             function flush_pending(strm) {

  1723.               var s = strm.state;

  1724.             

  1725.               //_tr_flush_bits(s);

  1726.               var len = s.pending;

  1727.               if (len > strm.avail_out) {

  1728.                 len = strm.avail_out;

  1729.               }

  1730.               if (len === 0) { return; }

  1731.             

  1732.               utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);

  1733.               strm.next_out += len;

  1734.               s.pending_out += len;

  1735.               strm.total_out += len;

  1736.               strm.avail_out -= len;

  1737.               s.pending -= len;

  1738.               if (s.pending === 0) {

  1739.                 s.pending_out = 0;

  1740.               }

  1741.             }

  1742.             

  1743.             

  1744.             function flush_block_only(s, last) {

  1745.               trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);

  1746.               s.block_start = s.strstart;

  1747.               flush_pending(s.strm);

  1748.             }

  1749.             

  1750.             

  1751.             function put_byte(s, b) {

  1752.               s.pending_buf[s.pending++] = b;

  1753.             }

  1754.             

  1755.             

  1756.             /* =========================================================================

  1757.              * Put a short in the pending buffer. The 16-bit value is put in MSB order.

  1758.              * IN assertion: the stream state is correct and there is enough room in

  1759.              * pending_buf.

  1760.              */

  1761.             function putShortMSB(s, b) {

  1762.             //  put_byte(s, (Byte)(b >> 8));

  1763.             //  put_byte(s, (Byte)(b & 0xff));

  1764.               s.pending_buf[s.pending++] = (b >>> 8) & 0xff;

  1765.               s.pending_buf[s.pending++] = b & 0xff;

  1766.             }

  1767.             

  1768.             

  1769.             /* ===========================================================================

  1770.              * Read a new buffer from the current input stream, update the adler32

  1771.              * and total number of bytes read.  All deflate() input goes through

  1772.              * this function so some applications may wish to modify it to avoid

  1773.              * allocating a large strm->input buffer and copying from it.

  1774.              * (See also flush_pending()).

  1775.              */

  1776.             function read_buf(strm, buf, start, size) {

  1777.               var len = strm.avail_in;

  1778.             

  1779.               if (len > size) { len = size; }

  1780.               if (len === 0) { return 0; }

  1781.             

  1782.               strm.avail_in -= len;

  1783.             

  1784.               // zmemcpy(buf, strm->next_in, len);

  1785.               utils.arraySet(buf, strm.input, strm.next_in, len, start);

  1786.               if (strm.state.wrap === 1) {

  1787.                 strm.adler = adler32(strm.adler, buf, len, start);

  1788.               }

  1789.             

  1790.               else if (strm.state.wrap === 2) {

  1791.                 strm.adler = crc32(strm.adler, buf, len, start);

  1792.               }

  1793.             

  1794.               strm.next_in += len;

  1795.               strm.total_in += len;

  1796.             

  1797.               return len;

  1798.             }

  1799.             

  1800.             

  1801.             /* ===========================================================================

  1802.              * Set match_start to the longest match starting at the given string and

  1803.              * return its length. Matches shorter or equal to prev_length are discarded,

  1804.              * in which case the result is equal to prev_length and match_start is

  1805.              * garbage.

  1806.              * IN assertions: cur_match is the head of the hash chain for the current

  1807.              *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1

  1808.              * OUT assertion: the match length is not greater than s->lookahead.

  1809.              */

  1810.             function longest_match(s, cur_match) {

  1811.               var chain_length = s.max_chain_length;      /* max hash chain length */

  1812.               var scan = s.strstart; /* current string */

  1813.               var match;                       /* matched string */

  1814.               var len;                           /* length of current match */

  1815.               var best_len = s.prev_length;              /* best match length so far */

  1816.               var nice_match = s.nice_match;             /* stop if match long enough */

  1817.               var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?

  1818.                   s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;

  1819.             

  1820.               var _win = s.window; // shortcut

  1821.             

  1822.               var wmask = s.w_mask;

  1823.               var prev  = s.prev;

  1824.             

  1825.               /* Stop when cur_match becomes <= limit. To simplify the code,

  1826.                * we prevent matches with the string of window index 0.

  1827.                */

  1828.             

  1829.               var strend = s.strstart + MAX_MATCH;

  1830.               var scan_end1  = _win[scan + best_len - 1];

  1831.               var scan_end   = _win[scan + best_len];

  1832.             

  1833.               /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.

  1834.                * It is easy to get rid of this optimization if necessary.

  1835.                */

  1836.               // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");

  1837.             

  1838.               /* Do not waste too much time if we already have a good match: */

  1839.               if (s.prev_length >= s.good_match) {

  1840.                 chain_length >>= 2;

  1841.               }

  1842.               /* Do not look for matches beyond the end of the input. This is necessary

  1843.                * to make deflate deterministic.

  1844.                */

  1845.               if (nice_match > s.lookahead) { nice_match = s.lookahead; }

  1846.             

  1847.               // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");

  1848.             

  1849.               do {

  1850.                 // Assert(cur_match < s->strstart, "no future");

  1851.                 match = cur_match;

  1852.             

  1853.                 /* Skip to next match if the match length cannot increase

  1854.                  * or if the match length is less than 2.  Note that the checks below

  1855.                  * for insufficient lookahead only occur occasionally for performance

  1856.                  * reasons.  Therefore uninitialized memory will be accessed, and

  1857.                  * conditional jumps will be made that depend on those values.

  1858.                  * However the length of the match is limited to the lookahead, so

  1859.                  * the output of deflate is not affected by the uninitialized values.

  1860.                  */

  1861.             

  1862.                 if (_win[match + best_len]     !== scan_end  ||

  1863.                     _win[match + best_len - 1] !== scan_end1 ||

  1864.                     _win[match]                !== _win[scan] ||

  1865.                     _win[++match]              !== _win[scan + 1]) {

  1866.                   continue;

  1867.                 }

  1868.             

  1869.                 /* The check at best_len-1 can be removed because it will be made

  1870.                  * again later. (This heuristic is not always a win.)

  1871.                  * It is not necessary to compare scan[2] and match[2] since they

  1872.                  * are always equal when the other bytes match, given that

  1873.                  * the hash keys are equal and that HASH_BITS >= 8.

  1874.                  */

  1875.                 scan += 2;

  1876.                 match++;

  1877.                 // Assert(*scan == *match, "match[2]?");

  1878.             

  1879.                 /* We check for insufficient lookahead only every 8th comparison;

  1880.                  * the 256th check will be made at strstart+258.

  1881.                  */

  1882.                 do {

  1883.                   /*jshint noempty:false*/

  1884.                 } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&

  1885.                          _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&

  1886.                          _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&

  1887.                          _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&

  1888.                          scan < strend);

  1889.             

  1890.                 // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

  1891.             

  1892.                 len = MAX_MATCH - (strend - scan);

  1893.                 scan = strend - MAX_MATCH;

  1894.             

  1895.                 if (len > best_len) {

  1896.                   s.match_start = cur_match;

  1897.                   best_len = len;

  1898.                   if (len >= nice_match) {

  1899.                     break;

  1900.                   }

  1901.                   scan_end1  = _win[scan + best_len - 1];

  1902.                   scan_end   = _win[scan + best_len];

  1903.                 }

  1904.               } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);

  1905.             

  1906.               if (best_len <= s.lookahead) {

  1907.                 return best_len;

  1908.               }

  1909.               return s.lookahead;

  1910.             }

  1911.             

  1912.             

  1913.             /* ===========================================================================

  1914.              * Fill the window when the lookahead becomes insufficient.

  1915.              * Updates strstart and lookahead.

  1916.              *

  1917.              * IN assertion: lookahead < MIN_LOOKAHEAD

  1918.              * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD

  1919.              *    At least one byte has been read, or avail_in == 0; reads are

  1920.              *    performed for at least two bytes (required for the zip translate_eol

  1921.              *    option -- not supported here).

  1922.              */

  1923.             function fill_window(s) {

  1924.               var _w_size = s.w_size;

  1925.               var p, n, m, more, str;

  1926.             

  1927.               //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");

  1928.             

  1929.               do {

  1930.                 more = s.window_size - s.lookahead - s.strstart;

  1931.             

  1932.                 // JS ints have 32 bit, block below not needed

  1933.                 /* Deal with !@#$% 64K limit: */

  1934.                 //if (sizeof(int) <= 2) {

  1935.                 //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {

  1936.                 //        more = wsize;

  1937.                 //

  1938.                 //  } else if (more == (unsigned)(-1)) {

  1939.                 //        /* Very unlikely, but possible on 16 bit machine if

  1940.                 //         * strstart == 0 && lookahead == 1 (input done a byte at time)

  1941.                 //         */

  1942.                 //        more--;

  1943.                 //    }

  1944.                 //}

  1945.             

  1946.             

  1947.                 /* If the window is almost full and there is insufficient lookahead,

  1948.                  * move the upper half to the lower one to make room in the upper half.

  1949.                  */

  1950.                 if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {

  1951.             

  1952.                   utils.arraySet(s.window, s.window, _w_size, _w_size, 0);

  1953.                   s.match_start -= _w_size;

  1954.                   s.strstart -= _w_size;

  1955.                   /* we now have strstart >= MAX_DIST */

  1956.                   s.block_start -= _w_size;

  1957.             

  1958.                   /* Slide the hash table (could be avoided with 32 bit values

  1959.                    at the expense of memory usage). We slide even when level == 0

  1960.                    to keep the hash table consistent if we switch back to level > 0

  1961.                    later. (Using level 0 permanently is not an optimal usage of

  1962.                    zlib, so we don't care about this pathological case.)

  1963.                    */

  1964.             

  1965.                   n = s.hash_size;

  1966.                   p = n;

  1967.                   do {

  1968.                     m = s.head[--p];

  1969.                     s.head[p] = (m >= _w_size ? m - _w_size : 0);

  1970.                   } while (--n);

  1971.             

  1972.                   n = _w_size;

  1973.                   p = n;

  1974.                   do {

  1975.                     m = s.prev[--p];

  1976.                     s.prev[p] = (m >= _w_size ? m - _w_size : 0);

  1977.                     /* If n is not on any hash chain, prev[n] is garbage but

  1978.                      * its value will never be used.

  1979.                      */

  1980.                   } while (--n);

  1981.             

  1982.                   more += _w_size;

  1983.                 }

  1984.                 if (s.strm.avail_in === 0) {

  1985.                   break;

  1986.                 }

  1987.             

  1988.                 /* If there was no sliding:

  1989.                  *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&

  1990.                  *    more == window_size - lookahead - strstart

  1991.                  * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)

  1992.                  * => more >= window_size - 2*WSIZE + 2

  1993.                  * In the BIG_MEM or MMAP case (not yet supported),

  1994.                  *   window_size == input_size + MIN_LOOKAHEAD  &&

  1995.                  *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.

  1996.                  * Otherwise, window_size == 2*WSIZE so more >= 2.

  1997.                  * If there was sliding, more >= WSIZE. So in all cases, more >= 2.

  1998.                  */

  1999.                 //Assert(more >= 2, "more < 2");

  2000.                 n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);

  2001.                 s.lookahead += n;

  2002.             

  2003.                 /* Initialize the hash value now that we have some input: */

  2004.                 if (s.lookahead + s.insert >= MIN_MATCH) {

  2005.                   str = s.strstart - s.insert;

  2006.                   s.ins_h = s.window[str];

  2007.             

  2008.                   /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */

  2009.                   s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;

  2010.             //#if MIN_MATCH != 3

  2011.             //        Call update_hash() MIN_MATCH-3 more times

  2012.             //#endif

  2013.                   while (s.insert) {

  2014.                     /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */

  2015.                     s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;

  2016.             

  2017.                     s.prev[str & s.w_mask] = s.head[s.ins_h];

  2018.                     s.head[s.ins_h] = str;

  2019.                     str++;

  2020.                     s.insert--;

  2021.                     if (s.lookahead + s.insert < MIN_MATCH) {

  2022.                       break;

  2023.                     }

  2024.                   }

  2025.                 }

  2026.                 /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,

  2027.                  * but this is not important since only literal bytes will be emitted.

  2028.                  */

  2029.             

  2030.               } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);

  2031.             

  2032.               /* If the WIN_INIT bytes after the end of the current data have never been

  2033.                * written, then zero those bytes in order to avoid memory check reports of

  2034.                * the use of uninitialized (or uninitialised as Julian writes) bytes by

  2035.                * the longest match routines.  Update the high water mark for the next

  2036.                * time through here.  WIN_INIT is set to MAX_MATCH since the longest match

  2037.                * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.

  2038.                */

  2039.             //  if (s.high_water < s.window_size) {

  2040.             //    var curr = s.strstart + s.lookahead;

  2041.             //    var init = 0;

  2042.             //

  2043.             //    if (s.high_water < curr) {

  2044.             //      /* Previous high water mark below current data -- zero WIN_INIT

  2045.             //       * bytes or up to end of window, whichever is less.

  2046.             //       */

  2047.             //      init = s.window_size - curr;

  2048.             //      if (init > WIN_INIT)

  2049.             //        init = WIN_INIT;

  2050.             //      zmemzero(s->window + curr, (unsigned)init);

  2051.             //      s->high_water = curr + init;

  2052.             //    }

  2053.             //    else if (s->high_water < (ulg)curr + WIN_INIT) {

  2054.             //      /* High water mark at or above current data, but below current data

  2055.             //       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up

  2056.             //       * to end of window, whichever is less.

  2057.             //       */

  2058.             //      init = (ulg)curr + WIN_INIT - s->high_water;

  2059.             //      if (init > s->window_size - s->high_water)

  2060.             //        init = s->window_size - s->high_water;

  2061.             //      zmemzero(s->window + s->high_water, (unsigned)init);

  2062.             //      s->high_water += init;

  2063.             //    }

  2064.             //  }

  2065.             //

  2066.             //  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,

  2067.             //    "not enough room for search");

  2068.             }

  2069.             

  2070.             /* ===========================================================================

  2071.              * Copy without compression as much as possible from the input stream, return

  2072.              * the current block state.

  2073.              * This function does not insert new strings in the dictionary since

  2074.              * uncompressible data is probably not useful. This function is used

  2075.              * only for the level=0 compression option.

  2076.              * NOTE: this function should be optimized to avoid extra copying from

  2077.              * window to pending_buf.

  2078.              */

  2079.             function deflate_stored(s, flush) {

  2080.               /* Stored blocks are limited to 0xffff bytes, pending_buf is limited

  2081.                * to pending_buf_size, and each stored block has a 5 byte header:

  2082.                */

  2083.               var max_block_size = 0xffff;

  2084.             

  2085.               if (max_block_size > s.pending_buf_size - 5) {

  2086.                 max_block_size = s.pending_buf_size - 5;

  2087.               }

  2088.             

  2089.               /* Copy as much as possible from input to output: */

  2090.               for (;;) {

  2091.                 /* Fill the window as much as possible: */

  2092.                 if (s.lookahead <= 1) {

  2093.             

  2094.                   //Assert(s->strstart < s->w_size+MAX_DIST(s) ||

  2095.                   //  s->block_start >= (long)s->w_size, "slide too late");

  2096.             //      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||

  2097.             //        s.block_start >= s.w_size)) {

  2098.             //        throw  new Error("slide too late");

  2099.             //      }

  2100.             

  2101.                   fill_window(s);

  2102.                   if (s.lookahead === 0 && flush === Z_NO_FLUSH) {

  2103.                     return BS_NEED_MORE;

  2104.                   }

  2105.             

  2106.                   if (s.lookahead === 0) {

  2107.                     break;

  2108.                   }

  2109.                   /* flush the current block */

  2110.                 }

  2111.                 //Assert(s->block_start >= 0L, "block gone");

  2112.             //    if (s.block_start < 0) throw new Error("block gone");

  2113.             

  2114.                 s.strstart += s.lookahead;

  2115.                 s.lookahead = 0;

  2116.             

  2117.                 /* Emit a stored block if pending_buf will be full: */

  2118.                 var max_start = s.block_start + max_block_size;

  2119.             

  2120.                 if (s.strstart === 0 || s.strstart >= max_start) {

  2121.                   /* strstart == 0 is possible when wraparound on 16-bit machine */

  2122.                   s.lookahead = s.strstart - max_start;

  2123.                   s.strstart = max_start;

  2124.                   /*** FLUSH_BLOCK(s, 0); ***/

  2125.                   flush_block_only(s, false);

  2126.                   if (s.strm.avail_out === 0) {

  2127.                     return BS_NEED_MORE;

  2128.                   }

  2129.                   /***/

  2130.             

  2131.             

  2132.                 }

  2133.                 /* Flush if we may have to slide, otherwise block_start may become

  2134.                  * negative and the data will be gone:

  2135.                  */

  2136.                 if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {

  2137.                   /*** FLUSH_BLOCK(s, 0); ***/

  2138.                   flush_block_only(s, false);

  2139.                   if (s.strm.avail_out === 0) {

  2140.                     return BS_NEED_MORE;

  2141.                   }

  2142.                   /***/

  2143.                 }

  2144.               }

  2145.             

  2146.               s.insert = 0;

  2147.             

  2148.               if (flush === Z_FINISH) {

  2149.                 /*** FLUSH_BLOCK(s, 1); ***/

  2150.                 flush_block_only(s, true);

  2151.                 if (s.strm.avail_out === 0) {

  2152.                   return BS_FINISH_STARTED;

  2153.                 }

  2154.                 /***/

  2155.                 return BS_FINISH_DONE;

  2156.               }

  2157.             

  2158.               if (s.strstart > s.block_start) {

  2159.                 /*** FLUSH_BLOCK(s, 0); ***/

  2160.                 flush_block_only(s, false);

  2161.                 if (s.strm.avail_out === 0) {

  2162.                   return BS_NEED_MORE;

  2163.                 }

  2164.                 /***/

  2165.               }

  2166.             

  2167.               return BS_NEED_MORE;

  2168.             }

  2169.             

  2170.             /* ===========================================================================

  2171.              * Compress as much as possible from the input stream, return the current

  2172.              * block state.

  2173.              * This function does not perform lazy evaluation of matches and inserts

  2174.              * new strings in the dictionary only for unmatched strings or for short

  2175.              * matches. It is used only for the fast compression options.

  2176.              */

  2177.             function deflate_fast(s, flush) {

  2178.               var hash_head;        /* head of the hash chain */

  2179.               var bflush;           /* set if current block must be flushed */

  2180.             

  2181.               for (;;) {

  2182.                 /* Make sure that we always have enough lookahead, except

  2183.                  * at the end of the input file. We need MAX_MATCH bytes

  2184.                  * for the next match, plus MIN_MATCH bytes to insert the

  2185.                  * string following the next match.

  2186.                  */

  2187.                 if (s.lookahead < MIN_LOOKAHEAD) {

  2188.                   fill_window(s);

  2189.                   if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {

  2190.                     return BS_NEED_MORE;

  2191.                   }

  2192.                   if (s.lookahead === 0) {

  2193.                     break; /* flush the current block */

  2194.                   }

  2195.                 }

  2196.             

  2197.                 /* Insert the string window[strstart .. strstart+2] in the

  2198.                  * dictionary, and set hash_head to the head of the hash chain:

  2199.                  */

  2200.                 hash_head = 0/*NIL*/;

  2201.                 if (s.lookahead >= MIN_MATCH) {

  2202.                   /*** INSERT_STRING(s, s.strstart, hash_head); ***/

  2203.                   s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;

  2204.                   hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];

  2205.                   s.head[s.ins_h] = s.strstart;

  2206.                   /***/

  2207.                 }

  2208.             

  2209.                 /* Find the longest match, discarding those <= prev_length.

  2210.                  * At this point we have always match_length < MIN_MATCH

  2211.                  */

  2212.                 if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {

  2213.                   /* To simplify the code, we prevent matches with the string

  2214.                    * of window index 0 (in particular we have to avoid a match

  2215.                    * of the string with itself at the start of the input file).

  2216.                    */

  2217.                   s.match_length = longest_match(s, hash_head);

  2218.                   /* longest_match() sets match_start */

  2219.                 }

  2220.                 if (s.match_length >= MIN_MATCH) {

  2221.                   // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only

  2222.             

  2223.                   /*** _tr_tally_dist(s, s.strstart - s.match_start,

  2224.                                  s.match_length - MIN_MATCH, bflush); ***/

  2225.                   bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);

  2226.             

  2227.                   s.lookahead -= s.match_length;

  2228.             

  2229.                   /* Insert new strings in the hash table only if the match length

  2230.                    * is not too large. This saves time but degrades compression.

  2231.                    */

  2232.                   if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {

  2233.                     s.match_length--; /* string at strstart already in table */

  2234.                     do {

  2235.                       s.strstart++;

  2236.                       /*** INSERT_STRING(s, s.strstart, hash_head); ***/

  2237.                       s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;

  2238.                       hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];

  2239.                       s.head[s.ins_h] = s.strstart;

  2240.                       /***/

  2241.                       /* strstart never exceeds WSIZE-MAX_MATCH, so there are

  2242.                        * always MIN_MATCH bytes ahead.

  2243.                        */

  2244.                     } while (--s.match_length !== 0);

  2245.                     s.strstart++;

  2246.                   } else

  2247.                   {

  2248.                     s.strstart += s.match_length;

  2249.                     s.match_length = 0;

  2250.                     s.ins_h = s.window[s.strstart];

  2251.                     /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */

  2252.                     s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;

  2253.             

  2254.             //#if MIN_MATCH != 3

  2255.             //                Call UPDATE_HASH() MIN_MATCH-3 more times

  2256.             //#endif

  2257.                     /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not

  2258.                      * matter since it will be recomputed at next deflate call.

  2259.                      */

  2260.                   }

  2261.                 } else {

  2262.                   /* No match, output a literal byte */

  2263.                   //Tracevv((stderr,"%c", s.window[s.strstart]));

  2264.                   /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/

  2265.                   bflush = trees._tr_tally(s, 0, s.window[s.strstart]);

  2266.             

  2267.                   s.lookahead--;

  2268.                   s.strstart++;

  2269.                 }

  2270.                 if (bflush) {

  2271.                   /*** FLUSH_BLOCK(s, 0); ***/

  2272.                   flush_block_only(s, false);

  2273.                   if (s.strm.avail_out === 0) {

  2274.                     return BS_NEED_MORE;

  2275.                   }

  2276.                   /***/

  2277.                 }

  2278.               }

  2279.               s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);

  2280.               if (flush === Z_FINISH) {

  2281.                 /*** FLUSH_BLOCK(s, 1); ***/

  2282.                 flush_block_only(s, true);

  2283.                 if (s.strm.avail_out === 0) {

  2284.                   return BS_FINISH_STARTED;

  2285.                 }

  2286.                 /***/

  2287.                 return BS_FINISH_DONE;

  2288.               }

  2289.               if (s.last_lit) {

  2290.                 /*** FLUSH_BLOCK(s, 0); ***/

  2291.                 flush_block_only(s, false);

  2292.                 if (s.strm.avail_out === 0) {

  2293.                   return BS_NEED_MORE;

  2294.                 }

  2295.                 /***/

  2296.               }

  2297.               return BS_BLOCK_DONE;

  2298.             }

  2299.             

  2300.             /* ===========================================================================

  2301.              * Same as above, but achieves better compression. We use a lazy

  2302.              * evaluation for matches: a match is finally adopted only if there is

  2303.              * no better match at the next window position.

  2304.              */

  2305.             function deflate_slow(s, flush) {

  2306.               var hash_head;          /* head of hash chain */

  2307.               var bflush;              /* set if current block must be flushed */

  2308.             

  2309.               var max_insert;

  2310.             

  2311.               /* Process the input block. */

  2312.               for (;;) {

  2313.                 /* Make sure that we always have enough lookahead, except

  2314.                  * at the end of the input file. We need MAX_MATCH bytes

  2315.                  * for the next match, plus MIN_MATCH bytes to insert the

  2316.                  * string following the next match.

  2317.                  */

  2318.                 if (s.lookahead < MIN_LOOKAHEAD) {

  2319.                   fill_window(s);

  2320.                   if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {

  2321.                     return BS_NEED_MORE;

  2322.                   }

  2323.                   if (s.lookahead === 0) { break; } /* flush the current block */

  2324.                 }

  2325.             

  2326.                 /* Insert the string window[strstart .. strstart+2] in the

  2327.                  * dictionary, and set hash_head to the head of the hash chain:

  2328.                  */

  2329.                 hash_head = 0/*NIL*/;

  2330.                 if (s.lookahead >= MIN_MATCH) {

  2331.                   /*** INSERT_STRING(s, s.strstart, hash_head); ***/

  2332.                   s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;

  2333.                   hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];

  2334.                   s.head[s.ins_h] = s.strstart;

  2335.                   /***/

  2336.                 }

  2337.             

  2338.                 /* Find the longest match, discarding those <= prev_length.

  2339.                  */

  2340.                 s.prev_length = s.match_length;

  2341.                 s.prev_match = s.match_start;

  2342.                 s.match_length = MIN_MATCH - 1;

  2343.             

  2344.                 if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&

  2345.                     s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {

  2346.                   /* To simplify the code, we prevent matches with the string

  2347.                    * of window index 0 (in particular we have to avoid a match

  2348.                    * of the string with itself at the start of the input file).

  2349.                    */

  2350.                   s.match_length = longest_match(s, hash_head);

  2351.                   /* longest_match() sets match_start */

  2352.             

  2353.                   if (s.match_length <= 5 &&

  2354.                      (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {

  2355.             

  2356.                     /* If prev_match is also MIN_MATCH, match_start is garbage

  2357.                      * but we will ignore the current match anyway.

  2358.                      */

  2359.                     s.match_length = MIN_MATCH - 1;

  2360.                   }

  2361.                 }

  2362.                 /* If there was a match at the previous step and the current

  2363.                  * match is not better, output the previous match:

  2364.                  */

  2365.                 if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {

  2366.                   max_insert = s.strstart + s.lookahead - MIN_MATCH;

  2367.                   /* Do not insert strings in hash table beyond this. */

  2368.             

  2369.                   //check_match(s, s.strstart-1, s.prev_match, s.prev_length);

  2370.             

  2371.                   /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,

  2372.                                  s.prev_length - MIN_MATCH, bflush);***/

  2373.                   bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);

  2374.                   /* Insert in hash table all strings up to the end of the match.

  2375.                    * strstart-1 and strstart are already inserted. If there is not

  2376.                    * enough lookahead, the last two strings are not inserted in

  2377.                    * the hash table.

  2378.                    */

  2379.                   s.lookahead -= s.prev_length - 1;

  2380.                   s.prev_length -= 2;

  2381.                   do {

  2382.                     if (++s.strstart <= max_insert) {

  2383.                       /*** INSERT_STRING(s, s.strstart, hash_head); ***/

  2384.                       s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;

  2385.                       hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];

  2386.                       s.head[s.ins_h] = s.strstart;

  2387.                       /***/

  2388.                     }

  2389.                   } while (--s.prev_length !== 0);

  2390.                   s.match_available = 0;

  2391.                   s.match_length = MIN_MATCH - 1;

  2392.                   s.strstart++;

  2393.             

  2394.                   if (bflush) {

  2395.                     /*** FLUSH_BLOCK(s, 0); ***/

  2396.                     flush_block_only(s, false);

  2397.                     if (s.strm.avail_out === 0) {

  2398.                       return BS_NEED_MORE;

  2399.                     }

  2400.                     /***/

  2401.                   }

  2402.             

  2403.                 } else if (s.match_available) {

  2404.                   /* If there was no match at the previous position, output a

  2405.                    * single literal. If there was a match but the current match

  2406.                    * is longer, truncate the previous match to a single literal.

  2407.                    */

  2408.                   //Tracevv((stderr,"%c", s->window[s->strstart-1]));

  2409.                   /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/

  2410.                   bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);

  2411.             

  2412.                   if (bflush) {

  2413.                     /*** FLUSH_BLOCK_ONLY(s, 0) ***/

  2414.                     flush_block_only(s, false);

  2415.                     /***/

  2416.                   }

  2417.                   s.strstart++;

  2418.                   s.lookahead--;

  2419.                   if (s.strm.avail_out === 0) {

  2420.                     return BS_NEED_MORE;

  2421.                   }

  2422.                 } else {

  2423.                   /* There is no previous match to compare with, wait for

  2424.                    * the next step to decide.

  2425.                    */

  2426.                   s.match_available = 1;

  2427.                   s.strstart++;

  2428.                   s.lookahead--;

  2429.                 }

  2430.               }

  2431.               //Assert (flush != Z_NO_FLUSH, "no flush?");

  2432.               if (s.match_available) {

  2433.                 //Tracevv((stderr,"%c", s->window[s->strstart-1]));

  2434.                 /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/

  2435.                 bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);

  2436.             

  2437.                 s.match_available = 0;

  2438.               }

  2439.               s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;

  2440.               if (flush === Z_FINISH) {

  2441.                 /*** FLUSH_BLOCK(s, 1); ***/

  2442.                 flush_block_only(s, true);

  2443.                 if (s.strm.avail_out === 0) {

  2444.                   return BS_FINISH_STARTED;

  2445.                 }

  2446.                 /***/

  2447.                 return BS_FINISH_DONE;

  2448.               }

  2449.               if (s.last_lit) {

  2450.                 /*** FLUSH_BLOCK(s, 0); ***/

  2451.                 flush_block_only(s, false);

  2452.                 if (s.strm.avail_out === 0) {

  2453.                   return BS_NEED_MORE;

  2454.                 }

  2455.                 /***/

  2456.               }

  2457.             

  2458.               return BS_BLOCK_DONE;

  2459.             }

  2460.             

  2461.             

  2462.             /* ===========================================================================

  2463.              * For Z_RLE, simply look for runs of bytes, generate matches only of distance

  2464.              * one.  Do not maintain a hash table.  (It will be regenerated if this run of

  2465.              * deflate switches away from Z_RLE.)

  2466.              */

  2467.             function deflate_rle(s, flush) {

  2468.               var bflush;            /* set if current block must be flushed */

  2469.               var prev;              /* byte at distance one to match */

  2470.               var scan, strend;      /* scan goes up to strend for length of run */

  2471.             

  2472.               var _win = s.window;

  2473.             

  2474.               for (;;) {

  2475.                 /* Make sure that we always have enough lookahead, except

  2476.                  * at the end of the input file. We need MAX_MATCH bytes

  2477.                  * for the longest run, plus one for the unrolled loop.

  2478.                  */

  2479.                 if (s.lookahead <= MAX_MATCH) {

  2480.                   fill_window(s);

  2481.                   if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {

  2482.                     return BS_NEED_MORE;

  2483.                   }

  2484.                   if (s.lookahead === 0) { break; } /* flush the current block */

  2485.                 }

  2486.             

  2487.                 /* See how many times the previous byte repeats */

  2488.                 s.match_length = 0;

  2489.                 if (s.lookahead >= MIN_MATCH && s.strstart > 0) {

  2490.                   scan = s.strstart - 1;

  2491.                   prev = _win[scan];

  2492.                   if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {

  2493.                     strend = s.strstart + MAX_MATCH;

  2494.                     do {

  2495.                       /*jshint noempty:false*/

  2496.                     } while (prev === _win[++scan] && prev === _win[++scan] &&

  2497.                              prev === _win[++scan] && prev === _win[++scan] &&

  2498.                              prev === _win[++scan] && prev === _win[++scan] &&

  2499.                              prev === _win[++scan] && prev === _win[++scan] &&

  2500.                              scan < strend);

  2501.                     s.match_length = MAX_MATCH - (strend - scan);

  2502.                     if (s.match_length > s.lookahead) {

  2503.                       s.match_length = s.lookahead;

  2504.                     }

  2505.                   }

  2506.                   //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan");

  2507.                 }

  2508.             

  2509.                 /* Emit match if have run of MIN_MATCH or longer, else emit literal */

  2510.                 if (s.match_length >= MIN_MATCH) {

  2511.                   //check_match(s, s.strstart, s.strstart - 1, s.match_length);

  2512.             

  2513.                   /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/

  2514.                   bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);

  2515.             

  2516.                   s.lookahead -= s.match_length;

  2517.                   s.strstart += s.match_length;

  2518.                   s.match_length = 0;

  2519.                 } else {

  2520.                   /* No match, output a literal byte */

  2521.                   //Tracevv((stderr,"%c", s->window[s->strstart]));

  2522.                   /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/

  2523.                   bflush = trees._tr_tally(s, 0, s.window[s.strstart]);

  2524.             

  2525.                   s.lookahead--;

  2526.                   s.strstart++;

  2527.                 }

  2528.                 if (bflush) {

  2529.                   /*** FLUSH_BLOCK(s, 0); ***/

  2530.                   flush_block_only(s, false);

  2531.                   if (s.strm.avail_out === 0) {

  2532.                     return BS_NEED_MORE;

  2533.                   }

  2534.                   /***/

  2535.                 }

  2536.               }

  2537.               s.insert = 0;

  2538.               if (flush === Z_FINISH) {

  2539.                 /*** FLUSH_BLOCK(s, 1); ***/

  2540.                 flush_block_only(s, true);

  2541.                 if (s.strm.avail_out === 0) {

  2542.                   return BS_FINISH_STARTED;

  2543.                 }

  2544.                 /***/

  2545.                 return BS_FINISH_DONE;

  2546.               }

  2547.               if (s.last_lit) {

  2548.                 /*** FLUSH_BLOCK(s, 0); ***/

  2549.                 flush_block_only(s, false);

  2550.                 if (s.strm.avail_out === 0) {

  2551.                   return BS_NEED_MORE;

  2552.                 }

  2553.                 /***/

  2554.               }

  2555.               return BS_BLOCK_DONE;

  2556.             }

  2557.             

  2558.             /* ===========================================================================

  2559.              * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.

  2560.              * (It will be regenerated if this run of deflate switches away from Huffman.)

  2561.              */

  2562.             function deflate_huff(s, flush) {

  2563.               var bflush;             /* set if current block must be flushed */

  2564.             

  2565.               for (;;) {

  2566.                 /* Make sure that we have a literal to write. */

  2567.                 if (s.lookahead === 0) {

  2568.                   fill_window(s);

  2569.                   if (s.lookahead === 0) {

  2570.                     if (flush === Z_NO_FLUSH) {

  2571.                       return BS_NEED_MORE;

  2572.                     }

  2573.                     break;      /* flush the current block */

  2574.                   }

  2575.                 }

  2576.             

  2577.                 /* Output a literal byte */

  2578.                 s.match_length = 0;

  2579.                 //Tracevv((stderr,"%c", s->window[s->strstart]));

  2580.                 /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/

  2581.                 bflush = trees._tr_tally(s, 0, s.window[s.strstart]);

  2582.                 s.lookahead--;

  2583.                 s.strstart++;

  2584.                 if (bflush) {

  2585.                   /*** FLUSH_BLOCK(s, 0); ***/

  2586.                   flush_block_only(s, false);

  2587.                   if (s.strm.avail_out === 0) {

  2588.                     return BS_NEED_MORE;

  2589.                   }

  2590.                   /***/

  2591.                 }

  2592.               }

  2593.               s.insert = 0;

  2594.               if (flush === Z_FINISH) {

  2595.                 /*** FLUSH_BLOCK(s, 1); ***/

  2596.                 flush_block_only(s, true);

  2597.                 if (s.strm.avail_out === 0) {

  2598.                   return BS_FINISH_STARTED;

  2599.                 }

  2600.                 /***/

  2601.                 return BS_FINISH_DONE;

  2602.               }

  2603.               if (s.last_lit) {

  2604.                 /*** FLUSH_BLOCK(s, 0); ***/

  2605.                 flush_block_only(s, false);

  2606.                 if (s.strm.avail_out === 0) {

  2607.                   return BS_NEED_MORE;

  2608.                 }

  2609.                 /***/

  2610.               }

  2611.               return BS_BLOCK_DONE;

  2612.             }

  2613.             

  2614.             /* Values for max_lazy_match, good_match and max_chain_length, depending on

  2615.              * the desired pack level (0..9). The values given below have been tuned to

  2616.              * exclude worst case performance for pathological files. Better values may be

  2617.              * found for specific files.

  2618.              */

  2619.             function Config(good_length, max_lazy, nice_length, max_chain, func) {

  2620.               this.good_length = good_length;

  2621.               this.max_lazy = max_lazy;

  2622.               this.nice_length = nice_length;

  2623.               this.max_chain = max_chain;

  2624.               this.func = func;

  2625.             }

  2626.             

  2627.             var configuration_table;

  2628.             

  2629.             configuration_table = [

  2630.               /*      good lazy nice chain */

  2631.               new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */

  2632.               new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */

  2633.               new Config(4, 5, 16, 8, deflate_fast),           /* 2 */

  2634.               new Config(4, 6, 32, 32, deflate_fast),          /* 3 */

  2635.             

  2636.               new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */

  2637.               new Config(8, 16, 32, 32, deflate_slow),         /* 5 */

  2638.               new Config(8, 16, 128, 128, deflate_slow),       /* 6 */

  2639.               new Config(8, 32, 128, 256, deflate_slow),       /* 7 */

  2640.               new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */

  2641.               new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */

  2642.             ];

  2643.             

  2644.             

  2645.             /* ===========================================================================

  2646.              * Initialize the "longest match" routines for a new zlib stream

  2647.              */

  2648.             function lm_init(s) {

  2649.               s.window_size = 2 * s.w_size;

  2650.             

  2651.               /*** CLEAR_HASH(s); ***/

  2652.               zero(s.head); // Fill with NIL (= 0);

  2653.             

  2654.               /* Set the default configuration parameters:

  2655.                */

  2656.               s.max_lazy_match = configuration_table[s.level].max_lazy;

  2657.               s.good_match = configuration_table[s.level].good_length;

  2658.               s.nice_match = configuration_table[s.level].nice_length;

  2659.               s.max_chain_length = configuration_table[s.level].max_chain;

  2660.             

  2661.               s.strstart = 0;

  2662.               s.block_start = 0;

  2663.               s.lookahead = 0;

  2664.               s.insert = 0;

  2665.               s.match_length = s.prev_length = MIN_MATCH - 1;

  2666.               s.match_available = 0;

  2667.               s.ins_h = 0;

  2668.             }

  2669.             

  2670.             

  2671.             function DeflateState() {

  2672.               this.strm = null;            /* pointer back to this zlib stream */

  2673.               this.status = 0;            /* as the name implies */

  2674.               this.pending_buf = null;      /* output still pending */

  2675.               this.pending_buf_size = 0;  /* size of pending_buf */

  2676.               this.pending_out = 0;       /* next pending byte to output to the stream */

  2677.               this.pending = 0;           /* nb of bytes in the pending buffer */

  2678.               this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */

  2679.               this.gzhead = null;         /* gzip header information to write */

  2680.               this.gzindex = 0;           /* where in extra, name, or comment */

  2681.               this.method = Z_DEFLATED; /* can only be DEFLATED */

  2682.               this.last_flush = -1;   /* value of flush param for previous deflate call */

  2683.             

  2684.               this.w_size = 0;  /* LZ77 window size (32K by default) */

  2685.               this.w_bits = 0;  /* log2(w_size)  (8..16) */

  2686.               this.w_mask = 0;  /* w_size - 1 */

  2687.             

  2688.               this.window = null;

  2689.               /* Sliding window. Input bytes are read into the second half of the window,

  2690.                * and move to the first half later to keep a dictionary of at least wSize

  2691.                * bytes. With this organization, matches are limited to a distance of

  2692.                * wSize-MAX_MATCH bytes, but this ensures that IO is always

  2693.                * performed with a length multiple of the block size.

  2694.                */

  2695.             

  2696.               this.window_size = 0;

  2697.               /* Actual size of window: 2*wSize, except when the user input buffer

  2698.                * is directly used as sliding window.

  2699.                */

  2700.             

  2701.               this.prev = null;

  2702.               /* Link to older string with same hash index. To limit the size of this

  2703.                * array to 64K, this link is maintained only for the last 32K strings.

  2704.                * An index in this array is thus a window index modulo 32K.

  2705.                */

  2706.             

  2707.               this.head = null;   /* Heads of the hash chains or NIL. */

  2708.             

  2709.               this.ins_h = 0;       /* hash index of string to be inserted */

  2710.               this.hash_size = 0;   /* number of elements in hash table */

  2711.               this.hash_bits = 0;   /* log2(hash_size) */

  2712.               this.hash_mask = 0;   /* hash_size-1 */

  2713.             

  2714.               this.hash_shift = 0;

  2715.               /* Number of bits by which ins_h must be shifted at each input

  2716.                * step. It must be such that after MIN_MATCH steps, the oldest

  2717.                * byte no longer takes part in the hash key, that is:

  2718.                *   hash_shift * MIN_MATCH >= hash_bits

  2719.                */

  2720.             

  2721.               this.block_start = 0;

  2722.               /* Window position at the beginning of the current output block. Gets

  2723.                * negative when the window is moved backwards.

  2724.                */

  2725.             

  2726.               this.match_length = 0;      /* length of best match */

  2727.               this.prev_match = 0;        /* previous match */

  2728.               this.match_available = 0;   /* set if previous match exists */

  2729.               this.strstart = 0;          /* start of string to insert */

  2730.               this.match_start = 0;       /* start of matching string */

  2731.               this.lookahead = 0;         /* number of valid bytes ahead in window */

  2732.             

  2733.               this.prev_length = 0;

  2734.               /* Length of the best match at previous step. Matches not greater than this

  2735.                * are discarded. This is used in the lazy match evaluation.

  2736.                */

  2737.             

  2738.               this.max_chain_length = 0;

  2739.               /* To speed up deflation, hash chains are never searched beyond this

  2740.                * length.  A higher limit improves compression ratio but degrades the

  2741.                * speed.

  2742.                */

  2743.             

  2744.               this.max_lazy_match = 0;

  2745.               /* Attempt to find a better match only when the current match is strictly

  2746.                * smaller than this value. This mechanism is used only for compression

  2747.                * levels >= 4.

  2748.                */

  2749.               // That's alias to max_lazy_match, don't use directly

  2750.               //this.max_insert_length = 0;

  2751.               /* Insert new strings in the hash table only if the match length is not

  2752.                * greater than this length. This saves time but degrades compression.

  2753.                * max_insert_length is used only for compression levels <= 3.

  2754.                */

  2755.             

  2756.               this.level = 0;     /* compression level (1..9) */

  2757.               this.strategy = 0;  /* favor or force Huffman coding*/

  2758.             

  2759.               this.good_match = 0;

  2760.               /* Use a faster search when the previous match is longer than this */

  2761.             

  2762.               this.nice_match = 0; /* Stop searching when current match exceeds this */

  2763.             

  2764.                           /* used by trees.c: */

  2765.             

  2766.               /* Didn't use ct_data typedef below to suppress compiler warning */

  2767.             

  2768.               // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */

  2769.               // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */

  2770.               // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */

  2771.             

  2772.               // Use flat array of DOUBLE size, with interleaved fata,

  2773.               // because JS does not support effective

  2774.               this.dyn_ltree  = new utils.Buf16(HEAP_SIZE * 2);

  2775.               this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);

  2776.               this.bl_tree    = new utils.Buf16((2 * BL_CODES + 1) * 2);

  2777.               zero(this.dyn_ltree);

  2778.               zero(this.dyn_dtree);

  2779.               zero(this.bl_tree);

  2780.             

  2781.               this.l_desc   = null;         /* desc. for literal tree */

  2782.               this.d_desc   = null;         /* desc. for distance tree */

  2783.               this.bl_desc  = null;         /* desc. for bit length tree */

  2784.             

  2785.               //ush bl_count[MAX_BITS+1];

  2786.               this.bl_count = new utils.Buf16(MAX_BITS + 1);

  2787.               /* number of codes at each bit length for an optimal tree */

  2788.             

  2789.               //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */

  2790.               this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */

  2791.               zero(this.heap);

  2792.             

  2793.               this.heap_len = 0;               /* number of elements in the heap */

  2794.               this.heap_max = 0;               /* element of largest frequency */

  2795.               /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.

  2796.                * The same heap array is used to build all trees.

  2797.                */

  2798.             

  2799.               this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];

  2800.               zero(this.depth);

  2801.               /* Depth of each subtree used as tie breaker for trees of equal frequency

  2802.                */

  2803.             

  2804.               this.l_buf = 0;          /* buffer index for literals or lengths */

  2805.             

  2806.               this.lit_bufsize = 0;

  2807.               /* Size of match buffer for literals/lengths.  There are 4 reasons for

  2808.                * limiting lit_bufsize to 64K:

  2809.                *   - frequencies can be kept in 16 bit counters

  2810.                *   - if compression is not successful for the first block, all input

  2811.                *     data is still in the window so we can still emit a stored block even

  2812.                *     when input comes from standard input.  (This can also be done for

  2813.                *     all blocks if lit_bufsize is not greater than 32K.)

  2814.                *   - if compression is not successful for a file smaller than 64K, we can

  2815.                *     even emit a stored file instead of a stored block (saving 5 bytes).

  2816.                *     This is applicable only for zip (not gzip or zlib).

  2817.                *   - creating new Huffman trees less frequently may not provide fast

  2818.                *     adaptation to changes in the input data statistics. (Take for

  2819.                *     example a binary file with poorly compressible code followed by

  2820.                *     a highly compressible string table.) Smaller buffer sizes give

  2821.                *     fast adaptation but have of course the overhead of transmitting

  2822.                *     trees more frequently.

  2823.                *   - I can't count above 4

  2824.                */

  2825.             

  2826.               this.last_lit = 0;      /* running index in l_buf */

  2827.             

  2828.               this.d_buf = 0;

  2829.               /* Buffer index for distances. To simplify the code, d_buf and l_buf have

  2830.                * the same number of elements. To use different lengths, an extra flag

  2831.                * array would be necessary.

  2832.                */

  2833.             

  2834.               this.opt_len = 0;       /* bit length of current block with optimal trees */

  2835.               this.static_len = 0;    /* bit length of current block with static trees */

  2836.               this.matches = 0;       /* number of string matches in current block */

  2837.               this.insert = 0;        /* bytes at end of window left to insert */

  2838.             

  2839.             

  2840.               this.bi_buf = 0;

  2841.               /* Output buffer. bits are inserted starting at the bottom (least

  2842.                * significant bits).

  2843.                */

  2844.               this.bi_valid = 0;

  2845.               /* Number of valid bits in bi_buf.  All bits above the last valid bit

  2846.                * are always zero.

  2847.                */

  2848.             

  2849.               // Used for window memory init. We safely ignore it for JS. That makes

  2850.               // sense only for pointers and memory check tools.

  2851.               //this.high_water = 0;

  2852.               /* High water mark offset in window for initialized bytes -- bytes above

  2853.                * this are set to zero in order to avoid memory check warnings when

  2854.                * longest match routines access bytes past the input.  This is then

  2855.                * updated to the new high water mark.

  2856.                */

  2857.             }

  2858.             

  2859.             

  2860.             function deflateResetKeep(strm) {

  2861.               var s;

  2862.             

  2863.               if (!strm || !strm.state) {

  2864.                 return err(strm, Z_STREAM_ERROR);

  2865.               }

  2866.             

  2867.               strm.total_in = strm.total_out = 0;

  2868.               strm.data_type = Z_UNKNOWN;

  2869.             

  2870.               s = strm.state;

  2871.               s.pending = 0;

  2872.               s.pending_out = 0;

  2873.             

  2874.               if (s.wrap < 0) {

  2875.                 s.wrap = -s.wrap;

  2876.                 /* was made negative by deflate(..., Z_FINISH); */

  2877.               }

  2878.               s.status = (s.wrap ? INIT_STATE : BUSY_STATE);

  2879.               strm.adler = (s.wrap === 2) ?

  2880.                 0  // crc32(0, Z_NULL, 0)

  2881.               :

  2882.                 1; // adler32(0, Z_NULL, 0)

  2883.               s.last_flush = Z_NO_FLUSH;

  2884.               trees._tr_init(s);

  2885.               return Z_OK;

  2886.             }

  2887.             

  2888.             

  2889.             function deflateReset(strm) {

  2890.               var ret = deflateResetKeep(strm);

  2891.               if (ret === Z_OK) {

  2892.                 lm_init(strm.state);

  2893.               }

  2894.               return ret;

  2895.             }

  2896.             

  2897.             

  2898.             function deflateSetHeader(strm, head) {

  2899.               if (!strm || !strm.state) { return Z_STREAM_ERROR; }

  2900.               if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }

  2901.               strm.state.gzhead = head;

  2902.               return Z_OK;

  2903.             }

  2904.             

  2905.             

  2906.             function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {

  2907.               if (!strm) { // === Z_NULL

  2908.                 return Z_STREAM_ERROR;

  2909.               }

  2910.               var wrap = 1;

  2911.             

  2912.               if (level === Z_DEFAULT_COMPRESSION) {

  2913.                 level = 6;

  2914.               }

  2915.             

  2916.               if (windowBits < 0) { /* suppress zlib wrapper */

  2917.                 wrap = 0;

  2918.                 windowBits = -windowBits;

  2919.               }

  2920.             

  2921.               else if (windowBits > 15) {

  2922.                 wrap = 2;           /* write gzip wrapper instead */

  2923.                 windowBits -= 16;

  2924.               }

  2925.             

  2926.             

  2927.               if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||

  2928.                 windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||

  2929.                 strategy < 0 || strategy > Z_FIXED) {

  2930.                 return err(strm, Z_STREAM_ERROR);

  2931.               }

  2932.             

  2933.             

  2934.               if (windowBits === 8) {

  2935.                 windowBits = 9;

  2936.               }

  2937.               /* until 256-byte window bug fixed */

  2938.             

  2939.               var s = new DeflateState();

  2940.             

  2941.               strm.state = s;

  2942.               s.strm = strm;

  2943.             

  2944.               s.wrap = wrap;

  2945.               s.gzhead = null;

  2946.               s.w_bits = windowBits;

  2947.               s.w_size = 1 << s.w_bits;

  2948.               s.w_mask = s.w_size - 1;

  2949.             

  2950.               s.hash_bits = memLevel + 7;

  2951.               s.hash_size = 1 << s.hash_bits;

  2952.               s.hash_mask = s.hash_size - 1;

  2953.               s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);

  2954.             

  2955.               s.window = new utils.Buf8(s.w_size * 2);

  2956.               s.head = new utils.Buf16(s.hash_size);

  2957.               s.prev = new utils.Buf16(s.w_size);

  2958.             

  2959.               // Don't need mem init magic for JS.

  2960.               //s.high_water = 0;  /* nothing written to s->window yet */

  2961.             

  2962.               s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */

  2963.             

  2964.               s.pending_buf_size = s.lit_bufsize * 4;

  2965.             

  2966.               //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);

  2967.               //s->pending_buf = (uchf *) overlay;

  2968.               s.pending_buf = new utils.Buf8(s.pending_buf_size);

  2969.             

  2970.               // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)

  2971.               //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);

  2972.               s.d_buf = 1 * s.lit_bufsize;

  2973.             

  2974.               //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;

  2975.               s.l_buf = (1 + 2) * s.lit_bufsize;

  2976.             

  2977.               s.level = level;

  2978.               s.strategy = strategy;

  2979.               s.method = method;

  2980.             

  2981.               return deflateReset(strm);

  2982.             }

  2983.             

  2984.             function deflateInit(strm, level) {

  2985.               return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);

  2986.             }

  2987.             

  2988.             

  2989.             function deflate(strm, flush) {

  2990.               var old_flush, s;

  2991.               var beg, val; // for gzip header write only

  2992.             

  2993.               if (!strm || !strm.state ||

  2994.                 flush > Z_BLOCK || flush < 0) {

  2995.                 return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;

  2996.               }

  2997.             

  2998.               s = strm.state;

  2999.             

  3000.               if (!strm.output ||

  3001.                   (!strm.input && strm.avail_in !== 0) ||

  3002.                   (s.status === FINISH_STATE && flush !== Z_FINISH)) {

  3003.                 return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);

  3004.               }

  3005.             

  3006.               s.strm = strm; /* just in case */

  3007.               old_flush = s.last_flush;

  3008.               s.last_flush = flush;

  3009.             

  3010.               /* Write the header */

  3011.               if (s.status === INIT_STATE) {

  3012.             

  3013.                 if (s.wrap === 2) { // GZIP header

  3014.                   strm.adler = 0;  //crc32(0L, Z_NULL, 0);

  3015.                   put_byte(s, 31);

  3016.                   put_byte(s, 139);

  3017.                   put_byte(s, 8);

  3018.                   if (!s.gzhead) { // s->gzhead == Z_NULL

  3019.                     put_byte(s, 0);

  3020.                     put_byte(s, 0);

  3021.                     put_byte(s, 0);

  3022.                     put_byte(s, 0);

  3023.                     put_byte(s, 0);

  3024.                     put_byte(s, s.level === 9 ? 2 :

  3025.                                 (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?

  3026.                                  4 : 0));

  3027.                     put_byte(s, OS_CODE);

  3028.                     s.status = BUSY_STATE;

  3029.                   }

  3030.                   else {

  3031.                     put_byte(s, (s.gzhead.text ? 1 : 0) +

  3032.                                 (s.gzhead.hcrc ? 2 : 0) +

  3033.                                 (!s.gzhead.extra ? 0 : 4) +

  3034.                                 (!s.gzhead.name ? 0 : 8) +

  3035.                                 (!s.gzhead.comment ? 0 : 16)

  3036.                     );

  3037.                     put_byte(s, s.gzhead.time & 0xff);

  3038.                     put_byte(s, (s.gzhead.time >> 8) & 0xff);

  3039.                     put_byte(s, (s.gzhead.time >> 16) & 0xff);

  3040.                     put_byte(s, (s.gzhead.time >> 24) & 0xff);

  3041.                     put_byte(s, s.level === 9 ? 2 :

  3042.                                 (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?

  3043.                                  4 : 0));

  3044.                     put_byte(s, s.gzhead.os & 0xff);

  3045.                     if (s.gzhead.extra && s.gzhead.extra.length) {

  3046.                       put_byte(s, s.gzhead.extra.length & 0xff);

  3047.                       put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);

  3048.                     }

  3049.                     if (s.gzhead.hcrc) {

  3050.                       strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);

  3051.                     }

  3052.                     s.gzindex = 0;

  3053.                     s.status = EXTRA_STATE;

  3054.                   }

  3055.                 }

  3056.                 else // DEFLATE header

  3057.                 {

  3058.                   var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;

  3059.                   var level_flags = -1;

  3060.             

  3061.                   if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {

  3062.                     level_flags = 0;

  3063.                   } else if (s.level < 6) {

  3064.                     level_flags = 1;

  3065.                   } else if (s.level === 6) {

  3066.                     level_flags = 2;

  3067.                   } else {

  3068.                     level_flags = 3;

  3069.                   }

  3070.                   header |= (level_flags << 6);

  3071.                   if (s.strstart !== 0) { header |= PRESET_DICT; }

  3072.                   header += 31 - (header % 31);

  3073.             

  3074.                   s.status = BUSY_STATE;

  3075.                   putShortMSB(s, header);

  3076.             

  3077.                   /* Save the adler32 of the preset dictionary: */

  3078.                   if (s.strstart !== 0) {

  3079.                     putShortMSB(s, strm.adler >>> 16);

  3080.                     putShortMSB(s, strm.adler & 0xffff);

  3081.                   }

  3082.                   strm.adler = 1; // adler32(0L, Z_NULL, 0);

  3083.                 }

  3084.               }

  3085.             

  3086.             //#ifdef GZIP

  3087.               if (s.status === EXTRA_STATE) {

  3088.                 if (s.gzhead.extra/* != Z_NULL*/) {

  3089.                   beg = s.pending;  /* start of bytes to update crc */

  3090.             

  3091.                   while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {

  3092.                     if (s.pending === s.pending_buf_size) {

  3093.                       if (s.gzhead.hcrc && s.pending > beg) {

  3094.                         strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);

  3095.                       }

  3096.                       flush_pending(strm);

  3097.                       beg = s.pending;

  3098.                       if (s.pending === s.pending_buf_size) {

  3099.                         break;

  3100.                       }

  3101.                     }

  3102.                     put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);

  3103.                     s.gzindex++;

  3104.                   }

  3105.                   if (s.gzhead.hcrc && s.pending > beg) {

  3106.                     strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);

  3107.                   }

  3108.                   if (s.gzindex === s.gzhead.extra.length) {

  3109.                     s.gzindex = 0;

  3110.                     s.status = NAME_STATE;

  3111.                   }

  3112.                 }

  3113.                 else {

  3114.                   s.status = NAME_STATE;

  3115.                 }

  3116.               }

  3117.               if (s.status === NAME_STATE) {

  3118.                 if (s.gzhead.name/* != Z_NULL*/) {

  3119.                   beg = s.pending;  /* start of bytes to update crc */

  3120.                   //int val;

  3121.             

  3122.                   do {

  3123.                     if (s.pending === s.pending_buf_size) {

  3124.                       if (s.gzhead.hcrc && s.pending > beg) {

  3125.                         strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);

  3126.                       }

  3127.                       flush_pending(strm);

  3128.                       beg = s.pending;

  3129.                       if (s.pending === s.pending_buf_size) {

  3130.                         val = 1;

  3131.                         break;

  3132.                       }

  3133.                     }

  3134.                     // JS specific: little magic to add zero terminator to end of string

  3135.                     if (s.gzindex < s.gzhead.name.length) {

  3136.                       val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;

  3137.                     } else {

  3138.                       val = 0;

  3139.                     }

  3140.                     put_byte(s, val);

  3141.                   } while (val !== 0);

  3142.             

  3143.                   if (s.gzhead.hcrc && s.pending > beg) {

  3144.                     strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);

  3145.                   }

  3146.                   if (val === 0) {

  3147.                     s.gzindex = 0;

  3148.                     s.status = COMMENT_STATE;

  3149.                   }

  3150.                 }

  3151.                 else {

  3152.                   s.status = COMMENT_STATE;

  3153.                 }

  3154.               }

  3155.               if (s.status === COMMENT_STATE) {

  3156.                 if (s.gzhead.comment/* != Z_NULL*/) {

  3157.                   beg = s.pending;  /* start of bytes to update crc */

  3158.                   //int val;

  3159.             

  3160.                   do {

  3161.                     if (s.pending === s.pending_buf_size) {

  3162.                       if (s.gzhead.hcrc && s.pending > beg) {

  3163.                         strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);

  3164.                       }

  3165.                       flush_pending(strm);

  3166.                       beg = s.pending;

  3167.                       if (s.pending === s.pending_buf_size) {

  3168.                         val = 1;

  3169.                         break;

  3170.                       }

  3171.                     }

  3172.                     // JS specific: little magic to add zero terminator to end of string

  3173.                     if (s.gzindex < s.gzhead.comment.length) {

  3174.                       val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;

  3175.                     } else {

  3176.                       val = 0;

  3177.                     }

  3178.                     put_byte(s, val);

  3179.                   } while (val !== 0);

  3180.             

  3181.                   if (s.gzhead.hcrc && s.pending > beg) {

  3182.                     strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);

  3183.                   }

  3184.                   if (val === 0) {

  3185.                     s.status = HCRC_STATE;

  3186.                   }

  3187.                 }

  3188.                 else {

  3189.                   s.status = HCRC_STATE;

  3190.                 }

  3191.               }

  3192.               if (s.status === HCRC_STATE) {

  3193.                 if (s.gzhead.hcrc) {

  3194.                   if (s.pending + 2 > s.pending_buf_size) {

  3195.                     flush_pending(strm);

  3196.                   }

  3197.                   if (s.pending + 2 <= s.pending_buf_size) {

  3198.                     put_byte(s, strm.adler & 0xff);

  3199.                     put_byte(s, (strm.adler >> 8) & 0xff);

  3200.                     strm.adler = 0; //crc32(0L, Z_NULL, 0);

  3201.                     s.status = BUSY_STATE;

  3202.                   }

  3203.                 }

  3204.                 else {

  3205.                   s.status = BUSY_STATE;

  3206.                 }

  3207.               }

  3208.             //#endif

  3209.             

  3210.               /* Flush as much pending output as possible */

  3211.               if (s.pending !== 0) {

  3212.                 flush_pending(strm);

  3213.                 if (strm.avail_out === 0) {

  3214.                   /* Since avail_out is 0, deflate will be called again with

  3215.                    * more output space, but possibly with both pending and

  3216.                    * avail_in equal to zero. There won't be anything to do,

  3217.                    * but this is not an error situation so make sure we

  3218.                    * return OK instead of BUF_ERROR at next call of deflate:

  3219.                    */

  3220.                   s.last_flush = -1;

  3221.                   return Z_OK;

  3222.                 }

  3223.             

  3224.                 /* Make sure there is something to do and avoid duplicate consecutive

  3225.                  * flushes. For repeated and useless calls with Z_FINISH, we keep

  3226.                  * returning Z_STREAM_END instead of Z_BUF_ERROR.

  3227.                  */

  3228.               } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&

  3229.                 flush !== Z_FINISH) {

  3230.                 return err(strm, Z_BUF_ERROR);

  3231.               }

  3232.             

  3233.               /* User must not provide more input after the first FINISH: */

  3234.               if (s.status === FINISH_STATE && strm.avail_in !== 0) {

  3235.                 return err(strm, Z_BUF_ERROR);

  3236.               }

  3237.             

  3238.               /* Start a new block or continue the current one.

  3239.                */

  3240.               if (strm.avail_in !== 0 || s.lookahead !== 0 ||

  3241.                 (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {

  3242.                 var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :

  3243.                   (s.strategy === Z_RLE ? deflate_rle(s, flush) :

  3244.                     configuration_table[s.level].func(s, flush));

  3245.             

  3246.                 if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {

  3247.                   s.status = FINISH_STATE;

  3248.                 }

  3249.                 if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {

  3250.                   if (strm.avail_out === 0) {

  3251.                     s.last_flush = -1;

  3252.                     /* avoid BUF_ERROR next call, see above */

  3253.                   }

  3254.                   return Z_OK;

  3255.                   /* If flush != Z_NO_FLUSH && avail_out == 0, the next call

  3256.                    * of deflate should use the same flush parameter to make sure

  3257.                    * that the flush is complete. So we don't have to output an

  3258.                    * empty block here, this will be done at next call. This also

  3259.                    * ensures that for a very small output buffer, we emit at most

  3260.                    * one empty block.

  3261.                    */

  3262.                 }

  3263.                 if (bstate === BS_BLOCK_DONE) {

  3264.                   if (flush === Z_PARTIAL_FLUSH) {

  3265.                     trees._tr_align(s);

  3266.                   }

  3267.                   else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */

  3268.             

  3269.                     trees._tr_stored_block(s, 0, 0, false);

  3270.                     /* For a full flush, this empty block will be recognized

  3271.                      * as a special marker by inflate_sync().

  3272.                      */

  3273.                     if (flush === Z_FULL_FLUSH) {

  3274.                       /*** CLEAR_HASH(s); ***/             /* forget history */

  3275.                       zero(s.head); // Fill with NIL (= 0);

  3276.             

  3277.                       if (s.lookahead === 0) {

  3278.                         s.strstart = 0;

  3279.                         s.block_start = 0;

  3280.                         s.insert = 0;

  3281.                       }

  3282.                     }

  3283.                   }

  3284.                   flush_pending(strm);

  3285.                   if (strm.avail_out === 0) {

  3286.                     s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */

  3287.                     return Z_OK;

  3288.                   }

  3289.                 }

  3290.               }

  3291.               //Assert(strm->avail_out > 0, "bug2");

  3292.               //if (strm.avail_out <= 0) { throw new Error("bug2");}

  3293.             

  3294.               if (flush !== Z_FINISH) { return Z_OK; }

  3295.               if (s.wrap <= 0) { return Z_STREAM_END; }

  3296.             

  3297.               /* Write the trailer */

  3298.               if (s.wrap === 2) {

  3299.                 put_byte(s, strm.adler & 0xff);

  3300.                 put_byte(s, (strm.adler >> 8) & 0xff);

  3301.                 put_byte(s, (strm.adler >> 16) & 0xff);

  3302.                 put_byte(s, (strm.adler >> 24) & 0xff);

  3303.                 put_byte(s, strm.total_in & 0xff);

  3304.                 put_byte(s, (strm.total_in >> 8) & 0xff);

  3305.                 put_byte(s, (strm.total_in >> 16) & 0xff);

  3306.                 put_byte(s, (strm.total_in >> 24) & 0xff);

  3307.               }

  3308.               else

  3309.               {

  3310.                 putShortMSB(s, strm.adler >>> 16);

  3311.                 putShortMSB(s, strm.adler & 0xffff);

  3312.               }

  3313.             

  3314.               flush_pending(strm);

  3315.               /* If avail_out is zero, the application will call deflate again

  3316.                * to flush the rest.

  3317.                */

  3318.               if (s.wrap > 0) { s.wrap = -s.wrap; }

  3319.               /* write the trailer only once! */

  3320.               return s.pending !== 0 ? Z_OK : Z_STREAM_END;

  3321.             }

  3322.             

  3323.             function deflateEnd(strm) {

  3324.               var status;

  3325.             

  3326.               if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {

  3327.                 return Z_STREAM_ERROR;

  3328.               }

  3329.             

  3330.               status = strm.state.status;

  3331.               if (status !== INIT_STATE &&

  3332.                 status !== EXTRA_STATE &&

  3333.                 status !== NAME_STATE &&

  3334.                 status !== COMMENT_STATE &&

  3335.                 status !== HCRC_STATE &&

  3336.                 status !== BUSY_STATE &&

  3337.                 status !== FINISH_STATE

  3338.               ) {

  3339.                 return err(strm, Z_STREAM_ERROR);

  3340.               }

  3341.             

  3342.               strm.state = null;

  3343.             

  3344.               return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;

  3345.             }

  3346.             

  3347.             

  3348.             /* =========================================================================

  3349.              * Initializes the compression dictionary from the given byte

  3350.              * sequence without producing any compressed output.

  3351.              */

  3352.             function deflateSetDictionary(strm, dictionary) {

  3353.               var dictLength = dictionary.length;

  3354.             

  3355.               var s;

  3356.               var str, n;

  3357.               var wrap;

  3358.               var avail;

  3359.               var next;

  3360.               var input;

  3361.               var tmpDict;

  3362.             

  3363.               if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {

  3364.                 return Z_STREAM_ERROR;

  3365.               }

  3366.             

  3367.               s = strm.state;

  3368.               wrap = s.wrap;

  3369.             

  3370.               if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {

  3371.                 return Z_STREAM_ERROR;

  3372.               }

  3373.             

  3374.               /* when using zlib wrappers, compute Adler-32 for provided dictionary */

  3375.               if (wrap === 1) {

  3376.                 /* adler32(strm->adler, dictionary, dictLength); */

  3377.                 strm.adler = adler32(strm.adler, dictionary, dictLength, 0);

  3378.               }

  3379.             

  3380.               s.wrap = 0;   /* avoid computing Adler-32 in read_buf */

  3381.             

  3382.               /* if dictionary would fill window, just replace the history */

  3383.               if (dictLength >= s.w_size) {

  3384.                 if (wrap === 0) {            /* already empty otherwise */

  3385.                   /*** CLEAR_HASH(s); ***/

  3386.                   zero(s.head); // Fill with NIL (= 0);

  3387.                   s.strstart = 0;

  3388.                   s.block_start = 0;

  3389.                   s.insert = 0;

  3390.                 }

  3391.                 /* use the tail */

  3392.                 // dictionary = dictionary.slice(dictLength - s.w_size);

  3393.                 tmpDict = new utils.Buf8(s.w_size);

  3394.                 utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);

  3395.                 dictionary = tmpDict;

  3396.                 dictLength = s.w_size;

  3397.               }

  3398.               /* insert dictionary into window and hash */

  3399.               avail = strm.avail_in;

  3400.               next = strm.next_in;

  3401.               input = strm.input;

  3402.               strm.avail_in = dictLength;

  3403.               strm.next_in = 0;

  3404.               strm.input = dictionary;

  3405.               fill_window(s);

  3406.               while (s.lookahead >= MIN_MATCH) {

  3407.                 str = s.strstart;

  3408.                 n = s.lookahead - (MIN_MATCH - 1);

  3409.                 do {

  3410.                   /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */

  3411.                   s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;

  3412.             

  3413.                   s.prev[str & s.w_mask] = s.head[s.ins_h];

  3414.             

  3415.                   s.head[s.ins_h] = str;

  3416.                   str++;

  3417.                 } while (--n);

  3418.                 s.strstart = str;

  3419.                 s.lookahead = MIN_MATCH - 1;

  3420.                 fill_window(s);

  3421.               }

  3422.               s.strstart += s.lookahead;

  3423.               s.block_start = s.strstart;

  3424.               s.insert = s.lookahead;

  3425.               s.lookahead = 0;

  3426.               s.match_length = s.prev_length = MIN_MATCH - 1;

  3427.               s.match_available = 0;

  3428.               strm.next_in = next;

  3429.               strm.input = input;

  3430.               strm.avail_in = avail;

  3431.               s.wrap = wrap;

  3432.               return Z_OK;

  3433.             }

  3434.             

  3435.             

  3436.             exports.deflateInit = deflateInit;

  3437.             exports.deflateInit2 = deflateInit2;

  3438.             exports.deflateReset = deflateReset;

  3439.             exports.deflateResetKeep = deflateResetKeep;

  3440.             exports.deflateSetHeader = deflateSetHeader;

  3441.             exports.deflate = deflate;

  3442.             exports.deflateEnd = deflateEnd;

  3443.             exports.deflateSetDictionary = deflateSetDictionary;

  3444.             exports.deflateInfo = 'pako deflate (from Nodeca project)';

  3445.             

  3446.             /* Not implemented

  3447.             exports.deflateBound = deflateBound;

  3448.             exports.deflateCopy = deflateCopy;

  3449.             exports.deflateParams = deflateParams;

  3450.             exports.deflatePending = deflatePending;

  3451.             exports.deflatePrime = deflatePrime;

  3452.             exports.deflateTune = deflateTune;

  3453.             */

  3454.             

  3455.             },{"../utils/common":3,"./adler32":5,"./crc32":7,"./messages":13,"./trees":14}],9:[function(require,module,exports){

  3456.             'use strict';

  3457.             

  3458.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  3459.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  3460.             //

  3461.             // This software is provided 'as-is', without any express or implied

  3462.             // warranty. In no event will the authors be held liable for any damages

  3463.             // arising from the use of this software.

  3464.             //

  3465.             // Permission is granted to anyone to use this software for any purpose,

  3466.             // including commercial applications, and to alter it and redistribute it

  3467.             // freely, subject to the following restrictions:

  3468.             //

  3469.             // 1. The origin of this software must not be misrepresented; you must not

  3470.             //   claim that you wrote the original software. If you use this software

  3471.             //   in a product, an acknowledgment in the product documentation would be

  3472.             //   appreciated but is not required.

  3473.             // 2. Altered source versions must be plainly marked as such, and must not be

  3474.             //   misrepresented as being the original software.

  3475.             // 3. This notice may not be removed or altered from any source distribution.

  3476.             

  3477.             function GZheader() {

  3478.               /* true if compressed data believed to be text */

  3479.               this.text       = 0;

  3480.               /* modification time */

  3481.               this.time       = 0;

  3482.               /* extra flags (not used when writing a gzip file) */

  3483.               this.xflags     = 0;

  3484.               /* operating system */

  3485.               this.os         = 0;

  3486.               /* pointer to extra field or Z_NULL if none */

  3487.               this.extra      = null;

  3488.               /* extra field length (valid if extra != Z_NULL) */

  3489.               this.extra_len  = 0; // Actually, we don't need it in JS,

  3490.                                    // but leave for few code modifications

  3491.             

  3492.               //

  3493.               // Setup limits is not necessary because in js we should not preallocate memory

  3494.               // for inflate use constant limit in 65536 bytes

  3495.               //

  3496.             

  3497.               /* space at extra (only when reading header) */

  3498.               // this.extra_max  = 0;

  3499.               /* pointer to zero-terminated file name or Z_NULL */

  3500.               this.name       = '';

  3501.               /* space at name (only when reading header) */

  3502.               // this.name_max   = 0;

  3503.               /* pointer to zero-terminated comment or Z_NULL */

  3504.               this.comment    = '';

  3505.               /* space at comment (only when reading header) */

  3506.               // this.comm_max   = 0;

  3507.               /* true if there was or will be a header crc */

  3508.               this.hcrc       = 0;

  3509.               /* true when done reading gzip header (not used when writing a gzip file) */

  3510.               this.done       = false;

  3511.             }

  3512.             

  3513.             module.exports = GZheader;

  3514.             

  3515.             },{}],10:[function(require,module,exports){

  3516.             'use strict';

  3517.             

  3518.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  3519.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  3520.             //

  3521.             // This software is provided 'as-is', without any express or implied

  3522.             // warranty. In no event will the authors be held liable for any damages

  3523.             // arising from the use of this software.

  3524.             //

  3525.             // Permission is granted to anyone to use this software for any purpose,

  3526.             // including commercial applications, and to alter it and redistribute it

  3527.             // freely, subject to the following restrictions:

  3528.             //

  3529.             // 1. The origin of this software must not be misrepresented; you must not

  3530.             //   claim that you wrote the original software. If you use this software

  3531.             //   in a product, an acknowledgment in the product documentation would be

  3532.             //   appreciated but is not required.

  3533.             // 2. Altered source versions must be plainly marked as such, and must not be

  3534.             //   misrepresented as being the original software.

  3535.             // 3. This notice may not be removed or altered from any source distribution.

  3536.             

  3537.             // See state defs from inflate.js

  3538.             var BAD = 30;       /* got a data error -- remain here until reset */

  3539.             var TYPE = 12;      /* i: waiting for type bits, including last-flag bit */

  3540.             

  3541.             /*

  3542.                Decode literal, length, and distance codes and write out the resulting

  3543.                literal and match bytes until either not enough input or output is

  3544.                available, an end-of-block is encountered, or a data error is encountered.

  3545.                When large enough input and output buffers are supplied to inflate(), for

  3546.                example, a 16K input buffer and a 64K output buffer, more than 95% of the

  3547.                inflate execution time is spent in this routine.

  3548.             

  3549.                Entry assumptions:

  3550.             

  3551.                     state.mode === LEN

  3552.                     strm.avail_in >= 6

  3553.                     strm.avail_out >= 258

  3554.                     start >= strm.avail_out

  3555.                     state.bits < 8

  3556.             

  3557.                On return, state.mode is one of:

  3558.             

  3559.                     LEN -- ran out of enough output space or enough available input

  3560.                     TYPE -- reached end of block code, inflate() to interpret next block

  3561.                     BAD -- error in block data

  3562.             

  3563.                Notes:

  3564.             

  3565.                 - The maximum input bits used by a length/distance pair is 15 bits for the

  3566.                   length code, 5 bits for the length extra, 15 bits for the distance code,

  3567.                   and 13 bits for the distance extra.  This totals 48 bits, or six bytes.

  3568.                   Therefore if strm.avail_in >= 6, then there is enough input to avoid

  3569.                   checking for available input while decoding.

  3570.             

  3571.                 - The maximum bytes that a single length/distance pair can output is 258

  3572.                   bytes, which is the maximum length that can be coded.  inflate_fast()

  3573.                   requires strm.avail_out >= 258 for each loop to avoid checking for

  3574.                   output space.

  3575.              */

  3576.             module.exports = function inflate_fast(strm, start) {

  3577.               var state;

  3578.               var _in;                    /* local strm.input */

  3579.               var last;                   /* have enough input while in < last */

  3580.               var _out;                   /* local strm.output */

  3581.               var beg;                    /* inflate()'s initial strm.output */

  3582.               var end;                    /* while out < end, enough space available */

  3583.             //#ifdef INFLATE_STRICT

  3584.               var dmax;                   /* maximum distance from zlib header */

  3585.             //#endif

  3586.               var wsize;                  /* window size or zero if not using window */

  3587.               var whave;                  /* valid bytes in the window */

  3588.               var wnext;                  /* window write index */

  3589.               // Use `s_window` instead `window`, avoid conflict with instrumentation tools

  3590.               var s_window;               /* allocated sliding window, if wsize != 0 */

  3591.               var hold;                   /* local strm.hold */

  3592.               var bits;                   /* local strm.bits */

  3593.               var lcode;                  /* local strm.lencode */

  3594.               var dcode;                  /* local strm.distcode */

  3595.               var lmask;                  /* mask for first level of length codes */

  3596.               var dmask;                  /* mask for first level of distance codes */

  3597.               var here;                   /* retrieved table entry */

  3598.               var op;                     /* code bits, operation, extra bits, or */

  3599.                                           /*  window position, window bytes to copy */

  3600.               var len;                    /* match length, unused bytes */

  3601.               var dist;                   /* match distance */

  3602.               var from;                   /* where to copy match from */

  3603.               var from_source;

  3604.             

  3605.             

  3606.               var input, output; // JS specific, because we have no pointers

  3607.             

  3608.               /* copy state to local variables */

  3609.               state = strm.state;

  3610.               //here = state.here;

  3611.               _in = strm.next_in;

  3612.               input = strm.input;

  3613.               last = _in + (strm.avail_in - 5);

  3614.               _out = strm.next_out;

  3615.               output = strm.output;

  3616.               beg = _out - (start - strm.avail_out);

  3617.               end = _out + (strm.avail_out - 257);

  3618.             //#ifdef INFLATE_STRICT

  3619.               dmax = state.dmax;

  3620.             //#endif

  3621.               wsize = state.wsize;

  3622.               whave = state.whave;

  3623.               wnext = state.wnext;

  3624.               s_window = state.window;

  3625.               hold = state.hold;

  3626.               bits = state.bits;

  3627.               lcode = state.lencode;

  3628.               dcode = state.distcode;

  3629.               lmask = (1 << state.lenbits) - 1;

  3630.               dmask = (1 << state.distbits) - 1;

  3631.             

  3632.             

  3633.               /* decode literals and length/distances until end-of-block or not enough

  3634.                  input data or output space */

  3635.             

  3636.               top:

  3637.               do {

  3638.                 if (bits < 15) {

  3639.                   hold += input[_in++] << bits;

  3640.                   bits += 8;

  3641.                   hold += input[_in++] << bits;

  3642.                   bits += 8;

  3643.                 }

  3644.             

  3645.                 here = lcode[hold & lmask];

  3646.             

  3647.                 dolen:

  3648.                 for (;;) { // Goto emulation

  3649.                   op = here >>> 24/*here.bits*/;

  3650.                   hold >>>= op;

  3651.                   bits -= op;

  3652.                   op = (here >>> 16) & 0xff/*here.op*/;

  3653.                   if (op === 0) {                          /* literal */

  3654.                     //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?

  3655.                     //        "inflate:         literal '%c'\n" :

  3656.                     //        "inflate:         literal 0x%02x\n", here.val));

  3657.                     output[_out++] = here & 0xffff/*here.val*/;

  3658.                   }

  3659.                   else if (op & 16) {                     /* length base */

  3660.                     len = here & 0xffff/*here.val*/;

  3661.                     op &= 15;                           /* number of extra bits */

  3662.                     if (op) {

  3663.                       if (bits < op) {

  3664.                         hold += input[_in++] << bits;

  3665.                         bits += 8;

  3666.                       }

  3667.                       len += hold & ((1 << op) - 1);

  3668.                       hold >>>= op;

  3669.                       bits -= op;

  3670.                     }

  3671.                     //Tracevv((stderr, "inflate:         length %u\n", len));

  3672.                     if (bits < 15) {

  3673.                       hold += input[_in++] << bits;

  3674.                       bits += 8;

  3675.                       hold += input[_in++] << bits;

  3676.                       bits += 8;

  3677.                     }

  3678.                     here = dcode[hold & dmask];

  3679.             

  3680.                     dodist:

  3681.                     for (;;) { // goto emulation

  3682.                       op = here >>> 24/*here.bits*/;

  3683.                       hold >>>= op;

  3684.                       bits -= op;

  3685.                       op = (here >>> 16) & 0xff/*here.op*/;

  3686.             

  3687.                       if (op & 16) {                      /* distance base */

  3688.                         dist = here & 0xffff/*here.val*/;

  3689.                         op &= 15;                       /* number of extra bits */

  3690.                         if (bits < op) {

  3691.                           hold += input[_in++] << bits;

  3692.                           bits += 8;

  3693.                           if (bits < op) {

  3694.                             hold += input[_in++] << bits;

  3695.                             bits += 8;

  3696.                           }

  3697.                         }

  3698.                         dist += hold & ((1 << op) - 1);

  3699.             //#ifdef INFLATE_STRICT

  3700.                         if (dist > dmax) {

  3701.                           strm.msg = 'invalid distance too far back';

  3702.                           state.mode = BAD;

  3703.                           break top;

  3704.                         }

  3705.             //#endif

  3706.                         hold >>>= op;

  3707.                         bits -= op;

  3708.                         //Tracevv((stderr, "inflate:         distance %u\n", dist));

  3709.                         op = _out - beg;                /* max distance in output */

  3710.                         if (dist > op) {                /* see if copy from window */

  3711.                           op = dist - op;               /* distance back in window */

  3712.                           if (op > whave) {

  3713.                             if (state.sane) {

  3714.                               strm.msg = 'invalid distance too far back';

  3715.                               state.mode = BAD;

  3716.                               break top;

  3717.                             }

  3718.             

  3719.             // (!) This block is disabled in zlib defaults,

  3720.             // don't enable it for binary compatibility

  3721.             //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR

  3722.             //                if (len <= op - whave) {

  3723.             //                  do {

  3724.             //                    output[_out++] = 0;

  3725.             //                  } while (--len);

  3726.             //                  continue top;

  3727.             //                }

  3728.             //                len -= op - whave;

  3729.             //                do {

  3730.             //                  output[_out++] = 0;

  3731.             //                } while (--op > whave);

  3732.             //                if (op === 0) {

  3733.             //                  from = _out - dist;

  3734.             //                  do {

  3735.             //                    output[_out++] = output[from++];

  3736.             //                  } while (--len);

  3737.             //                  continue top;

  3738.             //                }

  3739.             //#endif

  3740.                           }

  3741.                           from = 0; // window index

  3742.                           from_source = s_window;

  3743.                           if (wnext === 0) {           /* very common case */

  3744.                             from += wsize - op;

  3745.                             if (op < len) {         /* some from window */

  3746.                               len -= op;

  3747.                               do {

  3748.                                 output[_out++] = s_window[from++];

  3749.                               } while (--op);

  3750.                               from = _out - dist;  /* rest from output */

  3751.                               from_source = output;

  3752.                             }

  3753.                           }

  3754.                           else if (wnext < op) {      /* wrap around window */

  3755.                             from += wsize + wnext - op;

  3756.                             op -= wnext;

  3757.                             if (op < len) {         /* some from end of window */

  3758.                               len -= op;

  3759.                               do {

  3760.                                 output[_out++] = s_window[from++];

  3761.                               } while (--op);

  3762.                               from = 0;

  3763.                               if (wnext < len) {  /* some from start of window */

  3764.                                 op = wnext;

  3765.                                 len -= op;

  3766.                                 do {

  3767.                                   output[_out++] = s_window[from++];

  3768.                                 } while (--op);

  3769.                                 from = _out - dist;      /* rest from output */

  3770.                                 from_source = output;

  3771.                               }

  3772.                             }

  3773.                           }

  3774.                           else {                      /* contiguous in window */

  3775.                             from += wnext - op;

  3776.                             if (op < len) {         /* some from window */

  3777.                               len -= op;

  3778.                               do {

  3779.                                 output[_out++] = s_window[from++];

  3780.                               } while (--op);

  3781.                               from = _out - dist;  /* rest from output */

  3782.                               from_source = output;

  3783.                             }

  3784.                           }

  3785.                           while (len > 2) {

  3786.                             output[_out++] = from_source[from++];

  3787.                             output[_out++] = from_source[from++];

  3788.                             output[_out++] = from_source[from++];

  3789.                             len -= 3;

  3790.                           }

  3791.                           if (len) {

  3792.                             output[_out++] = from_source[from++];

  3793.                             if (len > 1) {

  3794.                               output[_out++] = from_source[from++];

  3795.                             }

  3796.                           }

  3797.                         }

  3798.                         else {

  3799.                           from = _out - dist;          /* copy direct from output */

  3800.                           do {                        /* minimum length is three */

  3801.                             output[_out++] = output[from++];

  3802.                             output[_out++] = output[from++];

  3803.                             output[_out++] = output[from++];

  3804.                             len -= 3;

  3805.                           } while (len > 2);

  3806.                           if (len) {

  3807.                             output[_out++] = output[from++];

  3808.                             if (len > 1) {

  3809.                               output[_out++] = output[from++];

  3810.                             }

  3811.                           }

  3812.                         }

  3813.                       }

  3814.                       else if ((op & 64) === 0) {          /* 2nd level distance code */

  3815.                         here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];

  3816.                         continue dodist;

  3817.                       }

  3818.                       else {

  3819.                         strm.msg = 'invalid distance code';

  3820.                         state.mode = BAD;

  3821.                         break top;

  3822.                       }

  3823.             

  3824.                       break; // need to emulate goto via "continue"

  3825.                     }

  3826.                   }

  3827.                   else if ((op & 64) === 0) {              /* 2nd level length code */

  3828.                     here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];

  3829.                     continue dolen;

  3830.                   }

  3831.                   else if (op & 32) {                     /* end-of-block */

  3832.                     //Tracevv((stderr, "inflate:         end of block\n"));

  3833.                     state.mode = TYPE;

  3834.                     break top;

  3835.                   }

  3836.                   else {

  3837.                     strm.msg = 'invalid literal/length code';

  3838.                     state.mode = BAD;

  3839.                     break top;

  3840.                   }

  3841.             

  3842.                   break; // need to emulate goto via "continue"

  3843.                 }

  3844.               } while (_in < last && _out < end);

  3845.             

  3846.               /* return unused bytes (on entry, bits < 8, so in won't go too far back) */

  3847.               len = bits >> 3;

  3848.               _in -= len;

  3849.               bits -= len << 3;

  3850.               hold &= (1 << bits) - 1;

  3851.             

  3852.               /* update state and return */

  3853.               strm.next_in = _in;

  3854.               strm.next_out = _out;

  3855.               strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));

  3856.               strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));

  3857.               state.hold = hold;

  3858.               state.bits = bits;

  3859.               return;

  3860.             };

  3861.             

  3862.             },{}],11:[function(require,module,exports){

  3863.             'use strict';

  3864.             

  3865.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  3866.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  3867.             //

  3868.             // This software is provided 'as-is', without any express or implied

  3869.             // warranty. In no event will the authors be held liable for any damages

  3870.             // arising from the use of this software.

  3871.             //

  3872.             // Permission is granted to anyone to use this software for any purpose,

  3873.             // including commercial applications, and to alter it and redistribute it

  3874.             // freely, subject to the following restrictions:

  3875.             //

  3876.             // 1. The origin of this software must not be misrepresented; you must not

  3877.             //   claim that you wrote the original software. If you use this software

  3878.             //   in a product, an acknowledgment in the product documentation would be

  3879.             //   appreciated but is not required.

  3880.             // 2. Altered source versions must be plainly marked as such, and must not be

  3881.             //   misrepresented as being the original software.

  3882.             // 3. This notice may not be removed or altered from any source distribution.

  3883.             

  3884.             var utils         = require('../utils/common');

  3885.             var adler32       = require('./adler32');

  3886.             var crc32         = require('./crc32');

  3887.             var inflate_fast  = require('./inffast');

  3888.             var inflate_table = require('./inftrees');

  3889.             

  3890.             var CODES = 0;

  3891.             var LENS = 1;

  3892.             var DISTS = 2;

  3893.             

  3894.             /* Public constants ==========================================================*/

  3895.             /* ===========================================================================*/

  3896.             

  3897.             

  3898.             /* Allowed flush values; see deflate() and inflate() below for details */

  3899.             //var Z_NO_FLUSH      = 0;

  3900.             //var Z_PARTIAL_FLUSH = 1;

  3901.             //var Z_SYNC_FLUSH    = 2;

  3902.             //var Z_FULL_FLUSH    = 3;

  3903.             var Z_FINISH        = 4;

  3904.             var Z_BLOCK         = 5;

  3905.             var Z_TREES         = 6;

  3906.             

  3907.             

  3908.             /* Return codes for the compression/decompression functions. Negative values

  3909.              * are errors, positive values are used for special but normal events.

  3910.              */

  3911.             var Z_OK            = 0;

  3912.             var Z_STREAM_END    = 1;

  3913.             var Z_NEED_DICT     = 2;

  3914.             //var Z_ERRNO         = -1;

  3915.             var Z_STREAM_ERROR  = -2;

  3916.             var Z_DATA_ERROR    = -3;

  3917.             var Z_MEM_ERROR     = -4;

  3918.             var Z_BUF_ERROR     = -5;

  3919.             //var Z_VERSION_ERROR = -6;

  3920.             

  3921.             /* The deflate compression method */

  3922.             var Z_DEFLATED  = 8;

  3923.             

  3924.             

  3925.             /* STATES ====================================================================*/

  3926.             /* ===========================================================================*/

  3927.             

  3928.             

  3929.             var    HEAD = 1;       /* i: waiting for magic header */

  3930.             var    FLAGS = 2;      /* i: waiting for method and flags (gzip) */

  3931.             var    TIME = 3;       /* i: waiting for modification time (gzip) */

  3932.             var    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */

  3933.             var    EXLEN = 5;      /* i: waiting for extra length (gzip) */

  3934.             var    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */

  3935.             var    NAME = 7;       /* i: waiting for end of file name (gzip) */

  3936.             var    COMMENT = 8;    /* i: waiting for end of comment (gzip) */

  3937.             var    HCRC = 9;       /* i: waiting for header crc (gzip) */

  3938.             var    DICTID = 10;    /* i: waiting for dictionary check value */

  3939.             var    DICT = 11;      /* waiting for inflateSetDictionary() call */

  3940.             var        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */

  3941.             var        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */

  3942.             var        STORED = 14;    /* i: waiting for stored size (length and complement) */

  3943.             var        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */

  3944.             var        COPY = 16;      /* i/o: waiting for input or output to copy stored block */

  3945.             var        TABLE = 17;     /* i: waiting for dynamic block table lengths */

  3946.             var        LENLENS = 18;   /* i: waiting for code length code lengths */

  3947.             var        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */

  3948.             var            LEN_ = 20;      /* i: same as LEN below, but only first time in */

  3949.             var            LEN = 21;       /* i: waiting for length/lit/eob code */

  3950.             var            LENEXT = 22;    /* i: waiting for length extra bits */

  3951.             var            DIST = 23;      /* i: waiting for distance code */

  3952.             var            DISTEXT = 24;   /* i: waiting for distance extra bits */

  3953.             var            MATCH = 25;     /* o: waiting for output space to copy string */

  3954.             var            LIT = 26;       /* o: waiting for output space to write literal */

  3955.             var    CHECK = 27;     /* i: waiting for 32-bit check value */

  3956.             var    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */

  3957.             var    DONE = 29;      /* finished check, done -- remain here until reset */

  3958.             var    BAD = 30;       /* got a data error -- remain here until reset */

  3959.             var    MEM = 31;       /* got an inflate() memory error -- remain here until reset */

  3960.             var    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */

  3961.             

  3962.             /* ===========================================================================*/

  3963.             

  3964.             

  3965.             

  3966.             var ENOUGH_LENS = 852;

  3967.             var ENOUGH_DISTS = 592;

  3968.             //var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);

  3969.             

  3970.             var MAX_WBITS = 15;

  3971.             /* 32K LZ77 window */

  3972.             var DEF_WBITS = MAX_WBITS;

  3973.             

  3974.             

  3975.             function zswap32(q) {

  3976.               return  (((q >>> 24) & 0xff) +

  3977.                       ((q >>> 8) & 0xff00) +

  3978.                       ((q & 0xff00) << 8) +

  3979.                       ((q & 0xff) << 24));

  3980.             }

  3981.             

  3982.             

  3983.             function InflateState() {

  3984.               this.mode = 0;             /* current inflate mode */

  3985.               this.last = false;          /* true if processing last block */

  3986.               this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */

  3987.               this.havedict = false;      /* true if dictionary provided */

  3988.               this.flags = 0;             /* gzip header method and flags (0 if zlib) */

  3989.               this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */

  3990.               this.check = 0;             /* protected copy of check value */

  3991.               this.total = 0;             /* protected copy of output count */

  3992.               // TODO: may be {}

  3993.               this.head = null;           /* where to save gzip header information */

  3994.             

  3995.               /* sliding window */

  3996.               this.wbits = 0;             /* log base 2 of requested window size */

  3997.               this.wsize = 0;             /* window size or zero if not using window */

  3998.               this.whave = 0;             /* valid bytes in the window */

  3999.               this.wnext = 0;             /* window write index */

  4000.               this.window = null;         /* allocated sliding window, if needed */

  4001.             

  4002.               /* bit accumulator */

  4003.               this.hold = 0;              /* input bit accumulator */

  4004.               this.bits = 0;              /* number of bits in "in" */

  4005.             

  4006.               /* for string and stored block copying */

  4007.               this.length = 0;            /* literal or length of data to copy */

  4008.               this.offset = 0;            /* distance back to copy string from */

  4009.             

  4010.               /* for table and code decoding */

  4011.               this.extra = 0;             /* extra bits needed */

  4012.             

  4013.               /* fixed and dynamic code tables */

  4014.               this.lencode = null;          /* starting table for length/literal codes */

  4015.               this.distcode = null;         /* starting table for distance codes */

  4016.               this.lenbits = 0;           /* index bits for lencode */

  4017.               this.distbits = 0;          /* index bits for distcode */

  4018.             

  4019.               /* dynamic table building */

  4020.               this.ncode = 0;             /* number of code length code lengths */

  4021.               this.nlen = 0;              /* number of length code lengths */

  4022.               this.ndist = 0;             /* number of distance code lengths */

  4023.               this.have = 0;              /* number of code lengths in lens[] */

  4024.               this.next = null;              /* next available space in codes[] */

  4025.             

  4026.               this.lens = new utils.Buf16(320); /* temporary storage for code lengths */

  4027.               this.work = new utils.Buf16(288); /* work area for code table building */

  4028.             

  4029.               /*

  4030.                because we don't have pointers in js, we use lencode and distcode directly

  4031.                as buffers so we don't need codes

  4032.               */

  4033.               //this.codes = new utils.Buf32(ENOUGH);       /* space for code tables */

  4034.               this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */

  4035.               this.distdyn = null;             /* dynamic table for distance codes (JS specific) */

  4036.               this.sane = 0;                   /* if false, allow invalid distance too far */

  4037.               this.back = 0;                   /* bits back of last unprocessed length/lit */

  4038.               this.was = 0;                    /* initial length of match */

  4039.             }

  4040.             

  4041.             function inflateResetKeep(strm) {

  4042.               var state;

  4043.             

  4044.               if (!strm || !strm.state) { return Z_STREAM_ERROR; }

  4045.               state = strm.state;

  4046.               strm.total_in = strm.total_out = state.total = 0;

  4047.               strm.msg = ''; /*Z_NULL*/

  4048.               if (state.wrap) {       /* to support ill-conceived Java test suite */

  4049.                 strm.adler = state.wrap & 1;

  4050.               }

  4051.               state.mode = HEAD;

  4052.               state.last = 0;

  4053.               state.havedict = 0;

  4054.               state.dmax = 32768;

  4055.               state.head = null/*Z_NULL*/;

  4056.               state.hold = 0;

  4057.               state.bits = 0;

  4058.               //state.lencode = state.distcode = state.next = state.codes;

  4059.               state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);

  4060.               state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);

  4061.             

  4062.               state.sane = 1;

  4063.               state.back = -1;

  4064.               //Tracev((stderr, "inflate: reset\n"));

  4065.               return Z_OK;

  4066.             }

  4067.             

  4068.             function inflateReset(strm) {

  4069.               var state;

  4070.             

  4071.               if (!strm || !strm.state) { return Z_STREAM_ERROR; }

  4072.               state = strm.state;

  4073.               state.wsize = 0;

  4074.               state.whave = 0;

  4075.               state.wnext = 0;

  4076.               return inflateResetKeep(strm);

  4077.             

  4078.             }

  4079.             

  4080.             function inflateReset2(strm, windowBits) {

  4081.               var wrap;

  4082.               var state;

  4083.             

  4084.               /* get the state */

  4085.               if (!strm || !strm.state) { return Z_STREAM_ERROR; }

  4086.               state = strm.state;

  4087.             

  4088.               /* extract wrap request from windowBits parameter */

  4089.               if (windowBits < 0) {

  4090.                 wrap = 0;

  4091.                 windowBits = -windowBits;

  4092.               }

  4093.               else {

  4094.                 wrap = (windowBits >> 4) + 1;

  4095.                 if (windowBits < 48) {

  4096.                   windowBits &= 15;

  4097.                 }

  4098.               }

  4099.             

  4100.               /* set number of window bits, free window if different */

  4101.               if (windowBits && (windowBits < 8 || windowBits > 15)) {

  4102.                 return Z_STREAM_ERROR;

  4103.               }

  4104.               if (state.window !== null && state.wbits !== windowBits) {

  4105.                 state.window = null;

  4106.               }

  4107.             

  4108.               /* update state and reset the rest of it */

  4109.               state.wrap = wrap;

  4110.               state.wbits = windowBits;

  4111.               return inflateReset(strm);

  4112.             }

  4113.             

  4114.             function inflateInit2(strm, windowBits) {

  4115.               var ret;

  4116.               var state;

  4117.             

  4118.               if (!strm) { return Z_STREAM_ERROR; }

  4119.               //strm.msg = Z_NULL;                 /* in case we return an error */

  4120.             

  4121.               state = new InflateState();

  4122.             

  4123.               //if (state === Z_NULL) return Z_MEM_ERROR;

  4124.               //Tracev((stderr, "inflate: allocated\n"));

  4125.               strm.state = state;

  4126.               state.window = null/*Z_NULL*/;

  4127.               ret = inflateReset2(strm, windowBits);

  4128.               if (ret !== Z_OK) {

  4129.                 strm.state = null/*Z_NULL*/;

  4130.               }

  4131.               return ret;

  4132.             }

  4133.             

  4134.             function inflateInit(strm) {

  4135.               return inflateInit2(strm, DEF_WBITS);

  4136.             }

  4137.             

  4138.             

  4139.             /*

  4140.              Return state with length and distance decoding tables and index sizes set to

  4141.              fixed code decoding.  Normally this returns fixed tables from inffixed.h.

  4142.              If BUILDFIXED is defined, then instead this routine builds the tables the

  4143.              first time it's called, and returns those tables the first time and

  4144.              thereafter.  This reduces the size of the code by about 2K bytes, in

  4145.              exchange for a little execution time.  However, BUILDFIXED should not be

  4146.              used for threaded applications, since the rewriting of the tables and virgin

  4147.              may not be thread-safe.

  4148.              */

  4149.             var virgin = true;

  4150.             

  4151.             var lenfix, distfix; // We have no pointers in JS, so keep tables separate

  4152.             

  4153.             function fixedtables(state) {

  4154.               /* build fixed huffman tables if first call (may not be thread safe) */

  4155.               if (virgin) {

  4156.                 var sym;

  4157.             

  4158.                 lenfix = new utils.Buf32(512);

  4159.                 distfix = new utils.Buf32(32);

  4160.             

  4161.                 /* literal/length table */

  4162.                 sym = 0;

  4163.                 while (sym < 144) { state.lens[sym++] = 8; }

  4164.                 while (sym < 256) { state.lens[sym++] = 9; }

  4165.                 while (sym < 280) { state.lens[sym++] = 7; }

  4166.                 while (sym < 288) { state.lens[sym++] = 8; }

  4167.             

  4168.                 inflate_table(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });

  4169.             

  4170.                 /* distance table */

  4171.                 sym = 0;

  4172.                 while (sym < 32) { state.lens[sym++] = 5; }

  4173.             

  4174.                 inflate_table(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });

  4175.             

  4176.                 /* do this just once */

  4177.                 virgin = false;

  4178.               }

  4179.             

  4180.               state.lencode = lenfix;

  4181.               state.lenbits = 9;

  4182.               state.distcode = distfix;

  4183.               state.distbits = 5;

  4184.             }

  4185.             

  4186.             

  4187.             /*

  4188.              Update the window with the last wsize (normally 32K) bytes written before

  4189.              returning.  If window does not exist yet, create it.  This is only called

  4190.              when a window is already in use, or when output has been written during this

  4191.              inflate call, but the end of the deflate stream has not been reached yet.

  4192.              It is also called to create a window for dictionary data when a dictionary

  4193.              is loaded.

  4194.             

  4195.              Providing output buffers larger than 32K to inflate() should provide a speed

  4196.              advantage, since only the last 32K of output is copied to the sliding window

  4197.              upon return from inflate(), and since all distances after the first 32K of

  4198.              output will fall in the output data, making match copies simpler and faster.

  4199.              The advantage may be dependent on the size of the processor's data caches.

  4200.              */

  4201.             function updatewindow(strm, src, end, copy) {

  4202.               var dist;

  4203.               var state = strm.state;

  4204.             

  4205.               /* if it hasn't been done already, allocate space for the window */

  4206.               if (state.window === null) {

  4207.                 state.wsize = 1 << state.wbits;

  4208.                 state.wnext = 0;

  4209.                 state.whave = 0;

  4210.             

  4211.                 state.window = new utils.Buf8(state.wsize);

  4212.               }

  4213.             

  4214.               /* copy state->wsize or less output bytes into the circular window */

  4215.               if (copy >= state.wsize) {

  4216.                 utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);

  4217.                 state.wnext = 0;

  4218.                 state.whave = state.wsize;

  4219.               }

  4220.               else {

  4221.                 dist = state.wsize - state.wnext;

  4222.                 if (dist > copy) {

  4223.                   dist = copy;

  4224.                 }

  4225.                 //zmemcpy(state->window + state->wnext, end - copy, dist);

  4226.                 utils.arraySet(state.window, src, end - copy, dist, state.wnext);

  4227.                 copy -= dist;

  4228.                 if (copy) {

  4229.                   //zmemcpy(state->window, end - copy, copy);

  4230.                   utils.arraySet(state.window, src, end - copy, copy, 0);

  4231.                   state.wnext = copy;

  4232.                   state.whave = state.wsize;

  4233.                 }

  4234.                 else {

  4235.                   state.wnext += dist;

  4236.                   if (state.wnext === state.wsize) { state.wnext = 0; }

  4237.                   if (state.whave < state.wsize) { state.whave += dist; }

  4238.                 }

  4239.               }

  4240.               return 0;

  4241.             }

  4242.             

  4243.             function inflate(strm, flush) {

  4244.               var state;

  4245.               var input, output;          // input/output buffers

  4246.               var next;                   /* next input INDEX */

  4247.               var put;                    /* next output INDEX */

  4248.               var have, left;             /* available input and output */

  4249.               var hold;                   /* bit buffer */

  4250.               var bits;                   /* bits in bit buffer */

  4251.               var _in, _out;              /* save starting available input and output */

  4252.               var copy;                   /* number of stored or match bytes to copy */

  4253.               var from;                   /* where to copy match bytes from */

  4254.               var from_source;

  4255.               var here = 0;               /* current decoding table entry */

  4256.               var here_bits, here_op, here_val; // paked "here" denormalized (JS specific)

  4257.               //var last;                   /* parent table entry */

  4258.               var last_bits, last_op, last_val; // paked "last" denormalized (JS specific)

  4259.               var len;                    /* length to copy for repeats, bits to drop */

  4260.               var ret;                    /* return code */

  4261.               var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */

  4262.               var opts;

  4263.             

  4264.               var n; // temporary var for NEED_BITS

  4265.             

  4266.               var order = /* permutation of code lengths */

  4267.                 [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];

  4268.             

  4269.             

  4270.               if (!strm || !strm.state || !strm.output ||

  4271.                   (!strm.input && strm.avail_in !== 0)) {

  4272.                 return Z_STREAM_ERROR;

  4273.               }

  4274.             

  4275.               state = strm.state;

  4276.               if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */

  4277.             

  4278.             

  4279.               //--- LOAD() ---

  4280.               put = strm.next_out;

  4281.               output = strm.output;

  4282.               left = strm.avail_out;

  4283.               next = strm.next_in;

  4284.               input = strm.input;

  4285.               have = strm.avail_in;

  4286.               hold = state.hold;

  4287.               bits = state.bits;

  4288.               //---

  4289.             

  4290.               _in = have;

  4291.               _out = left;

  4292.               ret = Z_OK;

  4293.             

  4294.               inf_leave: // goto emulation

  4295.               for (;;) {

  4296.                 switch (state.mode) {

  4297.                   case HEAD:

  4298.                     if (state.wrap === 0) {

  4299.                       state.mode = TYPEDO;

  4300.                       break;

  4301.                     }

  4302.                     //=== NEEDBITS(16);

  4303.                     while (bits < 16) {

  4304.                       if (have === 0) { break inf_leave; }

  4305.                       have--;

  4306.                       hold += input[next++] << bits;

  4307.                       bits += 8;

  4308.                     }

  4309.                     //===//

  4310.                     if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */

  4311.                       state.check = 0/*crc32(0L, Z_NULL, 0)*/;

  4312.                       //=== CRC2(state.check, hold);

  4313.                       hbuf[0] = hold & 0xff;

  4314.                       hbuf[1] = (hold >>> 8) & 0xff;

  4315.                       state.check = crc32(state.check, hbuf, 2, 0);

  4316.                       //===//

  4317.             

  4318.                       //=== INITBITS();

  4319.                       hold = 0;

  4320.                       bits = 0;

  4321.                       //===//

  4322.                       state.mode = FLAGS;

  4323.                       break;

  4324.                     }

  4325.                     state.flags = 0;           /* expect zlib header */

  4326.                     if (state.head) {

  4327.                       state.head.done = false;

  4328.                     }

  4329.                     if (!(state.wrap & 1) ||   /* check if zlib header allowed */

  4330.                       (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {

  4331.                       strm.msg = 'incorrect header check';

  4332.                       state.mode = BAD;

  4333.                       break;

  4334.                     }

  4335.                     if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {

  4336.                       strm.msg = 'unknown compression method';

  4337.                       state.mode = BAD;

  4338.                       break;

  4339.                     }

  4340.                     //--- DROPBITS(4) ---//

  4341.                     hold >>>= 4;

  4342.                     bits -= 4;

  4343.                     //---//

  4344.                     len = (hold & 0x0f)/*BITS(4)*/ + 8;

  4345.                     if (state.wbits === 0) {

  4346.                       state.wbits = len;

  4347.                     }

  4348.                     else if (len > state.wbits) {

  4349.                       strm.msg = 'invalid window size';

  4350.                       state.mode = BAD;

  4351.                       break;

  4352.                     }

  4353.                     state.dmax = 1 << len;

  4354.                     //Tracev((stderr, "inflate:   zlib header ok\n"));

  4355.                     strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;

  4356.                     state.mode = hold & 0x200 ? DICTID : TYPE;

  4357.                     //=== INITBITS();

  4358.                     hold = 0;

  4359.                     bits = 0;

  4360.                     //===//

  4361.                     break;

  4362.                   case FLAGS:

  4363.                     //=== NEEDBITS(16); */

  4364.                     while (bits < 16) {

  4365.                       if (have === 0) { break inf_leave; }

  4366.                       have--;

  4367.                       hold += input[next++] << bits;

  4368.                       bits += 8;

  4369.                     }

  4370.                     //===//

  4371.                     state.flags = hold;

  4372.                     if ((state.flags & 0xff) !== Z_DEFLATED) {

  4373.                       strm.msg = 'unknown compression method';

  4374.                       state.mode = BAD;

  4375.                       break;

  4376.                     }

  4377.                     if (state.flags & 0xe000) {

  4378.                       strm.msg = 'unknown header flags set';

  4379.                       state.mode = BAD;

  4380.                       break;

  4381.                     }

  4382.                     if (state.head) {

  4383.                       state.head.text = ((hold >> 8) & 1);

  4384.                     }

  4385.                     if (state.flags & 0x0200) {

  4386.                       //=== CRC2(state.check, hold);

  4387.                       hbuf[0] = hold & 0xff;

  4388.                       hbuf[1] = (hold >>> 8) & 0xff;

  4389.                       state.check = crc32(state.check, hbuf, 2, 0);

  4390.                       //===//

  4391.                     }

  4392.                     //=== INITBITS();

  4393.                     hold = 0;

  4394.                     bits = 0;

  4395.                     //===//

  4396.                     state.mode = TIME;

  4397.                     /* falls through */

  4398.                   case TIME:

  4399.                     //=== NEEDBITS(32); */

  4400.                     while (bits < 32) {

  4401.                       if (have === 0) { break inf_leave; }

  4402.                       have--;

  4403.                       hold += input[next++] << bits;

  4404.                       bits += 8;

  4405.                     }

  4406.                     //===//

  4407.                     if (state.head) {

  4408.                       state.head.time = hold;

  4409.                     }

  4410.                     if (state.flags & 0x0200) {

  4411.                       //=== CRC4(state.check, hold)

  4412.                       hbuf[0] = hold & 0xff;

  4413.                       hbuf[1] = (hold >>> 8) & 0xff;

  4414.                       hbuf[2] = (hold >>> 16) & 0xff;

  4415.                       hbuf[3] = (hold >>> 24) & 0xff;

  4416.                       state.check = crc32(state.check, hbuf, 4, 0);

  4417.                       //===

  4418.                     }

  4419.                     //=== INITBITS();

  4420.                     hold = 0;

  4421.                     bits = 0;

  4422.                     //===//

  4423.                     state.mode = OS;

  4424.                     /* falls through */

  4425.                   case OS:

  4426.                     //=== NEEDBITS(16); */

  4427.                     while (bits < 16) {

  4428.                       if (have === 0) { break inf_leave; }

  4429.                       have--;

  4430.                       hold += input[next++] << bits;

  4431.                       bits += 8;

  4432.                     }

  4433.                     //===//

  4434.                     if (state.head) {

  4435.                       state.head.xflags = (hold & 0xff);

  4436.                       state.head.os = (hold >> 8);

  4437.                     }

  4438.                     if (state.flags & 0x0200) {

  4439.                       //=== CRC2(state.check, hold);

  4440.                       hbuf[0] = hold & 0xff;

  4441.                       hbuf[1] = (hold >>> 8) & 0xff;

  4442.                       state.check = crc32(state.check, hbuf, 2, 0);

  4443.                       //===//

  4444.                     }

  4445.                     //=== INITBITS();

  4446.                     hold = 0;

  4447.                     bits = 0;

  4448.                     //===//

  4449.                     state.mode = EXLEN;

  4450.                     /* falls through */

  4451.                   case EXLEN:

  4452.                     if (state.flags & 0x0400) {

  4453.                       //=== NEEDBITS(16); */

  4454.                       while (bits < 16) {

  4455.                         if (have === 0) { break inf_leave; }

  4456.                         have--;

  4457.                         hold += input[next++] << bits;

  4458.                         bits += 8;

  4459.                       }

  4460.                       //===//

  4461.                       state.length = hold;

  4462.                       if (state.head) {

  4463.                         state.head.extra_len = hold;

  4464.                       }

  4465.                       if (state.flags & 0x0200) {

  4466.                         //=== CRC2(state.check, hold);

  4467.                         hbuf[0] = hold & 0xff;

  4468.                         hbuf[1] = (hold >>> 8) & 0xff;

  4469.                         state.check = crc32(state.check, hbuf, 2, 0);

  4470.                         //===//

  4471.                       }

  4472.                       //=== INITBITS();

  4473.                       hold = 0;

  4474.                       bits = 0;

  4475.                       //===//

  4476.                     }

  4477.                     else if (state.head) {

  4478.                       state.head.extra = null/*Z_NULL*/;

  4479.                     }

  4480.                     state.mode = EXTRA;

  4481.                     /* falls through */

  4482.                   case EXTRA:

  4483.                     if (state.flags & 0x0400) {

  4484.                       copy = state.length;

  4485.                       if (copy > have) { copy = have; }

  4486.                       if (copy) {

  4487.                         if (state.head) {

  4488.                           len = state.head.extra_len - state.length;

  4489.                           if (!state.head.extra) {

  4490.                             // Use untyped array for more convenient processing later

  4491.                             state.head.extra = new Array(state.head.extra_len);

  4492.                           }

  4493.                           utils.arraySet(

  4494.                             state.head.extra,

  4495.                             input,

  4496.                             next,

  4497.                             // extra field is limited to 65536 bytes

  4498.                             // - no need for additional size check

  4499.                             copy,

  4500.                             /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/

  4501.                             len

  4502.                           );

  4503.                           //zmemcpy(state.head.extra + len, next,

  4504.                           //        len + copy > state.head.extra_max ?

  4505.                           //        state.head.extra_max - len : copy);

  4506.                         }

  4507.                         if (state.flags & 0x0200) {

  4508.                           state.check = crc32(state.check, input, copy, next);

  4509.                         }

  4510.                         have -= copy;

  4511.                         next += copy;

  4512.                         state.length -= copy;

  4513.                       }

  4514.                       if (state.length) { break inf_leave; }

  4515.                     }

  4516.                     state.length = 0;

  4517.                     state.mode = NAME;

  4518.                     /* falls through */

  4519.                   case NAME:

  4520.                     if (state.flags & 0x0800) {

  4521.                       if (have === 0) { break inf_leave; }

  4522.                       copy = 0;

  4523.                       do {

  4524.                         // TODO: 2 or 1 bytes?

  4525.                         len = input[next + copy++];

  4526.                         /* use constant limit because in js we should not preallocate memory */

  4527.                         if (state.head && len &&

  4528.                             (state.length < 65536 /*state.head.name_max*/)) {

  4529.                           state.head.name += String.fromCharCode(len);

  4530.                         }

  4531.                       } while (len && copy < have);

  4532.             

  4533.                       if (state.flags & 0x0200) {

  4534.                         state.check = crc32(state.check, input, copy, next);

  4535.                       }

  4536.                       have -= copy;

  4537.                       next += copy;

  4538.                       if (len) { break inf_leave; }

  4539.                     }

  4540.                     else if (state.head) {

  4541.                       state.head.name = null;

  4542.                     }

  4543.                     state.length = 0;

  4544.                     state.mode = COMMENT;

  4545.                     /* falls through */

  4546.                   case COMMENT:

  4547.                     if (state.flags & 0x1000) {

  4548.                       if (have === 0) { break inf_leave; }

  4549.                       copy = 0;

  4550.                       do {

  4551.                         len = input[next + copy++];

  4552.                         /* use constant limit because in js we should not preallocate memory */

  4553.                         if (state.head && len &&

  4554.                             (state.length < 65536 /*state.head.comm_max*/)) {

  4555.                           state.head.comment += String.fromCharCode(len);

  4556.                         }

  4557.                       } while (len && copy < have);

  4558.                       if (state.flags & 0x0200) {

  4559.                         state.check = crc32(state.check, input, copy, next);

  4560.                       }

  4561.                       have -= copy;

  4562.                       next += copy;

  4563.                       if (len) { break inf_leave; }

  4564.                     }

  4565.                     else if (state.head) {

  4566.                       state.head.comment = null;

  4567.                     }

  4568.                     state.mode = HCRC;

  4569.                     /* falls through */

  4570.                   case HCRC:

  4571.                     if (state.flags & 0x0200) {

  4572.                       //=== NEEDBITS(16); */

  4573.                       while (bits < 16) {

  4574.                         if (have === 0) { break inf_leave; }

  4575.                         have--;

  4576.                         hold += input[next++] << bits;

  4577.                         bits += 8;

  4578.                       }

  4579.                       //===//

  4580.                       if (hold !== (state.check & 0xffff)) {

  4581.                         strm.msg = 'header crc mismatch';

  4582.                         state.mode = BAD;

  4583.                         break;

  4584.                       }

  4585.                       //=== INITBITS();

  4586.                       hold = 0;

  4587.                       bits = 0;

  4588.                       //===//

  4589.                     }

  4590.                     if (state.head) {

  4591.                       state.head.hcrc = ((state.flags >> 9) & 1);

  4592.                       state.head.done = true;

  4593.                     }

  4594.                     strm.adler = state.check = 0;

  4595.                     state.mode = TYPE;

  4596.                     break;

  4597.                   case DICTID:

  4598.                     //=== NEEDBITS(32); */

  4599.                     while (bits < 32) {

  4600.                       if (have === 0) { break inf_leave; }

  4601.                       have--;

  4602.                       hold += input[next++] << bits;

  4603.                       bits += 8;

  4604.                     }

  4605.                     //===//

  4606.                     strm.adler = state.check = zswap32(hold);

  4607.                     //=== INITBITS();

  4608.                     hold = 0;

  4609.                     bits = 0;

  4610.                     //===//

  4611.                     state.mode = DICT;

  4612.                     /* falls through */

  4613.                   case DICT:

  4614.                     if (state.havedict === 0) {

  4615.                       //--- RESTORE() ---

  4616.                       strm.next_out = put;

  4617.                       strm.avail_out = left;

  4618.                       strm.next_in = next;

  4619.                       strm.avail_in = have;

  4620.                       state.hold = hold;

  4621.                       state.bits = bits;

  4622.                       //---

  4623.                       return Z_NEED_DICT;

  4624.                     }

  4625.                     strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;

  4626.                     state.mode = TYPE;

  4627.                     /* falls through */

  4628.                   case TYPE:

  4629.                     if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }

  4630.                     /* falls through */

  4631.                   case TYPEDO:

  4632.                     if (state.last) {

  4633.                       //--- BYTEBITS() ---//

  4634.                       hold >>>= bits & 7;

  4635.                       bits -= bits & 7;

  4636.                       //---//

  4637.                       state.mode = CHECK;

  4638.                       break;

  4639.                     }

  4640.                     //=== NEEDBITS(3); */

  4641.                     while (bits < 3) {

  4642.                       if (have === 0) { break inf_leave; }

  4643.                       have--;

  4644.                       hold += input[next++] << bits;

  4645.                       bits += 8;

  4646.                     }

  4647.                     //===//

  4648.                     state.last = (hold & 0x01)/*BITS(1)*/;

  4649.                     //--- DROPBITS(1) ---//

  4650.                     hold >>>= 1;

  4651.                     bits -= 1;

  4652.                     //---//

  4653.             

  4654.                     switch ((hold & 0x03)/*BITS(2)*/) {

  4655.                       case 0:                             /* stored block */

  4656.                         //Tracev((stderr, "inflate:     stored block%s\n",

  4657.                         //        state.last ? " (last)" : ""));

  4658.                         state.mode = STORED;

  4659.                         break;

  4660.                       case 1:                             /* fixed block */

  4661.                         fixedtables(state);

  4662.                         //Tracev((stderr, "inflate:     fixed codes block%s\n",

  4663.                         //        state.last ? " (last)" : ""));

  4664.                         state.mode = LEN_;             /* decode codes */

  4665.                         if (flush === Z_TREES) {

  4666.                           //--- DROPBITS(2) ---//

  4667.                           hold >>>= 2;

  4668.                           bits -= 2;

  4669.                           //---//

  4670.                           break inf_leave;

  4671.                         }

  4672.                         break;

  4673.                       case 2:                             /* dynamic block */

  4674.                         //Tracev((stderr, "inflate:     dynamic codes block%s\n",

  4675.                         //        state.last ? " (last)" : ""));

  4676.                         state.mode = TABLE;

  4677.                         break;

  4678.                       case 3:

  4679.                         strm.msg = 'invalid block type';

  4680.                         state.mode = BAD;

  4681.                     }

  4682.                     //--- DROPBITS(2) ---//

  4683.                     hold >>>= 2;

  4684.                     bits -= 2;

  4685.                     //---//

  4686.                     break;

  4687.                   case STORED:

  4688.                     //--- BYTEBITS() ---// /* go to byte boundary */

  4689.                     hold >>>= bits & 7;

  4690.                     bits -= bits & 7;

  4691.                     //---//

  4692.                     //=== NEEDBITS(32); */

  4693.                     while (bits < 32) {

  4694.                       if (have === 0) { break inf_leave; }

  4695.                       have--;

  4696.                       hold += input[next++] << bits;

  4697.                       bits += 8;

  4698.                     }

  4699.                     //===//

  4700.                     if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {

  4701.                       strm.msg = 'invalid stored block lengths';

  4702.                       state.mode = BAD;

  4703.                       break;

  4704.                     }

  4705.                     state.length = hold & 0xffff;

  4706.                     //Tracev((stderr, "inflate:       stored length %u\n",

  4707.                     //        state.length));

  4708.                     //=== INITBITS();

  4709.                     hold = 0;

  4710.                     bits = 0;

  4711.                     //===//

  4712.                     state.mode = COPY_;

  4713.                     if (flush === Z_TREES) { break inf_leave; }

  4714.                     /* falls through */

  4715.                   case COPY_:

  4716.                     state.mode = COPY;

  4717.                     /* falls through */

  4718.                   case COPY:

  4719.                     copy = state.length;

  4720.                     if (copy) {

  4721.                       if (copy > have) { copy = have; }

  4722.                       if (copy > left) { copy = left; }

  4723.                       if (copy === 0) { break inf_leave; }

  4724.                       //--- zmemcpy(put, next, copy); ---

  4725.                       utils.arraySet(output, input, next, copy, put);

  4726.                       //---//

  4727.                       have -= copy;

  4728.                       next += copy;

  4729.                       left -= copy;

  4730.                       put += copy;

  4731.                       state.length -= copy;

  4732.                       break;

  4733.                     }

  4734.                     //Tracev((stderr, "inflate:       stored end\n"));

  4735.                     state.mode = TYPE;

  4736.                     break;

  4737.                   case TABLE:

  4738.                     //=== NEEDBITS(14); */

  4739.                     while (bits < 14) {

  4740.                       if (have === 0) { break inf_leave; }

  4741.                       have--;

  4742.                       hold += input[next++] << bits;

  4743.                       bits += 8;

  4744.                     }

  4745.                     //===//

  4746.                     state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;

  4747.                     //--- DROPBITS(5) ---//

  4748.                     hold >>>= 5;

  4749.                     bits -= 5;

  4750.                     //---//

  4751.                     state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;

  4752.                     //--- DROPBITS(5) ---//

  4753.                     hold >>>= 5;

  4754.                     bits -= 5;

  4755.                     //---//

  4756.                     state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;

  4757.                     //--- DROPBITS(4) ---//

  4758.                     hold >>>= 4;

  4759.                     bits -= 4;

  4760.                     //---//

  4761.             //#ifndef PKZIP_BUG_WORKAROUND

  4762.                     if (state.nlen > 286 || state.ndist > 30) {

  4763.                       strm.msg = 'too many length or distance symbols';

  4764.                       state.mode = BAD;

  4765.                       break;

  4766.                     }

  4767.             //#endif

  4768.                     //Tracev((stderr, "inflate:       table sizes ok\n"));

  4769.                     state.have = 0;

  4770.                     state.mode = LENLENS;

  4771.                     /* falls through */

  4772.                   case LENLENS:

  4773.                     while (state.have < state.ncode) {

  4774.                       //=== NEEDBITS(3);

  4775.                       while (bits < 3) {

  4776.                         if (have === 0) { break inf_leave; }

  4777.                         have--;

  4778.                         hold += input[next++] << bits;

  4779.                         bits += 8;

  4780.                       }

  4781.                       //===//

  4782.                       state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);

  4783.                       //--- DROPBITS(3) ---//

  4784.                       hold >>>= 3;

  4785.                       bits -= 3;

  4786.                       //---//

  4787.                     }

  4788.                     while (state.have < 19) {

  4789.                       state.lens[order[state.have++]] = 0;

  4790.                     }

  4791.                     // We have separate tables & no pointers. 2 commented lines below not needed.

  4792.                     //state.next = state.codes;

  4793.                     //state.lencode = state.next;

  4794.                     // Switch to use dynamic table

  4795.                     state.lencode = state.lendyn;

  4796.                     state.lenbits = 7;

  4797.             

  4798.                     opts = { bits: state.lenbits };

  4799.                     ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);

  4800.                     state.lenbits = opts.bits;

  4801.             

  4802.                     if (ret) {

  4803.                       strm.msg = 'invalid code lengths set';

  4804.                       state.mode = BAD;

  4805.                       break;

  4806.                     }

  4807.                     //Tracev((stderr, "inflate:       code lengths ok\n"));

  4808.                     state.have = 0;

  4809.                     state.mode = CODELENS;

  4810.                     /* falls through */

  4811.                   case CODELENS:

  4812.                     while (state.have < state.nlen + state.ndist) {

  4813.                       for (;;) {

  4814.                         here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/

  4815.                         here_bits = here >>> 24;

  4816.                         here_op = (here >>> 16) & 0xff;

  4817.                         here_val = here & 0xffff;

  4818.             

  4819.                         if ((here_bits) <= bits) { break; }

  4820.                         //--- PULLBYTE() ---//

  4821.                         if (have === 0) { break inf_leave; }

  4822.                         have--;

  4823.                         hold += input[next++] << bits;

  4824.                         bits += 8;

  4825.                         //---//

  4826.                       }

  4827.                       if (here_val < 16) {

  4828.                         //--- DROPBITS(here.bits) ---//

  4829.                         hold >>>= here_bits;

  4830.                         bits -= here_bits;

  4831.                         //---//

  4832.                         state.lens[state.have++] = here_val;

  4833.                       }

  4834.                       else {

  4835.                         if (here_val === 16) {

  4836.                           //=== NEEDBITS(here.bits + 2);

  4837.                           n = here_bits + 2;

  4838.                           while (bits < n) {

  4839.                             if (have === 0) { break inf_leave; }

  4840.                             have--;

  4841.                             hold += input[next++] << bits;

  4842.                             bits += 8;

  4843.                           }

  4844.                           //===//

  4845.                           //--- DROPBITS(here.bits) ---//

  4846.                           hold >>>= here_bits;

  4847.                           bits -= here_bits;

  4848.                           //---//

  4849.                           if (state.have === 0) {

  4850.                             strm.msg = 'invalid bit length repeat';

  4851.                             state.mode = BAD;

  4852.                             break;

  4853.                           }

  4854.                           len = state.lens[state.have - 1];

  4855.                           copy = 3 + (hold & 0x03);//BITS(2);

  4856.                           //--- DROPBITS(2) ---//

  4857.                           hold >>>= 2;

  4858.                           bits -= 2;

  4859.                           //---//

  4860.                         }

  4861.                         else if (here_val === 17) {

  4862.                           //=== NEEDBITS(here.bits + 3);

  4863.                           n = here_bits + 3;

  4864.                           while (bits < n) {

  4865.                             if (have === 0) { break inf_leave; }

  4866.                             have--;

  4867.                             hold += input[next++] << bits;

  4868.                             bits += 8;

  4869.                           }

  4870.                           //===//

  4871.                           //--- DROPBITS(here.bits) ---//

  4872.                           hold >>>= here_bits;

  4873.                           bits -= here_bits;

  4874.                           //---//

  4875.                           len = 0;

  4876.                           copy = 3 + (hold & 0x07);//BITS(3);

  4877.                           //--- DROPBITS(3) ---//

  4878.                           hold >>>= 3;

  4879.                           bits -= 3;

  4880.                           //---//

  4881.                         }

  4882.                         else {

  4883.                           //=== NEEDBITS(here.bits + 7);

  4884.                           n = here_bits + 7;

  4885.                           while (bits < n) {

  4886.                             if (have === 0) { break inf_leave; }

  4887.                             have--;

  4888.                             hold += input[next++] << bits;

  4889.                             bits += 8;

  4890.                           }

  4891.                           //===//

  4892.                           //--- DROPBITS(here.bits) ---//

  4893.                           hold >>>= here_bits;

  4894.                           bits -= here_bits;

  4895.                           //---//

  4896.                           len = 0;

  4897.                           copy = 11 + (hold & 0x7f);//BITS(7);

  4898.                           //--- DROPBITS(7) ---//

  4899.                           hold >>>= 7;

  4900.                           bits -= 7;

  4901.                           //---//

  4902.                         }

  4903.                         if (state.have + copy > state.nlen + state.ndist) {

  4904.                           strm.msg = 'invalid bit length repeat';

  4905.                           state.mode = BAD;

  4906.                           break;

  4907.                         }

  4908.                         while (copy--) {

  4909.                           state.lens[state.have++] = len;

  4910.                         }

  4911.                       }

  4912.                     }

  4913.             

  4914.                     /* handle error breaks in while */

  4915.                     if (state.mode === BAD) { break; }

  4916.             

  4917.                     /* check for end-of-block code (better have one) */

  4918.                     if (state.lens[256] === 0) {

  4919.                       strm.msg = 'invalid code -- missing end-of-block';

  4920.                       state.mode = BAD;

  4921.                       break;

  4922.                     }

  4923.             

  4924.                     /* build code tables -- note: do not change the lenbits or distbits

  4925.                        values here (9 and 6) without reading the comments in inftrees.h

  4926.                        concerning the ENOUGH constants, which depend on those values */

  4927.                     state.lenbits = 9;

  4928.             

  4929.                     opts = { bits: state.lenbits };

  4930.                     ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);

  4931.                     // We have separate tables & no pointers. 2 commented lines below not needed.

  4932.                     // state.next_index = opts.table_index;

  4933.                     state.lenbits = opts.bits;

  4934.                     // state.lencode = state.next;

  4935.             

  4936.                     if (ret) {

  4937.                       strm.msg = 'invalid literal/lengths set';

  4938.                       state.mode = BAD;

  4939.                       break;

  4940.                     }

  4941.             

  4942.                     state.distbits = 6;

  4943.                     //state.distcode.copy(state.codes);

  4944.                     // Switch to use dynamic table

  4945.                     state.distcode = state.distdyn;

  4946.                     opts = { bits: state.distbits };

  4947.                     ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);

  4948.                     // We have separate tables & no pointers. 2 commented lines below not needed.

  4949.                     // state.next_index = opts.table_index;

  4950.                     state.distbits = opts.bits;

  4951.                     // state.distcode = state.next;

  4952.             

  4953.                     if (ret) {

  4954.                       strm.msg = 'invalid distances set';

  4955.                       state.mode = BAD;

  4956.                       break;

  4957.                     }

  4958.                     //Tracev((stderr, 'inflate:       codes ok\n'));

  4959.                     state.mode = LEN_;

  4960.                     if (flush === Z_TREES) { break inf_leave; }

  4961.                     /* falls through */

  4962.                   case LEN_:

  4963.                     state.mode = LEN;

  4964.                     /* falls through */

  4965.                   case LEN:

  4966.                     if (have >= 6 && left >= 258) {

  4967.                       //--- RESTORE() ---

  4968.                       strm.next_out = put;

  4969.                       strm.avail_out = left;

  4970.                       strm.next_in = next;

  4971.                       strm.avail_in = have;

  4972.                       state.hold = hold;

  4973.                       state.bits = bits;

  4974.                       //---

  4975.                       inflate_fast(strm, _out);

  4976.                       //--- LOAD() ---

  4977.                       put = strm.next_out;

  4978.                       output = strm.output;

  4979.                       left = strm.avail_out;

  4980.                       next = strm.next_in;

  4981.                       input = strm.input;

  4982.                       have = strm.avail_in;

  4983.                       hold = state.hold;

  4984.                       bits = state.bits;

  4985.                       //---

  4986.             

  4987.                       if (state.mode === TYPE) {

  4988.                         state.back = -1;

  4989.                       }

  4990.                       break;

  4991.                     }

  4992.                     state.back = 0;

  4993.                     for (;;) {

  4994.                       here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/

  4995.                       here_bits = here >>> 24;

  4996.                       here_op = (here >>> 16) & 0xff;

  4997.                       here_val = here & 0xffff;

  4998.             

  4999.                       if (here_bits <= bits) { break; }

  5000.                       //--- PULLBYTE() ---//

  5001.                       if (have === 0) { break inf_leave; }

  5002.                       have--;

  5003.                       hold += input[next++] << bits;

  5004.                       bits += 8;

  5005.                       //---//

  5006.                     }

  5007.                     if (here_op && (here_op & 0xf0) === 0) {

  5008.                       last_bits = here_bits;

  5009.                       last_op = here_op;

  5010.                       last_val = here_val;

  5011.                       for (;;) {

  5012.                         here = state.lencode[last_val +

  5013.                                 ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];

  5014.                         here_bits = here >>> 24;

  5015.                         here_op = (here >>> 16) & 0xff;

  5016.                         here_val = here & 0xffff;

  5017.             

  5018.                         if ((last_bits + here_bits) <= bits) { break; }

  5019.                         //--- PULLBYTE() ---//

  5020.                         if (have === 0) { break inf_leave; }

  5021.                         have--;

  5022.                         hold += input[next++] << bits;

  5023.                         bits += 8;

  5024.                         //---//

  5025.                       }

  5026.                       //--- DROPBITS(last.bits) ---//

  5027.                       hold >>>= last_bits;

  5028.                       bits -= last_bits;

  5029.                       //---//

  5030.                       state.back += last_bits;

  5031.                     }

  5032.                     //--- DROPBITS(here.bits) ---//

  5033.                     hold >>>= here_bits;

  5034.                     bits -= here_bits;

  5035.                     //---//

  5036.                     state.back += here_bits;

  5037.                     state.length = here_val;

  5038.                     if (here_op === 0) {

  5039.                       //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?

  5040.                       //        "inflate:         literal '%c'\n" :

  5041.                       //        "inflate:         literal 0x%02x\n", here.val));

  5042.                       state.mode = LIT;

  5043.                       break;

  5044.                     }

  5045.                     if (here_op & 32) {

  5046.                       //Tracevv((stderr, "inflate:         end of block\n"));

  5047.                       state.back = -1;

  5048.                       state.mode = TYPE;

  5049.                       break;

  5050.                     }

  5051.                     if (here_op & 64) {

  5052.                       strm.msg = 'invalid literal/length code';

  5053.                       state.mode = BAD;

  5054.                       break;

  5055.                     }

  5056.                     state.extra = here_op & 15;

  5057.                     state.mode = LENEXT;

  5058.                     /* falls through */

  5059.                   case LENEXT:

  5060.                     if (state.extra) {

  5061.                       //=== NEEDBITS(state.extra);

  5062.                       n = state.extra;

  5063.                       while (bits < n) {

  5064.                         if (have === 0) { break inf_leave; }

  5065.                         have--;

  5066.                         hold += input[next++] << bits;

  5067.                         bits += 8;

  5068.                       }

  5069.                       //===//

  5070.                       state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;

  5071.                       //--- DROPBITS(state.extra) ---//

  5072.                       hold >>>= state.extra;

  5073.                       bits -= state.extra;

  5074.                       //---//

  5075.                       state.back += state.extra;

  5076.                     }

  5077.                     //Tracevv((stderr, "inflate:         length %u\n", state.length));

  5078.                     state.was = state.length;

  5079.                     state.mode = DIST;

  5080.                     /* falls through */

  5081.                   case DIST:

  5082.                     for (;;) {

  5083.                       here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/

  5084.                       here_bits = here >>> 24;

  5085.                       here_op = (here >>> 16) & 0xff;

  5086.                       here_val = here & 0xffff;

  5087.             

  5088.                       if ((here_bits) <= bits) { break; }

  5089.                       //--- PULLBYTE() ---//

  5090.                       if (have === 0) { break inf_leave; }

  5091.                       have--;

  5092.                       hold += input[next++] << bits;

  5093.                       bits += 8;

  5094.                       //---//

  5095.                     }

  5096.                     if ((here_op & 0xf0) === 0) {

  5097.                       last_bits = here_bits;

  5098.                       last_op = here_op;

  5099.                       last_val = here_val;

  5100.                       for (;;) {

  5101.                         here = state.distcode[last_val +

  5102.                                 ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];

  5103.                         here_bits = here >>> 24;

  5104.                         here_op = (here >>> 16) & 0xff;

  5105.                         here_val = here & 0xffff;

  5106.             

  5107.                         if ((last_bits + here_bits) <= bits) { break; }

  5108.                         //--- PULLBYTE() ---//

  5109.                         if (have === 0) { break inf_leave; }

  5110.                         have--;

  5111.                         hold += input[next++] << bits;

  5112.                         bits += 8;

  5113.                         //---//

  5114.                       }

  5115.                       //--- DROPBITS(last.bits) ---//

  5116.                       hold >>>= last_bits;

  5117.                       bits -= last_bits;

  5118.                       //---//

  5119.                       state.back += last_bits;

  5120.                     }

  5121.                     //--- DROPBITS(here.bits) ---//

  5122.                     hold >>>= here_bits;

  5123.                     bits -= here_bits;

  5124.                     //---//

  5125.                     state.back += here_bits;

  5126.                     if (here_op & 64) {

  5127.                       strm.msg = 'invalid distance code';

  5128.                       state.mode = BAD;

  5129.                       break;

  5130.                     }

  5131.                     state.offset = here_val;

  5132.                     state.extra = (here_op) & 15;

  5133.                     state.mode = DISTEXT;

  5134.                     /* falls through */

  5135.                   case DISTEXT:

  5136.                     if (state.extra) {

  5137.                       //=== NEEDBITS(state.extra);

  5138.                       n = state.extra;

  5139.                       while (bits < n) {

  5140.                         if (have === 0) { break inf_leave; }

  5141.                         have--;

  5142.                         hold += input[next++] << bits;

  5143.                         bits += 8;

  5144.                       }

  5145.                       //===//

  5146.                       state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;

  5147.                       //--- DROPBITS(state.extra) ---//

  5148.                       hold >>>= state.extra;

  5149.                       bits -= state.extra;

  5150.                       //---//

  5151.                       state.back += state.extra;

  5152.                     }

  5153.             //#ifdef INFLATE_STRICT

  5154.                     if (state.offset > state.dmax) {

  5155.                       strm.msg = 'invalid distance too far back';

  5156.                       state.mode = BAD;

  5157.                       break;

  5158.                     }

  5159.             //#endif

  5160.                     //Tracevv((stderr, "inflate:         distance %u\n", state.offset));

  5161.                     state.mode = MATCH;

  5162.                     /* falls through */

  5163.                   case MATCH:

  5164.                     if (left === 0) { break inf_leave; }

  5165.                     copy = _out - left;

  5166.                     if (state.offset > copy) {         /* copy from window */

  5167.                       copy = state.offset - copy;

  5168.                       if (copy > state.whave) {

  5169.                         if (state.sane) {

  5170.                           strm.msg = 'invalid distance too far back';

  5171.                           state.mode = BAD;

  5172.                           break;

  5173.                         }

  5174.             // (!) This block is disabled in zlib defaults,

  5175.             // don't enable it for binary compatibility

  5176.             //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR

  5177.             //          Trace((stderr, "inflate.c too far\n"));

  5178.             //          copy -= state.whave;

  5179.             //          if (copy > state.length) { copy = state.length; }

  5180.             //          if (copy > left) { copy = left; }

  5181.             //          left -= copy;

  5182.             //          state.length -= copy;

  5183.             //          do {

  5184.             //            output[put++] = 0;

  5185.             //          } while (--copy);

  5186.             //          if (state.length === 0) { state.mode = LEN; }

  5187.             //          break;

  5188.             //#endif

  5189.                       }

  5190.                       if (copy > state.wnext) {

  5191.                         copy -= state.wnext;

  5192.                         from = state.wsize - copy;

  5193.                       }

  5194.                       else {

  5195.                         from = state.wnext - copy;

  5196.                       }

  5197.                       if (copy > state.length) { copy = state.length; }

  5198.                       from_source = state.window;

  5199.                     }

  5200.                     else {                              /* copy from output */

  5201.                       from_source = output;

  5202.                       from = put - state.offset;

  5203.                       copy = state.length;

  5204.                     }

  5205.                     if (copy > left) { copy = left; }

  5206.                     left -= copy;

  5207.                     state.length -= copy;

  5208.                     do {

  5209.                       output[put++] = from_source[from++];

  5210.                     } while (--copy);

  5211.                     if (state.length === 0) { state.mode = LEN; }

  5212.                     break;

  5213.                   case LIT:

  5214.                     if (left === 0) { break inf_leave; }

  5215.                     output[put++] = state.length;

  5216.                     left--;

  5217.                     state.mode = LEN;

  5218.                     break;

  5219.                   case CHECK:

  5220.                     if (state.wrap) {

  5221.                       //=== NEEDBITS(32);

  5222.                       while (bits < 32) {

  5223.                         if (have === 0) { break inf_leave; }

  5224.                         have--;

  5225.                         // Use '|' instead of '+' to make sure that result is signed

  5226.                         hold |= input[next++] << bits;

  5227.                         bits += 8;

  5228.                       }

  5229.                       //===//

  5230.                       _out -= left;

  5231.                       strm.total_out += _out;

  5232.                       state.total += _out;

  5233.                       if (_out) {

  5234.                         strm.adler = state.check =

  5235.                             /*UPDATE(state.check, put - _out, _out);*/

  5236.                             (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));

  5237.             

  5238.                       }

  5239.                       _out = left;

  5240.                       // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too

  5241.                       if ((state.flags ? hold : zswap32(hold)) !== state.check) {

  5242.                         strm.msg = 'incorrect data check';

  5243.                         state.mode = BAD;

  5244.                         break;

  5245.                       }

  5246.                       //=== INITBITS();

  5247.                       hold = 0;

  5248.                       bits = 0;

  5249.                       //===//

  5250.                       //Tracev((stderr, "inflate:   check matches trailer\n"));

  5251.                     }

  5252.                     state.mode = LENGTH;

  5253.                     /* falls through */

  5254.                   case LENGTH:

  5255.                     if (state.wrap && state.flags) {

  5256.                       //=== NEEDBITS(32);

  5257.                       while (bits < 32) {

  5258.                         if (have === 0) { break inf_leave; }

  5259.                         have--;

  5260.                         hold += input[next++] << bits;

  5261.                         bits += 8;

  5262.                       }

  5263.                       //===//

  5264.                       if (hold !== (state.total & 0xffffffff)) {

  5265.                         strm.msg = 'incorrect length check';

  5266.                         state.mode = BAD;

  5267.                         break;

  5268.                       }

  5269.                       //=== INITBITS();

  5270.                       hold = 0;

  5271.                       bits = 0;

  5272.                       //===//

  5273.                       //Tracev((stderr, "inflate:   length matches trailer\n"));

  5274.                     }

  5275.                     state.mode = DONE;

  5276.                     /* falls through */

  5277.                   case DONE:

  5278.                     ret = Z_STREAM_END;

  5279.                     break inf_leave;

  5280.                   case BAD:

  5281.                     ret = Z_DATA_ERROR;

  5282.                     break inf_leave;

  5283.                   case MEM:

  5284.                     return Z_MEM_ERROR;

  5285.                   case SYNC:

  5286.                     /* falls through */

  5287.                   default:

  5288.                     return Z_STREAM_ERROR;

  5289.                 }

  5290.               }

  5291.             

  5292.               // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave"

  5293.             

  5294.               /*

  5295.                  Return from inflate(), updating the total counts and the check value.

  5296.                  If there was no progress during the inflate() call, return a buffer

  5297.                  error.  Call updatewindow() to create and/or update the window state.

  5298.                  Note: a memory error from inflate() is non-recoverable.

  5299.                */

  5300.             

  5301.               //--- RESTORE() ---

  5302.               strm.next_out = put;

  5303.               strm.avail_out = left;

  5304.               strm.next_in = next;

  5305.               strm.avail_in = have;

  5306.               state.hold = hold;

  5307.               state.bits = bits;

  5308.               //---

  5309.             

  5310.               if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&

  5311.                                   (state.mode < CHECK || flush !== Z_FINISH))) {

  5312.                 if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {

  5313.                   state.mode = MEM;

  5314.                   return Z_MEM_ERROR;

  5315.                 }

  5316.               }

  5317.               _in -= strm.avail_in;

  5318.               _out -= strm.avail_out;

  5319.               strm.total_in += _in;

  5320.               strm.total_out += _out;

  5321.               state.total += _out;

  5322.               if (state.wrap && _out) {

  5323.                 strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/

  5324.                   (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));

  5325.               }

  5326.               strm.data_type = state.bits + (state.last ? 64 : 0) +

  5327.                                 (state.mode === TYPE ? 128 : 0) +

  5328.                                 (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);

  5329.               if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {

  5330.                 ret = Z_BUF_ERROR;

  5331.               }

  5332.               return ret;

  5333.             }

  5334.             

  5335.             function inflateEnd(strm) {

  5336.             

  5337.               if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {

  5338.                 return Z_STREAM_ERROR;

  5339.               }

  5340.             

  5341.               var state = strm.state;

  5342.               if (state.window) {

  5343.                 state.window = null;

  5344.               }

  5345.               strm.state = null;

  5346.               return Z_OK;

  5347.             }

  5348.             

  5349.             function inflateGetHeader(strm, head) {

  5350.               var state;

  5351.             

  5352.               /* check state */

  5353.               if (!strm || !strm.state) { return Z_STREAM_ERROR; }

  5354.               state = strm.state;

  5355.               if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }

  5356.             

  5357.               /* save header structure */

  5358.               state.head = head;

  5359.               head.done = false;

  5360.               return Z_OK;

  5361.             }

  5362.             

  5363.             function inflateSetDictionary(strm, dictionary) {

  5364.               var dictLength = dictionary.length;

  5365.             

  5366.               var state;

  5367.               var dictid;

  5368.               var ret;

  5369.             

  5370.               /* check state */

  5371.               if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }

  5372.               state = strm.state;

  5373.             

  5374.               if (state.wrap !== 0 && state.mode !== DICT) {

  5375.                 return Z_STREAM_ERROR;

  5376.               }

  5377.             

  5378.               /* check for correct dictionary identifier */

  5379.               if (state.mode === DICT) {

  5380.                 dictid = 1; /* adler32(0, null, 0)*/

  5381.                 /* dictid = adler32(dictid, dictionary, dictLength); */

  5382.                 dictid = adler32(dictid, dictionary, dictLength, 0);

  5383.                 if (dictid !== state.check) {

  5384.                   return Z_DATA_ERROR;

  5385.                 }

  5386.               }

  5387.               /* copy dictionary to window using updatewindow(), which will amend the

  5388.                existing dictionary if appropriate */

  5389.               ret = updatewindow(strm, dictionary, dictLength, dictLength);

  5390.               if (ret) {

  5391.                 state.mode = MEM;

  5392.                 return Z_MEM_ERROR;

  5393.               }

  5394.               state.havedict = 1;

  5395.               // Tracev((stderr, "inflate:   dictionary set\n"));

  5396.               return Z_OK;

  5397.             }

  5398.             

  5399.             exports.inflateReset = inflateReset;

  5400.             exports.inflateReset2 = inflateReset2;

  5401.             exports.inflateResetKeep = inflateResetKeep;

  5402.             exports.inflateInit = inflateInit;

  5403.             exports.inflateInit2 = inflateInit2;

  5404.             exports.inflate = inflate;

  5405.             exports.inflateEnd = inflateEnd;

  5406.             exports.inflateGetHeader = inflateGetHeader;

  5407.             exports.inflateSetDictionary = inflateSetDictionary;

  5408.             exports.inflateInfo = 'pako inflate (from Nodeca project)';

  5409.             

  5410.             /* Not implemented

  5411.             exports.inflateCopy = inflateCopy;

  5412.             exports.inflateGetDictionary = inflateGetDictionary;

  5413.             exports.inflateMark = inflateMark;

  5414.             exports.inflatePrime = inflatePrime;

  5415.             exports.inflateSync = inflateSync;

  5416.             exports.inflateSyncPoint = inflateSyncPoint;

  5417.             exports.inflateUndermine = inflateUndermine;

  5418.             */

  5419.             

  5420.             },{"../utils/common":3,"./adler32":5,"./crc32":7,"./inffast":10,"./inftrees":12}],12:[function(require,module,exports){

  5421.             'use strict';

  5422.             

  5423.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  5424.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  5425.             //

  5426.             // This software is provided 'as-is', without any express or implied

  5427.             // warranty. In no event will the authors be held liable for any damages

  5428.             // arising from the use of this software.

  5429.             //

  5430.             // Permission is granted to anyone to use this software for any purpose,

  5431.             // including commercial applications, and to alter it and redistribute it

  5432.             // freely, subject to the following restrictions:

  5433.             //

  5434.             // 1. The origin of this software must not be misrepresented; you must not

  5435.             //   claim that you wrote the original software. If you use this software

  5436.             //   in a product, an acknowledgment in the product documentation would be

  5437.             //   appreciated but is not required.

  5438.             // 2. Altered source versions must be plainly marked as such, and must not be

  5439.             //   misrepresented as being the original software.

  5440.             // 3. This notice may not be removed or altered from any source distribution.

  5441.             

  5442.             var utils = require('../utils/common');

  5443.             

  5444.             var MAXBITS = 15;

  5445.             var ENOUGH_LENS = 852;

  5446.             var ENOUGH_DISTS = 592;

  5447.             //var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);

  5448.             

  5449.             var CODES = 0;

  5450.             var LENS = 1;

  5451.             var DISTS = 2;

  5452.             

  5453.             var lbase = [ /* Length codes 257..285 base */

  5454.               3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,

  5455.               35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0

  5456.             ];

  5457.             

  5458.             var lext = [ /* Length codes 257..285 extra */

  5459.               16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,

  5460.               19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78

  5461.             ];

  5462.             

  5463.             var dbase = [ /* Distance codes 0..29 base */

  5464.               1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,

  5465.               257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,

  5466.               8193, 12289, 16385, 24577, 0, 0

  5467.             ];

  5468.             

  5469.             var dext = [ /* Distance codes 0..29 extra */

  5470.               16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,

  5471.               23, 23, 24, 24, 25, 25, 26, 26, 27, 27,

  5472.               28, 28, 29, 29, 64, 64

  5473.             ];

  5474.             

  5475.             module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)

  5476.             {

  5477.               var bits = opts.bits;

  5478.                   //here = opts.here; /* table entry for duplication */

  5479.             

  5480.               var len = 0;               /* a code's length in bits */

  5481.               var sym = 0;               /* index of code symbols */

  5482.               var min = 0, max = 0;          /* minimum and maximum code lengths */

  5483.               var root = 0;              /* number of index bits for root table */

  5484.               var curr = 0;              /* number of index bits for current table */

  5485.               var drop = 0;              /* code bits to drop for sub-table */

  5486.               var left = 0;                   /* number of prefix codes available */

  5487.               var used = 0;              /* code entries in table used */

  5488.               var huff = 0;              /* Huffman code */

  5489.               var incr;              /* for incrementing code, index */

  5490.               var fill;              /* index for replicating entries */

  5491.               var low;               /* low bits for current root entry */

  5492.               var mask;              /* mask for low root bits */

  5493.               var next;             /* next available space in table */

  5494.               var base = null;     /* base value table to use */

  5495.               var base_index = 0;

  5496.             //  var shoextra;    /* extra bits table to use */

  5497.               var end;                    /* use base and extra for symbol > end */

  5498.               var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */

  5499.               var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */

  5500.               var extra = null;

  5501.               var extra_index = 0;

  5502.             

  5503.               var here_bits, here_op, here_val;

  5504.             

  5505.               /*

  5506.                Process a set of code lengths to create a canonical Huffman code.  The

  5507.                code lengths are lens[0..codes-1].  Each length corresponds to the

  5508.                symbols 0..codes-1.  The Huffman code is generated by first sorting the

  5509.                symbols by length from short to long, and retaining the symbol order

  5510.                for codes with equal lengths.  Then the code starts with all zero bits

  5511.                for the first code of the shortest length, and the codes are integer

  5512.                increments for the same length, and zeros are appended as the length

  5513.                increases.  For the deflate format, these bits are stored backwards

  5514.                from their more natural integer increment ordering, and so when the

  5515.                decoding tables are built in the large loop below, the integer codes

  5516.                are incremented backwards.

  5517.             

  5518.                This routine assumes, but does not check, that all of the entries in

  5519.                lens[] are in the range 0..MAXBITS.  The caller must assure this.

  5520.                1..MAXBITS is interpreted as that code length.  zero means that that

  5521.                symbol does not occur in this code.

  5522.             

  5523.                The codes are sorted by computing a count of codes for each length,

  5524.                creating from that a table of starting indices for each length in the

  5525.                sorted table, and then entering the symbols in order in the sorted

  5526.                table.  The sorted table is work[], with that space being provided by

  5527.                the caller.

  5528.             

  5529.                The length counts are used for other purposes as well, i.e. finding

  5530.                the minimum and maximum length codes, determining if there are any

  5531.                codes at all, checking for a valid set of lengths, and looking ahead

  5532.                at length counts to determine sub-table sizes when building the

  5533.                decoding tables.

  5534.                */

  5535.             

  5536.               /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */

  5537.               for (len = 0; len <= MAXBITS; len++) {

  5538.                 count[len] = 0;

  5539.               }

  5540.               for (sym = 0; sym < codes; sym++) {

  5541.                 count[lens[lens_index + sym]]++;

  5542.               }

  5543.             

  5544.               /* bound code lengths, force root to be within code lengths */

  5545.               root = bits;

  5546.               for (max = MAXBITS; max >= 1; max--) {

  5547.                 if (count[max] !== 0) { break; }

  5548.               }

  5549.               if (root > max) {

  5550.                 root = max;

  5551.               }

  5552.               if (max === 0) {                     /* no symbols to code at all */

  5553.                 //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */

  5554.                 //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;

  5555.                 //table.val[opts.table_index++] = 0;   //here.val = (var short)0;

  5556.                 table[table_index++] = (1 << 24) | (64 << 16) | 0;

  5557.             

  5558.             

  5559.                 //table.op[opts.table_index] = 64;

  5560.                 //table.bits[opts.table_index] = 1;

  5561.                 //table.val[opts.table_index++] = 0;

  5562.                 table[table_index++] = (1 << 24) | (64 << 16) | 0;

  5563.             

  5564.                 opts.bits = 1;

  5565.                 return 0;     /* no symbols, but wait for decoding to report error */

  5566.               }

  5567.               for (min = 1; min < max; min++) {

  5568.                 if (count[min] !== 0) { break; }

  5569.               }

  5570.               if (root < min) {

  5571.                 root = min;

  5572.               }

  5573.             

  5574.               /* check for an over-subscribed or incomplete set of lengths */

  5575.               left = 1;

  5576.               for (len = 1; len <= MAXBITS; len++) {

  5577.                 left <<= 1;

  5578.                 left -= count[len];

  5579.                 if (left < 0) {

  5580.                   return -1;

  5581.                 }        /* over-subscribed */

  5582.               }

  5583.               if (left > 0 && (type === CODES || max !== 1)) {

  5584.                 return -1;                      /* incomplete set */

  5585.               }

  5586.             

  5587.               /* generate offsets into symbol table for each length for sorting */

  5588.               offs[1] = 0;

  5589.               for (len = 1; len < MAXBITS; len++) {

  5590.                 offs[len + 1] = offs[len] + count[len];

  5591.               }

  5592.             

  5593.               /* sort symbols by length, by symbol order within each length */

  5594.               for (sym = 0; sym < codes; sym++) {

  5595.                 if (lens[lens_index + sym] !== 0) {

  5596.                   work[offs[lens[lens_index + sym]]++] = sym;

  5597.                 }

  5598.               }

  5599.             

  5600.               /*

  5601.                Create and fill in decoding tables.  In this loop, the table being

  5602.                filled is at next and has curr index bits.  The code being used is huff

  5603.                with length len.  That code is converted to an index by dropping drop

  5604.                bits off of the bottom.  For codes where len is less than drop + curr,

  5605.                those top drop + curr - len bits are incremented through all values to

  5606.                fill the table with replicated entries.

  5607.             

  5608.                root is the number of index bits for the root table.  When len exceeds

  5609.                root, sub-tables are created pointed to by the root entry with an index

  5610.                of the low root bits of huff.  This is saved in low to check for when a

  5611.                new sub-table should be started.  drop is zero when the root table is

  5612.                being filled, and drop is root when sub-tables are being filled.

  5613.             

  5614.                When a new sub-table is needed, it is necessary to look ahead in the

  5615.                code lengths to determine what size sub-table is needed.  The length

  5616.                counts are used for this, and so count[] is decremented as codes are

  5617.                entered in the tables.

  5618.             

  5619.                used keeps track of how many table entries have been allocated from the

  5620.                provided *table space.  It is checked for LENS and DIST tables against

  5621.                the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in

  5622.                the initial root table size constants.  See the comments in inftrees.h

  5623.                for more information.

  5624.             

  5625.                sym increments through all symbols, and the loop terminates when

  5626.                all codes of length max, i.e. all codes, have been processed.  This

  5627.                routine permits incomplete codes, so another loop after this one fills

  5628.                in the rest of the decoding tables with invalid code markers.

  5629.                */

  5630.             

  5631.               /* set up for code type */

  5632.               // poor man optimization - use if-else instead of switch,

  5633.               // to avoid deopts in old v8

  5634.               if (type === CODES) {

  5635.                 base = extra = work;    /* dummy value--not used */

  5636.                 end = 19;

  5637.             

  5638.               } else if (type === LENS) {

  5639.                 base = lbase;

  5640.                 base_index -= 257;

  5641.                 extra = lext;

  5642.                 extra_index -= 257;

  5643.                 end = 256;

  5644.             

  5645.               } else {                    /* DISTS */

  5646.                 base = dbase;

  5647.                 extra = dext;

  5648.                 end = -1;

  5649.               }

  5650.             

  5651.               /* initialize opts for loop */

  5652.               huff = 0;                   /* starting code */

  5653.               sym = 0;                    /* starting code symbol */

  5654.               len = min;                  /* starting code length */

  5655.               next = table_index;              /* current table to fill in */

  5656.               curr = root;                /* current table index bits */

  5657.               drop = 0;                   /* current bits to drop from code for index */

  5658.               low = -1;                   /* trigger new sub-table when len > root */

  5659.               used = 1 << root;          /* use root table entries */

  5660.               mask = used - 1;            /* mask for comparing low */

  5661.             

  5662.               /* check available table space */

  5663.               if ((type === LENS && used > ENOUGH_LENS) ||

  5664.                 (type === DISTS && used > ENOUGH_DISTS)) {

  5665.                 return 1;

  5666.               }

  5667.             

  5668.               /* process all codes and make table entries */

  5669.               for (;;) {

  5670.                 /* create table entry */

  5671.                 here_bits = len - drop;

  5672.                 if (work[sym] < end) {

  5673.                   here_op = 0;

  5674.                   here_val = work[sym];

  5675.                 }

  5676.                 else if (work[sym] > end) {

  5677.                   here_op = extra[extra_index + work[sym]];

  5678.                   here_val = base[base_index + work[sym]];

  5679.                 }

  5680.                 else {

  5681.                   here_op = 32 + 64;         /* end of block */

  5682.                   here_val = 0;

  5683.                 }

  5684.             

  5685.                 /* replicate for those indices with low len bits equal to huff */

  5686.                 incr = 1 << (len - drop);

  5687.                 fill = 1 << curr;

  5688.                 min = fill;                 /* save offset to next table */

  5689.                 do {

  5690.                   fill -= incr;

  5691.                   table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;

  5692.                 } while (fill !== 0);

  5693.             

  5694.                 /* backwards increment the len-bit code huff */

  5695.                 incr = 1 << (len - 1);

  5696.                 while (huff & incr) {

  5697.                   incr >>= 1;

  5698.                 }

  5699.                 if (incr !== 0) {

  5700.                   huff &= incr - 1;

  5701.                   huff += incr;

  5702.                 } else {

  5703.                   huff = 0;

  5704.                 }

  5705.             

  5706.                 /* go to next symbol, update count, len */

  5707.                 sym++;

  5708.                 if (--count[len] === 0) {

  5709.                   if (len === max) { break; }

  5710.                   len = lens[lens_index + work[sym]];

  5711.                 }

  5712.             

  5713.                 /* create new sub-table if needed */

  5714.                 if (len > root && (huff & mask) !== low) {

  5715.                   /* if first time, transition to sub-tables */

  5716.                   if (drop === 0) {

  5717.                     drop = root;

  5718.                   }

  5719.             

  5720.                   /* increment past last table */

  5721.                   next += min;            /* here min is 1 << curr */

  5722.             

  5723.                   /* determine length of next table */

  5724.                   curr = len - drop;

  5725.                   left = 1 << curr;

  5726.                   while (curr + drop < max) {

  5727.                     left -= count[curr + drop];

  5728.                     if (left <= 0) { break; }

  5729.                     curr++;

  5730.                     left <<= 1;

  5731.                   }

  5732.             

  5733.                   /* check for enough space */

  5734.                   used += 1 << curr;

  5735.                   if ((type === LENS && used > ENOUGH_LENS) ||

  5736.                     (type === DISTS && used > ENOUGH_DISTS)) {

  5737.                     return 1;

  5738.                   }

  5739.             

  5740.                   /* point entry in root table to sub-table */

  5741.                   low = huff & mask;

  5742.                   /*table.op[low] = curr;

  5743.                   table.bits[low] = root;

  5744.                   table.val[low] = next - opts.table_index;*/

  5745.                   table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;

  5746.                 }

  5747.               }

  5748.             

  5749.               /* fill in remaining table entry if code is incomplete (guaranteed to have

  5750.                at most one remaining entry, since if the code is incomplete, the

  5751.                maximum code length that was allowed to get this far is one bit) */

  5752.               if (huff !== 0) {

  5753.                 //table.op[next + huff] = 64;            /* invalid code marker */

  5754.                 //table.bits[next + huff] = len - drop;

  5755.                 //table.val[next + huff] = 0;

  5756.                 table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;

  5757.               }

  5758.             

  5759.               /* set return parameters */

  5760.               //opts.table_index += used;

  5761.               opts.bits = root;

  5762.               return 0;

  5763.             };

  5764.             

  5765.             },{"../utils/common":3}],13:[function(require,module,exports){

  5766.             'use strict';

  5767.             

  5768.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  5769.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  5770.             //

  5771.             // This software is provided 'as-is', without any express or implied

  5772.             // warranty. In no event will the authors be held liable for any damages

  5773.             // arising from the use of this software.

  5774.             //

  5775.             // Permission is granted to anyone to use this software for any purpose,

  5776.             // including commercial applications, and to alter it and redistribute it

  5777.             // freely, subject to the following restrictions:

  5778.             //

  5779.             // 1. The origin of this software must not be misrepresented; you must not

  5780.             //   claim that you wrote the original software. If you use this software

  5781.             //   in a product, an acknowledgment in the product documentation would be

  5782.             //   appreciated but is not required.

  5783.             // 2. Altered source versions must be plainly marked as such, and must not be

  5784.             //   misrepresented as being the original software.

  5785.             // 3. This notice may not be removed or altered from any source distribution.

  5786.             

  5787.             module.exports = {

  5788.               2:      'need dictionary',     /* Z_NEED_DICT       2  */

  5789.               1:      'stream end',          /* Z_STREAM_END      1  */

  5790.               0:      '',                    /* Z_OK              0  */

  5791.               '-1':   'file error',          /* Z_ERRNO         (-1) */

  5792.               '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */

  5793.               '-3':   'data error',          /* Z_DATA_ERROR    (-3) */

  5794.               '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */

  5795.               '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */

  5796.               '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */

  5797.             };

  5798.             

  5799.             },{}],14:[function(require,module,exports){

  5800.             'use strict';

  5801.             

  5802.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  5803.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  5804.             //

  5805.             // This software is provided 'as-is', without any express or implied

  5806.             // warranty. In no event will the authors be held liable for any damages

  5807.             // arising from the use of this software.

  5808.             //

  5809.             // Permission is granted to anyone to use this software for any purpose,

  5810.             // including commercial applications, and to alter it and redistribute it

  5811.             // freely, subject to the following restrictions:

  5812.             //

  5813.             // 1. The origin of this software must not be misrepresented; you must not

  5814.             //   claim that you wrote the original software. If you use this software

  5815.             //   in a product, an acknowledgment in the product documentation would be

  5816.             //   appreciated but is not required.

  5817.             // 2. Altered source versions must be plainly marked as such, and must not be

  5818.             //   misrepresented as being the original software.

  5819.             // 3. This notice may not be removed or altered from any source distribution.

  5820.             

  5821.             /* eslint-disable space-unary-ops */

  5822.             

  5823.             var utils = require('../utils/common');

  5824.             

  5825.             /* Public constants ==========================================================*/

  5826.             /* ===========================================================================*/

  5827.             

  5828.             

  5829.             //var Z_FILTERED          = 1;

  5830.             //var Z_HUFFMAN_ONLY      = 2;

  5831.             //var Z_RLE               = 3;

  5832.             var Z_FIXED               = 4;

  5833.             //var Z_DEFAULT_STRATEGY  = 0;

  5834.             

  5835.             /* Possible values of the data_type field (though see inflate()) */

  5836.             var Z_BINARY              = 0;

  5837.             var Z_TEXT                = 1;

  5838.             //var Z_ASCII             = 1; // = Z_TEXT

  5839.             var Z_UNKNOWN             = 2;

  5840.             

  5841.             /*============================================================================*/

  5842.             

  5843.             

  5844.             function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }

  5845.             

  5846.             // From zutil.h

  5847.             

  5848.             var STORED_BLOCK = 0;

  5849.             var STATIC_TREES = 1;

  5850.             var DYN_TREES    = 2;

  5851.             /* The three kinds of block type */

  5852.             

  5853.             var MIN_MATCH    = 3;

  5854.             var MAX_MATCH    = 258;

  5855.             /* The minimum and maximum match lengths */

  5856.             

  5857.             // From deflate.h

  5858.             /* ===========================================================================

  5859.              * Internal compression state.

  5860.              */

  5861.             

  5862.             var LENGTH_CODES  = 29;

  5863.             /* number of length codes, not counting the special END_BLOCK code */

  5864.             

  5865.             var LITERALS      = 256;

  5866.             /* number of literal bytes 0..255 */

  5867.             

  5868.             var L_CODES       = LITERALS + 1 + LENGTH_CODES;

  5869.             /* number of Literal or Length codes, including the END_BLOCK code */

  5870.             

  5871.             var D_CODES       = 30;

  5872.             /* number of distance codes */

  5873.             

  5874.             var BL_CODES      = 19;

  5875.             /* number of codes used to transfer the bit lengths */

  5876.             

  5877.             var HEAP_SIZE     = 2 * L_CODES + 1;

  5878.             /* maximum heap size */

  5879.             

  5880.             var MAX_BITS      = 15;

  5881.             /* All codes must not exceed MAX_BITS bits */

  5882.             

  5883.             var Buf_size      = 16;

  5884.             /* size of bit buffer in bi_buf */

  5885.             

  5886.             

  5887.             /* ===========================================================================

  5888.              * Constants

  5889.              */

  5890.             

  5891.             var MAX_BL_BITS = 7;

  5892.             /* Bit length codes must not exceed MAX_BL_BITS bits */

  5893.             

  5894.             var END_BLOCK   = 256;

  5895.             /* end of block literal code */

  5896.             

  5897.             var REP_3_6     = 16;

  5898.             /* repeat previous bit length 3-6 times (2 bits of repeat count) */

  5899.             

  5900.             var REPZ_3_10   = 17;

  5901.             /* repeat a zero length 3-10 times  (3 bits of repeat count) */

  5902.             

  5903.             var REPZ_11_138 = 18;

  5904.             /* repeat a zero length 11-138 times  (7 bits of repeat count) */

  5905.             

  5906.             /* eslint-disable comma-spacing,array-bracket-spacing */

  5907.             var extra_lbits =   /* extra bits for each length code */

  5908.               [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];

  5909.             

  5910.             var extra_dbits =   /* extra bits for each distance code */

  5911.               [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];

  5912.             

  5913.             var extra_blbits =  /* extra bits for each bit length code */

  5914.               [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];

  5915.             

  5916.             var bl_order =

  5917.               [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];

  5918.             /* eslint-enable comma-spacing,array-bracket-spacing */

  5919.             

  5920.             /* The lengths of the bit length codes are sent in order of decreasing

  5921.              * probability, to avoid transmitting the lengths for unused bit length codes.

  5922.              */

  5923.             

  5924.             /* ===========================================================================

  5925.              * Local data. These are initialized only once.

  5926.              */

  5927.             

  5928.             // We pre-fill arrays with 0 to avoid uninitialized gaps

  5929.             

  5930.             var DIST_CODE_LEN = 512; /* see definition of array dist_code below */

  5931.             

  5932.             // !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1

  5933.             var static_ltree  = new Array((L_CODES + 2) * 2);

  5934.             zero(static_ltree);

  5935.             /* The static literal tree. Since the bit lengths are imposed, there is no

  5936.              * need for the L_CODES extra codes used during heap construction. However

  5937.              * The codes 286 and 287 are needed to build a canonical tree (see _tr_init

  5938.              * below).

  5939.              */

  5940.             

  5941.             var static_dtree  = new Array(D_CODES * 2);

  5942.             zero(static_dtree);

  5943.             /* The static distance tree. (Actually a trivial tree since all codes use

  5944.              * 5 bits.)

  5945.              */

  5946.             

  5947.             var _dist_code    = new Array(DIST_CODE_LEN);

  5948.             zero(_dist_code);

  5949.             /* Distance codes. The first 256 values correspond to the distances

  5950.              * 3 .. 258, the last 256 values correspond to the top 8 bits of

  5951.              * the 15 bit distances.

  5952.              */

  5953.             

  5954.             var _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);

  5955.             zero(_length_code);

  5956.             /* length code for each normalized match length (0 == MIN_MATCH) */

  5957.             

  5958.             var base_length   = new Array(LENGTH_CODES);

  5959.             zero(base_length);

  5960.             /* First normalized length for each code (0 = MIN_MATCH) */

  5961.             

  5962.             var base_dist     = new Array(D_CODES);

  5963.             zero(base_dist);

  5964.             /* First normalized distance for each code (0 = distance of 1) */

  5965.             

  5966.             

  5967.             function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {

  5968.             

  5969.               this.static_tree  = static_tree;  /* static tree or NULL */

  5970.               this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */

  5971.               this.extra_base   = extra_base;   /* base index for extra_bits */

  5972.               this.elems        = elems;        /* max number of elements in the tree */

  5973.               this.max_length   = max_length;   /* max bit length for the codes */

  5974.             

  5975.               // show if `static_tree` has data or dummy - needed for monomorphic objects

  5976.               this.has_stree    = static_tree && static_tree.length;

  5977.             }

  5978.             

  5979.             

  5980.             var static_l_desc;

  5981.             var static_d_desc;

  5982.             var static_bl_desc;

  5983.             

  5984.             

  5985.             function TreeDesc(dyn_tree, stat_desc) {

  5986.               this.dyn_tree = dyn_tree;     /* the dynamic tree */

  5987.               this.max_code = 0;            /* largest code with non zero frequency */

  5988.               this.stat_desc = stat_desc;   /* the corresponding static tree */

  5989.             }

  5990.             

  5991.             

  5992.             

  5993.             function d_code(dist) {

  5994.               return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];

  5995.             }

  5996.             

  5997.             

  5998.             /* ===========================================================================

  5999.              * Output a short LSB first on the stream.

  6000.              * IN assertion: there is enough room in pendingBuf.

  6001.              */

  6002.             function put_short(s, w) {

  6003.             //    put_byte(s, (uch)((w) & 0xff));

  6004.             //    put_byte(s, (uch)((ush)(w) >> 8));

  6005.               s.pending_buf[s.pending++] = (w) & 0xff;

  6006.               s.pending_buf[s.pending++] = (w >>> 8) & 0xff;

  6007.             }

  6008.             

  6009.             

  6010.             /* ===========================================================================

  6011.              * Send a value on a given number of bits.

  6012.              * IN assertion: length <= 16 and value fits in length bits.

  6013.              */

  6014.             function send_bits(s, value, length) {

  6015.               if (s.bi_valid > (Buf_size - length)) {

  6016.                 s.bi_buf |= (value << s.bi_valid) & 0xffff;

  6017.                 put_short(s, s.bi_buf);

  6018.                 s.bi_buf = value >> (Buf_size - s.bi_valid);

  6019.                 s.bi_valid += length - Buf_size;

  6020.               } else {

  6021.                 s.bi_buf |= (value << s.bi_valid) & 0xffff;

  6022.                 s.bi_valid += length;

  6023.               }

  6024.             }

  6025.             

  6026.             

  6027.             function send_code(s, c, tree) {

  6028.               send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);

  6029.             }

  6030.             

  6031.             

  6032.             /* ===========================================================================

  6033.              * Reverse the first len bits of a code, using straightforward code (a faster

  6034.              * method would use a table)

  6035.              * IN assertion: 1 <= len <= 15

  6036.              */

  6037.             function bi_reverse(code, len) {

  6038.               var res = 0;

  6039.               do {

  6040.                 res |= code & 1;

  6041.                 code >>>= 1;

  6042.                 res <<= 1;

  6043.               } while (--len > 0);

  6044.               return res >>> 1;

  6045.             }

  6046.             

  6047.             

  6048.             /* ===========================================================================

  6049.              * Flush the bit buffer, keeping at most 7 bits in it.

  6050.              */

  6051.             function bi_flush(s) {

  6052.               if (s.bi_valid === 16) {

  6053.                 put_short(s, s.bi_buf);

  6054.                 s.bi_buf = 0;

  6055.                 s.bi_valid = 0;

  6056.             

  6057.               } else if (s.bi_valid >= 8) {

  6058.                 s.pending_buf[s.pending++] = s.bi_buf & 0xff;

  6059.                 s.bi_buf >>= 8;

  6060.                 s.bi_valid -= 8;

  6061.               }

  6062.             }

  6063.             

  6064.             

  6065.             /* ===========================================================================

  6066.              * Compute the optimal bit lengths for a tree and update the total bit length

  6067.              * for the current block.

  6068.              * IN assertion: the fields freq and dad are set, heap[heap_max] and

  6069.              *    above are the tree nodes sorted by increasing frequency.

  6070.              * OUT assertions: the field len is set to the optimal bit length, the

  6071.              *     array bl_count contains the frequencies for each bit length.

  6072.              *     The length opt_len is updated; static_len is also updated if stree is

  6073.              *     not null.

  6074.              */

  6075.             function gen_bitlen(s, desc)

  6076.             //    deflate_state *s;

  6077.             //    tree_desc *desc;    /* the tree descriptor */

  6078.             {

  6079.               var tree            = desc.dyn_tree;

  6080.               var max_code        = desc.max_code;

  6081.               var stree           = desc.stat_desc.static_tree;

  6082.               var has_stree       = desc.stat_desc.has_stree;

  6083.               var extra           = desc.stat_desc.extra_bits;

  6084.               var base            = desc.stat_desc.extra_base;

  6085.               var max_length      = desc.stat_desc.max_length;

  6086.               var h;              /* heap index */

  6087.               var n, m;           /* iterate over the tree elements */

  6088.               var bits;           /* bit length */

  6089.               var xbits;          /* extra bits */

  6090.               var f;              /* frequency */

  6091.               var overflow = 0;   /* number of elements with bit length too large */

  6092.             

  6093.               for (bits = 0; bits <= MAX_BITS; bits++) {

  6094.                 s.bl_count[bits] = 0;

  6095.               }

  6096.             

  6097.               /* In a first pass, compute the optimal bit lengths (which may

  6098.                * overflow in the case of the bit length tree).

  6099.                */

  6100.               tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */

  6101.             

  6102.               for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {

  6103.                 n = s.heap[h];

  6104.                 bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;

  6105.                 if (bits > max_length) {

  6106.                   bits = max_length;

  6107.                   overflow++;

  6108.                 }

  6109.                 tree[n * 2 + 1]/*.Len*/ = bits;

  6110.                 /* We overwrite tree[n].Dad which is no longer needed */

  6111.             

  6112.                 if (n > max_code) { continue; } /* not a leaf node */

  6113.             

  6114.                 s.bl_count[bits]++;

  6115.                 xbits = 0;

  6116.                 if (n >= base) {

  6117.                   xbits = extra[n - base];

  6118.                 }

  6119.                 f = tree[n * 2]/*.Freq*/;

  6120.                 s.opt_len += f * (bits + xbits);

  6121.                 if (has_stree) {

  6122.                   s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);

  6123.                 }

  6124.               }

  6125.               if (overflow === 0) { return; }

  6126.             

  6127.               // Trace((stderr,"\nbit length overflow\n"));

  6128.               /* This happens for example on obj2 and pic of the Calgary corpus */

  6129.             

  6130.               /* Find the first bit length which could increase: */

  6131.               do {

  6132.                 bits = max_length - 1;

  6133.                 while (s.bl_count[bits] === 0) { bits--; }

  6134.                 s.bl_count[bits]--;      /* move one leaf down the tree */

  6135.                 s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */

  6136.                 s.bl_count[max_length]--;

  6137.                 /* The brother of the overflow item also moves one step up,

  6138.                  * but this does not affect bl_count[max_length]

  6139.                  */

  6140.                 overflow -= 2;

  6141.               } while (overflow > 0);

  6142.             

  6143.               /* Now recompute all bit lengths, scanning in increasing frequency.

  6144.                * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all

  6145.                * lengths instead of fixing only the wrong ones. This idea is taken

  6146.                * from 'ar' written by Haruhiko Okumura.)

  6147.                */

  6148.               for (bits = max_length; bits !== 0; bits--) {

  6149.                 n = s.bl_count[bits];

  6150.                 while (n !== 0) {

  6151.                   m = s.heap[--h];

  6152.                   if (m > max_code) { continue; }

  6153.                   if (tree[m * 2 + 1]/*.Len*/ !== bits) {

  6154.                     // Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));

  6155.                     s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;

  6156.                     tree[m * 2 + 1]/*.Len*/ = bits;

  6157.                   }

  6158.                   n--;

  6159.                 }

  6160.               }

  6161.             }

  6162.             

  6163.             

  6164.             /* ===========================================================================

  6165.              * Generate the codes for a given tree and bit counts (which need not be

  6166.              * optimal).

  6167.              * IN assertion: the array bl_count contains the bit length statistics for

  6168.              * the given tree and the field len is set for all tree elements.

  6169.              * OUT assertion: the field code is set for all tree elements of non

  6170.              *     zero code length.

  6171.              */

  6172.             function gen_codes(tree, max_code, bl_count)

  6173.             //    ct_data *tree;             /* the tree to decorate */

  6174.             //    int max_code;              /* largest code with non zero frequency */

  6175.             //    ushf *bl_count;            /* number of codes at each bit length */

  6176.             {

  6177.               var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */

  6178.               var code = 0;              /* running code value */

  6179.               var bits;                  /* bit index */

  6180.               var n;                     /* code index */

  6181.             

  6182.               /* The distribution counts are first used to generate the code values

  6183.                * without bit reversal.

  6184.                */

  6185.               for (bits = 1; bits <= MAX_BITS; bits++) {

  6186.                 next_code[bits] = code = (code + bl_count[bits - 1]) << 1;

  6187.               }

  6188.               /* Check that the bit counts in bl_count are consistent. The last code

  6189.                * must be all ones.

  6190.                */

  6191.               //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,

  6192.               //        "inconsistent bit counts");

  6193.               //Tracev((stderr,"\ngen_codes: max_code %d ", max_code));

  6194.             

  6195.               for (n = 0;  n <= max_code; n++) {

  6196.                 var len = tree[n * 2 + 1]/*.Len*/;

  6197.                 if (len === 0) { continue; }

  6198.                 /* Now reverse the bits */

  6199.                 tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);

  6200.             

  6201.                 //Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",

  6202.                 //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));

  6203.               }

  6204.             }

  6205.             

  6206.             

  6207.             /* ===========================================================================

  6208.              * Initialize the various 'constant' tables.

  6209.              */

  6210.             function tr_static_init() {

  6211.               var n;        /* iterates over tree elements */

  6212.               var bits;     /* bit counter */

  6213.               var length;   /* length value */

  6214.               var code;     /* code value */

  6215.               var dist;     /* distance index */

  6216.               var bl_count = new Array(MAX_BITS + 1);

  6217.               /* number of codes at each bit length for an optimal tree */

  6218.             

  6219.               // do check in _tr_init()

  6220.               //if (static_init_done) return;

  6221.             

  6222.               /* For some embedded targets, global variables are not initialized: */

  6223.             /*#ifdef NO_INIT_GLOBAL_POINTERS

  6224.               static_l_desc.static_tree = static_ltree;

  6225.               static_l_desc.extra_bits = extra_lbits;

  6226.               static_d_desc.static_tree = static_dtree;

  6227.               static_d_desc.extra_bits = extra_dbits;

  6228.               static_bl_desc.extra_bits = extra_blbits;

  6229.             #endif*/

  6230.             

  6231.               /* Initialize the mapping length (0..255) -> length code (0..28) */

  6232.               length = 0;

  6233.               for (code = 0; code < LENGTH_CODES - 1; code++) {

  6234.                 base_length[code] = length;

  6235.                 for (n = 0; n < (1 << extra_lbits[code]); n++) {

  6236.                   _length_code[length++] = code;

  6237.                 }

  6238.               }

  6239.               //Assert (length == 256, "tr_static_init: length != 256");

  6240.               /* Note that the length 255 (match length 258) can be represented

  6241.                * in two different ways: code 284 + 5 bits or code 285, so we

  6242.                * overwrite length_code[255] to use the best encoding:

  6243.                */

  6244.               _length_code[length - 1] = code;

  6245.             

  6246.               /* Initialize the mapping dist (0..32K) -> dist code (0..29) */

  6247.               dist = 0;

  6248.               for (code = 0; code < 16; code++) {

  6249.                 base_dist[code] = dist;

  6250.                 for (n = 0; n < (1 << extra_dbits[code]); n++) {

  6251.                   _dist_code[dist++] = code;

  6252.                 }

  6253.               }

  6254.               //Assert (dist == 256, "tr_static_init: dist != 256");

  6255.               dist >>= 7; /* from now on, all distances are divided by 128 */

  6256.               for (; code < D_CODES; code++) {

  6257.                 base_dist[code] = dist << 7;

  6258.                 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {

  6259.                   _dist_code[256 + dist++] = code;

  6260.                 }

  6261.               }

  6262.               //Assert (dist == 256, "tr_static_init: 256+dist != 512");

  6263.             

  6264.               /* Construct the codes of the static literal tree */

  6265.               for (bits = 0; bits <= MAX_BITS; bits++) {

  6266.                 bl_count[bits] = 0;

  6267.               }

  6268.             

  6269.               n = 0;

  6270.               while (n <= 143) {

  6271.                 static_ltree[n * 2 + 1]/*.Len*/ = 8;

  6272.                 n++;

  6273.                 bl_count[8]++;

  6274.               }

  6275.               while (n <= 255) {

  6276.                 static_ltree[n * 2 + 1]/*.Len*/ = 9;

  6277.                 n++;

  6278.                 bl_count[9]++;

  6279.               }

  6280.               while (n <= 279) {

  6281.                 static_ltree[n * 2 + 1]/*.Len*/ = 7;

  6282.                 n++;

  6283.                 bl_count[7]++;

  6284.               }

  6285.               while (n <= 287) {

  6286.                 static_ltree[n * 2 + 1]/*.Len*/ = 8;

  6287.                 n++;

  6288.                 bl_count[8]++;

  6289.               }

  6290.               /* Codes 286 and 287 do not exist, but we must include them in the

  6291.                * tree construction to get a canonical Huffman tree (longest code

  6292.                * all ones)

  6293.                */

  6294.               gen_codes(static_ltree, L_CODES + 1, bl_count);

  6295.             

  6296.               /* The static distance tree is trivial: */

  6297.               for (n = 0; n < D_CODES; n++) {

  6298.                 static_dtree[n * 2 + 1]/*.Len*/ = 5;

  6299.                 static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);

  6300.               }

  6301.             

  6302.               // Now data ready and we can init static trees

  6303.               static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);

  6304.               static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS);

  6305.               static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES, MAX_BL_BITS);

  6306.             

  6307.               //static_init_done = true;

  6308.             }

  6309.             

  6310.             

  6311.             /* ===========================================================================

  6312.              * Initialize a new block.

  6313.              */

  6314.             function init_block(s) {

  6315.               var n; /* iterates over tree elements */

  6316.             

  6317.               /* Initialize the trees. */

  6318.               for (n = 0; n < L_CODES;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }

  6319.               for (n = 0; n < D_CODES;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }

  6320.               for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }

  6321.             

  6322.               s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;

  6323.               s.opt_len = s.static_len = 0;

  6324.               s.last_lit = s.matches = 0;

  6325.             }

  6326.             

  6327.             

  6328.             /* ===========================================================================

  6329.              * Flush the bit buffer and align the output on a byte boundary

  6330.              */

  6331.             function bi_windup(s)

  6332.             {

  6333.               if (s.bi_valid > 8) {

  6334.                 put_short(s, s.bi_buf);

  6335.               } else if (s.bi_valid > 0) {

  6336.                 //put_byte(s, (Byte)s->bi_buf);

  6337.                 s.pending_buf[s.pending++] = s.bi_buf;

  6338.               }

  6339.               s.bi_buf = 0;

  6340.               s.bi_valid = 0;

  6341.             }

  6342.             

  6343.             /* ===========================================================================

  6344.              * Copy a stored block, storing first the length and its

  6345.              * one's complement if requested.

  6346.              */

  6347.             function copy_block(s, buf, len, header)

  6348.             //DeflateState *s;

  6349.             //charf    *buf;    /* the input data */

  6350.             //unsigned len;     /* its length */

  6351.             //int      header;  /* true if block header must be written */

  6352.             {

  6353.               bi_windup(s);        /* align on byte boundary */

  6354.             

  6355.               if (header) {

  6356.                 put_short(s, len);

  6357.                 put_short(s, ~len);

  6358.               }

  6359.             //  while (len--) {

  6360.             //    put_byte(s, *buf++);

  6361.             //  }

  6362.               utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);

  6363.               s.pending += len;

  6364.             }

  6365.             

  6366.             /* ===========================================================================

  6367.              * Compares to subtrees, using the tree depth as tie breaker when

  6368.              * the subtrees have equal frequency. This minimizes the worst case length.

  6369.              */

  6370.             function smaller(tree, n, m, depth) {

  6371.               var _n2 = n * 2;

  6372.               var _m2 = m * 2;

  6373.               return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||

  6374.                      (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));

  6375.             }

  6376.             

  6377.             /* ===========================================================================

  6378.              * Restore the heap property by moving down the tree starting at node k,

  6379.              * exchanging a node with the smallest of its two sons if necessary, stopping

  6380.              * when the heap property is re-established (each father smaller than its

  6381.              * two sons).

  6382.              */

  6383.             function pqdownheap(s, tree, k)

  6384.             //    deflate_state *s;

  6385.             //    ct_data *tree;  /* the tree to restore */

  6386.             //    int k;               /* node to move down */

  6387.             {

  6388.               var v = s.heap[k];

  6389.               var j = k << 1;  /* left son of k */

  6390.               while (j <= s.heap_len) {

  6391.                 /* Set j to the smallest of the two sons: */

  6392.                 if (j < s.heap_len &&

  6393.                   smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {

  6394.                   j++;

  6395.                 }

  6396.                 /* Exit if v is smaller than both sons */

  6397.                 if (smaller(tree, v, s.heap[j], s.depth)) { break; }

  6398.             

  6399.                 /* Exchange v with the smallest son */

  6400.                 s.heap[k] = s.heap[j];

  6401.                 k = j;

  6402.             

  6403.                 /* And continue down the tree, setting j to the left son of k */

  6404.                 j <<= 1;

  6405.               }

  6406.               s.heap[k] = v;

  6407.             }

  6408.             

  6409.             

  6410.             // inlined manually

  6411.             // var SMALLEST = 1;

  6412.             

  6413.             /* ===========================================================================

  6414.              * Send the block data compressed using the given Huffman trees

  6415.              */

  6416.             function compress_block(s, ltree, dtree)

  6417.             //    deflate_state *s;

  6418.             //    const ct_data *ltree; /* literal tree */

  6419.             //    const ct_data *dtree; /* distance tree */

  6420.             {

  6421.               var dist;           /* distance of matched string */

  6422.               var lc;             /* match length or unmatched char (if dist == 0) */

  6423.               var lx = 0;         /* running index in l_buf */

  6424.               var code;           /* the code to send */

  6425.               var extra;          /* number of extra bits to send */

  6426.             

  6427.               if (s.last_lit !== 0) {

  6428.                 do {

  6429.                   dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);

  6430.                   lc = s.pending_buf[s.l_buf + lx];

  6431.                   lx++;

  6432.             

  6433.                   if (dist === 0) {

  6434.                     send_code(s, lc, ltree); /* send a literal byte */

  6435.                     //Tracecv(isgraph(lc), (stderr," '%c' ", lc));

  6436.                   } else {

  6437.                     /* Here, lc is the match length - MIN_MATCH */

  6438.                     code = _length_code[lc];

  6439.                     send_code(s, code + LITERALS + 1, ltree); /* send the length code */

  6440.                     extra = extra_lbits[code];

  6441.                     if (extra !== 0) {

  6442.                       lc -= base_length[code];

  6443.                       send_bits(s, lc, extra);       /* send the extra length bits */

  6444.                     }

  6445.                     dist--; /* dist is now the match distance - 1 */

  6446.                     code = d_code(dist);

  6447.                     //Assert (code < D_CODES, "bad d_code");

  6448.             

  6449.                     send_code(s, code, dtree);       /* send the distance code */

  6450.                     extra = extra_dbits[code];

  6451.                     if (extra !== 0) {

  6452.                       dist -= base_dist[code];

  6453.                       send_bits(s, dist, extra);   /* send the extra distance bits */

  6454.                     }

  6455.                   } /* literal or match pair ? */

  6456.             

  6457.                   /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */

  6458.                   //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,

  6459.                   //       "pendingBuf overflow");

  6460.             

  6461.                 } while (lx < s.last_lit);

  6462.               }

  6463.             

  6464.               send_code(s, END_BLOCK, ltree);

  6465.             }

  6466.             

  6467.             

  6468.             /* ===========================================================================

  6469.              * Construct one Huffman tree and assigns the code bit strings and lengths.

  6470.              * Update the total bit length for the current block.

  6471.              * IN assertion: the field freq is set for all tree elements.

  6472.              * OUT assertions: the fields len and code are set to the optimal bit length

  6473.              *     and corresponding code. The length opt_len is updated; static_len is

  6474.              *     also updated if stree is not null. The field max_code is set.

  6475.              */

  6476.             function build_tree(s, desc)

  6477.             //    deflate_state *s;

  6478.             //    tree_desc *desc; /* the tree descriptor */

  6479.             {

  6480.               var tree     = desc.dyn_tree;

  6481.               var stree    = desc.stat_desc.static_tree;

  6482.               var has_stree = desc.stat_desc.has_stree;

  6483.               var elems    = desc.stat_desc.elems;

  6484.               var n, m;          /* iterate over heap elements */

  6485.               var max_code = -1; /* largest code with non zero frequency */

  6486.               var node;          /* new node being created */

  6487.             

  6488.               /* Construct the initial heap, with least frequent element in

  6489.                * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].

  6490.                * heap[0] is not used.

  6491.                */

  6492.               s.heap_len = 0;

  6493.               s.heap_max = HEAP_SIZE;

  6494.             

  6495.               for (n = 0; n < elems; n++) {

  6496.                 if (tree[n * 2]/*.Freq*/ !== 0) {

  6497.                   s.heap[++s.heap_len] = max_code = n;

  6498.                   s.depth[n] = 0;

  6499.             

  6500.                 } else {

  6501.                   tree[n * 2 + 1]/*.Len*/ = 0;

  6502.                 }

  6503.               }

  6504.             

  6505.               /* The pkzip format requires that at least one distance code exists,

  6506.                * and that at least one bit should be sent even if there is only one

  6507.                * possible code. So to avoid special checks later on we force at least

  6508.                * two codes of non zero frequency.

  6509.                */

  6510.               while (s.heap_len < 2) {

  6511.                 node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);

  6512.                 tree[node * 2]/*.Freq*/ = 1;

  6513.                 s.depth[node] = 0;

  6514.                 s.opt_len--;

  6515.             

  6516.                 if (has_stree) {

  6517.                   s.static_len -= stree[node * 2 + 1]/*.Len*/;

  6518.                 }

  6519.                 /* node is 0 or 1 so it does not have extra bits */

  6520.               }

  6521.               desc.max_code = max_code;

  6522.             

  6523.               /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,

  6524.                * establish sub-heaps of increasing lengths:

  6525.                */

  6526.               for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }

  6527.             

  6528.               /* Construct the Huffman tree by repeatedly combining the least two

  6529.                * frequent nodes.

  6530.                */

  6531.               node = elems;              /* next internal node of the tree */

  6532.               do {

  6533.                 //pqremove(s, tree, n);  /* n = node of least frequency */

  6534.                 /*** pqremove ***/

  6535.                 n = s.heap[1/*SMALLEST*/];

  6536.                 s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];

  6537.                 pqdownheap(s, tree, 1/*SMALLEST*/);

  6538.                 /***/

  6539.             

  6540.                 m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */

  6541.             

  6542.                 s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */

  6543.                 s.heap[--s.heap_max] = m;

  6544.             

  6545.                 /* Create a new node father of n and m */

  6546.                 tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;

  6547.                 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;

  6548.                 tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;

  6549.             

  6550.                 /* and insert the new node in the heap */

  6551.                 s.heap[1/*SMALLEST*/] = node++;

  6552.                 pqdownheap(s, tree, 1/*SMALLEST*/);

  6553.             

  6554.               } while (s.heap_len >= 2);

  6555.             

  6556.               s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];

  6557.             

  6558.               /* At this point, the fields freq and dad are set. We can now

  6559.                * generate the bit lengths.

  6560.                */

  6561.               gen_bitlen(s, desc);

  6562.             

  6563.               /* The field len is now set, we can generate the bit codes */

  6564.               gen_codes(tree, max_code, s.bl_count);

  6565.             }

  6566.             

  6567.             

  6568.             /* ===========================================================================

  6569.              * Scan a literal or distance tree to determine the frequencies of the codes

  6570.              * in the bit length tree.

  6571.              */

  6572.             function scan_tree(s, tree, max_code)

  6573.             //    deflate_state *s;

  6574.             //    ct_data *tree;   /* the tree to be scanned */

  6575.             //    int max_code;    /* and its largest code of non zero frequency */

  6576.             {

  6577.               var n;                     /* iterates over all tree elements */

  6578.               var prevlen = -1;          /* last emitted length */

  6579.               var curlen;                /* length of current code */

  6580.             

  6581.               var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */

  6582.             

  6583.               var count = 0;             /* repeat count of the current code */

  6584.               var max_count = 7;         /* max repeat count */

  6585.               var min_count = 4;         /* min repeat count */

  6586.             

  6587.               if (nextlen === 0) {

  6588.                 max_count = 138;

  6589.                 min_count = 3;

  6590.               }

  6591.               tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */

  6592.             

  6593.               for (n = 0; n <= max_code; n++) {

  6594.                 curlen = nextlen;

  6595.                 nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;

  6596.             

  6597.                 if (++count < max_count && curlen === nextlen) {

  6598.                   continue;

  6599.             

  6600.                 } else if (count < min_count) {

  6601.                   s.bl_tree[curlen * 2]/*.Freq*/ += count;

  6602.             

  6603.                 } else if (curlen !== 0) {

  6604.             

  6605.                   if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }

  6606.                   s.bl_tree[REP_3_6 * 2]/*.Freq*/++;

  6607.             

  6608.                 } else if (count <= 10) {

  6609.                   s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;

  6610.             

  6611.                 } else {

  6612.                   s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;

  6613.                 }

  6614.             

  6615.                 count = 0;

  6616.                 prevlen = curlen;

  6617.             

  6618.                 if (nextlen === 0) {

  6619.                   max_count = 138;

  6620.                   min_count = 3;

  6621.             

  6622.                 } else if (curlen === nextlen) {

  6623.                   max_count = 6;

  6624.                   min_count = 3;

  6625.             

  6626.                 } else {

  6627.                   max_count = 7;

  6628.                   min_count = 4;

  6629.                 }

  6630.               }

  6631.             }

  6632.             

  6633.             

  6634.             /* ===========================================================================

  6635.              * Send a literal or distance tree in compressed form, using the codes in

  6636.              * bl_tree.

  6637.              */

  6638.             function send_tree(s, tree, max_code)

  6639.             //    deflate_state *s;

  6640.             //    ct_data *tree; /* the tree to be scanned */

  6641.             //    int max_code;       /* and its largest code of non zero frequency */

  6642.             {

  6643.               var n;                     /* iterates over all tree elements */

  6644.               var prevlen = -1;          /* last emitted length */

  6645.               var curlen;                /* length of current code */

  6646.             

  6647.               var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */

  6648.             

  6649.               var count = 0;             /* repeat count of the current code */

  6650.               var max_count = 7;         /* max repeat count */

  6651.               var min_count = 4;         /* min repeat count */

  6652.             

  6653.               /* tree[max_code+1].Len = -1; */  /* guard already set */

  6654.               if (nextlen === 0) {

  6655.                 max_count = 138;

  6656.                 min_count = 3;

  6657.               }

  6658.             

  6659.               for (n = 0; n <= max_code; n++) {

  6660.                 curlen = nextlen;

  6661.                 nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;

  6662.             

  6663.                 if (++count < max_count && curlen === nextlen) {

  6664.                   continue;

  6665.             

  6666.                 } else if (count < min_count) {

  6667.                   do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);

  6668.             

  6669.                 } else if (curlen !== 0) {

  6670.                   if (curlen !== prevlen) {

  6671.                     send_code(s, curlen, s.bl_tree);

  6672.                     count--;

  6673.                   }

  6674.                   //Assert(count >= 3 && count <= 6, " 3_6?");

  6675.                   send_code(s, REP_3_6, s.bl_tree);

  6676.                   send_bits(s, count - 3, 2);

  6677.             

  6678.                 } else if (count <= 10) {

  6679.                   send_code(s, REPZ_3_10, s.bl_tree);

  6680.                   send_bits(s, count - 3, 3);

  6681.             

  6682.                 } else {

  6683.                   send_code(s, REPZ_11_138, s.bl_tree);

  6684.                   send_bits(s, count - 11, 7);

  6685.                 }

  6686.             

  6687.                 count = 0;

  6688.                 prevlen = curlen;

  6689.                 if (nextlen === 0) {

  6690.                   max_count = 138;

  6691.                   min_count = 3;

  6692.             

  6693.                 } else if (curlen === nextlen) {

  6694.                   max_count = 6;

  6695.                   min_count = 3;

  6696.             

  6697.                 } else {

  6698.                   max_count = 7;

  6699.                   min_count = 4;

  6700.                 }

  6701.               }

  6702.             }

  6703.             

  6704.             

  6705.             /* ===========================================================================

  6706.              * Construct the Huffman tree for the bit lengths and return the index in

  6707.              * bl_order of the last bit length code to send.

  6708.              */

  6709.             function build_bl_tree(s) {

  6710.               var max_blindex;  /* index of last bit length code of non zero freq */

  6711.             

  6712.               /* Determine the bit length frequencies for literal and distance trees */

  6713.               scan_tree(s, s.dyn_ltree, s.l_desc.max_code);

  6714.               scan_tree(s, s.dyn_dtree, s.d_desc.max_code);

  6715.             

  6716.               /* Build the bit length tree: */

  6717.               build_tree(s, s.bl_desc);

  6718.               /* opt_len now includes the length of the tree representations, except

  6719.                * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.

  6720.                */

  6721.             

  6722.               /* Determine the number of bit length codes to send. The pkzip format

  6723.                * requires that at least 4 bit length codes be sent. (appnote.txt says

  6724.                * 3 but the actual value used is 4.)

  6725.                */

  6726.               for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {

  6727.                 if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {

  6728.                   break;

  6729.                 }

  6730.               }

  6731.               /* Update opt_len to include the bit length tree and counts */

  6732.               s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;

  6733.               //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",

  6734.               //        s->opt_len, s->static_len));

  6735.             

  6736.               return max_blindex;

  6737.             }

  6738.             

  6739.             

  6740.             /* ===========================================================================

  6741.              * Send the header for a block using dynamic Huffman trees: the counts, the

  6742.              * lengths of the bit length codes, the literal tree and the distance tree.

  6743.              * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.

  6744.              */

  6745.             function send_all_trees(s, lcodes, dcodes, blcodes)

  6746.             //    deflate_state *s;

  6747.             //    int lcodes, dcodes, blcodes; /* number of codes for each tree */

  6748.             {

  6749.               var rank;                    /* index in bl_order */

  6750.             

  6751.               //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");

  6752.               //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,

  6753.               //        "too many codes");

  6754.               //Tracev((stderr, "\nbl counts: "));

  6755.               send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */

  6756.               send_bits(s, dcodes - 1,   5);

  6757.               send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */

  6758.               for (rank = 0; rank < blcodes; rank++) {

  6759.                 //Tracev((stderr, "\nbl code %2d ", bl_order[rank]));

  6760.                 send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);

  6761.               }

  6762.               //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));

  6763.             

  6764.               send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */

  6765.               //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));

  6766.             

  6767.               send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */

  6768.               //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));

  6769.             }

  6770.             

  6771.             

  6772.             /* ===========================================================================

  6773.              * Check if the data type is TEXT or BINARY, using the following algorithm:

  6774.              * - TEXT if the two conditions below are satisfied:

  6775.              *    a) There are no non-portable control characters belonging to the

  6776.              *       "black list" (0..6, 14..25, 28..31).

  6777.              *    b) There is at least one printable character belonging to the

  6778.              *       "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).

  6779.              * - BINARY otherwise.

  6780.              * - The following partially-portable control characters form a

  6781.              *   "gray list" that is ignored in this detection algorithm:

  6782.              *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).

  6783.              * IN assertion: the fields Freq of dyn_ltree are set.

  6784.              */

  6785.             function detect_data_type(s) {

  6786.               /* black_mask is the bit mask of black-listed bytes

  6787.                * set bits 0..6, 14..25, and 28..31

  6788.                * 0xf3ffc07f = binary 11110011111111111100000001111111

  6789.                */

  6790.               var black_mask = 0xf3ffc07f;

  6791.               var n;

  6792.             

  6793.               /* Check for non-textual ("black-listed") bytes. */

  6794.               for (n = 0; n <= 31; n++, black_mask >>>= 1) {

  6795.                 if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {

  6796.                   return Z_BINARY;

  6797.                 }

  6798.               }

  6799.             

  6800.               /* Check for textual ("white-listed") bytes. */

  6801.               if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||

  6802.                   s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {

  6803.                 return Z_TEXT;

  6804.               }

  6805.               for (n = 32; n < LITERALS; n++) {

  6806.                 if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {

  6807.                   return Z_TEXT;

  6808.                 }

  6809.               }

  6810.             

  6811.               /* There are no "black-listed" or "white-listed" bytes:

  6812.                * this stream either is empty or has tolerated ("gray-listed") bytes only.

  6813.                */

  6814.               return Z_BINARY;

  6815.             }

  6816.             

  6817.             

  6818.             var static_init_done = false;

  6819.             

  6820.             /* ===========================================================================

  6821.              * Initialize the tree data structures for a new zlib stream.

  6822.              */

  6823.             function _tr_init(s)

  6824.             {

  6825.             

  6826.               if (!static_init_done) {

  6827.                 tr_static_init();

  6828.                 static_init_done = true;

  6829.               }

  6830.             

  6831.               s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);

  6832.               s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);

  6833.               s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);

  6834.             

  6835.               s.bi_buf = 0;

  6836.               s.bi_valid = 0;

  6837.             

  6838.               /* Initialize the first block of the first file: */

  6839.               init_block(s);

  6840.             }

  6841.             

  6842.             

  6843.             /* ===========================================================================

  6844.              * Send a stored block

  6845.              */

  6846.             function _tr_stored_block(s, buf, stored_len, last)

  6847.             //DeflateState *s;

  6848.             //charf *buf;       /* input block */

  6849.             //ulg stored_len;   /* length of input block */

  6850.             //int last;         /* one if this is the last block for a file */

  6851.             {

  6852.               send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */

  6853.               copy_block(s, buf, stored_len, true); /* with header */

  6854.             }

  6855.             

  6856.             

  6857.             /* ===========================================================================

  6858.              * Send one empty static block to give enough lookahead for inflate.

  6859.              * This takes 10 bits, of which 7 may remain in the bit buffer.

  6860.              */

  6861.             function _tr_align(s) {

  6862.               send_bits(s, STATIC_TREES << 1, 3);

  6863.               send_code(s, END_BLOCK, static_ltree);

  6864.               bi_flush(s);

  6865.             }

  6866.             

  6867.             

  6868.             /* ===========================================================================

  6869.              * Determine the best encoding for the current block: dynamic trees, static

  6870.              * trees or store, and output the encoded block to the zip file.

  6871.              */

  6872.             function _tr_flush_block(s, buf, stored_len, last)

  6873.             //DeflateState *s;

  6874.             //charf *buf;       /* input block, or NULL if too old */

  6875.             //ulg stored_len;   /* length of input block */

  6876.             //int last;         /* one if this is the last block for a file */

  6877.             {

  6878.               var opt_lenb, static_lenb;  /* opt_len and static_len in bytes */

  6879.               var max_blindex = 0;        /* index of last bit length code of non zero freq */

  6880.             

  6881.               /* Build the Huffman trees unless a stored block is forced */

  6882.               if (s.level > 0) {

  6883.             

  6884.                 /* Check if the file is binary or text */

  6885.                 if (s.strm.data_type === Z_UNKNOWN) {

  6886.                   s.strm.data_type = detect_data_type(s);

  6887.                 }

  6888.             

  6889.                 /* Construct the literal and distance trees */

  6890.                 build_tree(s, s.l_desc);

  6891.                 // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,

  6892.                 //        s->static_len));

  6893.             

  6894.                 build_tree(s, s.d_desc);

  6895.                 // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,

  6896.                 //        s->static_len));

  6897.                 /* At this point, opt_len and static_len are the total bit lengths of

  6898.                  * the compressed block data, excluding the tree representations.

  6899.                  */

  6900.             

  6901.                 /* Build the bit length tree for the above two trees, and get the index

  6902.                  * in bl_order of the last bit length code to send.

  6903.                  */

  6904.                 max_blindex = build_bl_tree(s);

  6905.             

  6906.                 /* Determine the best encoding. Compute the block lengths in bytes. */

  6907.                 opt_lenb = (s.opt_len + 3 + 7) >>> 3;

  6908.                 static_lenb = (s.static_len + 3 + 7) >>> 3;

  6909.             

  6910.                 // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",

  6911.                 //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,

  6912.                 //        s->last_lit));

  6913.             

  6914.                 if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }

  6915.             

  6916.               } else {

  6917.                 // Assert(buf != (char*)0, "lost buf");

  6918.                 opt_lenb = static_lenb = stored_len + 5; /* force a stored block */

  6919.               }

  6920.             

  6921.               if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {

  6922.                 /* 4: two words for the lengths */

  6923.             

  6924.                 /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.

  6925.                  * Otherwise we can't have processed more than WSIZE input bytes since

  6926.                  * the last block flush, because compression would have been

  6927.                  * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to

  6928.                  * transform a block into a stored block.

  6929.                  */

  6930.                 _tr_stored_block(s, buf, stored_len, last);

  6931.             

  6932.               } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {

  6933.             

  6934.                 send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);

  6935.                 compress_block(s, static_ltree, static_dtree);

  6936.             

  6937.               } else {

  6938.                 send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);

  6939.                 send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);

  6940.                 compress_block(s, s.dyn_ltree, s.dyn_dtree);

  6941.               }

  6942.               // Assert (s->compressed_len == s->bits_sent, "bad compressed size");

  6943.               /* The above check is made mod 2^32, for files larger than 512 MB

  6944.                * and uLong implemented on 32 bits.

  6945.                */

  6946.               init_block(s);

  6947.             

  6948.               if (last) {

  6949.                 bi_windup(s);

  6950.               }

  6951.               // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,

  6952.               //       s->compressed_len-7*last));

  6953.             }

  6954.             

  6955.             /* ===========================================================================

  6956.              * Save the match info and tally the frequency counts. Return true if

  6957.              * the current block must be flushed.

  6958.              */

  6959.             function _tr_tally(s, dist, lc)

  6960.             //    deflate_state *s;

  6961.             //    unsigned dist;  /* distance of matched string */

  6962.             //    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */

  6963.             {

  6964.               //var out_length, in_length, dcode;

  6965.             

  6966.               s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;

  6967.               s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;

  6968.             

  6969.               s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;

  6970.               s.last_lit++;

  6971.             

  6972.               if (dist === 0) {

  6973.                 /* lc is the unmatched char */

  6974.                 s.dyn_ltree[lc * 2]/*.Freq*/++;

  6975.               } else {

  6976.                 s.matches++;

  6977.                 /* Here, lc is the match length - MIN_MATCH */

  6978.                 dist--;             /* dist = match distance - 1 */

  6979.                 //Assert((ush)dist < (ush)MAX_DIST(s) &&

  6980.                 //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

  6981.                 //       (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");

  6982.             

  6983.                 s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;

  6984.                 s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;

  6985.               }

  6986.             

  6987.             // (!) This block is disabled in zlib defaults,

  6988.             // don't enable it for binary compatibility

  6989.             

  6990.             //#ifdef TRUNCATE_BLOCK

  6991.             //  /* Try to guess if it is profitable to stop the current block here */

  6992.             //  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {

  6993.             //    /* Compute an upper bound for the compressed length */

  6994.             //    out_length = s.last_lit*8;

  6995.             //    in_length = s.strstart - s.block_start;

  6996.             //

  6997.             //    for (dcode = 0; dcode < D_CODES; dcode++) {

  6998.             //      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);

  6999.             //    }

  7000.             //    out_length >>>= 3;

  7001.             //    //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",

  7002.             //    //       s->last_lit, in_length, out_length,

  7003.             //    //       100L - out_length*100L/in_length));

  7004.             //    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {

  7005.             //      return true;

  7006.             //    }

  7007.             //  }

  7008.             //#endif

  7009.             

  7010.               return (s.last_lit === s.lit_bufsize - 1);

  7011.               /* We avoid equality with lit_bufsize because of wraparound at 64K

  7012.                * on 16 bit machines and because stored blocks are restricted to

  7013.                * 64K-1 bytes.

  7014.                */

  7015.             }

  7016.             

  7017.             exports._tr_init  = _tr_init;

  7018.             exports._tr_stored_block = _tr_stored_block;

  7019.             exports._tr_flush_block  = _tr_flush_block;

  7020.             exports._tr_tally = _tr_tally;

  7021.             exports._tr_align = _tr_align;

  7022.             

  7023.             },{"../utils/common":3}],15:[function(require,module,exports){

  7024.             'use strict';

  7025.             

  7026.             // (C) 1995-2013 Jean-loup Gailly and Mark Adler

  7027.             // (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin

  7028.             //

  7029.             // This software is provided 'as-is', without any express or implied

  7030.             // warranty. In no event will the authors be held liable for any damages

  7031.             // arising from the use of this software.

  7032.             //

  7033.             // Permission is granted to anyone to use this software for any purpose,

  7034.             // including commercial applications, and to alter it and redistribute it

  7035.             // freely, subject to the following restrictions:

  7036.             //

  7037.             // 1. The origin of this software must not be misrepresented; you must not

  7038.             //   claim that you wrote the original software. If you use this software

  7039.             //   in a product, an acknowledgment in the product documentation would be

  7040.             //   appreciated but is not required.

  7041.             // 2. Altered source versions must be plainly marked as such, and must not be

  7042.             //   misrepresented as being the original software.

  7043.             // 3. This notice may not be removed or altered from any source distribution.

  7044.             

  7045.             function ZStream() {

  7046.               /* next input byte */

  7047.               this.input = null; // JS specific, because we have no pointers

  7048.               this.next_in = 0;

  7049.               /* number of bytes available at input */

  7050.               this.avail_in = 0;

  7051.               /* total number of input bytes read so far */

  7052.               this.total_in = 0;

  7053.               /* next output byte should be put there */

  7054.               this.output = null; // JS specific, because we have no pointers

  7055.               this.next_out = 0;

  7056.               /* remaining free space at output */

  7057.               this.avail_out = 0;

  7058.               /* total number of bytes output so far */

  7059.               this.total_out = 0;

  7060.               /* last error message, NULL if no error */

  7061.               this.msg = ''/*Z_NULL*/;

  7062.               /* not visible by applications */

  7063.               this.state = null;

  7064.               /* best guess about the data type: binary or text */

  7065.               this.data_type = 2/*Z_UNKNOWN*/;

  7066.               /* adler32 value of the uncompressed data */

  7067.               this.adler = 0;

  7068.             }

  7069.             

  7070.             module.exports = ZStream;

  7071.             

  7072.             },{}],"/":[function(require,module,exports){

  7073.             // Top level file is just a mixin of submodules & constants

  7074.             'use strict';

  7075.             

  7076.             var assign    = require('./lib/utils/common').assign;

  7077.             

  7078.             var deflate   = require('./lib/deflate');

  7079.             var inflate   = require('./lib/inflate');

  7080.             var constants = require('./lib/zlib/constants');

  7081.             

  7082.             var pako = {};

  7083.             

  7084.             assign(pako, deflate, inflate, constants);

  7085.             

  7086.             module.exports = pako;

  7087.             

  7088.             },{"./lib/deflate":1,"./lib/inflate":2,"./lib/utils/common":3,"./lib/zlib/constants":6}]},{},[])("/")

  7089.             });

  7090.             // SRC: https://developer.mozilla.org/ru/docs/Web/API/WindowBase64/Base64_encoding_and_decoding

  7091.             function base64Encode(str)

  7092.             {

  7093.                 var bytes = new (TextEncoder || TextEncoderLite)("utf-8").encode(str);

  7094.                 return base64js.fromByteArray(bytes);

  7095.             }

  7096.             function base64Decode(str)

  7097.             {

  7098.                 var bytes = base64js.toByteArray(str);

  7099.                 return new (TextDecoder || TextDecoderLite)("utf-8").decode(bytes);

  7100.             }

  7101.             function zipBase64Encode(input)

  7102.             {

  7103.                 var bytes = new (TextEncoder || TextEncoderLite)("utf-8").encode(input);

  7104.                 var zipValue = window.pako.deflate(bytes, {to: 'string'});

  7105.                 return base64Encode(zipValue);

  7106.             }

  7107.             function zipBase64Decode(input)

  7108.             {

  7109.                 var zipValue = base64Decode(input);

  7110.                 var bytes = window.pako.inflate(zipValue)

  7111.                 return new (TextDecoder || TextDecoderLite)("utf-8").decode(bytes);

  7112.             }

  7113.         </script>

  7114. 

  7115.         <!-- Reusable functions -->

  7116.         <script type="text/javascript">

  7117.             function LOG(message)

  7118.             {

  7119.                 var log = document.getElementById("log");

  7120.                 var now = new Date();

  7121.                 log.innerHTML += now.toISOString() + " " + message + "<br>";

  7122.             }

  7123.             // Topic: JavaScript equivalent to printf/String.Format

  7124.             // Source: https://stackoverflow.com/a/4673436

  7125.             function formatString()

  7126.             {

  7127.                 // Topic: How to shift “arguments”?

  7128.                 // Source: https://stackoverflow.com/questions/4775895/how-to-shift-arguments

  7129.                 var args = Array.prototype.slice.call(arguments);

  7130.                 var str = args.shift();

  7131.                 return str.replace(/{(\d+)}/g, function(match, number) { 

  7132.                           return typeof args[number] != 'undefined'

  7133.                             ? args[number]

  7134.                             : match

  7135.                           ;

  7136.                         });

  7137.             };

  7138.         </script>

  7139. 

  7140.         <!-- Tool -->

  7141.         <script type="text/javascript">

  7142.             // Tool class.

  7143.             function Tool()

  7144.             {

  7145.                 var self = this;

  7146.                 this.logTranslations = {};

  7147.                 this.logTranslations["СМЕНА"] = "Произведена замена ввода({0}) и вывода({1}) местами";

  7148.                 this.logTranslations["В_БАЗУ64"] = "Произведено шифрование ввода({0}) в вывод({1}) Base64";

  7149.                 this.logTranslations["ИЗ_БАЗЫ64"] = "Произведена расшифровка ввода({0}) Base64 в вывод({1})";

  7150.                 this.logTranslations["В_ЗИП_БАЗУ64"] = "Произведено шифрование ввода({0}) в вывод({1}) Zip + Base64";

  7151.                 this.logTranslations["ИЗ_ЗИП_БАЗЫ64"] = "Произведена расшифровка ввода({0}) Zip + Base64 в вывод({1})";

  7152.             }

  7153.             Tool.prototype.LOG = function()

  7154.             {

  7155.                 var args = Array.prototype.slice.call(arguments);

  7156.                 var translationKey = args.shift();

  7157.                 var message = "";

  7158.                 if (translationKey in this.logTranslations)

  7159.                 {

  7160.                     args.unshift(this.logTranslations[translationKey]);

  7161.                     // Topic: Converting an array to a function arguments list

  7162.                     // Source: https://stackoverflow.com/a/1316389

  7163.                     message = formatString.apply(null, args);

  7164.                 }

  7165.                 else

  7166.                 {

  7167.                     message = translationKey + " " + args.join(" ");

  7168.                 }

  7169.                 LOG(message);

  7170.             }

  7171.             Tool.prototype.swap = function()

  7172.             {

  7173.                 var input = document.getElementById("input");

  7174.                 var output = document.getElementById("output");

  7175.             

  7176.                 var inputText = input.value;

  7177.                 var outputText = output.value;

  7178.                 input.value = outputText;

  7179.                 output.value = inputText;

  7180.             

  7181.                 this.LOG("СМЕНА", inputText.length, outputText.length);

  7182.             }

  7183.             Tool.prototype.toBase64 = function()

  7184.             {

  7185.                 var input = document.getElementById("input");

  7186.                 var output = document.getElementById("output");

  7187.             

  7188.                 output.value = base64Encode(input.value);

  7189.             

  7190.                 this.LOG("В_БАЗУ64", input.value.length, output.value.length);

  7191.             }

  7192.             Tool.prototype.fromBase64 = function()

  7193.             {

  7194.                 var input = document.getElementById("input");

  7195.                 var output = document.getElementById("output");

  7196.             

  7197.                 output.value = base64Decode(input.value);

  7198.             

  7199.                 this.LOG("ИЗ_БАЗЫ64", input.value.length, output.value.length);

  7200.             }

  7201.             Tool.prototype.toZipBase64 = function()

  7202.             {

  7203.                 var input = document.getElementById("input");

  7204.                 var output = document.getElementById("output");

  7205.             

  7206.                 output.value = zipBase64Encode(input.value)

  7207.             

  7208.                 this.LOG("В_ЗИП_БАЗУ64", input.value.length, output.value.length);

  7209.             }

  7210.             Tool.prototype.fromZipBase64 = function()

  7211.             {

  7212.                 var input = document.getElementById("input");

  7213.                 var output = document.getElementById("output");

  7214.             

  7215.                 output.value = zipBase64Decode(input.value)

  7216.             

  7217.                 this.LOG("ИЗ_ЗИП_БАЗЫ64", input.value.length, output.value.length);

  7218.             }

  7219. 

  7220.             window.toolZipBase64 = new Tool();

  7221.         </script>

  7222. 

  7223.     </body>

  7224. </html>