Lines Matching defs:one
16 * | Use the hardware sqrt if you have one |
31 * To compute q from q , one checks whether
60 * One may easily use induction to prove (4) and (5).
65 * After generating the 53 bits result, we compute one more bit.
86 static const double one = 1.0, tiny=1.0e-300;
88 static double one = 1.0, tiny=1.0e-300;
174 z = one-tiny; /* trigger inexact flag */
175 if (z>=one) {
176 z = one+tiny;
178 else if (z>one) {
204 The second one uses reciproot iterations to avoid division, but
272 This formula has one division fewer than the one above; however,
276 is slow. If division is very slow, then one should use the
