| /external/eigen/test/ |
| 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]);
85 VERIFY(map.outerStride() == map.innerSize()+1);
89 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j));
90 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j));
112 VERIFY(map.outerStride() == map.innerSize()+4);
116 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j));
117 VERIFY(map.coeffByOuterInner(i,j) == m.coeffByOuterInner(i,j))
[all...] |
| array.cpp | 125 VERIFY(o1.size()==rows);
127 VERIFY(o4.size()==rows);
150 VERIFY(((m1 + Scalar(1)) > m1).all());
151 VERIFY(((m1 - Scalar(1)) < m1).all());
156 VERIFY(! (m1 < m3).all() );
157 VERIFY(! (m1 > m3).all() );
159 VERIFY(!(m1 > m2 && m1 < m2).any());
160 VERIFY((m1 <= m2 || m1 >= m2).all());
163 VERIFY( (m1 != (m1(r,c)+1) ).any() );
164 VERIFY( (m1 > (m1(r,c)-1) ).any() )
[all...] |
| visitor.cpp | 50 VERIFY(minrow == eigen_minrow);
51 VERIFY(maxrow == eigen_maxrow);
52 VERIFY(mincol == eigen_mincol);
53 VERIFY(maxcol == eigen_maxcol);
61 VERIFY(maxrow == eigen_maxrow);
62 VERIFY(maxcol == eigen_maxcol);
99 VERIFY(minidx == eigen_minidx);
100 VERIFY(maxidx == eigen_maxidx);
114 VERIFY(eigen_minidx == (std::min)(idx0,idx1));
115 VERIFY(eigen_maxidx == (std::min)(idx0,idx2))
[all...] |
| packetmath.cpp | 68 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");
140 VERIFY(areApprox(data1+offset, data2, PacketSize) && "internal::ploadu");
146 VERIFY(areApprox(data1, data2+offset, PacketSize) && "internal::pstoreu");
174 VERIFY(areApprox(ref, data2, PacketSize) && "internal::palign");
177 VERIFY((!PacketTraits::Vectorizable) || PacketTraits::HasAdd);
178 VERIFY((!PacketTraits::Vectorizable) || PacketTraits::HasSub);
179 VERIFY((!PacketTraits::Vectorizable) || PacketTraits::HasMul)
[all...] |
| lu.cpp | 59 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
85 VERIFY(rank == lu.rank());
86 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
87 VERIFY(!lu.isInjective());
88 VERIFY(!lu.isInvertible());
89 VERIFY(!lu.isSurjective());
90 VERIFY((m1 * m1kernel).isMuchSmallerThan(m1));
91 VERIFY(m1image.fullPivLu().rank() == rank);
141 VERIFY(0 == lu.dimensionOfKernel());
142 VERIFY(lu.kernel().cols() == 1); // the kernel() should consist of a single (zero) column vecto
[all...] |
| array_for_matrix.cpp | 64 // verify the const accessors exist
69 VERIFY(&ref_a1 == &ref_m1);
70 VERIFY(&ref_a2 == &ref_m2);
100 VERIFY(((m1.array() + Scalar(1)) > m1.array()).all());
101 VERIFY(((m1.array() - Scalar(1)) < m1.array()).all());
106 VERIFY(! (m1.array() < m3.array()).all() );
107 VERIFY(! (m1.array() > m3.array()).all() );
111 VERIFY( (m1.array() != (m1(r,c)+1) ).any() );
112 VERIFY( (m1.array() > (m1(r,c)-1) ).any() );
113 VERIFY( (m1.array() < (m1(r,c)+1) ).any() )
[all...] |
| linearstructure.cpp | 87 VERIFY(g_called && "real * matrix<complex> not properly optimized");
91 VERIFY(g_called && "matrix<complex> * real not properly optimized");
95 VERIFY(g_called && "matrix<complex> / real not properly optimized");
99 VERIFY(g_called && "real + matrix<complex> not properly optimized");
103 VERIFY(g_called && "matrix<complex> + real not properly optimized");
107 VERIFY(g_called && "real - matrix<complex> not properly optimized");
111 VERIFY(g_called && "matrix<complex> - real not properly optimized");
117 VERIFY(g_called); // avoid `unneeded-internal-declaration` warning.
|
| numext.cpp | 29 VERIFY( numext::abs(-x) >= Real(0));
31 VERIFY( numext::abs(x) >= Real(0));
|
| sizeof.cpp | 45 VERIFY(sizeof(std::complex<float>) == 2*sizeof(float));
46 VERIFY(sizeof(std::complex<double>) == 2*sizeof(double));
|
| unalignedcount.cpp | 25 VERIFY( (#XPR) && nb_load==AL && nb_loadu==UL && nb_store==AS && nb_storeu==US ); \
51 VERIFY(a==b);
|
| sparse_ref.cpp | 31 VERIFY( (#XPR) && nb_temporaries==N ); \
36 // verify that ref-to-const don't have LvalueBit
38 VERIFY( !(internal::traits<Ref<ConstPlainObjectType> >::Flags & LvalueBit) );
39 VERIFY( !(internal::traits<Ref<ConstPlainObjectType, Aligned> >::Flags & LvalueBit) );
40 VERIFY( !(Ref<ConstPlainObjectType>::Flags & LvalueBit) );
41 VERIFY( !(Ref<ConstPlainObjectType, Aligned>::Flags & LvalueBit) );
52 VERIFY(a.isCompressed());
93 VERIFY(!C.isCompressed());
|
| exceptions.cpp | 87 VERIFY(ScalarWithExceptions::instances==before && "memory leak detected in " && EIGEN_MAKESTRING(OP)); \
89 VERIFY(exception_thrown && " no exception thrown in " && EIGEN_MAKESTRING(OP)); \
107 VERIFY(ScalarWithExceptions::instances==0 && "global memory leak detected in " && EIGEN_MAKESTRING(OP)); \
|
| prec_inverse_4x4.cpp | 24 VERIFY(error == 0.0);
54 VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.0 : 1.25));
55 VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 64.0 : 20.0));
|
| inverse.cpp | 54 VERIFY(invertible);
60 VERIFY(invertible);
67 VERIFY( rows==1 ? invertible : !invertible );
70 VERIFY( rows==1 ? invertible : !invertible );
|
| rand.cpp | 17 VERIFY(r>=x);
20 VERIFY(r<=y);
37 VERIFY( (mask>0).all() );
54 VERIFY( (((hist.cast<double>()/double(f))-1.0).abs()<0.02).all() );
|
| incomplete_cholesky.cpp | 61 VERIFY(solver.preconditioner().info() == Eigen::Success);
62 VERIFY(solver.info() == Eigen::Success);
|
| eigensolver_complex.cpp | 60 VERIFY(vec1.cols() == 1);
61 VERIFY(vec2.cols() == 1);
62 VERIFY(vec1.rows() == vec2.rows());
68 VERIFY( find_pivot(tol, diffs) );
116 VERIFY((eiz.eigenvalues().cwiseEqual(0)).all());
141 VERIFY((ei3.eigenvectors().transpose()*ei3.eigenvectors().transpose()).eval().isIdentity());
|
| geo_alignedbox.cpp | 50 VERIFY(b0.contains(p0*s1+(Scalar(1)-s1)*p1));
51 VERIFY(b0.contains(b0.center()));
55 VERIFY(b2.contains(b0));
56 VERIFY(b2.contains(b1));
65 VERIFY(box1.intersects(box2) == !box1.intersection(box2).isEmpty());
78 VERIFY(b0.contains(r));
|
| /external/eigen/unsupported/test/ |
| FFTW.cpp | 95 VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) );
96 VERIFY( T(fft_rmse(freqBuf,tbuf)) < test_precision<T>() );// gross check
100 VERIFY( (size_t)freqBuf.size() == (size_t)nfft);
101 VERIFY( T(fft_rmse(freqBuf,tbuf)) < test_precision<T>() );// gross check
108 VERIFY( T(dif_rmse(tbuf,tbuf2)) < test_precision<T>() );// gross check
111 // verify that the Unscaled flag takes effect
124 VERIFY( T(dif_rmse(tbuf,tbuf3)) < test_precision<T>() );// gross check
126 // verify that ClearFlag works
129 VERIFY( T(dif_rmse(tbuf,tbuf2)) < test_precision<T>() );// gross check
155 VERIFY( T(fft_rmse(outbuf,inbuf)) < test_precision<T>() );// gross chec
[all...] |
| matrix_exponential.cpp | 40 VERIFY(C.isApprox(B, static_cast<T>(tol)));
44 VERIFY(C.isApprox(B, static_cast<T>(tol)));
65 VERIFY(C.isApprox(B, static_cast<T>(tol)));
69 VERIFY(C.isApprox(B, static_cast<T>(tol)));
89 VERIFY(C.isApprox(B, static_cast<T>(tol)));
93 VERIFY(C.isApprox(B, static_cast<T>(tol)));
114 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));
118 VERIFY(identity.isApprox(m2, static_cast<RealScalar>(tol)));
|
| splines.cpp | 129 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
157 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
197 VERIFY( (pt - pts.col(i)).norm() < 1e-14 );
220 VERIFY( (pt - ref).matrix().norm() < 1e-14 );
232 VERIFY( (pt - ref).matrix().norm() < 1e-14 );
|
| matrix_power.cpp | 29 VERIFY(C.isApprox(B, tol));
51 VERIFY(C.isApprox(B, tol));
65 VERIFY(AngleAxis<T>(angle, v).matrix().isApprox(AngleAxis<T>(1,v).matrix().pow(angle), tol));
87 VERIFY(m4.isApprox(m5, tol));
91 VERIFY(m4.isApprox(m5, tol));
95 VERIFY(m4.isApprox(m5, tol));
122 VERIFY(mpow(0.5L).isApprox(U * (TriangularType(T) * U.adjoint()), tol));
125 VERIFY(mpow(0.25L).isApprox(U * (TriangularType(T) * U.adjoint()), tol));
128 VERIFY(mpow(0.125L).isApprox(U * (TriangularType(T) * U.adjoint()), tol));
145 VERIFY(m.pow(x).isApprox((x * m.log()).exp(), tol))
[all...] |
| sparse_extra.cpp | 103 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, StdMapTraits> >(m,refMat,nonzeroCoords) ));
105 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, StdUnorderedMapTraits> >(m,refMat,nonzeroCoords) ));
108 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, GoogleDenseHashMapTraits> >(m,refMat,nonzeroCoords) ));
111 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, GoogleSparseHashMapTraits> >(m,refMat,nonzeroCoords) ));
|
| /external/webrtc/webrtc/base/ |
| common.h | 146 #ifndef VERIFY
148 #define VERIFY(x) \
152 #define VERIFY(x) rtc::Assert((x), __FUNCTION__, __FILE__, __LINE__, #x)
168 #ifndef VERIFY
169 #define VERIFY(x) rtc::ImplicitCastToBool(x)
|
| /external/autotest/client/site_tests/security_OpenSSLBlacklist/ |
| security_OpenSSLBlacklist.py | 12 VERIFY = OPENSSL + ' verify'
17 def verify(self, blacklist='/dev/null'): member in class:security_OpenSSLBlacklist
19 (blacklist, VERIFY, self.ca, self.cert))
38 if not self.verify():
39 raise error.TestFail('Certificate does not verify normally.')
41 if self.verify(b):
43 if not self.verify(self.bogus_blacklist):
44 raise error.TestFail('Certificate does not verify with nonempty blacklist.')
|
