@novnc/novnc 1.6.0 → 1.7.0

package/{lib/vendor → vendor}/pako/lib/zlib/deflate.js

@@ -1,98 +1,91 @@
-"use strict";
-
-function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.Z_UNKNOWN = exports.Z_STREAM_ERROR = exports.Z_STREAM_END = exports.Z_RLE = exports.Z_PARTIAL_FLUSH = exports.Z_OK = exports.Z_NO_FLUSH = exports.Z_HUFFMAN_ONLY = exports.Z_FULL_FLUSH = exports.Z_FIXED = exports.Z_FINISH = exports.Z_FILTERED = exports.Z_DEFLATED = exports.Z_DEFAULT_STRATEGY = exports.Z_DEFAULT_COMPRESSION = exports.Z_DATA_ERROR = exports.Z_BUF_ERROR = exports.Z_BLOCK = void 0;
-exports.deflate = deflate;
-exports.deflateEnd = deflateEnd;
-exports.deflateInfo = void 0;
-exports.deflateInit = deflateInit;
-exports.deflateInit2 = deflateInit2;
-exports.deflateReset = deflateReset;
-exports.deflateResetKeep = deflateResetKeep;
-exports.deflateSetDictionary = deflateSetDictionary;
-exports.deflateSetHeader = deflateSetHeader;
-var utils = _interopRequireWildcard(require("../utils/common.js"));
-var trees = _interopRequireWildcard(require("./trees.js"));
-var _adler = _interopRequireDefault(require("./adler32.js"));
-var _crc = _interopRequireDefault(require("./crc32.js"));
-var _messages = _interopRequireDefault(require("./messages.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
-function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(e) { return e ? t : r; })(e); }
-function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != _typeof(e) && "function" != typeof e) return { "default": e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n["default"] = e, t && t.set(e, n), n; }
+import * as utils from "../utils/common.js";
+import * as trees from "./trees.js";
+import adler32 from "./adler32.js";
+import crc32 from "./crc32.js";
+import msg from "./messages.js";
+
 /* Public constants ==========================================================*/
 /* ===========================================================================*/
 
+
 /* Allowed flush values; see deflate() and inflate() below for details */
-var Z_NO_FLUSH = exports.Z_NO_FLUSH = 0;
-var Z_PARTIAL_FLUSH = exports.Z_PARTIAL_FLUSH = 1;
+export const Z_NO_FLUSH      = 0;
+export const Z_PARTIAL_FLUSH = 1;
 //export const Z_SYNC_FLUSH    = 2;
-var Z_FULL_FLUSH = exports.Z_FULL_FLUSH = 3;
-var Z_FINISH = exports.Z_FINISH = 4;
-var Z_BLOCK = exports.Z_BLOCK = 5;
+export const Z_FULL_FLUSH    = 3;
+export const Z_FINISH        = 4;
+export const Z_BLOCK         = 5;
 //export const Z_TREES         = 6;
 
+
 /* Return codes for the compression/decompression functions. Negative values
  * are errors, positive values are used for special but normal events.
  */
-var Z_OK = exports.Z_OK = 0;
-var Z_STREAM_END = exports.Z_STREAM_END = 1;
+export const Z_OK            = 0;
+export const Z_STREAM_END    = 1;
 //export const Z_NEED_DICT     = 2;
 //export const Z_ERRNO         = -1;
-var Z_STREAM_ERROR = exports.Z_STREAM_ERROR = -2;
-var Z_DATA_ERROR = exports.Z_DATA_ERROR = -3;
+export const Z_STREAM_ERROR  = -2;
+export const Z_DATA_ERROR    = -3;
 //export const Z_MEM_ERROR     = -4;
-var Z_BUF_ERROR = exports.Z_BUF_ERROR = -5;
+export const Z_BUF_ERROR     = -5;
 //export const Z_VERSION_ERROR = -6;
 
+
 /* compression levels */
 //export const Z_NO_COMPRESSION      = 0;
 //export const Z_BEST_SPEED          = 1;
 //export const Z_BEST_COMPRESSION    = 9;
-var Z_DEFAULT_COMPRESSION = exports.Z_DEFAULT_COMPRESSION = -1;
-var Z_FILTERED = exports.Z_FILTERED = 1;
-var Z_HUFFMAN_ONLY = exports.Z_HUFFMAN_ONLY = 2;
-var Z_RLE = exports.Z_RLE = 3;
-var Z_FIXED = exports.Z_FIXED = 4;
-var Z_DEFAULT_STRATEGY = exports.Z_DEFAULT_STRATEGY = 0;
+export const Z_DEFAULT_COMPRESSION = -1;
+
+
+export const Z_FILTERED            = 1;
+export const Z_HUFFMAN_ONLY        = 2;
+export const Z_RLE                 = 3;
+export const Z_FIXED               = 4;
+export const Z_DEFAULT_STRATEGY    = 0;
 
 /* Possible values of the data_type field (though see inflate()) */
 //export const Z_BINARY              = 0;
 //export const Z_TEXT                = 1;
 //export const Z_ASCII               = 1; // = Z_TEXT
-var Z_UNKNOWN = exports.Z_UNKNOWN = 2;
+export const Z_UNKNOWN             = 2;
+
 
 /* The deflate compression method */
-var Z_DEFLATED = exports.Z_DEFLATED = 8;
+export const Z_DEFLATED  = 8;
 
 /*============================================================================*/
 
+
 var MAX_MEM_LEVEL = 9;
 /* Maximum value for memLevel in deflateInit2 */
 var MAX_WBITS = 15;
 /* 32K LZ77 window */
 var DEF_MEM_LEVEL = 8;
-var LENGTH_CODES = 29;
+
+
+var LENGTH_CODES  = 29;
 /* number of length codes, not counting the special END_BLOCK code */
-var LITERALS = 256;
+var LITERALS      = 256;
 /* number of literal bytes 0..255 */
-var L_CODES = LITERALS + 1 + LENGTH_CODES;
+var L_CODES       = LITERALS + 1 + LENGTH_CODES;
 /* number of Literal or Length codes, including the END_BLOCK code */
-var D_CODES = 30;
+var D_CODES       = 30;
 /* number of distance codes */
-var BL_CODES = 19;
+var BL_CODES      = 19;
 /* number of codes used to transfer the bit lengths */
-var HEAP_SIZE = 2 * L_CODES + 1;
+var HEAP_SIZE     = 2 * L_CODES + 1;
 /* maximum heap size */
-var MAX_BITS = 15;
+var MAX_BITS  = 15;
 /* All codes must not exceed MAX_BITS bits */
 
 var MIN_MATCH = 3;
 var MAX_MATCH = 258;
-var MIN_LOOKAHEAD = MAX_MATCH + MIN_MATCH + 1;
+var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);
+
 var PRESET_DICT = 0x20;
+
 var INIT_STATE = 42;
 var EXTRA_STATE = 69;
 var NAME_STATE = 73;
@@ -100,27 +93,26 @@ var COMMENT_STATE = 91;
 var HCRC_STATE = 103;
 var BUSY_STATE = 113;
 var FINISH_STATE = 666;
-var BS_NEED_MORE = 1; /* block not completed, need more input or more output */
-var BS_BLOCK_DONE = 2; /* block flush performed */
+
+var BS_NEED_MORE      = 1; /* block not completed, need more input or more output */
+var BS_BLOCK_DONE     = 2; /* block flush performed */
 var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */
-var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */
+var BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */
 
 var OS_CODE = 0x03; // Unix :) . Don't detect, use this default.
 
 function err(strm, errorCode) {
-  strm.msg = _messages["default"][errorCode];
+  strm.msg = msg[errorCode];
   return errorCode;
 }
+
 function rank(f) {
-  return (f << 1) - (f > 4 ? 9 : 0);
-}
-function zero(buf) {
-  var len = buf.length;
-  while (--len >= 0) {
-    buf[len] = 0;
-  }
+  return ((f) << 1) - ((f) > 4 ? 9 : 0);
 }
 
+function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
+
+
 /* =========================================================================
  * Flush as much pending output as possible. All deflate() output goes
  * through this function so some applications may wish to modify it
@@ -135,9 +127,8 @@ function flush_pending(strm) {
   if (len > strm.avail_out) {
     len = strm.avail_out;
   }
-  if (len === 0) {
-    return;
-  }
+  if (len === 0) { return; }
+
   utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
   strm.next_out += len;
   s.pending_out += len;
@@ -148,27 +139,33 @@ function flush_pending(strm) {
     s.pending_out = 0;
   }
 }
+
+
 function flush_block_only(s, last) {
-  trees._tr_flush_block(s, s.block_start >= 0 ? s.block_start : -1, s.strstart - s.block_start, last);
+  trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);
   s.block_start = s.strstart;
   flush_pending(s.strm);
 }
+
+
 function put_byte(s, b) {
   s.pending_buf[s.pending++] = b;
 }
 
+
 /* =========================================================================
  * Put a short in the pending buffer. The 16-bit value is put in MSB order.
  * IN assertion: the stream state is correct and there is enough room in
  * pending_buf.
  */
 function putShortMSB(s, b) {
-  //  put_byte(s, (Byte)(b >> 8));
-  //  put_byte(s, (Byte)(b & 0xff));
-  s.pending_buf[s.pending++] = b >>> 8 & 0xff;
+//  put_byte(s, (Byte)(b >> 8));
+//  put_byte(s, (Byte)(b & 0xff));
+  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;
   s.pending_buf[s.pending++] = b & 0xff;
 }
 
+
 /* ===========================================================================
  * Read a new buffer from the current input stream, update the adler32
  * and total number of bytes read.  All deflate() input goes through
@@ -178,26 +175,29 @@ function putShortMSB(s, b) {
  */
 function read_buf(strm, buf, start, size) {
   var len = strm.avail_in;
-  if (len > size) {
-    len = size;
-  }
-  if (len === 0) {
-    return 0;
-  }
+
+  if (len > size) { len = size; }
+  if (len === 0) { return 0; }
+
   strm.avail_in -= len;
 
   // zmemcpy(buf, strm->next_in, len);
   utils.arraySet(buf, strm.input, strm.next_in, len, start);
   if (strm.state.wrap === 1) {
-    strm.adler = (0, _adler["default"])(strm.adler, buf, len, start);
-  } else if (strm.state.wrap === 2) {
-    strm.adler = (0, _crc["default"])(strm.adler, buf, len, start);
+    strm.adler = adler32(strm.adler, buf, len, start);
   }
+
+  else if (strm.state.wrap === 2) {
+    strm.adler = crc32(strm.adler, buf, len, start);
+  }
+
   strm.next_in += len;
   strm.total_in += len;
+
   return len;
 }
 
+
 /* ===========================================================================
  * Set match_start to the longest match starting at the given string and
  * return its length. Matches shorter or equal to prev_length are discarded,
@@ -208,25 +208,27 @@ function read_buf(strm, buf, start, size) {
  * OUT assertion: the match length is not greater than s->lookahead.
  */
 function longest_match(s, cur_match) {
-  var chain_length = s.max_chain_length; /* max hash chain length */
+  var chain_length = s.max_chain_length;      /* max hash chain length */
   var scan = s.strstart; /* current string */
-  var match; /* matched string */
-  var len; /* length of current match */
-  var best_len = s.prev_length; /* best match length so far */
-  var nice_match = s.nice_match; /* stop if match long enough */
-  var limit = s.strstart > s.w_size - MIN_LOOKAHEAD ? s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0 /*NIL*/;
+  var match;                       /* matched string */
+  var len;                           /* length of current match */
+  var best_len = s.prev_length;              /* best match length so far */
+  var nice_match = s.nice_match;             /* stop if match long enough */
+  var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?
+      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;
+
   var _win = s.window; // shortcut
 
   var wmask = s.w_mask;
-  var prev = s.prev;
+  var prev  = s.prev;
 
   /* Stop when cur_match becomes <= limit. To simplify the code,
    * we prevent matches with the string of window index 0.
    */
 
   var strend = s.strstart + MAX_MATCH;
-  var scan_end1 = _win[scan + best_len - 1];
-  var scan_end = _win[scan + best_len];
+  var scan_end1  = _win[scan + best_len - 1];
+  var scan_end   = _win[scan + best_len];
 
   /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
    * It is easy to get rid of this optimization if necessary.
@@ -240,9 +242,7 @@ function longest_match(s, cur_match) {
   /* Do not look for matches beyond the end of the input. This is necessary
    * to make deflate deterministic.
    */
-  if (nice_match > s.lookahead) {
-    nice_match = s.lookahead;
-  }
+  if (nice_match > s.lookahead) { nice_match = s.lookahead; }
 
   // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
 
@@ -259,7 +259,10 @@ function longest_match(s, cur_match) {
      * the output of deflate is not affected by the uninitialized values.
      */
 
-    if (_win[match + best_len] !== scan_end || _win[match + best_len - 1] !== scan_end1 || _win[match] !== _win[scan] || _win[++match] !== _win[scan + 1]) {
+    if (_win[match + best_len]     !== scan_end  ||
+        _win[match + best_len - 1] !== scan_end1 ||
+        _win[match]                !== _win[scan] ||
+        _win[++match]              !== _win[scan + 1]) {
       continue;
     }
 
@@ -278,28 +281,35 @@ function longest_match(s, cur_match) {
      */
     do {
       // Do nothing
-    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && _win[++scan] === _win[++match] && scan < strend);
+    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&
+             scan < strend);
 
     // Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
 
     len = MAX_MATCH - (strend - scan);
     scan = strend - MAX_MATCH;
+
     if (len > best_len) {
       s.match_start = cur_match;
       best_len = len;
       if (len >= nice_match) {
         break;
       }
-      scan_end1 = _win[scan + best_len - 1];
-      scan_end = _win[scan + best_len];
+      scan_end1  = _win[scan + best_len - 1];
+      scan_end   = _win[scan + best_len];
     }
   } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);
+
   if (best_len <= s.lookahead) {
     return best_len;
   }
   return s.lookahead;
 }
 
+
 /* ===========================================================================
  * Fill the window when the lookahead becomes insufficient.
  * Updates strstart and lookahead.
@@ -333,10 +343,12 @@ function fill_window(s) {
     //    }
     //}
 
+
     /* If the window is almost full and there is insufficient lookahead,
      * move the upper half to the lower one to make room in the upper half.
      */
     if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {
+
       utils.arraySet(s.window, s.window, _w_size, _w_size, 0);
       s.match_start -= _w_size;
       s.strstart -= _w_size;
@@ -354,17 +366,19 @@ function fill_window(s) {
       p = n;
       do {
         m = s.head[--p];
-        s.head[p] = m >= _w_size ? m - _w_size : 0;
+        s.head[p] = (m >= _w_size ? m - _w_size : 0);
       } while (--n);
+
       n = _w_size;
       p = n;
       do {
         m = s.prev[--p];
-        s.prev[p] = m >= _w_size ? m - _w_size : 0;
+        s.prev[p] = (m >= _w_size ? m - _w_size : 0);
         /* If n is not on any hash chain, prev[n] is garbage but
          * its value will never be used.
          */
       } while (--n);
+
       more += _w_size;
     }
     if (s.strm.avail_in === 0) {
@@ -392,13 +406,14 @@ function fill_window(s) {
       s.ins_h = s.window[str];
 
       /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */
-      s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + 1]) & s.hash_mask;
-      //#if MIN_MATCH != 3
-      //        Call update_hash() MIN_MATCH-3 more times
-      //#endif
+      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;
+//#if MIN_MATCH != 3
+//        Call update_hash() MIN_MATCH-3 more times
+//#endif
       while (s.insert) {
         /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
-        s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+
         s.prev[str & s.w_mask] = s.head[s.ins_h];
         s.head[s.ins_h] = str;
         str++;
@@ -411,6 +426,7 @@ function fill_window(s) {
     /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
      * but this is not important since only literal bytes will be emitted.
      */
+
   } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);
 
   /* If the WIN_INIT bytes after the end of the current data have never been
@@ -420,35 +436,35 @@ function fill_window(s) {
    * time through here.  WIN_INIT is set to MAX_MATCH since the longest match
    * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
    */
-  //  if (s.high_water < s.window_size) {
-  //    var curr = s.strstart + s.lookahead;
-  //    var init = 0;
-  //
-  //    if (s.high_water < curr) {
-  //      /* Previous high water mark below current data -- zero WIN_INIT
-  //       * bytes or up to end of window, whichever is less.
-  //       */
-  //      init = s.window_size - curr;
-  //      if (init > WIN_INIT)
-  //        init = WIN_INIT;
-  //      zmemzero(s->window + curr, (unsigned)init);
-  //      s->high_water = curr + init;
-  //    }
-  //    else if (s->high_water < (ulg)curr + WIN_INIT) {
-  //      /* High water mark at or above current data, but below current data
-  //       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
-  //       * to end of window, whichever is less.
-  //       */
-  //      init = (ulg)curr + WIN_INIT - s->high_water;
-  //      if (init > s->window_size - s->high_water)
-  //        init = s->window_size - s->high_water;
-  //      zmemzero(s->window + s->high_water, (unsigned)init);
-  //      s->high_water += init;
-  //    }
-  //  }
-  //
-  //  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
-  //    "not enough room for search");
+//  if (s.high_water < s.window_size) {
+//    var curr = s.strstart + s.lookahead;
+//    var init = 0;
+//
+//    if (s.high_water < curr) {
+//      /* Previous high water mark below current data -- zero WIN_INIT
+//       * bytes or up to end of window, whichever is less.
+//       */
+//      init = s.window_size - curr;
+//      if (init > WIN_INIT)
+//        init = WIN_INIT;
+//      zmemzero(s->window + curr, (unsigned)init);
+//      s->high_water = curr + init;
+//    }
+//    else if (s->high_water < (ulg)curr + WIN_INIT) {
+//      /* High water mark at or above current data, but below current data
+//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
+//       * to end of window, whichever is less.
+//       */
+//      init = (ulg)curr + WIN_INIT - s->high_water;
+//      if (init > s->window_size - s->high_water)
+//        init = s->window_size - s->high_water;
+//      zmemzero(s->window + s->high_water, (unsigned)init);
+//      s->high_water += init;
+//    }
+//  }
+//
+//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
+//    "not enough room for search");
 }
 
 /* ===========================================================================
@@ -465,6 +481,7 @@ function deflate_stored(s, flush) {
    * to pending_buf_size, and each stored block has a 5 byte header:
    */
   var max_block_size = 0xffff;
+
   if (max_block_size > s.pending_buf_size - 5) {
     max_block_size = s.pending_buf_size - 5;
   }
@@ -473,30 +490,33 @@ function deflate_stored(s, flush) {
   for (;;) {
     /* Fill the window as much as possible: */
     if (s.lookahead <= 1) {
+
       //Assert(s->strstart < s->w_size+MAX_DIST(s) ||
       //  s->block_start >= (long)s->w_size, "slide too late");
-      //      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||
-      //        s.block_start >= s.w_size)) {
-      //        throw  new Error("slide too late");
-      //      }
+//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||
+//        s.block_start >= s.w_size)) {
+//        throw  new Error("slide too late");
+//      }
 
       fill_window(s);
       if (s.lookahead === 0 && flush === Z_NO_FLUSH) {
         return BS_NEED_MORE;
       }
+
       if (s.lookahead === 0) {
         break;
       }
       /* flush the current block */
     }
     //Assert(s->block_start >= 0L, "block gone");
-    //    if (s.block_start < 0) throw new Error("block gone");
+//    if (s.block_start < 0) throw new Error("block gone");
 
     s.strstart += s.lookahead;
     s.lookahead = 0;
 
     /* Emit a stored block if pending_buf will be full: */
     var max_start = s.block_start + max_block_size;
+
     if (s.strstart === 0 || s.strstart >= max_start) {
       /* strstart == 0 is possible when wraparound on 16-bit machine */
       s.lookahead = s.strstart - max_start;
@@ -507,11 +527,13 @@ function deflate_stored(s, flush) {
         return BS_NEED_MORE;
       }
       /***/
+
+
     }
     /* Flush if we may have to slide, otherwise block_start may become
      * negative and the data will be gone:
      */
-    if (s.strstart - s.block_start >= s.w_size - MIN_LOOKAHEAD) {
+    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {
       /*** FLUSH_BLOCK(s, 0); ***/
       flush_block_only(s, false);
       if (s.strm.avail_out === 0) {
@@ -520,7 +542,9 @@ function deflate_stored(s, flush) {
       /***/
     }
   }
+
   s.insert = 0;
+
   if (flush === Z_FINISH) {
     /*** FLUSH_BLOCK(s, 1); ***/
     flush_block_only(s, true);
@@ -530,6 +554,7 @@ function deflate_stored(s, flush) {
     /***/
     return BS_FINISH_DONE;
   }
+
   if (s.strstart > s.block_start) {
     /*** FLUSH_BLOCK(s, 0); ***/
     flush_block_only(s, false);
@@ -538,6 +563,7 @@ function deflate_stored(s, flush) {
     }
     /***/
   }
+
   return BS_NEED_MORE;
 }
 
@@ -549,8 +575,8 @@ function deflate_stored(s, flush) {
  * matches. It is used only for the fast compression options.
  */
 function deflate_fast(s, flush) {
-  var hash_head; /* head of the hash chain */
-  var bflush; /* set if current block must be flushed */
+  var hash_head;        /* head of the hash chain */
+  var bflush;           /* set if current block must be flushed */
 
   for (;;) {
     /* Make sure that we always have enough lookahead, except
@@ -571,10 +597,10 @@ function deflate_fast(s, flush) {
     /* Insert the string window[strstart .. strstart+2] in the
      * dictionary, and set hash_head to the head of the hash chain:
      */
-    hash_head = 0 /*NIL*/;
+    hash_head = 0/*NIL*/;
     if (s.lookahead >= MIN_MATCH) {
       /*** INSERT_STRING(s, s.strstart, hash_head); ***/
-      s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
       hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
       s.head[s.ins_h] = s.strstart;
       /***/
@@ -583,7 +609,7 @@ function deflate_fast(s, flush) {
     /* Find the longest match, discarding those <= prev_length.
      * At this point we have always match_length < MIN_MATCH
      */
-    if (hash_head !== 0 /*NIL*/ && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD) {
+    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {
       /* To simplify the code, we prevent matches with the string
        * of window index 0 (in particular we have to avoid a match
        * of the string with itself at the start of the input file).
@@ -597,17 +623,18 @@ function deflate_fast(s, flush) {
       /*** _tr_tally_dist(s, s.strstart - s.match_start,
                      s.match_length - MIN_MATCH, bflush); ***/
       bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);
+
       s.lookahead -= s.match_length;
 
       /* Insert new strings in the hash table only if the match length
        * is not too large. This saves time but degrades compression.
        */
-      if (s.match_length <= s.max_lazy_match /*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
+      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {
         s.match_length--; /* string at strstart already in table */
         do {
           s.strstart++;
           /*** INSERT_STRING(s, s.strstart, hash_head); ***/
-          s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
           hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
           s.head[s.ins_h] = s.strstart;
           /***/
@@ -616,16 +643,17 @@ function deflate_fast(s, flush) {
            */
         } while (--s.match_length !== 0);
         s.strstart++;
-      } else {
+      } else
+      {
         s.strstart += s.match_length;
         s.match_length = 0;
         s.ins_h = s.window[s.strstart];
         /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */
-        s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + 1]) & s.hash_mask;
+        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;
 
-        //#if MIN_MATCH != 3
-        //                Call UPDATE_HASH() MIN_MATCH-3 more times
-        //#endif
+//#if MIN_MATCH != 3
+//                Call UPDATE_HASH() MIN_MATCH-3 more times
+//#endif
         /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
          * matter since it will be recomputed at next deflate call.
          */
@@ -635,6 +663,7 @@ function deflate_fast(s, flush) {
       //Tracevv((stderr,"%c", s.window[s.strstart]));
       /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
       bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+
       s.lookahead--;
       s.strstart++;
     }
@@ -647,7 +676,7 @@ function deflate_fast(s, flush) {
       /***/
     }
   }
-  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
+  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);
   if (flush === Z_FINISH) {
     /*** FLUSH_BLOCK(s, 1); ***/
     flush_block_only(s, true);
@@ -674,8 +703,8 @@ function deflate_fast(s, flush) {
  * no better match at the next window position.
  */
 function deflate_slow(s, flush) {
-  var hash_head; /* head of hash chain */
-  var bflush; /* set if current block must be flushed */
+  var hash_head;          /* head of hash chain */
+  var bflush;              /* set if current block must be flushed */
 
   var max_insert;
 
@@ -691,18 +720,16 @@ function deflate_slow(s, flush) {
       if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {
         return BS_NEED_MORE;
       }
-      if (s.lookahead === 0) {
-        break;
-      } /* flush the current block */
+      if (s.lookahead === 0) { break; } /* flush the current block */
     }
 
     /* Insert the string window[strstart .. strstart+2] in the
      * dictionary, and set hash_head to the head of the hash chain:
      */
-    hash_head = 0 /*NIL*/;
+    hash_head = 0/*NIL*/;
     if (s.lookahead >= MIN_MATCH) {
       /*** INSERT_STRING(s, s.strstart, hash_head); ***/
-      s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
       hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
       s.head[s.ins_h] = s.strstart;
       /***/
@@ -713,7 +740,9 @@ function deflate_slow(s, flush) {
     s.prev_length = s.match_length;
     s.prev_match = s.match_start;
     s.match_length = MIN_MATCH - 1;
-    if (hash_head !== 0 /*NIL*/ && s.prev_length < s.max_lazy_match && s.strstart - hash_head <= s.w_size - MIN_LOOKAHEAD /*MAX_DIST(s)*/) {
+
+    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&
+        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {
       /* To simplify the code, we prevent matches with the string
        * of window index 0 (in particular we have to avoid a match
        * of the string with itself at the start of the input file).
@@ -721,7 +750,9 @@ function deflate_slow(s, flush) {
       s.match_length = longest_match(s, hash_head);
       /* longest_match() sets match_start */
 
-      if (s.match_length <= 5 && (s.strategy === Z_FILTERED || s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096 /*TOO_FAR*/)) {
+      if (s.match_length <= 5 &&
+         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {
+
         /* If prev_match is also MIN_MATCH, match_start is garbage
          * but we will ignore the current match anyway.
          */
@@ -750,7 +781,7 @@ function deflate_slow(s, flush) {
       do {
         if (++s.strstart <= max_insert) {
           /*** INSERT_STRING(s, s.strstart, hash_head); ***/
-          s.ins_h = (s.ins_h << s.hash_shift ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
+          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;
           hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];
           s.head[s.ins_h] = s.strstart;
           /***/
@@ -759,6 +790,7 @@ function deflate_slow(s, flush) {
       s.match_available = 0;
       s.match_length = MIN_MATCH - 1;
       s.strstart++;
+
       if (bflush) {
         /*** FLUSH_BLOCK(s, 0); ***/
         flush_block_only(s, false);
@@ -767,6 +799,7 @@ function deflate_slow(s, flush) {
         }
         /***/
       }
+
     } else if (s.match_available) {
       /* If there was no match at the previous position, output a
        * single literal. If there was a match but the current match
@@ -775,6 +808,7 @@ function deflate_slow(s, flush) {
       //Tracevv((stderr,"%c", s->window[s->strstart-1]));
       /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
       bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
+
       if (bflush) {
         /*** FLUSH_BLOCK_ONLY(s, 0) ***/
         flush_block_only(s, false);
@@ -799,6 +833,7 @@ function deflate_slow(s, flush) {
     //Tracevv((stderr,"%c", s->window[s->strstart-1]));
     /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/
     bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);
+
     s.match_available = 0;
   }
   s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;
@@ -819,20 +854,23 @@ function deflate_slow(s, flush) {
     }
     /***/
   }
+
   return BS_BLOCK_DONE;
 }
 
+
 /* ===========================================================================
  * For Z_RLE, simply look for runs of bytes, generate matches only of distance
  * one.  Do not maintain a hash table.  (It will be regenerated if this run of
  * deflate switches away from Z_RLE.)
  */
 function deflate_rle(s, flush) {
-  var bflush; /* set if current block must be flushed */
-  var prev; /* byte at distance one to match */
-  var scan, strend; /* scan goes up to strend for length of run */
+  var bflush;            /* set if current block must be flushed */
+  var prev;              /* byte at distance one to match */
+  var scan, strend;      /* scan goes up to strend for length of run */
 
   var _win = s.window;
+
   for (;;) {
     /* Make sure that we always have enough lookahead, except
      * at the end of the input file. We need MAX_MATCH bytes
@@ -843,9 +881,7 @@ function deflate_rle(s, flush) {
       if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {
         return BS_NEED_MORE;
       }
-      if (s.lookahead === 0) {
-        break;
-      } /* flush the current block */
+      if (s.lookahead === 0) { break; } /* flush the current block */
     }
 
     /* See how many times the previous byte repeats */
@@ -857,7 +893,11 @@ function deflate_rle(s, flush) {
         strend = s.strstart + MAX_MATCH;
         do {
           // Do nothing
-        } while (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan] && scan < strend);
+        } while (prev === _win[++scan] && prev === _win[++scan] &&
+                 prev === _win[++scan] && prev === _win[++scan] &&
+                 prev === _win[++scan] && prev === _win[++scan] &&
+                 prev === _win[++scan] && prev === _win[++scan] &&
+                 scan < strend);
         s.match_length = MAX_MATCH - (strend - scan);
         if (s.match_length > s.lookahead) {
           s.match_length = s.lookahead;
@@ -872,6 +912,7 @@ function deflate_rle(s, flush) {
 
       /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/
       bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);
+
       s.lookahead -= s.match_length;
       s.strstart += s.match_length;
       s.match_length = 0;
@@ -880,6 +921,7 @@ function deflate_rle(s, flush) {
       //Tracevv((stderr,"%c", s->window[s->strstart]));
       /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/
       bflush = trees._tr_tally(s, 0, s.window[s.strstart]);
+
       s.lookahead--;
       s.strstart++;
     }
@@ -918,7 +960,7 @@ function deflate_rle(s, flush) {
  * (It will be regenerated if this run of deflate switches away from Huffman.)
  */
 function deflate_huff(s, flush) {
-  var bflush; /* set if current block must be flushed */
+  var bflush;             /* set if current block must be flushed */
 
   for (;;) {
     /* Make sure that we have a literal to write. */
@@ -928,7 +970,7 @@ function deflate_huff(s, flush) {
         if (flush === Z_NO_FLUSH) {
           return BS_NEED_MORE;
         }
-        break; /* flush the current block */
+        break;      /* flush the current block */
       }
     }
 
@@ -981,19 +1023,24 @@ function Config(good_length, max_lazy, nice_length, max_chain, func) {
   this.max_chain = max_chain;
   this.func = func;
 }
+
 var configuration_table;
-configuration_table = [/*      good lazy nice chain */
-new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */
-new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */
-new Config(4, 5, 16, 8, deflate_fast), /* 2 */
-new Config(4, 6, 32, 32, deflate_fast), /* 3 */
-
-new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */
-new Config(8, 16, 32, 32, deflate_slow), /* 5 */
-new Config(8, 16, 128, 128, deflate_slow), /* 6 */
-new Config(8, 32, 128, 256, deflate_slow), /* 7 */
-new Config(32, 128, 258, 1024, deflate_slow), /* 8 */
-new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */];
+
+configuration_table = [
+  /*      good lazy nice chain */
+  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */
+  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */
+  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */
+  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */
+
+  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */
+  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */
+  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */
+  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */
+  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */
+  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */
+];
+
 
 /* ===========================================================================
  * Initialize the "longest match" routines for a new zlib stream
@@ -1010,6 +1057,7 @@ function lm_init(s) {
   s.good_match = configuration_table[s.level].good_length;
   s.nice_match = configuration_table[s.level].nice_length;
   s.max_chain_length = configuration_table[s.level].max_chain;
+
   s.strstart = 0;
   s.block_start = 0;
   s.lookahead = 0;
@@ -1018,22 +1066,24 @@ function lm_init(s) {
   s.match_available = 0;
   s.ins_h = 0;
 }
+
+
 function DeflateState() {
-  this.strm = null; /* pointer back to this zlib stream */
-  this.status = 0; /* as the name implies */
-  this.pending_buf = null; /* output still pending */
-  this.pending_buf_size = 0; /* size of pending_buf */
-  this.pending_out = 0; /* next pending byte to output to the stream */
-  this.pending = 0; /* nb of bytes in the pending buffer */
-  this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */
-  this.gzhead = null; /* gzip header information to write */
-  this.gzindex = 0; /* where in extra, name, or comment */
+  this.strm = null;            /* pointer back to this zlib stream */
+  this.status = 0;            /* as the name implies */
+  this.pending_buf = null;      /* output still pending */
+  this.pending_buf_size = 0;  /* size of pending_buf */
+  this.pending_out = 0;       /* next pending byte to output to the stream */
+  this.pending = 0;           /* nb of bytes in the pending buffer */
+  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */
+  this.gzhead = null;         /* gzip header information to write */
+  this.gzindex = 0;           /* where in extra, name, or comment */
   this.method = Z_DEFLATED; /* can only be DEFLATED */
-  this.last_flush = -1; /* value of flush param for previous deflate call */
+  this.last_flush = -1;   /* value of flush param for previous deflate call */
 
-  this.w_size = 0; /* LZ77 window size (32K by default) */
-  this.w_bits = 0; /* log2(w_size)  (8..16) */
-  this.w_mask = 0; /* w_size - 1 */
+  this.w_size = 0;  /* LZ77 window size (32K by default) */
+  this.w_bits = 0;  /* log2(w_size)  (8..16) */
+  this.w_mask = 0;  /* w_size - 1 */
 
   this.window = null;
   /* Sliding window. Input bytes are read into the second half of the window,
@@ -1054,12 +1104,12 @@ function DeflateState() {
    * An index in this array is thus a window index modulo 32K.
    */
 
-  this.head = null; /* Heads of the hash chains or NIL. */
+  this.head = null;   /* Heads of the hash chains or NIL. */
 
-  this.ins_h = 0; /* hash index of string to be inserted */
-  this.hash_size = 0; /* number of elements in hash table */
-  this.hash_bits = 0; /* log2(hash_size) */
-  this.hash_mask = 0; /* hash_size-1 */
+  this.ins_h = 0;       /* hash index of string to be inserted */
+  this.hash_size = 0;   /* number of elements in hash table */
+  this.hash_bits = 0;   /* log2(hash_size) */
+  this.hash_mask = 0;   /* hash_size-1 */
 
   this.hash_shift = 0;
   /* Number of bits by which ins_h must be shifted at each input
@@ -1073,12 +1123,12 @@ function DeflateState() {
    * negative when the window is moved backwards.
    */
 
-  this.match_length = 0; /* length of best match */
-  this.prev_match = 0; /* previous match */
-  this.match_available = 0; /* set if previous match exists */
-  this.strstart = 0; /* start of string to insert */
-  this.match_start = 0; /* start of matching string */
-  this.lookahead = 0; /* number of valid bytes ahead in window */
+  this.match_length = 0;      /* length of best match */
+  this.prev_match = 0;        /* previous match */
+  this.match_available = 0;   /* set if previous match exists */
+  this.strstart = 0;          /* start of string to insert */
+  this.match_start = 0;       /* start of matching string */
+  this.lookahead = 0;         /* number of valid bytes ahead in window */
 
   this.prev_length = 0;
   /* Length of the best match at previous step. Matches not greater than this
@@ -1103,15 +1153,15 @@ function DeflateState() {
    * max_insert_length is used only for compression levels <= 3.
    */
 
-  this.level = 0; /* compression level (1..9) */
-  this.strategy = 0; /* favor or force Huffman coding*/
+  this.level = 0;     /* compression level (1..9) */
+  this.strategy = 0;  /* favor or force Huffman coding*/
 
   this.good_match = 0;
   /* Use a faster search when the previous match is longer than this */
 
   this.nice_match = 0; /* Stop searching when current match exceeds this */
 
-  /* used by trees.c: */
+              /* used by trees.c: */
 
   /* Didn't use ct_data typedef below to suppress compiler warning */
 
@@ -1121,25 +1171,27 @@ function DeflateState() {
 
   // Use flat array of DOUBLE size, with interleaved fata,
   // because JS does not support effective
-  this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2);
-  this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2);
-  this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2);
+  this.dyn_ltree  = new utils.Buf16(HEAP_SIZE * 2);
+  this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);
+  this.bl_tree    = new utils.Buf16((2 * BL_CODES + 1) * 2);
   zero(this.dyn_ltree);
   zero(this.dyn_dtree);
   zero(this.bl_tree);
-  this.l_desc = null; /* desc. for literal tree */
-  this.d_desc = null; /* desc. for distance tree */
-  this.bl_desc = null; /* desc. for bit length tree */
+
+  this.l_desc   = null;         /* desc. for literal tree */
+  this.d_desc   = null;         /* desc. for distance tree */
+  this.bl_desc  = null;         /* desc. for bit length tree */
 
   //ush bl_count[MAX_BITS+1];
   this.bl_count = new utils.Buf16(MAX_BITS + 1);
   /* number of codes at each bit length for an optimal tree */
 
   //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
-  this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */
+  this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */
   zero(this.heap);
-  this.heap_len = 0; /* number of elements in the heap */
-  this.heap_max = 0; /* element of largest frequency */
+
+  this.heap_len = 0;               /* number of elements in the heap */
+  this.heap_max = 0;               /* element of largest frequency */
   /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
    * The same heap array is used to build all trees.
    */
@@ -1149,7 +1201,7 @@ function DeflateState() {
   /* Depth of each subtree used as tie breaker for trees of equal frequency
    */
 
-  this.l_buf = 0; /* buffer index for literals or lengths */
+  this.l_buf = 0;          /* buffer index for literals or lengths */
 
   this.lit_bufsize = 0;
   /* Size of match buffer for literals/lengths.  There are 4 reasons for
@@ -1171,7 +1223,7 @@ function DeflateState() {
    *   - I can't count above 4
    */
 
-  this.last_lit = 0; /* running index in l_buf */
+  this.last_lit = 0;      /* running index in l_buf */
 
   this.d_buf = 0;
   /* Buffer index for distances. To simplify the code, d_buf and l_buf have
@@ -1179,10 +1231,11 @@ function DeflateState() {
    * array would be necessary.
    */
 
-  this.opt_len = 0; /* bit length of current block with optimal trees */
-  this.static_len = 0; /* bit length of current block with static trees */
-  this.matches = 0; /* number of string matches in current block */
-  this.insert = 0; /* bytes at end of window left to insert */
+  this.opt_len = 0;       /* bit length of current block with optimal trees */
+  this.static_len = 0;    /* bit length of current block with static trees */
+  this.matches = 0;       /* number of string matches in current block */
+  this.insert = 0;        /* bytes at end of window left to insert */
+
 
   this.bi_buf = 0;
   /* Output buffer. bits are inserted starting at the bottom (least
@@ -1202,27 +1255,37 @@ function DeflateState() {
    * updated to the new high water mark.
    */
 }
+
+
 function deflateResetKeep(strm) {
   var s;
+
   if (!strm || !strm.state) {
     return err(strm, Z_STREAM_ERROR);
   }
+
   strm.total_in = strm.total_out = 0;
   strm.data_type = Z_UNKNOWN;
+
   s = strm.state;
   s.pending = 0;
   s.pending_out = 0;
+
   if (s.wrap < 0) {
     s.wrap = -s.wrap;
     /* was made negative by deflate(..., Z_FINISH); */
   }
-  s.status = s.wrap ? INIT_STATE : BUSY_STATE;
-  strm.adler = s.wrap === 2 ? 0 // crc32(0, Z_NULL, 0)
-  : 1; // adler32(0, Z_NULL, 0)
+  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);
+  strm.adler = (s.wrap === 2) ?
+    0  // crc32(0, Z_NULL, 0)
+  :
+    1; // adler32(0, Z_NULL, 0)
   s.last_flush = Z_NO_FLUSH;
   trees._tr_init(s);
   return Z_OK;
 }
+
+
 function deflateReset(strm) {
   var ret = deflateResetKeep(strm);
   if (ret === Z_OK) {
@@ -1230,53 +1293,65 @@ function deflateReset(strm) {
   }
   return ret;
 }
+
+
 function deflateSetHeader(strm, head) {
-  if (!strm || !strm.state) {
-    return Z_STREAM_ERROR;
-  }
-  if (strm.state.wrap !== 2) {
-    return Z_STREAM_ERROR;
-  }
+  if (!strm || !strm.state) { return Z_STREAM_ERROR; }
+  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }
   strm.state.gzhead = head;
   return Z_OK;
 }
+
+
 function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
-  if (!strm) {
-    // === Z_NULL
+  if (!strm) { // === Z_NULL
     return Z_STREAM_ERROR;
   }
   var wrap = 1;
+
   if (level === Z_DEFAULT_COMPRESSION) {
     level = 6;
   }
-  if (windowBits < 0) {
-    /* suppress zlib wrapper */
+
+  if (windowBits < 0) { /* suppress zlib wrapper */
     wrap = 0;
     windowBits = -windowBits;
-  } else if (windowBits > 15) {
-    wrap = 2; /* write gzip wrapper instead */
+  }
+
+  else if (windowBits > 15) {
+    wrap = 2;           /* write gzip wrapper instead */
     windowBits -= 16;
   }
-  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
+
+
+  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||
+    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
+    strategy < 0 || strategy > Z_FIXED) {
     return err(strm, Z_STREAM_ERROR);
   }
+
+
   if (windowBits === 8) {
     windowBits = 9;
   }
   /* until 256-byte window bug fixed */
 
   var s = new DeflateState();
+
   strm.state = s;
   s.strm = strm;
+
   s.wrap = wrap;
   s.gzhead = null;
   s.w_bits = windowBits;
   s.w_size = 1 << s.w_bits;
   s.w_mask = s.w_size - 1;
+
   s.hash_bits = memLevel + 7;
   s.hash_size = 1 << s.hash_bits;
   s.hash_mask = s.hash_size - 1;
   s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);
+
   s.window = new utils.Buf8(s.w_size * 2);
   s.head = new utils.Buf16(s.hash_size);
   s.prev = new utils.Buf16(s.w_size);
@@ -1284,7 +1359,7 @@ function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
   // Don't need mem init magic for JS.
   //s.high_water = 0;  /* nothing written to s->window yet */
 
-  s.lit_bufsize = 1 << memLevel + 6; /* 16K elements by default */
+  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */
 
   s.pending_buf_size = s.lit_bufsize * 4;
 
@@ -1298,105 +1373,125 @@ function deflateInit2(strm, level, method, windowBits, memLevel, strategy) {
 
   //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
   s.l_buf = (1 + 2) * s.lit_bufsize;
+
   s.level = level;
   s.strategy = strategy;
   s.method = method;
+
   return deflateReset(strm);
 }
+
 function deflateInit(strm, level) {
   return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);
 }
+
+
 function deflate(strm, flush) {
   var old_flush, s;
   var beg, val; // for gzip header write only
 
-  if (!strm || !strm.state || flush > Z_BLOCK || flush < 0) {
+  if (!strm || !strm.state ||
+    flush > Z_BLOCK || flush < 0) {
     return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;
   }
+
   s = strm.state;
-  if (!strm.output || !strm.input && strm.avail_in !== 0 || s.status === FINISH_STATE && flush !== Z_FINISH) {
-    return err(strm, strm.avail_out === 0 ? Z_BUF_ERROR : Z_STREAM_ERROR);
+
+  if (!strm.output ||
+      (!strm.input && strm.avail_in !== 0) ||
+      (s.status === FINISH_STATE && flush !== Z_FINISH)) {
+    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);
   }
+
   s.strm = strm; /* just in case */
   old_flush = s.last_flush;
   s.last_flush = flush;
 
   /* Write the header */
   if (s.status === INIT_STATE) {
-    if (s.wrap === 2) {
-      // GZIP header
-      strm.adler = 0; //crc32(0L, Z_NULL, 0);
+
+    if (s.wrap === 2) { // GZIP header
+      strm.adler = 0;  //crc32(0L, Z_NULL, 0);
       put_byte(s, 31);
       put_byte(s, 139);
       put_byte(s, 8);
-      if (!s.gzhead) {
-        // s->gzhead == Z_NULL
+      if (!s.gzhead) { // s->gzhead == Z_NULL
         put_byte(s, 0);
         put_byte(s, 0);
         put_byte(s, 0);
         put_byte(s, 0);
         put_byte(s, 0);
-        put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);
+        put_byte(s, s.level === 9 ? 2 :
+                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
+                     4 : 0));
         put_byte(s, OS_CODE);
         s.status = BUSY_STATE;
-      } else {
-        put_byte(s, (s.gzhead.text ? 1 : 0) + (s.gzhead.hcrc ? 2 : 0) + (!s.gzhead.extra ? 0 : 4) + (!s.gzhead.name ? 0 : 8) + (!s.gzhead.comment ? 0 : 16));
+      }
+      else {
+        put_byte(s, (s.gzhead.text ? 1 : 0) +
+                    (s.gzhead.hcrc ? 2 : 0) +
+                    (!s.gzhead.extra ? 0 : 4) +
+                    (!s.gzhead.name ? 0 : 8) +
+                    (!s.gzhead.comment ? 0 : 16)
+                );
         put_byte(s, s.gzhead.time & 0xff);
-        put_byte(s, s.gzhead.time >> 8 & 0xff);
-        put_byte(s, s.gzhead.time >> 16 & 0xff);
-        put_byte(s, s.gzhead.time >> 24 & 0xff);
-        put_byte(s, s.level === 9 ? 2 : s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? 4 : 0);
+        put_byte(s, (s.gzhead.time >> 8) & 0xff);
+        put_byte(s, (s.gzhead.time >> 16) & 0xff);
+        put_byte(s, (s.gzhead.time >> 24) & 0xff);
+        put_byte(s, s.level === 9 ? 2 :
+                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?
+                     4 : 0));
         put_byte(s, s.gzhead.os & 0xff);
         if (s.gzhead.extra && s.gzhead.extra.length) {
           put_byte(s, s.gzhead.extra.length & 0xff);
-          put_byte(s, s.gzhead.extra.length >> 8 & 0xff);
+          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);
         }
         if (s.gzhead.hcrc) {
-          strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending, 0);
+          strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);
         }
         s.gzindex = 0;
         s.status = EXTRA_STATE;
       }
-    } else
-      // DEFLATE header
-      {
-        var header = Z_DEFLATED + (s.w_bits - 8 << 4) << 8;
-        var level_flags = -1;
-        if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
-          level_flags = 0;
-        } else if (s.level < 6) {
-          level_flags = 1;
-        } else if (s.level === 6) {
-          level_flags = 2;
-        } else {
-          level_flags = 3;
-        }
-        header |= level_flags << 6;
-        if (s.strstart !== 0) {
-          header |= PRESET_DICT;
-        }
-        header += 31 - header % 31;
-        s.status = BUSY_STATE;
-        putShortMSB(s, header);
+    }
+    else // DEFLATE header
+    {
+      var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;
+      var level_flags = -1;
+
+      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {
+        level_flags = 0;
+      } else if (s.level < 6) {
+        level_flags = 1;
+      } else if (s.level === 6) {
+        level_flags = 2;
+      } else {
+        level_flags = 3;
+      }
+      header |= (level_flags << 6);
+      if (s.strstart !== 0) { header |= PRESET_DICT; }
+      header += 31 - (header % 31);
 
-        /* Save the adler32 of the preset dictionary: */
-        if (s.strstart !== 0) {
-          putShortMSB(s, strm.adler >>> 16);
-          putShortMSB(s, strm.adler & 0xffff);
-        }
-        strm.adler = 1; // adler32(0L, Z_NULL, 0);
+      s.status = BUSY_STATE;
+      putShortMSB(s, header);
+
+      /* Save the adler32 of the preset dictionary: */
+      if (s.strstart !== 0) {
+        putShortMSB(s, strm.adler >>> 16);
+        putShortMSB(s, strm.adler & 0xffff);
       }
+      strm.adler = 1; // adler32(0L, Z_NULL, 0);
+    }
   }
 
-  //#ifdef GZIP
+//#ifdef GZIP
   if (s.status === EXTRA_STATE) {
-    if (s.gzhead.extra /* != Z_NULL*/) {
-      beg = s.pending; /* start of bytes to update crc */
+    if (s.gzhead.extra/* != Z_NULL*/) {
+      beg = s.pending;  /* start of bytes to update crc */
 
       while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {
         if (s.pending === s.pending_buf_size) {
           if (s.gzhead.hcrc && s.pending > beg) {
-            strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending - beg, beg);
+            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
           }
           flush_pending(strm);
           beg = s.pending;
@@ -1408,25 +1503,26 @@ function deflate(strm, flush) {
         s.gzindex++;
       }
       if (s.gzhead.hcrc && s.pending > beg) {
-        strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending - beg, beg);
+        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
       }
       if (s.gzindex === s.gzhead.extra.length) {
         s.gzindex = 0;
         s.status = NAME_STATE;
       }
-    } else {
+    }
+    else {
       s.status = NAME_STATE;
     }
   }
   if (s.status === NAME_STATE) {
-    if (s.gzhead.name /* != Z_NULL*/) {
-      beg = s.pending; /* start of bytes to update crc */
+    if (s.gzhead.name/* != Z_NULL*/) {
+      beg = s.pending;  /* start of bytes to update crc */
       //int val;
 
       do {
         if (s.pending === s.pending_buf_size) {
           if (s.gzhead.hcrc && s.pending > beg) {
-            strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending - beg, beg);
+            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
           }
           flush_pending(strm);
           beg = s.pending;
@@ -1443,26 +1539,28 @@ function deflate(strm, flush) {
         }
         put_byte(s, val);
       } while (val !== 0);
+
       if (s.gzhead.hcrc && s.pending > beg) {
-        strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending - beg, beg);
+        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
       }
       if (val === 0) {
         s.gzindex = 0;
         s.status = COMMENT_STATE;
       }
-    } else {
+    }
+    else {
       s.status = COMMENT_STATE;
     }
   }
   if (s.status === COMMENT_STATE) {
-    if (s.gzhead.comment /* != Z_NULL*/) {
-      beg = s.pending; /* start of bytes to update crc */
+    if (s.gzhead.comment/* != Z_NULL*/) {
+      beg = s.pending;  /* start of bytes to update crc */
       //int val;
 
       do {
         if (s.pending === s.pending_buf_size) {
           if (s.gzhead.hcrc && s.pending > beg) {
-            strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending - beg, beg);
+            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
           }
           flush_pending(strm);
           beg = s.pending;
@@ -1479,13 +1577,15 @@ function deflate(strm, flush) {
         }
         put_byte(s, val);
       } while (val !== 0);
+
       if (s.gzhead.hcrc && s.pending > beg) {
-        strm.adler = (0, _crc["default"])(strm.adler, s.pending_buf, s.pending - beg, beg);
+        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);
       }
       if (val === 0) {
         s.status = HCRC_STATE;
       }
-    } else {
+    }
+    else {
       s.status = HCRC_STATE;
     }
   }
@@ -1496,15 +1596,16 @@ function deflate(strm, flush) {
       }
       if (s.pending + 2 <= s.pending_buf_size) {
         put_byte(s, strm.adler & 0xff);
-        put_byte(s, strm.adler >> 8 & 0xff);
+        put_byte(s, (strm.adler >> 8) & 0xff);
         strm.adler = 0; //crc32(0L, Z_NULL, 0);
         s.status = BUSY_STATE;
       }
-    } else {
+    }
+    else {
       s.status = BUSY_STATE;
     }
   }
-  //#endif
+//#endif
 
   /* Flush as much pending output as possible */
   if (s.pending !== 0) {
@@ -1524,7 +1625,8 @@ function deflate(strm, flush) {
      * flushes. For repeated and useless calls with Z_FINISH, we keep
      * returning Z_STREAM_END instead of Z_BUF_ERROR.
      */
-  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && flush !== Z_FINISH) {
+  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&
+    flush !== Z_FINISH) {
     return err(strm, Z_BUF_ERROR);
   }
 
@@ -1535,8 +1637,12 @@ function deflate(strm, flush) {
 
   /* Start a new block or continue the current one.
    */
-  if (strm.avail_in !== 0 || s.lookahead !== 0 || flush !== Z_NO_FLUSH && s.status !== FINISH_STATE) {
-    var bstate = s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) : s.strategy === Z_RLE ? deflate_rle(s, flush) : configuration_table[s.level].func(s, flush);
+  if (strm.avail_in !== 0 || s.lookahead !== 0 ||
+    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {
+    var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :
+      (s.strategy === Z_RLE ? deflate_rle(s, flush) :
+        configuration_table[s.level].func(s, flush));
+
     if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {
       s.status = FINISH_STATE;
     }
@@ -1557,15 +1663,15 @@ function deflate(strm, flush) {
     if (bstate === BS_BLOCK_DONE) {
       if (flush === Z_PARTIAL_FLUSH) {
         trees._tr_align(s);
-      } else if (flush !== Z_BLOCK) {
-        /* FULL_FLUSH or SYNC_FLUSH */
+      }
+      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */
 
         trees._tr_stored_block(s, 0, 0, false);
         /* For a full flush, this empty block will be recognized
          * as a special marker by inflate_sync().
          */
         if (flush === Z_FULL_FLUSH) {
-          /*** CLEAR_HASH(s); ***/ /* forget history */
+          /*** CLEAR_HASH(s); ***/             /* forget history */
           zero(s.head); // Fill with NIL (= 0);
 
           if (s.lookahead === 0) {
@@ -1585,56 +1691,67 @@ function deflate(strm, flush) {
   //Assert(strm->avail_out > 0, "bug2");
   //if (strm.avail_out <= 0) { throw new Error("bug2");}
 
-  if (flush !== Z_FINISH) {
-    return Z_OK;
-  }
-  if (s.wrap <= 0) {
-    return Z_STREAM_END;
-  }
+  if (flush !== Z_FINISH) { return Z_OK; }
+  if (s.wrap <= 0) { return Z_STREAM_END; }
 
   /* Write the trailer */
   if (s.wrap === 2) {
     put_byte(s, strm.adler & 0xff);
-    put_byte(s, strm.adler >> 8 & 0xff);
-    put_byte(s, strm.adler >> 16 & 0xff);
-    put_byte(s, strm.adler >> 24 & 0xff);
+    put_byte(s, (strm.adler >> 8) & 0xff);
+    put_byte(s, (strm.adler >> 16) & 0xff);
+    put_byte(s, (strm.adler >> 24) & 0xff);
     put_byte(s, strm.total_in & 0xff);
-    put_byte(s, strm.total_in >> 8 & 0xff);
-    put_byte(s, strm.total_in >> 16 & 0xff);
-    put_byte(s, strm.total_in >> 24 & 0xff);
-  } else {
+    put_byte(s, (strm.total_in >> 8) & 0xff);
+    put_byte(s, (strm.total_in >> 16) & 0xff);
+    put_byte(s, (strm.total_in >> 24) & 0xff);
+  }
+  else
+  {
     putShortMSB(s, strm.adler >>> 16);
     putShortMSB(s, strm.adler & 0xffff);
   }
+
   flush_pending(strm);
   /* If avail_out is zero, the application will call deflate again
    * to flush the rest.
    */
-  if (s.wrap > 0) {
-    s.wrap = -s.wrap;
-  }
+  if (s.wrap > 0) { s.wrap = -s.wrap; }
   /* write the trailer only once! */
   return s.pending !== 0 ? Z_OK : Z_STREAM_END;
 }
+
 function deflateEnd(strm) {
   var status;
-  if (!strm /*== Z_NULL*/ || !strm.state /*== Z_NULL*/) {
+
+  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
     return Z_STREAM_ERROR;
   }
+
   status = strm.state.status;
-  if (status !== INIT_STATE && status !== EXTRA_STATE && status !== NAME_STATE && status !== COMMENT_STATE && status !== HCRC_STATE && status !== BUSY_STATE && status !== FINISH_STATE) {
+  if (status !== INIT_STATE &&
+    status !== EXTRA_STATE &&
+    status !== NAME_STATE &&
+    status !== COMMENT_STATE &&
+    status !== HCRC_STATE &&
+    status !== BUSY_STATE &&
+    status !== FINISH_STATE
+  ) {
     return err(strm, Z_STREAM_ERROR);
   }
+
   strm.state = null;
+
   return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;
 }
 
+
 /* =========================================================================
  * Initializes the compression dictionary from the given byte
  * sequence without producing any compressed output.
  */
 function deflateSetDictionary(strm, dictionary) {
   var dictLength = dictionary.length;
+
   var s;
   var str, n;
   var wrap;
@@ -1642,26 +1759,29 @@ function deflateSetDictionary(strm, dictionary) {
   var next;
   var input;
   var tmpDict;
-  if (!strm /*== Z_NULL*/ || !strm.state /*== Z_NULL*/) {
+
+  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {
     return Z_STREAM_ERROR;
   }
+
   s = strm.state;
   wrap = s.wrap;
-  if (wrap === 2 || wrap === 1 && s.status !== INIT_STATE || s.lookahead) {
+
+  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {
     return Z_STREAM_ERROR;
   }
 
   /* when using zlib wrappers, compute Adler-32 for provided dictionary */
   if (wrap === 1) {
     /* adler32(strm->adler, dictionary, dictLength); */
-    strm.adler = (0, _adler["default"])(strm.adler, dictionary, dictLength, 0);
+    strm.adler = adler32(strm.adler, dictionary, dictLength, 0);
   }
-  s.wrap = 0; /* avoid computing Adler-32 in read_buf */
+
+  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */
 
   /* if dictionary would fill window, just replace the history */
   if (dictLength >= s.w_size) {
-    if (wrap === 0) {
-      /* already empty otherwise */
+    if (wrap === 0) {            /* already empty otherwise */
       /*** CLEAR_HASH(s); ***/
       zero(s.head); // Fill with NIL (= 0);
       s.strstart = 0;
@@ -1688,8 +1808,10 @@ function deflateSetDictionary(strm, dictionary) {
     n = s.lookahead - (MIN_MATCH - 1);
     do {
       /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */
-      s.ins_h = (s.ins_h << s.hash_shift ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;
+
       s.prev[str & s.w_mask] = s.head[s.ins_h];
+
       s.head[s.ins_h] = str;
       str++;
     } while (--n);
@@ -1709,7 +1831,10 @@ function deflateSetDictionary(strm, dictionary) {
   s.wrap = wrap;
   return Z_OK;
 }
-var deflateInfo = exports.deflateInfo = 'pako deflate (from Nodeca project)';
+
+
+export { deflateInit, deflateInit2, deflateReset, deflateResetKeep, deflateSetHeader, deflate, deflateEnd, deflateSetDictionary };
+export var deflateInfo = 'pako deflate (from Nodeca project)';
 
 /* Not implemented
 exports.deflateBound = deflateBound;
@@ -1718,4 +1843,4 @@ exports.deflateParams = deflateParams;
 exports.deflatePending = deflatePending;
 exports.deflatePrime = deflatePrime;
 exports.deflateTune = deflateTune;
-*/
+*/