Searched refs:n0 (Results 1 - 25 of 98) sorted by relevance

1234

/external/libcxx/test/std/thread/thread.mutex/thread.lock/thread.lock.scoped/
H A Dmutex.fail.cpp29 M n0, n1, n2; local
39 test_conversion<LG>({n0}); // expected-error{{no matching function for call}}
45 test_conversion<LG>({n0, n1}); // expected-error{{no matching function for call}}
51 test_conversion<LG>({n0, n1, n2}); // expected-error{{no matching function for call}}
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/
H A DFourthMoment.java97 double n0 = n;
100 ((n0 * n0) - 3 * (n0 -1)) * (nDevSq * nDevSq * (n0 - 1) * n0);
H A DKurtosis.java185 double n0 = length;
188 (n0 * (n0 + 1)) / ((n0 - 1) * (n0 - 2) * (n0 - 3));
190 (3 * FastMath.pow(n0 - 1, 2.0)) / ((n0 - 2) * (n0 - 3));
H A DSkewness.java111 double n0 = moment.getN();
112 return (n0 * moment.m3) /
113 ((n0 - 1) * (n0 -2) * FastMath.sqrt(variance) * variance);
182 double n0 = length;
185 skew = (n0 / ((n0 - 1) * (n0 - 2))) * accum3;
H A DThirdMoment.java93 double n0 = n;
94 m3 = m3 - 3.0 * nDev * prevM2 + (n0 - 1) * (n0 - 2) * nDevSq * dev;
H A DFirstMoment.java103 double n0 = n;
105 nDev = dev / n0;
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_fftw_impl.h82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
83 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) { argument
88 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
125 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) { argument
130 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) { argument
166 if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n
170 inv2( complex_type * dst,complex_type * src,int n0,int n1) argument
204 fwd2(Complex * dst, const Complex * src, int n0,int n1) argument
206 get_plan(n0,n1,false,dst,src).fwd2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
225 inv2(Complex * dst, const Complex * src, int n0,int n1) argument
227 get_plan(n0,n1,true,dst,src).inv2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
248 get_plan(int n0,int n1,bool inverse,void * dst,const void * src) argument
[all...]
/external/eigen/test/
H A Dsparse_block.cpp192 Index n0 = internal::random<Index>(1,outer-(std::max)(j0,j1)); local
194 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols));
196 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0));
198 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0),
199 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0));
201 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)
224 Index n0 = internal::random<Index>(1,outer-(std::max)(j0,j1)); local
[all...]
H A Dnullary.cpp158 Index n0 = VectorType::SizeAtCompileTime==Dynamic ? 0 : VectorType::SizeAtCompileTime; local
160 m = VectorType::LinSpaced(n0,low,low-1);
161 VERIFY(m.size()==n0);
165 VERIFY_IS_EQUAL(VectorType::LinSpaced(n0,0,Scalar(n0-1)).sum(),Scalar(0));
166 VERIFY_IS_EQUAL(VectorType::LinSpaced(n0,low,low-1).sum(),Scalar(0));
169 m.setLinSpaced(n0,0,Scalar(n0-1));
170 VERIFY(m.size()==n0);
171 m.setLinSpaced(n0,lo
[all...]
/external/boringssl/src/crypto/fipsmodule/ec/
H A Dsimple.c310 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
335 n0 = BN_CTX_get(ctx);
360 if (!field_sqr(group, n0, &b->Z, ctx) ||
361 !field_mul(group, n1, &a->X, n0, ctx)) {
366 if (!field_mul(group, n0, n0, &b->Z, ctx) ||
367 !field_mul(group, n2, &a->Y, n0, ctx)) {
382 if (!field_sqr(group, n0, &a->Z, ctx) ||
383 !field_mul(group, n3, &b->X, n0, ctx)) {
388 if (!field_mul(group, n0, n
502 BIGNUM *n0, *n1, *n2, *n3; local
[all...]
/external/brotli/java/org/brotli/dec/
H A DDictionaryData.java23 int n0 = data0.length();
25 if (n0 + n1 != dictionary.capacity()) {
29 for (int i = 0; i < n0; ++i) {
/external/libunwind/tests/
H A DGia64-test-stack.c58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; local
83 n0 = n1 = n2 = n3 = 0;
86 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg, &n0)) < 0
98 n0 ? '*' : ' ', v0, n1 ? '*' : ' ', v1,
134 || (ret = unw_get_reg (&c, UNW_IA64_NAT + 33 + l, &n0)) < 0)
139 if (!n0)
144 if (n0)
/external/libvpx/libvpx/vpx_dsp/
H A Dprob.h58 static INLINE vpx_prob get_binary_prob(unsigned int n0, unsigned int n1) { argument
59 const unsigned int den = n0 + n1;
61 return get_prob(n0, den);
/external/tensorflow/tensorflow/python/debug/examples/
H A Ddebug_fibonacci.py36 n0 = tf.Variable(
42 n0, n1 = n1, tf.add(n0, n1, name="node_%.2d" % i)
/external/tremolo/Tremolo/
H A Dmdct.h59 extern void mdct_unroll_lap(int n0,int n1,
/external/syslinux/core/lwip/src/netif/ppp/
H A Dvj.c470 struct pbuf *n0 = *nb; local
475 cp = (u_char *)n0->payload;
560 vjlen = (u_short)(cp - (u_char*)n0->payload);
561 if (n0->len < vjlen) {
567 n0->len, vjlen));
572 tmp = n0->tot_len - vjlen + cs->cs_hlen;
575 IPH_LEN_SET(&cs->cs_ip, htons(n0->tot_len - vjlen + cs->cs_hlen));
589 if(pbuf_header(n0, -((s16_t)(vjlen)))) {
595 if(LWIP_MEM_ALIGN(n0->payload) != n0
[all...]
/external/boringssl/src/crypto/fipsmodule/bn/
H A Dmontgomery.c163 to->n0[0] = from->n0[0];
164 to->n0[1] = from->n0[1];
197 // Find n0 such that n0 * N == -1 (mod r).
199 // Only certain BN_BITS2<=32 platforms actually make use of n0[1]. For the
203 uint64_t n0 = bn_mont_n0(&mont->N); local
204 mont->n0[0] = (BN_ULONG)n0;
272 BN_ULONG n0 = mont->n0[0]; local
[all...]
H A Dexponentiation.c128 const BN_ULONG *np, const BN_ULONG *n0, int num,
133 const BN_ULONG *np, const BN_ULONG *n0, int num, int power);
136 const BN_ULONG *n0, int num);
1042 RSAZ_1024_mod_exp_avx2(rr->d, a->d, p->d, m->d, mont->RR.d, mont->n0[0]);
1115 const BN_ULONG *n0 = mont->n0; local
1134 bn_mul_mont(tmp.d, am.d, am.d, np, n0, top);
1139 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
1144 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
1147 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, to
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/
H A DTestDotTreeGenerator.cs67 + @" n0 [label=""""];" + newline
74 + @" n0 -> n1 // """" -> ""*""" + newline
77 + @" n0 -> n4 // """" -> """"" + newline
/external/boringssl/src/crypto/fipsmodule/bn/asm/
H A Darmv8-mont.pl63 $n0="x4"; # const BN_ULONG *n0,
88 ldr $n0,[$n0] // *n0
98 mul $m1,$lo0,$n0 // "tp[0]"*n0
169 mul $m1,$lo0,$n0
306 ldr $n0,[$n0] // *n
[all...]
H A Darmv4-mont.pl80 $n0="r8";
161 ldr $n0,[$_n0] @ &n0
165 ldr $n0,[$n0] @ *n0
169 str $n0,[$_n0] @ save n0 value
170 mul $n0,$alo,$n0
[all...]
/external/iputils/ninfod/
H A Dninfod_name.c212 const char *s0 = s, *n0 = n; local
219 if (*(s0 + slen - 1) || *(n0 + nlen - 1))
221 while (s < s0 + slen && n < n0 + nlen) {
224 if (s + *s + 1 > s0 + slen || n + *n + 1 > n0 + nlen)
236 if (n == n0 + nlen - 1) {
238 } else if (n + 1 == n0 + nlen - 1) {
/external/mesa3d/src/mesa/program/
H A Dprog_noise.c220 float n0, n1; local
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
291 n0 = 0.0f;
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
433 n0 = 0.0f;
436 n0
484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local
[all...]
/external/libvpx/libvpx/vpx_dsp/mips/
H A Didct32x32_msa.c15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3);
20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, m0, n0, m1, n1, m2, n2, m3,
24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8);
29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3);
31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, m0, n0, m1, n1, m2, n2, m3,
35 ST_SH4(m0, n0, m1, n1, (tmp_buf + 16 * 8), 8);
243 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n local
542 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
[all...]
/external/clang/test/Modules/
H A Dmacros2.c10 int n0 = TOP_OTHER_DEF_RIGHT_UNDEF; // ok variable

Completed in 3078 milliseconds

1234