1825     var len = buf.length;
1830     var utf16buf = new Array(len*2);
1832     for (out=0, i=0; i<len;) {
1844         while (c_len > 1 && i < len) {
1910     var result = [], k = 0, len = buf.length, chunk = 65536;
1911     while (k < len) {
1912         var nextBoundary = utf8border(buf, Math.min(k + chunk, len));
2009         len = array.length,
2035     while (k < len && chunk > 1) {
2038 …            result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len))));
2041 …         result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len))));
3571   arraySet: function (dest, src, src_offs, len, dest_offs) {  argument
3573       dest.set(src.subarray(src_offs, src_offs+len), dest_offs);
3577     for(var i=0; i<len; i++) {
3583     var i, l, len, pos, chunk, result;
3586     len = 0;
3588       len += chunks[i].length;
3592     result = new Uint8Array(len);
3605   arraySet: function (dest, src, src_offs, len, dest_offs) {  argument
3606     for(var i=0; i<len; i++) {
3719 function buf2binstring(buf, len) {  argument
3721   if (len < 65537) {
3723       return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));
3728   for(var i=0; i < len; i++) {
3744   for(var i=0, len=buf.length; i < len; i++) {
3754   var len = max || buf.length;
3759   var utf16buf = new Array(len*2);
3761   for (out=0, i=0; i<len;) {
3773     while (c_len > 1 && i < len) {
3828 function adler32(adler, buf, len, pos) {  argument
3833   while (len !== 0) {
3837     n = len > 2000 ? 2000 : len;
3838     len -= n;
3929 function crc32(crc, buf, len, pos) {  argument
3931     , end = pos + len;
4059 function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
4072   var len = s.pending;
4073   if (len > strm.avail_out) {
4074     len = strm.avail_out;
4076   if (len === 0) { return; }
4078   utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);
4079   strm.next_out += len;
4080   s.pending_out += len;
4081   strm.total_out += len;
4082   strm.avail_out -= len;
4083   s.pending -= len;
4123   var len = strm.avail_in;
4125   if (len > size) { len = size; }
4126   if (len === 0) { return 0; }
4128   strm.avail_in -= len;
4130   utils.arraySet(buf, strm.input, strm.next_in, len, start);
4132     strm.adler = adler32(strm.adler, buf, len, start);
4136     strm.adler = crc32(strm.adler, buf, len, start);
4139   strm.next_in += len;
4140   strm.total_in += len;
4142   return len;
4159   var len;                           /* length of current match */
4237     len = MAX_MATCH - (strend - scan);
4240     if (len > best_len) {
4242       best_len = len;
4243       if (len >= nice_match) {
5816   var len;                    /* match length, unused bytes */
5876         len = here & 0xffff/*here.val*/;
5883           len += hold & ((1 << op) - 1);
5961                 if (op < len) {         /* some from window */
5962                   len -= op;
5973                 if (op < len) {         /* some from end of window */
5974                   len -= op;
5979                   if (wnext < len) {  /* some from start of window */
5981                     len -= op;
5992                 if (op < len) {         /* some from window */
5993                   len -= op;
6001               while (len > 2) {
6005                 len -= 3;
6007               if (len) {
6009                 if (len > 1) {
6020                 len -= 3;
6021               } while (len > 2);
6022               if (len) {
6024                 if (len > 1) {
6063   len = bits >> 3;
6064   _in -= len;
6065   bits -= len << 3;
6457   var len;                    /* length to copy for repeats, bits to drop */
6542       len = (hold & 0x0f)/*BITS(4)*/ + 8;
6544         state.wbits = len;
6546       else if (len > state.wbits) {
6551       state.dmax = 1 << len;
6686             len = state.head.extra_len - state.length;
6699               len
6723           len = input[next + copy++];
6725           if (state.head && len &&
6727             state.head.name += String.fromCharCode(len);
6729         } while (len && copy < have);
6736         if (len) { break inf_leave; }
6749           len = input[next + copy++];
6751           if (state.head && len &&
6753             state.head.comment += String.fromCharCode(len);
6755         } while (len && copy < have);
6761         if (len) { break inf_leave; }
7052             len = state.lens[state.have - 1];
7073             len = 0;
7094             len = 0;
7107             state.lens[state.have++] = len;
7624   var len = 0;               /* a code's length in bits */
7681   for (len = 0; len <= MAXBITS; len++) {
7682     count[len] = 0;
7720   for (len = 1; len <= MAXBITS; len++) {
7722     left -= count[len];
7733   for (len = 1; len < MAXBITS; len++) {
7734     offs[len + 1] = offs[len] + count[len];
7796   len = min;                  /* starting code length */
7815     here_bits = len - drop;
7830     incr = 1 << (len - drop);
7839     incr = 1 << (len - 1);
7852     if (--count[len] === 0) {
7853       if (len === max) { break; }
7854       len = lens[lens_index + work[sym]];
7858     if (len > root && (huff & mask) !== low) {
7868       curr = len - drop;
7900     table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;
7948 function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }
8138 function bi_reverse(code, len) {  argument
8144   } while (--len > 0);
8297     var len = tree[n*2 + 1]/*.Len*/;
8298     if (len === 0) { continue; }
8300     tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len);
8448 function copy_block(s, buf, len, header)  argument
8457     put_short(s, len);
8458     put_short(s, ~len);
8463   utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);
8464   s.pending += len;