Home
last modified time | relevance | path

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

12345

/external/eigen/test/
Dmeta.cpp17 VERIFY((internal::conditional<(3<4),internal::true_type, internal::false_type>::type::value)); in test_meta()
18 VERIFY(( internal::is_same<float,float>::value)); in test_meta()
19 VERIFY((!internal::is_same<float,double>::value)); in test_meta()
20 VERIFY((!internal::is_same<float,float&>::value)); in test_meta()
21 VERIFY((!internal::is_same<float,const float&>::value)); in test_meta()
23 VERIFY(( internal::is_same<float,internal::remove_all<const float&>::type >::value)); in test_meta()
24 VERIFY(( internal::is_same<float,internal::remove_all<const float*>::type >::value)); in test_meta()
25 VERIFY(( internal::is_same<float,internal::remove_all<const float*&>::type >::value)); in test_meta()
26 VERIFY(( internal::is_same<float,internal::remove_all<float**>::type >::value)); in test_meta()
27 VERIFY(( internal::is_same<float,internal::remove_all<float**&>::type >::value)); in test_meta()
[all …]
Dvectorization_logic.cpp113 VERIFY(test_assign(Vector1(),Vector1(), in run()
115 VERIFY(test_assign(Vector1(),Vector1()+Vector1(), in run()
117 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()), in run()
119 VERIFY(test_assign(Vector1(),Vector1().template cast<Scalar>(), in run()
123 VERIFY(test_assign(Vector1(),Vector1(), in run()
125 VERIFY(test_assign(Vector1(),Vector1()+Vector1(), in run()
127 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()), in run()
130 VERIFY(test_assign(Matrix44(),Matrix44()+Matrix44(), in run()
133 VERIFY(test_assign(Matrix44u(),Matrix44()+Matrix44(), in run()
136 VERIFY(test_assign(Matrix1u(),Matrix1()+Matrix1(), in run()
[all …]
Dsparse_permutations.cpp49 VERIFY(res.isApprox(res_d) && "mat*p"); in sparse_permutations()
53 VERIFY(res.isApprox(res_d) && "p*mat"); in sparse_permutations()
57 VERIFY(res.isApprox(res_d) && "mat*inv(p)"); in sparse_permutations()
61 VERIFY(res.isApprox(res_d) && "inv(p)*mat"); in sparse_permutations()
65 VERIFY(res.isApprox(res_d) && "p*mat*inv(p)"); in sparse_permutations()
70 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); in sparse_permutations()
74 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full"); in sparse_permutations()
79 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); in sparse_permutations()
83 VERIFY(res.isApprox(res_d) && "lower selfadjoint full"); in sparse_permutations()
88 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); in sparse_permutations()
[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 …]
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 …]
Ddynalloc.cpp23 VERIFY(size_t(p)%ALIGNMENT==0); in check_handmade_aligned_malloc()
35 VERIFY(size_t(p)%ALIGNMENT==0); in check_aligned_malloc()
47 VERIFY(size_t(p)%ALIGNMENT==0); in check_aligned_new()
59 VERIFY(size_t(p)%ALIGNMENT==0); in check_aligned_stack_alloc()
85 VERIFY(size_t(obj)%ALIGNMENT==0); in check_dynaligned()
109 MyStruct foo0; VERIFY(size_t(foo0.avec.data())%ALIGNMENT==0); in test_dynalloc()
110 MyClassA fooA; VERIFY(size_t(fooA.avec.data())%ALIGNMENT==0); in test_dynalloc()
116 MyStruct *foo0 = new MyStruct(); VERIFY(size_t(foo0->avec.data())%ALIGNMENT==0); in test_dynalloc()
117 MyClassA *fooA = new MyClassA(); VERIFY(size_t(fooA->avec.data())%ALIGNMENT==0); in test_dynalloc()
126 MyStruct *foo0 = new MyStruct[N]; VERIFY(size_t(foo0->avec.data())%ALIGNMENT==0); in test_dynalloc()
[all …]
Dbasicstuff.cpp102 VERIFY(m1==m1); in basicStuff()
103 VERIFY(m1!=m2); in basicStuff()
104 VERIFY(!(m1==m2)); in basicStuff()
105 VERIFY(!(m1!=m1)); in basicStuff()
107 VERIFY(m1==m2); in basicStuff()
108 VERIFY(!(m1!=m2)); in basicStuff()
145 VERIFY(internal::real(s1)==internal::real_ref(s1)); in basicStuffComplex()
146 VERIFY(internal::imag(s1)==internal::imag_ref(s1)); in basicStuffComplex()
149 VERIFY(internal::isApprox(s1, s2, NumTraits<RealScalar>::epsilon())); in basicStuffComplex()
166 VERIFY(static_cast<const MatrixType&>(cm).real().isZero()); in basicStuffComplex()
[all …]
Dlu.cpp55 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1)); in lu_non_invertible()
81 VERIFY(rank == lu.rank()); in lu_non_invertible()
82 VERIFY(cols - lu.rank() == lu.dimensionOfKernel()); in lu_non_invertible()
83 VERIFY(!lu.isInjective()); in lu_non_invertible()
84 VERIFY(!lu.isInvertible()); in lu_non_invertible()
85 VERIFY(!lu.isSurjective()); in lu_non_invertible()
86 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1)); in lu_non_invertible()
87 VERIFY(m1image.fullPivLu().rank() == rank); in lu_non_invertible()
116 VERIFY(0 == lu.dimensionOfKernel()); in lu_invertible()
117 VERIFY(lu.kernel().cols() == 1); // the kernel() should consist of a single (zero) column vector in lu_invertible()
[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()
71 VERIFY(map.outerStride() == map.innerSize()+1); in map_class_matrix()
75 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j)); in map_class_matrix()
76 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); in map_class_matrix()
90 VERIFY(map.outerStride() == map.innerSize()+4); in map_class_matrix()
94 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j)); in map_class_matrix()
95 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j)); in map_class_matrix()
[all …]
Dcwiseop.cpp67 VERIFY(mzero.isZero()); in cwiseops()
68 VERIFY(mones.isOnes()); in cwiseops()
69 VERIFY(m3.isConstant(s1)); in cwiseops()
70 VERIFY(identity.isIdentity()); in cwiseops()
135 VERIFY( (m1.cwise() == m1).all() ); in cwiseops()
136 VERIFY( (m1.cwise() != m2).any() ); in cwiseops()
137 VERIFY(!(m1.cwise() == (m1+mones)).any() ); in cwiseops()
142 VERIFY( (m1.cwise() == m3).any() ); in cwiseops()
143 VERIFY( !(m1.cwise() == m3).all() ); in cwiseops()
145 VERIFY( (m1.cwise().min(m2).cwise() <= m2).all() ); in cwiseops()
[all …]
Dzerosized.cpp19 VERIFY(t1.rows() == 0); in zeroSizedMatrix()
21 VERIFY(t1.cols() == 0); in zeroSizedMatrix()
26 VERIFY(t2.rows() == 0); in zeroSizedMatrix()
27 VERIFY(t2.cols() == 0); in zeroSizedMatrix()
38 VERIFY(t1.size() == 0); in zeroSizedVector()
40 VERIFY(t2.size() == 0); in zeroSizedVector()
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 …]
Dpacketmath.cpp57 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
64 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
92 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
120 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store"); in packetmath()
125 VERIFY(areApprox(data1+offset, data2, PacketSize) && "internal::ploadu"); in packetmath()
131 VERIFY(areApprox(data1, data2+offset, PacketSize) && "internal::pstoreu"); in packetmath()
148 VERIFY(areApprox(ref, data2, PacketSize) && "internal::palign"); in packetmath()
166 VERIFY(areApprox(ref, data2, PacketSize) && "internal::pset1"); in packetmath()
169 …VERIFY(internal::isApprox(data1[0], internal::pfirst(internal::pload<Packet>(data1))) && "internal… in packetmath()
178 VERIFY(areApprox(ref, data2, PacketSize) && "ploaddup"); in packetmath()
[all …]
Dqr_colpivoting.cpp28 VERIFY(rank == qr.rank()); in qr()
29 VERIFY(cols - qr.rank() == qr.dimensionOfKernel()); in qr()
30 VERIFY(!qr.isInjective()); in qr()
31 VERIFY(!qr.isInvertible()); in qr()
32 VERIFY(!qr.isSurjective()); in qr()
56 VERIFY(rank == qr.rank()); in qr_fixedsize()
57 VERIFY(Cols - qr.rank() == qr.dimensionOfKernel()); in qr_fixedsize()
58 VERIFY(qr.isInjective() == (rank == Rows)); in qr_fixedsize()
59 VERIFY(qr.isSurjective() == (rank == Cols)); in qr_fixedsize()
60 VERIFY(qr.isInvertible() == (qr.isInjective() && qr.isSurjective())); in qr_fixedsize()
Dqr_fullpivoting.cpp27 VERIFY(rank == qr.rank()); in qr()
28 VERIFY(cols - qr.rank() == qr.dimensionOfKernel()); in qr()
29 VERIFY(!qr.isInjective()); in qr()
30 VERIFY(!qr.isInvertible()); in qr()
31 VERIFY(!qr.isSurjective()); in qr()
70 VERIFY(qr.isInjective()); in qr_invertible()
71 VERIFY(qr.isInvertible()); in qr_invertible()
72 VERIFY(qr.isSurjective()); in qr_invertible()
Dsizeof.cpp16 VERIFY(sizeof(MatrixType)==sizeof(Scalar)*size_t(MatrixType::SizeAtCompileTime)); in verifySizeOf()
18 VERIFY(sizeof(MatrixType)==sizeof(Scalar*) + 2 * sizeof(typename MatrixType::Index)); in verifySizeOf()
32 VERIFY(sizeof(std::complex<float>) == 2*sizeof(float)); in test_sizeof()
33 VERIFY(sizeof(std::complex<double>) == 2*sizeof(double)); in test_sizeof()
/external/eigen/test/eigen2/
Deigen2_meta.cpp17 VERIFY((ei_meta_if<(3<4),ei_meta_true, ei_meta_false>::ret::ret)); in test_eigen2_meta()
18 VERIFY(( ei_is_same_type<float,float>::ret)); in test_eigen2_meta()
19 VERIFY((!ei_is_same_type<float,double>::ret)); in test_eigen2_meta()
20 VERIFY((!ei_is_same_type<float,float&>::ret)); in test_eigen2_meta()
21 VERIFY((!ei_is_same_type<float,const float&>::ret)); in test_eigen2_meta()
23 VERIFY(( ei_is_same_type<float,ei_cleantype<const float&>::type >::ret)); in test_eigen2_meta()
24 VERIFY(( ei_is_same_type<float,ei_cleantype<const float*>::type >::ret)); in test_eigen2_meta()
25 VERIFY(( ei_is_same_type<float,ei_cleantype<const float*&>::type >::ret)); in test_eigen2_meta()
26 VERIFY(( ei_is_same_type<float,ei_cleantype<float**>::type >::ret)); in test_eigen2_meta()
27 VERIFY(( ei_is_same_type<float,ei_cleantype<float**&>::type >::ret)); in test_eigen2_meta()
[all …]
Deigen2_lu.cpp56 VERIFY(rank == lu.rank()); in lu_non_invertible()
57 VERIFY(cols - lu.rank() == lu.dimensionOfKernel()); in lu_non_invertible()
58 VERIFY(!lu.isInjective()); in lu_non_invertible()
59 VERIFY(!lu.isInvertible()); in lu_non_invertible()
60 VERIFY(lu.isSurjective() == (lu.rank() == rows)); in lu_non_invertible()
61 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1)); in lu_non_invertible()
62 VERIFY(m1image.lu().rank() == rank); in lu_non_invertible()
65 VERIFY(sidebyside.lu().rank() == rank); in lu_non_invertible()
96 VERIFY(0 == lu.dimensionOfKernel()); in lu_invertible()
97 VERIFY(size == lu.rank()); in lu_invertible()
[all …]
Deigen2_dynalloc.cpp23 VERIFY(std::size_t(p)%ALIGNMENT==0); in check_handmade_aligned_malloc()
35 VERIFY(std::size_t(p)%ALIGNMENT==0); in check_aligned_malloc()
47 VERIFY(std::size_t(p)%ALIGNMENT==0); in check_aligned_new()
59 VERIFY(std::size_t(p)%ALIGNMENT==0); in check_aligned_stack_alloc()
85 VERIFY(std::size_t(obj)%ALIGNMENT==0); in check_dynaligned()
108 MyStruct foo0; VERIFY(std::size_t(foo0.avec.data())%ALIGNMENT==0); in test_eigen2_dynalloc()
109 MyClassA fooA; VERIFY(std::size_t(fooA.avec.data())%ALIGNMENT==0); in test_eigen2_dynalloc()
115 MyStruct *foo0 = new MyStruct(); VERIFY(std::size_t(foo0->avec.data())%ALIGNMENT==0); in test_eigen2_dynalloc()
116 MyClassA *fooA = new MyClassA(); VERIFY(std::size_t(fooA->avec.data())%ALIGNMENT==0); in test_eigen2_dynalloc()
125 MyStruct *foo0 = new MyStruct[N]; VERIFY(std::size_t(foo0->avec.data())%ALIGNMENT==0); in test_eigen2_dynalloc()
[all …]
Deigen2_triangular.cpp44 VERIFY(m1up.isUpperTriangular()); in triangular()
45 VERIFY(m2up.transpose().isLowerTriangular()); in triangular()
46 VERIFY(!m2.isLowerTriangular()); in triangular()
78 …VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(t… in triangular()
79 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>() in triangular()
84 VERIFY(m4.cwise().abs().isIdentity(test_precision<RealScalar>())); in triangular()
87 …VERIFY(m3.template marked<Eigen::UpperTriangular>().solveTriangular(m3).cwise().abs().isIdentity(t… in triangular()
88 VERIFY(m3.transpose().template marked<Eigen::LowerTriangular>() in triangular()
93 VERIFY(m4.cwise().abs().isIdentity(test_precision<RealScalar>())); in triangular()
96 …VERIFY(m2.isApprox(m3 * (m3.template marked<Eigen::UpperTriangular>().solveTriangular(m2)), larger… in triangular()
[all …]
Deigen2_cwiseop.cpp60 VERIFY(mzero.isZero()); in cwiseops()
61 VERIFY(mones.isOnes()); in cwiseops()
62 VERIFY(m3.isConstant(s1)); in cwiseops()
63 VERIFY(identity.isIdentity()); in cwiseops()
128 VERIFY( (m1.cwise() == m1).all() ); in cwiseops()
129 VERIFY( (m1.cwise() != m2).any() ); in cwiseops()
130 VERIFY(!(m1.cwise() == (m1+mones)).any() ); in cwiseops()
135 VERIFY( (m1.cwise() == m3).any() ); in cwiseops()
136 VERIFY( !(m1.cwise() == m3).all() ); in cwiseops()
138 VERIFY( (m1.cwise().min(m2).cwise() <= m2).all() ); in cwiseops()
[all …]
Deigen2_packetmath.cpp25 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
60 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store"); in packetmath()
65 VERIFY(areApprox(data1+offset, data2, PacketSize) && "ei_ploadu"); in packetmath()
71 VERIFY(areApprox(data1, data2+offset, PacketSize) && "ei_pstoreu"); in packetmath()
88 VERIFY(areApprox(ref, data2, PacketSize) && "ei_palign"); in packetmath()
104 VERIFY(areApprox(ref, data2, PacketSize) && "ei_pset1"); in packetmath()
106 VERIFY(ei_isApprox(data1[0], ei_pfirst(ei_pload(data1))) && "ei_pfirst"); in packetmath()
111 VERIFY(ei_isApprox(ref[0], ei_predux(ei_pload(data1))) && "ei_predux"); in packetmath()
121 VERIFY(areApprox(ref, data2, PacketSize) && "ei_preduxp"); in packetmath()
/external/eigen/unsupported/test/
Dpolynomialsolver.cpp67 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(), internal::abs(r), psPrec ) ); } in evalSolverSugarFunction()
148 VERIFY( hasRealRoot == (real_roots.size() > 0 ) ); in evalSolverSugarFunction()
150 … VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), internal::abs( r ), psPrec ) ); } in evalSolverSugarFunction()
154 VERIFY( hasRealRoot == (real_roots.size() > 0 ) ); in evalSolverSugarFunction()
[all …]
DFFTW.cpp98 VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) ); in test_scalar_generic()
99 VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>() );// gross check in test_scalar_generic()
103 VERIFY( (size_t)freqBuf.size() == (size_t)nfft); in test_scalar_generic()
104 VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>() );// gross check in test_scalar_generic()
111 VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>() );// gross check in test_scalar_generic()
127 VERIFY( dif_rmse(tbuf,tbuf3) < test_precision<T>() );// gross check in test_scalar_generic()
132 VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>() );// gross check in test_scalar_generic()
158 VERIFY( fft_rmse(outbuf,inbuf) < test_precision<T>() );// gross check in test_complex_generic()
161 VERIFY( dif_rmse(inbuf,buf3) < test_precision<T>() );// gross check in test_complex_generic()
169 VERIFY( dif_rmse(inbuf,buf4) < test_precision<T>() );// gross check in test_complex_generic()
[all …]
Dmatrix_exponential.cpp47 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
51 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dRotation()
72 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
76 VERIFY(C.isApprox(B, static_cast<T>(tol))); in test2dHyperbolicRotation()
96 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
100 VERIFY(C.isApprox(B, static_cast<T>(tol))); in testPascal()
122 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol))); in randomTest()
126 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol))); in randomTest()

12345