HomeSort by relevance Sort by last modified time
    Searched full:complex (Results 326 - 350 of 3705) sorted by null

<<11121314151617181920>>

  /external/libcxx/test/numerics/complex.number/complex.transcendentals/
asin.pass.cpp 10 // <complex>
13 // complex<T>
14 // asin(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = asin(x[i])
    [all...]
asinh.pass.cpp 10 // <complex>
13 // complex<T>
14 // asinh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = asinh(x[i])
    [all...]
atanh.pass.cpp 10 // <complex>
13 // complex<T>
14 // atanh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = atanh(x[i])
    [all...]
cosh.pass.cpp 10 // <complex>
13 // complex<T>
14 // cosh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(1, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = cosh(x[i])
    [all...]
sinh.pass.cpp 10 // <complex>
13 // complex<T>
14 // sinh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = sinh(x[i])
    [all...]
sqrt.pass.cpp 10 // <complex>
13 // complex<T>
14 // sqrt(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
25 std::complex<T> a = sqrt(c);
34 test(std::complex<T>(64, 0), std::complex<T>(8, 0));
42 std::complex<double> r = sqrt(x[i])
    [all...]
tanh.pass.cpp 10 // <complex>
13 // complex<T>
14 // tanh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = tanh(x[i])
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/complex.number/complex.transcendentals/
acosh.pass.cpp 10 // <complex>
13 // complex<T>
14 // acosh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(INFINITY, 1), std::complex<T>(INFINITY, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = acosh(x[i])
    [all...]
asin.pass.cpp 10 // <complex>
13 // complex<T>
14 // asin(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = asin(x[i])
    [all...]
asinh.pass.cpp 10 // <complex>
13 // complex<T>
14 // asinh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = asinh(x[i])
    [all...]
atanh.pass.cpp 10 // <complex>
13 // complex<T>
14 // atanh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = atanh(x[i])
    [all...]
cosh.pass.cpp 10 // <complex>
13 // complex<T>
14 // cosh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(1, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = cosh(x[i])
    [all...]
sinh.pass.cpp 10 // <complex>
13 // complex<T>
14 // sinh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = sinh(x[i])
    [all...]
sqrt.pass.cpp 10 // <complex>
13 // complex<T>
14 // sqrt(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
25 std::complex<T> a = sqrt(c);
34 test(std::complex<T>(64, 0), std::complex<T>(8, 0));
42 std::complex<double> r = sqrt(x[i])
    [all...]
tanh.pass.cpp 10 // <complex>
13 // complex<T>
14 // tanh(const complex<T>& x);
16 #include <complex>
23 test(const std::complex<T>& c, std::complex<T> x)
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
37 typedef std::complex<double> C;
42 std::complex<double> r = tanh(x[i])
    [all...]
  /external/eigen/lapack/
clarf.f 26 * COMPLEX TAU
29 * COMPLEX C( LDC, * ), V( * ), WORK( * )
38 *> CLARF applies a complex elementary reflector H to a complex M-by-N
44 *> where tau is a complex scalar and v is a complex vector.
76 *> V is COMPLEX array, dimension
91 *> TAU is COMPLEX
97 *> C is COMPLEX array, dimension (LDC,N)
111 *> WORK is COMPLEX array, dimensio
    [all...]
zlarf.f 26 * COMPLEX*16 TAU
29 * COMPLEX*16 C( LDC, * ), V( * ), WORK( * )
38 *> ZLARF applies a complex elementary reflector H to a complex M-by-N
44 *> where tau is a complex scalar and v is a complex vector.
76 *> V is COMPLEX*16 array, dimension
91 *> TAU is COMPLEX*16
97 *> C is COMPLEX*16 array, dimension (LDC,N)
111 *> WORK is COMPLEX*16 array, dimensio
    [all...]
  /external/eigen/unsupported/Eigen/src/SparseExtra/
MarketIO.h 34 inline bool GetMarketLine (std::stringstream& line, int& M, int& N, int& i, int& j, std::complex<Scalar>& value)
42 value = std::complex<Scalar>(valR, valI);
57 inline void GetVectorElt (const std::string& line, std::complex<RealScalar>& val)
62 val = std::complex<RealScalar>(valR, valI);
69 if(internal::is_same<Scalar, std::complex<float> >::value || internal::is_same<Scalar, std::complex<double> >::value)
71 header += " complex";
90 inline void PutMatrixElt(std::complex<Scalar> value, int row, int col, std::ofstream& out)
102 inline void putVectorElt(std::complex<Scalar> value, std::ofstream& out)
125 if(substr[3].compare("complex") == 0) iscomplex = true
    [all...]
  /external/clang/include/clang/Basic/
Builtins.def 290 // C99 complex builtins
    [all...]
  /bionic/libm/upstream-freebsd/lib/msun/src/
s_ccoshf.c 28 * Hyperbolic cosine of a complex argument. See s_ccosh.c for details.
34 #include <complex.h>
41 float complex
42 ccoshf(float complex z)
99 float complex
100 ccosf(float complex z)
s_csinhf.c 28 * Hyperbolic sine of a complex argument z. See s_csinh.c for details.
34 #include <complex.h>
41 float complex
42 csinhf(float complex z)
99 float complex
100 csinf(float complex z)
  /external/chromium_org/third_party/icu/source/i18n/
strrepl.h 31 * stand-ins is called a <em>complex</em> StringReplacer. A complex
32 * StringReplacer has a slower processing loop than a non-complex one.
56 * A complex object contains nested replacers and requires more
57 * complex processing. StringReplacers are initially assumed to
58 * be complex. If no nested replacers are seen during processing,
  /external/eigen/test/eigen2/
eigen2_prec_inverse_4x4.cpp 18 template<> std::string type_name<std::complex<float> >() { return "complex<float>"; }
19 template<> std::string type_name<std::complex<double> >() { return "complex<double>"; }
20 template<> std::string type_name<std::complex<int> >() { return "complex<int>"; }
  /external/eigen/test/
eigensolver_generic.cpp 27 typedef typename std::complex<typename NumTraits<typename MatrixType::Scalar>::Real> Complex;
36 VERIFY_IS_APPROX((symmA.template cast<Complex>()) * (ei0.pseudoEigenvectors().template cast<Complex>()),
37 (ei0.pseudoEigenvectors().template cast<Complex>()) * (ei0.eigenvalues().asDiagonal()));
42 VERIFY_IS_APPROX(a.template cast<Complex>() * ei1.eigenvectors(),
  /external/icu/icu4c/source/i18n/
strrepl.h 31 * stand-ins is called a <em>complex</em> StringReplacer. A complex
32 * StringReplacer has a slower processing loop than a non-complex one.
56 * A complex object contains nested replacers and requires more
57 * complex processing. StringReplacers are initially assumed to
58 * be complex. If no nested replacers are seen during processing,

Completed in 1308 milliseconds

<<11121314151617181920>>