| /external/eigen/Eigen/src/Core/ |
| Transpose.h | 34 typedef typename MatrixType::Scalar Scalar;
113 Scalar,
114 const Scalar
118 inline const Scalar* data() const { return derived().nestedExpression().data(); }
132 inline const Scalar& coeffRef(Index row, Index col) const
137 inline const Scalar& coeffRef(Index index) const
351 template<typename Scalar, bool DestIsTransposed, typename OtherDerived>
354 static bool run(const Scalar* dest, const OtherDerived& src)
356 return (bool(blas_traits<OtherDerived>::IsTransposed) != DestIsTransposed) && (dest!=0 && dest==(Scalar*)extract_data(src))
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 43 typedef typename scalar_product_traits<typename _LhsNested::Scalar, typename _RhsNested::Scalar>::ReturnType Scalar;
65 SameType = is_same<typename _LhsNested::Scalar,typename _RhsNested::Scalar>::value,
69 || ( (ColsAtCompileTime % packet_traits<Scalar>::size) == 0
76 || ( (RowsAtCompileTime % packet_traits<Scalar>::size) == 0
93 : InnerSize * (NumTraits<Scalar>::MulCost + LhsCoeffReadCost + RhsCoeffReadCost)
94 + (InnerSize - 1) * NumTraits<Scalar>::AddCost,
106 && (InnerSize % packet_traits<Scalar>::size == 0
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Transform.h | 31 * \param _Scalar the scalar type, i.e., the type of the coefficients
51 /** the scalar type of the coefficients */
52 typedef _Scalar Scalar;
54 typedef Matrix<Scalar,HDim,HDim> MatrixType;
56 typedef Matrix<Scalar,Dim,Dim> LinearMatrixType;
62 typedef Matrix<Scalar,Dim,1> VectorType;
68 typedef Translation<Scalar,Dim> TranslationType;
70 typedef Scaling<Scalar,Dim> ScalingType;
109 transform->matrix()(Dim,Dim) = Scalar(1);
137 inline Scalar operator() (int row, int col) const { return m_matrix(row,col);
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| SVD.h | 33 typedef typename MatrixType::Scalar Scalar;
34 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
37 PacketSize = internal::packet_traits<Scalar>::size,
42 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVector;
43 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> RowVector;
45 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MinSize> MatrixUType;
46 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, MatrixType::ColsAtCompileTime> MatrixVType;
47 typedef Matrix<Scalar, MinSize, 1> SingularValuesType;
140 Scalar t = matA.col(k).end(m-k).eigen2_dot(matA.col(j).end(m-k)); // FIXME dot product or cwise prod + .s (…)
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 63 /** \brief Scalar type for matrices of type \p _MatrixType. */
64 typedef typename MatrixType::Scalar Scalar;
65 typedef typename NumTraits<Scalar>::Real RealScalar;
68 /** \brief Complex scalar type for \p _MatrixType.
70 * This is \c std::complex<Scalar> if #Scalar is real (e.g.,
71 * \c float or \c double) and just \c Scalar if #Scalar is
213 friend struct internal::complex_schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>
[all...] |
| EigenSolver.h | 79 /** \brief Scalar type for matrices of type #MatrixType. */
80 typedef typename MatrixType::Scalar Scalar;
81 typedef typename NumTraits<Scalar>::Real RealScalar;
84 /** \brief Complex scalar type for #MatrixType.
86 * This is \c std::complex<Scalar> if #Scalar is real (e.g.,
87 * \c float or \c double) and just \c Scalar if #Scalar is
295 typedef Matrix<Scalar, ColsAtCompileTime, 1, Options & ~RowMajor, MaxColsAtCompileTime, 1> ColumnVectorType
[all...] |
| RealSchur.h | 65 typedef typename MatrixType::Scalar Scalar;
66 typedef std::complex<typename NumTraits<Scalar>::Real> ComplexScalar;
70 typedef Matrix<Scalar, ColsAtCompileTime, 1, Options & ~RowMajor, MaxColsAtCompileTime, 1> ColumnVectorType;
192 typedef Matrix<Scalar,3,1> Vector3s;
194 Scalar computeNormOfT();
195 Index findSmallSubdiagEntry(Index iu, Scalar norm);
196 void splitOffTwoRows(Index iu, bool computeU, Scalar exshift);
197 void computeShift(Index iu, Index iter, Scalar& exshift, Vector3s& shiftInfo);
199 void performFrancisQRStep(Index il, Index im, Index iu, bool computeU, const Vector3s& firstHouseholderVector, Scalar* workspace)
[all...] |
| Tridiagonalization.h | 68 typedef typename MatrixType::Scalar Scalar;
69 typedef typename NumTraits<Scalar>::Real RealScalar;
80 typedef Matrix<Scalar, SizeMinusOne, 1, Options & ~RowMajor, MaxSizeMinusOne, 1> CoeffVectorType;
86 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
91 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
349 typedef typename MatrixType::Scalar Scalar;
359 Scalar h;
369 hCoeffs.tail(n-i-1) += (conj(h)*Scalar(-0.5)*(hCoeffs.tail(remainingSize).dot(matA.col(i).tail(remainingSize)))) * matA.col(i).tail(n-i-1 (…)
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 22 * \param _Scalar the type of the scalar coefficients
33 typedef _Scalar Scalar;
34 typedef NumTraits<Scalar> ScalarTraits;
38 typedef Matrix<Scalar,AmbientDimAtCompileTime,1> VectorType;
110 inline const CwiseUnaryOp<internal::scalar_quotient1_op<Scalar>,
111 const CwiseBinaryOp<internal::scalar_sum_op<Scalar>, const VectorType, const VectorType> >
117 * result for integral or floating scalar types: see
119 inline const CwiseBinaryOp< internal::scalar_difference_op<Scalar>, const VectorType, const VectorType> sizes() const
123 inline Scalar volume() const
130 inline CwiseBinaryOp< internal::scalar_difference_op<Scalar>, const VectorType, const VectorType> diagonal() cons
[all...] |
| /external/eigen/Eigen/src/Householder/ |
| HouseholderSequence.h | 35 * v_i^* \f$. The i-th Householder coefficient \f$ h_i \f$ is a scalar and the i-th Householder vector \f$
62 typedef typename VectorsType::Scalar Scalar;
104 typedef typename scalar_product_traits<OtherScalarType, typename MatrixType::Scalar>::ReturnType
121 typedef typename internal::traits<HouseholderSequence>::Scalar Scalar;
131 typename internal::conditional<NumTraits<Scalar>::IsComplex,
229 Matrix<Scalar, DestType::RowsAtCompileTime, 1,
282 Matrix<Scalar,1,Dest::RowsAtCompileTime,RowMajor,1,Dest::MaxRowsAtCompileTime> workspace(dst.rows());
302 Matrix<Scalar,1,Dest::ColsAtCompileTime,RowMajor,1,Dest::MaxColsAtCompileTime> workspace(dst.cols())
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 46 typedef _Scalar Scalar;
47 typedef typename NumTraits<Scalar>::Real RealScalar;
48 typedef Matrix<Scalar,Dynamic,1> Vector;
49 typedef SparseMatrix<Scalar,RowMajor> FactorType;
50 typedef SparseMatrix<Scalar,ColMajor> PermutType;
54 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
57 : m_droptol(NumTraits<Scalar>::dummy_precision()), m_fillfactor(10),
62 IncompleteLUT(const MatrixType& mat, RealScalar droptol=NumTraits<Scalar>::dummy_precision(), int fillfactor = 10)
97 IncompleteLUT<Scalar>& compute(const MatrixType& amat)
135 inline bool operator() (const Index& row, const Index& col, const Scalar&) cons
[all...] |
| IterativeSolverBase.h | 26 typedef typename MatrixType::Scalar Scalar;
221 m_tolerance = NumTraits<Scalar>::epsilon();
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 59 typedef typename MatrixType::Scalar Scalar;
60 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
166 typename internal::traits<MatrixType>::Scalar determinant() const;
215 template<typename Scalar, int StorageOrder, typename PivIndex>
223 typedef Map<Matrix<Scalar, Dynamic, Dynamic, StorageOrder> > MapLU;
298 static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256)
380 <typename MatrixType::Scalar, MatrixType::Flags&RowMajorBit?RowMajor:ColMajor, typename TranspositionType::Index>
407 typename internal::traits<MatrixType>::Scalar PartialPivLU<MatrixType>::determinant() const
410 return Scalar(m_det_p) * m_lu.diagonal().prod()
[all...] |
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 36 typedef typename _MatrixType::Scalar Scalar;
45 typedef typename _MatrixType::Scalar Scalar;
54 typedef typename _MatrixType::Scalar Scalar;
125 typedef typename MatrixType::Scalar Scalar;
128 typedef Matrix<Scalar,Dynamic,1> Vector;
129 typedef SparseMatrix<Scalar, ColMajor> ColSpMatrix
[all...] |
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 49 typedef typename MatrixType::Scalar Scalar;
52 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, Options, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixQType;
308 : NumTraits<Scalar>::epsilon() * m_qr.diagonalSize();
377 RealScalar threshold_helper = m_colSqNorms.maxCoeff() * internal::abs2(NumTraits<Scalar>::epsilon()) / RealScalar(rows);
|
| HouseholderQR.h | 54 typedef typename MatrixType::Scalar Scalar;
57 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, (MatrixType::Flags&RowMajorBit) ? RowMajor : ColMajor, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixQType;
193 void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename MatrixQR::Scalar* tempData = 0)
196 typedef typename MatrixQR::Scalar Scalar;
204 typedef Matrix<Scalar,MatrixQR::ColsAtCompileTime,1> TempType;
231 typename MatrixQR::Scalar* tempData = 0)
234 typedef typename MatrixQR::Scalar Scalar;
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseBlock.h | 19 typedef typename traits<MatrixType>::Scalar Scalar;
162 SparseMatrix<Scalar, IsRowMajor ? RowMajor : ColMajor, Index> tmp(other);
177 std::memcpy(&newdata.value(0), &m_matrix.data().value(0), nnz_head*sizeof(Scalar));
180 std::memcpy(&newdata.value(nnz_head), &tmp.data().value(0), nnz*sizeof(Scalar));
183 std::memcpy(&newdata.value(nnz_head+nnz), &matrix.data().value(tail), nnz_tail*sizeof(Scalar));
195 std::memcpy(&matrix.data().value(nnz_head+nnz), &matrix.data().value(tail), nnz_tail*sizeof(Scalar));
207 std::memcpy(&matrix.data().value(nnz_head), &tmp.data().value(0), nnz*sizeof(Scalar));
232 inline const Scalar* valuePtr() const
234 inline Scalar* valuePtr(
[all...] |
| SparseDenseProduct.h | 41 typedef typename scalar_product_traits<typename traits<Lhs>::Scalar,
42 typename traits<Rhs>::Scalar>::ReturnType Scalar;
60 CoeffReadCost = LhsCoeffReadCost + RhsCoeffReadCost + NumTraits<Scalar>::MulCost
124 inline Scalar value() const { return Base::value() * m_factor; }
128 Scalar m_factor;
153 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, typename Res::Scalar alpha)
160 typename Res::Scalar tmp(0);
177 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, typename Res::Scalar alpha)
183 typename Res::Scalar rhs_j = alpha * rhs.coeff(j,c)
[all...] |
| SparseMatrixBase.h | 30 typedef typename internal::traits<Derived>::Scalar Scalar;
31 typedef typename internal::packet_traits<Scalar>::type PacketScalar;
35 typename internal::packet_traits<Scalar>::type
99 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
100 CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>, Eigen::Transpose<const Derived> >,
105 typedef SparseMatrix<Scalar, Flags&RowMajorBit ? RowMajor : ColMajor> PlainObject;
109 /** This is the "real scalar" type; if the \a Scalar type is already real numbers
110 * (e.g. int, float or double) then \a RealScalar is just the same as \a Scalar. I
[all...] |
| SparseProduct.h | 18 typedef typename internal::traits<Lhs>::Scalar Scalar;
27 SparseMatrix<Scalar,0>,
31 SparseMatrix<Scalar,0>,
45 typedef typename _LhsNested::Scalar Scalar;
108 SparseSparseProduct pruned(Scalar reference = 0, RealScalar epsilon = NumTraits<RealScalar>::dummy_precision()) const
|
| SparseSelfAdjointView.h | 42 void permute_symm_to_symm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm = 0);
45 void permute_symm_to_fullsymm(const MatrixType& mat, SparseMatrix<typename MatrixType::Scalar,DestOrder,typename MatrixType::Index>& _dest, const typename MatrixType::Index* perm = 0);
54 typedef typename MatrixType::Scalar Scalar;
97 SparseSelfAdjointView& rankUpdate(const SparseMatrixBase<DerivedU>& u, Scalar alpha = Scalar(1));
176 SparseSelfAdjointView<MatrixType,UpLo>::rankUpdate(const SparseMatrixBase<DerivedU>& u, Scalar alpha)
178 SparseMatrix<Scalar,MatrixType::Flags&RowMajorBit?RowMajor:ColMajor> tmp = u * u.adjoint();
179 if(alpha==Scalar(0))
210 template<typename Dest> void scaleAndAddTo(Dest& dest, Scalar alpha) cons
[all...] |
| /external/eigen/bench/ |
| bench_gemm.cpp | 12 #ifndef SCALAR
13 // #define SCALAR std::complex<float>
14 #define SCALAR float
17 typedef SCALAR Scalar;
18 typedef NumTraits<Scalar>::Real RealScalar;
20 typedef Matrix</*Real*/Scalar,Dynamic,Dynamic> B;
21 typedef Matrix<Scalar,Dynamic,Dynamic> C;
125 typedef internal::gebp_traits<Scalar,Scalar> Traits
[all...] |
| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 115 typedef typename Dest::Scalar Scalar;
116 typedef typename internal::packet_traits<Scalar>::type Packet;
117 const int PacketSize = sizeof(Packet)/sizeof(Scalar);
122 Scalar* A0 = dst.data() + j*dst.stride();
|
| /external/eigen/test/ |
| geo_hyperplane.cpp | 24 typedef typename HyperplaneType::Scalar Scalar;
25 typedef typename NumTraits<Scalar>::Real RealScalar;
26 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime, 1> VectorType;
27 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime,
40 Scalar s0 = internal::random<Scalar>();
41 Scalar s1 = internal::random<Scalar>();
43 VERIFY_IS_APPROX( n1.dot(n1), Scalar(1) )
[all...] |
| jacobisvd.cpp | 29 typedef typename MatrixType::Scalar Scalar;
30 typedef typename NumTraits<Scalar>::Real RealScalar;
31 typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime> MatrixUType;
32 typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime> MatrixVType;
33 typedef Matrix<Scalar, RowsAtCompileTime, 1> ColVectorType;
34 typedef Matrix<Scalar, ColsAtCompileTime, 1> InputVectorType;
37 sigma.diagonal() = svd.singularValues().template cast<Scalar>();
72 typedef typename MatrixType::Scalar Scalar;
[all...] |
