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
212
213
214
215
216
217
|
// Type infos and methods for Nums (floating point)
#include <float.h>
#include <gc.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdlib.h>
#include "lists.h"
#include "nums.h"
#include "string.h"
#include "text.h"
#include "types.h"
public PUREFUNC Text_t Num$as_text(const void *f, bool colorize, const TypeInfo_t *info) {
(void)info;
if (!f) return Text("Num");
return Text$format(colorize ? "\x1b[35m%.16g\x1b[33;2m\x1b[m" : "%.16g", *(double*)f);
}
public PUREFUNC int32_t Num$compare(const void *x, const void *y, const TypeInfo_t *info) {
(void)info;
int64_t rx = *(int64_t*)x,
ry = *(int64_t*)y;
if (rx == ry) return 0;
if (rx < 0) rx ^= INT64_MAX;
if (ry < 0) ry ^= INT64_MAX;
return (rx > ry) - (rx < ry);
}
public PUREFUNC bool Num$equal(const void *x, const void *y, const TypeInfo_t *info) {
(void)info;
return *(double*)x == *(double*)y;
}
public CONSTFUNC bool Num$near(double a, double b, double ratio, double absolute) {
if (ratio < 0) ratio = 0;
else if (ratio > 1) ratio = 1;
if (a == b) return true;
double diff = fabs(a - b);
if (diff < absolute) return true;
else if (isnan(diff)) return false;
double epsilon = fabs(a * ratio) + fabs(b * ratio);
if (isinf(epsilon)) epsilon = DBL_MAX;
return (diff < epsilon);
}
public Text_t Num$format(double f, Int_t precision) {
return Text$format("%.*f", (int)Int64$from_int(precision, false), f);
}
public Text_t Num$scientific(double f, Int_t precision) {
return Text$format("%.*e", (int)Int64$from_int(precision, false), f);
}
public Text_t Num$percent(double f, Int_t precision) {
return Text$format("%.*f%%", (int)Int64$from_int(precision, false), 100.*f);
}
public CONSTFUNC double Num$mod(double num, double modulus) {
// Euclidean division, see: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/divmodnote-letter.pdf
double r = remainder(num, modulus);
r -= (r < 0) * (2*(modulus < 0) - 1) * modulus;
return r;
}
public CONSTFUNC double Num$mod1(double num, double modulus) {
return 1.0 + Num$mod(num-1, modulus);
}
public CONSTFUNC double Num$mix(double amount, double x, double y) {
return (1.0-amount)*x + amount*y;
}
public CONSTFUNC bool Num$is_between(const double x, const double low, const double high) {
return low <= x && x <= high;
}
public CONSTFUNC double Num$clamped(double x, double low, double high) {
return (x <= low) ? low : (x >= high ? high : x);
}
public OptionalNum_t Num$parse(Text_t text) {
const char *str = Text$as_c_string(text);
char *end = NULL;
double d = strtod(str, &end);
if (end > str && end[0] == '\0')
return d;
else
return nan("null");
}
static bool Num$is_none(const void *n, const TypeInfo_t *info)
{
(void)info;
return isnan(*(Num_t*)n);
}
public CONSTFUNC bool Num$isinf(double n) { return (fpclassify(n) == FP_INFINITE); }
public CONSTFUNC bool Num$finite(double n) { return (fpclassify(n) != FP_INFINITE); }
public CONSTFUNC bool Num$isnan(double n) { return (fpclassify(n) == FP_NAN); }
public const TypeInfo_t Num$info = {
.size=sizeof(double),
.align=__alignof__(double),
.metamethods={
.compare=Num$compare,
.equal=Num$equal,
.as_text=Num$as_text,
.is_none=Num$is_none,
},
};
public PUREFUNC Text_t Num32$as_text(const void *f, bool colorize, const TypeInfo_t *info) {
(void)info;
if (!f) return Text("Num32");
return Text$format(colorize ? "\x1b[35m%.8g\x1b[33;2m\x1b[m" : "%.8g", (double)*(float*)f);
}
public PUREFUNC int32_t Num32$compare(const void *x, const void *y, const TypeInfo_t *info) {
(void)info;
return (*(float*)x > *(float*)y) - (*(float*)x < *(float*)y);
}
public PUREFUNC bool Num32$equal(const void *x, const void *y, const TypeInfo_t *info) {
(void)info;
return *(float*)x == *(float*)y;
}
public CONSTFUNC bool Num32$near(float a, float b, float ratio, float absolute) {
if (ratio < 0) ratio = 0;
else if (ratio > 1) ratio = 1;
if (a == b) return true;
float diff = fabsf(a - b);
if (diff < absolute) return true;
else if (isnan(diff)) return false;
float epsilon = fabsf(a * ratio) + fabsf(b * ratio);
if (isinf(epsilon)) epsilon = FLT_MAX;
return (diff < epsilon);
}
public Text_t Num32$format(float f, Int_t precision) {
return Text$format("%.*f", (int)Int64$from_int(precision, false), (double)f);
}
public Text_t Num32$scientific(float f, Int_t precision) {
return Text$format("%.*e", (int)Int64$from_int(precision, false), (double)f);
}
public Text_t Num32$percent(float f, Int_t precision) {
return Text$format("%.*f%%", (int)Int64$from_int(precision, false), 100.*(double)f);
}
public CONSTFUNC float Num32$mod(float num, float modulus) {
// Euclidean division, see: https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/divmodnote-letter.pdf
float r = remainderf(num, modulus);
r -= (r < 0) * (2*(modulus < 0) - 1) * modulus;
return r;
}
public CONSTFUNC float Num32$mod1(float num, float modulus) {
return 1.0f + Num32$mod(num-1, modulus);
}
public CONSTFUNC float Num32$mix(float amount, float x, float y) {
return (1.0f-amount)*x + amount*y;
}
public CONSTFUNC bool Num32$is_between(const float x, const float low, const float high) {
return low <= x && x <= high;
}
public CONSTFUNC float Num32$clamped(float x, float low, float high) {
return (x <= low) ? low : (x >= high ? high : x);
}
public OptionalNum32_t Num32$parse(Text_t text) {
const char *str = Text$as_c_string(text);
char *end = NULL;
double d = strtod(str, &end);
if (end > str && end[0] == '\0')
return d;
else
return nan("null");
}
static bool Num32$is_none(const void *n, const TypeInfo_t *info)
{
(void)info;
return isnan(*(Num32_t*)n);
}
public CONSTFUNC bool Num32$isinf(float n) { return (fpclassify(n) == FP_INFINITE); }
public CONSTFUNC bool Num32$finite(float n) { return (fpclassify(n) != FP_INFINITE); }
public CONSTFUNC bool Num32$isnan(float n) { return (fpclassify(n) == FP_NAN); }
public const TypeInfo_t Num32$info = {
.size=sizeof(float),
.align=__alignof__(float),
.metamethods={
.compare=Num32$compare,
.equal=Num32$equal,
.as_text=Num32$as_text,
.is_none=Num32$is_none,
},
};
// vim: ts=4 sw=0 et cino=L2,l1,(0,W4,m1,\:0
|
