| /external/eigen/blas/ |
| level3_impl.h | 15 typedef void (*functype)(DenseIndex, DenseIndex, DenseIndex, const Scalar *, DenseIndex, const Scalar *, DenseIndex, Scalar *, DenseIndex, Scalar, internal::level3_blocking<Scalar,Scalar>&, Eigen::internal::GemmParallelInfo<DenseIndex>*);
23 func[NOTR | (NOTR << 2)] = (internal::general_matrix_matrix_product<DenseIndex,Scalar,ColMajor,false,Scalar,ColMajor,false,ColMajor>::run);
24 func[TR | (NOTR << 2)] = (internal::general_matrix_matrix_product<DenseIndex,Scalar,RowMajor,false,Scalar,ColMajor,false,ColMajor>::run)
[all...] |
| level2_cplx_impl.h | 21 typedef void (*functype)(int, const Scalar*, int, const Scalar*, int, Scalar*, Scalar);
30 func[UP] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::run);
31 func[LO] = (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Lower,false,false>::run);
36 Scalar* a = reinterpret_cast<Scalar*>(pa);
37 Scalar* x = reinterpret_cast<Scalar*>(px)
[all...] |
| level1_real_impl.h | 18 Scalar* x = reinterpret_cast<Scalar*>(px);
27 Scalar EIGEN_BLAS_FUNC(dot)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy)
33 Scalar* x = reinterpret_cast<Scalar*>(px);
34 Scalar* y = reinterpret_cast<Scalar*>(py);
46 Scalar EIGEN_BLAS_FUNC(nrm2)(int *n, RealScalar *px, int *incx)
51 Scalar* x = reinterpret_cast<Scalar*>(px)
[all...] |
| level1_impl.h | 14 Scalar* x = reinterpret_cast<Scalar*>(px);
15 Scalar* y = reinterpret_cast<Scalar*>(py);
16 Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
33 Scalar* x = reinterpret_cast<Scalar*>(px);
34 Scalar* y = reinterpret_cast<Scalar*>(py)
[all...] |
| /external/eigen/test/ |
| sparse.h | 56 template<typename Scalar,int Opt1,int Opt2,typename Index> void
58 Matrix<Scalar,Dynamic,Dynamic,Opt1>& refMat,
59 SparseMatrix<Scalar,Opt2,Index>& sparseMat,
64 enum { IsRowMajor = SparseMatrix<Scalar,Opt2,Index>::IsRowMajor };
77 Scalar v = (internal::random<double>(0,1) < density) ? internal::random<Scalar>() : Scalar(0);
80 v = internal::random<Scalar>()*Scalar(3.);
81 v = v*v + Scalar(5.)
[all...] |
| packetmath.cpp | 21 template<typename Scalar> bool isApproxAbs(const Scalar& a, const Scalar& b, const typename NumTraits<Scalar>::Real& refvalue)
26 template<typename Scalar> bool areApproxAbs(const Scalar* a, const Scalar* b, int size, const typename NumTraits<Scalar>::Real& refvalue)
32 std::cout << "[" << Map<const Matrix<Scalar,1,Dynamic> >(a,size) << "]" << " != " << Map<const Matrix<Scalar,1,Dynamic> >(b,size) << "\n"
[all...] |
| geo_parametrizedline.cpp | 24 typedef typename LineType::Scalar Scalar;
25 typedef typename NumTraits<Scalar>::Real RealScalar;
26 typedef Matrix<Scalar, LineType::AmbientDimAtCompileTime, 1> VectorType;
27 typedef Hyperplane<Scalar,LineType::AmbientDimAtCompileTime> HyperplaneType;
36 Scalar s0 = internal::random<Scalar>();
37 Scalar s1 = abs(internal::random<Scalar>());
43 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 )
[all...] |
| geo_quaternion.cpp | 27 typedef typename QuatType::Scalar Scalar;
28 typedef AngleAxis<Scalar> AA;
30 Scalar largeEps = test_precision<Scalar>();
32 Scalar theta_tot = AA(q1*q0.inverse()).angle();
34 theta_tot = Scalar(2.*M_PI)-theta_tot;
35 for(Scalar t=0; t<=Scalar(1.001); t+=Scalar(0.1)
[all...] |
| sparse_solvers.cpp | 12 template<typename Scalar> void
14 Matrix<Scalar,Dynamic,Dynamic>& refMat,
15 SparseMatrix<Scalar>& sparseMat)
17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
28 if (refMat(i,j)!=Scalar(0))
33 template<typename Scalar> void sparse_solvers(int rows, int cols)
36 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
37 typedef Matrix<Scalar,Dynamic,1> DenseVector;
38 // Scalar eps = 1e-6;
48 SparseMatrix<Scalar> m2(rows, cols)
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Scaling.h | 21 * \param _Scalar the scalar type, i.e., the type of the coefficients.
24 * type of Scaling(Scalar), and most of the time this is the only way it
36 /** the scalar type of the coefficients */
37 typedef _Scalar Scalar;
41 Scalar m_factor;
48 explicit inline UniformScaling(const Scalar& s) : m_factor(s) {}
50 inline const Scalar& factor() const { return m_factor; }
51 inline Scalar& factor() { return m_factor; }
59 inline Transform<Scalar,Dim,Affine> operator* (const Translation<Scalar,Dim>& t) const
[all...] |
| Translation.h | 21 * \param _Scalar the scalar type, i.e., the type of the coefficients.
36 /** the scalar type of the coefficients */
37 typedef _Scalar Scalar;
39 typedef Matrix<Scalar,Dim,1> VectorType;
41 typedef Matrix<Scalar,Dim,Dim> LinearMatrixType;
43 typedef Transform<Scalar,Dim,Affine> AffineTransformType;
45 typedef Transform<Scalar,Dim,Isometry> IsometryTransformType;
56 inline Translation(const Scalar& sx, const Scalar& sy)
63 inline Translation(const Scalar& sx, const Scalar& sy, const Scalar& sz
[all...] |
| /external/eigen/bench/ |
| benchmark.cpp | 18 #ifndef SCALAR
19 #define SCALAR double
24 Matrix<SCALAR,MATSIZE,MATSIZE> I = Matrix<SCALAR,MATSIZE,MATSIZE>::Ones();
25 Matrix<SCALAR,MATSIZE,MATSIZE> m;
34 m = Matrix<SCALAR,MATSIZE,MATSIZE>::Ones() + 0.00005 * (m + (m*m));
|
| geometry.cpp | 9 #ifndef SCALAR
10 #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;
32 template<typename Scalar, typename Data>
33 EIGEN_DONT_INLINE void transform(const Quaternion<Scalar>& t, Data& data)
44 typedef typename T::Scalar Scalar
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_sparse_solvers.cpp | 12 template<typename Scalar> void
14 Matrix<Scalar,Dynamic,Dynamic>& refMat,
15 SparseMatrix<Scalar>& sparseMat)
17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
28 if (refMat(i,j)!=Scalar(0))
33 template<typename Scalar> void sparse_solvers(int rows, int cols)
36 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
37 typedef Matrix<Scalar,Dynamic,1> DenseVector;
38 // Scalar eps = 1e-6;
48 SparseMatrix<Scalar> m2(rows, cols)
[all...] |
| eigen2_hyperplane.cpp | 23 typedef typename HyperplaneType::Scalar Scalar;
24 typedef typename NumTraits<Scalar>::Real RealScalar;
25 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime, 1> VectorType;
26 typedef Matrix<Scalar, HyperplaneType::AmbientDimAtCompileTime,
39 Scalar s0 = ei_random<Scalar>();
40 Scalar s1 = ei_random<Scalar>();
42 VERIFY_IS_APPROX( n1.eigen2_dot(n1), Scalar(1) )
[all...] |
| eigen2_smallvectors.cpp | 12 template<typename Scalar> void smallVectors()
14 typedef Matrix<Scalar, 1, 2> V2;
15 typedef Matrix<Scalar, 3, 1> V3;
16 typedef Matrix<Scalar, 1, 4> V4;
17 Scalar x1 = ei_random<Scalar>(),
18 x2 = ei_random<Scalar>(),
19 x3 = ei_random<Scalar>(),
20 x4 = ei_random<Scalar>();
|
| eigen2_parametrizedline.cpp | 23 typedef typename LineType::Scalar Scalar;
24 typedef typename NumTraits<Scalar>::Real RealScalar;
25 typedef Matrix<Scalar, LineType::AmbientDimAtCompileTime, 1> VectorType;
26 typedef Matrix<Scalar, LineType::AmbientDimAtCompileTime,
36 Scalar s0 = ei_random<Scalar>();
37 Scalar s1 = ei_abs(ei_random<Scalar>());
43 VERIFY_IS_APPROX( Scalar(l0.distance((p0+s0*d0) + d0.unitOrthogonal() * s1)), s1 )
[all...] |
| /external/clang/test/SemaCUDA/ |
| config-type.cu | 3 void cudaConfigureCall(unsigned gridSize, unsigned blockSize); // expected-error {{must have scalar return type}}
|
| /external/eigen/Eigen/src/plugins/ |
| ArrayCwiseBinaryOps.h | 17 EIGEN_STRONG_INLINE const CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const Derived, const OtherDerived>
20 return CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const Derived, const OtherDerived>(derived(), other.derived());
32 /** \returns an expression of the coefficient-wise min of \c *this and scalar \a other
36 EIGEN_STRONG_INLINE const CwiseBinaryOp<internal::scalar_min_op<Scalar>, const Derived,
37 const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> >
43 (const Scalar &other) const
57 /** \returns an expression of the coefficient-wise max of \c *this and scalar \a other
61 EIGEN_STRONG_INLINE const CwiseBinaryOp<internal::scalar_max_op<Scalar>, const Derived,
62 const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> >
68 (const Scalar &other) cons
[all...] |
| /external/eigen/doc/ |
| TopicScalarTypes.dox | 3 /** \page TopicScalarTypes Scalar types
|
| /external/llvm/test/YAMLParser/ |
| spec-07-12b.data | 4 # scalar (literal) node.
|
| spec-08-14.data | 5 Block scalar
|
| /external/valgrind/main/memcheck/tests/darwin/ |
| scalar_vfork.c | 1 #include "scalar.h"
|
| /external/eigen/Eigen/src/Jacobi/ |
| Jacobi.h | 34 template<typename Scalar> class JacobiRotation
37 typedef typename NumTraits<Scalar>::Real RealScalar;
43 JacobiRotation(const Scalar& c, const Scalar& s) : m_c(c), m_s(s) {}
45 Scalar& c() { return m_c; }
46 Scalar c() const { return m_c; }
47 Scalar& s() { return m_s; }
48 Scalar s() const { return m_s; }
66 bool makeJacobi(const RealScalar& x, const Scalar& y, const RealScalar& z);
68 void makeGivens(const Scalar& p, const Scalar& q, Scalar* z=0)
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointProduct.h | 22 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
23 struct selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs>
25 static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha)
28 typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
32 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1)))
38 template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs>
39 struct selfadjoint_rank1_update<Scalar,Index,RowMajor,UpLo,ConjLhs,ConjRhs
[all...] |
