HomeSort by relevance Sort by last modified time
    Searched refs:IsComplex (Results 1 - 25 of 52) sorted by null

1 2 3

  /external/eigen/unsupported/test/
matrix_functions.h 13 template <typename MatrixType, int IsComplex = NumTraits<typename internal::traits<MatrixType>::Scalar>::IsComplex>
matrix_function.cpp 41 template <typename MatrixType, int IsComplex = NumTraits<typename internal::traits<MatrixType>::Scalar>::IsComplex>
matrix_power.cpp 12 template <typename MatrixType, int IsComplex = NumTraits<typename MatrixType::Scalar>::IsComplex>
  /external/eigen/Eigen/src/Core/
NumTraits.h 35 * \li An enum value \a IsComplex. It is equal to 1 if \a T is a \c std::complex
56 IsComplex = 0,
113 IsComplex = 1,
135 IsComplex = NumTraits<Scalar>::IsComplex,
MathFunctions.h 61 template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex>
95 template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex>
152 template<typename Scalar, bool IsComplex>
180 struct imag_ref_impl : imag_ref_default_impl<Scalar, NumTraits<Scalar>::IsComplex> {};
192 template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex>
250 template<typename Scalar, bool IsComplex>
272 struct norm1_impl : norm1_default_impl<Scalar, NumTraits<Scalar>::IsComplex> {};
    [all...]
  /external/eigen/Eigen/src/Eigenvalues/
MatrixBaseEigenvalues.h 18 template<typename Derived, bool IsComplex>
21 // this is the implementation for the case IsComplex = true
70 return internal::eigenvalues_selector<Derived, NumTraits<Scalar>::IsComplex>::run(derived());
Tridiagonalization.h 86 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
91 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
383 bool IsComplex=NumTraits<typename MatrixType::Scalar>::IsComplex>
436 template<typename MatrixType, int Size, bool IsComplex>
505 template<typename MatrixType, bool IsComplex>
506 struct tridiagonalization_inplace_selector<MatrixType,1,IsComplex>
ComplexSchur.h 20 template<typename MatrixType, bool IsComplex> struct complex_schur_reduce_to_hessenberg;
257 friend struct internal::complex_schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>;
331 internal::complex_schur_reduce_to_hessenberg<MatrixType, NumTraits<Scalar>::IsComplex>::run(*this, matrix, computeU);
349 template<typename MatrixType, bool IsComplex>
352 // this is the implementation for the case IsComplex = true
SelfAdjointEigenSolver.h 22 template<typename SolverType,int Size,bool IsComplex> struct direct_selfadjoint_eigenvalues;
92 friend struct internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>;
482 template<typename SolverType,int Size,bool IsComplex> struct direct_selfadjoint_eigenvalues
734 internal::direct_selfadjoint_eigenvalues<SelfAdjointEigenSolver,Size,NumTraits<Scalar>::IsComplex>::run(*this,matrix,options);
  /external/eigen/test/
prec_inverse_4x4.cpp 54 VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.0 : 1.25));
55 VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 64.0 : 20.0));
  /external/eigen/Eigen/src/plugins/
CommonCwiseUnaryOps.h 20 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
25 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
30 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
  /external/eigen/blas/
common.h 92 IsComplex = Eigen::NumTraits<SCALAR>::IsComplex,
93 Conj = IsComplex
  /external/eigen/test/eigen2/
eigen2_prec_inverse_4x4.cpp 70 VERIFY(error_avg < (NumTraits<Scalar>::IsComplex ? 8.0 : 1.25));
71 VERIFY(error_max < (NumTraits<Scalar>::IsComplex ? 64.0 : 20.0));
eigen2_sparse_solvers.cpp 85 if (!NumTraits<Scalar>::IsComplex)
96 if (!NumTraits<Scalar>::IsComplex)
113 if (!NumTraits<Scalar>::IsComplex)
gsl_helper.h 24 template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex> struct GslTraits
  /external/eigen/Eigen/src/Core/products/
SelfadjointProduct.h 77 OtherBlasTraits::NeedToConjugate && NumTraits<Scalar>::IsComplex,
78 (!OtherBlasTraits::NeedToConjugate) && NumTraits<Scalar>::IsComplex>
100 Scalar, _ActualOtherType::Flags&RowMajorBit ? RowMajor : ColMajor, OtherBlasTraits::NeedToConjugate && NumTraits<Scalar>::IsComplex,
101 Scalar, _ActualOtherType::Flags&RowMajorBit ? ColMajor : RowMajor, (!OtherBlasTraits::NeedToConjugate) && NumTraits<Scalar>::IsComplex,
SelfadjointMatrixVector.h 55 conj_helper<Scalar,Scalar,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, IsRowMajor), ConjugateRhs> cj0;
56 conj_helper<Scalar,Scalar,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> cj1;
57 conj_helper<Scalar,Scalar,NumTraits<Scalar>::IsComplex, ConjugateRhs> cjd;
59 conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, IsRowMajor), ConjugateRhs> pcj0;
60 conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> pcj1;
SelfadjointMatrixMatrix.h 218 RhsSelfAdjoint, NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(RhsSelfAdjoint,ConjugateRhs),
220 LhsSelfAdjoint, NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(LhsSelfAdjoint,ConjugateLhs),
419 NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(LhsIsUpper,bool(LhsBlasTraits::NeedToConjugate)),
422 NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(RhsIsUpper,bool(RhsBlasTraits::NeedToConjugate)),
  /external/eigen/Eigen/src/Core/util/
BlasUtil.h 157 IsComplex = NumTraits<Scalar>::IsComplex,
183 IsComplex = NumTraits<Scalar>::IsComplex,
184 NeedToConjugate = Base::NeedToConjugate ? 0 : IsComplex
  /external/eigen/bench/
bench_gemm.cpp 227 if((NumTraits<A::Scalar>::IsComplex) && (NumTraits<B::Scalar>::IsComplex))
241 if((!NumTraits<A::Scalar>::IsComplex) && (NumTraits<B::Scalar>::IsComplex))
254 if((NumTraits<A::Scalar>::IsComplex) && (!NumTraits<B::Scalar>::IsComplex))
benchFFT.cpp 81 if ( NumTraits<T>::IsComplex ) {
  /external/eigen/Eigen/src/Geometry/
Umeyama.h 102 EIGEN_STATIC_ASSERT(!NumTraits<Scalar>::IsComplex, NUMERIC_TYPE_MUST_BE_REAL)
  /external/llvm/include/llvm/Analysis/
TargetTransformInfo.h 413 /// The 'IsComplex' parameter is a hint that the address computation is likely
417 bool IsComplex = false) const;
  /external/eigen/Eigen/src/Jacobi/
Jacobi.h 150 makeGivens(p, q, z, typename internal::conditional<NumTraits<Scalar>::IsComplex, internal::true_type, internal::false_type>::type());
334 conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex,false> pcj;
400 conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex,false> pcj;
  /external/llvm/lib/Target/AArch64/
AArch64TargetTransformInfo.cpp 120 unsigned getAddressComputationCost(Type *Ty, bool IsComplex) const override;
426 unsigned AArch64TTI::getAddressComputationCost(Type *Ty, bool IsComplex) const {
433 if (Ty->isVectorTy() && IsComplex)

Completed in 1781 milliseconds

1 2 3