/external/tensorflow/tensorflow/core/kernels/ |
cwise_op_gpu_conj.cu.cc | 22 DEFINE_UNARY1(conj, complex64); 23 DEFINE_UNARY1(conj, complex128);
|
cwise_op_conj.cc | 21 REGISTER2(UnaryOp, CPU, "Conj", functor::conj, complex64, complex128); 23 REGISTER_VARIANT(UnaryVariantOp, CPU, "Conj", CONJ_VARIANT_UNARY_OP); 27 Name("Conj").Device(DEVICE_GPU).TypeConstraint<Variant>("T"), 30 Name("Conj").Device(DEVICE_GPU).TypeConstraint<complex64>("T"), 31 UnaryOp<GPUDevice, functor::conj<complex64>>); 33 Name("Conj").Device(DEVICE_GPU).TypeConstraint<complex128>("T"), 34 UnaryOp<GPUDevice, functor::conj<complex128>>);
|
self_adjoint_eig_v2_op_gpu.cc | 110 functor::UnaryFunctor<GPUDevice, functor::conj<Scalar>> conj; variable 111 conj(device, input_copy.flat<Scalar>() /*out*/, 119 functor::UnaryFunctor<GPUDevice, functor::conj<Scalar>> conj; variable 120 conj(device, const_cast<Tensor*>(&input)->flat<Scalar>() /*out*/,
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
s_conj.c | 34 conj(double complex z) function
|
/external/libcxx/test/std/numerics/complex.number/cmplx.over/ |
conj.pass.cpp | 12 // template<class T> complex<T> conj(const complex<T>&); 13 // complex<long double> conj(long double); 14 // complex<double> conj(double); 15 // template<Integral T> complex<double> conj(T); 16 // complex<float> conj(float); 28 static_assert((std::is_same<decltype(std::conj(x)), std::complex<double> >::value), ""); 29 assert(std::conj(x) == conj(std::complex<double>(x, 0))); 36 static_assert((std::is_same<decltype(std::conj(x)), std::complex<T> >::value), ""); 37 assert(std::conj(x) == conj(std::complex<T>(x, 0))) [all...] |
UDT_is_rejected.fail.cpp | 61 std::conj(ft); // expected-error {{no matching function}} 62 std::conj(dt); // expected-error {{no matching function}} 63 std::conj(ldt); // expected-error {{no matching function}} 64 std::conj(it); // expected-error {{no matching function}} 65 std::conj(uit); // expected-error {{no matching function}}
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/complex.number/cmplx.over/ |
conj.pass.cpp | 12 // template<class T> complex<T> conj(const complex<T>&); 13 // complex<long double> conj(long double); 14 // complex<double> conj(double); 15 // template<Integral T> complex<double> conj(T); 16 // complex<float> conj(float); 28 static_assert((std::is_same<decltype(std::conj(x)), std::complex<double> >::value), ""); 29 assert(std::conj(x) == conj(std::complex<double>(x, 0))); 36 static_assert((std::is_same<decltype(std::conj(x)), std::complex<T> >::value), ""); 37 assert(std::conj(x) == conj(std::complex<T>(x, 0))) [all...] |
UDT_is_rejected.fail.cpp | 61 std::conj(ft); // expected-error {{no matching function}} 62 std::conj(dt); // expected-error {{no matching function}} 63 std::conj(ldt); // expected-error {{no matching function}} 64 std::conj(it); // expected-error {{no matching function}} 65 std::conj(uit); // expected-error {{no matching function}}
|
/external/eigen/blas/ |
Rank2Update.h | 15 /* Optimized selfadjoint matrix += alpha * uv' + conj(alpha)*vu' 27 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) 28 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)); 33 /* Optimized selfadjoint matrix += alpha * uv' + conj(alpha)*vu' 46 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) 47 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1));
|
/external/eigen/Eigen/src/Core/products/ |
SelfadjointRank2Update.h | 17 /* Optimized selfadjoint matrix += alpha * uv' + conj(alpha)*vu' 33 (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i) 34 + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i); 47 (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.head(i+1) 48 + (alpha * numext::conj(v.coeff(i))) * u.head(i+1); 78 * numext::conj(VBlasTraits::extractScalarFactor(v.derived())); 80 actualAlpha = numext::conj(actualAlpha);
|
SelfadjointMatrixMatrix.h | 33 blockA[count++] = numext::conj(lhs(k, i+w)); // transposed 44 blockA[count++] = numext::conj(lhs(k, i+w)); // transposed 78 blockA[count++] = numext::conj(lhs(k, i)); // transposed 128 blockB[count+0] = numext::conj(rhs(j2+0,k)); 129 blockB[count+1] = numext::conj(rhs(j2+1,k)); 130 blockB[count+2] = numext::conj(rhs(j2+2,k)); 131 blockB[count+3] = numext::conj(rhs(j2+3,k)); 132 blockB[count+4] = numext::conj(rhs(j2+4,k)); 133 blockB[count+5] = numext::conj(rhs(j2+5,k)); 134 blockB[count+6] = numext::conj(rhs(j2+6,k)) [all...] |
/external/eigen/Eigen/src/Geometry/ |
OrthoMethods.h | 44 numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)), 45 numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)), 46 numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0)) 60 numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)), 61 numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)), 62 numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0)), 156 perp.coeffRef(maxi) = -numext::conj(src.coeff(sndi)) * invnm; 157 perp.coeffRef(sndi) = numext::conj(src.coeff(maxi)) * invnm; 184 perp.coeffRef(0) = -numext::conj(src.y())*invnm; 185 perp.coeffRef(1) = numext::conj(src.x())*invnm [all...] |
/external/eigen/test/ |
jacobi.cpp | 43 VERIFY_IS_APPROX(b.row(p), c * a.row(p) + numext::conj(s) * a.row(q)); 44 VERIFY_IS_APPROX(b.row(q), -s * a.row(p) + numext::conj(c) * a.row(q)); 57 VERIFY_IS_APPROX(b.col(q), numext::conj(s) * a.col(p) + numext::conj(c) * a.col(q));
|
adjoint.cpp | 19 VERIFY(test_isApproxWithRef((s1 * v1 + s2 * v2).dot(v3), numext::conj(s1) * v1.dot(v3) + numext::conj(s2) * v2.dot(v3), 0)); 34 VERIFY(test_isApproxWithRef((s1 * v1 + s2 * v2).dot(v3), numext::conj(s1) * v1.dot(v3) + numext::conj(s2) * v2.dot(v3), ref)); 101 VERIFY_IS_APPROX((s1 * m1).adjoint(), numext::conj(s1) * m1.adjoint()); 104 VERIFY_IS_APPROX(numext::conj(v1.dot(v2)), v2.dot(v1)); 114 VERIFY_IS_APPROX(m1.conjugate()(r,c), numext::conj(m1(r,c))); 115 VERIFY_IS_APPROX(m1.adjoint()(c,r), numext::conj(m1(r,c)));
|
/external/libcxx/test/std/numerics/complex.number/complex.value.ops/ |
conj.pass.cpp | 14 // conj(const complex<T>& x); 23 assert(conj(z) == x);
|
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/complex.number/complex.value.ops/ |
conj.pass.cpp | 14 // conj(const complex<T>& x); 23 assert(conj(z) == x);
|
/external/eigen/Eigen/src/Jacobi/ |
Jacobi.h | 53 using numext::conj; 54 return JacobiRotation(m_c * other.m_c - conj(m_s) * other.m_s, 55 conj(m_c * conj(other.m_s) + conj(m_s) * conj(other.m_c))); 59 JacobiRotation transpose() const { using numext::conj; return JacobiRotation(m_c, -conj(m_s)); } 62 JacobiRotation adjoint() const { using numext::conj; return JacobiRotation(conj(m_c), -m_s); [all...] |
/external/tensorflow/tensorflow/python/ops/ |
math_grad.py | 400 # op.output[0]: y = -b * conj(a)^2 402 ca = math_ops.conj(op.inputs[0]) 403 cg = math_ops.conj(grad) 411 # op.output[0]: y = -b * conj(a)^2 413 ca = math_ops.conj(op.inputs[0]) 414 cg = math_ops.conj(grad) 424 x = math_ops.conj(x) 439 y = op.outputs[0] # y = 0.5 * b / conj(a) 442 return -math_ops.conj(ga) * y, 0.5 * ga 447 """Returns -0.5 * grad * conj(y)^3."" [all...] |
/external/webrtc/webrtc/modules/audio_processing/beamformer/ |
complex_matrix.h | 41 data[i] = conj(data[i]); 87 elements[i][j] = conj(src[j][i]);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/bits/ |
cmathcalls.h | 117 __MATHCALL (conj, (_Mdouble_complex_ __z)); 154 __MATH_PRECNAME(conj) (_Mdouble_complex_ __z) __THROW
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/bits/ |
cmathcalls.h | 117 __MATHCALL (conj, (_Mdouble_complex_ __z)); 154 __MATH_PRECNAME(conj) (_Mdouble_complex_ __z) __THROW
|
/external/webrtc/webrtc/modules/audio_processing/intelligibility/ |
intelligibility_utils.cc | 121 (old_sum + std::conj(sample - old_mean) * (sample - running_mean_[i])) 141 running_mean_sq_[i] = sample * std::conj(sample); 148 decay_ * prev2 + (1.0f - decay_) * sample * std::conj(sample); 150 running_mean_[i] * std::conj(running_mean_[i])).real(); 179 (old_sum + std::conj(sample - old_mean) * (sample - mean)).real(); 197 AddToMean(data[i] * std::conj(data[i]), count_ + 1, 205 std::conj(NewMean(running_mean_[i], sub_running_mean_[i], blocks))) 233 sub_running_mean_sq_[i] += data[i] * std::conj(data[i]); 259 std::conj(running_mean_[i]) * scale);
|
/external/eigen/Eigen/src/SparseCholesky/ |
SimplicialCholesky_impl.h | 134 y[i] += numext::conj(it.value()); /* scatter A(i,k) into Y (sum duplicates) */ 166 y[Li[p]] -= numext::conj(Lx[p]) * yi; 167 d -= numext::real(l_ki * numext::conj(yi));
|
/external/eigen/Eigen/src/Householder/ |
Householder.h | 71 using numext::conj; 92 tau = conj((beta - c0) / beta);
|
/external/eigen/Eigen/src/SparseCore/ |
SparseDot.h | 34 res += numext::conj(i.value()) * other.coeff(i.index()); 64 res += numext::conj(i.value()) * j.value();
|