| /external/eigen/unsupported/test/ |
| sparse_extra.cpp | 17 template<typename SetterType,typename DenseType, typename Scalar, int Options>
18 bool test_random_setter(SparseMatrix<Scalar,Options>& sm, const DenseType& ref, const std::vector<Vector2i>& nonzeroCoords)
55 typedef typename SparseMatrixType::Scalar Scalar;
59 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
60 typedef Matrix<Scalar,Dynamic,1> DenseVector;
61 Scalar eps = 1e-6;
69 initSparse<Scalar>(density, refMat, m, 0, &zeroCoords, &nonzeroCoords);
78 if(internal::is_same<SparseMatrixType,SparseMatrix<Scalar,Flags> >::value)
83 m.coeffRef(nonzeroCoords[0].x(), nonzeroCoords[0].y()) = Scalar(5)
[all...] |
| polynomialsolver.cpp | 34 typedef typename POLYNOMIAL::Scalar Scalar;
37 typedef Matrix<Scalar,Deg,1> EvalRootsType;
47 bool evalToZero = evr.isZero( test_precision<Scalar>() );
57 std::vector<Scalar> rootModuli( roots.size() );
81 typedef typename POLYNOMIAL::Scalar Scalar;
83 typedef PolynomialSolver<Scalar, Deg > PolynomialSolverType;
96 typedef typename POLYNOMIAL::Scalar Scalar;
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_array.cpp | 19 typedef typename MatrixType::Scalar Scalar;
20 typedef typename NumTraits<Scalar>::Real RealScalar;
21 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
30 Scalar s1 = ei_random<Scalar>(),
31 s2 = ei_random<Scalar>();
33 // scalar addition
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
49 VERIFY_IS_APPROX(m1.colwise().sum(), m1.colwise().redux(internal::scalar_sum_op<Scalar>()));
[all...] |
| eigen2_packetmath.cpp | 14 template<typename Scalar> bool areApprox(const Scalar* a, const Scalar* b, int size)
43 template<typename Scalar> void packetmath()
45 typedef typename ei_packet_traits<Scalar>::type Packet;
46 const int PacketSize = ei_packet_traits<Scalar>::size;
49 EIGEN_ALIGN_128 Scalar data1[ei_packet_traits<Scalar>::size*4];
50 EIGEN_ALIGN_128 Scalar data2[ei_packet_traits<Scalar>::size*4]
[all...] |
| eigen2_determinant.cpp | 24 typedef typename MatrixType::Scalar Scalar;
25 Scalar x = ei_random<Scalar>();
26 VERIFY_IS_APPROX(MatrixType::Identity(size, size).determinant(), Scalar(1));
|
| /external/eigen/test/ |
| qr_colpivoting.cpp | 21 typedef typename MatrixType::Scalar Scalar;
22 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> MatrixQType;
49 typedef typename MatrixType::Scalar Scalar;
51 Matrix<Scalar,Rows,Cols> m1;
53 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
60 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
61 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse();
64 Matrix<Scalar,Cols,Cols2> m2 = Matrix<Scalar,Cols,Cols2>::Random(Cols,Cols2)
[all...] |
| adjoint.cpp | 17 template<typename Vec, typename Mat, typename Scalar>
18 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) {
28 template<typename Vec, typename Mat, typename Scalar>
29 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) {
30 typedef typename NumTraits<Scalar>::Real RealScalar;
33 RealScalar ref = NumTraits<Scalar>::IsInteger ? RealScalar(0) : (std::max)((s1 * v1 + s2 * v2).norm(),v3.norm());
47 ref = NumTraits<Scalar>::IsInteger ? 0 : (std::max)((std::max)(v1.norm(),v2.norm()),(std::max)((square * v2).norm(),(square.adjoint() * v1).norm()));
48 VERIFY(internal::isMuchSmallerThan(abs(v1.dot(square * v2) - (square.adjoint() * v1).dot(v2)), ref, test_precision<Scalar>()));
[all...] |
| basicstuff.cpp | 17 typedef typename MatrixType::Scalar Scalar;
18 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
19 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
30 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
35 Scalar x = 0;
36 while(x == Scalar(0)) x = internal::random<Scalar>();
70 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
74 Matrix<Scalar, 1, MatrixType::RowsAtCompileTime> rv(rows)
[all...] |
| integer_types.cpp | 22 typedef typename MatrixType::Scalar Scalar;
24 enum { is_signed = (Scalar(-1) > Scalar(0)) ? 0 : 1 };
40 Scalar s1;
42 s1 = internal::random<Scalar>();
53 typedef typename MatrixType::Scalar Scalar;
55 VERIFY(NumTraits<Scalar>::IsInteger);
56 enum { is_signed = (Scalar(-1) > Scalar(0)) ? 0 : 1 }
[all...] |
| array_replicate.cpp | 18 typedef typename MatrixType::Scalar Scalar;
19 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
20 typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
21 typedef Matrix<Scalar, Dynamic, 1> VectorX;
|
| /external/eigen/Eigen/src/Core/util/ |
| XprHelper.h | 127 template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols>
139 ((!is_dynamic_size_storage) && (((MaxCols*MaxRows*int(sizeof(Scalar))) % 16) == 0))
154 packet_access_bit = packet_traits<Scalar>::Vectorizable && aligned_bit ? PacketAccessBit : 0
179 typedef Matrix<typename traits<T>::Scalar,
190 typedef Array<typename traits<T>::Scalar,
209 // typedef T::Matrix<typename traits<T>::Scalar,
242 typedef Matrix<typename traits<T>::Scalar,
260 typedef Matrix<typename traits<T>::Scalar,
325 ScalarReadCost = NumTraits<typename traits<T>::Scalar>::ReadCost,
367 /** \internal Helper base class to add a scalar multiple operato
[all...] |
| /external/eigen/Eigen/src/Core/ |
| ArrayBase.h | 24 * of scalar values arranged in a one or two dimensionnal fashion. As the main consequence,
26 * arrays support scalar math functions of the c++ standard library (e.g., std::sin(x)), and convenient
27 * constructors allowing to easily write generic code working for both scalar values
49 using internal::special_scalar_op_base<Derived,typename internal::traits<Derived>::Scalar,
50 typename NumTraits<typename internal::traits<Derived>::Scalar>::Real>::operator*;
54 typedef typename internal::traits<Derived>::Scalar Scalar;
55 typedef typename internal::packet_traits<Scalar>::type PacketScalar;
56 typedef typename NumTraits<Scalar>::Real RealScalar;
93 typedef Array<typename internal::traits<Derived>::Scalar,
[all...] |
| Swap.h | 34 typedef typename internal::packet_traits<Scalar>::type Packet;
45 Scalar,
46 const Scalar
50 inline const Scalar* data() const { return m_expression.data(); }
52 inline Scalar& coeffRef(Index rowId, Index colId)
57 inline Scalar& coeffRef(Index index)
62 inline Scalar& coeffRef(Index rowId, Index colId) const
67 inline Scalar& coeffRef(Index index) const
78 Scalar tmp = m_expression.coeff(rowId, colId);
88 Scalar tmp = m_expression.coeff(index)
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_kernel_bmod.h | 43 typedef typename ScalarVector::Scalar Scalar;
59 Map<Matrix<Scalar,SegSizeAtCompileTime,SegSizeAtCompileTime>, 0, OuterStride<> > A( &(lusup.data()[luptr]), segsize, segsize, OuterStride<>(lda) );
60 Map<Matrix<Scalar,SegSizeAtCompileTime,1> > u(tempv.data(), segsize);
66 const Index PacketSize = internal::packet_traits<Scalar>::size;
68 Map<Matrix<Scalar,Dynamic,SegSizeAtCompileTime>, 0, OuterStride<> > B( &(lusup.data()[luptr]), nrow, segsize, OuterStride<>(lda) );
71 Map<Matrix<Scalar,Dynamic,1>, 0, OuterStride<> > l(tempv.data()+segsize+aligned_offset+aligned_with_B_offset, nrow, OuterStride<>(ldl) );
74 internal::sparselu_gemm<Scalar>(l.rows(), l.cols(), B.cols(), B.data(), B.outerStride(), u.data(), u.outerStride(), l.data(), l.outerStride());
104 typedef typename ScalarVector::Scalar Scalar;
[all...] |
| SparseLU_Memory.h | 45 template< typename Scalar, typename Index>
48 return (2*w + 4 + LUNoMarker) * m * sizeof(Index) + (w + 1) * m * sizeof(Scalar);
62 template <typename Scalar, typename Index>
64 Index SparseLUImpl<Scalar,Index>::expand(VectorType& vec, Index& length, Index nbElts, Index keep_prev, Index& num_expansions)
151 template <typename Scalar, typename Index>
152 Index SparseLUImpl<Scalar,Index>::memInit(Index m, Index n, Index annz, Index lwork, Index fillratio, Index panel_size, GlobalLU_t& glu)
160 tempSpace = (2*panel_size + 4 + LUNoMarker) * m * sizeof(Index) + (panel_size + 1) * m * sizeof(Scalar);
165 + (glu.nzlmax + glu.nzumax) * sizeof(Index) + (glu.nzlumax+glu.nzumax) * sizeof(Scalar) + n;
208 template <typename Scalar, typename Index>
210 Index SparseLUImpl<Scalar,Index>::memXpand(VectorType& vec, Index& maxlen, Index nbElts, MemType memtype, Index& num_expansi (…)
[all...] |
| SparseLU_column_dfs.h | 33 template <typename Scalar, typename Index> class SparseLUImpl;
41 typedef typename ScalarVector::Scalar Scalar;
42 typedef typename IndexVector::Scalar Index;
43 column_dfs_traits(Index jcol, Index& jsuper, typename SparseLUImpl<Scalar, Index>::GlobalLU_t& glu, SparseLUImpl<Scalar, Index>& luImpl)
60 typename SparseLUImpl<Scalar, Index>::GlobalLU_t& m_glu;
61 SparseLUImpl<Scalar, Index>& m_luImpl;
92 template <typename Scalar, typename Index>
93 Index SparseLUImpl<Scalar,Index>::column_dfs(const Index m, const Index jcol, IndexVector& perm_r, Index maxsuper, Index& ns (…)
[all...] |
| /external/eigen/bench/ |
| benchEigenSolver.cpp | 27 #ifndef SCALAR
28 #define SCALAR float
31 typedef SCALAR Scalar;
42 typedef typename MatrixType::Scalar Scalar;
43 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;
50 Scalar acc = 0;
95 gmm::dense_matrix<Scalar> gmmCovMat(covMat.rows(),covMat.cols());
96 gmm::dense_matrix<Scalar> eigvect(covMat.rows(),covMat.cols())
[all...] |
| product_threshold.cpp | 44 template<int M, int N, int K, typename Scalar, int Mode>
47 typedef Matrix<Scalar,M,K> Lhs; Lhs a; a.setRandom();
48 typedef Matrix<Scalar,K,N> Rhs; Rhs b; b.setRandom();
49 typedef Matrix<Scalar,M,N> Res; Res c; c.setRandom();
71 template<int M, int N, int K, typename Scalar, int Mode> struct loop_on_n;
113 template<int M, int N, int K, typename Scalar, int Mode>
118 bench_prod<M,N,K,Scalar,Mode==-1? alt_prod<M,N,K>::ret : Mode>();
120 loop_on_n<M,N+1,K,Scalar,Mode>::run();
124 template<int M, int K, typename Scalar, int Mode>
125 struct loop_on_n<M,END,K,Scalar,Mode> { static void run(){} }
[all...] |
| /external/llvm/lib/Transforms/ |
| Makefile | 11 PARALLEL_DIRS = Utils Instrumentation Scalar InstCombine IPO Vectorize Hello ObjCARC
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LU.h | 20 typedef typename MatrixType::Scalar Scalar;
21 typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar;
24 typedef Matrix<Scalar, 1, MatrixType::ColsAtCompileTime, MatrixType::Options, 1, MatrixType::MaxColsAtCompileTime> RowVectorType;
25 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1, MatrixType::Options, MatrixType::MaxRowsAtCompileTime, 1> ColVectorType;
27 typedef Matrix<typename MatrixType::Scalar,
37 typedef Matrix<typename MatrixType::Scalar,
|
| /external/eigen/lapack/ |
| lu.cpp | 29 Scalar* a = reinterpret_cast<Scalar*>(pa);
31 int ret = int(Eigen::internal::partial_lu_impl<Scalar,ColMajor,int>
60 Scalar* a = reinterpret_cast<Scalar*>(pa);
61 Scalar* b = reinterpret_cast<Scalar*>(pb);
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMcovar.h | 19 template <typename Scalar>
21 Matrix< Scalar, Dynamic, Dynamic > &r,
23 Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) )
30 Scalar temp;
34 const Scalar tolr = tol * abs(r(0,0));
35 Matrix< Scalar, Dynamic, 1 > wa(n);
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| covar.h | 5 template <typename Scalar>
7 Matrix< Scalar, Dynamic, Dynamic > &r,
9 Scalar tol = std::sqrt(NumTraits<Scalar>::epsilon()) )
17 Scalar temp;
21 const Scalar tolr = tol * abs(r(0,0));
22 Matrix< Scalar, Dynamic, 1 > wa(n);
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunctionAtomic.h | 28 typedef typename MatrixType::Scalar Scalar;
30 typedef typename NumTraits<Scalar>::Real RealScalar;
31 typedef typename internal::stem_function<Scalar>::type StemFunction;
32 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
54 /** \brief Pointer to scalar function */
61 Scalar m_avgEival;
75 m_avgEival = A.trace() / Scalar(RealScalar(m_Arows));
84 P = Scalar(RealScalar(1.0/(s + 1))) * P * m_Ashifted;
111 if (Fincr_norm < NumTraits<Scalar>::epsilon() * F_norm)
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| 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
102 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
103 CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>, Eigen::Transpose<const Derived> >,
108 typedef SparseMatrix<Scalar, Flags&RowMajorBit ? RowMajor : ColMajor, Index> PlainObject;
112 /** This is the "real scalar" type; if the \a Scalar type is already real numbers
113 * (e.g. int, float or double) then \a RealScalar is just the same as \a Scalar. I
[all...] |
