Home
last modified time | relevance | path

Searched refs:VERIFY (Results 1 – 25 of 168) sorted by relevance

1234567

/external/eigen/test/
Dmeta.cpp20 VERIFY((internal::conditional<(3<4),internal::true_type, internal::false_type>::type::value)); in test_meta()
21 VERIFY(( internal::is_same<float,float>::value)); in test_meta()
22 VERIFY((!internal::is_same<float,double>::value)); in test_meta()
23 VERIFY((!internal::is_same<float,float&>::value)); in test_meta()
24 VERIFY((!internal::is_same<float,const float&>::value)); in test_meta()
26 VERIFY(( internal::is_same<float,internal::remove_all<const float&>::type >::value)); in test_meta()
27 VERIFY(( internal::is_same<float,internal::remove_all<const float*>::type >::value)); in test_meta()
28 VERIFY(( internal::is_same<float,internal::remove_all<const float*&>::type >::value)); in test_meta()
29 VERIFY(( internal::is_same<float,internal::remove_all<float**>::type >::value)); in test_meta()
30 VERIFY(( internal::is_same<float,internal::remove_all<float**&>::type >::value)); in test_meta()
[all …]
Dsparse_permutations.cpp17 VERIFY( (#XPR) && nb_transposed_copies==N ); \
40 …VERIFY( int(internal::nested_eval<T,1>::type::Flags&RowMajorBit) == int(internal::evaluator<T>::Fl… in eval()
79 VERIFY( is_sorted( ::eval(mat*p) )); in sparse_permutations()
80 VERIFY( is_sorted( res = mat*p )); in sparse_permutations()
84 VERIFY(res.isApprox(res_d) && "mat*p"); in sparse_permutations()
86 VERIFY( is_sorted( ::eval(p*mat) )); in sparse_permutations()
87 VERIFY( is_sorted( res = p*mat )); in sparse_permutations()
90 VERIFY(res.isApprox(res_d) && "p*mat"); in sparse_permutations()
92 VERIFY( is_sorted( (mat*p).eval() )); in sparse_permutations()
93 VERIFY( is_sorted( res = mat*p.inverse() )); in sparse_permutations()
[all …]
Dstable_norm.cpp39 …VERIFY( (!(iemin > 1 - 2*it || 1+it>iemax || (it==2 && ibeta<5) || (it<=4 && ibeta <= 3 ) || it<2)) in stable_norm()
84 VERIFY(!(numext::isfinite)( std::numeric_limits<RealScalar>::infinity())); in stable_norm()
85 VERIFY(!(numext::isfinite)(sqrt(-abs(big)))); in stable_norm()
88 VERIFY((numext::isfinite)(sqrt(size)*abs(big))); in stable_norm()
95 VERIFY((numext::isfinite)(sqrt(size)*abs(small))); in stable_norm()
118 VERIFY(!(numext::isfinite)(v.squaredNorm())); VERIFY((numext::isnan)(v.squaredNorm())); in stable_norm()
119 VERIFY(!(numext::isfinite)(v.norm())); VERIFY((numext::isnan)(v.norm())); in stable_norm()
120 VERIFY(!(numext::isfinite)(v.stableNorm())); VERIFY((numext::isnan)(v.stableNorm())); in stable_norm()
121 VERIFY(!(numext::isfinite)(v.blueNorm())); VERIFY((numext::isnan)(v.blueNorm())); in stable_norm()
122 VERIFY(!(numext::isfinite)(v.hypotNorm())); VERIFY((numext::isnan)(v.hypotNorm())); in stable_norm()
[all …]
Dhalf_float.cpp67 VERIFY(!(numext::isinf)(float(half(65504.0f)))); // Largest finite number. in test_conversion()
68 VERIFY(!(numext::isnan)(float(half(0.0f)))); in test_conversion()
69 VERIFY((numext::isinf)(float(half(__half(0xfc00))))); in test_conversion()
70 VERIFY((numext::isnan)(float(half(__half(0xfc01))))); in test_conversion()
71 VERIFY((numext::isinf)(float(half(__half(0x7c00))))); in test_conversion()
72 VERIFY((numext::isnan)(float(half(__half(0x7c01))))); in test_conversion()
76 VERIFY((numext::isnan)(float(half(0.0 / 0.0)))); in test_conversion()
77 VERIFY((numext::isinf)(float(half(1.0 / 0.0)))); in test_conversion()
78 VERIFY((numext::isinf)(float(half(-1.0 / 0.0)))); in test_conversion()
82 VERIFY(!(numext::isinf)(half(__half(0x7bff)))); in test_conversion()
[all …]
Dvectorization_logic.cpp135 VERIFY(test_assign(Vector1(),Vector1(), in run()
137 VERIFY(test_assign(Vector1(),Vector1()+Vector1(), in run()
139 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()), in run()
141 VERIFY(test_assign(Vector1(),Vector1().template cast<Scalar>(), in run()
145 VERIFY(test_assign(Vector1(),Vector1(), in run()
147 VERIFY(test_assign(Vector1(),Vector1()+Vector1(), in run()
149 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()), in run()
152 VERIFY(test_assign(Matrix44(),Matrix44()+Matrix44(), in run()
155 VERIFY(test_assign(Matrix44u(),Matrix44()+Matrix44(), in run()
159 VERIFY(test_assign(Matrix1(),Matrix1()+Matrix1(), in run()
[all …]
Dzerosized.cpp15 VERIFY(m.all()); in zeroReduction()
16 VERIFY(!m.any()); in zeroReduction()
17 VERIFY(m.prod()==1); in zeroReduction()
18 VERIFY(m.sum()==0); in zeroReduction()
19 VERIFY(m.count()==0); in zeroReduction()
20 VERIFY(m.allFinite()); in zeroReduction()
21 VERIFY(!m.hasNaN()); in zeroReduction()
34 VERIFY(t1.rows() == 0); in zeroSizedMatrix()
36 VERIFY(t1.cols() == 0); in zeroSizedMatrix()
42 VERIFY(t2.rows() == 0); in zeroSizedMatrix()
[all …]
Dspecial_numbers.cpp35 VERIFY(!m1.hasNaN()); in special_numbers()
36 VERIFY(m1.allFinite()); in special_numbers()
38 VERIFY(mnan.hasNaN()); in special_numbers()
39 VERIFY((s1*mnan).hasNaN()); in special_numbers()
40 VERIFY(!minf.hasNaN()); in special_numbers()
41 VERIFY(!(2*minf).hasNaN()); in special_numbers()
42 VERIFY(mboth.hasNaN()); in special_numbers()
43 VERIFY(mboth.array().hasNaN()); in special_numbers()
45 VERIFY(!mnan.allFinite()); in special_numbers()
46 VERIFY(!minf.allFinite()); in special_numbers()
[all …]
Dbasicstuff.cpp101 VERIFY(m1==m1); in basicStuff()
102 VERIFY(m1!=m2); in basicStuff()
103 VERIFY(!(m1==m2)); in basicStuff()
104 VERIFY(!(m1!=m1)); in basicStuff()
106 VERIFY(m1==m2); in basicStuff()
107 VERIFY(!(m1!=m2)); in basicStuff()
158 VERIFY(numext::real(s1)==numext::real_ref(s1)); in basicStuffComplex()
159 VERIFY(numext::imag(s1)==numext::imag_ref(s1)); in basicStuffComplex()
162 VERIFY(internal::isApprox(s1, s2, NumTraits<RealScalar>::epsilon())); in basicStuffComplex()
179 VERIFY(static_cast<const MatrixType&>(cm).real().isZero()); in basicStuffComplex()
[all …]
Dnullary.cpp57 …VERIFY(internal::isApprox(v(i), (low*RealScalar(size-i-1))/RealScalar(size-1) + (high*RealScalar(i… in check_extremity_accuracy()
112 VERIFY( internal::isApprox(m(m.size()-1),high) ); in testVectorType()
113 VERIFY( size==1 || internal::isApprox(m(0),low) ); in testVectorType()
119 VERIFY( m(m.size()-1) <= high ); in testVectorType()
120 VERIFY( (m.array() <= high).all() ); in testVectorType()
121 VERIFY( (m.array() >= low).all() ); in testVectorType()
124 VERIFY( m(m.size()-1) >= low ); in testVectorType()
127 VERIFY( internal::isApprox(m(0),low) ); in testVectorType()
138 VERIFY( row_vector.isApprox(col_vector.transpose(), Scalar(2)*NumTraits<Scalar>::epsilon())); in testVectorType()
142 VERIFY( size_changer.size() == size ); in testVectorType()
[all …]
Dtriangular.cpp38 VERIFY(m1up.isUpperTriangular()); in triangular_square()
39 VERIFY(m2up.transpose().isLowerTriangular()); in triangular_square()
40 VERIFY(!m2.isLowerTriangular()); in triangular_square()
73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
75 …VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), l… in triangular_square()
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps)); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
85 …VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), l… in triangular_square()
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps)); in triangular_square()
[all …]
Dfastmath.cpp46 VERIFY( !(numext::isfinite)(m(3)) ); in check_inf_nan()
47 VERIFY( !(numext::isinf)(m(3)) ); in check_inf_nan()
48 VERIFY( (numext::isnan)(m(3)) ); in check_inf_nan()
49 VERIFY( !m.allFinite() ); in check_inf_nan()
50 VERIFY( m.hasNaN() ); in check_inf_nan()
65 VERIFY( !(numext::isfinite)(m(4)) ); in check_inf_nan()
66 VERIFY( (numext::isinf)(m(4)) ); in check_inf_nan()
67 VERIFY( !(numext::isnan)(m(4)) ); in check_inf_nan()
68 VERIFY( !m.allFinite() ); in check_inf_nan()
69 VERIFY( m.hasNaN() ); in check_inf_nan()
[all …]
Dis_same_dense.cpp20 VERIFY(is_same_dense(m1,m1)); in test_is_same_dense()
21 VERIFY(is_same_dense(m1,ref_m1)); in test_is_same_dense()
22 VERIFY(is_same_dense(const_ref_m1,m1)); in test_is_same_dense()
23 VERIFY(is_same_dense(const_ref_m1,ref_m1)); in test_is_same_dense()
25 VERIFY(is_same_dense(m1.block(0,0,m1.rows(),m1.cols()),m1)); in test_is_same_dense()
26 VERIFY(!is_same_dense(m1.row(0),m1.col(0))); in test_is_same_dense()
29 VERIFY(!is_same_dense(m1.row(1),const_ref_m1_row)); in test_is_same_dense()
32 VERIFY(is_same_dense(m1.col(1),const_ref_m1_col)); in test_is_same_dense()
Dproduct_trmv.cpp34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); in trmv()
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps)); in trmv()
38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps)); in trmv()
40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps)); in trmv()
44 …VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lowe… in trmv()
46 …VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Up… in trmv()
50 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1,… in trmv()
52 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1,… in trmv()
54 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() *… in trmv()
56 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() *… in trmv()
[all …]
Dnesting_ops.cpp70 VERIFY( verify_eval_type<10>(m1, m1) ); in run_nesting_ops_2()
73 VERIFY( verify_eval_type<3>(2*m1, 2*m1) ); in run_nesting_ops_2()
74 VERIFY( verify_eval_type<4>(2*m1, m1) ); in run_nesting_ops_2()
78 VERIFY( verify_eval_type<2>(2*m1, 2*m1) ); in run_nesting_ops_2()
79 VERIFY( verify_eval_type<3>(2*m1, m1) ); in run_nesting_ops_2()
81 VERIFY( verify_eval_type<2>(m1+m1, m1+m1) ); in run_nesting_ops_2()
82 VERIFY( verify_eval_type<3>(m1+m1, m1) ); in run_nesting_ops_2()
83 VERIFY( verify_eval_type<1>(m1*m1.transpose(), m2) ); in run_nesting_ops_2()
84 VERIFY( verify_eval_type<1>(m1*(m1+m1).transpose(), m2) ); in run_nesting_ops_2()
85 VERIFY( verify_eval_type<2>(m1*m1.transpose(), m2) ); in run_nesting_ops_2()
[all …]
Ddynalloc.cpp25 VERIFY(internal::UIntPtr(p)%ALIGNMENT==0); in check_handmade_aligned_malloc()
37 VERIFY(internal::UIntPtr(p)%ALIGNMENT==0); in check_aligned_malloc()
49 VERIFY(internal::UIntPtr(p)%ALIGNMENT==0); in check_aligned_new()
61 VERIFY(internal::UIntPtr(p)%ALIGNMENT==0); in check_aligned_stack_alloc()
90 VERIFY(T::NeedsToAlign==1); in check_dynaligned()
91 VERIFY(internal::UIntPtr(obj)%ALIGNMENT==0); in check_dynaligned()
151 MyStruct foo0; VERIFY(internal::UIntPtr(foo0.avec.data())%ALIGNMENT==0); in test_dynalloc()
152 MyClassA fooA; VERIFY(internal::UIntPtr(fooA.avec.data())%ALIGNMENT==0); in test_dynalloc()
158 MyStruct *foo0 = new MyStruct(); VERIFY(internal::UIntPtr(foo0->avec.data())%ALIGNMENT==0); in test_dynalloc()
159 MyClassA *fooA = new MyClassA(); VERIFY(internal::UIntPtr(fooA->avec.data())%ALIGNMENT==0); in test_dynalloc()
[all …]
Dpacketmath.cpp68 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
96 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
104 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
135 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store"); in packetmath()
140 VERIFY(areApprox(data1+offset, data2, PacketSize) && "internal::ploadu"); in packetmath()
146 VERIFY(areApprox(data1, data2+offset, PacketSize) && "internal::pstoreu"); in packetmath()
174 VERIFY(areApprox(ref, data2, PacketSize) && "internal::palign"); in packetmath()
177 VERIFY((!PacketTraits::Vectorizable) || PacketTraits::HasAdd); in packetmath()
178 VERIFY((!PacketTraits::Vectorizable) || PacketTraits::HasSub); in packetmath()
179 VERIFY((!PacketTraits::Vectorizable) || PacketTraits::HasMul); in packetmath()
[all …]
Dinteger_types.cpp15 #define VERIFY_IS_APPROX(a, b) VERIFY((a)==(b));
17 #define VERIFY_IS_NOT_APPROX(a, b) VERIFY((a)!=(b));
25 VERIFY(is_signed == 1); in signed_integer_type_tests()
55 VERIFY(NumTraits<Scalar>::IsInteger); in integer_type_tests()
57 VERIFY(int(NumTraits<Scalar>::IsSigned) == is_signed); in integer_type_tests()
102 VERIFY(m1==m1); in integer_type_tests()
103 VERIFY(m1!=m2); in integer_type_tests()
104 VERIFY(!(m1==m2)); in integer_type_tests()
105 VERIFY(!(m1!=m1)); in integer_type_tests()
107 VERIFY(m1==m2); in integer_type_tests()
[all …]
Dcholesky.cpp100 VERIFY(rcond_est > rcond / 10 && rcond_est < rcond * 10); in cholesky()
116 VERIFY(rcond_est > rcond / 10 && rcond_est < rcond * 10); in cholesky()
121 VERIFY(chollo.info()==NumericalIssue); in cholesky()
157 VERIFY(ldltlo.info()==Success); in cholesky()
170 VERIFY(rcond_est > rcond / 10 && rcond_est < rcond * 10); in cholesky()
174 VERIFY(ldltup.info()==Success); in cholesky()
187 VERIFY(rcond_est > rcond / 10 && rcond_est < rcond * 10); in cholesky()
271 VERIFY((A * vecX).isApprox(vecB, large_tol)); in cholesky()
336 VERIFY(ldltlo.info()==Success); in cholesky_cplx()
373 VERIFY(ldlt.info()==Success); in cholesky_definiteness()
[all …]
Darray.cpp125 VERIFY(o1.size()==rows); in array()
127 VERIFY(o4.size()==rows); in array()
150 VERIFY(((m1 + Scalar(1)) > m1).all()); in comparisons()
151 VERIFY(((m1 - Scalar(1)) < m1).all()); in comparisons()
156 VERIFY(! (m1 < m3).all() ); in comparisons()
157 VERIFY(! (m1 > m3).all() ); in comparisons()
159 VERIFY(!(m1 > m2 && m1 < m2).any()); in comparisons()
160 VERIFY((m1 <= m2 || m1 >= m2).all()); in comparisons()
163 VERIFY( (m1 != (m1(r,c)+1) ).any() ); in comparisons()
164 VERIFY( (m1 > (m1(r,c)-1) ).any() ); in comparisons()
[all …]
Dmapstride.cpp33 VERIFY(array[3*i] == v[i]); in map_class_vector()
34 VERIFY(map[i] == v[i]); in map_class_vector()
43 VERIFY(array[2*i] == v[i]); in map_class_vector()
44 VERIFY(map[i] == v[i]); in map_class_vector()
85 VERIFY(map.outerStride() == map.innerSize()+1); in map_class_matrix()
89 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j)); in map_class_matrix()
90 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); in map_class_matrix()
112 VERIFY(map.outerStride() == map.innerSize()+4); in map_class_matrix()
116 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j)); in map_class_matrix()
117 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); in map_class_matrix()
[all …]
Darray_for_matrix.cpp69 VERIFY(&ref_a1 == &ref_m1); in array_for_matrix()
70 VERIFY(&ref_a2 == &ref_m2); in array_for_matrix()
100 VERIFY(((m1.array() + Scalar(1)) > m1.array()).all()); in comparisons()
101 VERIFY(((m1.array() - Scalar(1)) < m1.array()).all()); in comparisons()
106 VERIFY(! (m1.array() < m3.array()).all() ); in comparisons()
107 VERIFY(! (m1.array() > m3.array()).all() ); in comparisons()
111 VERIFY( (m1.array() != (m1(r,c)+1) ).any() ); in comparisons()
112 VERIFY( (m1.array() > (m1(r,c)-1) ).any() ); in comparisons()
113 VERIFY( (m1.array() < (m1(r,c)+1) ).any() ); in comparisons()
114 VERIFY( (m1.array() == m1(r,c) ).any() ); in comparisons()
[all …]
Dlu.cpp59 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1)); in lu_non_invertible()
85 VERIFY(rank == lu.rank()); in lu_non_invertible()
86 VERIFY(cols - lu.rank() == lu.dimensionOfKernel()); in lu_non_invertible()
87 VERIFY(!lu.isInjective()); in lu_non_invertible()
88 VERIFY(!lu.isInvertible()); in lu_non_invertible()
89 VERIFY(!lu.isSurjective()); in lu_non_invertible()
90 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1)); in lu_non_invertible()
91 VERIFY(m1image.fullPivLu().rank() == rank); in lu_non_invertible()
141 VERIFY(0 == lu.dimensionOfKernel()); in lu_invertible()
142 VERIFY(lu.kernel().cols() == 1); // the kernel() should consist of a single (zero) column vector in lu_invertible()
[all …]
Dvisitor.cpp50 VERIFY(minrow == eigen_minrow); in matrixVisitor()
51 VERIFY(maxrow == eigen_maxrow); in matrixVisitor()
52 VERIFY(mincol == eigen_mincol); in matrixVisitor()
53 VERIFY(maxcol == eigen_maxcol); in matrixVisitor()
61 VERIFY(maxrow == eigen_maxrow); in matrixVisitor()
62 VERIFY(maxcol == eigen_maxcol); in matrixVisitor()
99 VERIFY(minidx == eigen_minidx); in vectorVisitor()
100 VERIFY(maxidx == eigen_maxidx); in vectorVisitor()
114 VERIFY(eigen_minidx == (std::min)(idx0,idx1)); in vectorVisitor()
115 VERIFY(eigen_maxidx == (std::min)(idx0,idx2)); in vectorVisitor()
/external/eigen/unsupported/test/
Dcxx11_meta.cpp89 VERIFY((is_same<typename gen_numeric_list<int, 0>::type, numeric_list<int>>::value)); in test_gen_numeric_list()
90 VERIFY((is_same<typename gen_numeric_list<int, 1>::type, numeric_list<int, 0>>::value)); in test_gen_numeric_list()
91 VERIFY((is_same<typename gen_numeric_list<int, 2>::type, numeric_list<int, 0, 1>>::value)); in test_gen_numeric_list()
92 …VERIFY((is_same<typename gen_numeric_list<int, 5>::type, numeric_list<int, 0, 1, 2, 3, 4>>::value)… in test_gen_numeric_list()
93 …VERIFY((is_same<typename gen_numeric_list<int, 10>::type, numeric_list<int, 0, 1, 2, 3, 4, 5, 6, 7… in test_gen_numeric_list()
95 VERIFY((is_same<typename gen_numeric_list<int, 0, 42>::type, numeric_list<int>>::value)); in test_gen_numeric_list()
96 VERIFY((is_same<typename gen_numeric_list<int, 1, 42>::type, numeric_list<int, 42>>::value)); in test_gen_numeric_list()
97 VERIFY((is_same<typename gen_numeric_list<int, 2, 42>::type, numeric_list<int, 42, 43>>::value)); in test_gen_numeric_list()
98 …VERIFY((is_same<typename gen_numeric_list<int, 5, 42>::type, numeric_list<int, 42, 43, 44, 45, 46>… in test_gen_numeric_list()
99 …VERIFY((is_same<typename gen_numeric_list<int, 10, 42>::type, numeric_list<int, 42, 43, 44, 45, 46… in test_gen_numeric_list()
[all …]
Dpolynomialsolver.cpp70 VERIFY( evalToZero || !distinctModuli ); in aux_evalSolver()
116 VERIFY( calc_realRoots.size() == (size_t)real_roots.size() ); in evalSolverSugarFunction()
128 VERIFY( found ); in evalSolverSugarFunction()
132 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(), in evalSolverSugarFunction()
136 VERIFY( internal::isApprox( roots.array().abs().minCoeff(), in evalSolverSugarFunction()
142 VERIFY( hasRealRoot == (real_roots.size() > 0 ) ); in evalSolverSugarFunction()
144 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) ); } in evalSolverSugarFunction()
148 VERIFY( hasRealRoot == (real_roots.size() > 0 ) ); in evalSolverSugarFunction()
150 VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); } in evalSolverSugarFunction()
154 VERIFY( hasRealRoot == (real_roots.size() > 0 ) ); in evalSolverSugarFunction()
[all …]

1234567