-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolver_Should.cs
More file actions
195 lines (177 loc) · 7.19 KB
/
Copy pathSolver_Should.cs
File metadata and controls
195 lines (177 loc) · 7.19 KB
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using NUnit.Framework;
namespace GaussAlgorithm
{
[TestFixture]
public class Solver_Should
{
private Solver _solver;
private readonly Random _random = new Random(764524336);
[SetUp]
public void SetUp()
{
_solver = new Solver();
}
[TestCase(1, 1, 42)]
[TestCase(1, 2, -42)]
[TestCase(1, -100, 0)]
[TestCase(1, 0, 0)]
[TestCase(1, 1, 21, 2, 42)]
[TestCase(1, 2, 42, 1, 21)]
[TestCase(1, 0, 0, 0, 0)]
public void SolveCommonCases_1x1(int columnCount, params double[] values) => AssertIsSolvable(columnCount, values);
[TestCase(2, 1, 2, 42)]
[TestCase(2, 0, -2, 42)]
[TestCase(2, -1, 0, 42)]
[TestCase(2, 0, 0, 0)]
[TestCase(2, 1, 2, 1, 3, -1, 2)]
[TestCase(2, 1, -2, 42, 2, 1, -31)]
[TestCase(2, -1, -2, -42, 2, 4, 84)]
[TestCase(2, 1, 2, 42, -2, -4, -84)]
public void SolveCommonCases_2x2(int columnCount, params double[] values) => AssertIsSolvable(columnCount, values);
[TestCase(3,
2, 4, 6, 12,
1, 2, 3, 6,
1, 1, 3, 5)]
[TestCase(3,
2, 4, 6, 12,
1, 2, 4, 7,
1, 2, 6, 9)]
[TestCase(3,
1.0, 1.0, 3.0, 5,
1.0, 3.0, 1.0, 5,
1.0, 2.0, 6.0, 9,
2.0, 4.0, 12.0, 18)]
public void SolveCommonCases_3x3(int columnCount, params double[] values) => AssertIsSolvable(columnCount, values);
[TestCase(2, 2)]
[TestCase(3, 3)]
[TestCase(4, 4)]
[TestCase(5, 5)]
[TestCase(10, 10)]
[TestCase(3, 5)]
[Repeat(500)]
public void SolveRandomMatrix(int rows, int columns)
{
var randomMatrix = CreateRandomMatrix(rows, columns);
var randomFreeMembers = GetRandomFreeMembers(randomMatrix);
var actualSolution = _solver.Solve(randomMatrix, randomFreeMembers);
AssertIsSolution(actualSolution, randomMatrix, randomFreeMembers, 1e-3);
}
[TestCase(1, 1, 1, 1, -1)]
[TestCase(2, 1, 2, 42, 2, 4, 42)]
[TestCase(3,
2, 4, 6, 12,
1, 2, 3, 6,
1, 2, 3, 7,
1, 1, 3, 5)]
public void ThrowsException_WhenNoSolution(int columnCount, params double[] args)
{
var (matrix, freeMembers) = BuildSystem(columnCount, args);
Assert.Throws<NoSolutionException>(() => _solver.Solve(matrix, freeMembers));
}
[TestCase(10)]
[TestCase(5)]
[TestCase(4)]
[TestCase(3)]
[TestCase(2)]
public void ThrowsException_WhenNoSolutionOnRandomMatrix(int matrixSize)
{
var (matrix, freeMembers) = CreateRandomSystemWithLinearlyDependentRows(matrixSize, false);
Assert.Throws<NoSolutionException>(() => _solver.Solve(matrix, freeMembers));
}
[TestCase(10)]
[TestCase(5)]
[TestCase(4)]
[TestCase(3)]
[TestCase(2)]
public void Solve_WhenHasLinearlyDependentRows(int matrixSize)
{
var (matrix, freeMembers) = CreateRandomSystemWithLinearlyDependentRows(matrixSize, true);
var actualSolution = _solver.Solve(matrix, freeMembers);
AssertIsSolution(actualSolution, matrix, freeMembers, 1e-3);
}
private void AssertIsSolvable(int columnCount, double[] values)
{
var (matrix, freeMembers) = BuildSystem(columnCount, values);
var actualSolution = _solver.Solve(matrix, freeMembers);
AssertIsSolution(actualSolution, matrix, freeMembers, 1e-3);
}
private static (double[][] matrix, double[] freeMembers) BuildSystem(int columnCount, double[] values)
{
var matrix = new List<double[]>();
var freeMembers = new List<double>();
var line = new List<double>();
for (var i = 0; i < values.Length; i++)
{
if ((i + 1) % (columnCount + 1) == 0)
{
matrix.Add(line.ToArray());
line = new List<double>();
freeMembers.Add(values[i]);
}
else
line.Add(values[i]);
}
return (matrix.ToArray(), freeMembers.ToArray());
}
private double[] GetRandomFreeMembers(double[][] matrix)
{
const int max = 100;
var xs = Enumerable.Range(0, matrix[0].Length).Select(c => _random.Next(-max, max));
var freeMembers = matrix.Select(row => row.Zip(xs, (f, s) => f * s).Sum()).ToArray();
return freeMembers;
}
private double[][] CreateRandomMatrix(int rows, int columns, int valuesRange = 1000)
{
return Enumerable.Range(0, rows).Select(r => CreateRandomRow(columns, valuesRange)).ToArray();
}
private double[] CreateRandomRow(int columns, int maxValue)
{
double[] row;
do
{
row = Enumerable.Range(0, columns).Select(c => (double) _random.Next(-maxValue, maxValue)).ToArray();
} while (row.All(x => Math.Abs(x) < 1e-3));
return row;
}
private (double[][] matrix, double[] freeMembers) CreateRandomSystemWithLinearlyDependentRows(int matrixSize,
bool isSolvable)
{
var matrix = CreateRandomMatrix(matrixSize, matrixSize);
var freeMembers = GetRandomFreeMembers(matrix);
var iRow = _random.Next(matrixSize);
int jRow;
do
{
jRow = _random.Next(matrixSize);
} while (iRow == jRow);
matrix[iRow] = matrix[jRow].ToArray();
freeMembers[iRow] = isSolvable ? freeMembers[jRow] : freeMembers[jRow] + 1;
return (matrix, freeMembers);
}
private static void AssertIsSolution(double[] actual, double[][] matrix, double[] freeMembers, double accuracy)
{
for (var i = 0; i < matrix.GetLength(0); i++)
{
var line = matrix[i];
var result = line.Select((element, j) => element * actual[j]).Sum();
Assert.AreEqual(freeMembers[i], result, accuracy,
GetAssertionMessage(matrix, freeMembers, actual, i + 1));
}
}
private static string GetAssertionMessage(
double[][] sourceMatrix, double[] freeMembers,
double[] actualSolution, int equationIndex)
{
var builder = new StringBuilder("The solution is incorrect!" + Environment.NewLine + Environment.NewLine);
builder.Append("Initial matrix:" + Environment.NewLine + sourceMatrix.FormatMatrix() + Environment.NewLine);
builder.Append("Free members: [" + string.Join(", ", freeMembers) + "]" + Environment.NewLine);
builder.Append("Your solution: [" + string.Join(", ", actualSolution) + "]" + Environment.NewLine);
builder.Append($"Equation #{equationIndex} is not satisfied");
return builder.ToString();
}
}
}