All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
SMatSMatAddExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_SMATSMATADDEXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_SMATSMATADDEXPR_H_
37 
38 
39 //*************************************************************************************************
40 // Includes
41 //*************************************************************************************************
42 
43 #include <stdexcept>
62 #include <blaze/util/Assert.h>
64 #include <blaze/util/SelectType.h>
65 #include <blaze/util/Types.h>
67 
68 
69 namespace blaze {
70 
71 //=================================================================================================
72 //
73 // CLASS SMATSMATADDEXPR
74 //
75 //=================================================================================================
76 
77 //*************************************************************************************************
84 template< typename MT1 // Type of the left-hand side sparse matrix
85  , typename MT2 > // Type of the right-hand side sparse matrix
86 class SMatSMatAddExpr : public SparseMatrix< SMatSMatAddExpr<MT1,MT2>, false >
87  , private MatMatAddExpr
88  , private Computation
89 {
90  private:
91  //**Type definitions****************************************************************************
92  typedef typename MT1::ResultType RT1;
93  typedef typename MT2::ResultType RT2;
94  typedef typename MT1::CompositeType CT1;
95  typedef typename MT2::CompositeType CT2;
96  typedef typename MT1::ReturnType RN1;
97  typedef typename MT2::ReturnType RN2;
98  //**********************************************************************************************
99 
100  //**Return type evaluation**********************************************************************
102 
107  enum { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
108 
111  //**********************************************************************************************
112 
113  public:
114  //**Type definitions****************************************************************************
120 
123 
125  typedef const ResultType CompositeType;
126 
128  typedef typename SelectType< IsExpression<MT1>::value, const MT1, const MT1& >::Type LeftOperand;
129 
131  typedef typename SelectType< IsExpression<MT2>::value, const MT2, const MT2& >::Type RightOperand;
132  //**********************************************************************************************
133 
134  //**Compilation flags***************************************************************************
136  enum { smpAssignable = 0 };
137  //**********************************************************************************************
138 
139  //**Constructor*********************************************************************************
145  explicit inline SMatSMatAddExpr( const MT1& lhs, const MT2& rhs )
146  : lhs_( lhs ) // Left-hand side sparse matrix of the addition expression
147  , rhs_( rhs ) // Right-hand side sparse matrix of the addition expression
148  {
149  BLAZE_INTERNAL_ASSERT( lhs.rows() == rhs.rows() , "Invalid number of rows" );
150  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.columns(), "Invalid number of columns" );
151  }
152  //**********************************************************************************************
153 
154  //**Access operator*****************************************************************************
161  inline ReturnType operator()( size_t i, size_t j ) const {
162  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
163  BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
164  return lhs_(i,j) + rhs_(i,j);
165  }
166  //**********************************************************************************************
167 
168  //**Rows function*******************************************************************************
173  inline size_t rows() const {
174  return lhs_.rows();
175  }
176  //**********************************************************************************************
177 
178  //**Columns function****************************************************************************
183  inline size_t columns() const {
184  return lhs_.columns();
185  }
186  //**********************************************************************************************
187 
188  //**NonZeros function***************************************************************************
193  inline size_t nonZeros() const {
194  return lhs_.nonZeros() + rhs_.nonZeros();
195  }
196  //**********************************************************************************************
197 
198  //**NonZeros function***************************************************************************
204  inline size_t nonZeros( size_t i ) const {
205  return lhs_.nonZeros(i) + rhs_.nonZeros(i);
206  }
207  //**********************************************************************************************
208 
209  //**Left operand access*************************************************************************
214  inline LeftOperand leftOperand() const {
215  return lhs_;
216  }
217  //**********************************************************************************************
218 
219  //**Right operand access************************************************************************
224  inline RightOperand rightOperand() const {
225  return rhs_;
226  }
227  //**********************************************************************************************
228 
229  //**********************************************************************************************
235  template< typename T >
236  inline bool canAlias( const T* alias ) const {
237  return ( lhs_.canAlias( alias ) || rhs_.canAlias( alias ) );
238  }
239  //**********************************************************************************************
240 
241  //**********************************************************************************************
247  template< typename T >
248  inline bool isAliased( const T* alias ) const {
249  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
250  }
251  //**********************************************************************************************
252 
253  private:
254  //**Member variables****************************************************************************
257  //**********************************************************************************************
258 
259  //**Assignment to dense matrices****************************************************************
271  template< typename MT // Type of the target dense matrix
272  , bool SO > // Storage order of the target dense matrix
273  friend inline void assign( DenseMatrix<MT,SO>& lhs, const SMatSMatAddExpr& rhs )
274  {
276 
277  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
278  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
279 
280  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
281 
282  assign( ~lhs, rhs.lhs_ );
283 
285  addAssign( ~lhs, rhs.rhs_ );
286  }
287  else
288  {
289  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
290 
291  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
292  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
293  BLAZE_INTERNAL_ASSERT( B.rows() == (~lhs).rows() , "Invalid number of rows" );
294  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
295 
296  for( size_t i=0UL; i<(~lhs).rows(); ++i ) {
297  const RightIterator end( B.end(i) );
298  for( RightIterator element=B.begin(i); element!=end; ++element ) {
299  if( isDefault( (~lhs)(i,element->index()) ) )
300  (~lhs)(i,element->index()) = element->value();
301  else
302  (~lhs)(i,element->index()) += element->value();
303  }
304  }
305  }
306  }
308  //**********************************************************************************************
309 
310  //**Assignment to row-major sparse matrices*****************************************************
322  template< typename MT > // Type of the target sparse matrix
323  friend inline void assign( SparseMatrix<MT,false>& lhs, const SMatSMatAddExpr& rhs )
324  {
326 
327  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
328  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
329 
330  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
331  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
332 
333  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
334  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
335 
336  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
337  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
338  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
339  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
340  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
341  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
342 
343  // Final memory allocation (based on the evaluated operands)
344  (~lhs).reserve( A.nonZeros() + B.nonZeros() );
345 
346  // Performing the matrix addition
347  for( size_t i=0UL; i<(~lhs).rows(); ++i )
348  {
349  const LeftIterator lend( A.end(i) );
350  const RightIterator rend( B.end(i) );
351 
352  LeftIterator l( A.begin(i) );
353  RightIterator r( B.begin(i) );
354 
355  while( l != lend && r != rend )
356  {
357  if( l->index() < r->index() ) {
358  (~lhs).append( i, l->index(), l->value() );
359  ++l;
360  }
361  else if( l->index() > r->index() ) {
362  (~lhs).append( i, r->index(), r->value() );
363  ++r;
364  }
365  else {
366  (~lhs).append( i, l->index(), l->value()+r->value() );
367  ++l;
368  ++r;
369  }
370  }
371 
372  while( l != lend ) {
373  (~lhs).append( i, l->index(), l->value() );
374  ++l;
375  }
376 
377  while( r != rend ) {
378  (~lhs).append( i, r->index(), r->value() );
379  ++r;
380  }
381 
382  (~lhs).finalize( i );
383  }
384  }
386  //**********************************************************************************************
387 
388  //**Assignment to column-major sparse matrices**************************************************
400  template< typename MT > // Type of the target sparse matrix
401  friend inline void assign( SparseMatrix<MT,true>& lhs, const SMatSMatAddExpr& rhs )
402  {
404 
405  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
406  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
407 
408  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
409  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
410 
411  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
412  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
413 
414  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
415  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
416  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
417  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
418  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
419  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
420 
421  const size_t m( rhs.rows() );
422  const size_t n( rhs.columns() );
423 
424  // Counting the number of elements per column
425  std::vector<size_t> nonzeros( n, 0UL );
426  for( size_t i=0UL; i<m; ++i )
427  {
428  const LeftIterator lend( A.end(i) );
429  const RightIterator rend( B.end(i) );
430 
431  LeftIterator l( A.begin(i) );
432  RightIterator r( B.begin(i) );
433 
434  while( l != lend && r != rend )
435  {
436  if( l->index() < r->index() ) {
437  ++nonzeros[l->index()];
438  ++l;
439  }
440  else if( l->index() > r->index() ) {
441  ++nonzeros[r->index()];
442  ++r;
443  }
444  else {
445  ++nonzeros[l->index()];
446  ++l;
447  ++r;
448  }
449  }
450 
451  while( l != lend ) {
452  ++nonzeros[l->index()];
453  ++l;
454  }
455 
456  while( r != rend ) {
457  ++nonzeros[r->index()];
458  ++r;
459  }
460  }
461 
462  // Resizing the left-hand side sparse matrix
463  for( size_t j=0UL; j<n; ++j ) {
464  (~lhs).reserve( j, nonzeros[j] );
465  }
466 
467  // Performing the matrix addition
468  for( size_t i=0UL; i<m; ++i )
469  {
470  const LeftIterator lend( A.end(i) );
471  const RightIterator rend( B.end(i) );
472 
473  LeftIterator l( A.begin(i) );
474  RightIterator r( B.begin(i) );
475 
476  while( l != lend && r != rend )
477  {
478  if( l->index() < r->index() ) {
479  (~lhs).append( i, l->index(), l->value() );
480  ++l;
481  }
482  else if( l->index() > r->index() ) {
483  (~lhs).append( i, r->index(), r->value() );
484  ++r;
485  }
486  else {
487  (~lhs).append( i, l->index(), l->value()+r->value() );
488  ++l;
489  ++r;
490  }
491  }
492 
493  while( l != lend ) {
494  (~lhs).append( i, l->index(), l->value() );
495  ++l;
496  }
497 
498  while( r != rend ) {
499  (~lhs).append( i, r->index(), r->value() );
500  ++r;
501  }
502  }
503  }
505  //**********************************************************************************************
506 
507  //**Addition assignment to dense matrices*******************************************************
519  template< typename MT // Type of the target dense matrix
520  , bool SO > // Storage order of the target dense matrix
521  friend inline void addAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatAddExpr& rhs )
522  {
524 
525  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
526  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
527 
528  smpAddAssign( ~lhs, rhs.lhs_ );
529  smpAddAssign( ~lhs, rhs.rhs_ );
530  }
532  //**********************************************************************************************
533 
534  //**Addition assignment to sparse matrices******************************************************
535  // No special implementation for the addition assignment to sparse matrices.
536  //**********************************************************************************************
537 
538  //**Subtraction assignment to dense matrices****************************************************
550  template< typename MT // Type of the target dense matrix
551  , bool SO > // Storage order of the target dense matrix
552  friend inline void subAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatAddExpr& rhs )
553  {
555 
556  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
557  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
558 
559  smpSubAssign( ~lhs, rhs.lhs_ );
560  smpSubAssign( ~lhs, rhs.rhs_ );
561  }
563  //**********************************************************************************************
564 
565  //**Subtraction assignment to sparse matrices***************************************************
566  // No special implementation for the subtraction assignment to sparse matrices.
567  //**********************************************************************************************
568 
569  //**Multiplication assignment to dense matrices*************************************************
570  // No special implementation for the multiplication assignment to dense matrices.
571  //**********************************************************************************************
572 
573  //**Multiplication assignment to sparse matrices************************************************
574  // No special implementation for the multiplication assignment to sparse matrices.
575  //**********************************************************************************************
576 
577  //**Compile time checks*************************************************************************
584  //**********************************************************************************************
585 };
586 //*************************************************************************************************
587 
588 
589 
590 
591 //=================================================================================================
592 //
593 // GLOBAL BINARY ARITHMETIC OPERATORS
594 //
595 //=================================================================================================
596 
597 //*************************************************************************************************
623 template< typename T1 // Type of the left-hand side sparse matrix
624  , typename T2 > // Type of the right-hand side sparse matrix
625 inline const SMatSMatAddExpr<T1,T2>
627 {
629 
630  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() )
631  throw std::invalid_argument( "Matrix sizes do not match" );
632 
633  return SMatSMatAddExpr<T1,T2>( ~lhs, ~rhs );
634 }
635 //*************************************************************************************************
636 
637 
638 
639 
640 //=================================================================================================
641 //
642 // EXPRESSION TRAIT SPECIALIZATIONS
643 //
644 //=================================================================================================
645 
646 //*************************************************************************************************
648 template< typename MT1, typename MT2, bool AF >
649 struct SubmatrixExprTrait< SMatSMatAddExpr<MT1,MT2>, AF >
650 {
651  public:
652  //**********************************************************************************************
653  typedef typename AddExprTrait< typename SubmatrixExprTrait<const MT1,AF>::Type
654  , typename SubmatrixExprTrait<const MT2,AF>::Type >::Type Type;
655  //**********************************************************************************************
656 };
658 //*************************************************************************************************
659 
660 
661 //*************************************************************************************************
663 template< typename MT1, typename MT2 >
664 struct RowExprTrait< SMatSMatAddExpr<MT1,MT2> >
665 {
666  public:
667  //**********************************************************************************************
668  typedef typename AddExprTrait< typename RowExprTrait<const MT1>::Type
669  , typename RowExprTrait<const MT2>::Type >::Type Type;
670  //**********************************************************************************************
671 };
673 //*************************************************************************************************
674 
675 
676 //*************************************************************************************************
678 template< typename MT1, typename MT2 >
679 struct ColumnExprTrait< SMatSMatAddExpr<MT1,MT2> >
680 {
681  public:
682  //**********************************************************************************************
683  typedef typename AddExprTrait< typename ColumnExprTrait<const MT1>::Type
684  , typename ColumnExprTrait<const MT2>::Type >::Type Type;
685  //**********************************************************************************************
686 };
688 //*************************************************************************************************
689 
690 } // namespace blaze
691 
692 #endif
Evaluation of the return type of an addition expression.Via this type trait it is possible to evaluat...
Definition: AddExprTrait.h:103
Compile time check whether the given type is a temporary vector or matrix type.This type trait class ...
Definition: IsTemporary.h:87
RightOperand rhs_
Right-hand side sparse matrix of the addition expression.
Definition: SMatSMatAddExpr.h:256
LeftOperand leftOperand() const
Returns the left-hand side sparse matrix operand.
Definition: SMatSMatAddExpr.h:214
void smpSubAssign(DenseMatrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the SMP subtraction assignment of a matrix to dense matrix.
Definition: DenseMatrix.h:151
RightOperand rightOperand() const
Returns the right-hand side sparse matrix operand.
Definition: SMatSMatAddExpr.h:224
bool isDefault(const DynamicMatrix< Type, SO > &m)
Returns whether the given dense matrix is in default state.
Definition: DynamicMatrix.h:4622
Efficient implementation of a compressed matrix.The CompressedMatrix class template is the represent...
Definition: CompressedMatrix.h:197
Header file for the ColumnExprTrait class template.
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: SMatSMatAddExpr.h:193
const This & CompositeType
Data type for composite expression templates.
Definition: CompressedMatrix.h:2384
Type ElementType
Type of the sparse matrix elements.
Definition: CompressedMatrix.h:249
Header file for the AddExprTrait class template.
Header file for the Computation base class.
size_t columns() const
Returns the current number of columns of the matrix.
Definition: SMatSMatAddExpr.h:183
SelectType< IsExpression< MT1 >::value, const MT1, const MT1 & >::Type LeftOperand
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:128
Header file for the RequiresEvaluation type trait.
size_t rows() const
Returns the current number of rows of the matrix.
Definition: SMatSMatAddExpr.h:173
const ResultType CompositeType
Data type for composite expression templates.
Definition: SMatSMatAddExpr.h:125
Base class for dense matrices.The DenseMatrix class is a base class for all dense matrix classes...
Definition: DenseMatrix.h:70
Base class for sparse matrices.The SparseMatrix class is a base class for all sparse matrix classes...
Definition: Forward.h:104
Header file for the SparseMatrix base class.
Constraint on the data type.
void smpAddAssign(DenseMatrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the SMP addition assignment of a matrix to a dense matrix.
Definition: DenseMatrix.h:121
Compile time type selection.The SelectType class template selects one of the two given types T1 and T...
Definition: SelectType.h:59
size_t nonZeros(size_t i) const
Returns the number of non-zero elements in the specified row.
Definition: SMatSMatAddExpr.h:204
Header file for the IsTemporary type trait class.
bool isAliased(const T *alias) const
Returns whether the expression is aliased with the given address alias.
Definition: SMatSMatAddExpr.h:248
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: SMatSMatAddExpr.h:161
const SelectType< returnExpr, ExprReturnType, ElementType >::Type ReturnType
Return type for expression template evaluations.
Definition: SMatSMatAddExpr.h:122
MT1::ResultType RT1
Result type of the left-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:92
ResultType::TransposeType TransposeType
Transpose type for expression template evaluations.
Definition: SMatSMatAddExpr.h:118
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2388
Header file for the dense matrix SMP implementation.
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:179
const DenseIterator< Type > operator+(const DenseIterator< Type > &it, ptrdiff_t inc)
Addition between a DenseIterator and an integral value.
Definition: DenseIterator.h:556
Constraints on the storage order of matrix types.
ResultType::OppositeType OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: SMatSMatAddExpr.h:117
MT2::CompositeType CT2
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:95
Header file for the SelectType class template.
Header file for the RowExprTrait class template.
Header file for all forward declarations for expression class templates.
MT2::ResultType RT2
Result type of the right-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:93
MT1::CompositeType CT1
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:94
Compile time check for resizable data types.This type trait tests whether the given data type is a re...
Definition: IsResizable.h:75
Header file for the SubmatrixExprTrait class template.
#define BLAZE_CONSTRAINT_MUST_BE_ROW_MAJOR_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a row-major dense or sparse matrix t...
Definition: StorageOrder.h:81
const Type & ReturnType
Return type for expression template evaluations.
Definition: CompressedMatrix.h:2383
Removal of reference modifiers.The RemoveCV type trait removes any reference modifiers from the given...
Definition: RemoveReference.h:69
MT2::ReturnType RN2
Return type of the right-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:97
Header file for run time assertion macros.
Base template for the AddTrait class.
Definition: AddTrait.h:141
Header file for the addition trait.
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:209
MT1::ReturnType RN1
Return type of the left-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:96
AddExprTrait< RN1, RN2 >::Type ExprReturnType
Expression return type for the subscript operator.
Definition: SMatSMatAddExpr.h:110
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:239
AddTrait< RT1, RT2 >::Type ResultType
Result type for expression template evaluations.
Definition: SMatSMatAddExpr.h:116
Header file for the isDefault shim.
Header file for the MatMatAddExpr base class.
Header file for the RemoveReference type trait.
ResultType::ElementType ElementType
Resulting element type.
Definition: SMatSMatAddExpr.h:119
bool canAlias(const T *alias) const
Returns whether the expression can alias with the given address alias.
Definition: SMatSMatAddExpr.h:236
SelectType< IsExpression< MT2 >::value, const MT2, const MT2 & >::Type RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatAddExpr.h:131
Header file for the IsComputation type trait class.
Expression object for sparse matrix-sparse matrix additions.The SMatSMatAddExpr class represents the ...
Definition: Forward.h:93
#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:2379
SMatSMatAddExpr(const MT1 &lhs, const MT2 &rhs)
Constructor for the SMatSMatAddExpr class.
Definition: SMatSMatAddExpr.h:145
size_t columns(const Matrix< MT, SO > &m)
Returns the current number of columns of the matrix.
Definition: Matrix.h:154
Header file for basic type definitions.
SMatSMatAddExpr< MT1, MT2 > This
Type of this SMatSMatAddExpr instance.
Definition: SMatSMatAddExpr.h:115
LeftOperand lhs_
Left-hand side sparse matrix of the addition expression.
Definition: SMatSMatAddExpr.h:255
Header file for the IsResizable type trait.
size_t rows(const Matrix< MT, SO > &m)
Returns the current number of rows of the matrix.
Definition: Matrix.h:138
#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
#define BLAZE_CONSTRAINT_MUST_BE_SPARSE_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a sparse, N-dimensional matrix type...
Definition: SparseMatrix.h:79
Header file for the IsExpression type trait class.
Header file for the FunctionTrace class.