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>
61 #include <blaze/util/Assert.h>
63 #include <blaze/util/SelectType.h>
64 #include <blaze/util/Types.h>
66 
67 
68 namespace blaze {
69 
70 //=================================================================================================
71 //
72 // CLASS SMATSMATSUBEXPR
73 //
74 //=================================================================================================
75 
76 //*************************************************************************************************
83 template< typename MT1 // Type of the left-hand side sparse matrix
84  , typename MT2 > // Type of the right-hand side sparse matrix
85 class SMatSMatSubExpr : public SparseMatrix< SMatSMatSubExpr<MT1,MT2>, false >
86  , private MatMatSubExpr
87  , private Computation
88 {
89  private:
90  //**Type definitions****************************************************************************
91  typedef typename MT1::ResultType RT1;
92  typedef typename MT2::ResultType RT2;
93  typedef typename MT1::ReturnType RN1;
94  typedef typename MT2::ReturnType RN2;
95  typedef typename MT1::CompositeType CT1;
96  typedef typename MT2::CompositeType CT2;
97  //**********************************************************************************************
98 
99  //**Return type evaluation**********************************************************************
101 
106  enum { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
107 
110  //**********************************************************************************************
111 
112  public:
113  //**Type definitions****************************************************************************
119 
122 
124  typedef const ResultType CompositeType;
125 
127  typedef typename SelectType< IsExpression<MT1>::value, const MT1, const MT1& >::Type LeftOperand;
128 
130  typedef typename SelectType< IsExpression<MT2>::value, const MT2, const MT2& >::Type RightOperand;
131  //**********************************************************************************************
132 
133  //**Constructor*********************************************************************************
139  explicit inline SMatSMatSubExpr( const MT1& lhs, const MT2& rhs )
140  : lhs_( lhs ) // Left-hand side sparse matrix of the subtraction expression
141  , rhs_( rhs ) // Right-hand side sparse matrix of the subtraction expression
142  {
143  BLAZE_INTERNAL_ASSERT( lhs.rows() == rhs.rows() , "Invalid number of rows" );
144  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.columns(), "Invalid number of columns" );
145  }
146  //**********************************************************************************************
147 
148  //**Access operator*****************************************************************************
155  inline ReturnType operator()( size_t i, size_t j ) const {
156  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
157  BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
158  return lhs_(i,j) - rhs_(i,j);
159  }
160  //**********************************************************************************************
161 
162  //**Rows function*******************************************************************************
167  inline size_t rows() const {
168  return lhs_.rows();
169  }
170  //**********************************************************************************************
171 
172  //**Columns function****************************************************************************
177  inline size_t columns() const {
178  return lhs_.columns();
179  }
180  //**********************************************************************************************
181 
182  //**NonZeros function***************************************************************************
187  inline size_t nonZeros() const {
188  return lhs_.nonZeros() + rhs_.nonZeros();
189  }
190  //**********************************************************************************************
191 
192  //**NonZeros function***************************************************************************
198  inline size_t nonZeros( size_t i ) const {
199  return lhs_.nonZeros(i) + rhs_.nonZeros(i);
200  }
201  //**********************************************************************************************
202 
203  //**Left operand access*************************************************************************
208  inline LeftOperand leftOperand() const {
209  return lhs_;
210  }
211  //**********************************************************************************************
212 
213  //**Right operand access************************************************************************
218  inline RightOperand rightOperand() const {
219  return rhs_;
220  }
221  //**********************************************************************************************
222 
223  //**********************************************************************************************
229  template< typename T >
230  inline bool canAlias( const T* alias ) const {
231  return ( lhs_.canAlias( alias ) || rhs_.canAlias( alias ) );
232  }
233  //**********************************************************************************************
234 
235  //**********************************************************************************************
241  template< typename T >
242  inline bool isAliased( const T* alias ) const {
243  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
244  }
245  //**********************************************************************************************
246 
247  private:
248  //**Member variables****************************************************************************
251  //**********************************************************************************************
252 
253  //**Assignment to dense matrices****************************************************************
265  template< typename MT // Type of the target dense matrix
266  , bool SO > // Storage order of the target dense matrix
267  friend inline void assign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
268  {
270 
271  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
272  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
273 
274  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
275 
276  assign( ~lhs, rhs.lhs_ );
277 
279  subAssign( ~lhs, rhs.rhs_ );
280  }
281  else
282  {
283  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
284 
285  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
286  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
287  BLAZE_INTERNAL_ASSERT( B.rows() == (~lhs).rows() , "Invalid number of rows" );
288  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
289 
290  for( size_t i=0UL; i<(~lhs).rows(); ++i ) {
291  const RightIterator end( B.end(i) );
292  for( RightIterator element=B.begin(i); element!=end; ++element ) {
293  if( isDefault( (~lhs)(i,element->index()) ) )
294  (~lhs)(i,element->index()) = -element->value();
295  else
296  (~lhs)(i,element->index()) -= element->value();
297  }
298  }
299  }
300  }
302  //**********************************************************************************************
303 
304  //**Assignment to row-major sparse matrices*****************************************************
316  template< typename MT > // Type of the target sparse matrix
317  friend inline void assign( SparseMatrix<MT,false>& lhs, const SMatSMatSubExpr& rhs )
318  {
320 
321  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
322  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
323 
324  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
325  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
326 
327  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
328  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
329 
330  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
331  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
332  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
333  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
334  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
335  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
336 
337  // Final memory allocation (based on the evaluated operands)
338  (~lhs).reserve( A.nonZeros() + B.nonZeros() );
339 
340  // Performing the matrix subtraction
341  for( size_t i=0UL; i<(~lhs).rows(); ++i )
342  {
343  const LeftIterator lend( A.end(i) );
344  const RightIterator rend( B.end(i) );
345 
346  LeftIterator l( A.begin(i) );
347  RightIterator r( B.begin(i) );
348 
349  while( l != lend && r != rend )
350  {
351  if( l->index() < r->index() ) {
352  (~lhs).append( i, l->index(), l->value() );
353  ++l;
354  }
355  else if( l->index() > r->index() ) {
356  (~lhs).append( i, r->index(), -r->value() );
357  ++r;
358  }
359  else {
360  (~lhs).append( i, l->index(), l->value()-r->value() );
361  ++l;
362  ++r;
363  }
364  }
365 
366  while( l != lend ) {
367  (~lhs).append( i, l->index(), l->value() );
368  ++l;
369  }
370 
371  while( r != rend ) {
372  (~lhs).append( i, r->index(), -r->value() );
373  ++r;
374  }
375 
376  (~lhs).finalize( i );
377  }
378  }
380  //**********************************************************************************************
381 
382  //**Assignment to column-major sparse matrices**************************************************
394  template< typename MT > // Type of the target sparse matrix
395  friend inline void assign( SparseMatrix<MT,true>& lhs, const SMatSMatSubExpr& rhs )
396  {
398 
399  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
400  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
401 
402  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
403  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
404 
405  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
406  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
407 
408  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
409  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
410  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
411  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
412  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
413  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
414 
415  const size_t m( rhs.rows() );
416  const size_t n( rhs.columns() );
417 
418  // Counting the number of elements per column
419  std::vector<size_t> nonzeros( n, 0UL );
420  for( size_t i=0UL; i<m; ++i )
421  {
422  const LeftIterator lend( A.end(i) );
423  const RightIterator rend( B.end(i) );
424 
425  LeftIterator l( A.begin(i) );
426  RightIterator r( B.begin(i) );
427 
428  while( l != lend && r != rend )
429  {
430  if( l->index() < r->index() ) {
431  ++nonzeros[l->index()];
432  ++l;
433  }
434  else if( l->index() > r->index() ) {
435  ++nonzeros[r->index()];
436  ++r;
437  }
438  else {
439  ++nonzeros[l->index()];
440  ++l;
441  ++r;
442  }
443  }
444 
445  while( l != lend ) {
446  ++nonzeros[l->index()];
447  ++l;
448  }
449 
450  while( r != rend ) {
451  ++nonzeros[r->index()];
452  ++r;
453  }
454  }
455 
456  // Resizing the left-hand side sparse matrix
457  for( size_t j=0UL; j<n; ++j ) {
458  (~lhs).reserve( j, nonzeros[j] );
459  }
460 
461  // Performing the matrix subtraction
462  for( size_t i=0UL; i<m; ++i )
463  {
464  const LeftIterator lend( A.end(i) );
465  const RightIterator rend( B.end(i) );
466 
467  LeftIterator l( A.begin(i) );
468  RightIterator r( B.begin(i) );
469 
470  while( l != lend && r != rend )
471  {
472  if( l->index() < r->index() ) {
473  (~lhs).append( i, l->index(), l->value() );
474  ++l;
475  }
476  else if( l->index() > r->index() ) {
477  (~lhs).append( i, r->index(), -r->value() );
478  ++r;
479  }
480  else {
481  (~lhs).append( i, l->index(), l->value()-r->value() );
482  ++l;
483  ++r;
484  }
485  }
486 
487  while( l != lend ) {
488  (~lhs).append( i, l->index(), l->value() );
489  ++l;
490  }
491 
492  while( r != rend ) {
493  (~lhs).append( i, r->index(), -r->value() );
494  ++r;
495  }
496  }
497  }
499  //**********************************************************************************************
500 
501  //**Addition assignment to dense matrices*******************************************************
513  template< typename MT // Type of the target dense matrix
514  , bool SO > // Storage order of the target dense matrix
515  friend inline void addAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
516  {
518 
519  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
520  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
521 
522  addAssign( ~lhs, rhs.lhs_ );
523  subAssign( ~lhs, rhs.rhs_ );
524  }
526  //**********************************************************************************************
527 
528  //**Addition assignment to sparse matrices******************************************************
529  // No special implementation for the addition assignment to sparse matrices.
530  //**********************************************************************************************
531 
532  //**Subtraction assignment to dense matrices****************************************************
544  template< typename MT // Type of the target dense matrix
545  , bool SO > // Storage order of the target dense matrix
546  friend inline void subAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
547  {
549 
550  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
551  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
552 
553  subAssign( ~lhs, rhs.lhs_ );
554  addAssign( ~lhs, rhs.rhs_ );
555  }
557  //**********************************************************************************************
558 
559  //**Subtraction assignment to sparse matrices***************************************************
560  // No special implementation for the subtraction assignment to sparse matrices.
561  //**********************************************************************************************
562 
563  //**Multiplication assignment to dense matrices*************************************************
564  // No special implementation for the multiplication assignment to dense matrices.
565  //**********************************************************************************************
566 
567  //**Multiplication assignment to sparse matrices************************************************
568  // No special implementation for the multiplication assignment to sparse matrices.
569  //**********************************************************************************************
570 
571  //**Compile time checks*************************************************************************
578  //**********************************************************************************************
579 };
580 //*************************************************************************************************
581 
582 
583 
584 
585 //=================================================================================================
586 //
587 // GLOBAL BINARY ARITHMETIC OPERATORS
588 //
589 //=================================================================================================
590 
591 //*************************************************************************************************
617 template< typename T1 // Type of the left-hand side sparse matrix
618  , typename T2 > // Type of the right-hand side sparse matrix
619 inline const SMatSMatSubExpr<T1,T2>
621 {
623 
624  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() )
625  throw std::invalid_argument( "Matrix sizes do not match" );
626 
627  return SMatSMatSubExpr<T1,T2>( ~lhs, ~rhs );
628 }
629 //*************************************************************************************************
630 
631 
632 
633 
634 //=================================================================================================
635 //
636 // EXPRESSION TRAIT SPECIALIZATIONS
637 //
638 //=================================================================================================
639 
640 //*************************************************************************************************
642 template< typename MT1, typename MT2 >
643 struct SubmatrixExprTrait< SMatSMatSubExpr<MT1,MT2> >
644 {
645  public:
646  //**********************************************************************************************
647  typedef typename SubExprTrait< typename SubmatrixExprTrait<const MT1>::Type
648  , typename SubmatrixExprTrait<const MT2>::Type >::Type Type;
649  //**********************************************************************************************
650 };
652 //*************************************************************************************************
653 
654 
655 //*************************************************************************************************
657 template< typename MT1, typename MT2 >
658 struct RowExprTrait< SMatSMatSubExpr<MT1,MT2> >
659 {
660  public:
661  //**********************************************************************************************
662  typedef typename SubExprTrait< typename RowExprTrait<const MT1>::Type
663  , typename RowExprTrait<const MT2>::Type >::Type Type;
664  //**********************************************************************************************
665 };
667 //*************************************************************************************************
668 
669 
670 //*************************************************************************************************
672 template< typename MT1, typename MT2 >
673 struct ColumnExprTrait< SMatSMatSubExpr<MT1,MT2> >
674 {
675  public:
676  //**********************************************************************************************
677  typedef typename SubExprTrait< typename ColumnExprTrait<const MT1>::Type
678  , typename ColumnExprTrait<const MT2>::Type >::Type Type;
679  //**********************************************************************************************
680 };
682 //*************************************************************************************************
683 
684 } // namespace blaze
685 
686 #endif
MT2::CompositeType CT2
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:96
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:198
LeftOperand leftOperand() const
Returns the left-hand side sparse matrix operand.
Definition: SMatSMatSubExpr.h:208
bool canAlias(const T *alias) const
Returns whether the expression can alias with the given address alias.
Definition: SMatSMatSubExpr.h:230
bool isDefault(const DynamicMatrix< Type, SO > &m)
Returns whether the given dense matrix is in default state.
Definition: DynamicMatrix.h:4555
Efficient implementation of a compressed matrix.The CompressedMatrix class template is the represent...
Definition: CompressedMatrix.h:196
Header file for the ColumnExprTrait class template.
MT2::ReturnType RN2
ReturnType type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:94
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: SMatSMatSubExpr.h:187
SelectType< IsExpression< MT1 >::value, const MT1, const MT1 & >::Type LeftOperand
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:127
const This & CompositeType
Data type for composite expression templates.
Definition: CompressedMatrix.h:2375
Type ElementType
Type of the sparse matrix elements.
Definition: CompressedMatrix.h:248
SMatSMatSubExpr< MT1, MT2 > This
Type of this SMatSMatSubExpr instance.
Definition: SMatSMatSubExpr.h:114
const SelectType< returnExpr, ExprReturnType, ElementType >::Type ReturnType
Return type for expression template evaluations.
Definition: SMatSMatSubExpr.h:121
ResultType::OppositeType OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: SMatSMatSubExpr.h:116
ResultType::ElementType ElementType
Resulting element type.
Definition: SMatSMatSubExpr.h:118
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:177
const ResultType CompositeType
Data type for composite expression templates.
Definition: SMatSMatSubExpr.h:124
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
MT1::ReturnType RN1
ReturnType type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:93
Header file for the SparseMatrix base class.
Constraint on the data type.
RightOperand rightOperand() const
Returns the right-hand side sparse matrix operand.
Definition: SMatSMatSubExpr.h:218
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:115
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: SMatSMatSubExpr.h:155
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2379
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
Header file for the MatMatSubExpr base class.
LeftOperand lhs_
Left-hand side sparse matrix of the subtraction expression.
Definition: SMatSMatSubExpr.h:249
MT1::CompositeType CT1
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:95
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:242
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:2374
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:250
Header file for run time assertion macros.
Expression object for sparse matrix-sparse matrix subtractions.The SMatSMatSubExpr class represents t...
Definition: Forward.h:95
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
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:109
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
Header file for the isDefault shim.
MT2::ResultType RT2
Result type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:92
SelectType< IsExpression< MT2 >::value, const MT2, const MT2 & >::Type RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:130
ResultType::TransposeType TransposeType
Transpose type for expression template evaluations.
Definition: SMatSMatSubExpr.h:117
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:167
#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:2370
size_t columns(const Matrix< MT, SO > &m)
Returns the current number of columns of the matrix.
Definition: Matrix.h:154
MT1::ResultType RT1
Result type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:91
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:139
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.