aboutsummaryrefslogtreecommitdiff
path: root/test/common/huffman.h
AgeCommit message (Collapse)Author
2019-04-13COMMON: Use a prefix table to speed up the Huffman decoderBastien Bouclet
Symbols for codes shorter than the prefix table index width are stored in the table. All the entries in the table with an index starting with the code are set to the symbol value. That way, when decoding it is possible to get the number of bits corresponding to the table width from the bitstream and directly find the symbol value. Longer code still need to be searched for in the codes list.
2013-07-10TEST: Thorough testing for common/hash-str.hTobia Tesan
We test the various equal_to and hash functions therein.
2013-07-10TEST: tests for common/huffman.hTobia Tesan
A few tests for the Huffman decoder. The encoding is the example from Wikipedia. This could be improved by someone more knowledgeable by generating one at runtime or using multiple encodings which would each contain one edge case.