-
Notifications
You must be signed in to change notification settings - Fork 1.6k
/
Copy pathShannonFanoCompressorTests.cs
45 lines (38 loc) · 1.6 KB
/
ShannonFanoCompressorTests.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
using Algorithms.DataCompression;
using Algorithms.Knapsack;
using NUnit.Framework;
using NUnit.Framework.Internal;
namespace Algorithms.Tests.Compressors;
public static class ShannonFanoCompressorTests
{
[TestCase("dddddddddd", "1111111111")]
[TestCase("a", "1")]
[TestCase("", "")]
public static void CompressingPhrase(string uncompressedText, string expectedCompressedText)
{
//Arrange
var solver = new NaiveKnapsackSolver<(char, double)>();
var translator = new Translator();
var shannonFanoCompressor = new ShannonFanoCompressor(solver, translator);
//Act
var (compressedText, decompressionKeys) = shannonFanoCompressor.Compress(uncompressedText);
var decompressedText = translator.Translate(compressedText, decompressionKeys);
//Assert
Assert.That(compressedText, Is.EqualTo(expectedCompressedText));
Assert.That(decompressedText, Is.EqualTo(uncompressedText));
}
[Test]
public static void DecompressedTextTheSameAsOriginal([Random(0, 1000, 100)] int length)
{
//Arrange
var solver = new NaiveKnapsackSolver<(char, double)>();
var translator = new Translator();
var shannonFanoCompressor = new ShannonFanoCompressor(solver, translator);
var text = Randomizer.CreateRandomizer().GetString(length);
//Act
var (compressedText, decompressionKeys) = shannonFanoCompressor.Compress(text);
var decompressedText = translator.Translate(compressedText, decompressionKeys);
//Assert
Assert.That(decompressedText, Is.EqualTo(text));
}
}