Home
last modified time | relevance | path

Searched refs:innerSize (Results 1 – 25 of 28) sorted by relevance

12

/external/eigen/test/
Dmapstride.cpp79 if(k==1 && (m.innerSize()+1)*m.outerSize() > maxsize2) in map_class_matrix()
83 …e, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1)); in map_class_matrix()
85 VERIFY(map.outerStride() == map.innerSize()+1); in map_class_matrix()
87 for(int j = 0; j < m.innerSize(); ++j) in map_class_matrix()
101 if(k==1 && (m.innerSize()+4)*m.outerSize() > maxsize2) in map_class_matrix()
110 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4)); in map_class_matrix()
112 VERIFY(map.outerStride() == map.innerSize()+4); in map_class_matrix()
114 for(int j = 0; j < m.innerSize(); ++j) in map_class_matrix()
127 if(k==1 && (2*m.innerSize()+1)*(m.outerSize()*2) > maxsize2) in map_class_matrix()
131 …t, Stride<Dynamic,Dynamic> > map(array, rows, cols, Stride<Dynamic,Dynamic>(2*m.innerSize()+1, 2)); in map_class_matrix()
[all …]
Dsparse.h72 for(Index i=0; i<sparseMat.innerSize(); i++)
125 for(int i=0; i<sparseMat.innerSize(); i++)
Dsparse_basic.cpp130 …rXi::Constant(m2.outerSize(), ((mode%2)==0) ? int(m2.innerSize()) : std::max<int>(1,int(m2.innerSi… in sparse_basic()
279 std::vector<Scalar> ref_value(m2.innerSize()); in sparse_basic()
280 std::vector<Index> ref_index(m2.innerSize()); in sparse_basic()
326 m2.reserve(VectorXi::Constant(m2.outerSize(), int(m2.innerSize()))); in sparse_basic()
Dsparse_block.cpp30 const Index inner = ref.innerSize(); in sparse_block()
/external/eigen/Eigen/src/Core/
DCoreIterators.h42 : m_eval(xpr), m_iter(m_eval, outerId, xpr.innerSize()) in InnerIterator()
82 …NE inner_iterator_selector(const EvaluatorType &eval, const Index &outerId, const Index &innerSize) in inner_iterator_selector() argument
83 : m_eval(eval), m_inner(0), m_outer(outerId), m_end(innerSize) in inner_iterator_selector()
DRedux.h195 for(Index i = 1; i < mat.innerSize(); ++i)
198 for(Index j = 0; j < mat.innerSize(); ++j)
277 const Index innerSize = mat.innerSize();
282 const Index packetedInnerSize = ((innerSize)/packetSize)*packetSize;
293 for(Index i=packetedInnerSize; i<innerSize; ++i)
360 EIGEN_DEVICE_FUNC Index innerSize() const { return m_xpr.innerSize(); }
DAssignEvaluator.h325 for(Index inner = 0; inner < kernel.innerSize(); ++inner) {
453 const Index innerSize = kernel.innerSize();
457 for(Index inner = 0; inner < innerSize; inner+=packetSize)
537 const Index innerSize = kernel.innerSize();
540 …able) || bool(dstIsAligned)) ? 0 : internal::first_aligned<requestedAlignment>(dst_ptr, innerSize);
544 const Index alignedEnd = alignedStart + ((innerSize-alignedStart) & ~packetAlignedMask);
554 for(Index inner = alignedEnd; inner<innerSize ; ++inner)
557 alignedStart = numext::mini((alignedStart+alignedStep)%packetSize, innerSize);
619 EIGEN_DEVICE_FUNC Index innerSize() const { return m_dstExpr.innerSize(); }
DAssign_MKL.h98 …VMLOP( dst.innerSize(), (const VMLTYPE*)src_ptr, …
160 …VMLOP( dst.innerSize(), (const VMLTYPE*)src_ptr, exponent, …
DArray.h248 EIGEN_DEVICE_FUNC inline Index outerStride() const { return this->innerSize(); }
DMatrix.h383 EIGEN_DEVICE_FUNC inline Index outerStride() const { return this->innerSize(); }
DDenseBase.h230 Index innerSize() const in innerSize() function
/external/eigen/unsupported/Eigen/src/Skyline/
DSkylineMatrix.h82 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 …]
DSkylineMatrixBase.h134 Index innerSize() const { in innerSize() function
/external/eigen/unsupported/Eigen/src/SparseExtra/
DRandomSetter.h184 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()
DDynamicSparseMatrix.h84 inline Index innerSize() const { return m_innerSize; }
213 const Index innerSize = IsRowMajor ? cols : rows;
214 if (m_innerSize>innerSize)
231 eigen_assert(innerSize()==0 && outerSize()==0);
DBlockSparseMatrix.h741 return (IsColMajor ? innerSize() : outerSize());
750 return (IsColMajor ? outerSize() : innerSize());
753 inline Index innerSize() const
793 eigen_assert(inner < innerSize() && "OUTER INDEX OUT OF BOUNDS");
/external/eigen/Eigen/src/SparseCore/
DSparseView.h61 inline Index innerSize() const { return m_matrix.innerSize(); }
153 : m_sve(sve), m_inner(0), m_outer(outer), m_end(sve.m_view.innerSize())
DConservativeSparseSparseProduct.h23 Index rows = lhs.innerSize();
25 eigen_assert(lhs.outerSize() == rhs.innerSize());
268 eigen_assert(lhs.outerSize() == rhs.innerSize());
DSparseSparseProductWithPruning.h28 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()
DSparseVector.h83 EIGEN_STRONG_INLINE Index innerSize() const { return m_size; }
443 eigen_internal_assert(src.innerSize()==src.size());
DSparseTriangularView.h106 …rEval.m_argImpl,outer), m_returnOne(false), m_containsDiag(Base::outer()<xprEval.m_arg.innerSize())
DSparseMap.h83 inline Index innerSize() const { return m_innerSize; }
DSparseCwiseBinaryOp.h170 …ter), m_functor(aEval.m_functor), m_value(0), m_id(-1), m_innerSize(aEval.m_expr.rhs().innerSize())
258 …mpl), m_functor(aEval.m_functor), m_value(0), m_id(-1), m_innerSize(aEval.m_expr.lhs().innerSize())
DSparseMatrixBase.h187 Index innerSize() const { return (int(Flags)&RowMajorBit) ? this->cols() : this->rows(); } in innerSize() function
DSparseMatrix.h141 inline Index innerSize() const { return m_innerSize; }
1021 IndexVector wi(innerSize());

12