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()
99   VERIFY( is_sorted( res = p.inverse()*mat ));  in sparse_permutations()
100   VERIFY_TRANSPOSITION_COUNT( ::eval(p.inverse()*mat), 0);  in sparse_permutations()
101   res_d = p.inverse()*mat_d;  in sparse_permutations()
104   VERIFY( is_sorted( (p * mat * p.inverse()).eval() ));  in sparse_permutations()
106   VERIFY_TRANSPOSITION_COUNT( ::eval(p * mat * p.inverse()), 0);  in sparse_permutations()
107   res_d = (p * mat_d) * p.inverse();  in sparse_permutations()
165   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
169   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
173   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
177   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
182   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
186   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>();  in sparse_permutations()
190   res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
194   res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>();  in sparse_permutations()
199   res_d = (p * up_sym_d) * p.inverse();  in sparse_permutations()
203   res_d = (p * lo_sym_d) * p.inverse();  in sparse_permutations()
207   res_d = (p * up_sym_d) * p.inverse();  in sparse_permutations()
211   res_d = (p * lo_sym_d) * p.inverse();  in sparse_permutations()