// This file is part of Eigen, a lightweight C++ template library // for linear algebra. Eigen itself is part of the KDE project. // // Copyright (C) 2006-2008 Benoit Jacob // // Eigen is free software; you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public // License as published by the Free Software Foundation; either // version 3 of the License, or (at your option) any later version. // // Alternatively, you can redistribute it and/or // modify it under the terms of the GNU General Public License as // published by the Free Software Foundation; either version 2 of // the License, or (at your option) any later version. // // Eigen is distributed in the hope that it will be useful, but WITHOUT ANY // WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS // FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the // GNU General Public License for more details. // // You should have received a copy of the GNU Lesser General Public // License and a copy of the GNU General Public License along with // Eigen. If not, see . #ifndef EIGEN_MATRIXBASE_H #define EIGEN_MATRIXBASE_H /** \class MatrixBase * * \brief Base class for all matrices, vectors, and expressions * * This class is the base that is inherited by all matrix, vector, and expression * types. Most of the Eigen API is contained in this class. * * \param Derived is the derived type, e.g. a matrix type, or an expression, etc. * * When writing a function taking Eigen objects as argument, if you want your function * to take as argument any matrix, vector, or expression, just let it take a * MatrixBase argument. As an example, here is a function printFirstRow which, given * a matrix, vector, or expression \a x, prints the first row of \a x. * * \code template void printFirstRow(const Eigen::MatrixBase& x) { cout << x.row(0) << endl; } * \endcode * * \nosubgrouping */ template class MatrixBase { struct CommaInitializer; public: class InnerIterator; typedef typename ei_traits::Scalar Scalar; typedef typename ei_packet_traits::type PacketScalar; enum { RowsAtCompileTime = ei_traits::RowsAtCompileTime, /**< The number of rows at compile-time. This is just a copy of the value provided * by the \a Derived type. If a value is not known at compile-time, * it is set to the \a Dynamic constant. * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */ ColsAtCompileTime = ei_traits::ColsAtCompileTime, /**< The number of columns at compile-time. This is just a copy of the value provided * by the \a Derived type. If a value is not known at compile-time, * it is set to the \a Dynamic constant. * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */ SizeAtCompileTime = (ei_size_at_compile_time::RowsAtCompileTime, ei_traits::ColsAtCompileTime>::ret), /**< This is equal to the number of coefficients, i.e. the number of * rows times the number of columns, or to \a Dynamic if this is not * known at compile-time. \sa RowsAtCompileTime, ColsAtCompileTime */ MaxRowsAtCompileTime = ei_traits::MaxRowsAtCompileTime, /**< This value is equal to the maximum possible number of rows that this expression * might have. If this expression might have an arbitrarily high number of rows, * this value is set to \a Dynamic. * * This value is useful to know when evaluating an expression, in order to determine * whether it is possible to avoid doing a dynamic memory allocation. * * \sa RowsAtCompileTime, MaxColsAtCompileTime, MaxSizeAtCompileTime */ MaxColsAtCompileTime = ei_traits::MaxColsAtCompileTime, /**< This value is equal to the maximum possible number of columns that this expression * might have. If this expression might have an arbitrarily high number of columns, * this value is set to \a Dynamic. * * This value is useful to know when evaluating an expression, in order to determine * whether it is possible to avoid doing a dynamic memory allocation. * * \sa ColsAtCompileTime, MaxRowsAtCompileTime, MaxSizeAtCompileTime */ MaxSizeAtCompileTime = (ei_size_at_compile_time::MaxRowsAtCompileTime, ei_traits::MaxColsAtCompileTime>::ret), /**< This value is equal to the maximum possible number of coefficients that this expression * might have. If this expression might have an arbitrarily high number of coefficients, * this value is set to \a Dynamic. * * This value is useful to know when evaluating an expression, in order to determine * whether it is possible to avoid doing a dynamic memory allocation. * * \sa SizeAtCompileTime, MaxRowsAtCompileTime, MaxColsAtCompileTime */ IsVectorAtCompileTime = ei_traits::RowsAtCompileTime == 1 || ei_traits::ColsAtCompileTime == 1, /**< This is set to true if either the number of rows or the number of * columns is known at compile-time to be equal to 1. Indeed, in that case, * we are dealing with a column-vector (if there is only one column) or with * a row-vector (if there is only one row). */ Flags = ei_traits::Flags, /**< This stores expression \ref flags flags which may or may not be inherited by new expressions * constructed from this one. See the \ref flags "list of flags". */ CoeffReadCost = ei_traits::CoeffReadCost /**< This is a rough measure of how expensive it is to read one coefficient from * this expression. */ }; /** Default constructor. Just checks at compile-time for self-consistency of the flags. */ MatrixBase() { ei_assert(ei_are_flags_consistent::ret); } /** This is the "real scalar" type; if the \a Scalar type is already real numbers * (e.g. int, float or double) then \a RealScalar is just the same as \a Scalar. If * \a Scalar is \a std::complex then RealScalar is \a T. * * \sa class NumTraits */ typedef typename NumTraits::Real RealScalar; /** \returns the number of rows. \sa cols(), RowsAtCompileTime */ inline int rows() const { return derived()._rows(); } /** \returns the number of columns. \sa row(), ColsAtCompileTime*/ inline int cols() const { return derived()._cols(); } /** \returns the number of coefficients, which is \a rows()*cols(). * \sa rows(), cols(), SizeAtCompileTime. */ inline int size() const { return rows() * cols(); } /** \returns true if either the number of rows or the number of columns is equal to 1. * In other words, this function returns * \code rows()==1 || cols()==1 \endcode * \sa rows(), cols(), IsVectorAtCompileTime. */ inline bool isVector() const { return rows()==1 || cols()==1; } /** Represents a constant matrix */ typedef CwiseNullaryOp,Derived> ConstantReturnType; /** Represents a vector block of a matrix */ template struct SubVectorReturnType { typedef Block::RowsAtCompileTime == 1 ? 1 : Size), (ei_traits::ColsAtCompileTime == 1 ? 1 : Size)> Type; }; /** Represents a scalar multiple of a matrix */ typedef CwiseUnaryOp, Derived> ScalarMultipleReturnType; /** Represents a quotient of a matrix by a scalar*/ typedef CwiseUnaryOp, Derived> ScalarQuotient1ReturnType; /** the return type of MatrixBase::conjugate() */ typedef typename ei_meta_if::IsComplex, CwiseUnaryOp, Derived>, Derived& >::ret ConjugateReturnType; /** the return type of MatrixBase::real() */ typedef CwiseUnaryOp, Derived> RealReturnType; /** the return type of MatrixBase::adjoint() */ typedef Transpose::type> > AdjointReturnType; typedef Matrix::Scalar>::Real, ei_traits::ColsAtCompileTime, 1> EigenvaluesReturnType; /** Copies \a other into *this. \returns a reference to *this. */ template Derived& operator=(const MatrixBase& other); /** Copies \a other into *this without evaluating other. \returns a reference to *this. */ template Derived& lazyAssign(const MatrixBase& other); /** Special case of the template operator=, in order to prevent the compiler * from generating a default operator= (issue hit with g++ 4.1) */ inline Derived& operator=(const MatrixBase& other) { return this->operator=(other); } /** Overloaded for optimal product evaluation */ template Derived& lazyAssign(const Product& product); CommaInitializer operator<< (const Scalar& s); template CommaInitializer operator<< (const MatrixBase& other); const Scalar coeff(int row, int col) const; const Scalar operator()(int row, int col) const; Scalar& coeffRef(int row, int col); Scalar& operator()(int row, int col); const Scalar coeff(int index) const; const Scalar operator[](int index) const; Scalar& coeffRef(int index); Scalar& operator[](int index); template PacketScalar packet(int row, int col) const; template void writePacket(int row, int col, const PacketScalar& x); template PacketScalar packet(int index) const; template void writePacket(int index, const PacketScalar& x); const Scalar x() const; const Scalar y() const; const Scalar z() const; const Scalar w() const; Scalar& x(); Scalar& y(); Scalar& z(); Scalar& w(); const CwiseUnaryOp::Scalar>,Derived> operator-() const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> operator+(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> operator-(const MatrixBase &other) const; template Derived& operator+=(const MatrixBase& other); template Derived& operator-=(const MatrixBase& other); template Derived& operator+=(const Flagged, 0, EvalBeforeNestingBit | EvalBeforeAssigningBit>& other); Derived& operator*=(const Scalar& other); Derived& operator/=(const Scalar& other); const ScalarMultipleReturnType operator*(const Scalar& scalar) const; const CwiseUnaryOp::Scalar>, Derived> operator/(const Scalar& scalar) const; inline friend const CwiseUnaryOp::Scalar>, Derived> operator*(const Scalar& scalar, const MatrixBase& matrix) { return matrix*scalar; } template const typename ProductReturnType::Type operator*(const MatrixBase &other) const; template Derived& operator*=(const MatrixBase& other); template typename OtherDerived::Eval inverseProduct(const MatrixBase& other) const; template Scalar dot(const MatrixBase& other) const; RealScalar norm2() const; RealScalar norm() const; const ScalarQuotient1ReturnType normalized() const; void normalize(); Transpose transpose(); const Transpose transpose() const; const AdjointReturnType adjoint() const; Block::ColsAtCompileTime> row(int i); const Block::ColsAtCompileTime> row(int i) const; Block::RowsAtCompileTime, 1> col(int i); const Block::RowsAtCompileTime, 1> col(int i) const; Minor minor(int row, int col); const Minor minor(int row, int col) const; Block block(int startRow, int startCol, int blockRows, int blockCols); const Block block(int startRow, int startCol, int blockRows, int blockCols) const; Block block(int start, int size); const Block block(int start, int size) const; typename SubVectorReturnType::Type start(int size); const typename SubVectorReturnType::Type start(int size) const; typename SubVectorReturnType::Type end(int size); const typename SubVectorReturnType::Type end(int size) const; Block corner(CornerType type, int cRows, int cCols); const Block corner(CornerType type, int cRows, int cCols) const; template Block block(int startRow, int startCol); template const Block block(int startRow, int startCol) const; template Block corner(CornerType type); template const Block corner(CornerType type) const; template typename SubVectorReturnType::Type start(void); template const typename SubVectorReturnType::Type start() const; template typename SubVectorReturnType::Type end(); template const typename SubVectorReturnType::Type end() const; DiagonalCoeffs diagonal(); const DiagonalCoeffs diagonal() const; template Part part(); template const Extract extract() const; static const ConstantReturnType constant(int rows, int cols, const Scalar& value); static const ConstantReturnType constant(int size, const Scalar& value); static const ConstantReturnType constant(const Scalar& value); template static const CwiseNullaryOp create(int rows, int cols, const CustomNullaryOp& func); template static const CwiseNullaryOp create(int size, const CustomNullaryOp& func); template static const CwiseNullaryOp create(const CustomNullaryOp& func); static const ConstantReturnType zero(int rows, int cols); static const ConstantReturnType zero(int size); static const ConstantReturnType zero(); static const ConstantReturnType ones(int rows, int cols); static const ConstantReturnType ones(int size); static const ConstantReturnType ones(); static const CwiseNullaryOp,Derived> identity(); static const CwiseNullaryOp,Derived> identity(int rows, int cols); const DiagonalMatrix asDiagonal() const; Derived& setConstant(const Scalar& value); Derived& setZero(); Derived& setOnes(); Derived& setRandom(); Derived& setIdentity(); template bool isApprox(const MatrixBase& other, RealScalar prec = precision()) const; bool isMuchSmallerThan(const RealScalar& other, RealScalar prec = precision()) const; template bool isMuchSmallerThan(const MatrixBase& other, RealScalar prec = precision()) const; bool isApproxToConstant(const Scalar& value, RealScalar prec = precision()) const; bool isZero(RealScalar prec = precision()) const; bool isOnes(RealScalar prec = precision()) const; bool isIdentity(RealScalar prec = precision()) const; bool isDiagonal(RealScalar prec = precision()) const; bool isUpper(RealScalar prec = precision()) const; bool isLower(RealScalar prec = precision()) const; template bool isOrthogonal(const MatrixBase& other, RealScalar prec = precision()) const; bool isUnitary(RealScalar prec = precision()) const; template inline bool operator==(const MatrixBase& other) const { return derived().cwiseEqualTo(other.derived()).all(); } template inline bool operator!=(const MatrixBase& other) const { return derived().cwiseNotEqualTo(other.derived()).all(); } template const CwiseUnaryOp::Scalar, NewType>, Derived> cast() const; EIGEN_ALWAYS_INLINE const typename ei_eval::type eval() const { return typename ei_eval::type(derived()); } template void swap(const MatrixBase& other); template const Flagged marked() const; const Flagged lazy() const; /** \returns number of elements to skip to pass from one row (resp. column) to another * for a row-major (resp. column-major) matrix. * Combined with coeffRef() and the \ref flags flags, it allows a direct access to the data * of the underlying matrix. */ inline int stride(void) const { return derived()._stride(); } inline const NestByValue nestByValue() const; const ConjugateReturnType conjugate() const; const RealReturnType real() const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseProduct(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseQuotient(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseMin(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseMax(const MatrixBase &other) const; const CwiseUnaryOp::Scalar>, Derived> cwiseAbs() const; const CwiseUnaryOp::Scalar>, Derived> cwiseAbs2() const; template const CwiseUnaryOp cwise(const CustomUnaryOp& func = CustomUnaryOp()) const; template const CwiseBinaryOp cwise(const MatrixBase &other, const CustomBinaryOp& func = CustomBinaryOp()) const; Scalar sum() const; Scalar trace() const; typename ei_traits::Scalar minCoeff() const; typename ei_traits::Scalar maxCoeff() const; typename ei_traits::Scalar minCoeff(int* row, int* col = 0) const; typename ei_traits::Scalar maxCoeff(int* row, int* col = 0) const; template typename ei_result_of::Scalar)>::type redux(const BinaryOp& func) const; template void visit(Visitor& func) const; inline const Derived& derived() const { return *static_cast(this); } inline Derived& derived() { return *static_cast(this); } inline Derived& const_cast_derived() const { return *static_cast(const_cast(this)); } /////////// Array module /////////// const Array array() const; Array array(); const CwiseUnaryOp::Scalar>, Derived> cwiseSqrt() const; const CwiseUnaryOp::Scalar>, Derived> cwiseExp() const; const CwiseUnaryOp::Scalar>, Derived> cwiseLog() const; const CwiseUnaryOp::Scalar>, Derived> cwiseCos() const; const CwiseUnaryOp::Scalar>, Derived> cwiseSin() const; const CwiseUnaryOp::Scalar>, Derived> cwisePow(const Scalar& exponent) const; const CwiseUnaryOp::Scalar>, Derived> cwiseInverse() const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseLessThan(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseLessEqual(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseGreaterThan(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseGreaterEqual(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseEqualTo(const MatrixBase &other) const; template const CwiseBinaryOp::Scalar>, Derived, OtherDerived> cwiseNotEqualTo(const MatrixBase &other) const; bool all(void) const; bool any(void) const; template const PartialRedux verticalRedux(const BinaryOp& func) const; template const PartialRedux horizontalRedux(const BinaryOp& func) const; static const CwiseNullaryOp,Derived> random(int rows, int cols); static const CwiseNullaryOp,Derived> random(int size); static const CwiseNullaryOp,Derived> random(); /////////// LU module /////////// const Inverse::type, true> inverse() const; const Inverse::type, false> quickInverse() const; Scalar determinant() const; /////////// QR module /////////// const QR::type> qr() const; EigenvaluesReturnType eigenvalues() const; RealScalar matrixNorm() const; /////////// Geometry module /////////// template typename ei_eval::type cross(const MatrixBase& other) const; }; #endif // EIGEN_MATRIXBASE_H