HomeSort by relevance Sort by last modified time
    Searched full:iscomplex (Results 101 - 125 of 212) sorted by null

1 2 3 45 6 7 8 9

  /prebuilts/go/linux-x86/src/go/types/
sizes.go 83 if isComplex(T) {
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixFunction.h 365 * \tparam IsComplex used internally to select correct specialization.
375 template <typename MatrixType, int IsComplex = NumTraits<typename internal::traits<MatrixType>::Scalar>::IsComplex>
  /external/icu/icu4c/source/layoutex/layout/
ParagraphLayout.h 433 static le_bool isComplex(const LEUnicode chars[], le_int32 count, const FontRuns *fontRuns);
447 static le_bool isComplex(const LEUnicode chars[], le_int32 count);
602 static le_bool isComplex(UScriptCode script);
  /external/lzma/CPP/7zip/Archive/7z/
7zOut.cpp 273 bool isComplex = !coder.IsSimpleCoder();
274 b |= (isComplex ? 0x10 : 0);
280 if (isComplex)
  /prebuilts/go/darwin-x86/src/text/template/parse/
node.go 525 IsComplex bool // Number is complex.
556 n.IsComplex = true
564 n.IsComplex = true
  /prebuilts/go/linux-x86/src/text/template/parse/
node.go 525 IsComplex bool // Number is complex.
556 n.IsComplex = true
564 n.IsComplex = true
  /external/llvm/include/llvm/Analysis/
TargetTransformInfo.h 584 /// The 'IsComplex' parameter is a hint that the address computation is likely
587 int getAddressComputationCost(Type *Ty, bool IsComplex = false) const;
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/
const.go 339 } else if isComplex[et] {
485 if !t.IsComplex() {
637 if isInt[wl] || isFloat[wl] || isComplex[wl] {
780 if isInt[wr] || isFloat[wr] || isComplex[wr] {
1381 } else if t.IsComplex() {
  /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/
const.go 339 } else if isComplex[et] {
485 if !t.IsComplex() {
637 if isInt[wl] || isFloat[wl] || isComplex[wl] {
780 if isInt[wr] || isFloat[wr] || isComplex[wr] {
1381 } else if t.IsComplex() {
  /external/eigen/Eigen/src/SVD/
JacobiSVD.h 20 bool IsComplex = NumTraits<typename MatrixType::Scalar>::IsComplex>
746 if(NumTraits<Scalar>::IsComplex && abs(numext::imag(m_workMatrix.coeff(i,i)))>considerAsZero)
    [all...]
  /external/icu/icu4c/source/layoutex/
ParagraphLayout.cpp 617 le_bool ParagraphLayout::isComplex(const LEUnicode chars[], le_int32 count)
625 if (isComplex(scriptCode)) {
975 le_bool ParagraphLayout::isComplex(UScriptCode script)
    [all...]
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
MINRES.h 248 && (!NumTraits<Scalar>::IsComplex)
  /external/skia/tools/debugger/
SkObjectParser.cpp 289 SkASSERT(rrect.isComplex());
  /frameworks/base/graphics/java/android/graphics/
Region.java 129 public native boolean isComplex();
  /frameworks/base/rs/java/android/renderscript/
Program.java 314 if (t.getElement().isComplex()) {
  /external/eigen/Eigen/src/Householder/
HouseholderSequence.h 134 typename internal::conditional<NumTraits<Scalar>::IsComplex,
137 typename internal::conditional<NumTraits<Scalar>::IsComplex,
  /external/llvm/lib/Target/AArch64/
AArch64TargetTransformInfo.cpp 420 int AArch64TTIImpl::getAddressComputationCost(Type *Ty, bool IsComplex) {
427 if (Ty->isVectorTy() && IsComplex)
  /external/llvm/lib/Target/ARM/
ARMTargetTransformInfo.cpp 322 int ARMTTIImpl::getAddressComputationCost(Type *Ty, bool IsComplex) {
329 if (Ty->isVectorTy() && IsComplex)
  /external/skia/src/utils/
SkDumpCanvas.cpp 48 } else if (rrect.isComplex()) {
120 if (rgn.isComplex()) {
  /external/eigen/Eigen/src/Core/
BandMatrix.h 94 Conjugate = ReturnOpposite && NumTraits<Scalar>::IsComplex,
MatrixBase.h 109 typedef typename internal::conditional<NumTraits<Scalar>::IsComplex,
  /external/eigen/Eigen/src/Core/functors/
BinaryFunctors.h 113 Conj = NumTraits<LhsScalar>::IsComplex
  /external/eigen/Eigen/src/Core/products/
TriangularMatrixMatrix.h 23 // conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj;
TriangularSolverMatrix.h 30 NumTraits<Scalar>::IsComplex && Conjugate,
  /external/eigen/Eigen/src/Eigenvalues/
GeneralizedEigenSolver.h 274 EIGEN_STATIC_ASSERT(!NumTraits<Scalar>::IsComplex, NUMERIC_TYPE_MUST_BE_REAL);

Completed in 2247 milliseconds

1 2 3 45 6 7 8 9