DMatTSMatSchurExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_DMATTSMATSCHUREXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_DMATTSMATSCHUREXPR_H_
37 
38 
39 //*************************************************************************************************
40 // Includes
41 //*************************************************************************************************
42 
43 #include <iterator>
44 #include <blaze/math/Aliases.h>
50 #include <blaze/math/Exception.h>
72 #include <blaze/util/Assert.h>
73 #include <blaze/util/DisableIf.h>
74 #include <blaze/util/EnableIf.h>
77 #include <blaze/util/mpl/And.h>
78 #include <blaze/util/mpl/If.h>
79 #include <blaze/util/mpl/Maximum.h>
80 #include <blaze/util/mpl/Or.h>
81 #include <blaze/util/Types.h>
82 #include <blaze/util/Unused.h>
83 
84 
85 namespace blaze {
86 
87 //=================================================================================================
88 //
89 // CLASS DMATTSMATSCHUREXPR
90 //
91 //=================================================================================================
92 
93 //*************************************************************************************************
100 template< typename MT1 // Type of the left-hand side dense matrix
101  , typename MT2 > // Type of the right-hand side sparse matrix
103  : public SchurExpr< SparseMatrix< DMatTSMatSchurExpr<MT1,MT2>, true > >
104  , private Computation
105 {
106  private:
107  //**Type definitions****************************************************************************
114  //**********************************************************************************************
115 
116  //**Return type evaluation**********************************************************************
118 
123  enum : bool { returnExpr = !IsTemporary<RN1>::value && !IsTemporary<RN2>::value };
124 
127  //**********************************************************************************************
128 
129  //**Evaluation strategy*************************************************************************
131 
137  enum : bool { useAssign = ( RequiresEvaluation<MT1>::value || RequiresEvaluation<MT2>::value ) };
138 
140  template< typename VT >
142  struct UseAssign {
143  enum : bool { value = useAssign };
144  };
146  //**********************************************************************************************
147 
148  public:
149  //**Type definitions****************************************************************************
155 
158 
160  using CompositeType = const ResultType;
161 
163  using LeftOperand = If_< IsExpression<MT1>, const MT1, const MT1& >;
164 
166  using RightOperand = If_< IsExpression<MT2>, const MT2, const MT2& >;
167  //**********************************************************************************************
168 
169  //**ConstIterator class definition**************************************************************
173  {
174  public:
175  //**Type definitions*************************************************************************
178 
181 
182  using IteratorCategory = std::forward_iterator_tag;
183  using ValueType = Element;
187 
188  // STL iterator requirements
194  //*******************************************************************************************
195 
196  //**Constructor******************************************************************************
203  inline ConstIterator( LeftOperand left, RightIterator right, size_t column )
204  : left_ ( left ) // Left-hand side dense matrix expression
205  , right_( right ) // Iterator over the elements of the right-hand side sparse matrix expression
206  , col_ ( column ) // The column index of the iterator
207  {}
208  //*******************************************************************************************
209 
210  //**Prefix increment operator****************************************************************
216  ++right_;
217  return *this;
218  }
219  //*******************************************************************************************
220 
221  //**Element access operator******************************************************************
226  inline const Element operator*() const {
227  return Element( left_(right_->index(),col_) * right_->value(), right_->index() );
228  }
229  //*******************************************************************************************
230 
231  //**Element access operator******************************************************************
236  inline const ConstIterator* operator->() const {
237  return this;
238  }
239  //*******************************************************************************************
240 
241  //**Value function***************************************************************************
246  inline ReturnType value() const {
247  return left_(right_->index(),col_) * right_->value();
248  }
249  //*******************************************************************************************
250 
251  //**Index function***************************************************************************
256  inline size_t index() const {
257  return right_->index();
258  }
259  //*******************************************************************************************
260 
261  //**Equality operator************************************************************************
267  inline bool operator==( const ConstIterator& rhs ) const {
268  return right_ == rhs.right_;
269  }
270  //*******************************************************************************************
271 
272  //**Inequality operator**********************************************************************
278  inline bool operator!=( const ConstIterator& rhs ) const {
279  return right_ != rhs.right_;
280  }
281  //*******************************************************************************************
282 
283  //**Subtraction operator*********************************************************************
289  inline DifferenceType operator-( const ConstIterator& rhs ) const {
290  return right_ - rhs.right_;
291  }
292  //*******************************************************************************************
293 
294  private:
295  //**Member variables*************************************************************************
298  size_t col_;
299  //*******************************************************************************************
300  };
301  //**********************************************************************************************
302 
303  //**Compilation flags***************************************************************************
305  enum : bool { smpAssignable = false };
306  //**********************************************************************************************
307 
308  //**Constructor*********************************************************************************
314  explicit inline DMatTSMatSchurExpr( const MT1& lhs, const MT2& rhs ) noexcept
315  : lhs_( lhs ) // Left-hand side dense matrix of the Schur product expression
316  , rhs_( rhs ) // Right-hand side sparse matrix of the Schur product expression
317  {
318  BLAZE_INTERNAL_ASSERT( lhs.rows() == rhs.rows() , "Invalid number of rows" );
319  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.columns(), "Invalid number of columns" );
320  }
321  //**********************************************************************************************
322 
323  //**Access operator*****************************************************************************
330  inline ReturnType operator()( size_t i, size_t j ) const {
331  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
332  BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
333  return lhs_(i,j) * rhs_(i,j);
334  }
335  //**********************************************************************************************
336 
337  //**At function*********************************************************************************
345  inline ReturnType at( size_t i, size_t j ) const {
346  if( i >= lhs_.rows() ) {
347  BLAZE_THROW_OUT_OF_RANGE( "Invalid row access index" );
348  }
349  if( j >= lhs_.columns() ) {
350  BLAZE_THROW_OUT_OF_RANGE( "Invalid column access index" );
351  }
352  return (*this)(i,j);
353  }
354  //**********************************************************************************************
355 
356  //**Begin function******************************************************************************
362  inline ConstIterator begin( size_t j ) const {
363  return ConstIterator( lhs_, rhs_.begin(j), j );
364  }
365  //**********************************************************************************************
366 
367  //**End function********************************************************************************
373  inline ConstIterator end( size_t j ) const {
374  return ConstIterator( lhs_, rhs_.end(j), j );
375  }
376  //**********************************************************************************************
377 
378  //**Rows function*******************************************************************************
383  inline size_t rows() const noexcept {
384  return lhs_.rows();
385  }
386  //**********************************************************************************************
387 
388  //**Columns function****************************************************************************
393  inline size_t columns() const noexcept {
394  return lhs_.columns();
395  }
396  //**********************************************************************************************
397 
398  //**NonZeros function***************************************************************************
403  inline size_t nonZeros() const {
404  return rhs_.nonZeros();
405  }
406  //**********************************************************************************************
407 
408  //**NonZeros function***************************************************************************
414  inline size_t nonZeros( size_t j ) const {
415  return rhs_.nonZeros(j);
416  }
417  //**********************************************************************************************
418 
419  //**Find function*******************************************************************************
426  inline ConstIterator find( size_t i, size_t j ) const {
428  return ConstIterator( lhs_, rhs_.find( i, j ), j );
429  }
430  //**********************************************************************************************
431 
432  //**LowerBound function*************************************************************************
439  inline ConstIterator lowerBound( size_t i, size_t j ) const {
441  return ConstIterator( lhs_, rhs_.lowerBound( i, j ), j );
442  }
443  //**********************************************************************************************
444 
445  //**UpperBound function*************************************************************************
452  inline ConstIterator upperBound( size_t i, size_t j ) const {
454  return ConstIterator( lhs_, rhs_.upperBound( i, j ), j );
455  }
456  //**********************************************************************************************
457 
458  //**Left operand access*************************************************************************
463  inline LeftOperand leftOperand() const noexcept {
464  return lhs_;
465  }
466  //**********************************************************************************************
467 
468  //**Right operand access************************************************************************
473  inline RightOperand rightOperand() const noexcept {
474  return rhs_;
475  }
476  //**********************************************************************************************
477 
478  //**********************************************************************************************
484  template< typename T >
485  inline bool canAlias( const T* alias ) const noexcept {
486  return ( lhs_.canAlias( alias ) || rhs_.canAlias( alias ) );
487  }
488  //**********************************************************************************************
489 
490  //**********************************************************************************************
496  template< typename T >
497  inline bool isAliased( const T* alias ) const noexcept {
498  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
499  }
500  //**********************************************************************************************
501 
502  private:
503  //**Member variables****************************************************************************
506  //**********************************************************************************************
507 
508  //**Assignment to dense matrices****************************************************************
520  template< typename MT // Type of the target dense matrix
521  , bool SO2 > // Storage order of the target dense matrix
522  friend inline EnableIf_< UseAssign<MT> >
523  assign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
524  {
526 
527  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
528  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
529 
531 
532  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
533  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
534 
535  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
536  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
537  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
538  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
539  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
540  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
541 
542  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
543  for( ConstIterator element=B.begin(j); element!=B.end(j); ++element )
544  (~lhs)(element->index(),j) = A(element->index(),j) * element->value();
545  }
546  }
548  //**********************************************************************************************
549 
550  //**Assignment to row-major sparse matrices*****************************************************
563  template< typename MT > // Type of the target sparse matrix
564  friend inline EnableIf_< UseAssign<MT> >
565  assign( SparseMatrix<MT,false>& lhs, const DMatTSMatSchurExpr& rhs )
566  {
568 
569  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
570  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
571 
573 
574  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
575  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
576 
577  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
578  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
579  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
580  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
581  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
582  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
583 
584  const size_t m( rhs.rows() );
585  const size_t n( rhs.columns() );
586 
587  // Counting the number of elements per column
588  std::vector<size_t> nonzeros( m, 0UL );
589  for( size_t j=0UL; j<n; ++j ) {
590  const ConstIterator lend( B.end(j) );
591  for( ConstIterator l=B.begin(j); l!=lend; ++l ) {
592  ++nonzeros[l->index()];
593  }
594  }
595 
596  // Resizing the left-hand side sparse matrix
597  for( size_t i=0UL; i<m; ++i ) {
598  (~lhs).reserve( i, nonzeros[i] );
599  }
600 
601  // Performing the Schur product
602  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
603  for( ConstIterator element=B.begin(j); element!=B.end(j); ++element )
604  (~lhs).append( element->index(), j, A(element->index(),j) * element->value() );
605  }
606  }
608  //**********************************************************************************************
609 
610  //**Assignment to column-major sparse matrices**************************************************
623  template< typename MT > // Type of the target sparse matrix
624  friend inline EnableIf_< UseAssign<MT> >
625  assign( SparseMatrix<MT,true>& lhs, const DMatTSMatSchurExpr& rhs )
626  {
628 
629  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
630  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
631 
633 
634  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
635  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
636 
637  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
638  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
639  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
640  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
641  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
642  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
643 
644  // Final memory allocation (based on the evaluated operands)
645  (~lhs).reserve( B.nonZeros() );
646 
647  // Performing the Schur product
648  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
649  for( ConstIterator element=B.begin(j); element!=B.end(j); ++element )
650  (~lhs).append( element->index(), j, A(element->index(),j) * element->value() );
651  (~lhs).finalize( j );
652  }
653  }
655  //**********************************************************************************************
656 
657  //**Addition assignment to dense matrices*******************************************************
670  template< typename MT // Type of the target dense matrix
671  , bool SO2 > // Storage order of the target dense matrix
672  friend inline EnableIf_< UseAssign<MT> >
673  addAssign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
674  {
676 
677  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
678  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
679 
681 
682  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
683  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
684 
685  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
686  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
687  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
688  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
689  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
690  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
691 
692  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
693  for( ConstIterator element=B.begin(j); element!=B.end(j); ++element )
694  (~lhs)(element->index(),j) += A(element->index(),j) * element->value();
695  }
696  }
698  //**********************************************************************************************
699 
700  //**Addition assignment to sparse matrices******************************************************
701  // No special implementation for the addition assignment to sparse matrices.
702  //**********************************************************************************************
703 
704  //**Subtraction assignment to dense matrices****************************************************
717  template< typename MT // Type of the target dense matrix
718  , bool SO2 > // Storage order of the target dense matrix
719  friend inline EnableIf_< UseAssign<MT> >
720  subAssign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
721  {
723 
724  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
725  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
726 
728 
729  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
730  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
731 
732  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
733  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
734  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
735  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
736  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
737  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
738 
739  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
740  for( ConstIterator element=B.begin(j); element!=B.end(j); ++element )
741  (~lhs)(element->index(),j) -= A(element->index(),j) * element->value();
742  }
743  }
745  //**********************************************************************************************
746 
747  //**Subtraction assignment to sparse matrices***************************************************
748  // No special implementation for the subtraction assignment to sparse matrices.
749  //**********************************************************************************************
750 
751  //**Schur product assignment to dense matrices**************************************************
764  template< typename MT // Type of the target dense matrix
765  , bool SO2 > // Storage order of the target dense matrix
766  friend inline void schurAssign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
767  {
769 
770  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
771  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
772 
774 
775  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
776  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
777 
778  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
779  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
780  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
781  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
782  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
783  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
784 
785  for( size_t j=0UL; j<(~lhs).columns(); ++j )
786  {
787  const ConstIterator end( B.end(j) );
788  ConstIterator begin( B.begin(j) );
789  size_t i( 0UL );
790 
791  for( ; begin!=end; ++begin ) {
792  const size_t index( begin->index() );
793  for( ; i<index; ++i )
794  reset( (~lhs)(i,j) );
795  (~lhs)(index,j) *= A(index,j) * begin->value();
796  ++i;
797  }
798 
799  for( ; i<(~lhs).rows(); ++i )
800  reset( (~lhs)(i,j) );
801  }
802  }
804  //**********************************************************************************************
805 
806  //**Schur product assignment to sparse matrices*************************************************
807  // No special implementation for the Schur product assignment to sparse matrices.
808  //**********************************************************************************************
809 
810  //**Multiplication assignment to dense matrices*************************************************
811  // No special implementation for the multiplication assignment to dense matrices.
812  //**********************************************************************************************
813 
814  //**Multiplication assignment to sparse matrices************************************************
815  // No special implementation for the multiplication assignment to sparse matrices.
816  //**********************************************************************************************
817 
818  //**SMP assignment to dense matrices************************************************************
819  // No special implementation for the SMP assignment to dense matrices.
820  //**********************************************************************************************
821 
822  //**SMP assignment to sparse matrices***********************************************************
823  // No special implementation for the SMP assignment to sparse matrices.
824  //**********************************************************************************************
825 
826  //**SMP addition assignment to dense matrices***************************************************
827  // No special implementation for the SMP addition assignment to dense matrices.
828  //**********************************************************************************************
829 
830  //**SMP addition assignment to sparse matrices**************************************************
831  // No special implementation for the SMP addition assignment to sparse matrices.
832  //**********************************************************************************************
833 
834  //**SMP subtraction assignment to dense matrices************************************************
835  // No special implementation for the SMP subtraction assignment to dense matrices.
836  //**********************************************************************************************
837 
838  //**SMP subtraction assignment to sparse matrices***********************************************
839  // No special implementation for the SMP subtraction assignment to sparse matrices.
840  //**********************************************************************************************
841 
842  //**SMP Schur product assignment to dense matrices**********************************************
855  template< typename MT // Type of the target dense matrix
856  , bool SO > // Storage order of the target dense matrix
857  friend inline void smpSchurAssign( DenseMatrix<MT,SO>& lhs, const DMatTSMatSchurExpr& rhs )
858  {
860 
861  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
862  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
863 
864  smpSchurAssign( ~lhs, rhs.lhs_ );
865  smpSchurAssign( ~lhs, rhs.rhs_ );
866  }
868  //**********************************************************************************************
869 
870  //**SMP Schur product assignment to sparse matrices*********************************************
871  // No special implementation for the SMP Schur product assignment to sparse matrices.
872  //**********************************************************************************************
873 
874  //**SMP multiplication assignment to dense matrices*********************************************
875  // No special implementation for the SMP multiplication assignment to dense matrices.
876  //**********************************************************************************************
877 
878  //**SMP multiplication assignment to sparse matrices********************************************
879  // No special implementation for the SMP multiplication assignment to sparse matrices.
880  //**********************************************************************************************
881 
882  //**Compile time checks*************************************************************************
889  //**********************************************************************************************
890 };
891 //*************************************************************************************************
892 
893 
894 
895 
896 //=================================================================================================
897 //
898 // GLOBAL BINARY ARITHMETIC OPERATORS
899 //
900 //=================================================================================================
901 
902 //*************************************************************************************************
915 template< typename MT1 // Type of the left-hand side dense matrix
916  , typename MT2 // Type of the right-hand side sparse matrix
919 inline const DMatTSMatSchurExpr<MT1,MT2>
920  dmattsmatschur( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
921 {
923 
924  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
925  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
926 
927  return DMatTSMatSchurExpr<MT1,MT2>( ~lhs, ~rhs );
928 }
930 //*************************************************************************************************
931 
932 
933 //*************************************************************************************************
946 template< typename MT1 // Type of the left-hand side dense matrix
947  , typename MT2 // Type of the right-hand side sparse matrix
948  , typename = EnableIf_< Or< And< IsUniLower<MT1>, IsUniUpper<MT2> >
949  , And< IsUniUpper<MT1>, IsUniLower<MT2> > > > >
951  dmattsmatschur( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
952 {
954 
955  UNUSED_PARAMETER( rhs );
956 
957  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
958  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
959 
960  return IdentityMatrix< MultTrait_< ElementType_<MT1>, ElementType_<MT2> >, false >( (~lhs).rows() );
961 }
963 //*************************************************************************************************
964 
965 
966 //*************************************************************************************************
996 template< typename MT1 // Type of the left-hand side dense matrix
997  , typename MT2 > // Type of the right-hand side sparse matrix
998 inline decltype(auto)
999  operator%( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
1000 {
1002 
1003  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() ) {
1004  BLAZE_THROW_INVALID_ARGUMENT( "Matrix sizes do not match" );
1005  }
1006 
1007  return dmattsmatschur( ~lhs, ~rhs );
1008 }
1009 //*************************************************************************************************
1010 
1011 
1012 //*************************************************************************************************
1025 template< typename MT1 // Type of the left-hand side dense matrix
1026  , typename MT2 // Type of the right-hand side sparse matrix
1029 inline const DMatTSMatSchurExpr<MT1,MT2>
1030  tdmattsmatschur( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1031 {
1033 
1034  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
1035  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
1036 
1037  return DMatTSMatSchurExpr<MT1,MT2>( ~lhs, ~rhs );
1038 }
1039 //*************************************************************************************************
1040 
1041 
1042 //*************************************************************************************************
1055 template< typename MT1 // Type of the left-hand side dense matrix
1056  , typename MT2 // Type of the right-hand side sparse matrix
1060  tdmattsmatschur( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1061 {
1063 
1064  UNUSED_PARAMETER( rhs );
1065 
1066  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
1067  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
1068 
1070 }
1072 //*************************************************************************************************
1073 
1074 
1075 //*************************************************************************************************
1104 template< typename MT1 // Type of the left-hand side dense matrix
1105  , typename MT2 > // Type of the right-hand side sparse matrix
1106 inline decltype(auto)
1107  operator%( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1108 {
1110 
1111  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() ) {
1112  BLAZE_THROW_INVALID_ARGUMENT( "Matrix sizes do not match" );
1113  }
1114 
1115  return tdmattsmatschur( ~lhs, ~rhs );
1116 }
1117 //*************************************************************************************************
1118 
1119 
1120 
1121 
1122 //=================================================================================================
1123 //
1124 // ROWS SPECIALIZATIONS
1125 //
1126 //=================================================================================================
1127 
1128 //*************************************************************************************************
1130 template< typename MT1, typename MT2 >
1131 struct Rows< DMatTSMatSchurExpr<MT1,MT2> >
1132  : public Maximum< Rows<MT1>, Rows<MT2> >
1133 {};
1135 //*************************************************************************************************
1136 
1137 
1138 
1139 
1140 //=================================================================================================
1141 //
1142 // COLUMNS SPECIALIZATIONS
1143 //
1144 //=================================================================================================
1145 
1146 //*************************************************************************************************
1148 template< typename MT1, typename MT2 >
1149 struct Columns< DMatTSMatSchurExpr<MT1,MT2> >
1150  : public Maximum< Columns<MT1>, Columns<MT2> >
1151 {};
1153 //*************************************************************************************************
1154 
1155 
1156 
1157 
1158 //=================================================================================================
1159 //
1160 // ISSYMMETRIC SPECIALIZATIONS
1161 //
1162 //=================================================================================================
1163 
1164 //*************************************************************************************************
1166 template< typename MT1, typename MT2 >
1167 struct IsSymmetric< DMatTSMatSchurExpr<MT1,MT2> >
1168  : public BoolConstant< IsSymmetric<MT1>::value && IsSymmetric<MT2>::value >
1169 {};
1171 //*************************************************************************************************
1172 
1173 
1174 
1175 
1176 //=================================================================================================
1177 //
1178 // ISHERMITIAN SPECIALIZATIONS
1179 //
1180 //=================================================================================================
1181 
1182 //*************************************************************************************************
1184 template< typename MT1, typename MT2 >
1185 struct IsHermitian< DMatTSMatSchurExpr<MT1,MT2> >
1186  : public BoolConstant< IsHermitian<MT1>::value && IsHermitian<MT2>::value >
1187 {};
1189 //*************************************************************************************************
1190 
1191 
1192 
1193 
1194 //=================================================================================================
1195 //
1196 // ISLOWER SPECIALIZATIONS
1197 //
1198 //=================================================================================================
1199 
1200 //*************************************************************************************************
1202 template< typename MT1, typename MT2 >
1203 struct IsLower< DMatTSMatSchurExpr<MT1,MT2> >
1204  : public BoolConstant< Or< IsLower<MT1>, IsLower<MT2> >::value >
1205 {};
1207 //*************************************************************************************************
1208 
1209 
1210 
1211 
1212 //=================================================================================================
1213 //
1214 // ISUNILOWER SPECIALIZATIONS
1215 //
1216 //=================================================================================================
1217 
1218 //*************************************************************************************************
1220 template< typename MT1, typename MT2 >
1221 struct IsUniLower< DMatTSMatSchurExpr<MT1,MT2> >
1222  : public BoolConstant< And< IsUniLower<MT1>, IsUniLower<MT2> >::value >
1223 {};
1225 //*************************************************************************************************
1226 
1227 
1228 
1229 
1230 //=================================================================================================
1231 //
1232 // ISSTRICTLYLOWER SPECIALIZATIONS
1233 //
1234 //=================================================================================================
1235 
1236 //*************************************************************************************************
1238 template< typename MT1, typename MT2 >
1239 struct IsStrictlyLower< DMatTSMatSchurExpr<MT1,MT2> >
1240  : public BoolConstant< Or< IsStrictlyLower<MT1>, IsStrictlyLower<MT2> >::value >
1241 {};
1243 //*************************************************************************************************
1244 
1245 
1246 
1247 
1248 //=================================================================================================
1249 //
1250 // ISUPPER SPECIALIZATIONS
1251 //
1252 //=================================================================================================
1253 
1254 //*************************************************************************************************
1256 template< typename MT1, typename MT2 >
1257 struct IsUpper< DMatTSMatSchurExpr<MT1,MT2> >
1258  : public BoolConstant< Or< IsUpper<MT1>, IsUpper<MT2> >::value >
1259 {};
1261 //*************************************************************************************************
1262 
1263 
1264 
1265 
1266 //=================================================================================================
1267 //
1268 // ISUNIUPPER SPECIALIZATIONS
1269 //
1270 //=================================================================================================
1271 
1272 //*************************************************************************************************
1274 template< typename MT1, typename MT2 >
1275 struct IsUniUpper< DMatTSMatSchurExpr<MT1,MT2> >
1276  : public BoolConstant< And< IsUniUpper<MT1>, IsUniUpper<MT2> >::value >
1277 {};
1279 //*************************************************************************************************
1280 
1281 
1282 
1283 
1284 //=================================================================================================
1285 //
1286 // ISSTRICTLYUPPER SPECIALIZATIONS
1287 //
1288 //=================================================================================================
1289 
1290 //*************************************************************************************************
1292 template< typename MT1, typename MT2 >
1293 struct IsStrictlyUpper< DMatTSMatSchurExpr<MT1,MT2> >
1294  : public BoolConstant< Or< IsStrictlyUpper<MT1>, IsStrictlyUpper<MT2> >::value >
1295 {};
1297 //*************************************************************************************************
1298 
1299 } // namespace blaze
1300 
1301 #endif
#define BLAZE_THROW_INVALID_ARGUMENT(MESSAGE)
Macro for the emission of a std::invalid_argument exception.This macro encapsulates the default way o...
Definition: Exception.h:235
Pointer difference type of the Blaze library.
Header file for auxiliary alias declarations.
Header file for the Schur product trait.
Compile time check whether the given type is a temporary vector or matrix type.This type trait class ...
Definition: IsTemporary.h:70
Header file for the Rows type trait.
Header file for the UNUSED_PARAMETER function template.
Header file for the IsUniUpper type trait.
EnableIf_< IsDenseMatrix< MT1 > > smpSchurAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the SMP Schur product assignment of a matrix to dense matrix.
Definition: DenseMatrix.h:196
Header file for basic type definitions.
ConstIterator(LeftOperand left, RightIterator right, size_t column)
Constructor for the ConstIterator class.
Definition: DMatTSMatSchurExpr.h:203
If_< IsExpression< MT2 >, const MT2, const MT2 &> RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:166
Expression object for dense matrix-transpose sparse matrix Schur product.The DMatTSMatSchurExpr class...
Definition: DMatTSMatSchurExpr.h:102
Header file for the serial shim.
Generic wrapper for a compile time constant integral value.The IntegralConstant class template repres...
Definition: IntegralConstant.h:71
#define BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a dense, N-dimensional matrix type...
Definition: DenseMatrix.h:61
const Element operator*() const
Direct access to the sparse matrix element at the current iterator position.
Definition: DMatTSMatSchurExpr.h:226
void reset(const DiagonalProxy< MT > &proxy)
Resetting the represented element to the default initial values.
Definition: DiagonalProxy.h:560
typename DisableIf< Condition, T >::Type DisableIf_
Auxiliary type for the DisableIf class template.The DisableIf_ alias declaration provides a convenien...
Definition: DisableIf.h:224
ResultType_< MT2 > RT2
Result type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:109
size_t col_
The column index of the iterator.
Definition: DMatTSMatSchurExpr.h:298
Header file for the And class template.
Compile time value evaluation.The Maximum alias declaration selects the larger of the two given templ...
Definition: Maximum.h:73
Compile time check for lower triangular matrices.This type trait tests whether or not the given templ...
Definition: IsLower.h:88
DifferenceType operator-(const ConstIterator &rhs) const
Calculating the number of elements between two expression iterators.
Definition: DMatTSMatSchurExpr.h:289
Column< MT > column(Matrix< MT, SO > &matrix, size_t index)
Creating a view on a specific column of the given matrix.
Definition: Column.h:124
Header file for the Computation base class.
Compile time check for upper triangular matrices.This type trait tests whether or not the given templ...
Definition: IsUpper.h:88
LeftOperand leftOperand() const noexcept
Returns the left-hand side dense matrix operand.
Definition: DMatTSMatSchurExpr.h:463
Header file for the IsUniLower type trait.
typename T::ResultType ResultType_
Alias declaration for nested ResultType type definitions.The ResultType_ alias declaration provides a...
Definition: Aliases.h:343
If_< IsExpression< MT1 >, const MT1, const MT1 &> LeftOperand
Composite type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:163
#define BLAZE_CONSTRAINT_MUST_FORM_VALID_SCHUREXPR(T1, T2)
Constraint on the data type.In case the given data types T1 and T2 do not form a valid matrix/matrix ...
Definition: SchurExpr.h:108
size_t index() const
Access to the current index of the sparse element.
Definition: DMatTSMatSchurExpr.h:256
Base class for dense matrices.The DenseMatrix class is a base class for all dense matrix classes...
Definition: DenseMatrix.h:78
ReturnType_< MT2 > RN2
Return type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:111
Base class for sparse matrices.The SparseMatrix class is a base class for all sparse matrix classes...
Definition: Forward.h:129
Header file for all forward declarations for sparse vectors and matrices.
typename IfTrue< Condition, T1, T2 >::Type IfTrue_
Auxiliary alias declaration for the IfTrue class template.The IfTrue_ alias declaration provides a co...
Definition: If.h:109
typename T::ReturnType ReturnType_
Alias declaration for nested ReturnType type definitions.The ReturnType_ alias declaration provides a...
Definition: Aliases.h:363
bool isAliased(const T *alias) const noexcept
Returns whether the expression is aliased with the given address alias.
Definition: DMatTSMatSchurExpr.h:497
Header file for the SparseMatrix base class.
Constraint on the data type.
Constraint on the data type.
Header file for the Maximum class template.
typename MultExprTrait< T1, T2 >::Type MultExprTrait_
Auxiliary alias declaration for the MultExprTrait class template.The MultExprTrait_ alias declaration...
Definition: MultExprTrait.h:112
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:72
typename T::CompositeType CompositeType_
Alias declaration for nested CompositeType type definitions.The CompositeType_ alias declaration prov...
Definition: Aliases.h:83
Compile time check for upper unitriangular matrices.This type trait tests whether or not the given te...
Definition: IsUniUpper.h:86
Header file for the ValueIndexPair class.
Efficient implementation of an identity matrix.The IdentityMatrix class template is the representati...
Definition: Forward.h:49
Header file for the DisableIf class template.
Header file for the IsTemporary type trait class.
Header file for the IsStrictlyUpper type trait.
Header file for the IsSymmetric type trait.
Namespace of the Blaze C++ math library.
Definition: Blaze.h:57
Header file for the If class template.
#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: ColumnMajorMatrix.h:61
Header file for the Or class template.
ConstIterator & operator++()
Pre-increment operator.
Definition: DMatTSMatSchurExpr.h:215
#define BLAZE_THROW_OUT_OF_RANGE(MESSAGE)
Macro for the emission of a std::out_of_range exception.This macro encapsulates the default way of Bl...
Definition: Exception.h:331
Header file for the Columns type trait.
CompositeType_< MT1 > CT1
Composite type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:112
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:3087
SchurTrait_< RT1, RT2 > ResultType
Result type for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:151
typename T::ElementType ElementType_
Alias declaration for nested ElementType type definitions.The ElementType_ alias declaration provides...
Definition: Aliases.h:163
ConstIterator find(size_t i, size_t j) const
Searches for a specific matrix element.
Definition: DMatTSMatSchurExpr.h:426
RightIterator right_
Iterator over the elements of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:297
Header file for the IsLower type trait.
ConstIterator upperBound(size_t i, size_t j) const
Returns an iterator to the first index greater then the given index.
Definition: DMatTSMatSchurExpr.h:452
typename SchurTrait< T1, T2 >::Type SchurTrait_
Auxiliary alias declaration for the SchurTrait class template.The SchurTrait_ alias declaration provi...
Definition: SchurTrait.h:167
std::forward_iterator_tag IteratorCategory
The iterator category.
Definition: DMatTSMatSchurExpr.h:182
Compile time check for symmetric matrices.This type trait tests whether or not the given template par...
Definition: IsSymmetric.h:85
Header file for the exception macros of the math module.
ElementType_< ResultType > ElementType
Resulting element type.
Definition: DMatTSMatSchurExpr.h:154
Compile time check for strictly upper triangular matrices.This type trait tests whether or not the gi...
Definition: IsStrictlyUpper.h:86
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: DMatTSMatSchurExpr.h:330
TransposeType_< ResultType > TransposeType
Transpose type for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:153
IteratorCategory iterator_category
The iterator category.
Definition: DMatTSMatSchurExpr.h:189
Constraint on the data type.
DMatTSMatSchurExpr(const MT1 &lhs, const MT2 &rhs) noexcept
Constructor for the DMatTSMatSchurExpr class.
Definition: DMatTSMatSchurExpr.h:314
Header file for all forward declarations for expression class templates.
OppositeType_< ResultType > OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:152
Header file for the EnableIf class template.
Header file for the IsStrictlyLower type trait.
Compile time check for lower unitriangular matrices.This type trait tests whether or not the given te...
Definition: IsUniLower.h:86
ReturnType_< MT1 > RN1
Return type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:110
size_t rows() const noexcept
Returns the current number of rows of the matrix.
Definition: DMatTSMatSchurExpr.h:383
Base class for all Schur product expression templates.The SchurExpr class serves as a tag for all exp...
Definition: SchurExpr.h:66
ConstIterator_< RemoveReference_< RightOperand > > RightIterator
Iterator type of the sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:180
Header file for run time assertion macros.
const IfTrue_< returnExpr, ExprReturnType, ElementType > ReturnType
Return type for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:157
LeftOperand lhs_
Left-hand side dense matrix of the Schur product expression.
Definition: DMatTSMatSchurExpr.h:504
Header file for the SchurExpr base class.
ConstIterator end(size_t j) const
Returns an iterator just past the last non-zero element of column j.
Definition: DMatTSMatSchurExpr.h:373
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: DMatTSMatSchurExpr.h:403
typename If< T1, T2, T3 >::Type If_
Auxiliary alias declaration for the If class template.The If_ alias declaration provides a convenient...
Definition: If.h:154
#define BLAZE_FUNCTION_TRACE
Function trace macro.This macro can be used to reliably trace function calls. In case function tracin...
Definition: FunctionTrace.h:94
Compile time check for Hermitian matrices.This type trait tests whether or not the given template par...
Definition: IsHermitian.h:85
ReturnType value() const
Access to the current value of the sparse element.
Definition: DMatTSMatSchurExpr.h:246
Constraints on the storage order of matrix types.
decltype(auto) serial(const DenseMatrix< MT, SO > &dm)
Forces the serial evaluation of the given dense matrix expression dm.
Definition: DMatSerialExpr.h:819
#define BLAZE_CONSTRAINT_MUST_NOT_REQUIRE_EVALUATION(T)
Constraint on the data type.In case the given data type T requires an intermediate evaluation within ...
Definition: RequiresEvaluation.h:81
ResultType_< MT1 > RT1
Result type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:108
CompositeType_< MT2 > CT2
Composite type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:113
typename EnableIf< Condition, T >::Type EnableIf_
Auxiliary alias declaration for the EnableIf class template.The EnableIf_ alias declaration provides ...
Definition: EnableIf.h:224
size_t columns() const noexcept
Returns the current number of columns of the matrix.
Definition: DMatTSMatSchurExpr.h:393
typename T::OppositeType OppositeType_
Alias declaration for nested OppositeType type definitions.The OppositeType_ alias declaration provid...
Definition: Aliases.h:263
const ResultType CompositeType
Data type for composite expression templates.
Definition: DMatTSMatSchurExpr.h:160
ConstIterator lowerBound(size_t i, size_t j) const
Returns an iterator to the first index not less then the given index.
Definition: DMatTSMatSchurExpr.h:439
Compile time check for strictly lower triangular matrices.This type trait tests whether or not the gi...
Definition: IsStrictlyLower.h:86
typename T::ConstIterator ConstIterator_
Alias declaration for nested ConstIterator type definitions.The ConstIterator_ alias declaration prov...
Definition: Aliases.h:103
RightOperand rhs_
Right-hand side sparse matrix of the Schur product expression.
Definition: DMatTSMatSchurExpr.h:505
ConstIterator begin(size_t j) const
Returns an iterator to the first non-zero element of column j.
Definition: DMatTSMatSchurExpr.h:362
Index-value-pair for sparse vectors and matrices.The ValueIndexPair class represents a single index-v...
Definition: ValueIndexPair.h:73
RightOperand rightOperand() const noexcept
Returns the right-hand side transpose sparse matrix operand.
Definition: DMatTSMatSchurExpr.h:473
size_t nonZeros(size_t j) const
Returns the number of non-zero elements in the specified column.
Definition: DMatTSMatSchurExpr.h:414
bool canAlias(const T *alias) const noexcept
Returns whether the expression can alias with the given address alias.
Definition: DMatTSMatSchurExpr.h:485
Base class for all compute expression templates.The Computation class serves as a tag for all computa...
Definition: Computation.h:66
LeftOperand left_
Left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:296
Header file for the IntegralConstant class template.
Compile time evaluation of the number of columns of a matrix.The Columns type trait evaluates the num...
Definition: Columns.h:75
Iterator over the elements of the dense matrix/sparse matrix Schur product expression.
Definition: DMatTSMatSchurExpr.h:172
bool operator==(const ConstIterator &rhs) const
Equality comparison between two ConstIterator objects.
Definition: DMatTSMatSchurExpr.h:267
const ConstIterator * operator->() const
Direct access to the sparse matrix element at the current iterator position.
Definition: DMatTSMatSchurExpr.h:236
Compile time evaluation of the number of rows of a matrix.The Rows type trait evaluates the number of...
Definition: Rows.h:75
Compile time logical and evaluation.The And alias declaration performs at compile time a logical and ...
Definition: And.h:76
typename T::TransposeType TransposeType_
Alias declaration for nested TransposeType type definitions.The TransposeType_ alias declaration prov...
Definition: Aliases.h:423
Header file for the IsUpper type trait.
void UNUSED_PARAMETER(const Args &...)
Suppression of unused parameter warnings.
Definition: Unused.h:81
Header file for the IsHermitian type trait.
#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
MultExprTrait_< RN1, RN2 > ExprReturnType
Expression return type for the subscript operator.
Definition: DMatTSMatSchurExpr.h:126
ReturnType at(size_t i, size_t j) const
Checked access to the matrix elements.
Definition: DMatTSMatSchurExpr.h:345
#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:61
bool operator!=(const ConstIterator &rhs) const
Inequality comparison between two ConstIterator objects.
Definition: DMatTSMatSchurExpr.h:278
Header file for the IsExpression type trait class.
Header file for the function trace functionality.
Constraint on the data type.