Lines Matching refs:n
12 …n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return…
275 skip: function(n) { argument
276 this.setIndex(this.index + n);
3831 , n = 0;
3837 n = len > 2000 ? 2000 : len;
3838 len -= n;
3843 } while (--n);
3914 for(var n =0; n < 256; n++){
3915 c = n;
3919 table[n] = c;
4270 var p, n, m, more, str;
4310 n = s.hash_size;
4311 p = n;
4315 } while (--n);
4317 n = _w_size;
4318 p = n;
4325 } while (--n);
4345 n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);
4346 s.lookahead += n;
6462 var n; // temporary var for NEED_BITS
7035 n = here_bits + 2;
7036 while (bits < n) {
7061 n = here_bits + 3;
7062 while (bits < n) {
7082 n = here_bits + 7;
7083 while (bits < n) {
7260 n = state.extra;
7261 while (bits < n) {
7336 n = state.extra;
7337 while (bits < n) {
8188 var n, m; /* iterate over the tree elements */
8204 n = s.heap[h];
8205 bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
8210 tree[n*2 + 1]/*.Len*/ = bits;
8213 if (n > max_code) { continue; } /* not a leaf node */
8217 if (n >= base) {
8218 xbits = extra[n-base];
8220 f = tree[n * 2]/*.Freq*/;
8223 s.static_len += f * (stree[n*2 + 1]/*.Len*/ + xbits);
8250 n = s.bl_count[bits];
8251 while (n !== 0) {
8259 n--;
8281 var n; /* code index */
8296 for (n = 0; n <= max_code; n++) {
8297 var len = tree[n*2 + 1]/*.Len*/;
8300 tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len);
8312 var n; /* iterates over tree elements */
8336 for (n = 0; n < (1<<extra_lbits[code]); n++) {
8351 for (n = 0; n < (1<<extra_dbits[code]); n++) {
8359 for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
8370 n = 0;
8371 while (n <= 143) {
8372 static_ltree[n*2 + 1]/*.Len*/ = 8;
8373 n++;
8376 while (n <= 255) {
8377 static_ltree[n*2 + 1]/*.Len*/ = 9;
8378 n++;
8381 while (n <= 279) {
8382 static_ltree[n*2 + 1]/*.Len*/ = 7;
8383 n++;
8386 while (n <= 287) {
8387 static_ltree[n*2 + 1]/*.Len*/ = 8;
8388 n++;
8398 for (n = 0; n < D_CODES; n++) {
8399 static_dtree[n*2 + 1]/*.Len*/ = 5;
8400 static_dtree[n*2]/*.Code*/ = bi_reverse(n, 5);
8416 var n; /* iterates over tree elements */
8419 for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n*2]/*.Freq*/ = 0; }
8420 for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n*2]/*.Freq*/ = 0; }
8421 for (n = 0; n < BL_CODES; n++) { s.bl_tree[n*2]/*.Freq*/ = 0; }
8471 function smaller(tree, n, m, depth) { argument
8472 var _n2 = n*2;
8475 (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
8585 var n, m; /* iterate over heap elements */
8596 for (n = 0; n < elems; n++) {
8597 if (tree[n * 2]/*.Freq*/ !== 0) {
8598 s.heap[++s.heap_len] = max_code = n;
8599 s.depth[n] = 0;
8602 tree[n*2 + 1]/*.Len*/ = 0;
8627 for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
8636 n = s.heap[1/*SMALLEST*/];
8643 s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */
8647 tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
8648 s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;
8649 tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;
8678 var n; /* iterates over all tree elements */
8694 for (n = 0; n <= max_code; n++) {
8696 nextlen = tree[(n+1)*2 + 1]/*.Len*/;
8744 var n; /* iterates over all tree elements */
8760 for (n = 0; n <= max_code; n++) {
8762 nextlen = tree[(n+1)*2 + 1]/*.Len*/;
8892 var n;
8895 for (n = 0; n <= 31; n++, black_mask >>>= 1) {
8896 if ((black_mask & 1) && (s.dyn_ltree[n*2]/*.Freq*/ !== 0)) {
8906 for (n = 32; n < LITERALS; n++) {
8907 if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {