HomeSort by relevance Sort by last modified time
    Searched refs:outerStride (Results 1 - 25 of 53) sorted by null

1 2 3

  /external/eigen/doc/snippets/
Tutorial_SlicingCol.cpp 3 Map<MatrixXf,0,OuterStride<> > M2(M1.data(), M1.rows(), (M1.cols()+2)/3, OuterStride<>(M1.outerStride()*3));
10 Stride<Dynamic,3>(M3.outerStride(),3));
  /external/eigen/Eigen/src/Core/
Stride.h 41 * \sa class InnerStride, class OuterStride, \ref TopicStorageOrders
63 Stride(Index outerStride, Index innerStride)
64 : m_outer(outerStride), m_inner(innerStride)
66 eigen_assert(innerStride>=0 && outerStride>=0);
101 class OuterStride : public Stride<Value, 0>
105 EIGEN_DEVICE_FUNC OuterStride() : Base() {}
106 EIGEN_DEVICE_FUNC OuterStride(Index v) : Base(v,0) {} // FIXME making this explicit could break valid code
ArrayWrapper.h 68 inline Index outerStride() const { return m_expression.outerStride(); }
166 inline Index outerStride() const { return m_expression.outerStride(); }
DenseCoeffsBase.h 283 void outerStride();
493 * \sa outerStride(), rowStride(), colStride()
507 inline Index outerStride() const
509 return derived().outerStride();
515 return Derived::IsVectorAtCompileTime ? innerStride() : outerStride();
520 * \sa innerStride(), outerStride(), colStride()
525 return Derived::IsRowMajor ? outerStride() : innerStride();
530 * \sa innerStride(), outerStride(), rowStride()
535 return Derived::IsRowMajor ? innerStride() : outerStride();
567 * \sa outerStride(), rowStride(), colStride(
    [all...]
NestByValue.h 46 EIGEN_DEVICE_FUNC inline Index outerStride() const { return m_expression.outerStride(); }
ForceAlignedAccess.h 46 EIGEN_DEVICE_FUNC inline Index outerStride() const { return m_expression.outerStride(); }
CwiseUnaryView.h 120 EIGEN_DEVICE_FUNC inline Index outerStride() const
122 return derived().nestedExpression().outerStride() * sizeof(typename internal::traits<MatrixType>::Scalar) / sizeof(Scalar);
Map.h 70 * Here, we're specifying the outer stride as a runtime parameter. Note that here \c OuterStride<> is
71 * a short version of \c OuterStride<Dynamic> because the default template parameter of OuterStride
108 inline Index outerStride() const
Block.h 294 EIGEN_DEVICE_FUNC inline Index outerStride() const;
348 || ((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && ( XprTypeIsRowMajor)) ? xpr.innerStride() : xpr.outerStride()),
362 : Base(xpr.data()+xpr.innerStride()*(XprTypeIsRowMajor?startCol:startRow) + xpr.outerStride()*(XprTypeIsRowMajor?startRow:startCol)),
374 : Base(xpr.data()+xpr.innerStride()*(XprTypeIsRowMajor?startCol:startRow) + xpr.outerStride()*(XprTypeIsRowMajor?startRow:startCol), blockRows, blockCols),
395 : m_xpr.outerStride();
398 /** \sa MapBase::outerStride() */
400 inline Index outerStride() const
438 ? m_xpr.outerStride()
SolveTriangular.h 73 ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs);
102 ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.outerStride(), blocking);
  /external/eigen/Eigen/src/QR/
HouseholderQR_LAPACKE.h 52 lapack_int lda = (lapack_int) mat.outerStride(); \
ColPivHouseholderQR_LAPACKE.h 66 lapack_int lda = internal::convert_index<lapack_int,Index>(m_qr.outerStride()); \
  /external/eigen/Eigen/src/Eigenvalues/
RealSchur_LAPACKE.h 53 lapack_int ldvs = internal::convert_index<lapack_int>(m_matU.outerStride()); \
55 lapack_int lda = internal::convert_index<lapack_int>(m_matT.outerStride()); \
ComplexSchur_LAPACKE.h 67 lapack_int ldvs = internal::convert_index<lapack_int>(m_matU.outerStride()); \
69 lapack_int lda = internal::convert_index<lapack_int>(m_matT.outerStride()); \
SelfAdjointEigenSolver_LAPACKE.h 65 lda = internal::convert_index<lapack_int>(m_eivec.outerStride()); \
  /external/eigen/test/
mapstride.cpp 83 Map<MatrixType, Alignment, OuterStride<Dynamic> > map(array, rows, cols, OuterStride<Dynamic>(m.innerSize()+1));
85 VERIFY(map.outerStride() == map.innerSize()+1);
89 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j));
109 Map<MatrixType, Alignment, OuterStride<OuterStrideAtCompileTime> >
110 map(array, rows, cols, OuterStride<OuterStrideAtCompileTime>(m.innerSize()+4));
112 VERIFY(map.outerStride() == map.innerSize()+4);
116 VERIFY(array[map.outerStride()*i+j] == m.coeffByOuterInner(i,j));
133 VERIFY(map.outerStride() == 2*map.innerSize()+1);
138 VERIFY(array[map.outerStride()*i+map.innerStride()*j] == m.coeffByOuterInner(i,j))
    [all...]
  /external/eigen/Eigen/src/Core/products/
GeneralMatrixMatrix_BLAS.h 90 Map<const MatrixX##EIGPREFIX, 0, OuterStride<> > lhs(_lhs,m,k,OuterStride<>(lhsStride)); \
93 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
97 Map<const MatrixX##EIGPREFIX, 0, OuterStride<> > rhs(_rhs,k,n,OuterStride<>(rhsStride)); \
100 ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
SelfadjointProduct.h 78 ::run(other.size(), mat.data(), mat.outerStride(), actualOtherPtr, actualOtherPtr, actualAlpha);
114 &actualOther.coeffRef(0,0), actualOther.outerStride(), &actualOther.coeffRef(0,0), actualOther.outerStride(),
115 mat.data(), mat.outerStride(), actualAlpha, blocking);
SelfadjointMatrixMatrix_BLAS.h 78 Map<const MatrixX##EIGPREFIX, 0, OuterStride<> > rhs(_rhs,n,m,OuterStride<>(rhsStride)); \
81 ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
122 Map<const Matrix<EIGTYPE, Dynamic, Dynamic, LhsStorageOrder>, 0, OuterStride<> > lhs(_lhs,m,m,OuterStride<>(lhsStride)); \
125 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
133 Map<const MatrixX##EIGPREFIX, 0, OuterStride<> > rhs(_rhs,m,n,OuterStride<>(rhsStride)); \
137 Map<const MatrixX##EIGPREFIX, 0, OuterStride<> > rhs(_rhs,n,m,OuterStride<>(rhsStride));
    [all...]
TriangularMatrixMatrix_BLAS.h 123 Map<const MatrixLhs, 0, OuterStride<> > lhsMap(_lhs,rows,depth,OuterStride<>(lhsStride)); \
125 BlasIndex aStride = convert_index<BlasIndex>(aa_tmp.outerStride()); \
147 Map<const MatrixRhs, 0, OuterStride<> > rhs(_rhs,depth,cols,OuterStride<>(rhsStride)); \
152 ldb = convert_index<BlasIndex>(b_tmp.outerStride()); \
158 Map<const MatrixLhs, 0, OuterStride<> > lhs(_lhs,rows,depth,OuterStride<>(lhsStride)); \
168 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
178 Map<MatrixX##EIGPREFIX, 0, OuterStride<> > res_tmp(res,rows,cols,OuterStride<>(resStride));
    [all...]
TriangularSolverMatrix_BLAS.h 70 Map<const MatrixTri, 0, OuterStride<> > tri(_tri,size,size,OuterStride<>(triStride)); \
76 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
123 Map<const MatrixTri, 0, OuterStride<> > tri(_tri,size,size,OuterStride<>(triStride)); \
129 lda = convert_index<BlasIndex>(a_tmp.outerStride()); \
  /external/eigen/Eigen/src/SVD/
JacobiSVD_LAPACKE.h 53 lapack_int lda = internal::convert_index<lapack_int>(matrix.outerStride()), ldu, ldvt; \
60 ldu = internal::convert_index<lapack_int>(m_matrixU.outerStride()); \
  /external/eigen/Eigen/src/Cholesky/
LLT_LAPACKE.h 57 lda = convert_index<lapack_int>(m.outerStride()); \
  /external/eigen/Eigen/src/SparseLU/
SparseLU_kernel_bmod.h 58 Map<Matrix<Scalar,SegSizeAtCompileTime,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) );
67 Map<Matrix<Scalar,Dynamic,SegSizeAtCompileTime, ColMajor>, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) );
70 Map<Matrix<Scalar,Dynamic,1>, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) );
73 internal::sparselu_gemm<Scalar>(l.rows(), l.cols(), B.cols(), B.data(), B.outerStride(), u.data(), u.outerStride(), l.data(), l.outerStride());
SparseLU_panel_bmod.h 105 Map<ScalarMatrix, Aligned, OuterStride<> > U(tempv.data(), u_rows, u_cols, OuterStride<>(ldu));
139 MappedMatrixBlock A(glu.lusup.data()+luptr, u_rows, u_rows, OuterStride<>(lda) );
144 MappedMatrixBlock B(glu.lusup.data()+luptr, nrow, u_rows, OuterStride<>(lda) );
149 MappedMatrixBlock L(tempv.data()+w*ldu+offset, nrow, u_cols, OuterStride<>(ldl));
152 internal::sparselu_gemm<Scalar>(L.rows(), L.cols(), B.cols(), B.data(), B.outerStride(), U.data(), U.outerStride(), L.data(), L.outerStride());

Completed in 303 milliseconds

1 2 3