| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| DynamicSparseMatrix.h | 80 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()); }
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 = IsRowMajor ? rows : cols
[all...] |
| BlockOfDynamicSparseMatrix.h | 47 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize)
48 : m_matrix(matrix), m_outerStart(outerStart), m_outerSize(outerSize)
50 eigen_assert( (outerStart>=0) && ((outerStart+outerSize)<=matrix.outerSize()) );
57 eigen_assert( (outer>=0) && (outer<matrix.outerSize()) );
|
| RandomSetter.h | 184 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize();
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/ |
| SparseView.h | 48 inline Index outerSize() const { return m_matrix.outerSize(); }
|
| SparsePermutation.h | 60 Matrix<Index,Dynamic,1> 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 Matrix<Index,Dynamic,1> sizes(tmp.outerSize());
88 for(Index j=0; j<m_matrix.outerSize(); ++j)
92 for(Index j=0; j<m_matrix.outerSize(); ++j)
|
| SparseMatrixBase.h | 166 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); }
205 const Index outerSize = (int(OtherDerived::Flags) & RowMajorBit) ? other.rows() : other.cols();
212 for (Index j=0; j<outerSize; ++j)
240 const Index outerSize = other.outerSize();
246 for (Index j=0; j<outerSize; ++j)
273 for (Index row=0; row<nm.outerSize(); ++row)
409 InnerVectorsReturnType innerVectors(Index outerStart, Index outerSize);
410 const ConstInnerVectorsReturnType innerVectors(Index outerStart, Index outerSize) const;
417 for (Index j=0; j<outerSize(); ++j
[all...] |
| SparseRedux.h | 21 for (Index j=0; j<outerSize(); ++j)
|
| SparseMatrix.h | 126 inline Index outerSize() const { return m_outerSize; }
226 reserve(Matrix<Index,Dynamic,1>::Constant(outerSize(), 2));
598 const Index outerSize = IsRowMajor ? rows : cols;
601 if (m_outerSize != outerSize || m_outerSize==0)
604 m_outerIndex = static_cast<Index*>(std::malloc((outerSize + 1) * sizeof(Index)));
607 m_outerSize = outerSize;
753 for (Index i=0; i<m.outerSize(); ++i)
766 for (Index i=0; i<m.outerSize(); ++i)
772 for (Index i=0; i<m.outerSize(); ++i)
[all...] |
| SparseDenseProduct.h | 177 Index n = lhs.outerSize();
201 for(Index j=0; j<lhs.outerSize(); ++j)
221 for(Index j=0; j<lhs.outerSize(); ++j)
240 for(Index j=0; j<lhs.outerSize(); ++j)
|
| SparseBlock.h | 24 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
54 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
78 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize;
102 enum { OuterSize = IsRowMajor ? BlockRows : BlockCols };
129 : m_matrix(xpr), m_outerStart(i), m_outerSize(OuterSize)
152 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
172 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
201 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
237 return Map<const Matrix<Index,OuterSize,1> >(m_matrix.innerNonZeroPtr()+m_outerStart, m_outerSize.value()).sum();
272 const internal::variable_if_dynamic<Index, OuterSize> m_outerSize
[all...] |
| SparseCwiseUnaryOp.h | 145 for (Index j=0; j<outerSize(); ++j)
155 for (Index j=0; j<outerSize(); ++j)
|
| SparseSparseProductWithPruning.h | 27 // make sure to call innerSize/outerSize since we fake the storage order.
29 Index cols = rhs.outerSize();
30 //Index size = lhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
|
| SparseVector.h | 85 EIGEN_STRONG_INLINE Index outerSize() const { return 1; }
425 eigen_internal_assert(src.outerSize()==src.size());
438 if(src.outerSize()==1) sparse_vector_assign_selector<Dest,Src,SVA_Inner>::run(dst, src);
|
| ConservativeSparseSparseProduct.h | 23 // make sure to call innerSize/outerSize since we fake the storage order.
25 Index cols = rhs.outerSize();
26 eigen_assert(lhs.outerSize() == rhs.innerSize());
|
| /external/eigen/Eigen/src/Core/ |
| Assign.h | 262 const Index outerSize = dst.outerSize();
263 for(Index outer = 0; outer < outerSize; ++outer)
285 const Index outerSize = dst.outerSize();
286 for(Index outer = 0; outer < outerSize; ++outer)
329 const Index outerSize = dst.outerSize();
331 for(Index outer = 0; outer < outerSize; ++outer)
353 const Index outerSize = dst.outerSize()
[all...] |
| Assign_MKL.h | 93 const Index outerSize = dst.outerSize();
94 for(Index outer = 0; outer < outerSize; ++outer) {
|
| Redux.h | 180 for(Index i = 1; i < mat.outerSize(); ++i)
261 const Index outerSize = mat.outerSize();
270 for(Index j=0; j<outerSize; ++j)
275 for(Index j=0; j<outerSize; ++j)
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrix.h | 86 inline Index outerSize() const {
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...] |
| SkylineMatrixBase.h | 128 Index outerSize() const {
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| Scaling.h | 91 for (int k=0; k<m_matrix.outerSize(); ++k)
115 for (int k=0; k<m_matrix.outerSize(); ++k)
|
| /external/eigen/test/ |
| mapstride.cpp | 72 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)
|
| sparse.h | 69 for(Index j=0; j<sparseMat.outerSize(); j++)
119 for(int j=0; j<sparseMat.outerSize(); j++)
|
| sparse_basic.cpp | 139 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
159 m2.reserve(VectorXi::Constant(m2.outerSize(), 2));
182 VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? m2.innerSize() : std::max<int>(1,m2.innerSize()/8)));
351 Index i = internal::random<Index>(0,m2.outerSize()-1);
379 for (Index j=0; j<m2.outerSize(); ++j)
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 64 for(int j=0; j<mat.outerSize(); ++j)
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 133 for (Index kA=0; kA < m_A.outerSize(); ++kA)
135 for (Index kB=0; kB < m_B.outerSize(); ++kB)
|
