text: //=================================================================================================
  /*!
  //  \file blaze/math/expressions/DVecDVecDivExpr.h
  //  \brief Header file for the dense vector/dense vector division expression
  //
  //  Copyright (C) 2012-2018 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_DVECDVECDIVEXPR_H_
  #define _BLAZE_MATH_EXPRESSIONS_DVECDVECDIVEXPR_H_
  
  
  //*************************************************************************************************
  // Includes
  //*************************************************************************************************
  
  #include <iterator>
  #include <blaze/math/Aliases.h>
  #include <blaze/math/constraints/DenseVector.h>
  #include <blaze/math/constraints/RequiresEvaluation.h>
  #include <blaze/math/constraints/TransposeFlag.h>
  #include <blaze/math/constraints/VecVecDivExpr.h>
  #include <blaze/math/Exception.h>
  #include <blaze/math/expressions/Computation.h>
  #include <blaze/math/expressions/DenseVector.h>
  #include <blaze/math/expressions/Forward.h>
  #include <blaze/math/expressions/VecVecDivExpr.h>
  #include <blaze/math/shims/Serial.h>
  #include <blaze/math/SIMD.h>
  #include <blaze/math/traits/DivExprTrait.h>
  #include <blaze/math/traits/DivTrait.h>
  #include <blaze/math/typetraits/HasSIMDDiv.h>
  #include <blaze/math/typetraits/IsAligned.h>
  #include <blaze/math/typetraits/IsComputation.h>
  #include <blaze/math/typetraits/IsExpression.h>
  #include <blaze/math/typetraits/IsTemporary.h>
  #include <blaze/math/typetraits/RequiresEvaluation.h>
  #include <blaze/math/typetraits/Size.h>
  #include <blaze/system/Inline.h>
  #include <blaze/system/Thresholds.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/Types.h>
  #include <blaze/util/typetraits/IsSame.h>
  
  
  namespace blaze {
  
  //=================================================================================================
  //
  //  CLASS DVECDVECDIVEXPR
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*!\brief Expression object for dense vector-dense vector divisions.
  // \ingroup dense_vector_expression
  //
  // The DVecDVecDivExpr class represents the compile time expression for componentwise divisions
  // between dense vectors.
  */
  template< typename VT1  // Type of the left-hand side dense vector
          , typename VT2  // Type of the right-hand side dense vector
          , bool TF >     // Transpose flag
  class DVecDVecDivExpr
     : public VecVecDivExpr< DenseVector< DVecDVecDivExpr<VT1,VT2,TF>, TF > >
     , private Computation
  {
   private:
     //**Type definitions****************************************************************************
     using RT1 = ResultType_<VT1>;     //!< Result type of the left-hand side dense vector expression.
     using RT2 = ResultType_<VT2>;     //!< Result type of the right-hand side dense vector expression.
     using RN1 = ReturnType_<VT1>;     //!< Return type of the left-hand side dense vector expression.
     using RN2 = ReturnType_<VT2>;     //!< Return type of the right-hand side dense vector expression.
     using CT1 = CompositeType_<VT1>;  //!< Composite type of the left-hand side dense vector expression.
     using CT2 = CompositeType_<VT2>;  //!< Composite type of the right-hand side dense vector expression.
     using ET1 = ElementType_<VT1>;    //!< Element type of the left-hand side dense vector expression.
     using ET2 = ElementType_<VT2>;    //!< Element type of the right-hand side dense vector expression.
     //**********************************************************************************************
  
     //**Return type evaluation**********************************************************************
     //! Compilation switch for the selection of the subscript operator return type.
     /*! The \a returnExpr compile time constant expression is a compilation switch for the
         selection of the \a ReturnType. If either vector operand returns a temporary vector
         or matrix, \a returnExpr will be set to 0 and the subscript operator will return
         it's result by value. Otherwise \a returnExpr will be set to 1 and the subscript
         operator may return it's result as an expression. */
     enum : bool { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
  
     //! Expression return type for the subscript operator.
     using ExprReturnType = DivExprTrait_<RN1,RN2>;
     //**********************************************************************************************
  
     //**Serial evaluation strategy******************************************************************
     //! Compilation switch for the serial evaluation strategy of the division expression.
     /*! The \a useAssign compile time constant expression represents a compilation switch for
         the serial evaluation strategy of the division expression. In case either of the two
         dense vector operands requires an intermediate evaluation or the subscript operator
         can only return by value, \a useAssign will be set to 1 and the division 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<VT1>::value || RequiresEvaluation<VT2>::value || !returnExpr ) };
  
     /*! \cond BLAZE_INTERNAL */
     //! Helper structure for the explicit application of the SFINAE principle.
     template< typename VT >
     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 vector 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 VT >
     struct UseSMPAssign {
        enum : bool { value = ( !VT1::smpAssignable || !VT2::smpAssignable ) && useAssign };
     };
     /*! \endcond */
     //**********************************************************************************************
  
   public:
     //**Type definitions****************************************************************************
     using This          = DVecDVecDivExpr<VT1,VT2,TF>;  //!< Type of this DVecDVecDivExpr instance.
     using ResultType    = DivTrait_<RT1,RT2>;           //!< Result type 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 = const IfTrue_< returnExpr, ExprReturnType, ElementType >;
  
     //! Data type for composite expression templates.
     using CompositeType = IfTrue_< useAssign, const ResultType, const DVecDVecDivExpr& >;
  
     //! Composite type of the left-hand side dense vector expression.
     using LeftOperand = If_< IsExpression<VT1>, const VT1, const VT1& >;
  
     //! Composite type of the right-hand side dense vector expression.
     using RightOperand = If_< IsExpression<VT2>, const VT2, const VT2& >;
     //**********************************************************************************************
  
     //**ConstIterator class definition**************************************************************
     /*!\brief Iterator over the elements of the dense vector.
     */
     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 vector expression.
        using LeftIteratorType = ConstIterator_<VT1>;
  
        //! ConstIterator type of the right-hand side dense vector expression.
        using RightIteratorType = ConstIterator_<VT2>;
        //*******************************************************************************************
  
        //**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.
        */
        explicit inline ConstIterator( LeftIteratorType left, RightIteratorType right )
           : left_ ( left  )  // Iterator to the current left-hand side element
           , right_( right )  // Iterator to the current right-hand side element
        {}
        //*******************************************************************************************
  
        //**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_++ );
        }
        //*******************************************************************************************
  
        //**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_-- );
        }
        //*******************************************************************************************
  
        //**Element access operator******************************************************************
        /*!\brief Direct access to the element at the current iterator position.
        //
        // \return The resulting value.
        */
        inline ReturnType operator*() const {
           return (*left_) / (*right_);
        }
        //*******************************************************************************************
  
        //**Load function****************************************************************************
        /*!\brief Access to the SIMD elements of the vector.
        //
        // \return The resulting SIMD element.
        */
        inline auto load() const noexcept {
           return 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 );
        }
        //*******************************************************************************************
  
        //**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 );
        }
        //*******************************************************************************************
  
        //**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 );
        }
        //*******************************************************************************************
  
      private:
        //**Member variables*************************************************************************
        LeftIteratorType  left_;   //!< Iterator to the current left-hand side element.
        RightIteratorType right_;  //!< Iterator to the current right-hand side element.
        //*******************************************************************************************
     };
     //**********************************************************************************************
  
     //**Compilation flags***************************************************************************
     //! Compilation switch for the expression template evaluation strategy.
     enum : bool { simdEnabled = VT1::simdEnabled && VT2::simdEnabled &&
                                 HasSIMDDiv<ET1,ET2>::value };
  
     //! Compilation switch for the expression template assignment strategy.
     enum : bool { smpAssignable = VT1::smpAssignable && VT2::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 DVecDVecDivExpr class.
     //
     // \param lhs The left-hand side operand of the division expression.
     // \param rhs The right-hand side operand of the division expression.
     */
     explicit inline DVecDVecDivExpr( const VT1& lhs, const VT2& rhs ) noexcept
        : lhs_( lhs )  // Left-hand side dense vector of the division expression
        , rhs_( rhs )  // Right-hand side dense vector of the division expression
     {
        BLAZE_INTERNAL_ASSERT( lhs.size() == rhs.size(), "Invalid vector sizes" );
     }
     //**********************************************************************************************
  
     //**Subscript operator**************************************************************************
     /*!\brief Subscript operator for the direct access to the vector elements.
     //
     // \param index Access index. The index has to be in the range \f$[0..N-1]\f$.
     // \return The resulting value.
     */
     inline ReturnType operator[]( size_t index ) const {
        BLAZE_INTERNAL_ASSERT( index < lhs_.size(), "Invalid vector access index" );
        return lhs_[index] / rhs_[index];
     }
     //**********************************************************************************************
  
     //**At function*********************************************************************************
     /*!\brief Checked access to the vector elements.
     //
     // \param index Access index. The index has to be in the range \f$[0..N-1]\f$.
     // \return The resulting value.
     // \exception std::out_of_range Invalid vector access index.
     */
     inline ReturnType at( size_t index ) const {
        if( index >= lhs_.size() ) {
           BLAZE_THROW_OUT_OF_RANGE( "Invalid vector access index" );
        }
        return (*this)[index];
     }
     //**********************************************************************************************
  
     //**Load function*******************************************************************************
     /*!\brief Access to the SIMD elements of the vector.
     //
     // \param index Access index. 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 index ) const noexcept {
        BLAZE_INTERNAL_ASSERT( index < lhs_.size()    , "Invalid vector access index" );
        BLAZE_INTERNAL_ASSERT( index % SIMDSIZE == 0UL, "Invalid vector access index" );
        return lhs_.load( index ) / rhs_.load( index );
     }
     //**********************************************************************************************
  
     //**Begin function******************************************************************************
     /*!\brief Returns an iterator to the first non-zero element of the dense vector.
     //
     // \return Iterator to the first non-zero element of the dense vector.
     */
     inline ConstIterator begin() const {
        return ConstIterator( lhs_.begin(), rhs_.begin() );
     }
     //**********************************************************************************************
  
     //**End function********************************************************************************
     /*!\brief Returns an iterator just past the last non-zero element of the dense vector.
     //
     // \return Iterator just past the last non-zero element of the dense vector.
     */
     inline ConstIterator end() const {
        return ConstIterator( lhs_.end(), rhs_.end() );
     }
     //**********************************************************************************************
  
     //**Size function*******************************************************************************
     /*!\brief Returns the current size/dimension of the vector.
     //
     // \return The size of the vector.
     */
     inline size_t size() const noexcept {
        return lhs_.size();
     }
     //**********************************************************************************************
  
     //**Left operand access*************************************************************************
     /*!\brief Returns the left-hand side dense vector operand.
     //
     // \return The left-hand side dense vector operand.
     */
     inline LeftOperand leftOperand() const noexcept {
        return lhs_;
     }
     //**********************************************************************************************
  
     //**Right operand access************************************************************************
     /*!\brief Returns the right-hand side dense vector operand.
     //
     // \return The right-hand side dense vector operand.
     */
     inline RightOperand rightOperand() const noexcept {
        return rhs_;
     }
     //**********************************************************************************************
  
     //**********************************************************************************************
     /*!\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<VT1>::value && ( RequiresEvaluation<VT1>::value ? lhs_.isAliased( alias ) : lhs_.canAlias( alias ) ) ) ||
               ( IsExpression<VT2>::value && ( RequiresEvaluation<VT2>::value ? rhs_.isAliased( alias ) : 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() ||
               ( size() > SMP_DVECDVECDIV_THRESHOLD );
     }
     //**********************************************************************************************
  
   private:
     //**Member variables****************************************************************************
     LeftOperand  lhs_;  //!< Left-hand side dense vector of the division expression.
     RightOperand rhs_;  //!< Right-hand side dense vector of the division expression.
     //**********************************************************************************************
  
     //**Assignment to dense vectors*****************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized assignment of a dense vector-dense
     // vector division expression to a dense vector. 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 VT >  // Type of the target dense vector
     friend inline EnableIf_< UseAssign<VT> >
        assign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        if( !IsComputation<VT1>::value && isSame( ~lhs, rhs.lhs_ ) ) {
           divAssign( ~lhs, rhs.rhs_ );
        }
        else if( IsSame<VT,ResultType>::value || IsSame< ElementType_<VT>, ElementType_<VT1> >::value ) {
           assign   ( ~lhs, rhs.lhs_ );
           divAssign( ~lhs, rhs.rhs_ );
        }
        else {
           const ResultType tmp( serial( rhs ) );
           assign( ~lhs, tmp );
        }
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Assignment to sparse vectors****************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Assignment of a dense vector-dense vector division to a sparse vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side sparse vector.
     // \param rhs The right-hand side division expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized assignment of a dense vector-dense
     // vector division expression to a sparse vector. 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 VT >  // Type of the target sparse vector
     friend inline EnableIf_< UseAssign<VT> >
        assign( SparseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( serial( rhs ) );
        assign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Addition assignment to dense vectors********************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Addition assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be added.
     // \return void
     //
     // This function implements the performance optimized addition assignment of a dense vector-
     // dense vector division expression to a dense vector. Due to the explicit application of
     // the SFINAE principle, this function can only be selected by the compiler in case either
     // of the operands requires an intermediate evaluation.
     */
     template< typename VT >  // Type of the target dense vector
     friend inline EnableIf_< UseAssign<VT> >
        addAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( serial( rhs ) );
        addAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Addition assignment to sparse vectors*******************************************************
     // No special implementation for the addition assignment to sparse vectors.
     //**********************************************************************************************
  
     //**Subtraction assignment to dense vectors*****************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Subtraction assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be subtracted.
     // \return void
     //
     // This function implements the performance optimized subtraction assignment of a dense vector-
     // dense vector division expression to a dense vector. Due to the explicit application of the
     // SFINAE principle, this function can only be selected by the compiler in case either of the
     // operands requires an intermediate evaluation.
     */
     template< typename VT >  // Type of the target dense vector
     friend inline EnableIf_< UseAssign<VT> >
        subAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( serial( rhs ) );
        subAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Subtraction assignment to sparse vectors****************************************************
     // No special implementation for the subtraction assignment to sparse vectors.
     //**********************************************************************************************
  
     //**Multiplication assignment to dense vectors**************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Multiplication assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be multiplied.
     // \return void
     //
     // This function implements the performance optimized multiplication assignment of a dense
     // vector-dense vector division expression to a dense vector. Due to the explicit application
     // of the SFINAE principle, this function can only be selected by the compiler in case either
     // of the operands requires an intermediate evaluation.
     */
     template< typename VT >  // Type of the target dense vector
     friend inline EnableIf_< UseAssign<VT> >
        multAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( serial( rhs ) );
        multAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Multiplication assignment to sparse vectors*************************************************
     // No special implementation for the multiplication assignment to sparse vectors.
     //**********************************************************************************************
  
     //**Division assignment to dense vectors********************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief Division assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression divisor.
     // \return void
     //
     // This function implements the performance optimized division assignment of a dense vector-
     // dense vector division expression to a dense vector. Due to the explicit application of the
     // SFINAE principle, this function can only be selected by the compiler in case either of the
     // operands requires an intermediate evaluation.
     */
     template< typename VT >  // Type of the target dense vector
     friend inline EnableIf_< UseAssign<VT> >
        divAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( serial( rhs ) );
        divAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**Division assignment to sparse vectors*******************************************************
     // No special implementation for the division assignment to sparse vectors.
     //**********************************************************************************************
  
     //**SMP assignment to dense vectors*************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized SMP assignment of a dense vector-dense
     // vector division expression to a dense vector. 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 VT >  // Type of the target dense vector
     friend inline EnableIf_< UseSMPAssign<VT> >
        smpAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        if( !IsComputation<VT1>::value && isSame( ~lhs, rhs.lhs_ ) ) {
           smpDivAssign( ~lhs, rhs.rhs_ );
        }
        else if( IsSame<VT,ResultType>::value || IsSame< ElementType_<VT>, ElementType_<VT1> >::value ) {
           smpAssign   ( ~lhs, rhs.lhs_ );
           smpDivAssign( ~lhs, rhs.rhs_ );
        }
        else {
           const ResultType tmp( rhs );
           smpAssign( ~lhs, tmp );
        }
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP assignment to sparse vectors************************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP assignment of a dense vector-dense vector division to a sparse vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side sparse vector.
     // \param rhs The right-hand side division expression to be assigned.
     // \return void
     //
     // This function implements the performance optimized SMP assignment of a dense vector-dense
     // vector division expression to a sparse vector. 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 VT >  // Type of the target sparse vector
     friend inline EnableIf_< UseSMPAssign<VT> >
        smpAssign( SparseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( rhs );
        smpAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP addition assignment to dense vectors****************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP addition assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be added.
     // \return void
     //
     // This function implements the performance optimized SMP addition assignment of a dense vector-
     // dense vector division expression to a dense vector. 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 VT >  // Type of the target dense vector
     friend inline EnableIf_< UseSMPAssign<VT> >
        smpAddAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( rhs );
        smpAddAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP addition assignment to sparse vectors***************************************************
     // No special implementation for the SMP addition assignment to sparse vectors.
     //**********************************************************************************************
  
     //**SMP subtraction assignment to dense vectors*************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP subtraction assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be subtracted.
     // \return void
     //
     // This function implements the performance optimized SMP subtraction assignment of a dense
     // vector-dense vector division expression to a dense vector. 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 VT >  // Type of the target dense vector
     friend inline EnableIf_< UseSMPAssign<VT> >
        smpSubAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( rhs );
        smpSubAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP subtraction assignment to sparse vectors************************************************
     // No special implementation for the SMP subtraction assignment to sparse vectors.
     //**********************************************************************************************
  
     //**SMP multiplication assignment to dense vectors**********************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP multiplication assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression to be multiplied.
     // \return void
     //
     // This function implements the performance optimized SMP multiplication assignment of a
     // dense vector-dense vector division expression to a dense vector. 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 VT >  // Type of the target dense vector
     friend inline EnableIf_< UseSMPAssign<VT> >
        smpMultAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( rhs );
        smpMultAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP multiplication assignment to sparse vectors*********************************************
     // No special implementation for the SMP multiplication assignment to sparse vectors.
     //**********************************************************************************************
  
     //**SMP division assignment to dense vectors****************************************************
     /*! \cond BLAZE_INTERNAL */
     /*!\brief SMP division assignment of a dense vector-dense vector division to a dense vector.
     // \ingroup dense_vector
     //
     // \param lhs The target left-hand side dense vector.
     // \param rhs The right-hand side division expression divisor.
     // \return void
     //
     // This function implements the performance optimized SMP division assignment of a dense vector-
     // dense vector division expression to a dense vector. 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 VT >  // Type of the target dense vector
     friend inline EnableIf_< UseSMPAssign<VT> >
        smpDivAssign( DenseVector<VT,TF>& lhs, const DVecDVecDivExpr& rhs )
     {
        BLAZE_FUNCTION_TRACE;
  
        BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( ResultType );
        BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( ResultType, TF );
        BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION( ResultType );
  
        BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
  
        const ResultType tmp( rhs );
        smpDivAssign( ~lhs, tmp );
     }
     /*! \endcond */
     //**********************************************************************************************
  
     //**SMP division assignment to sparse vectors***************************************************
     // No special implementation for the SMP division assignment to sparse vectors.
     //**********************************************************************************************
  
     //**Compile time checks*************************************************************************
     /*! \cond BLAZE_INTERNAL */
     BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( VT1 );
     BLAZE_CONSTRAINT_MUST_BE_DENSE_VECTOR_TYPE( VT2 );
     BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( VT1, TF );
     BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG( VT2, TF );
     BLAZE_CONSTRAINT_MUST_FORM_VALID_VECVECDIVEXPR( VT1, VT2 );
     /*! \endcond */
     //**********************************************************************************************
  };
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  GLOBAL BINARY ARITHMETIC OPERATORS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*!\brief Division operator for the componentwise product of two dense vectors
  //        (\f$ \vec{a}=\vec{b}/\vec{c} \f$).
  // \ingroup dense_vector
  //
  // \param lhs The left-hand side dense vector for the component product.
  // \param rhs The right-hand side dense vector for the component product.
  // \return The quotient of the two vectors.
  // \exception std::invalid_argument Vector sizes do not match.
  //
  // This operator represents the component quotient of two dense vectors:
  
     \code
     blaze::DynamicVector<double> a, b, c;
     // ... Resizing and initialization
     c = a / b;
     \endcode
  
  // The operator returns an expression representing a dense vector of the higher-order element
  // type of the two involved vector element types \a VT1::ElementType and \a VT2::ElementType.
  // Both vector types \a VT1 and \a VT2 as well as the two element types \a VT1::ElementType
  // and \a VT2::ElementType have to be supported by the DivTrait class template.\n
  // In case the current sizes of the two given vectors don't match, a \a std::invalid_argument
  // is thrown.
  */
  template< typename VT1  // Type of the left-hand side dense vector
          , typename VT2  // Type of the right-hand side dense vector
          , bool TF >     // Transpose flag
  inline decltype(auto)
     operator/( const DenseVector<VT1,TF>& lhs, const DenseVector<VT2,TF>& rhs )
  {
     BLAZE_FUNCTION_TRACE;
  
     if( (~lhs).size() != (~rhs).size() ) {
        BLAZE_THROW_INVALID_ARGUMENT( "Vector sizes do not match" );
     }
  
     using ReturnType = const DVecDVecDivExpr<VT1,VT2,TF>;
     return ReturnType( ~lhs, ~rhs );
  }
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  SIZE SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename VT1, typename VT2, bool TF >
  struct Size< DVecDVecDivExpr<VT1,VT2,TF>, 0UL >
     : public Maximum< Size<VT1,0UL>, Size<VT2,0UL> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  
  
  
  //=================================================================================================
  //
  //  ISALIGNED SPECIALIZATIONS
  //
  //=================================================================================================
  
  //*************************************************************************************************
  /*! \cond BLAZE_INTERNAL */
  template< typename VT1, typename VT2, bool TF >
  struct IsAligned< DVecDVecDivExpr<VT1,VT2,TF> >
     : public And< IsAligned<VT1>, IsAligned<VT2> >
  {};
  /*! \endcond */
  //*************************************************************************************************
  
  } // namespace blaze
  
  #endif
  