|
const IndicesType & | indices () const |
|
IndicesType & | indices () |
|
template<typename Other > |
PermutationMatrix & | operator= (const PermutationBase< Other > &other) |
|
template<typename Other > |
PermutationMatrix & | operator= (const TranspositionsBase< Other > &tr) |
|
PermutationMatrix & | operator= (const PermutationMatrix &other) |
|
| PermutationMatrix () |
|
| PermutationMatrix (Index size) |
|
template<typename OtherDerived > |
| PermutationMatrix (const PermutationBase< OtherDerived > &other) |
|
| PermutationMatrix (const PermutationMatrix &other) |
|
template<typename Other > |
| PermutationMatrix (const MatrixBase< Other > &indices) |
|
template<typename Other > |
| PermutationMatrix (const TranspositionsBase< Other > &tr) |
|
template<typename Other > |
| PermutationMatrix (const InverseImpl< Other, PermutationStorage > &other) |
|
template<typename Lhs , typename Rhs > |
| PermutationMatrix (internal::PermPermProduct_t, const Lhs &lhs, const Rhs &rhs) |
|
PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex > & | applyTranspositionOnTheLeft (Index i, Index j) |
|
PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex > & | applyTranspositionOnTheRight (Index i, Index j) |
|
Index | cols () const |
|
Index | determinant () const |
|
void | evalTo (MatrixBase< DenseDerived > &other) const |
|
const IndicesType & | indices () const |
|
IndicesType & | indices () |
|
InverseReturnType | inverse () const |
|
PlainPermutationType | operator* (const PermutationBase< Other > &other) const |
|
PlainPermutationType | operator* (const InverseImpl< Other, PermutationStorage > &other) const |
|
PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex > & | operator= (const PermutationBase< OtherDerived > &other) |
|
PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex > & | operator= (const TranspositionsBase< OtherDerived > &tr) |
|
PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex > & | operator= (const PermutationBase &other) |
|
void | resize (Index newSize) |
|
Index | rows () const |
|
void | setIdentity () |
|
void | setIdentity (Index newSize) |
|
Index | size () const |
|
DenseMatrixType | toDenseMatrix () const |
|
InverseReturnType | transpose () const |
|
template<typename Dest > |
EIGEN_DEVICE_FUNC void | addTo (Dest &dst) const |
|
template<typename Dest > |
EIGEN_DEVICE_FUNC void | applyThisOnTheLeft (Dest &dst) const |
|
template<typename Dest > |
EIGEN_DEVICE_FUNC void | applyThisOnTheRight (Dest &dst) const |
|
EIGEN_DEVICE_FUNC Index | cols () const |
|
EIGEN_DEVICE_FUNC Derived & | const_cast_derived () const |
|
EIGEN_DEVICE_FUNC const Derived & | const_derived () const |
|
EIGEN_DEVICE_FUNC Derived & | derived () |
|
EIGEN_DEVICE_FUNC const Derived & | derived () const |
|
template<typename Dest > |
EIGEN_DEVICE_FUNC void | evalTo (Dest &dst) const |
|
EIGEN_DEVICE_FUNC Index | rows () const |
|
EIGEN_DEVICE_FUNC Index | size () const |
|
template<typename Dest > |
EIGEN_DEVICE_FUNC void | subTo (Dest &dst) const |
|
template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex>
class Eigen::PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex >
Permutation matrix.
- Template Parameters
-
SizeAtCompileTime | the number of rows/cols, or Dynamic |
MaxSizeAtCompileTime | the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it. |
_StorageIndex | the integer type of the indices |
This class represents a permutation matrix, internally stored as a vector of integers.
- See also
- class PermutationBase, class PermutationWrapper, class DiagonalMatrix
Definition at line 308 of file PermutationMatrix.h.
template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex>
template<typename Other >
Generic constructor from expression of the indices. The indices array has the meaning that the permutations sends each integer i to indices[i].
- Warning
- It is your responsibility to check that the indices array that you passes actually describes a permutation, i.e., each value between 0 and n-1 occurs exactly once, where n is the array's size.
Definition at line 350 of file PermutationMatrix.h.