67     Cols = MatrixType::ColsAtCompileTime  in cod_fixedsize()  enumerator
70   int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols)) - 1);  in cod_fixedsize()
71   Matrix<Scalar, Rows, Cols> matrix;  in cod_fixedsize()
72   createRandomPIMatrixOfRank(rank, Rows, Cols, matrix);  in cod_fixedsize()
73   CompleteOrthogonalDecomposition<Matrix<Scalar, Rows, Cols> > cod(matrix);  in cod_fixedsize()
75   VERIFY(Cols - cod.rank() == cod.dimensionOfKernel());  in cod_fixedsize()
77   VERIFY(cod.isSurjective() == (rank == Cols));  in cod_fixedsize()
80   Matrix<Scalar, Cols, Cols2> exact_solution;  in cod_fixedsize()
81   exact_solution.setRandom(Cols, Cols2);  in cod_fixedsize()
83   Matrix<Scalar, Cols, Cols2> cod_solution = cod.solve(rhs);  in cod_fixedsize()
88   Matrix<Scalar, Cols, Cols2> svd_solution = svd.solve(rhs);  in cod_fixedsize()
159   enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };  in qr_fixedsize()  enumerator
162   int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);  in qr_fixedsize()
163   Matrix<Scalar,Rows,Cols> m1;  in qr_fixedsize()
164   createRandomPIMatrixOfRank(rank,Rows,Cols,m1);  in qr_fixedsize()
165   ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);  in qr_fixedsize()
167   VERIFY_IS_EQUAL(Cols - qr.rank(), qr.dimensionOfKernel());  in qr_fixedsize()
169   VERIFY_IS_EQUAL(qr.isSurjective(), (rank == Cols));  in qr_fixedsize()
172   Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();  in qr_fixedsize()
173   Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse();  in qr_fixedsize()
176   Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);  in qr_fixedsize()
178   m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2);  in qr_fixedsize()
185   for (Index i = 0; i < (std::min)(int(Rows), int(Cols)) - 1; ++i) {  in qr_fixedsize()
190       for (Index j = 0; j < (std::min)(int(Rows), int(Cols)); ++j) {  in qr_fixedsize()