| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffScalar.h | 34 * \brief A scalar type replacement with automatic differentation capability
36 * \param _DerType the vector type used to store/represent the derivatives. The base scalar type
45 * This class represents a scalar value while tracking its respective derivatives using Eigen's expression
53 * AutoDiffScalar can be used as the scalar type of an Eigen::Matrix object. However,
62 <_DerType, !internal::is_same<typename internal::traits<typename internal::remove_all<_DerType>::type>::Scalar,
63 typename NumTraits<typename internal::traits<typename internal::remove_all<_DerType>::type>::Scalar>::Real>::value>
67 <_DerType, !internal::is_same<typename internal::traits<typename internal::remove_all<_DerType>::type>::Scalar,
68 typename NumTraits<typename internal::traits<typename internal::remove_all<_DerType>::type>::Scalar>::Real>::value> Base;
70 typedef typename internal::traits<DerType>::Scalar Scalar;
[all...] |
| /external/eigen/unsupported/Eigen/src/BVH/ |
| BVAlgorithms.h | 149 typename Minimizer::Scalar minimize_helper(const BVH &tree, Minimizer &minimizer, typename BVH::Index root, typename Minimizer::Scalar minimum)
151 typedef typename Minimizer::Scalar Scalar;
153 typedef std::pair<Scalar, Index> QueueElement; //first element is priority
161 todo.push(std::make_pair(Scalar(), root));
171 Scalar val = minimizer.minimumOnVolume(tree.getVolume(*vBegin));
185 typedef typename Minimizer::Scalar Scalar;
187 Scalar minimumOnVolume(const Volume1 &vol) { return minimizer.minimumOnVolumeObject(vol, stored);
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| GMRES.h | 63 typedef typename Dest::Scalar Scalar;
65 typedef Matrix < Scalar, Dynamic, 1 > VectorType;
66 typedef Matrix < Scalar, Dynamic, Dynamic > FMatrixType;
82 std::vector < JacobiRotation < Scalar > > G(restart);
88 w(0)=(Scalar) beta;
134 if (k<m && v(k) != (Scalar) 0) {
186 w(0)=(Scalar) beta;
204 typename _Preconditioner = DiagonalPreconditioner<typename _MatrixType::Scalar> >
229 * and NumTraits<Scalar>::epsilon() for the tolerance
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 35 typedef typename MatrixType::Scalar Scalar;
37 typedef typename NumTraits<Scalar>::Real RealScalar;
38 // typedef typename internal::stem_function<Scalar>::type StemFunction;
39 // typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
54 static Scalar atanh(Scalar x);
97 typename MatrixType::Scalar MatrixLogarithmAtomic<MatrixType>::atanh(typename MatrixType::Scalar x)
101 if (abs(x) > sqrt(NumTraits<Scalar>::epsilon())
[all...] |
| MatrixSquareRoot.h | 57 typedef typename MatrixType::Scalar Scalar;
150 Matrix<Scalar,2,2> block = T.template block<2,2>(i,i);
151 EigenSolver<Matrix<Scalar,2,2> > es(block);
164 Scalar tmp = (sqrtT.row(i).segment(i+1,j-i-1) * sqrtT.col(j).segment(i+1,j-i-1)).value();
174 Matrix<Scalar,1,2> rhs = T.template block<1,2>(i,j);
177 Matrix<Scalar,2,2> A = sqrtT.coeff(i,i) * Matrix<Scalar,2,2>::Identity();
188 Matrix<Scalar,2,1> rhs = T.template block<2,1>(i,j);
191 Matrix<Scalar,2,2> A = sqrtT.coeff(j,j) * Matrix<Scalar,2,2>::Identity()
[all...] |
| /external/eigen/unsupported/Eigen/src/Skyline/ |
| SkylineProduct.h | 28 typedef typename _LhsNested::Scalar Scalar;
125 typedef typename traits<Lhs>::Scalar Scalar;
150 Scalar tmp = 0;
170 const Scalar rhsCoeff = rhs.coeff(lhscol, rhscol);
188 typedef typename traits<Lhs>::Scalar Scalar;
214 Scalar tmp = 0;
234 const Scalar rhsCoeff = rhs.coeff(lhscol, rhscol)
[all...] |
| /external/eigen/unsupported/Eigen/src/SparseExtra/ |
| RandomSetter.h | 19 template<typename Scalar> struct StdMapTraits
22 typedef std::map<KeyType,Scalar> Type;
47 template<typename Scalar> struct StdUnorderedMapTraits
50 typedef std::unordered_map<KeyType,Scalar> Type;
64 template<typename Scalar> struct GoogleDenseHashMapTraits
67 typedef google::dense_hash_map<KeyType,Scalar> Type;
82 template<typename Scalar> struct GoogleSparseHashMapTraits
85 typedef google::sparse_hash_map<KeyType,Scalar> Type;
156 typedef typename SparseMatrixType::Scalar Scalar;
[all...] |
| /external/eigen/unsupported/Eigen/src/Splines/ |
| Spline.h | 38 typedef _Scalar Scalar; /*!< The spline curve's scalar type. */
67 Spline(const Spline<Scalar, Dimension, OtherDegree>& spline) :
91 PointType operator()(Scalar u) const;
106 derivatives(Scalar u, DenseIndex order) const;
115 derivatives(Scalar u, DenseIndex order = DerivativeOrder) const;
134 basisFunctions(Scalar u) const;
150 basisFunctionDerivatives(Scalar u, DenseIndex order) const;
159 basisFunctionDerivatives(Scalar u, DenseIndex order = DerivativeOrder) const;
170 DenseIndex span(Scalar u) const
[all...] |
| /external/eigen/unsupported/test/ |
| BVH.cpp | 17 template<typename Scalar, int Dim> AlignedBox<Scalar, Dim> bounding_box(const Matrix<Scalar, Dim, 1> &v) { return AlignedBox<Scalar, Dim>(v); }
43 typedef double Scalar;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 60 typedef typename MatrixType::Scalar Scalar;
61 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
65 PacketSize = internal::packet_traits<Scalar>::size,
188 template<typename Scalar, int UpLo> struct llt_inplace;
193 typedef typename MatrixType::Scalar Scalar;
199 typedef Matrix<Scalar,Dynamic,1> TempVectorType;
216 JacobiRotation<Scalar> g;
236 Scalar wj = temp.coeff(j)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| GeneralProduct.h | 183 // FIXME : maybe the "inner product" could return a Scalar
188 // case, we could have a specialization for Block<MatrixType,1,1> with: operator=(Scalar x);
194 : traits<Matrix<typename scalar_product_traits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType,1,1> >
202 public Matrix<typename internal::scalar_product_traits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType,1,1>
204 typedef Matrix<typename internal::scalar_product_traits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType,1,1> Base;
214 /** Convertion to scalar */
215 operator const typename Base::Scalar() const
[all...] |
| PlainObjectBase.h | 15 # define EIGEN_INITIALIZE_BY_ZERO_IF_THAT_OPTION_IS_ENABLED for(int i=0;i<base().size();++i) coeffRef(i)=Scalar(0);
81 typedef typename internal::traits<Derived>::Scalar Scalar;
82 typedef typename internal::packet_traits<Scalar>::type PacketScalar;
83 typedef typename NumTraits<Scalar>::Real RealScalar;
110 DenseStorage<Scalar, Base::MaxSizeAtCompileTime, Base::RowsAtCompileTime, Base::ColsAtCompileTime, Options> m_storage;
122 EIGEN_STRONG_INLINE const Scalar& coeff(Index row, Index col) const
130 EIGEN_STRONG_INLINE const Scalar& coeff(Index index) const
135 EIGEN_STRONG_INLINE Scalar& coeffRef(Index row, Index col)
143 EIGEN_STRONG_INLINE Scalar& coeffRef(Index index
[all...] |
| VectorwiseOp.h | 40 typedef typename MemberOp::result_type Scalar;
43 typedef typename MatrixType::Scalar InputScalar;
83 EIGEN_STRONG_INLINE const Scalar coeff(Index i, Index j) const
91 const Scalar coeff(Index index) const
109 template<typename Scalar, int Size> struct Cost \
118 EIGEN_MEMBER_FUNCTOR(squaredNorm, Size * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost);
119 EIGEN_MEMBER_FUNCTOR(norm, (Size+5) * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost);
120 EIGEN_MEMBER_FUNCTOR(stableNorm, (Size+5) * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost)
[all...] |
| TriangularMatrix.h | 41 typedef typename internal::traits<Derived>::Scalar Scalar;
54 inline Scalar coeff(Index row, Index col) const { return derived().coeff(row,col); }
55 inline Scalar& coeffRef(Index row, Index col) { return derived().coeffRef(row,col); }
65 inline Scalar operator()(Index row, Index col) const
70 inline Scalar& operator()(Index row, Index col)
164 typedef typename internal::traits<TriangularView>::Scalar Scalar;
205 TriangularView& operator*=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = m_matrix * other; }
207 TriangularView& operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = m_matrix / other;
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| Quaternion.h | 25 * \param _Scalar the scalar type, i.e., the type of the coefficients
43 typedef _Scalar Scalar;
56 /** the scalar type of the coefficients */
57 typedef _Scalar Scalar;
60 typedef Matrix<Scalar, 4, 1> Coefficients;
62 typedef Matrix<Scalar,3,1> Vector3;
64 typedef Matrix<Scalar,3,3> Matrix3;
66 typedef AngleAxis<Scalar> AngleAxisType;
69 inline Scalar x() const { return m_coeffs.coeff(0); }
71 inline Scalar y() const { return m_coeffs.coeff(1);
[all...] |
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 80 /** \brief Scalar type for matrices of type \p _MatrixType. */
81 typedef typename MatrixType::Scalar Scalar;
84 /** \brief Real scalar type for \p _MatrixType.
86 * This is just \c Scalar if #Scalar is real (e.g., \c float or
87 * \c double), and the type of the real part of \c Scalar if #Scalar is
90 typedef typename NumTraits<Scalar>::Real RealScalar;
92 friend struct internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 56 typedef typename MatrixType::Scalar Scalar;
57 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
235 typename internal::traits<MatrixType>::Scalar determinant() const;
285 : NumTraits<Scalar>::epsilon() * m_lu.diagonalSize();
502 typename internal::traits<MatrixType>::Scalar FullPivLU<MatrixType>::determinant() const
506 return Scalar(m_det_pq) * Scalar(m_lu.diagonal().prod());
588 Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, MatrixType::Options,
616 for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) = Scalar(1)
[all...] |
| /external/eigen/Eigen/src/QR/ |
| FullPivHouseholderQR.h | 61 typedef typename MatrixType::Scalar Scalar;
327 : NumTraits<Scalar>::epsilon() * m_qr.diagonalSize();
390 m_precision = NumTraits<Scalar>::epsilon() * size;
421 m_hCoeffs.coeffRef(i) = Scalar(0);
481 Matrix<Scalar,1,Rhs::ColsAtCompileTime> temp(rhs().cols());
497 const RealScalar m_precision = NumTraits<Scalar>::epsilon() * (std::min)(rows,cols);
525 typedef Matrix<typename MatrixType::Scalar, 1, MatrixType::RowsAtCompileTime, RowMajor, 1,
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseVector.h | 20 * \tparam _Scalar the scalar type, i.e. the type of the coefficients
32 typedef _Scalar Scalar;
44 CoeffReadCost = NumTraits<Scalar>::ReadCost,
69 internal::CompressedStorage<Scalar,Index> m_data;
72 internal::CompressedStorage<Scalar,Index>& _data() { return m_data; }
73 internal::CompressedStorage<Scalar,Index>& _data() const { return m_data; }
82 EIGEN_STRONG_INLINE const Scalar* valuePtr() const { return &m_data.value(0); }
83 EIGEN_STRONG_INLINE Scalar* valuePtr() { return &m_data.value(0); }
88 inline Scalar coeff(Index row, Index col) const
93 inline Scalar coeff(Index i) const { return m_data.at(i);
[all...] |
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 128 typedef typename MatrixType::Scalar Scalar;
131 typedef Matrix<Scalar,Dynamic,1> Vector;
134 typedef SparseMatrix<Scalar> LUMatrixType;
135 typedef SparseMatrix<Scalar,ColMajor,int> UmfpackMatrixType;
149 if(m_symbolic) umfpack_free_symbolic(&m_symbolic,Scalar());
150 if(m_numeric) umfpack_free_numeric(&m_numeric,Scalar());
236 umfpack_free_symbolic(&m_symbolic,Scalar());
238 umfpack_free_numeric(&m_numeric,Scalar());
262 umfpack_free_numeric(&m_numeric,Scalar());
[all...] |
| /external/eigen/demos/opengl/ |
| quaternion_demo.cpp | 139 typedef _Scalar Scalar;
140 typedef Matrix<Scalar,3,3> Matrix3;
141 typedef Matrix<Scalar,3,1> Vector3;
142 typedef Quaternion<Scalar> QuaternionType;
151 inline EulerAngles(Scalar a0, Scalar a1, Scalar a2) : m_angles(a0, a1, a2) {}
|
| /external/eigen/test/ |
| main.h | 258 return a.isApprox(b, test_precision<typename Type1::Scalar>());
262 // the scalar ref is a hint about the expected order of magnitude of a and b.
267 template<typename Scalar,typename ScalarRef>
268 inline bool test_isApproxWithRef(const Scalar& a, const Scalar& b, const ScalarRef& ref)
277 return m1.isMuchSmallerThan(m2, test_precision<typename internal::traits<Derived1>::Scalar>());
282 const typename NumTraits<typename internal::traits<Derived>::Scalar>::Real& s)
284 return m.isMuchSmallerThan(s, test_precision<typename internal::traits<Derived>::Scalar>());
290 return m.isUnitary(test_precision<typename internal::traits<Derived>::Scalar>());
314 typedef typename internal::traits<MatrixType>::Scalar Scalar
[all...] |
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_kissfft_impl.h | 20 typedef _Scalar Scalar;
21 typedef std::complex<Scalar> Complex;
33 Scalar phinc = (inverse?2:-2)* acos( (Scalar) -1) / nfft;
150 Fout[m] = Complex( Fout->real() - Scalar(.5)*scratch[3].real() , Fout->imag() - Scalar(.5)*scratch[3].imag() );
266 typedef _Scalar Scalar;
267 typedef std::complex<Scalar> Complex;
304 void fwd( Complex * dst,const Scalar * src,int nfft)
327 dst[k] = (f1k + tw) * Scalar(.5)
[all...] |
| /external/llvm/lib/Target/NVPTX/ |
| NVPTX.h | 126 Scalar = 1,
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralBlockPanelKernel.h | 63 * Given a m x k times k x n matrix product of scalar types \c LhsScalar and \c RhsScalar,
305 typedef std::complex<RealScalar> Scalar;
314 && packet_traits<Scalar>::Vectorizable,
327 typedef typename packet_traits<Scalar>::type ScalarPacket;
334 typedef typename conditional<Vectorizable,RealPacket, Scalar>::type LhsPacket;
335 typedef typename conditional<Vectorizable,DoublePacket,Scalar>::type RhsPacket;
336 typedef typename conditional<Vectorizable,ScalarPacket,Scalar>::type ResPacket;
337 typedef typename conditional<Vectorizable,DoublePacket,Scalar>::type AccPacket;
339 EIGEN_STRONG_INLINE void initAcc(Scalar& p) { p = Scalar(0);
[all...] |
