blob: b5c67d88c06caeed4f48c406126a074628835bd6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package math
import "math"
// x^y: exponentiation
export func Pow(x, y float64) float64 {
// TODO: x or y NaN, ±Inf, maybe ±0.
switch {
case y == 0:
return 1;
case y == 1:
return x;
case x == 0 && y > 0:
return 0;
case x == 0 && y < 0:
return sys.Inf(1);
case y == 0.5:
return Sqrt(x);
case y == -0.5:
return 1 / Sqrt(x);
}
absy := y;
flip := false;
if absy < 0 {
absy = -absy;
flip = true;
}
yi, yf := sys.Modf(absy);
if yf != 0 && x < 0 {
return sys.NaN();
}
if yi >= 1<<63 {
return Exp(y * Log(x));
}
// ans = a1 * 2^ae (= 1 for now).
a1 := float64(1);
ae := 0;
// ans *= x^yf
if yf != 0 {
if yf > 0.5 {
yf--;
yi++;
}
a1 = Exp(yf * Log(x));
}
// ans *= x^yi
// by multiplying in successive squarings
// of x according to bits of yi.
// accumulate powers of two into exp.
x1, xe := sys.Frexp(x);
for i := int64(yi); i != 0; i >>= 1 {
if i&1 == 1 {
a1 *= x1;
ae += xe;
}
x1 *= x1;
xe <<= 1;
if x1 < .5 {
x1 += x1;
xe--;
}
}
// ans = a1*2^ae
// if flip { ans = 1 / ans }
// but in the opposite order
if flip {
a1 = 1 / a1;
ae = -ae;
}
return sys.Ldexp(a1, ae);
}
|
