38 BOOST_CHECK_CLOSE( system.
NormalizeX( 512345678 ), 12.345678, 1e-9 );
39 BOOST_CHECK_CLOSE( system.
NormalizeY( 698765433 ), -1.234567, 1e-9 );
40 BOOST_CHECK_CLOSE( system.
DenormalizeX( 12.345678 ), 512345678.0, 1e-9 );
41 BOOST_CHECK_CLOSE( system.
DenormalizeY( -1.234567 ), 698765433.0, 1e-9 );
94 std::vector<std::chrono::microseconds> samples;
96 for(
int run = 0; run < 20; ++run )
98 auto start = std::chrono::steady_clock::now();
100 GCS::VEC_pD unknowns;
102 for(
int i = 0; i < 128; ++i )
108 for(
int relation = 0; relation < 64; ++relation )
109 system.
Solver().addConstraintEqual( unknowns[relation * 2],
110 unknowns[relation * 2 + 1], relation + 1 );
112 system.
Solver().declareUnknowns( unknowns );
113 system.
Solver().initSolution();
114 int solveResult = system.
Solver().solve();
115 BOOST_CHECK( solveResult == GCS::Success || solveResult == GCS::Converged );
116 system.
Solver().applySolution();
117 samples.push_back( std::chrono::duration_cast<std::chrono::microseconds>(
118 std::chrono::steady_clock::now() - start ) );
121 std::sort( samples.begin(), samples.end() );
122 std::chrono::microseconds p95 = samples[18];
123 BOOST_TEST_MESSAGE(
"128-parameter/64-relation solve p95: " << p95.count() <<
" us" );
126#if !defined( KICAD_SANITIZE_THREADS ) && !defined( KICAD_SANITIZE_ADDRESS )
127 BOOST_CHECK_LE( p95.count(), 16000 );
134 auto start = std::chrono::steady_clock::now();
136 GCS::VEC_pD unknowns;
138 for(
int i = 0; i < 1024; ++i )
144 for(
int relation = 0; relation < 512; ++relation )
145 system.
Solver().addConstraintEqual( unknowns[relation * 2],
146 unknowns[relation * 2 + 1], relation + 1 );
148 system.
Solver().declareUnknowns( unknowns );
149 system.
Solver().initSolution();
150 int solveResult = system.
Solver().solve();
151 BOOST_CHECK( solveResult == GCS::Success || solveResult == GCS::Converged );
152 system.
Solver().applySolution();
153 auto elapsed = std::chrono::duration_cast<std::chrono::microseconds>(
154 std::chrono::steady_clock::now() - start );
155 BOOST_TEST_MESSAGE(
"1024-parameter/512-relation solve: " << elapsed.count() <<
" us" );
163 std::vector<double> storage{ 1.0, 2.0, 3.0, 4.0 };
164 GCS::VEC_pD declared{ &storage[3], &storage[1], &storage[2], &storage[0] };
166 GCS::ConstraintEqual first( &storage[0], &storage[3] );
167 GCS::ConstraintEqual second( &storage[1], &storage[2] );
168 std::vector<GCS::Constraint*> constraints{ &first, &second };
170 GCS::SubSystem subsystem( constraints, declared );
171 GCS::VEC_pD unknowns;
172 subsystem.getParamList( unknowns );
177 GCS::MAP_pD_pD reduction{ { &storage[2], &storage[1] } };
178 GCS::SubSystem reduced( constraints, declared, reduction );
179 GCS::VEC_pD reducedUnknowns;
180 reduced.getParamList( reducedUnknowns );
182 BOOST_CHECK( reducedUnknowns == GCS::VEC_pD( { &storage[3], &storage[1], &storage[0] } ) );
189 const std::vector<double> start{ 0.0, 0.0, 10.0, 5.0, 20.0, 0.0, 20.0, 10.0 };
191 const auto solve = [&](
bool aReversed ) -> std::vector<double>
193 std::vector<double> storage( start.size() );
194 std::vector<double> targets = start;
195 GCS::VEC_pD unknowns;
197 for( std::size_t i = 0; i < start.size(); ++i )
199 double* param = &storage[aReversed ? start.size() - 1 - i : i];
201 unknowns.push_back( param );
206 first.p1 = GCS::Point( unknowns[0], unknowns[1] );
207 first.p2 = GCS::Point( unknowns[2], unknowns[3] );
208 second.p1 = GCS::Point( unknowns[4], unknowns[5] );
209 second.p2 = GCS::Point( unknowns[6], unknowns[7] );
212 system.addConstraintPerpendicular( first, second, 1 );
214 for( std::size_t i = 0; i < start.size(); ++i )
215 system.addConstraintEqual( unknowns[i], &targets[i], GCS::DefaultTemporaryConstraint );
217 system.declareUnknowns( unknowns );
218 system.initSolution();
220 system.applySolution();
222 std::vector<double>
result;
224 for(
double* param : unknowns )
225 result.push_back( *param );
237 const std::vector<double> start{ 0.0, 0.0, 10.0, 5.0, 20.0, 0.0, 20.0, 10.0 };
238 const double nanometre = 1e-6;
240 const auto solve = [&](
const std::vector<std::size_t>& aOrder ) -> std::vector<double>
242 std::vector<double> storage = start;
243 std::vector<double> targets = start;
247 first.p1 = GCS::Point( &storage[0], &storage[1] );
248 first.p2 = GCS::Point( &storage[2], &storage[3] );
249 second.p1 = GCS::Point( &storage[4], &storage[5] );
250 second.p2 = GCS::Point( &storage[6], &storage[7] );
253 system.addConstraintPerpendicular( first, second, 1 );
255 for( std::size_t i = 0; i < start.size(); ++i )
257 int id = system.addConstraintEqual( &storage[i], &targets[i], GCS::DefaultTemporaryConstraint );
259 if( i != 2 && i != 3 )
260 system.rescaleConstraint(
id, 1e-4 );
263 GCS::VEC_pD unknowns;
265 for( std::size_t i : aOrder )
266 unknowns.push_back( &storage[i] );
268 system.declareUnknowns( unknowns );
269 system.initSolution();
271 system.applySolution();
275 const std::vector<double> reference = solve( { 0, 1, 2, 3, 4, 5, 6, 7 } );
277 for(
const std::vector<std::size_t>& order : { std::vector<std::size_t>{ 4, 5, 6, 7, 0, 1, 2, 3 },
278 std::vector<std::size_t>{ 7, 6, 5, 4, 3, 2, 1, 0 },
279 std::vector<std::size_t>{ 1, 0, 3, 2, 5, 4, 7, 6 } } )
281 const std::vector<double>
result = solve( order );
283 for( std::size_t i = 0; i < start.size(); ++i )
284 BOOST_CHECK_SMALL(
result[i] - reference[i], nanometre );
wxString result
Test unit parsing edge cases and error handling.