decompress.impl
Impl.Decompress_tree
decompress
module Heap = Decompress_heap
val reverse_package_merge : int array -> int -> int -> int array
Compute the optimal bit lengths for a tree.
p must be sorted by increasing frequency.
p
exception OK
val get_lengths : int array -> int -> int array
val get_codes_from_lengths : ?max_code_length:int -> int array -> int array