/external/eigen/test/ |
sizeof.cpp | 14 typedef typename MatrixType::Scalar Scalar; 16 VERIFY_IS_EQUAL(std::ptrdiff_t(sizeof(MatrixType)),std::ptrdiff_t(sizeof(Scalar))*std::ptrdiff_t(MatrixType::SizeAtCompileTime)); 18 VERIFY_IS_EQUAL(sizeof(MatrixType),sizeof(Scalar*) + 2 * sizeof(typename MatrixType::Index));
|
determinant.cpp | 25 typedef typename MatrixType::Scalar Scalar; 26 Scalar x = internal::random<Scalar>(); 27 VERIFY_IS_APPROX(MatrixType::Identity(size, size).determinant(), Scalar(1)); 51 VERIFY_IS_APPROX(m2.block(0,0,0,0).determinant(), Scalar(1));
|
eigen2support.cpp | 17 typedef typename MatrixType::Scalar Scalar; 25 Scalar s1 = internal::random<Scalar>(), 26 s2 = internal::random<Scalar>(); 28 // scalar addition 31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
|
rvalue_types.cpp | 21 typedef typename internal::traits<MatrixType>::Scalar Scalar; 38 Scalar abs_diff = (m-n).array().abs().sum(); 39 VERIFY_IS_EQUAL(abs_diff, Scalar(0));
|
svd_fill.h | 24 typedef typename MatrixType::Scalar Scalar; 45 Matrix<Scalar,Dynamic,Dynamic> U(m.rows(),diagSize); 46 Matrix<Scalar,Dynamic,Dynamic> VT(diagSize,m.cols()); 67 Matrix<Scalar,Dynamic,1> samples(9); 95 if(NumTraits<Scalar>::IsComplex) 113 if(NumTraits<Scalar>::IsComplex)
|
zerosized.cpp | 28 typedef typename MatrixType::Scalar Scalar; 59 Matrix<Scalar,Dynamic,Dynamic> prod = m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0) * m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols);
|
bandmatrix.cpp | 14 typedef typename MatrixType::Scalar Scalar; 15 typedef typename NumTraits<Scalar>::Real RealScalar; 16 typedef Matrix<Scalar,Dynamic,Dynamic> DenseMatrixType;
|
diagonal.cpp | 15 typedef typename MatrixType::Scalar Scalar; 23 Scalar s1 = internal::random<Scalar>(); 45 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); 47 VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>()[0]); 52 VERIFY_IS_APPROX(m2.template diagonal<N2>()[0], static_cast<Scalar>(6) * m1.template diagonal<N2>()[0]); 55 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); 57 VERIFY_IS_APPROX(m2.diagonal(N1)[0], static_cast<Scalar>(6) * m1.diagonal(N1)[0]); 60 VERIFY_IS_APPROX(m2.template diagonal<N2>(), static_cast<Scalar>(2) * m1.diagonal(N2)) [all...] |
dontalign.cpp | 23 typedef typename MatrixType::Scalar Scalar; 24 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType; 25 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType; 40 VERIFY(square.determinant() != Scalar(0)); 43 Scalar* array = internal::aligned_new<Scalar>(rows);
|
inplace_decomposition.cpp | 19 typedef typename MatrixType::Scalar Scalar; 20 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> RhsType; 21 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> ResType;
|
inverse.cpp | 24 typedef typename MatrixType::Scalar Scalar; 33 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5)); 44 typedef typename NumTraits<Scalar>::Real RealScalar; 45 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> VectorType; 74 Matrix<Scalar, MatrixType::RowsAtCompileTime+1, MatrixType::RowsAtCompileTime+1, MatrixType::Options> m5;
|
miscmatrices.cpp | 18 typedef typename MatrixType::Scalar Scalar; 19 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType; 24 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1)); 26 VERIFY_IS_APPROX(m1(r,c), static_cast<Scalar>(1)); 29 Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> 32 else VERIFY_IS_MUCH_SMALLER_THAN(square(r,r2), static_cast<Scalar>(1));
|
nesting_ops.cpp | 50 typedef typename MatrixType::Scalar Scalar; 54 Matrix<Scalar,MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime,ColMajor> m2; 64 VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col(0))), 2 ); // FIXME could be one by applying the scaling in-place on the solve result 71 if(!NumTraits<Scalar>::IsComplex)
|
prec_inverse_4x4.cpp | 16 typedef typename MatrixType::Scalar Scalar; 22 double error = double( (m*inv-MatrixType::Identity()).norm() / NumTraits<Scalar>::epsilon() ); 32 typedef typename MatrixType::Scalar Scalar; 42 } while(absdet < NumTraits<Scalar>::epsilon()); 44 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / NumTraits<Scalar>::epsilon() ); 48 std::cerr << "inverse_general_4x4, Scalar = " << type_name<Scalar>() << std::endl; 54 VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.0 : 1.25)) [all...] |
product_trmv.cpp | 15 typedef typename MatrixType::Scalar Scalar; 16 typedef typename NumTraits<Scalar>::Real RealScalar; 17 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType; 28 Scalar s1 = internal::random<Scalar>(); 42 // check conjugated and scalar multiple expressions (col-major) 58 // check conjugated and scalar multiple expressions (row-major)
|
real_qz.cpp | 22 typedef typename MatrixType::Scalar Scalar; 56 if (abs(qz.matrixT()(i,j))!=Scalar(0.0)) 61 if (j<i-1 && abs(qz.matrixS()(i,j))!=Scalar(0.0)) 66 if (j==i-1 && j>0 && abs(qz.matrixS()(i,j))!=Scalar(0.0) && abs(qz.matrixS()(i-1,j-1))!=Scalar(0.0))
|
/external/eigen/Eigen/src/Core/ |
CommaInitializer.h | 30 typedef typename XprType::Scalar Scalar; 33 inline CommaInitializer(XprType& xpr, const Scalar& s) 59 /* inserts a scalar value in the target matrix */ 61 CommaInitializer& operator,(const Scalar& s) 144 inline CommaInitializer<Derived> DenseBase<Derived>::operator<< (const Scalar& s) 149 /** \sa operator<<(const Scalar&) */
|
NoAlias.h | 34 typedef typename ExpressionType::Scalar Scalar; 42 call_assignment_no_alias(m_expression, other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>()); 50 call_assignment_no_alias(m_expression, other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>()); 58 call_assignment_no_alias(m_expression, other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>());
|
Swap.h | 19 class generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, swap_assign_op<typename DstEvaluatorTypeT::Scalar>, Specialized> 20 : public generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, swap_assign_op<typename DstEvaluatorTypeT::Scalar>, BuiltIn> 23 typedef generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, swap_assign_op<typename DstEvaluatorTypeT::Scalar>, BuiltIn> Base; 29 typedef typename Base::Scalar Scalar; 31 typedef swap_assign_op<Scalar> Functor;
|
/external/eigen/Eigen/src/Eigenvalues/ |
MatrixBaseEigenvalues.h | 69 typedef typename internal::traits<Derived>::Scalar Scalar; 70 return internal::eigenvalues_selector<Derived, NumTraits<Scalar>::IsComplex>::run(derived());
|
/external/gemmlowp/internal/ |
iterator.h | 36 typedef tScalar Scalar; 39 const Scalar operator*() const { return *pointer_; } 40 const Scalar* get() const { return pointer_; } 43 const Scalar* pointer_; 57 typedef tScalar Scalar; 60 const Scalar operator*() const { return data_; } 61 const Scalar* get() const { return &data_; } 64 Scalar data_;
|
/external/eigen/Eigen/src/Geometry/ |
Scaling.h | 21 * \tparam _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...] |
/external/eigen/Eigen/src/SparseCore/ |
MappedSparseMatrix.h | 20 * \param _Scalar the scalar type, i.e. the type of the coefficients 40 typedef typename Base::Scalar Scalar; 42 inline MappedSparseMatrix(Index rows, Index cols, Index nnz, StorageIndex* outerIndexPtr, StorageIndex* innerIndexPtr, Scalar* valuePtr, StorageIndex* innerNonZeroPtr = 0)
|
/external/eigen/bench/ |
benchFFT.cpp | 46 typedef typename NumTraits<T>::Real Scalar; 47 typedef typename std::complex<Scalar> Complex; 51 FFT< Scalar > fft; 79 cout << nameof<Scalar>() << " ";
|
/external/eigen/bench/perf_monitoring/gemm/ |
gemm.cpp | 8 #ifndef SCALAR 9 #error SCALAR must be defined 12 typedef SCALAR Scalar; 14 typedef Matrix<Scalar,Dynamic,Dynamic> Mat; 34 double up = 1e8*4/sizeof(Scalar); 36 if(NumTraits<Scalar>::IsComplex)
|