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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/*
* Copyright © 2025 Keith Packard and Bart Massey.
* All Rights Reserved. See the file COPYING in this directory
* for licensing information.
*/
#include <math.h>
#include "nickle.h"
static Value
ComplexPlus (Value av, Value bv, int expandOk)
{
(void) expandOk;
ENTER();
Value ret = NewValueComplex(Plus(av->complex.r, bv->complex.r),
Plus(av->complex.i, bv->complex.i));
RETURN(ret);
}
static Value
ComplexMinus (Value av, Value bv, int expandOk)
{
(void) expandOk;
ENTER();
Value ret = NewValueComplex(Minus(av->complex.r, bv->complex.r),
Minus(av->complex.i, bv->complex.i));
RETURN(ret);
}
static Value
ComplexTimes (Value av, Value bv, int expandOk)
{
(void) expandOk;
ENTER();
Value ret = NewValueComplex(Minus(Times(av->complex.r, bv->complex.r),
Times(av->complex.i, bv->complex.i)),
Plus(Times(av->complex.r, bv->complex.i),
Times(av->complex.i, bv->complex.r)));
RETURN(ret);
}
static Value
ComplexRecip (Value av)
{
ENTER();
Value modsq = Plus(Times(av->complex.r, av->complex.r),
Times(av->complex.i, av->complex.i));
Value ret = NewValueComplex(Divide(av->complex.r, modsq),
Divide(Negate(av->complex.i), modsq));
RETURN(ret);
}
static Value
ComplexDivide (Value av, Value bv, int expandOk)
{
(void) expandOk;
ENTER();
Value recip = ComplexRecip(bv);
Value ret = ComplexTimes(av, recip, expandOk);
RETURN(ret);
}
static Value
ComplexLess (Value av, Value bv, int expandOk)
{
(void) expandOk;
/* Dictionary ordering is at least consistent */
if (True(Less(av->complex.r, bv->complex.r)))
return TrueVal;
if (True(Equal(av->complex.r, bv->complex.r)))
return Less(av->complex.i, bv->complex.i);
return FalseVal;
}
static Value
ComplexEqual (Value av, Value bv, int expandOk)
{
(void) expandOk;
Value ret;
ret = Equal(av->complex.r, bv->complex.r);
if (True(ret))
ret = Equal(av->complex.i, bv->complex.i);
return ret;
}
static Value
ComplexNegate (Value av, int expandOk)
{
(void) expandOk;
ENTER();
Value ret = NewValueComplex(Negate(av->complex.r), Negate(av->complex.i));
RETURN(ret);
}
static Value
ComplexFloor (Value av, int expandOk)
{
(void) expandOk;
ENTER();
Value ret = NewValueComplex(Floor(av->complex.r), Floor(av->complex.i));
RETURN(ret);
}
static Value
ComplexCeil (Value av, int expandOk)
{
(void) expandOk;
ENTER();
Value ret = NewValueComplex(Ceil(av->complex.r), Ceil(av->complex.i));
RETURN(ret);
}
static Value
ComplexPromote (Value av, Value bv)
{
(void) bv;
ENTER ();
if (!ValueIsComplex(av))
av = NewComplex(av, Zero);
RETURN(av);
}
static Value
ComplexReduce (Value av)
{
if (Zerop(av->complex.i))
return av->complex.r;
return av;
}
static Bool
ComplexPrint(Value f, Value fv, char format, int base, int width, int prec, int fill)
{
Bool value = format == 'v';
if (value)
FilePuts(f, "cmplx(");
if (!Print(f, fv->complex.r, format, base, width, prec, fill))
return False;
if (value)
FilePuts(f, ", ");
else
FilePuts(f, "+i");
if (!Print(f, fv->complex.i, format, base, width, prec, fill))
return False;
if (value)
FilePuts(f, ")");
return True;
}
static HashValue
ComplexHash (Value av)
{
return ValueInt(ValueHash(av->complex.r)) ^ ValueInt(ValueHash(av->complex.i));
}
static void
ComplexMark (void *object)
{
ComplexVal *c = object;
MemReference(c->r);
MemReference(c->i);
}
ValueRep ComplexRep = {
{ ComplexMark, 0, "ComplexRep" }, /* base */
rep_complex, /* tag */
{ /* binary */
ComplexPlus,
ComplexMinus,
ComplexTimes,
ComplexDivide,
NumericDiv,
NumericMod,
ComplexLess,
ComplexEqual,
0,
0,
},
{ /* unary */
ComplexNegate,
ComplexFloor,
ComplexCeil,
},
ComplexPromote,
ComplexReduce,
ComplexPrint,
0,
ComplexHash,
};
Value
NewComplex (Value r, Value i)
{
ENTER();
Value ret;
ret = ALLOCATE (&ComplexRep.data, sizeof (ComplexVal));
ret->complex.r = r;
ret->complex.i = i;
RETURN (ret);
}
Value
NewValueComplex (Value r, Value i)
{
if (!Zerop(i))
r = NewComplex(r, i);
return r;
}
|
