devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity
Files
76c3cf694987382c7d92c3fb7cdf65215bfdeb5e
eigen/Eigen/src/Core/CoreIterators.h

62 lines
1.9 KiB
C
Raw Normal View History

add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
// This file is part of Eigen, a lightweight C++ template library
remove sentence "Eigen itself is part of the KDE project." it never made very precise sense. but now does it still make any?
2009-05-22 20:25:33 +02:00
// for linear algebra.
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
//
email change
2010-06-24 23:21:58 +02:00
// Copyright (C) 2008-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
//
Automatic relicensing to MPL2 using Keirs script. Manual fixup follows.
2012-07-13 14:42:47 -04:00
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
#ifndef EIGEN_COREITERATORS_H
#define EIGEN_COREITERATORS_H
Get rid of include directives inside namespace blocks (bug #339).
2012-04-15 11:06:28 +01:00
namespace Eigen {
various work on the Sparse module: * added some glue to Eigen/Core (SparseBit, ei_eval, Matrix) * add two new sparse matrix types: HashMatrix: based on std::map (for random writes) LinkedVectorMatrix: array of linked vectors (for outer coherent writes, e.g. to transpose a matrix) * add a SparseSetter class to easily set/update any kind of matrices, e.g.: { SparseSetter<MatrixType,RandomAccessPattern> wrapper(mymatrix); for (...) wrapper->coeffRef(rand(),rand()) = rand(); } * automatic shallow copy for RValue * and a lot of mess ! plus: * remove the remaining ArrayBit related stuff * don't use alloca in product for very large memory allocation
2008-06-26 23:22:26 +00:00
/* This file contains the respective InnerIterator definition of the expressions defined in Eigen/Core
*/
cleanning pass on the sparse modules: - remove outdated/deprecated code - improve a bit the documentation
2011-11-28 16:36:37 +01:00
/** \ingroup SparseCore_Module
* \class InnerIterator
Big rewrite in the Sparse module: SparseMatrixBase no longer inherits MatrixBase. That means a lot of features which were available for sparse matrices via the dense (and super slow) implemention are no longer available. All features which make sense for sparse matrices (aka can be implemented efficiently) will be implemented soon, but don't expect to see an API as rich as for the dense path. Other changes: * no block(), row(), col() anymore. * instead use .innerVector() to get a col or row vector of a matrix. * .segment(), start(), end() will be back soon, not sure for block() * faster cwise product
2009-01-14 14:24:10 +00:00
* \brief An InnerIterator allows to loop over the element of a sparse (or dense) matrix or expression
*
* todo
*/
// generic version for dense matrix and expressions
port VectorwiseOp and Swap to the novel mechanisms, and various cleanning
2010-01-04 19:00:16 +01:00
template<typename Derived> class DenseBase<Derived>::InnerIterator
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
{
compilation fix
2010-10-14 10:19:55 +02:00
protected:
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
typedef typename Derived::Scalar Scalar;
the Index types change. As discussed on the list (too long to explain here).
2010-05-30 16:00:58 -04:00
typedef typename Derived::Index Index;
Sparse module: add row/col methods to the iterators
2009-01-15 14:16:41 +00:00
enum { IsRowMajor = (Derived::Flags&RowMajorBit)==RowMajorBit };
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
public:
the Index types change. As discussed on the list (too long to explain here).
2010-05-30 16:00:58 -04:00
EIGEN_STRONG_INLINE InnerIterator(const Derived& expr, Index outer)
fixed a bug in the DenseBase InnerIterator ctor.
2010-06-14 02:18:36 +03:00
: m_expression(expr), m_inner(0), m_outer(outer), m_end(expr.innerSize())
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
{}
Sparse module: * extend unit tests * add support for generic sum reduction and dot product * optimize the cwise()* : this is a special case of CwiseBinaryOp where we only have to process the coeffs which are not null for *both* matrices. Perhaps there exist some other binary operations like that ?
2009-01-07 17:01:57 +00:00
EIGEN_STRONG_INLINE Scalar value() const
various work on the Sparse module: * added some glue to Eigen/Core (SparseBit, ei_eval, Matrix) * add two new sparse matrix types: HashMatrix: based on std::map (for random writes) LinkedVectorMatrix: array of linked vectors (for outer coherent writes, e.g. to transpose a matrix) * add a SparseSetter class to easily set/update any kind of matrices, e.g.: { SparseSetter<MatrixType,RandomAccessPattern> wrapper(mymatrix); for (...) wrapper->coeffRef(rand(),rand()) = rand(); } * automatic shallow copy for RValue * and a lot of mess ! plus: * remove the remaining ArrayBit related stuff * don't use alloca in product for very large memory allocation
2008-06-26 23:22:26 +00:00
{
Sparse module: add row/col methods to the iterators
2009-01-15 14:16:41 +00:00
return (IsRowMajor) ? m_expression.coeff(m_outer, m_inner)
: m_expression.coeff(m_inner, m_outer);
various work on the Sparse module: * added some glue to Eigen/Core (SparseBit, ei_eval, Matrix) * add two new sparse matrix types: HashMatrix: based on std::map (for random writes) LinkedVectorMatrix: array of linked vectors (for outer coherent writes, e.g. to transpose a matrix) * add a SparseSetter class to easily set/update any kind of matrices, e.g.: { SparseSetter<MatrixType,RandomAccessPattern> wrapper(mymatrix); for (...) wrapper->coeffRef(rand(),rand()) = rand(); } * automatic shallow copy for RValue * and a lot of mess ! plus: * remove the remaining ArrayBit related stuff * don't use alloca in product for very large memory allocation
2008-06-26 23:22:26 +00:00
}
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
Sparse module: * extend unit tests * add support for generic sum reduction and dot product * optimize the cwise()* : this is a special case of CwiseBinaryOp where we only have to process the coeffs which are not null for *both* matrices. Perhaps there exist some other binary operations like that ?
2009-01-07 17:01:57 +00:00
EIGEN_STRONG_INLINE InnerIterator& operator++() { m_inner++; return *this; }
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
the Index types change. As discussed on the list (too long to explain here).
2010-05-30 16:00:58 -04:00
EIGEN_STRONG_INLINE Index index() const { return m_inner; }
inline Index row() const { return IsRowMajor ? m_outer : index(); }
inline Index col() const { return IsRowMajor ? index() : m_outer; }
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
Sparse module: * extend unit tests * add support for generic sum reduction and dot product * optimize the cwise()* : this is a special case of CwiseBinaryOp where we only have to process the coeffs which are not null for *both* matrices. Perhaps there exist some other binary operations like that ?
2009-01-07 17:01:57 +00:00
EIGEN_STRONG_INLINE operator bool() const { return m_inner < m_end && m_inner>=0; }
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
protected:
Big rewrite in the Sparse module: SparseMatrixBase no longer inherits MatrixBase. That means a lot of features which were available for sparse matrices via the dense (and super slow) implemention are no longer available. All features which make sense for sparse matrices (aka can be implemented efficiently) will be implemented soon, but don't expect to see an API as rich as for the dense path. Other changes: * no block(), row(), col() anymore. * instead use .innerVector() to get a col or row vector of a matrix. * .segment(), start(), end() will be back soon, not sure for block() * faster cwise product
2009-01-14 14:24:10 +00:00
const Derived& m_expression;
the Index types change. As discussed on the list (too long to explain here).
2010-05-30 16:00:58 -04:00
Index m_inner;
const Index m_outer;
const Index m_end;
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
};
Get rid of include directives inside namespace blocks (bug #339).
2012-04-15 11:06:28 +01:00
} // end namespace Eigen
add experimental code for sparse matrix: - uses the common "Compressed Column Storage" scheme - supports every unary and binary operators with xpr template assuming binaryOp(0,0) == 0 and unaryOp(0) = 0 (otherwise a sparse matrix doesnot make sense) - this is the first commit, so of course, there are still several shorcommings !
2008-06-23 13:25:22 +00:00
#endif // EIGEN_COREITERATORS_H
Reference in New Issue Copy Permalink