GitHub-Proxy/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2025-05-06 19:29:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

comment out cerr's

Browse Source
This commit is contained in:
Benoit Jacob 2010-02-28 00:53:06 -05:00
parent eb3a3351cc
commit 1d9c18a8f3
4 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Eigen/src/Eigenvalues/ComplexSchur.h
View File

@ -191,7 +191,7 @@ void ComplexSchur<MatrixType>::compute(const MatrixType& matrix, bool skipU)
if(iter >= 30) if(iter >= 30)
{ {
// FIXME : what to do when iter==MAXITER ?? // FIXME : what to do when iter==MAXITER ??
std::cerr << "MAXITER" << std::endl; //std::cerr << "MAXITER" << std::endl;
return; return;
} }

2
Eigen/src/Sparse/CholmodSupport.h
View File

@ -233,7 +233,7 @@ bool SparseLLT<MatrixType,Cholmod>::solveInPlace(MatrixBase<Derived> &b) const
cholmod_dense* x = cholmod_solve(CHOLMOD_A, m_cholmodFactor, &cdb, &m_cholmod); cholmod_dense* x = cholmod_solve(CHOLMOD_A, m_cholmodFactor, &cdb, &m_cholmod);
if(!x) if(!x)
{ {
std::cerr << "Eigen: cholmod_solve failed\n"; //std::cerr << "Eigen: cholmod_solve failed\n";
return false; return false;
} }
b = Matrix<typename Base::Scalar,Dynamic,1>::Map(reinterpret_cast<typename Base::Scalar*>(x->x),b.rows()); b = Matrix<typename Base::Scalar,Dynamic,1>::Map(reinterpret_cast<typename Base::Scalar*>(x->x),b.rows());

2
Eigen/src/Sparse/DynamicSparseMatrix.h
View File

@ -236,7 +236,7 @@ class DynamicSparseMatrix
{ {
// remove all coefficients with innerCoord>=innerSize // remove all coefficients with innerCoord>=innerSize
// TODO // TODO
std::cerr << "not implemented yet\n"; //std::cerr << "not implemented yet\n";
exit(2); exit(2);
} }
if (m_data.size() != outerSize) if (m_data.size() != outerSize)

8
Eigen/src/Sparse/SuperLUSupport.h
View File

@ -397,7 +397,7 @@ void SparseLU<MatrixType,SuperLU>::compute(const MatrixType& a)
case MinimumDegree_ATA : m_sluOptions.ColPerm = MMD_ATA; break; case MinimumDegree_ATA : m_sluOptions.ColPerm = MMD_ATA; break;
case ColApproxMinimumDegree : m_sluOptions.ColPerm = COLAMD; break; case ColApproxMinimumDegree : m_sluOptions.ColPerm = COLAMD; break;
default: default:
std::cerr << "Eigen: ordering method \"" << Base::orderingMethod() << "\" not supported by the SuperLU backend\n"; //std::cerr << "Eigen: ordering method \"" << Base::orderingMethod() << "\" not supported by the SuperLU backend\n";
m_sluOptions.ColPerm = NATURAL; m_sluOptions.ColPerm = NATURAL;
}; };
@ -448,7 +448,7 @@ void SparseLU<MatrixType,SuperLU>::compute(const MatrixType& a)
&recip_pivot_gross, &rcond, &recip_pivot_gross, &rcond,
&m_sluStat, &info, Scalar()); &m_sluStat, &info, Scalar());
#else #else
std::cerr << "Incomplete factorization is only available in SuperLU v4\n"; //std::cerr << "Incomplete factorization is only available in SuperLU v4\n";
Base::m_succeeded = false; Base::m_succeeded = false;
return; return;
#endif #endif
@ -486,7 +486,7 @@ bool SparseLU<MatrixType,SuperLU>::solve(const MatrixBase<BDerived> &b,
case SvTranspose : m_sluOptions.Trans = TRANS; break; case SvTranspose : m_sluOptions.Trans = TRANS; break;
case SvAdjoint : m_sluOptions.Trans = CONJ; break; case SvAdjoint : m_sluOptions.Trans = CONJ; break;
default: default:
std::cerr << "Eigen: transposition option \"" << transposed << "\" not supported by the SuperLU backend\n"; //std::cerr << "Eigen: transposition option \"" << transposed << "\" not supported by the SuperLU backend\n";
m_sluOptions.Trans = NOTRANS; m_sluOptions.Trans = NOTRANS;
} }
@ -513,7 +513,7 @@ bool SparseLU<MatrixType,SuperLU>::solve(const MatrixBase<BDerived> &b,
&recip_pivot_gross, &rcond, &recip_pivot_gross, &rcond,
&m_sluStat, &info, Scalar()); &m_sluStat, &info, Scalar());
#else #else
std::cerr << "Incomplete factorization is only available in SuperLU v4\n"; //std::cerr << "Incomplete factorization is only available in SuperLU v4\n";
return false; return false;
#endif #endif
} }