| /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 | 41 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize)
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()) );
|
| 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/ |
| SparsePermutation.h | 60 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)
|
| SparseBlock.h | 67 inline SparseInnerVectorSet(const MatrixType& matrix, Index outerStart, Index outerSize)
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)
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()) );
[all...] |
| SparseView.h | 48 inline Index outerSize() const { return m_matrix.outerSize(); }
|
| SparseSparseProductWithPruning.h | 27 // 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());
|
| SparseMatrixBase.h | 163 Index outerSize() const { return (int(Flags)&RowMajorBit) ? this->rows() : this->cols(); }
202 const Index outerSize = (int(OtherDerived::Flags) & RowMajorBit) ? other.rows() : other.cols();
209 for (Index j=0; j<outerSize; ++j)
237 const Index outerSize = other.outerSize();
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(); ++j
[all...] |
| SparseRedux.h | 21 for (Index j=0; j<outerSize(); ++j)
|
| SparseMatrix.h | 126 inline Index outerSize() const { return m_outerSize; }
220 reserve(VectorXi::Constant(outerSize(), 2));
514 const Index outerSize = IsRowMajor ? rows : cols;
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(); ++j
[all...] |
| 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());
|
| SparseDenseProduct.h | 157 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)
|
| SparseCwiseUnaryOp.h | 145 for (Index j=0; j<outerSize(); ++j)
155 for (Index j=0; j<outerSize(); ++j)
|
| /external/eigen/bench/ |
| benchVecAdd.cpp | 49 int outersize = size2/innersize; local
50 MatrixXf ma = Map<MatrixXf>(a, innersize, outersize );
51 MatrixXf mb = Map<MatrixXf>(b, innersize, outersize );
52 MatrixXf mc = Map<MatrixXf>(c, innersize, outersize );
60 std::cout << innersize << " x " << outersize << " " << timer.value() << "s " << (double(size2*REPEAT)/timer.value())/(1024.*1024.*1024.) << " GFlops\n";
|
| /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...] |
| /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(int j=0; j<sparseMat.outerSize(); j++)
119 for(int j=0; j<sparseMat.outerSize(); j++)
|
| sparse_basic.cpp | 99 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/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/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 58 for (int kA=0; kA<A.outerSize(); ++kA)
60 for (int kB=0; kB<B.outerSize(); ++kB)
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 64 for(int j=0; j<mat.outerSize(); ++j)
|
| /external/eigen/doc/ |
| I16_TemplateKeyword.dox | 103 for (int k=0; k<mat.outerSize(); ++k)
116 for (int k=0; k<m1.outerSize(); ++k)
|
