| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 31 template<int Traversal, int UnrollingIndex, typename Lhs, typename Rhs, typename RetScalar>
34 template<int StorageOrder, int UnrollingIndex, typename Lhs, typename Rhs, typename Packet, int LoadMode>
147 template<typename Lhs, typename Rhs>
148 inline CoeffBasedProduct(const Lhs& lhs, const Rhs& rhs)
149 : m_lhs(lhs), m_rhs(rhs)
153 EIGEN_STATIC_ASSERT((internal::scalar_product_traits<typename Lhs::RealScalar, typename Rhs::RealScalar>::Defined),
155 eigen_assert(lhs.cols() == rhs.rows()
200 const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::CoeffBasedProduct
224 template<typename Lhs, typename Rhs, int N, typename PlainObject
[all...] |
| TriangularMatrixVector.h | 44 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
45 typename conj_expr_if<ConjLhs,LhsMap>::type cjLhs(lhs);
73 &lhs.coeffRef(s,pi), lhsStride,
82 &lhs.coeffRef(0,size), lhsStride,
112 const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride));
113 typename conj_expr_if<ConjLhs,LhsMap>::type cjLhs(lhs);
141 &lhs.coeffRef(pi,s), lhsStride,
150 &lhs.coeffRef(diagSize,0), lhsStride,
160 template<int Mode, bool LhsIsTriangular, typename Lhs, typename Rhs>
161 struct traits<TriangularProduct<Mode,LhsIsTriangular,Lhs,false,Rhs,true>
[all...] |
| SelfadjointMatrixVector.h | 32 const Scalar* lhs, Index lhsStride,
41 const Scalar* lhs, Index lhsStride,
82 const Scalar* EIGEN_RESTRICT A0 = lhs + j*lhsStride;
83 const Scalar* EIGEN_RESTRICT A1 = lhs + (j+1)*lhsStride;
150 const Scalar* EIGEN_RESTRICT A0 = lhs + j*lhsStride;
172 template<typename Lhs, int LhsMode, typename Rhs>
173 struct traits<SelfadjointProductMatrix<Lhs,LhsMode,false,Rhs,0,true> >
174 : traits<ProductBase<SelfadjointProductMatrix<Lhs,LhsMode,false,Rhs,0,true>, Lhs, Rhs> >
178 template<typename Lhs, int LhsMode, typename Rhs
198 typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(m_lhs); local
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseDenseProduct.h | 15 template<typename Lhs, typename Rhs, int InnerSize> struct SparseDenseProductReturnType
17 typedef SparseTimeDenseProduct<Lhs,Rhs> Type;
20 template<typename Lhs, typename Rhs> struct SparseDenseProductReturnType<Lhs,Rhs,1>
23 Lhs::IsRowMajor,
24 SparseDenseOuterProduct<Rhs,Lhs,true>,
25 SparseDenseOuterProduct<Lhs,Rhs,false> >::type Type;
28 template<typename Lhs, typename Rhs, int InnerSize> struct DenseSparseProductReturnType
30 typedef DenseTimeSparseProduct<Lhs,Rhs> Type;
33 template<typename Lhs, typename Rhs> struct DenseSparseProductReturnType<Lhs,Rhs,1
108 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::SparseDenseOuterProduct
[all...] |
| SparseDiagonalProduct.h | 29 template<typename Lhs, typename Rhs>
30 struct traits<SparseDiagonalProduct<Lhs, Rhs> >
32 typedef typename remove_all<Lhs>::type _Lhs;
35 typedef typename promote_index_type<typename traits<Lhs>::Index,
53 template<typename Lhs, typename Rhs, typename SparseDiagonalProductType, int RhsMode, int LhsMode>
58 template<typename Lhs, typename Rhs>
60 : public SparseMatrixBase<SparseDiagonalProduct<Lhs,Rhs> >,
63 typedef typename Lhs::Nested LhsNested;
87 EIGEN_STRONG_INLINE SparseDiagonalProduct(const Lhs& lhs, const Rhs& rhs
96 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::SparseDiagonalProduct
[all...] |
| ConservativeSparseSparseProduct.h | 17 template<typename Lhs, typename Rhs, typename ResultType>
18 static void conservative_sparse_sparse_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res)
20 typedef typename remove_all<Lhs>::type::Scalar Scalar;
21 typedef typename remove_all<Lhs>::type::Index Index;
24 Index rows = lhs.innerSize();
26 eigen_assert(lhs.outerSize() == rhs.innerSize());
34 // of the lhs differs in average of one non zeros, thus the number of non zeros for
35 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero
36 // per column of the lhs
[all...] |
| SparseSparseProductWithPruning.h | 19 template<typename Lhs, typename Rhs, typename ResultType>
20 static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, const typename ResultType::RealScalar& tolerance)
22 // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res);
24 typedef typename remove_all<Lhs>::type::Scalar Scalar;
25 typedef typename remove_all<Lhs>::type::Index Index;
28 Index rows = lhs.innerSize();
30 //Index size = lhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
38 // of the lhs differs in average of one non zeros, thus the number of non zeros fo
[all...] |
| SparseCwiseBinaryOp.h | 40 template<typename BinaryOp, typename Lhs, typename Rhs, typename Derived,
41 typename _LhsStorageMode = typename traits<Lhs>::StorageKind,
47 template<typename BinaryOp, typename Lhs, typename Rhs>
48 class CwiseBinaryOpImpl<BinaryOp, Lhs, Rhs, Sparse>
49 : public SparseMatrixBase<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
54 typedef CwiseBinaryOp<BinaryOp, Lhs, Rhs> Derived;
58 typedef typename internal::traits<Lhs>::StorageKind LhsStorageKind;
62 || ((Lhs::Flags&RowMajorBit) == (Rhs::Flags&RowMajorBit))),
67 template<typename BinaryOp, typename Lhs, typename Rhs>
68 class CwiseBinaryOpImpl<BinaryOp,Lhs,Rhs,Sparse>::InnerIterato
[all...] |
| TriangularSolver.h | 17 template<typename Lhs, typename Rhs, int Mode,
23 int StorageOrder = int(traits<Lhs>::Flags) & RowMajorBit>
27 template<typename Lhs, typename Rhs, int Mode>
28 struct sparse_solve_triangular_selector<Lhs,Rhs,Mode,Lower,RowMajor>
31 static void run(const Lhs& lhs, Rhs& other)
35 for(int i=0; i<lhs.rows(); ++i)
40 for(typename Lhs::InnerIterator it(lhs, i); it; ++it)
61 template<typename Lhs, typename Rhs, int Mode
[all...] |
| SparseProduct.h | 15 template<typename Lhs, typename Rhs>
18 typedef typename internal::traits<Lhs>::Scalar Scalar;
19 typedef typename internal::traits<Lhs>::Index Index;
21 LhsRowMajor = internal::traits<Lhs>::Flags & RowMajorBit,
29 typename internal::nested<Lhs,Rhs::RowsAtCompileTime>::type>::type LhsNested;
33 typename internal::nested<Rhs,Lhs::RowsAtCompileTime>::type>::type RhsNested;
95 template<typename Lhs, typename Rhs>
96 EIGEN_STRONG_INLINE SparseSparseProduct(const Lhs& lhs, const Rhs& rhs)
97 : m_lhs(lhs), m_rhs(rhs), m_tolerance(0), m_conservative(true
127 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::SparseSparseProduct
[all...] |
| SparseUtil.h | 78 template<typename Lhs, typename Rhs> class SparseDiagonalProduct;
81 template<typename Lhs, typename Rhs> class SparseSparseProduct;
82 template<typename Lhs, typename Rhs> class SparseTimeDenseProduct;
83 template<typename Lhs, typename Rhs> class DenseTimeSparseProduct;
84 template<typename Lhs, typename Rhs, bool Transpose> class SparseDenseOuterProduct;
86 template<typename Lhs, typename Rhs> struct SparseSparseProductReturnType;
87 template<typename Lhs, typename Rhs,
88 int InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(internal::traits<Lhs>::ColsAtCompileTime,internal::traits<Rhs>::RowsAtCompileTime)> struct DenseSparseProductReturnType;
89 template<typename Lhs, typename Rhs,
90 int InnerSize = EIGEN_SIZE_MIN_PREFER_FIXED(internal::traits<Lhs>::ColsAtCompileTime,internal::traits<Rhs>::RowsAtCompileTime)> struct SparseDenseProductReturnType
[all...] |
| SparseSelfAdjointView.h | 29 template<typename Lhs, typename Rhs, int UpLo>
32 template<typename Lhs, typename Rhs, int UpLo>
84 /** \returns an expression of the matrix product between a sparse matrix \a lhs and a sparse self-adjoint matrix \a rhs.
91 operator*(const SparseMatrixBase<OtherDerived>& lhs, const SparseSelfAdjointView& rhs)
93 return SparseSparseProduct<OtherDerived, typename OtherDerived::PlainObject>(lhs.derived(), rhs);
107 operator*(const MatrixBase<OtherDerived>& lhs, const SparseSelfAdjointView& rhs)
109 return DenseTimeSparseSelfAdjointProduct<OtherDerived,_MatrixTypeNested,UpLo>(lhs.derived(), rhs.m_matrix);
216 template<typename Lhs, typename Rhs, int UpLo>
217 struct traits<SparseSelfAdjointTimeDenseProduct<Lhs,Rhs,UpLo> >
218 : traits<ProductBase<SparseSelfAdjointTimeDenseProduct<Lhs,Rhs,UpLo>, Lhs, Rhs>
[all...] |
| /external/eigen/Eigen/src/Core/ |
| SolveTriangular.h | 26 template<typename Lhs, typename Rhs, int Side>
41 template<typename Lhs, typename Rhs,
44 int Unrolling = trsolve_traits<Lhs,Rhs,Side>::Unrolling,
45 int RhsVectors = trsolve_traits<Lhs,Rhs,Side>::RhsVectors
49 template<typename Lhs, typename Rhs, int Side, int Mode>
50 struct triangular_solver_selector<Lhs,Rhs,Side,Mode,NoUnrolling,1>
52 typedef typename Lhs::Scalar LhsScalar;
54 typedef blas_traits<Lhs> LhsProductTraits;
57 static void run(const Lhs& lhs, Rhs& rhs
[all...] |
| CwiseBinaryOp.h | 22 * \param Lhs the type of the left-hand side
37 template<typename BinaryOp, typename Lhs, typename Rhs>
38 struct traits<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
40 // we must not inherit from traits<Lhs> since it has
42 typedef typename remove_all<Lhs>::type Ancestor;
51 // even though we require Lhs and Rhs to have the same scalar type (see CwiseBinaryOp constructor),
55 typename Lhs::Scalar,
59 typedef typename promote_storage_type<typename traits<Lhs>::StorageKind,
61 typedef typename promote_index_type<typename traits<Lhs>::Index,
63 typedef typename Lhs::Nested LhsNested
150 const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::CwiseBinaryOp
[all...] |
| NoAlias.h | 68 template<typename ProductDerived, typename Lhs, typename Rhs>
69 EIGEN_STRONG_INLINE ExpressionType& operator+=(const ProductBase<ProductDerived, Lhs,Rhs>& other)
72 template<typename ProductDerived, typename Lhs, typename Rhs>
73 EIGEN_STRONG_INLINE ExpressionType& operator-=(const ProductBase<ProductDerived, Lhs,Rhs>& other)
76 template<typename Lhs, typename Rhs, int NestingFlags>
77 EIGEN_STRONG_INLINE ExpressionType& operator+=(const CoeffBasedProduct<Lhs,Rhs,NestingFlags>& other)
78 { return m_expression.derived() += CoeffBasedProduct<Lhs,Rhs,NestByRefBit>(other.lhs(), other.rhs()); }
80 template<typename Lhs, typename Rhs, int NestingFlags>
81 EIGEN_STRONG_INLINE ExpressionType& operator-=(const CoeffBasedProduct<Lhs,Rhs,NestingFlags>& other
[all...] |
| SelfCwiseBinaryOp.h | 31 template<typename BinaryOp, typename Lhs, typename Rhs>
32 struct traits<SelfCwiseBinaryOp<BinaryOp,Lhs,Rhs> >
33 : traits<CwiseBinaryOp<BinaryOp,Lhs,Rhs> >
38 Flags = traits<CwiseBinaryOp<BinaryOp,Lhs,Rhs> >::Flags | (Lhs::Flags&DirectAccessBit) | (Lhs::Flags&LvalueBit),
39 OuterStrideAtCompileTime = Lhs::OuterStrideAtCompileTime,
40 InnerStrideAtCompileTime = Lhs::InnerStrideAtCompileTime
45 template<typename BinaryOp, typename Lhs, typename Rhs> class SelfCwiseBinaryOp
46 : public internal::dense_xpr_base< SelfCwiseBinaryOp<BinaryOp, Lhs, Rhs> >::typ
[all...] |
| ProductBase.h | 25 typedef typename remove_all<_Lhs>::type Lhs;
27 typedef typename scalar_product_traits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType Scalar;
28 typedef typename promote_storage_type<typename traits<Lhs>::StorageKind,
30 typedef typename promote_index_type<typename traits<Lhs>::Index,
33 RowsAtCompileTime = traits<Lhs>::RowsAtCompileTime,
35 MaxRowsAtCompileTime = traits<Lhs>::MaxRowsAtCompileTime,
47 typedef ProductBase<Derived, Lhs, Rhs > Base; \
62 template<typename Derived, typename Lhs, typename Rhs>
69 typedef typename Lhs::Nested LhsNested;
74 typedef typename internal::traits<Lhs>::Scalar LhsScalar
113 const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::ProductBase
[all...] |
| GeneralProduct.h | 35 template<typename Lhs, typename Rhs, int ProductType = internal::product_type<Lhs,Rhs>::value>
57 template<typename Lhs, typename Rhs> struct product_type
59 typedef typename remove_all<Lhs>::type _Lhs;
136 * \param Lhs the type of the left-hand side
141 * between two matrix expressions. In practice, using ProductReturnType<Lhs,Rhs>::Type
148 template<typename Lhs, typename Rhs, int ProductType>
152 // typedef typename internal::nested<Lhs,Rhs::ColsAtCompileTime>::type LhsNested;
153 // typedef typename internal::nested<Rhs,Lhs::RowsAtCompileTime>::type RhsNested;
155 typedef GeneralProduct<Lhs/*Nested*/, Rhs/*Nested*/, ProductType> Type
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| Lazy.h | 52 template<typename ProductDerived, typename Lhs, typename Rhs>
53 Derived& MatrixBase<Derived>::operator+=(const Flagged<ProductBase<ProductDerived, Lhs,Rhs>, 0,
62 template<typename ProductDerived, typename Lhs, typename Rhs>
63 Derived& MatrixBase<Derived>::operator-=(const Flagged<ProductBase<ProductDerived, Lhs,Rhs>, 0,
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 26 * \tparam Lhs Type of the left-hand side, a matrix expression.
29 template<typename Lhs, typename Rhs>
30 class KroneckerProduct : public ReturnByValue<KroneckerProduct<Lhs,Rhs> >
39 KroneckerProduct(const Lhs& A, const Rhs& B)
62 typename Lhs::Nested m_A;
76 * \tparam Lhs Type of the left-hand side, a matrix expression.
79 template<typename Lhs, typename Rhs>
80 class KroneckerProductSparse : public EigenBase<KroneckerProductSparse<Lhs,Rhs> >
87 KroneckerProductSparse(const Lhs& A, const Rhs& B)
106 typename Lhs::Nested m_A
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 15 template<typename Lhs, typename Rhs, int ProductMode>
17 typedef const typename internal::nested<Lhs, Rhs::RowsAtCompileTime>::type LhsNested;
18 typedef const typename internal::nested<Rhs, Lhs::RowsAtCompileTime>::type RhsNested;
75 template<typename Lhs, typename Rhs>
76 EIGEN_STRONG_INLINE SkylineProduct(const Lhs& lhs, const Rhs& rhs)
77 : m_lhs(lhs), m_rhs(rhs) {
78 eigen_assert(lhs.cols() == rhs.rows());
105 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { function in class:Eigen::internal::SkylineProduct
121 template<typename Lhs, typename Rhs, typename Dest
[all...] |
| SkylineUtil.h | 22 template<typename Lhs, typename Rhs, int ProductMode> class SkylineProduct;
71 template<typename Lhs, typename Rhs> struct skyline_product_mode;
72 template<typename Lhs, typename Rhs, int ProductMode = skyline_product_mode<Lhs,Rhs>::value> struct SkylineProductReturnType;
|
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 56 template<typename MatrixType,typename Lhs> struct homogeneous_left_product_impl;
94 template<typename Lhs> friend
95 inline const internal::homogeneous_left_product_impl<Homogeneous,Lhs>
96 operator* (const MatrixBase<Lhs>& lhs, const Homogeneous& rhs)
99 return internal::homogeneous_left_product_impl<Homogeneous,Lhs>(lhs.derived(),rhs.m_matrix);
104 operator* (const Transform<Scalar,Dim,Mode,Options>& lhs, const Homogeneous& rhs)
107 return internal::homogeneous_left_product_impl<Homogeneous,Transform<Scalar,Dim,Mode,Options> >(lhs,rhs.m_matrix);
218 template<typename MatrixType,typename Lhs>
[all...] |
| /external/eigen/bench/ |
| product_threshold.cpp | 38 template<int Mode, typename Lhs, typename Rhs, typename Res>
39 EIGEN_DONT_INLINE void prod(const Lhs& a, const Rhs& b, Res& c)
41 c.noalias() += typename ProductReturnType<Lhs,Rhs,Mode>::Type(a,b);
47 typedef Matrix<Scalar,M,K> Lhs; Lhs a; a.setRandom();
|
| /external/eigen/Eigen/src/Core/util/ |
| ForwardDeclarations.h | 89 template<typename BinaryOp, typename Lhs, typename Rhs> class CwiseBinaryOp;
90 template<typename BinOp, typename Lhs, typename Rhs> class SelfCwiseBinaryOp;
91 template<typename Derived, typename Lhs, typename Rhs> class ProductBase;
92 template<typename Lhs, typename Rhs, int Mode> class GeneralProduct;
93 template<typename Lhs, typename Rhs, int NestingFlags> class CoeffBasedProduct;
137 template<typename Lhs, typename Rhs> struct product_type;
140 template<typename Lhs, typename Rhs,
141 int ProductType = internal::product_type<Lhs,Rhs>::value>
145 template<typename Lhs, typename Rhs> struct LazyProductReturnType;
232 template<typename Lhs, typename Rhs> class Cross
[all...] |
