| // This file is part of Eigen, a lightweight C++ template library |
| // for linear algebra. |
| // |
| // Copyright (C) 2008-2009 Gael Guennebaud <g.gael@free.fr> |
| // Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com> |
| // |
| // 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 <http://www.gnu.org/licenses/>. |
| |
| #ifndef EIGEN_CWISE_BINARY_OP_H |
| #define EIGEN_CWISE_BINARY_OP_H |
| |
| /** \class CwiseBinaryOp |
| * |
| * \brief Generic expression where a coefficient-wise binary operator is applied to two expressions |
| * |
| * \param BinaryOp template functor implementing the operator |
| * \param Lhs the type of the left-hand side |
| * \param Rhs the type of the right-hand side |
| * |
| * This class represents an expression where a coefficient-wise binary operator is applied to two expressions. |
| * It is the return type of binary operators, by which we mean only those binary operators where |
| * both the left-hand side and the right-hand side are Eigen expressions. |
| * For example, the return type of matrix1+matrix2 is a CwiseBinaryOp. |
| * |
| * Most of the time, this is the only way that it is used, so you typically don't have to name |
| * CwiseBinaryOp types explicitly. |
| * |
| * \sa MatrixBase::binaryExpr(const MatrixBase<OtherDerived> &,const CustomBinaryOp &) const, class CwiseUnaryOp, class CwiseNullaryOp |
| */ |
| template<typename BinaryOp, typename Lhs, typename Rhs> |
| struct ei_traits<CwiseBinaryOp<BinaryOp, Lhs, Rhs> > |
| { |
| // we must not inherit from ei_traits<Lhs> since it has |
| // the potential to cause problems with MSVC |
| typedef typename ei_cleantype<Lhs>::type Ancestor; |
| typedef typename ei_traits<Ancestor>::XprKind XprKind; |
| enum { |
| RowsAtCompileTime = ei_traits<Ancestor>::RowsAtCompileTime, |
| ColsAtCompileTime = ei_traits<Ancestor>::ColsAtCompileTime, |
| MaxRowsAtCompileTime = ei_traits<Ancestor>::MaxRowsAtCompileTime, |
| MaxColsAtCompileTime = ei_traits<Ancestor>::MaxColsAtCompileTime |
| }; |
| |
| // even though we require Lhs and Rhs to have the same scalar type (see CwiseBinaryOp constructor), |
| // we still want to handle the case when the result type is different. |
| typedef typename ei_result_of< |
| BinaryOp( |
| typename Lhs::Scalar, |
| typename Rhs::Scalar |
| ) |
| >::type Scalar; |
| typedef typename ei_promote_storage_type<typename ei_traits<Lhs>::StorageKind, |
| typename ei_traits<Rhs>::StorageKind>::ret StorageKind; |
| typedef typename ei_promote_index_type<typename ei_traits<Lhs>::Index, |
| typename ei_traits<Rhs>::Index>::type Index; |
| typedef typename Lhs::Nested LhsNested; |
| typedef typename Rhs::Nested RhsNested; |
| typedef typename ei_unref<LhsNested>::type _LhsNested; |
| typedef typename ei_unref<RhsNested>::type _RhsNested; |
| enum { |
| LhsCoeffReadCost = _LhsNested::CoeffReadCost, |
| RhsCoeffReadCost = _RhsNested::CoeffReadCost, |
| LhsFlags = _LhsNested::Flags, |
| RhsFlags = _RhsNested::Flags, |
| StorageOrdersAgree = (int(Lhs::Flags)&RowMajorBit)==(int(Rhs::Flags)&RowMajorBit), |
| Flags0 = (int(LhsFlags) | int(RhsFlags)) & ( |
| HereditaryBits |
| | (int(LhsFlags) & int(RhsFlags) & |
| ( AlignedBit |
| | (StorageOrdersAgree ? LinearAccessBit : 0) |
| | (ei_functor_traits<BinaryOp>::PacketAccess && StorageOrdersAgree ? PacketAccessBit : 0) |
| ) |
| ) |
| ), |
| Flags = (Flags0 & ~RowMajorBit) | (LhsFlags & RowMajorBit), |
| CoeffReadCost = LhsCoeffReadCost + RhsCoeffReadCost + ei_functor_traits<BinaryOp>::Cost |
| }; |
| }; |
| |
| template<typename BinaryOp, typename Lhs, typename Rhs, typename StorageKind> |
| class CwiseBinaryOpImpl; |
| |
| template<typename BinaryOp, typename Lhs, typename Rhs> |
| class CwiseBinaryOp : ei_no_assignment_operator, |
| public CwiseBinaryOpImpl< |
| BinaryOp, Lhs, Rhs, |
| typename ei_promote_storage_type<typename ei_traits<Lhs>::StorageKind, |
| typename ei_traits<Rhs>::StorageKind>::ret> |
| { |
| public: |
| |
| typedef typename CwiseBinaryOpImpl< |
| BinaryOp, Lhs, Rhs, |
| typename ei_promote_storage_type<typename ei_traits<Lhs>::StorageKind, |
| typename ei_traits<Rhs>::StorageKind>::ret>::Base Base; |
| EIGEN_GENERIC_PUBLIC_INTERFACE(CwiseBinaryOp) |
| |
| typedef typename ei_nested<Lhs>::type LhsNested; |
| typedef typename ei_nested<Rhs>::type RhsNested; |
| typedef typename ei_unref<LhsNested>::type _LhsNested; |
| typedef typename ei_unref<RhsNested>::type _RhsNested; |
| |
| EIGEN_STRONG_INLINE CwiseBinaryOp(const Lhs& lhs, const Rhs& rhs, const BinaryOp& func = BinaryOp()) |
| : m_lhs(lhs), m_rhs(rhs), m_functor(func) |
| { |
| // we require Lhs and Rhs to have the same scalar type. Currently there is no example of a binary functor |
| // that would take two operands of different types. If there were such an example, then this check should be |
| // moved to the BinaryOp functors, on a per-case basis. This would however require a change in the BinaryOp functors, as |
| // currently they take only one typename Scalar template parameter. |
| // It is tempting to always allow mixing different types but remember that this is often impossible in the vectorized paths. |
| // So allowing mixing different types gives very unexpected errors when enabling vectorization, when the user tries to |
| // add together a float matrix and a double matrix. |
| EIGEN_STATIC_ASSERT((ei_functor_allows_mixing_real_and_complex<BinaryOp>::ret |
| ? int(ei_is_same_type<typename Lhs::RealScalar, typename Rhs::RealScalar>::ret) |
| : int(ei_is_same_type<typename Lhs::Scalar, typename Rhs::Scalar>::ret)), |
| YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) |
| // require the sizes to match |
| EIGEN_STATIC_ASSERT_SAME_MATRIX_SIZE(Lhs, Rhs) |
| ei_assert(lhs.rows() == rhs.rows() && lhs.cols() == rhs.cols()); |
| } |
| |
| EIGEN_STRONG_INLINE Index rows() const { |
| // return the fixed size type if available to enable compile time optimizations |
| if (ei_traits<typename ei_cleantype<LhsNested>::type>::RowsAtCompileTime==Dynamic) |
| return m_rhs.rows(); |
| else |
| return m_lhs.rows(); |
| } |
| EIGEN_STRONG_INLINE Index cols() const { |
| // return the fixed size type if available to enable compile time optimizations |
| if (ei_traits<typename ei_cleantype<LhsNested>::type>::ColsAtCompileTime==Dynamic) |
| return m_rhs.cols(); |
| else |
| return m_lhs.cols(); |
| } |
| |
| /** \returns the left hand side nested expression */ |
| const _LhsNested& lhs() const { return m_lhs; } |
| /** \returns the right hand side nested expression */ |
| const _RhsNested& rhs() const { return m_rhs; } |
| /** \returns the functor representing the binary operation */ |
| const BinaryOp& functor() const { return m_functor; } |
| |
| protected: |
| const LhsNested m_lhs; |
| const RhsNested m_rhs; |
| const BinaryOp m_functor; |
| }; |
| |
| template<typename BinaryOp, typename Lhs, typename Rhs> |
| class CwiseBinaryOpImpl<BinaryOp, Lhs, Rhs, Dense> |
| : public ei_dense_xpr_base<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >::type |
| { |
| typedef CwiseBinaryOp<BinaryOp, Lhs, Rhs> Derived; |
| public: |
| |
| typedef typename ei_dense_xpr_base<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >::type Base; |
| EIGEN_DENSE_PUBLIC_INTERFACE( Derived ) |
| |
| EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const |
| { |
| return derived().functor()(derived().lhs().coeff(row, col), |
| derived().rhs().coeff(row, col)); |
| } |
| |
| template<int LoadMode> |
| EIGEN_STRONG_INLINE PacketScalar packet(Index row, Index col) const |
| { |
| return derived().functor().packetOp(derived().lhs().template packet<LoadMode>(row, col), |
| derived().rhs().template packet<LoadMode>(row, col)); |
| } |
| |
| EIGEN_STRONG_INLINE const Scalar coeff(Index index) const |
| { |
| return derived().functor()(derived().lhs().coeff(index), |
| derived().rhs().coeff(index)); |
| } |
| |
| template<int LoadMode> |
| EIGEN_STRONG_INLINE PacketScalar packet(Index index) const |
| { |
| return derived().functor().packetOp(derived().lhs().template packet<LoadMode>(index), |
| derived().rhs().template packet<LoadMode>(index)); |
| } |
| }; |
| |
| /** replaces \c *this by \c *this - \a other. |
| * |
| * \returns a reference to \c *this |
| */ |
| template<typename Derived> |
| template<typename OtherDerived> |
| EIGEN_STRONG_INLINE Derived & |
| MatrixBase<Derived>::operator-=(const MatrixBase<OtherDerived> &other) |
| { |
| SelfCwiseBinaryOp<ei_scalar_difference_op<Scalar>, Derived> tmp(derived()); |
| tmp = other; |
| return derived(); |
| } |
| |
| /** replaces \c *this by \c *this + \a other. |
| * |
| * \returns a reference to \c *this |
| */ |
| template<typename Derived> |
| template<typename OtherDerived> |
| EIGEN_STRONG_INLINE Derived & |
| MatrixBase<Derived>::operator+=(const MatrixBase<OtherDerived>& other) |
| { |
| SelfCwiseBinaryOp<ei_scalar_sum_op<Scalar>, Derived> tmp(derived()); |
| tmp = other.derived(); |
| return derived(); |
| } |
| |
| #endif // EIGEN_CWISE_BINARY_OP_H |
