/prebuilts/go/darwin-x86/src/math/ |
tanh.go | 49 // The two known misprints in the book are repaired here in the
|
/prebuilts/go/darwin-x86/src/net/http/ |
cookie_test.go | 28 &Cookie{Name: "cookie-2", Value: "two", MaxAge: 3600}, 29 "cookie-2=two; Max-Age=3600", 145 SetCookie(headerOnlyResponseWriter(m), &Cookie{Name: "cookie-2", Value: "two", MaxAge: 3600}) 152 if g, e := m["Set-Cookie"][1], "cookie-2=two; Max-Age=3600"; g != e {
|
/prebuilts/go/darwin-x86/src/runtime/race/testdata/ |
rwmutex_test.go | 65 // scheduled in, two will be on the same side of the write
|
/prebuilts/go/darwin-x86/src/syscall/ |
syscall_darwin_386.go | 32 // in the two registers.
|
syscall_darwin_arm.go | 32 // in the two registers.
|
/prebuilts/go/darwin-x86/src/testing/iotest/ |
reader.go | 54 // loop because first call needs two reads:
|
/prebuilts/go/linux-x86/doc/play/ |
life.go | 11 // Field represents a two-dimensional field of cells.
|
tree.go | 54 // Compare reads values from two Walkers
|
/prebuilts/go/linux-x86/src/hash/adler32/ |
adler32.go | 8 // Adler-32 is composed of two sums accumulated per byte: s1 is
|
/prebuilts/go/linux-x86/src/math/ |
atan.go | 47 // The two known misprints in the book are repaired here in the
|
pow.go | 114 // accumulate powers of two into exp.
|
tanh.go | 49 // The two known misprints in the book are repaired here in the
|
/prebuilts/go/linux-x86/src/math/cmplx/ |
pow.go | 24 // The two known misprints in the book are repaired here in the
|
sqrt.go | 24 // The two known misprints in the book are repaired here in the
|
/prebuilts/go/linux-x86/src/net/http/ |
cookie_test.go | 28 &Cookie{Name: "cookie-2", Value: "two", MaxAge: 3600}, 29 "cookie-2=two; Max-Age=3600", 145 SetCookie(headerOnlyResponseWriter(m), &Cookie{Name: "cookie-2", Value: "two", MaxAge: 3600}) 152 if g, e := m["Set-Cookie"][1], "cookie-2=two; Max-Age=3600"; g != e {
|
/prebuilts/go/linux-x86/src/runtime/race/testdata/ |
rwmutex_test.go | 65 // scheduled in, two will be on the same side of the write
|
/prebuilts/go/linux-x86/src/syscall/ |
syscall_darwin_386.go | 32 // in the two registers.
|
syscall_darwin_arm.go | 32 // in the two registers.
|
/prebuilts/go/linux-x86/src/testing/iotest/ |
reader.go | 54 // loop because first call needs two reads:
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_program_tex.c | 326 unsigned two, two_swizzle; local 347 two = rc_constants_add_immediate_scalar(&c->Program.Constants, 2, &two_swizzle); 358 inst_mad->U.I.SrcReg[1].Index = two; 442 unsigned two, two_swizzle; local 445 two = rc_constants_add_immediate_scalar(&c->Program.Constants, 2.35, &two_swizzle); 454 inst_mul->U.I.SrcReg[1].Index = two;
|
/external/v8/test/mjsunit/ |
array-constructor-feedback.js | 140 function barn(one, two, three) { 141 return new Array(one, two, three); 177 // Test: create arrays in two contexts, verifying that the correct
|
string-slices.js | 84 // Then two-byte strings. 85 x = "UC16\u2028"; // Non-ascii char forces two-byte string. 113 // Same with two-byte strings
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ppc/ |
fdct_altivec.asm | 54 ;# Do horiz xf on two rows of coeffs v8 = a0 a1 a2 a3 b0 b1 b2 b3. 58 ;# The two resulting A0..A3 B0..B3 are later combined 76 ;# Vertical xf on two rows. DCT values in comments are for inverse transform;
|
/hardware/invensense/6515/libsensors_iio/software/core/mllite/ |
ml_math_func.c | 729 * iteration works best. Corresponding square root of the power of two is returned. 816 // Two-variable NR iteration: 873 * iteration works best. Corresponding multiplier power of two is returned. 885 long two, xx; local 898 two = 2147483647L; 940 xx = (two - x0) + 1; // Note 2 will overflow so the computation (2-x) is done with "two" == (2^30-1) 942 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 ); 945 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 ); 948 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 ) [all...] |
/hardware/invensense/65xx/libsensors_iio/software/core/mllite/ |
ml_math_func.c | 729 * iteration works best. Corresponding square root of the power of two is returned. 816 // Two-variable NR iteration: 873 * iteration works best. Corresponding multiplier power of two is returned. 885 long two, xx; local 898 two = 2147483647L; 940 xx = (two - x0) + 1; // Note 2 will overflow so the computation (2-x) is done with "two" == (2^30-1) 942 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 ); 945 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 ); 948 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 ) [all...] |