![]() |
Prusa Slicer 2.6.0
|
Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix. More...
#include <src/eigen/Eigen/src/SparseCore/SparseSelfAdjointView.h>
Inheritance diagram for Eigen::SparseSelfAdjointView< MatrixType, _Mode >:
Collaboration diagram for Eigen::SparseSelfAdjointView< MatrixType, _Mode >:Public Types | |
| enum | { Mode = _Mode , TransposeMode = ((Mode & Upper) ? Lower : 0) | ((Mode & Lower) ? Upper : 0) , RowsAtCompileTime = internal::traits<SparseSelfAdjointView>::RowsAtCompileTime , ColsAtCompileTime = internal::traits<SparseSelfAdjointView>::ColsAtCompileTime } |
| typedef EigenBase< SparseSelfAdjointView > | Base |
| typedef MatrixType::Scalar | Scalar |
| typedef MatrixType::StorageIndex | StorageIndex |
| typedef Matrix< StorageIndex, Dynamic, 1 > | VectorI |
| typedef internal::ref_selector< MatrixType >::non_const_type | MatrixTypeNested |
| typedef internal::remove_all< MatrixTypeNested >::type | _MatrixTypeNested |
| typedef Eigen::Index | Index |
| The interface type of indices. | |
| typedef internal::traits< SparseSelfAdjointView< MatrixType, _Mode > >::StorageKind | StorageKind |
Protected Attributes | |
| MatrixTypeNested | m_matrix |
Private Member Functions | |
| template<typename Dest > | |
| void | evalTo (Dest &) const |
Friends | |
| template<typename OtherDerived > | |
| Product< OtherDerived, SparseSelfAdjointView > | operator* (const SparseMatrixBase< OtherDerived > &lhs, const SparseSelfAdjointView &rhs) |
| template<typename OtherDerived > | |
| Product< OtherDerived, SparseSelfAdjointView > | operator* (const MatrixBase< OtherDerived > &lhs, const SparseSelfAdjointView &rhs) |
Pseudo expression to manipulate a triangular sparse matrix as a selfadjoint matrix.
| MatrixType | the type of the dense matrix storing the coefficients |
| Mode | can be either Lower or Upper |
This class is an expression of a sefladjoint matrix from a triangular part of a matrix with given dense storage of the coefficients. It is the return type of MatrixBase::selfadjointView() and most of the time this is the only way that it is used.
| typedef internal::remove_all<MatrixTypeNested>::type Eigen::SparseSelfAdjointView< MatrixType, _Mode >::_MatrixTypeNested |
| typedef EigenBase<SparseSelfAdjointView> Eigen::SparseSelfAdjointView< MatrixType, _Mode >::Base |
|
inherited |
The interface type of indices.
To change this, #define the preprocessor symbol EIGEN_DEFAULT_DENSE_INDEX_TYPE.
| typedef internal::ref_selector<MatrixType>::non_const_type Eigen::SparseSelfAdjointView< MatrixType, _Mode >::MatrixTypeNested |
| typedef MatrixType::Scalar Eigen::SparseSelfAdjointView< MatrixType, _Mode >::Scalar |
| typedef MatrixType::StorageIndex Eigen::SparseSelfAdjointView< MatrixType, _Mode >::StorageIndex |
|
inherited |
| typedef Matrix<StorageIndex,Dynamic,1> Eigen::SparseSelfAdjointView< MatrixType, _Mode >::VectorI |
| anonymous enum |
| Enumerator | |
|---|---|
| Mode | |
| TransposeMode | |
| RowsAtCompileTime | |
| ColsAtCompileTime | |
|
inlineexplicit |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::cols(), eigen_assert, and Eigen::SparseSelfAdjointView< MatrixType, _Mode >::rows().
Here is the call graph for this function:
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::m_matrix.
Referenced by Eigen::SparseSelfAdjointView< MatrixType, _Mode >::SparseSelfAdjointView(), and Eigen::SparseSelfAdjointView< MatrixType, _Mode >::resize().
Here is the caller graph for this function:
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
private |
|
inline |
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::m_matrix.
Here is the caller graph for this function:
|
inline |
Efficient sparse self-adjoint matrix times dense vector/matrix product
|
inline |
*this and a sparse matrix rhs.Note that there is no algorithmic advantage of performing such a product compared to a general sparse-sparse matrix product. Indeed, the SparseSelfadjointView operand is first copied into a temporary SparseMatrix before computing the product.
References Eigen::SparseMatrixBase< Derived >::derived().
Here is the call graph for this function:
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::twistedBy().
Here is the call graph for this function:
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::twistedBy().
Here is the call graph for this function:
|
inline |
References Eigen::internal::call_assignment_no_alias_no_transpose().
Here is the call graph for this function:| SparseSelfAdjointView< MatrixType, Mode > & Eigen::SparseSelfAdjointView< MatrixType, _Mode >::rankUpdate | ( | const SparseMatrixBase< DerivedU > & | u, |
| const Scalar & | alpha | ||
| ) |
References Eigen::SparseMatrixBase< Derived >::adjoint(), Eigen::ColMajor, Eigen::SparseSelfAdjointView< MatrixType, _Mode >::m_matrix, Eigen::RowMajor, and Eigen::RowMajorBit.
Here is the call graph for this function:| SparseSelfAdjointView & Eigen::SparseSelfAdjointView< MatrixType, _Mode >::rankUpdate | ( | const SparseMatrixBase< DerivedU > & | u, |
| const Scalar & | alpha = Scalar(1) |
||
| ) |
Perform a symmetric rank K update of the selfadjoint matrix *this:
*this To perform
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::cols(), eigen_assert, EIGEN_ONLY_USED_FOR_DEBUG, and Eigen::SparseSelfAdjointView< MatrixType, _Mode >::rows().
Here is the call graph for this function:
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::m_matrix.
Referenced by Eigen::SparseSelfAdjointView< MatrixType, _Mode >::SparseSelfAdjointView(), and Eigen::SparseSelfAdjointView< MatrixType, _Mode >::resize().
Here is the caller graph for this function:
|
inlineinherited |
|
inlineinherited |
|
inline |
References Eigen::SparseSelfAdjointView< MatrixType, _Mode >::m_matrix.
Referenced by Eigen::SparseSelfAdjointView< MatrixType, _Mode >::operator=(), and Eigen::SparseSelfAdjointView< MatrixType, _Mode >::operator=().
Here is the caller graph for this function:
|
friend |
Efficient dense vector/matrix times sparse self-adjoint matrix product
|
friend |
Note that there is no algorithmic advantage of performing such a product compared to a general sparse-sparse matrix product. Indeed, the SparseSelfadjointView operand is first copied into a temporary SparseMatrix before computing the product.
|
protected |
Referenced by Eigen::SparseSelfAdjointView< MatrixType, _Mode >::cols(), Eigen::SparseSelfAdjointView< MatrixType, _Mode >::matrix(), Eigen::SparseSelfAdjointView< MatrixType, _Mode >::matrix(), Eigen::SparseSelfAdjointView< MatrixType, _Mode >::rankUpdate(), Eigen::SparseSelfAdjointView< MatrixType, _Mode >::rows(), and Eigen::SparseSelfAdjointView< MatrixType, _Mode >::twistedBy().