SMatSMatSubExpr.h
Go to the documentation of this file.
1 //=================================================================================================
33 //=================================================================================================
34 
35 #ifndef _BLAZE_MATH_EXPRESSIONS_SMATSMATSUBEXPR_H_
36 #define _BLAZE_MATH_EXPRESSIONS_SMATSMATSUBEXPR_H_
37 
38 
39 //*************************************************************************************************
40 // Includes
41 //*************************************************************************************************
42 
43 #include <blaze/math/Aliases.h>
50 #include <blaze/math/Exception.h>
73 #include <blaze/util/Assert.h>
74 #include <blaze/util/DisableIf.h>
75 #include <blaze/util/EnableIf.h>
78 #include <blaze/util/mpl/And.h>
79 #include <blaze/util/mpl/If.h>
80 #include <blaze/util/mpl/Maximum.h>
81 #include <blaze/util/Types.h>
83 
84 
85 namespace blaze {
86 
87 //=================================================================================================
88 //
89 // CLASS SMATSMATSUBEXPR
90 //
91 //=================================================================================================
92 
93 //*************************************************************************************************
100 template< typename MT1 // Type of the left-hand side sparse matrix
101  , typename MT2 > // Type of the right-hand side sparse matrix
102 class SMatSMatSubExpr
103  : public MatMatSubExpr< SparseMatrix< SMatSMatSubExpr<MT1,MT2>, false > >
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  //**Serial evaluation strategy******************************************************************
131 
136  template< typename T1, typename T2, typename T3 >
137  struct UseSymmetricKernel {
139  enum : bool { value = IsSymmetric<T2>::value && IsSymmetric<T3>::value };
140  };
142  //**********************************************************************************************
143 
144  //**Parallel evaluation strategy****************************************************************
146 
151  template< typename MT >
152  struct UseSMPAssign {
153  enum : bool { value = MT::smpAssignable };
154  };
156  //**********************************************************************************************
157 
158  public:
159  //**Type definitions****************************************************************************
165 
168 
170  using CompositeType = const ResultType;
171 
173  using LeftOperand = If_< IsExpression<MT1>, const MT1, const MT1& >;
174 
176  using RightOperand = If_< IsExpression<MT2>, const MT2, const MT2& >;
177  //**********************************************************************************************
178 
179  //**Compilation flags***************************************************************************
181  enum : bool { smpAssignable = false };
182  //**********************************************************************************************
183 
184  //**Constructor*********************************************************************************
190  explicit inline SMatSMatSubExpr( const MT1& lhs, const MT2& rhs ) noexcept
191  : lhs_( lhs ) // Left-hand side sparse matrix of the subtraction expression
192  , rhs_( rhs ) // Right-hand side sparse matrix of the subtraction expression
193  {
194  BLAZE_INTERNAL_ASSERT( lhs.rows() == rhs.rows() , "Invalid number of rows" );
195  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.columns(), "Invalid number of columns" );
196  }
197  //**********************************************************************************************
198 
199  //**Access operator*****************************************************************************
206  inline ReturnType operator()( size_t i, size_t j ) const {
207  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
208  BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
209  return lhs_(i,j) - rhs_(i,j);
210  }
211  //**********************************************************************************************
212 
213  //**At function*********************************************************************************
221  inline ReturnType at( size_t i, size_t j ) const {
222  if( i >= lhs_.rows() ) {
223  BLAZE_THROW_OUT_OF_RANGE( "Invalid row access index" );
224  }
225  if( j >= lhs_.columns() ) {
226  BLAZE_THROW_OUT_OF_RANGE( "Invalid column access index" );
227  }
228  return (*this)(i,j);
229  }
230  //**********************************************************************************************
231 
232  //**Rows function*******************************************************************************
237  inline size_t rows() const noexcept {
238  return lhs_.rows();
239  }
240  //**********************************************************************************************
241 
242  //**Columns function****************************************************************************
247  inline size_t columns() const noexcept {
248  return lhs_.columns();
249  }
250  //**********************************************************************************************
251 
252  //**NonZeros function***************************************************************************
257  inline size_t nonZeros() const {
258  return lhs_.nonZeros() + rhs_.nonZeros();
259  }
260  //**********************************************************************************************
261 
262  //**NonZeros function***************************************************************************
268  inline size_t nonZeros( size_t i ) const {
269  return lhs_.nonZeros(i) + rhs_.nonZeros(i);
270  }
271  //**********************************************************************************************
272 
273  //**Left operand access*************************************************************************
278  inline LeftOperand leftOperand() const noexcept {
279  return lhs_;
280  }
281  //**********************************************************************************************
282 
283  //**Right operand access************************************************************************
288  inline RightOperand rightOperand() const noexcept {
289  return rhs_;
290  }
291  //**********************************************************************************************
292 
293  //**********************************************************************************************
299  template< typename T >
300  inline bool canAlias( const T* alias ) const noexcept {
301  return ( lhs_.canAlias( alias ) || rhs_.canAlias( alias ) );
302  }
303  //**********************************************************************************************
304 
305  //**********************************************************************************************
311  template< typename T >
312  inline bool isAliased( const T* alias ) const noexcept {
313  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
314  }
315  //**********************************************************************************************
316 
317  private:
318  //**Member variables****************************************************************************
321  //**********************************************************************************************
322 
323  //**Assignment to dense matrices****************************************************************
335  template< typename MT // Type of the target dense matrix
336  , bool SO > // Storage order of the target dense matrix
337  friend inline void assign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
338  {
340 
341  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
342  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
343 
344  using RightIterator = ConstIterator_< RemoveReference_<CT2> >;
345 
346  assign( ~lhs, rhs.lhs_ );
347 
348  if( !IsResizable< ElementType_<MT> >::value ) {
349  subAssign( ~lhs, rhs.rhs_ );
350  }
351  else
352  {
353  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
354 
355  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
356  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
357  BLAZE_INTERNAL_ASSERT( B.rows() == (~lhs).rows() , "Invalid number of rows" );
358  BLAZE_INTERNAL_ASSERT( B.columns() == (~lhs).columns() , "Invalid number of columns" );
359 
360  for( size_t i=0UL; i<(~lhs).rows(); ++i ) {
361  const RightIterator end( B.end(i) );
362  for( RightIterator element=B.begin(i); element!=end; ++element ) {
363  if( isDefault( (~lhs)(i,element->index()) ) )
364  (~lhs)(i,element->index()) = -element->value();
365  else
366  (~lhs)(i,element->index()) -= element->value();
367  }
368  }
369  }
370  }
372  //**********************************************************************************************
373 
374  //**Assignment to row-major sparse matrices*****************************************************
386  template< typename MT > // Type of the target sparse matrix
387  friend inline void assign( SparseMatrix<MT,false>& lhs, const SMatSMatSubExpr& rhs )
388  {
390 
391  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
392  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
393 
394  using LeftIterator = ConstIterator_< RemoveReference_<CT1> >;
395  using RightIterator = ConstIterator_< RemoveReference_<CT2> >;
396 
397  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse matrix operand
398  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
399 
400  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
401  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
402  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
403  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
404  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
405  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
406 
407  // Final memory allocation (based on the evaluated operands)
408  (~lhs).reserve( A.nonZeros() + B.nonZeros() );
409 
410  // Performing the matrix subtraction
411  for( size_t i=0UL; i<(~lhs).rows(); ++i )
412  {
413  const LeftIterator lend( A.end(i) );
414  const RightIterator rend( B.end(i) );
415 
416  LeftIterator l( A.begin(i) );
417  RightIterator r( B.begin(i) );
418 
419  while( l != lend && r != rend )
420  {
421  if( l->index() < r->index() ) {
422  (~lhs).append( i, l->index(), l->value() );
423  ++l;
424  }
425  else if( l->index() > r->index() ) {
426  (~lhs).append( i, r->index(), -r->value() );
427  ++r;
428  }
429  else {
430  (~lhs).append( i, l->index(), l->value() - r->value() );
431  ++l;
432  ++r;
433  }
434  }
435 
436  while( l != lend ) {
437  (~lhs).append( i, l->index(), l->value() );
438  ++l;
439  }
440 
441  while( r != rend ) {
442  (~lhs).append( i, r->index(), -r->value() );
443  ++r;
444  }
445 
446  (~lhs).finalize( i );
447  }
448  }
450  //**********************************************************************************************
451 
452  //**Assignment to column-major sparse matrices**************************************************
464  template< typename MT > // Type of the target sparse matrix
466  assign( SparseMatrix<MT,true>& lhs, const SMatSMatSubExpr& rhs )
467  {
469 
471 
472  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
473  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
474 
475  using LeftIterator = ConstIterator_< RemoveReference_<CT1> >;
476  using RightIterator = ConstIterator_< RemoveReference_<CT2> >;
477 
478  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side sparse matrix operand
479  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
480 
481  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
482  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
483  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
484  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
485  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
486  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
487 
488  const size_t m( rhs.rows() );
489  const size_t n( rhs.columns() );
490 
491  // Counting the number of elements per column
492  std::vector<size_t> nonzeros( n, 0UL );
493  for( size_t i=0UL; i<m; ++i )
494  {
495  const LeftIterator lend( A.end(i) );
496  const RightIterator rend( B.end(i) );
497 
498  LeftIterator l( A.begin(i) );
499  RightIterator r( B.begin(i) );
500 
501  while( l != lend && r != rend )
502  {
503  if( l->index() < r->index() ) {
504  ++nonzeros[l->index()];
505  ++l;
506  }
507  else if( l->index() > r->index() ) {
508  ++nonzeros[r->index()];
509  ++r;
510  }
511  else {
512  ++nonzeros[l->index()];
513  ++l;
514  ++r;
515  }
516  }
517 
518  while( l != lend ) {
519  ++nonzeros[l->index()];
520  ++l;
521  }
522 
523  while( r != rend ) {
524  ++nonzeros[r->index()];
525  ++r;
526  }
527  }
528 
529  // Resizing the left-hand side sparse matrix
530  for( size_t j=0UL; j<n; ++j ) {
531  (~lhs).reserve( j, nonzeros[j] );
532  }
533 
534  // Performing the matrix subtraction
535  for( size_t i=0UL; i<m; ++i )
536  {
537  const LeftIterator lend( A.end(i) );
538  const RightIterator rend( B.end(i) );
539 
540  LeftIterator l( A.begin(i) );
541  RightIterator r( B.begin(i) );
542 
543  while( l != lend && r != rend )
544  {
545  if( l->index() < r->index() ) {
546  (~lhs).append( i, l->index(), l->value() );
547  ++l;
548  }
549  else if( l->index() > r->index() ) {
550  (~lhs).append( i, r->index(), -r->value() );
551  ++r;
552  }
553  else {
554  (~lhs).append( i, l->index(), l->value() - r->value() );
555  ++l;
556  ++r;
557  }
558  }
559 
560  while( l != lend ) {
561  (~lhs).append( i, l->index(), l->value() );
562  ++l;
563  }
564 
565  while( r != rend ) {
566  (~lhs).append( i, r->index(), -r->value() );
567  ++r;
568  }
569  }
570  }
572  //**********************************************************************************************
573 
574  //**Assignment to column-major sparse matrices**************************************************
586  template< typename MT > // Type of the target sparse matrix
588  assign( SparseMatrix<MT,true>& lhs, const SMatSMatSubExpr& rhs )
589  {
591 
593 
594  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
595  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
596 
597  assign( ~lhs, trans( rhs.lhs_ ) - trans( rhs.rhs_ ) );
598  }
600  //**********************************************************************************************
601 
602  //**Addition assignment to dense matrices*******************************************************
614  template< typename MT // Type of the target dense matrix
615  , bool SO > // Storage order of the target dense matrix
616  friend inline void addAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
617  {
619 
620  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
621  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
622 
623  addAssign( ~lhs, rhs.lhs_ );
624  subAssign( ~lhs, rhs.rhs_ );
625  }
627  //**********************************************************************************************
628 
629  //**Addition assignment to sparse matrices******************************************************
630  // No special implementation for the addition assignment to sparse matrices.
631  //**********************************************************************************************
632 
633  //**Subtraction assignment to dense matrices****************************************************
645  template< typename MT // Type of the target dense matrix
646  , bool SO > // Storage order of the target dense matrix
647  friend inline void subAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
648  {
650 
651  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
652  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
653 
654  subAssign( ~lhs, rhs.lhs_ );
655  addAssign( ~lhs, rhs.rhs_ );
656  }
658  //**********************************************************************************************
659 
660  //**Subtraction assignment to sparse matrices***************************************************
661  // No special implementation for the subtraction assignment to sparse matrices.
662  //**********************************************************************************************
663 
664  //**Schur product assignment to dense matrices**************************************************
677  template< typename MT // Type of the target dense matrix
678  , bool SO > // Storage order of the target dense matrix
679  friend inline void schurAssign( DenseMatrix<MT,SO>& lhs, const SMatSMatSubExpr& rhs )
680  {
682 
686 
687  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
688  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
689 
690  const ResultType tmp( serial( rhs ) );
691  schurAssign( ~lhs, tmp );
692  }
694  //**********************************************************************************************
695 
696  //**Schur product assignment to sparse matrices*************************************************
697  // No special implementation for the Schur product assignment to sparse matrices.
698  //**********************************************************************************************
699 
700  //**Multiplication assignment to dense matrices*************************************************
701  // No special implementation for the multiplication assignment to dense matrices.
702  //**********************************************************************************************
703 
704  //**Multiplication assignment to sparse matrices************************************************
705  // No special implementation for the multiplication assignment to sparse matrices.
706  //**********************************************************************************************
707 
708  //**SMP assignment to dense matrices************************************************************
709  // No special implementation for the SMP assignment to dense matrices.
710  //**********************************************************************************************
711 
712  //**SMP assignment to sparse matrices***********************************************************
713  // No special implementation for the SMP assignment to sparse matrices.
714  //**********************************************************************************************
715 
716  //**SMP addition assignment to dense matrices***************************************************
730  template< typename MT // Type of the target dense matrix
731  , bool SO > // Storage order of the target dense matrix
732  friend inline EnableIf_< UseSMPAssign<MT> >
734  {
736 
737  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
738  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
739 
740  smpAddAssign( ~lhs, rhs.lhs_ );
741  smpSubAssign( ~lhs, rhs.rhs_ );
742  }
744  //**********************************************************************************************
745 
746  //**SMP addition assignment to sparse matrices**************************************************
747  // No special implementation for the SMP addition assignment to sparse matrices.
748  //**********************************************************************************************
749 
750  //**SMP subtraction assignment to dense matrices************************************************
765  template< typename MT // Type of the target dense matrix
766  , bool SO > // Storage order of the target dense matrix
767  friend inline EnableIf_< UseSMPAssign<MT> >
769  {
771 
772  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
773  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
774 
775  smpSubAssign( ~lhs, rhs.lhs_ );
776  smpAddAssign( ~lhs, rhs.rhs_ );
777  }
779  //**********************************************************************************************
780 
781  //**SMP subtraction assignment to sparse matrices***********************************************
782  // No special implementation for the SMP subtraction assignment to sparse matrices.
783  //**********************************************************************************************
784 
785  //**SMP Schur product assignment to dense matrices**********************************************
800  template< typename MT // Type of the target dense matrix
801  , bool SO > // Storage order of the target dense matrix
802  friend inline EnableIf_< UseSMPAssign<MT> >
804  {
806 
810 
811  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
812  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
813 
814  const ResultType tmp( rhs );
815  smpSchurAssign( ~lhs, tmp );
816  }
818  //**********************************************************************************************
819 
820  //**SMP Schur product assignment to sparse matrices*********************************************
821  // No special implementation for the SMP Schur product assignment to sparse matrices.
822  //**********************************************************************************************
823 
824  //**SMP multiplication assignment to dense matrices*********************************************
825  // No special implementation for the SMP multiplication assignment to dense matrices.
826  //**********************************************************************************************
827 
828  //**SMP multiplication assignment to sparse matrices********************************************
829  // No special implementation for the SMP multiplication assignment to sparse matrices.
830  //**********************************************************************************************
831 
832  //**Compile time checks*************************************************************************
840  //**********************************************************************************************
841 };
842 //*************************************************************************************************
843 
844 
845 
846 
847 //=================================================================================================
848 //
849 // GLOBAL BINARY ARITHMETIC OPERATORS
850 //
851 //=================================================================================================
852 
853 //*************************************************************************************************
879 template< typename MT1 // Type of the left-hand side sparse matrix
880  , typename MT2 > // Type of the right-hand side sparse matrix
881 inline decltype(auto)
882  operator-( const SparseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,false>& rhs )
883 {
885 
886  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() ) {
887  BLAZE_THROW_INVALID_ARGUMENT( "Matrix sizes do not match" );
888  }
889 
890  using ReturnType = const SMatSMatSubExpr<MT1,MT2>;
891  return ReturnType( ~lhs, ~rhs );
892 }
893 //*************************************************************************************************
894 
895 
896 
897 
898 //=================================================================================================
899 //
900 // ROWS SPECIALIZATIONS
901 //
902 //=================================================================================================
903 
904 //*************************************************************************************************
906 template< typename MT1, typename MT2 >
907 struct Rows< SMatSMatSubExpr<MT1,MT2> >
908  : public Maximum< Rows<MT1>, Rows<MT2> >
909 {};
911 //*************************************************************************************************
912 
913 
914 
915 
916 //=================================================================================================
917 //
918 // COLUMNS SPECIALIZATIONS
919 //
920 //=================================================================================================
921 
922 //*************************************************************************************************
924 template< typename MT1, typename MT2 >
925 struct Columns< SMatSMatSubExpr<MT1,MT2> >
926  : public Maximum< Columns<MT1>, Columns<MT2> >
927 {};
929 //*************************************************************************************************
930 
931 
932 
933 
934 //=================================================================================================
935 //
936 // ISSYMMETRIC SPECIALIZATIONS
937 //
938 //=================================================================================================
939 
940 //*************************************************************************************************
942 template< typename MT1, typename MT2 >
943 struct IsSymmetric< SMatSMatSubExpr<MT1,MT2> >
944  : public BoolConstant< IsSymmetric<MT1>::value && IsSymmetric<MT2>::value >
945 {};
947 //*************************************************************************************************
948 
949 
950 
951 
952 //=================================================================================================
953 //
954 // ISHERMITIAN SPECIALIZATIONS
955 //
956 //=================================================================================================
957 
958 //*************************************************************************************************
960 template< typename MT1, typename MT2 >
961 struct IsHermitian< SMatSMatSubExpr<MT1,MT2> >
962  : public BoolConstant< IsHermitian<MT1>::value && IsHermitian<MT2>::value >
963 {};
965 //*************************************************************************************************
966 
967 
968 
969 
970 //=================================================================================================
971 //
972 // ISLOWER SPECIALIZATIONS
973 //
974 //=================================================================================================
975 
976 //*************************************************************************************************
978 template< typename MT1, typename MT2 >
979 struct IsLower< SMatSMatSubExpr<MT1,MT2> >
980  : public BoolConstant< And< IsLower<MT1>, IsLower<MT2> >::value >
981 {};
983 //*************************************************************************************************
984 
985 
986 
987 
988 //=================================================================================================
989 //
990 // ISUNILOWER SPECIALIZATIONS
991 //
992 //=================================================================================================
993 
994 //*************************************************************************************************
996 template< typename MT1, typename MT2 >
997 struct IsUniLower< SMatSMatSubExpr<MT1,MT2> >
998  : public BoolConstant< And< IsUniLower<MT1>, IsStrictlyLower<MT2> >::value >
999 {};
1001 //*************************************************************************************************
1002 
1003 
1004 
1005 
1006 //=================================================================================================
1007 //
1008 // ISSTRICTLYLOWER SPECIALIZATIONS
1009 //
1010 //=================================================================================================
1011 
1012 //*************************************************************************************************
1014 template< typename MT1, typename MT2 >
1015 struct IsStrictlyLower< SMatSMatSubExpr<MT1,MT2> >
1016  : public BoolConstant< And< IsStrictlyLower<MT1>, IsStrictlyLower<MT2> >::value >
1017 {};
1019 //*************************************************************************************************
1020 
1021 
1022 
1023 
1024 //=================================================================================================
1025 //
1026 // ISUPPER SPECIALIZATIONS
1027 //
1028 //=================================================================================================
1029 
1030 //*************************************************************************************************
1032 template< typename MT1, typename MT2 >
1033 struct IsUpper< SMatSMatSubExpr<MT1,MT2> >
1034  : public BoolConstant< And< IsUpper<MT1>, IsUpper<MT2> >::value >
1035 {};
1037 //*************************************************************************************************
1038 
1039 
1040 
1041 
1042 //=================================================================================================
1043 //
1044 // ISUNIUPPER SPECIALIZATIONS
1045 //
1046 //=================================================================================================
1047 
1048 //*************************************************************************************************
1050 template< typename MT1, typename MT2 >
1051 struct IsUniUpper< SMatSMatSubExpr<MT1,MT2> >
1052  : public BoolConstant< And< IsUniUpper<MT1>, IsStrictlyUpper<MT2> >::value >
1053 {};
1055 //*************************************************************************************************
1056 
1057 
1058 
1059 
1060 //=================================================================================================
1061 //
1062 // ISSTRICTLYUPPER SPECIALIZATIONS
1063 //
1064 //=================================================================================================
1065 
1066 //*************************************************************************************************
1068 template< typename MT1, typename MT2 >
1069 struct IsStrictlyUpper< SMatSMatSubExpr<MT1,MT2> >
1070  : public BoolConstant< And< IsStrictlyUpper<MT1>, IsStrictlyUpper<MT2> >::value >
1071 {};
1073 //*************************************************************************************************
1074 
1075 } // namespace blaze
1076 
1077 #endif
If_< IsExpression< MT2 >, const MT2, const MT2 &> RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:176
size_t rows() const noexcept
Returns the current number of rows of the matrix.
Definition: SMatSMatSubExpr.h:237
Constraint on the data type.
#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
Header file for auxiliary alias declarations.
ResultType_< MT2 > RT2
Result type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:109
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 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 the subtraction trait.
Header file for basic type definitions.
SubTrait_< RT1, RT2 > ResultType
Result type for expression template evaluations.
Definition: SMatSMatSubExpr.h:161
EnableIf_< IsDenseMatrix< MT1 > > smpSubAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the SMP subtraction assignment of a matrix to dense matrix.
Definition: DenseMatrix.h:164
Header file for the serial shim.
Generic wrapper for a compile time constant integral value.The IntegralConstant class template repres...
Definition: IntegralConstant.h:71
ReturnType_< MT1 > RN1
ReturnType type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:110
bool isAliased(const T *alias) const noexcept
Returns whether the expression is aliased with the given address alias.
Definition: SMatSMatSubExpr.h:312
size_t columns() const noexcept
Returns the current number of columns of the matrix.
Definition: SMatSMatSubExpr.h:247
typename DisableIf< Condition, T >::Type DisableIf_
Auxiliary type for the DisableIf class template.The DisableIf_ alias declaration provides a convenien...
Definition: DisableIf.h:224
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
const ResultType CompositeType
Data type for composite expression templates.
Definition: SMatSMatSubExpr.h:170
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
Constraints on the storage order of matrix types.
size_t nonZeros(size_t i) const
Returns the number of non-zero elements in the specified row.
Definition: SMatSMatSubExpr.h:268
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
EnableIf_< IsDenseMatrix< MT1 > > smpAddAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the SMP addition assignment of a matrix to a dense matrix.
Definition: DenseMatrix.h:133
Base class for dense matrices.The DenseMatrix class is a base class for all dense matrix classes...
Definition: DenseMatrix.h:78
Base class for sparse matrices.The SparseMatrix class is a base class for all sparse matrix classes...
Definition: Forward.h:129
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
ReturnType at(size_t i, size_t j) const
Checked access to the matrix elements.
Definition: SMatSMatSubExpr.h:221
typename T::ReturnType ReturnType_
Alias declaration for nested ReturnType type definitions.The ReturnType_ alias declaration provides a...
Definition: Aliases.h:363
Header file for the SparseMatrix base class.
typename SubExprTrait< T1, T2 >::Type SubExprTrait_
Auxiliary alias declaration for the SubExprTrait class template.The SubExprTrait_ alias declaration p...
Definition: SubExprTrait.h:112
Constraint on the data type.
Header file for the Maximum class template.
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 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
bool canAlias(const T *alias) const noexcept
Returns whether the expression can alias with the given address alias.
Definition: SMatSMatSubExpr.h:300
ResultType_< MT1 > RT1
Result type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:108
#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
CompositeType_< MT2 > CT2
Composite type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:113
Header file for the Columns type trait.
typename T::ElementType ElementType_
Alias declaration for nested ElementType type definitions.The ElementType_ alias declaration provides...
Definition: Aliases.h:163
Header file for the MatMatSubExpr base class.
Header file for the IsLower type trait.
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.
Compile time check for strictly upper triangular matrices.This type trait tests whether or not the gi...
Definition: IsStrictlyUpper.h:86
BLAZE_ALWAYS_INLINE MT::Iterator end(Matrix< MT, SO > &matrix, size_t i)
Returns an iterator just past the last element of row/column i.
Definition: Matrix.h:264
LeftOperand lhs_
Left-hand side sparse matrix of the subtraction expression.
Definition: SMatSMatSubExpr.h:319
const IfTrue_< returnExpr, ExprReturnType, ElementType > ReturnType
Return type for expression template evaluations.
Definition: SMatSMatSubExpr.h:167
Constraint on the data type.
Header file for all forward declarations for expression class templates.
SubExprTrait_< RN1, RN2 > ExprReturnType
Expression return type for the subscript operator.
Definition: SMatSMatSubExpr.h:126
Header file for the EnableIf class template.
Header file for the IsStrictlyLower type trait.
ReturnType_< MT2 > RN2
ReturnType type of the right-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:111
Compile time check for lower unitriangular matrices.This type trait tests whether or not the given te...
Definition: IsUniLower.h:86
CompositeType_< MT1 > CT1
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:112
Compile time check for resizable data types.This type trait tests whether the given data type is a re...
Definition: IsResizable.h:75
OppositeType_< ResultType > OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: SMatSMatSubExpr.h:162
#define BLAZE_CONSTRAINT_MUST_NOT_BE_SYMMETRIC_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is a symmetric matrix type, a compilation error is created.
Definition: Symmetric.h:79
#define BLAZE_CONSTRAINT_MUST_BE_ROW_MAJOR_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a row-major dense or sparse matrix t...
Definition: RowMajorMatrix.h:61
If_< IsExpression< MT1 >, const MT1, const MT1 &> LeftOperand
Composite type of the left-hand side sparse matrix expression.
Definition: SMatSMatSubExpr.h:173
Header file for run time assertion macros.
ElementType_< ResultType > ElementType
Resulting element type.
Definition: SMatSMatSubExpr.h:164
Expression object for sparse matrix-sparse matrix subtractions.The SMatSMatSubExpr class represents t...
Definition: Forward.h:119
RightOperand rhs_
Right-hand side sparse matrix of the subtraction expression.
Definition: SMatSMatSubExpr.h:320
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
RightOperand rightOperand() const noexcept
Returns the right-hand side sparse matrix operand.
Definition: SMatSMatSubExpr.h:288
#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
Header file for the isDefault shim.
Compile time check for Hermitian matrices.This type trait tests whether or not the given template par...
Definition: IsHermitian.h:85
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: SMatSMatSubExpr.h:206
Constraint on the data type.
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
Header file for the RemoveReference type trait.
typename EnableIf< Condition, T >::Type EnableIf_
Auxiliary alias declaration for the EnableIf class template.The EnableIf_ alias declaration provides ...
Definition: EnableIf.h:224
typename T::OppositeType OppositeType_
Alias declaration for nested OppositeType type definitions.The OppositeType_ alias declaration provid...
Definition: Aliases.h:263
Compile time check for strictly lower triangular matrices.This type trait tests whether or not the gi...
Definition: IsStrictlyLower.h:86
LeftOperand leftOperand() const noexcept
Returns the left-hand side sparse matrix operand.
Definition: SMatSMatSubExpr.h:278
const Type & ReturnType
Return type for expression template evaluations.
Definition: CompressedMatrix.h:3082
typename T::ConstIterator ConstIterator_
Alias declaration for nested ConstIterator type definitions.The ConstIterator_ alias declaration prov...
Definition: Aliases.h:103
decltype(auto) trans(const DenseMatrix< MT, SO > &dm)
Calculation of the transpose of the given dense matrix.
Definition: DMatTransExpr.h:790
Header file for the IsComputation type trait class.
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: SMatSMatSubExpr.h:257
typename SubTrait< T1, T2 >::Type SubTrait_
Auxiliary alias declaration for the SubTrait class template.The SubTrait_ alias declaration provides ...
Definition: SubTrait.h:250
SMatSMatSubExpr(const MT1 &lhs, const MT2 &rhs) noexcept
Constructor for the SMatSMatSubExpr class.
Definition: SMatSMatSubExpr.h:190
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
Compile time evaluation of the number of rows of a matrix.The Rows type trait evaluates the number of...
Definition: Rows.h:75
#define BLAZE_CONSTRAINT_MUST_FORM_VALID_MATMATSUBEXPR(T1, T2)
Constraint on the data type.In case the given data types T1 and T2 do not form a valid matrix/matrix ...
Definition: MatMatSubExpr.h:108
bool isDefault(const DiagonalProxy< MT > &proxy)
Returns whether the represented element is in default state.
Definition: DiagonalProxy.h:600
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.
TransposeType_< ResultType > TransposeType
Transpose type for expression template evaluations.
Definition: SMatSMatSubExpr.h:163
Header file for the IsHermitian type trait.
Header file for the IsResizable type trait.
Header file for the SubExprTrait class template.
#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:61
Header file for the IsExpression type trait class.
Header file for the function trace functionality.