@nivaro/react 0.3.34 → 0.3.35

package/dist/shared/components/item-edit/usePersonalDefaults.js

@@ -1,283 +1,309 @@
-import { useQueryClient as Le, useQuery as Ne } from "@tanstack/react-query";
-import { useRef as h, useMemo as Pe, useState as ne, useEffect as L, useCallback as a, createContext as Qe, useContext as ze } from "react";
-import { useNivaroClient as Te } from "../../context.js";
-import { get as Ye, del as Ee, put as Re } from "../../lib/commands.js";
-import { isEmptyValue as w, pickDefault as se, cascadeParents as V, orderTopDown as He, captureContext as Be } from "../../lib/personal-defaults.js";
-import { titleCase as Je } from "../../lib/utils.js";
-const We = Qe(null);
-function rt() {
-  return ze(We);
+import { useQueryClient as Qe, useQuery as ze } from "@tanstack/react-query";
+import { useRef as F, useMemo as Ee, useState as ce, useEffect as z, useCallback as a, createContext as He, useContext as Ie } from "react";
+import { useNivaroClient as _e } from "../../context.js";
+import { get as Be, put as oe, del as Je } from "../../lib/commands.js";
+import { isEmptyValue as g, pickDefault as ue, cascadeParents as C, orderTopDown as Ue, captureContext as We } from "../../lib/personal-defaults.js";
+import { titleCase as Ne } from "../../lib/utils.js";
+const Ge = He(null);
+function it() {
+  return Ie(Ge);
 }
-function N(u) {
-  return ["field-defaults", u];
+function j(o) {
+  return ["field-defaults", o];
 }
-function J(u) {
-  return Array.isArray(u) ? u.map(J) : u && typeof u == "object" && "id" in u ? u.id : u;
+function O(o) {
+  return Array.isArray(o) ? o.map(O) : o && typeof o == "object" && "id" in o ? o.id : o;
 }
-function S(u, f) {
-  if (w(u) && w(f)) return !0;
-  const m = (P) => {
-    const x = J(P);
-    return Array.isArray(x) ? x.map((b) => String(b)).sort() : String(x);
+const Xe = /* @__PURE__ */ new Set(["integer", "bigInteger", "float", "decimal", "number", "double"]), Ze = /* @__PURE__ */ new Set(["date"]), et = /* @__PURE__ */ new Set(["dateTime", "datetime", "timestamp", "time"]);
+function q(o, i, v) {
+  if (g(o) && g(i)) return !0;
+  if (v && !Array.isArray(o) && !Array.isArray(i) && !g(o) && !g(i)) {
+    const S = O(o), b = O(i);
+    if (Xe.has(v)) {
+      const d = Number(S), p = Number(b);
+      if (Number.isFinite(d) && Number.isFinite(p)) return d === p;
+    } else if (Ze.has(v)) {
+      const d = (A) => {
+        var V;
+        return (V = /^(\d{4}-\d{2}-\d{2})/.exec(String(A))) == null ? void 0 : V[1];
+      }, p = d(S), f = d(b);
+      if (p && f) return p === f;
+    } else if (et.has(v)) {
+      const d = Date.parse(String(S)), p = Date.parse(String(b));
+      if (Number.isFinite(d) && Number.isFinite(p)) return d === p;
+    }
+  }
+  const D = (S) => {
+    const b = O(S);
+    return Array.isArray(b) ? b.map((d) => String(d)).sort() : String(b);
   };
-  return JSON.stringify(m(u)) === JSON.stringify(m(f));
+  return JSON.stringify(D(o)) === JSON.stringify(D(i));
 }
-function nt(u, f) {
-  let m = 0;
-  for (const [P, x] of u) {
-    const b = f.get(P);
-    for (const k of x) b != null && b.has(String(k)) || m++;
+function lt(o, i) {
+  let v = 0;
+  for (const [D, S] of o) {
+    const b = i.get(D);
+    for (const d of S) b != null && b.has(String(d)) || v++;
   }
-  return m;
+  return v;
 }
-function Ge(u) {
-  return Array.isArray(u) ? u : w(u) ? [] : [u];
+function tt(o) {
+  return Array.isArray(o) ? o : g(o) ? [] : [o];
 }
-function st(u) {
-  const { collection: f, isNew: m, disabled: P, enabled: x = !0, ready: b = !0 } = u, k = Te(), F = Le(), d = h(u);
-  d.current = u;
-  const { data: Q } = Ne({
-    queryKey: N(f),
-    queryFn: () => k.request(Ye("/field-defaults/mine", { collection: f })).then((e) => e.data ?? []),
+function ft(o) {
+  const { collection: i, isNew: v, disabled: D, enabled: S = !0, ready: b = !0 } = o, d = _e(), p = Qe(), f = F(o);
+  f.current = o;
+  const { data: A, isError: V } = ze({
+    queryKey: j(i),
+    queryFn: () => d.request(Be("/field-defaults/mine", { collection: i })).then((e) => e.data ?? []),
     staleTime: 5 * 6e4,
-    enabled: !!f && x
-  }), z = Pe(() => {
+    enabled: !!i && S
+  }), H = Ee(() => {
     const e = /* @__PURE__ */ new Map();
-    for (const t of Q ?? []) {
+    for (const t of A ?? []) {
       const r = e.get(t.field) ?? [];
       r.push(t), e.set(t.field, r);
     }
     return e;
-  }, [Q]), W = h(z);
-  W.current = z;
-  const i = h(/* @__PURE__ */ new Map()), [G, Me] = ne(() => /* @__PURE__ */ new Map()), v = h(/* @__PURE__ */ new Map()), [ce, qe] = ne(() => /* @__PURE__ */ new Map()), R = h(/* @__PURE__ */ new Set()), T = h(!0);
-  L(() => (T.current = !0, () => {
-    T.current = !1;
+  }, [A]), W = F(H);
+  W.current = H;
+  const y = F(/* @__PURE__ */ new Map()), [G, Te] = ce(() => /* @__PURE__ */ new Map()), P = F(/* @__PURE__ */ new Map()), [ae, Ce] = ce(() => /* @__PURE__ */ new Map()), E = F(/* @__PURE__ */ new Set()), I = F(!0);
+  z(() => (I.current = !0, () => {
+    I.current = !1;
   }), []);
-  const p = a(() => {
-    T.current && (Me((e) => {
-      const t = i.current;
+  const m = a(() => {
+    I.current && (Te((e) => {
+      const t = y.current;
       return e.size === t.size && [...t].every(([r, n]) => e.get(r) === n) ? e : new Map(t);
-    }), qe((e) => {
-      const t = v.current;
+    }), Ce((e) => {
+      const t = P.current;
       return e.size === t.size && [...t].every(([r, n]) => e.get(r) === n) ? e : new Map(t);
     }));
-  }, []), l = a((e) => {
+  }, []), c = a((e) => {
     var n;
-    const t = d.current, r = (n = t.readValue) == null ? void 0 : n.call(t, e);
+    const t = f.current, r = (n = t.readValue) == null ? void 0 : n.call(t, e);
     return r !== void 0 ? r : t.draftRef.current[e];
-  }, []), A = a(
+  }, []), N = a(
     (e) => {
       const t = {};
-      for (const r of e) t[r] = l(r);
+      for (const r of e) t[r] = c(r);
       return t;
     },
-    [l]
+    [c]
   ), M = a(async (e, t) => {
-    const r = d.current, s = (await Promise.all(
-      Ge(J(t)).map(async (o) => {
-        if (!r.valueLabel) return String(o);
+    const r = f.current, s = (await Promise.all(
+      tt(O(t)).map(async (l) => {
+        if (!r.valueLabel) return String(l);
         try {
-          return await r.valueLabel(e, o) ?? null;
+          return await r.valueLabel(e, l) ?? null;
         } catch {
           return null;
         }
       })
-    )).filter((o) => !!o);
+    )).filter((l) => !!l);
     return s.length > 0 ? s.join(", ") : null;
-  }, []), q = h(0), Y = a(
+  }, []), K = F(0), _ = a(
     async (e, t, r) => {
       const n = await t;
-      q.current === r && (v.current.set(e, n), p());
+      K.current === r && (P.current.set(e, n), m());
     },
-    [p]
-  ), I = a(
+    [m]
+  ), X = a(
     async (e, t) => {
-      var s, o;
-      const r = ((o = (s = d.current).fieldLabel) == null ? void 0 : o.call(s, e)) ?? e, n = await M(e, t);
+      var s, l;
+      const r = ((l = (s = f.current).fieldLabel) == null ? void 0 : l.call(s, e)) ?? e, n = await M(e, t);
       return n ? `Your default is for ${r} “${n}”` : `Your saved default is for a different ${r}`;
     },
     [M]
-  ), E = a((e, t, r) => {
-    const n = d.current;
-    if (n.setFieldValue(e, t, r), w(t)) {
-      i.current.delete(e);
+  ), B = a((e, t, r) => {
+    const n = f.current;
+    if (n.setFieldValue(e, t, r), g(t)) {
+      y.current.delete(e);
       return;
     }
-    i.current.set(e, t), v.current.delete(e), n.markAutoFilled([e]);
-  }, []), ue = a(
+    y.current.set(e, t), P.current.delete(e), n.markAutoFilled([e]);
+  }, []), ie = a(
     async (e, t) => {
-      var ke, ve, be, Fe, xe, Ae;
-      const r = d.current, n = () => q.current !== t, s = W.current.get(e) ?? [];
+      var Se, Ae, Pe, Me, Re, qe;
+      const r = f.current, n = () => K.current !== t, s = W.current.get(e) ?? [];
       if (s.length === 0 || !r.layoutAllows(e)) return [];
-      if (R.current.has(e) || !(((ke = r.canFill) == null ? void 0 : ke.call(r, e)) ?? !0)) return [];
-      const o = l(e), y = !w(o);
-      if (y && !(((ve = r.replaceable) == null ? void 0 : ve.call(r, e, o)) ?? !1)) return [];
-      const K = new Set(s.flatMap((c) => Object.keys(c.context ?? {}))), we = A(K), { pick: j, fillParents: te, blockedBy: C } = se(s, we);
-      if (!j) {
-        if (C) {
-          const c = (be = s.find(
-            (g) => g.context && C in g.context && !S(g.context[C], we[C])
-          )) == null ? void 0 : be.context[C];
-          await Y(e, I(C, c), t);
+      if (E.current.has(e) || !(((Se = r.canFill) == null ? void 0 : Se.call(r, e)) ?? !0)) return [];
+      const l = c(e), w = !g(l);
+      if (w && !(((Ae = r.replaceable) == null ? void 0 : Ae.call(r, e, l)) ?? !1)) return [];
+      const T = new Set(s.flatMap((u) => Object.keys(u.context ?? {}))), U = N(T), { pick: h, fillParents: R, blockedBy: Y } = ue(s, U);
+      if (!h) {
+        if (Y) {
+          const u = (Pe = s.find(
+            (k) => k.context && Y in k.context && !q(k.context[Y], U[Y])
+          )) == null ? void 0 : Pe.context[Y];
+          await _(e, X(Y, u), t);
         }
         return [];
       }
-      const ge = V(e, r.rulesFor).reverse(), je = [
-        ...ge.filter((c) => c in te),
-        ...Object.keys(te).filter((c) => !ge.includes(c))
-      ], re = [], O = () => {
-        for (const [c, g] of re.reverse())
-          S(l(c), g) ? E(c, null, g) : i.current.delete(c);
+      const ke = C(e, r.rulesFor).reverse(), Le = [
+        ...ke.filter((u) => u in R),
+        ...Object.keys(R).filter((u) => !ke.includes(u))
+      ], se = [], $ = () => {
+        for (const [u, k] of se.reverse())
+          q(c(u), k) ? B(u, null, k) : y.current.delete(u);
       };
-      for (const c of je) {
-        const g = te[c], Se = r.layoutAllows(c) && !R.current.has(c) && (((Fe = r.canFill) == null ? void 0 : Fe.call(r, c)) ?? !0) ? await r.revalidate(c, g) : !1;
+      for (const u of Le) {
+        const k = R[u], De = r.layoutAllows(u) && !E.current.has(u) && (((Me = r.canFill) == null ? void 0 : Me.call(r, u)) ?? !0) ? await r.revalidate(u, k) : !1;
         if (n()) return [];
-        if (Se === null)
-          return O(), [];
-        if (!Se || !w(l(c)))
-          return O(), await Y(e, I(c, g), t), [];
-        E(c, g), re.push([c, g]);
+        if (De === null)
+          return $(), [];
+        if (!De || !g(c(u)))
+          return $(), await _(e, X(u, k), t), [];
+        B(u, k), se.push([u, k]);
       }
-      const he = await r.revalidate(e, j.value);
+      const Fe = await r.revalidate(e, h.value);
       if (n()) return [];
-      if (he === null)
-        return O(), [];
-      if (!he)
-        return O(), await Y(
+      if (Fe === null)
+        return $(), [];
+      if (!Fe)
+        return $(), await _(
           e,
-          M(e, j.value).then(
-            (c) => c ? `Your default "${c}" is no longer available` : "Your saved default is no longer available"
+          M(e, h.value).then(
+            (u) => u ? `Your default "${u}" is no longer available` : "Your saved default is no longer available"
           ),
           t
         ), [];
-      if (!S(l(e), o) || !(((xe = r.canFill) == null ? void 0 : xe.call(r, e)) ?? !0))
-        return O(), [];
-      const me = se(s, A(K));
-      return ((Ae = me.pick) == null ? void 0 : Ae.id) !== j.id || Object.keys(me.fillParents).length > 0 ? (O(), "stale") : (E(e, j.value, y ? o : void 0), [...re.map(([c]) => c), e]);
+      if (!q(c(e), l) || !(((Re = r.canFill) == null ? void 0 : Re.call(r, e)) ?? !0))
+        return $(), [];
+      const xe = ue(s, N(T));
+      return ((qe = xe.pick) == null ? void 0 : qe.id) !== h.id || Object.keys(xe.fillParents).length > 0 ? ($(), "stale") : (B(e, h.value, w ? l : void 0), [...se.map(([u]) => u), e]);
     },
-    [l, A, Y, I, M, E]
-  ), oe = a(
+    [c, N, _, X, M, B]
+  ), le = a(
     async (e, t) => {
       for (let r = 0; r < 3; r++) {
-        const n = await ue(e, t);
+        const n = await ie(e, t);
         if (n !== "stale") return n;
       }
       return [];
     },
-    [ue]
-  ), U = a(
+    [ie]
+  ), Z = a(
     async (e) => {
       var n, s;
-      const t = q.current, r = /* @__PURE__ */ new Set();
-      for (const o of e) {
-        if (!T.current || q.current !== t) return;
-        for (const y of await oe(o, t)) r.add(y);
-        p();
+      const t = K.current, r = /* @__PURE__ */ new Set();
+      for (const l of e) {
+        if (!I.current || K.current !== t) return;
+        for (const w of await le(l, t)) r.add(w);
+        m();
       }
-      if (q.current === t) {
-        for (const o of r)
-          i.current.has(o) && ((s = (n = d.current).afterApply) == null || s.call(n, o, i.current.get(o)));
-        p();
+      if (K.current === t) {
+        for (const l of r)
+          y.current.has(l) && ((s = (n = f.current).afterApply) == null || s.call(n, l, y.current.get(l)));
+        m();
       }
     },
-    [oe, p]
-  ), X = a(() => {
-    const e = d.current;
-    return He(
+    [le, m]
+  ), ee = a(() => {
+    const e = f.current;
+    return Ue(
       [...W.current.keys()].filter((t) => e.layoutAllows(t)),
       e.rulesFor
     );
-  }, []), Z = h(!1);
-  L(() => {
-    !m || P || !b || Z.current || Q === void 0 || (Z.current = !0, U(X()));
-  }, [m, P, b, Q, U, X]), L(() => {
+  }, []), te = F(!1);
+  z(() => {
+    !v || D || !b || te.current || A === void 0 || (te.current = !0, Z(ee()));
+  }, [v, D, b, A, Z, ee]), z(() => {
     let e = !1;
-    for (const [t, r] of i.current)
-      S(l(t), r) || (i.current.delete(t), e = !0);
-    for (const t of v.current.keys())
-      w(l(t)) || (v.current.delete(t), e = !0);
-    e && p();
+    for (const [t, r] of y.current)
+      q(c(t), r) || (y.current.delete(t), e = !0);
+    for (const t of P.current.keys())
+      g(c(t)) || (P.current.delete(t), e = !0);
+    e && m();
   });
-  const D = h(/* @__PURE__ */ new Set()), $ = h(/* @__PURE__ */ new Map()), [Ce, Oe] = ne(0), Ve = a(
+  const L = F(/* @__PURE__ */ new Set()), Q = F(/* @__PURE__ */ new Map()), [Oe, Ve] = ce(0), Ke = a(
     (e) => {
-      let t = i.current.delete(e);
-      if (v.current.delete(e) && (t = !0), R.current.delete(e), $.current.delete(e), !d.current.isNew) {
-        t && p();
+      let t = y.current.delete(e);
+      if (P.current.delete(e) && (t = !0), E.current.delete(e), Q.current.delete(e), !f.current.isNew) {
+        t && m();
         return;
       }
-      const r = d.current.rulesFor;
-      for (const [n, s] of [...i.current])
-        V(n, r).includes(e) && ($.current.set(n, s), i.current.delete(n), t = !0);
-      t && p(), D.current.add(e), Oe((n) => n + 1);
+      const r = f.current.rulesFor;
+      for (const [n, s] of [...y.current])
+        C(n, r).includes(e) && (Q.current.set(n, s), y.current.delete(n), t = !0);
+      t && m(), L.current.add(e), Ve((n) => n + 1);
     },
-    [p]
+    [m]
   );
-  L(() => {
-    if (D.current.size === 0 || d.current.disabled) return;
-    const e = [...D.current];
-    D.current.clear();
-    const t = new Map($.current);
-    $.current.clear();
-    const r = d.current, n = [];
-    for (const s of X()) {
+  z(() => {
+    if (L.current.size === 0 || f.current.disabled) return;
+    const e = [...L.current];
+    L.current.clear();
+    const t = new Map(Q.current);
+    Q.current.clear();
+    const r = f.current, n = [];
+    for (const s of ee()) {
       if (t.has(s)) {
-        const y = t.get(s), K = l(s);
-        if (S(K, y)) r.setFieldValue(s, null, y);
-        else if (!w(K)) continue;
+        const w = t.get(s), T = c(s);
+        if (q(T, w)) r.setFieldValue(s, null, w);
+        else if (!g(T)) continue;
         n.push(s);
         continue;
       }
-      const o = V(s, r.rulesFor);
-      e.some((y) => o.includes(y)) && v.current.has(s) && w(l(s)) && (v.current.delete(s), n.push(s));
+      const l = C(s, r.rulesFor);
+      e.some((w) => l.includes(w)) && P.current.has(s) && g(c(s)) && (P.current.delete(s), n.push(s));
     }
-    p(), n.length > 0 && U(n);
-  }, [Ce]);
-  const _ = a(
+    m(), n.length > 0 && Z(n);
+  }, [Oe]);
+  const re = a(
     (e) => {
-      const t = d.current;
-      if (!i.current.has(e)) return;
+      const t = f.current;
+      if (!y.current.has(e)) return;
       const r = [
         e,
-        ...[...i.current.keys()].filter(
-          (n) => n !== e && V(n, t.rulesFor).includes(e)
+        ...[...y.current.keys()].filter(
+          (n) => n !== e && C(n, t.rulesFor).includes(e)
         )
       ];
       for (const n of r) {
-        const s = i.current.get(n);
-        S(l(n), s) && t.setFieldValue(n, null, s), i.current.delete(n);
+        const s = y.current.get(n);
+        q(c(n), s) && t.setFieldValue(n, null, s), y.current.delete(n);
       }
-      R.current.add(e), p();
+      E.current.add(e), m();
     },
-    [l, p]
-  ), De = a(
+    [c, m]
+  ), Ye = a(
     (e) => {
-      if (!i.current.has(e)) return;
-      const t = i.current.get(e);
-      S(l(e), t) && d.current.setFieldValue(e, null, t), i.current.delete(e), R.current.add(e), p();
+      if (!y.current.has(e)) return;
+      const t = y.current.get(e);
+      q(c(e), t) && f.current.setFieldValue(e, null, t), y.current.delete(e), E.current.add(e), m();
     },
-    [l, p]
-  ), H = `${f}|${m ? "new" : "saved"}|${u.resetKey ?? ""}`, ae = h(H);
-  L(() => {
-    ae.current !== H && (ae.current = H, i.current.clear(), v.current.clear(), R.current.clear(), $.current.clear(), D.current.clear(), Z.current = !1, q.current += 1, p());
-  }, [H, p]);
-  const ee = a((e) => ce.get(e) ?? null, [ce]), $e = a(() => i.current, []), B = a(
+    [c, m]
+  ), J = `${i}|${v ? "new" : "saved"}|${o.resetKey ?? ""}`, fe = F(J);
+  z(() => {
+    fe.current !== J && (fe.current = J, y.current.clear(), P.current.clear(), E.current.clear(), Q.current.clear(), L.current.clear(), te.current = !1, K.current += 1, m());
+  }, [J, m]);
+  const ne = a((e) => ae.get(e) ?? null, [ae]), $e = a(() => y.current, []), x = a(
     (e) => {
-      const t = z.get(e) ?? [];
+      const t = H.get(e) ?? [];
       if (t.length === 0) return null;
       const r = new Set(t.flatMap((n) => Object.keys(n.context ?? {})));
-      return se(t, A(r)).pick;
+      return ue(t, N(r)).pick;
     },
-    [z, A]
-  ), le = a(() => {
-    F.invalidateQueries({ queryKey: N(f) });
-  }, [F, f]), ie = a(
-    (e) => !w(l(e)),
-    [l]
-  ), fe = a(
+    [H, N]
+  ), de = a(() => {
+    p.invalidateQueries({ queryKey: j(i) });
+  }, [p, i]), ye = a(
+    (e) => !g(c(e)),
+    [c]
+  ), we = a(
+    (e) => {
+      var n, s;
+      const t = c(e);
+      if (g(t)) return !1;
+      const r = x(e);
+      return !!r && q(r.value, t, (s = (n = f.current).fieldType) == null ? void 0 : s.call(n, e));
+    },
+    [c, x]
+  ), pe = a(
     async (e) => {
-      const t = d.current, r = [
-        ...[...V(e, t.rulesFor)].reverse().filter((n) => t.layoutAllows(n) && !w(l(n))),
+      const t = f.current, r = [
+        ...[...C(e, t.rulesFor)].reverse().filter((n) => t.layoutAllows(n) && !g(c(n))),
         e
       ];
       return Promise.all(
@@ -285,74 +311,132 @@ function st(u) {
         r.map(
           async (n) => {
             var s;
-            return await M(n, l(n)) ?? ((s = t.fieldLabel) == null ? void 0 : s.call(t, n)) ?? Je(n);
+            return await M(n, c(n)) ?? ((s = t.fieldLabel) == null ? void 0 : s.call(t, n)) ?? Ne(n);
           }
         )
       );
     },
-    [l, M]
-  ), de = a(
+    [c, M]
+  ), me = a(
     async (e) => {
-      const t = d.current, r = l(e);
-      if (w(r)) throw new Error("Pick a value first");
-      const n = V(e, t.rulesFor), s = A([e, ...n]), o = (y) => k.request(
-        Re("/field-defaults/mine", {
-          collection: f,
-          field: y,
-          value: J(s[y]),
-          context: Be(y, s, t.rulesFor)
+      const t = f.current, r = c(e);
+      if (g(r)) throw new Error("Pick a value first");
+      const n = C(e, t.rulesFor), s = N([e, ...n]), l = (w) => d.request(
+        oe("/field-defaults/mine", {
+          collection: i,
+          field: w,
+          value: O(s[w]),
+          context: We(w, s, t.rulesFor)
         })
       );
       try {
-        await o(e);
-        for (const y of [...n].reverse())
-          t.layoutAllows(y) && !w(s[y]) && await o(y);
+        await l(e);
+        for (const w of [...n].reverse())
+          t.layoutAllows(w) && !g(s[w]) && await l(w);
+      } finally {
+        await p.invalidateQueries({ queryKey: j(i) });
+      }
+    },
+    [d, p, i, c, N]
+  ), he = a(
+    async (e) => {
+      const t = x(e);
+      if (!t) throw new Error("You have no default here to update");
+      const r = c(e);
+      if (g(r)) throw new Error("Pick a value first");
+      try {
+        await d.request(
+          oe("/field-defaults/mine", {
+            collection: i,
+            field: e,
+            value: O(r),
+            context: t.context ?? {}
+          })
+        );
       } finally {
-        await F.invalidateQueries({ queryKey: N(f) });
+        await p.invalidateQueries({ queryKey: j(i) });
       }
     },
-    [k, F, f, l, A]
-  ), ye = a(
+    [d, p, i, c, x]
+  ), ge = a(
     async (e) => {
-      const t = B(e);
-      return t ? (await k.request(Ee(`/field-defaults/mine/${t.id}`)), await F.invalidateQueries({ queryKey: N(f) }), t) : null;
+      const t = f.current, r = x(e), n = (r == null ? void 0 : r.context) ?? {}, s = [...C(e, t.rulesFor)].reverse(), l = [
+        ...s.filter((h) => h in n),
+        ...Object.keys(n).filter((h) => !s.includes(h))
+      ], w = (h) => {
+        var R;
+        return ((R = t.fieldLabel) == null ? void 0 : R.call(t, h)) ?? Ne(h);
+      }, [T, ...U] = await Promise.all([
+        M(e, c(e)).then((h) => h ?? w(e)),
+        ...l.map((h) => M(h, n[h]).then((R) => R ?? w(h)))
+      ]);
+      return { value: T, context: U };
     },
-    [k, F, f, B]
-  ), pe = a(
+    [c, x, M]
+  ), be = a(
+    async (e) => {
+      const t = x(e);
+      return t ? (await d.request(Je(`/field-defaults/mine/${t.id}`)), y.current.delete(e) && (E.current.add(e), m()), await p.invalidateQueries({ queryKey: j(i) }), t) : null;
+    },
+    [d, p, i, x, m]
+  ), ve = a(
     async (e) => {
-      await k.request(
-        Re("/field-defaults/mine", {
-          collection: f,
+      await d.request(
+        oe("/field-defaults/mine", {
+          collection: i,
           field: e.field,
           value: e.value,
           context: e.context ?? {}
         })
-      ), await F.invalidateQueries({ queryKey: N(f) });
+      ), await p.invalidateQueries({ queryKey: j(i) });
     },
-    [k, F, f]
-  ), Ke = Pe(
+    [d, p, i]
+  ), je = Ee(
     () => ({
-      allowed: (e) => d.current.layoutAllows(e),
-      defaultFor: B,
-      save: de,
-      clear: ye,
-      restore: pe,
-      refresh: le,
-      hasValue: ie,
-      describeSave: fe,
+      allowed: (e) => (f.current.enabled ?? !0) && f.current.layoutAllows(e),
+      loaded: A !== void 0 || V,
+      failed: A === void 0 && V,
+      isNew: v,
+      defaultFor: x,
+      isDefault: we,
+      save: me,
+      update: he,
+      describeUpdate: ge,
+      clear: be,
+      restore: ve,
+      refresh: de,
+      hasValue: ye,
+      describeSave: pe,
       applied: (e) => G.has(e),
-      hintFor: ee,
-      undo: _
+      hintFor: ne,
+      undo: re
     }),
-    [B, de, ye, pe, le, ie, fe, G, ee, _]
+    [
+      A,
+      V,
+      v,
+      x,
+      we,
+      me,
+      he,
+      ge,
+      be,
+      ve,
+      de,
+      ye,
+      pe,
+      G,
+      ne,
+      re
+    ]
   );
-  return { ledger: G, hintFor: ee, undo: _, onPersonChange: Ve, release: De, appliedNow: $e, context: Ke };
+  return { ledger: G, hintFor: ne, undo: re, onPersonChange: Ke, release: Ye, appliedNow: $e, context: je };
 }
 export {
-  We as PersonalDefaultsContext,
-  nt as linksBeyond,
-  N as personalDefaultsKey,
-  S as sameDefaultValue,
-  st as usePersonalDefaults,
-  rt as usePersonalDefaultsApi
+  Ge as PersonalDefaultsContext,
+  lt as linksBeyond,
+  j as personalDefaultsKey,
+  q as sameDefaultValue,
+  ft as usePersonalDefaults,
+  it as usePersonalDefaultsApi
 };