All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
SVecSVecMultExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_SVECSVECMULTEXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_SVECSVECMULTEXPR_H_
37 
38 
39 //*************************************************************************************************
40 // Includes
41 //*************************************************************************************************
42 
43 #include <stdexcept>
51 #include <blaze/math/Functions.h>
52 #include <blaze/math/shims/Reset.h>
61 #include <blaze/util/Assert.h>
64 #include <blaze/util/mpl/Max.h>
65 #include <blaze/util/SelectType.h>
66 #include <blaze/util/Types.h>
68 
69 
70 namespace blaze {
71 
72 //=================================================================================================
73 //
74 // CLASS SVECSVECMULTEXPR
75 //
76 //=================================================================================================
77 
78 //*************************************************************************************************
85 template< typename VT1 // Type of the left-hand side sparse vector
86  , typename VT2 // Type of the right-hand side sparse vector
87  , bool TF > // Transpose flag
88 class SVecSVecMultExpr : public SparseVector< SVecSVecMultExpr<VT1,VT2,TF>, TF >
89  , private VecVecMultExpr
90  , private Computation
91 {
92  private:
93  //**Type definitions****************************************************************************
94  typedef typename VT1::ResultType RT1;
95  typedef typename VT2::ResultType RT2;
96  typedef typename VT1::ReturnType RN1;
97  typedef typename VT2::ReturnType RN2;
98  typedef typename VT1::CompositeType CT1;
99  typedef typename VT2::CompositeType CT2;
100  typedef typename VT1::TransposeType TT1;
101  typedef typename VT2::TransposeType TT2;
102  //**********************************************************************************************
103 
104  //**Return type evaluation**********************************************************************
106 
111  enum { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
112 
115  //**********************************************************************************************
116 
117  public:
118  //**Type definitions****************************************************************************
123 
126 
128  typedef const ResultType CompositeType;
129 
131  typedef typename SelectType< IsExpression<VT1>::value, const VT1, const VT1& >::Type LeftOperand;
132 
134  typedef typename SelectType< IsExpression<VT2>::value, const VT2, const VT2& >::Type RightOperand;
135  //**********************************************************************************************
136 
137  //**Compilation flags***************************************************************************
139  enum { smpAssignable = 0 };
140  //**********************************************************************************************
141 
142  //**Constructor*********************************************************************************
145  explicit inline SVecSVecMultExpr( const VT1& lhs, const VT2& rhs )
146  : lhs_( lhs ) // Left-hand side sparse vector of the multiplication expression
147  , rhs_( rhs ) // Right-hand side sparse vector of the multiplication expression
148  {
149  BLAZE_INTERNAL_ASSERT( lhs.size() == rhs.size(), "Invalid vector sizes" );
150  }
151  //**********************************************************************************************
152 
153  //**Subscript operator**************************************************************************
159  inline ReturnType operator[]( size_t index ) const {
160  BLAZE_INTERNAL_ASSERT( index < lhs_.size(), "Invalid vector access index" );
161  return lhs_[index] * rhs_[index];
162  }
163  //**********************************************************************************************
164 
165  //**Size function*******************************************************************************
170  inline size_t size() const {
171  return lhs_.size();
172  }
173  //**********************************************************************************************
174 
175  //**NonZeros function***************************************************************************
180  inline size_t nonZeros() const {
181  return min( lhs_.nonZeros(), rhs_.nonZeros() );
182  }
183  //**********************************************************************************************
184 
185  //**Left operand access*************************************************************************
190  inline LeftOperand leftOperand() const {
191  return lhs_;
192  }
193  //**********************************************************************************************
194 
195  //**Right operand access************************************************************************
200  inline RightOperand rightOperand() const {
201  return rhs_;
202  }
203  //**********************************************************************************************
204 
205  //**********************************************************************************************
211  template< typename T >
212  inline bool canAlias( const T* alias ) const {
213  return ( lhs_.canAlias( alias ) || rhs_.canAlias( alias ) );
214  }
215  //**********************************************************************************************
216 
217  //**********************************************************************************************
223  template< typename T >
224  inline bool isAliased( const T* alias ) const {
225  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
226  }
227  //**********************************************************************************************
228 
229  private:
230  //**Member variables****************************************************************************
233  //**********************************************************************************************
234 
235  //**Assignment to dense vectors*****************************************************************
247  template< typename VT > // Type of the target dense vector
248  friend inline void assign( DenseVector<VT,TF>& lhs, const SVecSVecMultExpr& rhs )
249  {
251 
252  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
253 
254  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
255  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
256 
257  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
258  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse vector operand
259 
260  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
261  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
262  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
263 
264  const LeftIterator lend( x.end() );
265  const RightIterator rend( y.end() );
266 
267  LeftIterator l( x.begin() );
268  RightIterator r( y.begin() );
269 
270  for( ; l!=lend; ++l ) {
271  while( r!=rend && r->index() < l->index() ) ++r;
272  if( r==rend ) break;
273  if( l->index() == r->index() ) {
274  (~lhs)[l->index()] = l->value() * r->value();
275  ++r;
276  }
277  }
278  }
280  //**********************************************************************************************
281 
282  //**Assignment to sparse vectors****************************************************************
294  template< typename VT > // Type of the target sparse vector
295  friend inline void assign( SparseVector<VT,TF>& lhs, const SVecSVecMultExpr& rhs )
296  {
298 
299  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
300 
301  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
302  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
303 
304  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
305  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse vector operand
306 
307  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
308  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
309  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
310 
311  const LeftIterator lend( x.end() );
312  const RightIterator rend( y.end() );
313 
314  LeftIterator l( x.begin() );
315  RightIterator r( y.begin() );
316 
317  for( ; l!=lend; ++l ) {
318  while( r!=rend && r->index() < l->index() ) ++r;
319  if( r==rend ) break;
320  if( l->index() == r->index() ) {
321  (~lhs).append( l->index(), l->value() * r->value() );
322  ++r;
323  }
324  }
325  }
327  //**********************************************************************************************
328 
329  //**Addition assignment to dense vectors********************************************************
341  template< typename VT > // Type of the target dense vector
342  friend inline void addAssign( DenseVector<VT,TF>& lhs, const SVecSVecMultExpr& rhs )
343  {
345 
346  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
347 
348  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
349  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
350 
351  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
352  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse vector operand
353 
354  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
355  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
356  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
357 
358  const LeftIterator lend( x.end() );
359  const RightIterator rend( y.end() );
360 
361  LeftIterator l( x.begin() );
362  RightIterator r( y.begin() );
363 
364  for( ; l!=lend; ++l ) {
365  while( r!=rend && r->index() < l->index() ) ++r;
366  if( r==rend ) break;
367  if( l->index() == r->index() ) {
368  (~lhs)[l->index()] += l->value() * r->value();
369  ++r;
370  }
371  }
372  }
374  //**********************************************************************************************
375 
376  //**Addition assignment to sparse vectors*******************************************************
377  // No special implementation for the addition assignment to sparse vectors.
378  //**********************************************************************************************
379 
380  //**Subtraction assignment to dense vectors*****************************************************
392  template< typename VT > // Type of the target dense vector
393  friend inline void subAssign( DenseVector<VT,TF>& lhs, const SVecSVecMultExpr& rhs )
394  {
396 
397  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
398 
399  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
400  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
401 
402  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
403  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse vector operand
404 
405  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
406  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
407  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
408 
409  const LeftIterator lend( x.end() );
410  const RightIterator rend( y.end() );
411 
412  LeftIterator l( x.begin() );
413  RightIterator r( y.begin() );
414 
415  for( ; l!=lend; ++l ) {
416  while( r!=rend && r->index() < l->index() ) ++r;
417  if( r==rend ) break;
418  if( l->index() == r->index() ) {
419  (~lhs)[l->index()] -= l->value() * r->value();
420  ++r;
421  }
422  }
423  }
425  //**********************************************************************************************
426 
427  //**Subtraction assignment to sparse vectors****************************************************
428  // No special implementation for the subtraction assignment to sparse vectors.
429  //**********************************************************************************************
430 
431  //**Multiplication assignment to dense vectors**************************************************
443  template< typename VT > // Type of the target dense vector
444  friend inline void multAssign( DenseVector<VT,TF>& lhs, const SVecSVecMultExpr& rhs )
445  {
447 
448  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
449 
450  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
451  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
452 
453  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
454  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse vector operand
455 
456  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
457  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
458  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
459 
460  const LeftIterator lend( x.end() );
461  const RightIterator rend( y.end() );
462 
463  LeftIterator l( x.begin() );
464  RightIterator r( y.begin() );
465 
466  size_t i( 0 );
467 
468  for( ; l!=lend; ++l ) {
469  while( r!=rend && r->index() < l->index() ) ++r;
470  if( r==rend ) break;
471  if( l->index() == r->index() ) {
472  for( ; i<r->index(); ++i )
473  reset( (~lhs)[i] );
474  (~lhs)[l->index()] *= l->value() * r->value();
475  ++r;
476  ++i;
477  }
478  }
479 
480  for( ; i<rhs.size(); ++i )
481  reset( (~lhs)[i] );
482  }
484  //**********************************************************************************************
485 
486  //**Multiplication assignment to sparse vectors*************************************************
498  template< typename VT > // Type of the target sparse vector
499  friend inline void multAssign( SparseVector<VT,TF>& lhs, const SVecSVecMultExpr& rhs )
500  {
502 
503  BLAZE_INTERNAL_ASSERT( (~lhs).size() == rhs.size(), "Invalid vector sizes" );
504 
505  typedef typename VT::ConstIterator Iterator1;
506  typedef typename RemoveReference<CT1>::Type::ConstIterator Iterator2;
507  typedef typename RemoveReference<CT2>::Type::ConstIterator Iterator3;
508 
509  CT1 x( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse vector operand
510  CT2 y( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse vector operand
511 
512  BLAZE_INTERNAL_ASSERT( x.size() == rhs.lhs_.size(), "Invalid vector size" );
513  BLAZE_INTERNAL_ASSERT( y.size() == rhs.rhs_.size(), "Invalid vector size" );
514  BLAZE_INTERNAL_ASSERT( x.size() == (~lhs).size() , "Invalid vector size" );
515 
516  VT tmp( rhs.size(), rhs.nonZeros() );
517 
518  const Iterator1 end1( (~lhs).end() );
519  const Iterator2 end2( x.end() );
520  const Iterator3 end3( y.end() );
521 
522  Iterator1 i1( (~lhs).begin() );
523  Iterator2 i2( x.begin() );
524  Iterator3 i3( y.begin() );
525 
526  for( ; i1!=end1; ++i1 ) {
527  while( i2!=end2 && i2->index() < i1->index() ) ++i2;
528  if( i2==end2 ) break;
529  while( i3!=end3 && i3->index() < i1->index() ) ++i3;
530  if( i3==end3 ) break;
531  if( i1->index() == i2->index() && i1->index() == i3->index() ) {
532  tmp.append( i1->index(), i1->value() * i2->value() * i3->value() );
533  ++i2;
534  ++i3;
535  }
536  }
537 
538  swap( ~lhs, tmp );
539  }
541  //**********************************************************************************************
542 
543  //**Compile time checks*************************************************************************
551  //**********************************************************************************************
552 };
553 //*************************************************************************************************
554 
555 
556 
557 
558 //=================================================================================================
559 //
560 // GLOBAL BINARY ARITHMETIC OPERATORS
561 //
562 //=================================================================================================
563 
564 //*************************************************************************************************
589 template< typename T1 // Type of the left-hand side sparse vector
590  , typename T2 // Type of the right-hand side sparse vector
591  , bool TF > // Transpose flag
592 inline const SVecSVecMultExpr<T1,T2,TF>
594 {
596 
597  if( (~lhs).size() != (~rhs).size() )
598  throw std::invalid_argument( "Vector sizes do not match" );
599 
600  return SVecSVecMultExpr<T1,T2,TF>( ~lhs, ~rhs );
601 }
602 //*************************************************************************************************
603 
604 
605 
606 
607 //=================================================================================================
608 //
609 // SIZE SPECIALIZATIONS
610 //
611 //=================================================================================================
612 
613 //*************************************************************************************************
615 template< typename VT1, typename VT2, bool TF >
616 struct Size< SVecSVecMultExpr<VT1,VT2,TF> >
617  : public Max< Size<VT1>, Size<VT2> >::Type
618 {};
620 //*************************************************************************************************
621 
622 
623 
624 
625 //=================================================================================================
626 //
627 // EXPRESSION TRAIT SPECIALIZATIONS
628 //
629 //=================================================================================================
630 
631 //*************************************************************************************************
633 template< typename VT1, typename VT2, bool TF, bool AF >
634 struct SubvectorExprTrait< SVecSVecMultExpr<VT1,VT2,TF>, AF >
635 {
636  public:
637  //**********************************************************************************************
638  typedef typename MultExprTrait< typename SubvectorExprTrait<const VT1,AF>::Type
639  , typename SubvectorExprTrait<const VT2,AF>::Type >::Type Type;
640  //**********************************************************************************************
641 };
643 //*************************************************************************************************
644 
645 } // namespace blaze
646 
647 #endif
Header file for the Max class template.
Header file for mathematical functions.
void swap(SymmetricMatrix< MT, SO, DF, NF > &a, SymmetricMatrix< MT, SO, DF, NF > &b)
Swapping the contents of two matrices.
Definition: SymmetricMatrix.h:195
BLAZE_ALWAYS_INLINE void multAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the multiplication assignment of a matrix to a matrix.
Definition: Matrix.h:879
SelectType< IsExpression< VT2 >::value, const VT2, const VT2 & >::Type RightOperand
Composite type of the right-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:134
Compile time check whether the given type is a temporary vector or matrix type.This type trait class ...
Definition: IsTemporary.h:87
const DMatDMatMultExpr< T1, T2 > operator*(const DenseMatrix< T1, false > &lhs, const DenseMatrix< T2, false > &rhs)
Multiplication operator for the multiplication of two row-major dense matrices ( ).
Definition: DMatDMatMultExpr.h:4838
MultTrait< RT1, RT2 >::Type ResultType
Result type for expression template evaluations.
Definition: SVecSVecMultExpr.h:120
Header file for the SparseVector base class.
BLAZE_ALWAYS_INLINE size_t size(const Vector< VT, TF > &vector)
Returns the current size/dimension of the vector.
Definition: Vector.h:258
VT1::TransposeType TT1
Transpose type of the left-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:100
BLAZE_ALWAYS_INLINE MT::Iterator end(Matrix< MT, SO > &matrix, size_t i)
Returns an iterator just past the last element of row/column i.
Definition: Matrix.h:258
Efficient implementation of a compressed matrix.The CompressedMatrix class template is the represent...
Definition: CompressedMatrix.h:205
SelectType< IsExpression< VT1 >::value, const VT1, const VT1 & >::Type LeftOperand
Composite type of the left-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:131
bool canAlias(const T *alias) const
Returns whether the expression can alias with the given address alias.
Definition: SVecSVecMultExpr.h:212
VT2::ResultType RT2
Result type of the right-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:95
const ResultType CompositeType
Data type for composite expression templates.
Definition: SVecSVecMultExpr.h:128
const This & CompositeType
Data type for composite expression templates.
Definition: CompressedMatrix.h:2478
Type ElementType
Type of the sparse matrix elements.
Definition: CompressedMatrix.h:257
VT1::ReturnType RN1
Return type of the left-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:96
const DMatSerialExpr< MT, SO > serial(const DenseMatrix< MT, SO > &dm)
Forces the serial evaluation of the given dense matrix expression dm.
Definition: DMatSerialExpr.h:695
Header file for the Computation base class.
size_t size() const
Returns the current size/dimension of the vector.
Definition: SVecSVecMultExpr.h:170
Constraint on the data type.
VT1::CompositeType CT1
Composite type of the left-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:98
Header file for the MultExprTrait class template.
Compile time type selection.The SelectType class template selects one of the two given types T1 and T...
Definition: SelectType.h:59
Header file for the IsTemporary type trait class.
Header file for the multiplication trait.
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2482
const MT::ElementType min(const DenseMatrix< MT, SO > &dm)
Returns the smallest element of the dense matrix.
Definition: DenseMatrix.h:947
BLAZE_ALWAYS_INLINE void assign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the assignment of a matrix to a matrix.
Definition: Matrix.h:635
MultExprTrait< RN1, RN2 >::Type ExprReturnType
Expression return type for the subscript operator.
Definition: SVecSVecMultExpr.h:114
Base class for N-dimensional dense vectors.The DenseVector class is a base class for all arbitrarily ...
Definition: DenseVector.h:70
VT2::ReturnType RN2
Return type of the right-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:97
#define BLAZE_CONSTRAINT_MUST_BE_SPARSE_VECTOR_TYPE(T)
Constraint on the data type.In case the given data type T is not a sparse, N-dimensional vector type...
Definition: SparseVector.h:79
Constraint on the data type.
CompressedMatrix< Type, false > TransposeType
Transpose type for expression template evaluations.
Definition: CompressedMatrix.h:2475
RightOperand rhs_
Right-hand side sparse vector of the multiplication expression.
Definition: SVecSVecMultExpr.h:232
LeftOperand leftOperand() const
Returns the left-hand side sparse vector operand.
Definition: SVecSVecMultExpr.h:190
BLAZE_ALWAYS_INLINE MT::Iterator begin(Matrix< MT, SO > &matrix, size_t i)
Returns an iterator to the first element of row/column i.
Definition: Matrix.h:195
Header file for the VecVecMultExpr base class.
Header file for the SelectType class template.
Header file for all forward declarations for expression class templates.
Constraint on the data type.
Header file for the serial shim.
const Type & ReturnType
Return type for expression template evaluations.
Definition: CompressedMatrix.h:2477
Removal of reference modifiers.The RemoveCV type trait removes any reference modifiers from the given...
Definition: RemoveReference.h:69
VT1::ResultType RT1
Result type of the left-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:94
Expression object for sparse vector-sparse vector multiplications.The SVecSVecMultExpr class represen...
Definition: Forward.h:119
ReturnType operator[](size_t index) const
Subscript operator for the direct access to the vector elements.
Definition: SVecSVecMultExpr.h:159
Header file for run time assertion macros.
Base template for the MultTrait class.
Definition: MultTrait.h:142
BLAZE_ALWAYS_INLINE void addAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the addition assignment of a matrix to a matrix.
Definition: Matrix.h:742
ResultType::TransposeType TransposeType
Transpose type for expression template evaluations.
Definition: SVecSVecMultExpr.h:121
Header file for the reset shim.
BLAZE_ALWAYS_INLINE void reset(const NonNumericProxy< MT > &proxy)
Resetting the represented element to the default initial values.
Definition: NonNumericProxy.h:833
size_t nonZeros() const
Returns the number of non-zero elements in the sparse vector.
Definition: SVecSVecMultExpr.h:180
VT2::CompositeType CT2
Composite type of the right-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:99
const SelectType< returnExpr, ExprReturnType, ElementType >::Type ReturnType
Return type for expression template evaluations.
Definition: SVecSVecMultExpr.h:125
Header file for the RemoveReference type trait.
LeftOperand lhs_
Left-hand side sparse vector of the multiplication expression.
Definition: SVecSVecMultExpr.h:231
Constraint on the data type.
SVecSVecMultExpr< VT1, VT2, TF > This
Type of this SVecSVecMultExpr instance.
Definition: SVecSVecMultExpr.h:119
#define BLAZE_CONSTRAINT_MUST_FORM_VALID_VECVECMULTEXPR(T1, T2)
Constraint on the data type.In case the given data types T1 and T2 do not form a valid vector/vector ...
Definition: VecVecMultExpr.h:165
Header file for the IsComputation type trait class.
RightOperand rightOperand() const
Returns the right-hand side sparse vector operand.
Definition: SVecSVecMultExpr.h:200
bool isAliased(const T *alias) const
Returns whether the expression is aliased with the given address alias.
Definition: SVecSVecMultExpr.h:224
Base class for sparse vectors.The SparseVector class is a base class for all arbitrarily sized (N-dim...
Definition: Forward.h:108
#define BLAZE_FUNCTION_TRACE
Function trace macro.This macro can be used to reliably trace function calls. In case function tracin...
Definition: FunctionTrace.h:157
This ResultType
Result type for expression template evaluations.
Definition: CompressedMatrix.h:2473
SVecSVecMultExpr(const VT1 &lhs, const VT2 &rhs)
Constructor for the SVecSVecMultExpr class.
Definition: SVecSVecMultExpr.h:145
Header file for basic type definitions.
Header file for the SubvectorExprTrait class template.
ResultType::ElementType ElementType
Resulting element type.
Definition: SVecSVecMultExpr.h:122
Header file for the Size type trait.
Evaluation of the resulting expression type of a multiplication.Via this type trait it is possible to...
Definition: MultExprTrait.h:137
#define BLAZE_CONSTRAINT_MUST_BE_VECTOR_WITH_TRANSPOSE_FLAG(T, TF)
Constraint on the data type.In case the given data type T is not a dense or sparse vector type and in...
Definition: TransposeFlag.h:238
#define BLAZE_INTERNAL_ASSERT(expr, msg)
Run time assertion macro for internal checks.In case of an invalid run time expression, the program execution is terminated. The BLAZE_INTERNAL_ASSERT macro can be disabled by setting the BLAZE_USER_ASSERTION flag to zero or by defining NDEBUG during the compilation.
Definition: Assert.h:101
VT2::TransposeType TT2
Transpose type of the right-hand side sparse vector expression.
Definition: SVecSVecMultExpr.h:101
Header file for the IsExpression type trait class.
Header file for the FunctionTrace class.
BLAZE_ALWAYS_INLINE void subAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the subtraction assignment of a matrix to matrix.
Definition: Matrix.h:849