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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
|
Welcome to TDDD86 Shrink-It!
This program uses the Huffman coding algorithm for compression.
Any file can be compressed by this method, often with substantial
savings. Decompression will faithfully reproduce the original.
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 1
Read from a s)tring or f)ile? s
Type the string to process: ab ab cab
Building frequency table ...
32: ' ' => 2
97: 'a' => 3
98: 'b' => 3
99: 'c' => 1
256: EOF => 1
5 character frequencies found.
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 2
Building encoding tree ...
{'b' (98), count=3}
{NOT, count=6}
{'a' (97), count=3}
{NOT, count=10}
{EOF (256), count=1}
{NOT, count=2}
{'c' (99), count=1}
{NOT, count=4}
{' ' (32), count=2}
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 3
Building encoding map ...
32: ' ' => 00
97: 'a' => 10
98: 'b' => 11
99: 'c' => 010
256: EOF => 011
5 character encodings found.
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 4
Reuse your previous string/file data for encoding? y
Encoding data ...
Here is the binary encoded data (3 bytes):
10110010 11000101 01101100
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 5
Read from a s)tring or f)ile? s
Type the string to process: 10110010 11000101 01101100
Decoding data ...
Here is the decoded data (9 bytes):
ab ab cab
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 1
Read from a s)tring or f)ile? s
Type the string to process: happy hip hop
Building frequency table ...
32: ' ' => 2
97: 'a' => 1
104: 'h' => 3
105: 'i' => 1
111: 'o' => 1
112: 'p' => 4
121: 'y' => 1
256: EOF => 1
8 character frequencies found.
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 2
Building encoding tree ...
{'y' (121), count=1}
{NOT, count=2}
{'o' (111), count=1}
{NOT, count=4}
{'i' (105), count=1}
{NOT, count=2}
{'a' (97), count=1}
{NOT, count=8}
{'p' (112), count=4}
{NOT, count=14}
{' ' (32), count=2}
{NOT, count=3}
{EOF (256), count=1}
{NOT, count=6}
{'h' (104), count=3}
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 3
Building encoding map ...
32: ' ' => 011
97: 'a' => 1100
104: 'h' => 00
105: 'i' => 1101
111: 'o' => 1110
112: 'p' => 10
121: 'y' => 1111
256: EOF => 010
8 character encodings found.
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 4
Reuse your previous string/file data for encoding? y
Encoding data ...
Here is the binary encoded data (5 bytes):
00110010 10111101 10011011 00110011 10100100
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 4
Reuse your previous string/file data for encoding? n
Read from a s)tring or f)ile? s
Type the string to process: hippy happy hoppy
Encoding data ...
Here is the binary encoded data (7 bytes):
00110110 10111101 10011001 01011110 11001110 10101111 01000000
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? 5
Read from a s)tring or f)ile? s
Type the string to process: 00 1101 10 10 1110 011 00 1101 10 10 1110 010
Decoding data ...
Here is the decoded data (11 bytes):
hippo hippo
1) build character frequency table
2) build encoding tree
3) build encoding map
4) encode data
5) decode data
C) compress file
D) decompress file
F) free tree memory
B) binary file viewer
T) text file viewer
S) side-by-side file comparison
Q) quit
Your choice? q
Exiting.
|
