pqdownheap

Name:pqdownheap

Proto:static void pqdownheap(deflate_state *s, ct_data *tree, int k)

Type:void

Parameter:

Type	Parameter	Name
deflate_state *	s
ct_data *	tree
int	k

377

v = umber of codes at each bit length for an optimal tree [k]

378

j = k << 1

379

When j <= heap_len cycle

381

If j < heap_len && Compares to subtrees, using the tree depth as tie breaker when* the subtrees have equal frequency. This minimizes the worst case length.(tree, umber of codes at each bit length for an optimal tree [j + 1], umber of codes at each bit length for an optimal tree [j], The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.* The same heap array is used to build all trees.) Then

383

j++

386

If Compares to subtrees, using the tree depth as tie breaker when* the subtrees have equal frequency. This minimizes the worst case length.(tree, v, umber of codes at each bit length for an optimal tree [j], The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.* The same heap array is used to build all trees.) Then Break

389

umber of codes at each bit length for an optimal tree [k] = umber of codes at each bit length for an optimal tree [j]

389

k = j

392

j <<= 1

394

umber of codes at each bit length for an optimal tree [k] = v

**Caller**
Name	Describe
build_tree

Source code conversion tool public plug-in interface	X
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion