/external/eigen/test/ |
D | mapstride.cpp | 69 …e, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1)); in map_class_matrix() 71 VERIFY(map.outerStride() == map.innerSize()+1); in map_class_matrix() 73 for(int j = 0; j < m.innerSize(); ++j) in map_class_matrix() 88 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4)); in map_class_matrix() 90 VERIFY(map.outerStride() == map.innerSize()+4); in map_class_matrix() 92 for(int j = 0; j < m.innerSize(); ++j) in map_class_matrix() 101 …t, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2)); in map_class_matrix() 103 VERIFY(map.outerStride() == 2*map.innerSize()+1); in map_class_matrix() 106 for(int j = 0; j < m.innerSize(); ++j) in map_class_matrix()
|
D | sparse.h | 72 for(Index i=0; i<sparseMat.innerSize(); i++) 122 for(int i=0; i<sparseMat.innerSize(); i++)
|
D | sparse_basic.cpp | 150 …(VectorXi::Constant(m2.outerSize(), ((mode%2)==0) ? m2.innerSize() : std::max<int>(1,m2.innerSize(… in sparse_basic() 341 for (Index i=0; i<m2.innerSize(); ++i) in sparse_basic()
|
/external/chromium_org/third_party/WebKit/Source/web/ |
D | ViewportAnchor.cpp | 151 void ViewportAnchor::computeOrigins(const ScrollView& scrollView, const FloatSize& innerSize, in computeOrigins() argument 160 FloatPoint innerOrigin = getInnerOrigin(innerSize); in computeOrigins() 164 FloatRect innerRect = FloatRect(innerOrigin, innerSize); in computeOrigins() 176 FloatPoint ViewportAnchor::getInnerOrigin(const FloatSize& innerSize) const in getInnerOrigin() 191 FloatSize anchorOffsetFromOrigin = innerSize; in getInnerOrigin()
|
D | ViewportAnchor.h | 62 void computeOrigins(const ScrollView&, const FloatSize& innerSize, 66 FloatPoint getInnerOrigin(const FloatSize& innerSize) const;
|
/external/eigen/Eigen/src/Core/ |
D | Assign.h | 261 const Index innerSize = dst.innerSize(); 264 for(Index inner = 0; inner < innerSize; ++inner) 328 const Index innerSize = dst.innerSize(); 332 for(Index inner = 0; inner < innerSize; inner+=packetSize) 450 const Index innerSize = dst.innerSize(); 454 : internal::first_aligned(&dst.coeffRef(0,0), innerSize); 458 const Index alignedEnd = alignedStart + ((innerSize-alignedStart) & ~packetAlignedMask); 468 for(Index inner = alignedEnd; inner<innerSize ; ++inner) 471 alignedStart = std::min<Index>((alignedStart+alignedStep)%packetSize, innerSize);
|
D | 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)
|
D | Assign_MKL.h | 92 const Index innerSize = dst.innerSize(); 98 vml_call<UnaryOp>::run(src.functor(), innerSize, src_ptr, dst_ptr );
|
D | CoreIterators.h | 35 : m_expression(expr), m_inner(0), m_outer(outer), m_end(expr.innerSize()) in InnerIterator()
|
D | Array.h | 225 inline Index outerStride() const { return this->innerSize(); }
|
D | Matrix.h | 322 inline Index outerStride() const { return this->innerSize(); }
|
D | DenseBase.h | 207 Index innerSize() const in innerSize() function
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
D | 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 …]
|
D | SkylineMatrixBase.h | 134 Index innerSize() const { in innerSize() function
|
/external/eigen/unsupported/Eigen/src/SparseExtra/ |
D | RandomSetter.h | 184 const Index outerSize = SwapStorage ? target.innerSize() : target.outerSize(); in RandomSetter() 185 const Index innerSize = SwapStorage ? target.outerSize() : target.innerSize(); in RandomSetter() local 191 Index aux = innerSize - 1; in RandomSetter()
|
D | DynamicSparseMatrix.h | 82 inline Index innerSize() const { return m_innerSize; } 211 const Index innerSize = IsRowMajor ? cols : rows; 212 if (m_innerSize>innerSize) 229 eigen_assert(innerSize()==0 && outerSize()==0);
|
/external/eigen/Eigen/src/SparseCore/ |
D | SparseView.h | 47 inline Index innerSize() const { return m_matrix.innerSize(); }
|
D | SparseSparseProductWithPruning.h | 28 Index rows = lhs.innerSize(); in sparse_sparse_product_with_pruning_impl() 31 eigen_assert(lhs.outerSize() == rhs.innerSize()); in sparse_sparse_product_with_pruning_impl()
|
D | ConservativeSparseSparseProduct.h | 24 Index rows = lhs.innerSize(); in conservative_sparse_sparse_product_impl() 26 eigen_assert(lhs.outerSize() == rhs.innerSize()); in conservative_sparse_sparse_product_impl()
|
D | SparseVector.h | 84 EIGEN_STRONG_INLINE Index innerSize() const { return m_size; } 416 eigen_internal_assert(src.innerSize()==src.size());
|
D | MappedSparseMatrix.h | 51 inline Index innerSize() const { return m_innerSize; }
|
D | SparseMatrixBase.h | 169 Index innerSize() const { return (int(Flags)&RowMajorBit) ? this->cols() : this->rows(); } in innerSize() function
|
D | SparseMatrix.h | 124 inline Index innerSize() const { return m_innerSize; } 1022 Matrix<Index,Dynamic,1> wi(innerSize());
|
/external/eigen/test/eigen2/ |
D | eigen2_sparse_basic.cpp | 281 for (int i=0; i<m2.innerSize(); ++i) in sparse_basic()
|
/external/eigen/doc/ |
D | SparseQuickReference.dox | 92 sm1.innerSize(); // Number of rows (resp. columns) for a row major (resp. column major)
|