novnc ES6 compatibility is not working. I reverse it. Spice/VNC sending ctrl+alt+fn functionality restored.

static/js/novnc/vendor/pako/lib/utils/common.js

@@ -1,24 +1,13 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.shrinkBuf = shrinkBuf;
-exports.arraySet = arraySet;
-exports.flattenChunks = flattenChunks;
 // reduce buffer size, avoiding mem copy
-function shrinkBuf(buf, size) {
-  if (buf.length === size) {
-    return buf;
-  }
-  if (buf.subarray) {
-    return buf.subarray(0, size);
-  }
+export function shrinkBuf (buf, size) {
+  if (buf.length === size) { return buf; }
+  if (buf.subarray) { return buf.subarray(0, size); }
   buf.length = size;
   return buf;
 };
 
-function arraySet(dest, src, src_offs, len, dest_offs) {
+
+export function arraySet (dest, src, src_offs, len, dest_offs) {
   if (src.subarray && dest.subarray) {
     dest.set(src.subarray(src_offs, src_offs + len), dest_offs);
     return;
@@ -30,7 +19,7 @@ function arraySet(dest, src, src_offs, len, dest_offs) {
 }
 
 // Join array of chunks to single array.
-function flattenChunks(chunks) {
+export function flattenChunks (chunks) {
   var i, l, len, pos, chunk, result;
 
   // calculate data length
@@ -51,6 +40,6 @@ function flattenChunks(chunks) {
   return result;
 }
 
-var Buf8 = exports.Buf8 = Uint8Array;
-var Buf16 = exports.Buf16 = Uint16Array;
-var Buf32 = exports.Buf32 = Int32Array;
+export var Buf8  = Uint8Array;
+export var Buf16 = Uint16Array;
+export var Buf32 = Int32Array;

static/js/novnc/vendor/pako/lib/zlib/adler32.js

@@ -1,16 +1,10 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = adler32;
 // Note: adler32 takes 12% for level 0 and 2% for level 6.
 // It doesn't worth to make additional optimizationa as in original.
 // Small size is preferable.
 
-function adler32(adler, buf, len, pos) {
-  var s1 = adler & 0xffff | 0,
-      s2 = adler >>> 16 & 0xffff | 0,
+export default function adler32(adler, buf, len, pos) {
+  var s1 = (adler & 0xffff) |0,
+      s2 = ((adler >>> 16) & 0xffff) |0,
       n = 0;
 
   while (len !== 0) {
@@ -21,13 +15,13 @@ function adler32(adler, buf, len, pos) {
     len -= n;
 
     do {
-      s1 = s1 + buf[pos++] | 0;
-      s2 = s2 + s1 | 0;
+      s1 = (s1 + buf[pos++]) |0;
+      s2 = (s2 + s1) |0;
     } while (--n);
 
     s1 %= 65521;
     s2 %= 65521;
   }
 
-  return s1 | s2 << 16 | 0;
-}
+  return (s1 | (s2 << 16)) |0;
+}

static/js/novnc/vendor/pako/lib/zlib/constants.js

@@ -1,51 +1,47 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = {
+export default {
 
   /* Allowed flush values; see deflate() and inflate() below for details */
-  Z_NO_FLUSH: 0,
-  Z_PARTIAL_FLUSH: 1,
-  Z_SYNC_FLUSH: 2,
-  Z_FULL_FLUSH: 3,
-  Z_FINISH: 4,
-  Z_BLOCK: 5,
-  Z_TREES: 6,
+  Z_NO_FLUSH:         0,
+  Z_PARTIAL_FLUSH:    1,
+  Z_SYNC_FLUSH:       2,
+  Z_FULL_FLUSH:       3,
+  Z_FINISH:           4,
+  Z_BLOCK:            5,
+  Z_TREES:            6,
 
   /* Return codes for the compression/decompression functions. Negative values
   * are errors, positive values are used for special but normal events.
   */
-  Z_OK: 0,
-  Z_STREAM_END: 1,
-  Z_NEED_DICT: 2,
-  Z_ERRNO: -1,
-  Z_STREAM_ERROR: -2,
-  Z_DATA_ERROR: -3,
+  Z_OK:               0,
+  Z_STREAM_END:       1,
+  Z_NEED_DICT:        2,
+  Z_ERRNO:           -1,
+  Z_STREAM_ERROR:    -2,
+  Z_DATA_ERROR:      -3,
   //Z_MEM_ERROR:     -4,
-  Z_BUF_ERROR: -5,
+  Z_BUF_ERROR:       -5,
   //Z_VERSION_ERROR: -6,
 
   /* compression levels */
-  Z_NO_COMPRESSION: 0,
-  Z_BEST_SPEED: 1,
-  Z_BEST_COMPRESSION: 9,
-  Z_DEFAULT_COMPRESSION: -1,
+  Z_NO_COMPRESSION:         0,
+  Z_BEST_SPEED:             1,
+  Z_BEST_COMPRESSION:       9,
+  Z_DEFAULT_COMPRESSION:   -1,
 
-  Z_FILTERED: 1,
-  Z_HUFFMAN_ONLY: 2,
-  Z_RLE: 3,
-  Z_FIXED: 4,
-  Z_DEFAULT_STRATEGY: 0,
+
+  Z_FILTERED:               1,
+  Z_HUFFMAN_ONLY:           2,
+  Z_RLE:                    3,
+  Z_FIXED:                  4,
+  Z_DEFAULT_STRATEGY:       0,
 
   /* Possible values of the data_type field (though see inflate()) */
-  Z_BINARY: 0,
-  Z_TEXT: 1,
+  Z_BINARY:                 0,
+  Z_TEXT:                   1,
   //Z_ASCII:                1, // = Z_TEXT (deprecated)
-  Z_UNKNOWN: 2,
+  Z_UNKNOWN:                2,
 
   /* The deflate compression method */
-  Z_DEFLATED: 8
+  Z_DEFLATED:               8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
-};
+};

static/js/novnc/vendor/pako/lib/zlib/crc32.js

@@ -1,23 +1,16 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = makeTable;
 // Note: we can't get significant speed boost here.
 // So write code to minimize size - no pregenerated tables
 // and array tools dependencies.
 
 
 // Use ordinary array, since untyped makes no boost here
-function makeTable() {
-  var c,
-      table = [];
+export default function makeTable() {
+  var c, table = [];
 
   for (var n = 0; n < 256; n++) {
     c = n;
     for (var k = 0; k < 8; k++) {
-      c = c & 1 ? 0xEDB88320 ^ c >>> 1 : c >>> 1;
+      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));
     }
     table[n] = c;
   }
@@ -28,6 +21,7 @@ function makeTable() {
 // Create table on load. Just 255 signed longs. Not a problem.
 var crcTable = makeTable();
 
+
 function crc32(crc, buf, len, pos) {
   var t = crcTable,
       end = pos + len;
@@ -35,8 +29,8 @@ function crc32(crc, buf, len, pos) {
   crc ^= -1;
 
   for (var i = pos; i < end; i++) {
-    crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 0xFF];
+    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];
   }
 
-  return crc ^ -1; // >>> 0;
-}
+  return (crc ^ (-1)); // >>> 0;
+}

static/js/novnc/vendor/pako/lib/zlib/gzheader.js

@@ -1,23 +1,17 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = GZheader;
-function GZheader() {
+export default function GZheader() {
   /* true if compressed data believed to be text */
-  this.text = 0;
+  this.text       = 0;
   /* modification time */
-  this.time = 0;
+  this.time       = 0;
   /* extra flags (not used when writing a gzip file) */
-  this.xflags = 0;
+  this.xflags     = 0;
   /* operating system */
-  this.os = 0;
+  this.os         = 0;
   /* pointer to extra field or Z_NULL if none */
-  this.extra = null;
+  this.extra      = null;
   /* extra field length (valid if extra != Z_NULL) */
-  this.extra_len = 0; // Actually, we don't need it in JS,
-  // but leave for few code modifications
+  this.extra_len  = 0; // Actually, we don't need it in JS,
+                       // but leave for few code modifications
 
   //
   // Setup limits is not necessary because in js we should not preallocate memory
@@ -27,15 +21,15 @@ function GZheader() {
   /* space at extra (only when reading header) */
   // this.extra_max  = 0;
   /* pointer to zero-terminated file name or Z_NULL */
-  this.name = '';
+  this.name       = '';
   /* space at name (only when reading header) */
   // this.name_max   = 0;
   /* pointer to zero-terminated comment or Z_NULL */
-  this.comment = '';
+  this.comment    = '';
   /* space at comment (only when reading header) */
   // this.comm_max   = 0;
   /* true if there was or will be a header crc */
-  this.hcrc = 0;
+  this.hcrc       = 0;
   /* true when done reading gzip header (not used when writing a gzip file) */
-  this.done = false;
-}
+  this.done       = false;
+}

static/js/novnc/vendor/pako/lib/zlib/inffast.js

@@ -1,12 +1,6 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = inflate_fast;
 // See state defs from inflate.js
-var BAD = 30; /* got a data error -- remain here until reset */
-var TYPE = 12; /* i: waiting for type bits, including last-flag bit */
+var BAD = 30;       /* got a data error -- remain here until reset */
+var TYPE = 12;      /* i: waiting for type bits, including last-flag bit */
 
 /*
    Decode literal, length, and distance codes and write out the resulting
@@ -43,35 +37,36 @@ var TYPE = 12; /* i: waiting for type bits, including last-flag bit */
       requires strm.avail_out >= 258 for each loop to avoid checking for
       output space.
  */
-function inflate_fast(strm, start) {
+export default function inflate_fast(strm, start) {
   var state;
-  var _in; /* local strm.input */
-  var last; /* have enough input while in < last */
-  var _out; /* local strm.output */
-  var beg; /* inflate()'s initial strm.output */
-  var end; /* while out < end, enough space available */
-  //#ifdef INFLATE_STRICT
-  var dmax; /* maximum distance from zlib header */
-  //#endif
-  var wsize; /* window size or zero if not using window */
-  var whave; /* valid bytes in the window */
-  var wnext; /* window write index */
+  var _in;                    /* local strm.input */
+  var last;                   /* have enough input while in < last */
+  var _out;                   /* local strm.output */
+  var beg;                    /* inflate()'s initial strm.output */
+  var end;                    /* while out < end, enough space available */
+//#ifdef INFLATE_STRICT
+  var dmax;                   /* maximum distance from zlib header */
+//#endif
+  var wsize;                  /* window size or zero if not using window */
+  var whave;                  /* valid bytes in the window */
+  var wnext;                  /* window write index */
   // Use `s_window` instead `window`, avoid conflict with instrumentation tools
-  var s_window; /* allocated sliding window, if wsize != 0 */
-  var hold; /* local strm.hold */
-  var bits; /* local strm.bits */
-  var lcode; /* local strm.lencode */
-  var dcode; /* local strm.distcode */
-  var lmask; /* mask for first level of length codes */
-  var dmask; /* mask for first level of distance codes */
-  var here; /* retrieved table entry */
-  var op; /* code bits, operation, extra bits, or */
-  /*  window position, window bytes to copy */
-  var len; /* match length, unused bytes */
-  var dist; /* match distance */
-  var from; /* where to copy match from */
+  var s_window;               /* allocated sliding window, if wsize != 0 */
+  var hold;                   /* local strm.hold */
+  var bits;                   /* local strm.bits */
+  var lcode;                  /* local strm.lencode */
+  var dcode;                  /* local strm.distcode */
+  var lmask;                  /* mask for first level of length codes */
+  var dmask;                  /* mask for first level of distance codes */
+  var here;                   /* retrieved table entry */
+  var op;                     /* code bits, operation, extra bits, or */
+                              /*  window position, window bytes to copy */
+  var len;                    /* match length, unused bytes */
+  var dist;                   /* match distance */
+  var from;                   /* where to copy match from */
   var from_source;
 
+
   var input, output; // JS specific, because we have no pointers
 
   /* copy state to local variables */
@@ -84,9 +79,9 @@ function inflate_fast(strm, start) {
   output = strm.output;
   beg = _out - (start - strm.avail_out);
   end = _out + (strm.avail_out - 257);
-  //#ifdef INFLATE_STRICT
+//#ifdef INFLATE_STRICT
   dmax = state.dmax;
-  //#endif
+//#endif
   wsize = state.wsize;
   whave = state.whave;
   wnext = state.wnext;
@@ -98,10 +93,12 @@ function inflate_fast(strm, start) {
   lmask = (1 << state.lenbits) - 1;
   dmask = (1 << state.distbits) - 1;
 
+
   /* decode literals and length/distances until end-of-block or not enough
      input data or output space */
 
-  top: do {
+  top:
+  do {
     if (bits < 15) {
       hold += input[_in++] << bits;
       bits += 8;
@@ -111,28 +108,27 @@ function inflate_fast(strm, start) {
 
     here = lcode[hold & lmask];
 
-    dolen: for (;;) {
-      // Goto emulation
-      op = here >>> 24 /*here.bits*/;
+    dolen:
+    for (;;) { // Goto emulation
+      op = here >>> 24/*here.bits*/;
       hold >>>= op;
       bits -= op;
-      op = here >>> 16 & 0xff /*here.op*/;
-      if (op === 0) {
-        /* literal */
+      op = (here >>> 16) & 0xff/*here.op*/;
+      if (op === 0) {                          /* literal */
         //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?
         //        "inflate:         literal '%c'\n" :
         //        "inflate:         literal 0x%02x\n", here.val));
-        output[_out++] = here & 0xffff /*here.val*/;
-      } else if (op & 16) {
-        /* length base */
-        len = here & 0xffff /*here.val*/;
-        op &= 15; /* number of extra bits */
+        output[_out++] = here & 0xffff/*here.val*/;
+      }
+      else if (op & 16) {                     /* length base */
+        len = here & 0xffff/*here.val*/;
+        op &= 15;                           /* number of extra bits */
         if (op) {
           if (bits < op) {
             hold += input[_in++] << bits;
             bits += 8;
           }
-          len += hold & (1 << op) - 1;
+          len += hold & ((1 << op) - 1);
           hold >>>= op;
           bits -= op;
         }
@@ -145,17 +141,16 @@ function inflate_fast(strm, start) {
         }
         here = dcode[hold & dmask];
 
-        dodist: for (;;) {
-          // goto emulation
-          op = here >>> 24 /*here.bits*/;
+        dodist:
+        for (;;) { // goto emulation
+          op = here >>> 24/*here.bits*/;
           hold >>>= op;
           bits -= op;
-          op = here >>> 16 & 0xff /*here.op*/;
+          op = (here >>> 16) & 0xff/*here.op*/;
 
-          if (op & 16) {
-            /* distance base */
-            dist = here & 0xffff /*here.val*/;
-            op &= 15; /* number of extra bits */
+          if (op & 16) {                      /* distance base */
+            dist = here & 0xffff/*here.val*/;
+            op &= 15;                       /* number of extra bits */
             if (bits < op) {
               hold += input[_in++] << bits;
               bits += 8;
@@ -164,21 +159,20 @@ function inflate_fast(strm, start) {
                 bits += 8;
               }
             }
-            dist += hold & (1 << op) - 1;
-            //#ifdef INFLATE_STRICT
+            dist += hold & ((1 << op) - 1);
+//#ifdef INFLATE_STRICT
             if (dist > dmax) {
               strm.msg = 'invalid distance too far back';
               state.mode = BAD;
               break top;
             }
-            //#endif
+//#endif
             hold >>>= op;
             bits -= op;
             //Tracevv((stderr, "inflate:         distance %u\n", dist));
-            op = _out - beg; /* max distance in output */
-            if (dist > op) {
-              /* see if copy from window */
-              op = dist - op; /* distance back in window */
+            op = _out - beg;                /* max distance in output */
+            if (dist > op) {                /* see if copy from window */
+              op = dist - op;               /* distance back in window */
               if (op > whave) {
                 if (state.sane) {
                   strm.msg = 'invalid distance too far back';
@@ -186,74 +180,69 @@ function inflate_fast(strm, start) {
                   break top;
                 }
 
-                // (!) This block is disabled in zlib defailts,
-                // don't enable it for binary compatibility
-                //#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
-                //                if (len <= op - whave) {
-                //                  do {
-                //                    output[_out++] = 0;
-                //                  } while (--len);
-                //                  continue top;
-                //                }
-                //                len -= op - whave;
-                //                do {
-                //                  output[_out++] = 0;
-                //                } while (--op > whave);
-                //                if (op === 0) {
-                //                  from = _out - dist;
-                //                  do {
-                //                    output[_out++] = output[from++];
-                //                  } while (--len);
-                //                  continue top;
-                //                }
-                //#endif
+// (!) This block is disabled in zlib defailts,
+// don't enable it for binary compatibility
+//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR
+//                if (len <= op - whave) {
+//                  do {
+//                    output[_out++] = 0;
+//                  } while (--len);
+//                  continue top;
+//                }
+//                len -= op - whave;
+//                do {
+//                  output[_out++] = 0;
+//                } while (--op > whave);
+//                if (op === 0) {
+//                  from = _out - dist;
+//                  do {
+//                    output[_out++] = output[from++];
+//                  } while (--len);
+//                  continue top;
+//                }
+//#endif
               }
               from = 0; // window index
               from_source = s_window;
-              if (wnext === 0) {
-                /* very common case */
+              if (wnext === 0) {           /* very common case */
                 from += wsize - op;
-                if (op < len) {
-                  /* some from window */
+                if (op < len) {         /* some from window */
                   len -= op;
                   do {
                     output[_out++] = s_window[from++];
                   } while (--op);
-                  from = _out - dist; /* rest from output */
+                  from = _out - dist;  /* rest from output */
                   from_source = output;
                 }
-              } else if (wnext < op) {
-                /* wrap around window */
+              }
+              else if (wnext < op) {      /* wrap around window */
                 from += wsize + wnext - op;
                 op -= wnext;
-                if (op < len) {
-                  /* some from end of window */
+                if (op < len) {         /* some from end of window */
                   len -= op;
                   do {
                     output[_out++] = s_window[from++];
                   } while (--op);
                   from = 0;
-                  if (wnext < len) {
-                    /* some from start of window */
+                  if (wnext < len) {  /* some from start of window */
                     op = wnext;
                     len -= op;
                     do {
                       output[_out++] = s_window[from++];
                     } while (--op);
-                    from = _out - dist; /* rest from output */
+                    from = _out - dist;      /* rest from output */
                     from_source = output;
                   }
                 }
-              } else {
-                /* contiguous in window */
+              }
+              else {                      /* contiguous in window */
                 from += wnext - op;
-                if (op < len) {
-                  /* some from window */
+                if (op < len) {         /* some from window */
                   len -= op;
                   do {
                     output[_out++] = s_window[from++];
                   } while (--op);
-                  from = _out - dist; /* rest from output */
+                  from = _out - dist;  /* rest from output */
                   from_source = output;
                 }
               }
@@ -269,10 +258,10 @@ function inflate_fast(strm, start) {
                   output[_out++] = from_source[from++];
                 }
               }
-            } else {
-              from = _out - dist; /* copy direct from output */
-              do {
-                /* minimum length is three */
+            }
+            else {
+              from = _out - dist;          /* copy direct from output */
+              do {                        /* minimum length is three */
                 output[_out++] = output[from++];
                 output[_out++] = output[from++];
                 output[_out++] = output[from++];
@@ -285,11 +274,12 @@ function inflate_fast(strm, start) {
                 }
               }
             }
-          } else if ((op & 64) === 0) {
-            /* 2nd level distance code */
-            here = dcode[(here & 0xffff) + ( /*here.val*/hold & (1 << op) - 1)];
+          }
+          else if ((op & 64) === 0) {          /* 2nd level distance code */
+            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
             continue dodist;
-          } else {
+          }
+          else {
             strm.msg = 'invalid distance code';
             state.mode = BAD;
             break top;
@@ -297,16 +287,17 @@ function inflate_fast(strm, start) {
 
           break; // need to emulate goto via "continue"
         }
-      } else if ((op & 64) === 0) {
-        /* 2nd level length code */
-        here = lcode[(here & 0xffff) + ( /*here.val*/hold & (1 << op) - 1)];
+      }
+      else if ((op & 64) === 0) {              /* 2nd level length code */
+        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];
         continue dolen;
-      } else if (op & 32) {
-        /* end-of-block */
+      }
+      else if (op & 32) {                     /* end-of-block */
         //Tracevv((stderr, "inflate:         end of block\n"));
         state.mode = TYPE;
         break top;
-      } else {
+      }
+      else {
         strm.msg = 'invalid literal/length code';
         state.mode = BAD;
         break top;
@@ -325,9 +316,9 @@ function inflate_fast(strm, start) {
   /* update state and return */
   strm.next_in = _in;
   strm.next_out = _out;
-  strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last);
-  strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end);
+  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));
+  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));
   state.hold = hold;
   state.bits = bits;
   return;
-};
+};

static/js/novnc/vendor/pako/lib/zlib/inftrees.js

@@ -1,15 +1,4 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = inflate_table;
-
-var _common = require("../utils/common.js");
-
-var utils = _interopRequireWildcard(_common);
-
-function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+import * as utils from "../utils/common.js";
 
 var MAXBITS = 15;
 var ENOUGH_LENS = 852;
@@ -20,41 +9,51 @@ var CODES = 0;
 var LENS = 1;
 var DISTS = 2;
 
-var lbase = [/* Length codes 257..285 base */
-3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0];
+var lbase = [ /* Length codes 257..285 base */
+  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0
+];
 
-var lext = [/* Length codes 257..285 extra */
-16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78];
+var lext = [ /* Length codes 257..285 extra */
+  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
+  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78
+];
 
-var dbase = [/* Distance codes 0..29 base */
-1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0];
+var dbase = [ /* Distance codes 0..29 base */
+  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+  8193, 12289, 16385, 24577, 0, 0
+];
 
-var dext = [/* Distance codes 0..29 extra */
-16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
+var dext = [ /* Distance codes 0..29 extra */
+  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
+  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
+  28, 28, 29, 29, 64, 64
+];
 
-function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {
+export default function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)
+{
   var bits = opts.bits;
-  //here = opts.here; /* table entry for duplication */
+      //here = opts.here; /* table entry for duplication */
 
-  var len = 0; /* a code's length in bits */
-  var sym = 0; /* index of code symbols */
-  var min = 0,
-      max = 0; /* minimum and maximum code lengths */
-  var root = 0; /* number of index bits for root table */
-  var curr = 0; /* number of index bits for current table */
-  var drop = 0; /* code bits to drop for sub-table */
-  var left = 0; /* number of prefix codes available */
-  var used = 0; /* code entries in table used */
-  var huff = 0; /* Huffman code */
-  var incr; /* for incrementing code, index */
-  var fill; /* index for replicating entries */
-  var low; /* low bits for current root entry */
-  var mask; /* mask for low root bits */
-  var next; /* next available space in table */
-  var base = null; /* base value table to use */
+  var len = 0;               /* a code's length in bits */
+  var sym = 0;               /* index of code symbols */
+  var min = 0, max = 0;          /* minimum and maximum code lengths */
+  var root = 0;              /* number of index bits for root table */
+  var curr = 0;              /* number of index bits for current table */
+  var drop = 0;              /* code bits to drop for sub-table */
+  var left = 0;                   /* number of prefix codes available */
+  var used = 0;              /* code entries in table used */
+  var huff = 0;              /* Huffman code */
+  var incr;              /* for incrementing code, index */
+  var fill;              /* index for replicating entries */
+  var low;               /* low bits for current root entry */
+  var mask;              /* mask for low root bits */
+  var next;             /* next available space in table */
+  var base = null;     /* base value table to use */
   var base_index = 0;
-  //  var shoextra;    /* extra bits table to use */
-  var end; /* use base and extra for symbol > end */
+//  var shoextra;    /* extra bits table to use */
+  var end;                    /* use base and extra for symbol > end */
   var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */
   var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */
   var extra = null;
@@ -74,16 +73,19 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
    from their more natural integer increment ordering, and so when the
    decoding tables are built in the large loop below, the integer codes
    are incremented backwards.
-    This routine assumes, but does not check, that all of the entries in
+
+   This routine assumes, but does not check, that all of the entries in
    lens[] are in the range 0..MAXBITS.  The caller must assure this.
    1..MAXBITS is interpreted as that code length.  zero means that that
    symbol does not occur in this code.
-    The codes are sorted by computing a count of codes for each length,
+
+   The codes are sorted by computing a count of codes for each length,
    creating from that a table of starting indices for each length in the
    sorted table, and then entering the symbols in order in the sorted
    table.  The sorted table is work[], with that space being provided by
    the caller.
-    The length counts are used for other purposes as well, i.e. finding
+
+   The length counts are used for other purposes as well, i.e. finding
    the minimum and maximum length codes, determining if there are any
    codes at all, checking for a valid set of lengths, and looking ahead
    at length counts to determine sub-table sizes when building the
@@ -101,32 +103,28 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
   /* bound code lengths, force root to be within code lengths */
   root = bits;
   for (max = MAXBITS; max >= 1; max--) {
-    if (count[max] !== 0) {
-      break;
-    }
+    if (count[max] !== 0) { break; }
   }
   if (root > max) {
     root = max;
   }
-  if (max === 0) {
-    /* no symbols to code at all */
+  if (max === 0) {                     /* no symbols to code at all */
     //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */
     //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;
     //table.val[opts.table_index++] = 0;   //here.val = (var short)0;
-    table[table_index++] = 1 << 24 | 64 << 16 | 0;
+    table[table_index++] = (1 << 24) | (64 << 16) | 0;
+
 
     //table.op[opts.table_index] = 64;
     //table.bits[opts.table_index] = 1;
     //table.val[opts.table_index++] = 0;
-    table[table_index++] = 1 << 24 | 64 << 16 | 0;
+    table[table_index++] = (1 << 24) | (64 << 16) | 0;
 
     opts.bits = 1;
-    return 0; /* no symbols, but wait for decoding to report error */
+    return 0;     /* no symbols, but wait for decoding to report error */
   }
   for (min = 1; min < max; min++) {
-    if (count[min] !== 0) {
-      break;
-    }
+    if (count[min] !== 0) { break; }
   }
   if (root < min) {
     root = min;
@@ -139,10 +137,10 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
     left -= count[len];
     if (left < 0) {
       return -1;
-    } /* over-subscribed */
+    }        /* over-subscribed */
   }
   if (left > 0 && (type === CODES || max !== 1)) {
-    return -1; /* incomplete set */
+    return -1;                      /* incomplete set */
   }
 
   /* generate offsets into symbol table for each length for sorting */
@@ -165,21 +163,25 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
    bits off of the bottom.  For codes where len is less than drop + curr,
    those top drop + curr - len bits are incremented through all values to
    fill the table with replicated entries.
-    root is the number of index bits for the root table.  When len exceeds
+
+   root is the number of index bits for the root table.  When len exceeds
    root, sub-tables are created pointed to by the root entry with an index
    of the low root bits of huff.  This is saved in low to check for when a
    new sub-table should be started.  drop is zero when the root table is
    being filled, and drop is root when sub-tables are being filled.
-    When a new sub-table is needed, it is necessary to look ahead in the
+
+   When a new sub-table is needed, it is necessary to look ahead in the
    code lengths to determine what size sub-table is needed.  The length
    counts are used for this, and so count[] is decremented as codes are
    entered in the tables.
-    used keeps track of how many table entries have been allocated from the
+
+   used keeps track of how many table entries have been allocated from the
    provided *table space.  It is checked for LENS and DIST tables against
    the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in
    the initial root table size constants.  See the comments in inftrees.h
    for more information.
-    sym increments through all symbols, and the loop terminates when
+
+   sym increments through all symbols, and the loop terminates when
    all codes of length max, i.e. all codes, have been processed.  This
    routine permits incomplete codes, so another loop after this one fills
    in the rest of the decoding tables with invalid code markers.
@@ -189,34 +191,36 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
   // poor man optimization - use if-else instead of switch,
   // to avoid deopts in old v8
   if (type === CODES) {
-    base = extra = work; /* dummy value--not used */
+    base = extra = work;    /* dummy value--not used */
     end = 19;
+
   } else if (type === LENS) {
     base = lbase;
     base_index -= 257;
     extra = lext;
     extra_index -= 257;
     end = 256;
-  } else {
-    /* DISTS */
+
+  } else {                    /* DISTS */
     base = dbase;
     extra = dext;
     end = -1;
   }
 
   /* initialize opts for loop */
-  huff = 0; /* starting code */
-  sym = 0; /* starting code symbol */
-  len = min; /* starting code length */
-  next = table_index; /* current table to fill in */
-  curr = root; /* current table index bits */
-  drop = 0; /* current bits to drop from code for index */
-  low = -1; /* trigger new sub-table when len > root */
-  used = 1 << root; /* use root table entries */
-  mask = used - 1; /* mask for comparing low */
+  huff = 0;                   /* starting code */
+  sym = 0;                    /* starting code symbol */
+  len = min;                  /* starting code length */
+  next = table_index;              /* current table to fill in */
+  curr = root;                /* current table index bits */
+  drop = 0;                   /* current bits to drop from code for index */
+  low = -1;                   /* trigger new sub-table when len > root */
+  used = 1 << root;          /* use root table entries */
+  mask = used - 1;            /* mask for comparing low */
 
   /* check available table space */
-  if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) {
+  if ((type === LENS && used > ENOUGH_LENS) ||
+    (type === DISTS && used > ENOUGH_DISTS)) {
     return 1;
   }
 
@@ -227,25 +231,27 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
     if (work[sym] < end) {
       here_op = 0;
       here_val = work[sym];
-    } else if (work[sym] > end) {
+    }
+    else if (work[sym] > end) {
       here_op = extra[extra_index + work[sym]];
       here_val = base[base_index + work[sym]];
-    } else {
-      here_op = 32 + 64; /* end of block */
+    }
+    else {
+      here_op = 32 + 64;         /* end of block */
       here_val = 0;
     }
 
     /* replicate for those indices with low len bits equal to huff */
-    incr = 1 << len - drop;
+    incr = 1 << (len - drop);
     fill = 1 << curr;
-    min = fill; /* save offset to next table */
+    min = fill;                 /* save offset to next table */
     do {
       fill -= incr;
-      table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0;
+      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;
     } while (fill !== 0);
 
     /* backwards increment the len-bit code huff */
-    incr = 1 << len - 1;
+    incr = 1 << (len - 1);
     while (huff & incr) {
       incr >>= 1;
     }
@@ -259,9 +265,7 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
     /* go to next symbol, update count, len */
     sym++;
     if (--count[len] === 0) {
-      if (len === max) {
-        break;
-      }
+      if (len === max) { break; }
       len = lens[lens_index + work[sym]];
     }
 
@@ -273,23 +277,22 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
       }
 
       /* increment past last table */
-      next += min; /* here min is 1 << curr */
+      next += min;            /* here min is 1 << curr */
 
       /* determine length of next table */
       curr = len - drop;
       left = 1 << curr;
       while (curr + drop < max) {
         left -= count[curr + drop];
-        if (left <= 0) {
-          break;
-        }
+        if (left <= 0) { break; }
         curr++;
         left <<= 1;
       }
 
       /* check for enough space */
       used += 1 << curr;
-      if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) {
+      if ((type === LENS && used > ENOUGH_LENS) ||
+        (type === DISTS && used > ENOUGH_DISTS)) {
         return 1;
       }
 
@@ -298,7 +301,7 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
       /*table.op[low] = curr;
       table.bits[low] = root;
       table.val[low] = next - opts.table_index;*/
-      table[low] = root << 24 | curr << 16 | next - table_index | 0;
+      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;
     }
   }
 
@@ -309,11 +312,11 @@ function inflate_table(type, lens, lens_index, codes, table, table_index, work,
     //table.op[next + huff] = 64;            /* invalid code marker */
     //table.bits[next + huff] = len - drop;
     //table.val[next + huff] = 0;
-    table[next + huff] = len - drop << 24 | 64 << 16 | 0;
+    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
   }
 
   /* set return parameters */
   //opts.table_index += used;
   opts.bits = root;
   return 0;
-};
+};

static/js/novnc/vendor/pako/lib/zlib/messages.js

@@ -1,16 +1,11 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = {
-  2: 'need dictionary', /* Z_NEED_DICT       2  */
-  1: 'stream end', /* Z_STREAM_END      1  */
-  0: '', /* Z_OK              0  */
-  '-1': 'file error', /* Z_ERRNO         (-1) */
-  '-2': 'stream error', /* Z_STREAM_ERROR  (-2) */
-  '-3': 'data error', /* Z_DATA_ERROR    (-3) */
-  '-4': 'insufficient memory', /* Z_MEM_ERROR     (-4) */
-  '-5': 'buffer error', /* Z_BUF_ERROR     (-5) */
-  '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */
-};
+export default {
+  2:      'need dictionary',     /* Z_NEED_DICT       2  */
+  1:      'stream end',          /* Z_STREAM_END      1  */
+  0:      '',                    /* Z_OK              0  */
+  '-1':   'file error',          /* Z_ERRNO         (-1) */
+  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */
+  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */
+  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */
+  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */
+  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */
+};

static/js/novnc/vendor/pako/lib/zlib/zstream.js

@@ -1,10 +1,4 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = ZStream;
-function ZStream() {
+export default function ZStream() {
   /* next input byte */
   this.input = null; // JS specific, because we have no pointers
   this.next_in = 0;
@@ -20,11 +14,11 @@ function ZStream() {
   /* total number of bytes output so far */
   this.total_out = 0;
   /* last error message, NULL if no error */
-  this.msg = '' /*Z_NULL*/;
+  this.msg = ''/*Z_NULL*/;
   /* not visible by applications */
   this.state = null;
   /* best guess about the data type: binary or text */
-  this.data_type = 2 /*Z_UNKNOWN*/;
+  this.data_type = 2/*Z_UNKNOWN*/;
   /* adler32 value of the uncompressed data */
   this.adler = 0;
-}
+}