@nivaro/react 0.3.36 → 0.3.38

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

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