23 bool is_sorted(const T& mat) {  in is_sorted()  argument
24   for(Index k = 0; k<mat.outerSize(); ++k)  in is_sorted()
27     for(typename T::InnerIterator it(mat,k); it; ++it)  in is_sorted()
58   SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols);  in sparse_permutations()  local
62   initSparse<Scalar>(density, mat_d, mat, 0);  in sparse_permutations()
64   up = mat.template triangularView<Upper>();  in sparse_permutations()
65   lo = mat.template triangularView<Lower>();  in sparse_permutations()
70   VERIFY_IS_APPROX(mat, mat_d);  in sparse_permutations()
79   VERIFY( is_sorted( ::eval(mat*p) ));  in sparse_permutations()
80   VERIFY( is_sorted( res = mat*p ));  in sparse_permutations()
81   VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p), 0);  in sparse_permutations()
86   VERIFY( is_sorted( ::eval(p*mat) ));  in sparse_permutations()
87   VERIFY( is_sorted( res = p*mat ));  in sparse_permutations()
88   VERIFY_TRANSPOSITION_COUNT( ::eval(p*mat), 0);  in sparse_permutations()
92   VERIFY( is_sorted( (mat*p).eval() ));  in sparse_permutations()
93   VERIFY( is_sorted( res = mat*p.inverse() ));  in sparse_permutations()
94   VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p.inverse()), 0);  in sparse_permutations()
95   res_d = mat*p.inverse();  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()
100   VERIFY_TRANSPOSITION_COUNT( ::eval(p.inverse()*mat), 0);  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()
106   VERIFY_TRANSPOSITION_COUNT( ::eval(p * mat * p.inverse()), 0);  in sparse_permutations()
111   VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p_null) ));  in sparse_permutations()
115   VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p_null) ));  in sparse_permutations()
129   VERIFY( is_sorted( res = mat.template selfadjointView<Upper>() ));  in sparse_permutations()
133   VERIFY( is_sorted( res = mat.template selfadjointView<Lower>() ));  in sparse_permutations()
146   res.template selfadjointView<Upper>() = mat.template selfadjointView<Upper>();  in sparse_permutations()
150   res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>();  in sparse_permutations()
154   res.template selfadjointView<Upper>() = mat.template selfadjointView<Lower>();  in sparse_permutations()
158   res.template selfadjointView<Lower>() = mat.template selfadjointView<Lower>();  in sparse_permutations()
164   res.template selfadjointView<Upper>() = mat.template selfadjointView<Upper>().twistedBy(p);  in sparse_permutations()
168   res.template selfadjointView<Upper>() = mat.template selfadjointView<Lower>().twistedBy(p);  in sparse_permutations()
172   res.template selfadjointView<Lower>() = mat.template selfadjointView<Lower>().twistedBy(p);  in sparse_permutations()
176   res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>().twistedBy(p);  in sparse_permutations()
198   VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p) ));  in sparse_permutations()
202   VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p) ));  in sparse_permutations()