| /external/eigen/test/ |
| mapstride.cpp | 69 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1));
71 VERIFY(map.outerStride() == map.innerSize()+1);
73 for(int j = 0; j < m.innerSize(); ++j)
84 InnerSize = MatrixType::InnerSizeAtCompileTime,
85 OuterStrideAtCompileTime = InnerSize==Dynamic ? Dynamic : InnerSize+4
88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4));
90 VERIFY(map.outerStride() == map.innerSize()+4);
92 for(int j = 0; j < m.innerSize(); ++j)
101 Map<MatrixType, Alignment, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2))
[all...] |
| sparse.h | 72 for(Index i=0; i<sparseMat.innerSize(); i++)
122 for(int i=0; i<sparseMat.innerSize(); i++)
|
| sparse_basic.cpp | 182 VectorXi r(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? m2.innerSize() : std::max<int>(1,m2.innerSize()/8)));
382 for (Index i=0; i<m2.innerSize(); ++i)
|
| /external/eigen/Eigen/src/Core/ |
| CoreIterators.h | 35 : m_expression(expr), m_inner(0), m_outer(outer), m_end(expr.innerSize())
|
| Redux.h | 178 for(Index i = 1; i < mat.innerSize(); ++i)
181 for(Index j = 0; j < mat.innerSize(); ++j)
260 const Index innerSize = mat.innerSize();
265 const Index packetedInnerSize = ((innerSize)/packetSize)*packetSize;
276 for(Index i=packetedInnerSize; i<innerSize; ++i)
|
| Assign.h | 36 InnerSize = int(Derived::IsVectorAtCompileTime) ? int(Derived::SizeAtCompileTime)
50 MayInnerVectorize = MightVectorize && int(InnerSize)!=Dynamic && int(InnerSize)%int(PacketSize)==0
60 indicated by InnerMaxSize rather than InnerSize, think of the case of a dynamic block
82 MayUnrollInner = int(InnerSize) != Dynamic
84 && int(InnerSize) * int(OtherDerived::CoeffReadCost) <= int(UnrollingLimit)
108 EIGEN_DEBUG_VAR(InnerSize)
261 const Index innerSize = dst.innerSize();
264 for(Index inner = 0; inner < innerSize; ++inner
[all...] |
| Assign_MKL.h | 52 InnerSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::SizeAtCompileTime)
92 const Index innerSize = dst.innerSize();
98 vml_call<UnaryOp>::run(src.functor(), innerSize, src_ptr, dst_ptr );
|
| Array.h | 225 inline Index outerStride() const { return this->innerSize(); }
|
| Matrix.h | 322 inline Index outerStride() const { return this->innerSize(); }
|
| DenseBase.h | 207 Index innerSize() const
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseView.h | 47 inline Index innerSize() const { return m_matrix.innerSize(); }
|
| SparseSparseProductWithPruning.h | 27 // make sure to call innerSize/outerSize since we fake the storage order.
28 Index rows = lhs.innerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
|
| ConservativeSparseSparseProduct.h | 23 // make sure to call innerSize/outerSize since we fake the storage order.
24 Index rows = lhs.innerSize();
26 eigen_assert(lhs.outerSize() == rhs.innerSize());
|
| SparseVector.h | 84 EIGEN_STRONG_INLINE Index innerSize() const { return m_size; }
416 eigen_internal_assert(src.innerSize()==src.size());
|
| MappedSparseMatrix.h | 51 inline Index innerSize() const { return m_innerSize; }
|
| SparseMatrixBase.h | 169 Index innerSize() const { return (int(Flags)&RowMajorBit) ? this->cols() : this->rows(); }
|
| SparseMatrix.h | 124 inline Index innerSize() const { return m_innerSize; }
[all...] |
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| RandomSetter.h | 184 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize();
185 const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize();
191 Index aux = innerSize - 1;
|
| DynamicSparseMatrix.h | 82 inline Index innerSize() const { return m_innerSize; }
211 const Index innerSize = IsRowMajor ? cols : rows;
212 if (m_innerSize>innerSize)
214 // remove all coefficients with innerCoord>=innerSize
229 eigen_assert(innerSize()==0 && outerSize()==0);
|
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineMatrix.h | 82 inline Index innerSize() const {
151 eigen_assert(inner < innerSize());
200 eigen_assert(inner < innerSize());
236 eigen_assert(idx < innerSize());
245 eigen_assert(inner < innerSize());
269 eigen_assert(inner < innerSize());
289 eigen_assert(idx < innerSize());
298 eigen_assert(inner < innerSize());
317 eigen_assert(inner < innerSize());
334 eigen_assert(inner < innerSize());
[all...] |
| SkylineMatrixBase.h | 134 Index innerSize() const {
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_basic.cpp | 281 for (int i=0; i<m2.innerSize(); ++i)
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.ui.workbench_3.6.1.M20101117-0800.jar | |
| /prebuilts/tools/common/eclipse/ |
| org.eclipse.ui.workbench_3.6.2.M20110210-1200.jar | |
