| /external/eigen/test/ |
| unalignedcount.cpp | 25 VERIFY( (#XPR) && nb_load==AL && nb_loadu==UL && nb_store==AS && nb_storeu==US ); \
44 VERIFY(a==b);
|
| cwiseop.cpp | 104 VERIFY(mzero.isZero());
105 VERIFY(mones.isOnes());
106 VERIFY(m3.isConstant(s1));
107 VERIFY(identity.isIdentity());
152 VERIFY( (m1.cwise() == m1).all() );
153 VERIFY( (m1.cwise() != m2).any() );
154 VERIFY(!(m1.cwise() == (m1+mones)).any() );
159 VERIFY( (m1.cwise() == m3).any() );
160 VERIFY( !(m1.cwise() == m3).all() );
162 VERIFY( (m1.cwise().min(m2).cwise() <= m2).all() )
[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);
116 VERIFY(0 == lu.dimensionOfKernel());
117 VERIFY(lu.kernel().cols() == 1); // the kernel() should consist of a single (zero) column vecto
[all...] |
| integer_types.cpp | 15 #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);
55 VERIFY(NumTraits<Scalar>::IsInteger);
57 VERIFY(int(NumTraits<Scalar>::IsSigned) == is_signed);
102 VERIFY(m1==m1);
103 VERIFY(m1!=m2);
104 VERIFY(!(m1==m2));
105 VERIFY(!(m1!=m1));
107 VERIFY(m1==m2)
[all...] |
| packetmath.cpp | 57 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
64 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
92 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
121 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store");
126 VERIFY(areApprox(data1+offset, data2, PacketSize) && "internal::ploadu");
132 VERIFY(areApprox(data1, data2+offset, PacketSize) && "internal::pstoreu");
148 VERIFY(areApprox(ref, data2, PacketSize) && "internal::palign");
166 VERIFY(areApprox(ref, data2, PacketSize) && "internal::pset1");
169 VERIFY(internal::isApprox(data1[0], internal::pfirst(internal::pload<Packet>(data1))) && "internal::pfirst");
178 VERIFY(areApprox(ref, data2, PacketSize) && "ploaddup")
[all...] |
| qr_colpivoting.cpp | 26 VERIFY(rank == qr.rank());
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
28 VERIFY(!qr.isInjective());
29 VERIFY(!qr.isInvertible());
30 VERIFY(!qr.isSurjective());
54 VERIFY(rank == qr.rank());
55 VERIFY(Cols - qr.rank() == qr.dimensionOfKernel());
56 VERIFY(qr.isInjective() == (rank == Rows));
57 VERIFY(qr.isSurjective() == (rank == Cols));
58 VERIFY(qr.isInvertible() == (qr.isInjective() && qr.isSurjective()))
[all...] |
| 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 );
|
| qr_fullpivoting.cpp | 26 VERIFY(rank == qr.rank());
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
28 VERIFY(!qr.isInjective());
29 VERIFY(!qr.isInvertible());
30 VERIFY(!qr.isSurjective());
71 VERIFY(qr.isInjective());
72 VERIFY(qr.isInvertible());
73 VERIFY(qr.isSurjective());
|
| visitor.cpp | 50 VERIFY(minrow == eigen_minrow);
51 VERIFY(maxrow == eigen_maxrow);
52 VERIFY(mincol == eigen_mincol);
53 VERIFY(maxcol == eigen_maxcol);
94 VERIFY(minidx == eigen_minidx);
95 VERIFY(maxidx == eigen_maxidx);
109 VERIFY(eigen_minidx == (std::min)(idx0,idx1));
110 VERIFY(eigen_maxidx == (std::min)(idx0,idx2));
|
| nullary.cpp | 64 VERIFY( (MatrixXd(RowVectorXd::LinSpaced(3, 0, 1)) - RowVector3d(0, 0.5, 1)).norm() < std::numeric_limits<Scalar>::epsilon() );
67 //VERIFY( m(m.size()-1) == high );
68 //VERIFY( m(0) == low );
75 //VERIFY( m(m.size()-1) == high );
76 //VERIFY( m(0) == low );
85 VERIFY( row_vector.isApprox(col_vector.transpose(), Scalar(2)*NumTraits<Scalar>::epsilon()));
89 VERIFY( size_changer.size() == size );
113 VERIFY(equalsIdentity(A));
114 VERIFY(equalsIdentity(MatrixType::Identity(rows, cols)));
|
| array.cpp | 103 VERIFY(((m1 + Scalar(1)) > m1).all());
104 VERIFY(((m1 - Scalar(1)) < m1).all());
109 VERIFY(! (m1 < m3).all() );
110 VERIFY(! (m1 > m3).all() );
112 VERIFY(!(m1 > m2 && m1 < m2).any());
113 VERIFY((m1 <= m2 || m1 >= m2).all());
116 VERIFY( (m1 != (m1(r,c)+1) ).any() );
117 VERIFY( (m1 > (m1(r,c)-1) ).any() );
118 VERIFY( (m1 < (m1(r,c)+1) ).any() );
119 VERIFY( (m1 == m1(r,c) ).any() )
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_alignedbox.cpp | 36 VERIFY(b0.contains(p0*s1+(Scalar(1)-s1)*p1));
37 VERIFY(!b0.contains(p0 + (1+s1)*(p1-p0)));
40 VERIFY(b2.contains(b0));
41 VERIFY(b2.contains(b1));
|
| eigen2_cwiseop.cpp | 57 VERIFY(mzero.isZero());
58 VERIFY(mones.isOnes());
59 VERIFY(m3.isConstant(s1));
60 VERIFY(identity.isIdentity());
125 VERIFY( (m1.cwise() == m1).all() );
126 VERIFY( (m1.cwise() != m2).any() );
127 VERIFY(!(m1.cwise() == (m1+mones)).any() );
132 VERIFY( (m1.cwise() == m3).any() );
133 VERIFY( !(m1.cwise() == m3).all() );
135 VERIFY( (m1.cwise().min(m2).cwise() <= m2).all() )
[all...] |
| eigen2_visitor.cpp | 49 VERIFY(minrow == eigen_minrow);
50 VERIFY(maxrow == eigen_maxrow);
51 VERIFY(mincol == eigen_mincol);
52 VERIFY(maxcol == eigen_maxcol);
92 VERIFY(minidx == eigen_minidx);
93 VERIFY(maxidx == eigen_maxidx);
|
| eigen2_array.cpp | 68 VERIFY(((m1.cwise() + Scalar(1)).cwise() > m1).all());
69 VERIFY(((m1.cwise() - Scalar(1)).cwise() < m1).all());
74 VERIFY(! (m1.cwise() < m3).all() );
75 VERIFY(! (m1.cwise() > m3).all() );
79 VERIFY( (m1.cwise() != (m1(r,c)+1) ).any() );
80 VERIFY( (m1.cwise() > (m1(r,c)-1) ).any() );
81 VERIFY( (m1.cwise() < (m1(r,c)+1) ).any() );
82 VERIFY( (m1.cwise() == m1(r,c) ).any() );
102 VERIFY(((m1.cwise().abs().cwise()+1).cwise()>RealScalar(0.1)).count() == rows*cols);
|
| eigen2_packetmath.cpp | 25 VERIFY(areApprox(ref, data2, PacketSize) && #POP); \
60 VERIFY(areApprox(data1, data2, PacketSize) && "aligned load/store");
65 VERIFY(areApprox(data1+offset, data2, PacketSize) && "ei_ploadu");
71 VERIFY(areApprox(data1, data2+offset, PacketSize) && "ei_pstoreu");
88 VERIFY(areApprox(ref, data2, PacketSize) && "ei_palign");
104 VERIFY(areApprox(ref, data2, PacketSize) && "ei_pset1");
106 VERIFY(ei_isApprox(data1[0], ei_pfirst(ei_pload(data1))) && "ei_pfirst");
111 VERIFY(ei_isApprox(ref[0], ei_predux(ei_pload(data1))) && "ei_predux");
121 VERIFY(areApprox(ref, data2, PacketSize) && "ei_preduxp");
|
| eigen2_sparse_vector.cpp | 45 VERIFY(int(nonzerocoords.size()) == v1.nonZeros());
49 VERIFY(nonzerocoords[j]==it.index());
50 VERIFY(it.value()==v1.coeff(it.index()));
51 VERIFY(it.value()==refV1.coeff(it.index()));
|
| eigen2_sparse_solvers.cpp | 89 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: default");
94 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: cholmod");
101 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (IncompleteFactorization)");
104 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalMultifrontal)");
107 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LLT: taucs (SupernodalLeftLooking)");
133 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LDLT: default");
154 // // VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: default");
162 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: SuperLU");
179 VERIFY(refX.isApprox(x,test_precision<Scalar>()) && "LU: umfpack"); // FIXME solve is not very stable for complex
|
| /external/eigen/unsupported/test/ |
| 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 );
|
| FFTW.cpp | 95 VERIFY((size_t)freqBuf.size() == (size_t)( (nfft>>1)+1) );
96 VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>() );// gross check
100 VERIFY( (size_t)freqBuf.size() == (size_t)nfft);
101 VERIFY( fft_rmse(freqBuf,tbuf) < test_precision<T>() );// gross check
108 VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>() );// gross check
111 // verify that the Unscaled flag takes effect
124 VERIFY( dif_rmse(tbuf,tbuf3) < test_precision<T>() );// gross check
126 // verify that ClearFlag works
129 VERIFY( dif_rmse(tbuf,tbuf2) < test_precision<T>() );// gross check
155 VERIFY( 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)));
|
| /libcore/support/src/test/java/org/apache/harmony/security/tests/support/ |
| MySignature1.java | 47 public static int VERIFY = Signature.VERIFY;
|
| /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)
|
| /art/test/etc/ |
| run-test-jar | 51 VERIFY="y" # y=yes,n=no,s=softfail
185 elif [ "x$1" = "x--no-verify" ]; then
186 VERIFY="n"
188 elif [ "x$1" = "x--verify-soft-fail" ]; then
189 VERIFY="s"
247 if [ "$VERIFY" = "y" ]; then
258 if [ "$VERIFY" = "y" ]; then
261 elif [ "$VERIFY" = "s" ]; then
265 else # VERIFY = "n"
325 if [ "$VERIFY" = "y" ] ; the
[all...] |
