@danielsimonjr/mathts-functions 0.64.2 → 0.64.3
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/README.md +21 -21
- package/dist/algebra/decomposition/lup.d.ts.map +1 -1
- package/dist/algebra/simplify/util.d.ts.map +1 -1
- package/dist/algebra/simplifyConstant.d.ts.map +1 -1
- package/dist/algebra/solver/lsolve.d.ts.map +1 -1
- package/dist/algebra/solver/lusolve.d.ts.map +1 -1
- package/dist/algebra/solver/usolve.d.ts.map +1 -1
- package/dist/arithmetic/ceil.d.ts.map +1 -1
- package/dist/arithmetic/divide.d.ts.map +1 -1
- package/dist/arithmetic/fix.d.ts.map +1 -1
- package/dist/arithmetic/floor.d.ts.map +1 -1
- package/dist/arithmetic/round.d.ts.map +1 -1
- package/dist/bitwise/leftShift.d.ts.map +1 -1
- package/dist/bitwise/rightArithShift.d.ts.map +1 -1
- package/dist/bitwise/rightLogShift.d.ts.map +1 -1
- package/dist/bitwise/useMatrixForArrayScalar.d.ts.map +1 -1
- package/dist/calculus-extra.d.ts.map +1 -1
- package/dist/complex/conj.d.ts.map +1 -1
- package/dist/complex/re.d.ts.map +1 -1
- package/dist/distribution-functions.d.ts.map +1 -1
- package/dist/geometry-extra.d.ts.map +1 -1
- package/dist/index.js +333 -89
- package/dist/logical/and.d.ts.map +1 -1
- package/dist/logical/nullish.d.ts.map +1 -1
- package/dist/matrix/det.d.ts +1 -1
- package/dist/matrix/det.d.ts.map +1 -1
- package/dist/matrix/diag.d.ts.map +1 -1
- package/dist/matrix/eigs/complexEigs.d.ts +1 -1
- package/dist/matrix/eigs/complexEigs.d.ts.map +1 -1
- package/dist/matrix/eigs.d.ts +1 -1
- package/dist/matrix/eigs.d.ts.map +1 -1
- package/dist/matrix/inv.d.ts +1 -1
- package/dist/matrix/inv.d.ts.map +1 -1
- package/dist/matrix/matrixFromColumns.d.ts.map +1 -1
- package/dist/matrix/matrixFromRows.d.ts.map +1 -1
- package/dist/matrix/native-accel.d.ts.map +1 -1
- package/dist/matrix/ones.d.ts.map +1 -1
- package/dist/matrix/pinv.d.ts +1 -1
- package/dist/matrix/pinv.d.ts.map +1 -1
- package/dist/matrix/range.d.ts.map +1 -1
- package/dist/matrix/resize.d.ts.map +1 -1
- package/dist/matrix/sqrtm.d.ts +1 -1
- package/dist/matrix/sqrtm.d.ts.map +1 -1
- package/dist/matrix/subset.d.ts.map +1 -1
- package/dist/matrix/zeros.d.ts.map +1 -1
- package/dist/trigonometry/atan2.d.ts.map +1 -1
- package/dist/type/bignumber/BigNumber.d.ts +1 -1
- package/dist/type/bignumber/BigNumber.d.ts.map +1 -1
- package/dist/type/matrix/function/index.d.ts.map +1 -1
- package/dist/type/matrix/utils/matAlgo09xS0Sf.d.ts.map +1 -1
- package/dist/type/matrix/utils/matAlgo11xS0s.d.ts.map +1 -1
- package/dist/type/matrix/utils/matrixAlgorithmSuite.d.ts.map +1 -1
- package/dist/type/unit/physicalConstants.d.ts +1 -1
- package/dist/type/unit/physicalConstants.d.ts.map +1 -1
- package/dist/typed/arithmetic.d.ts +91 -91
- package/dist/typed/arithmetic.d.ts.map +1 -1
- package/dist/typed/bitwise.d.ts +14 -14
- package/dist/typed/bitwise.d.ts.map +1 -1
- package/dist/typed/combinatorics.d.ts +21 -21
- package/dist/typed/combinatorics.d.ts.map +1 -1
- package/dist/typed/complex.d.ts +8 -8
- package/dist/typed/complex.d.ts.map +1 -1
- package/dist/typed/distributions.d.ts +28 -28
- package/dist/typed/distributions.d.ts.map +1 -1
- package/dist/typed/graph.d.ts.map +1 -1
- package/dist/typed/logical.d.ts +10 -10
- package/dist/typed/logical.d.ts.map +1 -1
- package/dist/typed/matrix-ops.d.ts +9 -9
- package/dist/typed/matrix-ops.d.ts.map +1 -1
- package/dist/typed/probability.d.ts +16 -16
- package/dist/typed/probability.d.ts.map +1 -1
- package/dist/typed/relational.d.ts +14 -14
- package/dist/typed/relational.d.ts.map +1 -1
- package/dist/typed/set.d.ts +20 -20
- package/dist/typed/set.d.ts.map +1 -1
- package/dist/typed/signal.d.ts +14 -14
- package/dist/typed/signal.d.ts.map +1 -1
- package/dist/typed/special.d.ts +76 -76
- package/dist/typed/special.d.ts.map +1 -1
- package/dist/typed/statistics.d.ts +34 -34
- package/dist/typed/statistics.d.ts.map +1 -1
- package/dist/typed/string.d.ts +10 -10
- package/dist/typed/string.d.ts.map +1 -1
- package/dist/typed/trigonometry.d.ts +38 -38
- package/dist/typed/trigonometry.d.ts.map +1 -1
- package/dist/typed/unit.d.ts +4 -4
- package/dist/typed/unit.d.ts.map +1 -1
- package/dist/types.d.ts +1 -1
- package/package.json +76 -76
- package/types/assemblyscript.d.ts +101 -101
- package/types/index.d.ts +7801 -7801
- package/types/modules.d.ts +19 -19
|
@@ -28,161 +28,161 @@ type i32 = number;
|
|
|
28
28
|
* await add(float64A, float64B); // Parallel array add
|
|
29
29
|
* ```
|
|
30
30
|
*/
|
|
31
|
-
export declare const add: import("
|
|
31
|
+
export declare const add: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
32
32
|
/**
|
|
33
33
|
* Polymorphic subtraction function with parallel execution for arrays
|
|
34
34
|
*/
|
|
35
|
-
export declare const subtract: import("
|
|
35
|
+
export declare const subtract: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
36
36
|
/**
|
|
37
37
|
* Polymorphic multiplication function with parallel execution for arrays
|
|
38
38
|
*/
|
|
39
|
-
export declare const multiply: import("
|
|
39
|
+
export declare const multiply: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
40
40
|
/**
|
|
41
41
|
* Polymorphic division function with parallel execution for arrays
|
|
42
42
|
*/
|
|
43
|
-
export declare const divide: import("
|
|
43
|
+
export declare const divide: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
44
44
|
/**
|
|
45
45
|
* Unary negation with parallel array support
|
|
46
46
|
*/
|
|
47
|
-
export declare const unaryMinus: import("
|
|
47
|
+
export declare const unaryMinus: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
48
48
|
/**
|
|
49
49
|
* Unary plus (identity)
|
|
50
50
|
*/
|
|
51
|
-
export declare const unaryPlus: import("
|
|
51
|
+
export declare const unaryPlus: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
52
52
|
/**
|
|
53
53
|
* Absolute value with parallel array support
|
|
54
54
|
*/
|
|
55
|
-
export declare const abs: import("
|
|
55
|
+
export declare const abs: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
56
56
|
/**
|
|
57
57
|
* Sign function
|
|
58
58
|
*/
|
|
59
|
-
export declare const sign: import("
|
|
59
|
+
export declare const sign: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
60
60
|
/**
|
|
61
61
|
* Power function
|
|
62
62
|
*/
|
|
63
|
-
export declare const pow: import("
|
|
63
|
+
export declare const pow: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
64
64
|
/**
|
|
65
65
|
* Square root with parallel array support
|
|
66
66
|
*/
|
|
67
|
-
export declare const sqrt: import("
|
|
67
|
+
export declare const sqrt: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
68
68
|
/**
|
|
69
69
|
* Square with parallel array support
|
|
70
70
|
*/
|
|
71
|
-
export declare const square: import("
|
|
71
|
+
export declare const square: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
72
72
|
/**
|
|
73
73
|
* Cube
|
|
74
74
|
*/
|
|
75
|
-
export declare const cube: import("
|
|
75
|
+
export declare const cube: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
76
76
|
/**
|
|
77
77
|
* Cube root
|
|
78
78
|
*/
|
|
79
|
-
export declare const cbrt: import("
|
|
79
|
+
export declare const cbrt: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
80
80
|
/**
|
|
81
81
|
* N-th root
|
|
82
82
|
*/
|
|
83
|
-
export declare const nthRoot: import("
|
|
83
|
+
export declare const nthRoot: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
84
84
|
/**
|
|
85
85
|
* Exponential function (e^x) with parallel array support
|
|
86
86
|
*/
|
|
87
|
-
export declare const exp: import("
|
|
87
|
+
export declare const exp: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
88
88
|
/**
|
|
89
89
|
* Natural logarithm (ln x) with parallel array support
|
|
90
90
|
*/
|
|
91
|
-
export declare const log: import("
|
|
91
|
+
export declare const log: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
92
92
|
/**
|
|
93
93
|
* Base-10 logarithm
|
|
94
94
|
*/
|
|
95
|
-
export declare const log10: import("
|
|
95
|
+
export declare const log10: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
96
96
|
/**
|
|
97
97
|
* Base-2 logarithm
|
|
98
98
|
*/
|
|
99
|
-
export declare const log2: import("
|
|
99
|
+
export declare const log2: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
100
100
|
/**
|
|
101
101
|
* log(1 + x) with higher precision for small x
|
|
102
102
|
*/
|
|
103
|
-
export declare const log1p: import("
|
|
103
|
+
export declare const log1p: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
104
104
|
/**
|
|
105
105
|
* exp(x) - 1 with higher precision for small x
|
|
106
106
|
*/
|
|
107
|
-
export declare const expm1: import("
|
|
107
|
+
export declare const expm1: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
108
108
|
/**
|
|
109
109
|
* Round to nearest integer
|
|
110
110
|
*/
|
|
111
|
-
export declare const round: import("
|
|
111
|
+
export declare const round: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
112
112
|
/**
|
|
113
113
|
* Floor (round down)
|
|
114
114
|
*/
|
|
115
|
-
export declare const floor: import("
|
|
115
|
+
export declare const floor: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
116
116
|
/**
|
|
117
117
|
* Ceiling (round up)
|
|
118
118
|
*/
|
|
119
|
-
export declare const ceil: import("
|
|
119
|
+
export declare const ceil: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
120
120
|
/**
|
|
121
121
|
* Truncate (round toward zero)
|
|
122
122
|
*/
|
|
123
|
-
export declare const fix: import("
|
|
123
|
+
export declare const fix: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
124
124
|
/**
|
|
125
125
|
* Modulo operation
|
|
126
126
|
*/
|
|
127
|
-
export declare const mod: import("
|
|
127
|
+
export declare const mod: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
128
128
|
/**
|
|
129
129
|
* Greatest common divisor
|
|
130
130
|
*/
|
|
131
|
-
export declare const gcd: import("
|
|
131
|
+
export declare const gcd: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
132
132
|
/**
|
|
133
133
|
* Least common multiple
|
|
134
134
|
*/
|
|
135
|
-
export declare const lcm: import("
|
|
135
|
+
export declare const lcm: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
136
136
|
/**
|
|
137
137
|
* Extended greatest common divisor
|
|
138
138
|
* Returns [gcd, x, y] where gcd = a*x + b*y (Bezout coefficients)
|
|
139
139
|
*/
|
|
140
|
-
export declare const xgcd: import("
|
|
141
|
-
export declare const norm: import("
|
|
140
|
+
export declare const xgcd: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
141
|
+
export declare const norm: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
142
142
|
/**
|
|
143
143
|
* Hyperbolic sine
|
|
144
144
|
*/
|
|
145
|
-
export declare const sinh: import("
|
|
145
|
+
export declare const sinh: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
146
146
|
/**
|
|
147
147
|
* Hyperbolic cosine
|
|
148
148
|
*/
|
|
149
|
-
export declare const cosh: import("
|
|
149
|
+
export declare const cosh: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
150
150
|
/**
|
|
151
151
|
* Hyperbolic tangent
|
|
152
152
|
*/
|
|
153
|
-
export declare const tanh: import("
|
|
153
|
+
export declare const tanh: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
154
154
|
/**
|
|
155
155
|
* Check if values are equal
|
|
156
156
|
*/
|
|
157
|
-
export declare const equal: import("
|
|
157
|
+
export declare const equal: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
158
158
|
/**
|
|
159
159
|
* Check if a < b
|
|
160
160
|
*/
|
|
161
|
-
export declare const smaller: import("
|
|
161
|
+
export declare const smaller: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
162
162
|
/**
|
|
163
163
|
* Check if a > b
|
|
164
164
|
*/
|
|
165
|
-
export declare const larger: import("
|
|
165
|
+
export declare const larger: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
166
166
|
/**
|
|
167
167
|
* Check if a <= b
|
|
168
168
|
*/
|
|
169
|
-
export declare const smallerEq: import("
|
|
169
|
+
export declare const smallerEq: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
170
170
|
/**
|
|
171
171
|
* Check if a >= b
|
|
172
172
|
*/
|
|
173
|
-
export declare const largerEq: import("
|
|
173
|
+
export declare const largerEq: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
174
174
|
/**
|
|
175
175
|
* Compare two values: -1, 0, or 1
|
|
176
176
|
*/
|
|
177
|
-
export declare const compare: import("
|
|
177
|
+
export declare const compare: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
178
178
|
/**
|
|
179
179
|
* Minimum of values with parallel array support
|
|
180
180
|
*/
|
|
181
|
-
export declare const min: import("
|
|
181
|
+
export declare const min: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
182
182
|
/**
|
|
183
183
|
* Maximum of values with parallel array support
|
|
184
184
|
*/
|
|
185
|
-
export declare const max: import("
|
|
185
|
+
export declare const max: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
186
186
|
/**
|
|
187
187
|
* Sum with parallel array support
|
|
188
188
|
*/
|
|
@@ -199,12 +199,12 @@ export declare const max: import("typed-function").TypedFunction;
|
|
|
199
199
|
* ~2-4x slower than `sum`, so it is opt-in. Reach for it when the result is a small difference of
|
|
200
200
|
* large terms: conservation checks, residuals, long-running accumulators.
|
|
201
201
|
*/
|
|
202
|
-
export declare const fsum: import("
|
|
203
|
-
export declare const sum: import("
|
|
202
|
+
export declare const fsum: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
203
|
+
export declare const sum: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
204
204
|
/**
|
|
205
205
|
* Mean with parallel array support
|
|
206
206
|
*/
|
|
207
|
-
export declare const mean: import("
|
|
207
|
+
export declare const mean: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
208
208
|
/**
|
|
209
209
|
* Variance normalization, matching mathjs's `variance(array, normalization)`:
|
|
210
210
|
* - 'unbiased' → sum2 / (n - 1) (sample variance; mathjs DEFAULT)
|
|
@@ -219,16 +219,16 @@ export type VarNormalization = 'unbiased' | 'uncorrected' | 'biased';
|
|
|
219
219
|
* `parallelStatVariance` variant. An optional normalization argument selects
|
|
220
220
|
* 'unbiased' | 'uncorrected' (population) | 'biased'. See VarNormalization.
|
|
221
221
|
*/
|
|
222
|
-
export declare const variance: import("
|
|
222
|
+
export declare const variance: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
223
223
|
/**
|
|
224
224
|
* Standard deviation with parallel array support — sqrt of {@link variance};
|
|
225
225
|
* defaults to **unbiased** and accepts the same normalization argument.
|
|
226
226
|
*/
|
|
227
|
-
export declare const std: import("
|
|
227
|
+
export declare const std: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
228
228
|
/**
|
|
229
229
|
* Dot product with parallel array support
|
|
230
230
|
*/
|
|
231
|
-
export declare const dot: import("
|
|
231
|
+
export declare const dot: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
232
232
|
/**
|
|
233
233
|
* Parallel matrix multiplication
|
|
234
234
|
* @param a First matrix as flat Float64Array (row-major)
|
|
@@ -267,51 +267,51 @@ export declare function shouldParallelize(elementCount: i32): boolean;
|
|
|
267
267
|
*/
|
|
268
268
|
export declare function getComputePool(): ComputePool;
|
|
269
269
|
export declare const typedArithmetic: {
|
|
270
|
-
add: import("
|
|
271
|
-
subtract: import("
|
|
272
|
-
multiply: import("
|
|
273
|
-
divide: import("
|
|
274
|
-
unaryMinus: import("
|
|
275
|
-
unaryPlus: import("
|
|
276
|
-
abs: import("
|
|
277
|
-
sign: import("
|
|
278
|
-
pow: import("
|
|
279
|
-
sqrt: import("
|
|
280
|
-
square: import("
|
|
281
|
-
cube: import("
|
|
282
|
-
cbrt: import("
|
|
283
|
-
nthRoot: import("
|
|
284
|
-
exp: import("
|
|
285
|
-
log: import("
|
|
286
|
-
log10: import("
|
|
287
|
-
log2: import("
|
|
288
|
-
log1p: import("
|
|
289
|
-
expm1: import("
|
|
290
|
-
round: import("
|
|
291
|
-
floor: import("
|
|
292
|
-
ceil: import("
|
|
293
|
-
fix: import("
|
|
294
|
-
mod: import("
|
|
295
|
-
gcd: import("
|
|
296
|
-
lcm: import("
|
|
297
|
-
xgcd: import("
|
|
298
|
-
norm: import("
|
|
299
|
-
sinh: import("
|
|
300
|
-
cosh: import("
|
|
301
|
-
tanh: import("
|
|
302
|
-
equal: import("
|
|
303
|
-
smaller: import("
|
|
304
|
-
larger: import("
|
|
305
|
-
smallerEq: import("
|
|
306
|
-
largerEq: import("
|
|
307
|
-
compare: import("
|
|
308
|
-
min: import("
|
|
309
|
-
max: import("
|
|
310
|
-
sum: import("
|
|
311
|
-
mean: import("
|
|
312
|
-
variance: import("
|
|
313
|
-
std: import("
|
|
314
|
-
dot: import("
|
|
270
|
+
add: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
271
|
+
subtract: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
272
|
+
multiply: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
273
|
+
divide: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
274
|
+
unaryMinus: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
275
|
+
unaryPlus: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
276
|
+
abs: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
277
|
+
sign: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
278
|
+
pow: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
279
|
+
sqrt: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
280
|
+
square: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
281
|
+
cube: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
282
|
+
cbrt: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
283
|
+
nthRoot: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
284
|
+
exp: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
285
|
+
log: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
286
|
+
log10: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
287
|
+
log2: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
288
|
+
log1p: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
289
|
+
expm1: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
290
|
+
round: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
291
|
+
floor: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
292
|
+
ceil: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
293
|
+
fix: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
294
|
+
mod: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
295
|
+
gcd: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
296
|
+
lcm: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
297
|
+
xgcd: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
298
|
+
norm: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
299
|
+
sinh: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
300
|
+
cosh: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
301
|
+
tanh: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
302
|
+
equal: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
303
|
+
smaller: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
304
|
+
larger: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
305
|
+
smallerEq: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
306
|
+
largerEq: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
307
|
+
compare: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
308
|
+
min: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
309
|
+
max: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
310
|
+
sum: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
311
|
+
mean: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
312
|
+
variance: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
313
|
+
std: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
314
|
+
dot: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
315
315
|
matmul: typeof matmul;
|
|
316
316
|
transpose: typeof transpose;
|
|
317
317
|
matvec: typeof matvec;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"arithmetic.d.ts","sourceRoot":"","sources":["../../src/typed/arithmetic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AA0BH,OAAO,EAAe,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAU1E,4BAA4B;AAC5B,KAAK,GAAG,GAAG,MAAM,CAAC;AAkIlB;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,GAAG,
|
|
1
|
+
{"version":3,"file":"arithmetic.d.ts","sourceRoot":"","sources":["../../src/typed/arithmetic.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AA0BH,OAAO,EAAe,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAU1E,4BAA4B;AAC5B,KAAK,GAAG,GAAG,MAAM,CAAC;AAkIlB;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,GAAG,oDAgEd,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,QAAQ,oDAiCnB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,QAAQ,oDA8FnB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,MAAM,oDAkCjB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,UAAU,oDAYrB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,oDAOpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAgBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAqBf,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAmDd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAgBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,MAAM,oDAajB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAkBf,CAAC;AAaH;;GAEG;AACH,eAAO,MAAM,IAAI,oDA4Bf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,oDAIlB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAad,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAcd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,oDAiBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAiBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,oDAehB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,oDAehB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,KAAK,oDAuBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,KAAK,oDAgBhB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAgBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAkBd,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAKd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDA+Bd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAgBd,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,IAAI,oDAuDf,CAAC;AAwEH,eAAO,MAAM,IAAI,oDAmCf,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAiBf,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAef,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAiBf,CAAC;AAMH;;GAEG;AAIH,eAAO,MAAM,KAAK,oDAchB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,oDAMlB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,MAAM,oDAMjB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,SAAS,oDAMpB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,QAAQ,oDAMnB,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,OAAO,oDAMlB,CAAC;AAMH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAmBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAkBd,CAAC;AAMH;;GAEG;AACH;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,IAAI,oDAGf,CAAC;AAEH,eAAO,MAAM,GAAG,oDAuBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,IAAI,oDAWf,CAAC;AAEH;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,aAAa,GAAG,QAAQ,CAAC;AAwBrE;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,oDAenB,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,GAAG,oDAiBd,CAAC;AAEH;;GAEG;AACH,eAAO,MAAM,GAAG,oDAad,CAAC;AAMH;;;;;;;GAOG;AACH,wBAAsB,MAAM,CAC1B,CAAC,EAAE,YAAY,EACf,KAAK,EAAE,GAAG,EACV,KAAK,EAAE,GAAG,EACV,CAAC,EAAE,YAAY,EACf,KAAK,EAAE,GAAG,GACT,OAAO,CAAC,YAAY,CAAC,CAGvB;AAED;;GAEG;AACH,wBAAsB,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,CAG/F;AAED;;GAEG;AACH,wBAAsB,MAAM,CAC1B,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,GAAG,EACT,IAAI,EAAE,GAAG,EACT,MAAM,EAAE,YAAY,GACnB,OAAO,CAAC,YAAY,CAAC,CAGvB;AAED;;GAEG;AACH,wBAAsB,KAAK,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,CAAC,CAGnF;AAMD;;GAEG;AACH,wBAAsB,cAAc,IAAI,OAAO,CAAC,IAAI,CAAC,CAEpD;AAED;;GAEG;AACH,wBAAsB,aAAa,IAAI,OAAO,CAAC,IAAI,CAAC,CAEnD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,YAAY,EAAE,GAAG,GAAG,OAAO,CAE5D;AAED;;GAEG;AACH,wBAAgB,cAAc,IAAI,WAAW,CAE5C;AAMD,eAAO,MAAM,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CA+E3B,CAAC"}
|
package/dist/typed/bitwise.d.ts
CHANGED
|
@@ -29,20 +29,20 @@
|
|
|
29
29
|
* await bitAnd(int32A, int32B); // Parallel Int32Array AND
|
|
30
30
|
* ```
|
|
31
31
|
*/
|
|
32
|
-
export declare const bitAnd: import("
|
|
33
|
-
export declare const bitOr: import("
|
|
34
|
-
export declare const bitXor: import("
|
|
35
|
-
export declare const bitNot: import("
|
|
36
|
-
export declare const leftShift: import("
|
|
37
|
-
export declare const rightArithShift: import("
|
|
38
|
-
export declare const rightLogShift: import("
|
|
32
|
+
export declare const bitAnd: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
33
|
+
export declare const bitOr: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
34
|
+
export declare const bitXor: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
35
|
+
export declare const bitNot: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
36
|
+
export declare const leftShift: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
37
|
+
export declare const rightArithShift: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
38
|
+
export declare const rightLogShift: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
39
39
|
export declare const typedBitwise: {
|
|
40
|
-
bitAnd: import("
|
|
41
|
-
bitOr: import("
|
|
42
|
-
bitXor: import("
|
|
43
|
-
bitNot: import("
|
|
44
|
-
leftShift: import("
|
|
45
|
-
rightArithShift: import("
|
|
46
|
-
rightLogShift: import("
|
|
40
|
+
bitAnd: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
41
|
+
bitOr: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
42
|
+
bitXor: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
43
|
+
bitNot: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
44
|
+
leftShift: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
45
|
+
rightArithShift: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
46
|
+
rightLogShift: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
47
47
|
};
|
|
48
48
|
//# sourceMappingURL=bitwise.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"bitwise.d.ts","sourceRoot":"","sources":["../../src/typed/bitwise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AA2FH;;;;;;;;;GASG;AACH,eAAO,MAAM,MAAM,
|
|
1
|
+
{"version":3,"file":"bitwise.d.ts","sourceRoot":"","sources":["../../src/typed/bitwise.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AA2FH;;;;;;;;;GASG;AACH,eAAO,MAAM,MAAM,oDAmCjB,CAAC;AAMH,eAAO,MAAM,KAAK,oDAgChB,CAAC;AAMH,eAAO,MAAM,MAAM,oDAgCjB,CAAC;AAMH,eAAO,MAAM,MAAM,oDAuBjB,CAAC;AAMH,eAAO,MAAM,SAAS,oDAwCpB,CAAC;AAMH,eAAO,MAAM,eAAe,oDAwC1B,CAAC;AAMH,eAAO,MAAM,aAAa,oDAwCxB,CAAC;AAMH,eAAO,MAAM,YAAY;;;;;;;;CAQxB,CAAC"}
|
|
@@ -31,7 +31,7 @@
|
|
|
31
31
|
* fibonacci(10) // => 55
|
|
32
32
|
* fibonacci(20) // => 6765
|
|
33
33
|
*/
|
|
34
|
-
export declare const fibonacci: import("
|
|
34
|
+
export declare const fibonacci: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
35
35
|
/**
|
|
36
36
|
* Compute the nth Lucas number.
|
|
37
37
|
*
|
|
@@ -50,7 +50,7 @@ export declare const fibonacci: import("typed-function").TypedFunction;
|
|
|
50
50
|
* lucas(1) // => 1
|
|
51
51
|
* lucas(10) // => 123
|
|
52
52
|
*/
|
|
53
|
-
export declare const lucas: import("
|
|
53
|
+
export declare const lucas: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
54
54
|
/**
|
|
55
55
|
* Compute the double factorial n!!.
|
|
56
56
|
*
|
|
@@ -69,7 +69,7 @@ export declare const lucas: import("typed-function").TypedFunction;
|
|
|
69
69
|
* doubleFactorial(6) // => 48 (6*4*2)
|
|
70
70
|
* doubleFactorial(0) // => 1
|
|
71
71
|
*/
|
|
72
|
-
export declare const doubleFactorial: import("
|
|
72
|
+
export declare const doubleFactorial: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
73
73
|
/**
|
|
74
74
|
* Compute the rising factorial (Pochhammer symbol).
|
|
75
75
|
*
|
|
@@ -86,7 +86,7 @@ export declare const doubleFactorial: import("typed-function").TypedFunction;
|
|
|
86
86
|
* risingFactorial(3, 4) // => 3*4*5*6 = 360
|
|
87
87
|
* risingFactorial(1, 5) // => 1*2*3*4*5 = 120 = 5!
|
|
88
88
|
*/
|
|
89
|
-
export declare const risingFactorial: import("
|
|
89
|
+
export declare const risingFactorial: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
90
90
|
/**
|
|
91
91
|
* Compute the falling factorial.
|
|
92
92
|
*
|
|
@@ -102,7 +102,7 @@ export declare const risingFactorial: import("typed-function").TypedFunction;
|
|
|
102
102
|
* fallingFactorial(5, 3) // => 5*4*3 = 60
|
|
103
103
|
* fallingFactorial(5, 5) // => 5*4*3*2*1 = 120 = 5!
|
|
104
104
|
*/
|
|
105
|
-
export declare const fallingFactorial: import("
|
|
105
|
+
export declare const fallingFactorial: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
106
106
|
/**
|
|
107
107
|
* Compute the subfactorial (number of derangements).
|
|
108
108
|
*
|
|
@@ -119,7 +119,7 @@ export declare const fallingFactorial: import("typed-function").TypedFunction;
|
|
|
119
119
|
* subfactorial(2) // => 1
|
|
120
120
|
* subfactorial(5) // => 44
|
|
121
121
|
*/
|
|
122
|
-
export declare const subfactorial: import("
|
|
122
|
+
export declare const subfactorial: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
123
123
|
/**
|
|
124
124
|
* Return the nth prime number (1-indexed).
|
|
125
125
|
*
|
|
@@ -134,7 +134,7 @@ export declare const subfactorial: import("typed-function").TypedFunction;
|
|
|
134
134
|
* prime(4) // => 7
|
|
135
135
|
* prime(10) // => 29
|
|
136
136
|
*/
|
|
137
|
-
export declare const prime: import("
|
|
137
|
+
export declare const prime: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
138
138
|
/**
|
|
139
139
|
* Return the smallest prime number strictly greater than n.
|
|
140
140
|
*
|
|
@@ -146,7 +146,7 @@ export declare const prime: import("typed-function").TypedFunction;
|
|
|
146
146
|
* nextPrime(7) // => 11
|
|
147
147
|
* nextPrime(10) // => 11
|
|
148
148
|
*/
|
|
149
|
-
export declare const nextPrime: import("
|
|
149
|
+
export declare const nextPrime: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
150
150
|
/**
|
|
151
151
|
* Prime counting function pi(n): number of primes <= n.
|
|
152
152
|
*
|
|
@@ -157,7 +157,7 @@ export declare const nextPrime: import("typed-function").TypedFunction;
|
|
|
157
157
|
* primePi(10) // => 4 (primes: 2, 3, 5, 7)
|
|
158
158
|
* primePi(1) // => 0
|
|
159
159
|
*/
|
|
160
|
-
export declare const primePi: import("
|
|
160
|
+
export declare const primePi: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
161
161
|
/**
|
|
162
162
|
* Return the prime factorization of n as an array of prime factors
|
|
163
163
|
* (with repetition, sorted ascending).
|
|
@@ -170,7 +170,7 @@ export declare const primePi: import("typed-function").TypedFunction;
|
|
|
170
170
|
* primeFactors(60) // => [2, 2, 3, 5]
|
|
171
171
|
* primeFactors(7) // => [7]
|
|
172
172
|
*/
|
|
173
|
-
export declare const primeFactors: import("
|
|
173
|
+
export declare const primeFactors: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
174
174
|
/**
|
|
175
175
|
* Return all positive divisors of n, sorted ascending.
|
|
176
176
|
*
|
|
@@ -181,7 +181,7 @@ export declare const primeFactors: import("typed-function").TypedFunction;
|
|
|
181
181
|
* divisors(12) // => [1, 2, 3, 4, 6, 12]
|
|
182
182
|
* divisors(7) // => [1, 7]
|
|
183
183
|
*/
|
|
184
|
-
export declare const divisors: import("
|
|
184
|
+
export declare const divisors: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
185
185
|
/**
|
|
186
186
|
* Euler's totient function phi(n): count of integers 1..n coprime to n.
|
|
187
187
|
*
|
|
@@ -193,7 +193,7 @@ export declare const divisors: import("typed-function").TypedFunction;
|
|
|
193
193
|
* eulerPhi(10) // => 4 (1, 3, 7, 9)
|
|
194
194
|
* eulerPhi(12) // => 4 (1, 5, 7, 11)
|
|
195
195
|
*/
|
|
196
|
-
export declare const eulerPhi: import("
|
|
196
|
+
export declare const eulerPhi: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
197
197
|
/**
|
|
198
198
|
* Sum of the kth powers of divisors of n: sigma_k(n).
|
|
199
199
|
*
|
|
@@ -209,7 +209,7 @@ export declare const eulerPhi: import("typed-function").TypedFunction;
|
|
|
209
209
|
* divisorSigma(12, 0) // => 6 (number of divisors)
|
|
210
210
|
* divisorSigma(12, 2) // => 210
|
|
211
211
|
*/
|
|
212
|
-
export declare const divisorSigma: import("
|
|
212
|
+
export declare const divisorSigma: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
213
213
|
/**
|
|
214
214
|
* Carmichael function lambda(n): smallest positive integer m such that
|
|
215
215
|
* a^m === 1 (mod n) for all a coprime to n.
|
|
@@ -222,7 +222,7 @@ export declare const divisorSigma: import("typed-function").TypedFunction;
|
|
|
222
222
|
* carmichaelLambda(8) // => 2
|
|
223
223
|
* carmichaelLambda(15) // => 4
|
|
224
224
|
*/
|
|
225
|
-
export declare const carmichaelLambda: import("
|
|
225
|
+
export declare const carmichaelLambda: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
226
226
|
/**
|
|
227
227
|
* Mobius function mu(n).
|
|
228
228
|
*
|
|
@@ -239,7 +239,7 @@ export declare const carmichaelLambda: import("typed-function").TypedFunction;
|
|
|
239
239
|
* moebiusMu(4) // => 0 (4 = 2^2, squared factor)
|
|
240
240
|
* moebiusMu(30) // => -1 (30 = 2*3*5, three distinct primes)
|
|
241
241
|
*/
|
|
242
|
-
export declare const moebiusMu: import("
|
|
242
|
+
export declare const moebiusMu: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
243
243
|
/**
|
|
244
244
|
* Jacobi symbol (a/n), a generalization of the Legendre symbol.
|
|
245
245
|
*
|
|
@@ -254,7 +254,7 @@ export declare const moebiusMu: import("typed-function").TypedFunction;
|
|
|
254
254
|
* jacobiSymbol(5, 21) // => 1
|
|
255
255
|
* jacobiSymbol(7, 15) // => -1
|
|
256
256
|
*/
|
|
257
|
-
export declare const jacobiSymbol: import("
|
|
257
|
+
export declare const jacobiSymbol: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
258
258
|
/**
|
|
259
259
|
* Solve a system of simultaneous congruences using the Chinese Remainder Theorem.
|
|
260
260
|
*
|
|
@@ -269,7 +269,7 @@ export declare const jacobiSymbol: import("typed-function").TypedFunction;
|
|
|
269
269
|
* chineseRemainder([2, 3, 2], [3, 5, 7]) // => 23
|
|
270
270
|
* // x === 2 (mod 3), x === 3 (mod 5), x === 2 (mod 7)
|
|
271
271
|
*/
|
|
272
|
-
export declare const chineseRemainder: import("
|
|
272
|
+
export declare const chineseRemainder: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
273
273
|
/**
|
|
274
274
|
* Compute the nth Lucas number L(n).
|
|
275
275
|
*
|
|
@@ -287,7 +287,7 @@ export declare const chineseRemainder: import("typed-function").TypedFunction;
|
|
|
287
287
|
* lucasL(5) // => 11
|
|
288
288
|
* lucasL(10) // => 123
|
|
289
289
|
*/
|
|
290
|
-
export declare const lucasL: import("
|
|
290
|
+
export declare const lucasL: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
291
291
|
/**
|
|
292
292
|
* Number of integer partitions of n.
|
|
293
293
|
*
|
|
@@ -304,7 +304,7 @@ export declare const lucasL: import("typed-function").TypedFunction;
|
|
|
304
304
|
* partitions(4) // => 5 (4, 3+1, 2+2, 2+1+1, 1+1+1+1)
|
|
305
305
|
* partitions(5) // => 7
|
|
306
306
|
*/
|
|
307
|
-
export declare const partitions: import("
|
|
307
|
+
export declare const partitions: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
308
308
|
/**
|
|
309
309
|
* Compute the nth harmonic number H(n) = 1 + 1/2 + 1/3 + ... + 1/n.
|
|
310
310
|
*
|
|
@@ -315,7 +315,7 @@ export declare const partitions: import("typed-function").TypedFunction;
|
|
|
315
315
|
* harmonicNumber(1) // => 1
|
|
316
316
|
* harmonicNumber(4) // => 2.0833... (1 + 1/2 + 1/3 + 1/4)
|
|
317
317
|
*/
|
|
318
|
-
export declare const harmonicNumber: import("
|
|
318
|
+
export declare const harmonicNumber: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
319
319
|
/**
|
|
320
320
|
* Return the digits of n in the given base as an array (most significant first).
|
|
321
321
|
*
|
|
@@ -329,5 +329,5 @@ export declare const harmonicNumber: import("typed-function").TypedFunction;
|
|
|
329
329
|
* integerDigits(10, 2) // => [1, 0, 1, 0]
|
|
330
330
|
* integerDigits(0) // => [0]
|
|
331
331
|
*/
|
|
332
|
-
export declare const integerDigits: import("
|
|
332
|
+
export declare const integerDigits: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
333
333
|
//# sourceMappingURL=combinatorics.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"combinatorics.d.ts","sourceRoot":"","sources":["../../src/typed/combinatorics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAQH;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,SAAS,
|
|
1
|
+
{"version":3,"file":"combinatorics.d.ts","sourceRoot":"","sources":["../../src/typed/combinatorics.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAQH;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,SAAS,oDAsCpB,CAAC;AAMH;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,KAAK,oDAuChB,CAAC;AAMH;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,eAAe,oDAa1B,CAAC;AAMH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,eAAe,oDAa1B,CAAC;AAMH;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,gBAAgB,oDAa3B,CAAC;AAMH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,YAAY,oDAoBvB,CAAC;AAUH;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,KAAK,oDAiBhB,CAAC;AAyBH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,SAAS,oDAWpB,CAAC;AAmBH;;;;;;;;;GASG;AACH,eAAO,MAAM,OAAO,oDAOlB,CAAC;AAMH;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,YAAY,oDAgBvB,CAAC;AAMH;;;;;;;;;GASG;AACH,eAAO,MAAM,QAAQ,oDAenB,CAAC;AAMH;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,oDAgBnB,CAAC;AAMH;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,YAAY,oDAOvB,CAAC;AAuBH;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,gBAAgB,oDA0B3B,CAAC;AA8BH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,SAAS,oDAmBpB,CAAC;AAMH;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,YAAY,oDA0BvB,CAAC;AAMH;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,gBAAgB,oDA6B3B,CAAC;AAwBH;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,MAAM,oDAcjB,CAAC;AAMH;;;;;;;;;;;;;;;GAeG;AACH,eAAO,MAAM,UAAU,oDAerB,CAAC;AAMH;;;;;;;;;GASG;AACH,eAAO,MAAM,cAAc,oDAWzB,CAAC;AAMH;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,aAAa,oDAOxB,CAAC"}
|
package/dist/typed/complex.d.ts
CHANGED
|
@@ -32,7 +32,7 @@
|
|
|
32
32
|
* arg([1, -1, new Complex(0, 1)]) // [0, Math.PI, Math.PI / 2]
|
|
33
33
|
* ```
|
|
34
34
|
*/
|
|
35
|
-
export declare const arg: import("
|
|
35
|
+
export declare const arg: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
36
36
|
/**
|
|
37
37
|
* Compute the complex conjugate of a value.
|
|
38
38
|
* For a complex number `a + bi`, the conjugate is `a - bi`.
|
|
@@ -48,7 +48,7 @@ export declare const arg: import("typed-function").TypedFunction;
|
|
|
48
48
|
* conj([new Complex(1, 2), 3]) // [Complex(1, -2), 3]
|
|
49
49
|
* ```
|
|
50
50
|
*/
|
|
51
|
-
export declare const conj: import("
|
|
51
|
+
export declare const conj: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
52
52
|
/**
|
|
53
53
|
* Get the imaginary part of a complex number.
|
|
54
54
|
* For a complex number `a + bi`, the function returns `b`.
|
|
@@ -63,7 +63,7 @@ export declare const conj: import("typed-function").TypedFunction;
|
|
|
63
63
|
* im([new Complex(1, 2), 3]) // [2, 0]
|
|
64
64
|
* ```
|
|
65
65
|
*/
|
|
66
|
-
export declare const im: import("
|
|
66
|
+
export declare const im: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
67
67
|
/**
|
|
68
68
|
* Get the real part of a complex number.
|
|
69
69
|
* For a complex number `a + bi`, the function returns `a`.
|
|
@@ -78,14 +78,14 @@ export declare const im: import("typed-function").TypedFunction;
|
|
|
78
78
|
* re([new Complex(1, 2), 3]) // [1, 3]
|
|
79
79
|
* ```
|
|
80
80
|
*/
|
|
81
|
-
export declare const re: import("
|
|
81
|
+
export declare const re: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
82
82
|
/**
|
|
83
83
|
* All typed complex helper functions.
|
|
84
84
|
*/
|
|
85
85
|
export declare const typedComplex: {
|
|
86
|
-
arg: import("
|
|
87
|
-
conj: import("
|
|
88
|
-
im: import("
|
|
89
|
-
re: import("
|
|
86
|
+
arg: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
87
|
+
conj: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
88
|
+
im: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
89
|
+
re: import("@danielsimonjr/mathts-core").TypedFunction;
|
|
90
90
|
};
|
|
91
91
|
//# sourceMappingURL=complex.d.ts.map
|