@loradb/lora-graphql 0.30.0 → 0.32.1

package/dist/{lora-graphql-upoPizGA.js → lora-graphql-BW8S6TRu.js}

@@ -75,7 +75,7 @@ function kl(e) {
       const a = /* @__PURE__ */ new Map(), c = [...s.filters];
       if (!r && !jn.has(s.type)) {
         const d = c.filter((f) => Tl.has(f));
-        d.length > 0 ? a.set("RANGE", `${o} is @filterable by ${d.join(", ")}`) : Yr(e, n, s) && a.set("RANGE", `${o} is @sortable`);
+        d.length > 0 ? a.set("RANGE", `${o} is @filterable by ${d.join(", ")}`) : s.list && c.includes("INCLUDES") ? a.set("RANGE", `${o} is @filterable by INCLUDES`) : Yr(e, n, s) && a.set("RANGE", `${o} is @sortable`);
       }
       const l = c.filter(
         (d) => d === "WITHIN_BBOX" || d === "DISTANCE"
@@ -124,7 +124,7 @@ function gn(e, t, n) {
 function wo(e) {
   return e.replace(/([a-z0-9])([A-Z])/g, "$1_$2").replace(/[^A-Za-z0-9]+/g, "_").toLowerCase();
 }
-function rm(e) {
+function am(e) {
   switch (e.kind) {
     case "index":
       return `index:${e.index}:${e.label}:${e.property}`;
@@ -136,7 +136,7 @@ function rm(e) {
       return `vector:${e.name}:${e.label}:${e.property}:${e.dimensions}:${e.similarity}`;
   }
 }
-function am(e) {
+function cm(e) {
   switch (e.kind) {
     case "index":
       return `${e.index} index on :${e.label}(${e.property})`;
@@ -496,7 +496,7 @@ const Ml = Object.freeze([
   "PERSISTED_QUERY_ONLY",
   "WRONG_OPERATION_TYPE"
 ]), Ul = new Set(Ml);
-function cm(e) {
+function lm(e) {
   if (typeof e != "object" || e === null) return !1;
   const t = e.extensions;
   if (typeof t != "object" || t === null) return !1;
@@ -973,7 +973,15 @@ function Ls(e, t, n, i = {}) {
 function Bi(e) {
   return ne("size", ne("list.unique", e));
 }
-const aa = 2, Hl = 1e3, Vl = 1e4, Gl = /* @__PURE__ */ new Set(["eq", "in", "startsWith", "withinBBox", "distance"]), Ql = /* @__PURE__ */ new Set(["lt", "lte", "gt", "gte"]);
+const aa = 2, Hl = 1e3, Vl = 1e4, Gl = /* @__PURE__ */ new Set([
+  "eq",
+  "in",
+  "startsWith",
+  "withinBBox",
+  "distance",
+  // A list's elements, in the RANGE index inferred for it (G-63).
+  "includes"
+]), Ql = /* @__PURE__ */ new Set(["lt", "lte", "gt", "gte"]);
 function ca(e, t, n) {
   return e.statistics?.nodes[t.name] ?? n;
 }
@@ -3066,7 +3074,7 @@ function Lu(e, t) {
   }
   return e.multipleOf && i.push(Ke(`a multiple of ${e.multipleOf.value}`)), i.length > 0 && n.push(t ? `Each item: ${i.join(" ")}` : i.join(" ")), n.length > 0 ? n.join(" ") : void 0;
 }
-function lm(e, t) {
+function um(e, t) {
   const n = [], i = [], s = [], o = (c, l, u, d) => {
     l !== u && (u === void 0 ? s.push(`${c} was removed (was ${l})`) : l === void 0 ? n.push(`${c} is now ${u}`) : (d === "down" ? u < l : u > l) ? n.push(`${c} went from ${l} to ${u}`) : s.push(`${c} went from ${l} to ${u}`));
   };
@@ -3764,11 +3772,11 @@ function Un(e, t, n, i, s) {
   let h;
   !c && !a && l && u.length === 0 && (h = Xu(e, t, l), h && (r.push(...h.clauses), c = h.expectation));
   let m;
-  s && (m = Xi(e, "this", i, s), u.length === 0 && !c && vi(i[0]) && !jn.has(i[0].field.type) && (c = {
+  s && (m = Xi(e, "this", i, s), u.length === 0 && !c && vi(i[0]) && !jn.has(i[0].field.type) ? c = {
     label: o,
     access: "range",
     reason: `keyset on ${t.name}.${i[0].field.name}`
-  }));
+  } : c?.access === "element" && (c = { ...c, access: "any" }));
   let g;
   const y = i[0];
   return !p && !a && !m && !h && u.length === 0 && y && y.direction === "ASC" && vi(y) && (y.field.type === "String" || y.field.type === "ID") && (g = se(">=", de(M("this"), y.field.property), G("")), c = {
@@ -3825,7 +3833,7 @@ function Xu(e, t, n) {
     return l != null ? p = se("=", de(M(d), r.key.property), B(e, l)) : p = se(
       "IN",
       de(M(d), r.key.property),
-      B(e, Yu(u))
+      B(e, Zu(u))
     ), f.push({
       kind: "match",
       pattern: {
@@ -3858,6 +3866,17 @@ function Xu(e, t, n) {
   }
 }
 function Ju(e, t) {
+  const n = e.labels[0], i = Object.entries(t).find(([o, r]) => {
+    const a = e.fields.get(o);
+    return a?.kind === "scalar" && a.list && r != null && r.includes != null;
+  }), s = Yu(e, t);
+  if (i) {
+    const o = `${e.name}.${i[0]} includes`;
+    return s ? { label: n, access: "any", reason: `${s.reason} or ${o}` } : { label: n, access: "element", reason: o };
+  }
+  return s;
+}
+function Yu(e, t) {
   const n = e.labels[0];
   for (const i of ["exact", "range", "text", "point"])
     for (const [s, o] of Object.entries(t)) {
@@ -3879,7 +3898,7 @@ function Ju(e, t) {
         };
     }
 }
-function Yu(e) {
+function Zu(e) {
   const t = /* @__PURE__ */ new Set();
   return e.filter((n) => {
     const i = Y(n);
@@ -3947,7 +3966,7 @@ function no(e, t, n, i, s) {
     }
   ];
 }
-function Zu(e, t, n, i) {
+function ed(e, t, n, i) {
   const s = e.schema.getType(
     Z.aggregate(t.name)
   ), o = n.where, r = Un(e, t, o, []);
@@ -3967,7 +3986,7 @@ function Zu(e, t, n, i) {
     r.expectation
   );
 }
-function ed(e, t, n, i) {
+function td(e, t, n, i) {
   const s = [...new Set(n.by ?? [])];
   if (s.length === 0)
     throw U("BAD_USER_INPUT", "`by` names at least one field");
@@ -4041,7 +4060,7 @@ function Xa(e, t) {
   }
   return n;
 }
-function td(e, t, n, i, s, o, r) {
+function nd(e, t, n, i, s, o, r) {
   const a = e.model.nodes.get(n.target);
   me(e, a, "READ");
   const c = a.labels[0];
@@ -4088,7 +4107,7 @@ function td(e, t, n, i, s, o, r) {
   ];
   l && v.properties.length > 0 && T.push({
     key: "properties",
-    value: nd(e, l.name, N, v.properties, I, {
+    value: sd(e, l.name, N, v.properties, I, {
       rel: n,
       owner: t,
       target: $
@@ -4224,7 +4243,7 @@ function td(e, t, n, i, s, o, r) {
     expr: { kind: "map", entries: q }
   } : (q[0] = { key: "__rows", value: { kind: "list", items: [] } }, { pre: [], expr: { kind: "map", entries: q } });
 }
-function nd(e, t, n, i, s, o) {
+function sd(e, t, n, i, s, o) {
   const r = e.model.relationshipProperties.get(t), a = e.schema.getType(t), c = [];
   for (const [l, u] of Qe(e, a, i)) {
     const d = r.fields.get(u[0].name.value);
@@ -4330,7 +4349,7 @@ function so(e, t, n, i, s, o) {
   return { node: r, properties: a, totalCount: c, page: l, aggregate: u };
 }
 const Wo = /* @__PURE__ */ new Map();
-function sd(e) {
+function id(e) {
   const t = Wo.get(e);
   if (t) return t;
   const n = tt(`{ ${e} }`).definitions[0];
@@ -4341,7 +4360,7 @@ function Ze(e, t, n, i, s) {
   const o = e.schema.getType(t.name), r = o.getFields(), a = [], c = [], l = Qe(e, o, i), u = [];
   for (const [, p] of l) {
     const h = t.fields.get(p[0].name.value);
-    h?.kind === "custom" && h.requires && u.push(sd(h.requires));
+    h?.kind === "custom" && h.requires && u.push(id(h.requires));
   }
   const d = u.length > 0 ? Qe(e, o, [...i, ...u]) : l;
   for (const [p, h] of d) {
@@ -4386,7 +4405,7 @@ function Ze(e, t, n, i, s) {
         s
       );
     else if (y?.kind === "relationship")
-      D = id(
+      D = od(
         e,
         n,
         y,
@@ -4400,7 +4419,7 @@ function Ze(e, t, n, i, s) {
     else {
       const I = Ho(t, m);
       if (!I) continue;
-      D = td(
+      D = nd(
         e,
         n,
         I,
@@ -4442,7 +4461,7 @@ function Ja(e, t, n) {
   const i = e.degrees.get(`${t.owner}.${t.name}`) ?? t.cardinality;
   return i === void 0 ? n : Math.min(n, Math.max(i, 1));
 }
-function id(e, t, n, i, s, o, r) {
+function od(e, t, n, i, s, o, r) {
   const a = e.model.nodes.get(n.target);
   me(e, a, "READ");
   const c = a.labels[0];
@@ -4559,7 +4578,7 @@ const qt = "[A-Za-z_][A-Za-z0-9_]*|`(?:[^`]|``)+`", io = (e) => e.startsWith("`"
   "REMOVE",
   "DELETE",
   "DETACH"
-]), od = /* @__PURE__ */ new Set([
+]), rd = /* @__PURE__ */ new Set([
   ...Za,
   "MATCH",
   "OPTIONAL",
@@ -4587,12 +4606,12 @@ function oo(e, t) {
   for (let c = 0; c < i.length; c++)
     s += i[c] === "_" ? t[c] : i[c];
   const o = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set();
-  for (const { keyword: c, text: l } of ad(i, s)) {
+  for (const { keyword: c, text: l } of cd(i, s)) {
     for (const d of Go(l)) o.add(d);
     for (const d of Qo(l)) r.add(d);
-    const u = c === "SET" ? cd(l) : c === "DELETE" ? ud(l) : [];
+    const u = c === "SET" ? ld(l) : c === "DELETE" ? dd(l) : [];
     for (const d of u) {
-      const f = dd(s, d);
+      const f = fd(s, d);
       if (f.length === 0)
         return Vo(n, Go(s), Qo(s));
       for (const p of f)
@@ -4612,14 +4631,14 @@ function oo(e, t) {
 function Vo(e, t, n) {
   return e.filter(
     (i) => i.labels.some((s) => t.has(s)) || i.uniqueTogether.some((s) => {
-      const o = rd(i, s.where);
+      const o = ad(i, s.where);
       return s.scalars.some((r) => n.has(r.property)) || [...s.singles, ...s.set ? [s.set] : []].some(
         (r) => t.has(r.type)
       ) || o.props.some((r) => n.has(r)) || o.types.some((r) => t.has(r));
     })
   );
 }
-function rd(e, t) {
+function ad(e, t) {
   const n = { props: [], types: [] }, i = (s) => {
     if (Array.isArray(s)) s.forEach(i);
     else if (s && typeof s == "object")
@@ -4630,7 +4649,7 @@ function rd(e, t) {
   };
   return i(t), n;
 }
-function ad(e, t) {
+function cd(e, t) {
   const n = [], i = [], s = (c, l) => {
     for (; i.length > 0 && i[i.length - 1].depth >= l; ) {
       const u = i.pop();
@@ -4657,7 +4676,7 @@ function ad(e, t) {
         continue;
       }
       const d = u[0].toUpperCase(), f = c + u[0].length;
-      od.has(d) && // Not a property, label, parameter or map key.
+      rd.has(d) && // Not a property, label, parameter or map key.
       !".:$".includes(a) && !/^\s*:/.test(e.slice(f, f + 64)) && (s(c, r), Za.has(d) && i.push({ keyword: d, start: c, depth: r })), c = f, a = "a";
     }
   }
@@ -4677,14 +4696,14 @@ function Qo(e) {
     )
   );
 }
-function cd(e) {
+function ld(e) {
   return [
     ...e.matchAll(
       new RegExp(`(?<![.\\w\`$])(${qt})\\s*\\+?=(?![=~])`, "g")
     )
   ].map((t) => t[1]);
 }
-const ld = /* @__PURE__ */ new Set([
+const ud = /* @__PURE__ */ new Set([
   "DELETE",
   "NULL",
   "TRUE",
@@ -4701,12 +4720,12 @@ const ld = /* @__PURE__ */ new Set([
   "ELSE",
   "END"
 ]);
-function ud(e) {
+function dd(e) {
   return [
     ...e.matchAll(new RegExp(`(?<![.:\\w\`$])(${qt})(?!\\s*[(.])`, "g"))
-  ].map((t) => t[1]).filter((t) => !ld.has(t.toUpperCase()));
+  ].map((t) => t[1]).filter((t) => !ud.has(t.toUpperCase()));
 }
-function dd(e, t) {
+function fd(e, t) {
   const n = t.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), i = new RegExp(
     `[(\\[]\\s*${n}\\s*(:\\s*(?:${qt})\\s*(?:[:&|]\\s*:?\\s*(?:${qt})\\s*)*)`,
     "g"
@@ -4729,7 +4748,7 @@ function ec(e, t) {
     )
   ].sort();
 }
-function fd(e, t, n) {
+function pd(e, t, n) {
   if (t.broad || e.opaque) return !0;
   const i = new Set(t.types.flatMap(n));
   return e.labels.some((s) => i.has(s)) || e.relationships.some((s) => t.relationshipTypes.includes(s));
@@ -4834,7 +4853,7 @@ function nc(e, t, n) {
       const c = a[r];
       for (const l of Array.isArray(c) ? c : [c]) {
         if (l == null) continue;
-        const u = pd(e, l);
+        const u = hd(e, l);
         if (!u) {
           t.writes && (i.broad = !0);
           continue;
@@ -4861,7 +4880,7 @@ SET n.${R(Te.state)} = "PENDING"`,
     };
   });
 }
-function pd(e, t) {
+function hd(e, t) {
   const n = t;
   if (!(!n || !Array.isArray(n.labels) || !n.properties))
     for (const i of e.nodes.values()) {
@@ -4873,7 +4892,7 @@ function pd(e, t) {
 function Lt(e, t, n) {
   return e.onStatement?.(n), e.observe ? e.observe(n, () => t.execute(n)) : t.execute(n);
 }
-const hd = {
+const md = {
   DateTime: "datetime()",
   LocalDateTime: "localdatetime()",
   Date: "date()"
@@ -4881,9 +4900,9 @@ const hd = {
 function en(e, t) {
   return [...e.fields.values()].filter(
     (n) => n.kind === "scalar" && !!n.timestamp?.has(t)
-  ).map((n) => [n.property, hd[n.type]]);
+  ).map((n) => [n.property, md[n.type]]);
 }
-function md(e, t) {
+function gd(e, t) {
   const n = t.properties ? e.relationshipProperties.get(t.properties) : void 0;
   return (n ? en(n, "UPDATE") : []).map(([i, s]) => `, r.${R(i)} = ${s}`).join("");
 }
@@ -4899,7 +4918,7 @@ function Pt(e, t, n, i, s, o, r) {
 MATCH (${R(e)})${Je(i, s, o, r)}
 WHERE ${St(o, r)}`;
 }
-const gd = (e) => e && se("OR", de(M("row"), "fresh"), e), ke = (e) => e ? ` AND (${P(e)})` : "";
+const yd = (e) => e && se("OR", de(M("row"), "fresh"), e), ke = (e) => e ? ` AND (${P(e)})` : "";
 function ro(e, t) {
   return [...e.nodes.get(t.target).fields.values()].filter(
     (i) => i.kind === "relationship" && i.type === t.type && i.members.includes(t.owner) && i.direction !== t.direction
@@ -4992,7 +5011,7 @@ function Es(e) {
   let t = Ko.get(e.model);
   return t === void 0 && (t = [...e.model.nodes.values()].some((n) => n.triggers.length > 0), Ko.set(e.model, t)), t;
 }
-function yd(e) {
+function Ed(e) {
   return !e.inTrigger && !!e.triggers && Object.keys(e.triggers).length > 0;
 }
 function rc(e, t, n) {
@@ -5029,7 +5048,7 @@ MATCH (this:${R(e.labels[0])}) WHERE this.${R(e.key.property)} = lora_trigger_pa
 MATCH (target:${R(t.labels[0])}) WHERE target.${R(t.key.property)} = lora_trigger_pair[1]
 `;
 }
-function Ed(e, t, n, i) {
+function wd(e, t, n, i) {
   const { model: s } = e.env, o = new Set(e.change.deleted.map(Be)), r = /* @__PURE__ */ new Map();
   for (const a of i) {
     if (a.type !== n.type) continue;
@@ -5046,7 +5065,7 @@ function Ed(e, t, n, i) {
     [...r].map(([a, c]) => [a, [...c.values()]])
   );
 }
-async function wd(e) {
+async function vd(e) {
   if (!Es(e.env)) return;
   const t = (a) => !e.triggered.has(Be(a)), n = Xo(e, e.change.created.filter(t)), i = new Set(e.change.created.map(Be)), s = Xo(
     e,
@@ -5064,7 +5083,7 @@ async function wd(e) {
           ["DISCONNECT", e.disconnected]
         ])
           if (c.operations.has(f))
-            for (const [h, m] of Ed(e, a, l, p))
+            for (const [h, m] of wd(e, a, l, p))
               o.push([
                 c,
                 (g) => ({
@@ -5081,7 +5100,7 @@ async function wd(e) {
       const u = c.operations.has("CREATE") ? n.get(a) ?? [] : [];
       u.length > 0 && o.push(r(a, c, "CREATE", u));
       const d = c.operations.has("UPDATE") ? (s.get(a) ?? []).filter(
-        (f) => Ad(e, a, f, c.fields)
+        (f) => kd(e, a, f, c.fields)
       ) : [];
       d.length > 0 && o.push(r(a, c, "UPDATE", d));
     }
@@ -5089,7 +5108,7 @@ async function wd(e) {
   for (const a of e.env.model.nodes.values())
     await $i(e, a, "CREATE", n.get(a) ?? []), await $i(e, a, "UPDATE", s.get(a) ?? []);
 }
-async function vd(e, t) {
+async function bd(e, t) {
   if (!Es(e.env)) return;
   const n = [];
   for (const { node: i, keys: s } of t)
@@ -5123,7 +5142,7 @@ async function $i(e, t, n, i) {
       operation: n,
       type: t.name,
       keys: i,
-      change: bd(e),
+      change: $d(e),
       transaction: o,
       context: e.env.requestContext
     }))();
@@ -5147,9 +5166,9 @@ async function $i(e, t, n, i) {
   } finally {
     clearTimeout(a);
   }
-  for (const c of o.drain()) $d(e, c);
+  for (const c of o.drain()) Td(e, c);
 }
-function bd(e) {
+function $d(e) {
   const t = {
     ...e.change,
     created: [...e.change.created],
@@ -5160,7 +5179,7 @@ function bd(e) {
   };
   return ec(t, e), t;
 }
-function $d(e, t) {
+function Td(e, t) {
   const n = e.change, i = (a, c) => {
     const l = a.findIndex((u) => Be(u) === c);
     return l >= 0 && a.splice(l, 1), l >= 0;
@@ -5191,7 +5210,7 @@ async function lc(e, t) {
     }), r;
   }), i = /* @__PURE__ */ new Set(), s = [];
   for (const [o, [r]] of t.entries()) {
-    s.push(...Td(e, r, await n[o]));
+    s.push(...Ad(e, r, await n[o]));
     for (const a of oo(
       e.env.model,
       r.statement
@@ -5206,7 +5225,7 @@ async function lc(e, t) {
   ))
     await e.send(o);
 }
-function Td(e, t, n) {
+function Ad(e, t, n) {
   const i = nc(e.env.model, t, n);
   i.broad && (e.change.broad = !0);
   const s = [], o = new Set(
@@ -5229,12 +5248,12 @@ function Xo(e, t) {
   }
   return new Map([...n].map(([i, s]) => [i, [...s.values()]]));
 }
-function Ad(e, t, n, i) {
+function kd(e, t, n, i) {
   if (!i) return !0;
   const s = e.updatedFields.get(t)?.get(Y(n));
   return !!s && i.some((o) => s.has(o));
 }
-async function kd(e, t) {
+async function Nd(e, t) {
   if (!e.explain) return [];
   const n = [], i = [
     ...t.queries,
@@ -5291,9 +5310,16 @@ const uc = {
   exact: ["NodeByPropertyScan"],
   range: ["NodeByPropertyRangeScan", "NodeByPropertyScan"],
   text: ["NodeByTextScan"],
-  point: ["NodeByPointScan"]
+  point: ["NodeByPointScan"],
+  element: ["NodeByPropertyScan"],
+  any: [
+    "NodeByPropertyScan",
+    "NodeByPropertyRangeScan",
+    "NodeByTextScan",
+    "NodeByPointScan"
+  ]
 };
-async function Nd(e, t, n = {}) {
+async function Sd(e, t, n = {}) {
   if (!e.explain)
     throw new Error(
       "the driver has no explain(); plan checks need @loradb/lora-node"
@@ -5309,7 +5335,7 @@ async function Nd(e, t, n = {}) {
       rule: "mutating-read",
       message: "a read statement has a mutating plan",
       statement: o.text
-    }), s === 0 && !Cd(r.resultColumns, t.columns) && u.push({
+    }), s === 0 && !_d(r.resultColumns, t.columns) && u.push({
       rule: "result-columns",
       message: `expected columns [${t.columns.join(", ")}], plan returns [${r.resultColumns.join(", ")}]`,
       statement: o.text
@@ -5342,10 +5368,10 @@ async function Nd(e, t, n = {}) {
   }
   return i;
 }
-const Sd = new Set(Object.values(uc).flat()), Rd = /* @__PURE__ */ new Set(["Argument", "Unwind", "Filter", "Projection"]);
-function Id(e, t) {
+const Rd = new Set(Object.values(uc).flat()), Id = /* @__PURE__ */ new Set(["Argument", "Unwind", "Filter", "Projection"]);
+function Dd(e, t) {
   return Wn(t.tree).filter((n) => n.operator === "Expand").flatMap((n) => {
-    const i = Dd(n);
+    const i = Od(n);
     return i ? [
       {
         rule: "scan-expand",
@@ -5355,21 +5381,21 @@ function Id(e, t) {
     ] : [];
   });
 }
-function Dd(e) {
+function Od(e) {
   for (let t = e.children[0]; t; t = t.children[0]) {
-    if (Sd.has(t.operator)) return;
-    if (t.operator === "NodeByLabelScan" || t.operator === "NodeScan" && Wn(t).slice(1).every((n) => Rd.has(n.operator)))
+    if (Rd.has(t.operator)) return;
+    if (t.operator === "NodeByLabelScan" || t.operator === "NodeScan" && Wn(t).slice(1).every((n) => Id.has(n.operator)))
       return t;
   }
 }
-async function Od(e, t, n = {}) {
+async function Cd(e, t, n = {}) {
   if (!e.explain)
     throw new Error(
       "the driver has no explain(); plan checks need @loradb/lora-node"
     );
   const i = [];
   for (const s of t) {
-    const o = await e.explain(s), r = Wn(o.tree), a = Id(s, o), c = r.filter((u) => u.operator.endsWith("Scan") && u.estimatedRows !== null).map((u) => u.estimatedRows), l = c.length > 0 ? Math.max(...c) : null;
+    const o = await e.explain(s), r = Wn(o.tree), a = Dd(s, o), c = r.filter((u) => u.operator.endsWith("Scan") && u.estimatedRows !== null).map((u) => u.estimatedRows), l = c.length > 0 ? Math.max(...c) : null;
     n.rowBudget !== void 0 && l !== null && l > n.rowBudget && a.push({
       rule: "row-budget",
       message: `the engine estimates ${l} rows scanned; the budget is ${n.rowBudget}`,
@@ -5392,18 +5418,18 @@ function dc(e) {
   const t = e.operator === "CallSubquery" ? e.children.slice(0, 1) : e.children;
   return [e, ...t.flatMap(dc)];
 }
-function Cd(e, t) {
+function _d(e, t) {
   return e.length === t.length && e.every((n, i) => n === t[i]);
 }
-const _d = /* @__PURE__ */ new Set([
+const Md = /* @__PURE__ */ new Set([
   "EQ",
   "IN",
   "GT",
   "GTE",
   "LT",
   "LTE"
-]), Jo = (e, t) => e.settableOn[t], Md = (e) => e.constraints !== void 0 && Object.keys(e.constraints).some((t) => t !== "normalize");
-function Ud(e, t = {}) {
+]), Jo = (e, t) => e.settableOn[t], Ud = (e) => e.constraints !== void 0 && Object.keys(e.constraints).some((t) => t !== "normalize");
+function jd(e, t = {}) {
   const n = [];
   for (const i of e.mutations)
     i.writes && !i.reports && n.push({
@@ -5427,11 +5453,11 @@ function Ud(e, t = {}) {
         type: i.name,
         field: s.name,
         message: "@unique on text a client supplies, without @normalize: 'Ada@x.com', 'ada@x.com' and 'ada@x.com ' are three values. Add @normalize(trim: true, case: LOWER) if they should be one"
-      }), s.key && s.generate && Md(s) && n.push({
+      }), s.key && s.generate && Ud(s) && n.push({
         type: i.name,
         field: s.name,
         message: "validation rules on a @key(generate: true) apply only to a key the client supplies; a generated UUID is stored as it is"
-      }), (s.type === "Boolean" || s.type === "Enum") && !s.list && !s.unique && !s.key && s.indexes.length === 0 && (Yr(e, i, s) || [...s.filters].some((o) => _d.has(o))) && n.push({
+      }), (s.type === "Boolean" || s.type === "Enum") && !s.list && !s.unique && !s.key && s.indexes.length === 0 && (Yr(e, i, s) || [...s.filters].some((o) => Md.has(o))) && n.push({
         type: i.name,
         field: s.name,
         message: `an index is inferred for this ${s.type === "Boolean" ? "Boolean" : `enum (${s.enumName ?? "Enum"})`}, which has few distinct values: a filter on it alone still reads a large share of the label. It helps next to a selective filter, not instead of one`
@@ -5447,7 +5473,7 @@ function Ud(e, t = {}) {
   }
   return n;
 }
-function jd(e) {
+function Ld(e) {
   const t = [];
   for (const n of e.nodes.values()) {
     const i = (o) => [
@@ -5480,7 +5506,7 @@ function fc(e, t, n = !1) {
     return i;
   }
 }
-function Ld(e, t) {
+function Pd(e, t) {
   const n = Ws(e);
   if (n)
     return n.filter.length > 0 && t(
@@ -5515,7 +5541,7 @@ function Ws(e) {
     } : {}
   };
 }
-const Pd = /* @__PURE__ */ new Set([
+const xd = /* @__PURE__ */ new Set([
   "READ",
   "CREATE",
   "UPDATE"
@@ -5545,7 +5571,7 @@ function Yo(e) {
   );
 }
 const tn = (e) => [...e.operations].some((t) => Us.has(t));
-function xd(e, t, n) {
+function Fd(e, t, n) {
   const i = /* @__PURE__ */ new Map(), s = e.authorization;
   if (!s) return i;
   const o = s.validate.filter(tn), r = s.validate.filter((a) => !tn(a));
@@ -5557,7 +5583,7 @@ function xd(e, t, n) {
   }
   return i;
 }
-const qe = (e) => typeof e == "object" && e !== null && !Array.isArray(e), ft = (e, t) => e.model?.nodes.get(t.name) ?? t, ts = (e, t, n) => ft(e, t).fields.get(n.name) ?? n, Fd = (e, t, n) => e.model?.relationshipProperties.get(t.name)?.fields.get(n.name) ?? n;
+const qe = (e) => typeof e == "object" && e !== null && !Array.isArray(e), ft = (e, t) => e.model?.nodes.get(t.name) ?? t, ts = (e, t, n) => ft(e, t).fields.get(n.name) ?? n, zd = (e, t, n) => e.model?.relationshipProperties.get(t.name)?.fields.get(n.name) ?? n;
 function pc(e) {
   const t = e.viewer?.claim ?? "sub", n = bs(e, { [t]: "someone" }), i = /* @__PURE__ */ new Map(), s = (c) => {
     if (Array.isArray(c)) return c.forEach(s);
@@ -5592,7 +5618,7 @@ function pc(e) {
     for (const l of c.fields.values()) s(r(l.authorization));
   for (const c of [...e.queries, ...e.mutations])
     s(r(c.authorization)), s(o(c.authenticationJwt));
-  const a = zd(e);
+  const a = Bd(e);
   return [
     { name: "anonymous", jwt: void 0 },
     { name: "authenticated", jwt: n },
@@ -5606,7 +5632,7 @@ function pc(e) {
     }))
   ];
 }
-function zd(e) {
+function Bd(e) {
   const t = e.viewer;
   if (!t) return;
   let n = !1;
@@ -5704,7 +5730,7 @@ function hc(e, t) {
     return Hs(s, n);
   }
 }
-const Bd = ["READ", "CREATE", "UPDATE"];
+const qd = ["READ", "CREATE", "UPDATE"];
 function Zo(e, t) {
   return (e.authentication?.has(t) ?? !1) || (e.authorization?.validate.some((n) => n.operations.has(t)) ?? !1);
 }
@@ -5716,7 +5742,7 @@ function mc(e, t) {
     )
   ];
 }
-function qd(e, t, n, i) {
+function Wd(e, t, n, i) {
   const s = mc(n, i);
   try {
     return be(e, t.name, n, i), n.authorization?.validate.some((r) => r.operations.has(i)) && Ue(e, t) ? { verdict: "allowed", by: ["bypass"] } : Le(e, t, n, "n", i, "BEFORE") ?? Le(e, t, n, "n", i, "AFTER") ? { verdict: "validated", by: s } : { verdict: "allowed", by: s };
@@ -5724,7 +5750,7 @@ function qd(e, t, n, i) {
     return Hs(o, s);
   }
 }
-function Wd(e, t, n) {
+function Hd(e, t, n) {
   const i = mc(t, n);
   if (t.authorization?.validate.some((r) => r.operations.has(n)) && Ue(e, void 0) && !t.authentication?.has(n))
     return { verdict: "allowed", by: ["bypass"] };
@@ -5732,14 +5758,14 @@ function Wd(e, t, n) {
   return { verdict: s === "allowed" ? "allowed" : s === "unauthenticated" ? "unauthenticated" : s === "forbidden" ? "denied" : "validated", by: i };
 }
 function nn(e, t, n) {
-  const i = Hd(e, t, n);
+  const i = Vd(e, t, n);
   if (n !== "CREATE" || !t.key.keyScope || !e.model.viewer || i.verdict === "denied" || i.verdict === "unauthenticated" || Ue(e, t))
     return i;
   const s = [...i.by.filter((o) => o !== "no rule"), "key scope"];
   return { verdict: e.jwt ? "validated" : "unauthenticated", by: s };
 }
-function Hd(e, t, n) {
-  const i = Gd(t, n);
+function Vd(e, t, n) {
+  const i = Qd(t, n);
   try {
     if (me(e, t, n), Ue(e, t)) return { verdict: "allowed", by: ["bypass"] };
     const s = n === "CREATE" ? void 0 : ce(e, t, "n", n);
@@ -5750,7 +5776,7 @@ function Hd(e, t, n) {
     return Hs(s, i);
   }
 }
-function Vd(e, t, n) {
+function Gd(e, t, n) {
   const i = [
     ...n.authentication?.has("READ") ? ["@authentication"] : [],
     ...(n.authorization?.validate ?? []).flatMap(
@@ -5785,7 +5811,7 @@ function yc(e, t, n, i) {
     return Hs(a, r);
   }
 }
-function Gd(e, t) {
+function Qd(e, t) {
   return [
     ...e.authentication?.has(t) ? ["@authentication"] : [],
     ...(e.authorization?.filter ?? []).flatMap(
@@ -5807,7 +5833,7 @@ function Hs(e, t) {
   throw e;
 }
 const wc = (e) => P(e) === "false";
-function Qd(e, t) {
+function Kd(e, t) {
   const n = [], i = e.viewer?.claim ?? "sub", s = nt(
     { schema: t, fragments: {}, variables: {} },
     e,
@@ -5835,10 +5861,10 @@ function Qd(e, t) {
         });
   }
   return n.push(
-    ...Kd(e),
-    ...Zd(e, s),
+    ...Xd(e),
     ...ef(e, s),
-    ...tf(
+    ...tf(e, s),
+    ...nf(
       e,
       () => nt({ schema: t, fragments: {}, variables: {} }, e, {
         jwt: bs(e, { [i]: "someone" })
@@ -5846,7 +5872,7 @@ function Qd(e, t) {
     )
   ), n;
 }
-function Kd(e) {
+function Xd(e) {
   if (!e.bypass) return [];
   const t = [];
   for (const s of e.nodes.values()) {
@@ -5901,25 +5927,25 @@ function ki(e, t, n, i) {
       }
       const r = t.fields.has(s) ? s : s.replace(/(Connection|Aggregate|Exists)$/, ""), a = t.fields.get(r);
       if (!a || a.kind !== "scalar" && a.kind !== "relationship") continue;
-      const c = a.kind === "relationship" && s === r && Xd(o, n.nodes.get(a.target));
+      const c = a.kind === "relationship" && s === r && Jd(o, n.nodes.get(a.target));
       i.set(r, { pinned: (i.get(r)?.pinned ?? !0) && c });
     }
 }
-function Xd(e, t) {
+function Jd(e, t) {
   if (!t || !Fe(e)) return !1;
   const n = Object.keys(e);
   if (n.length !== 1) return !1;
   const i = t.fields.get(n[0]), s = e[n[0]];
   return i?.kind === "scalar" && (i.key || i.unique) && !i.list && Fe(s) && Object.keys(s).length === 1 && typeof s.eq == "string" && s.eq.startsWith("$");
 }
-const Jd = ["CONNECT", "DISCONNECT", "CREATE"];
+const Yd = ["CONNECT", "DISCONNECT", "CREATE"];
 function vc(e, t) {
-  return t.kind !== "relationship" || t.list || !e.mutations.has("UPDATE") || !t.settableOn.update ? [] : Jd.filter((n) => t.nestedOperations.has(n));
+  return t.kind !== "relationship" || t.list || !e.mutations.has("UPDATE") || !t.settableOn.update ? [] : Yd.filter((n) => t.nestedOperations.has(n));
 }
-function Yd(e, t) {
+function Zd(e, t) {
   return t.kind === "scalar" ? e.mutations.has("UPDATE") && t.settableOn.update && !t.readonly : vc(e, t).length > 0;
 }
-function Zd(e, t) {
+function ef(e, t) {
   const n = [];
   for (const i of e.nodes.values()) {
     if (!i.mutations.has("UPDATE")) continue;
@@ -5965,7 +5991,7 @@ function Zd(e, t) {
     });
     for (const [u, d] of l) {
       const f = i.fields.get(u);
-      c.has(u) || !Yd(i, f) || f.authorization?.validate.some((p) => p.operations.has("UPDATE")) || f.kind !== "relationship" || f.list || n.push({
+      c.has(u) || !Zd(i, f) || f.authorization?.validate.some((p) => p.operations.has("UPDATE")) || f.kind !== "relationship" || f.list || n.push({
         type: i.name,
         field: u,
         message: `${d.join(", ")} ${d.length === 1 ? "tests" : "test"} ${u} on CREATE, but UPDATE can re-point it and no UPDATE rule tests it: a caller can create the ${i.name} as the rule demands, then change ${u}; declare ${u} @settable(onCreate: true, onUpdate: false), or add an UPDATE rule that tests it`
@@ -5974,7 +6000,7 @@ function Zd(e, t) {
   }
   return n;
 }
-function ef(e, t) {
+function tf(e, t) {
   const n = [], i = (o, r) => {
     const a = o.fields.get(r);
     return a?.kind === "scalar" && (a.authorization?.mask?.length ?? 0) > 0 && !zs(t, o, a);
@@ -6015,7 +6041,7 @@ function ef(e, t) {
   }
   return n;
 }
-function tf(e, t) {
+function nf(e, t) {
   const n = [], i = e.viewer?.claim ?? "sub", s = (o, r) => {
     const { verdict: a } = nn(t(), o, r);
     return a === "denied" || a === "unauthenticated";
@@ -6047,7 +6073,7 @@ function tf(e, t) {
   }
   return n;
 }
-const nf = ["CREATE", "UPDATE", "DELETE"], sf = ["CONNECT", "DISCONNECT", "UPDATE_EDGE"];
+const sf = ["CREATE", "UPDATE", "DELETE"], of = ["CONNECT", "DISCONNECT", "UPDATE_EDGE"];
 function er(e, t, n) {
   const i = [], s = t ? { type: e.name, field: t.name } : { type: e.name }, o = [
     ...(n?.filter ?? []).map((a, c) => ({
@@ -6061,7 +6087,7 @@ function er(e, t, n) {
   ], r = "set @authorizationDefaults(requireAuthentication: false) if anonymous callers should get such";
   for (const { r: a, label: c } of o) {
     if (a.requireAuthenticationDefaulted) {
-      const d = af(a.where);
+      const d = cf(a.where);
       d !== void 0 ? i.push({
         ...s,
         message: `${c} has a branch that needs no claims (${d}), but requireAuthentication defaults to true, so anonymous callers are refused by the whole rule; ${r} branches, or true to say they should not`
@@ -6072,11 +6098,11 @@ function er(e, t, n) {
       continue;
     }
     if (a.requireAuthentication) continue;
-    const l = (t?.kind === "relationship" ? sf : nf).filter(
-      (d) => a.operations.has(d) && !n?.public?.has(d) && !e.authorization?.public?.has(d) && !rf(e, t, d)
+    const l = (t?.kind === "relationship" ? of : sf).filter(
+      (d) => a.operations.has(d) && !n?.public?.has(d) && !e.authorization?.public?.has(d) && !af(e, t, d)
     );
     if (l.length === 0) continue;
-    const u = l.map(of).join(", ");
+    const u = l.map(rf).join(", ");
     i.push({
       ...s,
       message: `${c} lets a signed-out caller ${l.join(", ")}: it needs no claims and requireAuthentication is false for the whole schema; test { jwt: { sub: { exists: true } } } beside it, or add @authentication(operations: [${u}])${t ? "" : ` to ${e.name}`}`
@@ -6084,14 +6110,14 @@ function er(e, t, n) {
   }
   return i;
 }
-const of = (e) => e === "CONNECT" ? "CREATE_RELATIONSHIP" : e === "DISCONNECT" ? "DELETE_RELATIONSHIP" : e === "UPDATE_EDGE" ? "UPDATE" : e;
-function rf(e, t, n) {
+const rf = (e) => e === "CONNECT" ? "CREATE_RELATIONSHIP" : e === "DISCONNECT" ? "DELETE_RELATIONSHIP" : e === "UPDATE_EDGE" ? "UPDATE" : e;
+function af(e, t, n) {
   const i = (r) => (e.authentication?.has(r) ?? !1) || t?.kind !== "custom" && (t?.authentication?.has(r) ?? !1);
   if (t?.kind !== "relationship") return i(n);
   const s = n === "CONNECT" ? "CREATE_RELATIONSHIP" : n === "DISCONNECT" ? "DELETE_RELATIONSHIP" : void 0;
   return s && i(s) ? !0 : (n === "CONNECT" ? ["CREATE", "UPDATE"] : ["UPDATE"]).every(i);
 }
-function af(e) {
+function cf(e) {
   const t = e.OR;
   if (!Array.isArray(t)) return;
   const n = t.findIndex((i) => !Ni(i));
@@ -6129,10 +6155,10 @@ const ue = {
 function $s(e) {
   return e.required && !e.defaultValue && !e.timestamp?.has("CREATE") && !e.populatedBy?.operations.has("CREATE") && !(e.key && e.generate);
 }
-function cf(e) {
+function lf(e) {
   return !Se(e, "UPDATE") || e.vector ? !1 : e.list ? e.type !== "Point" && e.type !== "CartesianPoint" : e.type === "Int" || e.type === "Float" || e.type === "BigInt";
 }
-function lf(e, t) {
+function uf(e, t) {
   const { model: n } = e, i = /* @__PURE__ */ new Map(), s = (b, A, O) => {
     let T = i.get(b);
     return T || (T = new Ae({ name: b, fields: A, description: O }), i.set(b, T)), T;
@@ -6372,7 +6398,7 @@ function lf(e, t) {
     }
     return T;
   }, k = (b) => {
-    const A = E(b).filter(cf);
+    const A = E(b).filter(lf);
     if (A.length !== 0)
       return s(
         ue.adjustInput(b.name),
@@ -6470,7 +6496,7 @@ function tr(e) {
   for (const n of e) t = Math.min(t, ti.indexOf(n));
   return ti[t];
 }
-function uf(e) {
+function df(e) {
   const t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), s = (r) => ({
     kind: "node",
     node: r,
@@ -6555,11 +6581,11 @@ function Si(e, t, n, i, s) {
         Fe(m) && (Fe(m.edge) && a("UPDATE_EDGE"), Fe(m.node) && (s.push({ kind: "type", node: h, op: "UPDATE" }), Si(e, h, m.node, !0, s)));
     }
 }
-function df(e, t, n, i, s = {}) {
+function ff(e, t, n, i, s = {}) {
   const o = pc(e), r = (u) => nt({ schema: t, fragments: {}, variables: {} }, u.model ?? e, {
     jwt: u.jwt,
     unknownContext: !0
-  }), a = uf(e)[n.operation], c = [];
+  }), a = df(e)[n.operation], c = [];
   for (const u of Ri(n.selectionSet, i)) {
     const d = u.name.value;
     if (d === "__typename") continue;
@@ -6657,7 +6683,7 @@ function Ri(e, t, n = /* @__PURE__ */ new Set()) {
     }
   return i;
 }
-function ff(e, t) {
+function pf(e, t) {
   const n = pc(e), i = [], s = (o) => nt({ schema: t, fragments: {}, variables: {} }, o.model ?? e, {
     jwt: o.jwt,
     unknownContext: !0
@@ -6709,7 +6735,7 @@ function ff(e, t) {
             field: a.name,
             operation: "READ",
             principal: l.name,
-            ...Vd(s(l), ft(l, o), ts(l, o, a))
+            ...Gd(s(l), ft(l, o), ts(l, o, a))
           });
       if (a.kind === "scalar") {
         for (const l of ["CREATE", "UPDATE"])
@@ -6720,7 +6746,7 @@ function ff(e, t) {
                 field: a.name,
                 operation: l,
                 principal: u.name,
-                ...qd(
+                ...Wd(
                   s(u),
                   ft(u, o),
                   ts(u, o, a),
@@ -6732,7 +6758,7 @@ function ff(e, t) {
   }
   for (const o of [...e.relationshipProperties.values()].sort(bt))
     for (const r of [...o.fields.values()].sort(bt))
-      for (const a of Bd)
+      for (const a of qd)
         if (Zo(r, a))
           for (const c of n)
             i.push({
@@ -6740,7 +6766,7 @@ function ff(e, t) {
               field: r.name,
               operation: a,
               principal: c.name,
-              ...Wd(s(c), Fd(c, o, r), a)
+              ...Hd(s(c), zd(c, o, r), a)
             });
   for (const o of [
     ...[...e.queries].sort(bt),
@@ -6757,7 +6783,7 @@ function ff(e, t) {
   return i;
 }
 const bt = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : 0;
-async function pf(e, t, n = {}) {
+async function hf(e, t, n = {}) {
   const i = n.sample ?? 1e3, s = { nodes: {}, degrees: {} };
   for (const o of t.nodes.values()) {
     const r = R(o.labels[0]), a = [
@@ -6787,13 +6813,13 @@ async function pf(e, t, n = {}) {
     s.nodes[o.name] = Number(l.rows[0]?.c ?? 0), c.forEach((d, f) => {
       const p = u[2 * f].rows.map((g) => Number(g.d)).sort(
         (g, y) => g - y
-      ), h = hf(p), m = Number(u[2 * f + 1].rows[0]?.m ?? 0);
+      ), h = mf(p), m = Number(u[2 * f + 1].rows[0]?.m ?? 0);
       h.max = Math.max(h.max, m), s.degrees[`${o.name}.${d.name}`] = h;
     });
   }
   return s;
 }
-function hf(e) {
+function mf(e) {
   const t = (n) => e.length === 0 ? 0 : e[Math.min(e.length - 1, Math.floor(n * e.length))];
   return {
     sampled: e.length,
@@ -6803,8 +6829,8 @@ function hf(e) {
     max: e.length === 0 ? 0 : e[e.length - 1]
   };
 }
-const mf = 16, $c = 4096, Tc = 64 * 1024 * 1024, gf = 16 * 1024, yf = 1024;
-class Ef {
+const gf = 16, $c = 4096, Tc = 64 * 1024 * 1024, yf = 16 * 1024, Ef = 1024;
+class wf {
   #e = /* @__PURE__ */ new WeakMap();
   /**
    * Every live entry, oldest first, with its field's entry list, for the
@@ -6844,9 +6870,9 @@ class Ef {
    */
   get(t, n) {
     const i = t.fieldNodes[0], s = t.rebindable ?? [], o = this.#d(t)?.once, r = o && !this.#o.has(i) && s.every(
-      (E) => o.has(E) && vf(t.variables?.[E])
+      (E) => o.has(E) && bf(t.variables?.[E])
     ) ? s : [], a = this.#f(t, r);
-    if (a === void 0 || a.length > gf)
+    if (a === void 0 || a.length > yf)
       return n(t.jwt).compiled;
     const c = !!t.jwt, l = r.join("\0"), u = this.#e.get(i) ?? [];
     for (const E of u)
@@ -6876,11 +6902,11 @@ class Ef {
       slotPaths: [...new Set(h.map((E) => E.path))],
       contextReads: f.contextReads,
       compiled: d.template,
-      bytes: wf(a, g, p)
+      bytes: vf(a, g, p)
     };
     if (y.bytes > this.#r) return p;
     this.#e.has(i) || (this.#e.set(i, u), this.#s?.register(i, u)), u.unshift(y), this.#t.set(y, u), this.#c += y.bytes;
-    for (const E of u.splice(mf))
+    for (const E of u.splice(gf))
       this.#l(E);
     for (; this.#t.size > this.#a || this.#c > this.#r; ) {
       const [E, v] = this.#t.entries().next().value;
@@ -6935,7 +6961,7 @@ class Ef {
         const y = r();
         return c && this.#n.set(t, []), i.length > 0 && this.#o.add(t), y;
       }
-      const m = c ? $f(h, a, d) : [], g = i.length > 0 ? bf(h, i, p) : [];
+      const m = c ? Tf(h, a, d) : [], g = i.length > 0 ? $f(h, i, p) : [];
       if (m && g) {
         const y = { compiled: h.compiled, slots: m, variableSlots: g };
         return {
@@ -6970,14 +6996,14 @@ class Ef {
   #d(t) {
     const n = t.fieldNodes[0];
     let i = this.#i.get(n);
-    return i === void 0 && (i = Tf(t.fieldNodes, t.fragments), this.#i.set(n, i)), i;
+    return i === void 0 && (i = Af(t.fieldNodes, t.fragments), this.#i.set(n, i)), i;
   }
 }
-function wf(e, t, n) {
+function vf(e, t, n) {
   let i = 2 * e.length;
   for (const [s, o] of t) i += s.length + o.length;
   for (const s of n.statements) i += s.text.length;
-  return 2 * i + yf;
+  return 2 * i + Ef;
 }
 function ni(e) {
   return typeof e == "string" && e.length > 0;
@@ -6986,10 +7012,10 @@ function Ii(e, t) {
   return t === "" ? e : Dt(e, t);
 }
 const ns = "\0lora-claim-", Ts = "\0lora-variable-", sr = JSON.stringify(Ts).slice(1, -1), Ac = Number.MIN_SAFE_INTEGER + 1024;
-function vf(e) {
+function bf(e) {
   return typeof e == "string" && e.length > 0 && !e.includes("\0") || typeof e == "number" && Number.isSafeInteger(e) && e > Ac;
 }
-function bf(e, t, n) {
+function $f(e, t, n) {
   const i = [], s = e.compiled.statements;
   for (let o = 0; o < s.length; o++) {
     const { text: r, params: a } = s[o];
@@ -7011,7 +7037,7 @@ function bf(e, t, n) {
   }
   return t.every((o) => i.some((r) => r.name === o)) ? i : void 0;
 }
-function $f(e, t, n) {
+function Tf(e, t, n) {
   for (const o of t)
     if (!e.ctx.claimReads.get(o)?.bound) return;
   const i = [], s = e.compiled.statements;
@@ -7050,7 +7076,7 @@ function ir(e, t, n) {
     o(r.statement, r.param, n?.[r.name]);
   return { ...e.compiled, statements: i };
 }
-function Tf(e, t) {
+function Af(e, t) {
   const n = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Set();
   let s = !0;
   const o = (r) => {
@@ -7105,25 +7131,25 @@ function kn(e, t, n, i, s) {
   const o = Ce(s);
   switch (t) {
     case "list":
-      return kf(e, n, i, o);
-    case "single":
       return Nf(e, n, i, o);
-    case "connection":
+    case "single":
       return Sf(e, n, i, o);
+    case "connection":
+      return Rf(e, n, i, o);
     case "aggregate":
-      return Zu(e, n, i, o);
-    case "grouped":
       return ed(e, n, i, o);
+    case "grouped":
+      return td(e, n, i, o);
   }
 }
-function Af(e, t, n) {
+function kf(e, t, n) {
   if (e !== "single" || n.length !== 1) return;
   const i = n[0].arguments?.find(
     (s) => s.name.value === t.key.name
   )?.value;
   return i?.kind === fe.VARIABLE ? [i.name.value] : void 0;
 }
-function kf(e, t, n, i) {
+function Nf(e, t, n, i) {
   const s = Ot(n.limit, t.limit, "limit"), o = qs(e, t, n.sort, !1), r = n.where, a = Un(e, t, r, o);
   e.cost += zt(e, t, r, s);
   const c = Ze(e, t, "this", i, s), l = [
@@ -7148,7 +7174,7 @@ function kf(e, t, n, i) {
     a.expectation
   );
 }
-function Nf(e, t, n, i) {
+function Sf(e, t, n, i) {
   me(e, t, "READ");
   const s = t.labels[0];
   e.reads.labels.add(s);
@@ -7181,7 +7207,7 @@ function Nf(e, t, n, i) {
     }
   ) && c.reads.relationships.length === 0 && c.statements.length === 1 && (c.bounded = !0), c;
 }
-function Sf(e, t, n, i) {
+function Rf(e, t, n, i) {
   const { first: s, sort: o, signature: r, cursor: a, backward: c } = Ia(
     e,
     t,
@@ -7281,7 +7307,7 @@ function Sf(e, t, n, i) {
       if (f.aggregate) {
         I = { count: D?.totalCount ?? 0 };
         for (const { column: k, path: C } of E)
-          Rf(I, C, D?.[k] ?? null);
+          If(I, C, D?.[k] ?? null);
       }
       return {
         __rows: ($?.rows ?? []).map((k) => ({
@@ -7298,18 +7324,18 @@ function Sf(e, t, n, i) {
     }
   };
 }
-function Rf(e, t, n) {
+function If(e, t, n) {
   let i = e;
   for (const s of t.slice(0, -1))
     i = i[s] ??= {};
   i[t[t.length - 1]] = n;
 }
-const If = "score:DESC,key:ASC";
+const Df = "score:DESC,key:ASC";
 function or(e, t, n, i, s, o = !1) {
   me(e, t, "READ");
   const r = t.labels[0];
   e.reads.labels.add(r);
-  const a = o ? Ot(i.first, t.limit, "first") : Ot(i.limit, t.limit, "limit"), c = o ? i.after : null, l = i.sort, u = l && l.length > 0 ? qs(e, t, l, !0) : void 0, d = u ? Da(u) : If, f = c != null ? Ta(
+  const a = o ? Ot(i.first, t.limit, "first") : Ot(i.limit, t.limit, "limit"), c = o ? i.after : null, l = i.sort, u = l && l.length > 0 ? qs(e, t, l, !0) : void 0, d = u ? Da(u) : Df, f = c != null ? Ta(
     c,
     d,
     u ? u.length : 2,
@@ -7327,7 +7353,7 @@ function or(e, t, n, i, s, o = !1) {
       $
     ), D = [];
     if (n.kind === "fulltext") {
-      const O = Df(
+      const O = Of(
         i.query,
         n.minPrefixLength
       );
@@ -7390,7 +7416,7 @@ function or(e, t, n, i, s, o = !1) {
       yields: [{ item: "node", alias: "this" }, { item: "score" }],
       where: pe(A, C, N)
     }), D;
-  }, m = o ? Of(e, t, s) : void 0;
+  }, m = o ? Cf(e, t, s) : void 0;
   if (m && !m.page)
     return rr(e, t, n, i, h, (v) => ({
       __rows: [],
@@ -7402,7 +7428,7 @@ function or(e, t, n, i, s, o = !1) {
     }));
   const g = h(e, p);
   e.cost += Nc(e, t, n, i);
-  const y = m ? m.node : Cf(e, t, s), E = Ze(e, t, "this", y, a);
+  const y = m ? m.node : _f(e, t, s), E = Ze(e, t, "this", y, a);
   if (g.push(
     {
       kind: "with",
@@ -7502,13 +7528,13 @@ function Nc(e, t, n, i) {
     ca(e, t, t.limit.default)
   ) * (1 + pt(e, t, i.where));
 }
-function Df(e, t) {
+function Of(e, t) {
   return t === void 0 || t <= 1 ? e : e.replace(
     /([\p{L}\p{N}]+)\*/gu,
     (n, i) => [...i].length < t ? i : n
   );
 }
-function Of(e, t, n) {
+function Cf(e, t, n) {
   const i = e.schema.getType(
     Z.searchConnection(t.name)
   ), s = e.schema.getType(
@@ -7523,7 +7549,7 @@ function Of(e, t, n) {
     void 0
   );
 }
-function Cf(e, t, n) {
+function _f(e, t, n) {
   const i = e.schema.getType(
     Z.match(t.name)
   ), s = [];
@@ -7535,7 +7561,7 @@ function Cf(e, t, n) {
     o[0].name.value === "node" && s.push(...Ce(o));
   return s;
 }
-function um(e) {
+function dm(e) {
   const t = typeof e.execute == "function" ? e.execute.bind(e) : void 0, n = typeof e.stream == "function" ? e.stream.bind(e) : void 0, i = {
     async run(s, o) {
       const r = o.mode === "read" && o.verified && s.length === 1 ? s[0] : void 0;
@@ -7563,7 +7589,7 @@ function um(e) {
   if (typeof e.begin == "function") {
     const s = e.begin.bind(e);
     i.begin = async (o) => {
-      const r = Qn(o), a = await Mf(
+      const r = Qn(o), a = await Uf(
         s(o.mode === "read" ? "read_only" : "read_write", r),
         r
       ), c = typeof a.executeMany == "function" ? a.executeMany.bind(a) : void 0;
@@ -7600,9 +7626,9 @@ function um(e) {
     const s = e.explain.bind(e);
     i.explain = (o) => s(o.text, o.params);
   }
-  return typeof e.changes == "function" && (i.changes = e.changes.bind(e)), i;
+  return typeof e.changes == "function" && (i.changes = e.changes.bind(e)), typeof e.snapshot == "function" && (i.snapshot = e.snapshot.bind(e)), i;
 }
-function _f(e, t, n) {
+function Mf(e, t, n) {
   const i = e?.begin?.bind(e);
   if (!i || !Number.isFinite(t)) return e;
   let s = 0;
@@ -7632,6 +7658,7 @@ function _f(e, t, n) {
     ...e.changes ? {
       changes: (c) => e.changes(c)
     } : {},
+    ...e.snapshot ? { snapshot: (c) => e.snapshot(c) } : {},
     begin: async (c) => {
       if (c.mode !== "write") return i(c);
       const l = await o(() => i(c));
@@ -7639,7 +7666,7 @@ function _f(e, t, n) {
     }
   };
 }
-function Mf(e, t) {
+function Uf(e, t) {
   const { timeoutMs: n, signal: i } = t;
   return !(n !== void 0 && n > 0) && !i ? e : new Promise((s, o) => {
     let r = !1, a;
@@ -7683,7 +7710,7 @@ function gt(e) {
     throw U("FORBIDDEN", "not allowed to read this node");
   return e;
 }
-async function Uf(e, t, n, i, s) {
+async function jf(e, t, n, i, s) {
   const o = e.transaction;
   if (!o && !e.driver.begin)
     throw U(
@@ -7753,8 +7780,8 @@ async function Uf(e, t, n, i, s) {
     throw l.isOpen && await l.rollback(), u;
   }
 }
-const jf = 2, Lf = 2;
-class Pf {
+const Lf = 2, Pf = 2;
+class xf {
   #e = new AbortController();
   #t;
   #i;
@@ -7810,7 +7837,7 @@ class Pf {
     );
   }
 }
-function xf(e, t) {
+function Ff(e, t) {
   if (!e) return t;
   if (e = Nn(e), t = Nn(t), typeof AbortSignal.any == "function")
     try {
@@ -7881,7 +7908,7 @@ function Ic(e, t, n, i) {
     { type: e.name, field: t.name }
   );
 }
-function Ff(e, t) {
+function zf(e, t) {
   const n = t.code, i = t instanceof Error ? t.message : String(t);
   if (n !== "LORA_UNIQUE_CONSTRAINT" && n !== "LORA_NOT_NULL_CONSTRAINT")
     return t;
@@ -7895,7 +7922,7 @@ function Ff(e, t) {
     { type: r?.name ?? s, field: a?.name ?? o }
   );
 }
-async function zf(e, t) {
+async function Bf(e, t) {
   const n = e.env.model;
   for (const { field: i, keys: s } of Cc(e, t)) {
     const o = n.nodes.get(i.owner), r = e.ctx(), a = `UNWIND ${P(B(r, s))} AS k
@@ -7913,7 +7940,7 @@ RETURN a.${R(o.key.property)} AS key, c AS count, ${Oc(e, r, i)} AS seen`, c = a
     }
   }
 }
-function Bf(e, t) {
+function qf(e, t) {
   const n = e.env.model;
   for (const { field: i, keys: s } of Cc(e, t))
     e.inPlace(() => {
@@ -8040,7 +8067,7 @@ function _c(e, t) {
   return Promise.all(n).then(() => {
   });
 }
-async function qf(e) {
+async function Wf(e) {
   const t = e.env.model, n = /* @__PURE__ */ new Map();
   for (const i of e.disconnected) {
     const [s, o] = i.field.split("."), r = t.nodes.get(s).fields.get(o), a = Ye(t, r).find((c) => c.target === i.to.type) ?? r;
@@ -8163,7 +8190,7 @@ RETURN DISTINCT o.${R(p.key.property)} AS key, ${ys(m, p, "o")} AS visible`,
       keys: [...u.values()]
     })),
     (l) => Lt(e.env, e.tx, l)
-  ), await vd(
+  ), await bd(
     e,
     [...s].map(([l, u]) => ({
       node: l,
@@ -8172,7 +8199,7 @@ RETURN DISTINCT o.${R(p.key.property)} AS key, ${ys(m, p, "o")} AS visible`,
   );
   const c = /* @__PURE__ */ new Set();
   for (const [l, u] of s) {
-    const { refs: d, ids: f } = await Wf(e, l, [
+    const { refs: d, ids: f } = await Hf(e, l, [
       ...u.values()
     ]);
     e.disconnected.push(...d);
@@ -8206,7 +8233,7 @@ DETACH DELETE n`,
   }
   e.info.relationshipsDeleted += c.size;
 }
-async function Wf(e, t, n) {
+async function Hf(e, t, n) {
   const i = e.env.model, s = [...t.fields.values()].flatMap(
     (d) => d.kind === "relationship" ? Ye(i, d) : []
   ), o = [...i.nodes.values()].flatMap(
@@ -8366,7 +8393,7 @@ class Sn {
       });
       return this.#a = !0, n;
     } catch (n) {
-      throw Hf(n);
+      throw Vf(n);
     } finally {
       this.#r = !1;
     }
@@ -8381,7 +8408,7 @@ class Sn {
     return this.#n ? this.#n.isOpen : this.#r;
   }
 }
-function Hf(e) {
+function Vf(e) {
   if (e instanceof Error && / \(statement \d+ of \d+\)$/.test(e.message))
     try {
       e.message = e.message.replace(/ \(statement \d+ of \d+\)$/, "");
@@ -8390,7 +8417,7 @@ function Hf(e) {
   return e;
 }
 const ii = /* @__PURE__ */ new WeakMap();
-function Vf(e) {
+function Gf(e) {
   let t = ii.get(e);
   return t || (t = e.run([{ text: "RETURN assert(true) AS ok", params: {} }], {
     mode: "read",
@@ -8404,7 +8431,7 @@ function Vf(e) {
   ), ii.set(e, t)), t;
 }
 const ur = /* @__PURE__ */ new WeakMap();
-function Gf(e) {
+function Qf(e) {
   let t = ur.get(e);
   if (t === void 0) {
     const n = (i) => !!i?.validate.some((s) => s.operations.has("READ"));
@@ -8415,7 +8442,7 @@ function Gf(e) {
   return t;
 }
 const Mc = Symbol("lora-graphql: no node to update");
-function Qf(e) {
+function Kf(e) {
   const t = e.model, n = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
   for (const { rel: s, from: o, to: r, refused: a } of e.links) {
     if (a) return !1;
@@ -8436,7 +8463,7 @@ const Uc = "lora-graphql:";
 function ss(e, t, n) {
   return `${Uc}${e}:${t}:${n}`;
 }
-function Kf(e, t) {
+function Xf(e, t) {
   const n = t instanceof Error ? t.message : String(t), i = /assertion failed: lora-graphql:(forbidden|hidden|taken):([^:\s]+):([^\s(]+)/.exec(
     n
   );
@@ -8452,7 +8479,7 @@ function Kf(e, t) {
     s === "hidden" ? "CREATE" : r
   ) : t;
 }
-class Xf {
+class Jf {
   #e = [];
   /**
    * The message, a Cypher expression, of an assertion that stands for
@@ -8487,7 +8514,7 @@ function jc(e) {
   }
   return n;
 }
-function Jf(e, t) {
+function Yf(e, t) {
   e.linking();
   const n = (i) => {
     i && e.defer(e.run(i.text, i.ctx));
@@ -8599,7 +8626,7 @@ function Oi(e, t, n, i, s) {
   );
   return { text: `UNWIND ${c} AS row
 MATCH (a:${R(o.labels[0])}) WHERE a.${R(o.key.property)} = row.from` + ke(ce(a, o, "a", "CREATE_RELATIONSHIP")) + `
-MATCH (b:${R(r.labels[0])}) WHERE b.${R(r.key.property)} = row.to` + ke(gd(ce(a, r, "b", "READ"))) + ke(ce(a, r, "b", "CREATE_RELATIONSHIP")) + (typeof s == "string" ? "" : `
+MATCH (b:${R(r.labels[0])}) WHERE b.${R(r.key.property)} = row.to` + ke(yd(ce(a, r, "b", "READ"))) + ke(ce(a, r, "b", "CREATE_RELATIONSHIP")) + (typeof s == "string" ? "" : `
 WITH a, b, row, size([(a)${Je(n, "", "b", void 0)} | 1]) > 0 AS existed`) + `
 MERGE (a)${Je(n, "r", "b", void 0)}
 ON CREATE SET ${u.join(", ")}
@@ -8607,7 +8634,7 @@ ON CREATE SET ${u.join(", ")}
 ` : "") + `SET r += row.props
 ` + (typeof s == "function" ? s(a) : s ?? "RETURN row.from AS from, row.to AS key, existed"), ctx: a };
 }
-async function Yf(e, t) {
+async function Zf(e, t) {
   for (const [n, i] of jc(t)) {
     const s = e.env.model.nodes.get(n.owner), o = e.env.model.nodes.get(n.target), r = i.map((f) => ({ from: f.from, to: f.to }));
     await ks(
@@ -8687,7 +8714,7 @@ RETURN ${e.single ? `assert(${c}, ${e.assertions.failsAs(() => uo(t, n))})` : c}
     ctx: s
   };
 }
-function Zf(e, t, n, i) {
+function ep(e, t, n, i) {
   return [e, t].some(
     (s) => s.authorization?.validate.some(
       (o) => o.operations.has(n) && o.when.has(i)
@@ -8716,7 +8743,7 @@ RETURN ${l(a, n)} AS a, ${l(c, i)} AS b`,
   };
 }
 const wt = (e) => e == null ? [] : Array.isArray(e) ? e : [e];
-class ep {
+class tp {
   constructor(t, n) {
     this.env = t, this.ctx = n;
   }
@@ -8999,7 +9026,7 @@ function fr(e, t, n, i) {
     `not allowed to ${n.toLowerCase()} ${e}.${t.name}`
   );
 }
-const tp = {
+const np = {
   Date: "date",
   Time: "time",
   LocalTime: "localtime",
@@ -9008,7 +9035,7 @@ const tp = {
   Duration: "duration"
 };
 function xc(e) {
-  const t = e.defaultValue.value, n = tp[e.type];
+  const t = e.defaultValue.value, n = np[e.type];
   if (!n) return t;
   const i = (s) => ({ kind: n, iso: s });
   return Array.isArray(t) ? t.map(i) : i(t);
@@ -9029,7 +9056,7 @@ function pr(e) {
     }
   }
 }
-class np {
+class sp {
   constructor(t, n, i) {
     this.env = t, this.tx = n, this.change = i;
   }
@@ -9072,7 +9099,7 @@ class np {
    */
   takenUnique;
   /** What the assertions of a single call stand for. */
-  assertions = new Xf();
+  assertions = new Jf();
   /** Statements issued so far, and how many when the links began. */
   #t = 0;
   #i;
@@ -9194,12 +9221,12 @@ RETURN assert(count(n) = 0, ${P(G(ss(t, n.name, s)))}) AS ok`,
   async #r() {
     if (this.#a) return;
     if (this.#s) {
-      this.#s = !1, op(() => void this.#r());
+      this.#s = !1, rp(() => void this.#r());
       return;
     }
     const t = this.#n;
     this.#n = [];
-    const n = () => t.length > 1 && this.tx.executeMany ? this.tx.executeMany(t.map((i) => i.statement)) : ip(this.tx, t);
+    const n = () => t.length > 1 && this.tx.executeMany ? this.tx.executeMany(t.map((i) => i.statement)) : op(this.tx, t);
     try {
       const i = this.env.observe;
       let s;
@@ -9425,7 +9452,7 @@ RETURN assert(found > 0, ${this.assertions.failsAs(() => Mc)}) AS ok`,
    * each link's outcome known or told in the database.
    */
   #u(t) {
-    return t.disconnects.length === 0 && Qf(t) && t.edgeUpdates.length === 0 && t.nodeUpdates.length === 0 && t.nestedDeletes.length === 0 && this.disconnected.length === 0;
+    return t.disconnects.length === 0 && Kf(t) && t.edgeUpdates.length === 0 && t.nodeUpdates.length === 0 && t.nestedDeletes.length === 0 && this.disconnected.length === 0;
   }
   /**
    * `send()` for a statement's rows. The promise is safe to leave
@@ -9439,7 +9466,7 @@ RETURN assert(found > 0, ${this.assertions.failsAs(() => Mc)}) AS ok`,
     );
   }
   plan() {
-    return new ep(this.env, this.ctx());
+    return new tp(this.env, this.ctx());
   }
   /** Every planned write, in order, with the checks that follow them. */
   /**
@@ -9456,7 +9483,7 @@ RETURN assert(found > 0, ${this.assertions.failsAs(() => Mc)}) AS ok`,
       this.moveTakenUniques(t),
       this.applyCreates(t)
     ].map((r) => this.watch(r)), s = t.disconnects.length === 0 && t.links.length === 0 && t.edgeUpdates.length === 0 && t.nodeUpdates.length === 0 && t.nestedDeletes.length === 0 && this.disconnected.length === 0;
-    !s && this.single ? (Jf(this, t), Bf(this, t)) : s || (this.#n.length > 0 && (this.#s = !0), await this.applyDisconnects(t), await Yf(this, t), await this.applyEdgeUpdates(t), await this.applyNodeUpdates(t), await this.applyNestedDeletes(t), await zf(this, t), await qf(this));
+    !s && this.single ? (Yf(this, t), qf(this, t)) : s || (this.#n.length > 0 && (this.#s = !0), await this.applyDisconnects(t), await Zf(this, t), await this.applyEdgeUpdates(t), await this.applyNodeUpdates(t), await this.applyNestedDeletes(t), await Bf(this, t), await Wf(this));
     const o = this.watch(this.validateCreated(t));
     n?.();
     for (const r of i) await r;
@@ -9496,7 +9523,7 @@ RETURN assert(found > 0, ${this.assertions.failsAs(() => Mc)}) AS ok`,
     for (const [i, s] of t.creates) {
       const o = this.ctx(), r = ce(o, i, "n", "READ");
       if (!r) continue;
-      const a = s.map((l) => ({ key: l.key, to: sp(i) }));
+      const a = s.map((l) => ({ key: l.key, to: ip(i) }));
       this.#e.push({
         kind: "hidden",
         node: i,
@@ -9632,7 +9659,7 @@ CREATE (n:${r} { ${p.join(", ")} })`,
         const g = await this.run(`${f}RETURN ${p}`, c);
         await As(this, "DISCONNECT", i, h(g));
       }
-      if (Zf(r, a, "DELETE_RELATIONSHIP", "BEFORE")) {
+      if (ep(r, a, "DELETE_RELATIONSHIP", "BEFORE")) {
         const g = await this.run(`${f}RETURN ${p}`, c);
         await ks(
           this,
@@ -9671,7 +9698,7 @@ CREATE (n:${r} { ${p.join(", ")} })`,
         "b",
         s
       ) + (n.to !== void 0 ? ` AND b.${R(s.key.property)} = ${P(B(o, n.to))}` : "") + ke(ce(o, s, "b", "READ")) + `
-SET r += ${P(B(o, n.set))}` + md(this.env.model, n.rel) + (n.remove.length > 0 ? `
+SET r += ${P(B(o, n.set))}` + gd(this.env.model, n.rel) + (n.remove.length > 0 ? `
 REMOVE ${n.remove.map((c) => `r.${R(c)}`).join(", ")}` : "") + `
 RETURN b.${R(s.key.property)} AS key`, a = await this.run(r, o);
       if (a.length === 0) throw si(i, n.rel, s, n.to);
@@ -9945,19 +9972,19 @@ RETURN this.${R(t.key.property)} AS key ORDER BY key LIMIT ${P(B(o, s + 1))}`,
     return a.map((c) => c.key);
   }
 }
-function sp(e) {
+function ip(e) {
   if (e.key.type === "Int" || e.key.type === "BigInt") {
     const [t, n] = globalThis.crypto.getRandomValues(new Uint32Array(2));
     return -(2n ** 62n) - (BigInt(t & 1073741823) << 32n | BigInt(n));
   }
   return `\0lora-graphql:hidden:${globalThis.crypto.randomUUID()}`;
 }
-async function ip(e, t) {
+async function op(e, t) {
   const n = [];
   for (const { statement: i } of t) n.push(await e.execute(i));
   return n;
 }
-const op = typeof setImmediate == "function" ? setImmediate : (e) => setTimeout(e, 0);
+const rp = typeof setImmediate == "function" ? setImmediate : (e) => setTimeout(e, 0);
 function xe(e) {
   return e.catch(() => {
   }), e;
@@ -9967,12 +9994,12 @@ function hr(e) {
   });
   return e;
 }
-async function rp(e, t, n) {
+async function ap(e, t, n) {
   const i = e.ctx(), s = [...t.fields.values()].some(
     (m) => m.kind === "scalar" && m.populatedBy?.operations.has("UPDATE")
   ), o = /* @__PURE__ */ new Map(), r = [], a = [], c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set();
   for (const { key: m, input: g } of n) {
-    const y = s ? void 0 : ap(i, o, t, m, g);
+    const y = s ? void 0 : cp(i, o, t, m, g);
     if (!y) {
       a.push({ key: m });
       continue;
@@ -10035,7 +10062,7 @@ RETURN n.${R(t.key.property)} AS key, coalesce(${p.join(`
     )
   };
 }
-function ap(e, t, n, i, s) {
+function cp(e, t, n, i, s) {
   const o = {}, r = [], a = /* @__PURE__ */ new Map();
   try {
     for (const [c, l] of Object.entries(s)) {
@@ -10052,8 +10079,8 @@ function ap(e, t, n, i, s) {
       if (u?.kind !== "relationship") return;
       if (l == null) continue;
       let d = t.get(u);
-      if (d === void 0 && (d = cp(e, n, u), t.set(u, d)), !d) return;
-      const f = lp(e, u, l);
+      if (d === void 0 && (d = lp(e, n, u), t.set(u, d)), !d) return;
+      const f = up(e, u, l);
       if (!f) return;
       a.set(u, f);
     }
@@ -10065,7 +10092,7 @@ function ap(e, t, n, i, s) {
     row: r.length > 0 ? { key: i, set: o, remove: r } : { key: i, set: o }
   };
 }
-function cp(e, t, n) {
+function lp(e, t, n) {
   const i = e.model.nodes.get(n.target);
   if (!i || n.via) return !1;
   const s = { owner: "a", target: "b", rel: "r" }, o = [
@@ -10089,7 +10116,7 @@ function cp(e, t, n) {
   }
   return !0;
 }
-function lp(e, t, n) {
+function up(e, t, n) {
   const i = e.model, s = i.nodes.get(t.target);
   for (const [u, d] of Object.entries(n))
     if (u !== "connect" && d !== null && d !== void 0) return;
@@ -10122,7 +10149,7 @@ function Ci(e) {
   const t = e["~standard"];
   return t !== null && typeof t == "object" && typeof t.validate == "function";
 }
-class up {
+class dp {
   constructor(t, n) {
     this.model = t, this.validators = n;
   }
@@ -10149,7 +10176,7 @@ class up {
     }
   }
 }
-function dp(e, t) {
+function fp(e, t) {
   if (e !== void 0)
     return Ci(e) ? e : e[t];
 }
@@ -10167,7 +10194,7 @@ function oi(e, t, n, i) {
     for (const o of s.fields.values())
       i.field(s.name, o, t, n);
 }
-function fp(e, t, n, i) {
+function pp(e, t, n, i) {
   const { model: s } = i, o = (r) => {
     const a = t[r];
     if (a == null) return [];
@@ -10207,9 +10234,9 @@ function Ns(e, t, n, i, s) {
   const o = t;
   for (const a of e.fields.values()) {
     const c = o[a.name];
-    c != null && (a.kind === "scalar" ? s.field(e.name, a, o, n) : a.kind === "relationship" && typeof c == "object" && fp(a, c, [...n, a.name], s));
+    c != null && (a.kind === "scalar" ? s.field(e.name, a, o, n) : a.kind === "relationship" && typeof c == "object" && pp(a, c, [...n, a.name], s));
   }
-  const r = dp(s.validators[e.name], i);
+  const r = fp(s.validators[e.name], i);
   r && s.jobs.push({ schema: r, node: e, input: o, path: n });
 }
 const zc = {
@@ -10220,13 +10247,13 @@ const zc = {
   LocalDateTime: "localdatetime",
   Duration: "duration"
 }, mr = (e, t) => Array.isArray(e) ? e.map(t) : t(e);
-function pp(e) {
+function hp(e) {
   return [...e.fields.values()].filter(
     (t) => t.kind === "scalar" && t.type in zc
   );
 }
-async function hp(e, t) {
-  const { schema: n, node: i, input: s, path: o } = e, r = pp(i), a = { ...s };
+async function mp(e, t) {
+  const { schema: n, node: i, input: s, path: o } = e, r = hp(i), a = { ...s };
   for (const u of r)
     a[u.name] = mr(
       s[u.name],
@@ -10260,19 +10287,19 @@ async function hp(e, t) {
       );
   }
 }
-async function mp(e, t, n, i, s) {
-  const o = new up(e, t);
+async function gp(e, t, n, i, s) {
+  const o = new dp(e, t);
   if (n === "CREATE" || n === "UPSERT") {
     const r = n === "CREATE" ? "create" : "upsert";
     for (const [a, c] of is(s.input, ["input"]))
       Ns(i, a, c, r, o);
   } else (n === "UPDATE" || n === "UPDATE_MANY") && Ns(i, s.update, ["update"], "update", o);
   if (o.total === 0)
-    for (const r of o.jobs) await hp(r, o);
+    for (const r of o.jobs) await mp(r, o);
   if (o.total > 0)
     throw Ms("BAD_USER_INPUT", o.violations, o.total);
 }
-function gp(e, t, n, i) {
+function yp(e, t, n, i) {
   const s = [];
   for (const [, o] of Qe(
     e.selection,
@@ -10282,7 +10309,7 @@ function gp(e, t, n, i) {
     o[0].name.value === i && s.push(...Ce(o));
   return s;
 }
-function yp(e, t, n) {
+function Ep(e, t, n) {
   const i = { ...e, params: {}, vars: new Set(e.vars) };
   Re(i, t, "n", n, "BEFORE"), Re(i, t, "n", n, "AFTER");
 }
@@ -10290,7 +10317,7 @@ function Bc(e) {
   const t = e.model.viewer, n = t && e.model.nodes.get(t.type);
   return !!(t && n && t.field !== n.key.name && e.jwt && [...e.model.nodes.values()].some((i) => i.key.keyScope));
 }
-async function Ep(e, t, n) {
+async function wp(e, t, n) {
   const i = e.model.viewer, s = i && e.model.nodes.get(i.type);
   if (!Bc(e) || !i || !s) return;
   const o = rt(n, i.claim);
@@ -10302,7 +10329,7 @@ RETURN v.${R(s.key.property)} AS key LIMIT 1`,
     params: { claim: o }
   })).rows[0]?.key ?? null;
 }
-function wp(e, t, n, i) {
+function vp(e, t, n, i) {
   const s = t === "CREATE" || t === "UPDATE" ? t : void 0, o = [...n.fields.values()].filter(
     (c) => c.kind === "scalar" && !c.key && !!s && !!c.populatedBy?.operations.has(s)
   );
@@ -10332,7 +10359,7 @@ function wp(e, t, n, i) {
   }
   return a;
 }
-async function vp(e, t, n, i, s, o) {
+async function bp(e, t, n, i, s, o) {
   const r = e.transaction;
   if (!r && !e.driver.begin)
     throw U(
@@ -10348,14 +10375,14 @@ async function vp(e, t, n, i, s, o) {
     maxListFilter: e.maxListFilter,
     maxStringFilter: e.maxStringFilter
   }), c = t === "UPSERT" ? "CREATE" : t === "UPDATE_MANY" ? "UPDATE" : t === "DELETE_MANY" ? "DELETE" : t;
-  me(a, n, c), t !== "UPSERT" && yp(a, n, c), await mp(e.model, e.validators ?? {}, t, n, i), t === "UPDATE" && !i.update && (i = { ...i, update: {} }), e = { ...e, computed: wp(e, t, n, i) };
+  me(a, n, c), t !== "UPSERT" && Ep(a, n, c), await gp(e.model, e.validators ?? {}, t, n, i), t === "UPDATE" && !i.update && (i = { ...i, update: {} }), e = { ...e, computed: vp(e, t, n, i) };
   const l = {
     mode: "write",
     timeoutMs: e.timeoutMs,
     signal: e.signal
-  }, u = (t === "CREATE" || t === "UPDATE") && !r && e.singleCall !== !1 && !Es(e) && !Gf(e.model) && !Bc(e) && await Vf(e.driver), d = r ?? new Sn(e.driver, l, u), f = $p(t, o), p = await Ep(e, d, a);
+  }, u = (t === "CREATE" || t === "UPDATE") && !r && e.singleCall !== !1 && !Es(e) && !Qf(e.model) && !Bc(e) && await Gf(e.driver), d = r ?? new Sn(e.driver, l, u), f = Tp(t, o), p = await wp(e, d, a);
   p !== void 0 && (e = { ...e, viewerKey: p });
-  const h = new np(e, d, f), m = e.selection.schema;
+  const h = new sp(e, d, f), m = e.selection.schema;
   let g;
   const y = Es(e);
   let E;
@@ -10366,13 +10393,13 @@ async function vp(e, t, n, i, s, o) {
   );
   let $;
   const N = () => $ ??= xe(
-    h.hiddenKey || h.takenUnique ? Promise.resolve() : wd(h)
+    h.hiddenKey || h.takenUnique ? Promise.resolve() : vd(h)
   ), D = async (I, k, C) => {
-    const x = m.getType(I), X = gp(e, x, s, k);
+    const x = m.getType(I), X = yp(e, x, s, k);
     if (!y) return h.payload(n, C, X);
     await v();
     const b = N();
-    yd(e) && await b;
+    Ed(e) && await b;
     const A = xe(h.payload(n, C, X));
     return await b, A;
   };
@@ -10478,7 +10505,7 @@ async function vp(e, t, n, i, s, o) {
         break;
       }
       case "UPSERT":
-        I = await bp(h, k, n, i, D);
+        I = await $p(h, k, n, i, D);
         break;
       case "DELETE": {
         const C = h.ctx(), x = await h.run(
@@ -10524,10 +10551,10 @@ RETURN n.${R(n.key.property)} AS key`,
     throw h.abandon(I), d.isOpen && await d.rollback(), d instanceof Sn && d.committed ? new Error(
       `lora-graphql: a single-call mutation failed after its commit (${I instanceof Error ? I.message : String(I)}); the write is in the database. Set singleCallMutations: false and report this`,
       { cause: I }
-    ) : d instanceof Sn && d.single ? h.assertions.refusedBy(I) ?? Kf(e.model, I) : I;
+    ) : d instanceof Sn && d.single ? h.assertions.refusedBy(I) ?? Xf(e.model, I) : I;
   }
 }
-async function bp(e, t, n, i, s) {
+async function $p(e, t, n, i, s) {
   const o = i.input;
   if (o.length > e.env.maxBatch)
     throw U(
@@ -10549,7 +10576,7 @@ async function bp(e, t, n, i, s) {
         return h?.kind !== "scalar" && h?.kind !== "relationship" || Se(h, "UPDATE");
       })
     )
-  ), { existing: c, same: l } = await rp(
+  ), { existing: c, same: l } = await ap(
     e,
     n,
     r.map((f, p) => ({ key: f, input: a[p] }))
@@ -10579,7 +10606,7 @@ function gr(e, t) {
     );
   return e;
 }
-function $p(e, t) {
+function Tp(e, t) {
   return {
     operation: e === "UPDATE_MANY" ? "UPDATE" : e === "DELETE_MANY" ? "DELETE" : e,
     field: t,
@@ -10595,7 +10622,7 @@ function $p(e, t) {
   };
 }
 const yr = 1e3;
-class Tp {
+class Ap {
   #e;
   #t;
   #i;
@@ -10778,7 +10805,7 @@ REMOVE n.${Te.lease}, n.${Te.at}, n.${Te.error}`,
     }
   }
 }
-const Ap = {
+const kp = {
   String: { type: "string" },
   ID: { type: "string" },
   Int: { type: "integer" },
@@ -10795,19 +10822,19 @@ const Ap = {
   Point: { type: "object" },
   CartesianPoint: { type: "object" }
 };
-function kp(e, t, n) {
+function Np(e, t, n) {
   const { item: i, list: s } = ju(t.constraints), r = { ...t.type === "Enum" ? {
     enum: (e.enums.get(t.enumName ?? "")?.values ?? []).map(
       (c) => c.name
     )
-  } : { ...Ap[t.type] }, ...i };
+  } : { ...kp[t.type] }, ...i };
   let a = t.list ? { type: "array", items: r, ...s } : r;
   return n && (a = { anyOf: [a, { type: "null" }] }), t.description && (a = { description: t.description, ...a }), a;
 }
 function ri(e, t, n, i) {
   const s = {}, o = [];
   for (const r of n)
-    Se(r, i) && (s[r.name] = kp(e, r, i === "UPDATE" && !r.required), i === "CREATE" && $s(r) && o.push(r.name));
+    Se(r, i) && (s[r.name] = Np(e, r, i === "UPDATE" && !r.required), i === "CREATE" && $s(r) && o.push(r.name));
   return {
     $schema: "https://json-schema.org/draft/2020-12/schema",
     title: t,
@@ -10819,7 +10846,7 @@ function ri(e, t, n, i) {
   };
 }
 const Er = (e) => [...e.values()].filter((t) => t.kind === "scalar");
-function Np(e) {
+function Sp(e) {
   const t = {};
   for (const n of e.nodes.values()) {
     const i = Er(n.fields);
@@ -10940,7 +10967,7 @@ function qc(e) {
   );
   return Array.from(t, (n) => n.toString(16).padStart(2, "0")).join("");
 }
-function Sp(e, t, n = []) {
+function Rp(e, t, n = []) {
   const i = {}, s = [];
   for (const [o, r] of Object.entries(t)) {
     let a;
@@ -10995,7 +11022,7 @@ const $r = {
   LocalDateTime: "string",
   Duration: "string"
 };
-function Rp(e, t, n = /* @__PURE__ */ new Map()) {
+function Ip(e, t, n = /* @__PURE__ */ new Map()) {
   const i = /* @__PURE__ */ new Map(), s = [
     "// Generated by lora-graphql compile. Do not edit.",
     ""
@@ -11028,7 +11055,7 @@ ${f.join(`
       p.definitions.filter(
         (D) => D.kind === fe.FRAGMENT_DEFINITION
       ).map((D) => [D.name.value, D])
-    ), g = Dp(h.name?.value ?? d), y = (h.variableDefinitions ?? []).map((D) => {
+    ), g = Op(h.name?.value ?? d), y = (h.variableDefinitions ?? []).map((D) => {
       const I = pl(e, D.type), k = !dt(I) || D.defaultValue !== void 0;
       return `  ${D.variable.name.value}${k ? "?" : ""}: ${c(I)};`;
     });
@@ -11050,7 +11077,7 @@ ${y.join(`
             const F = T.alias?.value ?? T.name.value;
             let q;
             if (T.name.value === "__typename")
-              q = Ip(e, b).map((ee) => JSON.stringify(ee)).join(" | ");
+              q = Dp(e, b).map((ee) => JSON.stringify(ee)).join(" | ");
             else {
               const ee = Rt(b) || et(b) ? b.getFields()[T.name.value] : void 0;
               if (!ee) continue;
@@ -11105,14 +11132,14 @@ ${k}}`;
   ].join(`
 `);
 }
-function Ip(e, t) {
+function Dp(e, t) {
   return Rt(t) ? [t.name] : _s(t) || et(t) ? e.getPossibleTypes(t).map((n) => n.name) : [];
 }
-function Dp(e) {
+function Op(e) {
   const n = e.split(/[^A-Za-z0-9]+/).filter(Boolean).map((i) => i[0].toUpperCase() + i.slice(1)).join("");
   return /^[0-9]/.test(n) ? `Op${n}` : n || "Operation";
 }
-function dm(e, t) {
+function fm(e, t) {
   const n = /* @__PURE__ */ new Map(), i = (s) => Qr(s, {
     FragmentSpread(o) {
       const r = t.get(o.name.value);
@@ -11140,21 +11167,21 @@ function Wc(e = {}) {
 }
 function Hc(e = {}) {
   const t = Wc(e), n = [
-    Mp(t.maxDepth, t.maxIntrospectionDepth),
-    Up(t.maxAliases),
-    jp(t.maxRootFields)
+    Up(t.maxDepth, t.maxIntrospectionDepth),
+    jp(t.maxAliases),
+    Lp(t.maxRootFields)
   ];
-  return t.introspection || n.push(Lp), n;
+  return t.introspection || n.push(Pp), n;
 }
 function Vc(e = {}) {
   return { maxTokens: Wc(e).maxTokens };
 }
-function Op(e = {}, t = _p) {
+function Cp(e = {}, t = Mp) {
   const n = Hc(e), i = Vc(e);
   let s = !1;
   const o = (a, c) => {
     if (s) return;
-    const l = Cp(a, c);
+    const l = _p(a, c);
     l && (s = !0, t(l));
   }, r = (a) => (o(a, "validation"), {});
   return {
@@ -11177,13 +11204,13 @@ function Op(e = {}, t = _p) {
     }
   };
 }
-function Cp(e, t) {
+function _p(e, t) {
   if (typeof e != "object" || e === null || e instanceof (t === "schema" ? Jr : hl)) return;
   const i = e[Symbol.toStringTag], s = t === "schema" ? "GraphQLSchema" : "ValidationContext";
   if (!(i !== s && e.constructor?.name !== s))
     return `@loradb/lora-graphql: the server's ${s} comes from a different copy of the "graphql" package than the one @loradb/lora-graphql imports. With two copies, errors the library raises are not instances of the server's GraphQLError, so they are masked (Yoga reports "Unexpected error") and their extensions.code is lost. Fix: install a single graphql version (npm dedupe, or pin it with pnpm.overrides / yarn resolutions / npm overrides) and check that \`npm ls graphql\` shows one copy.`;
 }
-function _p(e) {
+function Mp(e) {
   console.error(e);
 }
 const Ss = (e) => new ve(e, { extensions: { code: "LIMIT_EXCEEDED" } });
@@ -11233,7 +11260,7 @@ function os(e, t, n, i = /* @__PURE__ */ new Set()) {
   }
   return s;
 }
-function Mp(e, t) {
+function Up(e, t) {
   return (n) => {
     const i = Gc(n);
     return {
@@ -11254,7 +11281,7 @@ function Mp(e, t) {
     };
   };
 }
-function Up(e) {
+function jp(e) {
   return (t) => {
     let n = 0, i = !1;
     return {
@@ -11279,7 +11306,7 @@ function _i(e, t, n) {
     }
   return i;
 }
-function jp(e) {
+function Lp(e) {
   return (t) => {
     const n = Gc(t);
     return {
@@ -11291,7 +11318,7 @@ function jp(e) {
     };
   };
 }
-const Lp = (e) => ({
+const Pp = (e) => ({
   Field(t) {
     const n = t.name.value;
     (n === "__schema" || n === "__type") && e.reportError(
@@ -11811,7 +11838,7 @@ const Xc = (
     crs: String!
   }
 `
-), Pp = /* @__PURE__ */ new Set([
+), xp = /* @__PURE__ */ new Set([
   "KeyScope",
   "TextCase",
   "UnicodeForm",
@@ -11844,7 +11871,7 @@ const Xc = (
   "Duration",
   "Point",
   "CartesianPoint"
-]), xp = /* @__PURE__ */ new Set([
+]), Fp = /* @__PURE__ */ new Set([
   "size",
   "range",
   "length",
@@ -11852,7 +11879,7 @@ const Xc = (
   "format",
   "multipleOf",
   "normalize"
-]), Fp = {
+]), zp = {
   "node type": [
     "node",
     "authorizationRule",
@@ -12018,29 +12045,29 @@ const Xc = (
   "interface relationship field": ["declareRelationship"],
   "field of an object type without @node": ["cacheControl"],
   "@jwt claim": ["jwtClaim", "viewer"]
-}, zp = {
+}, Bp = {
   "interface field": "; put it on the field of each implementation",
   "@customResolver field": "; the resolver decides what it returns",
   "field of an object type without @node": "; this type only shapes @cypher results",
   "object type without @node": "; this type only shapes @cypher results"
 };
 let Tr;
-function Bp() {
+function qp() {
   return Tr ??= new Set(
     tt(Xc).definitions.flatMap(
       (e) => e.kind === "DirectiveDefinition" ? [e.name.value] : []
     )
   ), Tr;
 }
-function qp(e, t) {
-  const n = Bp(), i = (r, a, c, l) => {
-    const u = Fp[a];
+function Wp(e, t) {
+  const n = qp(), i = (r, a, c, l) => {
+    const u = zp[a];
     for (const d of r) {
       const f = d.name.value;
       !n.has(f) || u.includes(f) || t.push({
         type: c,
         ...l ? { field: l } : {},
-        message: `@${f} is not supported on ${/^[aeiou]/.test(a) ? "an" : "a"} ${a}${zp[a] ?? ""}`
+        message: `@${f} is not supported on ${/^[aeiou]/.test(a) ? "an" : "a"} ${a}${Bp[a] ?? ""}`
       });
     }
   }, s = (r) => [
@@ -12089,7 +12116,7 @@ function qp(e, t) {
         for (const l of a.args)
           for (const u of l.astNode?.directives ?? []) {
             const d = u.name.value;
-            !n.has(d) || c && xp.has(d) || t.push({
+            !n.has(d) || c && Fp.has(d) || t.push({
               type: r.name,
               field: a.name,
               message: `argument ${l.name}: @${d} applies to arguments of @cypher fields`
@@ -12097,9 +12124,9 @@ function qp(e, t) {
           }
       }
 }
-const Wp = 25, Jc = 100;
-function Hp(e) {
-  const t = e.maxLimit ?? Jc, n = Math.min(e.defaultLimit ?? Wp, t);
+const Hp = 25, Jc = 100;
+function Vp(e) {
+  const t = e.maxLimit ?? Jc, n = Math.min(e.defaultLimit ?? Hp, t);
   if (!(t >= 1) || !(n >= 1))
     throw new Gt([
       { message: "defaultLimit and maxLimit must be at least 1" }
@@ -12114,7 +12141,7 @@ function Mi(e, t, n, i, s) {
     max: Math.min(o, t.max)
   };
 }
-const Vp = /* @__PURE__ */ new Set(["String", "ID"]), Gp = /* @__PURE__ */ new Set(["Int", "Float", "BigInt"]), vt = (e, t) => typeof e[t] == "number" ? e[t] : void 0, Xt = (e) => typeof e.message == "string" ? { message: e.message } : {};
+const Gp = /* @__PURE__ */ new Set(["String", "ID"]), Qp = /* @__PURE__ */ new Set(["Int", "Float", "BigInt"]), vt = (e, t) => typeof e[t] == "number" ? e[t] : void 0, Xt = (e) => typeof e.message == "string" ? { message: e.message } : {};
 function Yc(e, t, n, i) {
   const s = (y) => i.skip?.has(y) ? void 0 : K(e(y), t, n) ?? (i.scalar ? K(
     e(y),
@@ -12139,7 +12166,7 @@ function Yc(e, t, n, i) {
     n(`${p}: a @vector is bounded by its dimensions`);
     return;
   }
-  const h = {}, m = Vp.has(i.type), g = Gp.has(i.type);
+  const h = {}, m = Gp.has(i.type), g = Qp.has(i.type);
   if (o) {
     const y = vt(o, "min"), E = vt(o, "max");
     m ? y === void 0 && E === void 0 ? n("@length needs min, max or both") : (y ?? 0) < 0 || (E ?? 0) < 0 ? n("@length bounds cannot be negative") : y !== void 0 && E !== void 0 && y > E ? n("@length(min:) is greater than max") : h.length = {
@@ -12221,7 +12248,7 @@ function Yc(e, t, n, i) {
   }
 }
 const Zc = /* @__PURE__ */ new WeakMap();
-function Qp(e, t, n, i, s, o, r) {
+function Kp(e, t, n, i, s, o, r) {
   const a = (p) => r.push({ type: e, message: p }), c = Zs(i ?? n), l = [];
   (o?.indexes ?? []).forEach((p, h) => {
     h > 0 && !p.name && a("@fulltext: every index after the first needs a name");
@@ -12267,7 +12294,7 @@ function Ar(e) {
     return "@authorization(validate:) for READ";
   if (e.authentication?.has("READ")) return "@authentication for READ";
 }
-const kr = ["CONTAINS", "STARTS_WITH", "ENDS_WITH"], it = ["LT", "LTE", "GT", "GTE"], Kp = {
+const kr = ["CONTAINS", "STARTS_WITH", "ENDS_WITH"], it = ["LT", "LTE", "GT", "GTE"], Xp = {
   String: ["EQ", "IN", ...it, ...kr],
   ID: ["EQ", "IN", ...it, ...kr],
   Int: ["EQ", "IN", ...it],
@@ -12283,7 +12310,7 @@ const kr = ["CONTAINS", "STARTS_WITH", "ENDS_WITH"], it = ["LT", "LTE", "GT", "G
   Enum: ["EQ", "IN"],
   Point: ["WITHIN_BBOX", "DISTANCE"],
   CartesianPoint: ["WITHIN_BBOX", "DISTANCE"]
-}, Xp = /* @__PURE__ */ new Set(["String", "ID", "Int", "BigInt"]), Jp = /* @__PURE__ */ new Set(["Point", "CartesianPoint", "Duration"]);
+}, Jp = /* @__PURE__ */ new Set(["String", "ID", "Int", "BigInt"]), Yp = /* @__PURE__ */ new Set(["Point", "CartesianPoint", "Duration"]);
 function rs(e, t, n, i, s) {
   const o = (ie) => i.push({ type: e.name, field: t.name, message: ie }), r = _n(t.type), a = We(t.type);
   let c, l;
@@ -12319,11 +12346,11 @@ function rs(e, t, n, i, s) {
     const ie = $.value;
     po(c, r.list, ie) || o(`@default(value:) does not fit ${r.list ? `[${c}]` : c}`), d && o("@key cannot have a @default; use @key(generate: true)"), (c === "Point" || c === "CartesianPoint") && o("Point fields cannot have a @default"), te = { value: ie };
   }
-  !s.allowKey && (d || f || h || v) && o("@key, @unique, @relayId and @index are not allowed here"), d && (Xp.has(c) || o("@key must be String, ID, Int or BigInt"), r.required || o("@key fields must be non-null"), r.list && o("@key cannot be a list"), p && o("@key cannot be @private")), h && !d && o("@relayId belongs on the @key field"), f && r.list && o("@unique cannot be a list");
+  !s.allowKey && (d || f || h || v) && o("@key, @unique, @relayId and @index are not allowed here"), d && (Jp.has(c) || o("@key must be String, ID, Int or BigInt"), r.required || o("@key fields must be non-null"), r.list && o("@key cannot be a list"), p && o("@key cannot be @private")), h && !d && o("@relayId belongs on the @key field"), f && r.list && o("@unique cannot be a list");
   let ee = /* @__PURE__ */ new Set();
   if (y) {
     const ie = r.list ? c === "Point" || c === "CartesianPoint" || b ? [] : ["INCLUDES", ...r.required ? [] : ["IS_NULL"]] : [
-      ...Kp[c],
+      ...Xp[c],
       ...r.required ? [] : ["IS_NULL"],
       ...c === "String" || c === "ID" ? ["CASE_INSENSITIVE"] : []
     ], ge = y.byValue ?? (r.list ? ["INCLUDES"] : ["EQ", "IN"]).filter((Ie) => ie.includes(Ie)), Me = ge.filter((Ie) => !ie.includes(Ie));
@@ -12331,7 +12358,7 @@ function rs(e, t, n, i, s) {
       `${c} does not support ${Me.join(", ")}` + (ie.length > 0 ? ` (allowed: ${ie.join(", ")})` : "")
     ), ee = new Set(ge.filter((Ie) => ie.includes(Ie)));
   }
-  d && (ee.add("EQ"), ee.add("IN")), p && (y || m) && o("@private fields cannot be @filterable or @sortable"), m && (r.list || Jp.has(c)) && o(`${r.list ? "lists" : c} cannot be @sortable`), g && (r.list || c === "Point" || c === "CartesianPoint" || p || !s.allowKey) && o("@groupBy needs a readable, non-list, non-Point field of a @node type");
+  d && (ee.add("EQ"), ee.add("IN")), p && (y || m) && o("@private fields cannot be @filterable or @sortable"), m && (r.list || Yp.has(c)) && o(`${r.list ? "lists" : c} cannot be @sortable`), g && (r.list || c === "Point" || c === "CartesianPoint" || p || !s.allowKey) && o("@groupBy needs a readable, non-list, non-Point field of a @node type");
   const re = E?.property ?? t.name;
   re.length === 0 && o("@alias(property:) is empty");
   const _ = [];
@@ -12434,8 +12461,8 @@ function po(e, t, n) {
       return typeof n == "string";
   }
 }
-const Yp = /^[A-Z][A-Z0-9_]*$/;
-function Zp(e, t, n, i) {
+const Zp = /^[A-Z][A-Z0-9_]*$/;
+function eh(e, t, n, i) {
   let s;
   for (const o of n) {
     const r = i.get(o)?.fields.get(t.name);
@@ -12452,7 +12479,7 @@ function Zp(e, t, n, i) {
     description: t.description ?? void 0
   } : "has no @node implementations";
 }
-function eh(e, t, n, i, s, o) {
+function th(e, t, n, i, s, o) {
   const r = (v) => i.push({ type: e.name, field: t.name, message: v }), a = fc(
     K(n("authorization"), t, r),
     r,
@@ -12467,7 +12494,7 @@ function eh(e, t, n, i, s, o) {
   const l = _n(t.type);
   l.list && (!l.itemRequired || !l.required) && r("relationship lists must be written [T!]!"), l.depth > 1 && r("nested lists are not supported");
   const u = c.type;
-  Yp.test(u) || r(`relationship type \`${u}\` must be SCREAMING_SNAKE_CASE`);
+  Zp.test(u) || r(`relationship type \`${u}\` must be SCREAMING_SNAKE_CASE`);
   const d = c.properties;
   d !== void 0 && !s.has(d) && r(`${d} is not a @relationshipProperties type`);
   for (const v of [
@@ -12531,7 +12558,7 @@ function eh(e, t, n, i, s, o) {
     description: t.description ?? void 0
   };
 }
-const th = /\b(CREATE|MERGE|SET|DELETE|REMOVE|DETACH)\b/i;
+const nh = /\b(CREATE|MERGE|SET|DELETE|REMOVE|DETACH)\b/i;
 function el(e) {
   const t = Zi(e), n = [...t.matchAll(/\bRETURN\b/gi)], i = n[n.length - 1];
   return i ? (
@@ -12541,8 +12568,8 @@ function el(e) {
     ) || /\b[Aa][Ss]\s+`(created|updated)`/.test(e.slice(i.index))
   ) : !1;
 }
-const nh = ["jwt", "viewer", "operation"];
-function sh(e, t, n, i, s) {
+const sh = ["jwt", "viewer", "operation"];
+function ih(e, t, n, i, s) {
   const o = [];
   for (const { node: r } of un("trigger", e)) {
     let a = !0;
@@ -12585,7 +12612,7 @@ function sh(e, t, n, i, s) {
     }
     const m = [...new Set(Bn(d).map((g) => g.name))];
     for (const g of m)
-      nh.includes(g) ? g === "viewer" && !s && c("the statement uses $viewer, but no @jwt claim has @viewer") : c(
+      sh.includes(g) ? g === "viewer" && !s && c("the statement uses $viewer, but no @jwt claim has @viewer") : c(
         `the statement uses $${g}; a trigger statement has $jwt, $viewer and $operation`
       );
     a && o.push({
@@ -12594,7 +12621,7 @@ function sh(e, t, n, i, s) {
       statement: d,
       fields: f,
       params: m,
-      writes: th.test(Fa(d)),
+      writes: nh.test(Fa(d)),
       reports: el(d)
     });
   }
@@ -12604,7 +12631,7 @@ const Rr = /\b(CREATE|MERGE|SET|DELETE|REMOVE|DETACH)\b/;
 function Ir(e, t, n, i, s, o) {
   const r = (C) => i.push({ type: e, field: t.name, message: C }), a = (C) => s.push({ type: e, field: t.name, message: C }), c = K(n("cypher"), t, r);
   if (!c) return;
-  const l = o.root ? Ld(K(n("authorization"), t, r), r) : fc(K(n("authorization"), t, r), r), u = c.statement;
+  const l = o.root ? Pd(K(n("authorization"), t, r), r) : fc(K(n("authorization"), t, r), r), u = c.statement;
   for (const C of [
     "relationship",
     "key",
@@ -12626,7 +12653,7 @@ function Ir(e, t, n, i, s, o) {
   d.depth > 1 && r("nested lists are not supported"), d.list && !d.itemRequired && r("list items must be non-null, e.g. [Festival!]");
   const y = c.cost ?? 0;
   y < 0 && r("cost must not be negative");
-  const E = c.columnName ?? rh(u);
+  const E = c.columnName ?? ah(u);
   if (!E) {
     r("cannot tell which column holds the value; set @cypher(columnName:)");
     return;
@@ -12643,7 +12670,7 @@ function Ir(e, t, n, i, s, o) {
     }, A = K(n("size"), C, b), O = K(n("range"), C, b), T = A !== void 0 && A.min == null && A.unique == null && A.message == null, F = O !== void 0 && O.exclusiveMin == null && O.exclusiveMax == null && O.message == null;
     let q;
     T && (K(n("size"), C, r), q = A.max ?? void 0, q === void 0 ? r(`argument ${C.name}: @size needs max, min or unique`) : X.list ? q < 1 && r(`argument ${C.name}: @size(max:) must be at least 1`) : r(`argument ${C.name}: @size applies to list arguments`));
-    const J = F ? ih(C, x, n("range"), r) : void 0, te = oh(C);
+    const J = F ? oh(C, x, n("range"), r) : void 0, te = rh(C);
     J && eo(te, J) !== void 0 && r(`argument ${C.name}: its default is outside @range`);
     const ee = o.schema.getType(x), re = Yc(
       n,
@@ -12727,7 +12754,7 @@ function Ir(e, t, n, i, s, o) {
   };
   return I && (I.computedBy = k), k;
 }
-function ih(e, t, n, i) {
+function oh(e, t, n, i) {
   const s = K(n, e, i);
   if (!s) return;
   const o = s.min, r = s.max;
@@ -12748,13 +12775,13 @@ function ih(e, t, n, i) {
     ...r != null ? { max: r } : {}
   };
 }
-function oh(e) {
+function rh(e) {
   if (e.defaultValue !== void 0) return e.defaultValue;
   const t = e.default;
   if (t)
     return "value" in t ? t.value : t.literal ? ml(t.literal, e.type) : void 0;
 }
-function rh(e) {
+function ah(e) {
   const t = Zi(e), n = [];
   let i = 0;
   for (const p of t)
@@ -12881,7 +12908,7 @@ const Vs = /* @__PURE__ */ new Set([
   "startsWith",
   "endsWith",
   "isNull"
-]), ah = /* @__PURE__ */ new Set([...Vs, "includes", "exists"]), ch = /* @__PURE__ */ new Set(["eq", "lt", "lte", "gt", "gte"]);
+]), ch = /* @__PURE__ */ new Set([...Vs, "includes", "exists"]), lh = /* @__PURE__ */ new Set(["eq", "lt", "lte", "gt", "gte"]);
 function Kn(e, t, n, i, s, o, r) {
   $t(
     e,
@@ -12946,7 +12973,7 @@ function $t(e, t, n, i, s, o, r, a, c, l, u = "rules on relationship properties
                 d(`${$}.${N} must be an operator object`);
               else
                 for (const [I, k] of Object.entries(D))
-                  ah.has(I) || d(`${$}.${N}: unknown operator ${I}`), JSON.stringify(k ?? null).includes("${") && d(
+                  ch.has(I) || d(`${$}.${N}: unknown operator ${I}`), JSON.stringify(k ?? null).includes("${") && d(
                     `${$}.${N}.${I}: claim tests compare with literals; \${...} placeholders belong in node parts`
                   );
         else
@@ -12956,7 +12983,7 @@ function $t(e, t, n, i, s, o, r, a, c, l, u = "rules on relationship properties
   };
   m(o, "");
 }
-function lh(e, t, n, i, s, o, r) {
+function uh(e, t, n, i, s, o, r) {
   if (!i.memberAuthorization) return;
   const a = i.properties ? t.get(i.properties) : void 0, c = (l, u) => l.type === u.type && l.field === u.field && l.message === u.message;
   for (const [l, u] of i.memberAuthorization) {
@@ -13008,7 +13035,7 @@ function Ht(e, t, n, i, s, o) {
       if (!l && d?.kind === "relationship" && !d.list)
         typeof a != "boolean" && o(`${c} must be true or false`);
       else if (!l && u?.kind === "relationship" && u.list && u.properties)
-        uh(e, t, u, a, c, o);
+        dh(e, t, u, a, c, o);
       else if (!l)
         o(`${c}: ${n.name} has no field ${r}`);
       else if (l.kind === "cypher" || l.kind === "custom")
@@ -13037,7 +13064,7 @@ function Ht(e, t, n, i, s, o) {
             if (!qe(g)) o(`${c}.count must be an operator object`);
             else
               for (const y of Object.keys(g))
-                ch.has(y) || o(`${c}.count: unknown operator ${y}`);
+                lh.has(y) || o(`${c}.count: unknown operator ${y}`);
           else ["some", "all", "none", "single"].includes(m) ? h(g, `${c}.${m}`) : o(`${c}: expected some, all, none, single or count`);
       }
     }
@@ -13077,7 +13104,7 @@ function Li(e, t, n, i, s, o) {
     }
   }
 }
-function uh(e, t, n, i, s, o) {
+function dh(e, t, n, i, s, o) {
   if (!qe(i) || Object.keys(i).length === 0)
     return o(`${s} must be a non-empty object`);
   const r = e.get(n.target), a = t.get(n.properties);
@@ -13117,7 +13144,7 @@ function Ds(e, t, n, i) {
         Vs.has(a) ? c === null ? i(`${r}.${a} is null`) : a === "isNull" && typeof c != "boolean" && i(`${r}.isNull must be true or false`) : i(`${r}: unknown operator ${a}`);
   }
 }
-function dh(e, t, n) {
+function fh(e, t, n) {
   const i = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), o = (r, a, c) => {
     const l = K(t, r, c);
     if (!l) return;
@@ -13141,7 +13168,7 @@ function dh(e, t, n) {
   }
   return { types: i, fields: s };
 }
-function fh(e, t, n, i, s, o) {
+function ph(e, t, n, i, s, o) {
   const r = [];
   for (const { node: a } of un("uniqueTogether", e)) {
     let c = !0;
@@ -13170,9 +13197,9 @@ function fh(e, t, n, i, s, o) {
   }
   return r;
 }
-const ph = /* @__PURE__ */ new Set(["Query", "Mutation", "Subscription"]);
-function hh(e, t = {}) {
-  const n = Hp(t);
+const hh = /* @__PURE__ */ new Set(["Query", "Mutation", "Subscription"]);
+function mh(e, t = {}) {
+  const n = Vp(t);
   let i;
   try {
     const w = typeof e == "string" ? tt(e) : e;
@@ -13185,7 +13212,7 @@ function hh(e, t = {}) {
     );
   }
   const s = [], o = (w) => i.getDirective(w), r = (w) => (S) => s.push({ type: w, message: S }), a = Object.values(i.getTypeMap()).filter(
-    (w) => !w.name.startsWith("__") && !Pp.has(w.name)
+    (w) => !w.name.startsWith("__") && !xp.has(w.name)
   ), c = {}, l = K(
     o("authorizationDefaults"),
     i,
@@ -13243,7 +13270,7 @@ function hh(e, t = {}) {
       });
       continue;
     }
-    if (ph.has(w.name)) {
+    if (hh.has(w.name)) {
       w.name === "Subscription" ? s.push({
         type: w.name,
         message: "custom subscriptions are not supported; use LoraGraphQL.onWrite / changes()"
@@ -13306,7 +13333,7 @@ function hh(e, t = {}) {
     ...E.map((w) => w.name),
     ...v.map((w) => w.name)
   ]), b = new Set(m.map((w) => w.name));
-  qp(
+  Wp(
     { nodeNames: k, propsNames: b, jwtType: N, targetNames: X, userTypes: a },
     s
   );
@@ -13396,7 +13423,7 @@ function hh(e, t = {}) {
         continue;
       }
       if (X.has(lt.name)) {
-        const Ge = eh(
+        const Ge = th(
           w,
           oe,
           o,
@@ -13450,7 +13477,7 @@ function hh(e, t = {}) {
       field: "id",
       message: "@relayId adds a global `id` field; rename this field or map it with @alias"
     });
-    const yt = Qp(
+    const yt = Kp(
       w.name,
       L[0],
       Ys(w.name),
@@ -13531,7 +13558,7 @@ function hh(e, t = {}) {
     if (et(w))
       for (const Pe of Object.values(w.getFields())) {
         if (K(o("declareRelationship"), Pe, S) !== void 0) {
-          const Et = Zp(w.name, Pe, L, T);
+          const Et = eh(w.name, Pe, L, T);
           typeof Et == "string" ? s.push({
             type: w.name,
             field: Pe.name,
@@ -13748,7 +13775,7 @@ function hh(e, t = {}) {
   tl.set(T, J);
   for (const w of h) {
     const S = T.get(w.name);
-    S && (S.uniqueTogether = fh(w, S, T, A, o, s), S.triggers = sh(
+    S && (S.uniqueTogether = ph(w, S, T, A, o, s), S.triggers = ih(
       w,
       S,
       o,
@@ -13814,7 +13841,7 @@ function hh(e, t = {}) {
         ...S.authorization.validate.filter((V) => !tn(V))
       ]);
       const Q = S.kind === "relationship" ? H(S) : void 0;
-      Q ? ae(void 0, w.name, S.name, L, Q) : S.kind === "relationship" && L.length > 0 && J.has(S.target) && (S.memberAuthorization = xd(
+      Q ? ae(void 0, w.name, S.name, L, Q) : S.kind === "relationship" && L.length > 0 && J.has(S.target) && (S.memberAuthorization = Fd(
         S,
         T,
         (V, le) => ae(
@@ -13927,7 +13954,7 @@ function hh(e, t = {}) {
             V
           );
         }
-        L.kind === "relationship" && lh(
+        L.kind === "relationship" && uh(
           T,
           A,
           w,
@@ -14011,7 +14038,7 @@ function hh(e, t = {}) {
         ...(S.authorization?.validate ?? []).flatMap((le) => [...le.operations]),
         ...S.authentication ?? []
       ], V = [
-        ...new Set(Q.filter((le) => !Pd.has(le)))
+        ...new Set(Q.filter((le) => !xd.has(le)))
       ];
       V.length > 0 && L(
         `rules on a relationship property apply to READ, CREATE and UPDATE, not ${V.join(", ")}`
@@ -14066,8 +14093,8 @@ function hh(e, t = {}) {
       type: w,
       message: "object types need @node or @relationshipProperties, unless a @cypher field returns them"
     });
-  const Me = dh(a, o("cacheControl"), r);
-  if (s.length > 0) throw new Gt(mh(s));
+  const Me = fh(a, o("cacheControl"), r);
+  if (s.length > 0) throw new Gt(gh(s));
   const Ie = {
     nodes: T,
     abstracts: J,
@@ -14101,7 +14128,7 @@ function hh(e, t = {}) {
     });
   return Ie;
 }
-function mh(e) {
+function gh(e) {
   const t = /* @__PURE__ */ new Set();
   return e.filter((n) => {
     const i = `${n.type}\0${n.field}\0${n.message}`;
@@ -14119,8 +14146,8 @@ function Or(e, t, n) {
     }), i.set(s.property, s.name);
   }
 }
-const gh = 2;
-class yh {
+const yh = 2;
+class Eh {
   #e;
   constructor(t) {
     this.#e = t;
@@ -14160,7 +14187,7 @@ class yh {
       } catch (u) {
         throw l = u, r && _r(r, u), u;
       } finally {
-        const u = performance.now() - a, d = c === void 0 ? 0 : Eh(c);
+        const u = performance.now() - a, d = c === void 0 ? 0 : wh(c);
         r && (r.setAttribute("db.response.returned_rows", d), r.end()), this.#t(t, n, u, d, l);
       }
     };
@@ -14209,16 +14236,16 @@ function Cr(e) {
     end: t(() => e.end())
   };
 }
-function Eh(e) {
+function wh(e) {
   return Array.isArray(e) ? e.reduce((t, n) => t + n.rows.length, 0) : e.rows.length;
 }
 function _r(e, t) {
   e.recordException(t instanceof Error ? t : String(t)), e.setStatus({
-    code: gh,
+    code: yh,
     message: t instanceof Error ? t.message : String(t)
   });
 }
-function wh(e, t) {
+function vh(e, t) {
   const n = [];
   for (const i of e.nodes.values())
     for (const s of i.fields.values()) {
@@ -14245,7 +14272,7 @@ function wh(e, t) {
           field: s.name,
           message: `requires: ${a.message}`
         });
-      for (const a of vh(i, s.requires))
+      for (const a of bh(i, s.requires))
         n.push({
           type: i.name,
           field: s.name,
@@ -14254,16 +14281,16 @@ function wh(e, t) {
     }
   if (n.length > 0) throw new Gt(n);
 }
-function vh(e, t) {
+function bh(e, t) {
   return tt(`{ ${t} }`).definitions[0].selectionSet.selections.flatMap(
     (s) => s.kind === fe.FIELD && e.fields.get(s.name.value)?.kind === "custom" ? [s.name.value] : []
   );
 }
-function bh(e, t, n) {
+function $h(e, t, n) {
   let i;
   if (n instanceof ve) i = n;
   else {
-    const s = Ff(e.model, n);
+    const s = zf(e.model, n);
     s !== n ? i = s : n.code === "LORA_INVALID_VECTOR" ? i = U(
       "BAD_USER_INPUT",
       n instanceof Error ? n.message : String(n),
@@ -14295,7 +14322,7 @@ function bh(e, t, n) {
   }
   return e.maskErrors && i.originalError ? new ve(i.message, { extensions: i.extensions }) : i;
 }
-function $h(e, t, n, i) {
+function Th(e, t, n, i) {
   const s = t.cacheHints;
   if (!s || s.types.size === 0 && s.fields.size === 0)
     return;
@@ -14308,7 +14335,7 @@ function $h(e, t, n, i) {
     ...t.nodes.keys(),
     ...t.abstracts.keys(),
     ...t.objects.keys()
-  ]), l = Th(t), u = (g) => s.types.get(l.get(g) ?? g);
+  ]), l = Ah(t), u = (g) => s.types.get(l.get(g) ?? g);
   let d = 1 / 0, f = "PUBLIC", p = 0;
   const h = (g) => {
     p++, d = Math.min(d, g.maxAge), g.scope === "PRIVATE" && (f = "PRIVATE");
@@ -14334,7 +14361,7 @@ function $h(e, t, n, i) {
   if (!(!m(r, o.selectionSet, !0) || p === 0))
     return { maxAge: d, scope: f };
 }
-function Th(e) {
+function Ah(e) {
   const t = /* @__PURE__ */ new Map();
   for (const n of [...e.nodes.keys(), ...e.abstracts.keys()])
     for (const i of [
@@ -14348,8 +14375,8 @@ function Th(e) {
       t.set(i(n), n);
   return t;
 }
-const Ah = 500, Mr = (e) => 100 * e.length;
-class kh {
+const kh = 500, Mr = (e) => 100 * e.length;
+class Nh {
   #e;
   #t;
   #i;
@@ -14452,7 +14479,7 @@ class kh {
         if (i.length > 0) return { errors: i };
         const s = Mr(t.source);
         if (s <= this.#r) {
-          for (; this.#s.size > 0 && (this.#s.size >= Ah || this.#c + s > this.#r); ) {
+          for (; this.#s.size > 0 && (this.#s.size >= kh || this.#c + s > this.#r); ) {
             const o = this.#s.keys().next().value;
             this.#s.delete(o), this.#c -= Mr(o);
           }
@@ -14466,7 +14493,7 @@ class kh {
     return n;
   }
 }
-class Nh {
+class Sh {
   #e;
   #t;
   /** Deadline and statement slots per request context and operation. */
@@ -14536,7 +14563,7 @@ class Nh {
     let i = this.#i.get(t);
     i || (i = /* @__PURE__ */ new Map(), this.#i.set(t, i));
     let s = i.get(n.operation);
-    return s || (s = new Pf(
+    return s || (s = new xf(
       this.#e,
       this.#t
     ), i.set(n.operation, s)), s.active++, s;
@@ -14556,7 +14583,7 @@ class Nh {
     }, 0);
   }
 }
-function Sh(e, t) {
+function Rh(e, t) {
   for (const n of e.nodes.values())
     if (n.read) {
       if (t === Z.listRoot(n)) return { kind: "list", node: n };
@@ -14569,7 +14596,7 @@ function Sh(e, t) {
         return { kind: "grouped", node: n };
     }
 }
-function Rh(e, t) {
+function Ih(e, t) {
   for (const n of e.nodes.values())
     if (n.read)
       for (const i of n.search) {
@@ -14655,27 +14682,27 @@ function mn(e, t, n) {
     }
   });
 }
-const Ih = mn(
+const Dh = mn(
   "Date",
   "date",
   "A calendar date, e.g. `2026-06-21`."
-), Dh = mn(
+), Oh = mn(
   "Time",
   "time",
   "A time of day with offset, e.g. `21:00:00+02:00`."
-), Oh = mn(
+), Ch = mn(
   "LocalTime",
   "localtime",
   "A time of day without offset, e.g. `21:00:00`."
-), Ch = mn(
+), _h = mn(
   "DateTime",
   "datetime",
   "An instant with offset, e.g. `2026-06-21T21:00:00Z`."
-), _h = mn(
+), Mh = mn(
   "LocalDateTime",
   "localdatetime",
   "A date and time without offset, e.g. `2026-06-21T21:00:00`."
-), Mh = mn(
+), Uh = mn(
   "Duration",
   "duration",
   "An ISO-8601 duration, e.g. `P1DT2H`."
@@ -14689,11 +14716,11 @@ function Fr(e) {
   }
   throw Os("BigInt must be an integer or a decimal string");
 }
-const Uh = -(2n ** 31n), jh = 2n ** 32n;
+const jh = -(2n ** 31n), Lh = 2n ** 32n;
 function zr(e) {
-  return e >= Uh && e < jh ? Number(e) : e;
+  return e >= jh && e < Lh ? Number(e) : e;
 }
-const Lh = new as({
+const Ph = new as({
   name: "BigInt",
   description: "A 64-bit integer, serialised as a decimal string.",
   serialize(e) {
@@ -14708,16 +14735,16 @@ const Lh = new as({
       return zr(Fr(e.value));
     throw Os("BigInt must be an integer or a decimal string", e);
   }
-}), Ph = {
-  BigInt: Lh,
-  Date: Ih,
-  Time: Dh,
-  LocalTime: Oh,
-  DateTime: Ch,
-  LocalDateTime: _h,
-  Duration: Mh
+}), xh = {
+  BigInt: Ph,
+  Date: Dh,
+  Time: Oh,
+  LocalTime: Ch,
+  DateTime: _h,
+  LocalDateTime: Mh,
+  Duration: Uh
 }, j = (e) => new Ve(e), Ee = (e) => new xi(e);
-function xh(e, t) {
+function Fh(e, t) {
   const n = new In({
     name: "SortDirection",
     values: {
@@ -14841,7 +14868,7 @@ function xh(e, t) {
       case "Enum":
         return a.get(g);
       default:
-        return Ph[m];
+        return xh[m];
     }
   };
   return {
@@ -14859,8 +14886,8 @@ function xh(e, t) {
     }
   };
 }
-const nl = (e) => !e.list && !e.private && e.selectableOn.aggregate && e.selectableOn.read && !["Boolean", "Enum", "Point", "CartesianPoint"].includes(e.type), Fh = (e) => e.type === "Int" || e.type === "Float" || e.type === "BigInt";
-function zh(e) {
+const nl = (e) => !e.list && !e.private && e.selectableOn.aggregate && e.selectableOn.read && !["Boolean", "Enum", "Point", "CartesianPoint"].includes(e.type), zh = (e) => e.type === "Int" || e.type === "Float" || e.type === "BigInt";
+function Bh(e) {
   const { scalarType: t } = e, n = /* @__PURE__ */ new Map();
   return (s) => {
     const o = t(s), r = s.type === "Int" || s.type === "Float" || s.type === "BigInt", a = `${o.name}Aggregate`;
@@ -14883,7 +14910,7 @@ function zh(e) {
     }), n.set(a, c)), c;
   };
 }
-function Bh(e, t, n) {
+function qh(e, t, n) {
   const { scalarType: i } = t, s = /* @__PURE__ */ new Map();
   for (const r of e.nodes.values()) {
     if (!r.aggregate) continue;
@@ -14955,7 +14982,7 @@ const Br = {
   IS_NULL: "true: the value is absent; false: it is present.",
   CASE_INSENSITIVE: "The same string operators, ignoring case. Not index-backed: prefer @fulltext for search."
 };
-function qh(e, t) {
+function Wh(e, t) {
   const { countFilter: n, scalarType: i, baseType: s } = t, o = new Ae({
     name: "PointInput",
     description: "A WGS-84 point. Add height for 3D.",
@@ -15180,7 +15207,7 @@ function qh(e, t) {
       fields: {
         min: { type: $(A) },
         max: { type: $(A) },
-        ...Fh(b) ? {
+        ...zh(b) ? {
           avg: { type: $(Ne) },
           sum: {
             type: $(b.type === "Int" ? Ne : A)
@@ -15244,12 +15271,12 @@ function qh(e, t) {
   };
   return { inputTypeOf: l, whereOf: p, polymorphic: h, connectionWhere: y };
 }
-function Wh(e, t) {
+function Hh(e, t) {
   return ka(
     JSON.stringify([e, typeof t == "bigint" ? t.toString() : t])
   );
 }
-function Hh(e) {
+function Vh(e) {
   try {
     const t = JSON.parse(Na(e));
     if (Array.isArray(t) && t.length === 2 && typeof t[0] == "string" && (typeof t[1] == "string" || typeof t[1] == "number"))
@@ -15274,14 +15301,14 @@ function ho(e, t) {
 const bn = (e, t, n, i) => {
   const s = e[i.path.key];
   return ho(s, i), s;
-}, Vh = (e, t, n, i) => {
+}, Gh = (e, t, n, i) => {
   const s = e[i.path.key];
   return ho(s, i), s && !Array.isArray(s) ? s.values ?? null : s;
 }, li = (e, t, n, i) => {
   const s = e[i.path.key];
   return ho(s, i), gt(s);
 };
-function Gh(e, t, n, i, s, o) {
+function Qh(e, t, n, i, s, o) {
   const {
     sortDirection: r,
     pageInfo: a,
@@ -15516,7 +15543,7 @@ function Gh(e, t, n, i, s, o) {
         _.key.relayId && (H.id = {
           type: j(Dn),
           description: "Global id.",
-          resolve: (W, ae, ie, ge) => Wh(_.name, W[ge.path.key])
+          resolve: (W, ae, ie, ge) => Hh(_.name, W[ge.path.key])
         });
         for (const W of _.fields.values()) {
           if (W.kind === "scalar") {
@@ -15525,7 +15552,7 @@ function Gh(e, t, n, i, s, o) {
               type: f(W),
               description: W.description,
               // Vectors are stored tagged; clients see the numbers.
-              resolve: W.vector ? Vh : bn
+              resolve: W.vector ? Gh : bn
             };
             continue;
           }
@@ -15674,7 +15701,7 @@ function Gh(e, t, n, i, s, o) {
     cypherArgs: re
   };
 }
-function Qh(e, t, n, i, s, o) {
+function Kh(e, t, n, i, s, o) {
   const { resolveRoot: r, resolveNode: a } = t, { pageInfo: c, nodeInterface: l, scalarType: u } = n, { whereOf: d } = i, {
     objects: f,
     connections: p,
@@ -15841,7 +15868,7 @@ function Qh(e, t, n, i, s, o) {
     };
   return D;
 }
-function Kh(e, t) {
+function Xh(e, t) {
   const { sortDirection: n } = t, i = /* @__PURE__ */ new Map();
   for (const s of e.nodes.values()) {
     const o = {};
@@ -15874,7 +15901,7 @@ function Kh(e, t) {
   }
   return i;
 }
-function Xh(e, t, n, i, s) {
+function Jh(e, t, n, i, s) {
   const { scalarType: o, scalarOutput: r } = n, { whereOf: a } = i, { objects: c } = s, l = {}, u = new In({
     name: "ChangeOperation",
     values: {
@@ -15977,22 +16004,22 @@ function Xh(e, t, n, i, s) {
   }
   return l;
 }
-function Jh(e, t) {
-  const n = xh(e, t), i = qh(e, n), { inputTypeOf: s, whereOf: o } = i, r = Kh(e, n), a = zh(n), c = Gh(
+function Yh(e, t) {
+  const n = Fh(e, t), i = Wh(e, n), { inputTypeOf: s, whereOf: o } = i, r = Xh(e, n), a = Bh(n), c = Qh(
     e,
     t,
     n,
     i,
     r,
     a
-  ), { objects: l, abstractTypes: u, plainObjects: d, cypherOutput: f, cypherArgs: p } = c, h = Bh(e, n, a), m = Qh(
+  ), { objects: l, abstractTypes: u, plainObjects: d, cypherOutput: f, cypherArgs: p } = c, h = qh(e, n, a), m = Kh(
     e,
     t,
     n,
     i,
     c,
     h
-  ), g = lf(
+  ), g = uf(
     {
       model: e,
       object: (E) => l.get(E),
@@ -16008,7 +16035,7 @@ function Jh(e, t) {
       args: p(E),
       resolve: (v, $, N, D) => t.resolveCypher(E, D, N)
     };
-  const y = Xh(
+  const y = Jh(
     e,
     t,
     n,
@@ -16030,8 +16057,8 @@ function Jh(e, t) {
     ]
   });
 }
-const Yh = 5e4;
-class Zh {
+const Zh = 5e4;
+class em {
   #e;
   #t;
   #i;
@@ -16122,7 +16149,7 @@ class Zh {
         i.push(s);
         continue;
       }
-      if (s.kind === "nodeUpdated" && tm(s)) continue;
+      if (s.kind === "nodeUpdated" && nm(s)) continue;
       const o = this.#d(s.labels ?? [], s.properties ?? {});
       o && (this.#h(s.id, o), s.kind === "nodeCreated" ? n.created.push(o) : s.kind === "nodeDeleted" ? n.deleted.push(o) : n.updated.push(o));
     }
@@ -16133,7 +16160,7 @@ class Zh {
       const a = this.#p(s.type, o, r);
       s.kind === "relationshipDeleted" ? n.disconnected.push(a) : s.kind === "relationshipCreated" ? n.connected.push(a) : n.updated.push(o, r);
     }
-    return em(n), n.entities.length > 0 || n.broad ? n : void 0;
+    return tm(n), n.entities.length > 0 || n.broad ? n : void 0;
   }
   /** The @node type and key of a node, from its labels and properties. */
   #d(t, n) {
@@ -16145,7 +16172,7 @@ class Zh {
     }
   }
   #h(t, n) {
-    this.#s.delete(t), this.#s.set(t, n), this.#s.size > Yh && this.#s.delete(this.#s.keys().next().value);
+    this.#s.delete(t), this.#s.set(t, n), this.#s.size > Zh && this.#s.delete(this.#s.keys().next().value);
   }
   /** Look up relationship ends the feed has not shown yet. */
   async #m(t) {
@@ -16193,7 +16220,7 @@ class Zh {
     return { type: t, field: "", from: n, to: i };
   }
 }
-function em(e) {
+function tm(e) {
   const t = /* @__PURE__ */ new Map(), n = (i) => t.set(`${i.type}\0${Y(i.key)}`, i);
   for (const i of [...e.created, ...e.updated, ...e.deleted])
     n(i);
@@ -16205,7 +16232,7 @@ function em(e) {
     )
   ].sort();
 }
-function tm(e) {
+function nm(e) {
   const t = [...e.setKeys ?? [], ...e.removedKeys ?? []];
   return t.length > 0 && t.every($l) && (e.addedLabels ?? []).length === 0 && (e.removedLabels ?? []).length === 0;
 }
@@ -16219,7 +16246,7 @@ function Hr(e, t) {
     }
   });
 }
-class nm {
+class sm {
   #e;
   #t;
   #i = /* @__PURE__ */ new Set();
@@ -16233,7 +16260,7 @@ class nm {
         throw new Error(
           "changeFeed needs a driver with changes() (@loradb/lora-node)"
         );
-      this.#o = new Zh(
+      this.#o = new em(
         t.driver,
         t.model,
         (n) => {
@@ -16323,7 +16350,7 @@ class nm {
   }
 }
 const mo = Symbol("change"), sl = Symbol("selfOwns");
-function sm(e, t) {
+function im(e, t) {
   const n = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
   for (const a of e.before ?? [])
     a.type === t.name && i.set(Y(a.key), a.properties);
@@ -16458,7 +16485,7 @@ function $n(e, t, n, i) {
   }
   return s;
 }
-class im {
+class om {
   #e;
   #t;
   #i;
@@ -16621,7 +16648,7 @@ class im {
     for (const s of n) {
       const o = this.#l.get(s);
       if (!o) continue;
-      const r = sm(t, o.node);
+      const r = im(t, o.node);
       if (r.length === 0 || (o.all.size > 0 && i(o.all, r), o.byKey.size === 0)) continue;
       const a = /* @__PURE__ */ new Map();
       for (const c of r) {
@@ -16923,7 +16950,7 @@ class im {
     return a || (a = i(), r.set(o, a)), a;
   }
 }
-class fm {
+class pm {
   model;
   #e;
   #t;
@@ -16977,7 +17004,7 @@ class fm {
   /** Per-request timing collectors, by GraphQL context (see `timing`). */
   #W = /* @__PURE__ */ new WeakMap();
   constructor(t) {
-    this.model = hh(t.typeDefs, t), this.#e = _f(
+    this.model = mh(t.typeDefs, t), this.#e = Mf(
       t.driver,
       t.maxQueuedWrites ?? 512,
       (s) => U(
@@ -16986,9 +17013,9 @@ class fm {
       )
     ), this.#t = t.timeoutMs ?? 1e4;
     const n = t.compileCacheBytes ?? Tc;
-    if (this.#z = new Ef($c, n), this.#i = new Nh({
-      operationTimeoutMs: t.operationTimeoutMs ?? this.#t * Lf,
-      maxConcurrentStatements: t.maxConcurrentStatements ?? jf,
+    if (this.#z = new wf($c, n), this.#i = new Sh({
+      operationTimeoutMs: t.operationTimeoutMs ?? this.#t * Pf,
+      maxConcurrentStatements: t.maxConcurrentStatements ?? Lf,
       maxCost: t.maxCost ?? 5e4,
       budget: t.budget,
       onCost: t.onCost
@@ -17029,14 +17056,14 @@ class fm {
         );
     if (i.length > 0)
       throw new Gt(i.map((s) => ({ message: s })));
-    this.#E = t.jwt ?? ((s) => s?.jwt), this.#$ = t.onStatement, this.#A = t.maskErrors ?? Kc() === "production", this.#C = t.onError, this.#g = t.guards ?? {}, this.#w = new nm({
+    this.#E = t.jwt ?? ((s) => s?.jwt), this.#$ = t.onStatement, this.#A = t.maskErrors ?? Kc() === "production", this.#C = t.onError, this.#g = t.guards ?? {}, this.#w = new sm({
       driver: t.driver,
       model: this.model,
       changeFeed: t.changeFeed,
       maxQueued: t.maxQueuedChanges ?? 1e3,
       onError: this.#C,
       onWrite: (s) => this.onWrite(s)
-    }), this.#I = new im({
+    }), this.#I = new om({
       model: this.model,
       driver: this.#e,
       changes: this.#w,
@@ -17051,7 +17078,7 @@ class fm {
       statisticsVersion: () => this.#L,
       charge: (s, o, r) => this.#i.charge(s, o, r),
       run: (s, o, r, a, c, l) => this.#R(s, o, r, a, c, l)
-    }), this.#y = new yh(t), this.#v = new kh({
+    }), this.#y = new Eh(t), this.#v = new Nh({
       guards: this.#g,
       persistedOnly: t.persistedOnly ?? !1,
       bytesMax: n,
@@ -17077,7 +17104,7 @@ class fm {
    * errors across list indices, as `execute()` does.
    */
   envelopPlugin() {
-    const t = Op(
+    const t = Cp(
       this.#g === !1 ? {
         maxDepth: 1 / 0,
         maxIntrospectionDepth: 1 / 0,
@@ -17139,7 +17166,7 @@ class fm {
       });
     };
     if (this.#P) return this.#P;
-    const n = Jh(this.model, {
+    const n = Yh(this.model, {
       scalars: this.#T,
       customResolver: (s, o) => this.#b[s.name][o.name],
       subscribe: (s, o, r) => this.#I.subscribe(s, o, r),
@@ -17188,7 +17215,7 @@ class fm {
         () => this.#re(s, o, r, a)
       )
     });
-    wh(this.model, n);
+    vh(this.model, n);
     const i = wl(n);
     if (i.length > 0)
       throw new Gt(
@@ -17230,7 +17257,7 @@ class fm {
    * degrees (see `src/compile/cost.ts`).
    */
   async analyze(t = {}) {
-    const n = await pf(this.#e, this.model, {
+    const n = await hf(this.#e, this.model, {
       ...t,
       timeoutMs: this.#t
     });
@@ -17253,7 +17280,7 @@ class fm {
    * model; stable, so it can be snapshotted and reviewed as a diff.
    */
   accessMatrix() {
-    return ff(this.model, this.getSchema());
+    return pf(this.model, this.getSchema());
   }
   /**
    * Who may run an operation: per root field, the verdict for each kind
@@ -17275,7 +17302,7 @@ class fm {
     const r = /* @__PURE__ */ new Map();
     for (const a of s.definitions)
       a.kind === fe.FRAGMENT_DEFINITION && r.set(a.name.value, a);
-    return df(
+    return ff(
       this.model,
       this.getSchema(),
       o,
@@ -17290,7 +17317,7 @@ class fm {
    * validate with any JSON Schema library.
    */
   inputSchemas() {
-    return Np(this.model);
+    return Sp(this.model);
   }
   /**
    * Stored values that break a validation rule of their field: rules are
@@ -17312,7 +17339,7 @@ class fm {
     const n = {
       ok: !0,
       warnings: this.model.warnings,
-      cypher: await kd(this.#e, this.model),
+      cypher: await Nd(this.#e, this.model),
       // An index defined differently from the model is as good as missing.
       missing: await this.assertSchema().then((i) => [
         ...i.missing,
@@ -17320,10 +17347,10 @@ class fm {
       ]),
       unused: await Sl(this.#H()),
       lint: [
-        ...Ud(this.model, { statistics: !!this.#D }),
-        ...Qd(this.model, this.getSchema())
+        ...jd(this.model, { statistics: !!this.#D }),
+        ...Kd(this.model, this.getSchema())
       ],
-      security: jd(this.model),
+      security: Ld(this.model),
       plans: [],
       errors: [],
       stored: (await vr(this.#e, this.model)).violations
@@ -17377,7 +17404,7 @@ class fm {
     for (const [l, u] of a)
       c.push({
         field: l,
-        reports: await Od(this.#e, u, {
+        reports: await Cd(this.#e, u, {
           ...i !== void 0 ? { rowBudget: i } : {}
         })
       });
@@ -17411,7 +17438,7 @@ class fm {
       if (p.kind !== fe.FIELD || p.name.value.startsWith("__")) continue;
       const h = d.getFields()[p.name.value];
       if (!h) continue;
-      const m = this.#k(u, i.context), g = Ei(m, h, p), y = this.model.queries.find((D) => D.name === p.name.value), E = Sh(this.model, p.name.value), v = Rh(this.model, p.name.value);
+      const m = this.#k(u, i.context), g = Ei(m, h, p), y = this.model.queries.find((D) => D.name === p.name.value), E = Rh(this.model, p.name.value), v = Ih(this.model, p.name.value);
       let $;
       const N = [...this.model.abstracts.values()].find(
         (D) => D.read && D.plural === p.name.value
@@ -17437,7 +17464,7 @@ class fm {
     ))
       s.push({
         field: o,
-        reports: await Nd(this.#e, r, {
+        reports: await Sd(this.#e, r, {
           ...i.rowBudget !== void 0 ? { rowBudget: i.rowBudget } : {}
         })
       });
@@ -17459,11 +17486,11 @@ class fm {
    * `loadManifest()`, built once at build time (`lora-graphql compile`).
    */
   buildManifest(t) {
-    return Sp(this.getSchema(), t, this.validationRules());
+    return Rp(this.getSchema(), t, this.validationRules());
   }
   /** TypeScript types for a manifest's variables and results. */
   generateTypes(t) {
-    return Rp(this.getSchema(), t, this.model.scalars);
+    return Ip(this.getSchema(), t, this.model.scalars);
   }
   /**
    * Register a manifest's operations as persisted operations, without
@@ -17511,7 +17538,7 @@ class fm {
     const o = t.operationName ?? "";
     return s.has(o) || s.set(
       o,
-      $h(
+      Th(
         this.getSchema(),
         this.model,
         i,
@@ -17660,7 +17687,7 @@ class fm {
   }
   /** Whether a read with this read-set may observe the change. */
   affects(t, n) {
-    return fd(
+    return pd(
       t,
       n,
       (i) => this.model.nodes.get(i)?.labels ?? []
@@ -17706,7 +17733,7 @@ class fm {
       const h = (m) => this.#e.run(n.statements, {
         mode: n.mode,
         timeoutMs: u && this.#t > 0 ? Math.max(1, Math.min(this.#t, u.remaining())) : this.#t,
-        signal: m ? xf(c, m) : c,
+        signal: m ? Ff(c, m) : c,
         // Queries and object @cypher fields are checked read-only
         // when the model is built; writes never reach this path.
         verified: n.mode === "read",
@@ -17768,7 +17795,7 @@ class fm {
     );
   }
   #O(t, n) {
-    return bh(
+    return $h(
       {
         model: this.model,
         maskErrors: this.#A,
@@ -17789,7 +17816,7 @@ class fm {
         this.#S(r, i.parentType, i.fieldNodes),
         i.fieldNodes
       ),
-      Af(t, n, i.fieldNodes)
+      kf(t, n, i.fieldNodes)
     );
     return this.#R(i.fieldName, o, s, i);
   }
@@ -17809,7 +17836,7 @@ class fm {
     return this.#R(i.fieldName, r, s, i);
   }
   async #se(t, n, i) {
-    const s = Hh(t), o = s && this.model.nodes.get(s.type);
+    const s = Vh(t), o = s && this.model.nodes.get(s.type);
     if (!s || !o || !o.key.relayId || !o.read) return null;
     let r = s.key;
     if (o.key.type === "BigInt" && typeof r == "string") {
@@ -17853,7 +17880,7 @@ class fm {
     this.#J(n, i);
     let l, u;
     try {
-      ({ value: l, written: u } = await Uf(
+      ({ value: l, written: u } = await jf(
         this.#G(n, i, s.jwt),
         t,
         c,
@@ -17904,7 +17931,7 @@ class fm {
     this.#J(i, s);
     const o = this.#k(Ut(i), s), r = this.#S(o, i.parentType, i.fieldNodes);
     try {
-      const { payload: a, change: c } = await vp(
+      const { payload: a, change: c } = await bp(
         this.#G(i, s, o.jwt),
         t,
         n,
@@ -18061,7 +18088,7 @@ class fm {
       throw new Error(
         i ? `worker("${t}"): ${t} has no @outbox` : `worker("${t}"): no @node type ${t}`
       );
-    const s = new Tp(
+    const s = new Ap(
       {
         driver: this.#e,
         node: i,
@@ -18073,6 +18100,25 @@ class fm {
     );
     return this.#h.add(s), s;
   }
+  /**
+   * Write an online copy of the database into `targetDir` (missing or
+   * empty) while requests keep running: the graph as of one committed
+   * transaction, as `<targetDir>/<name>.loradb`, which opens with
+   * `createDatabase(name, { databaseDir: targetDir })`. Mutations wait
+   * only while the graph is taken, not while it is written. For an
+   * off-host backup of a database this process owns.
+   *
+   * Needs a driver with `snapshot()`: `loraDriver(db)` over a lora-node
+   * database opened with a name and `databaseDir`.
+   */
+  async snapshot(t) {
+    const n = this.#e;
+    if (!n?.snapshot)
+      throw new Error(
+        "snapshot() needs a driver with snapshot(): pass loraDriver(db) over a lora-node database opened with a name and databaseDir"
+      );
+    return n.snapshot(t);
+  }
   /** Stop the workers, and the engine change feed (with `changeFeed: true`). */
   close() {
     for (const t of this.#h) t.stop();
@@ -18083,30 +18129,30 @@ export {
   vn as D,
   Ml as L,
   Gt as M,
-  fm as a,
+  pm as a,
   tc as b,
-  hh as c,
-  Nd as d,
+  mh as c,
+  Sd as d,
   Xc as e,
-  Op as f,
+  Cp as f,
   _l as g,
-  Hh as h,
+  Vh as h,
   kl as i,
-  Np as j,
-  cm as k,
-  um as l,
+  Sp as j,
+  lm as k,
+  dm as l,
   qc as m,
-  rm as n,
+  am as n,
   R as o,
   Vc as p,
-  Jh as q,
+  Yh as q,
   vo as r,
-  Id as s,
-  Wh as t,
-  lm as u,
+  Dd as s,
+  Hh as t,
+  um as u,
   Hc as v,
   Ys as w,
-  am as x,
-  dm as y
+  cm as x,
+  fm as y
 };
-//# sourceMappingURL=lora-graphql-upoPizGA.js.map
+//# sourceMappingURL=lora-graphql-BW8S6TRu.js.map