@milaboratories/milaboratories.ui-examples.model 1.2.24 → 1.2.25

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.
@@ -1,6 +1,6 @@
1
1
   WARN  Issue while reading "/home/runner/_work/platforma/platforma/.npmrc". Failed to replace env in config: ${NPMJS_TOKEN}
2
2
 
3
- > @milaboratories/milaboratories.ui-examples.model@1.2.24 build /home/runner/_work/platforma/platforma/etc/blocks/ui-examples/model
3
+ > @milaboratories/milaboratories.ui-examples.model@1.2.25 build /home/runner/_work/platforma/platforma/etc/blocks/ui-examples/model
4
4
  > tsup && vite build && block-tools build-model
5
5
 
6
6
  CLI Building entry: src/index.ts
@@ -11,21 +11,21 @@
11
11
  CLI Cleaning output folder
12
12
  CJS Build start
13
13
  ESM Build start
14
- CJS dist/index.cjs 9.21 KB
15
- CJS dist/index.cjs.map 20.74 KB
16
- CJS ⚡️ Build success in 393ms
17
- ESM dist/index.js 8.87 KB
18
- ESM dist/index.js.map 20.53 KB
19
- ESM ⚡️ Build success in 393ms
14
+ ESM dist/index.js 8.93 KB
15
+ ESM dist/index.js.map 20.66 KB
16
+ ESM ⚡️ Build success in 147ms
17
+ CJS dist/index.cjs 9.27 KB
18
+ CJS dist/index.cjs.map 20.87 KB
19
+ CJS ⚡️ Build success in 147ms
20
20
  DTS Build start
21
- DTS ⚡️ Build success in 4721ms
22
- DTS dist/index.d.cts 2.97 KB
23
- DTS dist/index.d.ts 2.97 KB
21
+ DTS ⚡️ Build success in 1162ms
22
+ DTS dist/index.d.cts 2.98 KB
23
+ DTS dist/index.d.ts 2.98 KB
24
24
  vite v6.3.5 building for production...
25
25
  transforming...
26
26
  ✓ 11 modules transformed.
27
27
  rendering chunks...
28
28
  computing gzip size...
29
- dist/bundle.js 199.64 kB │ gzip: 38.89 kB │ map: 452.91 kB
30
- dist/bundle.js 213.48 kB │ gzip: 39.59 kB │ map: 454.61 kB
31
- ✓ built in 2.53s
29
+ dist/bundle.js 199.70 kB │ gzip: 38.91 kB │ map: 453.13 kB
30
+ dist/bundle.js 213.55 kB │ gzip: 39.60 kB │ map: 454.83 kB
31
+ ✓ built in 662ms
package/CHANGELOG.md CHANGED
@@ -1,5 +1,11 @@
1
1
  # @milaboratories/milaboratories.ui-examples.model
2
2
 
3
+ ## 1.2.25
4
+
5
+ ### Patch Changes
6
+
7
+ - 604827a: [desktop] add button to save block error log to file
8
+
3
9
  ## 1.2.24
4
10
 
5
11
  ### Patch Changes
package/dist/bundle.js CHANGED
@@ -53,7 +53,7 @@
53
53
  return array.map((val) => typeof val === "string" ? `'${val}'` : val).join(separator);
54
54
  }
55
55
  util2.joinValues = joinValues;
56
- util2.jsonStringifyReplacer = (_2, value) => {
56
+ util2.jsonStringifyReplacer = (_, value) => {
57
57
  if (typeof value === "bigint") {
58
58
  return value.toString();
59
59
  }
@@ -3965,7 +3965,7 @@
3965
3965
  /** Excluded right border. */
3966
3966
  to: z$2.number()
3967
3967
  });
3968
- function k$1(e) {
3968
+ function S(e) {
3969
3969
  throw new Error("Unexpected object: " + e);
3970
3970
  }
3971
3971
  function Qe$1(e) {
@@ -4077,7 +4077,7 @@
4077
4077
  parts: Object.entries(e.parts).map(([n2, t]) => ({ key: JSON.parse(n2), value: t }))
4078
4078
  };
4079
4079
  default:
4080
- k$1(e);
4080
+ S(e);
4081
4081
  }
4082
4082
  }
4083
4083
  function nn$1(e) {
@@ -4115,7 +4115,7 @@
4115
4115
  )
4116
4116
  };
4117
4117
  default:
4118
- k$1(e);
4118
+ S(e);
4119
4119
  }
4120
4120
  }
4121
4121
  function de(e) {
@@ -4157,11 +4157,11 @@
4157
4157
  if (o === void 0) return;
4158
4158
  const i = n2[t];
4159
4159
  try {
4160
- const a = JSON.parse(o);
4161
- return i.parse(a);
4162
- } catch (a) {
4160
+ const s2 = JSON.parse(o);
4161
+ return i.parse(s2);
4162
+ } catch (s2) {
4163
4163
  throw new Error(
4164
- `${r} failed, key: ${String(t)}, value: ${o}, error: ${C(a)}`
4164
+ `${r} failed, key: ${String(t)}, value: ${o}, error: ${C(s2)}`
4165
4165
  );
4166
4166
  }
4167
4167
  }
@@ -4213,7 +4213,7 @@
4213
4213
  [y.Table.OrderPriority]: z$2.number(),
4214
4214
  [y.Trace]: z$2.record(z$2.string(), z$2.unknown())
4215
4215
  };
4216
- function wn(e, n2) {
4216
+ function An(e, n2) {
4217
4217
  return I(e == null ? void 0 : e.annotations, n2);
4218
4218
  }
4219
4219
  function z$1(e, n2) {
@@ -4232,21 +4232,21 @@
4232
4232
  const { type: n2, name: t, domain: r } = e, o = { type: n2, name: t };
4233
4233
  return r && Object.entries(r).length > 0 && Object.assign(o, { domain: r }), o;
4234
4234
  }
4235
- function _(e) {
4235
+ function G$1(e) {
4236
4236
  return e.map(p$1);
4237
4237
  }
4238
4238
  function On(e) {
4239
4239
  return m$1(p$1(e));
4240
4240
  }
4241
- function Ae$1(e, n2) {
4241
+ function we$1(e, n2) {
4242
4242
  if (e === void 0) return n2 === void 0;
4243
4243
  if (n2 === void 0) return true;
4244
4244
  for (const t in n2)
4245
4245
  if (e[t] !== n2[t]) return false;
4246
4246
  return true;
4247
4247
  }
4248
- function we$1(e, n2) {
4249
- return e.name === n2.name && Ae$1(e.domain, n2.domain);
4248
+ function Ae$1(e, n2) {
4249
+ return e.name === n2.name && we$1(e.domain, n2.domain);
4250
4250
  }
4251
4251
  function In(e, n2) {
4252
4252
  return { ...e, src: E(e.src, n2) };
@@ -4280,7 +4280,7 @@
4280
4280
  secondary: e.secondary.map((t) => E(t, n2))
4281
4281
  };
4282
4282
  default:
4283
- k$1(e);
4283
+ S(e);
4284
4284
  }
4285
4285
  }
4286
4286
  function Se$1(e) {
@@ -4307,14 +4307,14 @@
4307
4307
  t.sort((r, o) => r[0].localeCompare(o[0]));
4308
4308
  for (const [r, o] of t) {
4309
4309
  for (let i = 0; i < o.axesSpec.length; i++) {
4310
- const a = o.axesSpec[i], s2 = N(a);
4311
- this.axes.set(s2, { anchor: r, idx: i });
4310
+ const s2 = o.axesSpec[i], a = N(s2);
4311
+ this.axes.set(a, { anchor: r, idx: i });
4312
4312
  }
4313
4313
  if (o.domain !== void 0) {
4314
4314
  const i = Object.entries(o.domain);
4315
- i.sort((a, s2) => a[0].localeCompare(s2[0])), this.domainPackToAnchor.set(JSON.stringify(i), r), this.domainPacks.push(i.map(([a]) => a));
4316
- for (const [a, s2] of i) {
4317
- const u2 = R(a, s2);
4315
+ i.sort((s2, a) => s2[0].localeCompare(a[0])), this.domainPackToAnchor.set(JSON.stringify(i), r), this.domainPacks.push(i.map(([s2]) => s2));
4316
+ for (const [s2, a] of i) {
4317
+ const u2 = R(s2, a);
4318
4318
  this.domains.set(u2, r);
4319
4319
  }
4320
4320
  }
@@ -4331,47 +4331,47 @@
4331
4331
  let o;
4332
4332
  if (n2.domain !== void 0)
4333
4333
  e:
4334
- for (const a of this.domainPacks) {
4335
- const s2 = [];
4336
- for (const c2 of a) {
4334
+ for (const s2 of this.domainPacks) {
4335
+ const a = [];
4336
+ for (const c2 of s2) {
4337
4337
  const d = n2.domain[c2];
4338
4338
  if (d !== void 0)
4339
- s2.push([c2, d]);
4339
+ a.push([c2, d]);
4340
4340
  else
4341
4341
  break e;
4342
4342
  }
4343
- const u2 = this.domainPackToAnchor.get(JSON.stringify(s2));
4343
+ const u2 = this.domainPackToAnchor.get(JSON.stringify(a));
4344
4344
  if (u2 !== void 0) {
4345
- r.domainAnchor = u2, o = new Set(a);
4345
+ r.domainAnchor = u2, o = new Set(s2);
4346
4346
  break;
4347
4347
  }
4348
4348
  }
4349
- for (const [a, s2] of Object.entries(n2.domain ?? {})) {
4350
- if (o !== void 0 && o.has(a))
4349
+ for (const [s2, a] of Object.entries(n2.domain ?? {})) {
4350
+ if (o !== void 0 && o.has(s2))
4351
4351
  continue;
4352
- const u2 = R(a, s2), c2 = this.domains.get(u2);
4353
- r.domain ?? (r.domain = {}), r.domain[a] = c2 ? { anchor: c2 } : s2;
4352
+ const u2 = R(s2, a), c2 = this.domains.get(u2);
4353
+ r.domain ?? (r.domain = {}), r.domain[s2] = c2 ? { anchor: c2 } : a;
4354
4354
  }
4355
- if (r.axes = n2.axesSpec.map((a) => {
4356
- const s2 = N(a), u2 = this.axes.get(s2);
4357
- return u2 === void 0 ? p$1(a) : u2;
4355
+ if (r.axes = n2.axesSpec.map((s2) => {
4356
+ const a = N(s2), u2 = this.axes.get(a);
4357
+ return u2 === void 0 ? p$1(s2) : u2;
4358
4358
  }), !t || t.length === 0)
4359
4359
  return r;
4360
4360
  const i = [];
4361
- for (const a of t) {
4362
- const [s2, u2] = a;
4363
- if (typeof s2 == "number") {
4364
- if (s2 < 0 || s2 >= n2.axesSpec.length)
4365
- throw new Error(`Axis index ${s2} is out of bounds (0-${n2.axesSpec.length - 1})`);
4366
- i.push([s2, u2]);
4361
+ for (const s2 of t) {
4362
+ const [a, u2] = s2;
4363
+ if (typeof a == "number") {
4364
+ if (a < 0 || a >= n2.axesSpec.length)
4365
+ throw new Error(`Axis index ${a} is out of bounds (0-${n2.axesSpec.length - 1})`);
4366
+ i.push([a, u2]);
4367
4367
  } else {
4368
- const c2 = n2.axesSpec.findIndex((d) => d.name === s2);
4368
+ const c2 = n2.axesSpec.findIndex((d) => d.name === a);
4369
4369
  if (c2 === -1)
4370
- throw new Error(`Axis with name "${s2}" not found in the column specification`);
4370
+ throw new Error(`Axis with name "${a}" not found in the column specification`);
4371
4371
  i.push([c2, u2]);
4372
4372
  }
4373
4373
  }
4374
- return i.sort((a, s2) => a[0] - s2[0]), {
4374
+ return i.sort((s2, a) => s2[0] - a[0]), {
4375
4375
  source: r,
4376
4376
  axisFilters: i
4377
4377
  };
@@ -4392,24 +4392,24 @@
4392
4392
  const i = e[r.domainAnchor];
4393
4393
  if (!i)
4394
4394
  throw new Error(`Anchor "${r.domainAnchor}" not found`);
4395
- const a = i.domain || {};
4396
- r.domain = { ...a, ...r.domain }, delete r.domainAnchor;
4395
+ const s2 = i.domain || {};
4396
+ r.domain = { ...s2, ...r.domain }, delete r.domainAnchor;
4397
4397
  }
4398
4398
  if (r.domain) {
4399
4399
  const i = {};
4400
- for (const [a, s2] of Object.entries(r.domain))
4401
- if (typeof s2 == "string")
4402
- i[a] = s2;
4400
+ for (const [s2, a] of Object.entries(r.domain))
4401
+ if (typeof a == "string")
4402
+ i[s2] = a;
4403
4403
  else {
4404
- const u2 = e[s2.anchor];
4404
+ const u2 = e[a.anchor];
4405
4405
  if (!u2)
4406
- throw new Error(`Anchor "${s2.anchor}" not found for domain key "${a}"`);
4407
- if (!u2.domain || u2.domain[a] === void 0) {
4406
+ throw new Error(`Anchor "${a.anchor}" not found for domain key "${s2}"`);
4407
+ if (!u2.domain || u2.domain[s2] === void 0) {
4408
4408
  if (!o)
4409
- throw new Error(`Domain key "${a}" not found in anchor "${s2.anchor}"`);
4409
+ throw new Error(`Domain key "${s2}" not found in anchor "${a.anchor}"`);
4410
4410
  continue;
4411
4411
  }
4412
- i[a] = u2.domain[a];
4412
+ i[s2] = u2.domain[s2];
4413
4413
  }
4414
4414
  r.domain = i;
4415
4415
  }
@@ -4433,7 +4433,7 @@
4433
4433
  throw new Error(`Axis with name "${n2.name}" not found in anchor "${t}"`);
4434
4434
  return o[0];
4435
4435
  } else if ("id" in n2) {
4436
- const o = r.axesSpec.filter((i) => we$1(n2.id, p$1(i)));
4436
+ const o = r.axesSpec.filter((i) => Ae$1(n2.id, p$1(i)));
4437
4437
  if (o.length > 1)
4438
4438
  throw new Error(`Multiple matching axes found for matcher in anchor "${t}"`);
4439
4439
  if (o.length === 0)
@@ -4455,13 +4455,13 @@
4455
4455
  if (!Fe$1(e)) throw new Error(`not a PColumn (kind = ${e.spec.kind})`);
4456
4456
  return e;
4457
4457
  }
4458
- function Bn(e, n2) {
4458
+ function Mn(e, n2) {
4459
4459
  return e === void 0 ? void 0 : {
4460
4460
  ...e,
4461
4461
  data: n2(e.data)
4462
4462
  };
4463
4463
  }
4464
- function Mn(e) {
4464
+ function Bn(e) {
4465
4465
  const n2 = /* @__PURE__ */ new Map(), t = (r) => {
4466
4466
  switch (r.type) {
4467
4467
  case "column":
@@ -4481,7 +4481,7 @@
4481
4481
  for (const o of r.secondary) t(o);
4482
4482
  return;
4483
4483
  default:
4484
- k$1(r);
4484
+ S(r);
4485
4485
  }
4486
4486
  };
4487
4487
  return t(e), [...n2.values()];
@@ -4558,7 +4558,7 @@
4558
4558
  kind: e.kind,
4559
4559
  name: e.name
4560
4560
  };
4561
- return e.domain !== void 0 && (n2.domain = e.domain), w$1(e) && (n2.axesSpec = _(e.axesSpec)), We(n2);
4561
+ return e.domain !== void 0 && (n2.domain = e.domain), w$1(e) && (n2.axesSpec = G$1(e.axesSpec)), We(n2);
4562
4562
  }
4563
4563
  z$2.object({
4564
4564
  __isRef: z$2.literal(true).describe("Crucial marker for the block dependency tree reconstruction"),
@@ -4571,7 +4571,7 @@
4571
4571
  function Hn(e) {
4572
4572
  return typeof e == "object" && e !== null && "__isRef" in e && e.__isRef === true && "blockId" in e && "name" in e;
4573
4573
  }
4574
- function _n(e, n2 = true) {
4574
+ function Gn(e, n2 = true) {
4575
4575
  if (n2)
4576
4576
  return {
4577
4577
  ...e,
@@ -4826,7 +4826,7 @@
4826
4826
  const i = {};
4827
4827
  for (const [o, s2] of Object.entries(r)) {
4828
4828
  const a = [...this.resolvePath, o];
4829
- i[o] = Bn(s2, (l2) => new k(l2, a));
4829
+ i[o] = Mn(s2, (l2) => new k(l2, a));
4830
4830
  }
4831
4831
  return i;
4832
4832
  }
@@ -4937,27 +4937,27 @@
4937
4937
  const y$1 = e(f);
4938
4938
  let p2, g2, P;
4939
4939
  "spec" in y$1 && typeof y$1.spec == "object" ? (p2 = y$1.spec, g2 = y$1.prefixTrace, P = y$1.suffixTrace) : p2 = y$1;
4940
- const E2 = wn(p2, y.Label), x = wn(p2, y.Trace), T2 = (x ? Ut.safeParse(me$1(x)).data : void 0) ?? [], S = [
4940
+ const E2 = An(p2, y.Label), x = An(p2, y.Trace), T2 = (x ? Ut.safeParse(me$1(x)).data : void 0) ?? [], S2 = [
4941
4941
  ...g2 ?? [],
4942
4942
  ...T2,
4943
4943
  ...P ?? []
4944
4944
  ];
4945
4945
  if (E2 !== void 0) {
4946
4946
  const u2 = { label: E2, type: qt, importance: -2 };
4947
- n2.addLabelAsSuffix ? S.push(u2) : S.splice(0, 0, u2);
4947
+ n2.addLabelAsSuffix ? S2.push(u2) : S2.splice(0, 0, u2);
4948
4948
  }
4949
4949
  const C2 = [], I2 = /* @__PURE__ */ new Map();
4950
- for (let u2 = S.length - 1; u2 >= 0; --u2) {
4951
- const { type: b2 } = S[u2], K = S[u2].importance ?? 0, B = (I2.get(b2) ?? 0) + 1;
4950
+ for (let u2 = S2.length - 1; u2 >= 0; --u2) {
4951
+ const { type: b2 } = S2[u2], K = S2[u2].importance ?? 0, B = (I2.get(b2) ?? 0) + 1;
4952
4952
  I2.set(b2, B);
4953
4953
  const O = `${b2}@${B}`;
4954
4954
  o.set(O, (o.get(O) ?? 0) + 1), r.set(
4955
4955
  O,
4956
4956
  Math.max(
4957
4957
  r.get(O) ?? Number.NEGATIVE_INFINITY,
4958
- K - (S.length - u2) * Kt
4958
+ K - (S2.length - u2) * Kt
4959
4959
  )
4960
- ), C2.push({ ...S[u2], fullType: O, occurrenceIndex: B });
4960
+ ), C2.push({ ...S2[u2], fullType: O, occurrenceIndex: B });
4961
4961
  }
4962
4962
  return C2.reverse(), {
4963
4963
  value: f,
@@ -4972,7 +4972,7 @@
4972
4972
  const m2 = (f, y2 = false) => {
4973
4973
  const p2 = [];
4974
4974
  for (let g2 = 0; g2 < s2.length; g2++) {
4975
- const P = s2[g2], E2 = P.fullTrace.filter((S) => f.has(S.fullType) || i && i.has(S.type));
4975
+ const P = s2[g2], E2 = P.fullTrace.filter((S2) => f.has(S2.fullType) || i && i.has(S2.type));
4976
4976
  if (E2.length === 0)
4977
4977
  if (y2)
4978
4978
  p2.push({
@@ -4980,7 +4980,7 @@
4980
4980
  value: P.value
4981
4981
  });
4982
4982
  else return;
4983
- const x = E2.map((S) => S.label), T2 = n2.separator ?? " / ";
4983
+ const x = E2.map((S2) => S2.label), T2 = n2.separator ?? " / ";
4984
4984
  p2.push({
4985
4985
  label: x.join(T2),
4986
4986
  value: P.value
@@ -5382,11 +5382,11 @@
5382
5382
  }
5383
5383
  }
5384
5384
  if (x.length === 0) continue;
5385
- const T2 = Yt(p2), S = T2.length > 0;
5385
+ const T2 = Yt(p2), S2 = T2.length > 0;
5386
5386
  for (const C2 of x) {
5387
5387
  if (!w$1(C2.spec)) continue;
5388
5388
  const I2 = C2.spec;
5389
- if (S) {
5389
+ if (S2) {
5390
5390
  if (Wt(C2.data))
5391
5391
  throw new Error(`Splitting is not supported for PColumns with PColumnValues data format. Column id: ${C2.id}`);
5392
5392
  const u2 = Jt(C2.data);
@@ -5399,9 +5399,9 @@
5399
5399
  const b2 = $t(u2), K = T2[T2.length - 1];
5400
5400
  if (K >= u2.partitionKeyLength)
5401
5401
  throw new Error(`Not enough partition keys (${u2.partitionKeyLength}) for requested split axes (max index ${K}) in column ${I2.name}`);
5402
- const B = T2.map((_2) => this.findLabels(p$1(I2.axesSpec[_2]))), O = [], _e = (_2, W2) => {
5402
+ const B = T2.map((_) => this.findLabels(p$1(I2.axesSpec[_]))), O = [], _e = (_, W2) => {
5403
5403
  if (W2 >= T2.length) {
5404
- if (O.push([..._2]), O.length > 1e4)
5404
+ if (O.push([..._]), O.length > 1e4)
5405
5405
  throw new Error("Too many key combinations, aborting.");
5406
5406
  return;
5407
5407
  }
@@ -5414,16 +5414,16 @@
5414
5414
  return;
5415
5415
  }
5416
5416
  for (const te2 of j2)
5417
- _2.push(te2), _e(_2, W2 + 1), _2.pop();
5417
+ _.push(te2), _e(_, W2 + 1), _.pop();
5418
5418
  };
5419
5419
  if (_e([], 0), O.length === 0)
5420
5420
  continue;
5421
- const Le = [...I2.axesSpec], rt = T2.map((_2) => _2);
5422
- for (let _2 = T2.length - 1; _2 >= 0; _2--)
5423
- Le.splice(T2[_2], 1);
5421
+ const Le = [...I2.axesSpec], rt = T2.map((_) => _);
5422
+ for (let _ = T2.length - 1; _ >= 0; _--)
5423
+ Le.splice(T2[_], 1);
5424
5424
  const it = { ...I2, axesSpec: Le };
5425
- for (const _2 of O) {
5426
- const W2 = _2.map((q, j2) => {
5425
+ for (const _ of O) {
5426
+ const W2 = _.map((q, j2) => {
5427
5427
  const te2 = rt[j2], ot = p$1(I2.axesSpec[te2]), fe = B[j2], st = (fe == null ? void 0 : fe[q]) ?? String(q);
5428
5428
  return { axisIdx: te2, axisId: ot, value: q, label: st };
5429
5429
  });
@@ -5456,8 +5456,8 @@
5456
5456
  ), y$1 = [];
5457
5457
  for (const { value: p2, label: g2 } of f) {
5458
5458
  const { originalColumn: P, spec: E2 } = p2, x = p2.type === "split" ? p2.axisFilters : void 0, T2 = zt(x);
5459
- let S;
5460
- r ? S = r.deriveS(E2, T2) : S = Xt(P.id, T2);
5459
+ let S2;
5460
+ r ? S2 = r.deriveS(E2, T2) : S2 = Xt(P.id, T2);
5461
5461
  let C2 = { ...p2.adjustedSpec };
5462
5462
  s2 && (C2 = {
5463
5463
  ...C2,
@@ -5466,7 +5466,7 @@
5466
5466
  [y.Label]: g2
5467
5467
  }
5468
5468
  }), y$1.push({
5469
- id: S,
5469
+ id: S2,
5470
5470
  spec: C2,
5471
5471
  data: () => p2.type === "split" ? nn$1(Bt(p2.dataEntries, T2)) : p2.originalColumn.data,
5472
5472
  label: g2
@@ -5538,7 +5538,7 @@
5538
5538
  return true;
5539
5539
  }
5540
5540
  function Re(t) {
5541
- return Bn(t, (e) => e instanceof k ? e.handle : Qe$1(e) ? Xe$1(e, (n2) => n2.handle) : e);
5541
+ return Mn(t, (e) => e instanceof k ? e.handle : Qe$1(e) ? Xe$1(e, (n2) => n2.handle) : e);
5542
5542
  }
5543
5543
  class Qt {
5544
5544
  constructor() {
@@ -5554,10 +5554,10 @@
5554
5554
  const r = typeof e == "function" ? e : Un(e), i = this.getSpecs().entries.filter((a) => r(a.obj));
5555
5555
  let o = {}, s2 = false;
5556
5556
  return typeof n2 < "u" && (typeof n2 == "function" ? o = n2 : typeof n2 == "object" && ("includeNativeLabel" in n2 || "separator" in n2 || "addLabelAsSuffix" in n2 ? o = n2 : (n2 = n2, o = n2.label ?? {}, s2 = n2.refsWithEnrichments ?? false))), typeof o == "object" ? Qe(i, (a) => a.obj, o ?? {}).map(({ value: { ref: a }, label: l2 }) => ({
5557
- ref: _n(a, s2),
5557
+ ref: Gn(a, s2),
5558
5558
  label: l2
5559
5559
  })) : i.map(({ ref: a, obj: l2 }) => ({
5560
- ref: _n(a, s2),
5560
+ ref: Gn(a, s2),
5561
5561
  label: o(l2, a)
5562
5562
  }));
5563
5563
  }
@@ -5694,7 +5694,7 @@
5694
5694
  )) == null ? void 0 : r.obj;
5695
5695
  const n2 = this.ctx.getDataFromResultPoolByRef(e.blockId, e.name);
5696
5696
  if (n2)
5697
- return Bn(
5697
+ return Mn(
5698
5698
  n2,
5699
5699
  (i) => new k(i, [e.blockId, e.name])
5700
5700
  );
@@ -5800,7 +5800,7 @@
5800
5800
  findLabelsForColumnAxis(e, n2) {
5801
5801
  const r = this.findLabels(e.axesSpec[n2]);
5802
5802
  if (!r) return;
5803
- const i = wn(e, `pl7.app/axisKeys/${n2}`);
5803
+ const i = An(e, `pl7.app/axisKeys/${n2}`);
5804
5804
  if (i !== void 0) {
5805
5805
  const o = JSON.parse(i);
5806
5806
  return Object.fromEntries(o.map((s2) => [s2, r[s2] ?? "Unlabelled"]));
@@ -5901,7 +5901,7 @@
5901
5901
  partitionFilters: e.filters ?? [],
5902
5902
  filters: [],
5903
5903
  sorting: e.sorting ?? []
5904
- }) : n2 = this.patchPTableDef(e), this.verifyInlineAndExplicitColumnsSupport(Mn(n2.src)), this.ctx.createPTable(
5904
+ }) : n2 = this.patchPTableDef(e), this.verifyInlineAndExplicitColumnsSupport(Bn(n2.src)), this.ctx.createPTable(
5905
5905
  In(n2, (r) => Re(r))
5906
5906
  );
5907
5907
  }
@@ -6215,10 +6215,10 @@
6215
6215
  for (const a of r)
6216
6216
  for (const l2 of a.spec.axesSpec) {
6217
6217
  const c2 = p$1(l2);
6218
- i.some((m2) => we$1(m2, c2)) || i.push(c2);
6218
+ i.some((m2) => Ae$1(m2, c2)) || i.push(c2);
6219
6219
  }
6220
6220
  for (const a of n2) {
6221
- const l2 = p$1(a.spec.axesSpec[0]), c2 = i.findIndex((m2) => we$1(m2, l2));
6221
+ const l2 = p$1(a.spec.axesSpec[0]), c2 = i.findIndex((m2) => Ae$1(m2, l2));
6222
6222
  c2 !== -1 && i.splice(c2, 1);
6223
6223
  }
6224
6224
  const o = (a, l2) => {
@@ -6229,7 +6229,7 @@
6229
6229
  return c2;
6230
6230
  }, s2 = [];
6231
6231
  for (const a of e) {
6232
- const l2 = a.spec.axesSpec[0], c2 = p$1(l2), m2 = i.findIndex((d) => we$1(d, c2));
6232
+ const l2 = a.spec.axesSpec[0], c2 = p$1(l2), m2 = i.findIndex((d) => Ae$1(d, c2));
6233
6233
  if (m2 !== -1) {
6234
6234
  const d = i[m2], h = Object.keys(d.domain ?? {}).length, f = Object.keys(l2.domain ?? {}).length;
6235
6235
  h > f ? s2.push({
@@ -6289,10 +6289,10 @@
6289
6289
  };
6290
6290
  }
6291
6291
  function on(t) {
6292
- return wn(t, y.Table.Visibility) === "hidden";
6292
+ return An(t, y.Table.Visibility) === "hidden";
6293
6293
  }
6294
6294
  function sn(t) {
6295
- return wn(t, y.Table.Visibility) === "optional";
6295
+ return An(t, y.Table.Visibility) === "optional";
6296
6296
  }
6297
6297
  function be(t, e) {
6298
6298
  return [...new Map(t.map((n2) => [e(n2), n2])).values()];
@@ -6335,11 +6335,11 @@
6335
6335
  return u2 || i.filter((b2) => sn(b2.spec)).map((b2) => b2.id);
6336
6336
  })());
6337
6337
  i.filter((u2) => Fe(u2.spec)).forEach((u2) => x.delete(u2.id)), [...y2.map((u2) => u2.column), ...p2.map((u2) => u2.column), ...g2.map((u2) => u2.column)].filter((u2) => u2.type === "column").forEach((u2) => x.delete(u2.id));
6338
- const T2 = i.filter((u2) => !x.has(u2.id)), S = Ke(T2.map(En), s2);
6339
- if (!rn([...T2, ...S])) return;
6338
+ const T2 = i.filter((u2) => !x.has(u2.id)), S2 = Ke(T2.map(En), s2);
6339
+ if (!rn([...T2, ...S2])) return;
6340
6340
  const C2 = qe({
6341
6341
  columns: T2,
6342
- labelColumns: S,
6342
+ labelColumns: S2,
6343
6343
  coreJoinType: f,
6344
6344
  partitionFilters: y2,
6345
6345
  filters: p2,
@@ -6629,16 +6629,17 @@
6629
6629
  { type: "link", href: "/pl-number-field-page", label: "PlNumberFieldPage" },
6630
6630
  { type: "link", href: "/pl-error-boundary-page", label: "PlErrorBoundaryPage" },
6631
6631
  { type: "link", href: "/pl-element-list-page", label: "PlElementList" },
6632
- { type: "link", href: "/errors", label: "Errors" },
6633
6632
  { type: "link", href: "/text-fields", label: "PlTextField" },
6634
6633
  { type: "link", href: "/tabs", label: "PlTabs" },
6634
+ { type: "link", href: "/pl-autocomplete", label: "PlAutocomplete" },
6635
+ { type: "link", href: "/radio", label: "PlRadio" },
6635
6636
  { type: "link", href: "/stacked-bar", label: "PlChartStackedBar" },
6636
6637
  { type: "link", href: "/histogram", label: "PlChartHistogram" },
6637
6638
  { type: "link", href: "/buttons", label: "ButtonsPage" },
6639
+ { type: "link", href: "/errors", label: "Errors" },
6640
+ { type: "link", href: "/downloads", label: "Downloads" },
6638
6641
  { type: "link", href: "/notifications", label: "Notifications" },
6639
6642
  { type: "link", href: "/drafts", label: "Drafts" },
6640
- { type: "link", href: "/pl-autocomplete", label: "PlAutocomplete" },
6641
- { type: "link", href: "/radio", label: "PlRadio" },
6642
6643
  ...dynamicSections.length ? [
6643
6644
  { type: "delimiter" },
6644
6645
  ...dynamicSections,