qk-pc-ui 3.3.3 → 3.3.5
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/dist/qk-pc-ui.mjs +233 -231
- package/dist/qk-pc-ui.umd.js +8 -8
- package/dist/style.css +1 -1
- package/package.json +1 -1
package/dist/qk-pc-ui.mjs
CHANGED
|
@@ -1247,8 +1247,8 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1247
1247
|
return ~S;
|
|
1248
1248
|
}
|
|
1249
1249
|
function G(C, D) {
|
|
1250
|
-
for (var S = D ^ -1, N = 0, B = C.length, R = 0,
|
|
1251
|
-
R = C.charCodeAt(N++), R < 128 ? S = S >>> 8 ^ t[(S ^ R) & 255] : R < 2048 ? (S = S >>> 8 ^ t[(S ^ (192 | R >> 6 & 31)) & 255], S = S >>> 8 ^ t[(S ^ (128 | R & 63)) & 255]) : R >= 55296 && R < 57344 ? (R = (R & 1023) + 64,
|
|
1250
|
+
for (var S = D ^ -1, N = 0, B = C.length, R = 0, K = 0; N < B; )
|
|
1251
|
+
R = C.charCodeAt(N++), R < 128 ? S = S >>> 8 ^ t[(S ^ R) & 255] : R < 2048 ? (S = S >>> 8 ^ t[(S ^ (192 | R >> 6 & 31)) & 255], S = S >>> 8 ^ t[(S ^ (128 | R & 63)) & 255]) : R >= 55296 && R < 57344 ? (R = (R & 1023) + 64, K = C.charCodeAt(N++) & 1023, S = S >>> 8 ^ t[(S ^ (240 | R >> 8 & 7)) & 255], S = S >>> 8 ^ t[(S ^ (128 | R >> 2 & 63)) & 255], S = S >>> 8 ^ t[(S ^ (128 | K >> 6 & 15 | (R & 3) << 4)) & 255], S = S >>> 8 ^ t[(S ^ (128 | K & 63)) & 255]) : (S = S >>> 8 ^ t[(S ^ (224 | R >> 12 & 15)) & 255], S = S >>> 8 ^ t[(S ^ (128 | R >> 6 & 63)) & 255], S = S >>> 8 ^ t[(S ^ (128 | R & 63)) & 255]);
|
|
1252
1252
|
return ~S;
|
|
1253
1253
|
}
|
|
1254
1254
|
return e.table = t, e.bstr = O, e.buf = H, e.str = G, e;
|
|
@@ -1347,7 +1347,7 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1347
1347
|
var oe = h(x, w);
|
|
1348
1348
|
d(M, y, oe, w, U);
|
|
1349
1349
|
var de = I(oe, V, U, w);
|
|
1350
|
-
de[V].name = "!Directory", T > 0 && z !==
|
|
1350
|
+
de[V].name = "!Directory", T > 0 && z !== K && (de[z].name = "!MiniFAT"), de[U[0]].name = "!FAT", de.fat_addrs = U, de.ssz = w;
|
|
1351
1351
|
var _e = {}, ve = [], Be = [], De = [];
|
|
1352
1352
|
F(V, de, oe, ve, T, _e, Be, z), m(Be, De, ve), ve.shift();
|
|
1353
1353
|
var Le = {
|
|
@@ -1402,13 +1402,13 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1402
1402
|
return y.length === 0 ? new_buf(0) : bconcat(y).slice(0, x.size);
|
|
1403
1403
|
}
|
|
1404
1404
|
function d(x, v, g, w, T) {
|
|
1405
|
-
var y =
|
|
1406
|
-
if (x ===
|
|
1405
|
+
var y = K;
|
|
1406
|
+
if (x === K) {
|
|
1407
1407
|
if (v !== 0) throw new Error("DIFAT chain shorter than expected");
|
|
1408
1408
|
} else if (x !== -1) {
|
|
1409
1409
|
var V = g[x], z = (w >>> 2) - 1;
|
|
1410
1410
|
if (!V) return;
|
|
1411
|
-
for (var M = 0; M < z && (y = __readInt32LE(V, M * 4)) !==
|
|
1411
|
+
for (var M = 0; M < z && (y = __readInt32LE(V, M * 4)) !== K; ++M)
|
|
1412
1412
|
T.push(y);
|
|
1413
1413
|
d(__readInt32LE(V, w - 4), v - 1, g, w, T);
|
|
1414
1414
|
}
|
|
@@ -1463,7 +1463,7 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1463
1463
|
}, oe = J.read_shift(2) + J.read_shift(2) + J.read_shift(2) + J.read_shift(2);
|
|
1464
1464
|
oe !== 0 && (Q.ct = O(J, J.l - 8));
|
|
1465
1465
|
var de = J.read_shift(2) + J.read_shift(2) + J.read_shift(2) + J.read_shift(2);
|
|
1466
|
-
de !== 0 && (Q.mt = O(J, J.l - 8)), Q.start = J.read_shift(4, "i"), Q.size = J.read_shift(4, "i"), Q.size < 0 && Q.start < 0 && (Q.size = Q.type = 0, Q.start =
|
|
1466
|
+
de !== 0 && (Q.mt = O(J, J.l - 8)), Q.start = J.read_shift(4, "i"), Q.size = J.read_shift(4, "i"), Q.size < 0 && Q.start < 0 && (Q.size = Q.type = 0, Q.start = K, Q.name = ""), Q.type === 5 ? (M = Q.start, T > 0 && M !== K && (v[M].name = "!StreamData")) : Q.size >= 4096 ? (Q.storage = "fat", v[Q.start] === void 0 && (v[Q.start] = A(g, Q.start, v.fat_addrs, v.ssz)), v[Q.start].name = Q.name, Q.content = v[Q.start].data.slice(0, Q.size)) : (Q.storage = "minifat", Q.size < 0 ? Q.size = 0 : M !== K && Q.start !== K && v[M] && (Q.content = u(Q, v[M].data, (v[z] || {}).data))), Q.content && prep_blob(Q.content, 0), y[ee] = Q, V.push(Q);
|
|
1467
1467
|
}
|
|
1468
1468
|
}
|
|
1469
1469
|
function O(x, v) {
|
|
@@ -1527,7 +1527,7 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1527
1527
|
w = M[W], w || (U.push([W, {
|
|
1528
1528
|
name: n(W).replace("/", ""),
|
|
1529
1529
|
type: 1,
|
|
1530
|
-
clsid:
|
|
1530
|
+
clsid: ae,
|
|
1531
1531
|
ct: V,
|
|
1532
1532
|
mt: V,
|
|
1533
1533
|
content: null
|
|
@@ -1539,7 +1539,7 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1539
1539
|
x.FullPaths[T] = U[T][0], x.FileIndex[T] = U[T][1];
|
|
1540
1540
|
for (T = 0; T < U.length; ++T) {
|
|
1541
1541
|
var Y = x.FileIndex[T], q = x.FullPaths[T];
|
|
1542
|
-
if (Y.name = n(q).replace("/", ""), Y.L = Y.R = Y.C = -(Y.color = 1), Y.size = Y.content ? Y.content.length : 0, Y.start = 0, Y.clsid = Y.clsid ||
|
|
1542
|
+
if (Y.name = n(q).replace("/", ""), Y.L = Y.R = Y.C = -(Y.color = 1), Y.size = Y.content ? Y.content.length : 0, Y.start = 0, Y.clsid = Y.clsid || ae, T === 0)
|
|
1543
1543
|
Y.C = U.length > 1 ? 1 : -1, Y.size = 0, Y.type = 5;
|
|
1544
1544
|
else if (q.slice(-1) == "/") {
|
|
1545
1545
|
for (z = T + 1; z < U.length && a(x.FullPaths[z]) != q; ++z) ;
|
|
@@ -1570,19 +1570,19 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1570
1570
|
return ee.FileIndex[0].size = J << 6, Ce[7] = (ee.FileIndex[0].start = Ce[0] + Ce[1] + Ce[2] + Ce[3] + Ce[4] + Ce[5]) + (Ce[6] + 7 >> 3), Ce;
|
|
1571
1571
|
}(x), T = new_buf(w[7] << 9), y = 0, V = 0;
|
|
1572
1572
|
{
|
|
1573
|
-
for (y = 0; y < 8; ++y) T.write_shift(1,
|
|
1573
|
+
for (y = 0; y < 8; ++y) T.write_shift(1, ie[y]);
|
|
1574
1574
|
for (y = 0; y < 8; ++y) T.write_shift(2, 0);
|
|
1575
1575
|
for (T.write_shift(2, 62), T.write_shift(2, 3), T.write_shift(2, 65534), T.write_shift(2, 9), T.write_shift(2, 6), y = 0; y < 3; ++y) T.write_shift(2, 0);
|
|
1576
|
-
for (T.write_shift(4, 0), T.write_shift(4, w[2]), T.write_shift(4, w[0] + w[1] + w[2] + w[3] - 1), T.write_shift(4, 0), T.write_shift(4, 4096), T.write_shift(4, w[3] ? w[0] + w[1] + w[2] - 1 :
|
|
1576
|
+
for (T.write_shift(4, 0), T.write_shift(4, w[2]), T.write_shift(4, w[0] + w[1] + w[2] + w[3] - 1), T.write_shift(4, 0), T.write_shift(4, 4096), T.write_shift(4, w[3] ? w[0] + w[1] + w[2] - 1 : K), T.write_shift(4, w[3]), T.write_shift(-4, w[1] ? w[0] - 1 : K), T.write_shift(4, w[1]), y = 0; y < 109; ++y) T.write_shift(-4, y < w[2] ? w[1] + y : -1);
|
|
1577
1577
|
}
|
|
1578
1578
|
if (w[1])
|
|
1579
1579
|
for (V = 0; V < w[1]; ++V) {
|
|
1580
1580
|
for (; y < 236 + V * 127; ++y) T.write_shift(-4, y < w[2] ? w[1] + y : -1);
|
|
1581
|
-
T.write_shift(-4, V === w[1] - 1 ?
|
|
1581
|
+
T.write_shift(-4, V === w[1] - 1 ? K : V + 1);
|
|
1582
1582
|
}
|
|
1583
1583
|
var z = function(ee) {
|
|
1584
1584
|
for (V += ee; y < V - 1; ++y) T.write_shift(-4, y + 1);
|
|
1585
|
-
ee && (++y, T.write_shift(-4,
|
|
1585
|
+
ee && (++y, T.write_shift(-4, K));
|
|
1586
1586
|
};
|
|
1587
1587
|
for (V = y = 0, V += w[1]; y < V; ++y) T.write_shift(-4, ce.DIFSECT);
|
|
1588
1588
|
for (V += w[2]; y < V; ++y) T.write_shift(-4, ce.FATSECT);
|
|
@@ -1601,7 +1601,7 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1601
1601
|
for (M = 0; M < 12; ++M) T.write_shift(4, 0);
|
|
1602
1602
|
continue;
|
|
1603
1603
|
}
|
|
1604
|
-
W = x.FileIndex[y], y === 0 && (W.start = W.size ? W.start - 1 :
|
|
1604
|
+
W = x.FileIndex[y], y === 0 && (W.start = W.size ? W.start - 1 : K);
|
|
1605
1605
|
var q = y === 0 && g.root || W.name;
|
|
1606
1606
|
if (U = 2 * (q.length + 1), T.write_shift(64, q, "utf16le"), T.write_shift(2, U), T.write_shift(1, W.type), T.write_shift(1, W.color), T.write_shift(-4, W.L), T.write_shift(-4, W.R), T.write_shift(-4, W.C), W.clsid) T.write_shift(16, W.clsid, "hex");
|
|
1607
1607
|
else for (M = 0; M < 4; ++M) T.write_shift(4, 0);
|
|
@@ -1644,19 +1644,19 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1644
1644
|
if ((z ? g[V].replace(chr1, "!") : g[V]).replace(chr0, "") == y || (z ? w[V].replace(chr1, "!") : w[V]).replace(chr0, "") == y) return x.FileIndex[V];
|
|
1645
1645
|
return null;
|
|
1646
1646
|
}
|
|
1647
|
-
var R = 64,
|
|
1647
|
+
var R = 64, K = -2, le = "d0cf11e0a1b11ae1", ie = [208, 207, 17, 224, 161, 177, 26, 225], ae = "00000000000000000000000000000000", ce = {
|
|
1648
1648
|
/* 2.1 Compund File Sector Numbers and Types */
|
|
1649
1649
|
MAXREGSECT: -6,
|
|
1650
1650
|
DIFSECT: -4,
|
|
1651
1651
|
FATSECT: -3,
|
|
1652
|
-
ENDOFCHAIN:
|
|
1652
|
+
ENDOFCHAIN: K,
|
|
1653
1653
|
FREESECT: -1,
|
|
1654
1654
|
/* 2.2 Compound File Header */
|
|
1655
1655
|
HEADER_SIGNATURE: le,
|
|
1656
1656
|
HEADER_MINOR_VERSION: "3e00",
|
|
1657
1657
|
MAXREGSID: -6,
|
|
1658
1658
|
NOSTREAM: -1,
|
|
1659
|
-
HEADER_CLSID:
|
|
1659
|
+
HEADER_CLSID: ae,
|
|
1660
1660
|
/* 2.6.1 Compound File Directory Entry */
|
|
1661
1661
|
EntryTypes: ["unknown", "storage", "stream", "lockbytes", "property", "root"]
|
|
1662
1662
|
};
|
|
@@ -1703,7 +1703,7 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1703
1703
|
function b(x) {
|
|
1704
1704
|
return xe ? xe.deflateRawSync(x) : We(x);
|
|
1705
1705
|
}
|
|
1706
|
-
var P = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15],
|
|
1706
|
+
var P = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], j = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258], ne = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577];
|
|
1707
1707
|
function se(x) {
|
|
1708
1708
|
var v = (x << 1 | x << 11) & 139536 | (x << 5 | x << 15) & 558144;
|
|
1709
1709
|
return (v >> 16 | v >> 8 | v) & 255;
|
|
@@ -1807,12 +1807,12 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1807
1807
|
Pe(g, Re, 288);
|
|
1808
1808
|
})();
|
|
1809
1809
|
var qe = /* @__PURE__ */ function() {
|
|
1810
|
-
for (var v = re ? new Uint8Array(32768) : [], g = 0, w = 0; g <
|
|
1811
|
-
for (; w <
|
|
1810
|
+
for (var v = re ? new Uint8Array(32768) : [], g = 0, w = 0; g < ne.length - 1; ++g)
|
|
1811
|
+
for (; w < ne[g + 1]; ++w) v[w] = g;
|
|
1812
1812
|
for (; w < 32768; ++w) v[w] = 29;
|
|
1813
1813
|
var T = re ? new Uint8Array(259) : [];
|
|
1814
|
-
for (g = 0, w = 0; g <
|
|
1815
|
-
for (; w <
|
|
1814
|
+
for (g = 0, w = 0; g < j.length - 1; ++g)
|
|
1815
|
+
for (; w < j[g + 1]; ++w) T[w] = g;
|
|
1816
1816
|
function y(z, M) {
|
|
1817
1817
|
for (var U = 0; U < z.length; ) {
|
|
1818
1818
|
var W = Math.min(65535, z.length - U), Y = U + W == z.length;
|
|
@@ -1841,9 +1841,9 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1841
1841
|
if (oe > 2) {
|
|
1842
1842
|
J = T[oe], J <= 22 ? U = Ie(M, U, Z[J + 1] >> 1) - 1 : (Ie(M, U, 3), U += 5, Ie(M, U, Z[J - 23] >> 5), U += 3);
|
|
1843
1843
|
var de = J < 8 ? 0 : J - 4 >> 2;
|
|
1844
|
-
de > 0 && ($e(M, U, oe -
|
|
1844
|
+
de > 0 && ($e(M, U, oe - j[J]), U += de), J = v[W - Q], U = Ie(M, U, Z[J] >> 3), U -= 3;
|
|
1845
1845
|
var _e = J < 4 ? 0 : J - 2 >> 1;
|
|
1846
|
-
_e > 0 && ($e(M, U, W - Q -
|
|
1846
|
+
_e > 0 && ($e(M, U, W - Q - ne[J]), U += _e);
|
|
1847
1847
|
for (var ve = 0; ve < oe; ++ve)
|
|
1848
1848
|
Y[ee] = W & 32767, ee = (ee << 5 ^ z[W]) & 32767, ++W;
|
|
1849
1849
|
q -= oe - 1;
|
|
@@ -1925,9 +1925,9 @@ var CRC32 = /* @__PURE__ */ function() {
|
|
|
1925
1925
|
Y -= 257;
|
|
1926
1926
|
var q = Y < 8 ? 0 : Y - 4 >> 2;
|
|
1927
1927
|
q > 5 && (q = 0);
|
|
1928
|
-
var ee = y +
|
|
1928
|
+
var ee = y + j[Y];
|
|
1929
1929
|
q > 0 && (ee += Te(x, g, q), g += q), W = Te(x, g, M), Y = w >>> 1 == 1 ? Me[W] : He[W], g += Y & 15, Y >>>= 4;
|
|
1930
|
-
var J = Y < 4 ? 0 : Y - 2 >> 1, Q =
|
|
1930
|
+
var J = Y < 4 ? 0 : Y - 2 >> 1, Q = ne[Y];
|
|
1931
1931
|
for (J > 0 && (Q += Te(x, g, J), g += J), !v && V < ee && (T = Oe(T, ee + 100), V = T.length); y < ee; )
|
|
1932
1932
|
T[y] = T[y - Q], ++y;
|
|
1933
1933
|
}
|
|
@@ -4653,33 +4653,33 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
4653
4653
|
/*::)*/
|
|
4654
4654
|
] || 3) << 8), u = 0, d = 0; u < _.length; ++u)
|
|
4655
4655
|
if (_[u] != null) {
|
|
4656
|
-
var R = c.next(32),
|
|
4657
|
-
R.write_shift(1,
|
|
4656
|
+
var R = c.next(32), K = (_[u].slice(-10) + "\0\0\0\0\0\0\0\0\0\0\0").slice(0, 11);
|
|
4657
|
+
R.write_shift(1, K, "sbcs"), R.write_shift(1, O[u] == "?" ? "C" : O[u], "sbcs"), R.write_shift(4, d), R.write_shift(1, H[u] || i[O[u]] || 0), R.write_shift(1, G[u] || 0), R.write_shift(1, 2), R.write_shift(4, 0), R.write_shift(1, 0), R.write_shift(4, 0), R.write_shift(4, 0), d += H[u] || i[O[u]] || 0;
|
|
4658
4658
|
}
|
|
4659
4659
|
var le = c.next(264);
|
|
4660
4660
|
for (le.write_shift(4, 13), u = 0; u < 65; ++u) le.write_shift(4, 0);
|
|
4661
4661
|
for (u = 0; u < h.length; ++u) {
|
|
4662
|
-
var
|
|
4663
|
-
for (
|
|
4662
|
+
var ie = c.next(I);
|
|
4663
|
+
for (ie.write_shift(1, 0), d = 0; d < _.length; ++d)
|
|
4664
4664
|
if (_[d] != null)
|
|
4665
4665
|
switch (O[d]) {
|
|
4666
4666
|
case "L":
|
|
4667
|
-
|
|
4667
|
+
ie.write_shift(1, h[u][d] == null ? 63 : h[u][d] ? 84 : 70);
|
|
4668
4668
|
break;
|
|
4669
4669
|
case "B":
|
|
4670
|
-
|
|
4670
|
+
ie.write_shift(8, h[u][d] || 0, "f");
|
|
4671
4671
|
break;
|
|
4672
4672
|
case "N":
|
|
4673
|
-
var
|
|
4674
|
-
for (typeof h[u][d] == "number" && (
|
|
4675
|
-
|
|
4673
|
+
var ae = "0";
|
|
4674
|
+
for (typeof h[u][d] == "number" && (ae = h[u][d].toFixed(G[d] || 0)), A = 0; A < H[d] - ae.length; ++A) ie.write_shift(1, 32);
|
|
4675
|
+
ie.write_shift(1, ae, "sbcs");
|
|
4676
4676
|
break;
|
|
4677
4677
|
case "D":
|
|
4678
|
-
h[u][d] ? (
|
|
4678
|
+
h[u][d] ? (ie.write_shift(4, ("0000" + h[u][d].getFullYear()).slice(-4), "sbcs"), ie.write_shift(2, ("00" + (h[u][d].getMonth() + 1)).slice(-2), "sbcs"), ie.write_shift(2, ("00" + h[u][d].getDate()).slice(-2), "sbcs")) : ie.write_shift(8, "00000000", "sbcs");
|
|
4679
4679
|
break;
|
|
4680
4680
|
case "C":
|
|
4681
4681
|
var ce = String(h[u][d] != null ? h[u][d] : "").slice(0, H[d]);
|
|
4682
|
-
for (
|
|
4682
|
+
for (ie.write_shift(1, ce, "sbcs"), A = 0; A < H[d] - ce.length; ++A) ie.write_shift(1, 32);
|
|
4683
4683
|
break;
|
|
4684
4684
|
}
|
|
4685
4685
|
}
|
|
@@ -4811,9 +4811,9 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
4811
4811
|
var m = _.split(/[\n\r]+/), u = -1, d = -1, A = 0, I = 0, F = [], O = [], H = null, G = {}, C = [], D = [], S = [], N = 0, B;
|
|
4812
4812
|
for (+h.codepage >= 0 && set_cp(+h.codepage); A !== m.length; ++A) {
|
|
4813
4813
|
N = 0;
|
|
4814
|
-
var R = m[A].trim().replace(/\x1B([\x20-\x2F])([\x30-\x3F])/g, a).replace(r, t),
|
|
4814
|
+
var R = m[A].trim().replace(/\x1B([\x20-\x2F])([\x30-\x3F])/g, a).replace(r, t), K = R.replace(/;;/g, "\0").split(";").map(function(P) {
|
|
4815
4815
|
return P.replace(/\u0000/g, ";");
|
|
4816
|
-
}), le =
|
|
4816
|
+
}), le = K[0], ie;
|
|
4817
4817
|
if (R.length > 0) switch (le) {
|
|
4818
4818
|
case "ID":
|
|
4819
4819
|
break;
|
|
@@ -4826,25 +4826,25 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
4826
4826
|
case "W":
|
|
4827
4827
|
break;
|
|
4828
4828
|
case "P":
|
|
4829
|
-
|
|
4829
|
+
K[1].charAt(0) == "P" && O.push(R.slice(3).replace(/;;/g, ";"));
|
|
4830
4830
|
break;
|
|
4831
4831
|
case "C":
|
|
4832
|
-
var
|
|
4833
|
-
for (I = 1; I <
|
|
4832
|
+
var ae = !1, ce = !1, ge = !1, me = !1, we = -1, xe = -1;
|
|
4833
|
+
for (I = 1; I < K.length; ++I) switch (K[I].charAt(0)) {
|
|
4834
4834
|
case "A":
|
|
4835
4835
|
break;
|
|
4836
4836
|
case "X":
|
|
4837
|
-
d = parseInt(
|
|
4837
|
+
d = parseInt(K[I].slice(1)) - 1, ce = !0;
|
|
4838
4838
|
break;
|
|
4839
4839
|
case "Y":
|
|
4840
|
-
for (u = parseInt(
|
|
4840
|
+
for (u = parseInt(K[I].slice(1)) - 1, ce || (d = 0), B = F.length; B <= u; ++B) F[B] = [];
|
|
4841
4841
|
break;
|
|
4842
4842
|
case "K":
|
|
4843
|
-
|
|
4843
|
+
ie = K[I].slice(1), ie.charAt(0) === '"' ? ie = ie.slice(1, ie.length - 1) : ie === "TRUE" ? ie = !0 : ie === "FALSE" ? ie = !1 : isNaN(fuzzynum(ie)) ? isNaN(fuzzydate(ie).getDate()) || (ie = parseDate(ie)) : (ie = fuzzynum(ie), H !== null && fmt_is_date(H) && (ie = numdate(ie))), ae = !0;
|
|
4844
4844
|
break;
|
|
4845
4845
|
case "E":
|
|
4846
4846
|
me = !0;
|
|
4847
|
-
var k = rc_to_a1(
|
|
4847
|
+
var k = rc_to_a1(K[I].slice(1), { r: u, c: d });
|
|
4848
4848
|
F[u][d] = [F[u][d], k];
|
|
4849
4849
|
break;
|
|
4850
4850
|
case "S":
|
|
@@ -4853,15 +4853,15 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
4853
4853
|
case "G":
|
|
4854
4854
|
break;
|
|
4855
4855
|
case "R":
|
|
4856
|
-
we = parseInt(
|
|
4856
|
+
we = parseInt(K[I].slice(1)) - 1;
|
|
4857
4857
|
break;
|
|
4858
4858
|
case "C":
|
|
4859
|
-
xe = parseInt(
|
|
4859
|
+
xe = parseInt(K[I].slice(1)) - 1;
|
|
4860
4860
|
break;
|
|
4861
4861
|
default:
|
|
4862
4862
|
if (h && h.WTF) throw new Error("SYLK bad record " + R);
|
|
4863
4863
|
}
|
|
4864
|
-
if (
|
|
4864
|
+
if (ae && (F[u][d] && F[u][d].length == 2 ? F[u][d][0] = ie : F[u][d] = ie, H = null), ge) {
|
|
4865
4865
|
if (me) throw new Error("SYLK shared formula cannot have own formula");
|
|
4866
4866
|
var X = we > -1 && F[we][xe];
|
|
4867
4867
|
if (!X || !X[1]) throw new Error("SYLK shared formula cannot find base");
|
|
@@ -4870,22 +4870,22 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
4870
4870
|
break;
|
|
4871
4871
|
case "F":
|
|
4872
4872
|
var b = 0;
|
|
4873
|
-
for (I = 1; I <
|
|
4873
|
+
for (I = 1; I < K.length; ++I) switch (K[I].charAt(0)) {
|
|
4874
4874
|
case "X":
|
|
4875
|
-
d = parseInt(
|
|
4875
|
+
d = parseInt(K[I].slice(1)) - 1, ++b;
|
|
4876
4876
|
break;
|
|
4877
4877
|
case "Y":
|
|
4878
|
-
for (u = parseInt(
|
|
4878
|
+
for (u = parseInt(K[I].slice(1)) - 1, B = F.length; B <= u; ++B) F[B] = [];
|
|
4879
4879
|
break;
|
|
4880
4880
|
case "M":
|
|
4881
|
-
N = parseInt(
|
|
4881
|
+
N = parseInt(K[I].slice(1)) / 20;
|
|
4882
4882
|
break;
|
|
4883
4883
|
case "F":
|
|
4884
4884
|
break;
|
|
4885
4885
|
case "G":
|
|
4886
4886
|
break;
|
|
4887
4887
|
case "P":
|
|
4888
|
-
H = O[parseInt(
|
|
4888
|
+
H = O[parseInt(K[I].slice(1))];
|
|
4889
4889
|
break;
|
|
4890
4890
|
case "S":
|
|
4891
4891
|
break;
|
|
@@ -4894,14 +4894,14 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
4894
4894
|
case "N":
|
|
4895
4895
|
break;
|
|
4896
4896
|
case "W":
|
|
4897
|
-
for (S =
|
|
4897
|
+
for (S = K[I].slice(1).split(" "), B = parseInt(S[0], 10); B <= parseInt(S[1], 10); ++B)
|
|
4898
4898
|
N = parseInt(S[2], 10), D[B - 1] = N === 0 ? { hidden: !0 } : { wch: N }, process_col(D[B - 1]);
|
|
4899
4899
|
break;
|
|
4900
4900
|
case "C":
|
|
4901
|
-
d = parseInt(
|
|
4901
|
+
d = parseInt(K[I].slice(1)) - 1, D[d] || (D[d] = {});
|
|
4902
4902
|
break;
|
|
4903
4903
|
case "R":
|
|
4904
|
-
u = parseInt(
|
|
4904
|
+
u = parseInt(K[I].slice(1)) - 1, C[u] || (C[u] = {}), N > 0 ? (C[u].hpt = N, C[u].hpx = pt2px(N)) : N === 0 && (C[u].hidden = !0);
|
|
4905
4905
|
break;
|
|
4906
4906
|
default:
|
|
4907
4907
|
if (h && h.WTF) throw new Error("SYLK bad record " + R);
|
|
@@ -5241,8 +5241,8 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5241
5241
|
R.t = "n", _.cellText !== !1 && (R.w = B), R.v = I;
|
|
5242
5242
|
else if (!isNaN(fuzzydate(B).getDate()) || S && B.match(S)) {
|
|
5243
5243
|
R.z = _.dateNF || table_fmt[14];
|
|
5244
|
-
var
|
|
5245
|
-
S && B.match(S) && (B = dateNF_fix(B, _.dateNF, B.match(S) || []),
|
|
5244
|
+
var K = 0;
|
|
5245
|
+
S && B.match(S) && (B = dateNF_fix(B, _.dateNF, B.match(S) || []), K = 1), _.cellDates ? (R.t = "d", R.v = parseDate(B, K)) : (R.t = "n", R.v = datenum(parseDate(B, K))), _.cellText !== !1 && (R.w = SSF_format(R.z, R.v instanceof Date ? datenum(R.v) : R.v)), _.cellNF || delete R.z;
|
|
5246
5246
|
} else
|
|
5247
5247
|
R.t = "s", R.v = B;
|
|
5248
5248
|
if (R.t == "z" || (_.dense ? (m[d] || (m[d] = []), m[d][A] = R) : m[encode_cell({ c: A, r: d })] = R), F = O + 1, D = c.charCodeAt(F), u.e.c < A && (u.e.c = A), u.e.r < d && (u.e.r = d), C == H) ++A;
|
|
@@ -5315,8 +5315,8 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5315
5315
|
if (k) {
|
|
5316
5316
|
prep_blob(k, k.l || 0);
|
|
5317
5317
|
for (var P = b.Enum || we; k.l < k.length; ) {
|
|
5318
|
-
var
|
|
5319
|
-
if (k.l = re, X(Z,
|
|
5318
|
+
var j = k.read_shift(2), ne = P[j] || P[65535], se = k.read_shift(2), re = k.l + se, Z = ne.f && ne.f(k, se, b);
|
|
5319
|
+
if (k.l = re, X(Z, ne, j)) return;
|
|
5320
5320
|
}
|
|
5321
5321
|
}
|
|
5322
5322
|
}
|
|
@@ -5334,7 +5334,7 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5334
5334
|
}
|
|
5335
5335
|
function t(k, X) {
|
|
5336
5336
|
if (!k) return k;
|
|
5337
|
-
var b = X || {}, P = b.dense ? [] : {},
|
|
5337
|
+
var b = X || {}, P = b.dense ? [] : {}, j = "Sheet1", ne = "", se = 0, re = {}, Z = [], he = [], fe = { s: { r: 0, c: 0 }, e: { r: 0, c: 0 } }, Ee = b.sheetRows || 0;
|
|
5338
5338
|
if (k[2] == 0 && (k[3] == 8 || k[3] == 9) && k.length >= 16 && k[14] == 5 && k[15] === 108)
|
|
5339
5339
|
throw new Error("Unsupported Works 3 for Mac file");
|
|
5340
5340
|
if (k[2] == 2)
|
|
@@ -5347,10 +5347,10 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5347
5347
|
fe = te;
|
|
5348
5348
|
break;
|
|
5349
5349
|
case 204:
|
|
5350
|
-
te && (
|
|
5350
|
+
te && (ne = te);
|
|
5351
5351
|
break;
|
|
5352
5352
|
case 222:
|
|
5353
|
-
|
|
5353
|
+
ne = te;
|
|
5354
5354
|
break;
|
|
5355
5355
|
case 15:
|
|
5356
5356
|
case 51:
|
|
@@ -5358,7 +5358,7 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5358
5358
|
case 13:
|
|
5359
5359
|
case 14:
|
|
5360
5360
|
case 16:
|
|
5361
|
-
Ae == 14 && (te[2] & 112) == 112 && (te[2] & 15) > 1 && (te[2] & 15) < 15 && (te[1].z = b.dateNF || table_fmt[14], b.cellDates && (te[1].t = "d", te[1].v = numdate(te[1].v))), b.qpro && te[3] > se && (P["!ref"] = encode_range(fe), re[
|
|
5361
|
+
Ae == 14 && (te[2] & 112) == 112 && (te[2] & 15) > 1 && (te[2] & 15) < 15 && (te[1].z = b.dateNF || table_fmt[14], b.cellDates && (te[1].t = "d", te[1].v = numdate(te[1].v))), b.qpro && te[3] > se && (P["!ref"] = encode_range(fe), re[j] = P, Z.push(j), P = b.dense ? [] : {}, fe = { s: { r: 0, c: 0 }, e: { r: 0, c: 0 } }, se = te[3], j = ne || "Sheet" + (se + 1), ne = "");
|
|
5362
5362
|
var Fe = b.dense ? (P[te[0].r] || [])[te[0].c] : P[encode_cell(te[0])];
|
|
5363
5363
|
if (Fe) {
|
|
5364
5364
|
Fe.t = te[1].t, Fe.v = te[1].v, te[1].z != null && (Fe.z = te[1].z), te[1].f != null && (Fe.f = te[1].f);
|
|
@@ -5372,7 +5372,7 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5372
5372
|
b.Enum = xe, k[2] == 14 && (b.qpro = !0, k.l = 0), e(k, function(te, Te, Ae) {
|
|
5373
5373
|
switch (Ae) {
|
|
5374
5374
|
case 204:
|
|
5375
|
-
|
|
5375
|
+
j = te;
|
|
5376
5376
|
break;
|
|
5377
5377
|
case 22:
|
|
5378
5378
|
te[1].v = te[1].v.slice(1);
|
|
@@ -5382,31 +5382,31 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5382
5382
|
case 37:
|
|
5383
5383
|
case 39:
|
|
5384
5384
|
case 40:
|
|
5385
|
-
if (te[3] > se && (P["!ref"] = encode_range(fe), re[
|
|
5385
|
+
if (te[3] > se && (P["!ref"] = encode_range(fe), re[j] = P, Z.push(j), P = b.dense ? [] : {}, fe = { s: { r: 0, c: 0 }, e: { r: 0, c: 0 } }, se = te[3], j = "Sheet" + (se + 1)), Ee > 0 && te[0].r >= Ee) break;
|
|
5386
5386
|
b.dense ? (P[te[0].r] || (P[te[0].r] = []), P[te[0].r][te[0].c] = te[1]) : P[encode_cell(te[0])] = te[1], fe.e.c < te[0].c && (fe.e.c = te[0].c), fe.e.r < te[0].r && (fe.e.r = te[0].r);
|
|
5387
5387
|
break;
|
|
5388
5388
|
case 27:
|
|
5389
5389
|
te[14e3] && (he[te[14e3][0]] = te[14e3][1]);
|
|
5390
5390
|
break;
|
|
5391
5391
|
case 1537:
|
|
5392
|
-
he[te[0]] = te[1], te[0] == se && (
|
|
5392
|
+
he[te[0]] = te[1], te[0] == se && (j = te[1]);
|
|
5393
5393
|
break;
|
|
5394
5394
|
}
|
|
5395
5395
|
}, b);
|
|
5396
5396
|
else throw new Error("Unrecognized LOTUS BOF " + k[2]);
|
|
5397
|
-
if (P["!ref"] = encode_range(fe), re[
|
|
5397
|
+
if (P["!ref"] = encode_range(fe), re[ne || j] = P, Z.push(ne || j), !he.length) return { SheetNames: Z, Sheets: re };
|
|
5398
5398
|
for (var ue = {}, Se = [], pe = 0; pe < he.length; ++pe) re[Z[pe]] ? (Se.push(he[pe] || Z[pe]), ue[he[pe]] = re[he[pe]] || re[Z[pe]]) : (Se.push(he[pe]), ue[he[pe]] = { "!ref": "A1" });
|
|
5399
5399
|
return { SheetNames: Se, Sheets: ue };
|
|
5400
5400
|
}
|
|
5401
5401
|
function a(k, X) {
|
|
5402
5402
|
var b = X || {};
|
|
5403
5403
|
if (+b.codepage >= 0 && set_cp(+b.codepage), b.type == "string") throw new Error("Cannot write WK1 to JS string");
|
|
5404
|
-
var P = buf_array(),
|
|
5405
|
-
write_biff_rec(P, 0, i(1030)), write_biff_rec(P, 6, o(
|
|
5406
|
-
for (var re = Math.min(
|
|
5407
|
-
for (var he = encode_row(Z), fe =
|
|
5408
|
-
Z ===
|
|
5409
|
-
var Ee = se[fe] + he, ue =
|
|
5404
|
+
var P = buf_array(), j = safe_decode_range(k["!ref"]), ne = Array.isArray(k), se = [];
|
|
5405
|
+
write_biff_rec(P, 0, i(1030)), write_biff_rec(P, 6, o(j));
|
|
5406
|
+
for (var re = Math.min(j.e.r, 8191), Z = j.s.r; Z <= re; ++Z)
|
|
5407
|
+
for (var he = encode_row(Z), fe = j.s.c; fe <= j.e.c; ++fe) {
|
|
5408
|
+
Z === j.s.r && (se[fe] = encode_col(fe));
|
|
5409
|
+
var Ee = se[fe] + he, ue = ne ? (k[Z] || [])[fe] : k[Ee];
|
|
5410
5410
|
if (!(!ue || ue.t == "z"))
|
|
5411
5411
|
if (ue.t == "n")
|
|
5412
5412
|
(ue.v | 0) == ue.v && ue.v >= -32768 && ue.v <= 32767 ? write_biff_rec(P, 13, h(Z, fe, ue.v)) : write_biff_rec(P, 14, u(Z, fe, ue.v));
|
|
@@ -5422,10 +5422,10 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5422
5422
|
if (+b.codepage >= 0 && set_cp(+b.codepage), b.type == "string") throw new Error("Cannot write WK3 to JS string");
|
|
5423
5423
|
var P = buf_array();
|
|
5424
5424
|
write_biff_rec(P, 0, s(k));
|
|
5425
|
-
for (var
|
|
5425
|
+
for (var j = 0, ne = 0; j < k.SheetNames.length; ++j) (k.Sheets[k.SheetNames[j]] || {})["!ref"] && write_biff_rec(P, 27, me(k.SheetNames[j], ne++));
|
|
5426
5426
|
var se = 0;
|
|
5427
|
-
for (
|
|
5428
|
-
var re = k.Sheets[k.SheetNames[
|
|
5427
|
+
for (j = 0; j < k.SheetNames.length; ++j) {
|
|
5428
|
+
var re = k.Sheets[k.SheetNames[j]];
|
|
5429
5429
|
if (!(!re || !re["!ref"])) {
|
|
5430
5430
|
for (var Z = safe_decode_range(re["!ref"]), he = Array.isArray(re), fe = [], Ee = Math.min(Z.e.r, 8191), ue = Z.s.r; ue <= Ee; ++ue)
|
|
5431
5431
|
for (var Se = encode_row(ue), pe = Z.s.c; pe <= Z.e.c; ++pe) {
|
|
@@ -5451,15 +5451,15 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5451
5451
|
function s(k) {
|
|
5452
5452
|
var X = new_buf(26);
|
|
5453
5453
|
X.write_shift(2, 4096), X.write_shift(2, 4), X.write_shift(4, 0);
|
|
5454
|
-
for (var b = 0, P = 0,
|
|
5455
|
-
var se = k.SheetNames[
|
|
5454
|
+
for (var b = 0, P = 0, j = 0, ne = 0; ne < k.SheetNames.length; ++ne) {
|
|
5455
|
+
var se = k.SheetNames[ne], re = k.Sheets[se];
|
|
5456
5456
|
if (!(!re || !re["!ref"])) {
|
|
5457
|
-
++
|
|
5457
|
+
++j;
|
|
5458
5458
|
var Z = decode_range(re["!ref"]);
|
|
5459
5459
|
b < Z.e.r && (b = Z.e.r), P < Z.e.c && (P = Z.e.c);
|
|
5460
5460
|
}
|
|
5461
5461
|
}
|
|
5462
|
-
return b > 8191 && (b = 8191), X.write_shift(2, b), X.write_shift(1,
|
|
5462
|
+
return b > 8191 && (b = 8191), X.write_shift(2, b), X.write_shift(1, j), X.write_shift(1, P), X.write_shift(2, 0), X.write_shift(2, 0), X.write_shift(1, 1), X.write_shift(1, 2), X.write_shift(4, 0), X.write_shift(4, 0), X;
|
|
5463
5463
|
}
|
|
5464
5464
|
function l(k, X, b) {
|
|
5465
5465
|
var P = { s: { c: 0, r: 0 }, e: { c: 0, r: 0 } };
|
|
@@ -5474,20 +5474,20 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5474
5474
|
return b.qpro && b.vers != 20768 ? (P[0].c = k.read_shift(1), P[3] = k.read_shift(1), P[0].r = k.read_shift(2), k.l += 2) : (P[2] = k.read_shift(1), P[0].c = k.read_shift(2), P[0].r = k.read_shift(2)), P;
|
|
5475
5475
|
}
|
|
5476
5476
|
function c(k, X, b) {
|
|
5477
|
-
var P = k.l + X,
|
|
5478
|
-
if (
|
|
5477
|
+
var P = k.l + X, j = f(k, X, b);
|
|
5478
|
+
if (j[1].t = "s", b.vers == 20768) {
|
|
5479
5479
|
k.l++;
|
|
5480
|
-
var
|
|
5481
|
-
return
|
|
5480
|
+
var ne = k.read_shift(1);
|
|
5481
|
+
return j[1].v = k.read_shift(ne, "utf8"), j;
|
|
5482
5482
|
}
|
|
5483
|
-
return b.qpro && k.l++,
|
|
5483
|
+
return b.qpro && k.l++, j[1].v = k.read_shift(P - k.l, "cstr"), j;
|
|
5484
5484
|
}
|
|
5485
5485
|
function p(k, X, b) {
|
|
5486
5486
|
var P = new_buf(7 + b.length);
|
|
5487
5487
|
P.write_shift(1, 255), P.write_shift(2, X), P.write_shift(2, k), P.write_shift(1, 39);
|
|
5488
|
-
for (var
|
|
5489
|
-
var
|
|
5490
|
-
P.write_shift(1,
|
|
5488
|
+
for (var j = 0; j < P.length; ++j) {
|
|
5489
|
+
var ne = b.charCodeAt(j);
|
|
5490
|
+
P.write_shift(1, ne >= 128 ? 95 : ne);
|
|
5491
5491
|
}
|
|
5492
5492
|
return P.write_shift(1, 0), P;
|
|
5493
5493
|
}
|
|
@@ -5508,13 +5508,13 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5508
5508
|
return P.write_shift(1, 255), P.write_shift(2, X), P.write_shift(2, k), P.write_shift(8, b, "f"), P;
|
|
5509
5509
|
}
|
|
5510
5510
|
function d(k, X, b) {
|
|
5511
|
-
var P = k.l + X,
|
|
5512
|
-
if (
|
|
5511
|
+
var P = k.l + X, j = f(k, X, b);
|
|
5512
|
+
if (j[1].v = k.read_shift(8, "f"), b.qpro) k.l = P;
|
|
5513
5513
|
else {
|
|
5514
|
-
var
|
|
5515
|
-
O(k.slice(k.l, k.l +
|
|
5514
|
+
var ne = k.read_shift(2);
|
|
5515
|
+
O(k.slice(k.l, k.l + ne), j), k.l += ne;
|
|
5516
5516
|
}
|
|
5517
|
-
return
|
|
5517
|
+
return j;
|
|
5518
5518
|
}
|
|
5519
5519
|
function A(k, X, b) {
|
|
5520
5520
|
var P = X & 32768;
|
|
@@ -5570,19 +5570,19 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5570
5570
|
];
|
|
5571
5571
|
function O(k, X) {
|
|
5572
5572
|
prep_blob(k, 0);
|
|
5573
|
-
for (var b = [], P = 0,
|
|
5573
|
+
for (var b = [], P = 0, j = "", ne = "", se = "", re = ""; k.l < k.length; ) {
|
|
5574
5574
|
var Z = k[k.l++];
|
|
5575
5575
|
switch (Z) {
|
|
5576
5576
|
case 0:
|
|
5577
5577
|
b.push(k.read_shift(8, "f"));
|
|
5578
5578
|
break;
|
|
5579
5579
|
case 1:
|
|
5580
|
-
|
|
5580
|
+
ne = A(X[0].c, k.read_shift(2), !0), j = A(X[0].r, k.read_shift(2), !1), b.push(ne + j);
|
|
5581
5581
|
break;
|
|
5582
5582
|
case 2:
|
|
5583
5583
|
{
|
|
5584
5584
|
var he = A(X[0].c, k.read_shift(2), !0), fe = A(X[0].r, k.read_shift(2), !1);
|
|
5585
|
-
|
|
5585
|
+
ne = A(X[0].c, k.read_shift(2), !0), j = A(X[0].r, k.read_shift(2), !1), b.push(he + fe + ":" + ne + j);
|
|
5586
5586
|
}
|
|
5587
5587
|
break;
|
|
5588
5588
|
case 3:
|
|
@@ -5640,13 +5640,13 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5640
5640
|
return b[1].t = "s", b[1].v = k.read_shift(X - 4, "cstr"), b;
|
|
5641
5641
|
}
|
|
5642
5642
|
function C(k, X, b, P) {
|
|
5643
|
-
var
|
|
5644
|
-
|
|
5645
|
-
for (var
|
|
5646
|
-
var se = P.charCodeAt(
|
|
5647
|
-
|
|
5643
|
+
var j = new_buf(6 + P.length);
|
|
5644
|
+
j.write_shift(2, k), j.write_shift(1, b), j.write_shift(1, X), j.write_shift(1, 39);
|
|
5645
|
+
for (var ne = 0; ne < P.length; ++ne) {
|
|
5646
|
+
var se = P.charCodeAt(ne);
|
|
5647
|
+
j.write_shift(1, se >= 128 ? 95 : se);
|
|
5648
5648
|
}
|
|
5649
|
-
return
|
|
5649
|
+
return j.write_shift(1, 0), j;
|
|
5650
5650
|
}
|
|
5651
5651
|
function D(k, X) {
|
|
5652
5652
|
var b = H(k);
|
|
@@ -5682,18 +5682,18 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5682
5682
|
return b[1].v = P, b;
|
|
5683
5683
|
}
|
|
5684
5684
|
function S(k, X) {
|
|
5685
|
-
var b = H(k), P = k.read_shift(4),
|
|
5686
|
-
if (
|
|
5687
|
-
return P === 0 &&
|
|
5688
|
-
var se =
|
|
5689
|
-
return
|
|
5685
|
+
var b = H(k), P = k.read_shift(4), j = k.read_shift(4), ne = k.read_shift(2);
|
|
5686
|
+
if (ne == 65535)
|
|
5687
|
+
return P === 0 && j === 3221225472 ? (b[1].t = "e", b[1].v = 15) : P === 0 && j === 3489660928 ? (b[1].t = "e", b[1].v = 42) : b[1].v = 0, b;
|
|
5688
|
+
var se = ne & 32768;
|
|
5689
|
+
return ne = (ne & 32767) - 16446, b[1].v = (1 - se * 2) * (j * Math.pow(2, ne + 32) + P * Math.pow(2, ne)), b;
|
|
5690
5690
|
}
|
|
5691
5691
|
function N(k, X, b, P) {
|
|
5692
|
-
var
|
|
5693
|
-
if (
|
|
5694
|
-
return
|
|
5695
|
-
var
|
|
5696
|
-
return P < 0 && (
|
|
5692
|
+
var j = new_buf(14);
|
|
5693
|
+
if (j.write_shift(2, k), j.write_shift(1, b), j.write_shift(1, X), P == 0)
|
|
5694
|
+
return j.write_shift(4, 0), j.write_shift(4, 0), j.write_shift(2, 65535), j;
|
|
5695
|
+
var ne = 0, se = 0, re = 0, Z = 0;
|
|
5696
|
+
return P < 0 && (ne = 1, P = -P), se = Math.log2(P) | 0, P /= Math.pow(2, se - 31), Z = P >>> 0, Z & 2147483648 || (P /= 2, ++se, Z = P >>> 0), P -= Z, Z |= 2147483648, Z >>>= 0, P *= Math.pow(2, 32), re = P >>> 0, j.write_shift(4, re), j.write_shift(4, Z), se += 16383 + (ne ? 32768 : 0), j.write_shift(2, se), j;
|
|
5697
5697
|
}
|
|
5698
5698
|
function B(k, X) {
|
|
5699
5699
|
var b = S(k);
|
|
@@ -5703,18 +5703,18 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5703
5703
|
var b = H(k), P = k.read_shift(4);
|
|
5704
5704
|
return b[1].v = P >> 6, b;
|
|
5705
5705
|
}
|
|
5706
|
-
function
|
|
5706
|
+
function K(k, X) {
|
|
5707
5707
|
var b = H(k), P = k.read_shift(8, "f");
|
|
5708
5708
|
return b[1].v = P, b;
|
|
5709
5709
|
}
|
|
5710
5710
|
function le(k, X) {
|
|
5711
|
-
var b =
|
|
5711
|
+
var b = K(k);
|
|
5712
5712
|
return k.l += X - 10, b;
|
|
5713
5713
|
}
|
|
5714
|
-
function
|
|
5714
|
+
function ie(k, X) {
|
|
5715
5715
|
return k[k.l + X - 1] == 0 ? k.read_shift(X, "cstr") : "";
|
|
5716
5716
|
}
|
|
5717
|
-
function
|
|
5717
|
+
function ae(k, X) {
|
|
5718
5718
|
var b = k[k.l++];
|
|
5719
5719
|
b > X - 1 && (b = X - 1);
|
|
5720
5720
|
for (var P = ""; P.length < b; ) P += String.fromCharCode(k[k.l++]);
|
|
@@ -5724,16 +5724,16 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5724
5724
|
if (!(!b.qpro || X < 21)) {
|
|
5725
5725
|
var P = k.read_shift(1);
|
|
5726
5726
|
k.l += 17, k.l += 1, k.l += 2;
|
|
5727
|
-
var
|
|
5728
|
-
return [P,
|
|
5727
|
+
var j = k.read_shift(X - 21, "cstr");
|
|
5728
|
+
return [P, j];
|
|
5729
5729
|
}
|
|
5730
5730
|
}
|
|
5731
5731
|
function ge(k, X) {
|
|
5732
5732
|
for (var b = {}, P = k.l + X; k.l < P; ) {
|
|
5733
|
-
var
|
|
5734
|
-
if (
|
|
5735
|
-
for (b[
|
|
5736
|
-
b[
|
|
5733
|
+
var j = k.read_shift(2);
|
|
5734
|
+
if (j == 14e3) {
|
|
5735
|
+
for (b[j] = [0, ""], b[j][0] = k.read_shift(2); k[k.l]; )
|
|
5736
|
+
b[j][1] += String.fromCharCode(k[k.l]), k.l++;
|
|
5737
5737
|
k.l++;
|
|
5738
5738
|
}
|
|
5739
5739
|
}
|
|
@@ -5743,8 +5743,8 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5743
5743
|
var b = new_buf(5 + k.length);
|
|
5744
5744
|
b.write_shift(2, 14e3), b.write_shift(2, X);
|
|
5745
5745
|
for (var P = 0; P < k.length; ++P) {
|
|
5746
|
-
var
|
|
5747
|
-
b[b.l++] =
|
|
5746
|
+
var j = k.charCodeAt(P);
|
|
5747
|
+
b[b.l++] = j > 127 ? 95 : j;
|
|
5748
5748
|
}
|
|
5749
5749
|
return b[b.l++] = 0, b;
|
|
5750
5750
|
}
|
|
@@ -5872,9 +5872,9 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5872
5872
|
/*::[*/
|
|
5873
5873
|
105: { n: "MRANGES??" },
|
|
5874
5874
|
/*::[*/
|
|
5875
|
-
204: { n: "SHEETNAMECS", f:
|
|
5875
|
+
204: { n: "SHEETNAMECS", f: ie },
|
|
5876
5876
|
/*::[*/
|
|
5877
|
-
222: { n: "SHEETNAMELP", f:
|
|
5877
|
+
222: { n: "SHEETNAMELP", f: ae },
|
|
5878
5878
|
/*::[*/
|
|
5879
5879
|
65535: { n: "" }
|
|
5880
5880
|
}, xe = {
|
|
@@ -5955,7 +5955,7 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
5955
5955
|
/*::[*/
|
|
5956
5956
|
38: { n: "??" },
|
|
5957
5957
|
/*::[*/
|
|
5958
|
-
39: { n: "NUMBER27", f:
|
|
5958
|
+
39: { n: "NUMBER27", f: K },
|
|
5959
5959
|
/*::[*/
|
|
5960
5960
|
40: { n: "FORMULA28", f: le },
|
|
5961
5961
|
/*::[*/
|
|
@@ -6001,7 +6001,7 @@ var DBF = /* @__PURE__ */ function() {
|
|
|
6001
6001
|
/*::[*/
|
|
6002
6002
|
201: { n: "??" },
|
|
6003
6003
|
/*::[*/
|
|
6004
|
-
204: { n: "SHEETNAMECS", f:
|
|
6004
|
+
204: { n: "SHEETNAMECS", f: ie },
|
|
6005
6005
|
/*::[*/
|
|
6006
6006
|
205: { n: "??" },
|
|
6007
6007
|
/*::[*/
|
|
@@ -7583,14 +7583,14 @@ function stringify_formula(e, r, t, a, n) {
|
|
|
7583
7583
|
N || (N = { Name: "SH33TJSERRY" }), l.push(N.Name);
|
|
7584
7584
|
break;
|
|
7585
7585
|
case "PtgParen":
|
|
7586
|
-
var
|
|
7586
|
+
var K = "(", le = ")";
|
|
7587
7587
|
if (u >= 0) {
|
|
7588
7588
|
switch (d = "", e[0][u][1][0]) {
|
|
7589
7589
|
case 2:
|
|
7590
|
-
|
|
7590
|
+
K = fill(" ", e[0][u][1][1]) + K;
|
|
7591
7591
|
break;
|
|
7592
7592
|
case 3:
|
|
7593
|
-
|
|
7593
|
+
K = fill("\r", e[0][u][1][1]) + K;
|
|
7594
7594
|
break;
|
|
7595
7595
|
case 4:
|
|
7596
7596
|
le = fill(" ", e[0][u][1][1]) + le;
|
|
@@ -7603,7 +7603,7 @@ function stringify_formula(e, r, t, a, n) {
|
|
|
7603
7603
|
}
|
|
7604
7604
|
u = -1;
|
|
7605
7605
|
}
|
|
7606
|
-
l.push(
|
|
7606
|
+
l.push(K + l.pop() + le);
|
|
7607
7607
|
break;
|
|
7608
7608
|
case "PtgRefErr":
|
|
7609
7609
|
l.push("#REF!");
|
|
@@ -7613,15 +7613,15 @@ function stringify_formula(e, r, t, a, n) {
|
|
|
7613
7613
|
break;
|
|
7614
7614
|
case "PtgExp":
|
|
7615
7615
|
c = { c: F[1][1], r: F[1][0] };
|
|
7616
|
-
var
|
|
7616
|
+
var ie = { c: t.c, r: t.r };
|
|
7617
7617
|
if (a.sharedf[encode_cell(c)]) {
|
|
7618
|
-
var
|
|
7619
|
-
l.push(stringify_formula(
|
|
7618
|
+
var ae = a.sharedf[encode_cell(c)];
|
|
7619
|
+
l.push(stringify_formula(ae, s, ie, a, n));
|
|
7620
7620
|
} else {
|
|
7621
7621
|
var ce = !1;
|
|
7622
7622
|
for (o = 0; o != a.arrayf.length; ++o)
|
|
7623
7623
|
if (f = a.arrayf[o], !(c.c < f[0].s.c || c.c > f[0].e.c) && !(c.r < f[0].s.r || c.r > f[0].e.r)) {
|
|
7624
|
-
l.push(stringify_formula(f[1], s,
|
|
7624
|
+
l.push(stringify_formula(f[1], s, ie, a, n)), ce = !0;
|
|
7625
7625
|
break;
|
|
7626
7626
|
}
|
|
7627
7627
|
ce || l.push(
|
|
@@ -14316,8 +14316,8 @@ function sheet_add_dom(e, r, t) {
|
|
|
14316
14316
|
F = +G.getAttribute("colspan") || 1, ((I = +G.getAttribute("rowspan") || 1) > 1 || F > 1) && p.push({ s: { r: u + n, c: A + i }, e: { r: u + n + (I || 1) - 1, c: A + i + (F || 1) - 1 } });
|
|
14317
14317
|
var N = { t: "s", v: C }, B = G.getAttribute("data-t") || G.getAttribute("t") || "";
|
|
14318
14318
|
C != null && (C.length == 0 ? N.t = B || "z" : a.raw || C.trim().length == 0 || B == "s" || (C === "TRUE" ? N = { t: "b", v: !0 } : C === "FALSE" ? N = { t: "b", v: !1 } : isNaN(fuzzynum(C)) ? isNaN(fuzzydate(C).getDate()) || (N = { t: "d", v: parseDate(C) }, a.cellDates || (N = { t: "n", v: datenum(N.v) }), N.z = a.dateNF || table_fmt[14]) : N = { t: "n", v: fuzzynum(C) })), N.z === void 0 && D != null && (N.z = D);
|
|
14319
|
-
var R = "",
|
|
14320
|
-
if (
|
|
14319
|
+
var R = "", K = G.getElementsByTagName("A");
|
|
14320
|
+
if (K && K.length) for (var le = 0; le < K.length && !(K[le].hasAttribute("href") && (R = K[le].getAttribute("href"), R.charAt(0) != "#")); ++le) ;
|
|
14321
14321
|
R && R.charAt(0) != "#" && (N.l = { Target: R }), a.dense ? (e[u + n] || (e[u + n] = []), e[u + n][A + i] = N) : e[encode_cell({ c: A + i, r: u + n })] = N, f.e.c < A + i && (f.e.c = A + i), A += F;
|
|
14322
14322
|
}
|
|
14323
14323
|
}
|
|
@@ -14836,7 +14836,7 @@ function write_numbers_iwa(e, r) {
|
|
|
14836
14836
|
}).forEach(function(X) {
|
|
14837
14837
|
var b = X[0], P = X[1];
|
|
14838
14838
|
if (b.type == 2 && b.name.match(/\.iwa/)) {
|
|
14839
|
-
var
|
|
14839
|
+
var j = b.content, ne = decompress_iwa_file(j), se = parse_iwa_file(ne);
|
|
14840
14840
|
se.forEach(function(re) {
|
|
14841
14841
|
o.push(re.id), l[re.id] = { deps: [], location: P, type: varint_to_i32(re.messages[0].meta[1][0].data) };
|
|
14842
14842
|
});
|
|
@@ -14855,12 +14855,12 @@ function write_numbers_iwa(e, r) {
|
|
|
14855
14855
|
var b = X[0];
|
|
14856
14856
|
if (X[1], !!b.name.match(/\.iwa/)) {
|
|
14857
14857
|
var P = parse_iwa_file(decompress_iwa_file(b.content));
|
|
14858
|
-
P.forEach(function(
|
|
14859
|
-
|
|
14858
|
+
P.forEach(function(j) {
|
|
14859
|
+
j.messages.forEach(function(ne) {
|
|
14860
14860
|
c.forEach(function(se) {
|
|
14861
|
-
|
|
14861
|
+
j.messages.some(function(re) {
|
|
14862
14862
|
return varint_to_i32(re.meta[1][0].data) != 11006 && u8contains(re.data, se[1]);
|
|
14863
|
-
}) && l[se[0]].deps.push(
|
|
14863
|
+
}) && l[se[0]].deps.push(j.id);
|
|
14864
14864
|
});
|
|
14865
14865
|
});
|
|
14866
14866
|
});
|
|
@@ -14906,29 +14906,29 @@ function write_numbers_iwa(e, r) {
|
|
|
14906
14906
|
{
|
|
14907
14907
|
if (O[0].id != R)
|
|
14908
14908
|
throw "Bad HeaderStorageBucket";
|
|
14909
|
-
var
|
|
14909
|
+
var K = parse_shallow(O[0].messages[0].data);
|
|
14910
14910
|
for (S = 0; S < i.length; ++S) {
|
|
14911
|
-
var le = parse_shallow(
|
|
14912
|
-
le[1][0].data = write_varint49(S), le[4][0].data = write_varint49(i[S].length),
|
|
14911
|
+
var le = parse_shallow(K[2][0].data);
|
|
14912
|
+
le[1][0].data = write_varint49(S), le[4][0].data = write_varint49(i[S].length), K[2][S] = { type: K[2][0].type, data: write_shallow(le) };
|
|
14913
14913
|
}
|
|
14914
|
-
O[0].messages[0].data = write_shallow(
|
|
14914
|
+
O[0].messages[0].data = write_shallow(K);
|
|
14915
14915
|
}
|
|
14916
14916
|
F.content = compress_iwa_file(write_iwa_file(O)), F.size = F.content.length;
|
|
14917
|
-
var
|
|
14918
|
-
F = CFB.find(f, l[
|
|
14917
|
+
var ie = parse_TSP_Reference(N[2][0].data);
|
|
14918
|
+
F = CFB.find(f, l[ie].location), O = parse_iwa_file(decompress_iwa_file(F.content));
|
|
14919
14919
|
{
|
|
14920
|
-
if (O[0].id !=
|
|
14920
|
+
if (O[0].id != ie)
|
|
14921
14921
|
throw "Bad HeaderStorageBucket";
|
|
14922
|
-
for (
|
|
14923
|
-
le = parse_shallow(
|
|
14924
|
-
O[0].messages[0].data = write_shallow(
|
|
14922
|
+
for (K = parse_shallow(O[0].messages[0].data), C = 0; C <= a.e.c; ++C)
|
|
14923
|
+
le = parse_shallow(K[2][0].data), le[1][0].data = write_varint49(C), le[4][0].data = write_varint49(a.e.r + 1), K[2][C] = { type: K[2][0].type, data: write_shallow(le) };
|
|
14924
|
+
O[0].messages[0].data = write_shallow(K);
|
|
14925
14925
|
}
|
|
14926
14926
|
F.content = compress_iwa_file(write_iwa_file(O)), F.size = F.content.length;
|
|
14927
|
-
var
|
|
14927
|
+
var ae = parse_TSP_Reference(N[4][0].data);
|
|
14928
14928
|
(function() {
|
|
14929
|
-
for (var X = CFB.find(f, l[
|
|
14930
|
-
var
|
|
14931
|
-
|
|
14929
|
+
for (var X = CFB.find(f, l[ae].location), b = parse_iwa_file(decompress_iwa_file(X.content)), P, j = 0; j < b.length; ++j) {
|
|
14930
|
+
var ne = b[j];
|
|
14931
|
+
ne.id == ae && (P = ne);
|
|
14932
14932
|
}
|
|
14933
14933
|
var se = parse_shallow(P.messages[0].data);
|
|
14934
14934
|
{
|
|
@@ -14950,9 +14950,9 @@ function write_numbers_iwa(e, r) {
|
|
|
14950
14950
|
{
|
|
14951
14951
|
var we = parse_TSP_Reference(me[2][0].data);
|
|
14952
14952
|
(function() {
|
|
14953
|
-
for (var X = CFB.find(f, l[we].location), b = parse_iwa_file(decompress_iwa_file(X.content)), P,
|
|
14954
|
-
var
|
|
14955
|
-
|
|
14953
|
+
for (var X = CFB.find(f, l[we].location), b = parse_iwa_file(decompress_iwa_file(X.content)), P, j = 0; j < b.length; ++j) {
|
|
14954
|
+
var ne = b[j];
|
|
14955
|
+
ne.id == we && (P = ne);
|
|
14956
14956
|
}
|
|
14957
14957
|
var se = parse_shallow(P.messages[0].data);
|
|
14958
14958
|
{
|
|
@@ -15783,16 +15783,16 @@ const _hoisted_1$e = { style: { display: "inline-block", width: "100px" } }, _ho
|
|
|
15783
15783
|
}
|
|
15784
15784
|
}, o = ({ row: D, column: S, columnIndex: N, rowIndex: B }) => {
|
|
15785
15785
|
if (S.property == null) return { rowspan: 1, colspan: 1 };
|
|
15786
|
-
let R = S.property,
|
|
15787
|
-
if (
|
|
15786
|
+
let R = S.property, K = a.value.FirstOrDefault((ae) => ae.dataKey == R);
|
|
15787
|
+
if (K == null || !K.isHeBing) return { rowspan: 1, colspan: 1 };
|
|
15788
15788
|
let le = D[R];
|
|
15789
15789
|
if (B > 0 && le == n.value[B - 1][R])
|
|
15790
15790
|
return { rowspan: 0, colspan: 0 };
|
|
15791
|
-
let
|
|
15792
|
-
for (let
|
|
15793
|
-
|
|
15791
|
+
let ie = 0;
|
|
15792
|
+
for (let ae = B; ae < n.value.length && n.value[ae][R] == le; ae++)
|
|
15793
|
+
ie++;
|
|
15794
15794
|
return {
|
|
15795
|
-
rowspan:
|
|
15795
|
+
rowspan: ie,
|
|
15796
15796
|
colspan: 1
|
|
15797
15797
|
};
|
|
15798
15798
|
}, f = (D, S) => {
|
|
@@ -15811,46 +15811,46 @@ const _hoisted_1$e = { style: { display: "inline-block", width: "100px" } }, _ho
|
|
|
15811
15811
|
D == "打印" && (B[R] = N.src);
|
|
15812
15812
|
continue;
|
|
15813
15813
|
}
|
|
15814
|
-
let
|
|
15815
|
-
|
|
15814
|
+
let K = f(a.value, (le) => le.dataKey == R);
|
|
15815
|
+
K != null && (B[K.title] = N[R]);
|
|
15816
15816
|
}
|
|
15817
15817
|
return B;
|
|
15818
15818
|
});
|
|
15819
15819
|
}, p = async () => {
|
|
15820
15820
|
let D = await c("导出"), S = 0, N = D.length, B = [];
|
|
15821
|
-
for (let
|
|
15822
|
-
S++, B.push(
|
|
15821
|
+
for (let ae in D[0])
|
|
15822
|
+
S++, B.push(ae);
|
|
15823
15823
|
let R = [];
|
|
15824
|
-
s.printOption.TitleArray.forEach((
|
|
15825
|
-
R.push([
|
|
15824
|
+
s.printOption.TitleArray.forEach((ae) => {
|
|
15825
|
+
R.push([ae]);
|
|
15826
15826
|
}), R.push(B);
|
|
15827
|
-
for (let
|
|
15828
|
-
let ce = B.map((ge) => D[
|
|
15827
|
+
for (let ae = 0; ae < D.length; ae++) {
|
|
15828
|
+
let ce = B.map((ge) => D[ae][ge]);
|
|
15829
15829
|
R.push(ce);
|
|
15830
15830
|
}
|
|
15831
|
-
s.printOption.FootArray.forEach((
|
|
15832
|
-
R.push([
|
|
15831
|
+
s.printOption.FootArray.forEach((ae) => {
|
|
15832
|
+
R.push([ae]);
|
|
15833
15833
|
});
|
|
15834
|
-
const
|
|
15834
|
+
const K = utils.aoa_to_sheet(R, { header: B });
|
|
15835
15835
|
let le = [];
|
|
15836
|
-
for (let
|
|
15837
|
-
le.push({ s: { r:
|
|
15838
|
-
for (let
|
|
15839
|
-
let ce = N +
|
|
15836
|
+
for (let ae = 0; ae < s.printOption.TitleArray.length; ae++)
|
|
15837
|
+
le.push({ s: { r: ae, c: 0 }, e: { r: ae, c: S - 1 } });
|
|
15838
|
+
for (let ae = 0; ae < s.printOption.FootArray.length; ae++) {
|
|
15839
|
+
let ce = N + ae + s.printOption.TitleArray.length + 1;
|
|
15840
15840
|
le.push({ s: { r: ce, c: 0 }, e: { r: ce, c: S - 1 } });
|
|
15841
15841
|
}
|
|
15842
|
-
for (let
|
|
15843
|
-
let ce = B[
|
|
15842
|
+
for (let ae = 0; ae < S; ae++) {
|
|
15843
|
+
let ce = B[ae], ge = a.value.FirstOrDefault((k) => k.title == ce);
|
|
15844
15844
|
if (ge == null || !ge.isHeBing) continue;
|
|
15845
15845
|
let me, we = 0, xe = 0;
|
|
15846
15846
|
for (let k = 0; k < R.length; k++) {
|
|
15847
|
-
if (R[k].length <
|
|
15848
|
-
let X = R[k][
|
|
15849
|
-
X == me ? xe = k : (we != xe && le.push({ s: { r: we, c:
|
|
15847
|
+
if (R[k].length < ae) continue;
|
|
15848
|
+
let X = R[k][ae];
|
|
15849
|
+
X == me ? xe = k : (we != xe && le.push({ s: { r: we, c: ae }, e: { r: xe, c: ae } }), we = k, xe = k, me = X);
|
|
15850
15850
|
}
|
|
15851
15851
|
}
|
|
15852
|
-
|
|
15853
|
-
|
|
15852
|
+
K["!merges"] || (K["!merges"] = []), K["!merges"] = K["!merges"].concat(le), Object.keys(K).forEach((ae) => {
|
|
15853
|
+
ae.indexOf("!") < 0 && (K[ae].s = {
|
|
15854
15854
|
alignment: {
|
|
15855
15855
|
//对齐方式
|
|
15856
15856
|
horizontal: "center",
|
|
@@ -15859,15 +15859,15 @@ const _hoisted_1$e = { style: { display: "inline-block", width: "100px" } }, _ho
|
|
|
15859
15859
|
//竖直居中
|
|
15860
15860
|
// wrapText: true,//自动换行
|
|
15861
15861
|
}
|
|
15862
|
-
},
|
|
15862
|
+
}, ae.indexOf("1") !== -1 && (K[ae].s.font = {
|
|
15863
15863
|
bold: !0,
|
|
15864
15864
|
sz: 16
|
|
15865
|
-
}),
|
|
15865
|
+
}), ae.indexOf("2") !== -1 && (K[ae].s.font = {
|
|
15866
15866
|
sz: 14
|
|
15867
15867
|
}));
|
|
15868
15868
|
});
|
|
15869
|
-
const
|
|
15870
|
-
utils.book_append_sheet(
|
|
15869
|
+
const ie = utils.book_new();
|
|
15870
|
+
utils.book_append_sheet(ie, K, "sheet1"), writeFileSync(ie, s.tabName + L("导出") + ".xlsx");
|
|
15871
15871
|
};
|
|
15872
15872
|
let _ = /^[+-]?([0-9]+[.][0-9]*|[.][0-9]+)$/;
|
|
15873
15873
|
const h = ({ columns: D, data: S }) => {
|
|
@@ -15877,18 +15877,18 @@ const _hoisted_1$e = { style: { display: "inline-block", width: "100px" } }, _ho
|
|
|
15877
15877
|
N[R] = L("合计");
|
|
15878
15878
|
return;
|
|
15879
15879
|
}
|
|
15880
|
-
let
|
|
15881
|
-
if (
|
|
15880
|
+
let K = a.value.FirstOrDefault((ie) => ie.dataKey == B.property && ie.isSummary);
|
|
15881
|
+
if (K == null) {
|
|
15882
15882
|
N[R] = "";
|
|
15883
15883
|
return;
|
|
15884
15884
|
}
|
|
15885
15885
|
N[R] = 0;
|
|
15886
15886
|
let le = !1;
|
|
15887
|
-
S.forEach((
|
|
15888
|
-
if (!
|
|
15889
|
-
let
|
|
15890
|
-
!le && _.test(
|
|
15891
|
-
let ce = Number(
|
|
15887
|
+
S.forEach((ie) => {
|
|
15888
|
+
if (!ie.src.IgnoreSummary) {
|
|
15889
|
+
let ae = ie[K.dataKey];
|
|
15890
|
+
!le && _.test(ae) && (le = !0);
|
|
15891
|
+
let ce = Number(ie[K.dataKey]);
|
|
15892
15892
|
Number.isNaN(ce) || (N[R] += ce);
|
|
15893
15893
|
}
|
|
15894
15894
|
}), le && (N[R] = N[R].toFixed(2));
|
|
@@ -15922,34 +15922,36 @@ const _hoisted_1$e = { style: { display: "inline-block", width: "100px" } }, _ho
|
|
|
15922
15922
|
D.filterList = D.filters.Where((S) => !D.filterList.Exists((N) => N == S.text)).Select((S) => S.text), await F(!0), D.isVisible = !1;
|
|
15923
15923
|
}, F = async (D) => {
|
|
15924
15924
|
let S = [];
|
|
15925
|
-
s.
|
|
15925
|
+
for (let N = 0; N < s.data.length; N++) {
|
|
15926
|
+
let B = s.data[N];
|
|
15927
|
+
B.src = B;
|
|
15926
15928
|
let R = {};
|
|
15927
|
-
for (let
|
|
15928
|
-
|
|
15929
|
-
|
|
15930
|
-
let N = [];
|
|
15931
|
-
for (let B = 0; B < s.data.length; B++) {
|
|
15932
|
-
let R = s.data[B];
|
|
15933
|
-
R.src = R;
|
|
15934
|
-
let j = {};
|
|
15935
|
-
for (let le = 0; le < a.value.length; le++) {
|
|
15936
|
-
let ae = a.value[le];
|
|
15937
|
-
j[ae.dataKey] = await m(R, ae);
|
|
15929
|
+
for (let K = 0; K < a.value.length; K++) {
|
|
15930
|
+
let le = a.value[K];
|
|
15931
|
+
R[le.dataKey] = await m(B, le);
|
|
15938
15932
|
}
|
|
15939
|
-
|
|
15933
|
+
R.src = B, S.push(R);
|
|
15940
15934
|
}
|
|
15941
|
-
|
|
15942
|
-
|
|
15943
|
-
|
|
15944
|
-
|
|
15945
|
-
|
|
15946
|
-
|
|
15947
|
-
|
|
15948
|
-
|
|
15949
|
-
|
|
15950
|
-
|
|
15951
|
-
|
|
15952
|
-
|
|
15935
|
+
if (D) {
|
|
15936
|
+
let N = [];
|
|
15937
|
+
s.columnArray.forEach((B) => {
|
|
15938
|
+
let R = {};
|
|
15939
|
+
for (let K in B) R[K] = B[K];
|
|
15940
|
+
R.isFilter && (R.filters || (R.filterText = "", R.filterList = [], R.filters = [], R.Id = d())), N.push(R);
|
|
15941
|
+
}), a.value = N, a.value.forEach((B) => {
|
|
15942
|
+
if (B.isFilter) {
|
|
15943
|
+
let R = [];
|
|
15944
|
+
S.forEach((K) => {
|
|
15945
|
+
let le = K[B.dataKey];
|
|
15946
|
+
R.some((ie) => ie.value == le) || R.push({ text: le, value: le });
|
|
15947
|
+
}), B.filters = R;
|
|
15948
|
+
}
|
|
15949
|
+
});
|
|
15950
|
+
}
|
|
15951
|
+
n.value = S.filter((N) => {
|
|
15952
|
+
for (let B = 0; B < a.value.length; B++) {
|
|
15953
|
+
let R = a.value[B];
|
|
15954
|
+
if (R.isFilter && R.filterList && R.filterList.length > 0 && !R.filterList.some((K) => K == N[R.dataKey]))
|
|
15953
15955
|
return !1;
|
|
15954
15956
|
}
|
|
15955
15957
|
return !0;
|
|
@@ -16231,7 +16233,7 @@ const _hoisted_1$e = { style: { display: "inline-block", width: "100px" } }, _ho
|
|
|
16231
16233
|
}, null, 8, ["modelValue", "data", "title", "columnArray", "printOption"])
|
|
16232
16234
|
]));
|
|
16233
16235
|
}
|
|
16234
|
-
}, DataList = /* @__PURE__ */ _export_sfc(_sfc_main$j, [["__scopeId", "data-v-
|
|
16236
|
+
}, DataList = /* @__PURE__ */ _export_sfc(_sfc_main$j, [["__scopeId", "data-v-576a2b6a"]]), CreateNewPrint = () => {
|
|
16235
16237
|
let config = { Pid: "" }, LODOP = getLodop();
|
|
16236
16238
|
return {
|
|
16237
16239
|
onMessage: (e, r) => {
|
|
@@ -16731,8 +16733,8 @@ const SafeCall$1 = async (e, r) => {
|
|
|
16731
16733
|
if (o.columnArray[S].isSummary) {
|
|
16732
16734
|
let N = !1, B = 0;
|
|
16733
16735
|
for (let R = 0; R < O.length; R++) {
|
|
16734
|
-
let
|
|
16735
|
-
!N && u.test(
|
|
16736
|
+
let K = O[R][o.columnArray[S].dataKey];
|
|
16737
|
+
!N && u.test(K) && (N = !0), B += K * 1;
|
|
16736
16738
|
}
|
|
16737
16739
|
N ? G[o.columnArray[S].dataKey] = B.toFixed(2) : G[o.columnArray[S].dataKey] = B;
|
|
16738
16740
|
} else
|
|
@@ -16900,7 +16902,7 @@ const SafeCall$1 = async (e, r) => {
|
|
|
16900
16902
|
text: L("上个周"),
|
|
16901
16903
|
value: () => {
|
|
16902
16904
|
let c = /* @__PURE__ */ new Date(), p = c.AddDays(-c.getDay() - 6), _ = c.AddDays(-c.getDay());
|
|
16903
|
-
return [p.ToString("yyyy-MM-
|
|
16905
|
+
return [p.ToString("yyyy-MM-dd 00:00:00"), _.ToString("yyyy-MM-dd 23:59:59")];
|
|
16904
16906
|
}
|
|
16905
16907
|
},
|
|
16906
16908
|
{
|
|
@@ -16942,7 +16944,7 @@ const SafeCall$1 = async (e, r) => {
|
|
|
16942
16944
|
"default-time": [/* @__PURE__ */ new Date("2022-1-1 00:00:00"), /* @__PURE__ */ new Date("2022-1-1 23:59:59")]
|
|
16943
16945
|
}, null, 8, ["modelValue", "type", "range-separator", "start-placeholder", "end-placeholder", "default-time"]));
|
|
16944
16946
|
}
|
|
16945
|
-
}, byDatePicker = /* @__PURE__ */ _export_sfc(_sfc_main$g, [["__scopeId", "data-v-
|
|
16947
|
+
}, byDatePicker = /* @__PURE__ */ _export_sfc(_sfc_main$g, [["__scopeId", "data-v-70b5d531"]]), { $: $$1, BtnMenu, DropListMenu, PanelMenu, DropList, Panel, Tooltip } = E;
|
|
16946
16948
|
var id = (/* @__PURE__ */ new Date()).getTime();
|
|
16947
16949
|
class appendix extends BtnMenu {
|
|
16948
16950
|
constructor(r) {
|