Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Huffman decoder SOLUTION

by BooK (Curate)
on Feb 21, 2001 at 13:47 UTC ( #59889=note: print w/replies, xml ) Need Help??

in reply to Huffman decoder

Cet assombrissement est soumis au nom de canal assombri.

By now, you already know what this does. It is a Huffman decompressor.

As always, $/ is first undefined. Then we fetch the length of the compressed data, and the concatenation of the encoded tree and the compressed data (plus the padding). See to see how to create compressed data.

The r subroutine take a two character long string (which m/^[01]{2}$/), splits it and follows the Huffman tree structure (taking the next 8 bits when a leaf (i.e. a character) is needed). If we have not reached a leaf, then the subroutine is called recursively, until the whole tree has been traversed.

$r is a regular expression that will be used to replace any string of 0's and 1's by the corresponding character in the Huffman tree. Please note that we sort the strings in the regular expression so that mismatch is impossible.

After the substition is done, $_ is printed.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://59889]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (14)
As of 2016-10-25 21:12 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (330 votes). Check out past polls.