1 // 2008-05-14, Xavier Delacour <xavier.delacour@gmail.com>
3 #include "cxcoretest.h"
12 typedef std::complex<double> complex_type;
15 bool operator() (const complex_type& lhs, const complex_type& rhs) const
17 return lhs.real() != rhs.real() ? lhs.real() < rhs.real() : lhs.imag() < rhs.imag();
21 class CV_SolvePolyTest : public CvTest
27 virtual void run( int start_from );
30 CV_SolvePolyTest::CV_SolvePolyTest() : CvTest( "solve-poly", "cvSolvePoly" ) {}
32 CV_SolvePolyTest::~CV_SolvePolyTest() {}
34 void CV_SolvePolyTest::run( int )
40 for (int idx = 0, max_idx = 1000, progress = 0; idx < max_idx; ++idx)
42 int n = cvRandInt(&rng) % 13 + 1;
43 std::vector<complex_type> r(n), ar(n), c(n + 1, 0);
44 std::vector<double> a(n + 1), u(n * 2);
46 int rr_odds = 3; // odds that we get a real root
47 for (int j = 0; j < n;)
49 if (cvRandInt(&rng) % rr_odds == 0 || j == n - 1)
50 r[j++] = cvRandReal(&rng) * range;
53 r[j] = complex_type(cvRandReal(&rng) * range,
54 cvRandReal(&rng) * range + 1);
55 r[j + 1] = std::conj(r[j]);
60 for (int j = 0, k = 1 << n, jj, kk; j < k; ++j)
64 for (jj = 0, kk = 1; jj < n && !(j & kk); ++jj, ++p, kk <<= 1)
66 for (; jj < n; ++jj, kk <<= 1)
78 for (int maxiter = 10; !pass && maxiter < 10000; maxiter *= 2)
80 for (int j = 0; j < n + 1; ++j)
84 cvInitMatHeader(&amat, n + 1, 1, CV_64FC1, &a[0]);
85 cvInitMatHeader(&umat, n, 1, CV_64FC2, &u[0]);
86 cvSolvePoly(&amat, &umat, maxiter, fig);
88 for (int j = 0; j < n; ++j)
89 ar[j] = complex_type(u[j * 2], u[j * 2 + 1]);
91 sort(r.begin(), r.end(), pred_complex());
92 sort(ar.begin(), ar.end(), pred_complex());
96 for (int j = 0; j < n; ++j)
98 s += r[j].real() + fabs(r[j].imag());
99 div += pow(r[j].real() - ar[j].real(), 2) + pow(r[j].imag() - ar[j].imag(), 2);
107 ts->set_failed_test_info(CvTS::FAIL_INVALID_OUTPUT);
108 ts->printf( CvTS::LOG, "\n" );
110 for (size_t j=0;j<r.size();++j)
111 ts->printf( CvTS::LOG, "r[%d]=(%g, %g)\n", j, r[j].real(), r[j].imag());
112 ts->printf( CvTS::LOG, "\n" );
113 for (size_t j=0;j<ar.size();++j)
114 ts->printf( CvTS::LOG, "ar[%d]=(%g, %g)\n", j, ar[j].real(), ar[j].imag());
117 progress = update_progress(progress, idx-1, max_idx, 0);
121 CV_SolvePolyTest solve_poly_test;