@platforma-sdk/ui-vue 1.42.14 → 1.42.15

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.
Files changed (29) hide show
  1. package/.turbo/turbo-build.log +15 -15
  2. package/.turbo/turbo-type-check.log +1 -1
  3. package/CHANGELOG.md +8 -0
  4. package/dist/components/PlAgDataTable/sources/table-source-v2.js +4 -4
  5. package/dist/components/PlAgDataTable/sources/table-state-v2.js +6 -6
  6. package/dist/components/PlMultiSequenceAlignment/data.js +5 -5
  7. package/dist/lib/model/common/dist/index.js +194 -171
  8. package/dist/lib/model/common/dist/index.js.map +1 -1
  9. package/dist/lib/ui/uikit/dist/components/PlAutocomplete/PlAutocomplete.vue.js +1 -1
  10. package/dist/lib/ui/uikit/dist/components/PlDropdown/PlDropdown.vue.js +1 -1
  11. package/dist/lib/ui/uikit/dist/components/PlDropdownLegacy/PlDropdownLegacy.vue.js +1 -1
  12. package/dist/lib/ui/uikit/dist/components/PlDropdownMulti/PlDropdownMulti.vue.js +1 -1
  13. package/dist/lib/ui/uikit/dist/components/PlFileInput/PlFileInput.vue.js +20 -20
  14. package/dist/lib/ui/uikit/dist/components/PlFileInput/PlFileInput.vue.js.map +1 -1
  15. package/dist/lib/ui/uikit/dist/components/PlTextArea/PlTextArea.vue.js +1 -1
  16. package/dist/lib/ui/uikit/dist/components/PlTextField/PlTextField.vue.js +1 -1
  17. package/dist/lib/ui/uikit/dist/generated/components/svg/images/{SvgRequired.vue2.js → SvgRequired.vue.js} +1 -1
  18. package/dist/lib/ui/uikit/dist/generated/components/svg/images/SvgRequired.vue.js.map +1 -0
  19. package/dist/lib/ui/uikit/dist/lib/model/common/dist/index.js +179 -156
  20. package/dist/lib/ui/uikit/dist/lib/model/common/dist/index.js.map +1 -1
  21. package/dist/lib/ui/uikit/dist/sdk/model/dist/index.js +358 -346
  22. package/dist/lib/ui/uikit/dist/sdk/model/dist/index.js.map +1 -1
  23. package/dist/sdk/model/dist/index.js +256 -244
  24. package/dist/sdk/model/dist/index.js.map +1 -1
  25. package/package.json +4 -4
  26. package/.turbo/turbo-test.log +0 -565
  27. package/dist/lib/ui/uikit/dist/components/PlAccordion/ExpandTransition.vue2.js +0 -27
  28. package/dist/lib/ui/uikit/dist/components/PlAccordion/ExpandTransition.vue2.js.map +0 -1
  29. package/dist/lib/ui/uikit/dist/generated/components/svg/images/SvgRequired.vue2.js.map +0 -1
@@ -1,39 +1,39 @@
1
1
  import u from "../../../../node_modules/.pnpm/zod@3.23.8/node_modules/zod/lib/index.js";
2
- import y from "../../../../_virtual/canonicalize.js";
3
- var A = Object.defineProperty, O = (n, e, t) => e in n ? A(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t, m = (n, e, t) => O(n, typeof e != "symbol" ? e + "" : e, t);
2
+ import g from "../../../../_virtual/canonicalize.js";
3
+ var O = Object.defineProperty, A = (n, e, t) => e in n ? O(n, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : n[e] = t, m = (n, e, t) => A(n, typeof e != "symbol" ? e + "" : e, t);
4
4
  u.object({
5
5
  /** Included left border. */
6
6
  from: u.number(),
7
7
  /** Excluded right border. */
8
8
  to: u.number()
9
9
  });
10
- function g(n) {
10
+ function l(n) {
11
11
  throw new Error("Unexpected object: " + n);
12
12
  }
13
- const P = "upload://upload/", k = "index://index/";
14
- function I(n) {
15
- return n.startsWith(P);
13
+ const w = "upload://upload/", k = "index://index/";
14
+ function j(n) {
15
+ return n.startsWith(w);
16
16
  }
17
- function J(n) {
17
+ function E(n) {
18
18
  return n.startsWith(k);
19
19
  }
20
- function S(n) {
21
- if (J(n)) {
20
+ function J(n) {
21
+ if (E(n)) {
22
22
  const e = n.slice(k.length);
23
23
  return JSON.parse(decodeURIComponent(e)).path;
24
- } else if (I(n)) {
25
- const e = n.slice(P.length);
24
+ } else if (j(n)) {
25
+ const e = n.slice(w.length);
26
26
  return JSON.parse(decodeURIComponent(e)).localPath;
27
27
  }
28
- g(n);
28
+ l(n);
29
29
  }
30
- function j(n) {
30
+ function S(n) {
31
31
  return n.replace(/^.*[\\/]/, "");
32
32
  }
33
- function M(n) {
34
- return j(S(n));
33
+ function F(n) {
34
+ return S(J(n));
35
35
  }
36
- function U(n) {
36
+ function M(n) {
37
37
  if (!n || typeof n != "object")
38
38
  return !1;
39
39
  const e = n;
@@ -43,22 +43,22 @@ function U(n) {
43
43
  case "Json":
44
44
  return typeof e.keyLength == "number" && e.data !== void 0 && typeof e.data == "object";
45
45
  case "JsonPartitioned":
46
- return typeof e.partitionKeyLength == "number" && e.parts !== void 0 && typeof e.parts == "object";
47
46
  case "BinaryPartitioned":
47
+ case "ParquetPartitioned":
48
48
  return typeof e.partitionKeyLength == "number" && e.parts !== void 0 && typeof e.parts == "object";
49
49
  default:
50
50
  return !1;
51
51
  }
52
52
  }
53
- function _(n, e) {
53
+ function U(n, e) {
54
54
  if (n !== void 0)
55
55
  switch (n.type) {
56
56
  case "Json":
57
57
  return n;
58
58
  case "JsonPartitioned": {
59
59
  const t = {};
60
- for (const [r, o] of Object.entries(n.parts))
61
- t[r] = e(o);
60
+ for (const [r, i] of Object.entries(n.parts))
61
+ t[r] = e(i);
62
62
  return {
63
63
  ...n,
64
64
  parts: t
@@ -66,19 +66,28 @@ function _(n, e) {
66
66
  }
67
67
  case "BinaryPartitioned": {
68
68
  const t = {};
69
- for (const [r, o] of Object.entries(n.parts))
69
+ for (const [r, i] of Object.entries(n.parts))
70
70
  t[r] = {
71
- index: e(o.index),
72
- values: e(o.values)
71
+ index: e(i.index),
72
+ values: e(i.values)
73
73
  };
74
74
  return {
75
75
  ...n,
76
76
  parts: t
77
77
  };
78
78
  }
79
+ case "ParquetPartitioned": {
80
+ const t = {};
81
+ for (const [r, i] of Object.entries(n.parts))
82
+ t[r] = e(i);
83
+ return {
84
+ ...n,
85
+ parts: t
86
+ };
87
+ }
79
88
  }
80
89
  }
81
- function E(n) {
90
+ function I(n) {
82
91
  if (!n || typeof n != "object")
83
92
  return !1;
84
93
  const e = n;
@@ -88,87 +97,101 @@ function E(n) {
88
97
  case "Json":
89
98
  return typeof e.keyLength == "number" && Array.isArray(e.data);
90
99
  case "JsonPartitioned":
91
- return typeof e.partitionKeyLength == "number" && Array.isArray(e.parts);
92
100
  case "BinaryPartitioned":
101
+ case "ParquetPartitioned":
93
102
  return typeof e.partitionKeyLength == "number" && Array.isArray(e.parts);
94
103
  default:
95
104
  return !1;
96
105
  }
97
106
  }
98
- function H(n) {
99
- return E(n) ? n.type === "JsonPartitioned" || n.type === "BinaryPartitioned" : !1;
107
+ function _(n) {
108
+ if (!I(n)) return !1;
109
+ switch (n.type) {
110
+ case "JsonPartitioned":
111
+ case "BinaryPartitioned":
112
+ case "ParquetPartitioned":
113
+ return !0;
114
+ default:
115
+ return !1;
116
+ }
100
117
  }
101
- function q(n) {
118
+ function H(n) {
102
119
  switch (n.type) {
103
- case "Json": {
104
- const e = Object.entries(n.data).map(([t, r]) => ({ key: JSON.parse(t), value: r }));
120
+ case "Json":
105
121
  return {
106
122
  type: "Json",
107
123
  keyLength: n.keyLength,
108
- data: e
124
+ data: Object.entries(n.data).map(([e, t]) => ({ key: JSON.parse(e), value: t }))
109
125
  };
110
- }
111
- case "JsonPartitioned": {
112
- const e = Object.entries(n.parts).map(([t, r]) => ({ key: JSON.parse(t), value: r }));
126
+ case "JsonPartitioned":
113
127
  return {
114
128
  type: "JsonPartitioned",
115
129
  partitionKeyLength: n.partitionKeyLength,
116
- parts: e
130
+ parts: Object.entries(n.parts).map(([e, t]) => ({ key: JSON.parse(e), value: t }))
117
131
  };
118
- }
119
- case "BinaryPartitioned": {
120
- const e = Object.entries(n.parts).map(([t, r]) => ({ key: JSON.parse(t), value: r }));
132
+ case "BinaryPartitioned":
121
133
  return {
122
134
  type: "BinaryPartitioned",
123
135
  partitionKeyLength: n.partitionKeyLength,
124
- parts: e
136
+ parts: Object.entries(n.parts).map(([e, t]) => ({ key: JSON.parse(e), value: t }))
125
137
  };
126
- }
138
+ case "ParquetPartitioned":
139
+ return {
140
+ type: "ParquetPartitioned",
141
+ partitionKeyLength: n.partitionKeyLength,
142
+ parts: Object.entries(n.parts).map(([e, t]) => ({ key: JSON.parse(e), value: t }))
143
+ };
144
+ default:
145
+ l(n);
127
146
  }
128
147
  }
129
148
  function V(n) {
130
149
  switch (n.type) {
131
- case "Json": {
132
- const e = {};
133
- for (const t of n.data)
134
- e[JSON.stringify(t.key)] = t.value;
150
+ case "Json":
135
151
  return {
136
152
  type: "Json",
137
153
  keyLength: n.keyLength,
138
- data: e
154
+ data: Object.fromEntries(
155
+ n.data.map(({ key: e, value: t }) => [JSON.stringify(e), t])
156
+ )
139
157
  };
140
- }
141
- case "JsonPartitioned": {
142
- const e = {};
143
- for (const t of n.parts)
144
- e[JSON.stringify(t.key)] = t.value;
158
+ case "JsonPartitioned":
145
159
  return {
146
160
  type: "JsonPartitioned",
147
161
  partitionKeyLength: n.partitionKeyLength,
148
- parts: e
162
+ parts: Object.fromEntries(
163
+ n.parts.map(({ key: e, value: t }) => [JSON.stringify(e), t])
164
+ )
149
165
  };
150
- }
151
- case "BinaryPartitioned": {
152
- const e = {};
153
- for (const t of n.parts)
154
- e[JSON.stringify(t.key)] = t.value;
166
+ case "BinaryPartitioned":
155
167
  return {
156
168
  type: "BinaryPartitioned",
157
169
  partitionKeyLength: n.partitionKeyLength,
158
- parts: e
170
+ parts: Object.fromEntries(
171
+ n.parts.map(({ key: e, value: t }) => [JSON.stringify(e), t])
172
+ )
159
173
  };
160
- }
174
+ case "ParquetPartitioned":
175
+ return {
176
+ type: "ParquetPartitioned",
177
+ partitionKeyLength: n.partitionKeyLength,
178
+ parts: Object.fromEntries(
179
+ n.parts.map(({ key: e, value: t }) => [JSON.stringify(e), t])
180
+ )
181
+ };
182
+ default:
183
+ l(n);
161
184
  }
162
185
  }
163
186
  function d(n) {
164
- const { type: e, name: t, domain: r } = n, o = { type: e, name: t };
165
- return r && Object.entries(r).length > 0 && Object.assign(o, { domain: r }), o;
187
+ const { type: e, name: t, domain: r } = n, i = { type: e, name: t };
188
+ return r && Object.entries(r).length > 0 && Object.assign(i, { domain: r }), i;
166
189
  }
167
190
  function L(n) {
168
191
  return n.map(d);
169
192
  }
170
193
  function W(n) {
171
- return y(d(n));
194
+ return g(d(n));
172
195
  }
173
196
  function C(n, e) {
174
197
  if (n === void 0) return e === void 0;
@@ -177,13 +200,13 @@ function C(n, e) {
177
200
  if (n[t] !== e[t]) return !1;
178
201
  return !0;
179
202
  }
180
- function $(n, e) {
203
+ function N(n, e) {
181
204
  return n.name === e.name && C(n.domain, e.domain);
182
205
  }
183
206
  function z(n, e) {
184
- return { ...n, src: p(n.src, e) };
207
+ return { ...n, src: h(n.src, e) };
185
208
  }
186
- function p(n, e) {
209
+ function h(n, e) {
187
210
  switch (n.type) {
188
211
  case "column":
189
212
  return {
@@ -203,25 +226,25 @@ function p(n, e) {
203
226
  case "full":
204
227
  return {
205
228
  type: n.type,
206
- entries: n.entries.map((t) => p(t, e))
229
+ entries: n.entries.map((t) => h(t, e))
207
230
  };
208
231
  case "outer":
209
232
  return {
210
233
  type: "outer",
211
- primary: p(n.primary, e),
212
- secondary: n.secondary.map((t) => p(t, e))
234
+ primary: h(n.primary, e),
235
+ secondary: n.secondary.map((t) => h(t, e))
213
236
  };
214
237
  default:
215
- g(n);
238
+ l(n);
216
239
  }
217
240
  }
218
- function N(n) {
219
- return y(n);
241
+ function $(n) {
242
+ return g(n);
220
243
  }
221
- function x(n) {
222
- return y(d(n));
244
+ function b(n) {
245
+ return g(d(n));
223
246
  }
224
- function b(n, e) {
247
+ function x(n, e) {
225
248
  return JSON.stringify([n, e]);
226
249
  }
227
250
  class G {
@@ -232,17 +255,17 @@ class G {
232
255
  constructor(e) {
233
256
  m(this, "domains", /* @__PURE__ */ new Map()), m(this, "axes", /* @__PURE__ */ new Map()), m(this, "domainPacks", []), m(this, "domainPackToAnchor", /* @__PURE__ */ new Map()), this.anchors = e;
234
257
  const t = Object.entries(e);
235
- t.sort((r, o) => r[0].localeCompare(o[0]));
236
- for (const [r, o] of t) {
237
- for (let i = 0; i < o.axesSpec.length; i++) {
238
- const a = o.axesSpec[i], s = x(a);
239
- this.axes.set(s, { anchor: r, idx: i });
258
+ t.sort((r, i) => r[0].localeCompare(i[0]));
259
+ for (const [r, i] of t) {
260
+ for (let o = 0; o < i.axesSpec.length; o++) {
261
+ const a = i.axesSpec[o], s = b(a);
262
+ this.axes.set(s, { anchor: r, idx: o });
240
263
  }
241
- if (o.domain !== void 0) {
242
- const i = Object.entries(o.domain);
243
- i.sort((a, s) => a[0].localeCompare(s[0])), this.domainPackToAnchor.set(JSON.stringify(i), r), this.domainPacks.push(i.map(([a]) => a));
244
- for (const [a, s] of i) {
245
- const c = b(a, s);
264
+ if (i.domain !== void 0) {
265
+ const o = Object.entries(i.domain);
266
+ o.sort((a, s) => a[0].localeCompare(s[0])), this.domainPackToAnchor.set(JSON.stringify(o), r), this.domainPacks.push(o.map(([a]) => a));
267
+ for (const [a, s] of o) {
268
+ const c = x(a, s);
246
269
  this.domains.set(c, r);
247
270
  }
248
271
  }
@@ -256,52 +279,52 @@ class G {
256
279
  name: e.name,
257
280
  axes: []
258
281
  };
259
- let o;
282
+ let i;
260
283
  if (e.domain !== void 0)
261
284
  n:
262
285
  for (const a of this.domainPacks) {
263
286
  const s = [];
264
287
  for (const f of a) {
265
- const l = e.domain[f];
266
- if (l !== void 0)
267
- s.push([f, l]);
288
+ const p = e.domain[f];
289
+ if (p !== void 0)
290
+ s.push([f, p]);
268
291
  else
269
292
  break n;
270
293
  }
271
294
  const c = this.domainPackToAnchor.get(JSON.stringify(s));
272
295
  if (c !== void 0) {
273
- r.domainAnchor = c, o = new Set(a);
296
+ r.domainAnchor = c, i = new Set(a);
274
297
  break;
275
298
  }
276
299
  }
277
300
  for (const [a, s] of Object.entries(e.domain ?? {})) {
278
- if (o !== void 0 && o.has(a))
301
+ if (i !== void 0 && i.has(a))
279
302
  continue;
280
- const c = b(a, s), f = this.domains.get(c);
303
+ const c = x(a, s), f = this.domains.get(c);
281
304
  r.domain ?? (r.domain = {}), r.domain[a] = f ? { anchor: f } : s;
282
305
  }
283
306
  if (r.axes = e.axesSpec.map((a) => {
284
- const s = x(a), c = this.axes.get(s);
307
+ const s = b(a), c = this.axes.get(s);
285
308
  return c === void 0 ? d(a) : c;
286
309
  }), !t || t.length === 0)
287
310
  return r;
288
- const i = [];
311
+ const o = [];
289
312
  for (const a of t) {
290
313
  const [s, c] = a;
291
314
  if (typeof s == "number") {
292
315
  if (s < 0 || s >= e.axesSpec.length)
293
316
  throw new Error(`Axis index ${s} is out of bounds (0-${e.axesSpec.length - 1})`);
294
- i.push([s, c]);
317
+ o.push([s, c]);
295
318
  } else {
296
- const f = e.axesSpec.findIndex((l) => l.name === s);
319
+ const f = e.axesSpec.findIndex((p) => p.name === s);
297
320
  if (f === -1)
298
321
  throw new Error(`Axis with name "${s}" not found in the column specification`);
299
- i.push([f, c]);
322
+ o.push([f, c]);
300
323
  }
301
324
  }
302
- return i.sort((a, s) => a[0] - s[0]), {
325
+ return o.sort((a, s) => a[0] - s[0]), {
303
326
  source: r,
304
- axisFilters: i
327
+ axisFilters: o
305
328
  };
306
329
  }
307
330
  /**
@@ -311,40 +334,40 @@ class G {
311
334
  * @returns A canonicalized string representation of the anchored column identifier
312
335
  */
313
336
  deriveS(e, t) {
314
- return N(this.derive(e, t));
337
+ return $(this.derive(e, t));
315
338
  }
316
339
  }
317
340
  function Q(n, e, t) {
318
- const r = { ...e }, o = (t == null ? void 0 : t.ignoreMissingDomains) ?? !1;
341
+ const r = { ...e }, i = (t == null ? void 0 : t.ignoreMissingDomains) ?? !1;
319
342
  if (r.domainAnchor !== void 0) {
320
- const i = n[r.domainAnchor];
321
- if (!i)
343
+ const o = n[r.domainAnchor];
344
+ if (!o)
322
345
  throw new Error(`Anchor "${r.domainAnchor}" not found`);
323
- const a = i.domain || {};
346
+ const a = o.domain || {};
324
347
  r.domain = { ...a, ...r.domain }, delete r.domainAnchor;
325
348
  }
326
349
  if (r.domain) {
327
- const i = {};
350
+ const o = {};
328
351
  for (const [a, s] of Object.entries(r.domain))
329
352
  if (typeof s == "string")
330
- i[a] = s;
353
+ o[a] = s;
331
354
  else {
332
355
  const c = n[s.anchor];
333
356
  if (!c)
334
357
  throw new Error(`Anchor "${s.anchor}" not found for domain key "${a}"`);
335
358
  if (!c.domain || c.domain[a] === void 0) {
336
- if (!o)
359
+ if (!i)
337
360
  throw new Error(`Domain key "${a}" not found in anchor "${s.anchor}"`);
338
361
  continue;
339
362
  }
340
- i[a] = c.domain[a];
363
+ o[a] = c.domain[a];
341
364
  }
342
- r.domain = i;
365
+ r.domain = o;
343
366
  }
344
- return r.axes && (r.axes = r.axes.map((i) => K(n, i))), r;
367
+ return r.axes && (r.axes = r.axes.map((o) => K(n, o))), r;
345
368
  }
346
369
  function K(n, e) {
347
- if (!D(e))
370
+ if (!q(e))
348
371
  return e;
349
372
  const t = e.anchor, r = n[t];
350
373
  if (!r)
@@ -354,30 +377,30 @@ function K(n, e) {
354
377
  throw new Error(`Axis index ${e.idx} out of bounds for anchor "${t}"`);
355
378
  return r.axesSpec[e.idx];
356
379
  } else if ("name" in e) {
357
- const o = r.axesSpec.filter((i) => i.name === e.name);
358
- if (o.length > 1)
380
+ const i = r.axesSpec.filter((o) => o.name === e.name);
381
+ if (i.length > 1)
359
382
  throw new Error(`Multiple axes with name "${e.name}" found in anchor "${t}"`);
360
- if (o.length === 0)
383
+ if (i.length === 0)
361
384
  throw new Error(`Axis with name "${e.name}" not found in anchor "${t}"`);
362
- return o[0];
385
+ return i[0];
363
386
  } else if ("id" in e) {
364
- const o = r.axesSpec.filter((i) => $(e.id, d(i)));
365
- if (o.length > 1)
387
+ const i = r.axesSpec.filter((o) => N(e.id, d(o)));
388
+ if (i.length > 1)
366
389
  throw new Error(`Multiple matching axes found for matcher in anchor "${t}"`);
367
- if (o.length === 0)
390
+ if (i.length === 0)
368
391
  throw new Error(`No matching axis found for matcher in anchor "${t}"`);
369
- return o[0];
392
+ return i[0];
370
393
  }
371
394
  throw new Error("Unsupported axis reference type");
372
395
  }
373
- function D(n) {
396
+ function q(n) {
374
397
  return typeof n == "object" && "anchor" in n;
375
398
  }
376
- function h(n) {
399
+ function y(n) {
377
400
  return n.kind === "PColumn";
378
401
  }
379
402
  function T(n) {
380
- return h(n.spec);
403
+ return y(n.spec);
381
404
  }
382
405
  function X(n) {
383
406
  if (!T(n)) throw new Error(`not a PColumn (kind = ${n.spec.kind})`);
@@ -402,19 +425,19 @@ function Z(n) {
402
425
  return;
403
426
  case "full":
404
427
  case "inner":
405
- for (const o of r.entries) t(o);
428
+ for (const i of r.entries) t(i);
406
429
  return;
407
430
  case "outer":
408
431
  t(r.primary);
409
- for (const o of r.secondary) t(o);
432
+ for (const i of r.secondary) t(i);
410
433
  return;
411
434
  default:
412
- g(r);
435
+ l(r);
413
436
  }
414
437
  };
415
438
  return t(n), [...e.values()];
416
439
  }
417
- function v(n, e) {
440
+ function P(n, e) {
418
441
  if (n.name !== void 0 && n.name !== e.name)
419
442
  return !1;
420
443
  if (n.type !== void 0) {
@@ -426,13 +449,13 @@ function v(n, e) {
426
449
  }
427
450
  if (n.domain !== void 0) {
428
451
  const t = e.domain || {};
429
- for (const [r, o] of Object.entries(n.domain))
430
- if (t[r] !== o)
452
+ for (const [r, i] of Object.entries(n.domain))
453
+ if (t[r] !== i)
431
454
  return !1;
432
455
  }
433
456
  return !0;
434
457
  }
435
- function w(n, e) {
458
+ function v(n, e) {
436
459
  if (e.name !== void 0 && n.name !== e.name || e.namePattern !== void 0 && !new RegExp(e.namePattern).test(n.name))
437
460
  return !1;
438
461
  if (e.type !== void 0) {
@@ -444,49 +467,49 @@ function w(n, e) {
444
467
  }
445
468
  if (e.domain !== void 0) {
446
469
  const t = n.domain || {};
447
- for (const [r, o] of Object.entries(e.domain))
448
- if (t[r] !== o)
470
+ for (const [r, i] of Object.entries(e.domain))
471
+ if (t[r] !== i)
449
472
  return !1;
450
473
  }
451
474
  if (e.axes !== void 0) {
452
475
  const t = n.axesSpec.map(d);
453
476
  if (e.partialAxesMatch) {
454
477
  for (const r of e.axes)
455
- if (!t.some((o) => v(r, o)))
478
+ if (!t.some((i) => P(r, i)))
456
479
  return !1;
457
480
  } else {
458
481
  if (t.length !== e.axes.length)
459
482
  return !1;
460
483
  for (let r = 0; r < e.axes.length; r++)
461
- if (!v(e.axes[r], t[r]))
484
+ if (!P(e.axes[r], t[r]))
462
485
  return !1;
463
486
  }
464
487
  }
465
488
  if (e.annotations !== void 0) {
466
489
  const t = n.annotations || {};
467
- for (const [r, o] of Object.entries(e.annotations))
468
- if (t[r] !== o)
490
+ for (const [r, i] of Object.entries(e.annotations))
491
+ if (t[r] !== i)
469
492
  return !1;
470
493
  }
471
494
  if (e.annotationPatterns !== void 0) {
472
495
  const t = n.annotations || {};
473
- for (const [r, o] of Object.entries(e.annotationPatterns)) {
474
- const i = t[r];
475
- if (i === void 0 || !new RegExp(o).test(i))
496
+ for (const [r, i] of Object.entries(e.annotationPatterns)) {
497
+ const o = t[r];
498
+ if (o === void 0 || !new RegExp(i).test(o))
476
499
  return !1;
477
500
  }
478
501
  }
479
502
  return !0;
480
503
  }
481
504
  function nn(n) {
482
- return Array.isArray(n) ? (e) => n.some((t) => h(e) && w(e, t)) : (e) => h(e) && w(e, n);
505
+ return Array.isArray(n) ? (e) => n.some((t) => y(e) && v(e, t)) : (e) => y(e) && v(e, n);
483
506
  }
484
507
  function en(n) {
485
508
  const e = {
486
509
  kind: n.kind,
487
510
  name: n.name
488
511
  };
489
- return n.domain !== void 0 && (e.domain = n.domain), h(n) && (e.axesSpec = L(n.axesSpec)), y(e);
512
+ return n.domain !== void 0 && (e.domain = n.domain), y(n) && (e.axesSpec = L(n.axesSpec)), g(e);
490
513
  }
491
514
  u.object({
492
515
  __isRef: u.literal(!0).describe("Crucial marker for the block dependency tree reconstruction"),
@@ -513,40 +536,40 @@ function rn(n, e = !0) {
513
536
  function on(n, e) {
514
537
  return n.ok ? { ok: !0, value: e(n.value) } : n;
515
538
  }
516
- const R = 24;
517
- u.string().length(R).regex(/[ABCDEFGHIJKLMNOPQRSTUVWXYZ234567]/).brand("PlId");
539
+ const D = 24;
540
+ u.string().length(D).regex(/[ABCDEFGHIJKLMNOPQRSTUVWXYZ234567]/).brand("PlId");
518
541
  export {
519
542
  G as AnchoredIdDeriver,
520
- R as PlIdLength,
543
+ D as PlIdLength,
521
544
  W as canonicalizeAxisId,
522
- q as dataInfoToEntries,
545
+ H as dataInfoToEntries,
523
546
  en as deriveNativeId,
524
547
  X as ensurePColumn,
525
548
  V as entriesToDataInfo,
526
549
  Z as extractAllColumns,
527
550
  L as getAxesId,
528
551
  d as getAxisId,
529
- M as getFileNameFromHandle,
530
- S as getFilePathFromHandle,
531
- U as isDataInfo,
532
- E as isDataInfoEntries,
533
- J as isImportFileHandleIndex,
534
- I as isImportFileHandleUpload,
552
+ F as getFileNameFromHandle,
553
+ J as getFilePathFromHandle,
554
+ M as isDataInfo,
555
+ I as isDataInfoEntries,
556
+ E as isImportFileHandleIndex,
557
+ j as isImportFileHandleUpload,
535
558
  T as isPColumn,
536
- h as isPColumnSpec,
537
- H as isPartitionedDataInfoEntries,
559
+ y as isPColumnSpec,
560
+ _ as isPartitionedDataInfoEntries,
538
561
  tn as isPlRef,
539
- _ as mapDataInfo,
540
- p as mapJoinEntry,
562
+ U as mapDataInfo,
563
+ h as mapJoinEntry,
541
564
  Y as mapPObjectData,
542
565
  z as mapPTableDef,
543
566
  on as mapValueInVOE,
544
- v as matchAxis,
545
- $ as matchAxisId,
546
- w as matchPColumn,
567
+ P as matchAxis,
568
+ N as matchAxisId,
569
+ v as matchPColumn,
547
570
  Q as resolveAnchors,
548
571
  nn as selectorsToPredicate,
549
- N as stringifyColumnId,
572
+ $ as stringifyColumnId,
550
573
  rn as withEnrichments
551
574
  };
552
575
  //# sourceMappingURL=index.js.map