Mercurial > hg > qm-dsp

comparison tests/TestDCT.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 4ae4229a074a
children
comparison
equal deleted inserted replaced
475:64fc3009d0a3 476:2de6184b2ce0
104 double thresh = 1e-4; 104 double thresh = 1e-4;
105 105
106 d.forward(in.data(), out.data()); 106 d.forward(in.data(), out.data());
107 107
108 for (int i = 0; i < n; ++i) { 108 for (int i = 0; i < n; ++i) {
109 BOOST_CHECK_SMALL(expected[i] - out[i], thresh); 109 BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
110 } 110 }
111 111
112 d.inverse(out.data(), inv.data()); 112 d.inverse(out.data(), inv.data());
113 113
114 for (int i = 0; i < n; ++i) { 114 for (int i = 0; i < n; ++i) {
115 BOOST_CHECK_SMALL(in[i] - inv[i], thresh); 115 BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
116 } 116 }
117 117
118 // do it again, just in case some internal state was modified in inverse 118 // do it again, just in case some internal state was modified in inverse
119 119
120 d.forward(in.data(), out.data()); 120 d.forward(in.data(), out.data());
121 121
122 for (int i = 0; i < n; ++i) { 122 for (int i = 0; i < n; ++i) {
123 BOOST_CHECK_SMALL(expected[i] - out[i], thresh); 123 BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
124 } 124 }
125 } 125 }
126 126
127 BOOST_AUTO_TEST_CASE(u4) 127 BOOST_AUTO_TEST_CASE(u4)
128 { 128 {
138 double thresh = 1e-4; 138 double thresh = 1e-4;
139 139
140 d.forwardUnitary(in.data(), out.data()); 140 d.forwardUnitary(in.data(), out.data());
141 141
142 for (int i = 0; i < n; ++i) { 142 for (int i = 0; i < n; ++i) {
143 BOOST_CHECK_SMALL(expected[i] - out[i], thresh); 143 BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
144 } 144 }
145 145
146 d.inverseUnitary(out.data(), inv.data()); 146 d.inverseUnitary(out.data(), inv.data());
147 147
148 for (int i = 0; i < n; ++i) { 148 for (int i = 0; i < n; ++i) {
149 BOOST_CHECK_SMALL(in[i] - inv[i], thresh); 149 BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
150 } 150 }
151 151
152 // do it again, just in case some internal state was modified in inverse 152 // do it again, just in case some internal state was modified in inverse
153 153
154 d.forwardUnitary(in.data(), out.data()); 154 d.forwardUnitary(in.data(), out.data());
155 155
156 for (int i = 0; i < n; ++i) { 156 for (int i = 0; i < n; ++i) {
157 BOOST_CHECK_SMALL(expected[i] - out[i], thresh); 157 BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
158 } 158 }
159 } 159 }
160 160
161 BOOST_AUTO_TEST_CASE(u5) 161 BOOST_AUTO_TEST_CASE(u5)
162 { 162 {
172 double thresh = 1e-4; 172 double thresh = 1e-4;
173 173
174 d.forwardUnitary(in.data(), out.data()); 174 d.forwardUnitary(in.data(), out.data());
175 175
176 for (int i = 0; i < n; ++i) { 176 for (int i = 0; i < n; ++i) {
177 BOOST_CHECK_SMALL(expected[i] - out[i], thresh); 177 BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
178 } 178 }
179 179
180 d.inverseUnitary(out.data(), inv.data()); 180 d.inverseUnitary(out.data(), inv.data());
181 181
182 for (int i = 0; i < n; ++i) { 182 for (int i = 0; i < n; ++i) {
183 BOOST_CHECK_SMALL(in[i] - inv[i], thresh); 183 BOOST_CHECK_SMALL(in[i] - inv[i], thresh);
184 } 184 }
185 185
186 // do it again, just in case some internal state was modified in inverse 186 // do it again, just in case some internal state was modified in inverse
187 187
188 d.forwardUnitary(in.data(), out.data()); 188 d.forwardUnitary(in.data(), out.data());
189 189
190 for (int i = 0; i < n; ++i) { 190 for (int i = 0; i < n; ++i) {
191 BOOST_CHECK_SMALL(expected[i] - out[i], thresh); 191 BOOST_CHECK_SMALL(expected[i] - out[i], thresh);
192 } 192 }
193 } 193 }
194 194
195 BOOST_AUTO_TEST_SUITE_END() 195 BOOST_AUTO_TEST_SUITE_END()
196 196