I worked on my own implementation of the minimum priority queue, the MinQueue data structure. A lot of new documentation was also written.
Huffman and LZW are done and tested. I've also implemented all of the required data structures myself (minimum priority queue and ternary search tree).
Too much time went into building the minimum priority queue because I just implemented many features that turned out not to be needed at all. Huffman doesn't remove items from the priority queue, without polling, so a remove-function wasn't necessary (for an example).
How useful it is to measure algorithms to see which parts are taking the most time. Then you'll know what to focus on to gain the greatest performance improvements.
I almost didn't measure the part that uses Java's substring-method, but I'm glad I did because that was the root cause of my problems. So I learned that I shouldn't assume that something's not the problem when I don't have previous knowledge that that's the case (or could be the case).
What's unclear is what files aren't needed in my repository. I'm including the Gradle wrapper and other Gradle files.
How to make LZW compression faster. I'll work on that for the final week, but if I'm unable to make it any faster, I'm still happy about the way it came out.
For the next week, I'll do the second peer review and do it well.
Improvements here and there (especially on LZW) as well as documentation are also on the agenda. I'll also write a few more tests to fill any gaps that might've been left.
I'll also go through the requirements to see if I've missed anything.
19 hours so far.