Home
last modified time | relevance | path

Searched refs:outerSize (Results 1 – 25 of 38) sorted by relevance

12

/external/eigen/unsupported/Eigen/src/SparseExtra/
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()); }
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 …]
DRandomSetter.h184 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize(); in RandomSetter() local
185 const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize(); in RandomSetter()
186 m_outerPackets = outerSize >> OuterPacketBits; in RandomSetter()
187 if (outerSize&OuterPacketMask) in RandomSetter()
203 for (Index j=0; j<mp_target->outerSize(); ++j) in RandomSetter()
239 VectorXi positions(mp_target->outerSize()); in ~RandomSetter()
253 for (Index j=0; j<mp_target->outerSize(); ++j) in ~RandomSetter()
261 mp_target->outerIndexPtr()[mp_target->outerSize()] = count; in ~RandomSetter()
DBlockOfDynamicSparseMatrix.h47 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()) );
/external/eigen/Eigen/src/SparseCore/
DSparsePermutation.h60 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)
DSparseMatrixBase.h166 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); } in outerSize() function
205 … const Index outerSize = (int(OtherDerived::Flags) & RowMajorBit) ? other.rows() : other.cols(); in assign() local
212 for (Index j=0; j<outerSize; ++j) in assign()
240 const Index outerSize = other.outerSize(); in assignGeneric() local
246 for (Index j=0; j<outerSize; ++j) in assignGeneric()
273 for (Index row=0; row<nm.outerSize(); ++row)
407 Block<Derived,Dynamic,Dynamic,true> innerVectors(Index outerStart, Index outerSize);
408 …const Block<const Derived,Dynamic,Dynamic,true> innerVectors(Index outerStart, Index outerSize) co…
415 for (Index j=0; j<outerSize(); ++j) in evalTo()
DSparseMatrix.h126 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)
948 Matrix<Index,Dynamic,1> wi(trMat.outerSize());
[all …]
DSparseBlock.h142 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
162 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
191 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
358 …ed,Dynamic,Dynamic,true> SparseMatrixBase<Derived>::innerVectors(Index outerStart, Index outerSize) in innerVectors() argument
362 … IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize); in innerVectors()
370 …amic,Dynamic,true> SparseMatrixBase<Derived>::innerVectors(Index outerStart, Index outerSize) const in innerVectors() argument
374 … IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize); in innerVectors()
DSparseView.h48 inline Index outerSize() const { return m_matrix.outerSize(); }
DSparseDenseProduct.h177 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)
DSparseSparseProductWithPruning.h29 Index cols = rhs.outerSize(); in sparse_sparse_product_with_pruning_impl()
31 eigen_assert(lhs.outerSize() == rhs.innerSize()); in sparse_sparse_product_with_pruning_impl()
DSparseCwiseUnaryOp.h145 for (Index j=0; j<outerSize(); ++j)
155 for (Index j=0; j<outerSize(); ++j)
DSparseRedux.h21 for (Index j=0; j<outerSize(); ++j) in sum()
DSparseVector.h85 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);
DConservativeSparseSparseProduct.h25 Index cols = rhs.outerSize(); in conservative_sparse_sparse_product_impl()
26 eigen_assert(lhs.outerSize() == rhs.innerSize()); in conservative_sparse_sparse_product_impl()
/external/eigen/Eigen/src/Core/
DAssign.h262 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();
354 for(Index outer = 0; outer < outerSize; ++outer)
451 const Index outerSize = dst.outerSize();
456 for(Index outer = 0; outer < outerSize; ++outer)
DRedux.h180 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)
DAssign_MKL.h93 const Index outerSize = dst.outerSize();
94 for(Index outer = 0; outer < outerSize; ++outer) {
/external/eigen/unsupported/Eigen/src/Skyline/
DSkylineMatrix.h86 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 …]
DSkylineMatrixBase.h128 Index outerSize() const { in outerSize() function
/external/eigen/test/
Dmapstride.cpp72 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix()
91 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix()
105 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix()
Dsparse.h69 for(Index j=0; j<sparseMat.outerSize(); j++)
119 for(int j=0; j<sparseMat.outerSize(); j++)
Dsparse_basic.cpp107 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic()
127 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic()
150 …VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? m2.innerSize() : std::max<int>(1,m2.… in sparse_basic()
319 Index i = internal::random<Index>(0,m2.outerSize()-1); in sparse_basic()
338 for (Index j=0; j<m2.outerSize(); ++j) in sparse_basic()
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DScaling.h91 for (int k=0; k<m_matrix.outerSize(); ++k) in compute()
115 for (int k=0; k<m_matrix.outerSize(); ++k) in compute()
/external/eigen/unsupported/Eigen/src/KroneckerProduct/
DKroneckerTensorProduct.h133 for (Index kA=0; kA < m_A.outerSize(); ++kA) in evalTo()
135 for (Index kB=0; kB < m_B.outerSize(); ++kB) in evalTo()
/external/eigen/Eigen/src/IterativeLinearSolvers/
DBasicPreconditioners.h64 for(int j=0; j<mat.outerSize(); ++j) in factorize()

12