35 #ifndef _BLAZE_MATH_EXPRESSIONS_SMATTDMATMULTEXPR_H_ 36 #define _BLAZE_MATH_EXPRESSIONS_SMATTDMATMULTEXPR_H_ 142 template<
typename MT1
148 class SMatTDMatMultExpr :
public DenseMatrix< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF>, false >
149 ,
private MatMatMultExpr
150 ,
private Computation
175 SYM = ( SF && !( HF || LF || UF ) ),
176 HERM = ( HF && !( LF || UF ) ),
177 LOW = ( LF || ( ( SF || HF ) && UF ) ),
178 UPP = ( UF || ( ( SF || HF ) && LF ) )
189 template<
typename T1,
typename T2,
typename T3 >
190 struct CanExploitSymmetry {
202 template<
typename T1,
typename T2,
typename T3 >
203 struct IsEvaluationRequired {
204 enum :
bool { value = ( evaluateLeft || evaluateRight ) &&
205 CanExploitSymmetry<T1,T2,T3>::value };
215 template<
typename T1,
typename T2,
typename T3 >
216 struct UseOptimizedKernel {
240 ,
Noop > > > > ForwardFunctor;
271 enum :
bool { simdEnabled =
false };
274 enum :
bool { smpAssignable = !evaluateLeft && MT1::smpAssignable &&
275 !evaluateRight && MT2::smpAssignable };
325 :(
lhs_.columns() ) ) );
329 const size_t n(
end - begin );
347 inline ReturnType
at(
size_t i,
size_t j )
const {
348 if( i >=
lhs_.rows() ) {
351 if( j >=
rhs_.columns() ) {
363 inline size_t rows() const noexcept {
374 return rhs_.columns();
404 template<
typename T >
405 inline bool canAlias(
const T* alias )
const noexcept {
406 return (
lhs_.isAliased( alias ) ||
rhs_.isAliased( alias ) );
416 template<
typename T >
417 inline bool isAliased(
const T* alias )
const noexcept {
418 return (
lhs_.isAliased( alias ) ||
rhs_.isAliased( alias ) );
428 return rhs_.isAligned();
461 template<
typename MT
471 LT A(
serial( rhs.lhs_ ) );
472 RT B(
serial( rhs.rhs_ ) );
481 SMatTDMatMultExpr::selectAssignKernel( ~lhs, A, B );
500 template<
typename MT3
504 selectAssignKernel( MT3& C,
const MT4& A,
const MT5& B )
508 const size_t M( A.rows() );
509 const size_t N( B.columns() );
516 for( ; (j+4UL) <= N; j+=4UL ) {
517 for(
size_t i=( SYM || HERM || LOW ? j : 0UL ); i<( UPP ? j+4UL : M ); ++i )
526 if( element == end ) {
534 C(i,j ) = element->value() * B(element->index(),j );
535 C(i,j+1UL) = element->value() * B(element->index(),j+1UL);
536 C(i,j+2UL) = element->value() * B(element->index(),j+2UL);
537 C(i,j+3UL) = element->value() * B(element->index(),j+3UL);
539 for( ; element!=
end; ++element ) {
540 C(i,j ) += element->value() * B(element->index(),j );
541 C(i,j+1UL) += element->value() * B(element->index(),j+1UL);
542 C(i,j+2UL) += element->value() * B(element->index(),j+2UL);
543 C(i,j+3UL) += element->value() * B(element->index(),j+3UL);
548 for( ; (j+2UL) <= N; j+=2UL ) {
549 for(
size_t i=( SYM || HERM || LOW ? j : 0UL ); i<( UPP ? j+2UL : M ); ++i )
558 if( element == end ) {
564 C(i,j ) = element->value() * B(element->index(),j );
565 C(i,j+1UL) = element->value() * B(element->index(),j+1UL);
567 for( ; element!=
end; ++element ) {
568 C(i,j ) += element->value() * B(element->index(),j );
569 C(i,j+1UL) += element->value() * B(element->index(),j+1UL);
575 for(
size_t i=( SYM || HERM || LOW ? j : 0UL ); i<( UPP ? j+1UL : M ); ++i )
584 if( element == end ) {
589 C(i,j) = element->value() * B(element->index(),j);
591 for( ; element!=
end; ++element ) {
592 C(i,j) += element->value() * B(element->index(),j);
599 for(
size_t j=1UL; j<N; ++j ) {
600 for(
size_t i=0UL; i<j; ++i ) {
601 C(i,j) = HERM ?
conj( C(j,i) ) : C(j,i);
605 else if( LOW && !UPP ) {
606 for(
size_t j=1UL; j<N; ++j ) {
607 for(
size_t i=0UL; i<j; ++i ) {
612 else if( !LOW && UPP ) {
613 for(
size_t i=1UL; i<M; ++i ) {
614 for(
size_t j=0UL; j<i; ++j ) {
637 template<
typename MT3
641 selectAssignKernel( MT3& C,
const MT4& A,
const MT5& B )
645 const size_t M( A.rows() );
646 const size_t N( B.columns() );
655 for( ; (j+4UL) <= N; j+=4UL ) {
656 for(
size_t i=( SYM || HERM || LOW ? j : 0UL ); i<( UPP ? j+4UL : M ); ++i )
665 const size_t nonzeros( end - element );
666 const size_t kpos( nonzeros &
size_t(-4) );
669 for(
size_t k=0UL; k<kpos; k+=4UL )
671 const size_t i1( element->index() );
672 const ET1 v1( element->value() );
674 const size_t i2( element->index() );
675 const ET1 v2( element->value() );
677 const size_t i3( element->index() );
678 const ET1 v3( element->value() );
680 const size_t i4( element->index() );
681 const ET1 v4( element->value() );
686 C(i,j ) += v1 * B(i1,j ) + v2 * B(i2,j ) + v3 * B(i3,j ) + v4 * B(i4,j );
687 C(i,j+1UL) += v1 * B(i1,j+1UL) + v2 * B(i2,j+1UL) + v3 * B(i3,j+1UL) + v4 * B(i4,j+1UL);
688 C(i,j+2UL) += v1 * B(i1,j+2UL) + v2 * B(i2,j+2UL) + v3 * B(i3,j+2UL) + v4 * B(i4,j+2UL);
689 C(i,j+3UL) += v1 * B(i1,j+3UL) + v2 * B(i2,j+3UL) + v3 * B(i3,j+3UL) + v4 * B(i4,j+3UL);
692 for( ; element!=
end; ++element )
694 const size_t i1( element->index() );
695 const ET1 v1( element->value() );
697 C(i,j ) += v1 * B(i1,j );
698 C(i,j+1UL) += v1 * B(i1,j+1UL);
699 C(i,j+2UL) += v1 * B(i1,j+2UL);
700 C(i,j+3UL) += v1 * B(i1,j+3UL);
705 for( ; (j+2UL) <= N; j+=2UL ) {
706 for(
size_t i=( SYM || HERM || LOW ? j : 0UL ); i<( UPP ? j+2UL : M ); ++i )
715 const size_t nonzeros( end - element );
716 const size_t kpos( nonzeros &
size_t(-4) );
719 for(
size_t k=0UL; k<kpos; k+=4UL )
721 const size_t i1( element->index() );
722 const ET1 v1( element->value() );
724 const size_t i2( element->index() );
725 const ET1 v2( element->value() );
727 const size_t i3( element->index() );
728 const ET1 v3( element->value() );
730 const size_t i4( element->index() );
731 const ET1 v4( element->value() );
736 C(i,j ) += v1 * B(i1,j ) + v2 * B(i2,j ) + v3 * B(i3,j ) + v4 * B(i4,j );
737 C(i,j+1UL) += v1 * B(i1,j+1UL) + v2 * B(i2,j+1UL) + v3 * B(i3,j+1UL) + v4 * B(i4,j+1UL);
740 for( ; element!=
end; ++element )
742 const size_t i1( element->index() );
743 const ET1 v1( element->value() );
745 C(i,j ) += v1 * B(i1,j );
746 C(i,j+1UL) += v1 * B(i1,j+1UL);
752 for(
size_t i=( SYM || HERM || LOW ? j : 0UL ); i<( UPP ? j+1UL : M ); ++i )
761 const size_t nonzeros( end - element );
762 const size_t kpos( nonzeros &
size_t(-4) );
765 for(
size_t k=0UL; k<kpos; k+=4UL )
767 const size_t i1( element->index() );
768 const ET1 v1( element->value() );
770 const size_t i2( element->index() );
771 const ET1 v2( element->value() );
773 const size_t i3( element->index() );
774 const ET1 v3( element->value() );
776 const size_t i4( element->index() );
777 const ET1 v4( element->value() );
782 C(i,j) += v1 * B(i1,j) + v2 * B(i2,j) + v3 * B(i3,j) + v4 * B(i4,j);
785 for( ; element!=
end; ++element )
787 const size_t i1( element->index() );
788 const ET1 v1( element->value() );
790 C(i,j) += v1 * B(i1,j);
797 for(
size_t j=1UL; j<N; ++j ) {
798 for(
size_t i=0UL; i<j; ++i ) {
799 C(i,j) = HERM ?
conj( C(j,i) ) : C(j,i);
820 template<
typename MT
839 const ForwardFunctor fwd;
841 const TmpType tmp(
serial( rhs ) );
842 assign( ~lhs, fwd( tmp ) );
862 template<
typename MT
872 const ForwardFunctor fwd;
874 assign( ~lhs, fwd( rhs.lhs_ *
trans( rhs.rhs_ ) ) );
892 template<
typename MT
902 LT A(
serial( rhs.lhs_ ) );
903 RT B(
serial( rhs.rhs_ ) );
912 SMatTDMatMultExpr::selectAddAssignKernel( ~lhs, A, B );
931 template<
typename MT3
935 selectAddAssignKernel( MT3& C,
const MT4& A,
const MT5& B )
939 const size_t M( A.rows() );
940 const size_t N( B.columns() );
947 for( ; (j+4UL) <= N; j+=4UL ) {
948 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+4UL : M ); ++i )
957 for( ; element!=
end; ++element ) {
958 C(i,j ) += element->value() * B(element->index(),j );
959 C(i,j+1UL) += element->value() * B(element->index(),j+1UL);
960 C(i,j+2UL) += element->value() * B(element->index(),j+2UL);
961 C(i,j+3UL) += element->value() * B(element->index(),j+3UL);
966 for( ; (j+2UL) <= N; j+=2UL ) {
967 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+2UL : M ); ++i )
976 for( ; element!=
end; ++element ) {
977 C(i,j ) += element->value() * B(element->index(),j );
978 C(i,j+1UL) += element->value() * B(element->index(),j+1UL);
984 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+1UL : M ); ++i )
993 for( ; element!=
end; ++element ) {
994 C(i,j) += element->value() * B(element->index(),j);
1017 template<
typename MT3
1021 selectAddAssignKernel( MT3& C,
const MT4& A,
const MT5& B )
1025 const size_t M( A.rows() );
1026 const size_t N( B.columns() );
1033 for( ; (j+4UL) <= N; j+=4UL ) {
1034 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+4UL : M ); ++i )
1043 const size_t nonzeros( end - element );
1044 const size_t kpos( nonzeros &
size_t(-4) );
1047 for(
size_t k=0UL; k<kpos; k+=4UL )
1049 const size_t i1( element->index() );
1050 const ET1 v1( element->value() );
1052 const size_t i2( element->index() );
1053 const ET1 v2( element->value() );
1055 const size_t i3( element->index() );
1056 const ET1 v3( element->value() );
1058 const size_t i4( element->index() );
1059 const ET1 v4( element->value() );
1064 C(i,j ) += v1 * B(i1,j ) + v2 * B(i2,j ) + v3 * B(i3,j ) + v4 * B(i4,j );
1065 C(i,j+1UL) += v1 * B(i1,j+1UL) + v2 * B(i2,j+1UL) + v3 * B(i3,j+1UL) + v4 * B(i4,j+1UL);
1066 C(i,j+2UL) += v1 * B(i1,j+2UL) + v2 * B(i2,j+2UL) + v3 * B(i3,j+2UL) + v4 * B(i4,j+2UL);
1067 C(i,j+3UL) += v1 * B(i1,j+3UL) + v2 * B(i2,j+3UL) + v3 * B(i3,j+3UL) + v4 * B(i4,j+3UL);
1070 for( ; element!=
end; ++element )
1072 const size_t i1( element->index() );
1073 const ET1 v1( element->value() );
1075 C(i,j ) += v1 * B(i1,j );
1076 C(i,j+1UL) += v1 * B(i1,j+1UL);
1077 C(i,j+2UL) += v1 * B(i1,j+2UL);
1078 C(i,j+3UL) += v1 * B(i1,j+3UL);
1083 for( ; (j+2UL) <= N; j+=2UL ) {
1084 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+2UL : M ); ++i )
1093 const size_t nonzeros( end - element );
1094 const size_t kpos( nonzeros &
size_t(-4) );
1097 for(
size_t k=0UL; k<kpos; k+=4UL )
1099 const size_t i1( element->index() );
1100 const ET1 v1( element->value() );
1102 const size_t i2( element->index() );
1103 const ET1 v2( element->value() );
1105 const size_t i3( element->index() );
1106 const ET1 v3( element->value() );
1108 const size_t i4( element->index() );
1109 const ET1 v4( element->value() );
1114 C(i,j ) += v1 * B(i1,j ) + v2 * B(i2,j ) + v3 * B(i3,j ) + v4 * B(i4,j );
1115 C(i,j+1UL) += v1 * B(i1,j+1UL) + v2 * B(i2,j+1UL) + v3 * B(i3,j+1UL) + v4 * B(i4,j+1UL);
1118 for( ; element!=
end; ++element )
1120 const size_t i1( element->index() );
1121 const ET1 v1( element->value() );
1123 C(i,j ) += v1 * B(i1,j );
1124 C(i,j+1UL) += v1 * B(i1,j+1UL);
1130 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+1UL : M ); ++i )
1139 const size_t nonzeros( end - element );
1140 const size_t kpos( nonzeros &
size_t(-4) );
1143 for(
size_t k=0UL; k<kpos; k+=4UL )
1145 const size_t i1( element->index() );
1146 const ET1 v1( element->value() );
1148 const size_t i2( element->index() );
1149 const ET1 v2( element->value() );
1151 const size_t i3( element->index() );
1152 const ET1 v3( element->value() );
1154 const size_t i4( element->index() );
1155 const ET1 v4( element->value() );
1160 C(i,j) += v1 * B(i1,j) + v2 * B(i2,j) + v3 * B(i3,j) + v4 * B(i4,j);
1163 for( ; element!=
end; ++element )
1165 const size_t i1( element->index() );
1166 const ET1 v1( element->value() );
1168 C(i,j) += v1 * B(i1,j);
1192 template<
typename MT
1202 const ForwardFunctor fwd;
1204 addAssign( ~lhs, fwd( rhs.lhs_ *
trans( rhs.rhs_ ) ) );
1226 template<
typename MT
1236 LT A(
serial( rhs.lhs_ ) );
1237 RT B(
serial( rhs.rhs_ ) );
1246 SMatTDMatMultExpr::selectSubAssignKernel( ~lhs, A, B );
1265 template<
typename MT3
1269 selectSubAssignKernel( MT3& C,
const MT4& A,
const MT5& B )
1273 const size_t M( A.rows() );
1274 const size_t N( B.columns() );
1281 for( ; (j+4UL) <= N; j+=4UL ) {
1282 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+4UL : M ); ++i )
1291 for( ; element!=
end; ++element ) {
1292 C(i,j ) -= element->value() * B(element->index(),j );
1293 C(i,j+1UL) -= element->value() * B(element->index(),j+1UL);
1294 C(i,j+2UL) -= element->value() * B(element->index(),j+2UL);
1295 C(i,j+3UL) -= element->value() * B(element->index(),j+3UL);
1300 for( ; (j+2UL) <= N; j+=2UL ) {
1301 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+2UL : M ); ++i )
1310 for( ; element!=
end; ++element ) {
1311 C(i,j ) -= element->value() * B(element->index(),j );
1312 C(i,j+1UL) -= element->value() * B(element->index(),j+1UL);
1318 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+1UL : M ); ++i )
1327 for( ; element!=
end; ++element ) {
1328 C(i,j) -= element->value() * B(element->index(),j);
1351 template<
typename MT3
1355 selectSubAssignKernel( MT3& C,
const MT4& A,
const MT5& B )
1359 const size_t M( A.rows() );
1360 const size_t N( B.columns() );
1367 for( ; (j+4UL) <= N; j+=4UL ) {
1368 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+4UL : M ); ++i )
1377 const size_t nonzeros( end - element );
1378 const size_t kpos( nonzeros &
size_t(-4) );
1381 for(
size_t k=0UL; k<kpos; k+=4UL )
1383 const size_t i1( element->index() );
1384 const ET1 v1( element->value() );
1386 const size_t i2( element->index() );
1387 const ET1 v2( element->value() );
1389 const size_t i3( element->index() );
1390 const ET1 v3( element->value() );
1392 const size_t i4( element->index() );
1393 const ET1 v4( element->value() );
1398 C(i,j ) -= v1 * B(i1,j ) + v2 * B(i2,j ) + v3 * B(i3,j ) + v4 * B(i4,j );
1399 C(i,j+1UL) -= v1 * B(i1,j+1UL) + v2 * B(i2,j+1UL) + v3 * B(i3,j+1UL) + v4 * B(i4,j+1UL);
1400 C(i,j+2UL) -= v1 * B(i1,j+2UL) + v2 * B(i2,j+2UL) + v3 * B(i3,j+2UL) + v4 * B(i4,j+2UL);
1401 C(i,j+3UL) -= v1 * B(i1,j+3UL) + v2 * B(i2,j+3UL) + v3 * B(i3,j+3UL) + v4 * B(i4,j+3UL);
1404 for( ; element!=
end; ++element )
1406 const size_t i1( element->index() );
1407 const ET1 v1( element->value() );
1409 C(i,j ) -= v1 * B(i1,j );
1410 C(i,j+1UL) -= v1 * B(i1,j+1UL);
1411 C(i,j+2UL) -= v1 * B(i1,j+2UL);
1412 C(i,j+3UL) -= v1 * B(i1,j+3UL);
1417 for( ; (j+2UL) <= N; j+=2UL ) {
1418 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+2UL : M ); ++i )
1427 const size_t nonzeros( end - element );
1428 const size_t kpos( nonzeros &
size_t(-4) );
1431 for(
size_t k=0UL; k<kpos; k+=4UL )
1433 const size_t i1( element->index() );
1434 const ET1 v1( element->value() );
1436 const size_t i2( element->index() );
1437 const ET1 v2( element->value() );
1439 const size_t i3( element->index() );
1440 const ET1 v3( element->value() );
1442 const size_t i4( element->index() );
1443 const ET1 v4( element->value() );
1448 C(i,j ) -= v1 * B(i1,j ) + v2 * B(i2,j ) + v3 * B(i3,j ) + v4 * B(i4,j );
1449 C(i,j+1UL) -= v1 * B(i1,j+1UL) + v2 * B(i2,j+1UL) + v3 * B(i3,j+1UL) + v4 * B(i4,j+1UL);
1452 for( ; element!=
end; ++element )
1454 const size_t i1( element->index() );
1455 const ET1 v1( element->value() );
1457 C(i,j ) -= v1 * B(i1,j );
1458 C(i,j+1UL) -= v1 * B(i1,j+1UL);
1464 for(
size_t i=( LOW ? j : 0UL ); i<( UPP ? j+1UL : M ); ++i )
1473 const size_t nonzeros( end - element );
1474 const size_t kpos( nonzeros &
size_t(-4) );
1477 for(
size_t k=0UL; k<kpos; k+=4UL )
1479 const size_t i1( element->index() );
1480 const ET1 v1( element->value() );
1482 const size_t i2( element->index() );
1483 const ET1 v2( element->value() );
1485 const size_t i3( element->index() );
1486 const ET1 v3( element->value() );
1488 const size_t i4( element->index() );
1489 const ET1 v4( element->value() );
1494 C(i,j) -= v1 * B(i1,j) + v2 * B(i2,j) + v3 * B(i3,j) + v4 * B(i4,j);
1497 for( ; element!=
end; ++element )
1499 const size_t i1( element->index() );
1500 const ET1 v1( element->value() );
1502 C(i,j) -= v1 * B(i1,j);
1526 template<
typename MT
1536 const ForwardFunctor fwd;
1538 subAssign( ~lhs, fwd( rhs.lhs_ *
trans( rhs.rhs_ ) ) );
1570 template<
typename MT
1610 template<
typename MT
1629 const ForwardFunctor fwd;
1631 const TmpType tmp( rhs );
1652 template<
typename MT
1662 const ForwardFunctor fwd;
1685 template<
typename MT
1725 template<
typename MT
1735 const ForwardFunctor fwd;
1762 template<
typename MT
1802 template<
typename MT
1812 const ForwardFunctor fwd;
1883 template<
typename T1
1933 template<
typename MT1
1980 template<
typename MT1
2027 template<
typename MT1
2074 template<
typename MT1
2121 template<
typename MT1
2152 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2153 struct Rows< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> > :
public Rows<MT1>
2169 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2170 struct Columns< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> > :
public Columns<MT2>
2186 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2187 struct IsAligned< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2204 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2205 struct IsSymmetric< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2208 , IsBuiltin< ElementType_< SMatTDMatMultExpr<MT1,MT2,false,true,false,false> > > >
2209 , And< Bool<LF>, Bool<UF> > >::value >
2225 template<
typename MT1,
typename MT2,
bool SF,
bool LF,
bool UF >
2226 struct IsHermitian< SMatTDMatMultExpr<MT1,MT2,SF,true,LF,UF> >
2243 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2244 struct IsLower< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2246 , And< IsLower<MT1>, IsLower<MT2> >
2247 , And< Or< Bool<SF>, Bool<HF> >
2248 , IsUpper<MT1>, IsUpper<MT2> > >::value >
2264 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2265 struct IsUniLower< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2266 :
public BoolConstant< Or< And< IsUniLower<MT1>, IsUniLower<MT2> >
2267 , And< Or< Bool<SF>, Bool<HF> >
2268 , IsUniUpper<MT1>, IsUniUpper<MT2> > >::value >
2284 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2286 :
public BoolConstant< Or< And< IsStrictlyLower<MT1>, IsLower<MT2> >
2287 , And< IsStrictlyLower<MT2>, IsLower<MT1> >
2288 , And< Or< Bool<SF>, Bool<HF> >
2289 , Or< And< IsStrictlyUpper<MT1>, IsUpper<MT2> >
2290 , And< IsStrictlyUpper<MT2>, IsUpper<MT1> > > > >::value >
2306 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2307 struct IsUpper< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2309 , And< IsUpper<MT1>, IsUpper<MT2> >
2310 , And< Or< Bool<SF>, Bool<HF> >
2311 , IsLower<MT1>, IsLower<MT2> > >::value >
2327 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2328 struct IsUniUpper< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2329 :
public BoolConstant< Or< And< IsUniUpper<MT1>, IsUniUpper<MT2> >
2330 , And< Or< Bool<SF>, Bool<HF> >
2331 , IsUniLower<MT1>, IsUniLower<MT2> > >::value >
2347 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2349 :
public BoolConstant< Or< And< IsStrictlyUpper<MT1>, IsUpper<MT2> >
2350 , And< IsStrictlyUpper<MT2>, IsUpper<MT1> >
2351 , And< Or< Bool<SF>, Bool<HF> >
2352 , Or< And< IsStrictlyLower<MT1>, IsLower<MT2> >
2353 , And< IsStrictlyLower<MT2>, IsLower<MT1> > > > >::value >
2369 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF,
typename VT >
2387 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF,
typename VT >
2405 template<
typename VT,
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2423 template<
typename VT,
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2441 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2458 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2475 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2492 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2509 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2526 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF,
bool AF >
2541 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
2542 struct RowExprTrait< SMatTDMatMultExpr<MT1,MT2,SF,HF,LF,UF> >
2555 template<
typename MT1,
typename MT2,
bool SF,
bool HF,
bool LF,
bool UF >
ElementType_< RT2 > ET2
Element type of the right-hand side sparse matrix expression.
Definition: SMatTDMatMultExpr.h:157
typename SubmatrixExprTrait< MT, AF >::Type SubmatrixExprTrait_
Auxiliary alias declaration for the SubmatrixExprTrait type trait.The SubmatrixExprTrait_ alias decla...
Definition: SubmatrixExprTrait.h:134
#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
Evaluation of the expression type of a dense matrix declupp operation.Via this type trait it is possi...
Definition: DMatDeclUppExprTrait.h:75
Compile time check for row vector types.This type trait tests whether or not the given template argum...
Definition: IsRowVector.h:80
const DMatForEachExpr< MT, Conj, SO > conj(const DenseMatrix< MT, SO > &dm)
Returns a matrix containing the complex conjugate of each single element of dm.
Definition: DMatForEachExpr.h:1214
Header file for auxiliary alias declarations.
Compile time check whether the given type is a computational expression template.This type trait clas...
Definition: IsComputation.h:72
Header file for mathematical functions.
ResultType_< MT1 > RT1
Result type of the left-hand side sparse matrix expression.
Definition: SMatTDMatMultExpr.h:154
constexpr bool useOptimizedKernels
Configuration switch for optimized kernels.This configuration switch enables/disables all optimized c...
Definition: Optimizations.h:84
Header file for the SMatDVecMultExprTrait class template.
Header file for the Rows type trait.
Header file for the IsUniUpper type trait.
If_< IsExpression< MT2 >, const MT2, const MT2 &> RightOperand
Composite type of the right-hand side dense matrix expression.
Definition: SMatTDMatMultExpr.h:260
Compile time check for triangular matrix types.This type trait tests whether or not the given templat...
Definition: IsTriangular.h:87
Header file for basic type definitions.
IfTrue_< evaluateRight, const RT2, CT2 > RT
Type for the assignment of the right-hand side dense matrix operand.
Definition: SMatTDMatMultExpr.h:266
Header file for the DMatDeclDiagExprTrait class template.
RightOperand rightOperand() const noexcept
Returns the right-hand side transpose dense matrix operand.
Definition: SMatTDMatMultExpr.h:393
typename TSVecTDMatMultExprTrait< VT, MT >::Type TSVecTDMatMultExprTrait_
Auxiliary alias declaration for the TSVecTDMatMultExprTrait class template.The TSVecTDMatMultExprTrai...
Definition: TSVecTDMatMultExprTrait.h:124
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:160
Header file for the IsSparseMatrix type trait.
Header file for the serial shim.
Generic wrapper for a compile time constant integral value.The IntegralConstant class template repres...
Definition: IntegralConstant.h:71
#define BLAZE_CONSTRAINT_MUST_BE_DENSE_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a dense, N-dimensional matrix type...
Definition: DenseMatrix.h:61
Header file for the ColumnExprTrait class template.
Header file for the DeclUpp functor.
BLAZE_ALWAYS_INLINE MT::Iterator begin(Matrix< MT, SO > &matrix, size_t i)
Returns an iterator to the first element of row/column i.
Definition: Matrix.h:194
Header file for the IsColumnMajorMatrix type trait.
void reset(const DiagonalProxy< MT > &proxy)
Resetting the represented element to the default initial values.
Definition: DiagonalProxy.h:533
size_t columns() const noexcept
Returns the current number of columns of the matrix.
Definition: SMatTDMatMultExpr.h:373
Header file for the IsRowVector type trait.
typename DisableIf< Condition, T >::Type DisableIf_
Auxiliary type for the DisableIf class template.The DisableIf_ alias declaration provides a convenien...
Definition: DisableIf.h:223
Header file for the And class template.
const ElementType_< MT > min(const DenseMatrix< MT, SO > &dm)
Returns the smallest element of the dense matrix.
Definition: DenseMatrix.h:1755
Compile time check for lower triangular matrices.This type trait tests whether or not the given templ...
Definition: IsLower.h:88
Header file for the TDVecSMatMultExprTrait class template.
bool isAliased(const T *alias) const noexcept
Returns whether the expression is aliased with the given address alias.
Definition: SMatTDMatMultExpr.h:417
const DMatSerialExpr< MT, SO > serial(const DenseMatrix< MT, SO > &dm)
Forces the serial evaluation of the given dense matrix expression dm.
Definition: DMatSerialExpr.h:721
typename MultTrait< T1, T2 >::Type MultTrait_
Auxiliary alias declaration for the MultTrait class template.The MultTrait_ alias declaration provide...
Definition: MultTrait.h:245
Header file for the Computation base class.
Flag for upper matrices.
Definition: SMatTDMatMultExpr.h:178
Header file for the MatMatMultExpr base class.
DisableIf_< IsSymmetric< MT >, const DMatDeclSymExpr< MT, SO > > declsym(const DenseMatrix< MT, SO > &dm)
Declares the given non-symmetric dense matrix expression dm as symmetric.
Definition: DMatDeclSymExpr.h:841
Evaluation of the expression type of a dense matrix/dense vector multiplication.Via this type trait i...
Definition: DMatDVecMultExprTrait.h:78
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.
Header file for the RequiresEvaluation type trait.
System settings for performance optimizations.
Header file for the TSVecSMatMultExprTrait class template.
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:323
const ElementType_< MT > max(const DenseMatrix< MT, SO > &dm)
Returns the largest element of the dense matrix.
Definition: DenseMatrix.h:1802
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:129
size_t rows() const noexcept
Returns the current number of rows of the matrix.
Definition: SMatTDMatMultExpr.h:363
Base class for dense matrices.The DenseMatrix class is a base class for all dense matrix classes...
Definition: DenseMatrix.h:71
Base class for sparse matrices.The SparseMatrix class is a base class for all sparse matrix classes...
Definition: Forward.h:119
ElementType_< ResultType > ElementType
Resulting element type.
Definition: SMatTDMatMultExpr.h:252
Constraint on the data type.
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
Compile time check for the alignment of data types.This type trait tests whether the given data type ...
Definition: IsAligned.h:87
Evaluation of the expression type of a dense matrix declsym operation.Via this type trait it is possi...
Definition: DMatDeclSymExprTrait.h:75
Constraint on the data type.
Constraint on the data type.
typename MultExprTrait< T1, T2 >::Type MultExprTrait_
Auxiliary alias declaration for the MultExprTrait class template.The MultExprTrait_ alias declaration...
Definition: MultExprTrait.h:344
Header file for the MultExprTrait class template.
DisableIf_< IsHermitian< MT >, const DMatDeclHermExpr< MT, SO > > declherm(const DenseMatrix< MT, SO > &dm)
Declares the given non-Hermitian dense matrix expression dm as Hermitian.
Definition: DMatDeclHermExpr.h:841
Compile time check to query the requirement to evaluate an expression.Via this type trait it is possi...
Definition: RequiresEvaluation.h:72
SubvectorExprTrait_< VT, unaligned > subvector(Vector< VT, TF > &vector, size_t index, size_t size)
Creating a view on a specific subvector of the given vector.
Definition: Subvector.h:152
typename T::CompositeType CompositeType_
Alias declaration for nested CompositeType type definitions.The CompositeType_ alias declaration prov...
Definition: Aliases.h:83
bool canAlias(const T *alias) const noexcept
Returns whether the expression can alias with the given address alias.
Definition: SMatTDMatMultExpr.h:405
Compile time check for upper unitriangular matrices.This type trait tests whether or not the given te...
Definition: IsUniUpper.h:86
OppositeType_< ResultType > OppositeType
Result type with opposite storage order for expression template evaluations.
Definition: SMatTDMatMultExpr.h:250
Header file for the DisableIf class template.
Compile time check for dense vector types.This type trait tests whether or not the given template par...
Definition: IsDenseVector.h:78
Header file for the multiplication trait.
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 DeclLow functor.
const ElementType ReturnType
Return type for expression template evaluations.
Definition: SMatTDMatMultExpr.h:253
Header file for the If class template.
Compile time check for row-major matrix types.This type trait tests whether or not the given template...
Definition: IsRowMajorMatrix.h:83
#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 canSMPAssign() const noexcept
Returns whether the expression can be used in SMP assignments.
Definition: SMatTDMatMultExpr.h:437
Header file for the TSVecTDMatMultExprTrait class template.
const Element * ConstIterator
Iterator over constant elements.
Definition: CompressedMatrix.h:2939
bool isAligned() const noexcept
Returns whether the operands of the expression are properly aligned in memory.
Definition: SMatTDMatMultExpr.h:427
Generic wrapper for the decllow() function.
Definition: DeclLow.h:58
EnableIf_< IsDenseMatrix< MT1 > > smpAssign(Matrix< MT1, SO1 > &lhs, const Matrix< MT2, SO2 > &rhs)
Default implementation of the SMP assignment of a matrix to a dense matrix.
Definition: DenseMatrix.h:98
Header file for the Or class template.
Header file for the TDMatSVecMultExprTrait class template.
#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
Flag for symmetric matrices.
Definition: SMatTDMatMultExpr.h:175
Header file for the DenseMatrix base class.
Header file for the DMatDeclLowExprTrait class template.
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
Evaluation of the expression type of a dense matrix/sparse vector multiplication.Via this type trait ...
Definition: DMatSVecMultExprTrait.h:80
Compile time check for sparse vector types.This type trait tests whether or not the given template pa...
Definition: IsSparseVector.h:78
Evaluation of the expression type type of a submatrix operation.Via this type trait it is possible to...
Definition: SubmatrixExprTrait.h:80
Header file for the DMatDVecMultExprTrait class template.
Header file for the IsLower type trait.
LeftOperand lhs_
Left-hand side sparse matrix of the multiplication expression.
Definition: SMatTDMatMultExpr.h:444
Header file for the IsAligned type trait.
Compile time check for diagonal matrices.This type trait tests whether or not the given template para...
Definition: IsDiagonal.h:90
Expression object for sparse matrix-transpose dense matrix multiplications.The SMatTDMatMultExpr clas...
Definition: Forward.h:112
DisableIf_< Or< IsComputation< MT >, IsTransExpr< MT >, IsDeclExpr< MT > >, RowExprTrait_< MT > > row(Matrix< MT, SO > &matrix, size_t index)
Creating a view on a specific row of the given matrix.
Definition: Row.h:128
#define BLAZE_CONSTRAINT_MUST_BE_REFERENCE_TYPE(T)
Constraint on the data type.In case the given data type T is not a reference type, a compilation error is created.
Definition: Reference.h:60
Generic wrapper for the null function.
Definition: Noop.h:58
Header file for the IsTriangular type trait.
Header file for the DMatDeclUppExprTrait class template.
Header file for the DMatDeclSymExprTrait class template.
Compile time check for column vector types.This type trait tests whether or not the given template ar...
Definition: IsColumnVector.h:80
Constraints on the storage order of matrix types.
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.
DisableIf_< IsLower< MT >, const DMatDeclLowExpr< MT, SO > > decllow(const DenseMatrix< MT, SO > &dm)
Declares the given non-lower dense matrix expression dm as lower.
Definition: DMatDeclLowExpr.h:842
const ResultType CompositeType
Data type for composite expression templates.
Definition: SMatTDMatMultExpr.h:254
Compile time check for strictly upper triangular matrices.This type trait tests whether or not the gi...
Definition: IsStrictlyUpper.h:86
Evaluation of the expression type type of a row operation.Via this type trait it is possible to evalu...
Definition: RowExprTrait.h:79
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:260
Header file for the DeclDiag functor.
Evaluation of the expression type of a dense matrix declherm operation.Via this type trait it is poss...
Definition: DMatDeclHermExprTrait.h:75
Compile time check for dense matrix types.This type trait tests whether or not the given template par...
Definition: IsDenseMatrix.h:78
Header file for the RowExprTrait class template.
Header file for all forward declarations for expression class templates.
Header file for the IsDenseMatrix type trait.
DisableIf_< Or< IsComputation< MT >, IsTransExpr< MT >, IsDeclExpr< MT > >, ColumnExprTrait_< MT > > column(Matrix< MT, SO > &matrix, size_t index)
Creating a view on a specific column of the given matrix.
Definition: Column.h:128
Header file for the EnableIf class template.
Header file for the IsStrictlyLower type trait.
#define BLAZE_CONSTRAINT_MUST_FORM_VALID_MATMATMULTEXPR(T1, T2)
Constraint on the data type.In case the given data types T1 and T2 do not form a valid matrix/matrix ...
Definition: MatMatMultExpr.h:109
IfTrue_< evaluateLeft, const RT1, CT1 > LT
Type for the assignment of the left-hand side sparse matrix operand.
Definition: SMatTDMatMultExpr.h:263
Compile time check for lower unitriangular matrices.This type trait tests whether or not the given te...
Definition: IsUniLower.h:86
Header file for the conjugate shim.
Compile time check for resizable data types.This type trait tests whether the given data type is a re...
Definition: IsResizable.h:75
Header file for the IsSparseVector type trait.
Header file for the SubmatrixExprTrait class template.
#define BLAZE_CONSTRAINT_MUST_BE_ROW_MAJOR_MATRIX_TYPE(T)
Constraint on the data type.In case the given data type T is not a row-major dense or sparse matrix t...
Definition: RowMajorMatrix.h:61
typename TDVecTDMatMultExprTrait< VT, MT >::Type TDVecTDMatMultExprTrait_
Auxiliary alias declaration for the TDVecTDMatMultExprTrait class template.The TDVecTDMatMultExprTrai...
Definition: TDVecTDMatMultExprTrait.h:120
Header file for run time assertion macros.
Compile time check for column-major matrix types.This type trait tests whether or not the given templ...
Definition: IsColumnMajorMatrix.h:83
Utility type for generic codes.
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:160
TransposeType_< ResultType > TransposeType
Transpose type for expression template evaluations.
Definition: SMatTDMatMultExpr.h:251
Header file for the reset shim.
#define BLAZE_FUNCTION_TRACE
Function trace macro.This macro can be used to reliably trace function calls. In case function tracin...
Definition: FunctionTrace.h:93
Flag for lower matrices.
Definition: SMatTDMatMultExpr.h:177
SMatTDMatMultExpr< MT1, MT2, SF, HF, LF, UF > This
Type of this SMatTDMatMultExpr instance.
Definition: SMatTDMatMultExpr.h:247
Header file for the DMatDeclHermExprTrait class template.
Compile time check for Hermitian matrices.This type trait tests whether or not the given template par...
Definition: IsHermitian.h:85
Base class for matrices.The Matrix class is a base class for all dense and sparse matrix classes with...
Definition: Forward.h:94
MultTrait_< RT1, RT2 > ResultType
Result type for expression template evaluations.
Definition: SMatTDMatMultExpr.h:249
Constraints on the storage order of matrix types.
Generic wrapper for the declherm() function.
Definition: DeclHerm.h:58
typename SMatDVecMultExprTrait< MT, VT >::Type SMatDVecMultExprTrait_
Auxiliary alias declaration for the SMatDVecMultExprTrait class template.The SMatDVecMultExprTrait_ a...
Definition: SMatDVecMultExprTrait.h:119
SMatTDMatMultExpr(const MT1 &lhs, const MT2 &rhs) noexcept
Constructor for the SMatTDMatMultExpr class.
Definition: SMatTDMatMultExpr.h:284
Header file for the Noop functor.
Header file for the RemoveReference type trait.
CompositeType_< MT1 > CT1
Composite type of the left-hand side sparse matrix expression.
Definition: SMatTDMatMultExpr.h:158
typename EnableIf< Condition, T >::Type EnableIf_
Auxiliary alias declaration for the EnableIf class template.The EnableIf_ alias declaration provides ...
Definition: EnableIf.h:223
typename T::OppositeType OppositeType_
Alias declaration for nested OppositeType type definitions.The OppositeType_ alias declaration provid...
Definition: Aliases.h:243
#define BLAZE_CONSTRAINT_MATRICES_MUST_HAVE_SAME_STORAGE_ORDER(T1, T2)
Constraint on the data type.In case either of the two given data types T1 or T2 is not a matrix type ...
Definition: StorageOrder.h:84
Header file for the IsDenseVector type trait.
CompositeType_< MT2 > CT2
Composite type of the right-hand side dense matrix expression.
Definition: SMatTDMatMultExpr.h:159
Generic wrapper for the declupp() function.
Definition: DeclUpp.h:58
Compile time check for strictly lower triangular matrices.This type trait tests whether or not the gi...
Definition: IsStrictlyLower.h:86
If_< IsExpression< MT1 >, const MT1, const MT1 &> LeftOperand
Composite type of the left-hand side sparse matrix expression.
Definition: SMatTDMatMultExpr.h:257
Evaluation of the expression type of a dense vector/dense matrix multiplication.Via this type trait i...
Definition: TDVecDMatMultExprTrait.h:78
typename T::ConstIterator ConstIterator_
Alias declaration for nested ConstIterator type definitions.The ConstIterator_ alias declaration prov...
Definition: Aliases.h:103
LeftOperand leftOperand() const noexcept
Returns the left-hand side sparse matrix operand.
Definition: SMatTDMatMultExpr.h:383
Evaluation of the expression type of a sparse vector/dense matrix multiplication.Via this type trait ...
Definition: TSVecDMatMultExprTrait.h:78
Header file for the IsRowMajorMatrix type trait.
const DMatTransExpr< MT,!SO > trans(const DenseMatrix< MT, SO > &dm)
Calculation of the transpose of the given dense matrix.
Definition: DMatTransExpr.h:733
Header file for the IsComputation type trait class.
RightOperand rhs_
Right-hand side dense matrix of the multiplication expression.
Definition: SMatTDMatMultExpr.h:445
Header file for the IsBuiltin type trait.
ResultType_< MT2 > RT2
Result type of the right-hand side dense matrix expression.
Definition: SMatTDMatMultExpr.h:155
Header file for the TDVecDMatMultExprTrait class template.
ElementType_< RT1 > ET1
Element type of the left-hand side dense matrix expression.
Definition: SMatTDMatMultExpr.h:156
ReturnType operator()(size_t i, size_t j) const
2D-access to the matrix elements.
Definition: SMatTDMatMultExpr.h:299
Header file for the TDMatDVecMultExprTrait class template.
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:76
Evaluation of the expression type of a dense matrix decllow operation.Via this type trait it is possi...
Definition: DMatDeclLowExprTrait.h:75
Generic wrapper for the decldiag() function.
Definition: DeclDiag.h:58
Evaluation of the expression type of a dense matrix decldiag operation.Via this type trait it is poss...
Definition: DMatDeclDiagExprTrait.h:75
Compile time evaluation of the number of rows of a matrix.The Rows type trait evaluates the number of...
Definition: Rows.h:76
Header file for the TSVecDMatMultExprTrait class template.
Compile time check for sparse matrix types.This type trait tests whether or not the given template pa...
Definition: IsSparseMatrix.h:78
Header file for the DeclHerm functor.
typename T::TransposeType TransposeType_
Alias declaration for nested TransposeType type definitions.The TransposeType_ alias declaration prov...
Definition: Aliases.h:403
Header file for the IsUpper type trait.
Header file for the DMatSVecMultExprTrait class template.
Header file for the IsColumnVector type trait.
Constraint on the data type.
Flag for Hermitian matrices.
Definition: SMatTDMatMultExpr.h:176
Generic wrapper for the declsym() function.
Definition: DeclSym.h:58
BLAZE_ALWAYS_INLINE bool isSquare(const Matrix< MT, SO > &matrix) noexcept
Checks if the given matrix is a square matrix.
Definition: Matrix.h:677
const DMatDMatMultExpr< T1, T2, false, false, false, false > operator*(const DenseMatrix< T1, false > &lhs, const DenseMatrix< T2, false > &rhs)
Multiplication operator for the multiplication of two row-major dense matrices ( ).
Definition: DMatDMatMultExpr.h:7505
Header file for the thresholds for matrix/vector and matrix/matrix multiplications.
DisableIf_< IsDiagonal< MT >, const DMatDeclDiagExpr< MT, SO > > decldiag(const DenseMatrix< MT, SO > &dm)
Declares the given non-diagonal dense matrix expression dm as diagonal.
Definition: DMatDeclDiagExpr.h:841
DisableIf_< IsUpper< MT >, const DMatDeclUppExpr< MT, SO > > declupp(const DenseMatrix< MT, SO > &dm)
Declares the given non-upper dense matrix expression dm as upper.
Definition: DMatDeclUppExpr.h:842
Evaluation of the expression type type of a column operation.Via this type trait it is possible to ev...
Definition: ColumnExprTrait.h:78
#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
Header file for the Bool class template.
Header file for the TDVecTDMatMultExprTrait class template.
Header file for the DeclSym functor.
#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 TrueType type/value trait base class.
Header file for the IsExpression type trait class.
Header file for the function trace functionality.
ReturnType at(size_t i, size_t j) const
Checked access to the matrix elements.
Definition: SMatTDMatMultExpr.h:347