From 7754ba52d2c5c25cec5340fbcb5db1836e47b59a Mon Sep 17 00:00:00 2001
From: Tobias Glaubach <tobias.glaubach@asinco.de>
Date: Tue, 10 Jul 2018 22:47:29 +0200
Subject: [PATCH] added tests for the Polynomial class

---
 src/Numerics.Tests/PolynomialTests.cs | 152 ++++++++++++++++++++++++++
 1 file changed, 152 insertions(+)
 create mode 100644 src/Numerics.Tests/PolynomialTests.cs

diff --git a/src/Numerics.Tests/PolynomialTests.cs b/src/Numerics.Tests/PolynomialTests.cs
new file mode 100644
index 00000000..0adf3ef6
--- /dev/null
+++ b/src/Numerics.Tests/PolynomialTests.cs
@@ -0,0 +1,152 @@
+// <copyright file="FitTests.cs" company="Math.NET">
+// Math.NET Numerics, part of the Math.NET Project
+// http://numerics.mathdotnet.com
+// http://github.com/mathnet/mathnet-numerics
+//
+// Copyright (c) 2009-2018 Math.NET
+//
+// Permission is hereby granted, free of charge, to any person
+// obtaining a copy of this software and associated documentation
+// files (the "Software"), to deal in the Software without
+// restriction, including without limitation the rights to use,
+// copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the
+// Software is furnished to do so, subject to the following
+// conditions:
+//
+// The above copyright notice and this permission notice shall be
+// included in all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
+// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
+// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+// OTHER DEALINGS IN THE SOFTWARE.
+// </copyright>
+
+using System;
+using System.Linq;
+using MathNet.Numerics;
+using MathNet.Numerics.LinearRegression;
+using MathNet.Numerics.Statistics;
+using NUnit.Framework;
+
+namespace MathNet.Numerics.UnitTests
+{
+    [TestFixture, Category("Calculus")]
+    public class PolynomialTests
+    {
+        [Test]
+        public void AddTest()
+        {
+            for (int i = 0; i < 5; i++)
+            {
+                for (int j = 0; j < 5; j++)
+                {
+                    var msg = String.Format("At i={0}, j={1}", i, j);
+                    var n = Math.Max(i, j) + 1;
+                    var tgt = new double[n];
+                    tgt[i] += 1;
+                    tgt[j] += 1;
+
+                    var c1 = new double[i + 1];
+                    var c2 = new double[j + 1];
+
+                    c1[i] = 1.0;
+                    c2[j] = 1.0;
+
+                    var p1 = new Polynomial(c1);
+                    var p2 = new Polynomial(c2);
+
+                    var p_res = Polynomial.add(p1, p2);
+                    var p_tar = new Polynomial(tgt);
+
+                    p_res.CutTrailZeros();
+                    p_tar.CutTrailZeros();
+
+                    Assert.AreEqual(p_tar.Length, p_res.Length);
+                    for (int k = 0; k < p_res.Length; k++)
+                    {
+                        Assert.AreEqual(p_tar.Coeffs[k], p_res.Coeffs[k], msg);
+                    }
+                }
+            }
+        }
+
+        [Test]
+        public void SubstractTest()
+        {
+            for (int i = 0; i < 5; i++)
+            {
+                for (int j = 0; j < 5; j++)
+                {
+                    var msg = String.Format("At i={0}, j={1}", i, j);
+                    var n = Math.Max(i, j) + 1;
+                    var tgt = new double[n];
+                    tgt[i] += 1;
+                    tgt[j] -= 1;
+
+                    var c1 = new double[i + 1];
+                    var c2 = new double[j + 1];
+
+                    c1[i] = 1.0;
+                    c2[j] = 1.0;
+
+                    var p1 = new Polynomial(c1);
+                    var p2 = new Polynomial(c2);
+
+                    var p_res = Polynomial.substract(p1, p2);
+                    var p_tar = new Polynomial(tgt);
+
+                    p_res.CutTrailZeros();
+                    p_tar.CutTrailZeros();
+
+                    Assert.AreEqual(p_tar.Length, p_res.Length);
+                    for (int k = 0; k < p_res.Length; k++)
+                    {
+                        Assert.AreEqual(p_tar.Coeffs[k], p_res.Coeffs[k], msg);
+                    }
+                }
+            }
+        }
+
+        [Test]
+        public void MultiplyTest()
+        {
+            for (int i = 0; i < 5; i++)
+            {
+                for (int j = 0; j < 5; j++)
+                {
+                    var msg = String.Format("At i={0}, j={1}", i, j);
+                    var n = i + j + 1;
+                    var tgt = new double[n];
+                    tgt[i + j] += 1;
+
+                    var c1 = new double[i + 1];
+                    var c2 = new double[j + 1];
+
+                    c1[i] = 1.0;
+                    c2[j] = 1.0;
+
+                    var p1 = new Polynomial(c1);
+                    var p2 = new Polynomial(c2);
+
+                    var p_res = p1 * p2;
+                    var p_tar = new Polynomial(tgt);
+
+                    p_res.CutTrailZeros();
+                    p_tar.CutTrailZeros();
+
+                    Assert.AreEqual(p_tar.Length, p_res.Length);
+                    for (int k = 0; k < p_res.Length; k++)
+                    {
+                        Assert.AreEqual(p_tar.Coeffs[k], p_res.Coeffs[k], msg);
+                    }
+                }
+            }
+        }
+    }
+}