@platforma-sdk/model 1.37.2 → 1.37.11
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/components/PlDataTable.d.ts +1 -1
- package/dist/components/PlDataTable.d.ts.map +1 -1
- package/dist/index.js +1 -1
- package/dist/index.js.map +1 -1
- package/dist/index.mjs +114 -110
- package/dist/index.mjs.map +1 -1
- package/dist/version.d.ts +1 -1
- package/dist/version.d.ts.map +1 -1
- package/package.json +1 -1
- package/src/components/PlDataTable.ts +8 -2
package/dist/index.mjs
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
var Ye = Object.defineProperty;
|
|
2
2
|
var Xe = (t, e, n) => e in t ? Ye(t, e, { enumerable: !0, configurable: !0, writable: !0, value: n }) : t[e] = n;
|
|
3
|
-
var
|
|
4
|
-
import { isPColumn as
|
|
3
|
+
var D = (t, e, n) => Xe(t, typeof e != "symbol" ? e + "" : e, n);
|
|
4
|
+
import { isPColumn as De, mapPObjectData as xe, isDataInfoEntries as Oe, isDataInfo as Ce, dataInfoToEntries as Qe, selectorsToPredicate as X, resolveAnchors as Pe, deriveNativeId as Ze, isPColumnSpec as ne, isPartitionedDataInfoEntries as et, getAxisId as O, entriesToDataInfo as tt, canonicalizeAxisId as nt, withEnrichments as Se, AnchoredIdDeriver as _e, isPlRef as rt, mapValueInVOE as it, ensurePColumn as st, extractAllColumns as ot, mapPTableDef as at, mapDataInfo as lt, matchAxisId as V, getColumnIdAndSpec as he, canonicalizeJson as R, parseJson as Ie, isPTableAbsent as ut, uniquePlId as ct, PTableNA as dt } from "@milaboratories/pl-model-common";
|
|
5
5
|
export * from "@milaboratories/pl-model-common";
|
|
6
6
|
import Re from "canonicalize";
|
|
7
7
|
import { z as U } from "zod";
|
|
@@ -201,7 +201,7 @@ function En(t, e) {
|
|
|
201
201
|
patternToSearch: e
|
|
202
202
|
};
|
|
203
203
|
}
|
|
204
|
-
function
|
|
204
|
+
function kn(t) {
|
|
205
205
|
return {
|
|
206
206
|
type: "GetLogHandle",
|
|
207
207
|
source: P(t)
|
|
@@ -238,8 +238,8 @@ function mt(t, e) {
|
|
|
238
238
|
}
|
|
239
239
|
class I {
|
|
240
240
|
constructor(e, n = (r) => r) {
|
|
241
|
-
|
|
242
|
-
|
|
241
|
+
D(this, "isResolved", !1);
|
|
242
|
+
D(this, "resolvedValue");
|
|
243
243
|
this.handle = e, this.postProcess = n, mt(e, (r) => {
|
|
244
244
|
this.resolvedValue = n(r), this.isResolved = !0;
|
|
245
245
|
});
|
|
@@ -363,7 +363,7 @@ class E {
|
|
|
363
363
|
getPColumns(e = !1, n = "") {
|
|
364
364
|
const r = this.parsePObjectCollection(e, n);
|
|
365
365
|
return r === void 0 ? void 0 : Object.entries(r).map(([, s]) => {
|
|
366
|
-
if (!
|
|
366
|
+
if (!De(s)) throw new Error(`not a PColumn (kind = ${s.spec.kind})`);
|
|
367
367
|
return s;
|
|
368
368
|
});
|
|
369
369
|
}
|
|
@@ -502,7 +502,7 @@ function vt(t) {
|
|
|
502
502
|
const e = /* @__PURE__ */ new Set();
|
|
503
503
|
return me(e, /* @__PURE__ */ new Set(), t), e;
|
|
504
504
|
}
|
|
505
|
-
const
|
|
505
|
+
const Dn = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
506
506
|
__proto__: null,
|
|
507
507
|
GlobalCfgRenderCtxFeatureFlags: yt,
|
|
508
508
|
MainAccessorName: je,
|
|
@@ -521,33 +521,33 @@ function $e(t, e, n = {}) {
|
|
|
521
521
|
const m = e(p);
|
|
522
522
|
let f, v, b;
|
|
523
523
|
"spec" in m && typeof m.spec == "object" ? (f = m.spec, v = m.prefixTrace, b = m.suffixTrace) : f = m;
|
|
524
|
-
const
|
|
524
|
+
const h = (S = f.annotations) == null ? void 0 : S[bt], w = (F = f.annotations) == null ? void 0 : F[wt], x = (w ? xt.safeParse(JSON.parse(w)).data : void 0) ?? [], C = [
|
|
525
525
|
...v ?? [],
|
|
526
|
-
...
|
|
526
|
+
...x,
|
|
527
527
|
...b ?? []
|
|
528
528
|
];
|
|
529
|
-
if (
|
|
530
|
-
const
|
|
531
|
-
n.addLabelAsSuffix ? C.push(
|
|
529
|
+
if (h !== void 0) {
|
|
530
|
+
const k = { label: h, type: Pt, importance: -2 };
|
|
531
|
+
n.addLabelAsSuffix ? C.push(k) : C.splice(0, 0, k);
|
|
532
532
|
}
|
|
533
|
-
const
|
|
534
|
-
for (let
|
|
535
|
-
const { type: W } = C[
|
|
533
|
+
const A = [], T = /* @__PURE__ */ new Map();
|
|
534
|
+
for (let k = C.length - 1; k >= 0; --k) {
|
|
535
|
+
const { type: W } = C[k], j = C[k].importance ?? 0, $ = (T.get(W) ?? 0) + 1;
|
|
536
536
|
T.set(W, $);
|
|
537
537
|
const K = `${W}@${$}`;
|
|
538
538
|
s.set(K, (s.get(K) ?? 0) + 1), r.set(
|
|
539
539
|
K,
|
|
540
540
|
Math.max(
|
|
541
541
|
r.get(K) ?? Number.NEGATIVE_INFINITY,
|
|
542
|
-
j - (C.length -
|
|
542
|
+
j - (C.length - k) * Ct
|
|
543
543
|
)
|
|
544
|
-
),
|
|
544
|
+
), A.push({ ...C[k], fullType: K, occurrenceIndex: $ });
|
|
545
545
|
}
|
|
546
|
-
return
|
|
546
|
+
return A.reverse(), {
|
|
547
547
|
value: p,
|
|
548
548
|
spec: f,
|
|
549
|
-
label:
|
|
550
|
-
fullTrace:
|
|
549
|
+
label: h,
|
|
550
|
+
fullTrace: A
|
|
551
551
|
};
|
|
552
552
|
}), a = [], l = [], u = [...r];
|
|
553
553
|
u.sort(([, p], [, m]) => m - p);
|
|
@@ -556,17 +556,17 @@ function $e(t, e, n = {}) {
|
|
|
556
556
|
const c = (p, m = !1) => {
|
|
557
557
|
const f = [];
|
|
558
558
|
for (let v = 0; v < o.length; v++) {
|
|
559
|
-
const b = o[v],
|
|
560
|
-
if (
|
|
559
|
+
const b = o[v], h = b.fullTrace.filter((C) => p.has(C.fullType) || i && i.has(C.type));
|
|
560
|
+
if (h.length === 0)
|
|
561
561
|
if (m)
|
|
562
562
|
f.push({
|
|
563
563
|
label: "Unlabeled",
|
|
564
564
|
value: b.value
|
|
565
565
|
});
|
|
566
566
|
else return;
|
|
567
|
-
const
|
|
567
|
+
const w = h.map((C) => C.label), x = n.separator ?? " / ";
|
|
568
568
|
f.push({
|
|
569
|
-
label:
|
|
569
|
+
label: w.join(x),
|
|
570
570
|
value: b.value
|
|
571
571
|
});
|
|
572
572
|
}
|
|
@@ -576,15 +576,15 @@ function $e(t, e, n = {}) {
|
|
|
576
576
|
if (l.length !== 0) throw new Error("Non-empty secondary types list while main types list is empty.");
|
|
577
577
|
return c(new Set(Te), !0);
|
|
578
578
|
}
|
|
579
|
-
let d = 0,
|
|
579
|
+
let d = 0, g = -1;
|
|
580
580
|
for (; d < a.length; ) {
|
|
581
581
|
const p = /* @__PURE__ */ new Set();
|
|
582
582
|
n.includeNativeLabel && p.add(Te);
|
|
583
583
|
for (let f = 0; f < d; ++f) p.add(a[f]);
|
|
584
|
-
|
|
584
|
+
g >= 0 && p.add(a[g]);
|
|
585
585
|
const m = c(p);
|
|
586
586
|
if (m !== void 0 && new Set(m.map((f) => f.label)).size === t.length) return m;
|
|
587
|
-
|
|
587
|
+
g++, g >= a.length && (d++, g = d);
|
|
588
588
|
}
|
|
589
589
|
return c(/* @__PURE__ */ new Set([...a, ...l]), !0);
|
|
590
590
|
}
|
|
@@ -887,7 +887,7 @@ function Et(t) {
|
|
|
887
887
|
const e = t[0];
|
|
888
888
|
return typeof e == "object" && e !== null && "key" in e && "val" in e;
|
|
889
889
|
}
|
|
890
|
-
class
|
|
890
|
+
class kt {
|
|
891
891
|
constructor(e) {
|
|
892
892
|
this.columns = e;
|
|
893
893
|
}
|
|
@@ -896,7 +896,7 @@ class Dt {
|
|
|
896
896
|
return this.columns.filter((r) => n(r.spec));
|
|
897
897
|
}
|
|
898
898
|
}
|
|
899
|
-
function
|
|
899
|
+
function Dt(t) {
|
|
900
900
|
if (t)
|
|
901
901
|
return t.map((e) => ({
|
|
902
902
|
type: `split:${nt(e.axisId)}`,
|
|
@@ -929,9 +929,9 @@ function Ft(t) {
|
|
|
929
929
|
}
|
|
930
930
|
class le {
|
|
931
931
|
constructor() {
|
|
932
|
-
|
|
933
|
-
|
|
934
|
-
|
|
932
|
+
D(this, "defaultProviderStore", []);
|
|
933
|
+
D(this, "providers", [new kt(this.defaultProviderStore)]);
|
|
934
|
+
D(this, "axisLabelProviders", []);
|
|
935
935
|
}
|
|
936
936
|
addColumnProvider(e) {
|
|
937
937
|
return this.providers.push(e), this;
|
|
@@ -969,7 +969,7 @@ class le {
|
|
|
969
969
|
});
|
|
970
970
|
u = (v) => f.some((b) => b(v));
|
|
971
971
|
}
|
|
972
|
-
const c = typeof e == "function" ? [e] : Array.isArray(e) ? e : [e], d = [],
|
|
972
|
+
const c = typeof e == "function" ? [e] : Array.isArray(e) ? e : [e], d = [], g = /* @__PURE__ */ new Set();
|
|
973
973
|
for (const f of c) {
|
|
974
974
|
const v = Le(f);
|
|
975
975
|
let b;
|
|
@@ -979,44 +979,44 @@ class le {
|
|
|
979
979
|
b = Pe(r.anchors, f, n);
|
|
980
980
|
} else
|
|
981
981
|
b = f;
|
|
982
|
-
const
|
|
983
|
-
for (const
|
|
984
|
-
const T =
|
|
982
|
+
const h = /* @__PURE__ */ new Set(), w = [];
|
|
983
|
+
for (const A of this.providers) {
|
|
984
|
+
const T = A.selectColumns(b);
|
|
985
985
|
for (const S of T) {
|
|
986
986
|
if (u(S.spec)) continue;
|
|
987
|
-
if (
|
|
988
|
-
throw new Error(`Duplicate column id ${S.id} in provider ${
|
|
987
|
+
if (h.has(S.id))
|
|
988
|
+
throw new Error(`Duplicate column id ${S.id} in provider ${A.constructor.name}`);
|
|
989
989
|
const F = Ze(S.spec);
|
|
990
|
-
|
|
990
|
+
g.has(F) || (h.add(S.id), g.add(F), w.push(S));
|
|
991
991
|
}
|
|
992
992
|
}
|
|
993
|
-
if (
|
|
994
|
-
const
|
|
995
|
-
for (const
|
|
996
|
-
if (!ne(
|
|
997
|
-
const T =
|
|
993
|
+
if (w.length === 0) continue;
|
|
994
|
+
const x = Ft(f), C = x.length > 0;
|
|
995
|
+
for (const A of w) {
|
|
996
|
+
if (!ne(A.spec)) continue;
|
|
997
|
+
const T = A.spec;
|
|
998
998
|
if (C) {
|
|
999
|
-
if (Et(
|
|
1000
|
-
throw new Error(`Splitting is not supported for PColumns with PColumnValues data format. Column id: ${
|
|
1001
|
-
const S = Tt(
|
|
999
|
+
if (Et(A.data))
|
|
1000
|
+
throw new Error(`Splitting is not supported for PColumns with PColumnValues data format. Column id: ${A.id}`);
|
|
1001
|
+
const S = Tt(A.data);
|
|
1002
1002
|
if (!S) {
|
|
1003
1003
|
if (s) continue;
|
|
1004
1004
|
return;
|
|
1005
1005
|
}
|
|
1006
1006
|
if (!et(S))
|
|
1007
|
-
throw new Error(`Splitting requires Partitioned DataInfoEntries, but parsing resulted in ${S.type} for column ${
|
|
1008
|
-
const F = It(S),
|
|
1009
|
-
if (
|
|
1010
|
-
throw new Error(`Not enough partition keys (${S.partitionKeyLength}) for requested split axes (max index ${
|
|
1011
|
-
const W =
|
|
1012
|
-
if (G >=
|
|
1007
|
+
throw new Error(`Splitting requires Partitioned DataInfoEntries, but parsing resulted in ${S.type} for column ${A.id}`);
|
|
1008
|
+
const F = It(S), k = x[x.length - 1];
|
|
1009
|
+
if (k >= S.partitionKeyLength)
|
|
1010
|
+
throw new Error(`Not enough partition keys (${S.partitionKeyLength}) for requested split axes (max index ${k}) in column ${T.name}`);
|
|
1011
|
+
const W = x.map((_) => this.findLabels(O(T.axesSpec[_]))), j = [], $ = (_, G) => {
|
|
1012
|
+
if (G >= x.length) {
|
|
1013
1013
|
if (j.push([..._]), j.length > 1e4)
|
|
1014
1014
|
throw new Error("Too many key combinations, aborting.");
|
|
1015
1015
|
return;
|
|
1016
1016
|
}
|
|
1017
|
-
const N =
|
|
1017
|
+
const N = x[G];
|
|
1018
1018
|
if (N >= F.length)
|
|
1019
|
-
throw new Error(`Axis index ${N} out of bounds for unique keys array (length ${F.length}) during split key generation for column ${
|
|
1019
|
+
throw new Error(`Axis index ${N} out of bounds for unique keys array (length ${F.length}) during split key generation for column ${A.id}`);
|
|
1020
1020
|
const J = F[N];
|
|
1021
1021
|
if (!J || J.length === 0) {
|
|
1022
1022
|
j.length = 0;
|
|
@@ -1027,9 +1027,9 @@ class le {
|
|
|
1027
1027
|
};
|
|
1028
1028
|
if ($([], 0), j.length === 0)
|
|
1029
1029
|
continue;
|
|
1030
|
-
const K = [...T.axesSpec], Ge =
|
|
1031
|
-
for (let _ =
|
|
1032
|
-
K.splice(
|
|
1030
|
+
const K = [...T.axesSpec], Ge = x.map((_) => _);
|
|
1031
|
+
for (let _ = x.length - 1; _ >= 0; _--)
|
|
1032
|
+
K.splice(x[_], 1);
|
|
1033
1033
|
const He = { ...T, axesSpec: K };
|
|
1034
1034
|
for (const _ of j) {
|
|
1035
1035
|
const G = _.map((N, J) => {
|
|
@@ -1038,7 +1038,7 @@ class le {
|
|
|
1038
1038
|
});
|
|
1039
1039
|
d.push({
|
|
1040
1040
|
type: "split",
|
|
1041
|
-
originalColumn:
|
|
1041
|
+
originalColumn: A,
|
|
1042
1042
|
spec: T,
|
|
1043
1043
|
adjustedSpec: He,
|
|
1044
1044
|
dataEntries: S,
|
|
@@ -1048,7 +1048,7 @@ class le {
|
|
|
1048
1048
|
} else
|
|
1049
1049
|
d.push({
|
|
1050
1050
|
type: "direct",
|
|
1051
|
-
originalColumn:
|
|
1051
|
+
originalColumn: A,
|
|
1052
1052
|
spec: T,
|
|
1053
1053
|
adjustedSpec: T
|
|
1054
1054
|
});
|
|
@@ -1059,25 +1059,25 @@ class le {
|
|
|
1059
1059
|
d,
|
|
1060
1060
|
(f) => ({
|
|
1061
1061
|
spec: f.spec,
|
|
1062
|
-
suffixTrace: f.type === "split" ?
|
|
1062
|
+
suffixTrace: f.type === "split" ? Dt(f.axisFilters) : void 0
|
|
1063
1063
|
}),
|
|
1064
1064
|
l
|
|
1065
1065
|
), m = [];
|
|
1066
1066
|
for (const { value: f, label: v } of p) {
|
|
1067
|
-
const { originalColumn: b, spec:
|
|
1067
|
+
const { originalColumn: b, spec: h } = f, w = f.type === "split" ? f.axisFilters : void 0, x = Ot(w);
|
|
1068
1068
|
let C;
|
|
1069
|
-
r ? C = r.deriveS(
|
|
1070
|
-
let
|
|
1071
|
-
o && (
|
|
1072
|
-
...
|
|
1069
|
+
r ? C = r.deriveS(h, x) : C = Rt(b.id, x);
|
|
1070
|
+
let A = { ...f.adjustedSpec };
|
|
1071
|
+
o && (A = {
|
|
1072
|
+
...A,
|
|
1073
1073
|
annotations: {
|
|
1074
|
-
...
|
|
1074
|
+
...A.annotations ?? {},
|
|
1075
1075
|
"pl7.app/label": v
|
|
1076
1076
|
}
|
|
1077
1077
|
}), m.push({
|
|
1078
1078
|
id: C,
|
|
1079
|
-
spec:
|
|
1080
|
-
data: () => f.type === "split" ? tt(Lt(f.dataEntries,
|
|
1079
|
+
spec: A,
|
|
1080
|
+
data: () => f.type === "split" ? tt(Lt(f.dataEntries, x)) : f.originalColumn.data,
|
|
1081
1081
|
label: v
|
|
1082
1082
|
});
|
|
1083
1083
|
}
|
|
@@ -1118,7 +1118,7 @@ function Ee(t) {
|
|
|
1118
1118
|
}
|
|
1119
1119
|
class Kt {
|
|
1120
1120
|
constructor() {
|
|
1121
|
-
|
|
1121
|
+
D(this, "ctx", y());
|
|
1122
1122
|
}
|
|
1123
1123
|
/**
|
|
1124
1124
|
* @deprecated use getOptions()
|
|
@@ -1333,7 +1333,7 @@ class Kt {
|
|
|
1333
1333
|
findLabels(e) {
|
|
1334
1334
|
const n = this.getData();
|
|
1335
1335
|
for (const r of n.entries) {
|
|
1336
|
-
if (!
|
|
1336
|
+
if (!De(r.obj)) continue;
|
|
1337
1337
|
const i = r.obj.spec;
|
|
1338
1338
|
if (i.name === "pl7.app/label" && i.axesSpec.length === 1 && i.axesSpec[0].name === e.name && i.axesSpec[0].type === e.type && pe(e.domain, i.axesSpec[0].domain)) {
|
|
1339
1339
|
if (r.obj.data.resourceType.name !== "PColumnData/Json")
|
|
@@ -1387,12 +1387,12 @@ class Kt {
|
|
|
1387
1387
|
}
|
|
1388
1388
|
class te {
|
|
1389
1389
|
constructor() {
|
|
1390
|
-
|
|
1391
|
-
|
|
1392
|
-
|
|
1390
|
+
D(this, "ctx");
|
|
1391
|
+
D(this, "args");
|
|
1392
|
+
D(this, "uiState");
|
|
1393
1393
|
// lazy rendering because this feature is rarely used
|
|
1394
|
-
|
|
1395
|
-
|
|
1394
|
+
D(this, "_activeArgsCache");
|
|
1395
|
+
D(this, "resultPool", new Kt());
|
|
1396
1396
|
this.ctx = y(), this.args = JSON.parse(this.ctx.args), this.uiState = this.ctx.uiState !== void 0 ? JSON.parse(this.ctx.uiState) : {};
|
|
1397
1397
|
}
|
|
1398
1398
|
/**
|
|
@@ -1469,7 +1469,7 @@ class te {
|
|
|
1469
1469
|
this.ctx.logError(e);
|
|
1470
1470
|
}
|
|
1471
1471
|
}
|
|
1472
|
-
const Y = "1.37.
|
|
1472
|
+
const Y = "1.37.11";
|
|
1473
1473
|
function Vt(t) {
|
|
1474
1474
|
return t.__renderLambda === !0;
|
|
1475
1475
|
}
|
|
@@ -1798,8 +1798,8 @@ function we(t, e) {
|
|
|
1798
1798
|
for (const a of e) {
|
|
1799
1799
|
const l = a.spec.axesSpec[0], u = O(l), c = i.findIndex((d) => V(d, u));
|
|
1800
1800
|
if (c !== -1) {
|
|
1801
|
-
const d = i[c],
|
|
1802
|
-
|
|
1801
|
+
const d = i[c], g = Object.keys(d.domain ?? {}).length, p = Object.keys(l.domain ?? {}).length;
|
|
1802
|
+
g > p ? o.push({
|
|
1803
1803
|
id: s(a.id, d.domain),
|
|
1804
1804
|
spec: {
|
|
1805
1805
|
...a.spec,
|
|
@@ -1881,28 +1881,32 @@ function ue(t, e) {
|
|
|
1881
1881
|
return [...new Map(t.map((n) => [e(n), n])).values()];
|
|
1882
1882
|
}
|
|
1883
1883
|
function Kn(t, e, n, r) {
|
|
1884
|
+
if (e.length === 0) return;
|
|
1884
1885
|
const i = jt(n ?? Ue()), s = (r == null ? void 0 : r.coreJoinType) ?? "full", o = ue(
|
|
1885
1886
|
[...(r == null ? void 0 : r.filters) ?? [], ...i.pTableParams.filters],
|
|
1886
|
-
(
|
|
1887
|
+
(h) => R(h.column)
|
|
1887
1888
|
), a = ue(
|
|
1888
1889
|
[...(r == null ? void 0 : r.sorting) ?? [], ...i.pTableParams.sorting],
|
|
1889
|
-
(
|
|
1890
|
-
), l = e.filter((
|
|
1890
|
+
(h) => R(h.column)
|
|
1891
|
+
), l = e.filter((h) => !Nt(h.spec)), u = Be(t.resultPool);
|
|
1891
1892
|
if (!u) return;
|
|
1892
|
-
const c = we(l.map(he), u), d = Ae(l, c, s, o, a, r == null ? void 0 : r.coreColumnPredicate),
|
|
1893
|
+
const c = we(l.map(he), u), d = Ae(l, c, s, o, a, r == null ? void 0 : r.coreColumnPredicate), g = t.createPTable(d), p = new Set((() => {
|
|
1893
1894
|
if (s === "inner") return [];
|
|
1894
|
-
const
|
|
1895
|
-
return
|
|
1895
|
+
const h = i.pTableParams.hiddenColIds;
|
|
1896
|
+
return h || l.filter((w) => $t(w.spec)).map((w) => w.id);
|
|
1896
1897
|
})());
|
|
1897
|
-
|
|
1898
|
-
var
|
|
1899
|
-
return (
|
|
1900
|
-
}).forEach((
|
|
1901
|
-
|
|
1898
|
+
l.filter((h) => {
|
|
1899
|
+
var w;
|
|
1900
|
+
return ((w = h.spec.annotations) == null ? void 0 : w["pl7.app/isLinkerColumn"]) === "true";
|
|
1901
|
+
}).forEach((h) => p.delete(h.id)), r != null && r.coreColumnPredicate && l.flatMap((w) => {
|
|
1902
|
+
var x;
|
|
1903
|
+
return (x = r == null ? void 0 : r.coreColumnPredicate) != null && x.call(r, w.spec) ? [w.id] : [];
|
|
1904
|
+
}).forEach((w) => p.delete(w)), [...o.map((h) => h.column), ...a.map((h) => h.column)].filter((h) => h.type === "column").forEach((h) => p.delete(h.id));
|
|
1905
|
+
const m = l.filter((h) => !p.has(h.id)), f = we(m.map(he), u);
|
|
1902
1906
|
if (!We([...m, ...f])) return;
|
|
1903
1907
|
const v = Ae(m, f, s, o, a, r == null ? void 0 : r.coreColumnPredicate), b = t.createPTable(v);
|
|
1904
1908
|
return {
|
|
1905
|
-
fullTableHandle:
|
|
1909
|
+
fullTableHandle: g,
|
|
1906
1910
|
visibleTableHandle: b
|
|
1907
1911
|
};
|
|
1908
1912
|
}
|
|
@@ -1940,7 +1944,7 @@ function Ut(t) {
|
|
|
1940
1944
|
var e;
|
|
1941
1945
|
return t.axesSpec.length === 2 && ((e = t.annotations) == null ? void 0 : e[Wt]) === "true";
|
|
1942
1946
|
}
|
|
1943
|
-
const Bt = "pl7.app/graph/isVirtual",
|
|
1947
|
+
const Bt = "pl7.app/graph/isVirtual", ke = "pl7.app/label", Wt = "pl7.app/isLinkerColumn";
|
|
1944
1948
|
function Gt(t) {
|
|
1945
1949
|
var n, r;
|
|
1946
1950
|
const e = /* @__PURE__ */ new Map();
|
|
@@ -1986,13 +1990,13 @@ function zt(t, e) {
|
|
|
1986
1990
|
return [e];
|
|
1987
1991
|
const r = n.map((u) => {
|
|
1988
1992
|
const c = [];
|
|
1989
|
-
for (const [d,
|
|
1990
|
-
V(
|
|
1993
|
+
for (const [d, g] of t)
|
|
1994
|
+
V(g, u) && !V(u, g) && c.push(g);
|
|
1991
1995
|
return c;
|
|
1992
1996
|
}), i = Mt(r), s = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set(), a = i.map((u) => {
|
|
1993
1997
|
const c = /* @__PURE__ */ new Set();
|
|
1994
|
-
return u.map((d,
|
|
1995
|
-
const p = e.spec.axesSpec[
|
|
1998
|
+
return u.map((d, g) => {
|
|
1999
|
+
const p = e.spec.axesSpec[g].domain, m = d.domain;
|
|
1996
2000
|
return Object.entries(m ?? {}).forEach(([f, v]) => {
|
|
1997
2001
|
if ((p == null ? void 0 : p[f]) === void 0) {
|
|
1998
2002
|
const b = JSON.stringify([f, v]);
|
|
@@ -2000,7 +2004,7 @@ function zt(t, e) {
|
|
|
2000
2004
|
}
|
|
2001
2005
|
}), {
|
|
2002
2006
|
...d,
|
|
2003
|
-
annotations: e.spec.axesSpec[
|
|
2007
|
+
annotations: e.spec.axesSpec[g].annotations
|
|
2004
2008
|
};
|
|
2005
2009
|
}), c;
|
|
2006
2010
|
});
|
|
@@ -2009,14 +2013,14 @@ function zt(t, e) {
|
|
|
2009
2013
|
});
|
|
2010
2014
|
const l = i.map((u, c) => {
|
|
2011
2015
|
var f;
|
|
2012
|
-
const d = Jt(e.id, u.map((v) => v.domain)),
|
|
2016
|
+
const d = Jt(e.id, u.map((v) => v.domain)), g = ((f = e.spec.annotations) == null ? void 0 : f[ke]) ?? "", p = [...a[c]].filter((v) => o.has(v)).sort().map((v) => {
|
|
2013
2017
|
var b;
|
|
2014
2018
|
return (b = JSON.parse(v)) == null ? void 0 : b[1];
|
|
2015
2019
|
}).join(" / "), m = {
|
|
2016
2020
|
...e.spec.annotations,
|
|
2017
2021
|
[Bt]: "true"
|
|
2018
2022
|
};
|
|
2019
|
-
return (
|
|
2023
|
+
return (g || p) && (m[ke] = g && p ? g + " / " + p : g + p), {
|
|
2020
2024
|
id: d,
|
|
2021
2025
|
spec: {
|
|
2022
2026
|
...e.spec,
|
|
@@ -2037,27 +2041,27 @@ function jn(t, e) {
|
|
|
2037
2041
|
n.addColumnProvider(t.resultPool), n.addColumns(e);
|
|
2038
2042
|
const r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
|
|
2039
2043
|
for (const d of e)
|
|
2040
|
-
for (const
|
|
2041
|
-
const p = O(
|
|
2044
|
+
for (const g of d.spec.axesSpec) {
|
|
2045
|
+
const p = O(g);
|
|
2042
2046
|
r.set(R(p), p), i.set(R(p), p);
|
|
2043
2047
|
}
|
|
2044
2048
|
const s = n.getColumns((d) => Ut(d)) ?? [], o = Ht(s, r);
|
|
2045
2049
|
for (const d of o)
|
|
2046
2050
|
r.set(...d), i.set(...d);
|
|
2047
|
-
const a = (n.getColumns((d) => d.axesSpec.some((
|
|
2048
|
-
const p = O(
|
|
2051
|
+
const a = (n.getColumns((d) => d.axesSpec.some((g) => {
|
|
2052
|
+
const p = O(g);
|
|
2049
2053
|
for (const m of r.values())
|
|
2050
2054
|
if (V(m, p))
|
|
2051
2055
|
return !0;
|
|
2052
2056
|
return !1;
|
|
2053
2057
|
}), { dontWaitAllData: !0, overrideLabelAnnotation: !1 }) ?? []).filter((d) => !be(d.spec));
|
|
2054
2058
|
for (const d of a)
|
|
2055
|
-
for (const
|
|
2056
|
-
const p = O(
|
|
2059
|
+
for (const g of d.spec.axesSpec) {
|
|
2060
|
+
const p = O(g);
|
|
2057
2061
|
i.set(R(p), p);
|
|
2058
2062
|
}
|
|
2059
|
-
const l = (n.getColumns((d) => d.axesSpec.some((
|
|
2060
|
-
const p = O(
|
|
2063
|
+
const l = (n.getColumns((d) => d.axesSpec.some((g) => {
|
|
2064
|
+
const p = O(g);
|
|
2061
2065
|
for (const m of i.values())
|
|
2062
2066
|
if (V(m, p))
|
|
2063
2067
|
return !0;
|
|
@@ -2154,8 +2158,8 @@ export {
|
|
|
2154
2158
|
I as FutureRef,
|
|
2155
2159
|
Bt as IS_VIRTUAL_COLUMN,
|
|
2156
2160
|
on as It,
|
|
2157
|
-
|
|
2158
|
-
|
|
2161
|
+
Dn as JsRenderInternal,
|
|
2162
|
+
ke as LABEL_ANNOTATION,
|
|
2159
2163
|
Wt as LINKER_COLUMN_ANNOTATION,
|
|
2160
2164
|
an as MainOutputs,
|
|
2161
2165
|
pt as OutputError,
|
|
@@ -2207,7 +2211,7 @@ export {
|
|
|
2207
2211
|
ie as getJsonField,
|
|
2208
2212
|
Tn as getLastLogs,
|
|
2209
2213
|
Gt as getLinkerColumnsMap,
|
|
2210
|
-
|
|
2214
|
+
kn as getLogHandle,
|
|
2211
2215
|
we as getMatchingLabelColumns,
|
|
2212
2216
|
Sn as getOnDemandBlobContent,
|
|
2213
2217
|
St as getPartitionKeysList,
|