Lines Matching refs:n
13 …n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return…
227 for(var n =0; n < 256; n++){
228 c = n;
232 table[n] = c;
1838 skip: function(n) { argument
1839 this.setIndex(this.index + n);
5740 n = 0;
5746 n = len > 2000 ? 2000 : len;
5747 len -= n;
5752 } while (--n);
5864 for (var n = 0; n < 256; n++) {
5865 c = n;
5869 table[n] = c;
6241 var p, n, m, more, str;
6281 n = s.hash_size;
6282 p = n;
6286 } while (--n);
6288 n = _w_size;
6289 p = n;
6296 } while (--n);
6316 n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
6317 s.lookahead += n;
7672 var str, n;
7724 n = s.lookahead - (MIN_MATCH - 1);
7733 } while (--n);
8580 var n; // temporary var for NEED_BITS
9153 n = here_bits + 2;
9154 while (bits < n) {
9179 n = here_bits + 3;
9180 while (bits < n) {
9200 n = here_bits + 7;
9201 while (bits < n) {
9378 n = state.extra;
9379 while (bits < n) {
9454 n = state.extra;
9455 while (bits < n) {
10401 var n, m; /* iterate over the tree elements */
10417 n = s.heap[h];
10418 bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
10423 tree[n * 2 + 1]/*.Len*/ = bits;
10426 if (n > max_code) { continue; } /* not a leaf node */
10430 if (n >= base) {
10431 xbits = extra[n - base];
10433 f = tree[n * 2]/*.Freq*/;
10436 s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);
10463 n = s.bl_count[bits];
10464 while (n !== 0) {
10472 n--;
10494 var n; /* code index */
10509 for (n = 0; n <= max_code; n++) {
10510 var len = tree[n * 2 + 1]/*.Len*/;
10513 tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);
10525 var n; /* iterates over tree elements */
10549 for (n = 0; n < (1 << extra_lbits[code]); n++) {
10564 for (n = 0; n < (1 << extra_dbits[code]); n++) {
10572 for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
10583 n = 0;
10584 while (n <= 143) {
10585 static_ltree[n * 2 + 1]/*.Len*/ = 8;
10586 n++;
10589 while (n <= 255) {
10590 static_ltree[n * 2 + 1]/*.Len*/ = 9;
10591 n++;
10594 while (n <= 279) {
10595 static_ltree[n * 2 + 1]/*.Len*/ = 7;
10596 n++;
10599 while (n <= 287) {
10600 static_ltree[n * 2 + 1]/*.Len*/ = 8;
10601 n++;
10611 for (n = 0; n < D_CODES; n++) {
10612 static_dtree[n * 2 + 1]/*.Len*/ = 5;
10613 static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);
10629 var n; /* iterates over tree elements */
10632 for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }
10633 for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }
10634 for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }
10684 function smaller(tree, n, m, depth) { argument
10685 var _n2 = n * 2;
10688 (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
10798 var n, m; /* iterate over heap elements */
10809 for (n = 0; n < elems; n++) {
10810 if (tree[n * 2]/*.Freq*/ !== 0) {
10811 s.heap[++s.heap_len] = max_code = n;
10812 s.depth[n] = 0;
10815 tree[n * 2 + 1]/*.Len*/ = 0;
10840 for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
10849 n = s.heap[1/*SMALLEST*/];
10856 s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
10860 tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
10861 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
10862 tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;
10891 var n; /* iterates over all tree elements */
10907 for (n = 0; n <= max_code; n++) {
10909 nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
10957 var n; /* iterates over all tree elements */
10973 for (n = 0; n <= max_code; n++) {
10975 nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;
11105 var n;
11108 for (n = 0; n <= 31; n++, black_mask >>>= 1) {
11109 if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {
11119 for (n = 32; n < LITERALS; n++) {
11120 if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {