Mercurial > hg > qm-dsp

comparison tests/TestFilter.cpp @ 476:2de6184b2ce0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Untabify
author Chris Cannam <cannam@all-day-breakfast.com>
date Thu, 30 May 2019 18:30:58 +0100
parents fa851e147e3f
children
comparison
equal deleted inserted replaced
475:64fc3009d0a3 476:2de6184b2ce0
36 f.process(in.data(), out.data(), n); 36 f.process(in.data(), out.data(), n);
37 37
38 double thresh = 1e-12; 38 double thresh = 1e-12;
39 39
40 for (int i = 0; i < n; ++i) { 40 for (int i = 0; i < n; ++i) {
41 BOOST_CHECK_SMALL(out[i] - expected[i], thresh); 41 BOOST_CHECK_SMALL(out[i] - expected[i], thresh);
42 } 42 }
43 } 43 }
44 44
45 BOOST_AUTO_TEST_CASE(iir_chunked) 45 BOOST_AUTO_TEST_CASE(iir_chunked)
46 { 46 {
54 vector<double> out(n, 0.0); 54 vector<double> out(n, 0.0);
55 55
56 int j = 0; 56 int j = 0;
57 int i = 0; 57 int i = 0;
58 while (j < n) { 58 while (j < n) {
59 if (++i == 4) { 59 if (++i == 4) {
60 i = 1; 60 i = 1;
61 } 61 }
62 if (j + i >= n) { 62 if (j + i >= n) {
63 i = n - j; 63 i = n - j;
64 } 64 }
65 f.process(in.data() + j, out.data() + j, i); 65 f.process(in.data() + j, out.data() + j, i);
66 j += i; 66 j += i;
67 } 67 }
68 68
69 double thresh = 1e-12; 69 double thresh = 1e-12;
70 70
71 for (int i = 0; i < n; ++i) { 71 for (int i = 0; i < n; ++i) {
72 BOOST_CHECK_SMALL(out[i] - expected[i], thresh); 72 BOOST_CHECK_SMALL(out[i] - expected[i], thresh);
73 } 73 }
74 } 74 }
75 75
76 BOOST_AUTO_TEST_CASE(fir) 76 BOOST_AUTO_TEST_CASE(fir)
77 { 77 {
86 f.process(in.data(), out.data(), n); 86 f.process(in.data(), out.data(), n);
87 87
88 double thresh = 1e-4; 88 double thresh = 1e-4;
89 89
90 for (int i = 0; i < n; ++i) { 90 for (int i = 0; i < n; ++i) {
91 BOOST_CHECK_SMALL(out[i] - expected[i], thresh); 91 BOOST_CHECK_SMALL(out[i] - expected[i], thresh);
92 } 92 }
93 } 93 }
94 94
95 BOOST_AUTO_TEST_SUITE_END() 95 BOOST_AUTO_TEST_SUITE_END()
96 96