test(spline): Simplified and reduced redundancy

Author: pasabanov

tests/spline/test_cubic.cpp

@@ -41,9 +41,8 @@ TEST(CubicSplineTest, General) {
 	const std::vector<double> X = {0, 1, 2, 3};
 	const std::vector<double> Y = {5, 2, 10, 4};
 	const auto spline = alfi::spline::CubicSpline(X, Y);
-	for (size_t i = 0; i < X.size() - 1; ++i) {
+	for (size_t i = 0; i < X.size(); ++i) {
 		EXPECT_EQ(spline(X[i]), Y[i]);
-		EXPECT_EQ(spline(X[i+1]), Y[i+1]);
 	}
 }
 

tests/spline/test_linear.cpp

@@ -36,8 +36,6 @@ TEST(LinearSplineTest, General) {
 		// exact points
 		EXPECT_EQ(spline(X[i]), Y[i]);
 		EXPECT_EQ(spline(X[i+1]), Y[i+1]);
-		EXPECT_EQ(spline(X[i]), Y[i]);
-		EXPECT_EQ(spline(X[i+1]), Y[i+1]);
 		// between points
 		EXPECT_DOUBLE_EQ(spline(X[i] + epsilon), Y[i] + epsilon * (Y[i+1] - Y[i]));
 		EXPECT_DOUBLE_EQ(spline((X[i]+X[i+1])/2), (Y[i] + Y[i+1])/2);

tests/spline/test_quadratic.cpp

@@ -43,9 +43,8 @@ TEST(QuadraticSplineTest, General) {
 	const std::vector<double> X = {0, 1, 2, 3};
 	const std::vector<double> Y = {5, 2, 10, 4};
 	const auto spline = alfi::spline::QuadraticSpline(X, Y);
-	for (size_t i = 0; i < X.size() - 1; ++i) {
+	for (size_t i = 0; i < X.size(); ++i) {
 		EXPECT_EQ(spline(X[i]), Y[i]);
-		EXPECT_EQ(spline(X[i+1]), Y[i+1]);
 	}
 }