| /external/eigen/test/eigen2/ |
| eigen2_meta.cpp | 17 VERIFY((ei_meta_if<(3<4),ei_meta_true, ei_meta_false>::ret::ret));
18 VERIFY(( ei_is_same_type<float,float>::ret));
19 VERIFY((!ei_is_same_type<float,double>::ret));
20 VERIFY((!ei_is_same_type<float,float&>::ret));
21 VERIFY((!ei_is_same_type<float,const float&>::ret));
23 VERIFY(( ei_is_same_type<float,ei_cleantype<const float&>::type >::ret));
24 VERIFY(( ei_is_same_type<float,ei_cleantype<const float*>::type >::ret));
25 VERIFY(( ei_is_same_type<float,ei_cleantype<const float*&>::type >::ret));
26 VERIFY(( ei_is_same_type<float,ei_cleantype<float**>::type >::ret));
27 VERIFY(( ei_is_same_type<float,ei_cleantype<float**&>::type >::ret))
[all...] |
| eigen2_dynalloc.cpp | 23 VERIFY(std::size_t(p)%ALIGNMENT==0);
35 VERIFY(std::size_t(p)%ALIGNMENT==0);
47 VERIFY(std::size_t(p)%ALIGNMENT==0);
59 VERIFY(std::size_t(p)%ALIGNMENT==0);
85 VERIFY(std::size_t(obj)%ALIGNMENT==0);
108 MyStruct foo0; VERIFY(std::size_t(foo0.avec.data())%ALIGNMENT==0);
109 MyClassA fooA; VERIFY(std::size_t(fooA.avec.data())%ALIGNMENT==0);
115 MyStruct *foo0 = new MyStruct(); VERIFY(std::size_t(foo0->avec.data())%ALIGNMENT==0);
116 MyClassA *fooA = new MyClassA(); VERIFY(std::size_t(fooA->avec.data())%ALIGNMENT==0);
125 MyStruct *foo0 = new MyStruct[N]; VERIFY(std::size_t(foo0->avec.data())%ALIGNMENT==0)
[all...] |
| eigen2_lu.cpp | 56 VERIFY(rank == lu.rank());
57 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
58 VERIFY(!lu.isInjective());
59 VERIFY(!lu.isInvertible());
60 VERIFY(lu.isSurjective() == (lu.rank() == rows));
61 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1));
62 VERIFY(m1image.lu().rank() == rank);
65 VERIFY(sidebyside.lu().rank() == rank);
73 VERIFY(!lu.solve(m3, &m2));
96 VERIFY(0 == lu.dimensionOfKernel())
[all...] |
| eigen2_sizeof.cpp | 16 VERIFY(sizeof(MatrixType)==sizeof(Scalar)*MatrixType::SizeAtCompileTime);
18 VERIFY(sizeof(MatrixType)==sizeof(Scalar*) + 2 * sizeof(typename MatrixType::Index));
|
| eigen2_triangular.cpp | 44 VERIFY(m1up.isUpperTriangular());
45 VERIFY(m2up.transpose().isLowerTriangular());
46 VERIFY(!m2.isLowerTriangular());
78 VERIFY(m3.template marked<Eigen::LowerTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>()));
79 VERIFY(m3.transpose().template marked<Eigen::UpperTriangular>()
84 VERIFY(m4.cwise().abs().isIdentity(test_precision<RealScalar>()));
87 VERIFY(m3.template marked<Eigen::UpperTriangular>().solveTriangular(m3).cwise().abs().isIdentity(test_precision<RealScalar>()));
88 VERIFY(m3.transpose().template marked<Eigen::LowerTriangular>()
93 VERIFY(m4.cwise().abs().isIdentity(test_precision<RealScalar>()));
96 VERIFY(m2.isApprox(m3 * (m3.template marked<Eigen::UpperTriangular>().solveTriangular(m2)), largerEps))
[all...] |
| eigen2_first_aligned.cpp | 16 VERIFY(((std::size_t(array) + sizeof(Scalar) * ei_alignmentOffset(array, size)) % packet_size) == 0);
22 VERIFY(ei_packet_traits<Scalar>::size == 1 || ei_alignmentOffset(array, size) == size);
|
| /external/eigen/test/ |
| meta.cpp | 14 VERIFY((internal::conditional<(3<4),internal::true_type, internal::false_type>::type::value));
15 VERIFY(( internal::is_same<float,float>::value));
16 VERIFY((!internal::is_same<float,double>::value));
17 VERIFY((!internal::is_same<float,float&>::value));
18 VERIFY((!internal::is_same<float,const float&>::value));
20 VERIFY(( internal::is_same<float,internal::remove_all<const float&>::type >::value));
21 VERIFY(( internal::is_same<float,internal::remove_all<const float*>::type >::value));
22 VERIFY(( internal::is_same<float,internal::remove_all<const float*&>::type >::value));
23 VERIFY(( internal::is_same<float,internal::remove_all<float**>::type >::value));
24 VERIFY(( internal::is_same<float,internal::remove_all<float**&>::type >::value))
[all...] |
| zerosized.cpp | 15 VERIFY(m.all());
16 VERIFY(!m.any());
17 VERIFY(m.prod()==1);
18 VERIFY(m.sum()==0);
19 VERIFY(m.count()==0);
20 VERIFY(m.allFinite());
21 VERIFY(!m.hasNaN());
33 VERIFY(t1.rows() == 0);
35 VERIFY(t1.cols() == 0);
41 VERIFY(t2.rows() == 0)
[all...] |
| special_numbers.cpp | 35 VERIFY(!m1.hasNaN());
36 VERIFY(m1.allFinite());
38 VERIFY(mnan.hasNaN());
39 VERIFY((s1*mnan).hasNaN());
40 VERIFY(!minf.hasNaN());
41 VERIFY(!(2*minf).hasNaN());
42 VERIFY(mboth.hasNaN());
43 VERIFY(mboth.array().hasNaN());
45 VERIFY(!mnan.allFinite());
46 VERIFY(!minf.allFinite())
[all...] |
| dynalloc.cpp | 23 VERIFY(size_t(p)%ALIGNMENT==0);
35 VERIFY(size_t(p)%ALIGNMENT==0);
47 VERIFY(size_t(p)%ALIGNMENT==0);
59 VERIFY(size_t(p)%ALIGNMENT==0);
85 VERIFY(T::NeedsToAlign==1);
86 VERIFY(size_t(obj)%ALIGNMENT==0);
110 MyStruct foo0; VERIFY(size_t(foo0.avec.data())%ALIGNMENT==0);
111 MyClassA fooA; VERIFY(size_t(fooA.avec.data())%ALIGNMENT==0);
117 MyStruct *foo0 = new MyStruct(); VERIFY(size_t(foo0->avec.data())%ALIGNMENT==0);
118 MyClassA *fooA = new MyClassA(); VERIFY(size_t(fooA->avec.data())%ALIGNMENT==0)
[all...] |
| sizeof.cpp | 16 VERIFY(std::ptrdiff_t(sizeof(MatrixType))==std::ptrdiff_t(sizeof(Scalar))*std::ptrdiff_t(MatrixType::SizeAtCompileTime));
18 VERIFY(sizeof(MatrixType)==sizeof(Scalar*) + 2 * sizeof(typename MatrixType::Index));
32 VERIFY(sizeof(std::complex<float>) == 2*sizeof(float));
33 VERIFY(sizeof(std::complex<double>) == 2*sizeof(double));
|
| vectorization_logic.cpp | 113 VERIFY(test_assign(Vector1(),Vector1(),
115 VERIFY(test_assign(Vector1(),Vector1()+Vector1(),
117 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()),
119 VERIFY(test_assign(Vector1(),Vector1().template cast<Scalar>(),
123 VERIFY(test_assign(Vector1(),Vector1(),
125 VERIFY(test_assign(Vector1(),Vector1()+Vector1(),
127 VERIFY(test_assign(Vector1(),Vector1().cwiseProduct(Vector1()),
130 VERIFY(test_assign(Matrix44(),Matrix44()+Matrix44(),
133 VERIFY(test_assign(Matrix44u(),Matrix44()+Matrix44(),
136 VERIFY(test_assign(Matrix1u(),Matrix1()+Matrix1()
[all...] |
| sparse_permutations.cpp | 49 VERIFY(res.isApprox(res_d) && "mat*p");
53 VERIFY(res.isApprox(res_d) && "p*mat");
57 VERIFY(res.isApprox(res_d) && "mat*inv(p)");
61 VERIFY(res.isApprox(res_d) && "inv(p)*mat");
65 VERIFY(res.isApprox(res_d) && "p*mat*inv(p)");
70 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
74 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
79 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");
83 VERIFY(res.isApprox(res_d) && "lower selfadjoint full");
88 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full")
[all...] |
| resize.cpp | 20 VERIFY(B.rows() == rows && B.cols() == cols);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
29 VERIFY(x.rows() == cols && x.cols() == 1);
|
| sizeoverflow.cpp | 18 VERIFY(threw && "should have thrown bad_alloc: " #a); \
47 VERIFY(times_itself_gives_0 * times_itself_gives_0 == 0);
50 VERIFY(times_4_gives_0 * 4 == 0);
53 VERIFY(times_8_gives_0 * 8 == 0);
|
| triangular.cpp | 38 VERIFY(m1up.isUpperTriangular());
39 VERIFY(m2up.transpose().isLowerTriangular());
40 VERIFY(!m2.isLowerTriangular());
73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps));
75 VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps));
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps));
79 VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), largerEps));
83 VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), largerEps));
85 VERIFY(m2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(m2)), largerEps));
87 VERIFY(m2.isApprox(m3 * (m1.template triangularView<Upper>().solve(m2)), largerEps))
[all...] |
| lu.cpp | 54 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
80 VERIFY(rank == lu.rank());
81 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
82 VERIFY(!lu.isInjective());
83 VERIFY(!lu.isInvertible());
84 VERIFY(!lu.isSurjective());
85 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1));
86 VERIFY(m1image.fullPivLu().rank() == rank);
114 VERIFY(0 == lu.dimensionOfKernel());
115 VERIFY(lu.kernel().cols() == 1); // the kernel() should consist of a single (zero) column vecto
[all...] |
| product_trmv.cpp | 34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps));
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps));
38 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitLower>() * v1, largerEps));
40 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::UnitUpper>() * v1, largerEps));
44 VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps));
46 VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(), largerEps));
50 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps));
52 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps));
54 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitLower>() * v1, largerEps));
56 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::UnitUpper>() * v1, la (…)
[all...] |
| basicstuff.cpp | 101 VERIFY(m1==m1);
102 VERIFY(m1!=m2);
103 VERIFY(!(m1==m2));
104 VERIFY(!(m1!=m1));
106 VERIFY(m1==m2);
107 VERIFY(!(m1!=m2));
144 VERIFY(numext::real(s1)==numext::real_ref(s1));
145 VERIFY(numext::imag(s1)==numext::imag_ref(s1));
148 VERIFY(internal::isApprox(s1, s2, NumTraits<RealScalar>::epsilon()));
165 VERIFY(static_cast<const MatrixType&>(cm).real().isZero())
[all...] |
| mapstride.cpp | 33 VERIFY(array[3*i] == v[i]);
34 VERIFY(map[i] == v[i]);
43 VERIFY(array[2*i] == v[i]);
44 VERIFY(map[i] == v[i]);
71 VERIFY(map.outerStride() == map.innerSize()+1);
75 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j));
76 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j));
90 VERIFY(map.outerStride() == map.innerSize()+4);
94 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j));
95 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j))
[all...] |
| first_aligned.cpp | 16 VERIFY(((size_t(array) + sizeof(Scalar) * internal::first_aligned(array, size)) % packet_size) == 0);
24 VERIFY(internal::packet_traits<Scalar>::size == 1 || internal::first_aligned(array, size) == size);
|
| /art/test/etc/ |
| reference-run-test-classes | 9 # --no-verify -- turn off verification (on by default)
20 VERIFY="y"
29 elif [ "x$1" = "x--no-verify" ]; then
30 VERIFY="n"
46 if [ "$VERIFY" = "y" ]; then
|
| /external/chromium_org/rlz/lib/ |
| assert.h | 31 #ifndef VERIFY
33 #define VERIFY(expr) LOG_IF(FATAL, !(expr)) << #expr
35 #define VERIFY(expr) (void)(expr)
|
| /external/chromium_org/media/base/ |
| container_names_unittest.cc | 17 #define VERIFY(buffer, name) \
26 VERIFY(buffer, CONTAINER_UNKNOWN);
37 VERIFY(buffer1, CONTAINER_SRT);
43 VERIFY(buffer2, CONTAINER_HLS);
48 VERIFY(buffer3, CONTAINER_UNKNOWN);
52 VERIFY(buffer3, CONTAINER_UNKNOWN);
86 // This is to verify that the TAG matches the first 4 characters of the string.
88 VERIFY(kAmrBuffer, CONTAINER_AMR);
89 VERIFY(kAsfBuffer, CONTAINER_ASF);
90 VERIFY(kAss1Buffer, CONTAINER_ASS)
[all...] |
| /external/eigen/unsupported/test/ |
| polynomialsolver.cpp | 67 VERIFY( evalToZero || !distinctModuli );
114 VERIFY( calc_realRoots.size() == (size_t)real_roots.size() );
126 VERIFY( found );
130 VERIFY( internal::isApprox( roots.array().abs().maxCoeff(),
134 VERIFY( internal::isApprox( roots.array().abs().minCoeff(),
140 VERIFY( hasRealRoot == (real_roots.size() > 0 ) );
142 VERIFY( internal::isApprox( real_roots.array().abs().maxCoeff(), abs(r), psPrec ) ); }
146 VERIFY( hasRealRoot == (real_roots.size() > 0 ) );
148 VERIFY( internal::isApprox( real_roots.array().abs().minCoeff(), abs( r ), psPrec ) ); }
152 VERIFY( hasRealRoot == (real_roots.size() > 0 ) )
[all...] |
