@graphty/graphty-element 2.6.2 → 3.0.1

package/dist/chunks/{DataSource-BL2UzPff.js → sources-BbAJCDIH.js}

@@ -1,9 +1,11 @@
-import { z as y } from "zod/v4";
-import * as w from "zod/v4/core";
-import { F as $, p as E } from "./paletteRegistry-BCFSwJGK.js";
-import { b as F } from "./GraphtyLogger-B_O67a6c.js";
-import { G as g, S as C } from "./pluginRegistry-Bs8bEkz9.js";
-class S {
+import { z as L } from "zod/v4";
+import * as N from "zod/v4/core";
+import { F as P, p as U } from "./paletteRegistry-De3CGdst.js";
+import { b as B } from "./GraphtyLogger-BtcBJQPL.js";
+import { G as C, S as V } from "./pluginRegistry-Ddfl6Mv2.js";
+import { INVALID_INDEX as S } from "@graphty/graph-format";
+import { N as H, Q as z, B as q } from "./fields-5uVC1Pll.js";
+class W {
   /**
    * Creates a new ErrorAggregator instance.
    * @param maxErrors - Maximum number of errors to collect before stopping
@@ -25,8 +27,8 @@ class S {
     const r = this.errorsByCategory.get(t);
     if (r && r.push(e), e.field) {
       this.errorsByField.has(e.field) || this.errorsByField.set(e.field, []);
-      const s = this.errorsByField.get(e.field);
-      s && s.push(e);
+      const d = this.errorsByField.get(e.field);
+      d && d.push(e);
     }
     return !0;
   }
@@ -37,6 +39,13 @@ class S {
   getErrorCount() {
     return this.errors.length;
   }
+  /**
+   * Get the number of errors this aggregator collects before it stops
+   * @returns The error limit
+   */
+  getErrorLimit() {
+    return this.maxErrors;
+  }
   /**
    * Check if error limit has been reached
    * @returns True if the maximum error count has been reached
@@ -58,9 +67,9 @@ class S {
   getSummary() {
     const e = this.errors.length;
     let t, r = 0;
-    for (const [o, c] of this.errorsByCategory.entries())
-      c.length > r && (r = c.length, t = o);
-    const { message: s, suggestion: i } = this.generateUserFriendlyMessage(
+    for (const [c, g] of this.errorsByCategory.entries())
+      g.length > r && (r = g.length, t = c);
+    const { message: d, suggestion: f } = this.generateUserFriendlyMessage(
       e,
       t,
       this.errorsByCategory,
@@ -70,8 +79,8 @@ class S {
       totalErrors: e,
       categories: new Map(this.errorsByCategory),
       primaryCategory: t,
-      message: s,
-      suggestion: i
+      message: d,
+      suggestion: f
     };
   }
   /**
@@ -99,16 +108,16 @@ Suggestion: ${e.suggestion}`), t;
 `, t += `${"=".repeat(50)}
 
 `;
-    for (const [r, s] of this.errorsByCategory.entries()) {
-      t += `${r.toUpperCase()} (${s.length} errors):
+    for (const [r, d] of this.errorsByCategory.entries()) {
+      t += `${r.toUpperCase()} (${d.length} errors):
 `;
-      const i = s.slice(0, 10);
-      for (const o of i) {
-        const c = o.line !== void 0 ? ` [line ${o.line}]` : "", n = o.field ? ` [field: ${o.field}]` : "";
-        t += `  - ${o.message}${c}${n}
+      const f = d.slice(0, 10);
+      for (const c of f) {
+        const g = c.line !== void 0 ? ` [line ${c.line}]` : "", h = c.field ? ` [field: ${c.field}]` : "";
+        t += `  - ${c.message}${g}${h}
 `;
       }
-      s.length > 10 && (t += `  ... and ${s.length - 10} more
+      d.length > 10 && (t += `  ... and ${d.length - 10} more
 `), t += `
 `;
     }
@@ -128,21 +137,21 @@ Suggestion: ${e.suggestion}`), t;
    * @param errorsByField - Errors grouped by field name
    * @returns Object containing user-friendly message and optional suggestion
    */
-  generateUserFriendlyMessage(e, t, r, s) {
+  generateUserFriendlyMessage(e, t, r, d) {
     if (e === 0)
       return { message: "No errors" };
-    const i = r.get("missing-column")?.length ?? 0, o = r.get("parse-error")?.length ?? 0, c = r.get("validation-error")?.length ?? 0, n = r.get("missing-value")?.length ?? 0;
-    if (i > 0) {
-      const a = Array.from(s.keys()), l = `Found ${e} errors (${i} missing column errors)`, m = a.length > 0 ? `Check that your data has the required columns: ${a.join(", ")}` : "Check that your data has the required columns (e.g., 'source', 'target' for edges)";
-      return { message: l, suggestion: m };
+    const f = r.get("missing-column")?.length ?? 0, c = r.get("parse-error")?.length ?? 0, g = r.get("validation-error")?.length ?? 0, h = r.get("missing-value")?.length ?? 0;
+    if (f > 0) {
+      const l = Array.from(d.keys()), p = `Found ${e} errors (${f} missing column errors)`, $ = l.length > 0 ? `Check that your data has the required columns: ${l.join(", ")}` : "Check that your data has the required columns (e.g., 'source', 'target' for edges)";
+      return { message: p, suggestion: $ };
     }
-    if (o > e * 0.5)
+    if (c > e * 0.5)
       return { message: `Found ${e} errors (mostly parsing errors)`, suggestion: "Check your file format and encoding. Common issues: incorrect delimiter, malformed quotes, or encoding problems (try UTF-8)" };
-    if (n > 0) {
-      const a = Array.from(s.keys()), l = `Found ${e} errors (${n} missing required values)`, m = a.length > 0 ? `Check that rows have values for: ${a.join(", ")}` : "Check that rows have all required values";
-      return { message: l, suggestion: m };
+    if (h > 0) {
+      const l = Array.from(d.keys()), p = `Found ${e} errors (${h} missing required values)`, $ = l.length > 0 ? `Check that rows have values for: ${l.join(", ")}` : "Check that rows have all required values";
+      return { message: p, suggestion: $ };
     }
-    return c > 0 ? { message: `Found ${e} errors (${c} validation errors)`, suggestion: "Check that your data values match the expected format and types" } : t && t !== "unknown" ? {
+    return g > 0 ? { message: `Found ${e} errors (${g} validation errors)`, suggestion: "Check that your data values match the expected format and types" } : t && t !== "unknown" ? {
       message: `Found ${e} errors (mostly ${t} errors)`,
       suggestion: "See detailed error report for more information"
     } : {
@@ -151,7 +160,7 @@ Suggestion: ${e.suggestion}`), t;
     };
   }
 }
-const f = new C("format"), k = /* @__PURE__ */ new Set([
+const I = new V("format"), j = /* @__PURE__ */ new Set([
   "data",
   "file",
   "url",
@@ -164,55 +173,55 @@ const f = new C("format"), k = /* @__PURE__ */ new Set([
   "edgeSrcIdPath",
   "edgeDstIdPath"
 ]);
-function h(d, e) {
-  throw new g({
+function E(n, e) {
+  throw new C({
     code: "E_BAD_COMMAND",
     message: e,
     source: "registry",
-    details: { kind: "format", field: d }
+    details: { kind: "format", field: n }
   });
 }
-function A(d, e) {
-  (e === null || typeof e != "object") && h(
+function G(n, e) {
+  (e === null || typeof e != "object") && E(
     "descriptor",
-    `the format "${d}" registered no description, so nothing could offer it: declare \`static descriptor: FormatDescriptor\` on the class`
+    `the format "${n}" registered no description, so nothing could offer it: declare \`static descriptor: FormatDescriptor\` on the class`
   );
   const t = e;
-  t.id !== d && h(
+  t.id !== n && E(
     "descriptor.id",
-    `the reader registered as "${d}" describes itself as "${String(t.id)}"; one format has one name, and the two halves disagreeing is how a catalogue entry comes to name a reader nothing registered`
-  ), (!Array.isArray(t.extensions) || t.extensions.length === 0) && h(
+    `the reader registered as "${n}" describes itself as "${String(t.id)}"; one format has one name, and the two halves disagreeing is how a catalogue entry comes to name a reader nothing registered`
+  ), (!Array.isArray(t.extensions) || t.extensions.length === 0) && E(
     "descriptor.extensions",
-    `the format "${d}" claims no file extension, so no file could ever be recognised as it`
+    `the format "${n}" claims no file extension, so no file could ever be recognised as it`
   );
   for (const r of t.extensions)
-    (typeof r != "string" || !r.startsWith(".") || r !== r.toLowerCase()) && h(
+    (typeof r != "string" || !r.startsWith(".") || r !== r.toLowerCase()) && E(
       "descriptor.extensions",
-      `the format "${d}" claims the extension ${JSON.stringify(r)}; an extension is a lower-case string beginning with a dot, because that is what a file name is compared against`
+      `the format "${n}" claims the extension ${JSON.stringify(r)}; an extension is a lower-case string beginning with a dot, because that is what a file name is compared against`
     );
-  return (!Array.isArray(t.mimeTypes) || t.mimeTypes.length === 0) && h(
+  return (!Array.isArray(t.mimeTypes) || t.mimeTypes.length === 0) && E(
     "descriptor.mimeTypes",
-    `the format "${d}" declares no media type, which is what a file picker filters on`
-  ), t.canExport === !0 && h(
+    `the format "${n}" declares no media type, which is what a file picker filters on`
+  ), t.canExport === !0 && E(
     "descriptor.canExport",
-    `the format "${d}" says it can be written, and there is nowhere to register a writer: a "Save as" menu built from the catalogue would offer a format nothing can save`
+    `the format "${n}" says it can be written, and there is nowhere to register a writer: a "Save as" menu built from the catalogue would offer a format nothing can save`
   ), e;
 }
-function v(d, e) {
+function x(n, e) {
   if (e !== void 0)
-    return typeof e != "function" && h(
+    return typeof e != "function" && E(
       "detect",
-      `the format "${d}" declares a \`static detect\` that is not a function, so no file could be sniffed`
+      `the format "${n}" declares a \`static detect\` that is not a function, so no file could be sniffed`
     ), e;
 }
-const u = class u {
+const F = class F {
   /**
    * Creates a new DataSource instance.
    * @param errorLimit - Maximum number of errors before stopping data processing
    * @param chunkSize - Number of nodes to process per chunk
    */
-  constructor(e = 100, t = u.DEFAULT_CHUNK_SIZE) {
-    this.edgeSchema = null, this.nodeSchema = null, this.declaration = null, this.errorAggregator = new S(e), this.chunkSize = t;
+  constructor(e = 100, t = F.DEFAULT_CHUNK_SIZE) {
+    this.edgeSchema = null, this.nodeSchema = null, this.declaration = null, this.errorAggregator = new W(e), this.chunkSize = t;
   }
   /**
    * Standardized error message templates
@@ -238,54 +247,54 @@ const u = class u {
   async fetchWithRetry(e, t = 3, r = 3e4) {
     if (e.startsWith("data:"))
       return await fetch(e);
-    let s;
-    for (let i = 0; i < t; i++)
+    let d;
+    for (let f = 0; f < t; f++)
       try {
-        const o = new AbortController(), c = setTimeout(() => {
-          o.abort();
+        const c = new AbortController(), g = setTimeout(() => {
+          c.abort();
         }, r);
         try {
-          const n = await fetch(e, { signal: o.signal });
-          if (clearTimeout(c), !n.ok) {
-            s = n.status;
-            const { status: a } = n;
-            throw a >= 400 && a < 500 && a !== 408 && a !== 429 ? new g({
+          const h = await fetch(e, { signal: c.signal });
+          if (clearTimeout(g), !h.ok) {
+            d = h.status;
+            const { status: l } = h;
+            throw l >= 400 && l < 500 && l !== 408 && l !== 429 ? new C({
               code: "E_FETCH_FAILED",
-              message: `Failed to fetch from ${e}: HTTP ${a}`,
+              message: `Failed to fetch from ${e}: HTTP ${l}`,
               source: "data",
               recoverable: !1,
-              details: { url: e, attempts: i + 1, status: a }
-            }) : new Error(`HTTP error! status: ${a}`);
+              details: { url: e, attempts: f + 1, status: l }
+            }) : new Error(`HTTP error! status: ${l}`);
           }
-          return n;
-        } catch (n) {
-          throw clearTimeout(c), n instanceof Error && n.name === "AbortError" ? new Error(`Request timeout after ${r}ms`) : n;
+          return h;
+        } catch (h) {
+          throw clearTimeout(g), h instanceof Error && h.name === "AbortError" ? new Error(`Request timeout after ${r}ms`) : h;
         }
-      } catch (o) {
-        if (o instanceof g)
-          throw o;
-        if (i === t - 1) {
-          const a = o instanceof Error ? o.message : String(o);
-          throw new g({
+      } catch (c) {
+        if (c instanceof C)
+          throw c;
+        if (f === t - 1) {
+          const l = c instanceof Error ? c.message : String(c);
+          throw new C({
             code: "E_FETCH_FAILED",
-            message: `Failed to fetch from ${e} after ${t} attempts: ${a}`,
+            message: `Failed to fetch from ${e} after ${t} attempts: ${l}`,
             source: "data",
             // A server that was down, a network that dropped: the same call unchanged
             // could succeed later, which is exactly what this flag is for.
             recoverable: !0,
-            details: { url: e, attempts: t, status: s },
-            cause: o
+            details: { url: e, attempts: t, status: d },
+            cause: c
           });
         }
-        const n = Math.pow(2, i) * 1e3;
-        await new Promise((a) => setTimeout(a, n));
+        const h = Math.pow(2, f) * 1e3;
+        await new Promise((l) => setTimeout(l, h));
       }
-    throw new g({
+    throw new C({
       code: "E_FETCH_FAILED",
       message: `Failed to fetch from ${e} after ${t} attempts`,
       source: "data",
       recoverable: !0,
-      details: { url: e, attempts: t, status: s }
+      details: { url: e, attempts: t, status: d }
     });
   }
   /**
@@ -325,10 +334,10 @@ const u = class u {
    * `E_OPTION_RANGE` for a value it would not accept.
    */
   resolveOptions(e) {
-    const r = this.constructor.descriptor?.options ?? [], s = new Set(r.map((o) => o.name)), i = {};
-    for (const [o, c] of Object.entries(e))
-      (s.has(o) || !k.has(o)) && (i[o] = c);
-    return F(r, i, { kind: "format", id: this.type });
+    const r = this.constructor.descriptor?.options ?? [], d = new Set(r.map((c) => c.name)), f = {};
+    for (const [c, g] of Object.entries(e))
+      (d.has(c) || !j.has(c)) && (f[c] = g);
+    return B(r, f, { kind: "format", id: this.type });
   }
   /**
    * Shared chunking helper
@@ -386,14 +395,14 @@ const u = class u {
     for await (const e of this.sourceFetchData()) {
       const t = [];
       if (this.nodeSchema)
-        for (const s of e.nodes)
-          await this.dataValidator(this.nodeSchema, s) && t.push(s);
+        for (const d of e.nodes)
+          await this.dataValidator(this.nodeSchema, d) && t.push(d);
       else
         t.push(...e.nodes);
       const r = [];
       if (this.edgeSchema)
-        for (const s of e.edges)
-          await this.dataValidator(this.edgeSchema, s) && r.push(s);
+        for (const d of e.edges)
+          await this.dataValidator(this.edgeSchema, d) && r.push(d);
       else
         r.push(...e.edges);
       if ((t.length > 0 || r.length > 0) && (yield { nodes: t, edges: r }), this.errorAggregator.hasReachedLimit())
@@ -409,11 +418,11 @@ const u = class u {
    * @returns Promise resolving to true if validation succeeds, false otherwise
    */
   async dataValidator(e, t) {
-    const r = await w.safeParseAsync(e, t);
+    const r = await N.safeParseAsync(e, t);
     if (!r.success) {
-      const s = y.prettifyError(r.error);
+      const d = L.prettifyError(r.error);
       return this.errorAggregator.addError({
-        message: `Validation failed: ${s}`,
+        message: `Validation failed: ${d}`,
         category: "validation-error"
       }), !1;
     }
@@ -451,28 +460,28 @@ const u = class u {
    */
   static register(e, t) {
     const { type: r } = e;
-    if ((typeof r != "string" || r === "") && h(
+    if ((typeof r != "string" || r === "") && E(
       "type",
       "a data source registers under the name in its `static type`, and this class declares none"
-    ), $.some((i) => i.id === r)) {
-      if (f.hasOwn(r))
-        throw new g({
+    ), P.some((f) => f.id === r)) {
+      if (I.hasOwn(r))
+        throw new C({
           code: "E_DUPLICATE_PLUGIN",
           message: `"${r}" is a format the element ships and already reads, and a built-in name may not be taken: a document that named it yesterday has to mean the same thing today`,
           source: "registry",
           details: { kind: "format", name: r, builtIn: !0 }
         });
-      return f.set(r, e), e;
+      return I.set(r, e), e;
     }
-    const s = v(r, e.detect);
-    return E(
+    const d = x(r, e.detect);
+    return U(
       {
-        descriptor: A(r, e.descriptor),
+        descriptor: G(r, e.descriptor),
         type: r,
-        ...s === void 0 ? {} : { detect: s }
+        ...d === void 0 ? {} : { detect: d }
       },
       t
-    ), f.set(r, e), e;
+    ), I.set(r, e), e;
   }
   /**
    * Turn a plain object into a record the element ingests.
@@ -508,7 +517,7 @@ const u = class u {
    * @returns A new data source instance or null if type not found
    */
   static get(e, t = {}) {
-    const r = f.get(e);
+    const r = I.get(e);
     return r ? new r(t) : null;
   }
   /**
@@ -523,12 +532,174 @@ const u = class u {
    * ```
    */
   static getRegisteredTypes() {
-    return Array.from(f.keys()).sort();
+    return Array.from(I.keys()).sort();
   }
 };
-u.DEFAULT_CHUNK_SIZE = 1e3;
-let p = u;
+F.DEFAULT_CHUNK_SIZE = 1e3;
+let M = F;
+function de(n) {
+  return {
+    indexOf: (e) => n.ids.indexOf(e),
+    idOf: (e) => n.ids.idOf(e)
+  };
+}
+function X(n) {
+  const e = n.edges.byRole("id");
+  return {
+    indexOf: (t) => {
+      const r = z(t);
+      return r === S ? S : n.edgeIndexOf(r);
+    },
+    idOf: (t) => {
+      const r = e !== null && e.isSet(t) ? e.value(t) : void 0;
+      return H(typeof r == "number" ? r : S);
+    }
+  };
+}
+const D = "data.";
+function K(n, e, t) {
+  if (t === "source")
+    return n.ids.idOf(n.edgeSource(e));
+  if (t === "target")
+    return n.ids.idOf(n.edgeTarget(e));
+}
+const O = `${q}.`, R = Object.freeze({ kind: "none", key: "", runId: "", field: "" });
+function Z(n) {
+  if (n.startsWith(O)) {
+    const t = n.indexOf(".", O.length), r = t === -1 ? "" : n.slice(O.length, t), d = t === -1 ? "" : n.slice(t + 1);
+    return r === "" || d === "" || d.includes(".") ? R : { kind: "result", key: "", runId: r, field: d };
+  }
+  const e = n.startsWith(D) ? n.slice(D.length) : n;
+  return e === "" ? R : { kind: "attribute", key: e, runId: "", field: "" };
+}
+const J = new Uint32Array(0);
+function Q(n) {
+  const e = X(n);
+  return {
+    graph: n,
+    nodeCount: n.nodeCount,
+    edgeCount: n.edgeCount,
+    mintEdgeId: (t) => e.idOf(t),
+    edgeIds: null,
+    nodeColumns: /* @__PURE__ */ new Map(),
+    edgeColumns: /* @__PURE__ */ new Map(),
+    nodeMeasured: /* @__PURE__ */ new Map(),
+    edgeMeasured: /* @__PURE__ */ new Map()
+  };
+}
+function Y(n) {
+  if (n === null)
+    return null;
+  const e = n.meta.default;
+  return { column: n, defaultPresent: e != null };
+}
+function ee(n, e) {
+  if (!(e < 0 || e >= n.column.length))
+    return n.column.value(e);
+}
+function te(n, e) {
+  return n.column.isSet(e) ? !0 : n.defaultPresent && e >= 0 && e < n.column.length;
+}
+function k(n) {
+  return n != null;
+}
+function ce(n) {
+  const { snapshot: e, records: t } = n, r = n.results, d = /* @__PURE__ */ new Map();
+  let f = null;
+  const c = () => {
+    const s = e();
+    return (f === null || f.graph !== s) && (f = Q(s)), f;
+  }, g = (s) => {
+    const o = d.get(s);
+    if (o !== void 0)
+      return o;
+    const a = Z(s);
+    return d.set(s, a), a;
+  }, h = (s, o, a) => {
+    const i = o === "node" ? s.nodeColumns : s.edgeColumns, u = i.get(a);
+    if (u !== void 0)
+      return u;
+    const m = o === "node" ? s.graph.nodes : s.graph.edges, y = Y(m.get(a));
+    return i.set(a, y), y;
+  }, l = (s, o) => {
+    s.edgeIds ??= new Array(s.edgeCount);
+    const a = s.edgeIds[o];
+    if (a !== void 0)
+      return a;
+    const i = s.mintEdgeId(o);
+    return s.edgeIds[o] = i, i;
+  }, p = (s, o, a, i) => {
+    const u = r?.(i);
+    if (u !== void 0)
+      return o === "node" ? a >= 0 && a < s.nodeCount ? u.node(s.graph.ids.idOf(a)) : void 0 : a >= 0 && a < s.edgeCount ? u.edge(l(s, a)) : void 0;
+  }, $ = (s, o, a, i) => o === "edge" ? a < 0 || a >= s.edgeCount ? void 0 : A(s, o, a, i) ?? K(s.graph, a, i) : A(s, o, a, i), A = (s, o, a, i) => {
+    const u = h(s, o, i);
+    if (u !== null)
+      return ee(u, a);
+    if (t !== void 0) {
+      if (o === "edge")
+        return t.edgeAttributes(a)?.[i];
+      if (!(a < 0 || a >= s.nodeCount))
+        return t.nodeAttributes(a, s.graph.ids.idOf(a))?.[i];
+    }
+  }, b = (s, o, a) => {
+    const i = g(a);
+    if (i.kind === "none")
+      return;
+    const u = c();
+    return i.kind === "result" ? p(u, s, o, i.runId)?.[i.field] : $(u, s, o, i.key);
+  }, T = (s, o, a) => {
+    const i = g(a);
+    if (i.kind === "none")
+      return !1;
+    const u = c();
+    if (i.kind === "result")
+      return k(p(u, s, o, i.runId)?.[i.field]);
+    if (s === "edge" && (i.key === "source" || i.key === "target"))
+      return k($(u, s, o, i.key));
+    const m = h(u, s, i.key);
+    return m !== null ? te(m, o) : k($(u, s, o, i.key));
+  }, _ = (s, o, a, i) => {
+    if (i === void 0)
+      return J;
+    const u = o === "node" ? s.nodeCount : s.edgeCount, m = o === "node" ? (w) => i.node(s.graph.ids.idOf(w)) : (w) => i.edge(l(s, w)), y = new Uint32Array(u);
+    let v = 0;
+    for (let w = 0; w < u; w++)
+      k(m(w)?.[a.field]) && (y[v] = w, v++);
+    return v === u ? y : y.slice(0, v);
+  };
+  return {
+    nodeValue: (s, o) => b("node", s, o),
+    edgeValue: (s, o) => b("edge", s, o),
+    nodeHas: (s, o) => T("node", s, o),
+    edgeHas: (s, o) => T("edge", s, o),
+    nodeIdOf: (s) => c().graph.ids.idOf(s),
+    edgeIdOf: (s) => {
+      const o = c();
+      return l(o, s);
+    },
+    measured: (s, o) => {
+      const a = g(s);
+      if (a.kind !== "result")
+        return;
+      const i = c(), u = o === "node" ? i.nodeMeasured : i.edgeMeasured, m = r?.(a.runId), y = u.get(s);
+      if (y !== void 0 && y.result === m)
+        return y.indices;
+      const v = _(i, o, a, m);
+      return u.set(s, { result: m, indices: v }), v;
+    },
+    topCut: (s, o, a) => {
+      const i = g(s), u = i.kind === "result" ? r?.(i.runId) : void 0, m = u?.fields.find((y) => y.name === i.field);
+      if (!(u === void 0 || m?.kind !== o || m.type !== "number" && m.type !== "integer"))
+        return u.top(i.field, a).entries.at(-1)?.value;
+    }
+  };
+}
 export {
-  p as D,
-  S as E
+  M as D,
+  W as E,
+  K as a,
+  ce as c,
+  X as e,
+  de as n
 };