Skip to content
Snippets Groups Projects
Commit b3dbe0b5 authored by Adam Blank's avatar Adam Blank
Browse files

Cleans up patch

parent b8386e57
No related branches found
No related tags found
No related merge requests found
......@@ -79,7 +79,6 @@ public class HuffmanCompressor
int[] bl_counts;
int minNumCodes, numCodes;
int maxLength;
boolean single;
Tree(int elems, int minCodes, int maxLength) {
super(BitString.class);
......@@ -272,14 +271,6 @@ public class HuffmanCompressor
Node real = heap.next();
heap.add(new Node(null, real));
}
/*
while (heap.size() < 2) {
int node = maxCode < 2 ? ++maxCode : 0;
Node n = new Node(0, node);
heap.add(n);
maxCode++;
}
*/
numCodes = Math.max(maxCode + 1, minNumCodes);
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment