devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Replace instances of EIGEN_NOEXCEPT macros

Browse Source
This commit is contained in:
Tyler Veness
2025-04-22 00:58:47 +00:00
committed by Charles Schlosser
parent d2dce37767
commit 619be0deb6
51 changed files with 186 additions and 217 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h
View File

@@ -51,8 +51,8 @@ class DiagonalPreconditioner {
compute(mat);
}
constexpr Index rows() const EIGEN_NOEXCEPT { return m_invdiag.size(); }
constexpr Index cols() const EIGEN_NOEXCEPT { return m_invdiag.size(); }
constexpr Index rows() const noexcept { return m_invdiag.size(); }
constexpr Index cols() const noexcept { return m_invdiag.size(); }
template <typename MatType>
DiagonalPreconditioner& analyzePattern(const MatType&) {

4
Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h
View File

@@ -84,10 +84,10 @@ class IncompleteCholesky : public SparseSolverBase<IncompleteCholesky<Scalar, Up
}
/** \returns number of rows of the factored matrix */
constexpr Index rows() const EIGEN_NOEXCEPT { return m_L.rows(); }
constexpr Index rows() const noexcept { return m_L.rows(); }
/** \returns number of columns of the factored matrix */
constexpr Index cols() const EIGEN_NOEXCEPT { return m_L.cols(); }
constexpr Index cols() const noexcept { return m_L.cols(); }
/** \brief Reports whether previous computation was successful.
*

4
Eigen/src/IterativeLinearSolvers/IncompleteLUT.h
View File

@@ -135,9 +135,9 @@ class IncompleteLUT : public SparseSolverBase<IncompleteLUT<Scalar_, StorageInde
/** \brief Extraction Method for U-Factor */
const FactorType matrixU() const;
constexpr Index rows() const EIGEN_NOEXCEPT { return m_lu.rows(); }
constexpr Index rows() const noexcept { return m_lu.rows(); }
constexpr Index cols() const EIGEN_NOEXCEPT { return m_lu.cols(); }
constexpr Index cols() const noexcept { return m_lu.cols(); }
/** \brief Reports whether previous computation was successful.
*

4
Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h
View File

@@ -218,10 +218,10 @@ class IterativeSolverBase : public SparseSolverBase<Derived> {
}
/** \internal */
constexpr Index rows() const EIGEN_NOEXCEPT { return matrix().rows(); }
constexpr Index rows() const noexcept { return matrix().rows(); }
/** \internal */
constexpr Index cols() const EIGEN_NOEXCEPT { return matrix().cols(); }
constexpr Index cols() const noexcept { return matrix().cols(); }
/** \returns the tolerance threshold used by the stopping criteria.
* \sa setTolerance()

4
Eigen/src/IterativeLinearSolvers/SolveWithGuess.h
View File

@@ -50,8 +50,8 @@ class SolveWithGuess : public internal::generic_xpr_base<SolveWithGuess<Decompos
SolveWithGuess(const Decomposition &dec, const RhsType &rhs, const GuessType &guess)
: m_dec(dec), m_rhs(rhs), m_guess(guess) {}
EIGEN_DEVICE_FUNC constexpr Index rows() const EIGEN_NOEXCEPT { return m_dec.cols(); }
EIGEN_DEVICE_FUNC constexpr Index cols() const EIGEN_NOEXCEPT { return m_rhs.cols(); }
EIGEN_DEVICE_FUNC constexpr Index rows() const noexcept { return m_dec.cols(); }
EIGEN_DEVICE_FUNC constexpr Index cols() const noexcept { return m_rhs.cols(); }
EIGEN_DEVICE_FUNC const Decomposition &dec() const { return m_dec; }
EIGEN_DEVICE_FUNC const RhsType &rhs() const { return m_rhs; }