/bionic/libm/upstream-freebsd/lib/msun/src/ |
s_atanl.c | 29 one = 1.0, variable 56 if(huge+x>one) return x; /* raise inexact */ 63 id = 0; x = (2.0*x-one)/(2.0+x); 65 id = 1; x = (x-one)/(x+one); 69 id = 2; x = (x-1.5)/(one+1.5*x);
|
k_cosf.c | 27 one = 1.0, variable 45 return ((one+z*C0) + w*C1) + (w*z)*r;
|
s_expm1f.c | 25 one = 1.0, variable 63 return tiny-one; /* return -1 */ 92 r1 = one+hxs*(Q1+hxs*Q2); 103 else return one+(float)2.0*(x-e); 106 y = one-(e-x); 109 return y-one; 111 t = one; 119 y += one;
|
s_erf.c | 44 * is close to one. The interval is chosen because the fix 47 * guarantee the error is less than one ulp for erf. 117 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable 198 return (double)(1-i)+one/x; /* erf(+-inf)=+-1 */ 209 s = one+z*(qq1+z*(qq2+z*(qq3+z*(qq4+z*qq5)))); 214 s = fabs(x)-one; 216 Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6))))); 220 if(hx>=0) return one-tiny; else return tiny-one; 223 s = one/(x*x) [all...] |
e_acoshl.c | 52 one = 1.0; variable 84 RETURNI(logl(2.0*x-one/(x+sqrtl(t-one)))); 86 t = x-one;
|
/external/clang/test/CodeGen/ |
designated-initializers.c | 92 int one; member in struct:u_16644::s_16644 103 .a.one = 1, 113 .a.one = 11, 120 .a.one = 21, 129 .one = 31 136 [0].a.one = 2,
|
/external/fdlibm/ |
s_atan.c | 19 * is further reduced to one of the following intervals and the 82 one = 1.0, variable 105 if(huge+x>one) return x; /* raise inexact */ 112 id = 0; x = (2.0*x-one)/(2.0+x); 114 id = 1; x = (x-one)/(x+one); 118 id = 2; x = (x-1.5)/(one+1.5*x);
|
s_expm1.c | 76 * (A). To save one multiplication, we scale the coefficient Qi 115 one = 1.0, variable 157 return tiny-one; /* return -1 */ 187 r1 = one+hxs*(Q1+hxs*(Q2+hxs*(Q3+hxs*(Q4+hxs*Q5)))); 197 else return one+2.0*(x-e); 199 y = one-(e-x); 201 return y-one; 203 t = one; 211 y += one;
|
s_erf.c | 42 * is close to one. The interval is chosen because the fix 45 * guarantee the error is less than one ulp for erf. 118 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable 203 return (double)(1-i)+one/x; /* ieee_erf(+-inf)=+-1 */ 214 s = one+z*(qq1+z*(qq2+z*(qq3+z*(qq4+z*qq5)))); 219 s = ieee_fabs(x)-one; 221 Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6))))); 225 if(hx>=0) return one-tiny; else return tiny-one; 228 s = one/(x*x) [all...] |
/art/test/005-annotations/src/android/test/anno/ |
FullyNoted.java | 20 @AnnoSimpleParameter int one, 29 @AnnoSimpleParameter int one,
|
/external/chromium_org/third_party/skia/src/pathops/ |
SkIntersections.cpp | 64 int SkIntersections::insert(double one, double two, const SkDPoint& pt) { 65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { 74 if (one == oldOne && two == oldTwo) { 77 if (more_roughly_equal(oldOne, one) && more_roughly_equal(oldTwo, two)) { 78 if ((precisely_zero(one) && !precisely_zero(oldOne)) 79 || (precisely_equal(one, 1) && !precisely_equal(oldOne, 1)) 82 fT[0][index] = one; 90 SkDebugf("%s t=%1.9g pts roughly equal\n", __FUNCTION__, one); 93 if (fT[0][index] > one) { 114 fT[0][index] = one; [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
regress-996542.js | 29 var one = 1; variable 33 assertEquals(-Infinity, one / (zero / minus_one)); 35 assertEquals(Infinity, one / (zero / one)); 38 assertEquals(-Infinity, one / (minus_one % one)) 40 assertEquals(Infinity, one / (one % one));
|
/external/clang/test/CXX/special/class.temporary/ |
p1.cpp | 44 typedef char one[1]; typedef in namespace:test2 47 one &meta(bool);
|
/external/clang/test/Sema/ |
static-assert.c | 32 __typeof__(T1) one; \ 40 UNION(char[2], short) u2 = { .one = { 'a', 'b' } };
|
attr-section.c | 21 enum __attribute__((section("NEAR,x"))) e { one }; // expected-error {{'section' attribute only applies to functions and global variables}} enumerator in enum:e
|
/external/clang/test/SemaCXX/ |
warn-shadow.cpp | 7 namespace one { namespace 20 using namespace one::two; 26 int j; // expected-warning {{declaration shadows a variable in namespace 'one::two'}}
|
/external/skia/src/pathops/ |
SkIntersections.cpp | 64 int SkIntersections::insert(double one, double two, const SkDPoint& pt) { 65 if (fIsCoincident[0] == 3 && between(fT[0][0], one, fT[0][1])) { 74 if (one == oldOne && two == oldTwo) { 77 if (more_roughly_equal(oldOne, one) && more_roughly_equal(oldTwo, two)) { 78 if ((precisely_zero(one) && !precisely_zero(oldOne)) 79 || (precisely_equal(one, 1) && !precisely_equal(oldOne, 1)) 82 fT[0][index] = one; 90 SkDebugf("%s t=%1.9g pts roughly equal\n", __FUNCTION__, one); 93 if (fT[0][index] > one) { 114 fT[0][index] = one; [all...] |
/external/valgrind/main/none/tests/ |
vgprintf.stderr.exp | 4 Backtrace line one
|
/packages/apps/Camera2/src_pd/com/android/camera/one/v2/ |
OneCameraCreator.java | 17 package com.android.camera.one.v2; 25 import com.android.camera.one.OneCamera;
|
/external/guava/guava-tests/test/com/google/common/cache/ |
CacheManualTest.java | 37 Object one = new Object(); local 40 assertNull(cache.getIfPresent(one)); 46 assertNull(cache.asMap().get(one)); 47 assertFalse(cache.asMap().containsKey(one)); 58 assertFalse(cache.asMap().containsValue(one)); 60 cache.put(one, two); 62 assertSame(two, cache.getIfPresent(one)); 68 assertSame(two, cache.asMap().get(one)); 69 assertTrue(cache.asMap().containsKey(one)); 80 assertFalse(cache.asMap().containsValue(one)); [all...] |
/external/llvm/unittests/ADT/ |
APIntTest.cpp | 21 APInt One = APInt::getNullValue(65) + 1; 22 APInt Shl = One.shl(0); 104 APInt one(128, 1, true); 105 EXPECT_EQ(127u, one.countLeadingZeros()); 106 EXPECT_EQ(0u, one.countLeadingOnes()); 107 EXPECT_EQ(1u, one.getActiveBits()); 108 EXPECT_EQ(0u, one.countTrailingZeros()); 109 EXPECT_EQ(1u, one.countTrailingOnes()); 110 EXPECT_EQ(1u, one.countPopulation()); 111 EXPECT_EQ(1, one.getSExtValue()) [all...] |
/dalvik/dexgen/src/com/android/dexgen/dex/file/ |
UniformItemSection.java | 75 for (Item one : items()) { 76 one.addContents(file); 86 for (Item one : items()) { 87 one.writeTo(file, out); 97 * of the one we're given to calculate its offset.
|
/dalvik/dx/src/com/android/dx/dex/file/ |
UniformItemSection.java | 74 for (Item one : items()) { 75 one.addContents(file); 85 for (Item one : items()) { 86 one.writeTo(file, out); 96 * of the one we're given to calculate its offset.
|
/external/chromium_org/third_party/skia/include/pathops/ |
SkPathOps.h | 36 @param one The first operand (for difference, the minuend) 38 @param result The product of the operands. The result may be one of the 42 bool SK_API Op(const SkPath& one, const SkPath& two, SkPathOp op, SkPath* result);
|
/external/chromium_org/tools/clang/plugins/tests/ |
virtual_methods.cpp | 34 ConcreteVirtualMethodsInHeaders one; local
|