Lines Matching full:mat1

330 mat3 = mat1 + mat2;           mat3 += mat1;
331 mat3 = mat1 - mat2; mat3 -= mat1;\endcode
335 mat3 = mat1 * s1; mat3 *= s1; mat3 = s1 * mat1;
336 mat3 = mat1 / s1; mat3 /= s1;\endcode
340 col2 = mat1 * col1;
341 row2 = row1 * mat1; row1 *= mat1;
342 mat3 = mat1 * mat2; mat3 *= mat1; \endcode
346 mat1 = mat2.transpose(); mat1.transposeInPlace();
347 mat1 = mat2.adjoint(); mat1.adjointInPlace();
433 mat1.real()
434 mat1.imag()
435 mat1.conjugate()
455 mat1.cwiseMin(mat2) mat1.cwiseMin(scalar)
456 mat1.cwiseMax(mat2) mat1.cwiseMax(scalar)
457 mat1.cwiseAbs2()
458 mat1.cwiseAbs()
459 mat1.cwiseSqrt()
460 mat1.cwiseInverse()
461 mat1.cwiseProduct(mat2)
462 mat1.cwiseQuotient(mat2)
463 mat1.cwiseEqual(mat2) mat1.cwiseEqual(scalar)
464 mat1.cwiseNotEqual(mat2)
467 mat1.array().min(mat2.array()) mat1.array().min(scalar)
468 mat1.array().max(mat2.array()) mat1.array().max(scalar)
469 mat1.array().abs2()
470 mat1.array().abs()
471 mat1.array().sqrt()
472 mat1.array().inverse()
473 mat1.array() * mat2.array()
474 mat1.array() / mat2.array()
475 mat1.array() == mat2.array() mat1.array() == scalar
476 mat1.array() != mat2.array()
485 mat1.unaryExpr(std::ptr_fun(foo));
486 mat1.unaryExpr(std::ref(foo));
487 mat1.unaryExpr([](double x) { return foo(x); });
542 mat1.row(i) = mat2.col(j);
543 mat1.col(j1).swap(mat1.col(j2));
561 <td>\code mat1.block(i,j,rows,cols)\endcode
563 <td>\code mat1.block<rows,cols>(i,j)\endcode
567 mat1.topLeftCorner(rows,cols)
568 mat1.topRightCorner(rows,cols)
569 mat1.bottomLeftCorner(rows,cols)
570 mat1.bottomRightCorner(rows,cols)\endcode
572 mat1.topLeftCorner<rows,cols>()
573 mat1.topRightCorner<rows,cols>()
574 mat1.bottomLeftCorner<rows,cols>()
575 mat1.bottomRightCorner<rows,cols>()\endcode
578 mat1.topRows(rows)
579 mat1.bottomRows(rows)
580 mat1.leftCols(cols)
581 mat1.rightCols(cols)\endcode
583 mat1.topRows<rows>()
584 mat1.bottomRows<rows>()
585 mat1.leftCols<cols>()
586 mat1.rightCols<cols>()\endcode
625 mat1 = vec1.asDiagonal();\endcode
634 vec1 = mat1.diagonal(); mat1.diagonal() = vec1; // main diagonal
635 vec1 = mat1.diagonal(+n); mat1.diagonal(+n) = vec1; // n-th super diagonal
636 vec1 = mat1.diagonal(-n); mat1.diagonal(-n) = vec1; // n-th sub diagonal
637 vec1 = mat1.diagonal<1>(); mat1.diagonal<1>() = vec1; // first super diagonal
638 vec1 = mat1.diagonal<-2>(); mat1.diagonal<-2>() = vec1; // second sub diagonal
644 mat3 = scalar * diag1 * mat1;
645 mat3 += scalar * mat1 * vec1.asDiagonal();
646 mat3 = vec1.asDiagonal().inverse() * mat1
647 mat3 = mat1 * diag1.inverse()
751 mat1 = vec1.asDiagonal();\endcode
760 vec1 = mat1.diagonal(); mat1.diagonal() = vec1; // main diagonal
761 vec1 = mat1.diagonal(+n); mat1.diagonal(+n) = vec1; // n-th super diagonal
762 vec1 = mat1.diagonal(-n); mat1.diagonal(-n) = vec1; // n-th sub diagonal
763 vec1 = mat1.diagonal<1>(); mat1.diagonal<1>() = vec1; // first super diagonal
764 vec1 = mat1.diagonal<-2>(); mat1.diagonal<-2>() = vec1; // second sub diagonal
770 mat2 = mat1.triangularView<Xxx>();
772 mat1.triangularView<Upper>() = mat2 + mat3; // only the upper part is evaluated and referenced
777 mat2 = mat1.selfadjointView<Xxx>(); // Xxx = Upper or Lower
778 mat1.selfadjointView<Upper>() = mat2 + mat2.adjoint(); // evaluated and write to the upper triangu…
785 mat3 += scalar * vec1.asDiagonal() * mat1
786 mat3 += scalar * mat1 * vec1.asDiagonal()
787 mat3.noalias() += scalar * mat1.triangularView<Xxx>() * mat2
788 mat3.noalias() += scalar * mat2 * mat1.triangularView<Xxx>()
789 mat3.noalias() += scalar * mat1.selfadjointView<Upper or Lower>() * mat2
790 mat3.noalias() += scalar * mat2 * mat1.selfadjointView<Upper or Lower>()
791 mat1.selfadjointView<Upper or Lower>().rankUpdate(mat2);
792 mat1.selfadjointView<Upper or Lower>().rankUpdate(mat2.adjoint(), scalar);
797 mat3 = vec1.asDiagonal().inverse() * mat1
798 mat3 = mat1 * diag1.inverse()
799 mat1.triangularView<Xxx>().solveInPlace(mat2)
800 mat1.triangularView<Xxx>().solveInPlace<OnTheRight>(mat2)
801 mat2 = mat1.selfadjointView<Upper or Lower>().llt().solve(mat2)