Module huffman

16-bit Huffman compression and decompression. Huffman compression and decompression routines written by Christian Rouet for his PIZ image file format.

Structs

• ShortCode 🔒

Enums

• Code 🔒

Constants

• DECODE_BITS 🔒
• DECODE_MASK 🔒
• DECODING_TABLE_SIZE 🔒
• ENCODE_BITS 🔒
• ENCODING_TABLE_SIZE 🔒
• INVALID_BIT_COUNT 🔒
• INVALID_CODE 🔒
• INVALID_TABLE_ENTRY 🔒
• INVALID_TABLE_SIZE 🔒
• LONGEST_LONG_RUN 🔒
• LONG_ZEROCODE_RUN 🔒
• NOT_ENOUGH_DATA 🔒
• SHORTEST_LONG_RUN 🔒
• SHORT_ZEROCODE_RUN 🔒
• TABLE_TOO_LONG 🔒
• TOO_MUCH_DATA 🔒

Functions

• build_canonical_table 🔒
  Build a “canonical” Huffman code table:
• build_decoding_table 🔒
  Build a decoding hash table based on the encoding table code:
• build_encoding_table 🔒
  Compute Huffman codes (based on frq input) and store them in frq:
• code 🔒
• compress
• count_frequencies 🔒
• decode_with_tables 🔒
  Decode (uncompress) n bits based on encoding & decoding tables:
• decompress
• encode_with_frequencies 🔒
• length 🔒
• pack_encoding_table 🔒
  Pack an encoding table:
• read_bits 🔒
• read_byte 🔒
• read_code_into_vec 🔒
• read_encoding_table 🔒
  Run-length-decompresses all zero runs from the packed table to the encoding table
• send_code 🔒
• write_bits 🔒
• write_code 🔒