Lines Matching refs:tree
29371 return entity._getEncoder('der').tree;
68597 function send_code(s, c, tree) {
68598 send_bits(s, tree[c * 2]
68600 , tree[c * 2 + 1]
68653 var tree = desc.dyn_tree;
68686 tree[s.heap[s.heap_max] * 2 + 1]
68693 bits = tree[tree[n * 2 + 1]
68704 tree[n * 2 + 1]
68722 f = tree[n * 2]
68780 if (tree[m * 2 + 1]
68784 s.opt_len += (bits - tree[m * 2 + 1]
68786 ) * tree[m * 2]
68789 tree[m * 2 + 1]
68808 function gen_codes(tree, max_code, bl_count) // ct_data *tree; /* the tree to decora…
68840 var len = tree[n * 2 + 1]
68850 tree[n * 2]
69080 function smaller(tree, n, m, depth) {
69085 return tree[_n2]
69087 < tree[_m2]
69089 || tree[_n2]
69091 === tree[_m2]
69103 function pqdownheap(s, tree, k) // deflate_state *s;
69113 if (j < s.heap_len && smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {
69119 if (smaller(tree, v, s.heap[j], s.depth)) {
69224 var tree = desc.dyn_tree;
69246 if (tree[n * 2]
69252 tree[n * 2 + 1]
69266 tree[node * 2]
69289 pqdownheap(s, tree, n);
69309 pqdownheap(s, tree, 1
69325 tree[node * 2]
69327 = tree[n * 2]
69329 + tree[m * 2]
69333 tree[n * 2 + 1]
69335 = tree[m * 2 + 1]
69343 pqdownheap(s, tree, 1
69358 gen_codes(tree, max_code, s.bl_count);
69366 function scan_tree(s, tree, max_code) // deflate_state *s;
69379 var nextlen = tree[0 * 2 + 1]
69398 tree[(max_code + 1) * 2 + 1]
69405 nextlen = tree[(n + 1) * 2 + 1]
69448 function send_tree(s, tree, max_code) // deflate_state *s;
69461 var nextlen = tree[0 * 2 + 1]
69486 nextlen = tree[(n + 1) * 2 + 1]