Searched refs:outerSize (Results 1 - 25 of 34) sorted by relevance

12

/external/eigen/unsupported/Eigen/src/SparseExtra/
H A DDynamicSparseMatrix.h80 inline Index rows() const { return IsRowMajor ? outerSize() : m_innerSize; }
81 inline Index cols() const { return IsRowMajor ? m_innerSize : outerSize(); }
83 inline Index outerSize() const { return static_cast<Index>(m_data.size()); } function in class:Eigen::DynamicSparseMatrix
115 for (Index j=0; j<outerSize(); ++j)
123 for (Index j=0; j<outerSize(); ++j)
132 if (outerSize()>0)
134 Index reserveSizePerVector = (std::max)(reserveSize/outerSize(),Index(4));
135 for (Index j=0; j<outerSize(); ++j)
191 for (Index j=0; j<outerSize(); ++j)
199 const Index outerSize
[all...]
H A DBlockOfDynamicSparseMatrix.h41 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize) argument
42 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize)
44 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) );
51 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
H A DRandomSetter.h184 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize(); local
185 const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize();
186 m_outerPackets = outerSize >> OuterPacketBits;
187 if (outerSize&OuterPacketMask)
203 for (Index j=0; j<mp_target->outerSize(); ++j)
239 VectorXi positions(mp_target->outerSize());
253 for (Index j=0; j<mp_target->outerSize(); ++j)
261 mp_target->outerIndexPtr()[mp_target->outerSize()] = count;
/external/eigen/Eigen/src/SparseCore/
H A DSparseView.h48 inline Index outerSize() const { return m_matrix.outerSize(); } function in class:Eigen::SparseView
H A DSparsePermutation.h60 VectorXi sizes(m_matrix.outerSize());
61 for(Index j=0; j<m_matrix.outerSize(); ++j)
67 for(Index j=0; j<m_matrix.outerSize(); ++j)
80 VectorXi sizes(tmp.outerSize());
88 for(Index j=0; j<m_matrix.outerSize(); ++j)
92 for(Index j=0; j<m_matrix.outerSize(); ++j)
H A DSparseBlock.h67 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize) argument
68 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize)
70 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) );
77 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
140 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize) argument
141 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize)
143 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) );
150 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
375 innerVectors(Index outerStart, Index outerSize) argument
[all...]
H A DSparseMatrix.h126 inline Index outerSize() const { return m_outerSize; } function in class:Eigen::SparseMatrix
220 reserve(VectorXi::Constant(outerSize(), 2));
514 const Index outerSize = IsRowMajor ? rows : cols; local
517 if (m_outerSize != outerSize || m_outerSize==0)
520 m_outerIndex = new Index [outerSize+1];
521 m_outerSize = outerSize;
638 Eigen::Map<Matrix<Index, Dynamic, 1> > (m_outerIndex,outerSize()).setZero();
641 for (Index j=0; j<otherCopy.outerSize(); ++j)
647 VectorXi positions(outerSize());
648 for (Index j=0; j<outerSize();
[all...]
H A DSparseRedux.h21 for (Index j=0; j<outerSize(); ++j)
H A DSparseMatrixBase.h163 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); } function in class:Eigen::SparseMatrixBase
202 const Index outerSize = (int(OtherDerived::Flags) & RowMajorBit) ? other.rows() : other.cols(); local
209 for (Index j=0; j<outerSize; ++j)
237 const Index outerSize = other.outerSize(); local
243 for (Index j=0; j<outerSize; ++j)
270 for (Index row=0; row<nm.outerSize(); ++row)
413 SparseInnerVectorSet<Derived,Dynamic> innerVectors(Index outerStart, Index outerSize);
414 const SparseInnerVectorSet<Derived,Dynamic> innerVectors(Index outerStart, Index outerSize) const;
421 for (Index j=0; j<outerSize();
[all...]
H A DSparseDenseProduct.h157 int n = lhs.outerSize();
181 for(Index j=0; j<lhs.outerSize(); ++j)
201 for(Index j=0; j<lhs.outerSize(); ++j)
220 for(Index j=0; j<lhs.outerSize(); ++j)
H A DSparseCwiseUnaryOp.h145 for (Index j=0; j<outerSize(); ++j)
155 for (Index j=0; j<outerSize(); ++j)
H A DSparseSparseProductWithPruning.h27 // make sure to call innerSize/outerSize since we fake the storage order.
29 Index cols = rhs.outerSize();
30 //int size = lhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
H A DConservativeSparseSparseProduct.h23 // make sure to call innerSize/outerSize since we fake the storage order.
25 Index cols = rhs.outerSize();
26 eigen_assert(lhs.outerSize() == rhs.innerSize());
H A DMappedSparseMatrix.h52 inline Index outerSize() const { return m_outerSize; } function in class:Eigen::MappedSparseMatrix
/external/eigen/Eigen/src/Core/
H A DAssign.h262 const Index outerSize = dst.outerSize(); local
263 for(Index outer = 0; outer < outerSize; ++outer)
285 const Index outerSize = dst.outerSize(); local
286 for(Index outer = 0; outer < outerSize; ++outer)
329 const Index outerSize = dst.outerSize(); local
331 for(Index outer = 0; outer < outerSize; ++outer)
353 const Index outerSize local
451 const Index outerSize = dst.outerSize(); local
[all...]
H A DRedux.h180 for(Index i = 1; i < mat.outerSize(); ++i)
261 const Index outerSize = mat.outerSize(); local
270 for(Index j=0; j<outerSize; ++j)
275 for(Index j=0; j<outerSize; ++j)
H A DAssign_MKL.h93 const Index outerSize = dst.outerSize(); local
94 for(Index outer = 0; outer < outerSize; ++outer) {
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineMatrix.h86 inline Index outerSize() const { function in class:Eigen::SkylineMatrix
150 eigen_assert(outer < outerSize());
199 eigen_assert(outer < outerSize());
235 eigen_assert(idx < outerSize());
244 eigen_assert(outer < outerSize());
268 eigen_assert(outer < outerSize());
288 eigen_assert(idx < outerSize());
297 eigen_assert(outer < outerSize());
316 eigen_assert(outer < outerSize());
333 eigen_assert(outer < outerSize());
[all...]
H A DSkylineMatrixBase.h128 Index outerSize() const { function in class:Eigen::SkylineMatrixBase
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DScaling.h91 for (int k=0; k<m_matrix.outerSize(); ++k)
115 for (int k=0; k<m_matrix.outerSize(); ++k)
/external/eigen/unsupported/Eigen/src/KroneckerProduct/
H A DKroneckerTensorProduct.h58 for (int kA=0; kA<A.outerSize(); ++kA)
60 for (int kB=0; kB<B.outerSize(); ++kB)
/external/eigen/test/
H A Dmapstride.cpp72 for(int i = 0; i < m.outerSize(); ++i)
91 for(int i = 0; i < m.outerSize(); ++i)
105 for(int i = 0; i < m.outerSize(); ++i)
H A Dsparse.h69 for(int j=0; j<sparseMat.outerSize(); j++)
119 for(int j=0; j<sparseMat.outerSize(); j++)
H A Dsparse_basic.cpp99 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
119 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
142 VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? m2.innerSize() : std::max<int>(1,m2.innerSize()/8)));
279 for (int j=0; j<m2.outerSize(); ++j)
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DBasicPreconditioners.h64 for(int j=0; j<mat.outerSize(); ++j)

Completed in 201 milliseconds

12