All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
SMatSMatSubExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_SMATSMATSUBEXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_SMATSMATSUBEXPR_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 SMATSMATSUBEXPR
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 SMatSMatSubExpr : public SparseMatrix< SMatSMatSubExpr<MT1,MT2>, false >
87  , private MatMatSubExpr
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::ReturnType RN1;
95  typedef typename MT2::ReturnType RN2;
96  typedef typename MT1::CompositeType CT1;
97  typedef typename MT2::CompositeType CT2;
98  //**********************************************************************************************
99 
100  //**Return type evaluation**********************************************************************
102 
107  enum { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
108 
111  //**********************************************************************************************
112 
113  //**Parallel evaluation strategy****************************************************************
115 
120  template< typename MT >
121  struct UseSMPAssign {
122  enum { value = MT::smpAssignable };
123  };
125  //**********************************************************************************************
126 
127  public:
128  //**Type definitions****************************************************************************
134 
137 
139  typedef const ResultType CompositeType;
140 
142  typedef typename SelectType< IsExpression<MT1>::value, const MT1, const MT1& >::Type LeftOperand;
143 
145  typedef typename SelectType< IsExpression<MT2>::value, const MT2, const MT2& >::Type RightOperand;
146  //**********************************************************************************************
147 
148  //**Compilation flags***************************************************************************
150  enum { smpAssignable = 0 };
151  //**********************************************************************************************
152 
153  //**Constructor*********************************************************************************
159  explicit inline SMatSMatSubExpr( const MT1& lhs, const MT2& rhs )
160  : lhs_( lhs ) // Left-hand side sparse matrix of the subtraction expression
161  , rhs_( rhs ) // Right-hand side sparse matrix of the subtraction expression
162  {
163  BLAZE_INTERNAL_ASSERT( lhs.rows() == rhs.rows() , "Invalid number of rows" );
164  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.columns(), "Invalid number of columns" );
165  }
166  //**********************************************************************************************
167 
168  //**Access operator*****************************************************************************
175  inline ReturnType operator()( size_t i, size_t j ) const {
176  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
177  BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
178  return lhs_(i,j) - rhs_(i,j);
179  }
180  //**********************************************************************************************
181 
182  //**Rows function*******************************************************************************
187  inline size_t rows() const {
188  return lhs_.rows();
189  }
190  //**********************************************************************************************
191 
192  //**Columns function****************************************************************************
197  inline size_t columns() const {
198  return lhs_.columns();
199  }
200  //**********************************************************************************************
201 
202  //**NonZeros function***************************************************************************
207  inline size_t nonZeros() const {
208  return lhs_.nonZeros() + rhs_.nonZeros();
209  }
210  //**********************************************************************************************
211 
212  //**NonZeros function***************************************************************************
218  inline size_t nonZeros( size_t i ) const {
219  return lhs_.nonZeros(i) + rhs_.nonZeros(i);
220  }
221  //**********************************************************************************************
222 
223  //**Left operand access*************************************************************************
228  inline LeftOperand leftOperand() const {
229  return lhs_;
230  }
231  //**********************************************************************************************
232 
233  //**Right operand access************************************************************************
238  inline RightOperand rightOperand() const {
239  return rhs_;
240  }
241  //**********************************************************************************************
242 
243  //**********************************************************************************************
249  template< typename T >
250  inline bool canAlias( const T* alias ) const {
251  return ( lhs_.canAlias( alias ) || rhs_.canAlias( alias ) );
252  }
253  //**********************************************************************************************
254 
255  //**********************************************************************************************
261  template< typename T >
262  inline bool isAliased( const T* alias ) const {
263  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
264  }
265  //**********************************************************************************************
266 
267  private:
268  //**Member variables****************************************************************************
271  //**********************************************************************************************
272 
273  //**Assignment to dense matrices****************************************************************
285  template< typename MT // Type of the target dense matrix
286  , bool SO > // Storage order of the target dense matrix
287  friend inline void assign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
288  {
290 
291  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
292  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
293 
294  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
295 
296  assign( ~lhs, rhs.lhs_ );
297 
299  subAssign( ~lhs, rhs.rhs_ );
300  }
301  else
302  {
303  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
304 
305  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
306  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
307  BLAZE_INTERNAL_ASSERT( B.rows() == (~lhs).rows() , "Invalid number of rows" );
308  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
309 
310  for( size_t i=0UL; i<(~lhs).rows(); ++i ) {
311  const RightIterator end( B.end(i) );
312  for( RightIterator element=B.begin(i); element!=end; ++element ) {
313  if( isDefault( (~lhs)(i,element->index()) ) )
314  (~lhs)(i,element->index()) = -element->value();
315  else
316  (~lhs)(i,element->index()) -= element->value();
317  }
318  }
319  }
320  }
322  //**********************************************************************************************
323 
324  //**Assignment to row-major sparse matrices*****************************************************
336  template< typename MT > // Type of the target sparse matrix
337  friend inline void assign( SparseMatrix<MT,false>& lhs, const SMatSMatSubExpr& rhs )
338  {
340 
341  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
342  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
343 
344  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
345  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
346 
347  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse matrix operand
348  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
349 
350  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
351  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
352  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
353  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
354  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
355  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
356 
357  // Final memory allocation (based on the evaluated operands)
358  (~lhs).reserve( A.nonZeros() + B.nonZeros() );
359 
360  // Performing the matrix subtraction
361  for( size_t i=0UL; i<(~lhs).rows(); ++i )
362  {
363  const LeftIterator lend( A.end(i) );
364  const RightIterator rend( B.end(i) );
365 
366  LeftIterator l( A.begin(i) );
367  RightIterator r( B.begin(i) );
368 
369  while( l != lend && r != rend )
370  {
371  if( l->index() < r->index() ) {
372  (~lhs).append( i, l->index(), l->value() );
373  ++l;
374  }
375  else if( l->index() > r->index() ) {
376  (~lhs).append( i, r->index(), -r->value() );
377  ++r;
378  }
379  else {
380  (~lhs).append( i, l->index(), l->value()-r->value() );
381  ++l;
382  ++r;
383  }
384  }
385 
386  while( l != lend ) {
387  (~lhs).append( i, l->index(), l->value() );
388  ++l;
389  }
390 
391  while( r != rend ) {
392  (~lhs).append( i, r->index(), -r->value() );
393  ++r;
394  }
395 
396  (~lhs).finalize( i );
397  }
398  }
400  //**********************************************************************************************
401 
402  //**Assignment to column-major sparse matrices**************************************************
414  template< typename MT > // Type of the target sparse matrix
415  friend inline void assign( SparseMatrix<MT,true>& lhs, const SMatSMatSubExpr& rhs )
416  {
418 
419  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
420  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
421 
422  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
423  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
424 
425  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse matrix operand
426  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
427 
428  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
429  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
430  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
431  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
432  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
433  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
434 
435  const size_t m( rhs.rows() );
436  const size_t n( rhs.columns() );
437 
438  // Counting the number of elements per column
439  std::vector<size_t> nonzeros( n, 0UL );
440  for( size_t i=0UL; i<m; ++i )
441  {
442  const LeftIterator lend( A.end(i) );
443  const RightIterator rend( B.end(i) );
444 
445  LeftIterator l( A.begin(i) );
446  RightIterator r( B.begin(i) );
447 
448  while( l != lend && r != rend )
449  {
450  if( l->index() < r->index() ) {
451  ++nonzeros[l->index()];
452  ++l;
453  }
454  else if( l->index() > r->index() ) {
455  ++nonzeros[r->index()];
456  ++r;
457  }
458  else {
459  ++nonzeros[l->index()];
460  ++l;
461  ++r;
462  }
463  }
464 
465  while( l != lend ) {
466  ++nonzeros[l->index()];
467  ++l;
468  }
469 
470  while( r != rend ) {
471  ++nonzeros[r->index()];
472  ++r;
473  }
474  }
475 
476  // Resizing the left-hand side sparse matrix
477  for( size_t j=0UL; j<n; ++j ) {
478  (~lhs).reserve( j, nonzeros[j] );
479  }
480 
481  // Performing the matrix subtraction
482  for( size_t i=0UL; i<m; ++i )
483  {
484  const LeftIterator lend( A.end(i) );
485  const RightIterator rend( B.end(i) );
486 
487  LeftIterator l( A.begin(i) );
488  RightIterator r( B.begin(i) );
489 
490  while( l != lend && r != rend )
491  {
492  if( l->index() < r->index() ) {
493  (~lhs).append( i, l->index(), l->value() );
494  ++l;
495  }
496  else if( l->index() > r->index() ) {
497  (~lhs).append( i, r->index(), -r->value() );
498  ++r;
499  }
500  else {
501  (~lhs).append( i, l->index(), l->value()-r->value() );
502  ++l;
503  ++r;
504  }
505  }
506 
507  while( l != lend ) {
508  (~lhs).append( i, l->index(), l->value() );
509  ++l;
510  }
511 
512  while( r != rend ) {
513  (~lhs).append( i, r->index(), -r->value() );
514  ++r;
515  }
516  }
517  }
519  //**********************************************************************************************
520 
521  //**Addition assignment to dense matrices*******************************************************
533  template< typename MT // Type of the target dense matrix
534  , bool SO > // Storage order of the target dense matrix
535  friend inline void addAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
536  {
538 
539  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
540  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
541 
542  addAssign( ~lhs, rhs.lhs_ );
543  subAssign( ~lhs, rhs.rhs_ );
544  }
546  //**********************************************************************************************
547 
548  //**Addition assignment to sparse matrices******************************************************
549  // No special implementation for the addition assignment to sparse matrices.
550  //**********************************************************************************************
551 
552  //**Subtraction assignment to dense matrices****************************************************
564  template< typename MT // Type of the target dense matrix
565  , bool SO > // Storage order of the target dense matrix
566  friend inline void subAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
567  {
569 
570  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
571  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
572 
573  subAssign( ~lhs, rhs.lhs_ );
574  addAssign( ~lhs, rhs.rhs_ );
575  }
577  //**********************************************************************************************
578 
579  //**Subtraction assignment to sparse matrices***************************************************
580  // No special implementation for the subtraction assignment to sparse matrices.
581  //**********************************************************************************************
582 
583  //**Multiplication assignment to dense matrices*************************************************
584  // No special implementation for the multiplication assignment to dense matrices.
585  //**********************************************************************************************
586 
587  //**Multiplication assignment to sparse matrices************************************************
588  // No special implementation for the multiplication assignment to sparse matrices.
589  //**********************************************************************************************
590 
591  //**SMP assignment to dense matrices************************************************************
592  // No special implementation for the SMP assignment to dense matrices.
593  //**********************************************************************************************
594 
595  //**SMP assignment to sparse matrices***********************************************************
596  // No special implementation for the SMP assignment to sparse matrices.
597  //**********************************************************************************************
598 
599  //**SMP addition assignment to dense matrices***************************************************
613  template< typename MT // Type of the target dense matrix
614  , bool SO > // Storage order of the target dense matrix
615  friend inline typename EnableIf< UseSMPAssign<MT> >::Type
616  smpAddAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
617  {
619 
620  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
621  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
622 
623  smpAddAssign( ~lhs, rhs.lhs_ );
624  smpSubAssign( ~lhs, rhs.rhs_ );
625  }
627  //**********************************************************************************************
628 
629  //**SMP addition assignment to sparse matrices**************************************************
630  // No special implementation for the SMP addition assignment to sparse matrices.
631  //**********************************************************************************************
632 
633  //**SMP subtraction assignment to dense matrices************************************************
648  template< typename MT // Type of the target dense matrix
649  , bool SO > // Storage order of the target dense matrix
650  friend inline typename EnableIf< UseSMPAssign<MT> >::Type
651  smpSubAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
652  {
654 
655  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
656  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
657 
658  smpSubAssign( ~lhs, rhs.lhs_ );
659  smpAddAssign( ~lhs, rhs.rhs_ );
660  }
662  //**********************************************************************************************
663 
664  //**SMP subtraction assignment to sparse matrices***********************************************
665  // No special implementation for the SMP subtraction assignment to sparse matrices.
666  //**********************************************************************************************
667 
668  //**SMP multiplication assignment to dense matrices*********************************************
669  // No special implementation for the SMP multiplication assignment to dense matrices.
670  //**********************************************************************************************
671 
672  //**SMP multiplication assignment to sparse matrices********************************************
673  // No special implementation for the SMP multiplication assignment to sparse matrices.
674  //**********************************************************************************************
675 
676  //**Compile time checks*************************************************************************
683  //**********************************************************************************************
684 };
685 //*************************************************************************************************
686 
687 
688 
689 
690 //=================================================================================================
691 //
692 // GLOBAL BINARY ARITHMETIC OPERATORS
693 //
694 //=================================================================================================
695 
696 //*************************************************************************************************
722 template< typename T1 // Type of the left-hand side sparse matrix
723  , typename T2 > // Type of the right-hand side sparse matrix
724 inline const SMatSMatSubExpr<T1,T2>
726 {
728 
729  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() )
730  throw std::invalid_argument( "Matrix sizes do not match" );
731 
732  return SMatSMatSubExpr<T1,T2>( ~lhs, ~rhs );
733 }
734 //*************************************************************************************************
735 
736 
737 
738 
739 //=================================================================================================
740 //
741 // EXPRESSION TRAIT SPECIALIZATIONS
742 //
743 //=================================================================================================
744 
745 //*************************************************************************************************
747 template< typename MT1, typename MT2, bool AF >
748 struct SubmatrixExprTrait< SMatSMatSubExpr<MT1,MT2>, AF >
749 {
750  public:
751  //**********************************************************************************************
752  typedef typename SubExprTrait< typename SubmatrixExprTrait<const MT1,AF>::Type
753  , typename SubmatrixExprTrait<const MT2,AF>::Type >::Type Type;
754  //**********************************************************************************************
755 };
757 //*************************************************************************************************
758 
759 
760 //*************************************************************************************************
762 template< typename MT1, typename MT2 >
763 struct RowExprTrait< SMatSMatSubExpr<MT1,MT2> >
764 {
765  public:
766  //**********************************************************************************************
767  typedef typename SubExprTrait< typename RowExprTrait<const MT1>::Type
768  , typename RowExprTrait<const MT2>::Type >::Type Type;
769  //**********************************************************************************************
770 };
772 //*************************************************************************************************
773 
774 
775 //*************************************************************************************************
777 template< typename MT1, typename MT2 >
778 struct ColumnExprTrait< SMatSMatSubExpr<MT1,MT2> >
779 {
780  public:
781  //**********************************************************************************************
782  typedef typename SubExprTrait< typename ColumnExprTrait<const MT1>::Type
783  , typename ColumnExprTrait<const MT2>::Type >::Type Type;
784  //**********************************************************************************************
785 };
787 //*************************************************************************************************
788 
789 } // namespace blaze
790 
791 #endif
MT2::CompositeType CT2
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:97
Compile time check whether the given type is a temporary vector or matrix type.This type trait class ...
Definition: IsTemporary.h:87
Header file for the subtraction trait.
size_t nonZeros(size_t i) const
Returns the number of non-zero elements in the specified row.
Definition: SMatSMatSubExpr.h:218
LeftOperand leftOperand() const
Returns the left-hand side sparse matrix operand.
Definition: SMatSMatSubExpr.h:228
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:152
bool canAlias(const T *alias) const
Returns whether the expression can alias with the given address alias.
Definition: SMatSMatSubExpr.h:250
bool isDefault(const DynamicMatrix< Type, SO > &m)
Returns whether the given dense matrix is in default state.
Definition: DynamicMatrix.h:4642
Efficient implementation of a compressed matrix.The CompressedMatrix class template is the represent...
Definition: CompressedMatrix.h:199
Header file for the ColumnExprTrait class template.
MT2::ReturnType RN2
ReturnType type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:95
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: SMatSMatSubExpr.h:207
SelectType< IsExpression< MT1 >::value, const MT1, const MT1 & >::Type LeftOperand
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:142
const This & CompositeType
Data type for composite expression templates.
Definition: CompressedMatrix.h:2408
Type ElementType
Type of the sparse matrix elements.
Definition: CompressedMatrix.h:251
SMatSMatSubExpr< MT1, MT2 > This
Type of this SMatSMatSubExpr instance.
Definition: SMatSMatSubExpr.h:129
const SelectType< returnExpr, ExprReturnType, ElementType >::Type ReturnType
Return type for expression template evaluations.
Definition: SMatSMatSubExpr.h:136
ResultType::OppositeType OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: SMatSMatSubExpr.h:131
const DMatSerialExpr< MT, SO > serial(const DenseMatrix< MT, SO > &dm)
Forces the serial evaluation of the given dense matrix expression dm.
Definition: DMatSerialExpr.h:690
ResultType::ElementType ElementType
Resulting element type.
Definition: SMatSMatSubExpr.h:133
Header file for the Computation base class.
Header file for the RequiresEvaluation type trait.
size_t columns() const
Returns the current number of columns of the matrix.
Definition: SMatSMatSubExpr.h:197
const ResultType CompositeType
Data type for composite expression templates.
Definition: SMatSMatSubExpr.h:139
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:107
MT1::ReturnType RN1
ReturnType type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:94
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:122
RightOperand rightOperand() const
Returns the right-hand side sparse matrix operand.
Definition: SMatSMatSubExpr.h:238
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.
SubTrait< RT1, RT2 >::Type ResultType
Result type for expression template evaluations.
Definition: SMatSMatSubExpr.h:130
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: SMatSMatSubExpr.h:175
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2412
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:271
Header file for the MatMatSubExpr base class.
LeftOperand lhs_
Left-hand side sparse matrix of the subtraction expression.
Definition: SMatSMatSubExpr.h:269
MT1::CompositeType CT1
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:96
Constraints on the storage order of matrix types.
Evaluation of the return type of a subtraction expression.Via this type trait it is possible to evalu...
Definition: SubExprTrait.h:103
Header file for the SelectType class template.
Header file for the RowExprTrait class template.
Header file for all forward declarations for expression class templates.
bool isAliased(const T *alias) const
Returns whether the expression is aliased with the given address alias.
Definition: SMatSMatSubExpr.h:262
Header file for the serial shim.
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:2407
Removal of reference modifiers.The RemoveCV type trait removes any reference modifiers from the given...
Definition: RemoveReference.h:69
RightOperand rhs_
Right-hand side sparse matrix of the subtraction expression.
Definition: SMatSMatSubExpr.h:270
Header file for run time assertion macros.
Expression object for sparse matrix-sparse matrix subtractions.The SMatSMatSubExpr class represents t...
Definition: Forward.h:98
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:301
const DenseIterator< Type > operator-(const DenseIterator< Type > &it, ptrdiff_t inc)
Subtraction between a DenseIterator and an integral value.
Definition: DenseIterator.h:585
SubExprTrait< RN1, RN2 >::Type ExprReturnType
Expression return type for the subscript operator.
Definition: SMatSMatSubExpr.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:331
Header file for the isDefault shim.
MT2::ResultType RT2
Result type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:93
SelectType< IsExpression< MT2 >::value, const MT2, const MT2 & >::Type RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:145
ResultType::TransposeType TransposeType
Transpose type for expression template evaluations.
Definition: SMatSMatSubExpr.h:132
Header file for the RemoveReference type trait.
Header file for the IsComputation type trait class.
size_t rows() const
Returns the current number of rows of the matrix.
Definition: SMatSMatSubExpr.h:187
#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:2403
size_t columns(const Matrix< MT, SO > &m)
Returns the current number of columns of the matrix.
Definition: Matrix.h:170
MT1::ResultType RT1
Result type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:92
Header file for basic type definitions.
Base template for the SubTrait class.
Definition: SubTrait.h:141
Header file for the IsResizable type trait.
Header file for the SubExprTrait class template.
SMatSMatSubExpr(const MT1 &lhs, const MT2 &rhs)
Constructor for the SMatSMatSubExpr class.
Definition: SMatSMatSubExpr.h:159
size_t rows(const Matrix< MT, SO > &m)
Returns the current number of rows of the matrix.
Definition: Matrix.h:154
#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.