Home | History | Annotate | Download | only in test

Lines Matching refs:VERIFY

17     VERIFY( (#XPR) && nb_transposed_copies==N ); \
40 VERIFY( int(internal::nested_eval<T,1>::type::Flags&RowMajorBit) == int(internal::evaluator<T>::Flags&RowMajorBit) );
79 VERIFY( is_sorted( ::eval(mat*p) ));
80 VERIFY( is_sorted( res = mat*p ));
84 VERIFY(res.isApprox(res_d) && "mat*p");
86 VERIFY( is_sorted( ::eval(p*mat) ));
87 VERIFY( is_sorted( res = p*mat ));
90 VERIFY(res.isApprox(res_d) && "p*mat");
92 VERIFY( is_sorted( (mat*p).eval() ));
93 VERIFY( is_sorted( res = mat*p.inverse() ));
96 VERIFY(res.isApprox(res_d) && "mat*inv(p)");
98 VERIFY( is_sorted( (p*mat+p*mat).eval() ));
99 VERIFY( is_sorted( res = p.inverse()*mat ));
102 VERIFY(res.isApprox(res_d) && "inv(p)*mat");
104 VERIFY( is_sorted( (p * mat * p.inverse()).eval() ));
105 VERIFY( is_sorted( res = mat.twistedBy(p) ));
108 VERIFY(res.isApprox(res_d) && "p*mat*inv(p)");
111 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p_null) ));
113 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
115 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p_null) ));
117 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
120 VERIFY( is_sorted( res = up.template selfadjointView<Upper>().twistedBy(p_null) ));
122 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");
124 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>().twistedBy(p_null) ));
126 VERIFY(res.isApprox(res_d) && "lower selfadjoint full");
129 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>() ));
131 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
133 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>() ));
135 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
137 VERIFY( is_sorted( res = up.template selfadjointView<Upper>() ));
139 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");
141 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>() ));
143 VERIFY(res.isApprox(res_d) && "lower selfadjoint full");
148 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to upper");
152 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to lower");
156 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to upper");
160 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to lower");
166 VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to upper");
170 VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to upper");
174 VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to lower");
178 VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to lower");
183 VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to upper");
187 VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to upper");
191 VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to lower");
195 VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to lower");
198 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p) ));
200 VERIFY(res.isApprox(res_d) && "full selfadjoint upper twisted to full");
202 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p) ));
204 VERIFY(res.isApprox(res_d) && "full selfadjoint lower twisted to full");
206 VERIFY( is_sorted( res = up.template selfadjointView<Upper>().twistedBy(p) ));
208 VERIFY(res.isApprox(res_d) && "upper selfadjoint twisted to full");
210 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>().twistedBy(p) ));
212 VERIFY(res.isApprox(res_d) && "lower selfadjoint twisted to full");
231 VERIFY((internal::is_same<internal::permutation_matrix_product<SparseMatrix<double>,OnTheRight,false,SparseShape>::ReturnType,
234 VERIFY((internal::is_same<internal::permutation_matrix_product<SparseMatrix<double>,OnTheLeft,false,SparseShape>::ReturnType,