-
Notifications
You must be signed in to change notification settings - Fork 135
/
complex.t
148 lines (120 loc) · 5.24 KB
/
complex.t
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
use v6;
use Test;
plan 487;
# Basic tests functions specific to complex numbers.
isa_ok(1 + 2i, Complex, 'postfix:<i> creates a Complex number');
#?rakudo 2 skip 'i'
isa_ok(i, Complex, 'i creates a Complex number');
ok i == 1i, 'i == 1i';
isa_ok((3)i, Complex, '($n)i form creates a Complex number');
isa_ok(3\i, Complex, '$n\i form creates a Complex number');
is_approx((2i)i, -2, 'postfix:<i> works on an imaginary number');
is_approx((2i + 3)i, -2 + 3i, 'postfix:<i> works on a Complex number');
eval_dies_ok '(2 + 3i) > (2 + 2i)', '> comparison of complex numbers dies';
#?rakudo 3 skip 'i'
is_approx(i, 1i, 'standalone i works to generate a Complex number');
is_approx(1 - i, 1 - 1i, 'standalone i works to generate a Complex number');
is_approx(2i * i, -2, 'standalone i works times a Complex number');
# checked with the open CAS system "yacas":
# In> (3+4*I) / (2-I)
# Out> Complex(2/5,11/5)
# In> (3+4*I) * (2-I)
# Out> Complex(10,5)
# etc
is_approx (3+4i)/(2-1i), 2/5 + (11/5)i, 'Complex division';
is_approx (3+4i)*(2-1i), 10+5i, 'Complex multiplication';
is_approx (6+4i)/2, 3+2i, 'dividing Complex by a Real';
is_approx 2/(3+1i), 3/5 -(1/5)i, 'dividing a Real by a Complex';
is_approx 2 * (3+7i), 6+14i, 'Real * Complex';
is_approx (3+7i) * 2, 6+14i, 'Complex * Real';
isa_ok( eval((1+3i).perl), Complex, 'eval (1+3i).perl is Complex' );
is_approx( (eval (1+3i).perl), 1+3i, 'eval (1+3i).perl is 1+3i' );
isa_ok( eval((1+0i).perl), Complex, 'eval (1+0i).perl is Complex' );
is_approx( (eval (1+0i).perl), 1, 'eval (1+0i).perl is 1' );
isa_ok( eval((3i).perl), Complex, 'eval (3i).perl is Complex' );
is_approx( (eval (3i).perl), 3i, 'eval (3i).perl is 3i' );
#?niecza skip "NYI"
{
ok (1+0i).Real ~~ Real, "(1+0i).Real is a Real";
is (1+0i).Real, 1, "(1+0i).Real is 1";
isa_ok (1.2+0i).Int, Int, "(1.2+0i).Int is an Int";
is (1.2+0i).Int, 1, "(1.2+0i).Int is 1";
isa_ok (1.2.sin+0i).Rat, Rat, "(1.2.sin+0i).Rat is an Rat";
is_approx (1.2.sin+0i).Rat, 1.2.sin, "(1.2.sin+0i).Rat is 1.2.sin";
isa_ok (1.2+0i).Num, Num, "(1.2+0i).Num is an Num";
is_approx (1.2+0i).Num, 1.2, "(1.2+0i).Num is 1.2";
isa_ok (1.2+1i).Complex, Complex, "(1.2+1i).Complex is an Complex";
is_approx (1.2+1i).Complex, 1.2+1i, "(1.2+1i).Complex is 1.2+1i";
}
# MUST: test .Str
my @examples = (0i, 1 + 0i, -1 + 0i, 1i, -1i, 2 + 0i, -2 + 0i, 2i, -2i,
2 + 3i, 2 - 3i, -2 + 3i, -2 - 3i,
cis(1.1), cis(3.1), cis(5.1), 35.unpolar(0.8), 40.unpolar(3.7));
for @examples -> $z {
is_approx($z + 0, $z, "$z + 0 = $z");
is_approx(0 + $z, $z, "0 + $z = $z");
is_approx($z + 0.0.Num, $z, "$z + 0.0.Num = $z");
is_approx(0.0.Num + $z, $z, "0.0.Num + $z = $z");
is_approx($z + 0 / 1, $z, "$z + 0/1 = $z");
is_approx(0 / 1 + $z, $z, "0/1 + $z = $z");
is_approx($z - 0, $z, "$z - 0 = $z");
is_approx(0 - $z, -$z, "0 - $z = -$z");
is_approx($z - 0.0.Num, $z, "$z - 0.0.Num = $z");
is_approx(0.0.Num - $z, -$z, "0.0.Num - $z = -$z");
is_approx($z - 0 / 1, $z, "$z - 0/1 = $z");
is_approx(0 / 1 - $z, -$z, "0/1 - $z = -$z");
is_approx($z + 2, $z.re + 2 + ($z.im)i, "$z + 2");
is_approx(2 + $z, $z.re + 2 + ($z.im)i, "2 + $z");
is_approx($z + 2.5.Num, $z.re + 2.5.Num + ($z.im)i, "$z + 2.5.Num = $z");
is_approx(2.5.Num + $z, $z.re + 2.5.Num + ($z.im)i, "2.5.Num + $z = $z");
is_approx($z + 3 / 2, $z.re + 3/2 + ($z.im)i, "$z + 3/2");
is_approx(3 / 2 + $z, $z.re + 3/2 + ($z.im)i, "3/2 + $z");
is_approx($z - 2, $z.re - 2 + ($z.im)i, "$z - 2");
is_approx(2 - $z, -$z.re + 2 - ($z.im)i, "2 - $z");
is_approx($z - 2.5.Num, $z.re - 2.5.Num + ($z.im)i, "$z - 2.5.Num = $z");
is_approx(2.5.Num - $z, -$z.re + 2.5.Num - ($z.im)i, "2.5.Num - $z = $z");
is_approx($z - 3 / 2, $z.re - 3/2 + ($z.im)i, "$z - 3/2");
is_approx(3 / 2 - $z, -$z.re + 3/2 - ($z.im)i, "3/2 - $z");
}
# L<S32::Numeric/Complex/=item re>
# L<S32::Numeric/Complex/=item im>
{
is (1 + 2i).re, 1, 'Complex.re works';
is (1 + 2i).im, 2, 'Complex.im works';
}
{
is_approx 0i ** 2, 0, "Complex 0 ** Int works";
is_approx 0i ** 2.5, 0, "Complex 0 ** Rat works";
is_approx 0i ** (2 + 0i), 0, "Complex 0 ** Complex works";
is_approx 0 ** (2 + 0i), 0, "Real 0 ** Complex works";
}
# used to be RT #68848
{
is_approx exp(3.0 * log(1i)), -1.83697e-16-1i,
'exp(3.0 * log(1i))';
sub iPower($a, $b) { exp($b * log($a)) };
is_approx iPower(1i, 3.0), -1.83697e-16-1i, 'same as wrapped as sub';
}
#?rakudo skip 'e'
is_approx e.log(1i), -2i / pi, "log e base i == -2i / pi";
# Complex math with strings, to make sure type coercion is working correctly
{
is 3i + "1", 1 + 3i, '3i + "1"';
is "1" + 3i, 1 + 3i, '"1" + 3i';
is 3i - "1", 3i - 1, '3i - "1"';
is "1" - 3i, 1 - 3i, '"1" - 3i';
is 3i * "1", 3i * 1, '3i * "1"';
is "1" * 3i, 1 * 3i, '"1" * 3i';
is 3i / "1", 3i / 1, '3i / "1"';
is "1" / 3i, 1 / 3i, '"1" / 3i';
is 3i ** "1", 3i ** 1, '3i ** "1"';
is "1" ** 3i, 1 ** 3i, '"1" ** 3i';
}
# Conjugation
{
is (2+3i).conj, 2-3i, 'conj 2+3i -> 2-3i';
is (5-4i).conj, 5+4i, 'conj 5-4i -> 5+4i';
}
eval_dies_ok "(1 + 2i) < (2 + 4i)", 'Cannot arithmetically compare Complex numbers';
done;
# vim: ft=perl6