HomeSort by relevance Sort by last modified time
    Searched refs:InnerStride (Results 1 - 11 of 11) sorted by null

  /external/eigen/doc/snippets/
Map_inner_stride.cpp 3 cout << Map<VectorXi, 0, InnerStride<2> >
  /external/eigen/failtest/
map_nonconst_ctor_on_const_ptr_3.cpp 12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
  /external/eigen/test/
mapstaticmethods.cpp 35 PlainObjectType::Map(ptr, InnerStride<>(i)).setZero();
36 PlainObjectType::MapAligned(ptr, InnerStride<>(i)).setZero();
37 PlainObjectType::Map(const_ptr, InnerStride<>(i)).sum();
38 PlainObjectType::MapAligned(const_ptr, InnerStride<>(i)).sum();
40 PlainObjectType::Map(ptr, InnerStride<2>()).setZero();
41 PlainObjectType::MapAligned(ptr, InnerStride<3>()).setZero();
42 PlainObjectType::Map(const_ptr, InnerStride<4>()).sum();
43 PlainObjectType::MapAligned(const_ptr, InnerStride<5>()).sum();
81 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero();
82 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero()
    [all...]
mapstride.cpp 29 Map<VectorType, Alignment, InnerStride<3> > map(array, size);
39 Map<VectorType, Unaligned, InnerStride<Dynamic> > map(array, size, InnerStride<Dynamic>(2));
104 VERIFY(map.innerStride() == 2);
108 VERIFY(array[map.outerStride()*i+map.innerStride()*j] == m.coeffByOuterInner(i,j));
vectorization_logic.cpp 184 Map<Matrix22, Aligned, InnerStride<3*PacketSize> >,
  /external/eigen/Eigen/src/Core/
Stride.h 41 * \sa class InnerStride, class OuterStride, \ref TopicStorageOrders
61 Stride(Index outerStride, Index innerStride)
62 : m_outer(outerStride), m_inner(innerStride)
64 eigen_assert(innerStride>=0 && outerStride>=0);
85 class InnerStride : public Stride<0, Value>
90 InnerStride() : Base() {}
91 InnerStride(Index v) : Base(0, v) {}
  /external/eigen/blas/
common.h 93 typedef Map<Matrix<Scalar,Dynamic,1>, 0, InnerStride<Dynamic> > StridedVectorType;
104 Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> > vector(T* data, int size, int incr)
106 return Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> >(data, size, InnerStride<Dynamic>(incr));
  /external/eigen/Eigen/src/Core/products/
SelfadjointMatrixVector_MKL.h 96 Map<const SYMVVector, 0, InnerStride<> > map_x(_rhs,size,1,InnerStride<>(incx)); \
GeneralMatrixVector_MKL.h 113 Map<const GEMVVector, 0, InnerStride<> > map_x(rhs,cols,1,InnerStride<>(incx)); \
TriangularMatrixVector_MKL.h 100 Map<const VectorRhs, 0, InnerStride<> > rhs(_rhs,cols,InnerStride<>(rhsIncr)); \
185 Map<const VectorRhs, 0, InnerStride<> > rhs(_rhs,cols,InnerStride<>(rhsIncr)); \
TriangularMatrixVector.h 41 typedef Map<const Matrix<RhsScalar,Dynamic,1>, 0, InnerStride<> > RhsMap;
42 const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr));
108 typedef Map<Matrix<ResScalar,Dynamic,1>, 0, InnerStride<> > ResMap;
109 ResMap res(_res,rows,InnerStride<>(resIncr));
268 actualRhs.data(),actualRhs.innerStride(),
329 dest.data(),dest.innerStride(),

Completed in 93 milliseconds