8128 function send_code(s, c, tree) {  argument
8129   send_bits(s, tree[c*2]/*.Code*/, tree[c*2 + 1]/*.Len*/);
8180   var tree            = desc.dyn_tree;
8201   tree[s.heap[s.heap_max]*2 + 1]/*.Len*/ = 0; /* root of the heap */
8205     bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
8210     tree[n*2 + 1]/*.Len*/ = bits;
8220     f = tree[n * 2]/*.Freq*/;
8254       if (tree[m*2 + 1]/*.Len*/ !== bits) {
8256         s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/;
8257         tree[m*2 + 1]/*.Len*/ = bits;
8273 function gen_codes(tree, max_code, bl_count)  argument
8297     var len = tree[n*2 + 1]/*.Len*/;
8300     tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len);
8471 function smaller(tree, n, m, depth) {  argument
8474   return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
8475          (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
8484 function pqdownheap(s, tree, k)  argument
8494       smaller(tree, s.heap[j+1], s.heap[j], s.depth)) {
8498     if (smaller(tree, v, s.heap[j], s.depth)) { break; }
8581   var tree     = desc.dyn_tree;
8597     if (tree[n * 2]/*.Freq*/ !== 0) {
8602       tree[n*2 + 1]/*.Len*/ = 0;
8613     tree[node * 2]/*.Freq*/ = 1;
8627   for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
8638     pqdownheap(s, tree, 1/*SMALLEST*/);
8647     tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
8649     tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;
8653     pqdownheap(s, tree, 1/*SMALLEST*/);
8665   gen_codes(tree, max_code, s.bl_count);
8673 function scan_tree(s, tree, max_code)  argument
8682   var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */
8692   tree[(max_code+1)*2 + 1]/*.Len*/ = 0xffff; /* guard */
8696     nextlen = tree[(n+1)*2 + 1]/*.Len*/;
8739 function send_tree(s, tree, max_code)  argument
8748   var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */
8762     nextlen = tree[(n+1)*2 + 1]/*.Len*/;