@univerjs/engine-formula 0.10.13-nightly.202510290902 → 0.10.14-nightly.202511031023
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/lib/cjs/index.js +1 -1
- package/lib/es/index.js +90 -94
- package/lib/index.js +90 -94
- package/lib/umd/index.js +1 -1
- package/package.json +4 -4
package/lib/es/index.js
CHANGED
|
@@ -4556,7 +4556,7 @@ const $n = class $n extends Ht {
|
|
|
4556
4556
|
}
|
|
4557
4557
|
};
|
|
4558
4558
|
A($n, "_instance");
|
|
4559
|
-
let
|
|
4559
|
+
let ce = $n;
|
|
4560
4560
|
const Xt = class Xt extends Ht {
|
|
4561
4561
|
constructor(e) {
|
|
4562
4562
|
super(e);
|
|
@@ -5474,11 +5474,11 @@ class q extends Ht {
|
|
|
5474
5474
|
}
|
|
5475
5475
|
getFirstCell() {
|
|
5476
5476
|
const { startRow: e, startColumn: t } = this.getRangePosition();
|
|
5477
|
-
return this.get(e, t) || this._defaultValue ||
|
|
5477
|
+
return this.get(e, t) || this._defaultValue || ce.create();
|
|
5478
5478
|
}
|
|
5479
5479
|
getLastCell() {
|
|
5480
5480
|
const { endRow: e, endColumn: t } = this.getRangePosition();
|
|
5481
|
-
return this.get(e, t) || this._defaultValue ||
|
|
5481
|
+
return this.get(e, t) || this._defaultValue || ce.create();
|
|
5482
5482
|
}
|
|
5483
5483
|
/**
|
|
5484
5484
|
* Referring to matrix calculations,
|
|
@@ -5494,7 +5494,7 @@ class q extends Ht {
|
|
|
5494
5494
|
pickRaw(e) {
|
|
5495
5495
|
const t = e.getRowCount(), r = e.getColumnCount();
|
|
5496
5496
|
if (t !== this._rowCount || r !== this._columnCount)
|
|
5497
|
-
return [[
|
|
5497
|
+
return [[ce.create()]];
|
|
5498
5498
|
const n = [];
|
|
5499
5499
|
n[0] = [];
|
|
5500
5500
|
for (let s = 0; s < t; s++)
|
|
@@ -5572,7 +5572,7 @@ class q extends Ht {
|
|
|
5572
5572
|
if (!d[p])
|
|
5573
5573
|
return;
|
|
5574
5574
|
let M = d[p][N] || this._defaultValue;
|
|
5575
|
-
M == null && (M =
|
|
5575
|
+
M == null && (M = ce.create()), h[_][C] = M, C++;
|
|
5576
5576
|
}
|
|
5577
5577
|
_++;
|
|
5578
5578
|
}
|
|
@@ -5778,7 +5778,7 @@ class q extends Ht {
|
|
|
5778
5778
|
);
|
|
5779
5779
|
}
|
|
5780
5780
|
map(e) {
|
|
5781
|
-
const t = (r, n, s) => r == null ?
|
|
5781
|
+
const t = (r, n, s) => r == null ? ce.create() : r.isError() ? r : e(r, n, s);
|
|
5782
5782
|
return this.mapValue(t);
|
|
5783
5783
|
}
|
|
5784
5784
|
mapValue(e) {
|
|
@@ -5792,7 +5792,7 @@ class q extends Ht {
|
|
|
5792
5792
|
u[c] = g.create(m.VALUE);
|
|
5793
5793
|
else {
|
|
5794
5794
|
const f = l[c] || this._defaultValue;
|
|
5795
|
-
f ? u[c] = e(f, o, c) : u[c] =
|
|
5795
|
+
f ? u[c] = e(f, o, c) : u[c] = ce.create();
|
|
5796
5796
|
}
|
|
5797
5797
|
}
|
|
5798
5798
|
n.push(u);
|
|
@@ -5873,12 +5873,12 @@ class q extends Ht {
|
|
|
5873
5873
|
median() {
|
|
5874
5874
|
const e = this.flattenPosition().numberArray, t = this._createNewArray([e], 1, e.length), r = t.getColumnCount();
|
|
5875
5875
|
if (r <= 1)
|
|
5876
|
-
return t.get(0, 0) ||
|
|
5876
|
+
return t.get(0, 0) || ce.create();
|
|
5877
5877
|
if (t.sortByRow(0), r % 2 === 0) {
|
|
5878
|
-
const n = t.get(0, r / 2) ||
|
|
5878
|
+
const n = t.get(0, r / 2) || ce.create(), s = t.get(0, r / 2 - 1) || ce.create();
|
|
5879
5879
|
return n.plus(s).divided(y.create(2));
|
|
5880
5880
|
}
|
|
5881
|
-
return t.get(0, (r - 1) / 2) ||
|
|
5881
|
+
return t.get(0, (r - 1) / 2) || ce.create();
|
|
5882
5882
|
}
|
|
5883
5883
|
/**
|
|
5884
5884
|
* ┌──────────────┬────────────────────────────────┬───────────────────┐
|
|
@@ -6063,7 +6063,7 @@ class q extends Ht {
|
|
|
6063
6063
|
t + h
|
|
6064
6064
|
);
|
|
6065
6065
|
C != null && C.forEach((E, b) => {
|
|
6066
|
-
let R =
|
|
6066
|
+
let R = ce.create();
|
|
6067
6067
|
or.has(b) ? R = g.create(b) : typeof b == "string" ? R = j.create(b) : typeof b == "number" ? R = y.create(b) : typeof b == "boolean" && (R = T.create(b));
|
|
6068
6068
|
let p;
|
|
6069
6069
|
R.isError() ? p = R : e.isError() ? p = e : p = R.compare(e, s, o), (p.isError() || p.getValue() === !0) && E.forEach((N) => {
|
|
@@ -6290,7 +6290,7 @@ class q extends Ht {
|
|
|
6290
6290
|
class Mt {
|
|
6291
6291
|
static create(a, e = !1) {
|
|
6292
6292
|
if (a == null)
|
|
6293
|
-
return
|
|
6293
|
+
return ce.create();
|
|
6294
6294
|
if (typeof a == "boolean")
|
|
6295
6295
|
return T.create(a);
|
|
6296
6296
|
if (typeof a == "string") {
|
|
@@ -6639,7 +6639,7 @@ class Xn extends Hn {
|
|
|
6639
6639
|
const f = new Array(c);
|
|
6640
6640
|
this.iterator((C, E, b) => {
|
|
6641
6641
|
const R = E - t, p = b - n;
|
|
6642
|
-
f[R] || (f[R] = new Array(l)), C == null && (C =
|
|
6642
|
+
f[R] || (f[R] = new Array(l)), C == null && (C = ce.create()), f[R][p] = C;
|
|
6643
6643
|
});
|
|
6644
6644
|
const h = {
|
|
6645
6645
|
calculateValueList: f,
|
|
@@ -6846,7 +6846,7 @@ function O(i, a, e, t) {
|
|
|
6846
6846
|
continue;
|
|
6847
6847
|
}
|
|
6848
6848
|
if (o >= r || c >= n) {
|
|
6849
|
-
u.push(t != null ? t :
|
|
6849
|
+
u.push(t != null ? t : ce.create());
|
|
6850
6850
|
continue;
|
|
6851
6851
|
}
|
|
6852
6852
|
const l = e.get(o, c);
|
|
@@ -8373,7 +8373,7 @@ class bh extends Ge {
|
|
|
8373
8373
|
return ie.NULL;
|
|
8374
8374
|
}
|
|
8375
8375
|
execute() {
|
|
8376
|
-
this.setValue(
|
|
8376
|
+
this.setValue(ce.create());
|
|
8377
8377
|
}
|
|
8378
8378
|
}
|
|
8379
8379
|
var Y = /* @__PURE__ */ ((i) => (i.ABS = "ABS", i.ACOS = "ACOS", i.ACOSH = "ACOSH", i.ACOT = "ACOT", i.ACOTH = "ACOTH", i.AGGREGATE = "AGGREGATE", i.ARABIC = "ARABIC", i.ASIN = "ASIN", i.ASINH = "ASINH", i.ATAN = "ATAN", i.ATAN2 = "ATAN2", i.ATANH = "ATANH", i.BASE = "BASE", i.CEILING = "CEILING", i.CEILING_MATH = "CEILING.MATH", i.CEILING_PRECISE = "CEILING.PRECISE", i.COMBIN = "COMBIN", i.COMBINA = "COMBINA", i.COS = "COS", i.COSH = "COSH", i.COT = "COT", i.COTH = "COTH", i.CSC = "CSC", i.CSCH = "CSCH", i.DECIMAL = "DECIMAL", i.DEGREES = "DEGREES", i.EVEN = "EVEN", i.EXP = "EXP", i.FACT = "FACT", i.FACTDOUBLE = "FACTDOUBLE", i.FLOOR = "FLOOR", i.FLOOR_MATH = "FLOOR.MATH", i.FLOOR_PRECISE = "FLOOR.PRECISE", i.GCD = "GCD", i.INT = "INT", i.ISO_CEILING = "ISO.CEILING", i.LCM = "LCM", i.LET = "LET", i.LN = "LN", i.LOG = "LOG", i.LOG10 = "LOG10", i.MDETERM = "MDETERM", i.MINVERSE = "MINVERSE", i.MMULT = "MMULT", i.MOD = "MOD", i.MROUND = "MROUND", i.MULTINOMIAL = "MULTINOMIAL", i.MUNIT = "MUNIT", i.ODD = "ODD", i.PI = "PI", i.POWER = "POWER", i.PRODUCT = "PRODUCT", i.QUOTIENT = "QUOTIENT", i.RADIANS = "RADIANS", i.RAND = "RAND", i.RANDARRAY = "RANDARRAY", i.RANDBETWEEN = "RANDBETWEEN", i.ROMAN = "ROMAN", i.ROUND = "ROUND", i.ROUNDBANK = "ROUNDBANK", i.ROUNDDOWN = "ROUNDDOWN", i.ROUNDUP = "ROUNDUP", i.SEC = "SEC", i.SECH = "SECH", i.SERIESSUM = "SERIESSUM", i.SEQUENCE = "SEQUENCE", i.SIGN = "SIGN", i.SIN = "SIN", i.SINH = "SINH", i.SQRT = "SQRT", i.SQRTPI = "SQRTPI", i.SUBTOTAL = "SUBTOTAL", i.SUM = "SUM", i.SUMIF = "SUMIF", i.SUMIFS = "SUMIFS", i.SUMPRODUCT = "SUMPRODUCT", i.SUMSQ = "SUMSQ", i.SUMX2MY2 = "SUMX2MY2", i.SUMX2PY2 = "SUMX2PY2", i.SUMXMY2 = "SUMXMY2", i.TAN = "TAN", i.TANH = "TANH", i.TRUNC = "TRUNC", i))(Y || {}), se = /* @__PURE__ */ ((i) => (i.ASC = "ASC", i.ARRAYTOTEXT = "ARRAYTOTEXT", i.BAHTTEXT = "BAHTTEXT", i.CHAR = "CHAR", i.CLEAN = "CLEAN", i.CODE = "CODE", i.CONCAT = "CONCAT", i.CONCATENATE = "CONCATENATE", i.DBCS = "DBCS", i.DOLLAR = "DOLLAR", i.EXACT = "EXACT", i.FIND = "FIND", i.FINDB = "FINDB", i.FIXED = "FIXED", i.LEFT = "LEFT", i.LEFTB = "LEFTB", i.LEN = "LEN", i.LENB = "LENB", i.LOWER = "LOWER", i.MID = "MID", i.MIDB = "MIDB", i.NUMBERSTRING = "NUMBERSTRING", i.NUMBERVALUE = "NUMBERVALUE", i.PHONETIC = "PHONETIC", i.PROPER = "PROPER", i.REGEXEXTRACT = "REGEXEXTRACT", i.REGEXMATCH = "REGEXMATCH", i.REGEXREPLACE = "REGEXREPLACE", i.REPLACE = "REPLACE", i.REPLACEB = "REPLACEB", i.REPT = "REPT", i.RIGHT = "RIGHT", i.RIGHTB = "RIGHTB", i.SEARCH = "SEARCH", i.SEARCHB = "SEARCHB", i.SUBSTITUTE = "SUBSTITUTE", i.T = "T", i.TEXT = "TEXT", i.TEXTAFTER = "TEXTAFTER", i.TEXTBEFORE = "TEXTBEFORE", i.TEXTJOIN = "TEXTJOIN", i.TEXTSPLIT = "TEXTSPLIT", i.TRIM = "TRIM", i.UNICHAR = "UNICHAR", i.UNICODE = "UNICODE", i.UPPER = "UPPER", i.VALUE = "VALUE", i.VALUETOTEXT = "VALUETOTEXT", i.CALL = "CALL", i.EUROCONVERT = "EUROCONVERT", i.REGISTER_ID = "REGISTER.ID", i))(se || {}), yh = Object.getOwnPropertyDescriptor, Rh = (i, a, e, t) => {
|
|
@@ -8398,7 +8398,7 @@ class Vh extends Ge {
|
|
|
8398
8398
|
this.setValue(g.create(m.VALUE));
|
|
8399
8399
|
return;
|
|
8400
8400
|
}
|
|
8401
|
-
r == null && (r =
|
|
8401
|
+
r == null && (r = ce.create()), n == null && (n = ce.create()), r.isReferenceObject() && (r = r.toArrayValueObject()), n.isReferenceObject() && (n = n.toArrayValueObject()), this.setValue(
|
|
8402
8402
|
this._functionExecutor.calculate(
|
|
8403
8403
|
r,
|
|
8404
8404
|
n
|
|
@@ -10789,7 +10789,7 @@ class V {
|
|
|
10789
10789
|
if (s == null)
|
|
10790
10790
|
return g.create(m.NA);
|
|
10791
10791
|
let o;
|
|
10792
|
-
return t.getRowCount() === 1 ? o = t.get(0, s) ||
|
|
10792
|
+
return t.getRowCount() === 1 ? o = t.get(0, s) || ce.create() : o = t.get(s, 0) || ce.create(), o.isNull() ? y.create(0) : o;
|
|
10793
10793
|
}
|
|
10794
10794
|
_getOneFirstByRaw(a) {
|
|
10795
10795
|
return a.length === 0 ? g.create(m.NA) : a[0][0] || g.create(m.NA);
|
|
@@ -10809,7 +10809,7 @@ class V {
|
|
|
10809
10809
|
const s = e.orderSearch(a, r, n);
|
|
10810
10810
|
if (s == null)
|
|
10811
10811
|
return g.create(m.NA);
|
|
10812
|
-
const o = t.get(s.row, s.column) ||
|
|
10812
|
+
const o = t.get(s.row, s.column) || ce.create();
|
|
10813
10813
|
return o.isNull() ? g.create(m.NA) : o;
|
|
10814
10814
|
}
|
|
10815
10815
|
binarySearchExpand(a, e, t, r = 0, n, s) {
|
|
@@ -14248,12 +14248,6 @@ class sg extends V {
|
|
|
14248
14248
|
A(this, "maxParams", 3);
|
|
14249
14249
|
}
|
|
14250
14250
|
calculate(e, t, r) {
|
|
14251
|
-
if (e.isError())
|
|
14252
|
-
return e;
|
|
14253
|
-
if (t.isError())
|
|
14254
|
-
return t;
|
|
14255
|
-
if (r.isError())
|
|
14256
|
-
return r;
|
|
14257
14251
|
const n = Math.max(
|
|
14258
14252
|
e.isArray() ? e.getRowCount() : 1,
|
|
14259
14253
|
t.isArray() ? t.getRowCount() : 1,
|
|
@@ -14262,25 +14256,27 @@ class sg extends V {
|
|
|
14262
14256
|
e.isArray() ? e.getColumnCount() : 1,
|
|
14263
14257
|
t.isArray() ? t.getColumnCount() : 1,
|
|
14264
14258
|
r.isArray() ? r.getColumnCount() : 1
|
|
14265
|
-
), o = O(n, s, e), u = O(n, s, t), c = O(n, s, r)
|
|
14266
|
-
|
|
14267
|
-
|
|
14268
|
-
|
|
14269
|
-
return l;
|
|
14270
|
-
if (d.isError())
|
|
14271
|
-
return d;
|
|
14259
|
+
), o = O(n, s, e, g.create(m.NA)), u = O(n, s, t, g.create(m.NA)), c = O(n, s, r, g.create(m.NA)), l = o.map((f, h, d) => {
|
|
14260
|
+
const _ = u.get(h, d), C = c.get(h, d);
|
|
14261
|
+
if (f.isError())
|
|
14262
|
+
return f;
|
|
14272
14263
|
if (_.isError())
|
|
14273
14264
|
return _;
|
|
14274
|
-
if (
|
|
14275
|
-
return
|
|
14276
|
-
|
|
14277
|
-
|
|
14278
|
-
|
|
14265
|
+
if (C.isError())
|
|
14266
|
+
return C;
|
|
14267
|
+
const { isError: E, errorObject: b, variants: R } = B(f, _, C);
|
|
14268
|
+
if (E)
|
|
14269
|
+
return b;
|
|
14270
|
+
const [p, N, M] = R;
|
|
14271
|
+
let w = Math.floor(+p.getValue());
|
|
14272
|
+
const S = Math.floor(+N.getValue()), D = Math.floor(+M.getValue());
|
|
14273
|
+
if (w < 0 || w > 9999)
|
|
14279
14274
|
return g.create(m.NUM);
|
|
14280
|
-
|
|
14281
|
-
const
|
|
14282
|
-
return
|
|
14275
|
+
w >= 0 && w < 1899 && (w += 1900);
|
|
14276
|
+
const L = new Date(w, S - 1, D), U = Re(L);
|
|
14277
|
+
return U < 0 ? g.create(m.NUM) : y.create(U, $a);
|
|
14283
14278
|
});
|
|
14279
|
+
return n === 1 && s === 1 ? l.get(0, 0) : l;
|
|
14284
14280
|
}
|
|
14285
14281
|
}
|
|
14286
14282
|
class ag extends V {
|
|
@@ -14483,7 +14479,7 @@ class lg extends V {
|
|
|
14483
14479
|
t.isArray() ? t.getColumnCount() : 1
|
|
14484
14480
|
), s = O(r, n, e), o = O(r, n, t);
|
|
14485
14481
|
return s.map((u, c, l) => {
|
|
14486
|
-
const f = o.get(c, l) ||
|
|
14482
|
+
const f = o.get(c, l) || ce.create();
|
|
14487
14483
|
if (u.isError())
|
|
14488
14484
|
return u;
|
|
14489
14485
|
if (f.isError())
|
|
@@ -14886,7 +14882,7 @@ class yg extends V {
|
|
|
14886
14882
|
return o.map((l, f, h) => this._calculateTime(l, u, c, f, h));
|
|
14887
14883
|
}
|
|
14888
14884
|
_calculateTime(e, t, r, n, s) {
|
|
14889
|
-
let o = e, u = t.get(n, s) ||
|
|
14885
|
+
let o = e, u = t.get(n, s) || ce.create(), c = r.get(n, s) || ce.create();
|
|
14890
14886
|
if ((o.isString() || o.isBoolean()) && (o = o.convertToNumberObjectValue()), (u.isString() || u.isBoolean()) && (u = u.convertToNumberObjectValue()), (c.isString() || c.isBoolean()) && (c = c.convertToNumberObjectValue()), o.isError())
|
|
14891
14887
|
return o;
|
|
14892
14888
|
if (u.isError())
|
|
@@ -15658,7 +15654,7 @@ P.prototype.cos = function() {
|
|
|
15658
15654
|
const i = this.toNumber();
|
|
15659
15655
|
return new P(Math.cos(i));
|
|
15660
15656
|
};
|
|
15661
|
-
let he = class
|
|
15657
|
+
let he = class ue {
|
|
15662
15658
|
constructor(a) {
|
|
15663
15659
|
A(this, "_inumber", "");
|
|
15664
15660
|
A(this, "_realNum", 0);
|
|
@@ -15687,8 +15683,8 @@ let he = class ce {
|
|
|
15687
15683
|
return o;
|
|
15688
15684
|
}
|
|
15689
15685
|
static createByComplexStr(a, e, t) {
|
|
15690
|
-
const r =
|
|
15691
|
-
return new
|
|
15686
|
+
const r = ue.getComplex(a, e, t);
|
|
15687
|
+
return new ue(r);
|
|
15692
15688
|
}
|
|
15693
15689
|
_getImReal() {
|
|
15694
15690
|
if (this._inumber === 0 || this._inumber === "0") {
|
|
@@ -15754,7 +15750,7 @@ let he = class ce {
|
|
|
15754
15750
|
return this._isError;
|
|
15755
15751
|
}
|
|
15756
15752
|
toString() {
|
|
15757
|
-
return
|
|
15753
|
+
return ue.getComplex(this._realNum, this._iNum, this._suffix);
|
|
15758
15754
|
}
|
|
15759
15755
|
isDifferentSuffixes(a) {
|
|
15760
15756
|
const e = a.getSuffix();
|
|
@@ -15769,15 +15765,15 @@ let he = class ce {
|
|
|
15769
15765
|
return this._iNum < 0 && (e = -e), e;
|
|
15770
15766
|
}
|
|
15771
15767
|
Conjugate() {
|
|
15772
|
-
return
|
|
15768
|
+
return ue.getComplex(this._realNum, -this._iNum, this._suffix);
|
|
15773
15769
|
}
|
|
15774
15770
|
Cos() {
|
|
15775
15771
|
if (this._iNum) {
|
|
15776
15772
|
const a = P.cos(this._realNum).mul(P.cosh(this._iNum)).toNumber(), e = P.sin(this._realNum).mul(P.sinh(this._iNum)).negated().toNumber();
|
|
15777
|
-
return
|
|
15773
|
+
return ue.getComplex(a, e, this._suffix);
|
|
15778
15774
|
} else {
|
|
15779
15775
|
const a = P.cos(this._realNum).toNumber();
|
|
15780
|
-
return
|
|
15776
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15781
15777
|
}
|
|
15782
15778
|
}
|
|
15783
15779
|
Cosh() {
|
|
@@ -15785,19 +15781,19 @@ let he = class ce {
|
|
|
15785
15781
|
return this._isError = !0, "";
|
|
15786
15782
|
if (this._iNum) {
|
|
15787
15783
|
const a = P.cosh(this._realNum).mul(P.cos(this._iNum)).toNumber(), e = P.sinh(this._realNum).mul(P.sin(this._iNum)).toNumber();
|
|
15788
|
-
return
|
|
15784
|
+
return ue.getComplex(a, e, this._suffix);
|
|
15789
15785
|
} else {
|
|
15790
15786
|
const a = P.cosh(this._realNum).toNumber();
|
|
15791
|
-
return
|
|
15787
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15792
15788
|
}
|
|
15793
15789
|
}
|
|
15794
15790
|
Cot() {
|
|
15795
15791
|
if (this._iNum) {
|
|
15796
15792
|
const a = P.cosh(this._iNum * 2).sub(P.cos(this._realNum * 2)), e = P.sin(this._realNum * 2).div(a).toNumber(), t = P.sinh(this._iNum * 2).div(a).negated().toNumber();
|
|
15797
|
-
return
|
|
15793
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15798
15794
|
} else {
|
|
15799
15795
|
const a = new P(1).div(P.tan(this._realNum)).toNumber();
|
|
15800
|
-
return
|
|
15796
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15801
15797
|
}
|
|
15802
15798
|
}
|
|
15803
15799
|
Coth() {
|
|
@@ -15805,45 +15801,45 @@ let he = class ce {
|
|
|
15805
15801
|
return this._isError = !0, "";
|
|
15806
15802
|
if (this._iNum) {
|
|
15807
15803
|
const a = P.cosh(this._realNum * 2).sub(P.cos(this._iNum * 2)), e = P.sinh(this._realNum * 2).div(a).toNumber(), t = P.sin(this._iNum * 2).div(a).negated().toNumber();
|
|
15808
|
-
return
|
|
15804
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15809
15805
|
} else {
|
|
15810
15806
|
const a = new P(1).div(P.tanh(this._realNum)).toNumber();
|
|
15811
|
-
return
|
|
15807
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15812
15808
|
}
|
|
15813
15809
|
}
|
|
15814
15810
|
Csc() {
|
|
15815
15811
|
if (this._iNum) {
|
|
15816
15812
|
const a = P.cosh(this._iNum * 2).sub(P.cos(this._realNum * 2)), e = P.sin(this._realNum).mul(P.cosh(this._iNum)).mul(2).div(a).toNumber(), t = P.cos(this._realNum).mul(P.sinh(this._iNum)).mul(-2).div(a).toNumber();
|
|
15817
|
-
return
|
|
15813
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15818
15814
|
} else {
|
|
15819
15815
|
const a = new P(1).div(P.sin(this._realNum)).toNumber();
|
|
15820
|
-
return
|
|
15816
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15821
15817
|
}
|
|
15822
15818
|
}
|
|
15823
15819
|
Csch() {
|
|
15824
15820
|
if (!Number.isFinite(Math.sinh(this._realNum)) || !Number.isFinite(Math.cosh(this._realNum)))
|
|
15825
|
-
return
|
|
15821
|
+
return ue.getComplex(0, 0, this._suffix);
|
|
15826
15822
|
if (this._iNum) {
|
|
15827
15823
|
const a = P.cosh(this._realNum * 2).sub(P.cos(this._iNum * 2)), e = P.sinh(this._realNum).mul(P.cos(this._iNum)).mul(2).div(a).toNumber(), t = P.cosh(this._realNum).mul(P.sin(this._iNum)).mul(-2).div(a).toNumber();
|
|
15828
|
-
return
|
|
15824
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15829
15825
|
} else {
|
|
15830
15826
|
const a = new P(1).div(P.sinh(this._realNum)).toNumber();
|
|
15831
|
-
return
|
|
15827
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15832
15828
|
}
|
|
15833
15829
|
}
|
|
15834
15830
|
Div(a) {
|
|
15835
15831
|
const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = r.mul(r).add(n.mul(n)), o = e.mul(r).add(t.mul(n)).div(s).toNumber(), u = t.mul(r).sub(e.mul(n)).div(s).toNumber(), c = this._suffix === "" ? a.getSuffix() : this._suffix;
|
|
15836
|
-
return
|
|
15832
|
+
return ue.getComplex(o, u, c);
|
|
15837
15833
|
}
|
|
15838
15834
|
Exp() {
|
|
15839
15835
|
if (!Number.isFinite(Math.exp(this._realNum)))
|
|
15840
15836
|
return this._isError = !0, "";
|
|
15841
15837
|
const a = P.exp(this._realNum).mul(P.cos(this._iNum)).toNumber(), e = P.exp(this._realNum).mul(P.sin(this._iNum)).toNumber();
|
|
15842
|
-
return
|
|
15838
|
+
return ue.getComplex(a, e, this._suffix);
|
|
15843
15839
|
}
|
|
15844
15840
|
Ln() {
|
|
15845
15841
|
const a = P.sqrt(P.pow(this._realNum, 2).add(P.pow(this._iNum, 2))), e = P.ln(a).toNumber(), t = P.acos(new P(this._realNum).div(a)).toNumber();
|
|
15846
|
-
return
|
|
15842
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15847
15843
|
}
|
|
15848
15844
|
Log(a) {
|
|
15849
15845
|
const e = P.sqrt(P.pow(this._realNum, 2).add(P.pow(this._iNum, 2))), t = P.ln(e);
|
|
@@ -15853,47 +15849,47 @@ let he = class ce {
|
|
|
15853
15849
|
if (o.eq(0))
|
|
15854
15850
|
return this._isError = !0, "";
|
|
15855
15851
|
const u = t.mul(n).add(r.mul(s)).div(o).toNumber(), c = r.mul(n).sub(t.mul(s)).div(o).toNumber();
|
|
15856
|
-
return
|
|
15852
|
+
return ue.getComplex(u, c, this._suffix);
|
|
15857
15853
|
}
|
|
15858
15854
|
Power(a) {
|
|
15859
15855
|
if (this._realNum === 0 && this._iNum === 0)
|
|
15860
|
-
return a > 0 ?
|
|
15856
|
+
return a > 0 ? ue.getComplex(this._realNum, this._iNum, this._suffix) : (this._isError = !0, "");
|
|
15861
15857
|
let e = P.sqrt(P.pow(this._realNum, 2).add(P.pow(this._iNum, 2))), t = P.acos(new P(this._realNum).div(e));
|
|
15862
15858
|
this._iNum < 0 && (t = t.negated()), e = P.pow(e, a), t = t.mul(a);
|
|
15863
15859
|
const r = P.cos(t).mul(e).toNumber(), n = P.sin(t).mul(e).toNumber();
|
|
15864
|
-
return !Number.isFinite(r) || !Number.isFinite(n) ? (this._isError = !0, "") :
|
|
15860
|
+
return !Number.isFinite(r) || !Number.isFinite(n) ? (this._isError = !0, "") : ue.getComplex(r, n, this._suffix);
|
|
15865
15861
|
}
|
|
15866
15862
|
Product(a) {
|
|
15867
15863
|
const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = e.mul(r).sub(t.mul(n)).toNumber(), o = e.mul(n).add(t.mul(r)).toNumber(), u = this._suffix === "" ? a.getSuffix() : this._suffix;
|
|
15868
|
-
return
|
|
15864
|
+
return ue.getComplex(s, o, u);
|
|
15869
15865
|
}
|
|
15870
15866
|
Sec() {
|
|
15871
15867
|
if (this._iNum) {
|
|
15872
15868
|
const a = P.cosh(this._iNum * 2).add(P.cos(this._realNum * 2)), e = P.cos(this._realNum).mul(P.cosh(this._iNum)).mul(2).div(a).toNumber(), t = P.sin(this._realNum).mul(P.sinh(this._iNum)).mul(2).div(a).toNumber();
|
|
15873
|
-
return
|
|
15869
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15874
15870
|
} else {
|
|
15875
15871
|
const a = new P(1).div(P.cos(this._realNum)).toNumber();
|
|
15876
|
-
return
|
|
15872
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15877
15873
|
}
|
|
15878
15874
|
}
|
|
15879
15875
|
Sech() {
|
|
15880
15876
|
if (!Number.isFinite(Math.sinh(this._realNum * 2)) || !Number.isFinite(Math.cosh(this._realNum * 2)))
|
|
15881
|
-
return
|
|
15877
|
+
return ue.getComplex(0, 0, this._suffix);
|
|
15882
15878
|
if (this._iNum) {
|
|
15883
15879
|
const a = P.cosh(this._realNum * 2).add(P.cos(this._iNum * 2)), e = P.cosh(this._realNum).mul(P.cos(this._iNum)).mul(2).div(a).toNumber(), t = P.sinh(this._realNum).mul(P.sin(this._iNum)).mul(-2).div(a).toNumber();
|
|
15884
|
-
return
|
|
15880
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15885
15881
|
} else {
|
|
15886
15882
|
const a = new P(1).div(P.cosh(this._realNum)).toNumber();
|
|
15887
|
-
return
|
|
15883
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15888
15884
|
}
|
|
15889
15885
|
}
|
|
15890
15886
|
Sin() {
|
|
15891
15887
|
if (this._iNum) {
|
|
15892
15888
|
const a = P.sin(this._realNum).mul(P.cosh(this._iNum)).toNumber(), e = P.cos(this._realNum).mul(P.sinh(this._iNum)).toNumber();
|
|
15893
|
-
return
|
|
15889
|
+
return ue.getComplex(a, e, this._suffix);
|
|
15894
15890
|
} else {
|
|
15895
15891
|
const a = P.sin(this._realNum).toNumber();
|
|
15896
|
-
return
|
|
15892
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15897
15893
|
}
|
|
15898
15894
|
}
|
|
15899
15895
|
Sinh() {
|
|
@@ -15901,10 +15897,10 @@ let he = class ce {
|
|
|
15901
15897
|
return this._isError = !0, "";
|
|
15902
15898
|
if (this._iNum) {
|
|
15903
15899
|
const a = P.sinh(this._realNum).mul(P.cos(this._iNum)).toNumber(), e = P.cosh(this._realNum).mul(P.sin(this._iNum)).toNumber();
|
|
15904
|
-
return
|
|
15900
|
+
return ue.getComplex(a, e, this._suffix);
|
|
15905
15901
|
} else {
|
|
15906
15902
|
const a = P.sinh(this._realNum).toNumber();
|
|
15907
|
-
return
|
|
15903
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15908
15904
|
}
|
|
15909
15905
|
}
|
|
15910
15906
|
Sqrt() {
|
|
@@ -15912,23 +15908,23 @@ let he = class ce {
|
|
|
15912
15908
|
let t = P.acos(new P(this._realNum).div(a));
|
|
15913
15909
|
this._iNum < 0 && (t = t.negated());
|
|
15914
15910
|
const r = e.mul(P.cos(t.div(2).toNumber())).toNumber(), n = e.mul(P.sin(t.div(2))).toNumber();
|
|
15915
|
-
return
|
|
15911
|
+
return ue.getComplex(r, n, this._suffix);
|
|
15916
15912
|
}
|
|
15917
15913
|
Sub(a) {
|
|
15918
15914
|
const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = e.sub(r).toNumber(), o = t.sub(n).toNumber(), u = this._suffix === "" ? a.getSuffix() : this._suffix;
|
|
15919
|
-
return
|
|
15915
|
+
return ue.getComplex(s, o, u);
|
|
15920
15916
|
}
|
|
15921
15917
|
Sum(a) {
|
|
15922
15918
|
const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = e.add(r).toNumber(), o = t.add(n).toNumber(), u = this._suffix === "" ? a.getSuffix() : this._suffix;
|
|
15923
|
-
return
|
|
15919
|
+
return ue.getComplex(s, o, u);
|
|
15924
15920
|
}
|
|
15925
15921
|
Tan() {
|
|
15926
15922
|
if (this._iNum) {
|
|
15927
15923
|
const a = P.cos(this._realNum * 2).add(P.cosh(this._iNum * 2)), e = P.sin(this._realNum * 2).div(a).toNumber(), t = P.sinh(this._iNum * 2).div(a).toNumber();
|
|
15928
|
-
return
|
|
15924
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15929
15925
|
} else {
|
|
15930
15926
|
const a = P.tan(this._realNum).toNumber();
|
|
15931
|
-
return
|
|
15927
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15932
15928
|
}
|
|
15933
15929
|
}
|
|
15934
15930
|
Tanh() {
|
|
@@ -15936,10 +15932,10 @@ let he = class ce {
|
|
|
15936
15932
|
return this._isError = !0, "";
|
|
15937
15933
|
if (this._iNum) {
|
|
15938
15934
|
const a = P.cosh(this._realNum * 2).add(P.cos(this._iNum * 2)), e = P.sinh(this._realNum * 2).div(a).toNumber(), t = P.sin(this._iNum * 2).div(a).toNumber();
|
|
15939
|
-
return
|
|
15935
|
+
return ue.getComplex(e, t, this._suffix);
|
|
15940
15936
|
} else {
|
|
15941
15937
|
const a = P.tanh(this._realNum).toNumber();
|
|
15942
|
-
return
|
|
15938
|
+
return ue.getComplex(a, this._iNum, this._suffix);
|
|
15943
15939
|
}
|
|
15944
15940
|
}
|
|
15945
15941
|
};
|
|
@@ -20497,7 +20493,7 @@ class Ad extends V {
|
|
|
20497
20493
|
(o) => O(t, r, o, g.create(m.NA))
|
|
20498
20494
|
), s = n[0].map((o, u, c) => {
|
|
20499
20495
|
for (let l = 0; l < n.length; l += 2) {
|
|
20500
|
-
const f = n[l].get(u, c) ||
|
|
20496
|
+
const f = n[l].get(u, c) || ce.create(), h = n[l + 1].get(u, c) || ce.create();
|
|
20501
20497
|
if (f.isNull())
|
|
20502
20498
|
continue;
|
|
20503
20499
|
if (f.isError())
|
|
@@ -20819,7 +20815,7 @@ class Md extends V {
|
|
|
20819
20815
|
calculate(e, ...t) {
|
|
20820
20816
|
if (e.isError())
|
|
20821
20817
|
return e;
|
|
20822
|
-
const r = t.length % 2 !== 0, n = r ? t[t.length - 1] :
|
|
20818
|
+
const r = t.length % 2 !== 0, n = r ? t[t.length - 1] : ce.create();
|
|
20823
20819
|
return !e.isArray() && !t.some((s) => s.isArray()) ? this._handleNonArrayInputs(e, t, n, r) : this._handleArrayInputs(e, t, n, r);
|
|
20824
20820
|
}
|
|
20825
20821
|
_handleNonArrayInputs(e, t, r, n) {
|
|
@@ -20848,7 +20844,7 @@ class Md extends V {
|
|
|
20848
20844
|
), l = O(s, o, r, g.create(m.NA));
|
|
20849
20845
|
return u.map((f, h, d) => {
|
|
20850
20846
|
for (let C = 0; C < c.length - (n ? 1 : 0); C += 2) {
|
|
20851
|
-
const E = c[C].get(h, d) ||
|
|
20847
|
+
const E = c[C].get(h, d) || ce.create(), b = c[C + 1].get(h, d) || ce.create();
|
|
20852
20848
|
if (!E.isNull()) {
|
|
20853
20849
|
if (E.isError() || f.isError())
|
|
20854
20850
|
return E.isError() ? E : f;
|
|
@@ -20856,7 +20852,7 @@ class Md extends V {
|
|
|
20856
20852
|
return b.isNull() ? g.create(m.NA) : b;
|
|
20857
20853
|
}
|
|
20858
20854
|
}
|
|
20859
|
-
const _ = l.get(h, d) ||
|
|
20855
|
+
const _ = l.get(h, d) || ce.create();
|
|
20860
20856
|
return _.isNull() ? g.create(m.NA) : _;
|
|
20861
20857
|
});
|
|
20862
20858
|
}
|
|
@@ -25082,7 +25078,7 @@ class x_ extends V {
|
|
|
25082
25078
|
return this._calculateSingleCell(e, t);
|
|
25083
25079
|
{
|
|
25084
25080
|
const l = e.flatten(), f = t.flatten();
|
|
25085
|
-
let h =
|
|
25081
|
+
let h = ce.create();
|
|
25086
25082
|
const d = [], _ = [];
|
|
25087
25083
|
let C = 0;
|
|
25088
25084
|
return l.iterator((E, b, R) => {
|
|
@@ -25134,7 +25130,7 @@ class j_ extends V {
|
|
|
25134
25130
|
return this._calculateSingleCell(e, t);
|
|
25135
25131
|
{
|
|
25136
25132
|
const l = e.flatten(), f = t.flatten();
|
|
25137
|
-
let h =
|
|
25133
|
+
let h = ce.create();
|
|
25138
25134
|
const d = [], _ = [];
|
|
25139
25135
|
let C = 0;
|
|
25140
25136
|
return l.iterator((E, b, R) => {
|
|
@@ -25186,7 +25182,7 @@ class U_ extends V {
|
|
|
25186
25182
|
return this._calculateSingleCell(e, t);
|
|
25187
25183
|
{
|
|
25188
25184
|
const l = e.flatten(), f = t.flatten();
|
|
25189
|
-
let h =
|
|
25185
|
+
let h = ce.create();
|
|
25190
25186
|
const d = [], _ = [];
|
|
25191
25187
|
let C = 0;
|
|
25192
25188
|
return l.iterator((E, b, R) => {
|
|
@@ -26170,9 +26166,9 @@ class mA extends V {
|
|
|
26170
26166
|
if (e.isError())
|
|
26171
26167
|
return e;
|
|
26172
26168
|
if (e.isNull() || e.isBoolean())
|
|
26173
|
-
return
|
|
26169
|
+
return ce.create();
|
|
26174
26170
|
const t = e.getValue();
|
|
26175
|
-
return W(t) ? y.create(+t) :
|
|
26171
|
+
return W(t) ? y.create(+t) : ce.create();
|
|
26176
26172
|
}
|
|
26177
26173
|
}
|
|
26178
26174
|
class gA extends V {
|
|
@@ -28946,7 +28942,7 @@ class ME extends V {
|
|
|
28946
28942
|
), n = Math.max(
|
|
28947
28943
|
e.isArray() ? e.getColumnCount() : 1,
|
|
28948
28944
|
t.isArray() ? t.getColumnCount() : 1
|
|
28949
|
-
), s = O(r, n, e,
|
|
28945
|
+
), s = O(r, n, e, ce.create()), o = O(r, n, t, ce.create()), u = s.mapValue((c, l, f) => {
|
|
28950
28946
|
const h = o.get(l, f);
|
|
28951
28947
|
return c.isError() ? c : h.isError() ? h : this._handleSingleObject(c, h);
|
|
28952
28948
|
});
|
|
@@ -29161,7 +29157,7 @@ class xE extends V {
|
|
|
29161
29157
|
), s = Math.max(
|
|
29162
29158
|
e.isArray() ? e.getColumnCount() : 1,
|
|
29163
29159
|
r.isArray() ? r.getColumnCount() : 1
|
|
29164
|
-
), o = O(n, s, e,
|
|
29160
|
+
), o = O(n, s, e, ce.create()), u = O(n, s, r, ce.create()), c = o.mapValue((l, f, h) => {
|
|
29165
29161
|
const d = u.get(f, h);
|
|
29166
29162
|
return l.isError() ? l : d.isError() ? d : this._handleSingleObject(l, d);
|
|
29167
29163
|
});
|
|
@@ -31545,7 +31541,7 @@ export {
|
|
|
31545
31541
|
Ar as Lexer,
|
|
31546
31542
|
ae as LexerNode,
|
|
31547
31543
|
ga as LexerTreeBuilder,
|
|
31548
|
-
|
|
31544
|
+
ce as NullValueObject,
|
|
31549
31545
|
y as NumberValueObject,
|
|
31550
31546
|
wn as OperatorNodeFactory,
|
|
31551
31547
|
Ih as OtherFormulaManagerService,
|