Searched refs:half (Results 1 - 12 of 12) sorted by relevance
/openjdk7/jdk/src/share/native/java/lang/fdlibm/src/ |
H A D | e_cosh.c | 51 static const double one = 1.0, half=0.5, huge = 1.0e300; variable 53 static double one = 1.0, half=0.5, huge = 1.0e300; variable 85 return half*t+half/t; 88 /* |x| in [22, log(maxdouble)] return half*exp(|x|) */ 89 if (ix < 0x40862E42) return half*__ieee754_exp(fabs(x)); 95 w = __ieee754_exp(half*fabs(x)); 96 t = half*w;
|
H A D | k_sin.c | 62 half = 5.00000000000000000000e-01, /* 0x3FE00000, 0x00000000 */ variable 86 else return x-((z*(half*y-v*r)-y)-v*S1);
|
H A D | e_lgamma_r.c | 102 half= 5.00000000000000000000e-01, /* 0x3FE00000, 0x00000000 */ variable 294 r = half*y+p/q; 310 r = (x-half)*(t-one)+w;
|
H A D | s_erf.c | 130 half= 5.00000000000000000000e-01, /* 0x3FE00000, 0x00000000 */ variable 286 r += (x-half); 287 return half - r ;
|
H A D | e_rem_pio2.c | 85 half = 5.00000000000000000000e-01, /* 0x3FE00000, 0x00000000 */ variable 137 n = (int) (t*invpio2+half);
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ThreadLocalRandom.java | 165 // half (which makes a difference only if odd). 169 long half = n >>> 1; 170 long nextn = ((bits & 2) == 0) ? half : n - half;
|
H A D | PriorityBlockingQueue.java | 386 int half = n >>> 1; // loop while a non-leaf 387 while (k < half) { 407 int half = n >>> 1; 408 while (k < half) { 430 int half = (n >>> 1) - 1; 433 for (int i = half; i >= 0; i--) 437 for (int i = half; i >= 0; i--)
|
H A D | ScheduledThreadPoolExecutor.java | 894 int half = size >>> 1; 895 while (k < half) {
|
/openjdk7/jdk/test/java/lang/Math/ |
H A D | Log10Tests.java | 146 int half = input.length/2; 153 for(int i = 0; i < half; i++) { 155 input[half] = 1.0; 159 input[half + i] = up; 160 input[half - i] = down;
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | PriorityQueue.java | 674 int half = size >>> 1; // loop while a non-leaf 675 while (k < half) { 691 int half = size >>> 1; 692 while (k < half) {
|
/openjdk7/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_util.c | 1448 int half; local 1459 half = count >> 1; 1461 while ( half > 0 ) { 1464 start_location = table[start + half].start_location; 1466 start = start + half; 1468 start = start + half; 1471 half = half >> 1;
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | sharedRuntimeTrig.cpp | 466 half = 5.00000000000000000000e-01, /* 0x3FE00000, 0x00000000 */ variable 513 n = (int) (t*invpio2+half); 613 else return x-((z*(half*y-v*r)-y)-v*S1);
|
Completed in 85 milliseconds