Lines Matching refs:tree
23341 function send_code(s, c, tree) {
23342 send_bits(s, tree[c*2]/*.Code*/, tree[c*2 + 1]/*.Len*/);
23393 var tree = desc.dyn_tree;
23414 tree[s.heap[s.heap_max]*2 + 1]/*.Len*/ = 0; /* root of the heap */
23418 bits = tree[tree[n*2 +1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;
23423 tree[n*2 + 1]/*.Len*/ = bits;
23433 f = tree[n * 2]/*.Freq*/;
23467 if (tree[m*2 + 1]/*.Len*/ !== bits) {
23469 s.opt_len += (bits - tree[m*2 + 1]/*.Len*/)*tree[m*2]/*.Freq*/;
23470 tree[m*2 + 1]/*.Len*/ = bits;
23486 function gen_codes(tree, max_code, bl_count)
23510 var len = tree[n*2 + 1]/*.Len*/;
23513 tree[n*2]/*.Code*/ = bi_reverse(next_code[len]++, len);
23684 function smaller(tree, n, m, depth) {
23687 return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||
23688 (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));
23697 function pqdownheap(s, tree, k)
23707 smaller(tree, s.heap[j+1], s.heap[j], s.depth)) {
23711 if (smaller(tree, v, s.heap[j], s.depth)) { break; }
23794 var tree = desc.dyn_tree;
23810 if (tree[n * 2]/*.Freq*/ !== 0) {
23815 tree[n*2 + 1]/*.Len*/ = 0;
23826 tree[node * 2]/*.Freq*/ = 1;
23840 for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }
23851 pqdownheap(s, tree, 1/*SMALLEST*/);
23860 tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;
23862 tree[n*2 + 1]/*.Dad*/ = tree[m*2 + 1]/*.Dad*/ = node;
23866 pqdownheap(s, tree, 1/*SMALLEST*/);
23878 gen_codes(tree, max_code, s.bl_count);
23886 function scan_tree(s, tree, max_code)
23895 var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */
23905 tree[(max_code+1)*2 + 1]/*.Len*/ = 0xffff; /* guard */
23909 nextlen = tree[(n+1)*2 + 1]/*.Len*/;
23952 function send_tree(s, tree, max_code)
23961 var nextlen = tree[0*2 + 1]/*.Len*/; /* length of next code */
23975 nextlen = tree[(n+1)*2 + 1]/*.Len*/;