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