Mercurial > repos > public > sbplib

comparison +parametrization/TiTest.m @ 707:0de70ec8bf60 feature/quantumTriangles

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge with feature/optim
author Ylva Rydin <ylva.rydin@telia.com>
date Fri, 10 Nov 2017 14:22:56 +0100
parents 77ad5de4432e
children
comparison
equal deleted inserted replaced
696:7c16b5af8d98 707:0de70ec8bf60
1 function tests = TiTest()
2 tests = functiontests(localfunctions);
3 end
4
5 function testScalarInput(testCase)
6 ti = getMinimumTi();
7
8 cases = {
9 % {u, v, out},
10 {0, 0, [1; 2]},
11 {0, 1, [1; 4]},
12 {1, 0, [3; 2]},
13 {1, 1, [3; 4]},
14 {0.5, 0.5, [2; 3]},
15 };
16
17 for i = 1:length(cases)
18 u = cases{i}{1};
19 v = cases{i}{2};
20 expected = cases{i}{3};
21
22 testCase.verifyEqual(ti.S(u,v), expected, sprintf('Case: %d',i));
23 end
24 end
25
26 function testRowVectorInput(testCase)
27 ti = getMinimumTi();
28
29 u = [0, 0.5, 1];
30 v = [0, 0, 0.5];
31 expected = [
32 1, 2, 3;
33 2, 2, 3;
34 ];
35
36 testCase.verifyEqual(ti.S(u,v), expected);
37 end
38
39 function testColumnvectorInput(testCase)
40 ti = getMinimumTi();
41
42 u = [0; 0.5; 1];
43 v = [0; 0; 0.5];
44 expected = [1; 2; 3; 2; 2; 3];
45
46 testCase.verifyEqual(ti.S(u,v), expected);
47 end
48
49
50 function ti = getMinimumTi()
51 ti = parametrization.Ti.rectangle([1; 2], [3; 4]);
52 end