@loradb/lora-graphql 0.26.1 → 0.26.2

package/dist/{lora-graphql-CR1tRkf_.js → lora-graphql-CjaQGsy7.js}

@@ -1,4 +1,4 @@
-import { GraphQLError as ve, getNullableType as Zc, isListType as en, Kind as fe, isInputObjectType as Mi, versionInfo as el, getArgumentValues as tl, getDirectiveValues as ai, GraphQLSkipDirective as nl, GraphQLIncludeDirective as sl, isAbstractType as il, isObjectType as tn, isNonNullType as lt, isScalarType as Wt, isEnumType as Lt, getNamedType as He, parse as Ze, GraphQLObjectType as we, GraphQLNonNull as We, GraphQLInt as me, GraphQLList as ji, GraphQLInputObjectType as Ae, GraphQLBoolean as $t, GraphQLFloat as Ne, visit as Br, valueFromASTUntyped as ol, validate as Ss, specifiedRules as Li, typeFromAST as rl, printSchema as qr, lexicographicSortSchema as Wr, isInterfaceType as ut, isUnionType as Rs, GraphQLSchema as Hr, ValidationContext as al, valueFromAST as cl, buildASTSchema as ll, concatAST as ul, getOperationAST as vn, GraphQLScalarType as ns, GraphQLEnumType as Sn, GraphQLString as _e, GraphQLInterfaceType as ci, GraphQLID as Rn, GraphQLUnionType as dl, validateSchema as fl, execute as ho, getVariableValues as pl, subscribe as hl } from "graphql";
+import { GraphQLError as ve, getNullableType as Zc, isListType as en, Kind as fe, isInputObjectType as Mi, versionInfo as el, getArgumentValues as tl, getDirectiveValues as ai, GraphQLSkipDirective as nl, GraphQLIncludeDirective as sl, isAbstractType as il, isObjectType as tn, isNonNullType as lt, isScalarType as Wt, isEnumType as Lt, getNamedType as He, parse as Ze, GraphQLObjectType as we, GraphQLNonNull as We, GraphQLInt as he, GraphQLList as ji, GraphQLInputObjectType as Ae, GraphQLBoolean as $t, GraphQLFloat as Ne, visit as Br, valueFromASTUntyped as ol, validate as Ss, specifiedRules as Li, typeFromAST as rl, printSchema as qr, lexicographicSortSchema as Wr, isInterfaceType as ut, isUnionType as Rs, GraphQLSchema as Hr, ValidationContext as al, valueFromAST as cl, buildASTSchema as ll, concatAST as ul, getOperationAST as vn, GraphQLScalarType as ns, GraphQLEnumType as Sn, GraphQLString as _e, GraphQLInterfaceType as ci, GraphQLID as Rn, GraphQLUnionType as dl, validateSchema as fl, execute as ho, getVariableValues as pl, subscribe as hl } from "graphql";
 const Te = {
   /** `PENDING`, `CLAIMED`, `DONE` or `FAILED`. */
   state: "_outbox",
@@ -253,14 +253,14 @@ function li(e, t, n) {
   const i = e.labelsOrTypes, s = e.properties;
   return e.entityType === "NODE" && i?.length === 1 && i[0] === t && s?.length === 1 && s[0] === n;
 }
-const _ = (e) => ({ kind: "var", name: e }), $l = (e) => ({ kind: "param", name: e }), G = (e) => ({
+const U = (e) => ({ kind: "var", name: e }), $l = (e) => ({ kind: "param", name: e }), G = (e) => ({
   kind: "literal",
   value: e
-}), ae = (e, t) => ({
+}), ue = (e, t) => ({
   kind: "prop",
   target: e,
   key: t
-}), ee = (e, t, n) => ({
+}), se = (e, t, n) => ({
   kind: "binary",
   op: e,
   left: t,
@@ -269,7 +269,7 @@ const _ = (e) => ({ kind: "var", name: e }), $l = (e) => ({ kind: "param", name:
   kind: "isNull",
   expr: e,
   negated: t
-}), oe = (e, ...t) => ({
+}), ee = (e, ...t) => ({
   kind: "call",
   fn: e,
   args: t
@@ -283,7 +283,7 @@ function nn(...e) {
 function Gr(e, t) {
   const n = t.filter((i) => i !== void 0);
   if (n.length !== 0)
-    return n.reduce((i, s) => ee(e, i, s));
+    return n.reduce((i, s) => se(e, i, s));
 }
 const Tl = /^[A-Za-z_][A-Za-z0-9_]*$/, Al = new Set(
   [
@@ -836,7 +836,7 @@ function B(e, t) {
   const n = `p${Object.keys(e.params).length}`;
   return e.params[n] = t, $l(n);
 }
-function he(e, t) {
+function ye(e, t) {
   let n = t;
   for (let i = 1; e.vars.has(n); i++) n = `${t}${i}`;
   return e.vars.add(n), n;
@@ -887,12 +887,12 @@ function Tt(e, t) {
 }
 function Cs(e, t, n, i = {}) {
   if (t === "shortestLength" || t === "longestLength" || t === "averageLength") {
-    const u = he(e, "agg_s"), d = {
+    const u = ye(e, "agg_s"), d = {
       kind: "listComprehension",
       variable: u,
       list: n,
-      where: ct(_(u), !0),
-      projection: oe("size", _(u))
+      where: ct(U(u), !0),
+      projection: ee("size", U(u))
     };
     return Cs(e, {
       shortestLength: "min",
@@ -900,13 +900,13 @@ function Cs(e, t, n, i = {}) {
       averageLength: "avg"
     }[t], d);
   }
-  const s = he(e, "agg_v"), o = {
+  const s = ye(e, "agg_v"), o = {
     kind: "listComprehension",
     variable: s,
     list: n,
-    where: ct(_(s), !0),
+    where: ct(U(s), !0),
     projection: void 0
-  }, r = he(e, "agg_acc"), a = he(e, "agg_item"), c = (u, d) => ({
+  }, r = ye(e, "agg_acc"), a = ye(e, "agg_item"), c = (u, d) => ({
     kind: "reduce",
     accumulator: r,
     init: u,
@@ -916,7 +916,7 @@ function Cs(e, t, n, i = {}) {
   });
   switch (t) {
     case "count":
-      return oe("size", o);
+      return ee("size", o);
     case "min":
     case "max":
       return c(G(null), {
@@ -924,11 +924,11 @@ function Cs(e, t, n, i = {}) {
         when: {
           kind: "binary",
           op: "OR",
-          left: ct(_(r)),
-          right: ee(t === "min" ? "<" : ">", _(a), _(r))
+          left: ct(U(r)),
+          right: se(t === "min" ? "<" : ">", U(a), U(r))
         },
-        then: _(a),
-        else: _(r)
+        then: U(a),
+        else: U(r)
       });
     case "shortest":
     case "longest":
@@ -937,54 +937,41 @@ function Cs(e, t, n, i = {}) {
         when: {
           kind: "binary",
           op: "OR",
-          left: ct(_(r)),
-          right: ee(
+          left: ct(U(r)),
+          right: se(
             t === "shortest" ? "<" : ">",
-            oe("size", _(a)),
-            oe("size", _(r))
+            ee("size", U(a)),
+            ee("size", U(r))
           )
         },
-        then: _(a),
-        else: _(r)
+        then: U(a),
+        else: U(r)
       });
     case "sum":
-      return i.duration ? l() : c(G(0), ee("+", _(r), _(a)));
+      return i.duration ? l() : c(G(0), se("+", U(r), U(a)));
     case "avg":
       return {
         kind: "case",
-        when: ee("=", oe("size", o), G(0)),
+        when: se("=", ee("size", o), G(0)),
         then: G(null),
-        else: ee(
+        else: se(
           "/",
-          i.duration ? l() : oe("toFloat", c(G(0), ee("+", _(r), _(a)))),
-          oe("size", o)
+          i.duration ? l() : ee("toFloat", c(G(0), se("+", U(r), U(a)))),
+          ee("size", o)
         )
       };
   }
   function l() {
     return c(G(null), {
       kind: "case",
-      when: ct(_(r)),
-      then: _(a),
-      else: ee("+", _(r), _(a))
+      when: ct(U(r)),
+      then: U(a),
+      else: se("+", U(r), U(a))
     });
   }
 }
-function xi(e, t) {
-  const n = he(e, "seen"), i = he(e, "seen_key");
-  return oe("size", {
-    kind: "reduce",
-    accumulator: n,
-    init: { kind: "list", items: [] },
-    variable: i,
-    list: t,
-    step: {
-      kind: "case",
-      when: ee("IN", _(i), _(n)),
-      then: _(n),
-      else: ee("+", _(n), { kind: "list", items: [_(i)] })
-    }
-  });
+function xi(e) {
+  return ee("size", ee("list.unique", e));
 }
 const ta = 2, Pl = 1e3, xl = 1e4, Fl = /* @__PURE__ */ new Set(["eq", "in", "startsWith", "withinBBox", "distance"]), zl = /* @__PURE__ */ new Set(["lt", "lte", "gt", "gte"]);
 function Bl(e, t, n) {
@@ -1139,7 +1126,7 @@ function ia(e, t, n) {
       return (r) => {
         const a = is(
           e,
-          aa(e, t, s, n, ae(_(n), s.property)),
+          aa(e, t, s, n, ue(U(n), s.property)),
           r
         );
         return a && yn(o, a);
@@ -1163,7 +1150,7 @@ function ia(e, t, n) {
         );
       const r = je(e, t, s, n, "READ");
       return (a) => {
-        const c = is(e, _(o), a);
+        const c = is(e, U(o), a);
         return c && yn(r, c);
       };
     }
@@ -1202,7 +1189,7 @@ function ia(e, t, n) {
   };
 }
 function yn(e, t) {
-  return e ? pe(oe("coalesce", e, G(!1)), t) : t;
+  return e ? pe(ee("coalesce", e, G(!1)), t) : t;
 }
 function Hs(e, t, n) {
   if (e.inAuth) return n();
@@ -1223,7 +1210,7 @@ function Hs(e, t, n) {
 function Us(e, t, n, i) {
   return Kt(e, i, (s) => {
     const o = t.fields.get(s);
-    return o && dn(e, t.name, o, "READ"), o ? (r) => is(e, ae(_(n), o.property), r) : void 0;
+    return o && dn(e, t.name, o, "READ"), o ? (r) => is(e, ue(U(n), o.property), r) : void 0;
   });
 }
 function Kt(e, t, n) {
@@ -1285,7 +1272,7 @@ function is(e, t, n) {
       case "withinBBox": {
         const a = o;
         i.push(
-          oe(
+          ee(
             "geo.within_bbox",
             t,
             B(e, $n(a.lowerLeft)),
@@ -1297,34 +1284,34 @@ function is(e, t, n) {
       case "distance": {
         const a = o;
         i.push(
-          ee(
+          se(
             "<=",
-            oe("geo.distance", t, B(e, $n(a.from))),
+            ee("geo.distance", t, B(e, $n(a.from))),
             B(e, a.lte)
           )
         );
         continue;
       }
       case "includes":
-        i.push(ee("IN", B(e, o), t));
+        i.push(se("IN", B(e, o), t));
         continue;
       case "isNull":
         i.push(ct(t, o === !1));
         continue;
       case "caseInsensitive": {
-        const a = oe("toLower", t);
+        const a = ee("toLower", t);
         for (const [c, l] of Object.entries(o)) {
           if (l == null) continue;
           const u = ko[c];
           if (!u) continue;
           const d = Array.isArray(l) ? l.map((f) => String(f).toLowerCase()) : String(l).toLowerCase();
-          i.push(ee(u, a, B(e, d)));
+          i.push(se(u, a, B(e, d)));
         }
         continue;
       }
     }
     const r = ko[s];
-    r && i.push(ee(r, t, B(e, o)));
+    r && i.push(se(r, t, B(e, o)));
   }
   return pe(...i);
 }
@@ -1344,12 +1331,12 @@ function Ut(e, t, n, i, s) {
   };
 }
 function Ft(e, t, n, i, s) {
-  const o = e.model.nodes.get(n.target), r = he(e, `${t}_${n.name}`), a = he(e, `${r}_rel`);
+  const o = e.model.nodes.get(n.target), r = ye(e, `${t}_${n.name}`), a = ye(e, `${r}_rel`);
   return {
     kind: "comprehension",
     pattern: Ut(t, n, o.labels[0], r, a),
     // Related nodes the reader may not see do not count, in any quantifier.
-    where: pe(ce(e, o, r, "READ"), i(r, a)),
+    where: pe(ae(e, o, r, "READ"), i(r, a)),
     projection: s(r, a)
   };
 }
@@ -1373,12 +1360,12 @@ function pi(e, t, n, i, s) {
 function Kl(e, t, n, i) {
   const s = jl(e.model, n), o = Je(e.model, n).map((f) => {
     const p = e.model.nodes.get(f.target);
-    return ge(e, p, "READ"), e.reads.labels.add(p.labels[0]), { field: f, node: p };
+    return me(e, p, "READ"), e.reads.labels.add(p.labels[0]), { field: f, node: p };
   });
   e.reads.relationships.add(n.type);
-  const r = (f, p, h) => pi(e, s, f, p, h), a = (f) => f.length === 0 ? G(0) : f.reduce((p, h) => ee("+", p, h)), c = (f) => a(
+  const r = (f, p, h) => pi(e, s, f, p, h), a = (f) => f.length === 0 ? G(0) : f.reduce((p, h) => se("+", p, h)), c = (f) => a(
     o.flatMap(({ field: p, node: h }) => r(h, "probe", f) === !1 ? [] : [
-      oe(
+      ee(
         "size",
         Ft(
           e,
@@ -1396,41 +1383,35 @@ function Kl(e, t, n, i) {
         t,
         h,
         (g) => r(m, g, f) || void 0,
-        (g) => ({
-          kind: "list",
-          items: [G(m.name), ae(_(g), m.key.property)]
-        })
+        (g) => ee("id", U(g))
       )
     ]);
-    return p.length === 0 ? G(0) : xi(
-      e,
-      p.reduce((h, m) => ee("+", h, m))
-    );
+    return p.length === 0 ? G(0) : xi(p.reduce((h, m) => se("+", h, m)));
   }, u = (f) => o.some(({ node: p }) => {
     const h = { ...e, params: {}, vars: new Set(e.vars) };
     return pi(h, s, p, "probe", f) !== void 0;
   });
   if (!n.list)
-    return u(i) ? ee(">", c(i), G(0)) : void 0;
+    return u(i) ? se(">", c(i), G(0)) : void 0;
   const d = [];
   for (const [f, p] of Object.entries(i)) {
     if (p == null) continue;
     const h = p;
     switch (f) {
       case "some":
-        u(h) && d.push(ee(">", c(h), G(0)));
+        u(h) && d.push(se(">", c(h), G(0)));
         break;
       case "none":
-        u(h) && d.push(ee("=", c(h), G(0)));
+        u(h) && d.push(se("=", c(h), G(0)));
         break;
       case "single":
-        u(h) && d.push(ee("=", l(h), G(1)));
+        u(h) && d.push(se("=", l(h), G(1)));
         break;
       case "all": {
         if (!u(h)) break;
         const m = a(
           o.map(
-            ({ field: g, node: y }) => oe(
+            ({ field: g, node: y }) => ee(
               "size",
               Ft(
                 e,
@@ -1439,18 +1420,26 @@ function Kl(e, t, n, i) {
                 (E) => {
                   const b = r(y, E, h);
                   if (b !== !1)
-                    return b ? un(oe("coalesce", b, G(!1))) : G(!1);
+                    return b ? un(ee("coalesce", b, G(!1))) : G(!1);
                 },
                 () => G(1)
               )
             )
           )
         );
-        d.push(ee("=", m, G(0)));
+        d.push(se("=", m, G(0)));
         break;
       }
       case "count":
-        d.push(oa(e, n, l(void 0), h));
+        d.push(
+          oa(
+            e,
+            n,
+            () => l(void 0),
+            () => c(void 0),
+            h
+          )
+        );
         break;
       case "aggregate":
         s || d.push(eu(e, t, n, h));
@@ -1462,7 +1451,7 @@ function Kl(e, t, n, i) {
 function Xl(e, t, n, i) {
   const s = Je(e.model, n).map((r) => {
     const a = e.model.nodes.get(r.target);
-    return ge(e, a, "READ"), e.reads.labels.add(a.labels[0]), oe(
+    return me(e, a, "READ"), e.reads.labels.add(a.labels[0]), ee(
       "size",
       Ft(
         e,
@@ -1475,32 +1464,32 @@ function Xl(e, t, n, i) {
     );
   });
   e.reads.relationships.add(n.type);
-  const o = s.length === 0 ? G(0) : s.reduce((r, a) => ee("+", r, a));
-  return ee(i ? ">" : "=", o, G(0));
+  const o = s.length === 0 ? G(0) : s.reduce((r, a) => se("+", r, a));
+  return se(i ? ">" : "=", o, G(0));
 }
-function oa(e, t, n, i) {
-  const s = [];
-  for (const [o, r] of Object.entries(i)) {
-    if (r == null) continue;
-    const a = Ql[o];
-    if (a) {
-      if (!Number.isInteger(r) || r < 0)
-        throw M(
-          "BAD_USER_INPUT",
-          `${t.name}.count.${o} must be a non-negative integer`
-        );
-      s.push(ee(a, n, B(e, r)));
-    }
+function oa(e, t, n, i, s) {
+  const o = [];
+  for (const [r, a] of Object.entries(s)) {
+    if (a == null) continue;
+    const c = Ql[r];
+    if (!c) continue;
+    if (!Number.isInteger(a) || a < 0)
+      throw M(
+        "BAD_USER_INPUT",
+        `${t.name}.count.${r} must be a non-negative integer`
+      );
+    const l = r === "lt" || r === "gte" ? a <= 1 : a === 0;
+    o.push(se(c, l ? i() : n(), B(e, a)));
   }
-  return pe(...s);
+  return pe(...o);
 }
 function Jl(e, t, n, i) {
   const s = e.model.nodes.get(n.target), o = e.model.relationshipProperties.get(n.properties);
-  ge(e, s, "READ"), e.reads.labels.add(s.labels[0]), e.reads.relationships.add(n.type);
+  me(e, s, "READ"), e.reads.labels.add(s.labels[0]), e.reads.relationships.add(n.type);
   const r = (l) => (u, d) => pe(
     qe(e, s, u, l.node),
     Us(e, o, d, l.edge)
-  ), a = (l, u) => oe(
+  ), a = (l, u) => ee(
     "size",
     Ft(
       e,
@@ -1508,7 +1497,7 @@ function Jl(e, t, n, i) {
       n,
       (d, f) => {
         const p = r(l)(d, f);
-        return u ? un(oe("coalesce", p, G(!1))) : p;
+        return u ? un(ee("coalesce", p, G(!1))) : p;
       },
       () => G(1)
     )
@@ -1519,16 +1508,16 @@ function Jl(e, t, n, i) {
     if (Yl(e, s, o, d))
       switch (d.edge != null && da(e, n), l) {
         case "some":
-          c.push(ee(">", a(d, !1), G(0)));
+          c.push(se(">", a(d, !1), G(0)));
           break;
         case "none":
-          c.push(ee("=", a(d, !1), G(0)));
+          c.push(se("=", a(d, !1), G(0)));
           break;
         case "single":
-          c.push(ee("=", a(d, !1), G(1)));
+          c.push(se("=", a(d, !1), G(1)));
           break;
         case "all":
-          c.push(ee("=", a(d, !0), G(0)));
+          c.push(se("=", a(d, !0), G(0)));
           break;
       }
   }
@@ -1578,7 +1567,7 @@ function eu(e, t, n, i) {
             n,
             () => {
             },
-            (E, b) => ae(_(u ? b : E), p.property)
+            (E, b) => ue(U(u ? b : E), p.property)
           ), y = Cs(e, h, g, {
             duration: p.type === "Duration"
           });
@@ -1595,18 +1584,20 @@ function eu(e, t, n, i) {
     },
     !1
   ), o && (i.edge != null && da(e, n), a(i.edge, (c) => o.fields.get(c), !0)), i.count) {
-    const c = xi(
-      e,
-      Ft(
+    const c = (l) => Ft(e, t, n, () => {
+    }, l);
+    r.push(
+      oa(
         e,
-        t,
         n,
-        () => {
-        },
-        (l) => ae(_(l), s.key.property)
+        () => xi(c((l) => ee("id", U(l)))),
+        () => ee(
+          "size",
+          c(() => G(1))
+        ),
+        i.count
       )
     );
-    r.push(oa(e, n, c, i.count));
   }
   return pe(...r);
 }
@@ -1626,14 +1617,14 @@ function Ms(e, t) {
     throw n;
   }
 }
-function ge(e, t, n) {
+function me(e, t, n) {
   if (!e.inAuth && t.authentication?.has(n) && (!e.jwt || !Ms(e, t.authenticationJwt)))
     throw M(
       "UNAUTHENTICATED",
       `${n.toLowerCase()} on ${t.name} needs an authenticated request`
     );
 }
-function ce(e, t, n, i) {
+function ae(e, t, n, i) {
   if (e.inAuth || Ue(e, t)) return;
   const s = (t.authorization?.filter ?? []).filter(
     (r) => r.operations.has(i)
@@ -1780,7 +1771,7 @@ function aa(e, t, n, i, s) {
     const l = B(e, a.value);
     r = c === !1 ? l : {
       kind: "case",
-      when: oe("coalesce", c, G(!1)),
+      when: ee("coalesce", c, G(!1)),
       then: r,
       else: l
     };
@@ -1822,8 +1813,8 @@ function ca(e) {
   const i = it(e, t.claim, !0);
   if (typeof i != "string" && typeof i != "number") return G(null);
   if (t.field === n.key.name) return B(e, i);
-  const s = n.fields.get(t.field), o = s?.kind === "scalar" ? s.property : t.field, r = he(e, "viewer");
-  return oe("head", {
+  const s = n.fields.get(t.field), o = s?.kind === "scalar" ? s.property : t.field, r = ye(e, "viewer");
+  return ee("head", {
     kind: "comprehension",
     pattern: {
       start: {
@@ -1973,7 +1964,7 @@ function Ot(e, t, n, i, s = "write") {
           variable: i.target,
           labels: [e.model.nodes.get(l.target).labels[0]]
         };
-        return ee("OR", un(d), u === !1 ? G(!1) : u);
+        return se("OR", un(d), u === !1 ? G(!1) : u);
       })
     );
     return c === !0 ? void 0 : c === !1 ? !1 : c;
@@ -2047,13 +2038,13 @@ function ru(e, t) {
   if (!n || !i) return !1;
   const s = an(`$jwt.${n.claim}`, e), o = an(t, e);
   if (!s.ok || !o.ok) throw new pt();
-  const r = i.fields.get(n.field), a = r?.kind === "scalar" ? r.property : n.field, c = he(e, "viewer"), l = e.inAuth;
+  const r = i.fields.get(n.field), a = r?.kind === "scalar" ? r.property : n.field, c = ye(e, "viewer"), l = e.inAuth;
   e.inAuth = !0;
   try {
     const u = qe(e, i, c, o.value);
-    return ee(
+    return se(
       ">",
-      oe("size", {
+      ee("size", {
         kind: "comprehension",
         pattern: {
           start: {
@@ -2134,9 +2125,9 @@ function au(e, t, n) {
         s += String(h);
         continue;
       }
-      const m = p.fields.get(u), g = m?.kind === "scalar" ? m.property : u, y = he(e, "viewer");
+      const m = p.fields.get(u), g = m?.kind === "scalar" ? m.property : u, y = ye(e, "viewer");
       a(), i.push(
-        oe("head", {
+        ee("head", {
           kind: "comprehension",
           pattern: {
             start: {
@@ -2152,7 +2143,7 @@ function au(e, t, n) {
             hops: []
           },
           where: void 0,
-          projection: ae(_(y), g)
+          projection: ue(U(y), g)
         })
       );
       continue;
@@ -2172,14 +2163,14 @@ function au(e, t, n) {
   return s += t.slice(r), o ? i.length === 0 ? { ok: !0, value: s } : (a(), {
     ok: !0,
     value: Ll(
-      i.length === 1 ? i[0] : i.reduce((c, l) => ee("+", c, l))
+      i.length === 1 ? i[0] : i.reduce((c, l) => se("+", c, l))
     )
   }) : { ok: !1, value: void 0 };
 }
 function cu(e, t, n, i) {
   if (n === "edge") {
     const l = t?.edge, u = l?.props.fields.get(i);
-    return l && u ? ae(_(l.variable), u.property) : void 0;
+    return l && u ? ue(U(l.variable), u.property) : void 0;
   }
   const s = t?.[n];
   if (!s) return;
@@ -2191,8 +2182,8 @@ function cu(e, t, n, i) {
     const d = r.fields.get(u);
     if (l === o.length - 1) {
       if (d?.kind !== "scalar") return;
-      const p = ae(_(c), d.property);
-      return a.length === 0 ? p : oe("head", {
+      const p = ue(U(c), d.property);
+      return a.length === 0 ? p : ee("head", {
         kind: "comprehension",
         pattern: { start: { variable: s.variable, labels: [] }, hops: a },
         where: void 0,
@@ -2202,7 +2193,7 @@ function cu(e, t, n, i) {
     if (d?.kind !== "relationship" || d.list) return;
     const f = e.model.nodes.get(d.target);
     if (!f) return;
-    c = he(e, `${s.variable}_${u}`), a.push({
+    c = ye(e, `${s.variable}_${u}`), a.push({
       rel: {
         type: d.type,
         direction: d.queryDirection === "UNDIRECTED" ? "BOTH" : d.direction
@@ -2396,9 +2387,9 @@ function Ls(e, t, n) {
   const i = Re(e, t, n, "READ", "BEFORE");
   return i ? [
     {
-      expr: oe("sum", {
+      expr: ee("sum", {
         kind: "case",
-        when: oe("coalesce", i, G(!1)),
+        when: ee("coalesce", i, G(!1)),
         then: G(0),
         else: G(1)
       }),
@@ -2412,15 +2403,15 @@ function Ln(e) {
 }
 function qi(e, t) {
   return [
-    { kind: "with", items: [{ expr: oe("collect", e), alias: t }] },
-    { kind: "return", items: [{ expr: oe("head", _(t)), alias: t }] }
+    { kind: "with", items: [{ expr: ee("collect", e), alias: t }] },
+    { kind: "return", items: [{ expr: ee("head", U(t)), alias: t }] }
   ];
 }
 function Gn(e) {
-  return e && oe("coalesce", e, G(!1));
+  return e && ee("coalesce", e, G(!1));
 }
 function pa(e, t) {
-  return t === void 0 ? [] : [{ kind: "with", items: [{ expr: _("this") }], limit: B(e, t) }];
+  return t === void 0 ? [] : [{ kind: "with", items: [{ expr: U("this") }], limit: B(e, t) }];
 }
 const pu = ["some", "all", "none", "single"], hu = /* @__PURE__ */ new Map([
   ["some", 'ask `count: { gt: 0 }` for "has any"'],
@@ -2719,9 +2710,9 @@ function Hi(e, t, n) {
         "BAD_USER_INPUT",
         `${e.field.computedBy.owner}.${e.field.name} is computed by @cypher: sort by it in a root field only`
       );
-    return _(e.computed);
+    return U(e.computed);
   }
-  return ae(_(e.edge ? n : t), e.field.property);
+  return ue(U(e.edge ? n : t), e.field.property);
 }
 function It(e, t, n) {
   if (e == null) return t.default;
@@ -2811,7 +2802,7 @@ function Aa(e, t, n, i, s) {
   n.forEach((l, u) => {
     const d = Hi(l, t, s), f = i[u], p = f === null ? void 0 : B(e, f), h = yi(l);
     let m;
-    p === void 0 ? m = l.direction === "ASC" ? void 0 : ct(d, !0) : l.direction === "ASC" ? m = h ? ee(">", d, p) : nn(ee(">", d, p), ct(d)) : m = ee("<", d, p), m && o.push(pe(...r, m)), r.push(p === void 0 ? ct(d) : ee("=", d, p)), u === 0 && p !== void 0 && h && (a = ee(l.direction === "ASC" ? ">=" : "<=", d, p));
+    p === void 0 ? m = l.direction === "ASC" ? void 0 : ct(d, !0) : l.direction === "ASC" ? m = h ? se(">", d, p) : nn(se(">", d, p), ct(d)) : m = se("<", d, p), m && o.push(pe(...r, m)), r.push(p === void 0 ? ct(d) : se("=", d, p)), u === 0 && p !== void 0 && h && (a = se(l.direction === "ASC" ? ">=" : "<=", d, p));
   });
   const c = nn(...o) ?? G(!1);
   return pe(a, c);
@@ -3245,21 +3236,21 @@ function ja(e, t, n) {
   return i;
 }
 function La(e, t, n, i, s, o, r, a, c) {
-  const l = he(e, `this_${n.name}`), u = pi(e, t, n, l, s);
+  const l = ye(e, `this_${n.name}`), u = pi(e, t, n, l, s);
   if (u === !1) return;
-  ge(e, n, "READ"), e.reads.labels.add(n.labels[0]);
+  me(e, n, "READ"), e.reads.labels.add(n.labels[0]);
   const d = i(l), f = [
     ...o.map((y) => {
       const E = n.fields.get(y.name);
-      return { expr: ae(_(l), E.property), direction: y.direction };
+      return { expr: ue(U(l), E.property), direction: y.direction };
     }),
-    { expr: ae(_(l), n.key.property), direction: "ASC" }
-  ], p = Ye(e, n, l, a, c), h = p.expr, m = he(e, `${l}_list`), g = {
+    { expr: ue(U(l), n.key.property), direction: "ASC" }
+  ], p = Ye(e, n, l, a, c), h = p.expr, m = ye(e, `${l}_list`), g = {
     ...h,
     entries: [
       ...h.entries,
       { kind: "entry", key: "__typename", value: G(n.name) },
-      { kind: "entry", key: "__key", value: ae(_(l), n.key.property) },
+      { kind: "entry", key: "__key", value: ue(U(l), n.key.property) },
       ...o.map((y, E) => ({
         kind: "entry",
         key: `__s${E}`,
@@ -3273,22 +3264,22 @@ function La(e, t, n, i, s, o, r, a, c) {
       {
         kind: "match",
         pattern: d.pattern,
-        where: pe(d.where, u, ce(e, n, l, "READ"))
+        where: pe(d.where, u, ae(e, n, l, "READ"))
       },
-      { kind: "with", items: [{ expr: _(l) }], orderBy: f, limit: r },
+      { kind: "with", items: [{ expr: U(l) }], orderBy: f, limit: r },
       ...p.pre,
-      { kind: "return", items: [{ expr: oe("collect", g), alias: m }] }
+      { kind: "return", items: [{ expr: ee("collect", g), alias: m }] }
     ]
   };
 }
 function Pa(e, t) {
   return [
     ...t.map((n, i) => ({
-      expr: ae(_(e), `__s${i}`),
+      expr: ue(U(e), `__s${i}`),
       direction: n.direction
     })),
-    { expr: ae(_(e), "__typename"), direction: "ASC" },
-    { expr: ae(_(e), "__key"), direction: "ASC" }
+    { expr: ue(U(e), "__typename"), direction: "ASC" },
+    { expr: ue(U(e), "__key"), direction: "ASC" }
   ];
 }
 function Lo(e, t, n, i) {
@@ -3322,16 +3313,16 @@ function Lo(e, t, n, i) {
     ...c,
     {
       kind: "unwind",
-      expr: l.length === 0 ? { kind: "list", items: [] } : l.map((d) => _(d)).reduce((d, f) => ee("+", d, f)),
+      expr: l.length === 0 ? { kind: "list", items: [] } : l.map((d) => U(d)).reduce((d, f) => se("+", d, f)),
       alias: "this"
     },
     {
       kind: "with",
-      items: [{ expr: _("this") }],
+      items: [{ expr: U("this") }],
       orderBy: Pa("this", o),
       limit: r
     },
-    { kind: "return", items: [{ expr: _("this"), alias: "this" }] }
+    { kind: "return", items: [{ expr: U("this"), alias: "this" }] }
   ];
   return ot(
     e,
@@ -3367,39 +3358,39 @@ function Uu(e, t, n, i, s, o, r) {
       pre: [],
       expr: n.list ? { kind: "list", items: [] } : G(null)
     };
-  const p = he(e, `${t}_${i}_item`), h = he(e, `${t}_${i}`);
+  const p = ye(e, `${t}_${i}_item`), h = ye(e, `${t}_${i}`);
   return d.push(
     {
       kind: "unwind",
-      expr: f.map((m) => _(m)).reduce((m, g) => ee("+", m, g)),
+      expr: f.map((m) => U(m)).reduce((m, g) => se("+", m, g)),
       alias: p
     },
     {
       kind: "with",
-      items: [{ expr: _(p) }],
+      items: [{ expr: U(p) }],
       orderBy: Pa(p, l),
       limit: u
     },
     ...n.list ? [
       {
         kind: "return",
-        items: [{ expr: oe("collect", _(p)), alias: h }]
+        items: [{ expr: ee("collect", U(p)), alias: h }]
       }
-    ] : qi(_(p), h)
-  ), { pre: [{ kind: "call", imports: [t], body: d }], expr: _(h) };
+    ] : qi(U(p), h)
+  ), { pre: [{ kind: "call", imports: [t], body: d }], expr: U(h) };
 }
 function xa(e, t, n, i, s) {
   const o = [], r = [];
   for (const c of t.members) {
     const l = e.model.nodes.get(c);
-    ge(e, l, "READ"), e.reads.labels.add(l.labels[0]);
+    me(e, l, "READ"), e.reads.labels.add(l.labels[0]);
     const u = Ye(e, l, n, i, s);
     o.push(...u.pre);
     const d = u.expr;
     r.push({
       when: pe(
         { kind: "hasLabels", variable: n, labels: [l.labels[0]] },
-        Gn(ce(e, l, n, "READ"))
+        Gn(ae(e, l, n, "READ"))
       ) ?? G(!0),
       then: {
         ...d,
@@ -3435,7 +3426,7 @@ function Po(e, t, n, i) {
   const o = t.columnName, r = [s];
   if (t.node) {
     const c = e.model.nodes.get(t.node);
-    ge(e, c, "READ"), e.reads.labels.add(c.labels[0]);
+    me(e, c, "READ"), e.reads.labels.add(c.labels[0]);
     const l = t.type.list ? c.limit.max : 1, u = Ye(
       e,
       c,
@@ -3446,8 +3437,8 @@ function Po(e, t, n, i) {
     r.push(
       {
         kind: "with",
-        items: [{ expr: _(o), alias: "this" }],
-        where: ce(e, c, "this", "READ")
+        items: [{ expr: U(o), alias: "this" }],
+        where: ae(e, c, "this", "READ")
       },
       ...u.pre,
       { kind: "return", items: [{ expr: u.expr, alias: "this" }] }
@@ -3463,7 +3454,7 @@ function Po(e, t, n, i) {
     r.push(
       {
         kind: "with",
-        items: [{ expr: _(o), alias: "this" }],
+        items: [{ expr: U(o), alias: "this" }],
         where: u.where
       },
       ...u.pre,
@@ -3472,7 +3463,7 @@ function Po(e, t, n, i) {
   } else
     r.push({
       kind: "return",
-      items: [{ expr: _(o), alias: "this" }]
+      items: [{ expr: U(o), alias: "this" }]
     });
   const a = t.type.list;
   return ot(
@@ -3553,10 +3544,10 @@ function ju(e, t, n) {
   }
 }
 function za(e, t, n, i, s, o, r) {
-  const a = he(e, `${t}_${i}`);
+  const a = ye(e, `${t}_${i}`);
   e.cost += r * n.cost;
   const c = [];
-  t !== "this" && c.push({ kind: "with", items: [{ expr: _(t), alias: "this" }] }), c.push({
+  t !== "this" && c.push({ kind: "with", items: [{ expr: U(t), alias: "this" }] }), c.push({
     kind: "call",
     imports: ["this"],
     body: [{ kind: "raw", text: Ji(e, n, s) }]
@@ -3564,38 +3555,38 @@ function za(e, t, n, i, s, o, r) {
   const l = n.columnName, u = (d) => n.type.list ? [
     {
       kind: "return",
-      items: [{ expr: oe("collect", d), alias: a }]
+      items: [{ expr: ee("collect", d), alias: a }]
     }
   ] : qi(d, a);
   if (n.node) {
     const d = e.model.nodes.get(n.node);
-    ge(e, d, "READ"), e.reads.labels.add(d.labels[0]);
-    const f = he(e, `${a}_node`), p = n.type.list ? d.limit.default : 1, h = Ye(e, d, f, o, r * p);
+    me(e, d, "READ"), e.reads.labels.add(d.labels[0]);
+    const f = ye(e, `${a}_node`), p = n.type.list ? d.limit.default : 1, h = Ye(e, d, f, o, r * p);
     c.push(
       {
         kind: "with",
-        items: [{ expr: _(l), alias: f }],
-        where: ce(e, d, f, "READ")
+        items: [{ expr: U(l), alias: f }],
+        where: ae(e, d, f, "READ")
       },
       ...h.pre,
       ...u(h.expr)
     );
   } else if (n.abstract) {
-    const d = he(e, `${a}_node`), f = e.model.abstracts.get(n.abstract), p = n.type.list ? f.limit.default : 1, h = xa(e, f, d, o, r * p);
+    const d = ye(e, `${a}_node`), f = e.model.abstracts.get(n.abstract), p = n.type.list ? f.limit.default : 1, h = xa(e, f, d, o, r * p);
     c.push(
       {
         kind: "with",
-        items: [{ expr: _(l), alias: d }],
+        items: [{ expr: U(l), alias: d }],
         where: h.where
       },
       ...h.pre,
       ...u(h.expr)
     );
   } else
-    e.cost += r, c.push(...u(_(l)));
+    e.cost += r, c.push(...u(U(l)));
   return {
     pre: [{ kind: "call", imports: [t], body: c }],
-    expr: _(a)
+    expr: U(a)
   };
 }
 function Kn(e, t, n) {
@@ -3756,7 +3747,7 @@ function xu(e, t) {
 }
 const Fu = /* @__PURE__ */ new Set(["eq", "in"]), zu = /* @__PURE__ */ new Set(["lt", "lte", "gt", "gte"]), Bu = /* @__PURE__ */ new Set(["contains", "startsWith", "endsWith"]), qu = /* @__PURE__ */ new Set(["withinBBox", "distance"]);
 function _n(e, t, n, i, s) {
-  ge(e, t, "READ");
+  me(e, t, "READ");
   const o = t.labels[0];
   e.reads.labels.add(o);
   const r = [];
@@ -3780,7 +3771,7 @@ function _n(e, t, n, i, s) {
   }));
   let g;
   const y = i[0];
-  return !p && !a && !m && !h && u.length === 0 && y && y.direction === "ASC" && yi(y) && (y.field.type === "String" || y.field.type === "ID") && (g = ee(">=", ae(_("this"), y.field.property), G("")), c = {
+  return !p && !a && !m && !h && u.length === 0 && y && y.direction === "ASC" && yi(y) && (y.field.type === "String" || y.field.type === "ID") && (g = se(">=", ue(U("this"), y.field.property), G("")), c = {
     label: o,
     access: "range",
     reason: `ordered by ${t.name}.${y.field.name}`
@@ -3792,15 +3783,15 @@ function _n(e, t, n, i, s) {
       u.length === 0 ? p : void 0,
       u.length === 0 ? m : void 0,
       g,
-      ce(e, t, "this", "READ")
+      ae(e, t, "this", "READ")
     )
   }), h && r.push({
     kind: "with",
     distinct: !0,
-    items: [{ expr: _("this") }]
+    items: [{ expr: U("this") }]
   }), u.length > 0 && r.push(...f, {
     kind: "with",
-    items: [{ expr: _("this") }, ...d.map((E) => ({ expr: _(E) }))],
+    items: [{ expr: U("this") }, ...d.map((E) => ({ expr: U(E) }))],
     where: pe(p, m)
   }), { clauses: r, expectation: c, carry: d };
 }
@@ -3829,11 +3820,11 @@ function Hu(e, t, n) {
     if (!a || typeof a != "object") continue;
     const c = a[r.key.name], l = c?.eq, u = c?.in;
     if (l == null && !Array.isArray(u)) continue;
-    const d = he(e, `this_${o.name}_anchor`), f = [];
+    const d = ye(e, `this_${o.name}_anchor`), f = [];
     let p;
-    return l != null ? p = ee("=", ae(_(d), r.key.property), B(e, l)) : p = ee(
+    return l != null ? p = se("=", ue(U(d), r.key.property), B(e, l)) : p = se(
       "IN",
-      ae(_(d), r.key.property),
+      ue(U(d), r.key.property),
       B(e, Gu(u))
     ), f.push({
       kind: "match",
@@ -3908,11 +3899,11 @@ function xo(e) {
 }
 function Yi(e, t, n, i, s) {
   const o = i.filter(xo).map((d) => ({
-    expr: oe(d.agg, ae(_(t), d.field.property)),
+    expr: ee(d.agg, ue(U(t), d.field.property)),
     alias: d.column
   })), r = i.filter((d) => !xo(d)), a = s?.keys ?? [], c = s ? {
     orderBy: a.map((d) => ({
-      expr: _(d.alias),
+      expr: U(d.alias),
       direction: "ASC"
     })),
     limit: s.limit
@@ -3921,7 +3912,7 @@ function Yi(e, t, n, i, s) {
     return [{ kind: "return", items: [...a, ...n, ...o], ...c }];
   const l = /* @__PURE__ */ new Map();
   for (const d of r)
-    l.has(d.field) || l.set(d.field, he(e, `${d.field.name}_values`));
+    l.has(d.field) || l.set(d.field, ye(e, `${d.field.name}_values`));
   const u = [...n, ...o];
   return [
     {
@@ -3930,7 +3921,7 @@ function Yi(e, t, n, i, s) {
         ...a,
         ...u,
         ...[...l].map(([d, f]) => ({
-          expr: oe("collect", ae(_(t), d.property)),
+          expr: ee("collect", ue(U(t), d.property)),
           alias: f
         }))
       ]
@@ -3940,14 +3931,14 @@ function Yi(e, t, n, i, s) {
       ...c,
       items: [
         ...[...a, ...u].map((d) => ({
-          expr: _(d.alias),
+          expr: U(d.alias),
           alias: d.alias
         })),
         ...r.map((d) => ({
           expr: Cs(
             e,
             d.agg,
-            _(l.get(d.field)),
+            U(l.get(d.field)),
             { duration: d.field.type === "Duration" }
           ),
           alias: d.column
@@ -3962,7 +3953,7 @@ function Qu(e, t, n, i) {
   ), o = n.where, r = _n(e, t, o, []);
   e.cost += xt(e, t, o, t.limit.default, !0);
   const a = [
-    { expr: oe("count", _("this")), alias: "count" },
+    { expr: ee("count", U("this")), alias: "count" },
     ...Ls(e, t, "this")
   ], c = qa(e, t, s, i), l = [
     ...r.clauses,
@@ -3993,10 +3984,10 @@ function Ku(e, t, n, i) {
   const u = qa(e, t, c, l), d = n.where, f = _n(e, t, d, []);
   e.cost += xt(e, t, d, r, !0);
   const p = o.map((g, y) => ({
-    expr: ae(_("this"), g.property),
+    expr: ue(U("this"), g.property),
     alias: `by_${y}`
   })), h = [
-    { expr: oe("count", _("this")), alias: "count" },
+    { expr: ee("count", U("this")), alias: "count" },
     ...Ls(e, t, "this")
   ];
   e.cost += r;
@@ -4052,7 +4043,7 @@ function Wa(e, t) {
 }
 function Xu(e, t, n, i, s, o, r) {
   const a = e.model.nodes.get(n.target);
-  ge(e, a, "READ");
+  me(e, a, "READ");
   const c = a.labels[0];
   e.reads.labels.add(c), e.reads.relationships.add(n.type);
   const l = n.properties ? e.model.relationshipProperties.get(n.properties) : void 0, { first: u, sort: d, signature: f, cursor: p, backward: h } = $a(
@@ -4070,7 +4061,7 @@ function Xu(e, t, n, i, s, o, r) {
     o,
     a,
     l
-  ), $ = he(e, `${t}_${i}`), N = he(e, `${$}_rel`), O = Ut(t, n, c, $, N), I = l ? Ot(
+  ), $ = ye(e, `${t}_${i}`), N = ye(e, `${$}_rel`), O = Ut(t, n, c, $, N), I = l ? Ot(
     e,
     n,
     "READ_EDGE",
@@ -4079,7 +4070,7 @@ function Xu(e, t, n, i, s, o, r) {
   ) : void 0, R = s.where, C = m ? R?.node : R, F = m ? R?.edge : void 0, Y = (Z, ne) => pe(
     qe(e, a, Z, C),
     l ? Us(e, l, ne, F) : void 0,
-    ce(e, a, Z, "READ")
+    ae(e, a, Z, "READ")
   );
   if (I !== void 0 && (F != null || d.some((Z) => Z.edge) || (b.aggregate?.edge.length ?? 0) > 0))
     throw ua(n);
@@ -4103,14 +4094,14 @@ function Xu(e, t, n, i, s, o, r) {
       target: $
     })
   });
-  const x = he(e, `${$}_rows`), q = [
-    { key: "__rows", value: _(x) },
+  const x = ye(e, `${$}_rows`), q = [
+    { key: "__rows", value: U(x) },
     { key: "__first", value: B(e, u) },
     { key: "__after", value: B(e, p !== void 0) },
     { key: "__backward", value: B(e, h) },
     { key: "__sort", value: B(e, f) }
   ], X = (Z) => {
-    const ne = he(e, `${$}_all`), de = he(e, `${ne}_rel`);
+    const ne = ye(e, `${$}_all`), de = ye(e, `${ne}_rel`);
     return {
       kind: "comprehension",
       pattern: Ut(t, n, c, ne, de),
@@ -4126,8 +4117,8 @@ function Xu(e, t, n, i, s, o, r) {
         key: ne,
         value: {
           kind: "map",
-          entries: de.map(({ field: U, fns: z }) => ({
-            key: U.name,
+          entries: de.map(({ field: _, fns: z }) => ({
+            key: _.name,
             value: {
               kind: "map",
               entries: z.map((V) => ({
@@ -4136,9 +4127,9 @@ function Xu(e, t, n, i, s, o, r) {
                   e,
                   V,
                   X(
-                    (H, re) => ae(_(ne === "node" ? H : re), U.property)
+                    (H, re) => ue(U(ne === "node" ? H : re), _.property)
                   ),
-                  { duration: U.type === "Duration" }
+                  { duration: _.type === "Duration" }
                 )
               }))
             }
@@ -4160,14 +4151,11 @@ function Xu(e, t, n, i, s, o, r) {
               entries: [
                 {
                   key: "nodes",
-                  value: xi(
-                    e,
-                    X((ne) => ae(_(ne), a.key.property))
-                  )
+                  value: xi(X((ne) => ee("id", U(ne))))
                 },
                 {
                   key: "edges",
-                  value: oe(
+                  value: ee(
                     "size",
                     X(() => G(1))
                   )
@@ -4181,10 +4169,10 @@ function Xu(e, t, n, i, s, o, r) {
     });
   }
   if (b.totalCount || b.aggregate) {
-    const Z = he(e, `${$}_count`), ne = he(e, `${Z}_rel`);
+    const Z = ye(e, `${$}_count`), ne = ye(e, `${Z}_rel`);
     q.push({
       key: "__totalCount",
-      value: oe("size", {
+      value: ee("size", {
         kind: "comprehension",
         pattern: Ut(t, n, c, Z, ne),
         where: Y(Z, ne),
@@ -4194,10 +4182,10 @@ function Xu(e, t, n, i, s, o, r) {
     const de = Re(e, a, Z, "READ", "BEFORE");
     de && q.push({
       key: "__denied",
-      value: oe("size", {
+      value: ee("size", {
         kind: "comprehension",
         pattern: Ut(t, n, c, Z, ne),
-        where: pe(Y(Z, ne), un(oe("coalesce", de, G(!1)))),
+        where: pe(Y(Z, ne), un(ee("coalesce", de, G(!1)))),
         projection: G(1)
       })
     });
@@ -4213,9 +4201,9 @@ function Xu(e, t, n, i, s, o, r) {
             kind: "with",
             // A READ_EDGE rule may test the parent end: keep it in scope.
             items: [
-              { expr: _(N) },
-              { expr: _($) },
-              ...I !== void 0 ? [{ expr: _(t) }] : []
+              { expr: U(N) },
+              { expr: U($) },
+              ...I !== void 0 ? [{ expr: U(t) }] : []
             ],
             orderBy: Ps($, d, N),
             limit: B(e, u + 1)
@@ -4225,7 +4213,7 @@ function Xu(e, t, n, i, s, o, r) {
             kind: "return",
             items: [
               {
-                expr: oe("collect", { kind: "map", entries: A }),
+                expr: ee("collect", { kind: "map", entries: A }),
                 alias: x
               }
             ]
@@ -4253,7 +4241,7 @@ function Ju(e, t, n, i, s, o) {
         key: l,
         value: ds(
           { when: h, code: "FORBIDDEN" },
-          ae(_(n), d.property)
+          ue(U(n), d.property)
         )
       });
       continue;
@@ -4275,13 +4263,13 @@ function Ju(e, t, n, i, s, o) {
         key: l,
         value: ds(
           { when: s === !1 ? G(!1) : s, code: "FORBIDDEN" },
-          ae(_(n), d.property)
+          ue(U(n), d.property)
         )
       });
       continue;
     }
     c.push(
-      l === d.property ? { kind: "property", key: l } : { kind: "entry", key: l, value: ae(_(n), d.property) }
+      l === d.property ? { kind: "property", key: l } : { kind: "entry", key: l, value: ue(U(n), d.property) }
     );
   }
   return { kind: "mapProjection", variable: n, entries: c };
@@ -4363,7 +4351,7 @@ function Ye(e, t, n, i, s) {
       a.push({
         kind: "entry",
         key: p,
-        value: ae(_(n), t.key.property)
+        value: ue(U(n), t.key.property)
       });
       continue;
     }
@@ -4374,14 +4362,14 @@ function Ye(e, t, n, i, s) {
         t,
         y,
         n,
-        ae(_(n), y.property)
+        ue(U(n), y.property)
       );
       b ? a.push({
         kind: "entry",
         key: p,
         value: ds(b, I)
       }) : y.authorization?.mask?.length ? a.push({ kind: "entry", key: p, value: I }) : a.push(
-        p === y.property ? { kind: "property", key: p } : { kind: "entry", key: p, value: ae(_(n), y.property) }
+        p === y.property ? { kind: "property", key: p } : { kind: "entry", key: p, value: ue(U(n), y.property) }
       );
       continue;
     }
@@ -4434,7 +4422,7 @@ function Ye(e, t, n, i, s) {
 function ds(e, t) {
   return {
     kind: "case",
-    when: oe("coalesce", e.when, G(!1)),
+    when: ee("coalesce", e.when, G(!1)),
     then: t,
     else: {
       kind: "map",
@@ -4456,26 +4444,26 @@ function Ha(e, t, n) {
 }
 function Zu(e, t, n, i, s, o, r) {
   const a = e.model.nodes.get(n.target);
-  ge(e, a, "READ");
+  me(e, a, "READ");
   const c = a.labels[0];
   e.reads.labels.add(c), e.reads.relationships.add(n.type);
-  const l = he(e, `${t}_${i}`), u = Ut(t, n, c, l), d = pe(
+  const l = ye(e, `${t}_${i}`), u = Ut(t, n, c, l), d = pe(
     qe(e, a, l, s.where),
-    ce(e, a, l, "READ")
+    ae(e, a, l, "READ")
   );
   if (!n.list) {
     const E = Ye(e, a, l, o, r);
     if (E.pre.length === 0)
       return {
         pre: [],
-        expr: oe("head", {
+        expr: ee("head", {
           kind: "comprehension",
           pattern: u,
           where: d,
           projection: E.expr
         })
       };
-    const b = he(e, `${l}_one`);
+    const b = ye(e, `${l}_one`);
     return {
       pre: [
         {
@@ -4483,13 +4471,13 @@ function Zu(e, t, n, i, s, o, r) {
           imports: [t],
           body: [
             { kind: "match", pattern: u, where: d },
-            { kind: "with", items: [{ expr: _(l) }], limit: G(1) },
+            { kind: "with", items: [{ expr: U(l) }], limit: G(1) },
             ...E.pre,
             ...qi(E.expr, b)
           ]
         }
       ],
-      expr: _(b)
+      expr: U(b)
     };
   }
   const f = It(s.limit, n.limit ?? a.limit, "limit"), p = s.sort, h = B(e, f);
@@ -4500,7 +4488,7 @@ function Zu(e, t, n, i, s, o, r) {
     l,
     o,
     r * Ha(e, n, f)
-  ), g = Vi(e, a, p, !1), y = he(e, `${l}_list`);
+  ), g = Vi(e, a, p, !1), y = ye(e, `${l}_list`);
   return {
     pre: [
       {
@@ -4510,33 +4498,33 @@ function Zu(e, t, n, i, s, o, r) {
           { kind: "match", pattern: u, where: d },
           {
             kind: "with",
-            items: [{ expr: _(l) }],
+            items: [{ expr: U(l) }],
             orderBy: Ps(l, g),
             limit: h
           },
           ...m.pre,
           {
             kind: "return",
-            items: [{ expr: oe("collect", m.expr), alias: y }]
+            items: [{ expr: ee("collect", m.expr), alias: y }]
           }
         ]
       }
     ],
-    expr: _(y)
+    expr: U(y)
   };
 }
 function Va(e, t, n, i) {
-  ge(e, t, "READ");
+  me(e, t, "READ");
   const s = t.labels[0];
   e.reads.labels.add(s);
-  const o = he(e, "this_key"), r = Ye(e, t, "this", i, n.length), a = [
+  const o = ye(e, "this_key"), r = Ye(e, t, "this", i, n.length), a = [
     { kind: "unwind", expr: B(e, n), alias: o },
     {
       kind: "match",
       pattern: { start: { variable: "this", labels: [s] }, hops: [] },
       where: pe(
-        ee("=", ae(_("this"), t.key.property), _(o)),
-        ce(e, t, "this", "READ")
+        se("=", ue(U("this"), t.key.property), U(o)),
+        ae(e, t, "this", "READ")
       )
     },
     ...r.pre,
@@ -4544,7 +4532,7 @@ function Va(e, t, n, i) {
       kind: "return",
       items: [
         { expr: r.expr, alias: "this" },
-        { expr: ae(_("this"), t.key.property), alias: "__key" }
+        { expr: ue(U("this"), t.key.property), alias: "__key" }
       ]
     }
   ];
@@ -4876,14 +4864,14 @@ function jt(e, t, n, i, s, o, r) {
 MATCH (${S(e)})${Xe(i, s, o, r)}
 WHERE ${kt(o, r)}`;
 }
-const dd = (e) => e && ee("OR", ae(_("row"), "fresh"), e), ke = (e) => e ? ` AND (${P(e)})` : "";
+const dd = (e) => e && se("OR", ue(U("row"), "fresh"), e), ke = (e) => e ? ` AND (${P(e)})` : "";
 function no(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
   );
 }
 function fs(e, t, n) {
-  const i = ce(e, t, n, "READ");
+  const i = ae(e, t, n, "READ");
   return i ? `coalesce(${P(i)}, false)` : "true";
 }
 function Ya(e, t, n) {
@@ -5709,8 +5697,8 @@ function Zt(e, t, n) {
 function Fd(e, t, n) {
   const i = Bd(t, n);
   try {
-    if (ge(e, t, n), Ue(e, t)) return { verdict: "allowed", by: ["bypass"] };
-    const s = n === "CREATE" ? void 0 : ce(e, t, "n", n);
+    if (me(e, t, n), Ue(e, t)) return { verdict: "allowed", by: ["bypass"] };
+    const s = n === "CREATE" ? void 0 : ae(e, t, "n", n);
     if (s && pc(s)) return { verdict: "denied", by: i };
     const o = Re(e, t, "n", n, "BEFORE") ?? (n === "READ" ? void 0 : Re(e, t, "n", n, "AFTER")), r = s ? "filtered" : o ? "validated" : "allowed";
     return { verdict: r, by: r === "allowed" ? fc(i) : i };
@@ -5787,7 +5775,7 @@ function qd(e, t) {
         ...o,
         authorization: { filter: [a], validate: [] }
       };
-      ce(l, u, "n", [...a.operations][0]) === void 0 && n.push({
+      ae(l, u, "n", [...a.operations][0]) === void 0 && n.push({
         type: o.name,
         message: `filter[${c}] holds for every authenticated caller: it only keeps out anonymous ones (use @authentication for that)`
       });
@@ -6070,7 +6058,7 @@ function Ti(e) {
     ([t, n]) => t === "jwt" || t === "viewer" || t === "isViewer" || Ti(n)
   );
 }
-const ue = {
+const le = {
   create: (e) => `create${Oe(e.plural)}`,
   update: (e) => `update${e.name}`,
   delete: (e) => `delete${e.name}`,
@@ -6135,20 +6123,20 @@ function sf(e, t) {
   }, d = (v, T) => {
     const D = n.nodes.get(T.target);
     return s(
-      ue.connect(v.name, T.name),
+      le.connect(v.name, T.name),
       () => ({
         [D.key.name]: { type: $e(e.inputType(D.key)) },
         ...u(T)
       }),
       `Connect an existing ${D.name} by ${D.key.name}. Connecting a connected pair sets the relationship properties given and keeps the others.`
     );
-  }, f = (v, T) => s(ue.nestedCreate(v.name, T.name), () => ({
+  }, f = (v, T) => s(le.nestedCreate(v.name, T.name), () => ({
     node: { type: $e(b(n.nodes.get(T.target))) },
     ...u(T)
   })), p = (v, T) => {
     const D = n.nodes.get(T.target), A = T.properties ? n.relationshipProperties.get(T.properties) : void 0, x = A ? c(A) : void 0, q = T.nestedOperations.has("UPDATE") && D.mutations.has("UPDATE") && cs(n, D) ? N(D) : void 0;
     if (!(!x && !q))
-      return s(ue.nestedUpdate(v.name, T.name), () => ({
+      return s(le.nestedUpdate(v.name, T.name), () => ({
         ...T.list ? { [D.key.name]: { type: $e(e.inputType(D.key)) } } : {},
         ...x ? { edge: { type: x } } : {},
         ...q ? { node: { type: q } } : {}
@@ -6162,23 +6150,23 @@ function sf(e, t) {
       member: de.target,
       // A naming copy, so each member's inputs get their own type names.
       rel: { ...de, name: `${T.name}${de.target}` }
-    })), x = (de, U) => {
+    })), x = (de, _) => {
       const z = {};
       for (const V of A) {
-        const H = U(V);
+        const H = _(V);
         H && (z[V.member] = { type: H, ...m(T) });
       }
       return Object.keys(z).length > 0 ? s(`${v.name}${Oe(T.name)}${de}`, () => z) : void 0;
     }, q = {}, X = (de) => T.nestedOperations.has(de), Z = X("CONNECT") ? x("ConnectMembers", (de) => {
-      const U = d(v, de.rel);
-      return T.list ? Ke($e(U)) : U;
+      const _ = d(v, de.rel);
+      return T.list ? Ke($e(_)) : _;
     }) : void 0;
     Z && (q.connect = { type: Z });
     const ne = X("CREATE") ? x("CreateMembers", (de) => {
       if (!n.nodes.get(de.member).mutations.has("CREATE"))
         return;
-      const U = f(v, de.rel);
-      return T.list ? Ke($e(U)) : U;
+      const _ = f(v, de.rel);
+      return T.list ? Ke($e(_)) : _;
     }) : void 0;
     return ne && (q.create = { type: ne }), D && X("DISCONNECT") && (q.disconnect = T.list ? {
       type: x(
@@ -6225,7 +6213,7 @@ function sf(e, t) {
             description: `Which connected ${A.name} nodes; all of them when absent.`
           },
           limit: {
-            type: me,
+            type: he,
             description: "At most this many (default: maxBatch); more matching is an error."
           }
         }),
@@ -6247,14 +6235,14 @@ function sf(e, t) {
     return q;
   }, E = (v) => [...v.fields.values()].filter(
     (T) => T.kind === "scalar"
-  ), b = (v) => s(ue.createInput(v.name), () => {
+  ), b = (v) => s(le.createInput(v.name), () => {
     const T = r(E(v), "CREATE");
     for (const D of v.fields.values()) {
       if (D.kind !== "relationship" || !Se(D, "CREATE")) continue;
       const A = y(v, D, !1);
       if (Object.keys(A).length === 0) continue;
       const x = s(
-        ue.relationCreate(v.name, D.name),
+        le.relationCreate(v.name, D.name),
         () => A
       );
       T[D.name] = {
@@ -6263,7 +6251,7 @@ function sf(e, t) {
       };
     }
     return T;
-  }), $ = (v) => s(ue.upsertInput(v.name), () => {
+  }), $ = (v) => s(le.upsertInput(v.name), () => {
     const T = {};
     for (const D of v.fields.values())
       if (D.kind === "scalar") {
@@ -6278,7 +6266,7 @@ function sf(e, t) {
         if (Object.keys(A).length === 0) continue;
         T[D.name] = {
           type: s(
-            ue.relationCreate(v.name, D.name),
+            le.relationCreate(v.name, D.name),
             () => A
           )
         };
@@ -6286,14 +6274,14 @@ function sf(e, t) {
     return T;
   });
   function N(v) {
-    return s(ue.updateInput(v.name), () => {
+    return s(le.updateInput(v.name), () => {
       const T = r(E(v), "UPDATE");
       for (const D of v.fields.values()) {
         if (D.kind !== "relationship" || !Se(D, "UPDATE")) continue;
         const A = y(v, D, !0);
         Object.keys(A).length !== 0 && (T[D.name] = {
           type: s(
-            ue.relationUpdate(v.name, D.name),
+            le.relationUpdate(v.name, D.name),
             () => A
           )
         });
@@ -6314,7 +6302,7 @@ function sf(e, t) {
             description: "Append these values (a missing list starts empty)."
           },
           pop: {
-            type: me,
+            type: he,
             description: "Remove this many values from the end."
           },
           remove: {
@@ -6343,24 +6331,24 @@ function sf(e, t) {
     const T = E(v).filter(nf);
     if (T.length !== 0)
       return s(
-        ue.adjustInput(v.name),
+        le.adjustInput(v.name),
         () => Object.fromEntries(T.map((D) => [D.name, { type: I(D) }]))
       );
   }, C = new we({
     name: "MutationInfo",
     description: "What a mutation wrote.",
     fields: {
-      nodesCreated: { type: new We(me) },
-      nodesUpdated: { type: new We(me) },
-      nodesDeleted: { type: new We(me) },
-      relationshipsCreated: { type: new We(me) },
-      relationshipsDeleted: { type: new We(me) }
+      nodesCreated: { type: new We(he) },
+      nodesUpdated: { type: new We(he) },
+      nodesDeleted: { type: new We(he) },
+      relationshipsCreated: { type: new We(he) },
+      relationshipsDeleted: { type: new We(he) }
     }
   }), F = (v, T) => new We(
     new we({
       name: v,
       fields: {
-        [ue.createdField(T)]: {
+        [le.createdField(T)]: {
           type: new We(
             new ji(new We(e.object(T.name)))
           )
@@ -6370,55 +6358,55 @@ function sf(e, t) {
     })
   ), Y = {};
   for (const v of n.nodes.values()) {
-    const T = e.object(v.name), D = { type: $e(e.inputType(v.key)) }, A = (Z) => (ne, de, U, z) => t(Z, v, z, U), x = cs(n, v), q = R(v), X = {
+    const T = e.object(v.name), D = { type: $e(e.inputType(v.key)) }, A = (Z) => (ne, de, _, z) => t(Z, v, z, _), x = cs(n, v), q = R(v), X = {
       ...x ? { update: { type: N(v) } } : {},
       ...q ? { adjust: { type: q, description: "Math and list operators." } } : {}
     };
-    v.mutations.has("CREATE") && (Y[ue.create(v)] = {
+    v.mutations.has("CREATE") && (Y[le.create(v)] = {
       description: `Create ${v.name} nodes, with their relationships, atomically.`,
-      type: F(ue.createPayload(v), v),
+      type: F(le.createPayload(v), v),
       args: { input: { type: $e(Ke($e(b(v)))) } },
       resolve: A("CREATE")
-    }), v.mutations.has("UPDATE") && x && (Y[ue.update(v)] = {
-      description: `Update the ${v.name} with this ${v.key.name}. The payload's ${ue.updatedField(v)} is null when there is none.`,
+    }), v.mutations.has("UPDATE") && x && (Y[le.update(v)] = {
+      description: `Update the ${v.name} with this ${v.key.name}. The payload's ${le.updatedField(v)} is null when there is none.`,
       type: new We(
         new we({
-          name: ue.updatePayload(v),
+          name: le.updatePayload(v),
           fields: {
-            [ue.updatedField(v)]: { type: T },
+            [le.updatedField(v)]: { type: T },
             info: { type: new We(C) }
           }
         })
       ),
       args: { [v.key.name]: D, ...X },
       resolve: A("UPDATE")
-    }, Y[ue.updateMany(v)] = {
+    }, Y[le.updateMany(v)] = {
       description: `Update every ${v.name} matching \`where\`, atomically. Fails, writing nothing, when more than \`limit\` match (default: the mutation batch limit). Relationships are updated one node at a time, with update${v.name}.`,
-      type: F(ue.updateManyPayload(v), v),
+      type: F(le.updateManyPayload(v), v),
       args: {
         where: { type: $e(e.where(v.name)) },
         ...X,
-        limit: { type: me }
+        limit: { type: he }
       },
       resolve: A("UPDATE_MANY")
-    }), v.mutations.has("CREATE") && v.mutations.has("UPDATE") && (Y[ue.upsert(v)] = {
+    }), v.mutations.has("CREATE") && v.mutations.has("UPDATE") && (Y[le.upsert(v)] = {
       description: `Create the ${v.name} nodes whose ${v.key.name} is new and update the others, atomically. Fields required on create are required only for new nodes.`,
-      type: F(ue.upsertPayload(v), v),
+      type: F(le.upsertPayload(v), v),
       args: {
         input: { type: $e(Ke($e($(v)))) }
       },
       resolve: A("UPSERT")
-    }), v.mutations.has("DELETE") && (Y[ue.delete(v)] = {
+    }), v.mutations.has("DELETE") && (Y[le.delete(v)] = {
       description: `Delete the ${v.name} with this ${v.key.name}, its relationships, and what @relationship(onDelete: CASCADE) reaches.`,
       type: new We(C),
       args: { [v.key.name]: D },
       resolve: A("DELETE")
-    }, Y[ue.deleteMany(v)] = {
+    }, Y[le.deleteMany(v)] = {
       description: `Delete every ${v.name} matching \`where\`, atomically. Fails, deleting nothing, when more than \`limit\` match (default: the mutation batch limit).`,
       type: new We(C),
       args: {
         where: { type: $e(e.where(v.name)) },
-        limit: { type: me }
+        limit: { type: he }
       },
       resolve: A("DELETE_MANY")
     });
@@ -6462,7 +6450,7 @@ function of(e) {
       node: r,
       ops: c
     });
-    n.set(ue.create(r), a(["CREATE"])), n.set(ue.upsert(r), a(["CREATE", "UPDATE"])), n.set(ue.update(r), a(["UPDATE"])), n.set(ue.updateMany(r), a(["UPDATE"])), n.set(ue.delete(r), a(["DELETE"])), n.set(ue.deleteMany(r), a(["DELETE"])), i.set(`${ln(r.name)}Changed`, a(["SUBSCRIBE"]));
+    n.set(le.create(r), a(["CREATE"])), n.set(le.upsert(r), a(["CREATE", "UPDATE"])), n.set(le.update(r), a(["UPDATE"])), n.set(le.updateMany(r), a(["UPDATE"])), n.set(le.delete(r), a(["DELETE"])), n.set(le.deleteMany(r), a(["DELETE"])), i.set(`${ln(r.name)}Changed`, a(["SUBSCRIBE"]));
   }
   for (const r of e.abstracts.values())
     t.set(r.plural, {
@@ -7098,7 +7086,7 @@ function vf(e, t, n, i) {
     ...a.clauses,
     {
       kind: "with",
-      items: [{ expr: _("this") }, ...a.carry.map((u) => ({ expr: _(u) }))],
+      items: [{ expr: U("this") }, ...a.carry.map((u) => ({ expr: U(u) }))],
       orderBy: Ps("this", o),
       limit: B(e, s)
     },
@@ -7117,16 +7105,16 @@ function vf(e, t, n, i) {
   );
 }
 function bf(e, t, n, i) {
-  ge(e, t, "READ");
+  me(e, t, "READ");
   const s = t.labels[0];
   e.reads.labels.add(s);
   const o = pe(
-    ee(
+    se(
       "=",
-      ae(_("this"), t.key.property),
+      ue(U("this"), t.key.property),
       B(e, n[t.key.name])
     ),
-    ce(e, t, "this", "READ")
+    ae(e, t, "this", "READ")
   ), r = Ye(e, t, "this", i, 1), a = [
     {
       kind: "match",
@@ -7178,8 +7166,8 @@ function $f(e, t, n, i) {
         {
           kind: "with",
           items: [
-            { expr: _("this") },
-            ...b.carry.map((N) => ({ expr: _(N) }))
+            { expr: U("this") },
+            ...b.carry.map((N) => ({ expr: U(N) }))
           ],
           orderBy: Ps("this", o),
           limit: B(e, s + 1)
@@ -7207,7 +7195,7 @@ function $f(e, t, n, i) {
     }, $ = _n(b, t, l, []);
     h ??= $.expectation;
     const N = [
-      { expr: oe("count", _("this")), alias: "totalCount" },
+      { expr: ee("count", U("this")), alias: "totalCount" },
       ...Ls(b, t, "this")
     ], O = [];
     for (const { field: C, fns: F } of f.aggregate?.node ?? [])
@@ -7274,19 +7262,19 @@ function Tf(e, t, n) {
 }
 const Ys = "score:DESC,key:ASC";
 function tr(e, t, n, i, s, o = !1) {
-  ge(e, t, "READ");
+  me(e, t, "READ");
   const r = t.labels[0];
   e.reads.labels.add(r);
   const a = o ? It(i.first, t.limit, "first") : It(i.limit, t.limit, "limit"), c = o ? i.after : null, l = c != null ? ga(c, Ys, 2, e.model.cursorSecret) : void 0, u = l ? nn(
-    ee("<", _("score"), B(e, l[0])),
+    se("<", U("score"), B(e, l[0])),
     pe(
-      ee("=", _("score"), B(e, l[0])),
-      ee(">", ae(_("this"), t.key.property), B(e, l[1]))
+      se("=", U("score"), B(e, l[0])),
+      se(">", ue(U("this"), t.key.property), B(e, l[1]))
     )
   ) : void 0, d = (g, y) => {
     const E = pe(
       qe(g, t, "this", i.where),
-      ce(g, t, "this", "READ"),
+      ae(g, t, "this", "READ"),
       y
     ), b = [];
     if (n.kind === "fulltext") {
@@ -7324,15 +7312,15 @@ function tr(e, t, n, i, s, o = !1) {
       // The anchor's vector is read to rank the others: it must be
       // readable, or an unreadable node's vector would leak through them.
       where: pe(
-        ee("=", ae(_("anchor"), t.key.property), B(g, N)),
-        ce(g, t, "anchor", "READ"),
+        se("=", ue(U("anchor"), t.key.property), B(g, N)),
+        ae(g, t, "anchor", "READ"),
         Gn(Re(g, t, "anchor", "READ", "BEFORE")),
         Gn(je(g, t, n.field, "anchor", "READ"))
       )
-    }), C = ae(_("anchor"), n.field.property), F = ee(
+    }), C = ue(U("anchor"), n.field.property), F = se(
       "<>",
-      ae(_("this"), t.key.property),
-      ae(_("anchor"), t.key.property)
+      ue(U("this"), t.key.property),
+      ue(U("anchor"), t.key.property)
     )) : C = B(g, $), b.push({
       kind: "procedure",
       procedure: "db.index.vector.queryNodes",
@@ -7354,10 +7342,10 @@ function tr(e, t, n, i, s, o = !1) {
   if (p.push(
     {
       kind: "with",
-      items: [{ expr: _("this") }, { expr: _("score") }],
+      items: [{ expr: U("this") }, { expr: U("score") }],
       orderBy: [
-        { expr: _("score"), direction: "DESC" },
-        { expr: ae(_("this"), t.key.property), direction: "ASC" }
+        { expr: U("score"), direction: "DESC" },
+        { expr: ue(U("this"), t.key.property), direction: "ASC" }
       ],
       // One more than the page, to tell whether another follows.
       limit: B(e, o ? a + 1 : a)
@@ -7367,12 +7355,12 @@ function tr(e, t, n, i, s, o = !1) {
       kind: "return",
       items: [
         { expr: m.expr, alias: "node" },
-        { expr: _("score"), alias: "score" },
+        { expr: U("score"), alias: "score" },
         ...o ? [
           {
             expr: {
               kind: "list",
-              items: [_("score"), ae(_("this"), t.key.property)]
+              items: [U("score"), ue(U("this"), t.key.property)]
             },
             alias: "__cursor"
           }
@@ -7428,7 +7416,7 @@ function nr(e, t, n, i) {
     {
       kind: "return",
       items: [
-        { expr: oe("count", _("this")), alias: "totalCount" },
+        { expr: ee("count", U("this")), alias: "totalCount" },
         ...Ls(s, t, "this")
       ]
     }
@@ -7989,11 +7977,11 @@ async function Si(e, t, n) {
     for (const [u, d] of r) {
       const f = s.get(u) ?? /* @__PURE__ */ new Map(), p = d.filter((E) => !f.has(J(E)));
       if (p.length === 0) continue;
-      ge(e.ctx(), u, "DELETE");
+      me(e.ctx(), u, "DELETE");
       const h = e.ctx(), m = Re(h, u, "n", "DELETE", "BEFORE"), g = await e.run(
         `UNWIND ${P(B(h, p))} AS k
 MATCH (n:${S(u.labels[0])}) WHERE n.${S(u.key.property)} = k
-RETURN n.${S(u.key.property)} AS key, ${m ? P(m) : "true"} AS ok, ${P(ce(h, u, "n", "DELETE") ?? G(!0))} AS visible`,
+RETURN n.${S(u.key.property)} AS key, ${m ? P(m) : "true"} AS ok, ${P(ae(h, u, "n", "DELETE") ?? G(!0))} AS visible`,
         h
       );
       for (const E of g) {
@@ -8179,12 +8167,12 @@ function sr(e, t, n) {
         "BAD_USER_INPUT",
         `adjust.${s} takes exactly one operation`
       );
-    const [c, l] = a[0], u = ae(_("n"), r.property);
+    const [c, l] = a[0], u = ue(U("n"), r.property);
     let d;
     if (r.list) {
-      const f = oe("coalesce", u, { kind: "list", items: [] });
+      const f = ee("coalesce", u, { kind: "list", items: [] });
       if (c === "push")
-        d = ee("+", f, B(e, l));
+        d = se("+", f, B(e, l));
       else if (c === "pop") {
         if (!Number.isInteger(l) || l < 0)
           throw M(
@@ -8195,7 +8183,7 @@ function sr(e, t, n) {
           kind: "slice",
           target: f,
           from: void 0,
-          to: ee("-", oe("size", f), B(e, l))
+          to: se("-", ee("size", f), B(e, l))
         };
       } else {
         const p = "adjust_item";
@@ -8203,23 +8191,23 @@ function sr(e, t, n) {
           kind: "listComprehension",
           variable: p,
           list: f,
-          where: { kind: "not", expr: ee("IN", _(p), B(e, l)) },
+          where: { kind: "not", expr: se("IN", U(p), B(e, l)) },
           projection: void 0
         };
       }
     } else {
-      const f = oe("coalesce", u, G(0)), p = B(e, l);
+      const f = ee("coalesce", u, G(0)), p = B(e, l);
       if (c === "divide" && Number(l) === 0)
         throw M(
           "BAD_USER_INPUT",
           `adjust.${s}.divide by zero`
         );
-      d = ee({
+      d = se({
         add: "+",
         subtract: "-",
         multiply: "*",
         divide: "/"
-      }[c], f, p), c === "divide" && r.type === "Int" && (d = oe("toInteger", d));
+      }[c], f, p), c === "divide" && r.type === "Int" && (d = ee("toInteger", d));
     }
     i.push(`n.${S(r.property)} = ${P(d)}`);
   }
@@ -8512,8 +8500,8 @@ function Ri(e, t, n, i, s) {
     ([p, h]) => `r.${S(p)} = CASE WHEN size(keys(row.props)) > 0 THEN ${h} ELSE r.${S(p)} END`
   );
   return { text: `UNWIND ${c} AS row
-MATCH (a:${S(o.labels[0])}) WHERE a.${S(o.key.property)} = row.from` + ke(ce(a, o, "a", "CREATE_RELATIONSHIP")) + `
-MATCH (b:${S(r.labels[0])}) WHERE b.${S(r.key.property)} = row.to` + ke(dd(ce(a, r, "b", "READ"))) + ke(ce(a, r, "b", "CREATE_RELATIONSHIP")) + (typeof s == "string" ? "" : `
+MATCH (a:${S(o.labels[0])}) WHERE a.${S(o.key.property)} = row.from` + ke(ae(a, o, "a", "CREATE_RELATIONSHIP")) + `
+MATCH (b:${S(r.labels[0])}) WHERE b.${S(r.key.property)} = row.to` + ke(dd(ae(a, r, "b", "READ"))) + ke(ae(a, r, "b", "CREATE_RELATIONSHIP")) + (typeof s == "string" ? "" : `
 WITH a, b, row, size([(a)${Xe(n, "", "b", void 0)} | 1]) > 0 AS existed`) + `
 MERGE (a)${Xe(n, "r", "b", void 0)}
 ON CREATE SET ${u.join(", ")}
@@ -8670,7 +8658,7 @@ class Gf {
    * the new node's required field pointing back.
    */
   create(t, n, i) {
-    ge(this.ctx, t, "CREATE");
+    me(this.ctx, t, "CREATE");
     let s = n[t.key.name];
     if (s == null) {
       if (!t.key.generate)
@@ -8807,7 +8795,7 @@ class Gf {
     }
     const r = this.model.nodes.get(i.target), a = yt(s.connect), c = yt(s.create), l = yt(s.update), u = s.disconnect, d = s.delete;
     if (o && d != null && d !== !1) {
-      ge(this.ctx, r, "DELETE");
+      me(this.ctx, r, "DELETE");
       const f = d === !0 ? {} : d;
       this.nestedDeletes.push({
         rel: i,
@@ -8821,17 +8809,17 @@ class Gf {
         "BAD_USER_INPUT",
         `${t.name}.${i.name} holds one ${r.name}: give connect or create, not both`
       );
-    if (a.length + c.length > 0 && (ge(this.ctx, t, "CREATE_RELATIONSHIP"), ge(this.ctx, r, "CREATE_RELATIONSHIP")), o) {
+    if (a.length + c.length > 0 && (me(this.ctx, t, "CREATE_RELATIONSHIP"), me(this.ctx, r, "CREATE_RELATIONSHIP")), o) {
       if (i.list) {
         const f = yt(u);
-        f.length > 0 && (ge(this.ctx, t, "DELETE_RELATIONSHIP"), this.disconnects.push({ rel: i, from: n, to: f }));
+        f.length > 0 && (me(this.ctx, t, "DELETE_RELATIONSHIP"), this.disconnects.push({ rel: i, from: n, to: f }));
       } else if (u === !0 || a.length + c.length > 0) {
         if (u === !0 && i.required && !i.via && a.length + c.length === 0)
           throw M(
             "BAD_USER_INPUT",
             `${t.name}.${i.name} is required: replace it with connect or create instead`
           );
-        ge(this.ctx, t, "DELETE_RELATIONSHIP");
+        me(this.ctx, t, "DELETE_RELATIONSHIP");
         const f = a.length === 1 ? a[0][r.key.name] : void 0;
         this.disconnects.push({
           rel: i,
@@ -9244,7 +9232,7 @@ RETURN assert(count(n) = 0, ${P(G(Yn(t, n.name, s)))}) AS ok`,
     );
     this.assertBatch(void 0, 1);
     const c = this.ctx();
-    ge(c, n, "UPDATE");
+    me(c, n, "UPDATE");
     const l = [
       .../* @__PURE__ */ new Set([...Object.keys(s), ...Object.keys(o ?? {})])
     ], u = l.map((N) => n.fields.get(N)).filter((N) => N?.kind === "scalar" && !N.key);
@@ -9278,7 +9266,7 @@ RETURN assert(count(n) = 0, ${P(G(Yn(t, n.name, s)))}) AS ok`,
       G(Yn("forbidden", n.name, "UPDATE"))
     ), E = `UNWIND ${P(B(d, [{ key: p.key, set: p.set }]))} AS row
 MATCH (n:${S(n.labels[0])}) WHERE n.${S(n.key.property)} = row.key` + // A node the caller cannot read is missing, not forbidden.
-    ke(ce(d, n, "n", "READ")) + ke(ce(d, n, "n", "UPDATE")) + `
+    ke(ae(d, n, "n", "READ")) + ke(ae(d, n, "n", "UPDATE")) + `
 WITH n, row` + (g ? ", properties(n) AS lora_previous" : "") + (f ? `, assert(${P(f)}, ${y}) AS lora_before` : "") + `
 SET ${this.#l(n, m).join(", ")}` + (p.remove.length > 0 ? `
 REMOVE ${p.remove.map((N) => `n.${S(N)}`).join(", ")}` : "") + `
@@ -9289,7 +9277,7 @@ RETURN n.${S(n.key.property)} AS key` + (g ? ", lora_previous AS props" : "") +
       const N = this.ctx();
       this.#o.push(
         this.run(
-          `MATCH (n:${S(n.labels[0])}) WHERE n.${S(n.key.property)} = ${P(B(N, i))}` + ke(ce(N, n, "n", "READ")) + ke(ce(N, n, "n", "UPDATE")) + `
+          `MATCH (n:${S(n.labels[0])}) WHERE n.${S(n.key.property)} = ${P(B(N, i))}` + ke(ae(N, n, "n", "READ")) + ke(ae(N, n, "n", "UPDATE")) + `
 WITH count(n) AS found
 RETURN assert(found > 0, ${this.assertions.failsAs(() => Sc)}) AS ok`,
           N
@@ -9408,7 +9396,7 @@ RETURN assert(found > 0, ${this.assertions.failsAs(() => Sc)}) AS ok`,
   async moveHiddenKeys(t) {
     const n = [];
     for (const [i, s] of t.creates) {
-      const o = this.ctx(), r = ce(o, i, "n", "READ");
+      const o = this.ctx(), r = ae(o, i, "n", "READ");
       if (!r) continue;
       const a = s.map((l) => ({ key: l.key, to: Xf(i) }));
       this.#e.push({
@@ -9531,7 +9519,7 @@ CREATE (n:${r} { ${p.join(", ")} })`,
             keep: g.keep ?? null
           }))
         )
-      ), u = ke(ce(c, a, "b", "READ")) + ke(ce(c, a, "b", "DELETE_RELATIONSHIP")) + ke(ce(c, r, "a", "DELETE_RELATIONSHIP")), d = `b.${S(a.key.property)}`, f = `UNWIND ${l} AS row
+      ), u = ke(ae(c, a, "b", "READ")) + ke(ae(c, a, "b", "DELETE_RELATIONSHIP")) + ke(ae(c, r, "a", "DELETE_RELATIONSHIP")), d = `b.${S(a.key.property)}`, f = `UNWIND ${l} AS row
 ` + (s ? `UNWIND row.to AS k
 ` : "") + jt("a", r, "row.from", i, "r", "b", a) + (s ? ` AND ${d} = k` : (
         // Re-connecting the current target keeps its relationship.
@@ -9584,7 +9572,7 @@ CREATE (n:${r} { ${p.join(", ")} })`,
         "r",
         "b",
         s
-      ) + (n.to !== void 0 ? ` AND b.${S(s.key.property)} = ${P(B(o, n.to))}` : "") + ke(ce(o, s, "b", "READ")) + `
+      ) + (n.to !== void 0 ? ` AND b.${S(s.key.property)} = ${P(B(o, n.to))}` : "") + ke(ae(o, s, "b", "READ")) + `
 SET r += ${P(B(o, n.set))}` + ud(this.env.model, n.rel) + (n.remove.length > 0 ? `
 REMOVE ${n.remove.map((c) => `r.${S(c)}`).join(", ")}` : "") + `
 RETURN b.${S(s.key.property)} AS key`, a = await this.run(r, o);
@@ -9621,7 +9609,7 @@ RETURN b.${S(s.key.property)} AS key`, a = await this.run(r, o);
           "",
           "b",
           s
-        ) + ke(qe(r, s, "b", n.where)) + ke(ce(r, s, "b", "READ")) + ke(ce(r, s, "b", "DELETE")) + `
+        ) + ke(qe(r, s, "b", n.where)) + ke(ae(r, s, "b", "READ")) + ke(ae(r, s, "b", "DELETE")) + `
 RETURN DISTINCT b.${S(s.key.property)} AS key ORDER BY key LIMIT ${P(B(r, o + 1))}`,
         r
       );
@@ -9673,7 +9661,7 @@ RETURN DISTINCT b.${S(s.key.property)} AS key`,
     if (i.length === 0) return [];
     await this.open(), this.assertBatch(void 0, i.length);
     const o = this.ctx();
-    ge(o, n, "UPDATE");
+    me(o, n, "UPDATE");
     const r = /* @__PURE__ */ new Set();
     for (const { input: I } of i)
       for (const R of Object.keys(I)) r.add(R);
@@ -9694,7 +9682,7 @@ RETURN DISTINCT b.${S(s.key.property)} AS key`,
         )
       )} AS k
 MATCH (n:${S(n.labels[0])}) WHERE n.${S(n.key.property)} = k` + // A node the caller cannot read is missing, not forbidden.
-      ke(ce(c, n, "n", "READ")) + ke(ce(c, n, "n", "UPDATE")) + `
+      ke(ae(c, n, "n", "READ")) + ke(ae(c, n, "n", "UPDATE")) + `
 RETURN n.${S(n.key.property)} AS key, ${l ? P(l) : "true"} AS ok` + (n.subscriptionOptions.previousState ? ", properties(n) AS props" : ""),
       c
     );
@@ -9847,7 +9835,7 @@ RETURN n.${S(t.key.property)} AS key, ${a} AS ok`;
         `\`where\` must filter something: bulk ${i.toLowerCase()}s never apply to every ${t.name} by accident`
       );
     const a = await this.run(
-      `MATCH (this:${S(t.labels[0])}) WHERE ${P(r)}` + ke(ce(o, t, "this", "READ")) + ke(ce(o, t, "this", i)) + `
+      `MATCH (this:${S(t.labels[0])}) WHERE ${P(r)}` + ke(ae(o, t, "this", "READ")) + ke(ae(o, t, "this", i)) + `
 RETURN this.${S(t.key.property)} AS key ORDER BY key LIMIT ${P(B(o, s + 1))}`,
       o
     );
@@ -9901,7 +9889,7 @@ async function Zf(e, t, n) {
   let u;
   const d = [];
   try {
-    r.length > 0 && ge(i, t, "UPDATE"), u = pe(
+    r.length > 0 && me(i, t, "UPDATE"), u = pe(
       Re(i, t, "n", "UPDATE", "BEFORE"),
       Re(i, t, "n", "UPDATE", "AFTER"),
       ...[...c].flatMap((m) => [
@@ -9919,7 +9907,7 @@ async function Zf(e, t, n) {
         const F = C.connects.get(g);
         F && (C.row[E] = b ? F.map((Y) => Y.to) : F);
       }
-      const $ = ` WHERE ${kt("m", y)}` + ke(ce(i, y, "m", "READ")) + ke(ce(i, y, "m", "CREATE_RELATIONSHIP")), N = `[(n)${Xe(g, "r", "m", void 0)}${$} AND m.${S(y.key.property)} = ${b ? "want" : "want.to"} | properties(r)]`, O = b ? `all(want IN row.${E} WHERE size(${N}) > 0)` : `all(want IN row.${E} WHERE any(edge IN ${N} WHERE all(k IN keys(want.props) WHERE edge[k] = want.props[k])))`, I = g.list ? "" : ` AND (row.${E} IS NULL OR size([(n)${Xe(g, "r", "m", void 0)} WHERE ${kt("m", y)} | 1]) = 1)`, R = ce(i, t, "n", "CREATE_RELATIONSHIP");
+      const $ = ` WHERE ${kt("m", y)}` + ke(ae(i, y, "m", "READ")) + ke(ae(i, y, "m", "CREATE_RELATIONSHIP")), N = `[(n)${Xe(g, "r", "m", void 0)}${$} AND m.${S(y.key.property)} = ${b ? "want" : "want.to"} | properties(r)]`, O = b ? `all(want IN row.${E} WHERE size(${N}) > 0)` : `all(want IN row.${E} WHERE any(edge IN ${N} WHERE all(k IN keys(want.props) WHERE edge[k] = want.props[k])))`, I = g.list ? "" : ` AND (row.${E} IS NULL OR size([(n)${Xe(g, "r", "m", void 0)} WHERE ${kt("m", y)} | 1]) = 1)`, R = ae(i, t, "n", "CREATE_RELATIONSHIP");
       d.push(
         `(row.${E} IS NULL OR (${O}${I}${R ? ` AND ${P(R)}` : ""}))`
       );
@@ -9937,7 +9925,7 @@ async function Zf(e, t, n) {
     ...u ? [P(u)] : []
   ], h = await e.run(
     `UNWIND ${f} AS row
-MATCH (n:${S(t.labels[0])}) WHERE n.${S(t.key.property)} = row.key` + ke(ce(i, t, "n", "READ")) + ke(ce(i, t, "n", "UPDATE")) + `
+MATCH (n:${S(t.labels[0])}) WHERE n.${S(t.key.property)} = row.key` + ke(ae(i, t, "n", "READ")) + ke(ae(i, t, "n", "UPDATE")) + `
 RETURN n.${S(t.key.property)} AS key, coalesce(${p.join(`
   AND `)}, false) AS same`,
     i
@@ -9997,7 +9985,7 @@ function tp(e, t, n) {
     for (const a of r)
       for (const c of ["BEFORE", "AFTER"])
         if (Re(e, t, "a", a, c) || Re(e, i, "b", a, c)) return !1;
-    be(e, t.name, n, "UPDATE"), be(e, t.name, n, "CREATE_RELATIONSHIP"), ge(e, t, "CREATE_RELATIONSHIP"), ge(e, i, "CREATE_RELATIONSHIP"), ge(e, t, "DELETE_RELATIONSHIP");
+    be(e, t.name, n, "UPDATE"), be(e, t.name, n, "CREATE_RELATIONSHIP"), me(e, t, "CREATE_RELATIONSHIP"), me(e, i, "CREATE_RELATIONSHIP"), me(e, t, "DELETE_RELATIONSHIP");
   } catch {
     return !1;
   }
@@ -10262,7 +10250,7 @@ async function pp(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;
-  ge(a, n, c), t !== "UPSERT" && up(a, n, c), await cp(e.model, e.validators ?? {}, t, n, i), t === "UPDATE" && !i.update && (i = { ...i, update: {} }), e = { ...e, computed: fp(e, t, n, i) };
+  me(a, n, c), t !== "UPSERT" && up(a, n, c), await cp(e.model, e.validators ?? {}, t, n, i), t === "UPDATE" && !i.update && (i = { ...i, update: {} }), e = { ...e, computed: fp(e, t, n, i) };
   const l = {
     mode: "write",
     timeoutMs: e.timeoutMs,
@@ -10300,20 +10288,20 @@ async function pp(e, t, n, i, s, o) {
         );
         let F;
         const Y = () => O(
-          ue.createPayload(n),
-          ue.createdField(n),
+          le.createPayload(n),
+          le.createdField(n),
           C
         );
         await h.apply(R, () => {
           g = h.single ? h.watch(Gt(h)) : Pe(Gt(h)), h.single && (F = h.watch(Y())), h.assertNothingMoved();
         }), I = {
-          [ue.createdField(n)]: await (F ?? Y()),
+          [le.createdField(n)]: await (F ?? Y()),
           info: h.info
         };
         break;
       }
       case "UPDATE": {
-        const C = i[n.key.name], F = ue.updatedField(n), Y = i.update ?? {}, v = i.adjust;
+        const C = i[n.key.name], F = le.updatedField(n), Y = i.update ?? {}, v = i.adjust;
         let T;
         const D = await h.updateInOne(
           R,
@@ -10329,7 +10317,7 @@ async function pp(e, t, n, i, s, o) {
               ]).then(() => {
               })
             ), T = h.watch(
-              O(ue.updatePayload(n), F, [C])
+              O(le.updatePayload(n), F, [C])
             ), h.assertNothingMoved();
           }
         );
@@ -10337,8 +10325,8 @@ async function pp(e, t, n, i, s, o) {
           let ne, de;
           try {
             ne = await D.done, [de] = await T;
-          } catch (U) {
-            if (h.assertions.refusedBy(U) !== Sc) throw U;
+          } catch (_) {
+            if (h.assertions.refusedBy(_) !== Sc) throw _;
             h.nothingWritten(), g = Promise.resolve(), ne = [];
           }
           I = {
@@ -10349,7 +10337,7 @@ async function pp(e, t, n, i, s, o) {
         }
         const A = h.plan(), x = await h.update(A, n, [{ key: C, input: Y }], v);
         let q;
-        const X = () => x.length > 0 ? O(ue.updatePayload(n), F, [C]) : Promise.resolve([null]);
+        const X = () => x.length > 0 ? O(le.updatePayload(n), F, [C]) : Promise.resolve([null]);
         await h.apply(A, () => {
           q = Pe(h.validateUpdated()), g = Pe(Gt(h));
         }), await q;
@@ -10364,7 +10352,7 @@ async function pp(e, t, n, i, s, o) {
         ))
           throw M(
             "BAD_USER_INPUT",
-            `update${n.name} changes relationships; ${ue.updateMany(n)} changes properties`
+            `update${n.name} changes relationships; ${le.updateMany(n)} changes properties`
           );
         const F = await h.resolveKeys(
           n,
@@ -10379,14 +10367,14 @@ async function pp(e, t, n, i, s, o) {
         );
         let v;
         const T = () => O(
-          ue.updateManyPayload(n),
-          ue.createdField(n),
+          le.updateManyPayload(n),
+          le.createdField(n),
           Y
         );
         await h.apply(R, () => {
           v = Pe(h.validateUpdated()), g = Pe(Gt(h));
         }), await v, I = {
-          [ue.createdField(n)]: await T(),
+          [le.createdField(n)]: await T(),
           info: h.info
         };
         break;
@@ -10396,7 +10384,7 @@ async function pp(e, t, n, i, s, o) {
         break;
       case "DELETE": {
         const C = h.ctx(), F = await h.run(
-          `MATCH (n:${S(n.labels[0])}) WHERE n.${S(n.key.property)} = ${P(B(C, i[n.key.name]))}` + ke(ce(C, n, "n", "READ")) + ke(ce(C, n, "n", "DELETE")) + `
+          `MATCH (n:${S(n.labels[0])}) WHERE n.${S(n.key.property)} = ${P(B(C, i[n.key.name]))}` + ke(ae(C, n, "n", "READ")) + ke(ae(C, n, "n", "DELETE")) + `
 RETURN n.${S(n.key.property)} AS key`,
           C
         );
@@ -10473,9 +10461,9 @@ async function hp(e, t, n, i, s) {
     c.has(h) ? l.has(h) || u.push({ key: r[f], input: a[f] }) : t.create(n, p);
   }
   await e.update(t, n, u), await e.apply(t), await e.validateUpdated();
-  const d = ue.createdField(n);
+  const d = le.createdField(n);
   return {
-    [d]: await s(ue.upsertPayload(n), d, r),
+    [d]: await s(le.upsertPayload(n), d, r),
     info: e.info
   };
 }
@@ -10738,11 +10726,11 @@ function wp(e) {
   for (const n of e.nodes.values()) {
     const i = fr(n.fields);
     if (n.mutations.has("CREATE")) {
-      const s = ue.createInput(n.name);
+      const s = le.createInput(n.name);
       t[s] = ni(e, s, i, "CREATE");
     }
     if (n.mutations.has("UPDATE")) {
-      const s = ue.updateInput(n.name);
+      const s = le.updateInput(n.name);
       t[s] = ni(e, s, i, "UPDATE");
     }
   }
@@ -12153,7 +12141,7 @@ const wr = ["CONTAINS", "STARTS_WITH", "ENDS_WITH"], nt = ["LT", "LTE", "GT", "G
   CartesianPoint: ["WITHIN_BBOX", "DISTANCE"]
 }, qp = /* @__PURE__ */ new Set(["String", "ID", "Int", "BigInt"]), Wp = /* @__PURE__ */ new Set(["Point", "CartesianPoint", "Duration"]);
 function ts(e, t, n, i, s) {
-  const o = (se) => i.push({ type: e.name, field: t.name, message: se }), r = On(t.type), a = He(t.type);
+  const o = (ie) => i.push({ type: e.name, field: t.name, message: ie }), r = On(t.type), a = He(t.type);
   let c, l;
   if (Lt(a))
     c = "Enum", l = a.name;
@@ -12172,9 +12160,9 @@ function ts(e, t, n, i, s) {
   const v = K(n("vector"), t, o);
   let T;
   if (v) {
-    const se = v.dimensions;
-    (c !== "Float" || !r.list) && o("@vector needs a [Float!] field"), s.allowKey || o("@vector is not allowed on relationship properties"), se >= 1 && se <= 4096 || o("@vector(dimensions:) must be between 1 and 4096"), T = {
-      dimensions: se,
+    const ie = v.dimensions;
+    (c !== "Float" || !r.list) && o("@vector needs a [Float!] field"), s.allowKey || o("@vector is not allowed on relationship properties"), ie >= 1 && ie <= 4096 || o("@vector(dimensions:) must be between 1 and 4096"), T = {
+      dimensions: ie,
       similarity: v.similarity
     };
   }
@@ -12184,28 +12172,28 @@ function ts(e, t, n, i, s) {
   X && (r.list || c !== "DateTime" && c !== "LocalDateTime" && c !== "Date") && o("@timestamp needs a DateTime, LocalDateTime or Date field"), X && $ && o("@timestamp and @default are exclusive");
   let Z;
   if ($) {
-    const se = $.value;
-    co(c, r.list, se) || 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"), Z = { value: se };
+    const ie = $.value;
+    co(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"), Z = { value: ie };
   }
   !s.allowKey && (d || f || h || b) && o("@key, @unique, @relayId and @index are not allowed here"), d && (qp.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 ne = /* @__PURE__ */ new Set();
   if (y) {
-    const se = r.list ? c === "Point" || c === "CartesianPoint" || v ? [] : ["INCLUDES", ...r.required ? [] : ["IS_NULL"]] : [
+    const ie = r.list ? c === "Point" || c === "CartesianPoint" || v ? [] : ["INCLUDES", ...r.required ? [] : ["IS_NULL"]] : [
       ...Bp[c],
       ...r.required ? [] : ["IS_NULL"],
       ...c === "String" || c === "ID" ? ["CASE_INSENSITIVE"] : []
-    ], ye = y.byValue ?? (r.list ? ["INCLUDES"] : ["EQ", "IN"]).filter((w) => se.includes(w)), De = ye.filter((w) => !se.includes(w));
+    ], ge = y.byValue ?? (r.list ? ["INCLUDES"] : ["EQ", "IN"]).filter((w) => ie.includes(w)), De = ge.filter((w) => !ie.includes(w));
     De.length > 0 && o(
-      `${c} does not support ${De.join(", ")}` + (se.length > 0 ? ` (allowed: ${se.join(", ")})` : "")
-    ), ne = new Set(ye.filter((w) => se.includes(w)));
+      `${c} does not support ${De.join(", ")}` + (ie.length > 0 ? ` (allowed: ${ie.join(", ")})` : "")
+    ), ne = new Set(ge.filter((w) => ie.includes(w)));
   }
   d && (ne.add("EQ"), ne.add("IN")), p && (y || m) && o("@private fields cannot be @filterable or @sortable"), m && (r.list || Wp.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 de = E?.property ?? t.name;
   de.length === 0 && o("@alias(property:) is empty");
-  const U = [];
+  const _ = [];
   if (b) {
-    const se = b.kind;
-    se === "TEXT" && c !== "String" && c !== "ID" ? o("a TEXT index needs a String or ID field") : se === "POINT" && c !== "Point" && c !== "CartesianPoint" ? o("a POINT index needs a Point field") : se === "RANGE" && (c === "Point" || c === "CartesianPoint") ? o("use a POINT index for Point fields") : se === "RANGE" && Un.has(c) ? o(`${c} values have no order a RANGE index can use`) : U.push(se);
+    const ie = b.kind;
+    ie === "TEXT" && c !== "String" && c !== "ID" ? o("a TEXT index needs a String or ID field") : ie === "POINT" && c !== "Point" && c !== "CartesianPoint" ? o("a POINT index needs a Point field") : ie === "RANGE" && (c === "Point" || c === "CartesianPoint") ? o("use a POINT index for Point fields") : ie === "RANGE" && Un.has(c) ? o(`${c} values have no order a RANGE index can use`) : _.push(ie);
   }
   const z = X !== void 0 || !!F, V = {
     create: z && vr(t, "settable", "onCreate"),
@@ -12214,12 +12202,12 @@ function ts(e, t, n, i, s) {
   (V.create || V.update) && !s.allowKey && (o(
     "a @timestamp or @populatedBy relationship property cannot be made @settable"
   ), V.create = V.update = !1);
-  for (const [se, ye] of [
+  for (const [ie, ge] of [
     ["CREATE", "onCreate"],
     ["UPDATE", "onUpdate"]
   ])
-    V[se === "CREATE" ? "create" : "update"] && (Y?.validate.some((De) => De.operations.has(se)) || o(
-      `@settable(${ye}: true) on a @timestamp or @populatedBy field needs a field-level @authorization(validate:) rule for ${se}: it decides who may supply the value (the schema's bypass is no such rule)`
+    V[ie === "CREATE" ? "create" : "update"] && (Y?.validate.some((De) => De.operations.has(ie)) || o(
+      `@settable(${ge}: true) on a @timestamp or @populatedBy field needs a field-level @authorization(validate:) rule for ${ie}: it decides who may supply the value (the schema's bypass is no such rule)`
     ));
   const H = Hc(n, t, o, {
     type: c,
@@ -12244,7 +12232,7 @@ function ts(e, t, n, i, s) {
     filters: ne,
     sortable: m && !p,
     groupBy: g,
-    indexes: U,
+    indexes: _,
     generate: A,
     ...q ? { keyScope: q } : {},
     defaultValue: Z,
@@ -12516,7 +12504,7 @@ function Tr(e, t, n, i, s, o) {
     const ne = o.schema.getType(F), de = Hc(
       n,
       C,
-      (U) => r(`argument ${C.name}: ${U}`),
+      (_) => r(`argument ${C.name}: ${_}`),
       {
         type: At[F] ?? (ne && Lt(ne) ? "Enum" : (ne && Cn(ne)) ?? "String"),
         list: Y.list,
@@ -13101,15 +13089,15 @@ function rh(e, t = {}) {
       for (const Q of Object.values(w.getFields())) {
         const W = K(o("jwtClaim"), Q, r(w.name));
         $.set(Q.name, W?.path ?? Q.name);
-        const le = K(o("viewer"), Q, r(w.name));
-        le && (O && s.push({
+        const ce = K(o("viewer"), Q, r(w.name));
+        ce && (O && s.push({
           type: w.name,
           field: Q.name,
           message: `only one @viewer claim is allowed (${O.claim} has one)`
         }), O = {
           claim: Q.name,
-          type: le.type,
-          field: le.field
+          type: ce.type,
+          field: ce.field
         });
       }
       continue;
@@ -13184,21 +13172,21 @@ function rh(e, t = {}) {
       type: w.name,
       message: `primary label \`${Q}\` is already used by ${W}`
     }), x.set(Q, w.name);
-    const le = /* @__PURE__ */ new Map();
-    for (const ie of Object.values(w.getFields())) {
-      const at = He(ie.type);
-      if (ie.name.startsWith("__")) {
+    const ce = /* @__PURE__ */ new Map();
+    for (const oe of Object.values(w.getFields())) {
+      const at = He(oe.type);
+      if (oe.name.startsWith("__")) {
         s.push({
           type: w.name,
-          field: ie.name,
+          field: oe.name,
           message: "names starting with `__` are reserved"
         });
         continue;
       }
       const po = K(
         o("customResolver"),
-        ie,
-        (Ve) => s.push({ type: w.name, field: ie.name, message: Ve })
+        oe,
+        (Ve) => s.push({ type: w.name, field: oe.name, message: Ve })
       );
       if (po !== void 0) {
         for (const Ve of [
@@ -13209,86 +13197,86 @@ function rh(e, t = {}) {
           "sortable",
           "groupBy"
         ])
-          ie.astNode?.directives?.some((Yc) => Yc.name.value === Ve) && s.push({
+          oe.astNode?.directives?.some((Yc) => Yc.name.value === Ve) && s.push({
             type: w.name,
-            field: ie.name,
+            field: oe.name,
             message: `@${Ve} cannot be combined with @customResolver`
           });
-        le.set(ie.name, {
+        ce.set(oe.name, {
           kind: "custom",
           authentication: oo(
-            K(o("authentication"), ie, D(w.name, ie.name))
+            K(o("authentication"), oe, D(w.name, oe.name))
           ),
-          name: ie.name,
+          name: oe.name,
           owner: w.name,
           requires: po.requires,
-          type: { named: at.name, ...Ei(On(ie.type)) },
-          description: ie.description ?? void 0
+          type: { named: at.name, ...Ei(On(oe.type)) },
+          description: oe.description ?? void 0
         });
         continue;
       }
-      if (ie.astNode?.directives?.some((Ve) => Ve.name.value === "cypher")) {
-        const Ve = Tr(w.name, ie, o, s, I, {
+      if (oe.astNode?.directives?.some((Ve) => Ve.name.value === "cypher")) {
+        const Ve = Tr(w.name, oe, o, s, I, {
           nodeNames: R,
           plainNames: C,
           schema: i,
           root: void 0,
           viewer: O !== void 0
         });
-        Ve && le.set(Ve.name, Ve);
+        Ve && ce.set(Ve.name, Ve);
         continue;
       }
       if (Y.has(at.name)) {
         const Ve = Gp(
           w,
-          ie,
+          oe,
           o,
           s,
           v,
           n
         );
-        Ve && le.set(Ve.name, Ve);
+        Ve && ce.set(Ve.name, Ve);
         continue;
       }
       if (v.has(at.name)) {
         s.push({
           type: w.name,
-          field: ie.name,
+          field: oe.name,
           message: `${at.name} is a @relationshipProperties type; reference it from @relationship(properties:)`
         });
         continue;
       }
-      if (K(o("relationship"), ie, r(w.name)) !== void 0) {
+      if (K(o("relationship"), oe, r(w.name)) !== void 0) {
         s.push({
           type: w.name,
-          field: ie.name,
+          field: oe.name,
           message: "@relationship target must be a @node type"
         });
         continue;
       }
-      const Ws = ts(w, ie, o, s, { allowKey: !0 });
-      Ws && le.set(Ws.name, Ws);
+      const Ws = ts(w, oe, o, s, { allowKey: !0 });
+      Ws && ce.set(Ws.name, Ws);
     }
-    const Ie = [...le.values()].filter(
-      (ie) => ie.kind === "scalar"
+    const Ie = [...ce.values()].filter(
+      (oe) => oe.kind === "scalar"
     );
     kr(w.name, Ie, s);
-    for (const ie of le.values())
-      ie.kind === "relationship" && !ie.list && le.has(`${ie.name}Exists`) && s.push({
+    for (const oe of ce.values())
+      oe.kind === "relationship" && !oe.list && ce.has(`${oe.name}Exists`) && s.push({
         type: w.name,
-        field: `${ie.name}Exists`,
-        message: `collides with the ${ie.name}Exists filter of the single relationship ${ie.name}; rename one`
+        field: `${oe.name}Exists`,
+        message: `collides with the ${oe.name}Exists filter of the single relationship ${oe.name}; rename one`
       });
-    const Me = Ie.filter((ie) => ie.key);
+    const Me = Ie.filter((oe) => oe.key);
     if (Me.length !== 1) {
       s.push({
         type: w.name,
-        message: Me.length === 0 ? "a @node type needs exactly one @key field" : `only one @key field is allowed (found ${Me.map((ie) => ie.name).join(", ")})`
+        message: Me.length === 0 ? "a @node type needs exactly one @key field" : `only one @key field is allowed (found ${Me.map((oe) => oe.name).join(", ")})`
       });
       continue;
     }
     const Le = Me[0];
-    Ie.some((ie) => ie.relayId) && le.has("id") && s.push({
+    Ie.some((oe) => oe.relayId) && ce.has("id") && s.push({
       type: w.name,
       field: "id",
       message: "@relayId adds a global `id` field; rename this field or map it with @alias"
@@ -13307,14 +13295,14 @@ function rh(e, t = {}) {
       K(o("authorization"), w, r(w.name))
     );
     if (fo.has("CREATE"))
-      for (const ie of Ie)
-        ie.required && ie.readonly && !ie.defaultValue && !ie.timestamp?.has("CREATE") && !ie.populatedBy?.operations.has("CREATE") && !(ie.key && ie.generate) && s.push({
+      for (const oe of Ie)
+        oe.required && oe.readonly && !oe.defaultValue && !oe.timestamp?.has("CREATE") && !oe.populatedBy?.operations.has("CREATE") && !(oe.key && oe.generate) && s.push({
           type: w.name,
-          field: ie.name,
+          field: oe.name,
           message: "is required but cannot be set on create; add @default, @timestamp, @populatedBy(operations: [CREATE]) or @key(generate: true), or drop @mutation(operations: CREATE)"
         });
     const Bn = k.plural ?? Gs(w.name);
-    for (const ie of [
+    for (const oe of [
       Bn,
       `${Bn}Connection`,
       `${Bn}Aggregate`,
@@ -13322,17 +13310,17 @@ function rh(e, t = {}) {
       ...mt.map((at) => at.queryName),
       `${ln(w.name)}Changed`
     ]) {
-      const at = q.get(ie);
+      const at = q.get(oe);
       at && s.push({
         type: w.name,
-        message: `root field \`${ie}\` collides with ${at}; set @node(plural:)`
-      }), q.set(ie, w.name);
+        message: `root field \`${oe}\` collides with ${at}; set @node(plural:)`
+      }), q.set(oe, w.name);
     }
     A.set(w.name, {
       name: w.name,
       labels: L,
       plural: Bn,
-      fields: le,
+      fields: ce,
       key: Le,
       read: gt.read ?? !0,
       aggregate: gt.aggregate ?? !1,
@@ -13341,7 +13329,7 @@ function rh(e, t = {}) {
       authenticationJwt: qs?.jwt,
       authorization: Jc,
       search: mt,
-      interfaces: w.getInterfaces().map((ie) => ie.name),
+      interfaces: w.getInterfaces().map((oe) => oe.name),
       uniqueTogether: [],
       triggers: [],
       outbox: K(o("outbox"), w, r(w.name)) !== void 0,
@@ -13397,7 +13385,7 @@ function rh(e, t = {}) {
           }
         }
       }
-    const le = K(o("query"), w, k) ?? {}, Ie = K(o("plural"), w, k)?.value ?? Gs(w.name), Me = q.get(Ie);
+    const ce = K(o("query"), w, k) ?? {}, Ie = K(o("plural"), w, k)?.value ?? Gs(w.name), Me = q.get(Ie);
     Me && k(`root field \`${Ie}\` collides with ${Me}; set @plural`), q.set(Ie, w.name), X.set(w.name, {
       kind: ut(w) ? "interface" : "union",
       name: w.name,
@@ -13405,7 +13393,7 @@ function rh(e, t = {}) {
       fields: Q,
       relationships: W,
       plural: Ie,
-      read: le.read ?? !0,
+      read: ce.read ?? !0,
       limit: Oi(
         K(o("limit"), w, k),
         n,
@@ -13478,13 +13466,13 @@ function rh(e, t = {}) {
     }
     k.size > 0 && de.set(w.name, k);
   }
-  const U = { schema: u, byType: de }, z = (w) => on(
+  const _ = { schema: u, byType: de }, z = (w) => on(
     {
       nodes: A,
       props: T,
       viewer: O,
       abstracts: X,
-      rules: U,
+      rules: _,
       at: (k) => s.push({
         type: "schema",
         message: `@authorization: ${k}`
@@ -13572,9 +13560,9 @@ function rh(e, t = {}) {
         );
       else if (k.kind === "scalar")
         for (const W of L) {
-          const le = W.missingValue;
+          const ce = W.missingValue;
           W.value === null && k.required ? Q(
-            le ? "@authorization(mask:) on a non-null field needs a value" : "@authorization(mask:) value null does not fit a non-null field"
+            ce ? "@authorization(mask:) on a non-null field needs a value" : "@authorization(mask:) value null does not fit a non-null field"
           ) : W.value !== null && (!co(k.type, k.list, W.value) || k.enumName !== void 0 && !(d.get(k.enumName)?.values ?? []).some(
             (Ie) => Ie.name === W.value
           )) && Q(
@@ -13615,14 +13603,14 @@ function rh(e, t = {}) {
       field: w.key.name,
       message: "@key(scope: VIEWER) needs a @viewer claim on the @jwt type: it names whose key space a create writes in"
     });
-  const H = O ? A.get(O.type) : void 0, re = (w, k, L, Q, W, le) => {
+  const H = O ? A.get(O.type) : void 0, re = (w, k, L, Q, W, ce) => {
     const Ie = {
       nodes: A,
-      ...le ? { member: le } : {},
+      ...ce ? { member: ce } : {},
       props: T,
       viewer: O,
       abstracts: X,
-      rules: U,
+      rules: _,
       at: (Me) => s.push({
         type: k,
         ...L ? { field: L } : {},
@@ -13648,8 +13636,8 @@ function rh(e, t = {}) {
     for (const k of w.fields.values()) {
       if (!k.authorization) continue;
       for (const W of k.authorization.mask ?? []) {
-        const le = { where: W.unless };
-        re(w, w.name, k.name, [le]), W.unless = le.where;
+        const ce = { where: W.unless };
+        re(w, w.name, k.name, [ce]), W.unless = ce.where;
       }
       const L = k.authorization.validate.filter(Yt);
       re(w, w.name, k.name, [
@@ -13660,25 +13648,25 @@ function rh(e, t = {}) {
       Q ? re(void 0, w.name, k.name, L, Q) : k.kind === "relationship" && L.length > 0 && X.has(k.target) && (k.memberAuthorization = Ud(
         k,
         A,
-        (W, le) => re(
+        (W, ce) => re(
           void 0,
           w.name,
           k.name,
           W,
-          { source: w, target: le },
-          le
+          { source: w, target: ce },
+          ce
         )
       ));
     }
   }
-  const se = /* @__PURE__ */ new Map();
+  const ie = /* @__PURE__ */ new Map();
   for (const w of T.values()) {
     const k = [];
     for (const W of A.values())
-      for (const le of W.fields.values())
-        le.kind === "relationship" && le.properties === w.name && k.push(le);
+      for (const ce of W.fields.values())
+        ce.kind === "relationship" && ce.properties === w.name && k.push(ce);
     const L = [...new Set(k.map((W) => `${W.owner} → ${W.target}`))], Q = k[0] && V(k[0]);
-    se.set(
+    ie.set(
       w.name,
       k.length === 0 ? `no relationship field uses ${w.name}` : L.length > 1 ? `the relationship fields using ${w.name} declare different ends (${k.map((W) => `${W.owner}.${W.name}: ${W.owner} → ${W.target}`).join(", ")})` : Q ?? `${L[0]} has an interface or union end; source and target need @node types`
     );
@@ -13686,7 +13674,7 @@ function rh(e, t = {}) {
   for (const w of T.values())
     for (const k of w.fields.values()) {
       if (!k.authorization) continue;
-      const L = se.get(w.name), Q = k.authorization.validate.filter(
+      const L = ie.get(w.name), Q = k.authorization.validate.filter(
         (W) => In(W.where)
       );
       re(
@@ -13815,13 +13803,13 @@ function rh(e, t = {}) {
         if (W.kind !== "relationship" || W === k || W.type !== k.type || !W.members.includes(k.owner) || W.direction === k.direction || // Each pair once: reported on the field that sorts first.
         `${W.owner}.${W.name}` < `${k.owner}.${k.name}`)
           continue;
-        const le = [...Qo(W)].filter(
+        const ce = [...Qo(W)].filter(
           (Ie) => L.has(Ie)
         );
-        le.length > 0 && s.push({
+        ce.length > 0 && s.push({
           type: w.name,
           field: k.name,
-          message: `@authorization: ${le.join(", ")} ${le.length === 1 ? "rules are" : "rules are each"} declared on both ${k.owner}.${k.name} and ${W.owner}.${W.name}, the two sides of ${k.type}; a relationship's rules hold from either side, so declare each operation on one (combine with AND where both must pass)`
+          message: `@authorization: ${ce.join(", ")} ${ce.length === 1 ? "rules are" : "rules are each"} declared on both ${k.owner}.${k.name} and ${W.owner}.${W.name}, the two sides of ${k.type}; a relationship's rules hold from either side, so declare each operation on one (combine with AND where both must pass)`
         });
       }
     }
@@ -13846,28 +13834,28 @@ function rh(e, t = {}) {
   for (const w of T.values())
     for (const k of w.fields.values()) {
       if (!k.authorization && !k.authentication) continue;
-      const L = (le) => s.push({ type: w.name, field: k.name, message: le });
+      const L = (ce) => s.push({ type: w.name, field: k.name, message: ce });
       k.authorization?.filter.length && L(
         "@authorization on a relationship property takes validate rules only"
       ), k.authorization?.mask && L("@authorization(mask:) belongs on a scalar field of a @node type");
       const Q = [
-        ...(k.authorization?.validate ?? []).flatMap((le) => [...le.operations]),
+        ...(k.authorization?.validate ?? []).flatMap((ce) => [...ce.operations]),
         ...k.authentication ?? []
       ], W = [
-        ...new Set(Q.filter((le) => !_d.has(le)))
+        ...new Set(Q.filter((ce) => !_d.has(ce)))
       ];
       W.length > 0 && L(
         `rules on a relationship property apply to READ, CREATE and UPDATE, not ${W.join(", ")}`
       );
-      for (const le of k.authorization?.validate ?? []) {
-        const Ie = In(le.where) ? se.get(w.name) : void 0;
+      for (const ce of k.authorization?.validate ?? []) {
+        const Ie = In(ce.where) ? ie.get(w.name) : void 0;
         if (typeof Ie == "string") {
           L(
             `@authorization: source, target and edge need every relationship field using ${w.name} to declare the same ends, but ${Ie}`
           );
           continue;
         }
-        if (Ie && [...le.operations].some((Me) => Me !== "READ")) {
+        if (Ie && [...ce.operations].some((Me) => Me !== "READ")) {
           L(
             "@authorization: source, target and edge decide per relationship, so they take READ rules only; CREATE and UPDATE rules on a relationship property test claims"
           );
@@ -13879,7 +13867,7 @@ function rh(e, t = {}) {
           void 0,
           w.name,
           k.name,
-          le.where,
+          ce.where,
           s,
           $,
           Ie ? H : void 0,
@@ -13897,7 +13885,7 @@ function rh(e, t = {}) {
         $
       );
     }
-  const ye = new Set(
+  const ge = new Set(
     [
       ...[...A.values()].flatMap((w) => [...w.fields.values()]),
       ...Z,
@@ -13905,7 +13893,7 @@ function rh(e, t = {}) {
     ].flatMap((w) => w.kind === "cypher" && w.object ? [w.object] : [])
   );
   for (const w of F.keys())
-    ye.has(w) || s.push({
+    ge.has(w) || s.push({
       type: w,
       message: "object types need @node or @relationshipProperties, unless a @cypher field returns them"
     });
@@ -14524,11 +14512,11 @@ function Ih(e, t) {
     name: "CountFilter",
     description: "Compare the number of related nodes.",
     fields: {
-      eq: { type: me },
-      lt: { type: me },
-      lte: { type: me },
-      gt: { type: me },
-      gte: { type: me }
+      eq: { type: he },
+      lt: { type: he },
+      lte: { type: he },
+      gt: { type: he },
+      gte: { type: he }
     }
   }), o = new we({
     name: "Point",
@@ -14537,7 +14525,7 @@ function Ih(e, t) {
       longitude: { type: j(Ne) },
       latitude: { type: j(Ne) },
       height: { type: Ne },
-      srid: { type: j(me) },
+      srid: { type: j(he) },
       crs: { type: j(_e) }
     }
   }), r = new we({
@@ -14547,7 +14535,7 @@ function Ih(e, t) {
       x: { type: j(Ne) },
       y: { type: j(Ne) },
       z: { type: Ne },
-      srid: { type: j(me) },
+      srid: { type: j(he) },
       crs: { type: j(_e) }
     }
   }), a = /* @__PURE__ */ new Map();
@@ -14617,7 +14605,7 @@ function Ih(e, t) {
       case "ID":
         return Rn;
       case "Int":
-        return me;
+        return he;
       case "Float":
         return Ne;
       case "Boolean":
@@ -14676,7 +14664,7 @@ function Ch(e, t, n) {
   for (const r of e.nodes.values()) {
     if (!r.aggregate) continue;
     const a = {
-      count: { type: j(me) }
+      count: { type: j(he) }
     };
     for (const c of r.fields.values())
       c.kind === "scalar" && (c.key || c.sortable || c.type === "Duration") && !c.list && c.selectableOn.aggregate && c.type !== "Boolean" && c.type !== "Enum" && (a[c.name] = { type: j(n(c)) });
@@ -14979,8 +14967,8 @@ function _h(e, t) {
           sum: { type: $(T) }
         } : {},
         ...v.type === "String" || v.type === "ID" ? {
-          shortestLength: { type: $(me) },
-          longestLength: { type: $(me) },
+          shortestLength: { type: $(he) },
+          longestLength: { type: $(he) },
           averageLength: { type: $(Ne) }
         } : {}
       }
@@ -15078,16 +15066,16 @@ function Lh(e, t, n, i, s, o) {
     customScalar: u,
     baseType: d,
     scalarOutput: f
-  } = n, { whereOf: p, polymorphic: h, connectionWhere: m } = i, g = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), b = (U) => U.__typename ?? void 0;
-  for (const U of e.abstracts.values())
+  } = n, { whereOf: p, polymorphic: h, connectionWhere: m } = i, g = /* @__PURE__ */ new Map(), y = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), b = (_) => _.__typename ?? void 0;
+  for (const _ of e.abstracts.values())
     E.set(
-      U.name,
-      U.kind === "interface" ? new ci({
-        name: U.name,
-        description: U.description,
+      _.name,
+      _.kind === "interface" ? new ci({
+        name: _.name,
+        description: _.description,
         fields: () => ({
           ...Object.fromEntries(
-            [...U.fields.values()].filter((z) => !z.private && z.selectableOn.read).map((z) => [
+            [..._.fields.values()].filter((z) => !z.private && z.selectableOn.read).map((z) => [
               z.name,
               { type: f(z), description: z.description }
             ])
@@ -15095,8 +15083,8 @@ function Lh(e, t, n, i, s, o) {
           // Declared relationships: the implementations' field, whose
           // type and arguments the model checked are the same.
           ...Object.fromEntries(
-            [...U.relationships.values()].map((z) => {
-              const V = g.get(U.members[0]).getFields()[z.name];
+            [..._.relationships.values()].map((z) => {
+              const V = g.get(_.members[0]).getFields()[z.name];
               return [
                 z.name,
                 {
@@ -15119,58 +15107,58 @@ function Lh(e, t, n, i, s, o) {
         }),
         resolveType: b
       }) : new dl({
-        name: U.name,
-        description: U.description,
-        types: () => U.members.map((z) => g.get(z)),
+        name: _.name,
+        description: _.description,
+        types: () => _.members.map((z) => g.get(z)),
         resolveType: b
       })
     );
-  const $ = (U) => g.get(U) ?? E.get(U), N = {
-    edges: (U) => Pr(U).map((z) => (ht(z.node), { ...z, __sort: U.__sort })),
-    pageInfo: (U) => {
-      const z = Pr(U);
+  const $ = (_) => g.get(_) ?? E.get(_), N = {
+    edges: (_) => Pr(_).map((z) => (ht(z.node), { ...z, __sort: _.__sort })),
+    pageInfo: (_) => {
+      const z = Pr(_);
       for (const re of z) ht(re.node);
-      const V = (re) => re ? gi(U.__sort, re.__cursor, e.cursorSecret) : null, H = U.__rows.length > U.__first;
+      const V = (re) => re ? gi(_.__sort, re.__cursor, e.cursorSecret) : null, H = _.__rows.length > _.__first;
       return {
-        hasNextPage: U.__backward ? U.__after : H,
-        hasPreviousPage: U.__backward ? H : U.__after,
+        hasNextPage: _.__backward ? _.__after : H,
+        hasPreviousPage: _.__backward ? H : _.__after,
         startCursor: V(z[0]),
         endCursor: V(z[z.length - 1])
       };
     },
-    totalCount: (U) => {
-      if ((U.__denied ?? 0) > 0)
+    totalCount: (_) => {
+      if ((_.__denied ?? 0) > 0)
         throw M(
           "FORBIDDEN",
           "not allowed to read some of these nodes"
         );
-      return U.__totalCount ?? 0;
+      return _.__totalCount ?? 0;
     }
-  }, O = (U, z, V, H, re) => {
-    const se = new we({
+  }, O = (_, z, V, H, re) => {
+    const ie = new we({
       name: z,
       fields: () => ({
         cursor: {
           type: j(_e),
-          resolve: (ye) => gi(ye.__sort, ye.__cursor, e.cursorSecret)
+          resolve: (ge) => gi(ge.__sort, ge.__cursor, e.cursorSecret)
         },
         node: {
           type: j(V()),
-          resolve: (ye) => ye.node
+          resolve: (ge) => ge.node
         },
         ...H ? {
           properties: {
             type: j(H()),
-            resolve: (ye) => ye.properties
+            resolve: (ge) => ge.properties
           }
         } : {}
       })
     });
     return new we({
-      name: U,
+      name: _,
       fields: () => ({
         edges: {
-          type: j(Ee(j(se))),
+          type: j(Ee(j(ie))),
           resolve: N.edges
         },
         pageInfo: {
@@ -15178,14 +15166,14 @@ function Lh(e, t, n, i, s, o) {
           resolve: N.pageInfo
         },
         totalCount: {
-          type: j(me),
+          type: j(he),
           resolve: N.totalCount
         },
         ...re?.() ? {
           aggregate: {
             type: j(re()),
             description: "Aggregates over every matching node (not just this page).",
-            resolve: (ye) => ye.__aggregate
+            resolve: (ge) => ge.__aggregate
           }
         } : {}
       })
@@ -15194,14 +15182,14 @@ function Lh(e, t, n, i, s, o) {
     name: "RelationshipCount",
     description: "Related nodes, and the relationships to them: they differ when several relationships lead to the same node.",
     fields: {
-      nodes: { type: j(me) },
-      edges: { type: j(me) }
+      nodes: { type: j(he) },
+      edges: { type: j(he) }
     }
-  }), F = (U, z, V, H = !1) => {
+  }), F = (_, z, V, H = !1) => {
     if (!z.aggregate) return;
-    let re = I.get(U);
+    let re = I.get(_);
     if (!re) {
-      const se = (w, k) => {
+      const ie = (w, k) => {
         if (R.has(w)) return R.get(w);
         const L = [...k].filter(Kc), Q = L.length > 0 ? new we({
           name: w,
@@ -15213,29 +15201,29 @@ function Lh(e, t, n, i, s, o) {
           )
         }) : void 0;
         return R.set(w, Q), Q;
-      }, ye = se(
+      }, ge = ie(
         `${z.name}AggregateNode`,
         [...z.fields.values()].filter(
           (w) => w.kind === "scalar"
         )
-      ), De = V ? se(`${V.name}AggregateEdge`, V.fields.values()) : void 0;
+      ), De = V ? ie(`${V.name}AggregateEdge`, V.fields.values()) : void 0;
       re = new we({
-        name: U,
+        name: _,
         fields: {
-          count: H ? { type: j(C) } : { type: j(me), description: "Matching nodes." },
-          ...ye ? { node: { type: j(ye) } } : {},
+          count: H ? { type: j(C) } : { type: j(he), description: "Matching nodes." },
+          ...ge ? { node: { type: j(ge) } } : {},
           ...De ? { edge: { type: j(De) } } : {}
         }
-      }), I.set(U, re);
+      }), I.set(_, re);
     }
     return re;
-  }, Y = /* @__PURE__ */ new Map(), v = (U) => {
-    let z = Y.get(U.name);
+  }, Y = /* @__PURE__ */ new Map(), v = (_) => {
+    let z = Y.get(_.name);
     return z || (z = new we({
-      name: U.name,
-      description: U.description,
+      name: _.name,
+      description: _.description,
       fields: () => Object.fromEntries(
-        [...U.fields.values()].filter((V) => !V.private && V.selectableOn.read).map((V) => [
+        [..._.fields.values()].filter((V) => !V.private && V.selectableOn.read).map((V) => [
           V.name,
           {
             type: f(V),
@@ -15244,17 +15232,17 @@ function Lh(e, t, n, i, s, o) {
           }
         ])
       )
-    }), Y.set(U.name, z)), z;
-  }, T = (U) => ({
-    where: { type: p(U) },
-    ...s.has(U) ? { sort: { type: Ee(j(s.get(U))) } } : {},
-    limit: { type: me }
-  }), D = /* @__PURE__ */ new Map(), A = (U, z, V) => {
+    }), Y.set(_.name, z)), z;
+  }, T = (_) => ({
+    where: { type: p(_) },
+    ...s.has(_) ? { sort: { type: Ee(j(s.get(_))) } } : {},
+    limit: { type: he }
+  }), D = /* @__PURE__ */ new Map(), A = (_, z, V) => {
     const H = [...V.fields.values()].filter((De) => De.sortable), re = e.nodes.get(z.target);
     if (H.length === 0 || re.fields.has("edge")) return;
-    const se = `${te.relConnection(U.name, z.name)}Sort`;
-    let ye = D.get(se);
-    if (!ye) {
+    const ie = `${te.relConnection(_.name, z.name)}Sort`;
+    let ge = D.get(ie);
+    if (!ge) {
       const De = te.sort(V.name);
       let w = D.get(De);
       w || (w = new Ae({
@@ -15263,8 +15251,8 @@ function Lh(e, t, n, i, s, o) {
         fields: Object.fromEntries(
           H.map((k) => [k.name, { type: r }])
         )
-      }), D.set(De, w)), ye = new Ae({
-        name: se,
+      }), D.set(De, w)), ge = new Ae({
+        name: ie,
         description: `Sorts ${z.name} by ${re.name} fields or, under \`edge\`, relationship properties. One field per item; the @key breaks ties.`,
         fields: () => ({
           ...Object.fromEntries(
@@ -15275,38 +15263,38 @@ function Lh(e, t, n, i, s, o) {
           ),
           edge: { type: w }
         })
-      }), D.set(se, ye);
+      }), D.set(ie, ge);
     }
-    return ye;
-  }, x = (U, z = p(U), V = s.get(U)) => ({
+    return ge;
+  }, x = (_, z = p(_), V = s.get(_)) => ({
     where: { type: z },
     sort: { type: Ee(j(V)) },
-    first: { type: me },
+    first: { type: he },
     after: { type: _e },
     last: {
-      type: me,
+      type: he,
       description: "Page backward: the last n before `before`."
     },
     before: { type: _e }
   });
-  for (const U of e.nodes.values()) {
+  for (const _ of e.nodes.values()) {
     const z = new we({
-      name: U.name,
-      description: U.description,
+      name: _.name,
+      description: _.description,
       interfaces: () => [
-        ...U.key.relayId && l ? [l] : [],
-        ...U.interfaces.map((V) => E.get(V)).filter(
+        ..._.key.relayId && l ? [l] : [],
+        ..._.interfaces.map((V) => E.get(V)).filter(
           (V) => V instanceof ci
         )
       ],
       fields: () => {
         const V = {};
-        U.key.relayId && (V.id = {
+        _.key.relayId && (V.id = {
           type: j(Rn),
           description: "Global id.",
-          resolve: (H, re, se, ye) => Uh(U.name, H[ye.path.key])
+          resolve: (H, re, ie, ge) => Uh(_.name, H[ge.path.key])
         });
-        for (const H of U.fields.values()) {
+        for (const H of _.fields.values()) {
           if (H.kind === "scalar") {
             if (H.private || !H.selectableOn.read) continue;
             V[H.name] = {
@@ -15327,11 +15315,11 @@ function Lh(e, t, n, i, s, o) {
             continue;
           }
           if (H.kind === "custom") {
-            const se = Z(H.type.named), ye = H.type.list && H.type.itemRequired ? j(se) : se, De = H.type.list ? Ee(ye) : ye;
+            const ie = Z(H.type.named), ge = H.type.list && H.type.itemRequired ? j(ie) : ie, De = H.type.list ? Ee(ge) : ge;
             V[H.name] = {
               type: H.type.required ? j(De) : De,
               description: H.description,
-              resolve: t.customResolver(U, H)
+              resolve: t.customResolver(_, H)
             };
             continue;
           }
@@ -15351,58 +15339,58 @@ function Lh(e, t, n, i, s, o) {
             args: T(H.target),
             resolve: ri
           }, h(H) || (V[te.connectionField(H.name)] = q(
-            U,
+            _,
             H
           ));
         }
         return V;
       }
     });
-    g.set(U.name, z), y.set(
-      U.name,
+    g.set(_.name, z), y.set(
+      _.name,
       O(
-        te.connection(U.name),
-        te.edge(U.name),
+        te.connection(_.name),
+        te.edge(_.name),
         () => z,
         void 0,
         () => F(
-          `${te.connection(U.name)}Aggregate`,
-          U,
+          `${te.connection(_.name)}Aggregate`,
+          _,
           void 0
         )
       )
     );
   }
-  function q(U, z) {
+  function q(_, z) {
     if (!us(z)) {
-      const se = e.nodes.get(z.target), ye = z.aggregate && !se.aggregate ? y.get(z.target) : O(
-        te.relConnection(U.name, z.name),
-        te.relEdge(U.name, z.name),
+      const ie = e.nodes.get(z.target), ge = z.aggregate && !ie.aggregate ? y.get(z.target) : O(
+        te.relConnection(_.name, z.name),
+        te.relEdge(_.name, z.name),
         () => g.get(z.target),
         void 0,
         z.aggregate ? () => F(
-          `${te.relConnection(U.name, z.name)}Aggregate`,
-          se,
+          `${te.relConnection(_.name, z.name)}Aggregate`,
+          ie,
           void 0,
           !0
         ) : void 0
       );
       return {
-        type: j(ye),
+        type: j(ge),
         args: x(z.target),
         resolve: wn
       };
     }
-    const V = e.relationshipProperties.get(z.properties), H = m(U, z), re = O(
-      te.relConnection(U.name, z.name),
-      te.relEdge(U.name, z.name),
+    const V = e.relationshipProperties.get(z.properties), H = m(_, z), re = O(
+      te.relConnection(_.name, z.name),
+      te.relEdge(_.name, z.name),
       () => g.get(z.target),
       // Every property hidden from reads (@private, @selectable(onRead:
       // false)): no edge type, and no `properties` on the edge. The
       // properties stay settable through `edge` inputs.
-      [...V.fields.values()].some((se) => !se.private && se.selectableOn.read) ? () => v(V) : void 0,
+      [...V.fields.values()].some((ie) => !ie.private && ie.selectableOn.read) ? () => v(V) : void 0,
       z.aggregate ? () => F(
-        `${te.relConnection(U.name, z.name)}Aggregate`,
+        `${te.relConnection(_.name, z.name)}Aggregate`,
         e.nodes.get(z.target),
         V,
         !0
@@ -15413,37 +15401,37 @@ function Lh(e, t, n, i, s, o) {
       args: x(
         z.target,
         H,
-        A(U, z, V) ?? s.get(z.target)
+        A(_, z, V) ?? s.get(z.target)
       ),
       resolve: wn
     };
   }
   const X = /* @__PURE__ */ new Map();
-  for (const U of e.objects.values())
+  for (const _ of e.objects.values())
     X.set(
-      U.name,
+      _.name,
       new we({
-        name: U.name,
-        description: U.description,
+        name: _.name,
+        description: _.description,
         fields: () => Object.fromEntries(
-          [...U.fields.values()].map((z) => {
+          [..._.fields.values()].map((z) => {
             const V = Z(z.type.named), H = z.type.list && z.type.itemRequired ? j(V) : V, re = z.type.list ? Ee(H) : H;
             return [z.name, { type: z.type.required ? j(re) : re }];
           })
         )
       })
     );
-  const Z = (U) => g.get(U) ?? E.get(U) ?? X.get(U) ?? c.get(U) ?? u(U) ?? d(U, void 0);
-  function ne(U) {
-    const z = Z(U.type.named), V = U.type.list && U.type.itemRequired ? j(z) : z, H = U.type.list ? Ee(V) : V;
-    return U.type.required ? j(H) : H;
+  const Z = (_) => g.get(_) ?? E.get(_) ?? X.get(_) ?? c.get(_) ?? u(_) ?? d(_, void 0);
+  function ne(_) {
+    const z = Z(_.type.named), V = _.type.list && _.type.itemRequired ? j(z) : z, H = _.type.list ? Ee(V) : V;
+    return _.type.required ? j(H) : H;
   }
-  function de(U) {
+  function de(_) {
     const z = {};
-    for (const V of U.args) {
-      const H = Z(V.type.named), re = V.type.list && V.type.itemRequired ? j(H) : H, se = V.type.list ? Ee(re) : re;
+    for (const V of _.args) {
+      const H = Z(V.type.named), re = V.type.list && V.type.itemRequired ? j(H) : H, ie = V.type.list ? Ee(re) : re;
       z[V.name] = {
-        type: V.type.required ? j(se) : se,
+        type: V.type.required ? j(ie) : ie,
         defaultValue: V.defaultValue,
         description: V.description
       };
@@ -15508,7 +15496,7 @@ function Ph(e, t, n, i, s, o) {
         args: {
           by: { type: j(Ee(j(F.field))) },
           where: { type: d(R.name) },
-          limit: { type: me }
+          limit: { type: he }
         },
         resolve: I("grouped", R)
       });
@@ -15552,7 +15540,7 @@ function Ph(e, t, n, i, s, o) {
           resolve: m.pageInfo
         },
         totalCount: {
-          type: j(me),
+          type: j(he),
           description: "Every match after `where` and the read rules (a vector search counts within its candidate window).",
           resolve: m.totalCount
         }
@@ -15561,7 +15549,7 @@ function Ph(e, t, n, i, s, o) {
     for (const T of R.search) {
       const D = {
         where: { type: d(R.name) },
-        limit: { type: me }
+        limit: { type: he }
       }, A = T.kind === "fulltext" ? { query: { type: j(_e) } } : {
         vector: { type: Ee(j(Ne)) },
         to: { type: u(R.key) }
@@ -15572,7 +15560,7 @@ function Ph(e, t, n, i, s, o) {
         args: {
           ...A,
           where: { type: d(R.name) },
-          first: { type: me },
+          first: { type: he },
           after: { type: _e }
         },
         resolve: (x, q, X, Z) => t.resolveSearch(R, T, Z, X, !0)
@@ -16290,9 +16278,9 @@ class Qh {
       fragments: {},
       variables: {}
     }, o = this.#e.context(s, i);
-    ge(o, t, "SUBSCRIBE"), ge(o, t, "READ");
+    me(o, t, "SUBSCRIBE"), me(o, t, "READ");
     for (const y of ["SUBSCRIBE", "READ"])
-      ce(o, t, "n", y), Re(o, t, "n", y, "BEFORE");
+      ae(o, t, "n", y), Re(o, t, "n", y, "BEFORE");
     const r = `${t.name[0].toLowerCase()}${t.name.slice(1)}Changed`, a = n.where;
     this.#e.charge(
       r,
@@ -16437,9 +16425,9 @@ class Qh {
       let l = o;
       if (!l || c === void 0 || l.claims !== c || !Fr(l.contextReads, s)) {
         const u = this.#e.context(i, s), d = [], f = pe(
-          ce(u, t, "n", "READ"),
+          ae(u, t, "n", "READ"),
           Re(u, t, "n", "READ", "BEFORE"),
-          ce(u, t, "n", "SUBSCRIBE"),
+          ae(u, t, "n", "SUBSCRIBE"),
           Re(u, t, "n", "SUBSCRIBE", "BEFORE")
         ), p = sn([
           { kind: "unwind", expr: B(u, d), alias: "k" },
@@ -16450,14 +16438,14 @@ class Qh {
               hops: []
             },
             where: pe(
-              ee("=", ae(_("n"), t.key.property), _("k")),
+              se("=", ue(U("n"), t.key.property), U("k")),
               qe(u, t, "n", n),
               f
             )
           },
           {
             kind: "return",
-            items: [{ expr: ae(_("n"), t.key.property), alias: "key" }]
+            items: [{ expr: ue(U("n"), t.key.property), alias: "key" }]
           }
         ]);
         l = {
@@ -16567,12 +16555,12 @@ class Qh {
     const [c, l] = n.field.split("."), u = c ? this.#t.nodes.get(c) : void 0, d = l ? u?.fields.get(l) : void 0, f = this.#e.context(s, o);
     let p, h;
     try {
-      if (ge(f, a, "READ"), p = pe(
-        ce(f, a, "m", "READ"),
+      if (me(f, a, "READ"), p = pe(
+        ae(f, a, "m", "READ"),
         Re(f, a, "m", "READ", "BEFORE")
       ), u && d?.kind === "relationship") {
         be(f, u.name, d);
-        const $ = Fi(f, u, d, i ? "n" : "m"), N = $ && oe("coalesce", $.when, G(!1));
+        const $ = Fi(f, u, d, i ? "n" : "m"), N = $ && ee("coalesce", $.when, G(!1));
         i ? h = N : p = pe(p, N);
       }
     } catch {
@@ -16584,14 +16572,14 @@ class Qh {
       kind: "match",
       pattern: { start: { variable: $, labels: [N.labels[0]] }, hops: [] },
       where: pe(
-        ee("=", ae(_($), N.key.property), ae(_("p"), O)),
+        se("=", ue(U($), N.key.property), ue(U("p"), O)),
         I
       )
     }), E = sn([
       { kind: "unwind", expr: g, alias: "p" },
       y("m", a, "r", p),
       ...h ? [y("n", t, "s", h)] : [],
-      { kind: "return", items: [{ expr: ae(_("p"), "i"), alias: "i" }] }
+      { kind: "return", items: [{ expr: ue(U("p"), "i"), alias: "i" }] }
     ]), b = Object.keys(f.params).find(($) => f.params[$] === m);
     return {
       kind: "check",
@@ -17849,4 +17837,4 @@ export {
   Jh as x,
   tm as y
 };
-//# sourceMappingURL=lora-graphql-CR1tRkf_.js.map
+//# sourceMappingURL=lora-graphql-CjaQGsy7.js.map