@code0-tech/pictor 0.0.0-mvp.45 → 0.0.0-mvp.47

package/dist/utils/generics.js

@@ -1,385 +0,0 @@
-import { useReturnType as G } from "../components/d-flow-function/DFlowFunction.return.hook.js";
-const _ = "GENERIC", y = (e) => typeof e == "object" && e !== null && !Array.isArray(e), d = (e) => y(e) ? "genericKey" in e || "genericType" in e || "dataType" in e : !1, A = (e) => y(e) && "target" in e && Array.isArray(e.sourceDataTypeIdentifiers), R = (e) => y(e) && "variant" in e && "identifier" in e, M = (e) => y(e) && "variant" in e && "config" in e, O = (e) => {
-  if (e)
-    return typeof e == "string" ? e : e?.dataType?.identifier ?? e?.genericType?.dataType?.identifier ?? void 0;
-}, P = (e, t) => {
-  if (e)
-    return typeof e == "string" ? t && t.has(e) ? e : void 0 : e.genericKey ?? void 0;
-}, b = (e) => !e || typeof e == "string" ? [] : e.genericType?.genericMappers ?? [], w = (e, t) => ({
-  ...e,
-  sourceDataTypeIdentifiers: t
-}), z = (e) => {
-  const t = e.genericCombinationStrategies ?? [];
-  return new Set(t.map((r) => r.type));
-}, C = (e) => {
-  if (Array.isArray(e))
-    return e.map(C);
-  if (y(e)) {
-    const t = {};
-    return Object.entries(e).forEach(([r, s]) => {
-      s != null && (r === "__typename" || r === "id" || r === "createdAt" || r === "updatedAt" || (t[r] = C(s)));
-    }), t;
-  }
-  return e;
-}, S = (e, t) => {
-  if (!t) return !e;
-  if (typeof t == "string")
-    return t === _ ? !0 : O(e) === t;
-  if (t.genericKey) return !0;
-  const s = O(t), a = O(e);
-  return !!s && s === a;
-}, D = (e, t) => {
-  switch (e.__typename) {
-    case "DataTypeRulesContainsKeyConfig":
-    case "DataTypeRulesContainsTypeConfig":
-    case "DataTypeRulesReturnTypeConfig":
-    case "DataTypeRulesParentTypeConfig": {
-      const r = e.dataTypeIdentifier;
-      return r ? {
-        ...e,
-        dataTypeIdentifier: E(r, t)
-      } : e;
-    }
-    case "DataTypeRulesInputTypesConfig": {
-      const r = e, s = r.inputTypes?.map((a) => ({
-        ...a,
-        dataTypeIdentifier: E(a.dataTypeIdentifier, t)
-      }));
-      return {
-        ...r,
-        inputTypes: s
-      };
-    }
-    default:
-      return e;
-  }
-}, F = (e, t) => {
-  switch (e.variant) {
-    case "CONTAINS_KEY": {
-      const r = D({
-        ...e.config,
-        __typename: "DataTypeRulesContainsKeyConfig"
-      }, t);
-      return {
-        ...e,
-        config: r
-      };
-    }
-    case "CONTAINS_TYPE": {
-      const r = D({
-        ...e.config,
-        __typename: "DataTypeRulesContainsTypeConfig"
-      }, t);
-      return {
-        ...e,
-        config: r
-      };
-    }
-    case "RETURN_TYPE": {
-      const r = D({
-        ...e.config,
-        __typename: "DataTypeRulesReturnTypeConfig"
-      }, t);
-      return {
-        ...e,
-        config: r
-      };
-    }
-    case "INPUT_TYPES": {
-      const r = D({
-        ...e.config,
-        __typename: "DataTypeRulesInputTypesConfig"
-      }, t);
-      return {
-        ...e,
-        config: r
-      };
-    }
-    case "PARENT_TYPE": {
-      const r = D({
-        ...e.config,
-        __typename: "DataTypeRulesParentTypeConfig"
-      }, t);
-      return {
-        ...e,
-        config: r
-      };
-    }
-    default:
-      return e;
-  }
-}, Y = (e, t, r) => {
-  const s = {}, a = new Set(r), c = (i, n) => {
-    if (!i || !n) return;
-    const f = P(i, a);
-    if (f && a.has(f)) {
-      d(n) && (s[f] = n);
-      return;
-    }
-    const o = b(i);
-    if (o.length === 0) return;
-    const u = b(n);
-    for (const p of o) {
-      const l = u.find((T) => T.target === p.target);
-      if (!l) continue;
-      const m = (p.sourceDataTypeIdentifiers ?? []).map((T) => P(T, a)).filter((T) => !!T && a.has(T)), g = z(p), I = l.sourceDataTypeIdentifiers ?? [];
-      if ((g.has("AND") || g.has("OR")) && I.length === 1 && m.length === (p.sourceDataTypeIdentifiers?.length ?? 0))
-        for (const T of m)
-          s[T] = I[0];
-      else {
-        const T = Math.min(p.sourceDataTypeIdentifiers?.length ?? 0, I.length);
-        for (let h = 0; h < T; h++)
-          c(p.sourceDataTypeIdentifiers[h], I[h]);
-      }
-    }
-  };
-  return c(e, t), s;
-}, E = (e, t) => {
-  if (!d(e)) return e;
-  const {
-    genericKey: r,
-    genericType: s
-  } = e;
-  if (r && t.has(r)) {
-    const c = t.get(r);
-    return c && d(c) ? c : e;
-  }
-  if (!s) return e;
-  const a = (s.genericMappers ?? []).map((c) => {
-    const i = [];
-    for (const n of c.sourceDataTypeIdentifiers ?? []) {
-      if (!n) continue;
-      const f = n.genericKey;
-      if (f && t.has(f)) {
-        const o = t.get(f);
-        o && A(o) ? i.push(...o.sourceDataTypeIdentifiers) : o && d(o) ? i.push(o) : i.push(n);
-      } else d(n) ? i.push(E(n, t)) : i.push(n);
-    }
-    return w(c, i);
-  });
-  return {
-    ...e,
-    genericType: {
-      ...s,
-      genericMappers: a
-    }
-  };
-}, U = (e, t, r) => {
-  const s = {}, a = new Set(r), c = (i, n, f) => {
-    if (!(!i || !n || a.size === 0)) {
-      if (d(i)) {
-        const o = i.genericKey;
-        if (o && a.has(o) && (f ? s[o] = f : (A(n) || d(n)) && (s[o] = n), a.delete(o), a.size === 0))
-          return;
-      }
-      if (A(i) && A(n)) {
-        const o = Math.min(i.sourceDataTypeIdentifiers?.length, n.sourceDataTypeIdentifiers?.length);
-        for (let u = 0; u < o; u++)
-          if (c(i.sourceDataTypeIdentifiers[u], n.sourceDataTypeIdentifiers[u], n), a.size === 0) return;
-        return;
-      }
-      if (R(i) && R(n)) {
-        const o = i.rules?.nodes ?? [], u = n.rules?.nodes ?? [], p = Math.min(o.length, u.length);
-        for (let l = 0; l < p; l++) {
-          const m = o[l], g = u[l];
-          if (!(!m || !g) && (c(m, g), a.size === 0))
-            return;
-        }
-        return;
-      }
-      if (M(i) && M(n)) {
-        c(i.config, n.config);
-        return;
-      }
-      if (Array.isArray(i) && Array.isArray(n)) {
-        const o = Math.min(i.length, n.length);
-        for (let u = 0; u < o; u++)
-          if (c(i[u], n[u], f), a.size === 0) return;
-        return;
-      }
-      if (y(i) && y(n)) {
-        for (const o of Object.keys(i))
-          if (o in n && o !== "__typename" && (c(i[o], n[o], f), a.size === 0))
-            return;
-      }
-    }
-  };
-  return c(e, t), s;
-}, V = (e, t) => {
-  const r = e.rules ? {
-    ...e.rules,
-    nodes: e.rules.nodes?.map((s) => s && {
-      ...s,
-      config: D(s.config, t)
-    })
-  } : void 0;
-  return {
-    ...e,
-    rules: r
-  };
-}, k = (e, t, r, s, a) => {
-  const c = /* @__PURE__ */ new Map(), i = e?.genericKeys ?? [];
-  if (!e?.parameterDefinitions || i.length <= 0) return c;
-  const n = new Set(i);
-  return e.parameterDefinitions.forEach((f, o) => {
-    const u = f.dataTypeIdentifier, p = t[o], l = p?.__typename === "ReferenceValue" ? (() => {
-      const g = a?.nodes?.nodes?.find((h) => h?.id === p.nodeFunctionId), I = g?.parameters?.nodes?.map((h) => h?.value) ?? [], T = s.getById(g?.functionDefinition?.id);
-      return G(T, I, r, s);
-    })() : r.getTypeFromValue(p, a);
-    if (!u || !l) return;
-    const m = Y(u, l, i);
-    for (const [g, I] of Object.entries(m))
-      n.has(g) && (c.has(g) || c.set(g, I));
-  }), c;
-};
-function L(e, t) {
-  if (e.variant !== t.variant) return !1;
-  const r = t.rules?.nodes ?? [];
-  if (r.length === 0) return !0;
-  const s = e.rules?.nodes ?? [];
-  for (const a of r) {
-    if (!a) continue;
-    if (!s.some((i) => i ? x(i, a) : !1)) return !1;
-  }
-  return !0;
-}
-function x(e, t) {
-  if (e.variant !== t.variant) return !1;
-  switch (t.variant) {
-    case "CONTAINS_TYPE":
-    case "RETURN_TYPE":
-      return S(e.config.dataTypeIdentifier, t.config.dataTypeIdentifier);
-    case "CONTAINS_KEY": {
-      const r = e.config, s = t.config;
-      return r.key !== s.key ? !1 : S(r.dataTypeIdentifier, s.dataTypeIdentifier);
-    }
-    case "INPUT_TYPES": {
-      const r = e.config, a = t.config.inputTypes ?? [], c = r.inputTypes ?? [];
-      return a.every((i) => c.some((n) => S(n.dataTypeIdentifier, i.dataTypeIdentifier)));
-    }
-    case "ITEM_OF_COLLECTION": {
-      const r = e.config.items ?? [], s = t.config.items ?? [];
-      return r.length !== s.length ? !1 : r.every((a, c) => a === s[c]);
-    }
-    case "NUMBER_RANGE": {
-      const r = e.config, s = t.config;
-      return r.from === s.from && r.to === s.to && r.steps === s.steps;
-    }
-    case "REGEX": {
-      const r = e.config.pattern, s = t.config.pattern;
-      return r === s;
-    }
-    default:
-      return JSON.stringify(C(e.config)) === JSON.stringify(C(t.config));
-  }
-}
-function v(e, t) {
-  const r = (i) => !!(i === _ || d(i) && i.genericKey), s = (i, n) => r(i) || r(n) ? !0 : i == null || n == null ? i === n : Array.isArray(n) ? !Array.isArray(i) || i.length !== n.length ? !1 : i.every((f, o) => s(f, n[o])) : y(n) ? y(i) ? Object.keys(n).every((o) => s(i[o], n[o])) : !1 : i === n, a = C(e), c = C(t);
-  return s(a, c);
-}
-const j = (e, t) => {
-  if (typeof e == "string") {
-    const s = t.getDataType(e);
-    if (!s) return e;
-    const a = s.genericKeys ?? [];
-    if (s.variant === "ARRAY" && a.length > 0) {
-      const i = s.rules?.nodes?.find((n) => n?.variant === "CONTAINS_TYPE")?.config?.dataTypeIdentifier;
-      if (i) {
-        const [n] = a;
-        return n ? {
-          dataType: s.json,
-          genericType: {
-            dataType: s.json,
-            genericMappers: [{
-              target: n,
-              sourceDataTypeIdentifiers: [j(i, t)]
-            }]
-          }
-        } : e;
-      }
-    }
-    return e;
-  }
-  if (!d(e) || !e.genericType) return e;
-  const r = e.genericType.genericMappers?.map((s) => ({
-    ...s,
-    sourceDataTypeIdentifiers: s?.sourceDataTypeIdentifiers?.map((a) => j(a, t))
-  })) ?? [];
-  return {
-    ...e,
-    genericType: {
-      ...e.genericType,
-      genericMappers: r
-    }
-  };
-}, K = (e) => {
-  if (Array.isArray(e)) {
-    const t = e.map(K);
-    return t.length <= 1 ? t : t.every(y) ? [...t].sort((a, c) => JSON.stringify(a).localeCompare(JSON.stringify(c))) : t.every((a) => !Array.isArray(a) && !y(a)) ? [...t].sort((a, c) => JSON.stringify(a).localeCompare(JSON.stringify(c))) : t;
-  }
-  if (y(e)) {
-    const t = e;
-    return Object.keys(t).sort().reduce((r, s) => (r[s] = K(t[s]), r), {});
-  }
-  return e;
-}, B = (e, t) => {
-  if (!t.genericType) return /* @__PURE__ */ new Map();
-  const r = new Set(e.genericKeys ?? []), s = /* @__PURE__ */ new Map();
-  for (const a of t.genericType.genericMappers ?? []) {
-    const c = a.target;
-    if (!r.has(c))
-      for (const i of a.sourceDataTypeIdentifiers ?? []) {
-        const n = i.genericKey;
-        n && r.has(n) && s.set(n, c);
-      }
-  }
-  return s;
-}, H = (e, t = []) => {
-  const r = new Set(t), s = (n) => n ? r.size === 0 ? !0 : r.has(n) : !1, a = (n) => {
-    const o = s(n.target) ? _ : n.target, u = (n.sourceDataTypeIdentifiers ?? []).map((p) => i(p));
-    return K({
-      ...n,
-      target: o,
-      sourceDataTypeIdentifiers: u
-    });
-  }, c = (n) => {
-    const o = s(n.genericKey) ? _ : n.genericKey, u = {
-      ...n,
-      genericKey: o,
-      dataType: n.dataType ? i(n.dataType) : n.dataType,
-      genericType: n.genericType ? i(n.genericType) : n.genericType
-    };
-    return K(u);
-  };
-  function i(n) {
-    if (n == null) return n;
-    if (Array.isArray(n)) {
-      const f = n.map((o) => i(o));
-      return K(f);
-    }
-    if (d(n))
-      return c(n);
-    if (A(n))
-      return a(n);
-    if (y(n)) {
-      const f = Object.entries(n).reduce((o, [u, p]) => (o[u] = i(p), o), {});
-      return K(f);
-    }
-    return n;
-  }
-  return i(e);
-};
-export {
-  L as isMatchingDataTypeObject,
-  v as isMatchingType,
-  V as replaceGenericKeysInDataTypeObject,
-  E as replaceGenericKeysInType,
-  H as replaceGenericsAndSortType,
-  D as replaceIdentifiersInConfig,
-  F as replaceIdentifiersInRule,
-  U as resolveAllGenericKeysInDataTypeObject,
-  Y as resolveGenericKeyMappings,
-  k as resolveGenericKeys,
-  j as resolveType,
-  B as targetForGenericKey
-};