All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
TSMatTSMatMultExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_TSMATTSMATMULTEXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_TSMATTSMATMULTEXPR_H_
37 
38 
39 //*************************************************************************************************
40 // Includes
41 //*************************************************************************************************
42 
43 #include <algorithm>
44 #include <stdexcept>
45 #include <vector>
55 #include <blaze/math/Infinity.h>
57 #include <blaze/math/shims/Reset.h>
77 #include <blaze/util/Assert.h>
78 #include <blaze/util/Byte.h>
79 #include <blaze/util/DisableIf.h>
80 #include <blaze/util/EnableIf.h>
81 #include <blaze/util/InvalidType.h>
83 #include <blaze/util/SelectType.h>
84 #include <blaze/util/Types.h>
87 #include <blaze/util/Unused.h>
88 
89 
90 namespace blaze {
91 
92 //=================================================================================================
93 //
94 // CLASS TSMATTSMATMULTEXPR
95 //
96 //=================================================================================================
97 
98 //*************************************************************************************************
105 template< typename MT1 // Type of the left-hand side sparse matrix
106  , typename MT2 > // Type of the right-hand side sparse matrix
107 class TSMatTSMatMultExpr : public SparseMatrix< TSMatTSMatMultExpr<MT1,MT2>, true >
108  , private MatMatMultExpr
109  , private Computation
110 {
111  private:
112  //**Type definitions****************************************************************************
113  typedef typename MT1::ResultType RT1;
114  typedef typename MT2::ResultType RT2;
115  typedef typename MT1::CompositeType CT1;
116  typedef typename MT2::CompositeType CT2;
117  //**********************************************************************************************
118 
119  public:
120  //**Type definitions****************************************************************************
126  typedef const ElementType ReturnType;
127  typedef const ResultType CompositeType;
128 
130  typedef typename SelectType< IsExpression<MT1>::value, const MT1, const MT1& >::Type LeftOperand;
131 
133  typedef typename SelectType< IsExpression<MT2>::value, const MT2, const MT2& >::Type RightOperand;
134  //**********************************************************************************************
135 
136  //**Constructor*********************************************************************************
142  explicit inline TSMatTSMatMultExpr( const MT1& lhs, const MT2& rhs )
143  : lhs_( lhs ) // Left-hand side sparse matrix of the multiplication expression
144  , rhs_( rhs ) // Right-hand side sparse matrix of the multiplication expression
145  {
146  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.rows(), "Invalid matrix sizes" );
147  }
148  //**********************************************************************************************
149 
150  //**Access operator*****************************************************************************
157  inline ReturnType operator()( size_t i, size_t j ) const {
158  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
159  BLAZE_INTERNAL_ASSERT( j < rhs_.columns(), "Invalid column access index" );
160 
162 
163  ElementType tmp = ElementType();
164 
165  // Early exit
166  if( lhs_.columns() == 0UL )
167  return tmp;
168 
169  // Fast computation in case the right-hand side sparse matrix directly provides iterators
171  {
172  // Evaluation of the right-hand side sparse matrix operand
173  CT2 B( rhs_ );
174 
175  const ConstIterator end( B.end(j) );
176  ConstIterator element( B.begin(j) );
177 
178  // Early exit in case row i is empty
179  if( element == end )
180  return tmp;
181 
182  // Calculating element (i,j)
183  tmp = lhs_(i,element->index()) * element->value();
184  ++element;
185  for( ; element!=end; ++element )
186  tmp += lhs_(i,element->index()) * element->value();
187  }
188 
189  // Default computation in case the right-hand side sparse matrix doesn't provide iterators
190  else {
191  tmp = lhs_(i,0UL) * rhs_(0UL,j);
192  for( size_t k=1UL; k<lhs_.columns(); ++k ) {
193  tmp += lhs_(i,k) * rhs_(k,j);
194  }
195  }
196 
197  return tmp;
198  }
199  //**********************************************************************************************
200 
201  //**Rows function*******************************************************************************
206  inline size_t rows() const {
207  return lhs_.rows();
208  }
209  //**********************************************************************************************
210 
211  //**Columns function****************************************************************************
216  inline size_t columns() const {
217  return rhs_.columns();
218  }
219  //**********************************************************************************************
220 
221  //**NonZeros function***************************************************************************
226  inline size_t nonZeros() const {
227  return 0UL;
228  }
229  //**********************************************************************************************
230 
231  //**NonZeros function***************************************************************************
237  inline size_t nonZeros( size_t i ) const {
238  UNUSED_PARAMETER( i );
239  return 0UL;
240  }
241  //**********************************************************************************************
242 
243  //**Left operand access*************************************************************************
248  inline LeftOperand leftOperand() const {
249  return lhs_;
250  }
251  //**********************************************************************************************
252 
253  //**Right operand access************************************************************************
258  inline RightOperand rightOperand() const {
259  return rhs_;
260  }
261  //**********************************************************************************************
262 
263  //**********************************************************************************************
269  template< typename T >
270  inline bool canAlias( const T* alias ) const {
271  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
272  }
273  //**********************************************************************************************
274 
275  //**********************************************************************************************
281  template< typename T >
282  inline bool isAliased( const T* alias ) const {
283  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
284  }
285  //**********************************************************************************************
286 
287  private:
288  //**Member variables****************************************************************************
291  //**********************************************************************************************
292 
293  //**Default assignment to dense matrices********************************************************
307  template< typename MT // Type of the target dense matrix
308  , bool SO > // Storage order of the target dense matrix
309  friend inline typename EnableIf< IsResizable<typename MT::ElementType> >::Type
310  assign( DenseMatrix<MT,SO>& lhs, const TSMatTSMatMultExpr& rhs )
311  {
313 
314  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
315  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
316 
317  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
318  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
319 
320  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
321  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
322 
323  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
324  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
325  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
326  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
327  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
328  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
329 
330  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
331  const RightIterator rend( B.end(j) );
332  for( RightIterator relem=B.begin(j); relem!=rend; ++relem ) {
333  const LeftIterator lend( A.end( relem->index() ) );
334  for( LeftIterator lelem=A.begin( relem->index() ); lelem!=lend; ++lelem )
335  {
336  if( isDefault( (~lhs)(lelem->index(),j) ) ) {
337  (~lhs)(lelem->index(),j) = lelem->value() * relem->value();
338  }
339  else {
340  (~lhs)(lelem->index(),j) += lelem->value() * relem->value();
341  }
342  }
343  }
344  }
345  }
347  //**********************************************************************************************
348 
349  //**Optimized assignment to dense matrices******************************************************
363  template< typename MT // Type of the target dense matrix
364  , bool SO > // Storage order of the target dense matrix
365  friend inline typename DisableIf< IsResizable<typename MT::ElementType> >::Type
366  assign( DenseMatrix<MT,SO>& lhs, const TSMatTSMatMultExpr& rhs )
367  {
369 
370  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
371  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
372 
373  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
374  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
375 
376  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
377  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
378 
379  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
380  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
381  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
382  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
383  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
384  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
385 
386  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
387  const RightIterator rend( B.end(j) );
388  for( RightIterator relem=B.begin(j); relem!=rend; ++relem ) {
389  const LeftIterator lend( A.end( relem->index() ) );
390  for( LeftIterator lelem=A.begin( relem->index() ); lelem!=lend; ++lelem ) {
391  (~lhs)(lelem->index(),j) += lelem->value() * relem->value();
392  }
393  }
394  }
395  }
397  //**********************************************************************************************
398 
399  //**Assignment to row-major sparse matrices*****************************************************
412  template< typename MT > // Type of the target sparse matrix
413  friend inline void assign( SparseMatrix<MT,false>& lhs, const TSMatTSMatMultExpr& rhs )
414  {
416 
417  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
418  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
419 
422 
423  const ResultType tmp( rhs );
424  (~lhs).reserve( tmp.nonZeros() );
425  assign( ~lhs, tmp );
426  }
428  //**********************************************************************************************
429 
430  //**Assignment to column-major sparse matrices**************************************************
443  template< typename MT > // Type of the target sparse matrix
444  friend inline void assign( SparseMatrix<MT,true>& lhs, const TSMatTSMatMultExpr& rhs )
445  {
447 
448  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
449  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
450 
451  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
452  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
453 
454  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
455  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
456 
457  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
458  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
459  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
460  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
461  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
462  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
463 
464  // (Over-)Estimating the number of non-zero entries in the resulting matrix
465  size_t nonzeros( 0UL );
466 
467  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
468  const RightIterator rend( B.end(j) );
469  for( RightIterator relem=B.begin(j); relem!=rend; ++relem ) {
470  nonzeros += A.nonZeros( relem->index() );
471  }
472  }
473 
474  if( nonzeros > (~lhs).rows() * (~lhs).columns() ) {
475  nonzeros = (~lhs).rows() * (~lhs).columns();
476  }
477 
478  (~lhs).reserve( nonzeros );
479  nonzeros = 0UL;
480 
481  // Performing the matrix-matrix multiplication
482  std::vector<ElementType> values ( (~lhs).rows(), ElementType() );
483  std::vector<byte> valid ( (~lhs).rows(), 0 );
484  std::vector<size_t> indices( (~lhs).rows(), 0UL );
485  size_t minIndex( inf ), maxIndex( 0UL );
486 
487  for( size_t j=0UL; j<(~lhs).columns(); ++j )
488  {
489  const RightIterator rend( B.end(j) );
490  for( RightIterator relem=B.begin(j); relem!=rend; ++relem )
491  {
492  const LeftIterator lend( A.end( relem->index() ) );
493  for( LeftIterator lelem=A.begin( relem->index() ); lelem!=lend; ++lelem )
494  {
495  if( !valid[lelem->index()] ) {
496  values[lelem->index()] = lelem->value() * relem->value();
497  valid [lelem->index()] = 1;
498  indices[nonzeros] = lelem->index();
499  ++nonzeros;
500  if( lelem->index() < minIndex ) minIndex = lelem->index();
501  if( lelem->index() > maxIndex ) maxIndex = lelem->index();
502  }
503  else {
504  values[lelem->index()] += lelem->value() * relem->value();
505  }
506  }
507  }
508 
509  BLAZE_INTERNAL_ASSERT( nonzeros <= (~lhs).rows(), "Invalid number of non-zero elements" );
510 
511  if( nonzeros > 0UL )
512  {
513  BLAZE_INTERNAL_ASSERT( minIndex <= maxIndex, "Invalid index detected" );
514 
515  if( ( nonzeros + nonzeros ) < ( maxIndex - minIndex ) )
516  {
517  std::sort( indices.begin(), indices.begin() + nonzeros );
518 
519  for( size_t i=0UL; i<nonzeros; ++i )
520  {
521  const size_t index( indices[i] );
522  if( !isDefault( values[index] ) ) {
523  (~lhs).append( index, j, values[index] );
524  reset( values[index] );
525  }
526 
527  reset( valid [index] );
528  }
529  }
530  else {
531  for( size_t i=minIndex; i<=maxIndex; ++i )
532  {
533  if( !isDefault( values[i] ) ) {
534  (~lhs).append( i, j, values[i] );
535  reset( values[i] );
536  }
537 
538  reset( valid [i] );
539  }
540  }
541 
542  nonzeros = 0UL;
543  minIndex = inf;
544  maxIndex = 0UL;
545  }
546 
547  (~lhs).finalize( j );
548  }
549  }
551  //**********************************************************************************************
552 
553  //**Addition assignment to dense matrices*******************************************************
566  template< typename MT // Type of the target dense matrix
567  , bool SO > // Storage order of the target dense matarix
568  friend inline void addAssign( DenseMatrix<MT,SO>& lhs, const TSMatTSMatMultExpr& rhs )
569  {
571 
572  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
573  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
574 
575  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
576  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
577 
578  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
579  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
580 
581  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
582  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
583  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
584  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
585  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
586  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
587 
588  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
589  const RightIterator rend( B.end(j) );
590  for( RightIterator relem=B.begin(j); relem!=rend; ++relem ) {
591  const LeftIterator lend( A.end( relem->index() ) );
592  for( LeftIterator lelem=A.begin( relem->index() ); lelem!=lend; ++lelem ) {
593  (~lhs)(lelem->index(),j) += lelem->value() * relem->value();
594  }
595  }
596  }
597  }
599  //**********************************************************************************************
600 
601  //**Addition assignment to sparse matrices******************************************************
602  // No special implementation for the addition assignment to sparse matrices.
603  //**********************************************************************************************
604 
605  //**Subtraction assignment to dense matrices****************************************************
618  template< typename MT // Type of the target dense matrix
619  , bool SO > // Storage order of the target dense matarix
620  friend inline void subAssign( DenseMatrix<MT,SO>& lhs, const TSMatTSMatMultExpr& rhs )
621  {
623 
624  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
625  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
626 
627  typedef typename RemoveReference<CT1>::Type::ConstIterator LeftIterator;
628  typedef typename RemoveReference<CT2>::Type::ConstIterator RightIterator;
629 
630  CT1 A( rhs.lhs_ ); // Evaluation of the left-hand side sparse matrix operand
631  CT2 B( rhs.rhs_ ); // Evaluation of the right-hand side sparse matrix operand
632 
633  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
634  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
635  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
636  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
637  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
638  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
639 
640  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
641  const RightIterator rend( B.end(j) );
642  for( RightIterator relem=B.begin(j); relem!=rend; ++relem ) {
643  const LeftIterator lend( A.end( relem->index() ) );
644  for( LeftIterator lelem=A.begin( relem->index() ); lelem!=lend; ++lelem ) {
645  (~lhs)(lelem->index(),j) -= lelem->value() * relem->value();
646  }
647  }
648  }
649  }
651  //**********************************************************************************************
652 
653  //**Subtraction assignment to sparse matrices***************************************************
654  // No special implementation for the subtraction assignment to sparse matrices.
655  //**********************************************************************************************
656 
657  //**Multiplication assignment to dense matrices*************************************************
658  // No special implementation for the multiplication assignment to dense matrices.
659  //**********************************************************************************************
660 
661  //**Multiplication assignment to sparse matrices************************************************
662  // No special implementation for the multiplication assignment to sparse matrices.
663  //**********************************************************************************************
664 
665  //**Compile time checks*************************************************************************
672  //**********************************************************************************************
673 };
674 //*************************************************************************************************
675 
676 
677 
678 
679 //=================================================================================================
680 //
681 // GLOBAL BINARY ARITHMETIC OPERATORS
682 //
683 //=================================================================================================
684 
685 //*************************************************************************************************
712 template< typename T1 // Type of the left-hand side sparse matrix
713  , typename T2 > // Type of the right-hand side sparse matrix
714 inline const TSMatTSMatMultExpr<T1,T2>
716 {
718 
719  if( (~lhs).columns() != (~rhs).rows() )
720  throw std::invalid_argument( "Matrix sizes do not match" );
721 
722  return TSMatTSMatMultExpr<T1,T2>( ~lhs, ~rhs );
723 }
724 //*************************************************************************************************
725 
726 
727 
728 
729 //=================================================================================================
730 //
731 // EXPRESSION TRAIT SPECIALIZATIONS
732 //
733 //=================================================================================================
734 
735 //*************************************************************************************************
737 template< typename MT1, typename MT2, typename VT >
738 struct TSMatDVecMultExprTrait< TSMatTSMatMultExpr<MT1,MT2>, VT >
739 {
740  public:
741  //**********************************************************************************************
742  typedef typename SelectType< IsSparseMatrix<MT1>::value && IsColumnMajorMatrix<MT1>::value &&
743  IsSparseMatrix<MT2>::value && IsColumnMajorMatrix<MT2>::value &&
744  IsDenseVector<VT>::value && IsColumnVector<VT>::value
745  , typename TSMatDVecMultExprTrait< MT1, typename TSMatDVecMultExprTrait<MT2,VT>::Type >::Type
746  , INVALID_TYPE >::Type Type;
747  //**********************************************************************************************
748 };
750 //*************************************************************************************************
751 
752 
753 //*************************************************************************************************
755 template< typename MT1, typename MT2, typename VT >
756 struct TSMatSVecMultExprTrait< TSMatTSMatMultExpr<MT1,MT2>, VT >
757 {
758  public:
759  //**********************************************************************************************
760  typedef typename SelectType< IsSparseMatrix<MT1>::value && IsColumnMajorMatrix<MT1>::value &&
761  IsSparseMatrix<MT2>::value && IsColumnMajorMatrix<MT2>::value &&
762  IsSparseVector<VT>::value && IsColumnVector<VT>::value
763  , typename TSMatDVecMultExprTrait< MT1, typename TSMatDVecMultExprTrait<MT2,VT>::Type >::Type
764  , INVALID_TYPE >::Type Type;
765  //**********************************************************************************************
766 };
768 //*************************************************************************************************
769 
770 
771 //*************************************************************************************************
773 template< typename VT, typename MT1, typename MT2 >
774 struct TDVecTSMatMultExprTrait< VT, TSMatTSMatMultExpr<MT1,MT2> >
775 {
776  public:
777  //**********************************************************************************************
778  typedef typename SelectType< IsDenseVector<VT>::value && IsRowVector<VT>::value &&
779  IsSparseMatrix<MT1>::value && IsColumnMajorMatrix<MT1>::value &&
780  IsSparseMatrix<MT2>::value && IsColumnMajorMatrix<MT2>::value
781  , typename TDVecTSMatMultExprTrait< typename TDVecTSMatMultExprTrait<VT,MT1>::Type, MT2 >::Type
782  , INVALID_TYPE >::Type Type;
783  //**********************************************************************************************
784 };
786 //*************************************************************************************************
787 
788 
789 //*************************************************************************************************
791 template< typename VT, typename MT1, typename MT2 >
792 struct TSVecTSMatMultExprTrait< VT, TSMatTSMatMultExpr<MT1,MT2> >
793 {
794  public:
795  //**********************************************************************************************
796  typedef typename SelectType< IsSparseVector<VT>::value && IsRowVector<VT>::value &&
797  IsSparseMatrix<MT1>::value && IsColumnMajorMatrix<MT1>::value &&
798  IsSparseMatrix<MT2>::value && IsColumnMajorMatrix<MT2>::value
799  , typename TSVecTSMatMultExprTrait< typename TSVecTSMatMultExprTrait<VT,MT1>::Type, MT2 >::Type
800  , INVALID_TYPE >::Type Type;
801  //**********************************************************************************************
802 };
804 //*************************************************************************************************
805 
806 
807 //*************************************************************************************************
809 template< typename MT1, typename MT2 >
810 struct SubmatrixExprTrait< TSMatTSMatMultExpr<MT1,MT2> >
811 {
812  public:
813  //**********************************************************************************************
814  typedef typename MultExprTrait< typename SubmatrixExprTrait<const MT1>::Type
815  , typename SubmatrixExprTrait<const MT2>::Type >::Type Type;
816  //**********************************************************************************************
817 };
819 //*************************************************************************************************
820 
821 
822 //*************************************************************************************************
824 template< typename MT1, typename MT2 >
825 struct RowExprTrait< TSMatTSMatMultExpr<MT1,MT2> >
826 {
827  public:
828  //**********************************************************************************************
829  typedef typename MultExprTrait< typename RowExprTrait<const MT1>::Type, MT2 >::Type Type;
830  //**********************************************************************************************
831 };
833 //*************************************************************************************************
834 
835 
836 //*************************************************************************************************
838 template< typename MT1, typename MT2 >
839 struct ColumnExprTrait< TSMatTSMatMultExpr<MT1,MT2> >
840 {
841  public:
842  //**********************************************************************************************
843  typedef typename MultExprTrait< MT1, typename ColumnExprTrait<const MT2>::Type >::Type Type;
844  //**********************************************************************************************
845 };
847 //*************************************************************************************************
848 
849 } // namespace blaze
850 
851 #endif
void reset(DynamicMatrix< Type, SO > &m)
Resetting the given dense matrix.
Definition: DynamicMatrix.h:4512
Header file for the UNUSED_PARAMETER function template.
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:3703
MT2::CompositeType CT2
Composite type of the right-hand side sparse matrix expression.
Definition: TSMatTSMatMultExpr.h:116
Header file for the IsSparseMatrix type trait.
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.
ResultType::TransposeType TransposeType
Transpose type for expression template evaluations.
Definition: TSMatTSMatMultExpr.h:124
const ElementType ReturnType
Return type for expression template evaluations.
Definition: TSMatTSMatMultExpr.h:126
Header file for the IsColumnMajorMatrix type trait.
MT1::ResultType RT1
Result type of the left-hand side sparse matrix expression.
Definition: TSMatTSMatMultExpr.h:113
Header file for the TSVecTSMatMultExprTrait class template.
const This & CompositeType
Data type for composite expression templates.
Definition: CompressedMatrix.h:2375
Header file for the IsRowVector type trait.
Type ElementType
Type of the sparse matrix elements.
Definition: CompressedMatrix.h:248
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: TSMatTSMatMultExpr.h:157
void UNUSED_PARAMETER(const T1 &)
Suppression of unused parameter warnings.
Definition: Unused.h:84
LeftOperand leftOperand() const
Returns the left-hand side transpose sparse matrix operand.
Definition: TSMatTSMatMultExpr.h:248
TSMatTSMatMultExpr(const MT1 &lhs, const MT2 &rhs)
Constructor for the TSMatTSMatMultExpr class.
Definition: TSMatTSMatMultExpr.h:142
bool canAlias(const T *alias) const
Returns whether the expression can alias with the given address alias.
Definition: TSMatTSMatMultExpr.h:270
Header file for the Computation base class.
Header file for the MatMatMultExpr base class.
Header file for the RequiresEvaluation type trait.
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
RightOperand rightOperand() const
Returns the right-hand side transpose sparse matrix operand.
Definition: TSMatTSMatMultExpr.h:258
Header file for the SparseMatrix base class.
Constraint on the data type.
Header file for the MultExprTrait class template.
Compile time check to query the requirement to evaluate an expression.Via this type trait it is possi...
Definition: RequiresEvaluation.h:90
RightOperand rhs_
Right-hand side sparse matrix of the multiplication expression.
Definition: TSMatTSMatMultExpr.h:290
size_t columns() const
Returns the current number of columns of the matrix.
Definition: TSMatTSMatMultExpr.h:216
size_t nonZeros(size_t i) const
Returns the number of non-zero elements in the specified row.
Definition: TSMatTSMatMultExpr.h:237
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 DisableIf class template.
Header file for the multiplication trait.
LeftOperand lhs_
Left-hand side sparse matrix of the multiplication expression.
Definition: TSMatTSMatMultExpr.h:289
#define BLAZE_CONSTRAINT_MUST_BE_COLUMN_MAJOR_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a column-major dense or sparse matri...
Definition: StorageOrder.h:161
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2379
MultTrait< RT1, RT2 >::Type ResultType
Result type for expression template evaluations.
Definition: TSMatTSMatMultExpr.h:122
Header file for the TDVecTSMatMultExprTrait class template.
Header file for the TSMatDVecMultExprTrait class template.
Numerical infinity for built-in data types.
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
ResultType::OppositeType OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: TSMatTSMatMultExpr.h:123
Expression object for transpose sparse matrix-transpose sparse matrix multiplications.The TSMatTSMatMultExpr class represents the compile time expression for multiplications between two column-major sparse matrices.
Definition: Forward.h:141
Constraint on the data type.
Constraints on the storage order of matrix types.
Constraint on the data type.
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: TSMatTSMatMultExpr.h:226
Header file for the SelectType class template.
Header file for the RowExprTrait class template.
Header file for all forward declarations for expression class templates.
Constraint on the data type.
Header file for the EnableIf class template.
Header file for the byte type.
SelectType< IsExpression< MT1 >::value, const MT1, const MT1 & >::Type LeftOperand
Composite type of the left-hand side sparse matrix expression.
Definition: TSMatTSMatMultExpr.h:130
Header file for the IsSparseVector type trait.
Header file for the SubmatrixExprTrait class template.
Removal of reference modifiers.The RemoveCV type trait removes any reference modifiers from the given...
Definition: RemoveReference.h:69
TSMatTSMatMultExpr< MT1, MT2 > This
Type of this TSMatTSMatMultExpr instance.
Definition: TSMatTSMatMultExpr.h:121
size_t rows() const
Returns the current number of rows of the matrix.
Definition: TSMatTSMatMultExpr.h:206
Header file for run time assertion macros.
Utility type for generic codes.
Base template for the MultTrait class.
Definition: MultTrait.h:141
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
Substitution Failure Is Not An Error (SFINAE) class.The EnableIf class template is an auxiliary tool ...
Definition: EnableIf.h:184
Header file for the reset shim.
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
ResultType::ElementType ElementType
Resulting element type.
Definition: TSMatTSMatMultExpr.h:125
Header file for the isDefault shim.
MT2::ResultType RT2
Result type of the right-hand side sparse matrix expression.
Definition: TSMatTSMatMultExpr.h:114
const Infinity inf
Global Infinity instance.The blaze::inf instance can be used wherever a built-in data type is expecte...
Definition: Infinity.h:1098
const ResultType CompositeType
Data type for composite expression templates.
Definition: TSMatTSMatMultExpr.h:127
Header file for the RemoveReference type trait.
Substitution Failure Is Not An Error (SFINAE) class.The DisableIf class template is an auxiliary tool...
Definition: DisableIf.h:184
MT1::CompositeType CT1
Composite type of the left-hand side sparse matrix expression.
Definition: TSMatTSMatMultExpr.h:115
Header file for the IsDenseVector type trait.
bool isAliased(const T *alias) const
Returns whether the expression is aliased with the given address alias.
Definition: TSMatTSMatMultExpr.h:282
Header file for the IsComputation type trait class.
Header file for the IsBuiltin type trait.
#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
Header file for basic type definitions.
Header file for the IsColumnVector type trait.
Header file for the IsResizable type trait.
SelectType< IsExpression< MT2 >::value, const MT2, const MT2 & >::Type RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: TSMatTSMatMultExpr.h:133
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 TSMatSVecMultExprTrait class template.
Header file for the FunctionTrace class.