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 <utility>
45 #include <blaze/math/Aliases.h>
53 #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/If.h>
78 #include <blaze/util/mpl/Maximum.h>
79 #include <blaze/util/Types.h>
81 #include <blaze/util/Unused.h>
82 
83 
84 namespace blaze {
85 
86 //=================================================================================================
87 //
88 // CLASS DMATTSMATSCHUREXPR
89 //
90 //=================================================================================================
91 
92 //*************************************************************************************************
99 template< typename MT1 // Type of the left-hand side dense matrix
100  , typename MT2 > // Type of the right-hand side sparse matrix
102  : public SchurExpr< SparseMatrix< DMatTSMatSchurExpr<MT1,MT2>, true > >
103  , private Computation
104 {
105  private:
106  //**Type definitions****************************************************************************
113  //**********************************************************************************************
114 
115  //**Return type evaluation**********************************************************************
117 
122  static constexpr bool returnExpr = ( !IsTemporary_v<RN1> && !IsTemporary_v<RN2> );
123 
125  using ExprReturnType = decltype( std::declval<RN1>() * std::declval<RN2>() );
126  //**********************************************************************************************
127 
128  //**Evaluation strategy*************************************************************************
130 
136  static constexpr bool useAssign = ( RequiresEvaluation_v<MT1> || RequiresEvaluation_v<MT2> );
137 
139  template< typename MT >
141  static constexpr bool UseAssign_v = useAssign;
143  //**********************************************************************************************
144 
145  public:
146  //**Type definitions****************************************************************************
153 
156 
159 
161  using LeftOperand = If_t< IsExpression_v<MT1>, const MT1, const MT1& >;
162 
164  using RightOperand = If_t< IsExpression_v<MT2>, const MT2, const MT2& >;
165  //**********************************************************************************************
166 
167  //**ConstIterator class definition**************************************************************
171  {
172  public:
173  //**Type definitions*************************************************************************
176 
179 
180  using IteratorCategory = std::forward_iterator_tag;
181  using ValueType = Element;
185 
186  // STL iterator requirements
192  //*******************************************************************************************
193 
194  //**Constructor******************************************************************************
201  inline ConstIterator( LeftOperand left, RightIterator right, size_t column )
202  : left_ ( left ) // Left-hand side dense matrix expression
203  , right_( right ) // Iterator over the elements of the right-hand side sparse matrix expression
204  , col_ ( column ) // The column index of the iterator
205  {}
206  //*******************************************************************************************
207 
208  //**Prefix increment operator****************************************************************
214  ++right_;
215  return *this;
216  }
217  //*******************************************************************************************
218 
219  //**Element access operator******************************************************************
224  inline const Element operator*() const {
225  return Element( left_(right_->index(),col_) * right_->value(), right_->index() );
226  }
227  //*******************************************************************************************
228 
229  //**Element access operator******************************************************************
234  inline const ConstIterator* operator->() const {
235  return this;
236  }
237  //*******************************************************************************************
238 
239  //**Value function***************************************************************************
244  inline ReturnType value() const {
245  return left_(right_->index(),col_) * right_->value();
246  }
247  //*******************************************************************************************
248 
249  //**Index function***************************************************************************
254  inline size_t index() const {
255  return right_->index();
256  }
257  //*******************************************************************************************
258 
259  //**Equality operator************************************************************************
265  inline bool operator==( const ConstIterator& rhs ) const {
266  return right_ == rhs.right_;
267  }
268  //*******************************************************************************************
269 
270  //**Inequality operator**********************************************************************
276  inline bool operator!=( const ConstIterator& rhs ) const {
277  return right_ != rhs.right_;
278  }
279  //*******************************************************************************************
280 
281  //**Subtraction operator*********************************************************************
287  inline DifferenceType operator-( const ConstIterator& rhs ) const {
288  return right_ - rhs.right_;
289  }
290  //*******************************************************************************************
291 
292  private:
293  //**Member variables*************************************************************************
296  size_t col_;
297  //*******************************************************************************************
298  };
299  //**********************************************************************************************
300 
301  //**Compilation flags***************************************************************************
303  static constexpr bool smpAssignable = false;
304  //**********************************************************************************************
305 
306  //**Constructor*********************************************************************************
312  explicit inline DMatTSMatSchurExpr( const MT1& lhs, const MT2& rhs ) noexcept
313  : lhs_( lhs ) // Left-hand side dense matrix of the Schur product expression
314  , rhs_( rhs ) // Right-hand side sparse matrix of the Schur product expression
315  {
316  BLAZE_INTERNAL_ASSERT( lhs.rows() == rhs.rows() , "Invalid number of rows" );
317  BLAZE_INTERNAL_ASSERT( lhs.columns() == rhs.columns(), "Invalid number of columns" );
318  }
319  //**********************************************************************************************
320 
321  //**Access operator*****************************************************************************
328  inline ReturnType operator()( size_t i, size_t j ) const {
329  BLAZE_INTERNAL_ASSERT( i < lhs_.rows() , "Invalid row access index" );
330  BLAZE_INTERNAL_ASSERT( j < lhs_.columns(), "Invalid column access index" );
331  return lhs_(i,j) * rhs_(i,j);
332  }
333  //**********************************************************************************************
334 
335  //**At function*********************************************************************************
343  inline ReturnType at( size_t i, size_t j ) const {
344  if( i >= lhs_.rows() ) {
345  BLAZE_THROW_OUT_OF_RANGE( "Invalid row access index" );
346  }
347  if( j >= lhs_.columns() ) {
348  BLAZE_THROW_OUT_OF_RANGE( "Invalid column access index" );
349  }
350  return (*this)(i,j);
351  }
352  //**********************************************************************************************
353 
354  //**Begin function******************************************************************************
360  inline ConstIterator begin( size_t j ) const {
361  return ConstIterator( lhs_, rhs_.begin(j), j );
362  }
363  //**********************************************************************************************
364 
365  //**End function********************************************************************************
371  inline ConstIterator end( size_t j ) const {
372  return ConstIterator( lhs_, rhs_.end(j), j );
373  }
374  //**********************************************************************************************
375 
376  //**Rows function*******************************************************************************
381  inline size_t rows() const noexcept {
382  return lhs_.rows();
383  }
384  //**********************************************************************************************
385 
386  //**Columns function****************************************************************************
391  inline size_t columns() const noexcept {
392  return lhs_.columns();
393  }
394  //**********************************************************************************************
395 
396  //**NonZeros function***************************************************************************
401  inline size_t nonZeros() const {
402  return rhs_.nonZeros();
403  }
404  //**********************************************************************************************
405 
406  //**NonZeros function***************************************************************************
412  inline size_t nonZeros( size_t j ) const {
413  return rhs_.nonZeros(j);
414  }
415  //**********************************************************************************************
416 
417  //**Find function*******************************************************************************
424  inline ConstIterator find( size_t i, size_t j ) const {
426  return ConstIterator( lhs_, rhs_.find( i, j ), j );
427  }
428  //**********************************************************************************************
429 
430  //**LowerBound function*************************************************************************
437  inline ConstIterator lowerBound( size_t i, size_t j ) const {
439  return ConstIterator( lhs_, rhs_.lowerBound( i, j ), j );
440  }
441  //**********************************************************************************************
442 
443  //**UpperBound function*************************************************************************
450  inline ConstIterator upperBound( size_t i, size_t j ) const {
452  return ConstIterator( lhs_, rhs_.upperBound( i, j ), j );
453  }
454  //**********************************************************************************************
455 
456  //**Left operand access*************************************************************************
461  inline LeftOperand leftOperand() const noexcept {
462  return lhs_;
463  }
464  //**********************************************************************************************
465 
466  //**Right operand access************************************************************************
471  inline RightOperand rightOperand() const noexcept {
472  return rhs_;
473  }
474  //**********************************************************************************************
475 
476  //**********************************************************************************************
482  template< typename T >
483  inline bool canAlias( const T* alias ) const noexcept {
484  return ( lhs_.isAliased( alias ) || rhs_.canAlias( alias ) );
485  }
486  //**********************************************************************************************
487 
488  //**********************************************************************************************
494  template< typename T >
495  inline bool isAliased( const T* alias ) const noexcept {
496  return ( lhs_.isAliased( alias ) || rhs_.isAliased( alias ) );
497  }
498  //**********************************************************************************************
499 
500  private:
501  //**Member variables****************************************************************************
504  //**********************************************************************************************
505 
506  //**Assignment to dense matrices****************************************************************
518  template< typename MT // Type of the target dense matrix
519  , bool SO2 > // Storage order of the target dense matrix
520  friend inline auto assign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
522  {
524 
525  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
526  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
527 
528  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
529  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
530 
531  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
532  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
533  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
534  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
535  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
536  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
537 
538  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
539  for( auto element=B.begin(j); element!=B.end(j); ++element )
540  (~lhs)(element->index(),j) = A(element->index(),j) * element->value();
541  }
542  }
544  //**********************************************************************************************
545 
546  //**Assignment to row-major sparse matrices*****************************************************
559  template< typename MT > // Type of the target sparse matrix
560  friend inline auto assign( SparseMatrix<MT,false>& lhs, const DMatTSMatSchurExpr& rhs )
562  {
564 
565  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
566  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
567 
568  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
569  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
570 
571  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
572  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
573  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
574  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
575  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
576  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
577 
578  const size_t m( rhs.rows() );
579  const size_t n( rhs.columns() );
580 
581  // Counting the number of elements per column
582  std::vector<size_t> nonzeros( m, 0UL );
583  for( size_t j=0UL; j<n; ++j ) {
584  const auto lend( B.end(j) );
585  for( auto l=B.begin(j); l!=lend; ++l ) {
586  ++nonzeros[l->index()];
587  }
588  }
589 
590  // Resizing the left-hand side sparse matrix
591  for( size_t i=0UL; i<m; ++i ) {
592  (~lhs).reserve( i, nonzeros[i] );
593  }
594 
595  // Performing the Schur product
596  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
597  for( auto element=B.begin(j); element!=B.end(j); ++element )
598  (~lhs).append( element->index(), j, A(element->index(),j) * element->value() );
599  }
600  }
602  //**********************************************************************************************
603 
604  //**Assignment to column-major sparse matrices**************************************************
617  template< typename MT > // Type of the target sparse matrix
618  friend inline auto assign( SparseMatrix<MT,true>& lhs, const DMatTSMatSchurExpr& rhs )
619  -> EnableIf_t< UseAssign_v<MT> >
620  {
622 
623  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
624  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
625 
626  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
627  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
628 
629  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
630  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
631  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
632  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
633  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
634  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
635 
636  // Final memory allocation (based on the evaluated operands)
637  (~lhs).reserve( B.nonZeros() );
638 
639  // Performing the Schur product
640  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
641  for( auto element=B.begin(j); element!=B.end(j); ++element )
642  (~lhs).append( element->index(), j, A(element->index(),j) * element->value() );
643  (~lhs).finalize( j );
644  }
645  }
647  //**********************************************************************************************
648 
649  //**Addition assignment to dense matrices*******************************************************
662  template< typename MT // Type of the target dense matrix
663  , bool SO2 > // Storage order of the target dense matrix
664  friend inline auto addAssign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
665  -> EnableIf_t< UseAssign_v<MT> >
666  {
668 
669  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
670  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
671 
672  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
673  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
674 
675  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
676  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
677  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
678  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
679  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
680  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
681 
682  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
683  for( auto element=B.begin(j); element!=B.end(j); ++element )
684  (~lhs)(element->index(),j) += A(element->index(),j) * element->value();
685  }
686  }
688  //**********************************************************************************************
689 
690  //**Addition assignment to sparse matrices******************************************************
691  // No special implementation for the addition assignment to sparse matrices.
692  //**********************************************************************************************
693 
694  //**Subtraction assignment to dense matrices****************************************************
707  template< typename MT // Type of the target dense matrix
708  , bool SO2 > // Storage order of the target dense matrix
709  friend inline auto subAssign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
710  -> EnableIf_t< UseAssign_v<MT> >
711  {
713 
714  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
715  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
716 
717  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
718  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
719 
720  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
721  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
722  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
723  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
724  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
725  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
726 
727  for( size_t j=0UL; j<(~lhs).columns(); ++j ) {
728  for( auto element=B.begin(j); element!=B.end(j); ++element )
729  (~lhs)(element->index(),j) -= A(element->index(),j) * element->value();
730  }
731  }
733  //**********************************************************************************************
734 
735  //**Subtraction assignment to sparse matrices***************************************************
736  // No special implementation for the subtraction assignment to sparse matrices.
737  //**********************************************************************************************
738 
739  //**Schur product assignment to dense matrices**************************************************
752  template< typename MT // Type of the target dense matrix
753  , bool SO2 > // Storage order of the target dense matrix
754  friend inline void schurAssign( DenseMatrix<MT,SO2>& lhs, const DMatTSMatSchurExpr& rhs )
755  {
757 
758  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
759  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
760 
761  CT1 A( serial( rhs.lhs_ ) ); // Evaluation of the left-hand side dense matrix operand
762  CT2 B( serial( rhs.rhs_ ) ); // Evaluation of the right-hand side sparse matrix operand
763 
764  BLAZE_INTERNAL_ASSERT( A.rows() == rhs.lhs_.rows() , "Invalid number of rows" );
765  BLAZE_INTERNAL_ASSERT( A.columns() == rhs.lhs_.columns(), "Invalid number of columns" );
766  BLAZE_INTERNAL_ASSERT( B.rows() == rhs.rhs_.rows() , "Invalid number of rows" );
767  BLAZE_INTERNAL_ASSERT( B.columns() == rhs.rhs_.columns(), "Invalid number of columns" );
768  BLAZE_INTERNAL_ASSERT( A.rows() == (~lhs).rows() , "Invalid number of rows" );
769  BLAZE_INTERNAL_ASSERT( A.columns() == (~lhs).columns() , "Invalid number of columns" );
770 
771  for( size_t j=0UL; j<(~lhs).columns(); ++j )
772  {
773  const auto end( B.end(j) );
774  auto begin( B.begin(j) );
775  size_t i( 0UL );
776 
777  for( ; begin!=end; ++begin ) {
778  const size_t index( begin->index() );
779  for( ; i<index; ++i )
780  reset( (~lhs)(i,j) );
781  (~lhs)(index,j) *= A(index,j) * begin->value();
782  ++i;
783  }
784 
785  for( ; i<(~lhs).rows(); ++i )
786  reset( (~lhs)(i,j) );
787  }
788  }
790  //**********************************************************************************************
791 
792  //**Schur product assignment to sparse matrices*************************************************
793  // No special implementation for the Schur product assignment to sparse matrices.
794  //**********************************************************************************************
795 
796  //**Multiplication assignment to dense matrices*************************************************
797  // No special implementation for the multiplication assignment to dense matrices.
798  //**********************************************************************************************
799 
800  //**Multiplication assignment to sparse matrices************************************************
801  // No special implementation for the multiplication assignment to sparse matrices.
802  //**********************************************************************************************
803 
804  //**SMP assignment to dense matrices************************************************************
805  // No special implementation for the SMP assignment to dense matrices.
806  //**********************************************************************************************
807 
808  //**SMP assignment to sparse matrices***********************************************************
809  // No special implementation for the SMP assignment to sparse matrices.
810  //**********************************************************************************************
811 
812  //**SMP addition assignment to dense matrices***************************************************
813  // No special implementation for the SMP addition assignment to dense matrices.
814  //**********************************************************************************************
815 
816  //**SMP addition assignment to sparse matrices**************************************************
817  // No special implementation for the SMP addition assignment to sparse matrices.
818  //**********************************************************************************************
819 
820  //**SMP subtraction assignment to dense matrices************************************************
821  // No special implementation for the SMP subtraction assignment to dense matrices.
822  //**********************************************************************************************
823 
824  //**SMP subtraction assignment to sparse matrices***********************************************
825  // No special implementation for the SMP subtraction assignment to sparse matrices.
826  //**********************************************************************************************
827 
828  //**SMP Schur product assignment to dense matrices**********************************************
841  template< typename MT // Type of the target dense matrix
842  , bool SO > // Storage order of the target dense matrix
843  friend inline void smpSchurAssign( DenseMatrix<MT,SO>& lhs, const DMatTSMatSchurExpr& rhs )
844  {
846 
847  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == rhs.rows() , "Invalid number of rows" );
848  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == rhs.columns(), "Invalid number of columns" );
849 
850  smpSchurAssign( ~lhs, rhs.lhs_ );
851  smpSchurAssign( ~lhs, rhs.rhs_ );
852  }
854  //**********************************************************************************************
855 
856  //**SMP Schur product assignment to sparse matrices*********************************************
857  // No special implementation for the SMP Schur product assignment to sparse matrices.
858  //**********************************************************************************************
859 
860  //**SMP multiplication assignment to dense matrices*********************************************
861  // No special implementation for the SMP multiplication assignment to dense matrices.
862  //**********************************************************************************************
863 
864  //**SMP multiplication assignment to sparse matrices********************************************
865  // No special implementation for the SMP multiplication assignment to sparse matrices.
866  //**********************************************************************************************
867 
868  //**Compile time checks*************************************************************************
876  //**********************************************************************************************
877 };
878 //*************************************************************************************************
879 
880 
881 
882 
883 //=================================================================================================
884 //
885 // GLOBAL BINARY ARITHMETIC OPERATORS
886 //
887 //=================================================================================================
888 
889 //*************************************************************************************************
902 template< typename MT1 // Type of the left-hand side dense matrix
903  , typename MT2 // Type of the right-hand side sparse matrix
904  , DisableIf_t< ( IsUniLower_v<MT1> && IsUniUpper_v<MT2> ) ||
905  ( IsUniUpper_v<MT1> && IsUniLower_v<MT2> ) ||
906  ( IsStrictlyLower_v<MT1> && IsUpper_v<MT2> ) ||
907  ( IsStrictlyUpper_v<MT1> && IsLower_v<MT2> ) ||
908  ( IsLower_v<MT1> && IsStrictlyUpper_v<MT2> ) ||
909  ( IsUpper_v<MT1> && IsStrictlyLower_v<MT2> ) ||
910  IsZero_v<MT2> >* = nullptr >
911 inline const DMatTSMatSchurExpr<MT1,MT2>
912  dmattsmatschur( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
913 {
915 
916  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
917  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
918 
919  return DMatTSMatSchurExpr<MT1,MT2>( ~lhs, ~rhs );
920 }
922 //*************************************************************************************************
923 
924 
925 //*************************************************************************************************
939 template< typename MT1 // Type of the left-hand side dense matrix
940  , typename MT2 // Type of the right-hand side sparse matrix
941  , EnableIf_t< ( IsUniLower_v<MT1> && IsUniUpper_v<MT2> ) ||
942  ( IsUniUpper_v<MT1> && IsUniLower_v<MT2> ) >* = nullptr >
943 inline decltype(auto)
944  dmattsmatschur( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
945 {
947 
948  UNUSED_PARAMETER( rhs );
949 
950  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
951  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
952 
953  using ReturnType = const SchurTrait_t< ResultType_t<MT1>, ResultType_t<MT2> >;
954 
957 
958  return ReturnType( (~lhs).rows() );
959 }
961 //*************************************************************************************************
962 
963 
964 //*************************************************************************************************
978 template< typename MT1 // Type of the left-hand side dense matrix
979  , typename MT2 // Type of the right-hand side sparse matrix
980  , EnableIf_t< ( IsStrictlyLower_v<MT1> && IsUpper_v<MT2> ) ||
981  ( IsStrictlyUpper_v<MT1> && IsLower_v<MT2> ) ||
982  ( IsLower_v<MT1> && IsStrictlyUpper_v<MT2> ) ||
983  ( IsUpper_v<MT1> && IsStrictlyLower_v<MT2> ) ||
984  IsZero_v<MT2> >* = nullptr >
985 inline decltype(auto)
986  dmattsmatschur( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
987 {
989 
990  UNUSED_PARAMETER( rhs );
991 
992  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
993  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
994 
995  using ReturnType = const SchurTrait_t< ResultType_t<MT1>, ResultType_t<MT2> >;
996 
999 
1000  return ReturnType( (~lhs).rows(), (~lhs).columns() );
1001 }
1003 //*************************************************************************************************
1004 
1005 
1006 //*************************************************************************************************
1036 template< typename MT1 // Type of the left-hand side dense matrix
1037  , typename MT2 > // Type of the right-hand side sparse matrix
1038 inline decltype(auto)
1039  operator%( const DenseMatrix<MT1,false>& lhs, const SparseMatrix<MT2,true>& rhs )
1040 {
1042 
1043  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() ) {
1044  BLAZE_THROW_INVALID_ARGUMENT( "Matrix sizes do not match" );
1045  }
1046 
1047  return dmattsmatschur( ~lhs, ~rhs );
1048 }
1049 //*************************************************************************************************
1050 
1051 
1052 //*************************************************************************************************
1065 template< typename MT1 // Type of the left-hand side dense matrix
1066  , typename MT2 // Type of the right-hand side sparse matrix
1067  , DisableIf_t< ( IsUniLower_v<MT1> && IsUniUpper_v<MT2> ) ||
1068  ( IsUniUpper_v<MT1> && IsUniLower_v<MT2> ) ||
1069  ( IsStrictlyLower_v<MT1> && IsUpper_v<MT2> ) ||
1070  ( IsStrictlyUpper_v<MT1> && IsLower_v<MT2> ) ||
1071  ( IsLower_v<MT1> && IsStrictlyUpper_v<MT2> ) ||
1072  ( IsUpper_v<MT1> && IsStrictlyLower_v<MT2> ) ||
1073  IsZero_v<MT2> >* = nullptr >
1074 inline const DMatTSMatSchurExpr<MT1,MT2>
1075  tdmattsmatschur( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1076 {
1078 
1079  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
1080  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
1081 
1082  return DMatTSMatSchurExpr<MT1,MT2>( ~lhs, ~rhs );
1083 }
1084 //*************************************************************************************************
1085 
1086 
1087 //*************************************************************************************************
1101 template< typename MT1 // Type of the left-hand side dense matrix
1102  , typename MT2 // Type of the right-hand side sparse matrix
1103  , EnableIf_t< ( IsUniLower_v<MT1> && IsUniUpper_v<MT2> ) ||
1104  ( IsUniUpper_v<MT1> && IsUniLower_v<MT2> ) >* = nullptr >
1105 inline decltype(auto)
1106  tdmattsmatschur( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1107 {
1109 
1110  UNUSED_PARAMETER( rhs );
1111 
1112  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
1113  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
1114 
1115  using ReturnType = const SchurTrait_t< ResultType_t<MT1>, ResultType_t<MT2> >;
1116 
1119 
1120  return ReturnType( (~lhs).rows() );
1121 }
1123 //*************************************************************************************************
1124 
1125 
1126 //*************************************************************************************************
1140 template< typename MT1 // Type of the left-hand side dense matrix
1141  , typename MT2 // Type of the right-hand side sparse matrix
1142  , EnableIf_t< ( IsStrictlyLower_v<MT1> && IsUpper_v<MT2> ) ||
1143  ( IsStrictlyUpper_v<MT1> && IsLower_v<MT2> ) ||
1144  ( IsLower_v<MT1> && IsStrictlyUpper_v<MT2> ) ||
1145  ( IsUpper_v<MT1> && IsStrictlyLower_v<MT2> ) ||
1146  IsZero_v<MT2> >* = nullptr >
1147 inline decltype(auto)
1148  tdmattsmatschur( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1149 {
1151 
1152  UNUSED_PARAMETER( rhs );
1153 
1154  BLAZE_INTERNAL_ASSERT( (~lhs).rows() == (~rhs).rows() , "Invalid number of rows" );
1155  BLAZE_INTERNAL_ASSERT( (~lhs).columns() == (~rhs).columns(), "Invalid number of columns" );
1156 
1157  using ReturnType = const SchurTrait_t< ResultType_t<MT1>, ResultType_t<MT2> >;
1158 
1161 
1162  return ReturnType( (~lhs).rows(), (~lhs).columns() );
1163 }
1165 //*************************************************************************************************
1166 
1167 
1168 //*************************************************************************************************
1197 template< typename MT1 // Type of the left-hand side dense matrix
1198  , typename MT2 > // Type of the right-hand side sparse matrix
1199 inline decltype(auto)
1200  operator%( const DenseMatrix<MT1,true>& lhs, const SparseMatrix<MT2,true>& rhs )
1201 {
1203 
1204  if( (~lhs).rows() != (~rhs).rows() || (~lhs).columns() != (~rhs).columns() ) {
1205  BLAZE_THROW_INVALID_ARGUMENT( "Matrix sizes do not match" );
1206  }
1207 
1208  return tdmattsmatschur( ~lhs, ~rhs );
1209 }
1210 //*************************************************************************************************
1211 
1212 
1213 
1214 
1215 //=================================================================================================
1216 //
1217 // SIZE SPECIALIZATIONS
1218 //
1219 //=================================================================================================
1220 
1221 //*************************************************************************************************
1223 template< typename MT1, typename MT2 >
1224 struct Size< DMatTSMatSchurExpr<MT1,MT2>, 0UL >
1225  : public Maximum< Size<MT1,0UL>, Size<MT2,0UL> >
1226 {};
1227 
1228 template< typename MT1, typename MT2 >
1229 struct Size< DMatTSMatSchurExpr<MT1,MT2>, 1UL >
1230  : public Maximum< Size<MT1,1UL>, Size<MT2,1UL> >
1231 {};
1233 //*************************************************************************************************
1234 
1235 } // namespace blaze
1236 
1237 #endif
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
Pointer difference type of the Blaze library.
Header file for auxiliary alias declarations.
decltype(auto) column(Matrix< MT, SO > &matrix, RCAs... args)
Creating a view on a specific column of the given matrix.
Definition: Column.h:133
#define BLAZE_CONSTRAINT_MUST_BE_IDENTITY_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not an identity matrix type...
Definition: Identity.h:60
Header file for the Schur product trait.
Header file for the UNUSED_PARAMETER function template.
Header file for the IsUniUpper type trait.
Header file for basic type definitions.
ConstIterator(LeftOperand left, RightIterator right, size_t column)
Constructor for the ConstIterator class.
Definition: DMatTSMatSchurExpr.h:201
static constexpr bool smpAssignable
Compilation switch for the expression template assignment strategy.
Definition: DMatTSMatSchurExpr.h:303
ValueIndexPair< ElementType > Element
Element type of the sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:175
typename If< Condition, T1, T2 >::Type If_t
Auxiliary alias declaration for the If class template.The If_t alias declaration provides a convenien...
Definition: If.h:109
Expression object for dense matrix-transpose sparse matrix Schur product.The DMatTSMatSchurExpr class...
Definition: DMatTSMatSchurExpr.h:101
typename T::ResultType ResultType_t
Alias declaration for nested ResultType type definitions.The ResultType_t alias declaration provides ...
Definition: Aliases.h:390
Header file for the serial shim.
#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:224
void reset(const DiagonalProxy< MT > &proxy)
Resetting the represented element to the default initial values.
Definition: DiagonalProxy.h:591
OppositeType_t< ResultType > OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:150
Element ValueType
Type of the underlying pointers.
Definition: DMatTSMatSchurExpr.h:181
Constraint on the data type.
size_t col_
The column index of the iterator.
Definition: DMatTSMatSchurExpr.h:296
DifferenceType operator-(const ConstIterator &rhs) const
Calculating the number of elements between two expression iterators.
Definition: DMatTSMatSchurExpr.h:287
Header file for the Computation base class.
constexpr void UNUSED_PARAMETER(const Args &...)
Suppression of unused parameter warnings.
Definition: Unused.h:81
LeftOperand leftOperand() const noexcept
Returns the left-hand side dense matrix operand.
Definition: DMatTSMatSchurExpr.h:461
typename T::ReturnType ReturnType_t
Alias declaration for nested ReturnType type definitions.The ReturnType_t alias declaration provides ...
Definition: Aliases.h:410
Header file for the IsUniLower type trait.
#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:103
constexpr size_t columns(const Matrix< MT, SO > &matrix) noexcept
Returns the current number of columns of the matrix.
Definition: Matrix.h:514
size_t index() const
Access to the current index of the sparse element.
Definition: DMatTSMatSchurExpr.h:254
Base class for dense matrices.The DenseMatrix class is a base class for all dense matrix classes...
Definition: DenseMatrix.h:80
Base class for sparse matrices.The SparseMatrix class is a base class for all sparse matrix classes...
Definition: Forward.h:137
typename T::ElementType ElementType_t
Alias declaration for nested ElementType type definitions.The ElementType_t alias declaration provide...
Definition: Aliases.h:170
Header file for all forward declarations for sparse vectors and matrices.
ReturnType_t< MT1 > RN1
Return type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:109
bool isAliased(const T *alias) const noexcept
Returns whether the expression is aliased with the given address alias.
Definition: DMatTSMatSchurExpr.h:495
Header file for the SparseMatrix base class.
If_t< useAssign, const ResultType, const DMatTSMatSchurExpr &> CompositeType
Data type for composite expression templates.
Definition: DMatTSMatSchurExpr.h:158
ptrdiff_t DifferenceType
Difference between two iterators.
Definition: DMatTSMatSchurExpr.h:184
ResultType_t< MT2 > RT2
Result type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:108
Constraint on the data type.
Constraint on the data type.
static constexpr bool returnExpr
Compilation switch for the selection of the subscript operator return type.
Definition: DMatTSMatSchurExpr.h:122
Header file for the Maximum class template.
typename EnableIf< Condition, T >::Type EnableIf_t
Auxiliary type for the EnableIf class template.The EnableIf_t alias declaration provides a convenient...
Definition: EnableIf.h:138
Header file for the ValueIndexPair class.
Header file for the DisableIf class template.
Header file for the IsTemporary type trait class.
If_t< IsExpression_v< MT1 >, const MT1, const MT1 &> LeftOperand
Composite type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:161
Header file for the IsStrictlyUpper type trait.
Namespace of the Blaze C++ math library.
Definition: Blaze.h:58
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
#define BLAZE_CONSTRAINT_MUST_BE_ZERO_TYPE(T)
Constraint on the data type.In case the given data type T is not a zero vector or matrix type...
Definition: Zero.h:61
ConstIterator & operator++()
Pre-increment operator.
Definition: DMatTSMatSchurExpr.h:213
ValueType & ReferenceType
Reference return type.
Definition: DMatTSMatSchurExpr.h:183
#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_t< MT1 > CT1
Composite type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:111
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:3086
ConstIterator find(size_t i, size_t j) const
Searches for a specific matrix element.
Definition: DMatTSMatSchurExpr.h:424
RightIterator right_
Iterator over the elements of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:295
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:450
std::forward_iterator_tag IteratorCategory
The iterator category.
Definition: DMatTSMatSchurExpr.h:180
ResultType_t< MT1 > RT1
Result type of the left-hand side dense matrix expression.
Definition: DMatTSMatSchurExpr.h:107
Header file for the exception macros of the math module.
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: DMatTSMatSchurExpr.h:328
IteratorCategory iterator_category
The iterator category.
Definition: DMatTSMatSchurExpr.h:187
Constraint on the data type.
DMatTSMatSchurExpr(const MT1 &lhs, const MT2 &rhs) noexcept
Constructor for the DMatTSMatSchurExpr class.
Definition: DMatTSMatSchurExpr.h:312
Header file for all forward declarations for expression class templates.
Header file for the EnableIf class template.
Header file for the IsStrictlyLower type trait.
ReturnType_t< MT2 > RN2
Return type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:110
typename T::OppositeType OppositeType_t
Alias declaration for nested OppositeType type definitions.The OppositeType_t alias declaration provi...
Definition: Aliases.h:270
size_t rows() const noexcept
Returns the current number of rows of the matrix.
Definition: DMatTSMatSchurExpr.h:381
Base class for all Schur product expression templates.The SchurExpr class serves as a tag for all exp...
Definition: SchurExpr.h:66
typename T::TransposeType TransposeType_t
Alias declaration for nested TransposeType type definitions.The TransposeType_t alias declaration pro...
Definition: Aliases.h:470
Header file for run time assertion macros.
typename T::CompositeType CompositeType_t
Alias declaration for nested CompositeType type definitions.The CompositeType_t alias declaration pro...
Definition: Aliases.h:90
static constexpr bool useAssign
Compilation switch for the evaluation strategy of the Schur product expression.
Definition: DMatTSMatSchurExpr.h:136
LeftOperand lhs_
Left-hand side dense matrix of the Schur product expression.
Definition: DMatTSMatSchurExpr.h:502
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:371
size_t nonZeros() const
Returns the number of non-zero elements in the sparse matrix.
Definition: DMatTSMatSchurExpr.h:401
typename SchurTrait< T1, T2 >::Type SchurTrait_t
Auxiliary alias declaration for the SchurTrait class template.The SchurTrait_t alias declaration prov...
Definition: SchurTrait.h:164
Header file for the IsZero type trait.
#define BLAZE_FUNCTION_TRACE
Function trace macro.This macro can be used to reliably trace function calls. In case function tracin...
Definition: FunctionTrace.h:94
ReturnType value() const
Access to the current value of the sparse element.
Definition: DMatTSMatSchurExpr.h:244
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:808
#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
auto smpSchurAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs) -> EnableIf_t< IsDenseMatrix_v< MT1 > >
Default implementation of the SMP Schur product assignment of a matrix to dense matrix.
Definition: DenseMatrix.h:194
constexpr size_t rows(const Matrix< MT, SO > &matrix) noexcept
Returns the current number of rows of the matrix.
Definition: Matrix.h:498
CompositeType_t< MT2 > CT2
Composite type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:112
Header file for the RemoveReference type trait.
size_t columns() const noexcept
Returns the current number of columns of the matrix.
Definition: DMatTSMatSchurExpr.h:391
ConstIterator_t< RemoveReference_t< RightOperand > > RightIterator
Iterator type of the sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:178
typename T::ConstIterator ConstIterator_t
Alias declaration for nested ConstIterator type definitions.The ConstIterator_t alias declaration pro...
Definition: Aliases.h:110
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:437
const Type & ReturnType
Return type for expression template evaluations.
Definition: CompressedMatrix.h:3081
RightOperand rhs_
Right-hand side sparse matrix of the Schur product expression.
Definition: DMatTSMatSchurExpr.h:503
ConstIterator begin(size_t j) const
Returns an iterator to the first non-zero element of column j.
Definition: DMatTSMatSchurExpr.h:360
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:471
decltype(std::declval< RN1 >() *std::declval< RN2 >()) ExprReturnType
Expression return type for the subscript operator.
Definition: DMatTSMatSchurExpr.h:125
size_t nonZeros(size_t j) const
Returns the number of non-zero elements in the specified column.
Definition: DMatTSMatSchurExpr.h:412
bool canAlias(const T *alias) const noexcept
Returns whether the expression can alias with the given address alias.
Definition: DMatTSMatSchurExpr.h:483
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:294
const If_t< returnExpr, ExprReturnType, ElementType > ReturnType
Return type for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:155
Header file for the IntegralConstant class template.
Iterator over the elements of the dense matrix/sparse matrix Schur product expression.
Definition: DMatTSMatSchurExpr.h:170
bool operator==(const ConstIterator &rhs) const
Equality comparison between two ConstIterator objects.
Definition: DMatTSMatSchurExpr.h:265
const ConstIterator * operator->() const
Direct access to the sparse matrix element at the current iterator position.
Definition: DMatTSMatSchurExpr.h:234
If_t< IsExpression_v< MT2 >, const MT2, const MT2 &> RightOperand
Composite type of the right-hand side sparse matrix expression.
Definition: DMatTSMatSchurExpr.h:164
TransposeType_t< ResultType > TransposeType
Transpose type for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:151
Header file for the IsUpper type trait.
ElementType_t< ResultType > ElementType
Resulting element type.
Definition: DMatTSMatSchurExpr.h:152
Header file for the Size type trait.
#define BLAZE_CONSTRAINT_MUST_NOT_BE_ZERO_TYPE(T)
Constraint on the data type.In case the given data type T is a zero vector or matrix type...
Definition: Zero.h:81
#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
ReturnType at(size_t i, size_t j) const
Checked access to the matrix elements.
Definition: DMatTSMatSchurExpr.h:343
#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
SchurTrait_t< RT1, RT2 > ResultType
Result type for expression template evaluations.
Definition: DMatTSMatSchurExpr.h:149
If_t< Less< T1, T2 >::value, T2, T1 > Maximum
Compile time value evaluation.The Maximum alias declaration selects the larger of the two given templ...
Definition: Maximum.h:73
bool operator!=(const ConstIterator &rhs) const
Inequality comparison between two ConstIterator objects.
Definition: DMatTSMatSchurExpr.h:276
ValueType * PointerType
Pointer return type.
Definition: DMatTSMatSchurExpr.h:182
Header file for the IsExpression type trait class.
Header file for the function trace functionality.
Constraint on the data type.