Lines Matching refs:one
20 * | Use the hardware sqrt if you have one |
35 * To compute q from q , one checks whether
64 * One may easily use induction to prove (4) and (5).
69 * After generating the 53 bits result, we compute one more bit.
92 static const double one = 1.0, tiny=1.0e-300;
172 z = one-tiny; /* trigger inexact flag */
173 if (z>=one) {
174 z = one+tiny;
176 else if (z>one) {
205 The second one uses reciproot iterations to avoid division, but
273 This formula has one division fewer than the one above; however,
277 is slow. If division is very slow, then one should use the
