// This file is part of Eigen, a lightweight C++ template library // for linear algebra. // // Copyright (C) 2010 Gael Guennebaud // // Eigen is free software; you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public // License as published by the Free Software Foundation; either // version 3 of the License, or (at your option) any later version. // // Alternatively, you can redistribute it and/or // modify it under the terms of the GNU General Public License as // published by the Free Software Foundation; either version 2 of // the License, or (at your option) any later version. // // Eigen is distributed in the hope that it will be useful, but WITHOUT ANY // WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS // FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the // GNU General Public License for more details. // // You should have received a copy of the GNU Lesser General Public // License and a copy of the GNU General Public License along with // Eigen. If not, see . #ifndef EIGEN_SPARSE_SOLVE_H #define EIGEN_SPARSE_SOLVE_H namespace internal { template struct sparse_solve_retval_base; template struct sparse_solve_retval; template struct traits > { typedef typename DecompositionType::MatrixType MatrixType; typedef SparseMatrix ReturnType; }; template struct sparse_solve_retval_base : public ReturnByValue > { typedef typename remove_all::type RhsNestedCleaned; typedef _DecompositionType DecompositionType; typedef ReturnByValue Base; typedef typename Base::Index Index; sparse_solve_retval_base(const DecompositionType& dec, const Rhs& rhs) : m_dec(dec), m_rhs(rhs) {} inline Index rows() const { return m_dec.cols(); } inline Index cols() const { return m_rhs.cols(); } inline const DecompositionType& dec() const { return m_dec; } inline const RhsNestedCleaned& rhs() const { return m_rhs; } template inline void evalTo(Dest& dst) const { static_cast*>(this)->evalTo(dst); } protected: const DecompositionType& m_dec; const typename Rhs::Nested m_rhs; }; #define EIGEN_MAKE_SPARSE_SOLVE_HELPERS(DecompositionType,Rhs) \ typedef typename DecompositionType::MatrixType MatrixType; \ typedef typename MatrixType::Scalar Scalar; \ typedef typename MatrixType::RealScalar RealScalar; \ typedef typename MatrixType::Index Index; \ typedef Eigen::internal::sparse_solve_retval_base Base; \ using Base::dec; \ using Base::rhs; \ using Base::rows; \ using Base::cols; \ sparse_solve_retval(const DecompositionType& dec, const Rhs& rhs) \ : Base(dec, rhs) {} template struct solve_retval_with_guess; template struct traits > { typedef typename DecompositionType::MatrixType MatrixType; typedef Matrix ReturnType; }; template struct solve_retval_with_guess : public ReturnByValue > { typedef typename DecompositionType::Index Index; solve_retval_with_guess(const DecompositionType& dec, const Rhs& rhs, const Guess& guess) : m_dec(dec), m_rhs(rhs), m_guess(guess) {} inline Index rows() const { return m_dec.cols(); } inline Index cols() const { return m_rhs.cols(); } template inline void evalTo(Dest& dst) const { dst = m_guess; m_dec._solveWithGuess(m_rhs,dst); } protected: const DecompositionType& m_dec; const typename Rhs::Nested m_rhs; const typename Guess::Nested m_guess; }; } // namepsace internal #endif // EIGEN_SPARSE_SOLVE_H