HomeSort by relevance Sort by last modified time
    Searched refs:VERIFY (Results 26 - 50 of 148) sorted by null

12 3 4 5 6

  /external/eigen/test/eigen2/
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
eigen2_prec_inverse_4x4.cpp 43 VERIFY(error == 0.0);
70 VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.0 : 1.25));
71 VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 64.0 : 20.0));
eigen2_cholesky.cpp 70 VERIFY(ldlt.isPositiveDefinite());
81 VERIFY(chol.isPositiveDefinite());
95 VERIFY(!chol.isPositiveDefinite());
97 VERIFY(!cholnosqrt.isPositiveDefinite());
  /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)));
sparse_extra.cpp 104 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, StdMapTraits> >(m,refMat,nonzeroCoords) ));
106 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, StdUnorderedMapTraits> >(m,refMat,nonzeroCoords) ));
109 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, GoogleDenseHashMapTraits> >(m,refMat,nonzeroCoords) ));
112 VERIFY(( test_random_setter<RandomSetter<SparseMatrixType, GoogleSparseHashMapTraits> >(m,refMat,nonzeroCoords) ));
  /external/eigen/test/
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)));
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)); \
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() );
114 VERIFY( (m1 != (m1(r,c)+1) ).any() );
115 VERIFY( (m1 > (m1(r,c)-1) ).any() );
116 VERIFY( (m1 < (m1(r,c)+1) ).any() );
117 VERIFY( (m1 == m1(r,c) ).any() );
137 VERIFY(((m1.abs()+1)>RealScalar(0.1)).count() == rows*cols);
140 VERIFY( (m1<RealScalar(0) && m1>RealScalar(0)).count() == 0)
    [all...]
eigensolver_complex.cpp 23 VERIFY(vec1.cols() == 1);
24 VERIFY(vec2.cols() == 1);
25 VERIFY(vec1.rows() == vec2.rows());
77 VERIFY((eiz.eigenvalues().cwiseEqual(0)).all());
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()));
  /libcore/support/src/test/java/org/apache/harmony/security/tests/support/
MySignature1.java 47 public static int VERIFY = Signature.VERIFY;

Completed in 168 milliseconds

12 3 4 5 6