| /external/eigen/Eigen/src/SparseCore/ |
| TriangularSolver.h | 30 typedef typename Rhs::Scalar Scalar;
37 Scalar tmp = other.coeff(i,col);
38 Scalar lastVal(0);
64 typedef typename Rhs::Scalar Scalar;
71 Scalar tmp = other.coeff(i,col);
72 Scalar l_ii = 0;
102 typedef typename Rhs::Scalar Scalar;
[all...] |
| /external/eigen/bench/ |
| bench_reverse.cpp | 15 typedef double Scalar;
30 Scalar acc = 0;
70 bench_reverse(Matrix<Scalar,Dynamic,Dynamic>(dynsizes[i],dynsizes[i]));
71 bench_reverse(Matrix<Scalar,Dynamic,1>(dynsizes[i]*dynsizes[i]));
73 // bench_reverse(Matrix<Scalar,2,2>());
74 // bench_reverse(Matrix<Scalar,3,3>());
75 // bench_reverse(Matrix<Scalar,4,4>());
76 // bench_reverse(Matrix<Scalar,5,5>());
77 // bench_reverse(Matrix<Scalar,6,6>());
78 // bench_reverse(Matrix<Scalar,7,7>())
[all...] |
| /external/eigen/test/ |
| array_replicate.cpp | 18 typedef typename MatrixType::Scalar Scalar;
19 typedef typename NumTraits<Scalar>::Real RealScalar;
20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
21 typedef Matrix<Scalar, Dynamic, Dynamic> MatrixX;
22 typedef Matrix<Scalar, Dynamic, 1> VectorX;
|
| array_reverse.cpp | 19 typedef typename MatrixType::Scalar Scalar;
20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
92 Scalar x = internal::random<Scalar>();
|
| eigensolver_complex.cpp | 21 typedef typename NumTraits<typename VectorType::Scalar>::Real RealScalar;
42 typedef typename MatrixType::Scalar Scalar;
43 typedef typename NumTraits<Scalar>::Real RealScalar;
44 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
46 typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;
|
| eigensolver_generic.cpp | 24 typedef typename MatrixType::Scalar Scalar;
25 typedef typename NumTraits<Scalar>::Real RealScalar;
26 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
28 typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;
|
| map.cpp | 19 typedef typename VectorType::Scalar Scalar;
24 Scalar* array1 = internal::aligned_new<Scalar>(size);
25 Scalar* array2 = internal::aligned_new<Scalar>(size);
26 Scalar* array3 = new Scalar[size+1];
27 Scalar* array3unaligned = size_t(array3)%16 == 0 ? array3+1 : array3;
38 if(internal::packet_traits<Scalar>::Vectorizable
[all...] |
| nullary.cpp | 16 typedef typename MatrixType::Scalar Scalar;
17 Scalar zero = static_cast<Scalar>(0);
39 typedef typename internal::traits<VectorType>::Scalar Scalar;
43 Scalar high = internal::random<Scalar>(-500,500);
44 Scalar low = (size == 1 ? high : internal::random<Scalar>(-500,500))
90 ScalarMatrix scalar; local
[all...] |
| product_syrk.cpp | 15 typedef typename MatrixType::Scalar Scalar;
16 typedef typename NumTraits<Scalar>::Real RealScalar;
17 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic> Rhs1;
18 typedef Matrix<Scalar, Dynamic, MatrixType::RowsAtCompileTime> Rhs2;
19 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic,RowMajor> Rhs3;
31 Scalar s1 = internal::random<Scalar>();
|
| redux.cpp | 15 typedef typename MatrixType::Scalar Scalar;
25 MatrixType m1_for_prod = MatrixType::Ones(rows, cols) + Scalar(0.2) * m1;
27 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows, cols).sum(), Scalar(1));
28 VERIFY_IS_APPROX(MatrixType::Ones(rows, cols).sum(), Scalar(float(rows*cols))); // the float() here to shut up excessive MSVC warning about int->complex conversion being lossy
29 Scalar s(0), p(1), minc(internal::real(m1.coeff(0))), maxc(internal::real(m1.coeff(0)));
38 const Scalar mean = s/Scalar(RealScalar(rows*cols));
58 VERIFY_IS_APPROX(m1.block(r0,c0,0,0).sum(), Scalar(0));
59 VERIFY_IS_APPROX(m1.block(r0,c0,0,0).prod(), Scalar(1))
[all...] |
| sparse_permutations.cpp | 18 typedef typename SparseMatrixType::Scalar Scalar;
20 typedef SparseMatrix<Scalar, OtherStorage, Index> OtherSparseMatrixType;
21 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrix;
30 initSparse<Scalar>(density, mat_d, mat, 0);
172 template<typename Scalar> void sparse_permutations_all(int size)
174 CALL_SUBTEST(( sparse_permutations<ColMajor>(SparseMatrix<Scalar, ColMajor>(size,size)) ));
175 CALL_SUBTEST(( sparse_permutations<ColMajor>(SparseMatrix<Scalar, RowMajor>(size,size)) ));
176 CALL_SUBTEST(( sparse_permutations<RowMajor>(SparseMatrix<Scalar, ColMajor>(size,size)) ));
177 CALL_SUBTEST(( sparse_permutations<RowMajor>(SparseMatrix<Scalar, RowMajor>(size,size)) ))
[all...] |
| stable_norm.cpp | 36 typedef typename MatrixType::Scalar Scalar;
37 typedef typename NumTraits<Scalar>::Real RealScalar;
56 Scalar big = internal::random<Scalar>() * ((std::numeric_limits<RealScalar>::max)() * RealScalar(1e-4));
57 Scalar small = internal::random<Scalar>() * ((std::numeric_limits<RealScalar>::min)() * RealScalar(1e4));
|
| /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_basicstuff.cpp | 14 typedef typename MatrixType::Scalar Scalar;
15 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
26 identity = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>
28 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
33 Scalar x = ei_random<Scalar>();
52 if(NumTraits<Scalar>::HasFloatingPoint)
68 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
72 Matrix<Scalar, 1, MatrixType::RowsAtCompileTime> rv(rows)
[all...] |
| eigen2_nomalloc.cpp | 27 typedef typename MatrixType::Scalar Scalar;
28 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;
37 identity = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>
39 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>
45 Scalar s1 = ei_random<Scalar>();
|
| eigen2_regression.cpp | 18 typename VectorType::Scalar noiseAmplitude)
20 typedef typename VectorType::Scalar Scalar;
27 hyperplane->coeffs().coeffRef(j) = ei_random<Scalar>();
39 Scalar x = - (hyperplane->coeffs().start(size).cwise()*cur_point).sum();
54 typename VectorType::Scalar tolerance)
60 typename VectorType::Scalar error = (result - original).norm() / original.norm();
69 typename VectorType::Scalar tolerance)
75 typename VectorType::Scalar error = (result.coeffs() - original.coeffs()).norm() / original.coeffs().norm();
|
| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffJacobian.h | 38 typedef typename JacobianType::Scalar Scalar;
41 typedef Matrix<Scalar,InputsAtCompileTime,1> DerivativeType;
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| ConstrainedConjGrad.h | 54 typedef typename CMatrix::Scalar Scalar;
57 typedef Matrix<Scalar,Dynamic,1> TmpVec;
62 Scalar rho, rho_1, alpha;
110 typedef typename TMatrix::Scalar Scalar;
112 typedef Matrix<Scalar,Dynamic,1> TmpVec;
114 Scalar rho = 1.0, rho_1, lambda, gamma;
124 SparseMatrix<Scalar,RowMajor> CINV(C.rows(), C.cols());
138 Scalar al = C.row(i).dot(x) - f.coeff(i)
[all...] |
| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 43 typedef typename KnotVectorType::Scalar Scalar;
66 typedef typename KnotVectorType::Scalar Scalar;
80 chord_lengths(n-1) = Scalar(1);
120 typedef typename SplineType::KnotVectorType::Scalar Scalar;
124 typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;
|
| SplineFwd.h | 17 template <typename Scalar, int Dim, int Degree = Dynamic> class Spline;
28 typedef _Scalar Scalar; /*!< The spline curve's scalar type. */
36 typedef Array<Scalar,1,OrderAtCompileTime> BasisVectorType;
39 typedef Array<Scalar,Dynamic,Dynamic,RowMajor,NumOfDerivativesAtCompileTime,OrderAtCompileTime> BasisDerivativeType;
42 typedef Array<Scalar,Dimension,Dynamic,ColMajor,Dimension,NumOfDerivativesAtCompileTime> DerivativeType;
45 typedef Array<Scalar,Dimension,1> PointType;
48 typedef Array<Scalar,1,Dynamic> KnotVectorType;
51 typedef Array<Scalar,Dimension,Dynamic> ControlPointVectorType;
|
| /external/eigen/unsupported/doc/examples/ |
| BVH_Example.cpp | 17 typedef double Scalar;
|
| /external/eigen/unsupported/test/ |
| forward_adolc.cpp | 19 EIGEN_DONT_INLINE typename Vector::Scalar foo(const Vector& p)
21 typedef typename Vector::Scalar Scalar;
22 return (p-Vector(Scalar(-1),Scalar(1.))).norm() + (p.array().sqrt().abs() * p.array().sin()).sum() + p.dot(p);
28 typedef _Scalar Scalar;
33 typedef Matrix<Scalar,InputsAtCompileTime,1> InputType;
34 typedef Matrix<Scalar,ValuesAtCompileTime,1> ValueType;
35 typedef Matrix<Scalar,ValuesAtCompileTime,InputsAtCompileTime> JacobianType;
|
| /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...] |
| CwiseUnaryOp.h | 42 UnaryOp(typename XprType::Scalar)
43 >::type Scalar;
101 EIGEN_STRONG_INLINE const Scalar coeff(Index row, Index col) const
112 EIGEN_STRONG_INLINE const Scalar coeff(Index index) const
|
| CwiseUnaryView.h | 35 ViewOp(typename traits<MatrixType>::Scalar)
36 >::type Scalar;
48 * int(sizeof(typename traits<MatrixType>::Scalar) / sizeof(Scalar)),
104 return derived().nestedExpression().innerStride() * sizeof(typename internal::traits<MatrixType>::Scalar) / sizeof(Scalar);
122 EIGEN_STRONG_INLINE Scalar& coeffRef(Index row, Index col)
127 EIGEN_STRONG_INLINE Scalar& coeffRef(Index index)
|
