CISC220 F2023 Lab8

Lab #8

1. File compression with Huffman coding

As discussed in class on Nov. 2, tries and Huffman coding can be used to compress files/messages by analyzing character frequencies and choosing bitcodes accordingly.

A nearly-complete Huffman class is defined for you in huffman.hh (code here). It uses a TrieNode class that stores parent and child links as well as the character being encoded and its frequency in the file being compressed.

The main work of Huffman happens in the following functions:

• compress()
  • Reads input file character by character and counts occurrences (aka computes frequency) for each, storing the results by ASCII index in the char_frequency vector
  • Applies the Huffman trie-building algorithm presented in class 11/2 in build_optimal_trie(). This function is TO BE WRITTEN BY YOU
  • Creates code look-up tables (string to char decompression_map and char to string compression_map) from the optimal trie in compute_all_codes_from_trie(). This function is TO BE WRITTEN BY YOU
  • Writes decompression_map as a header to the output file
  • Re-reads input file character by character and, using compression_map, writes encoded versions to the output file body (in ASCII or binary depending on do_binary flag)
• decompress()
  • Reads the code look-up table from header of input file to decompression_map
  • Reads rest of input file bitstream, gets character for each variable-length code read using decompression_map, and writes decoded versions to output file. The ASCII part of this function, ascii_decompress_body() is TO BE WRITTEN BY YOU

The "forest of tries" discussed in lecture is implemented in the Huffman class with an STL priority queue of TrieNode pointers (each representing the root of a subtrie), ordered on the combined frequency of each subtrie. This priority queue is called trie_pq.

The compiled executable is run as follows: huff <optional flags> <path to input file>

If the input filename has the suffix .huf, it will be decompressed to a plain-text file with an identical name except the suffix is changed to .HUF.

If the input filename has any other suffix, it will be compressed to a file with the suffix .huf.

The default compressor creates a binary file as output and the default decompressor expects a binary file as input. Feel free to compare the sizes of compressed files to the originals. However, for grading, compressed output will be written in ASCII and compressed input will also be expected to be ASCII. This is indicated by the optional flag -ascii.

The output files will be echoed to the terminal for grading for both compression (to test your build_optimal_trie() + compute_all_codes_from_trie() combination) and decompression (to test your ascii_decompress_body() in isolation). In order to test build_optimal_trie() alone, another optional flag -trie will print only a representation of the built trie and not echo the output file.

2. Sample inputs/outputs

This tarfile contains the following files:

• seashells.txt (there is a newline at the end of this file)
• seashells.txt.huf
• output1, output2, output3 (these are what is written to the terminal, not what is saved in a file)

output1 results from running ./huff -ascii seashells.txt output2 results from running ./huff -ascii -trie seashells.txt output3 results from running ./huff -ascii seashells.txt.huf

3. Programming tasks

The Huffman member functions to finish are in main.cpp -- don't make any changes in huffman.hh:

• [1 point] Huffman::ascii_decompress_body() : This function should read one "bit" (a '0' or '1' char) at a time from the input stream until a legal code is assembled, then write the corresponding decoded character to the output stream, and repeat until reaching the end of file
• [2 points] Huffman::build_optimal_trie() : This function should create a forest of one-node tries (aka trie_pq) representing the characters in the input file and their frequencies, then repeatedly combine the two smallest tries until only one is left according to the following instructions:
  • 1. Remove trie in trie_pq with SMALLEST frequency, assign to first, remove trie in PQ with NEXT SMALLEST frequency, assign to second
  • 2. Create new TrieNode and make first and second its left and right children, respectively. Set new node's frequency to the sum of first and second 's frequencies, and then put the whole thing back into the priority queue
• [2 points] Huffman::compute_all_codes_from_trie() : The function should recursively traverse the trie rooted at T to determine the huffcode string at every leaf and initialize compression_map and decompression_map with this information

4. Submission

Once again, you may work with a (human) partner on this lab.

Submit 2 files to Gradescope: (1) your README and (2) your modified main.cpp. The README should contain your name and your partner's name, notes on any limitations or issues with your code, and your interpretation of any ambiguities in the assignment instructions. Your main.cpp should also contain your name(s)