def test_exampleTest(self):
#Can be cleaned up using txt file
CONTROL = [(-12.73564, 9.03455), (-26.77725, 15.89208),
(-42.12487, 20.57261), (-15.34799, 4.57169),
(-31.72987, 6.85753), (-49.14568, 6.85754),
(-38.09753, -1e-05), (-67.92234, -11.10268),
(-89.47453, -33.30804), (-21.44344, -22.31416),
(-32.16513, -53.33632), (-32.16511, -93.06657),
(-2e-05, -39.83887), (10.72167, -70.86103),
(32.16511, -93.06658), (21.55219, -22.31397),
(51.377, -33.47106), (89.47453, -33.47131),
(15.89191, 0.00025), (30.9676, 1.95954),
(45.22709, 5.87789), (14.36797, 3.91883),
(27.59321, 9.68786), (39.67575, 17.30712)]
#CONTROL = [(0.,0.), (0.,0.)]
KNOTS = linspace(0, 1, 26)
KNOTS[1] = KNOTS[2] = KNOTS[0]
KNOTS[-3] = KNOTS[-2] = KNOTS[-1]
c = CubicSpline(KNOTS, CONTROL)
result = c.point_eval(0.2)
#print(result)
expected = array([-31.90219167, 6.47655833])
#expected = array([-0.8, 6])
#self.assertAlmostEqual(result , expected)
self.assertAlmostEqual(result[0], expected[0])
self.assertAlmostEqual(result[1], expected[1])
def test_order(self):
random.shuffle(self.KNOTS)
cs = CubicSpline(self.CONTROL, self.KNOTS)
result = cs.point_eval(0.2)
expected = array([-31.90219167, 6.47655833])
self.assertAlmostEqual(result[0], expected[0])
self.assertAlmostEqual(result[1], expected[1])
def setUp(self):
#Might be cleaned up using txt document
self.CONTROL = [(-12.73564, 9.03455),
(-26.77725, 15.89208),
(-42.12487, 20.57261),
(-15.34799, 4.57169),
(-31.72987, 6.85753),
(-49.14568, 6.85754),
(-38.09753, -1e-05),
(-67.92234, -11.10268),
(-89.47453, -33.30804),
(-21.44344, -22.31416),
(-32.16513, -53.33632),
(-32.16511, -93.06657),
(-2e-05, -39.83887),
(10.72167, -70.86103),
(32.16511, -93.06658),
(21.55219, -22.31397),
(51.377, -33.47106),
(89.47453, -33.47131),
(15.89191, 0.00025),
(30.9676, 1.95954),
(45.22709, 5.87789),
(14.36797, 3.91883),
(27.59321, 9.68786),
(39.67575, 17.30712)]
self.KNOTS = linspace(0, 1, 26)
self.KNOTS[ 1] = self.KNOTS[ 2] = self.KNOTS[ 0]
self.KNOTS[-3] = self.KNOTS[-2] = self.KNOTS[-1]
self.KNOTS = r_[self.KNOTS, self.KNOTS[-1]]
#
#
# OBS, fel ordning här på parametrarna, observera
self.cs = CubicSpline(self.CONTROL, self.KNOTS)
def spline(self):
result = getattr(self, "_spline", None)
if result is None:
result = CubicSpline.FromFunctionValues(self.ordinates.data,
x=self.abscissae.data)
setattr(self, "_spline", result)
return result
def __init__ ( self, *arguments, **keywordArguments ):
"""Constructor."""
# . Initialization.
self.arclengths = None
self.splines = []
# . X and Y values.
if len ( arguments ) > 1:
x = arguments[0]
y = arguments[1]
else:
x = None
y = arguments[0]
# . Values.
npoints = len ( y )
nsplines = len ( y[0] )
# . Get local keyword arguments.
localKeywordArguments = dict ( keywordArguments )
localKeywordArguments["x"] = x
# . Calculate the individual splines.
# . Y is a list of vectors or similar.
for ispline in range ( nsplines ):
yValues = []
for i in range ( npoints ): yValues.append ( y[i][ispline] )
self.splines.append ( CubicSpline.FromFunctionValues ( yValues, **localKeywordArguments ) )
def test_null(self):
self.tearDown()
with self.assertRaises(TypeError):
csNew = CubicSpline(self.KNOTS, self.CONTROL)
def test_dimensions(self):
with self.assertRaises(ValueError):
cp_1D = [i[0] for i in self.CONTROL]
cs = CubicSpline(self.KNOTS, cp_1D)
class Test_CubicSpline(unittest.TestCase):
def setUp(self):
#Might be cleaned up using txt document
self.CONTROL = [(-12.73564, 9.03455),
(-26.77725, 15.89208),
(-42.12487, 20.57261),
(-15.34799, 4.57169),
(-31.72987, 6.85753),
(-49.14568, 6.85754),
(-38.09753, -1e-05),
(-67.92234, -11.10268),
(-89.47453, -33.30804),
(-21.44344, -22.31416),
(-32.16513, -53.33632),
(-32.16511, -93.06657),
(-2e-05, -39.83887),
(10.72167, -70.86103),
(32.16511, -93.06658),
(21.55219, -22.31397),
(51.377, -33.47106),
(89.47453, -33.47131),
(15.89191, 0.00025),
(30.9676, 1.95954),
(45.22709, 5.87789),
(14.36797, 3.91883),
(27.59321, 9.68786),
(39.67575, 17.30712)]
self.KNOTS = linspace(0, 1, 26)
self.KNOTS[ 1] = self.KNOTS[ 2] = self.KNOTS[ 0]
self.KNOTS[-3] = self.KNOTS[-2] = self.KNOTS[-1]
self.KNOTS = r_[self.KNOTS, self.KNOTS[-1]]
#
#
# OBS, fel ordning här på parametrarna, observera
self.cs = CubicSpline(self.CONTROL, self.KNOTS)
def tearDown(self):
self.CONTROL = None
self.KNOTS = None
self.cs = None
def test_exampleTest(self):
result = self.cs.point_eval(0.2)
expected = array([-31.90219167, 6.47655833])
self.assertAlmostEqual(result[0],expected[0])
self.assertAlmostEqual(result[1],expected[1])
def test_order(self):
random.shuffle(self.KNOTS)
cs = CubicSpline(self.CONTROL, self.KNOTS)
result = cs.point_eval(0.2)
expected = array([-31.90219167, 6.47655833])
self.assertAlmostEqual(result[0], expected[0])
self.assertAlmostEqual(result[1], expected[1])
def test_dimensions(self):
with self.assertRaises(ValueError):
cp_1D = [i[0] for i in self.CONTROL]
cs = CubicSpline(self.KNOTS, cp_1D)
def test_null(self):
self.tearDown()
with self.assertRaises(TypeError):
csNew = CubicSpline(self.KNOTS, self.CONTROL)
def test_blossom(self):
#self.cs.basis_function(self.KNOTS, 0.2)
bases = [self.cs.basis_function(self.KNOTS, i) for i in range(len(self.KNOTS)-3)]
bases_in_point = array([N(0.2) for N in bases])
cp = array(self.CONTROL)
result = zeros(2)
for i in range(2):
for j in range(len(cp)):
result[i] += cp[j,i]*bases_in_point[j]
expected = self.cs.point_eval(0.2)
self.assertAlmostEqual(result[0], expected[0])
self.assertAlmostEqual(result[1], expected[1])
def test_padded(self):
checker_left = checker_right = False
if (self.cs.knots[0] == self.cs.knots[1] and self.cs.knots[1] == self.cs.knots[2]):
checker_left = True
if (self.cs.knots[-1] == self.cs.knots[-2] and self.cs.knots[-2] == self.cs.knots[-3]):
checker_right = True
self.assertTrue(checker_left)
self.assertTrue(checker_right)
def test_basis_sum(self):
bases = [self.cs.basis_function(self.KNOTS, i) for i in range(len(self.KNOTS)-3)]
x = linspace(0,1, 200)
y = [[N(val) for val in x] for N in bases]
result = sum(y) / len(x)
print(len(y))
self.assertAlmostEqual(result, 1, delta = 0.05) #Good enough
#Y = zeros((1, len(x)))
#for element in y:
# Y += element
#self.assertEqual([y for y in Y], 1)
#checker = True
#for i in range(0,len(Y)):
# if Y[i] != 1:
# checker = False
#self.assertTrue(checker)
def test_basisFunctionPositive(self):
positiveValue = True
bases = [self.cs.basis_function(self.KNOTS,i) for i in range(len(self.KNOTS))]
for i in range(0,len(self.KNOTS)-3):
for j in linspace(0,1,200):
if bases[i](j) != -0.0:
positiveValue = bases[i](j) > 0
if positiveValue == False:
break
self.assertTrue(positiveValue)
def test_null(self):
self.tearDown()
cs = CubicSpline(self.KNOTS, self.CONTROL)
with self.assertRaises(TypeError):
cs.point_eval(0.2)