extra-math 1.5.1 → 1.6.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +1 -1
- package/README.md +66 -95
- package/deno.lock +42 -0
- package/index.d.ts +19 -342
- package/index.js +52 -498
- package/index.test.ts +105 -0
- package/package.json +12 -97
- package/index.mjs +0 -496
package/index.js
CHANGED
|
@@ -1,498 +1,52 @@
|
|
|
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
|
-
function rem(x, y) {
|
|
54
|
-
return x % y;
|
|
55
|
-
}
|
|
56
|
-
extraNumber.rem = _build.rem = rem;
|
|
57
|
-
function mod(x, y) {
|
|
58
|
-
return x - y * Math.floor(x / y);
|
|
59
|
-
}
|
|
60
|
-
extraNumber.mod = _build.mod = mod;
|
|
61
|
-
function modp(x, y) {
|
|
62
|
-
return x - Math.abs(y) * Math.floor(x / Math.abs(y));
|
|
63
|
-
}
|
|
64
|
-
extraNumber.modp = _build.modp = modp;
|
|
65
|
-
function constrain(x, min, max) {
|
|
66
|
-
return Math.min(Math.max(x, min), max);
|
|
67
|
-
}
|
|
68
|
-
extraNumber.constrain = _build.constrain = constrain;
|
|
69
|
-
extraNumber.clamp = _build.clamp = constrain;
|
|
70
|
-
function normalize(x, r, R) {
|
|
71
|
-
return (x - r) / (R - r);
|
|
72
|
-
}
|
|
73
|
-
extraNumber.normalize = _build.normalize = normalize;
|
|
74
|
-
extraNumber.norm = _build.norm = normalize;
|
|
75
|
-
function remap(x, r, R, t, T) {
|
|
76
|
-
return t + ((x - r) / (R - r)) * (T - t);
|
|
77
|
-
}
|
|
78
|
-
extraNumber.remap = _build.remap = remap;
|
|
79
|
-
extraNumber.map = _build.map = remap;
|
|
80
|
-
function lerp(x, y, t) {
|
|
81
|
-
return x + t * (y - x);
|
|
82
|
-
}
|
|
83
|
-
extraNumber.lerp = _build.lerp = lerp;
|
|
84
|
-
function isPow(x, n) {
|
|
85
|
-
if (n === 0)
|
|
86
|
-
return x === 0;
|
|
87
|
-
var p = log(Math.abs(x), Math.abs(n));
|
|
88
|
-
if (p !== Math.floor(p))
|
|
89
|
-
return false;
|
|
90
|
-
return x < 0 ? n < 0 && (p & 1) === 1 : n > 0 || (p & 1) === 0;
|
|
91
|
-
}
|
|
92
|
-
extraNumber.isPow = _build.isPow = isPow;
|
|
93
|
-
function prevPow(x, n) {
|
|
94
|
-
if (x <= 1)
|
|
95
|
-
return 0;
|
|
96
|
-
var p = Math.floor(Math.log(x) / Math.log(n));
|
|
97
|
-
return Math.pow(n, p);
|
|
98
|
-
}
|
|
99
|
-
extraNumber.prevPow = _build.prevPow = prevPow;
|
|
100
|
-
function nextPow(x, n) {
|
|
101
|
-
if (x <= 0)
|
|
102
|
-
return 1;
|
|
103
|
-
var p = Math.ceil(Math.log(x) / Math.log(n));
|
|
104
|
-
return Math.pow(n, p);
|
|
105
|
-
}
|
|
106
|
-
extraNumber.nextPow = _build.nextPow = nextPow;
|
|
107
|
-
function root(x, n) {
|
|
108
|
-
if ((n & 1) === 0)
|
|
109
|
-
return Math.pow(x, 1 / n);
|
|
110
|
-
return Math.sign(x) * Math.pow(Math.abs(x), 1 / n);
|
|
111
|
-
}
|
|
112
|
-
extraNumber.root = _build.root = root;
|
|
113
|
-
function log(x, b = Math.E) {
|
|
114
|
-
return Math.log(x) / Math.log(b);
|
|
115
|
-
}
|
|
116
|
-
extraNumber.log = _build.log = log;
|
|
117
|
-
function properDivisors(x) {
|
|
118
|
-
var x = Math.abs(x), a = [];
|
|
119
|
-
for (var i = 1; i < x; i++)
|
|
120
|
-
if (x % i === 0)
|
|
121
|
-
a.push(i);
|
|
122
|
-
return a;
|
|
123
|
-
}
|
|
124
|
-
extraNumber.properDivisors = _build.properDivisors = properDivisors;
|
|
125
|
-
extraNumber.aliquotParts = _build.aliquotParts = properDivisors;
|
|
126
|
-
function aliquotSum(x) {
|
|
127
|
-
var x = Math.abs(x), a = 0;
|
|
128
|
-
for (var i = 0; i < x; i++)
|
|
129
|
-
if (x % i === 0)
|
|
130
|
-
a += i;
|
|
131
|
-
return a;
|
|
132
|
-
}
|
|
133
|
-
extraNumber.aliquotSum = _build.aliquotSum = aliquotSum;
|
|
134
|
-
function minPrimeFactor(x) {
|
|
135
|
-
var x = Math.abs(x);
|
|
136
|
-
if (x <= 1)
|
|
137
|
-
return 0;
|
|
138
|
-
if (x <= 3)
|
|
139
|
-
return x;
|
|
140
|
-
if (x % 2 === 0)
|
|
141
|
-
return 2;
|
|
142
|
-
if (x % 3 === 0)
|
|
143
|
-
return 3;
|
|
144
|
-
for (var i = 6, I = Math.sqrt(x) + 1; i <= I; i += 6) {
|
|
145
|
-
if (x % (i - 1) === 0)
|
|
146
|
-
return i - 1;
|
|
147
|
-
if (x % (i + 1) === 0)
|
|
148
|
-
return i + 1;
|
|
149
|
-
}
|
|
150
|
-
return x;
|
|
151
|
-
}
|
|
152
|
-
extraNumber.minPrimeFactor = _build.minPrimeFactor = minPrimeFactor;
|
|
153
|
-
extraNumber.leastPrimeFactor = _build.leastPrimeFactor = minPrimeFactor;
|
|
154
|
-
function maxPrimeFactor(x) {
|
|
155
|
-
var x = Math.abs(x), a = 0;
|
|
156
|
-
if (x <= 1)
|
|
157
|
-
return 0;
|
|
158
|
-
if (x <= 3)
|
|
159
|
-
return x;
|
|
160
|
-
for (; x % 2 === 0; a = 2)
|
|
161
|
-
x /= 2;
|
|
162
|
-
for (; x % 3 === 0; a = 3)
|
|
163
|
-
x /= 3;
|
|
164
|
-
for (var i = 6, I = Math.sqrt(x) + 1; x > 1 && i <= I; i += 6) {
|
|
165
|
-
for (; x % (i - 1) == 0; a = i - 1)
|
|
166
|
-
x /= i - 1;
|
|
167
|
-
for (; x % (i + 1) == 0; a = i + 1)
|
|
168
|
-
x /= i + 1;
|
|
169
|
-
}
|
|
170
|
-
if (x <= 1)
|
|
171
|
-
return a;
|
|
172
|
-
return x;
|
|
173
|
-
}
|
|
174
|
-
extraNumber.maxPrimeFactor = _build.maxPrimeFactor = maxPrimeFactor;
|
|
175
|
-
extraNumber.greatestPrimeFactor = _build.greatestPrimeFactor = maxPrimeFactor;
|
|
176
|
-
function primeFactors(x) {
|
|
177
|
-
var x = Math.abs(x), a = [];
|
|
178
|
-
if (x <= 1)
|
|
179
|
-
return [];
|
|
180
|
-
if (x <= 3)
|
|
181
|
-
return [x];
|
|
182
|
-
x = pushPrimeFactorTo$(a, x, 2);
|
|
183
|
-
x = pushPrimeFactorTo$(a, x, 3);
|
|
184
|
-
for (var i = 6, I = Math.sqrt(x) + 1; x > 1 && i <= I; i += 6) {
|
|
185
|
-
x = pushPrimeFactorTo$(a, x, i - 1);
|
|
186
|
-
x = pushPrimeFactorTo$(a, x, i + 1);
|
|
187
|
-
}
|
|
188
|
-
if (x > 1)
|
|
189
|
-
a.push(x);
|
|
190
|
-
return a;
|
|
191
|
-
}
|
|
192
|
-
extraNumber.primeFactors = _build.primeFactors = primeFactors;
|
|
193
|
-
function pushPrimeFactorTo$(a, x, f) {
|
|
194
|
-
if (x % f !== 0)
|
|
195
|
-
return x;
|
|
196
|
-
do {
|
|
197
|
-
x /= f;
|
|
198
|
-
} while (x % f === 0);
|
|
199
|
-
a.push(f);
|
|
200
|
-
return x;
|
|
201
|
-
}
|
|
202
|
-
function primeExponentials(x) {
|
|
203
|
-
var x = Math.abs(x), a = [];
|
|
204
|
-
if (x <= 1)
|
|
205
|
-
return [];
|
|
206
|
-
if (x <= 3)
|
|
207
|
-
return [[x, 1]];
|
|
208
|
-
x = pushPrimeExponentialTo$(a, x, 2);
|
|
209
|
-
x = pushPrimeExponentialTo$(a, x, 3);
|
|
210
|
-
for (var i = 6, I = Math.sqrt(x) + 1; x > 1 && i <= I; i += 6) {
|
|
211
|
-
x = pushPrimeExponentialTo$(a, x, i - 1);
|
|
212
|
-
x = pushPrimeExponentialTo$(a, x, i + 1);
|
|
213
|
-
}
|
|
214
|
-
if (x > 1)
|
|
215
|
-
a.push([x, 1]);
|
|
216
|
-
return a;
|
|
217
|
-
}
|
|
218
|
-
extraNumber.primeExponentials = _build.primeExponentials = primeExponentials;
|
|
219
|
-
function pushPrimeExponentialTo$(a, x, f) {
|
|
220
|
-
if (x % f !== 0)
|
|
221
|
-
return x;
|
|
222
|
-
var e = 0;
|
|
223
|
-
do {
|
|
224
|
-
x /= f;
|
|
225
|
-
++e;
|
|
226
|
-
} while (x % f === 0);
|
|
227
|
-
a.push([f, e]);
|
|
228
|
-
return x;
|
|
229
|
-
}
|
|
230
|
-
function isPrime(x) {
|
|
231
|
-
return x !== 0 && minPrimeFactor(x) === Math.abs(x);
|
|
232
|
-
}
|
|
233
|
-
extraNumber.isPrime = _build.isPrime = isPrime;
|
|
234
|
-
function gcd(...xs) {
|
|
235
|
-
var a = xs[0] || 1;
|
|
236
|
-
for (var i = 1, I = xs.length; i < I; i++)
|
|
237
|
-
a = gcdPair(a, xs[i]);
|
|
238
|
-
return a;
|
|
239
|
-
}
|
|
240
|
-
extraNumber.gcd = _build.gcd = gcd;
|
|
241
|
-
extraNumber.hcf = _build.hcf = gcd;
|
|
242
|
-
function gcdPair(x, y) {
|
|
243
|
-
while (y !== 0) {
|
|
244
|
-
var t = y;
|
|
245
|
-
y = x % y;
|
|
246
|
-
x = t;
|
|
247
|
-
}
|
|
248
|
-
return x;
|
|
249
|
-
}
|
|
250
|
-
function lcm(...xs) {
|
|
251
|
-
var a = xs[0] || 1;
|
|
252
|
-
for (var i = 1, I = xs.length; i < I; i++)
|
|
253
|
-
a = a * xs[i] / gcdPair(a, xs[i]);
|
|
254
|
-
return a;
|
|
255
|
-
}
|
|
256
|
-
extraNumber.lcm = _build.lcm = lcm;
|
|
257
|
-
function factorial(n, k = 0) {
|
|
258
|
-
if (n < 0)
|
|
259
|
-
return 0;
|
|
260
|
-
for (var i = k + 1, a = 1; i <= n; i++)
|
|
261
|
-
a *= i;
|
|
262
|
-
return a;
|
|
263
|
-
}
|
|
264
|
-
extraNumber.factorial = _build.factorial = factorial;
|
|
265
|
-
function binomial(n, k) {
|
|
266
|
-
if (k < 0 || k > Math.abs(n))
|
|
267
|
-
return 0;
|
|
268
|
-
if (n < 0)
|
|
269
|
-
return Math.pow(-1, k) * binomial(-n, k);
|
|
270
|
-
k = k > n - k ? n - k : k;
|
|
271
|
-
for (var a = 1, i = 1; i <= k; i++, n--)
|
|
272
|
-
a *= n / i;
|
|
273
|
-
return a;
|
|
274
|
-
}
|
|
275
|
-
extraNumber.binomial = _build.binomial = binomial;
|
|
276
|
-
function multinomial(...ks) {
|
|
277
|
-
var n = sum(...ks), a = 1;
|
|
278
|
-
for (var i = 0, j = 0, I = ks.length; i < I;) {
|
|
279
|
-
if (j <= 0)
|
|
280
|
-
j = ks[i++];
|
|
281
|
-
else
|
|
282
|
-
a *= n-- / j--;
|
|
283
|
-
}
|
|
284
|
-
return a;
|
|
285
|
-
}
|
|
286
|
-
extraNumber.multinomial = _build.multinomial = multinomial;
|
|
287
|
-
function degrees(x) {
|
|
288
|
-
return x * (180 / Math.PI);
|
|
289
|
-
}
|
|
290
|
-
extraNumber.degrees = _build.degrees = degrees;
|
|
291
|
-
function radians(x) {
|
|
292
|
-
return x * (Math.PI / 180);
|
|
293
|
-
}
|
|
294
|
-
extraNumber.radians = _build.radians = radians;
|
|
295
|
-
function sum(...xs) {
|
|
296
|
-
var a = 0;
|
|
297
|
-
for (var x of xs)
|
|
298
|
-
a += x;
|
|
299
|
-
return a;
|
|
300
|
-
}
|
|
301
|
-
extraNumber.sum = _build.sum = sum;
|
|
302
|
-
function product(...xs) {
|
|
303
|
-
var a = 1;
|
|
304
|
-
for (var x of xs)
|
|
305
|
-
a *= x;
|
|
306
|
-
return a;
|
|
307
|
-
}
|
|
308
|
-
extraNumber.product = _build.product = product;
|
|
309
|
-
function median(...xs) {
|
|
310
|
-
if (xs.length === 0)
|
|
311
|
-
return 0;
|
|
312
|
-
xs.sort((a, b) => a - b);
|
|
313
|
-
var i = xs.length >> 1;
|
|
314
|
-
if ((xs.length & 1) === 1)
|
|
315
|
-
return xs[i];
|
|
316
|
-
return (xs[i - 1] + xs[i]) / 2;
|
|
317
|
-
}
|
|
318
|
-
extraNumber.median = _build.median = median;
|
|
319
|
-
function modes(...xs) {
|
|
320
|
-
xs.sort((a, b) => a - b);
|
|
321
|
-
var r = maxRepeat(xs);
|
|
322
|
-
return getRepeats(xs, r);
|
|
323
|
-
}
|
|
324
|
-
extraNumber.modes = _build.modes = modes;
|
|
325
|
-
function maxRepeat(xs) {
|
|
326
|
-
var count = Math.min(xs.length, 1), max = count;
|
|
327
|
-
for (var i = 1, I = xs.length; i < I; i++) {
|
|
328
|
-
if (xs[i - 1] === xs[i])
|
|
329
|
-
count++;
|
|
330
|
-
else {
|
|
331
|
-
max = Math.max(max, count);
|
|
332
|
-
count = 1;
|
|
333
|
-
}
|
|
334
|
-
}
|
|
335
|
-
return Math.max(max, count);
|
|
336
|
-
}
|
|
337
|
-
function getRepeats(xs, r) {
|
|
338
|
-
var a = [];
|
|
339
|
-
r--;
|
|
340
|
-
for (var i = 0, I = xs.length - r; i < I; i++)
|
|
341
|
-
if (xs[i] === xs[i + r])
|
|
342
|
-
a.push(xs[i += r]);
|
|
343
|
-
return a;
|
|
344
|
-
}
|
|
345
|
-
function range(...xs) {
|
|
346
|
-
return [Math.min(...xs), Math.max(...xs)];
|
|
347
|
-
}
|
|
348
|
-
extraNumber.range = _build.range = range;
|
|
349
|
-
function variance(...xs) {
|
|
350
|
-
if (xs.length === 0)
|
|
351
|
-
return 0;
|
|
352
|
-
var m = arithmeticMean(...xs), a = 0;
|
|
353
|
-
for (var x of xs)
|
|
354
|
-
a += (x - m) ** 2;
|
|
355
|
-
return a / xs.length;
|
|
356
|
-
}
|
|
357
|
-
extraNumber.variance = _build.variance = variance;
|
|
358
|
-
function arithmeticMean(...xs) {
|
|
359
|
-
if (xs.length === 0)
|
|
360
|
-
return 0;
|
|
361
|
-
return sum(...xs) / xs.length;
|
|
362
|
-
}
|
|
363
|
-
extraNumber.arithmeticMean = _build.arithmeticMean = arithmeticMean;
|
|
364
|
-
extraNumber.mean = _build.mean = arithmeticMean;
|
|
365
|
-
function geometricMean(...xs) {
|
|
366
|
-
var n = xs.length;
|
|
367
|
-
return root(product(...xs), n);
|
|
368
|
-
}
|
|
369
|
-
extraNumber.geometricMean = _build.geometricMean = geometricMean;
|
|
370
|
-
function harmonicMean(...xs) {
|
|
371
|
-
var n = xs.length;
|
|
372
|
-
var p = product(...xs), q = 0;
|
|
373
|
-
for (var x of xs)
|
|
374
|
-
q += p / x;
|
|
375
|
-
return n * p / q;
|
|
376
|
-
}
|
|
377
|
-
extraNumber.harmonicMean = _build.harmonicMean = harmonicMean;
|
|
378
|
-
function quadriaticMean(...xs) {
|
|
379
|
-
var n = xs.length, a = 0;
|
|
380
|
-
for (var x of xs)
|
|
381
|
-
a += x * x;
|
|
382
|
-
return Math.sqrt(a / n);
|
|
383
|
-
}
|
|
384
|
-
extraNumber.quadriaticMean = _build.quadriaticMean = quadriaticMean;
|
|
385
|
-
extraNumber.rootMeanSquare = _build.rootMeanSquare = quadriaticMean;
|
|
386
|
-
function cubicMean(...xs) {
|
|
387
|
-
var n = xs.length, a = 0;
|
|
388
|
-
for (var x of xs)
|
|
389
|
-
a += x ** 3;
|
|
390
|
-
return Math.cbrt(a / n);
|
|
391
|
-
}
|
|
392
|
-
extraNumber.cubicMean = _build.cubicMean = cubicMean;
|
|
393
|
-
const ROMAN_SYMBOLS = ['I', 'IV', 'V', 'IX', 'X', 'XL', 'L', 'XC', 'C', 'CD', 'D', 'CM', 'M'];
|
|
394
|
-
const ROMAN_VALUES = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000];
|
|
395
|
-
function fromRomanNumerals(txt) {
|
|
396
|
-
var s = ROMAN_SYMBOLS.length - 1;
|
|
397
|
-
var n = txt.search(/^\s*-/) >= 0, a = 0;
|
|
398
|
-
var txt = txt.replace(/\W/g, '').toUpperCase();
|
|
399
|
-
for (var i = 0, I = txt.length; i < I; i += ROMAN_SYMBOLS[s].length) {
|
|
400
|
-
while (s >= 0 && txt.substring(i, i + ROMAN_SYMBOLS[s].length) !== ROMAN_SYMBOLS[s])
|
|
401
|
-
--s;
|
|
402
|
-
if (s < 0)
|
|
403
|
-
break;
|
|
404
|
-
a += ROMAN_VALUES[s];
|
|
405
|
-
}
|
|
406
|
-
return n ? -a : a;
|
|
407
|
-
}
|
|
408
|
-
extraNumber.fromRomanNumerals = _build.fromRomanNumerals = fromRomanNumerals;
|
|
409
|
-
extraNumber.fromRoman = _build.fromRoman = fromRomanNumerals;
|
|
410
|
-
function toRomanNumerals(x) {
|
|
411
|
-
var a = x < 0 ? '-' : '';
|
|
412
|
-
var x = Math.abs(x);
|
|
413
|
-
for (var s = ROMAN_SYMBOLS.length - 1; s >= 0; --s)
|
|
414
|
-
while (x >= ROMAN_VALUES[s]) {
|
|
415
|
-
x -= ROMAN_VALUES[s];
|
|
416
|
-
a += ROMAN_SYMBOLS[s];
|
|
417
|
-
}
|
|
418
|
-
return a;
|
|
419
|
-
}
|
|
420
|
-
extraNumber.toRomanNumerals = _build.toRomanNumerals = toRomanNumerals;
|
|
421
|
-
extraNumber.toRoman = _build.toRoman = toRomanNumerals;
|
|
422
|
-
extraNumber.default = _build;
|
|
423
|
-
|
|
424
|
-
(function (exports) {
|
|
425
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
426
|
-
exports.quadriaticMean = exports.harmonicMean = exports.geometricMean = exports.mean = exports.arithmeticMean = exports.variance = exports.range = exports.modes = exports.median = exports.product = exports.sum = exports.radians = exports.degrees = exports.multinomial = exports.binomial = exports.factorial = exports.lcm = exports.hcf = exports.gcd = exports.isPrime = exports.primeExponentials = exports.primeFactors = exports.greatestPrimeFactor = exports.maxPrimeFactor = exports.leastPrimeFactor = exports.minPrimeFactor = exports.aliquotSum = exports.aliquotParts = exports.properDivisors = exports.log = exports.root = exports.nextPow = exports.prevPow = exports.isPow = exports.map = exports.remap = exports.lerp = exports.norm = exports.normalize = exports.clamp = exports.constrain = exports.modp = exports.mod = exports.rem = exports.roundDiv = exports.ceilDiv = exports.floorDiv = exports.round = exports.ceil = exports.floor = void 0;
|
|
427
|
-
exports.distance = exports.magnitude = exports.cubicMean = exports.rootMeanSquare = void 0;
|
|
428
|
-
var extra_number_1 = extraNumber;
|
|
429
|
-
Object.defineProperty(exports, "floor", { enumerable: true, get: function () { return extra_number_1.floor; } });
|
|
430
|
-
Object.defineProperty(exports, "ceil", { enumerable: true, get: function () { return extra_number_1.ceil; } });
|
|
431
|
-
Object.defineProperty(exports, "round", { enumerable: true, get: function () { return extra_number_1.round; } });
|
|
432
|
-
Object.defineProperty(exports, "floorDiv", { enumerable: true, get: function () { return extra_number_1.floorDiv; } });
|
|
433
|
-
Object.defineProperty(exports, "ceilDiv", { enumerable: true, get: function () { return extra_number_1.ceilDiv; } });
|
|
434
|
-
Object.defineProperty(exports, "roundDiv", { enumerable: true, get: function () { return extra_number_1.roundDiv; } });
|
|
435
|
-
Object.defineProperty(exports, "rem", { enumerable: true, get: function () { return extra_number_1.rem; } });
|
|
436
|
-
Object.defineProperty(exports, "mod", { enumerable: true, get: function () { return extra_number_1.mod; } });
|
|
437
|
-
Object.defineProperty(exports, "modp", { enumerable: true, get: function () { return extra_number_1.modp; } });
|
|
438
|
-
Object.defineProperty(exports, "constrain", { enumerable: true, get: function () { return extra_number_1.constrain; } });
|
|
439
|
-
Object.defineProperty(exports, "clamp", { enumerable: true, get: function () { return extra_number_1.constrain; } });
|
|
440
|
-
Object.defineProperty(exports, "normalize", { enumerable: true, get: function () { return extra_number_1.normalize; } });
|
|
441
|
-
Object.defineProperty(exports, "norm", { enumerable: true, get: function () { return extra_number_1.normalize; } });
|
|
442
|
-
Object.defineProperty(exports, "lerp", { enumerable: true, get: function () { return extra_number_1.lerp; } });
|
|
443
|
-
Object.defineProperty(exports, "remap", { enumerable: true, get: function () { return extra_number_1.remap; } });
|
|
444
|
-
Object.defineProperty(exports, "map", { enumerable: true, get: function () { return extra_number_1.remap; } });
|
|
445
|
-
Object.defineProperty(exports, "isPow", { enumerable: true, get: function () { return extra_number_1.isPow; } });
|
|
446
|
-
Object.defineProperty(exports, "prevPow", { enumerable: true, get: function () { return extra_number_1.prevPow; } });
|
|
447
|
-
Object.defineProperty(exports, "nextPow", { enumerable: true, get: function () { return extra_number_1.nextPow; } });
|
|
448
|
-
Object.defineProperty(exports, "root", { enumerable: true, get: function () { return extra_number_1.root; } });
|
|
449
|
-
Object.defineProperty(exports, "log", { enumerable: true, get: function () { return extra_number_1.log; } });
|
|
450
|
-
Object.defineProperty(exports, "properDivisors", { enumerable: true, get: function () { return extra_number_1.properDivisors; } });
|
|
451
|
-
Object.defineProperty(exports, "aliquotParts", { enumerable: true, get: function () { return extra_number_1.properDivisors; } });
|
|
452
|
-
Object.defineProperty(exports, "aliquotSum", { enumerable: true, get: function () { return extra_number_1.aliquotSum; } });
|
|
453
|
-
Object.defineProperty(exports, "minPrimeFactor", { enumerable: true, get: function () { return extra_number_1.minPrimeFactor; } });
|
|
454
|
-
Object.defineProperty(exports, "leastPrimeFactor", { enumerable: true, get: function () { return extra_number_1.minPrimeFactor; } });
|
|
455
|
-
Object.defineProperty(exports, "maxPrimeFactor", { enumerable: true, get: function () { return extra_number_1.maxPrimeFactor; } });
|
|
456
|
-
Object.defineProperty(exports, "greatestPrimeFactor", { enumerable: true, get: function () { return extra_number_1.maxPrimeFactor; } });
|
|
457
|
-
Object.defineProperty(exports, "primeFactors", { enumerable: true, get: function () { return extra_number_1.primeFactors; } });
|
|
458
|
-
Object.defineProperty(exports, "primeExponentials", { enumerable: true, get: function () { return extra_number_1.primeExponentials; } });
|
|
459
|
-
Object.defineProperty(exports, "isPrime", { enumerable: true, get: function () { return extra_number_1.isPrime; } });
|
|
460
|
-
Object.defineProperty(exports, "gcd", { enumerable: true, get: function () { return extra_number_1.gcd; } });
|
|
461
|
-
Object.defineProperty(exports, "hcf", { enumerable: true, get: function () { return extra_number_1.gcd; } });
|
|
462
|
-
Object.defineProperty(exports, "lcm", { enumerable: true, get: function () { return extra_number_1.lcm; } });
|
|
463
|
-
Object.defineProperty(exports, "factorial", { enumerable: true, get: function () { return extra_number_1.factorial; } });
|
|
464
|
-
Object.defineProperty(exports, "binomial", { enumerable: true, get: function () { return extra_number_1.binomial; } });
|
|
465
|
-
Object.defineProperty(exports, "multinomial", { enumerable: true, get: function () { return extra_number_1.multinomial; } });
|
|
466
|
-
Object.defineProperty(exports, "degrees", { enumerable: true, get: function () { return extra_number_1.degrees; } });
|
|
467
|
-
Object.defineProperty(exports, "radians", { enumerable: true, get: function () { return extra_number_1.radians; } });
|
|
468
|
-
Object.defineProperty(exports, "sum", { enumerable: true, get: function () { return extra_number_1.sum; } });
|
|
469
|
-
Object.defineProperty(exports, "product", { enumerable: true, get: function () { return extra_number_1.product; } });
|
|
470
|
-
Object.defineProperty(exports, "median", { enumerable: true, get: function () { return extra_number_1.median; } });
|
|
471
|
-
Object.defineProperty(exports, "modes", { enumerable: true, get: function () { return extra_number_1.modes; } });
|
|
472
|
-
Object.defineProperty(exports, "range", { enumerable: true, get: function () { return extra_number_1.range; } });
|
|
473
|
-
Object.defineProperty(exports, "variance", { enumerable: true, get: function () { return extra_number_1.variance; } });
|
|
474
|
-
Object.defineProperty(exports, "arithmeticMean", { enumerable: true, get: function () { return extra_number_1.arithmeticMean; } });
|
|
475
|
-
Object.defineProperty(exports, "mean", { enumerable: true, get: function () { return extra_number_1.arithmeticMean; } });
|
|
476
|
-
Object.defineProperty(exports, "geometricMean", { enumerable: true, get: function () { return extra_number_1.geometricMean; } });
|
|
477
|
-
Object.defineProperty(exports, "harmonicMean", { enumerable: true, get: function () { return extra_number_1.harmonicMean; } });
|
|
478
|
-
Object.defineProperty(exports, "quadriaticMean", { enumerable: true, get: function () { return extra_number_1.quadriaticMean; } });
|
|
479
|
-
Object.defineProperty(exports, "rootMeanSquare", { enumerable: true, get: function () { return extra_number_1.quadriaticMean; } });
|
|
480
|
-
Object.defineProperty(exports, "cubicMean", { enumerable: true, get: function () { return extra_number_1.cubicMean; } });
|
|
481
|
-
function magnitude(xs) {
|
|
482
|
-
var a = 0;
|
|
483
|
-
for (var i = 0, I = xs.length; i < I; i++)
|
|
484
|
-
a += xs[i] ** 2;
|
|
485
|
-
return Math.sqrt(a);
|
|
486
|
-
}
|
|
487
|
-
exports.magnitude = magnitude;
|
|
488
|
-
function distance(xs, ys) {
|
|
489
|
-
var a = 0;
|
|
490
|
-
for (var i = 0, I = xs.length; i < I; i++)
|
|
491
|
-
a += (xs[i] - ys[i]) ** 2;
|
|
492
|
-
return Math.sqrt(a);
|
|
493
|
-
}
|
|
494
|
-
exports.distance = distance;
|
|
495
|
-
} (_build$1));
|
|
496
|
-
var index = getDefaultExportFromCjs(_build$1);
|
|
497
|
-
|
|
498
|
-
module.exports = index;
|
|
1
|
+
//#region RE-EXPORTS
|
|
2
|
+
export { // Round
|
|
3
|
+
floor, ceil, round, // Rounded division
|
|
4
|
+
floorDiv, ceilDiv, roundDiv, // Modulo
|
|
5
|
+
rem, mod, modp, // Range control
|
|
6
|
+
constrain, constrain as clamp, normalize, normalize as norm, lerp, remap, remap as map, // Arithmetic
|
|
7
|
+
isPow, prevPow, nextPow, root, log, // Divisors
|
|
8
|
+
properDivisors, properDivisors as aliquotParts, aliquotSum, minPrimeFactor, minPrimeFactor as leastPrimeFactor, maxPrimeFactor, maxPrimeFactor as greatestPrimeFactor, primeFactors, primeExponentials, isPrime, gcd, gcd as hcf, lcm, // Arrangements
|
|
9
|
+
factorial, binomial, multinomial, // Geometry
|
|
10
|
+
degrees, radians, // Statistics
|
|
11
|
+
sum, product, median, modes, range, variance, // Mean (statistics)
|
|
12
|
+
arithmeticMean, arithmeticMean as mean, geometricMean, harmonicMean, quadriaticMean, quadriaticMean as rootMeanSquare, cubicMean } from "@nodef/extra-number";
|
|
13
|
+
//#endregion
|
|
14
|
+
//#region GEOMETRY
|
|
15
|
+
/**
|
|
16
|
+
* Calculate the magnitude (length) of a vector.
|
|
17
|
+
* @param xs vector ([x, y, z, ...])
|
|
18
|
+
* @returns √(x² + y² + z²)
|
|
19
|
+
* @example
|
|
20
|
+
* ```javascript
|
|
21
|
+
* xmath.magnitude([5, 9]);
|
|
22
|
+
* // → 10.295630140987
|
|
23
|
+
*
|
|
24
|
+
* xmath.magnitude([10, 2, -1]);
|
|
25
|
+
* // → 10.246950765959598
|
|
26
|
+
* ```
|
|
27
|
+
*/ export function magnitude(xs) {
|
|
28
|
+
let a = 0;
|
|
29
|
+
for(let i = 0, I = xs.length; i < I; i++)a += xs[i] ** 2;
|
|
30
|
+
return Math.sqrt(a);
|
|
31
|
+
}
|
|
32
|
+
// https://processing.org/reference/mag_.html
|
|
33
|
+
/**
|
|
34
|
+
* Calculate the distance between two points.
|
|
35
|
+
* @param xs first point ([x, y, z, ...])
|
|
36
|
+
* @param ys second point ([x, y, z, ...])
|
|
37
|
+
* @returns √(Δx² + Δy² + Δz²)
|
|
38
|
+
* @example
|
|
39
|
+
* ```javascript
|
|
40
|
+
* xmath.distance([2, -6], [7, 3]);
|
|
41
|
+
* // → 10.295630140987
|
|
42
|
+
*
|
|
43
|
+
* xmath.distance([7, 4, 3], [17, 6, 2]);
|
|
44
|
+
* // → 10.246950765959598
|
|
45
|
+
* ```
|
|
46
|
+
*/ export function distance(xs, ys) {
|
|
47
|
+
let a = 0;
|
|
48
|
+
for(let i = 0, I = xs.length; i < I; i++)a += (xs[i] - ys[i]) ** 2;
|
|
49
|
+
return Math.sqrt(a);
|
|
50
|
+
} // https://processing.org/reference/dist_.html
|
|
51
|
+
//#endregion
|
|
52
|
+
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJzb3VyY2VzIjpbImZpbGU6Ly8vaG9tZS9ydW5uZXIvd29yay9leHRyYS1tYXRoL2V4dHJhLW1hdGgvaW5kZXgudHMiXSwic291cmNlc0NvbnRlbnQiOlsiLy8jcmVnaW9uIFJFLUVYUE9SVFNcbmV4cG9ydCB7XG4gIC8vIFJvdW5kXG4gIGZsb29yLFxuICBjZWlsLFxuICByb3VuZCxcbiAgLy8gUm91bmRlZCBkaXZpc2lvblxuICBmbG9vckRpdixcbiAgY2VpbERpdixcbiAgcm91bmREaXYsXG4gIC8vIE1vZHVsb1xuICByZW0sXG4gIG1vZCxcbiAgbW9kcCxcbiAgLy8gUmFuZ2UgY29udHJvbFxuICBjb25zdHJhaW4sXG4gIGNvbnN0cmFpbiBhcyBjbGFtcCxcbiAgbm9ybWFsaXplLFxuICBub3JtYWxpemUgYXMgbm9ybSxcbiAgbGVycCxcbiAgcmVtYXAsXG4gIHJlbWFwIGFzIG1hcCxcbiAgLy8gQXJpdGhtZXRpY1xuICBpc1BvdyxcbiAgcHJldlBvdyxcbiAgbmV4dFBvdyxcbiAgcm9vdCxcbiAgbG9nLFxuICAvLyBEaXZpc29yc1xuICBwcm9wZXJEaXZpc29ycyxcbiAgcHJvcGVyRGl2aXNvcnMgYXMgYWxpcXVvdFBhcnRzLFxuICBhbGlxdW90U3VtLFxuICBtaW5QcmltZUZhY3RvcixcbiAgbWluUHJpbWVGYWN0b3IgYXMgbGVhc3RQcmltZUZhY3RvcixcbiAgbWF4UHJpbWVGYWN0b3IsXG4gIG1heFByaW1lRmFjdG9yIGFzIGdyZWF0ZXN0UHJpbWVGYWN0b3IsXG4gIHByaW1lRmFjdG9ycyxcbiAgcHJpbWVFeHBvbmVudGlhbHMsXG4gIGlzUHJpbWUsXG4gIGdjZCxcbiAgZ2NkIGFzIGhjZixcbiAgbGNtLFxuICAvLyBBcnJhbmdlbWVudHNcbiAgZmFjdG9yaWFsLFxuICBiaW5vbWlhbCxcbiAgbXVsdGlub21pYWwsXG4gIC8vIEdlb21ldHJ5XG4gIGRlZ3JlZXMsXG4gIHJhZGlhbnMsXG4gIC8vIFN0YXRpc3RpY3NcbiAgc3VtLFxuICBwcm9kdWN0LFxuICBtZWRpYW4sXG4gIG1vZGVzLFxuICByYW5nZSxcbiAgdmFyaWFuY2UsXG4gIC8vIE1lYW4gKHN0YXRpc3RpY3MpXG4gIGFyaXRobWV0aWNNZWFuLFxuICBhcml0aG1ldGljTWVhbiBhcyBtZWFuLFxuICBnZW9tZXRyaWNNZWFuLFxuICBoYXJtb25pY01lYW4sXG4gIHF1YWRyaWF0aWNNZWFuLFxuICBxdWFkcmlhdGljTWVhbiBhcyByb290TWVhblNxdWFyZSxcbiAgY3ViaWNNZWFuLFxufSBmcm9tIFwiQG5vZGVmL2V4dHJhLW51bWJlclwiO1xuLy8jZW5kcmVnaW9uXG5cblxuXG5cbi8vI3JlZ2lvbiBHRU9NRVRSWVxuLyoqXG4gKiBDYWxjdWxhdGUgdGhlIG1hZ25pdHVkZSAobGVuZ3RoKSBvZiBhIHZlY3Rvci5cbiAqIEBwYXJhbSB4cyB2ZWN0b3IgKFt4LCB5LCB6LCAuLi5dKVxuICogQHJldHVybnMg4oiaKHjCsiArIHnCsiArIHrCsilcbiAqIEBleGFtcGxlXG4gKiBgYGBqYXZhc2NyaXB0XG4gKiB4bWF0aC5tYWduaXR1ZGUoWzUsIDldKTtcbiAqIC8vIOKGkiAxMC4yOTU2MzAxNDA5ODdcbiAqXG4gKiB4bWF0aC5tYWduaXR1ZGUoWzEwLCAyLCAtMV0pO1xuICogLy8g4oaSIDEwLjI0Njk1MDc2NTk1OTU5OFxuICogYGBgXG4gKi9cbmV4cG9ydCBmdW5jdGlvbiBtYWduaXR1ZGUoeHM6IG51bWJlcltdKTogbnVtYmVyIHtcbiAgbGV0IGEgPSAwO1xuICBmb3IgKGxldCBpPTAsIEk9eHMubGVuZ3RoOyBpPEk7IGkrKylcbiAgICBhICs9IHhzW2ldKioyO1xuICByZXR1cm4gTWF0aC5zcXJ0KGEpO1xufVxuLy8gaHR0cHM6Ly9wcm9jZXNzaW5nLm9yZy9yZWZlcmVuY2UvbWFnXy5odG1sXG5cblxuLyoqXG4gKiBDYWxjdWxhdGUgdGhlIGRpc3RhbmNlIGJldHdlZW4gdHdvIHBvaW50cy5cbiAqIEBwYXJhbSB4cyBmaXJzdCBwb2ludCAoW3gsIHksIHosIC4uLl0pXG4gKiBAcGFyYW0geXMgc2Vjb25kIHBvaW50IChbeCwgeSwgeiwgLi4uXSlcbiAqIEByZXR1cm5zIOKImijOlHjCsiArIM6UecKyICsgzpR6wrIpXG4gKiBAZXhhbXBsZVxuICogYGBgamF2YXNjcmlwdFxuICogeG1hdGguZGlzdGFuY2UoWzIsIC02XSwgWzcsIDNdKTtcbiAqIC8vIOKGkiAxMC4yOTU2MzAxNDA5ODdcbiAqXG4gKiB4bWF0aC5kaXN0YW5jZShbNywgNCwgM10sIFsxNywgNiwgMl0pO1xuICogLy8g4oaSIDEwLjI0Njk1MDc2NTk1OTU5OFxuICogYGBgXG4gKi9cbmV4cG9ydCBmdW5jdGlvbiBkaXN0YW5jZSh4czogbnVtYmVyW10sIHlzOiBudW1iZXJbXSk6IG51bWJlciB7XG4gIGxldCBhID0gMDtcbiAgZm9yIChsZXQgaT0wLCBJPXhzLmxlbmd0aDsgaTxJOyBpKyspXG4gICAgYSArPSAoeHNbaV0gLSB5c1tpXSkqKjI7XG4gIHJldHVybiBNYXRoLnNxcnQoYSk7XG59XG4vLyBodHRwczovL3Byb2Nlc3Npbmcub3JnL3JlZmVyZW5jZS9kaXN0Xy5odG1sXG4vLyNlbmRyZWdpb25cbiJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiQUFBQSxvQkFBb0I7QUFDcEIsU0FDRSxRQUFRO0FBQ1IsS0FBSyxFQUNMLElBQUksRUFDSixLQUFLLEVBQ0wsbUJBQW1CO0FBQ25CLFFBQVEsRUFDUixPQUFPLEVBQ1AsUUFBUSxFQUNSLFNBQVM7QUFDVCxHQUFHLEVBQ0gsR0FBRyxFQUNILElBQUksRUFDSixnQkFBZ0I7QUFDaEIsU0FBUyxFQUNULGFBQWEsS0FBSyxFQUNsQixTQUFTLEVBQ1QsYUFBYSxJQUFJLEVBQ2pCLElBQUksRUFDSixLQUFLLEVBQ0wsU0FBUyxHQUFHLEVBQ1osYUFBYTtBQUNiLEtBQUssRUFDTCxPQUFPLEVBQ1AsT0FBTyxFQUNQLElBQUksRUFDSixHQUFHLEVBQ0gsV0FBVztBQUNYLGNBQWMsRUFDZCxrQkFBa0IsWUFBWSxFQUM5QixVQUFVLEVBQ1YsY0FBYyxFQUNkLGtCQUFrQixnQkFBZ0IsRUFDbEMsY0FBYyxFQUNkLGtCQUFrQixtQkFBbUIsRUFDckMsWUFBWSxFQUNaLGlCQUFpQixFQUNqQixPQUFPLEVBQ1AsR0FBRyxFQUNILE9BQU8sR0FBRyxFQUNWLEdBQUcsRUFDSCxlQUFlO0FBQ2YsU0FBUyxFQUNULFFBQVEsRUFDUixXQUFXLEVBQ1gsV0FBVztBQUNYLE9BQU8sRUFDUCxPQUFPLEVBQ1AsYUFBYTtBQUNiLEdBQUcsRUFDSCxPQUFPLEVBQ1AsTUFBTSxFQUNOLEtBQUssRUFDTCxLQUFLLEVBQ0wsUUFBUSxFQUNSLG9CQUFvQjtBQUNwQixjQUFjLEVBQ2Qsa0JBQWtCLElBQUksRUFDdEIsYUFBYSxFQUNiLFlBQVksRUFDWixjQUFjLEVBQ2Qsa0JBQWtCLGNBQWMsRUFDaEMsU0FBUyxRQUNKLHNCQUFzQjtBQUM3QixZQUFZO0FBS1osa0JBQWtCO0FBQ2xCOzs7Ozs7Ozs7Ozs7Q0FZQyxHQUNELE9BQU8sU0FBUyxVQUFVLEVBQVk7RUFDcEMsSUFBSSxJQUFJO0VBQ1IsSUFBSyxJQUFJLElBQUUsR0FBRyxJQUFFLEdBQUcsTUFBTSxFQUFFLElBQUUsR0FBRyxJQUM5QixLQUFLLEVBQUUsQ0FBQyxFQUFFLElBQUU7RUFDZCxPQUFPLEtBQUssSUFBSSxDQUFDO0FBQ25CO0FBQ0EsNkNBQTZDO0FBRzdDOzs7Ozs7Ozs7Ozs7O0NBYUMsR0FDRCxPQUFPLFNBQVMsU0FBUyxFQUFZLEVBQUUsRUFBWTtFQUNqRCxJQUFJLElBQUk7RUFDUixJQUFLLElBQUksSUFBRSxHQUFHLElBQUUsR0FBRyxNQUFNLEVBQUUsSUFBRSxHQUFHLElBQzlCLEtBQUssQ0FBQyxFQUFFLENBQUMsRUFBRSxHQUFHLEVBQUUsQ0FBQyxFQUFFLEtBQUc7RUFDeEIsT0FBTyxLQUFLLElBQUksQ0FBQztBQUNuQixFQUNBLDhDQUE4QztDQUM5QyxZQUFZIn0=
|
package/index.test.ts
ADDED
|
@@ -0,0 +1,105 @@
|
|
|
1
|
+
import {assertEquals} from "@std/assert";
|
|
2
|
+
import * as xmath from "./index.ts";
|
|
3
|
+
import {
|
|
4
|
+
magnitude,
|
|
5
|
+
distance,
|
|
6
|
+
} from "./index.ts";
|
|
7
|
+
// import {gamma} from "../src";
|
|
8
|
+
// import {lgamma} from "../src";
|
|
9
|
+
// import {erf} from "../src";
|
|
10
|
+
// import {erfc} from "../src";
|
|
11
|
+
|
|
12
|
+
|
|
13
|
+
|
|
14
|
+
|
|
15
|
+
// 1. Basic tests.
|
|
16
|
+
Deno.test("example1", () => {
|
|
17
|
+
const a = xmath.sum(1, 2, 3, 4);
|
|
18
|
+
assertEquals(a, 10);
|
|
19
|
+
// → 10
|
|
20
|
+
|
|
21
|
+
const b = xmath.median(1, 7, 8);
|
|
22
|
+
assertEquals(b, 7);
|
|
23
|
+
// → 7
|
|
24
|
+
|
|
25
|
+
const c = xmath.variance(1, 2, 3, 4);
|
|
26
|
+
assertEquals(c, 1.25);
|
|
27
|
+
// → 1.25
|
|
28
|
+
|
|
29
|
+
const d = xmath.lcm(2, 3, 4);
|
|
30
|
+
assertEquals(d, 12);
|
|
31
|
+
// → 12
|
|
32
|
+
});
|
|
33
|
+
|
|
34
|
+
|
|
35
|
+
|
|
36
|
+
|
|
37
|
+
// GEOMETRY
|
|
38
|
+
// --------
|
|
39
|
+
|
|
40
|
+
Deno.test("magnitude", () => {
|
|
41
|
+
const a = magnitude([5, 9]);
|
|
42
|
+
assertEquals(a, Math.sqrt(106));
|
|
43
|
+
const b = magnitude([10, 2, -1]);
|
|
44
|
+
assertEquals(b, Math.sqrt(105));
|
|
45
|
+
});
|
|
46
|
+
// - https://www.cuemath.com/geometry/distance-between-two-points/
|
|
47
|
+
// - https://www.calculatorsoup.com/calculators/geometry-solids/distance-two-points.php
|
|
48
|
+
|
|
49
|
+
|
|
50
|
+
Deno.test("distance", () => {
|
|
51
|
+
const a = distance([2, -6], [7, 3]);
|
|
52
|
+
assertEquals(a, Math.sqrt(106));
|
|
53
|
+
const b = distance([7, 4, 3], [17, 6, 2]);
|
|
54
|
+
assertEquals(b, Math.sqrt(105));
|
|
55
|
+
});
|
|
56
|
+
// - https://www.cuemath.com/geometry/distance-between-two-points/
|
|
57
|
+
// - https://www.calculatorsoup.com/calculators/geometry-solids/distance-two-points.php
|
|
58
|
+
|
|
59
|
+
|
|
60
|
+
// Deno.test("gamma", () => {
|
|
61
|
+
// var a = gamma(1/2);
|
|
62
|
+
// assertEquals(a, Math.sqrt(Math.PI));
|
|
63
|
+
// var a = gamma(3/2);
|
|
64
|
+
// assertEquals(a, (1/2)*Math.sqrt(Math.PI));
|
|
65
|
+
// var a = gamma(-3/2);
|
|
66
|
+
// assertEquals(a, (4/3)*Math.sqrt(Math.PI));
|
|
67
|
+
// var a = gamma(-5/2);
|
|
68
|
+
// assertEquals(a, -(8/15)*Math.sqrt(Math.PI));
|
|
69
|
+
// });
|
|
70
|
+
// - https://en.wikipedia.org/wiki/Gamma_function
|
|
71
|
+
|
|
72
|
+
|
|
73
|
+
// Deno.test("lgamma", () => {
|
|
74
|
+
// var a = lgamma(2);
|
|
75
|
+
// assertEquals(a, 0);
|
|
76
|
+
// var a = lgamma(3);
|
|
77
|
+
// assertEquals(a, 0.6931472);
|
|
78
|
+
// var a = lgamma(5);
|
|
79
|
+
// assertEquals(a, 3.178054);
|
|
80
|
+
// });
|
|
81
|
+
// - https://www.geeksforgeeks.org/compute-the-natural-logarithm-of-the-absolute-value-of-gamma-function-in-r-programming-lgamma-function/
|
|
82
|
+
|
|
83
|
+
|
|
84
|
+
// Deno.test("erf", () => {
|
|
85
|
+
// var a = erf(0);
|
|
86
|
+
// assertEquals(a, 9.999999717180685e-10);
|
|
87
|
+
// var a = erf(0.1);
|
|
88
|
+
// assertEquals(a, 0.11246296562219549);
|
|
89
|
+
// var a = erf(1);
|
|
90
|
+
// assertEquals(a, 0.8427006897475899);
|
|
91
|
+
// var a = erf(-1); // sp
|
|
92
|
+
// assertEquals(a, -0.8427006897475899); // sp
|
|
93
|
+
// });
|
|
94
|
+
|
|
95
|
+
|
|
96
|
+
// Deno.test("erfc", () => {
|
|
97
|
+
// var a = erfc(0);
|
|
98
|
+
// assertEquals(a, 0.9999999999999999);
|
|
99
|
+
// var a = erfc(0.1);
|
|
100
|
+
// assertEquals(a, 0.887537083981715);
|
|
101
|
+
// var a = erfc(1);
|
|
102
|
+
// assertEquals(a, 0.1572992070502851);
|
|
103
|
+
// var a = erfc(-1); // sp
|
|
104
|
+
// assertEquals(a, 2-0.1572992070502851); // sp
|
|
105
|
+
// });
|