text: //=================================================================================================
  /*!
  //  \file blaze/math/expressions/DMatDMatMapExpr.h
  //  \brief Header file for the dense matrix/dense matrix map expression
  //
  //  Copyright (C) 2012-2017 Klaus Iglberger - All Rights Reserved
  //
  //  This file is part of the Blaze library. You can redistribute it and/or modify it under
  //  the terms of the New (Revised) BSD License. Redistribution and use in source and binary
  //  forms, with or without modification, are permitted provided that the following conditions
  //  are met:
  //
  //  1. Redistributions of source code must retain the above copyright notice, this list of
  //     conditions and the following disclaimer.
  //  2. Redistributions in binary form must reproduce the above copyright notice, this list
  //     of conditions and the following disclaimer in the documentation and/or other materials
  //     provided with the distribution.
  //  3. Neither the names of the Blaze development group nor the names of its contributors
  //     may be used to endorse or promote products derived from this software without specific
  //     prior written permission.
  //
  //  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
  //  EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  //  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
  //  SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  //  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
  //  TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
  //  BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  //  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
  //  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
  //  DAMAGE.
  */
  //=================================================================================================
  
  #ifndef _BLAZE_MATH_EXPRESSIONS_DMATDMATMAPEXPR_H_
  #define _BLAZE_MATH_EXPRESSIONS_DMATDMATMAPEXPR_H_
  
  
  //*************************************************************************************************
  // Includes
  //*************************************************************************************************
  
  #include <iterator>
  #include <utility>
  #include <blaze/math/Aliases.h>
  #include <blaze/math/constraints/DenseMatrix.h>
  #include <blaze/math/constraints/RequiresEvaluation.h>
  #include <blaze/math/constraints/StorageOrder.h>
  #include <blaze/math/Exception.h>
  #include <blaze/math/expressions/Computation.h>
  #include <blaze/math/expressions/DenseMatrix.h>
  #include <blaze/math/expressions/Forward.h>
  #include <blaze/math/expressions/MatMatMapExpr.h>
  #include <blaze/math/functors/Atan2.h>
  #include <blaze/math/functors/Max.h>
  #include <blaze/math/functors/Min.h>
  #include <blaze/math/functors/Pow.h>
  #include <blaze/math/shims/Serial.h>
  #include <blaze/math/SIMD.h>
  #include <blaze/math/traits/BinaryMapTrait.h>
  #include <blaze/math/typetraits/IsAligned.h>
  #include <blaze/math/typetraits/IsExpression.h>
  #include <blaze/math/typetraits/IsHermitian.h>
  #include <blaze/math/typetraits/IsLower.h>
  #include <blaze/math/typetraits/IsPadded.h>
  #include <blaze/math/typetraits/IsStrictlyLower.h>
  #include <blaze/math/typetraits/IsStrictlyUpper.h>
  #include <blaze/math/typetraits/IsSymmetric.h>
  #include <blaze/math/typetraits/IsUniLower.h>
  #include <blaze/math/typetraits/IsUniUpper.h>
  #include <blaze/math/typetraits/IsUpper.h>
  #include <blaze/math/typetraits/RequiresEvaluation.h>
  #include <blaze/math/typetraits/Size.h>
  #include <blaze/system/Inline.h>
  #include <blaze/util/Assert.h>
  #include <blaze/util/EnableIf.h>
  #include <blaze/util/FunctionTrace.h>
  #include <blaze/util/mpl/And.h>
  #include <blaze/util/mpl/If.h>
  #include <blaze/util/mpl/Maximum.h>
  #include <blaze/util/Template.h>
  #include <blaze/util/Types.h>
  #include <blaze/util/typetraits/HasMember.h>
  
  
  namespace blaze {
  
  //=================================================================================================
  //
  //  CLASS DMATDMATMAPEXPR
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*!\brief Expression object for the dense matrix-dense matrix map() function.
  // \ingroup dense_matrix_expression
  //
  // The DMatDMatMapExpr class represents the compile time expression for the pairwise evaluation
  // of a binary custom operation on the elements of two dense matrices with identical storage order
  // via the map() function.
  */
  template< typename MT1  // Type of the left-hand side dense matrix
          , typename MT2  // Type of the right-hand side dense matrix
          , typename OP   // Type of the custom operation
          , bool SO >     // Storage order
  class DMatDMatMapExpr
     : public MatMatMapExpr< DenseMatrix< DMatDMatMapExpr<MT1,MT2,OP,SO>, SO > >
     , private Computation
  {
   private:
     //**Type definitions****************************************************************************
     using RT1 = ResultType_<MT1>;     //!< Result type of the left-hand side dense matrix expression.
     using RT2 = ResultType_<MT2>;     //!< Result type of the right-hand side dense matrix expression.
     using ET1 = ElementType_<MT1>;    //!< Element type of the left-hand side dense matrix expression.
     using ET2 = ElementType_<MT2>;    //!< Element type of the right-hand side dense matrix expression.
     using RN1 = ReturnType_<MT1>;     //!< Return type of the left-hand side dense matrix expression.
     using RN2 = ReturnType_<MT2>;     //!< Return type of the right-hand side dense matrix expression.
     using CT1 = CompositeType_<MT1>;  //!< Composite type of the left-hand side dense matrix expression.
     using CT2 = CompositeType_<MT2>;  //!< Composite type of the right-hand side dense matrix expression.
  
     //! Definition of the HasSIMDEnabled type trait.
     BLAZE_CREATE_HAS_DATA_OR_FUNCTION_MEMBER_TYPE_TRAIT( HasSIMDEnabled, simdEnabled );
  
     //! Definition of the HasLoad type trait.
     BLAZE_CREATE_HAS_DATA_OR_FUNCTION_MEMBER_TYPE_TRAIT( HasLoad, load );
     //**********************************************************************************************
  
     //**Serial evaluation strategy******************************************************************
     //! Compilation switch for the serial evaluation strategy of the map expression.
     /*! The \a useAssign compile time constant expression represents a compilation switch for
         the serial evaluation strategy of the map expression. In case either of the two dense
         matrix operands requires an intermediate evaluation, \a useAssign will be set to 1 and
         the addition expression will be evaluated via the \a assign function family. Otherwise
         \a useAssign will be set to 0 and the expression will be evaluated via the subscript
         operator. */
     enum : bool { useAssign = ( RequiresEvaluation<MT1>::value || RequiresEvaluation<MT2>::value ) };
  
     /*! \cond BLAZE_INTERNAL */
     //! Helper structure for the explicit application of the SFINAE principle.
     template< typename MT >
     struct UseAssign {
        enum : bool { value = useAssign };
     };
     /*! \endcond */
     //**********************************************************************************************
  
     //**Parallel evaluation strategy****************************************************************
     /*! \cond BLAZE_INTERNAL */
     //! Helper structure for the explicit application of the SFINAE principle.
     /*! The UseSMPAssign struct is a helper struct for the selection of the parallel evaluation
         strategy. In case at least one of the two dense matrix operands is not SMP assignable and
         at least one of the two operands requires an intermediate evaluation, \a value is set to 1
         and the expression specific evaluation strategy is selected. Otherwise \a value is set to
         0 and the default strategy is chosen. */
     template< typename MT >
     struct UseSMPAssign {
        enum : bool { value = ( !MT1::smpAssignable || !MT2::smpAssignable ) && useAssign };
     };
     /*! \endcond */
     //**********************************************************************************************
  
     //**SIMD support detection**********************************************************************
     /*! \cond BLAZE_INTERNAL */
     //! Helper structure for the detection of the SIMD capabilities of the given custom operation.
     struct UseSIMDEnabledFlag {
        enum : bool { value = OP::BLAZE_TEMPLATE simdEnabled<ET1,ET2>() };
     };
     /*! \endcond */
     //**********************************************************************************************
  
   public:
     //**Type definitions****************************************************************************
     using This          = DMatDMatMapExpr<MT1,MT2,OP,SO>;  //!< Type of this DMatDMatMapExpr instance.
     using ResultType    = BinaryMapTrait_<RT1,RT2,OP>;     //!< Result type for expression template evaluations.
     using OppositeType  = OppositeType_<ResultType>;       //!< Result type with opposite storage order for expression template evaluations.
     using TransposeType = TransposeType_<ResultType>;      //!< Transpose type for expression template evaluations.
     using ElementType   = ElementType_<ResultType>;        //!< Resulting element type.
  
     //! Return type for expression template evaluations.
     using ReturnType = decltype( std::declval<OP>()( std::declval<RN1>(), std::declval<RN2>() ) );
  
     //! Data type for composite expression templates.
     using CompositeType = IfTrue_< useAssign, const ResultType, const DMatDMatMapExpr& >;
  
     //! Composite type of the left-hand side dense matrix expression.
     using LeftOperand = If_< IsExpression<MT1>, const MT1, const MT1& >;
  
     //! Composite type of the right-hand side dense matrix expression.
     using RightOperand = If_< IsExpression<MT2>, const MT2, const MT2& >;
  
     //! Data type of the custom unary operation.
     using Operation = OP;
  
     //! Type for the assignment of the left-hand side dense matrix operand.
     using LT = If_< RequiresEvaluation<MT1>, const RT1, CT1 >;
  
     //! Type for the assignment of the right-hand side dense matrix operand.
     using RT = If_< RequiresEvaluation<MT2>, const RT2, CT2 >;
     //**********************************************************************************************
  
     //**ConstIterator class definition**************************************************************
     /*!\brief Iterator over the elements of the dense matrix map expression.
     */
     class ConstIterator
     {
      public:
        //**Type definitions*************************************************************************
        using IteratorCategory = std::random_access_iterator_tag;  //!< The iterator category.
        using ValueType        = ElementType;                      //!< Type of the underlying elements.
        using PointerType      = ElementType*;                     //!< Pointer return type.
        using ReferenceType    = ElementType&;                     //!< Reference return type.
        using DifferenceType   = ptrdiff_t;                        //!< Difference between two iterators.
  
        // STL iterator requirements
        using iterator_category = IteratorCategory;  //!< The iterator category.
        using value_type        = ValueType;         //!< Type of the underlying elements.
        using pointer           = PointerType;       //!< Pointer return type.
        using reference         = ReferenceType;     //!< Reference return type.
        using difference_type   = DifferenceType;    //!< Difference between two iterators.
  
        //! ConstIterator type of the left-hand side dense matrix expression.
        using LeftIteratorType = ConstIterator_<MT1>;
  
        //! ConstIterator type of the right-hand side dense matrix expression.
        using RightIteratorType = ConstIterator_<MT2>;
        //*******************************************************************************************
  
        //**Constructor******************************************************************************
        /*!\brief Constructor for the ConstIterator class.
        //
        // \param left Iterator to the initial left-hand side element.
        // \param right Iterator to the initial right-hand side element.
        // \param op The custom unary operation.
        */
        explicit inline ConstIterator( LeftIteratorType left, RightIteratorType right, OP op )
           : left_ ( left  )  // Iterator to the current left-hand side element
           , right_( right )  // Iterator to the current right-hand side element
           , op_   ( op    )  // The custom unary operation
        {}
        //*******************************************************************************************
  
        //**Addition assignment operator*************************************************************
        /*!\brief Addition assignment operator.
        //
        // \param inc The increment of the iterator.
        // \return The incremented iterator.
        */
        inline ConstIterator& operator+=( size_t inc ) {
           left_  += inc;
           right_ += inc;
           return *this;
        }
        //*******************************************************************************************
  
        //**Subtraction assignment operator**********************************************************
        /*!\brief Subtraction assignment operator.
        //
        // \param dec The decrement of the iterator.
        // \return The decremented iterator.
        */
        inline ConstIterator& operator-=( size_t dec ) {
           left_  -= dec;
           right_ -= dec;
           return *this;
        }
        //*******************************************************************************************
  
        //**Prefix increment operator****************************************************************
        /*!\brief Pre-increment operator.
        //
        // \return Reference to the incremented iterator.
        */
        inline ConstIterator& operator++() {
           ++left_;
           ++right_;
           return *this;
        }
        //*******************************************************************************************
  
        //**Postfix increment operator***************************************************************
        /*!\brief Post-increment operator.
        //
        // \return The previous position of the iterator.
        */
        inline const ConstIterator operator++( int ) {
           return ConstIterator( left_++, right_++, op_ );
        }
        //*******************************************************************************************
  
        //**Prefix decrement operator****************************************************************
        /*!\brief Pre-decrement operator.
        //
        // \return Reference to the decremented iterator.
        */
        inline ConstIterator& operator--() {
           --left_;
           --right_;
           return *this;
        }
        //*******************************************************************************************
  
        //**Postfix decrement operator***************************************************************
        /*!\brief Post-decrement operator.
        //
        // \return The previous position of the iterator.
        */
        inline const ConstIterator operator--( int ) {
           return ConstIterator( left_--, right_--, op_ );
        }
        //*******************************************************************************************
  
        //**Element access operator******************************************************************
        /*!\brief Direct access to the element at the current iterator position.
        //
        // \return The resulting value.
        */
        inline ReturnType operator*() const {
           return op_( *left_, *right_ );
        }
        //*******************************************************************************************
  
        //**Load function****************************************************************************
        /*!\brief Access to the SIMD elements of the matrix.
        //
        // \return The resulting SIMD element.
        */
        inline auto load() const noexcept {
           return op_.load( left_.load(), right_.load() );
        }
        //*******************************************************************************************
  
        //**Equality operator************************************************************************
        /*!\brief Equality comparison between two ConstIterator objects.
        //
        // \param rhs The right-hand side iterator.
        // \return \a true if the iterators refer to the same element, \a false if not.
        */
        inline bool operator==( const ConstIterator& rhs ) const {
           return left_ == rhs.left_;
        }
        //*******************************************************************************************
  
        //**Inequality operator**********************************************************************
        /*!\brief Inequality comparison between two ConstIterator objects.
        //
        // \param rhs The right-hand side iterator.
        // \return \a true if the iterators don't refer to the same element, \a false if they do.
        */
        inline bool operator!=( const ConstIterator& rhs ) const {
           return left_ != rhs.left_;
        }
        //*******************************************************************************************
  
        //**Less-than operator***********************************************************************
        /*!\brief Less-than comparison between two ConstIterator objects.
        //
        // \param rhs The right-hand side iterator.
        // \return \a true if the left-hand side iterator is smaller, \a false if not.
        */
        inline bool operator<( const ConstIterator& rhs ) const {
           return left_ < rhs.left_;
        }
        //*******************************************************************************************
  
        //**Greater-than operator********************************************************************
        /*!\brief Greater-than comparison between two ConstIterator objects.
        //
        // \param rhs The right-hand side iterator.
        // \return \a true if the left-hand side iterator is greater, \a false if not.
        */
        inline bool operator>( const ConstIterator& rhs ) const {
           return left_ > rhs.left_;
        }
        //*******************************************************************************************
  
        //**Less-or-equal-than operator**************************************************************
        /*!\brief Less-than comparison between two ConstIterator objects.
        //
        // \param rhs The right-hand side iterator.
        // \return \a true if the left-hand side iterator is smaller or equal, \a false if not.
        */
        inline bool operator<=( const ConstIterator& rhs ) const {
           return left_ <= rhs.left_;
        }
        //*******************************************************************************************
  
        //**Greater-or-equal-than operator***********************************************************
        /*!\brief Greater-than comparison between two ConstIterator objects.
        //
        // \param rhs The right-hand side iterator.
        // \return \a true if the left-hand side iterator is greater or equal, \a false if not.
        */
        inline bool operator>=( const ConstIterator& rhs ) const {
           return left_ >= rhs.left_;
        }
        //*******************************************************************************************
  
        //**Subtraction operator*********************************************************************
        /*!\brief Calculating the number of elements between two iterators.
        //
        // \param rhs The right-hand side iterator.
        // \return The number of elements between the two iterators.
        */
        inline DifferenceType operator-( const ConstIterator& rhs ) const {
           return left_ - rhs.left_;
        }
        //*******************************************************************************************
  
        //**Addition operator************************************************************************
        /*!\brief Addition between a ConstIterator and an integral value.
        //
        // \param it The iterator to be incremented.
        // \param inc The number of elements the iterator is incremented.
        // \return The incremented iterator.
        */
        friend inline const ConstIterator operator+( const ConstIterator& it, size_t inc ) {
           return ConstIterator( it.left_ + inc, it.right_ + inc, it.op_ );
        }
        //*******************************************************************************************
  
        //**Addition operator************************************************************************
        /*!\brief Addition between an integral value and a ConstIterator.
        //
        // \param inc The number of elements the iterator is incremented.
        // \param it The iterator to be incremented.
        // \return The incremented iterator.
        */
        friend inline const ConstIterator operator+( size_t inc, const ConstIterator& it ) {
           return ConstIterator( it.left_ + inc, it.right_ + inc, it.op_ );
        }
        //*******************************************************************************************
  
        //**Subtraction operator*********************************************************************
        /*!\brief Subtraction between a ConstIterator and an integral value.
        //
        // \param it The iterator to be decremented.
        // \param dec The number of elements the iterator is decremented.
        // \return The decremented iterator.
        */
        friend inline const ConstIterator operator-( const ConstIterator& it, size_t dec ) {
           return ConstIterator( it.left_ - dec, it.right_ - dec, it.op_ );
        }
        //*******************************************************************************************
  
      private:
        //**Member variables*************************************************************************
        LeftIteratorType  left_;   //!< Iterator to the current left-hand side element.
        RightIteratorType right_;  //!< Iterator to the current right-hand side element.
        OP                op_;     //!< The custom unary operation.
        //*******************************************************************************************
     };
     //**********************************************************************************************
  
     //**Compilation flags***************************************************************************
     //! Compilation switch for the expression template evaluation strategy.
     enum : bool { simdEnabled = MT1::simdEnabled && MT2::simdEnabled &&
                                 If_< HasSIMDEnabled<OP>, UseSIMDEnabledFlag, HasLoad<OP> >::value };
  
     //! Compilation switch for the expression template assignment strategy.
     enum : bool { smpAssignable = MT1::smpAssignable && MT2::smpAssignable };
     //**********************************************************************************************
  
     //**SIMD properties*****************************************************************************
     //! The number of elements packed within a single SIMD element.
     enum : size_t { SIMDSIZE = SIMDTrait<ElementType>::size };
     //**********************************************************************************************
  
     //**Constructor*********************************************************************************
     /*!\brief Constructor for the DMatDMatMapExpr class.
     //
     // \param lhs The left-hand side dense matrix operand of the map expression.
     // \param rhs The right-hand side dense matrix operand of the map expression.
     // \param op The custom unary operation.
     */
     explicit inline DMatDMatMapExpr( const MT1& lhs, const MT2& rhs, OP op ) noexcept
        : lhs_( lhs )  // Left-hand side dense matrix of the map expression
        , rhs_( rhs )  // Right-hand side dense matrix of the map expression
        , op_ ( op  )  // The custom unary operation
     {}
     //**********************************************************************************************
  
     //**Access operator*****************************************************************************
     /*!\brief 2D-access to the matrix elements.
     //
     // \param i Access index for the row. The index has to be in the range \f$[0..M-1]\f$.
     // \param j Access index for the column. The index has to be in the range \f$[0..N-1]\f$.
     // \return The resulting value.
     */
     inline ReturnType operator()( size_t i, size_t j ) const {
        BLAZE_INTERNAL_ASSERT( i < lhs_.rows()   , "Invalid row access index"    );
        BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
        return op_( lhs_(i,j), rhs_(i,j) );
     }
     //**********************************************************************************************
  
     //**At function*********************************************************************************
     /*!\brief Checked access to the matrix elements.
     //
     // \param i Access index for the row. The index has to be in the range \f$[0..M-1]\f$.
     // \param j Access index for the column. The index has to be in the range \f$[0..N-1]\f$.
     // \return The resulting value.
     // \exception std::out_of_range Invalid matrix access index.
     */
     inline ReturnType at( size_t i, size_t j ) const {
        if( i >= lhs_.rows() ) {
           BLAZE_THROW_OUT_OF_RANGE( "Invalid row access index" );
        }
        if( j >= lhs_.columns() ) {
           BLAZE_THROW_OUT_OF_RANGE( "Invalid column access index" );
        }
        return (*this)(i,j);
     }
     //**********************************************************************************************
  
     //**Load function*******************************************************************************
     /*!\brief Access to the SIMD elements of the matrix.
     //
     // \param i Access index for the row. The index has to be in the range \f$[0..M-1]\f$.
     // \param j Access index for the column. The index has to be in the range \f$[0..N-1]\f$.
     // \return Reference to the accessed values.
     */
     BLAZE_ALWAYS_INLINE auto load( size_t i, size_t j ) const noexcept {
        BLAZE_INTERNAL_ASSERT( i < lhs_.rows()   , "Invalid row access index"    );
        BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
        BLAZE_INTERNAL_ASSERT( !SO || ( i % SIMDSIZE == 0UL ), "Invalid row access index"    );
        BLAZE_INTERNAL_ASSERT( SO  || ( j % SIMDSIZE == 0UL ), "Invalid column access index" );
        return op_.load( lhs_.load(i,j), rhs_.load(i,j) );
     }
     //**********************************************************************************************
  
     //**Begin function******************************************************************************
     /*!\brief Returns an iterator to the first non-zero element of row \a i.
     //
     // \param i The row index.
     // \return Iterator to the first non-zero element of row \a i.
     */
     inline ConstIterator begin( size_t i ) const {
        return ConstIterator( lhs_.begin(i), rhs_.begin(i), op_ );
     }
     //**********************************************************************************************
  
     //**End function********************************************************************************
     /*!\brief Returns an iterator just past the last non-zero element of row \a i.
     //
     // \param i The row index.
     // \return Iterator just past the last non-zero element of row \a i.
     */
     inline ConstIterator end( size_t i ) const {
        return ConstIterator( lhs_.end(i), rhs_.end(i), op_ );
     }
     //**********************************************************************************************
  
     //**Rows function*******************************************************************************
     /*!\brief Returns the current number of rows of the matrix.
     //
     // \return The number of rows of the matrix.
     */
     inline size_t rows() const noexcept {
        return lhs_.rows();
     }
     //**********************************************************************************************
  
     //**Columns function****************************************************************************
     /*!\brief Returns the current number of columns of the matrix.
     //
     // \return The number of columns of the matrix.
     */
     inline size_t columns() const noexcept {
        return lhs_.columns();
     }
     //**********************************************************************************************
  
     //**Left operand access*************************************************************************
     /*!\brief Returns the left-hand side dense matrix operand.
     //
     // \return The left-hand side dense matrix operand.
     */
     inline LeftOperand leftOperand() const noexcept {
        return lhs_;
     }
     //**********************************************************************************************
  
     //**Right operand access************************************************************************
     /*!\brief Returns the right-hand side dense matrix operand.
     //
     // \return The right-hand side dense matrix operand.
     */
     inline RightOperand rightOperand() const noexcept {
        return rhs_;
     }
     //**********************************************************************************************
  
     //**Operation access****************************************************************************
     /*!\brief Returns a copy of the custom operation.
     //
     // \return A copy of the custom operation.
     */
     inline Operation operation() const {
        return op_;
     }
     //**********************************************************************************************
  
     //**********************************************************************************************
     /*!\brief Returns whether the expression can alias with the given address \a alias.
     //
     // \param alias The alias to be checked.
     // \return \a true in case the expression can alias, \a false otherwise.
     */
     template< typename T >
     inline bool canAlias( const T* alias ) const noexcept {
        return ( IsExpression<MT1>::value && lhs_.canAlias( alias ) ) ||
               ( IsExpression<MT2>::value && rhs_.canAlias( alias ) );
     }
     //**********************************************************************************************
  
     //**********************************************************************************************
     /*!\brief Returns whether the expression is aliased with the given address \a alias.
     //
     // \param alias The alias to be checked.
     // \return \a true in case an alias effect is detected, \a false otherwise.
     */
     template< typename T >
     inline bool isAliased( const T* alias ) const noexcept {
        return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
     }
     //**********************************************************************************************
  
     //**********************************************************************************************
     /*!\brief Returns whether the operands of the expression are properly aligned in memory.
     //
     // \return \a true in case the operands are aligned, \a false if not.
     */
     inline bool isAligned() const noexcept {
        return lhs_.isAligned() && rhs_.isAligned();
     }
     //**********************************************************************************************
  
     //**********************************************************************************************
     /*!\brief Returns whether the expression can be used in SMP assignments.
     //
     // \return \a true in case the expression can be used in SMP assignments, \a false if not.
     */
     inline bool canSMPAssign() const noexcept {
        return lhs_.canSMPAssign() && rhs_.canSMPAssign();
     }
     //**********************************************************************************************
  
   private:
     //**Member variables****************************************************************************
     LeftOperand  lhs_;  //!< Left-hand side dense matrix of the map expression.
     RightOperand rhs_;  //!< Right-hand side dense matrix of the map expression.
     Operation    op_;   //!< The custom unary operation.
     //**********************************************************************************************
  
     //**Assignment to dense matrices****************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Assignment of a dense matrix-dense matrix map expression to a dense matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized assignment of a dense matrix-dense
     // matrix map expression to a dense matrix. Due to the explicit application of the SFINAE
     // principle, this function can only be selected by the compiler in case either of the two
     // operands requires an intermediate evaluation.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseAssign<MT> >
        assign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( serial( rhs.lhs_ ) );  // Evaluation of the left-hand side dense matrix operand
        RT B( serial( rhs.rhs_ ) );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        assign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Assignment to sparse matrices***************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Assignment of a dense matrix-dense matrix map expression to a sparse matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side sparse matrix.
     // \param rhs The right-hand side map expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized assignment of a dense matrix-dense
     // matrix map expression to a sparse matrix. Due to the explicit application of the SFINAE
     // principle, this function can only be selected by the compiler in case either of the two
     // operands requires an intermediate evaluation.
     */
     template< typename MT  // Type of the target sparse matrix
             , bool SO2 >   // Storage order of the target sparse matrix
     friend inline EnableIf_< UseAssign<MT> >
        assign( SparseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        using TmpType = IfTrue_< SO == SO2, ResultType, OppositeType >;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE( OppositeType );
        BLAZE_CONSTRAINT_MUST_BE_MATRIX_WITH_STORAGE_ORDER( ResultType, SO );
        BLAZE_CONSTRAINT_MUST_BE_MATRIX_WITH_STORAGE_ORDER( OppositeType, !SO );
        BLAZE_CONSTRAINT_MATRICES_MUST_HAVE_SAME_STORAGE_ORDER( MT, TmpType );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( TmpType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        const TmpType tmp( serial( rhs ) );
        assign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Addition assignment to dense matrices*******************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Addition assignment of a dense matrix-dense matrix map expression to a dense matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression to be added.
     // \return void
     //
     // This function implements the performance optimized addition assignment of a dense
     // matrix-dense matrix map expression to a dense matrix. Due to the explicit application
     // of the SFINAE principle, this function can only be selected by the compiler in case
     // either of the two operands requires an intermediate evaluation.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseAssign<MT> >
        addAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( serial( rhs.lhs_ ) );  // Evaluation of the left-hand side dense matrix operand
        RT B( serial( rhs.rhs_ ) );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        addAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Addition assignment to sparse matrices******************************************************
     // No special implementation for the addition assignment to sparse matrices.
     //**********************************************************************************************
  
     //**Subtraction assignment to dense matrices****************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Subtraction assignment of a dense matrix-dense matrix map expression to a dense matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression to be subtracted.
     // \return void
     //
     // This function implements the performance optimized subtraction assignment of a dense
     // matrix-dense matrix map expression to a dense matrix. Due to the explicit application
     // of the SFINAE principle, this function can only be selected by the compiler in case
     // either of the two operands requires an intermediate evaluation.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseAssign<MT> >
        subAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( serial( rhs.lhs_ ) );  // Evaluation of the left-hand side dense matrix operand
        RT B( serial( rhs.rhs_ ) );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        subAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Subtraction assignment to sparse matrices***************************************************
     // No special implementation for the subtraction assignment to sparse matrices.
     //**********************************************************************************************
  
     //**Schur product assignment to dense matrices**************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Schur product assignment of a dense matrix-dense matrix map expression to a dense matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression for the Schur product.
     // \return void
     //
     // This function implements the performance optimized Schur product assignment of a dense
     // matrix-dense matrix map expression to a dense matrix. Due to the explicit application of
     // the SFINAE principle, this function can only be selected by the compiler in case either
     // of the two operands requires an intermediate evaluation.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseAssign<MT> >
        schurAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( serial( rhs.lhs_ ) );  // Evaluation of the left-hand side dense matrix operand
        RT B( serial( rhs.rhs_ ) );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        schurAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Schur product assignment to sparse matrices*************************************************
     // No special implementation for the Schur product assignment to sparse matrices.
     //**********************************************************************************************
  
     //**Multiplication assignment to dense matrices*************************************************
     // No special implementation for the multiplication assignment to dense matrices.
     //**********************************************************************************************
  
     //**Multiplication assignment to sparse matrices************************************************
     // No special implementation for the multiplication assignment to sparse matrices.
     //**********************************************************************************************
  
     //**SMP assignment to dense matrices************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP assignment of a dense matrix-dense matrix map expression to a dense matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized SMP assignment of a dense matrix-dense
     // matrix map expression to a dense matrix. Due to the explicit application of the SFINAE
     // principle, this function can only be selected by the compiler in case the expression
     // specific parallel evaluation strategy is selected.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseSMPAssign<MT> >
        smpAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( rhs.lhs_ );  // Evaluation of the left-hand side dense matrix operand
        RT B( rhs.rhs_ );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        smpAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP assignment to sparse matrices***********************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP assignment of a dense matrix-dense matrix map expression to a sparse matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side sparse matrix.
     // \param rhs The right-hand side map expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized SMP assignment of a dense matrix-dense
     // matrix map expression to a sparse matrix. Due to the explicit application of the SFINAE
     // principle, this function can only be selected by the compiler in case the expression
     // specific parallel evaluation strategy is selected.
     */
     template< typename MT  // Type of the target sparse matrix
             , bool SO2 >   // Storage order of the target sparse matrix
     friend inline EnableIf_< UseSMPAssign<MT> >
        smpAssign( SparseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        using TmpType = IfTrue_< SO == SO2, ResultType, OppositeType >;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE( OppositeType );
        BLAZE_CONSTRAINT_MUST_BE_MATRIX_WITH_STORAGE_ORDER( ResultType, SO );
        BLAZE_CONSTRAINT_MUST_BE_MATRIX_WITH_STORAGE_ORDER( OppositeType, !SO );
        BLAZE_CONSTRAINT_MATRICES_MUST_HAVE_SAME_STORAGE_ORDER( MT, TmpType );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( TmpType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        const TmpType tmp( rhs );
        smpAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP addition assignment to dense matrices***************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP addition assignment of a dense matrix-dense matrix map expression to a dense
     //        matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression to be added.
     // \return void
     //
     // This function implements the performance optimized SMP addition assignment of a dense
     // matrix-dense matrix map expression to a dense matrix. Due to the explicit application
     // of the SFINAE principle, this function can only be selected by the compiler in case the
     // expression specific parallel evaluation strategy is selected.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseSMPAssign<MT> >
        smpAddAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( rhs.lhs_ );  // Evaluation of the left-hand side dense matrix operand
        RT B( rhs.rhs_ );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        smpAddAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP addition assignment to sparse matrices**************************************************
     // No special implementation for the SMP addition assignment to sparse matrices.
     //**********************************************************************************************
  
     //**SMP subtraction assignment to dense matrices************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP subtraction assignment of a dense matrix-dense matrix map expression to a dense
     //        matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression to be subtracted.
     // \return void
     //
     // This function implements the performance optimized SMP subtraction assignment of a dense
     // matrix-dense matrix map expression to a dense matrix. Due to the explicit application of
     // the SFINAE principle, this function can only be selected by the compiler in case the
     // expression specific parallel evaluation strategy is selected.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseSMPAssign<MT> >
        smpSubAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( rhs.lhs_ );  // Evaluation of the left-hand side dense matrix operand
        RT B( rhs.rhs_ );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        smpSubAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP subtraction assignment to sparse matrices***********************************************
     // No special implementation for the SMP subtraction assignment to sparse matrices.
     //**********************************************************************************************
  
     //**SMP Schur product assignment to dense matrices**********************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP Schur product assignment of a dense matrix-dense matrix map expression to a
     //        dense matrix.
     // \ingroup dense_matrix
     //
     // \param lhs The target left-hand side dense matrix.
     // \param rhs The right-hand side map expression for the Schur product.
     // \return void
     //
     // This function implements the performance optimized SMP Schur product assignment of a
     // dense matrix-dense matrix map expression to a dense matrix. Due to the explicit application
     // of the SFINAE principle, this function can only be selected by the compiler in case the
     // expression specific parallel evaluation strategy is selected.
     */
     template< typename MT  // Type of the target dense matrix
             , bool SO2 >   // Storage order of the target dense matrix
     friend inline EnableIf_< UseSMPAssign<MT> >
        smpSchurAssign( DenseMatrix<MT,SO2>& lhs, const DMatDMatMapExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).rows()    == rhs.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
  
        LT A( rhs.lhs_ );  // Evaluation of the left-hand side dense matrix operand
        RT B( rhs.rhs_ );  // Evaluation of the right-hand side dense matrix operand
  
        BLAZE_INTERNAL_ASSERT( A.rows()    == rhs.lhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( B.rows()    == rhs.rhs_.rows()   , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
        BLAZE_INTERNAL_ASSERT( A.rows()    == (~lhs).rows()     , "Invalid number of rows"    );
        BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns()  , "Invalid number of columns" );
  
        smpSchurAssign( ~lhs, map( A, B, rhs.op_ ) );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP Schur product assignment to sparse matrices*********************************************
     // No special implementation for the SMP Schur product assignment to sparse matrices.
     //**********************************************************************************************
  
     //**SMP multiplication assignment to dense matrices*********************************************
     // No special implementation for the SMP multiplication assignment to dense matrices.
     //**********************************************************************************************
  
     //**SMP multiplication assignment to sparse matrices********************************************
     // No special implementation for the SMP multiplication assignment to sparse matrices.
     //**********************************************************************************************
  
     //**Compile time checks*************************************************************************
     /*! \cond BLAZE_INTERNAL */
     BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE( MT1 );
     BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE( MT2 );
     BLAZE_CONSTRAINT_MATRICES_MUST_HAVE_SAME_STORAGE_ORDER( MT1, MT2 );
     /*! \endcond */
     //**********************************************************************************************
  };
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  GLOBAL FUNCTIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*!\brief Evaluates the given binary operation on each single element of the dense matrices
  //        \a lhs and \a rhs.
  // \ingroup dense_matrix
  //
  // \param lhs The left-hand side dense matrix operand.
  // \param rhs The right-hand side dense matrix operand.
  // \param op The custom, binary operation.
  // \return The binary operation applied to each single element of \a lhs and \a rhs.
  // \exception std::invalid_argument Matrix sizes do not match.
  //
  // The \a map() function evaluates the given binary operation on each element of the input
  // matrices \a lhs and \a rhs. The function returns an expression representing this operation.\n
  // The following example demonstrates the use of the \a map() function:
  
     \code
     blaze::DynamicMatrix<double> A, B, C;
     // ... Resizing and initialization
     C = map( A, B, []( double x, double y ){ return std::min( x, y ); } );
     \endcode
  */
  template< typename MT1   // Type of the left-hand side dense matrix
          , typename MT2   // Type of the right-hand side dense matrix
          , bool SO        // Storage order
          , typename OP >  // Type of the custom operation
  inline decltype(auto)
     map( const DenseMatrix<MT1,SO>& lhs, const DenseMatrix<MT2,SO>& rhs, OP op )
  {
     BLAZE_FUNCTION_TRACE;
  
     if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() ) {
        BLAZE_THROW_INVALID_ARGUMENT( "Matrix sizes do not match" );
     }
  
     using ReturnType = const DMatDMatMapExpr<MT1,MT2,OP,SO>;
     return ReturnType( ~lhs, ~rhs, op );
  }
  //*************************************************************************************************
  
  
  //*************************************************************************************************
  /*!\brief Computes the componentwise minimum of the dense matrices \a lhs and \a rhs.
  // \ingroup dense_matrix
  //
  // \param lhs The left-hand side dense matrix operand.
  // \param rhs The right-hand side dense matrix operand.
  // \return The resulting dense matrix.
  //
  // This function computes the componentwise minimum of the two dense matrices \a lhs and \a rhs.
  // The function returns an expression representing this operation.\n
  // The following example demonstrates the use of the \a min() function:
  
     \code
     blaze::DynamicMatrix<double> A, B, C;
     // ... Resizing and initialization
     C = min( A, B );
     \endcode
  */
  template< typename MT1  // Type of the left-hand side dense matrix
          , bool SO1      // Storage order of the left-hand side dense matrix
          , typename MT2  // Type of the right-hand side dense matrix
          , bool SO2 >    // Storage order of the right-hand side dense matrix
  inline decltype(auto)
     min( const DenseMatrix<MT1,SO1>& lhs, const DenseMatrix<MT2,SO2>& rhs )
  {
     BLAZE_FUNCTION_TRACE;
  
     return map( ~lhs, ~rhs, Min() );
  }
  //*************************************************************************************************
  
  
  //*************************************************************************************************
  /*!\brief Computes the componentwise maximum of the dense matrices \a lhs and \a rhs.
  // \ingroup dense_matrix
  //
  // \param lhs The left-hand side dense matrix operand.
  // \param rhs The right-hand side dense matrix operand.
  // \return The resulting dense matrix.
  //
  // This function computes the componentwise maximum of the two dense matrices \a lhs and \a rhs.
  // The function returns an expression representing this operation.\n
  // The following example demonstrates the use of the \a max() function:
  
     \code
     blaze::DynamicMatrix<double> A, B, C;
     // ... Resizing and initialization
     C = max( A, B );
     \endcode
  */
  template< typename MT1  // Type of the left-hand side dense matrix
          , bool SO1      // Storage order of the left-hand side dense matrix
          , typename MT2  // Type of the right-hand side dense matrix
          , bool SO2 >    // Storage order of the right-hand side dense matrix
  inline decltype(auto)
     max( const DenseMatrix<MT1,SO1>& lhs, const DenseMatrix<MT2,SO2>& rhs )
  {
     BLAZE_FUNCTION_TRACE;
  
     return map( ~lhs, ~rhs, Max() );
  }
  //*************************************************************************************************
  
  
  //*************************************************************************************************
  /*!\brief Computes the componentwise exponential value for the dense matrices \a lhs and \a rhs.
  // \ingroup dense_matrix
  //
  // \param lhs The left-hand side dense matrix operand.
  // \param rhs The right-hand side dense matrix operand.
  // \return The resulting dense matrix.
  //
  // The \a pow() function computes the componentwise exponential value for the two dense matrices
  // \a lhs and \a rhs. The function returns an expression representing this operation.\n
  // The following example demonstrates the use of the \a pow() function:
  
     \code
     blaze::DynamicMatrix<double> A, B, C;
     // ... Resizing and initialization
     C = pow( A, B );
     \endcode
  */
  template< typename MT1  // Type of the left-hand side dense matrix
          , bool SO1      // Storage order of the left-hand side dense matrix
          , typename MT2  // Type of the right-hand side dense matrix
          , bool SO2 >    // Storage order of the right-hand side dense matrix
  inline decltype(auto)
     pow( const DenseMatrix<MT1,SO1>& lhs, const DenseMatrix<MT2,SO2>& rhs )
  {
     BLAZE_FUNCTION_TRACE;
  
     return map( ~lhs, ~rhs, Pow() );
  }
  //*************************************************************************************************
  
  
  //*************************************************************************************************
  /*!\brief Computes the multi-valued inverse tangent of the dense matrices \a lhs and \a rhs.
  // \ingroup dense_matrix
  //
  // \param lhs The left-hand side dense matrix operand.
  // \param rhs The right-hand side dense matrix operand.
  // \return The resulting dense matrix.
  //
  // This function computes the multi-valued inverse tangent of the two dense matrix \a lhs and
  // \a rhs. The function returns an expression representing this operation.\n
  // The following example demonstrates the use of the \a max() function:
  
     \code
     blaze::DynamicMatrix<double> A, B, C;
     // ... Resizing and initialization
     C = atan2( A, B );
     \endcode
  */
  template< typename MT1  // Type of the left-hand side dense matrix
          , bool SO1      // Storage order of the left-hand side dense matrix
          , typename MT2  // Type of the right-hand side dense matrix
          , bool SO2 >    // Storage order of the right-hand side dense matrix
  inline decltype(auto)
     atan2( const DenseMatrix<MT1,SO1>& lhs, const DenseMatrix<MT2,SO2>& rhs )
  {
     BLAZE_FUNCTION_TRACE;
  
     return map( ~lhs, ~rhs, Atan2() );
  }
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  SIZE SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, typename OP, bool SO >
  struct Size< DMatDMatMapExpr<MT1,MT2,OP,SO>, 0UL >
     : public Maximum< Size<MT1,0UL>, Size<MT2,0UL> >
  {};
  
  template< typename MT1, typename MT2, typename OP, bool SO >
  struct Size< DMatDMatMapExpr<MT1,MT2,OP,SO>, 1UL >
     : public Maximum< Size<MT1,1UL>, Size<MT2,1UL> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISALIGNED SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, typename OP, bool SO >
  struct IsAligned< DMatDMatMapExpr<MT1,MT2,OP,SO> >
     : public And< IsAligned<MT1>, IsAligned<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISPADDED SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, typename OP, bool SO >
  struct IsPadded< DMatDMatMapExpr<MT1,MT2,OP,SO> >
     : public And< IsPadded<MT1>, IsPadded<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISSYMMETRIC SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsSymmetric< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsSymmetric<MT1>, IsSymmetric<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsSymmetric< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsSymmetric<MT1>, IsSymmetric<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISHERMITIAN SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsHermitian< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsHermitian<MT1>, IsHermitian<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsHermitian< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsHermitian<MT1>, IsHermitian<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISLOWER SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsLower< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsLower<MT1>, IsLower<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsLower< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsLower<MT1>, IsLower<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISUNILOWER SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsUniLower< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsUniLower<MT1>, IsUniLower<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsUniLower< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsUniLower<MT1>, IsUniLower<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISSTRICTLYLOWER SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsStrictlyLower< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsStrictlyLower<MT1>, IsStrictlyLower<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsStrictlyLower< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsStrictlyLower<MT1>, IsStrictlyLower<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISUPPER SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsUpper< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsUpper<MT1>, IsUpper<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsUpper< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsUpper<MT1>, IsUpper<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISUNIUPPER SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsUniUpper< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsUniUpper<MT1>, IsUniUpper<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsUniUpper< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsUniUpper<MT1>, IsUniUpper<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISSTRICTLYUPPER SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename MT1, typename MT2, bool SO >
  struct IsStrictlyUpper< DMatDMatMapExpr<MT1,MT2,Min,SO> >
     : public And< IsStrictlyUpper<MT1>, IsStrictlyUpper<MT2> >
  {};
  
  template< typename MT1, typename MT2, bool SO >
  struct IsStrictlyUpper< DMatDMatMapExpr<MT1,MT2,Max,SO> >
     : public And< IsStrictlyUpper<MT1>, IsStrictlyUpper<MT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  } // namespace blaze
  
  #endif
  