Home
last modified time | relevance | path

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

12

/external/eigen/unsupported/Eigen/src/SparseExtra/
DDynamicSparseMatrix.h82 inline Index rows() const { return IsRowMajor ? outerSize() : m_innerSize; }
83 inline Index cols() const { return IsRowMajor ? m_innerSize : outerSize(); }
85 inline Index outerSize() const { return convert_index(m_data.size()); }
117 for (Index j=0; j<outerSize(); ++j)
125 for (Index j=0; j<outerSize(); ++j)
134 if (outerSize()>0)
136 Index reserveSizePerVector = (std::max)(reserveSize/outerSize(),Index(4));
137 for (Index j=0; j<outerSize(); ++j)
193 for (Index j=0; j<outerSize(); ++j)
201 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/Core/
DAssign_MKL.h93 …const Index outerSize = dst.outerSize(); …
94 …for(Index outer = 0; outer < outerSize; ++outer) { …
155 …const Index outerSize = dst.outerSize(); …
156 …for(Index outer = 0; outer < outerSize; ++outer) { …
DAssignEvaluator.h324 for(Index outer = 0; outer < kernel.outerSize(); ++outer) {
349 const Index outerSize = kernel.outerSize();
350 for(Index outer = 0; outer < outerSize; ++outer)
454 const Index outerSize = kernel.outerSize();
456 for(Index outer = 0; outer < outerSize; ++outer)
479 const Index outerSize = kernel.outerSize();
480 for(Index outer = 0; outer < outerSize; ++outer)
538 const Index outerSize = kernel.outerSize();
542 for(Index outer = 0; outer < outerSize; ++outer)
575 for(Index outer = 0; outer < kernel.outerSize(); ++outer)
[all …]
DRedux.h197 for(Index i = 1; i < mat.outerSize(); ++i)
278 const Index outerSize = mat.outerSize();
287 for(Index j=0; j<outerSize; ++j)
292 for(Index j=0; j<outerSize; ++j)
361 EIGEN_DEVICE_FUNC Index outerSize() const { return m_xpr.outerSize(); }
/external/eigen/Eigen/src/SparseCore/
DSparsePermutation.h44 Matrix<StorageIndex,Dynamic,1> sizes(mat.outerSize());
45 for(Index j=0; j<mat.outerSize(); ++j)
51 for(Index j=0; j<mat.outerSize(); ++j)
64 Matrix<StorageIndex,Dynamic,1> sizes(tmp.outerSize());
72 for(Index j=0; j<mat.outerSize(); ++j)
76 for(Index j=0; j<mat.outerSize(); ++j)
DSparseMatrix.h143 inline Index outerSize() const { return m_outerSize; }
623 const Index outerSize = IsRowMajor ? rows : cols;
626 if (m_outerSize != outerSize || m_outerSize==0)
629 … m_outerIndex = static_cast<StorageIndex*>(std::malloc((outerSize + 1) * sizeof(StorageIndex)));
632 m_outerSize = outerSize;
799 for (Index i=0; i<m.outerSize(); ++i)
815 for (Index i=0; i<m.outerSize(); ++i) {
822 for (Index i=0; i<m.outerSize(); ++i) {
930 typename SparseMatrixType::IndexVector wi(trMat.outerSize());
1025 for(Index j=0; j<outerSize(); ++j)
[all …]
DSparseBlock.h129 eigen_internal_assert(tmp.outerSize()==m_outerSize.value());
136 Index tail_size = m_matrix.outerIndexPtr()[m_matrix.outerSize()] - end;
159 newdata.resize(m_matrix.outerIndexPtr()[m_matrix.outerSize()] - block_size + nnz);
205 for(Index k = m_outerStart + m_outerSize.value(); k<=matrix.outerSize(); ++k)
348 SparseMatrixBase<Derived>::innerVectors(Index outerStart, Index outerSize) in innerVectors() argument
352 … IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize); in innerVectors()
361 SparseMatrixBase<Derived>::innerVectors(Index outerStart, Index outerSize) const in innerVectors() argument
365 … IsRowMajor ? outerSize : rows(), IsRowMajor ? cols() : outerSize); in innerVectors()
DSparseCompressedBase.h50 …os() { return Eigen::Map<IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
51 … return Eigen::Map<const IndexVector>(innerNonZeroPtr(), isCompressed()?0:derived().outerSize()); }
61 return outerIndexPtr()[derived().outerSize()]-outerIndexPtr()[0];
62 else if(derived().outerSize()==0)
DSparseMatrixBase.h184 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); } in outerSize() function
222 for (Index row=0; row<nm.outerSize(); ++row)
362 InnerVectorsReturnType innerVectors(Index outerStart, Index outerSize);
363 const ConstInnerVectorsReturnType innerVectors(Index outerStart, Index outerSize) const;
DSparseVector.h84 EIGEN_STRONG_INLINE Index outerSize() const { return 1; }
296 eigen_assert(other.outerSize()==1);
454 eigen_internal_assert(src.outerSize()==src.size());
469 if(src.outerSize()==1) sparse_vector_assign_selector<Dest,Src,SVA_Inner>::run(dst, src);
DSparseCwiseUnaryOp.h128 for (Index j=0; j<outerSize(); ++j)
140 for (Index j=0; j<outerSize(); ++j)
DConservativeSparseSparseProduct.h24 Index cols = rhs.outerSize();
25 eigen_assert(lhs.outerSize() == rhs.innerSize());
267 Index cols = rhs.outerSize();
268 eigen_assert(lhs.outerSize() == rhs.innerSize());
DSparseDenseProduct.h38 Index n = lhs.outerSize();
97 for(Index j=0; j<lhs.outerSize(); ++j)
118 for(Index j=0; j<lhs.outerSize(); ++j)
137 for(Index j=0; j<lhs.outerSize(); ++j)
DSparseView.h62 inline Index outerSize() const { return m_matrix.outerSize(); }
DSparseRedux.h22 for (Index j=0; j<outerSize(); ++j) in sum()
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()
/external/eigen/test/
Dmapstride.cpp79 if(k==1 && (m.innerSize()+1)*m.outerSize() > maxsize2) in map_class_matrix()
86 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix()
101 if(k==1 && (m.innerSize()+4)*m.outerSize() > maxsize2) in map_class_matrix()
113 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix()
127 if(k==1 && (2*m.innerSize()+1)*(m.outerSize()*2) > maxsize2) in map_class_matrix()
135 for(int i = 0; i < m.outerSize(); ++i) in map_class_matrix()
Dsparse_basic.cpp77 m2.reserve(VectorXi::Constant(m2.outerSize(), int(nnz))); in sparse_basic()
79 m2.reserve(m2.outerSize() * nnz); in sparse_basic()
107 m2.reserve(VectorXi::Constant(m2.outerSize(), 2)); in sparse_basic()
130 …VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? int(m2.innerSize()) : std::max<int>(… in sparse_basic()
252 for(Index j = 0; j<m1.outerSize(); ++j) in sparse_basic()
283 for(Index j = 0; j<m2.outerSize(); ++j) in sparse_basic()
326 m2.reserve(VectorXi::Constant(m2.outerSize(), int(m2.innerSize()))); in sparse_basic()
598 static_array[1] = IteratorType(m2,m2.outerSize()-1); in sparse_basic()
613 iters[1] = IteratorType(m2,m2.outerSize()-1); in sparse_basic()
Dsparse.h69 for(Index j=0; j<sparseMat.outerSize(); j++)
122 for(int j=0; j<sparseMat.outerSize(); j++)
/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 …]
/external/eigen/Eigen/src/IterativeLinearSolvers/
DBasicPreconditioners.h68 for(int j=0; j<mat.outerSize(); ++j) in factorize()
158 for(Index j=0; j<mat.outerSize(); ++j) in factorize()
169 for(Index j=0; j<mat.outerSize(); ++j) in factorize()
/external/eigen/unsupported/Eigen/src/KroneckerProduct/
DKroneckerTensorProduct.h169 for (Index kA=0; kA < m_A.outerSize(); ++kA) in evalTo()
174 for (Index kB=0; kB < m_B.outerSize(); ++kB) in evalTo()
182 for (Index kA=0; kA < m_A.outerSize(); ++kA) in evalTo()
184 for (Index kB=0; kB < m_B.outerSize(); ++kB) in evalTo()
/external/eigen/unsupported/Eigen/src/IterativeSolvers/
DScaling.h93 for (int k=0; k<m_matrix.outerSize(); ++k) in compute()
117 for (int k=0; k<m_matrix.outerSize(); ++k) in compute()

12