-
Notifications
You must be signed in to change notification settings - Fork 0
/
Huffman.cs
514 lines (419 loc) · 12.9 KB
/
Huffman.cs
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
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using Huffman.PrintVisitors;
using System.Diagnostics;
namespace Huffman.PrintVisitors
{
public interface IVisitedNode
{
void Accept(IVisitor v);
}
public interface IVisitor
{
void Visit(LeafNode node);
void Visit(BranchNode node);
}
public class PrintVisitor : IVisitor, IDisposable
{
private readonly TextWriter _writer;
private readonly List<Indent> _indents;
public PrintVisitor(TextWriter writer)
{
_writer = writer;
_indents = new List<Indent>();
}
public void Visit(LeafNode node)
{
_writer.Write(node);
WriteEndLine();
}
public void Visit(BranchNode node)
{
_writer.Write("{0,4} -+- ", node);
// First indent is SpaceSix, otherwise SpaceEight
Add(_indents.Any() ? Indent.SpaceEight : Indent.SpaceSix);
VisitNodeUsingIndent(node.RightSon, Indent.LineDown);
_writer.Write(CreateStringFromIndents(Indent.LineDown));
WriteEndLine();
_writer.Write(CreateStringFromIndents(Indent.DownRight));
VisitNodeUsingIndent(node.LeftSon, Indent.SpaceOne);
// Remove last indent (SpaceEight or SpaceSix)
RemoveLast();
}
/// <summary>
/// Method calls methods Close and Dispose on <see cref="_writer"/>
/// </summary>
void IDisposable.Dispose()
{
_writer.Close();
_writer.Dispose();
}
/// <summary>
/// Method add <paramref name="indent"/> to <see cref="_indents"/>.
/// Call Accept on <paramref name="node"/> and remove
/// last <see cref="Indent"/> from <see cref="_indents"/>
/// </summary>
/// <param name="node"></param>
/// <param name="indent"></param>
private void VisitNodeUsingIndent(Node node, Indent indent)
{
Add(indent);
node.Accept(this);
RemoveLast();
}
/// <summary>
/// Add indent to <see cref="_indents"/>
/// </summary>
/// <param name="indent"></param>
private void Add(Indent indent)
{
_indents.Add(indent);
}
/// <summary>
/// Remove last indent from <see cref="_indents"/>
/// </summary>
private void RemoveLast()
{
_indents.RemoveAt(_indents.Count - 1);
}
/// <summary>
/// Write end of line (this "\n").
/// We are using this, because WriteLine writes "\n" or "\r\n"
/// </summary>
private void WriteEndLine()
{
_writer.Write("\n");
}
/// <summary>
/// Create string from <see cref="_indents"/> and
/// <paramref name="lastIndent"/>
/// </summary>
/// <param name="lastIndent">
/// last indent using for creating string
/// </param>
/// <returns></returns>
private string CreateStringFromIndents(Indent lastIndent)
{
string result = "";
Add(lastIndent);
foreach (var indent in _indents)
{
switch (indent)
{
case Indent.SpaceOne:
result += GetSpaces(1);
break;
case Indent.SpaceSix:
result += GetSpaces(6);
break;
case Indent.SpaceEight:
result += GetSpaces(8);
break;
case Indent.LineDown:
result += "|";
break;
case Indent.DownRight:
result += "`- ";
break;
default:
throw new ArgumentOutOfRangeException();
}
}
RemoveLast();
return result;
}
/// <summary>
/// Create string contains only " ".
/// </summary>
/// <param name="count">Number of " " in the result</param>
/// <returns>string contains " "</returns>
private string GetSpaces(int count)
{
return "".PadLeft(count);
}
}
}
namespace Huffman
{
public enum Indent
{
SpaceOne,
SpaceSix,
SpaceEight,
LineDown,
DownRight
}
public abstract class Node : IComparable<Node>, IVisitedNode
{
private readonly ulong _sum;
protected Node(ulong sum)
{
_sum = sum;
}
public ulong Sum
{
get { return _sum; }
}
public abstract bool IsLeaf { get; }
int IComparable<Node>.CompareTo(Node other)
{
//By sum
if (Sum < other.Sum)
return -1;
if (Sum > other.Sum)
return 1;
// Same type (both are leafs or not)
if (IsLeaf == other.IsLeaf)
return Compare(other);
// One is leaf
return IsLeaf ? -1 : 1;
}
public abstract void Accept(IVisitor v);
protected abstract int Compare(Node other);
}
public class BranchNode : Node
{
private readonly Node _leftSon;
private readonly Node _rightSon;
private readonly int _order;
public BranchNode(Node leftSon, Node rightSon, int order)
: base(leftSon.Sum + rightSon.Sum)
{
_leftSon = leftSon;
_rightSon = rightSon;
_order = order;
}
public Node LeftSon
{
get { return _leftSon; }
}
public Node RightSon
{
get { return _rightSon; }
}
public int Order
{
get { return _order; }
}
public override bool IsLeaf
{
get { return false; }
}
public override string ToString()
{
return Sum.ToString();
}
public override void Accept(IVisitor v)
{
v.Visit(this);
}
protected override int Compare(Node other)
{
return Order - ((BranchNode)other).Order;
}
}
public class LeafNode : Node
{
private readonly byte _symbol;
public LeafNode(byte symbol, ulong sum)
: base(sum)
{
_symbol = symbol;
}
public byte Symbol
{
get { return _symbol; }
}
public override bool IsLeaf
{
get { return true; }
}
public override string ToString()
{
return IsPrintableCharacter(Symbol)
? string.Format(" ['{0}':{1}]", (char)Symbol, Sum)
: string.Format(" [{0}:{1}]", Symbol, Sum);
}
public override void Accept(IVisitor v)
{
v.Visit(this);
}
protected override int Compare(Node other)
{
return Symbol - ((LeafNode)other).Symbol;
}
private bool IsPrintableCharacter(byte candidate)
{
return !(candidate < 32 || candidate > 126);
}
}
public class HuffmanTree
{
private readonly Dictionary<ulong, List<Node>> _nodes;
private Node _root;
private int _order;
public HuffmanTree(Dictionary<byte, ulong> frequencies)
{
_nodes =
frequencies
.Select(pair => (Node)new LeafNode(pair.Key, pair.Value))
.GroupBy(node => node.Sum)
.ToDictionary(nodes => nodes.Key, nodes => nodes.ToList());
}
public Node Root
{
get
{
if (_root == null)
BuildTree();
return _root;
}
}
private void BuildTree()
{
// count of all nodes
var count = _nodes.SelectMany(pair => pair.Value).Count();
while (count > 1)
{
// Get two nodes with minimal values
var minNode = RemoveMinNode();
var secondMinNode = RemoveMinNode();
// Create new BranchNode
var node = new BranchNode(minNode, secondMinNode, _order++);
// Add new node to Dictionary
if (_nodes.ContainsKey(node.Sum))
_nodes[node.Sum].Add(node);
else
_nodes.Add(node.Sum, new List<Node> { node });
count--;
}
// Set Root node
_root = _nodes.Single().Value.Single();
}
/// <summary>
/// Remove and return Node from <see cref="_nodes"/>.
/// </summary>
/// <returns></returns>
private Node RemoveMinNode()
{
var minKey = _nodes.Keys.Min();
var nodes = _nodes[minKey];
var minNode = nodes.Min();
nodes.Remove(minNode);
if (!nodes.Any())
_nodes.Remove(minKey);
return minNode;
}
}
public class Reader : IDisposable
{
private readonly BinaryReader _reader;
private const int MaxBufferSize = 10000;
public Reader(Stream stream)
{
_reader = new BinaryReader(stream);
}
/// <summary>
/// Read bytes from <see cref="_reader"/> using buffer.
/// </summary>
/// <returns>
/// <see cref="Dictionary{TKey,TValue}"/>
/// where TKey is readed symbol and TValue is count of that symbol
/// </returns>
public Dictionary<byte, ulong> ReadFileByteFrequencies()
{
SetReaderToStart();
var frequencies = new Dictionary<byte, ulong>();
while (_reader.BaseStream.Position != _reader.BaseStream.Length)
{
var difference =
_reader.BaseStream.Length - _reader.BaseStream.Position;
var bufferSize = difference < MaxBufferSize
? (int)difference
: MaxBufferSize;
var buffer = _reader.ReadBytes(bufferSize);
foreach (var readedByte in buffer)
{
if (frequencies.ContainsKey(readedByte))
frequencies[readedByte]++;
else
frequencies.Add(readedByte, 1);
}
}
return frequencies;
}
/// <summary>
/// Set <see cref="_reader"/> to position 0.
/// </summary>
private void SetReaderToStart()
{
_reader.BaseStream.Position = 0;
}
void IDisposable.Dispose()
{
_reader.Close();
_reader.Dispose();
}
}
class Program
{
static void Main(string[] args)
{
if (!CheckParameters(args))
{
Console.WriteLine("Argument Error");
return;
}
Stream stream;
if (!TryCreateStream(args[0], out stream))
{
Console.WriteLine("File Error");
return;
}
var stopwatch = new Stopwatch();
stopwatch.Start();
Dictionary<byte, ulong> frequencies;
using (var reader = new Reader(stream))
{ // Read frequencies from file
frequencies = reader.ReadFileByteFrequencies();
}
// empty file
if (!frequencies.Any())
return;
// Get root node from tree
var root = new HuffmanTree(frequencies).Root;
// Print tree
//using (var visitor =
// new PrintVisitor(new StreamWriter("D:\\out.out")))
using (var visitor = new PrintVisitor(Console.Out))
{
root.Accept(visitor);
//Console.Write("\n");
}
stopwatch.Stop();
Console.Write("Minutes :{0}\nSeconds :{1}\n Mili seconds :{2}",
stopwatch.Elapsed.Minutes, stopwatch.Elapsed.Seconds,
stopwatch.Elapsed.TotalMilliseconds);
Console.ReadLine();
}
private static bool CheckParameters(string[] parameters)
{
return parameters.Length == 1;
}
private static bool TryCreateStream(string fileName, out Stream stream)
{
try
{
stream = File.OpenRead(fileName);
return true;
}
catch (Exception)
{
stream = null;
return false;
}
}
}
}