-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHuffmanEncoder.java
108 lines (95 loc) · 4.04 KB
/
HuffmanEncoder.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
package huffmanish;
import java.io.*;
import java.util.*;
public class HuffmanEncoder {
private static HashMap<Character, Integer> getFrequencies(String filename) throws FileNotFoundException,
IOException {
BufferedReader reader = new BufferedReader(new FileReader(filename));
HashMap<Character, Integer> frequencies = new HashMap<Character, Integer>();
while (reader.ready()) {
char c = (char) reader.read();
if (frequencies.containsKey(c)) {
frequencies.put(c, 1 + frequencies.get(c));
} else {
frequencies.put(c, 1);
}
}
reader.close();
return frequencies;
}
private static PriorityQueue<HuffmanNode> makePQ(HashMap<Character, Integer> frequencies) {
// Reverse comparator - to ensure higher frequency items are removed from the priority queue first.
Comparator<HuffmanNode> comparator = new Comparator<HuffmanNode>() {
public int compare(HuffmanNode o1, HuffmanNode o2) {
return o1.getFrequency() - o2.getFrequency();
}
};
PriorityQueue<HuffmanNode> PQ = new PriorityQueue<>(frequencies.keySet().size(), comparator);
for (Character c : frequencies.keySet()) {
HuffmanNode<Character> node = new HuffmanNode<Character>(c, frequencies.get(c));
PQ.add(node);
}
return PQ;
}
private static HuffmanNode<Character> makeTree(PriorityQueue<HuffmanNode> PQ) {
while (PQ.size() > 1) {
HuffmanNode a = PQ.remove();
HuffmanNode b = PQ.remove();
HuffmanNode c = new HuffmanNode(a, b);
PQ.add(c);
}
return PQ.remove();
}
private static BitSet makeBitSet(String filename, Map<Character, Integer> frequencies,
Map<Character, String> codes) throws IOException {
// Calculate total number of bits to represent the characters.
int totalBits = 0;
for (char c : frequencies.keySet()) {
totalBits += frequencies.get(c) * codes.get(c).length();
}
BitSet fileBitSet = new BitSet(totalBits);
int currBitIndex = 0;
BufferedReader reader = new BufferedReader(new FileReader(filename));
while (reader.ready()) {
char current = (char) reader.read();
String code = codes.get(current);
for (int i = 0; i < code.length(); i++) {
if (code.charAt(i) == '1') {
fileBitSet.set(currBitIndex + i);
}
}
currBitIndex += code.length();
}
return fileBitSet;
}
public static void main( String[] args )
{
if (args.length < 1) {
System.out.println("ERROR: Invalid arguments. Must specify read/write and filename as args.");
return;
}
String filename = args[0];
try {
HashMap<Character, Integer> frequencies = getFrequencies(filename);
PriorityQueue<HuffmanNode> PQ = makePQ(frequencies);
if (PQ.size() == 0) {
System.out.println("Found empty file, no need to compress.");
return;
}
HuffmanTree tree = new HuffmanTree(makeTree(PQ));
Map<Character, String> codes = tree.getCodes();
BitSet fileBitSet = makeBitSet(filename, frequencies, codes);
String compressedFileName = filename + ".huffmanish";
FileOutputStream outputStream = new FileOutputStream(compressedFileName, false);
ObjectOutputStream objectStream = new ObjectOutputStream(outputStream);
objectStream.writeObject(tree);
objectStream.writeObject(fileBitSet);
objectStream.close();
outputStream.close();
} catch (FileNotFoundException e) {
System.out.println("ERROR: File not found.");
} catch (java.io.IOException e) {
System.out.println("ERROR with inputted file: IO Exception.");
}
}
}