@milaboratories/graph-maker 1.1.134 → 1.1.135

package/dist/node_modules/@milaboratories/pl-model-common/dist/index.js

@@ -1,214 +1,214 @@
 import u from "../../../zod/lib/index.js";
-import y from "../../../canonicalize/lib/canonicalize.js";
-var k = Object.defineProperty, P = (t, e, n) => e in t ? k(t, e, { enumerable: !0, configurable: !0, writable: !0, value: n }) : t[e] = n, m = (t, e, n) => P(t, typeof e != "symbol" ? e + "" : e, n);
+import l from "../../../canonicalize/lib/canonicalize.js";
+var k = Object.defineProperty, P = (e, t, n) => t in e ? k(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, p = (e, t, n) => P(e, typeof t != "symbol" ? t + "" : t, n);
 u.object({
   /** Included left border. */
   from: u.number(),
   /** Excluded right border. */
   to: u.number()
 });
-function w(t) {
-  throw new Error("Unexpected object: " + t);
+function w(e) {
+  throw new Error("Unexpected object: " + e);
 }
-function N(t) {
-  if (!t || typeof t != "object")
+function K(e) {
+  if (!e || typeof e != "object")
     return !1;
-  const e = t;
-  if (!("type" in e))
+  const t = e;
+  if (!("type" in t))
     return !1;
-  switch (e.type) {
+  switch (t.type) {
     case "Json":
-      return typeof e.keyLength == "number" && e.data !== void 0 && typeof e.data == "object";
+      return typeof t.keyLength == "number" && t.data !== void 0 && typeof t.data == "object";
     case "JsonPartitioned":
-      return typeof e.partitionKeyLength == "number" && e.parts !== void 0 && typeof e.parts == "object";
+      return typeof t.partitionKeyLength == "number" && t.parts !== void 0 && typeof t.parts == "object";
     case "BinaryPartitioned":
-      return typeof e.partitionKeyLength == "number" && e.parts !== void 0 && typeof e.parts == "object";
+      return typeof t.partitionKeyLength == "number" && t.parts !== void 0 && typeof t.parts == "object";
     default:
       return !1;
   }
 }
-function T(t, e) {
-  if (t !== void 0)
-    switch (t.type) {
+function T(e, t) {
+  if (e !== void 0)
+    switch (e.type) {
       case "Json":
-        return t;
+        return e;
       case "JsonPartitioned": {
         const n = {};
-        for (const [r, o] of Object.entries(t.parts))
-          n[r] = e(o);
+        for (const [r, o] of Object.entries(e.parts))
+          n[r] = t(o);
         return {
-          ...t,
+          ...e,
           parts: n
         };
       }
       case "BinaryPartitioned": {
         const n = {};
-        for (const [r, o] of Object.entries(t.parts))
+        for (const [r, o] of Object.entries(e.parts))
           n[r] = {
-            index: e(o.index),
-            values: e(o.values)
+            index: t(o.index),
+            values: t(o.values)
           };
         return {
-          ...t,
+          ...e,
           parts: n
         };
       }
     }
 }
-function A(t) {
-  if (!t || typeof t != "object")
+function A(e) {
+  if (!e || typeof e != "object")
     return !1;
-  const e = t;
-  if (!("type" in e))
+  const t = e;
+  if (!("type" in t))
     return !1;
-  switch (e.type) {
+  switch (t.type) {
     case "Json":
-      return typeof e.keyLength == "number" && Array.isArray(e.data);
+      return typeof t.keyLength == "number" && Array.isArray(t.data);
     case "JsonPartitioned":
-      return typeof e.partitionKeyLength == "number" && Array.isArray(e.parts);
+      return typeof t.partitionKeyLength == "number" && Array.isArray(t.parts);
     case "BinaryPartitioned":
-      return typeof e.partitionKeyLength == "number" && Array.isArray(e.parts);
+      return typeof t.partitionKeyLength == "number" && Array.isArray(t.parts);
     default:
       return !1;
   }
 }
-function D(t) {
-  return A(t) ? t.type === "JsonPartitioned" || t.type === "BinaryPartitioned" : !1;
+function D(e) {
+  return A(e) ? e.type === "JsonPartitioned" || e.type === "BinaryPartitioned" : !1;
 }
-function B(t) {
-  switch (t.type) {
+function B(e) {
+  switch (e.type) {
     case "Json": {
-      const e = Object.entries(t.data).map(([n, r]) => ({ key: JSON.parse(n), value: r }));
+      const t = Object.entries(e.data).map(([n, r]) => ({ key: JSON.parse(n), value: r }));
       return {
         type: "Json",
-        keyLength: t.keyLength,
-        data: e
+        keyLength: e.keyLength,
+        data: t
       };
     }
     case "JsonPartitioned": {
-      const e = Object.entries(t.parts).map(([n, r]) => ({ key: JSON.parse(n), value: r }));
+      const t = Object.entries(e.parts).map(([n, r]) => ({ key: JSON.parse(n), value: r }));
       return {
         type: "JsonPartitioned",
-        partitionKeyLength: t.partitionKeyLength,
-        parts: e
+        partitionKeyLength: e.partitionKeyLength,
+        parts: t
       };
     }
     case "BinaryPartitioned": {
-      const e = Object.entries(t.parts).map(([n, r]) => ({ key: JSON.parse(n), value: r }));
+      const t = Object.entries(e.parts).map(([n, r]) => ({ key: JSON.parse(n), value: r }));
       return {
         type: "BinaryPartitioned",
-        partitionKeyLength: t.partitionKeyLength,
-        parts: e
+        partitionKeyLength: e.partitionKeyLength,
+        parts: t
       };
     }
   }
 }
-function M(t) {
-  switch (t.type) {
+function M(e) {
+  switch (e.type) {
     case "Json": {
-      const e = {};
-      for (const n of t.data)
-        e[JSON.stringify(n.key)] = n.value;
+      const t = {};
+      for (const n of e.data)
+        t[JSON.stringify(n.key)] = n.value;
       return {
         type: "Json",
-        keyLength: t.keyLength,
-        data: e
+        keyLength: e.keyLength,
+        data: t
       };
     }
     case "JsonPartitioned": {
-      const e = {};
-      for (const n of t.parts)
-        e[JSON.stringify(n.key)] = n.value;
+      const t = {};
+      for (const n of e.parts)
+        t[JSON.stringify(n.key)] = n.value;
       return {
         type: "JsonPartitioned",
-        partitionKeyLength: t.partitionKeyLength,
-        parts: e
+        partitionKeyLength: e.partitionKeyLength,
+        parts: t
       };
     }
     case "BinaryPartitioned": {
-      const e = {};
-      for (const n of t.parts)
-        e[JSON.stringify(n.key)] = n.value;
+      const t = {};
+      for (const n of e.parts)
+        t[JSON.stringify(n.key)] = n.value;
       return {
         type: "BinaryPartitioned",
-        partitionKeyLength: t.partitionKeyLength,
-        parts: e
+        partitionKeyLength: e.partitionKeyLength,
+        parts: t
       };
     }
   }
 }
-function d(t) {
-  const { type: e, name: n, domain: r } = t, o = { type: e, name: n };
+function d(e) {
+  const { type: t, name: n, domain: r } = e, o = { type: t, name: n };
   return r && Object.entries(r).length > 0 && Object.assign(o, { domain: r }), o;
 }
-function O(t) {
-  return t.map(d);
+function j(e) {
+  return e.map(d);
 }
-function R(t) {
-  return y(d(t));
+function R(e) {
+  return l(d(e));
 }
-function j(t, e) {
-  if (t === void 0) return e === void 0;
-  if (e === void 0) return !0;
-  for (const n in e)
-    if (t[n] !== e[n]) return !1;
+function O(e, t) {
+  if (e === void 0) return t === void 0;
+  if (t === void 0) return !0;
+  for (const n in t)
+    if (e[n] !== t[n]) return !1;
   return !0;
 }
-function S(t, e) {
-  return t.name === e.name && j(t.domain, e.domain);
+function J(e, t) {
+  return e.name === t.name && O(e.domain, t.domain);
 }
-function _(t, e) {
-  return { ...t, src: p(t.src, e) };
+function _(e, t) {
+  return { ...e, src: h(e.src, t) };
 }
-function p(t, e) {
-  switch (t.type) {
+function h(e, t) {
+  switch (e.type) {
     case "column":
       return {
         type: "column",
-        column: e(t.column)
+        column: t(e.column)
       };
     case "slicedColumn":
       return {
         type: "slicedColumn",
-        column: e(t.column),
-        newId: t.newId,
-        axisFilters: t.axisFilters
+        column: t(e.column),
+        newId: e.newId,
+        axisFilters: e.axisFilters
       };
     case "inlineColumn":
-      return t;
+      return e;
     case "inner":
     case "full":
       return {
-        type: t.type,
-        entries: t.entries.map((n) => p(n, e))
+        type: e.type,
+        entries: e.entries.map((n) => h(n, t))
       };
     case "outer":
       return {
         type: "outer",
-        primary: p(t.primary, e),
-        secondary: t.secondary.map((n) => p(n, e))
+        primary: h(e.primary, t),
+        secondary: e.secondary.map((n) => h(n, t))
       };
     default:
-      w(t);
+      w(e);
   }
 }
-function E(t) {
-  return y(t);
+function S(e) {
+  return l(e);
 }
-function g(t) {
-  return y(d(t));
+function g(e) {
+  return l(d(e));
 }
-function b(t, e) {
-  return JSON.stringify([t, e]);
+function b(e, t) {
+  return JSON.stringify([e, t]);
 }
-class q {
+class F {
   /**
    * Creates a new anchor context from a set of anchor column specifications
    * @param anchors Record of anchor column specifications indexed by anchor ID
    */
-  constructor(e) {
-    m(this, "domains", /* @__PURE__ */ new Map()), m(this, "axes", /* @__PURE__ */ new Map()), m(this, "domainPacks", []), m(this, "domainPackToAnchor", /* @__PURE__ */ new Map()), this.anchors = e;
-    const n = Object.entries(e);
+  constructor(t) {
+    p(this, "domains", /* @__PURE__ */ new Map()), p(this, "axes", /* @__PURE__ */ new Map()), p(this, "domainPacks", []), p(this, "domainPackToAnchor", /* @__PURE__ */ new Map()), this.anchors = t;
+    const n = Object.entries(t);
     n.sort((r, o) => r[0].localeCompare(o[0]));
     for (const [r, o] of n) {
       for (let i = 0; i < o.axesSpec.length; i++) {
@@ -228,20 +228,20 @@ class q {
   /**
    * Implementation of derive method
    */
-  derive(e, n) {
+  derive(t, n) {
     const r = {
-      name: e.name,
+      name: t.name,
       axes: []
     };
     let o;
-    if (e.domain !== void 0)
+    if (t.domain !== void 0)
       e:
         for (const a of this.domainPacks) {
           const s = [];
           for (const f of a) {
-            const l = e.domain[f];
-            if (l !== void 0)
-              s.push([f, l]);
+            const m = t.domain[f];
+            if (m !== void 0)
+              s.push([f, m]);
             else
               break e;
           }
@@ -251,13 +251,13 @@ class q {
             break;
           }
         }
-    for (const [a, s] of Object.entries(e.domain ?? {})) {
+    for (const [a, s] of Object.entries(t.domain ?? {})) {
       if (o !== void 0 && o.has(a))
         continue;
       const c = b(a, s), f = this.domains.get(c);
       r.domain ?? (r.domain = {}), r.domain[a] = f ? { anchor: f } : s;
     }
-    if (r.axes = e.axesSpec.map((a) => {
+    if (r.axes = t.axesSpec.map((a) => {
       const s = g(a), c = this.axes.get(s);
       return c === void 0 ? d(a) : c;
     }), !n || n.length === 0)
@@ -266,11 +266,11 @@ class q {
     for (const a of n) {
       const [s, c] = a;
       if (typeof s == "number") {
-        if (s < 0 || s >= e.axesSpec.length)
-          throw new Error(`Axis index ${s} is out of bounds (0-${e.axesSpec.length - 1})`);
+        if (s < 0 || s >= t.axesSpec.length)
+          throw new Error(`Axis index ${s} is out of bounds (0-${t.axesSpec.length - 1})`);
         i.push([s, c]);
       } else {
-        const f = e.axesSpec.findIndex((l) => l.name === s);
+        const f = t.axesSpec.findIndex((m) => m.name === s);
         if (f === -1)
           throw new Error(`Axis with name "${s}" not found in the column specification`);
         i.push([f, c]);
@@ -287,14 +287,14 @@ class q {
    * @param axisFilters Optional axis filters to apply to the column
    * @returns A canonicalized string representation of the anchored column identifier
    */
-  deriveS(e, n) {
-    return E(this.derive(e, n));
+  deriveS(t, n) {
+    return S(this.derive(t, n));
   }
 }
-function F(t, e, n) {
-  const r = { ...e }, o = (n == null ? void 0 : n.ignoreMissingDomains) ?? !1;
+function z(e, t, n) {
+  const r = { ...t }, o = (n == null ? void 0 : n.ignoreMissingDomains) ?? !1;
   if (r.domainAnchor !== void 0) {
-    const i = t[r.domainAnchor];
+    const i = e[r.domainAnchor];
     if (!i)
       throw new Error(`Anchor "${r.domainAnchor}" not found`);
     const a = i.domain || {};
@@ -306,7 +306,7 @@ function F(t, e, n) {
       if (typeof s == "string")
         i[a] = s;
       else {
-        const c = t[s.anchor];
+        const c = e[s.anchor];
         if (!c)
           throw new Error(`Anchor "${s.anchor}" not found for domain key "${a}"`);
         if (!c.domain || c.domain[a] === void 0) {
@@ -318,27 +318,27 @@ function F(t, e, n) {
       }
     r.domain = i;
   }
-  return r.axes && (r.axes = r.axes.map((i) => J(t, i))), r;
+  return r.axes && (r.axes = r.axes.map((i) => E(e, i))), r;
 }
-function J(t, e) {
-  if (!I(e))
-    return e;
-  const n = e.anchor, r = t[n];
+function E(e, t) {
+  if (!I(t))
+    return t;
+  const n = t.anchor, r = e[n];
   if (!r)
     throw new Error(`Anchor "${n}" not found for axis reference`);
-  if ("idx" in e) {
-    if (e.idx < 0 || e.idx >= r.axesSpec.length)
-      throw new Error(`Axis index ${e.idx} out of bounds for anchor "${n}"`);
-    return r.axesSpec[e.idx];
-  } else if ("name" in e) {
-    const o = r.axesSpec.filter((i) => i.name === e.name);
+  if ("idx" in t) {
+    if (t.idx < 0 || t.idx >= r.axesSpec.length)
+      throw new Error(`Axis index ${t.idx} out of bounds for anchor "${n}"`);
+    return r.axesSpec[t.idx];
+  } else if ("name" in t) {
+    const o = r.axesSpec.filter((i) => i.name === t.name);
     if (o.length > 1)
-      throw new Error(`Multiple axes with name "${e.name}" found in anchor "${n}"`);
+      throw new Error(`Multiple axes with name "${t.name}" found in anchor "${n}"`);
     if (o.length === 0)
-      throw new Error(`Axis with name "${e.name}" not found in anchor "${n}"`);
+      throw new Error(`Axis with name "${t.name}" not found in anchor "${n}"`);
     return o[0];
-  } else if ("id" in e) {
-    const o = r.axesSpec.filter((i) => S(e.id, d(i)));
+  } else if ("id" in t) {
+    const o = r.axesSpec.filter((i) => J(t.id, d(i)));
     if (o.length > 1)
       throw new Error(`Multiple matching axes found for matcher in anchor "${n}"`);
     if (o.length === 0)
@@ -347,33 +347,33 @@ function J(t, e) {
   }
   throw new Error("Unsupported axis reference type");
 }
-function I(t) {
-  return typeof t == "object" && "anchor" in t;
+function I(e) {
+  return typeof e == "object" && "anchor" in e;
 }
-function h(t) {
-  return t.kind === "PColumn";
+function y(e) {
+  return e.kind === "PColumn";
 }
-function L(t) {
-  return h(t.spec);
+function L(e) {
+  return y(e.spec);
 }
-function U(t) {
-  if (!L(t)) throw new Error(`not a PColumn (kind = ${t.spec.kind})`);
-  return t;
+function U(e) {
+  if (!L(e)) throw new Error(`not a PColumn (kind = ${e.spec.kind})`);
+  return e;
 }
-function V(t, e) {
-  return t === void 0 ? void 0 : {
-    ...t,
-    data: e(t.data)
+function q(e, t) {
+  return e === void 0 ? void 0 : {
+    ...e,
+    data: t(e.data)
   };
 }
-function z(t) {
-  const e = /* @__PURE__ */ new Map(), n = (r) => {
+function V(e) {
+  const t = /* @__PURE__ */ new Map(), n = (r) => {
     switch (r.type) {
       case "column":
-        e.set(r.column.id, r.column);
+        t.set(r.column.id, r.column);
         return;
       case "slicedColumn":
-        e.set(r.column.id, r.column);
+        t.set(r.column.id, r.column);
         return;
       case "inlineColumn":
         return;
@@ -389,65 +389,65 @@ function z(t) {
         w(r);
     }
   };
-  return n(t), [...e.values()];
+  return n(e), [...t.values()];
 }
-function x(t, e) {
-  if (t.name !== void 0 && t.name !== e.name)
+function x(e, t) {
+  if (e.name !== void 0 && e.name !== t.name)
     return !1;
-  if (t.type !== void 0) {
-    if (Array.isArray(t.type)) {
-      if (!t.type.includes(e.type))
+  if (e.type !== void 0) {
+    if (Array.isArray(e.type)) {
+      if (!e.type.includes(t.type))
         return !1;
-    } else if (t.type !== e.type)
+    } else if (e.type !== t.type)
       return !1;
   }
-  if (t.domain !== void 0) {
-    const n = e.domain || {};
-    for (const [r, o] of Object.entries(t.domain))
+  if (e.domain !== void 0) {
+    const n = t.domain || {};
+    for (const [r, o] of Object.entries(e.domain))
       if (n[r] !== o)
         return !1;
   }
   return !0;
 }
-function v(t, e) {
-  if (e.name !== void 0 && t.name !== e.name || e.namePattern !== void 0 && !new RegExp(e.namePattern).test(t.name))
+function v(e, t) {
+  if (t.name !== void 0 && e.name !== t.name || t.namePattern !== void 0 && !new RegExp(t.namePattern).test(e.name))
     return !1;
-  if (e.type !== void 0) {
-    if (Array.isArray(e.type)) {
-      if (!e.type.includes(t.valueType))
+  if (t.type !== void 0) {
+    if (Array.isArray(t.type)) {
+      if (!t.type.includes(e.valueType))
         return !1;
-    } else if (e.type !== t.valueType)
+    } else if (t.type !== e.valueType)
       return !1;
   }
-  if (e.domain !== void 0) {
-    const n = t.domain || {};
-    for (const [r, o] of Object.entries(e.domain))
+  if (t.domain !== void 0) {
+    const n = e.domain || {};
+    for (const [r, o] of Object.entries(t.domain))
       if (n[r] !== o)
         return !1;
   }
-  if (e.axes !== void 0) {
-    const n = t.axesSpec.map(d);
-    if (e.partialAxesMatch) {
-      for (const r of e.axes)
+  if (t.axes !== void 0) {
+    const n = e.axesSpec.map(d);
+    if (t.partialAxesMatch) {
+      for (const r of t.axes)
         if (!n.some((o) => x(r, o)))
           return !1;
     } else {
-      if (n.length !== e.axes.length)
+      if (n.length !== t.axes.length)
         return !1;
-      for (let r = 0; r < e.axes.length; r++)
-        if (!x(e.axes[r], n[r]))
+      for (let r = 0; r < t.axes.length; r++)
+        if (!x(t.axes[r], n[r]))
           return !1;
     }
   }
-  if (e.annotations !== void 0) {
-    const n = t.annotations || {};
-    for (const [r, o] of Object.entries(e.annotations))
+  if (t.annotations !== void 0) {
+    const n = e.annotations || {};
+    for (const [r, o] of Object.entries(t.annotations))
       if (n[r] !== o)
         return !1;
   }
-  if (e.annotationPatterns !== void 0) {
-    const n = t.annotations || {};
-    for (const [r, o] of Object.entries(e.annotationPatterns)) {
+  if (t.annotationPatterns !== void 0) {
+    const n = e.annotations || {};
+    for (const [r, o] of Object.entries(t.annotationPatterns)) {
       const i = n[r];
       if (i === void 0 || !new RegExp(o).test(i))
         return !1;
@@ -455,15 +455,15 @@ function v(t, e) {
   }
   return !0;
 }
-function G(t) {
-  return Array.isArray(t) ? (e) => t.some((n) => h(e) && v(e, n)) : (e) => h(e) && v(e, t);
+function G(e) {
+  return Array.isArray(e) ? (t) => e.some((n) => y(t) && v(t, n)) : (t) => y(t) && v(t, e);
 }
-function W(t) {
-  const e = {
-    kind: t.kind,
-    name: t.name
+function X(e) {
+  const t = {
+    kind: e.kind,
+    name: e.name
   };
-  return t.domain !== void 0 && (e.domain = t.domain), h(t) && (e.axesSpec = O(t.axesSpec)), y(e);
+  return e.domain !== void 0 && (t.domain = e.domain), y(e) && (t.axesSpec = j(e.axesSpec)), l(t);
 }
 u.object({
   __isRef: u.literal(!0).describe("Crucial marker for the block dependency tree reconstruction"),
@@ -473,53 +473,57 @@ u.object({
 }).describe(
   "Universal reference type, allowing to set block connections. It is crucial that {@link __isRef} is present and equal to true, internal logic relies on this marker to build block dependency trees."
 ).readonly();
-function Z(t) {
-  return typeof t == "object" && t !== null && "__isRef" in t && t.__isRef === !0 && "blockId" in t && "name" in t;
+function H(e) {
+  return typeof e == "object" && e !== null && "__isRef" in e && e.__isRef === !0 && "blockId" in e && "name" in e;
 }
-function H(t, e = !0) {
-  if (e)
+function Q(e, t = !0) {
+  if (t)
     return {
-      ...t,
+      ...e,
       requireEnrichments: !0
     };
   {
-    const { requireEnrichments: n, ...r } = t;
+    const { requireEnrichments: n, ...r } = e;
     return r;
   }
 }
-function Q(t, e) {
-  return t.ok ? { ok: !0, value: e(t.value) } : t;
+function W(e, t) {
+  return e.ok ? { ok: !0, value: t(e.value) } : e;
 }
 const C = 24;
 u.string().length(C).regex(/[ABCDEFGHIJKLMNOPQRSTUVWXYZ234567]/).brand("PlId");
+function Y(e) {
+  return l(e);
+}
 export {
-  q as AnchoredIdDeriver,
+  F as AnchoredIdDeriver,
   C as PlIdLength,
   R as canonicalizeAxisId,
+  Y as canonicalizeJson,
   B as dataInfoToEntries,
-  W as deriveNativeId,
+  X as deriveNativeId,
   U as ensurePColumn,
   M as entriesToDataInfo,
-  z as extractAllColumns,
-  O as getAxesId,
+  V as extractAllColumns,
+  j as getAxesId,
   d as getAxisId,
-  N as isDataInfo,
+  K as isDataInfo,
   A as isDataInfoEntries,
   L as isPColumn,
-  h as isPColumnSpec,
+  y as isPColumnSpec,
   D as isPartitionedDataInfoEntries,
-  Z as isPlRef,
+  H as isPlRef,
   T as mapDataInfo,
-  p as mapJoinEntry,
-  V as mapPObjectData,
+  h as mapJoinEntry,
+  q as mapPObjectData,
   _ as mapPTableDef,
-  Q as mapValueInVOE,
+  W as mapValueInVOE,
   x as matchAxis,
-  S as matchAxisId,
+  J as matchAxisId,
   v as matchPColumn,
-  F as resolveAnchors,
+  z as resolveAnchors,
   G as selectorsToPredicate,
-  E as stringifyColumnId,
-  H as withEnrichments
+  S as stringifyColumnId,
+  Q as withEnrichments
 };
 //# sourceMappingURL=index.js.map