@goodie-forms/core 1.0.0-alpha → 1.1.1-alpha

package/dist/index.js

@@ -1,92 +1,137 @@
-var S;
+var m;
 ((t) => {
-  function e(u, a) {
-    if (u == null) return;
-    const r = a.split(".");
-    let s = u;
-    for (const f of r) {
-      if (s == null) return;
-      s = s[f];
-    }
-    return s;
-  }
-  t.getValue = e;
-  function i(u, a, r) {
-    if (u === a) return !0;
-    if (u === null || a === null || typeof u != "object" || typeof a != "object") return !1;
-    if (Array.isArray(u)) {
-      if (!Array.isArray(a) || u.length !== a.length) return !1;
-      for (let h = 0; h < u.length; h++)
-        if (!i(u[h], a[h])) return !1;
+  function e(r, c, l) {
+    if (r === c) return !0;
+    if (r === null || c === null || typeof r != "object" || typeof c != "object") return !1;
+    if (Array.isArray(r)) {
+      if (!Array.isArray(c) || r.length !== c.length) return !1;
+      for (let y = 0; y < r.length; y++)
+        if (!e(r[y], c[y])) return !1;
       return !0;
     }
-    if (r != null) {
-      const h = r(u, a);
-      if (h !== void 0) return h;
+    if (l != null) {
+      const y = l(r, c);
+      if (y !== void 0) return y;
     }
-    if (u instanceof Date && a instanceof Date)
-      return u.getTime() === a.getTime();
-    if (u instanceof RegExp && a instanceof RegExp)
-      return u.source === a.source && u.flags === a.flags;
-    if (u instanceof Map && a instanceof Map) {
-      if (u.size !== a.size) return !1;
-      for (const [h, v] of u)
-        if (!a.has(h) || !i(v, a.get(h))) return !1;
+    if (r instanceof Date && c instanceof Date)
+      return r.getTime() === c.getTime();
+    if (r instanceof RegExp && c instanceof RegExp)
+      return r.source === c.source && r.flags === c.flags;
+    if (r instanceof Map && c instanceof Map) {
+      if (r.size !== c.size) return !1;
+      for (const [y, V] of r)
+        if (!c.has(y) || !e(V, c.get(y))) return !1;
       return !0;
     }
-    if (u instanceof Set && a instanceof Set) {
-      if (u.size !== a.size) return !1;
-      for (const h of u)
-        if (!a.has(h)) return !1;
+    if (r instanceof Set && c instanceof Set) {
+      if (r.size !== c.size) return !1;
+      for (const y of r)
+        if (!c.has(y)) return !1;
       return !0;
     }
-    if (Object.getPrototypeOf(u) !== Object.getPrototypeOf(a))
+    if (Object.getPrototypeOf(r) !== Object.getPrototypeOf(c))
       return !1;
-    const s = Object.keys(u), f = Object.keys(a);
-    if (s.length !== f.length) return !1;
-    for (const h of s)
-      if (!Object.prototype.hasOwnProperty.call(a, h) || !i(u[h], a[h])) return !1;
+    const _ = Object.keys(r), g = Object.keys(c);
+    if (_.length !== g.length) return !1;
+    for (const y of _)
+      if (!Object.prototype.hasOwnProperty.call(c, y) || !e(r[y], c[y])) return !1;
     return !0;
   }
-  t.deepEqual = i;
-  function n(u, a, r, s) {
-    const f = [], h = [], v = [];
-    for (const g of a)
-      u.some((I) => r(I, g)) ? (s?.(g) ?? !0) && v.push(g) : (s?.(g) ?? !0) && f.push(g);
-    for (const g of u)
-      a.some((I) => r(g, I)) || (s?.(g) ?? !0) && h.push(g);
-    return { added: f, removed: h, unchanged: v };
+  t.deepEqual = e;
+  function n(r, c, l, _) {
+    const g = [], y = [], V = [];
+    for (const D of c)
+      r.some((O) => l(O, D)) ? (_?.(D) ?? !0) && V.push(D) : (_?.(D) ?? !0) && g.push(D);
+    for (const D of r)
+      c.some((O) => l(D, O)) || (_?.(D) ?? !0) && y.push(D);
+    return { added: g, removed: y, unchanged: V };
   }
   t.diff = n;
-  function o(u, a, r) {
-    return c(u, a, () => r);
-  }
-  t.setValue = o;
-  function c(u, a, r) {
-    const s = a.split(".");
-    let f = u;
-    for (let g = 0; g < s.length - 1; g++) {
-      const I = s[g];
-      f[I] == null && (f[I] = {}), f = f[I];
+  function i(r) {
+    const c = [];
+    let l = 0;
+    for (; l < r.length; ) {
+      const _ = r[l];
+      if (_ === ".") {
+        l++;
+        continue;
+      }
+      if (_ === "[") {
+        l++;
+        let y = "";
+        for (; l < r.length && r[l] !== "]"; )
+          y += r[l], l++;
+        if (l++, !y || !/^\d+$/.test(y))
+          throw new Error(`Invalid array index in path: ${r}`);
+        c.push(Number(y));
+        continue;
+      }
+      let g = "";
+      for (; l < r.length && /[^\.\[]/.test(r[l]); )
+        g += r[l], l++;
+      g && c.push(g);
     }
-    const h = f[s[s.length - 1]], v = r(h);
-    v !== void 0 && (f[s[s.length - 1]] = v);
-  }
-  t.modifyValue = c;
-  function l(u, a) {
-    const r = a.split(".");
-    let s = u;
-    for (let f = 0; f < r.length - 1; f++) {
-      const h = r[f];
-      if (s[h] == null)
-        return;
-      s = s[h];
+    return c;
+  }
+  t.parsePathFragments = i;
+  function o(r) {
+    let c = "";
+    for (const l of r) {
+      const _ = typeof l == "object" && "key" in l ? l.key : l;
+      typeof _ == "number" ? c += `[${_}]` : (c.length > 0 && (c += "."), c += _.toString());
+    }
+    return c;
+  }
+  t.parsePath = o;
+  function a(r, c) {
+    const l = i(r), _ = i(c);
+    if (l.length >= _.length) return !1;
+    for (let g = 0; g < l.length; g++)
+      if (l[g] !== _[g])
+        return !1;
+    return !0;
+  }
+  t.isDescendant = a;
+  function u(r, c) {
+    if (r == null) return;
+    const l = i(c);
+    let _ = r;
+    for (const g of l) {
+      if (_ == null) return;
+      _ = _[g];
+    }
+    return _;
+  }
+  t.getValue = u;
+  function h(r, c, l) {
+    return d(r, c, () => l);
+  }
+  t.setValue = h;
+  function d(r, c, l) {
+    const _ = i(c);
+    let g = r;
+    for (let O = 0; O < _.length - 1; O++) {
+      const f = _[O], S = _[O + 1];
+      g[f] == null && (g[f] = typeof S == "number" ? [] : {}), g = g[f];
+    }
+    const y = _[_.length - 1], V = g[y], D = l(V);
+    D !== void 0 && (g[y] = D);
+  }
+  t.modifyValue = d;
+  function s(r, c) {
+    const l = i(c);
+    let _ = r;
+    for (let y = 0; y < l.length - 1; y++) {
+      const V = l[y];
+      if (_[V] == null) return;
+      _ = _[V];
     }
-    delete s[r[r.length - 1]];
+    const g = l[l.length - 1];
+    delete _[g];
   }
-  t.deleteValue = l;
-})(S || (S = {}));
-var zt = /* @__PURE__ */ Symbol.for("immer-nothing"), $ = /* @__PURE__ */ Symbol.for("immer-draftable"), _ = /* @__PURE__ */ Symbol.for("immer-state"), jt = process.env.NODE_ENV !== "production" ? [
+  t.deleteValue = s;
+})(m || (m = {}));
+var zt = /* @__PURE__ */ Symbol.for("immer-nothing"), J = /* @__PURE__ */ Symbol.for("immer-draftable"), p = /* @__PURE__ */ Symbol.for("immer-state"), jt = process.env.NODE_ENV !== "production" ? [
   // All error codes, starting by 0:
   function(t) {
     return `The plugin for '${t}' has not been loaded into Immer. To enable the plugin, import and call \`enable${t}()\` when initializing your application.`;
@@ -117,125 +162,125 @@ var zt = /* @__PURE__ */ Symbol.for("immer-nothing"), $ = /* @__PURE__ */ Symbol
   // Note: if more errors are added, the errorOffset in Patches.ts should be increased
   // See Patches.ts for additional errors
 ] : [];
-function M(t, ...e) {
+function E(t, ...e) {
   if (process.env.NODE_ENV !== "production") {
-    const i = jt[t], n = C(i) ? i.apply(null, e) : i;
-    throw new Error(`[Immer] ${n}`);
+    const n = jt[t], i = k(n) ? n.apply(null, e) : n;
+    throw new Error(`[Immer] ${i}`);
   }
   throw new Error(
     `[Immer] minified error nr: ${t}. Full error at: https://bit.ly/3cXEKWf`
   );
 }
-var D = Object, k = D.getPrototypeOf, K = "constructor", et = "prototype", dt = "configurable", Y = "enumerable", W = "writable", R = "value", V = (t) => !!t && !!t[_];
-function E(t) {
-  return t ? Tt(t) || it(t) || !!t[$] || !!t[K]?.[$] || nt(t) || rt(t) : !1;
+var F = Object, x = F.getPrototypeOf, Q = "constructor", rt = "prototype", pt = "configurable", X = "enumerable", K = "writable", j = "value", C = (t) => !!t && !!t[p];
+function b(t) {
+  return t ? At(t) || st(t) || !!t[J] || !!t[Q]?.[J] || ot(t) || at(t) : !1;
 }
-var Lt = D[et][K].toString(), Mt = /* @__PURE__ */ new WeakMap();
-function Tt(t) {
-  if (!t || !st(t))
+var Lt = F[rt][Q].toString(), Ft = /* @__PURE__ */ new WeakMap();
+function At(t) {
+  if (!t || !ct(t))
     return !1;
-  const e = k(t);
-  if (e === null || e === D[et])
+  const e = x(t);
+  if (e === null || e === F[rt])
     return !0;
-  const i = D.hasOwnProperty.call(e, K) && e[K];
-  if (i === Object)
+  const n = F.hasOwnProperty.call(e, Q) && e[Q];
+  if (n === Object)
     return !0;
-  if (!C(i))
+  if (!k(n))
     return !1;
-  let n = Mt.get(i);
-  return n === void 0 && (n = Function.toString.call(i), Mt.set(i, n)), n === Lt;
+  let i = Ft.get(n);
+  return i === void 0 && (i = Function.toString.call(n), Ft.set(n, i)), i === Lt;
 }
-function H(t, e, i = !0) {
-  q(t) === 0 ? (i ? Reflect.ownKeys(t) : D.keys(t)).forEach((o) => {
+function q(t, e, n = !0) {
+  G(t) === 0 ? (n ? Reflect.ownKeys(t) : F.keys(t)).forEach((o) => {
     e(o, t[o], t);
-  }) : t.forEach((n, o) => e(o, n, t));
+  }) : t.forEach((i, o) => e(o, i, t));
 }
-function q(t) {
-  const e = t[_];
-  return e ? e.type_ : it(t) ? 1 : nt(t) ? 2 : rt(t) ? 3 : 0;
+function G(t) {
+  const e = t[p];
+  return e ? e.type_ : st(t) ? 1 : ot(t) ? 2 : at(t) ? 3 : 0;
 }
-var Dt = (t, e, i = q(t)) => i === 2 ? t.has(e) : D[et].hasOwnProperty.call(t, e), ht = (t, e, i = q(t)) => (
+var Mt = (t, e, n = G(t)) => n === 2 ? t.has(e) : F[rt].hasOwnProperty.call(t, e), yt = (t, e, n = G(t)) => (
   // @ts-ignore
-  i === 2 ? t.get(e) : t[e]
-), J = (t, e, i, n = q(t)) => {
-  n === 2 ? t.set(e, i) : n === 3 ? t.add(i) : t[e] = i;
+  n === 2 ? t.get(e) : t[e]
+), Z = (t, e, n, i = G(t)) => {
+  i === 2 ? t.set(e, n) : i === 3 ? t.add(n) : t[e] = n;
 };
 function Bt(t, e) {
   return t === e ? t !== 0 || 1 / t === 1 / e : t !== t && e !== e;
 }
-var it = Array.isArray, nt = (t) => t instanceof Map, rt = (t) => t instanceof Set, st = (t) => typeof t == "object", C = (t) => typeof t == "function", lt = (t) => typeof t == "boolean";
+var st = Array.isArray, ot = (t) => t instanceof Map, at = (t) => t instanceof Set, ct = (t) => typeof t == "object", k = (t) => typeof t == "function", ht = (t) => typeof t == "boolean";
 function Ht(t) {
   const e = +t;
   return Number.isInteger(e) && String(e) === t;
 }
-var qt = (t) => st(t) ? t?.[_] : null, p = (t) => t.copy_ || t.base_, Gt = (t) => {
-  const e = qt(t);
+var $t = (t) => ct(t) ? t?.[p] : null, v = (t) => t.copy_ || t.base_, qt = (t) => {
+  const e = $t(t);
   return e ? e.copy_ ?? e.base_ : t;
-}, vt = (t) => t.modified_ ? t.copy_ : t.base_;
-function _t(t, e) {
-  if (nt(t))
+}, wt = (t) => t.modified_ ? t.copy_ : t.base_;
+function gt(t, e) {
+  if (ot(t))
     return new Map(t);
-  if (rt(t))
+  if (at(t))
     return new Set(t);
-  if (it(t))
-    return Array[et].slice.call(t);
-  const i = Tt(t);
-  if (e === !0 || e === "class_only" && !i) {
-    const n = D.getOwnPropertyDescriptors(t);
-    delete n[_];
-    let o = Reflect.ownKeys(n);
-    for (let c = 0; c < o.length; c++) {
-      const l = o[c], u = n[l];
-      u[W] === !1 && (u[W] = !0, u[dt] = !0), (u.get || u.set) && (n[l] = {
-        [dt]: !0,
-        [W]: !0,
+  if (st(t))
+    return Array[rt].slice.call(t);
+  const n = At(t);
+  if (e === !0 || e === "class_only" && !n) {
+    const i = F.getOwnPropertyDescriptors(t);
+    delete i[p];
+    let o = Reflect.ownKeys(i);
+    for (let a = 0; a < o.length; a++) {
+      const u = o[a], h = i[u];
+      h[K] === !1 && (h[K] = !0, h[pt] = !0), (h.get || h.set) && (i[u] = {
+        [pt]: !0,
+        [K]: !0,
         // could live with !!desc.set as well here...
-        [Y]: u[Y],
-        [R]: t[l]
+        [X]: h[X],
+        [j]: t[u]
       });
     }
-    return D.create(k(t), n);
+    return F.create(x(t), i);
   } else {
-    const n = k(t);
-    if (n !== null && i)
+    const i = x(t);
+    if (i !== null && n)
       return { ...t };
-    const o = D.create(n);
-    return D.assign(o, t);
+    const o = F.create(i);
+    return F.assign(o, t);
   }
 }
-function Pt(t, e = !1) {
-  return ot(t) || V(t) || !E(t) || (q(t) > 1 && D.defineProperties(t, {
-    set: G,
-    add: G,
-    clear: G,
-    delete: G
-  }), D.freeze(t), e && H(
+function Et(t, e = !1) {
+  return lt(t) || C(t) || !b(t) || (G(t) > 1 && F.defineProperties(t, {
+    set: W,
+    add: W,
+    clear: W,
+    delete: W
+  }), F.freeze(t), e && q(
     t,
-    (i, n) => {
-      Pt(n, !0);
+    (n, i) => {
+      Et(i, !0);
     },
     !1
   )), t;
 }
-function Wt() {
-  M(2);
+function Gt() {
+  E(2);
 }
-var G = {
-  [R]: Wt
+var W = {
+  [j]: Gt
 };
-function ot(t) {
-  return t === null || !st(t) ? !0 : D.isFrozen(t);
+function lt(t) {
+  return t === null || !ct(t) ? !0 : F.isFrozen(t);
 }
-var U = "MapSet", pt = "Patches", yt = "ArrayMethods", Q = {};
-function A(t) {
-  const e = Q[t];
-  return e || M(0, t), e;
+var L = "MapSet", mt = "Patches", St = "ArrayMethods", tt = {};
+function N(t) {
+  const e = tt[t];
+  return e || E(0, t), e;
 }
-var wt = (t) => !!Q[t];
-function Vt(t, e) {
-  Q[t] || (Q[t] = e);
+var Vt = (t) => !!tt[t];
+function Ct(t, e) {
+  tt[t] || (tt[t] = e);
 }
-var j, X = () => j, $t = (t, e) => ({
+var B, et = () => B, Wt = (t, e) => ({
   drafts_: [],
   parent_: t,
   immer_: e,
@@ -245,137 +290,137 @@ var j, X = () => j, $t = (t, e) => ({
   unfinalizedDrafts_: 0,
   handledSet_: /* @__PURE__ */ new Set(),
   processedForPatches_: /* @__PURE__ */ new Set(),
-  mapSetPlugin_: wt(U) ? A(U) : void 0,
-  arrayMethodsPlugin_: wt(yt) ? A(yt) : void 0
+  mapSetPlugin_: Vt(L) ? N(L) : void 0,
+  arrayMethodsPlugin_: Vt(St) ? N(St) : void 0
 });
-function Et(t, e) {
-  e && (t.patchPlugin_ = A(pt), t.patches_ = [], t.inversePatches_ = [], t.patchListener_ = e);
+function bt(t, e) {
+  e && (t.patchPlugin_ = N(mt), t.patches_ = [], t.inversePatches_ = [], t.patchListener_ = e);
 }
-function mt(t) {
-  gt(t), t.drafts_.forEach(Kt), t.drafts_ = null;
+function vt(t) {
+  Pt(t), t.drafts_.forEach(Kt), t.drafts_ = null;
 }
-function gt(t) {
-  t === j && (j = t.parent_);
+function Pt(t) {
+  t === B && (B = t.parent_);
 }
-var Ot = (t) => j = $t(j, t);
+var Ot = (t) => B = Wt(B, t);
 function Kt(t) {
-  const e = t[_];
+  const e = t[p];
   e.type_ === 0 || e.type_ === 1 ? e.revoke_() : e.revoked_ = !0;
 }
 function It(t, e) {
   e.unfinalizedDrafts_ = e.drafts_.length;
-  const i = e.drafts_[0];
-  if (t !== void 0 && t !== i) {
-    i[_].modified_ && (mt(e), M(4)), E(t) && (t = bt(e, t));
+  const n = e.drafts_[0];
+  if (t !== void 0 && t !== n) {
+    n[p].modified_ && (vt(e), E(4)), b(t) && (t = Tt(e, t));
     const { patchPlugin_: o } = e;
     o && o.generateReplacementPatches_(
-      i[_].base_,
+      n[p].base_,
       t,
       e
     );
   } else
-    t = bt(e, i);
-  return Yt(e, t, !0), mt(e), e.patches_ && e.patchListener_(e.patches_, e.inversePatches_), t !== zt ? t : void 0;
+    t = Tt(e, n);
+  return Yt(e, t, !0), vt(e), e.patches_ && e.patchListener_(e.patches_, e.inversePatches_), t !== zt ? t : void 0;
 }
-function bt(t, e) {
-  if (ot(e))
+function Tt(t, e) {
+  if (lt(e))
     return e;
-  const i = e[_];
-  if (!i)
-    return Z(e, t.handledSet_, t);
-  if (!at(i, t))
+  const n = e[p];
+  if (!n)
+    return nt(e, t.handledSet_, t);
+  if (!ut(n, t))
     return e;
-  if (!i.modified_)
-    return i.base_;
-  if (!i.finalized_) {
-    const { callbacks_: n } = i;
-    if (n)
-      for (; n.length > 0; )
-        n.pop()(t);
-    kt(i, t);
-  }
-  return i.copy_;
+  if (!n.modified_)
+    return n.base_;
+  if (!n.finalized_) {
+    const { callbacks_: i } = n;
+    if (i)
+      for (; i.length > 0; )
+        i.pop()(t);
+    xt(n, t);
+  }
+  return n.copy_;
 }
-function Yt(t, e, i = !1) {
-  !t.parent_ && t.immer_.autoFreeze_ && t.canAutoFreeze_ && Pt(e, i);
+function Yt(t, e, n = !1) {
+  !t.parent_ && t.immer_.autoFreeze_ && t.canAutoFreeze_ && Et(e, n);
 }
-function Ct(t) {
+function kt(t) {
   t.finalized_ = !0, t.scope_.unfinalizedDrafts_--;
 }
-var at = (t, e) => t.scope_ === e, Jt = [];
-function At(t, e, i, n) {
-  const o = p(t), c = t.type_;
-  if (n !== void 0 && ht(o, n, c) === e) {
-    J(o, n, i, c);
+var ut = (t, e) => t.scope_ === e, Jt = [];
+function Nt(t, e, n, i) {
+  const o = v(t), a = t.type_;
+  if (i !== void 0 && yt(o, i, a) === e) {
+    Z(o, i, n, a);
     return;
   }
   if (!t.draftLocations_) {
-    const u = t.draftLocations_ = /* @__PURE__ */ new Map();
-    H(o, (a, r) => {
-      if (V(r)) {
-        const s = u.get(r) || [];
-        s.push(a), u.set(r, s);
+    const h = t.draftLocations_ = /* @__PURE__ */ new Map();
+    q(o, (d, s) => {
+      if (C(s)) {
+        const r = h.get(s) || [];
+        r.push(d), h.set(s, r);
       }
     });
   }
-  const l = t.draftLocations_.get(e) ?? Jt;
-  for (const u of l)
-    J(o, u, i, c);
+  const u = t.draftLocations_.get(e) ?? Jt;
+  for (const h of u)
+    Z(o, h, n, a);
 }
-function Qt(t, e, i) {
+function Qt(t, e, n) {
   t.callbacks_.push(function(o) {
-    const c = e;
-    if (!c || !at(c, o))
+    const a = e;
+    if (!a || !ut(a, o))
       return;
-    o.mapSetPlugin_?.fixSetContents(c);
-    const l = vt(c);
-    At(t, c.draft_ ?? c, l, i), kt(c, o);
+    o.mapSetPlugin_?.fixSetContents(a);
+    const u = wt(a);
+    Nt(t, a.draft_ ?? a, u, n), xt(a, o);
   });
 }
-function kt(t, e) {
+function xt(t, e) {
   if (t.modified_ && !t.finalized_ && (t.type_ === 3 || t.type_ === 1 && t.allIndicesReassigned_ || (t.assigned_?.size ?? 0) > 0)) {
-    const { patchPlugin_: n } = e;
-    if (n) {
-      const o = n.getPath(t);
-      o && n.generatePatches_(t, o, e);
+    const { patchPlugin_: i } = e;
+    if (i) {
+      const o = i.getPath(t);
+      o && i.generatePatches_(t, o, e);
     }
-    Ct(t);
+    kt(t);
   }
 }
-function St(t, e, i) {
-  const { scope_: n } = t;
-  if (V(i)) {
-    const o = i[_];
-    at(o, n) && o.callbacks_.push(function() {
-      N(t);
-      const l = vt(o);
-      At(t, i, l, e);
+function Dt(t, e, n) {
+  const { scope_: i } = t;
+  if (C(n)) {
+    const o = n[p];
+    ut(o, i) && o.callbacks_.push(function() {
+      U(t);
+      const u = wt(o);
+      Nt(t, n, u, e);
     });
-  } else E(i) && t.callbacks_.push(function() {
-    const c = p(t);
-    t.type_ === 3 ? c.has(i) && Z(i, n.handledSet_, n) : ht(c, e, t.type_) === i && n.drafts_.length > 1 && (t.assigned_.get(e) ?? !1) === !0 && t.copy_ && Z(
-      ht(t.copy_, e, t.type_),
-      n.handledSet_,
-      n
+  } else b(n) && t.callbacks_.push(function() {
+    const a = v(t);
+    t.type_ === 3 ? a.has(n) && nt(n, i.handledSet_, i) : yt(a, e, t.type_) === n && i.drafts_.length > 1 && (t.assigned_.get(e) ?? !1) === !0 && t.copy_ && nt(
+      yt(t.copy_, e, t.type_),
+      i.handledSet_,
+      i
     );
   });
 }
-function Z(t, e, i) {
-  return !i.immer_.autoFreeze_ && i.unfinalizedDrafts_ < 1 || V(t) || e.has(t) || !E(t) || ot(t) || (e.add(t), H(t, (n, o) => {
-    if (V(o)) {
-      const c = o[_];
-      if (at(c, i)) {
-        const l = vt(c);
-        J(t, n, l, t.type_), Ct(c);
+function nt(t, e, n) {
+  return !n.immer_.autoFreeze_ && n.unfinalizedDrafts_ < 1 || C(t) || e.has(t) || !b(t) || lt(t) || (e.add(t), q(t, (i, o) => {
+    if (C(o)) {
+      const a = o[p];
+      if (ut(a, n)) {
+        const u = wt(a);
+        Z(t, i, u, t.type_), kt(a);
       }
-    } else E(o) && Z(o, e, i);
+    } else b(o) && nt(o, e, n);
   })), t;
 }
 function Xt(t, e) {
-  const i = it(t), n = {
-    type_: i ? 1 : 0,
+  const n = st(t), i = {
+    type_: n ? 1 : 0,
     // Track which produce call this is associated with.
-    scope_: e ? e.scope_ : X(),
+    scope_: e ? e.scope_ : et(),
     // True for both shallow and deep changes.
     modified_: !1,
     // Used during finalization.
@@ -398,177 +443,177 @@ function Xt(t, e) {
     // `callbacks` actually gets assigned in `createProxy`
     callbacks_: void 0
   };
-  let o = n, c = tt;
-  i && (o = [n], c = L);
-  const { revoke: l, proxy: u } = Proxy.revocable(o, c);
-  return n.draft_ = u, n.revoke_ = l, [u, n];
+  let o = i, a = it;
+  n && (o = [i], a = H);
+  const { revoke: u, proxy: h } = Proxy.revocable(o, a);
+  return i.draft_ = h, i.revoke_ = u, [h, i];
 }
-var tt = {
+var it = {
   get(t, e) {
-    if (e === _)
+    if (e === p)
       return t;
-    let i = t.scope_.arrayMethodsPlugin_;
-    const n = t.type_ === 1 && typeof e == "string";
-    if (n && i?.isArrayOperationMethod(e))
-      return i.createMethodInterceptor(t, e);
-    const o = p(t);
-    if (!Dt(o, e, t.type_))
+    let n = t.scope_.arrayMethodsPlugin_;
+    const i = t.type_ === 1 && typeof e == "string";
+    if (i && n?.isArrayOperationMethod(e))
+      return n.createMethodInterceptor(t, e);
+    const o = v(t);
+    if (!Mt(o, e, t.type_))
       return Zt(t, o, e);
-    const c = o[e];
-    if (t.finalized_ || !E(c) || n && t.operationMethod && i?.isMutatingArrayMethod(
+    const a = o[e];
+    if (t.finalized_ || !b(a) || i && t.operationMethod && n?.isMutatingArrayMethod(
       t.operationMethod
     ) && Ht(e))
-      return c;
-    if (c === ft(t.base_, e)) {
-      N(t);
-      const l = t.type_ === 1 ? +e : e, u = B(t.scope_, c, t, l);
-      return t.copy_[l] = u;
+      return a;
+    if (a === _t(t.base_, e)) {
+      U(t);
+      const u = t.type_ === 1 ? +e : e, h = $(t.scope_, a, t, u);
+      return t.copy_[u] = h;
     }
-    return c;
+    return a;
   },
   has(t, e) {
-    return e in p(t);
+    return e in v(t);
   },
   ownKeys(t) {
-    return Reflect.ownKeys(p(t));
+    return Reflect.ownKeys(v(t));
   },
-  set(t, e, i) {
-    const n = Ft(p(t), e);
-    if (n?.set)
-      return n.set.call(t.draft_, i), !0;
+  set(t, e, n) {
+    const i = Rt(v(t), e);
+    if (i?.set)
+      return i.set.call(t.draft_, n), !0;
     if (!t.modified_) {
-      const o = ft(p(t), e), c = o?.[_];
-      if (c && c.base_ === i)
-        return t.copy_[e] = i, t.assigned_.set(e, !1), !0;
-      if (Bt(i, o) && (i !== void 0 || Dt(t.base_, e, t.type_)))
+      const o = _t(v(t), e), a = o?.[p];
+      if (a && a.base_ === n)
+        return t.copy_[e] = n, t.assigned_.set(e, !1), !0;
+      if (Bt(n, o) && (n !== void 0 || Mt(t.base_, e, t.type_)))
         return !0;
-      N(t), O(t);
+      U(t), I(t);
     }
-    return t.copy_[e] === i && // special case: handle new props with value 'undefined'
-    (i !== void 0 || e in t.copy_) || // special case: NaN
-    Number.isNaN(i) && Number.isNaN(t.copy_[e]) || (t.copy_[e] = i, t.assigned_.set(e, !0), St(t, e, i)), !0;
+    return t.copy_[e] === n && // special case: handle new props with value 'undefined'
+    (n !== void 0 || e in t.copy_) || // special case: NaN
+    Number.isNaN(n) && Number.isNaN(t.copy_[e]) || (t.copy_[e] = n, t.assigned_.set(e, !0), Dt(t, e, n)), !0;
   },
   deleteProperty(t, e) {
-    return N(t), ft(t.base_, e) !== void 0 || e in t.base_ ? (t.assigned_.set(e, !1), O(t)) : t.assigned_.delete(e), t.copy_ && delete t.copy_[e], !0;
+    return U(t), _t(t.base_, e) !== void 0 || e in t.base_ ? (t.assigned_.set(e, !1), I(t)) : t.assigned_.delete(e), t.copy_ && delete t.copy_[e], !0;
   },
   // Note: We never coerce `desc.value` into an Immer draft, because we can't make
   // the same guarantee in ES5 mode.
   getOwnPropertyDescriptor(t, e) {
-    const i = p(t), n = Reflect.getOwnPropertyDescriptor(i, e);
-    return n && {
-      [W]: !0,
-      [dt]: t.type_ !== 1 || e !== "length",
-      [Y]: n[Y],
-      [R]: i[e]
+    const n = v(t), i = Reflect.getOwnPropertyDescriptor(n, e);
+    return i && {
+      [K]: !0,
+      [pt]: t.type_ !== 1 || e !== "length",
+      [X]: i[X],
+      [j]: n[e]
     };
   },
   defineProperty() {
-    M(11);
+    E(11);
   },
   getPrototypeOf(t) {
-    return k(t.base_);
+    return x(t.base_);
   },
   setPrototypeOf() {
-    M(12);
-  }
-}, L = {};
-for (let t in tt) {
-  let e = tt[t];
-  L[t] = function() {
-    const i = arguments;
-    return i[0] = i[0][0], e.apply(this, i);
+    E(12);
+  }
+}, H = {};
+for (let t in it) {
+  let e = it[t];
+  H[t] = function() {
+    const n = arguments;
+    return n[0] = n[0][0], e.apply(this, n);
   };
 }
-L.deleteProperty = function(t, e) {
-  return process.env.NODE_ENV !== "production" && isNaN(parseInt(e)) && M(13), L.set.call(this, t, e, void 0);
+H.deleteProperty = function(t, e) {
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(e)) && E(13), H.set.call(this, t, e, void 0);
 };
-L.set = function(t, e, i) {
-  return process.env.NODE_ENV !== "production" && e !== "length" && isNaN(parseInt(e)) && M(14), tt.set.call(this, t[0], e, i, t[0]);
+H.set = function(t, e, n) {
+  return process.env.NODE_ENV !== "production" && e !== "length" && isNaN(parseInt(e)) && E(14), it.set.call(this, t[0], e, n, t[0]);
 };
-function ft(t, e) {
-  const i = t[_];
-  return (i ? p(i) : t)[e];
+function _t(t, e) {
+  const n = t[p];
+  return (n ? v(n) : t)[e];
 }
-function Zt(t, e, i) {
-  const n = Ft(e, i);
-  return n ? R in n ? n[R] : (
+function Zt(t, e, n) {
+  const i = Rt(e, n);
+  return i ? j in i ? i[j] : (
     // This is a very special case, if the prop is a getter defined by the
     // prototype, we should invoke it with the draft as context!
-    n.get?.call(t.draft_)
+    i.get?.call(t.draft_)
   ) : void 0;
 }
-function Ft(t, e) {
+function Rt(t, e) {
   if (!(e in t))
     return;
-  let i = k(t);
-  for (; i; ) {
-    const n = Object.getOwnPropertyDescriptor(i, e);
-    if (n)
-      return n;
-    i = k(i);
+  let n = x(t);
+  for (; n; ) {
+    const i = Object.getOwnPropertyDescriptor(n, e);
+    if (i)
+      return i;
+    n = x(n);
   }
 }
-function O(t) {
-  t.modified_ || (t.modified_ = !0, t.parent_ && O(t.parent_));
+function I(t) {
+  t.modified_ || (t.modified_ = !0, t.parent_ && I(t.parent_));
 }
-function N(t) {
-  t.copy_ || (t.assigned_ = /* @__PURE__ */ new Map(), t.copy_ = _t(
+function U(t) {
+  t.copy_ || (t.assigned_ = /* @__PURE__ */ new Map(), t.copy_ = gt(
     t.base_,
     t.scope_.immer_.useStrictShallowCopy_
   ));
 }
 var te = class {
   constructor(t) {
-    this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !1, this.produce = (e, i, n) => {
-      if (C(e) && !C(i)) {
-        const c = i;
-        i = e;
-        const l = this;
-        return function(a = c, ...r) {
-          return l.produce(a, (s) => i.call(this, s, ...r));
+    this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !1, this.produce = (e, n, i) => {
+      if (k(e) && !k(n)) {
+        const a = n;
+        n = e;
+        const u = this;
+        return function(d = a, ...s) {
+          return u.produce(d, (r) => n.call(this, r, ...s));
         };
       }
-      C(i) || M(6), n !== void 0 && !C(n) && M(7);
+      k(n) || E(6), i !== void 0 && !k(i) && E(7);
       let o;
-      if (E(e)) {
-        const c = Ot(this), l = B(c, e, void 0);
-        let u = !0;
+      if (b(e)) {
+        const a = Ot(this), u = $(a, e, void 0);
+        let h = !0;
         try {
-          o = i(l), u = !1;
+          o = n(u), h = !1;
         } finally {
-          u ? mt(c) : gt(c);
+          h ? vt(a) : Pt(a);
         }
-        return Et(c, n), It(o, c);
-      } else if (!e || !st(e)) {
-        if (o = i(e), o === void 0 && (o = e), o === zt && (o = void 0), this.autoFreeze_ && Pt(o, !0), n) {
-          const c = [], l = [];
-          A(pt).generateReplacementPatches_(e, o, {
-            patches_: c,
-            inversePatches_: l
-          }), n(c, l);
+        return bt(a, i), It(o, a);
+      } else if (!e || !ct(e)) {
+        if (o = n(e), o === void 0 && (o = e), o === zt && (o = void 0), this.autoFreeze_ && Et(o, !0), i) {
+          const a = [], u = [];
+          N(mt).generateReplacementPatches_(e, o, {
+            patches_: a,
+            inversePatches_: u
+          }), i(a, u);
         }
         return o;
       } else
-        M(1, e);
-    }, this.produceWithPatches = (e, i) => {
-      if (C(e))
-        return (l, ...u) => this.produceWithPatches(l, (a) => e(a, ...u));
-      let n, o;
-      return [this.produce(e, i, (l, u) => {
-        n = l, o = u;
-      }), n, o];
-    }, lt(t?.autoFreeze) && this.setAutoFreeze(t.autoFreeze), lt(t?.useStrictShallowCopy) && this.setUseStrictShallowCopy(t.useStrictShallowCopy), lt(t?.useStrictIteration) && this.setUseStrictIteration(t.useStrictIteration);
+        E(1, e);
+    }, this.produceWithPatches = (e, n) => {
+      if (k(e))
+        return (u, ...h) => this.produceWithPatches(u, (d) => e(d, ...h));
+      let i, o;
+      return [this.produce(e, n, (u, h) => {
+        i = u, o = h;
+      }), i, o];
+    }, ht(t?.autoFreeze) && this.setAutoFreeze(t.autoFreeze), ht(t?.useStrictShallowCopy) && this.setUseStrictShallowCopy(t.useStrictShallowCopy), ht(t?.useStrictIteration) && this.setUseStrictIteration(t.useStrictIteration);
   }
   createDraft(t) {
-    E(t) || M(8), V(t) && (t = ee(t));
-    const e = Ot(this), i = B(e, t, void 0);
-    return i[_].isManual_ = !0, gt(e), i;
+    b(t) || E(8), C(t) && (t = ee(t));
+    const e = Ot(this), n = $(e, t, void 0);
+    return n[p].isManual_ = !0, Pt(e), n;
   }
   finishDraft(t, e) {
-    const i = t && t[_];
-    (!i || !i.isManual_) && M(9);
-    const { scope_: n } = i;
-    return Et(n, e), It(void 0, n);
+    const n = t && t[p];
+    (!n || !n.isManual_) && E(9);
+    const { scope_: i } = n;
+    return bt(i, e), It(void 0, i);
   }
   /**
    * Pass true to automatically freeze all copies created by Immer.
@@ -599,64 +644,64 @@ var te = class {
     return this.useStrictIteration_;
   }
   applyPatches(t, e) {
-    let i;
-    for (i = e.length - 1; i >= 0; i--) {
-      const o = e[i];
+    let n;
+    for (n = e.length - 1; n >= 0; n--) {
+      const o = e[n];
       if (o.path.length === 0 && o.op === "replace") {
         t = o.value;
         break;
       }
     }
-    i > -1 && (e = e.slice(i + 1));
-    const n = A(pt).applyPatches_;
-    return V(t) ? n(t, e) : this.produce(
+    n > -1 && (e = e.slice(n + 1));
+    const i = N(mt).applyPatches_;
+    return C(t) ? i(t, e) : this.produce(
       t,
-      (o) => n(o, e)
+      (o) => i(o, e)
     );
   }
 };
-function B(t, e, i, n) {
-  const [o, c] = nt(e) ? A(U).proxyMap_(e, i) : rt(e) ? A(U).proxySet_(e, i) : Xt(e, i);
-  return (i?.scope_ ?? X()).drafts_.push(o), c.callbacks_ = i?.callbacks_ ?? [], c.key_ = n, i && n !== void 0 ? Qt(i, c, n) : c.callbacks_.push(function(a) {
-    a.mapSetPlugin_?.fixSetContents(c);
-    const { patchPlugin_: r } = a;
-    c.modified_ && r && r.generatePatches_(c, [], a);
+function $(t, e, n, i) {
+  const [o, a] = ot(e) ? N(L).proxyMap_(e, n) : at(e) ? N(L).proxySet_(e, n) : Xt(e, n);
+  return (n?.scope_ ?? et()).drafts_.push(o), a.callbacks_ = n?.callbacks_ ?? [], a.key_ = i, n && i !== void 0 ? Qt(n, a, i) : a.callbacks_.push(function(d) {
+    d.mapSetPlugin_?.fixSetContents(a);
+    const { patchPlugin_: s } = d;
+    a.modified_ && s && s.generatePatches_(a, [], d);
   }), o;
 }
 function ee(t) {
-  return V(t) || M(10, t), Nt(t);
+  return C(t) || E(10, t), Ut(t);
 }
-function Nt(t) {
-  if (!E(t) || ot(t))
+function Ut(t) {
+  if (!b(t) || lt(t))
     return t;
-  const e = t[_];
-  let i, n = !0;
+  const e = t[p];
+  let n, i = !0;
   if (e) {
     if (!e.modified_)
       return e.base_;
-    e.finalized_ = !0, i = _t(t, e.scope_.immer_.useStrictShallowCopy_), n = e.scope_.immer_.shouldUseStrictIteration();
+    e.finalized_ = !0, n = gt(t, e.scope_.immer_.useStrictShallowCopy_), i = e.scope_.immer_.shouldUseStrictIteration();
   } else
-    i = _t(t, !0);
-  return H(
-    i,
-    (o, c) => {
-      J(i, o, Nt(c));
+    n = gt(t, !0);
+  return q(
+    n,
+    (o, a) => {
+      Z(n, o, Ut(a));
     },
-    n
-  ), e && (e.finalized_ = !1), i;
+    i
+  ), e && (e.finalized_ = !1), n;
 }
-function ie() {
+function ne() {
   class t extends Map {
-    constructor(r, s) {
-      super(), this[_] = {
+    constructor(s, r) {
+      super(), this[p] = {
         type_: 2,
-        parent_: s,
-        scope_: s ? s.scope_ : X(),
+        parent_: r,
+        scope_: r ? r.scope_ : et(),
         modified_: !1,
         finalized_: !1,
         copy_: void 0,
         assigned_: void 0,
-        base_: r,
+        base_: s,
         draft_: this,
         isManual_: !1,
         revoked_: !1,
@@ -664,70 +709,70 @@ function ie() {
       };
     }
     get size() {
-      return p(this[_]).size;
+      return v(this[p]).size;
     }
-    has(r) {
-      return p(this[_]).has(r);
+    has(s) {
+      return v(this[p]).has(s);
     }
-    set(r, s) {
-      const f = this[_];
-      return l(f), (!p(f).has(r) || p(f).get(r) !== s) && (i(f), O(f), f.assigned_.set(r, !0), f.copy_.set(r, s), f.assigned_.set(r, !0), St(f, r, s)), this;
+    set(s, r) {
+      const c = this[p];
+      return u(c), (!v(c).has(s) || v(c).get(s) !== r) && (n(c), I(c), c.assigned_.set(s, !0), c.copy_.set(s, r), c.assigned_.set(s, !0), Dt(c, s, r)), this;
     }
-    delete(r) {
-      if (!this.has(r))
+    delete(s) {
+      if (!this.has(s))
         return !1;
-      const s = this[_];
-      return l(s), i(s), O(s), s.base_.has(r) ? s.assigned_.set(r, !1) : s.assigned_.delete(r), s.copy_.delete(r), !0;
+      const r = this[p];
+      return u(r), n(r), I(r), r.base_.has(s) ? r.assigned_.set(s, !1) : r.assigned_.delete(s), r.copy_.delete(s), !0;
     }
     clear() {
-      const r = this[_];
-      l(r), p(r).size && (i(r), O(r), r.assigned_ = /* @__PURE__ */ new Map(), H(r.base_, (s) => {
-        r.assigned_.set(s, !1);
-      }), r.copy_.clear());
+      const s = this[p];
+      u(s), v(s).size && (n(s), I(s), s.assigned_ = /* @__PURE__ */ new Map(), q(s.base_, (r) => {
+        s.assigned_.set(r, !1);
+      }), s.copy_.clear());
     }
-    forEach(r, s) {
-      const f = this[_];
-      p(f).forEach((h, v, g) => {
-        r.call(s, this.get(v), v, this);
+    forEach(s, r) {
+      const c = this[p];
+      v(c).forEach((l, _, g) => {
+        s.call(r, this.get(_), _, this);
       });
     }
-    get(r) {
-      const s = this[_];
-      l(s);
-      const f = p(s).get(r);
-      if (s.finalized_ || !E(f) || f !== s.base_.get(r))
-        return f;
-      const h = B(s.scope_, f, s, r);
-      return i(s), s.copy_.set(r, h), h;
+    get(s) {
+      const r = this[p];
+      u(r);
+      const c = v(r).get(s);
+      if (r.finalized_ || !b(c) || c !== r.base_.get(s))
+        return c;
+      const l = $(r.scope_, c, r, s);
+      return n(r), r.copy_.set(s, l), l;
     }
     keys() {
-      return p(this[_]).keys();
+      return v(this[p]).keys();
     }
     values() {
-      const r = this.keys();
+      const s = this.keys();
       return {
         [Symbol.iterator]: () => this.values(),
         next: () => {
-          const s = r.next();
-          return s.done ? s : {
+          const r = s.next();
+          return r.done ? r : {
             done: !1,
-            value: this.get(s.value)
+            value: this.get(r.value)
           };
         }
       };
     }
     entries() {
-      const r = this.keys();
+      const s = this.keys();
       return {
         [Symbol.iterator]: () => this.entries(),
         next: () => {
-          const s = r.next();
-          if (s.done)
-            return s;
-          const f = this.get(s.value);
+          const r = s.next();
+          if (r.done)
+            return r;
+          const c = this.get(r.value);
           return {
             done: !1,
-            value: [s.value, f]
+            value: [r.value, c]
           };
         }
       };
@@ -736,23 +781,23 @@ function ie() {
       return this.entries();
     }
   }
-  function e(a, r) {
-    const s = new t(a, r);
-    return [s, s[_]];
+  function e(d, s) {
+    const r = new t(d, s);
+    return [r, r[p]];
   }
-  function i(a) {
-    a.copy_ || (a.assigned_ = /* @__PURE__ */ new Map(), a.copy_ = new Map(a.base_));
+  function n(d) {
+    d.copy_ || (d.assigned_ = /* @__PURE__ */ new Map(), d.copy_ = new Map(d.base_));
   }
-  class n extends Set {
-    constructor(r, s) {
-      super(), this[_] = {
+  class i extends Set {
+    constructor(s, r) {
+      super(), this[p] = {
         type_: 3,
-        parent_: s,
-        scope_: s ? s.scope_ : X(),
+        parent_: r,
+        scope_: r ? r.scope_ : et(),
         modified_: !1,
         finalized_: !1,
         copy_: void 0,
-        base_: r,
+        base_: s,
         draft_: this,
         drafts_: /* @__PURE__ */ new Map(),
         revoked_: !1,
@@ -762,36 +807,36 @@ function ie() {
       };
     }
     get size() {
-      return p(this[_]).size;
+      return v(this[p]).size;
     }
-    has(r) {
-      const s = this[_];
-      return l(s), s.copy_ ? !!(s.copy_.has(r) || s.drafts_.has(r) && s.copy_.has(s.drafts_.get(r))) : s.base_.has(r);
+    has(s) {
+      const r = this[p];
+      return u(r), r.copy_ ? !!(r.copy_.has(s) || r.drafts_.has(s) && r.copy_.has(r.drafts_.get(s))) : r.base_.has(s);
     }
-    add(r) {
-      const s = this[_];
-      return l(s), this.has(r) || (c(s), O(s), s.copy_.add(r), St(s, r, r)), this;
+    add(s) {
+      const r = this[p];
+      return u(r), this.has(s) || (a(r), I(r), r.copy_.add(s), Dt(r, s, s)), this;
     }
-    delete(r) {
-      if (!this.has(r))
+    delete(s) {
+      if (!this.has(s))
         return !1;
-      const s = this[_];
-      return l(s), c(s), O(s), s.copy_.delete(r) || (s.drafts_.has(r) ? s.copy_.delete(s.drafts_.get(r)) : (
+      const r = this[p];
+      return u(r), a(r), I(r), r.copy_.delete(s) || (r.drafts_.has(s) ? r.copy_.delete(r.drafts_.get(s)) : (
         /* istanbul ignore next */
         !1
       ));
     }
     clear() {
-      const r = this[_];
-      l(r), p(r).size && (c(r), O(r), r.copy_.clear());
+      const s = this[p];
+      u(s), v(s).size && (a(s), I(s), s.copy_.clear());
     }
     values() {
-      const r = this[_];
-      return l(r), c(r), r.copy_.values();
+      const s = this[p];
+      return u(s), a(s), s.copy_.values();
     }
     entries() {
-      const r = this[_];
-      return l(r), c(r), r.copy_.entries();
+      const s = this[p];
+      return u(s), a(s), s.copy_.entries();
     }
     keys() {
       return this.values();
@@ -799,53 +844,53 @@ function ie() {
     [Symbol.iterator]() {
       return this.values();
     }
-    forEach(r, s) {
-      const f = this.values();
-      let h = f.next();
-      for (; !h.done; )
-        r.call(s, h.value, h.value, this), h = f.next();
+    forEach(s, r) {
+      const c = this.values();
+      let l = c.next();
+      for (; !l.done; )
+        s.call(r, l.value, l.value, this), l = c.next();
     }
   }
-  function o(a, r) {
-    const s = new n(a, r);
-    return [s, s[_]];
+  function o(d, s) {
+    const r = new i(d, s);
+    return [r, r[p]];
   }
-  function c(a) {
-    a.copy_ || (a.copy_ = /* @__PURE__ */ new Set(), a.base_.forEach((r) => {
-      if (E(r)) {
-        const s = B(a.scope_, r, a, r);
-        a.drafts_.set(r, s), a.copy_.add(s);
+  function a(d) {
+    d.copy_ || (d.copy_ = /* @__PURE__ */ new Set(), d.base_.forEach((s) => {
+      if (b(s)) {
+        const r = $(d.scope_, s, d, s);
+        d.drafts_.set(s, r), d.copy_.add(r);
       } else
-        a.copy_.add(r);
+        d.copy_.add(s);
     }));
   }
-  function l(a) {
-    a.revoked_ && M(3, JSON.stringify(p(a)));
+  function u(d) {
+    d.revoked_ && E(3, JSON.stringify(v(d)));
   }
-  function u(a) {
-    if (a.type_ === 3 && a.copy_) {
-      const r = new Set(a.copy_);
-      a.copy_.clear(), r.forEach((s) => {
-        a.copy_.add(Gt(s));
+  function h(d) {
+    if (d.type_ === 3 && d.copy_) {
+      const s = new Set(d.copy_);
+      d.copy_.clear(), s.forEach((r) => {
+        d.copy_.add(qt(r));
       });
     }
   }
-  Vt(U, { proxyMap_: e, proxySet_: o, fixSetContents: u });
+  Ct(L, { proxyMap_: e, proxySet_: o, fixSetContents: h });
 }
-function ne() {
-  const t = /* @__PURE__ */ new Set(["shift", "unshift"]), e = /* @__PURE__ */ new Set(["push", "pop"]), i = /* @__PURE__ */ new Set([
+function ie() {
+  const t = /* @__PURE__ */ new Set(["shift", "unshift"]), e = /* @__PURE__ */ new Set(["push", "pop"]), n = /* @__PURE__ */ new Set([
     ...e,
     ...t
-  ]), n = /* @__PURE__ */ new Set(["reverse", "sort"]), o = /* @__PURE__ */ new Set([
-    ...i,
+  ]), i = /* @__PURE__ */ new Set(["reverse", "sort"]), o = /* @__PURE__ */ new Set([
     ...n,
+    ...i,
     "splice"
-  ]), c = /* @__PURE__ */ new Set(["find", "findLast"]), l = /* @__PURE__ */ new Set([
+  ]), a = /* @__PURE__ */ new Set(["find", "findLast"]), u = /* @__PURE__ */ new Set([
     "filter",
     "slice",
     "concat",
     "flat",
-    ...c,
+    ...a,
     "findIndex",
     "findLastIndex",
     "some",
@@ -857,119 +902,132 @@ function ne() {
     "toString",
     "toLocaleString"
   ]);
-  function u(d) {
-    return o.has(d);
+  function h(f) {
+    return o.has(f);
   }
-  function a(d) {
-    return l.has(d);
+  function d(f) {
+    return u.has(f);
   }
-  function r(d) {
-    return u(d) || a(d);
+  function s(f) {
+    return h(f) || d(f);
   }
-  function s(d, y) {
-    d.operationMethod = y;
+  function r(f, S) {
+    f.operationMethod = S;
   }
-  function f(d) {
-    d.operationMethod = void 0;
+  function c(f) {
+    f.operationMethod = void 0;
   }
-  function h(d, y, w = !0) {
-    N(d);
-    const m = y();
-    return O(d), w && d.assigned_.set("length", !0), m;
+  function l(f, S, M = !0) {
+    U(f);
+    const P = S();
+    return I(f), M && f.assigned_.set("length", !0), P;
   }
-  function v(d) {
-    d.allIndicesReassigned_ = !0;
+  function _(f) {
+    f.allIndicesReassigned_ = !0;
   }
-  function g(d, y) {
-    return d < 0 ? Math.max(y + d, 0) : Math.min(d, y);
+  function g(f, S) {
+    return f < 0 ? Math.max(S + f, 0) : Math.min(f, S);
   }
-  function I(d, y, w) {
-    return h(d, () => {
-      const m = d.copy_[y](...w);
-      return t.has(y) && v(d), i.has(y) ? m : d.draft_;
+  function y(f, S, M) {
+    return l(f, () => {
+      const P = f.copy_[S](...M);
+      return t.has(S) && _(f), n.has(S) ? P : f.draft_;
     });
   }
-  function xt(d, y, w) {
-    return h(
-      d,
-      () => (d.copy_[y](...w), v(d), d.draft_),
+  function V(f, S, M) {
+    return l(
+      f,
+      () => (f.copy_[S](...M), _(f), f.draft_),
       !1
     );
   }
-  function Rt(d, y) {
-    return function(...m) {
-      const P = y;
-      s(d, P);
+  function D(f, S) {
+    return function(...P) {
+      const w = S;
+      r(f, w);
       try {
-        if (u(P)) {
-          if (i.has(P))
-            return I(d, P, m);
-          if (n.has(P))
-            return xt(d, P, m);
-          if (P === "splice") {
-            const b = h(
-              d,
-              () => d.copy_.splice(...m)
+        if (h(w)) {
+          if (n.has(w))
+            return y(f, w, P);
+          if (i.has(w))
+            return V(f, w, P);
+          if (w === "splice") {
+            const T = l(
+              f,
+              () => f.copy_.splice(...P)
             );
-            return v(d), b;
+            return _(f), T;
           }
         } else
-          return Ut(d, P, m);
+          return O(f, w, P);
       } finally {
-        f(d);
+        c(f);
       }
     };
   }
-  function Ut(d, y, w) {
-    const m = p(d);
-    if (y === "filter") {
-      const P = w[0], b = [];
-      for (let z = 0; z < m.length; z++)
-        P(m[z], z, m) && b.push(d.draft_[z]);
-      return b;
+  function O(f, S, M) {
+    const P = v(f);
+    if (S === "filter") {
+      const w = M[0], T = [];
+      for (let z = 0; z < P.length; z++)
+        w(P[z], z, P) && T.push(f.draft_[z]);
+      return T;
     }
-    if (c.has(y)) {
-      const P = w[0], b = y === "find", z = b ? 1 : -1, ct = b ? 0 : m.length - 1;
-      for (let T = ct; T >= 0 && T < m.length; T += z)
-        if (P(m[T], T, m))
-          return d.draft_[T];
+    if (a.has(S)) {
+      const w = M[0], T = S === "find", z = T ? 1 : -1, ft = T ? 0 : P.length - 1;
+      for (let A = ft; A >= 0 && A < P.length; A += z)
+        if (w(P[A], A, P))
+          return f.draft_[A];
       return;
     }
-    if (y === "slice") {
-      const P = w[0] ?? 0, b = w[1] ?? m.length, z = g(P, m.length), ct = g(b, m.length), T = [];
-      for (let ut = z; ut < ct; ut++)
-        T.push(d.draft_[ut]);
-      return T;
+    if (S === "slice") {
+      const w = M[0] ?? 0, T = M[1] ?? P.length, z = g(w, P.length), ft = g(T, P.length), A = [];
+      for (let dt = z; dt < ft; dt++)
+        A.push(f.draft_[dt]);
+      return A;
     }
-    return m[y](...w);
+    return P[S](...M);
   }
-  Vt(yt, {
-    createMethodInterceptor: Rt,
-    isArrayOperationMethod: r,
-    isMutatingArrayMethod: u
+  Ct(St, {
+    createMethodInterceptor: D,
+    isArrayOperationMethod: s,
+    isMutatingArrayMethod: h
   });
 }
-var re = new te(), F = re.produce;
+var re = new te(), R = re.produce;
+function Y(t) {
+  if (typeof t != "object" || t === null) return;
+  const e = Object.getPrototypeOf(t);
+  if (e === Object.prototype || e === null) return;
+  const n = e.constructor;
+  typeof n == "function" && (t instanceof Date || t instanceof RegExp || t instanceof Map || t instanceof Set || t instanceof WeakMap || t instanceof WeakSet || ArrayBuffer.isView(t) || n[J] !== !0 && (n[J] = !0));
+}
 let se = 0;
 function oe() {
   return se++;
 }
-class x {
-  constructor(e, i) {
-    this.controller = e, this.path = i, this.id = oe(), this._isTouched = !1, this._isDirty = !1;
+class ae {
+  constructor(e, n, i) {
+    this.controller = e, this.path = n, this.id = oe(), this._isTouched = !1, this._isDirty = !1, i?.isTouched && this._setTouched(!0), i?.isDirty && this._setDirty(!0);
   }
   get value() {
-    return S.getValue(
+    return m.getValue(
       this.controller._data,
       this.path
     );
   }
+  get initialValue() {
+    return m.getValue(
+      this.controller._initialData,
+      this.path
+    );
+  }
   get boundElement() {
     return this.target;
   }
   get issues() {
     return this.controller._issues.filter(
-      (e) => e.path?.join(".") === this.path
+      (e) => m.parsePath(e.path ?? []) === this.path
     );
   }
   get isTouched() {
@@ -982,61 +1040,68 @@ class x {
     return this.issues.length === 0;
   }
   _setTouched(e) {
-    const i = this._isTouched !== e;
-    this._isTouched = e, i && this.controller.events.emit("fieldTouchUpdated", this.path);
+    const n = this._isTouched !== e;
+    if (this._isTouched = e, n) {
+      const i = this.controller.getAscendantFields(this.path);
+      for (let o = i.length - 1; o >= 0; o--) {
+        const a = i[o];
+        a != null && this.controller.events.emit("fieldTouchUpdated", a.path);
+      }
+    }
   }
   _setDirty(e) {
-    const i = this._isDirty !== e;
-    this._isDirty = e, i && this.controller.events.emit("fieldDirtyUpdated", this.path);
+    const n = this._isDirty !== e;
+    if (this._isDirty = e, n) {
+      const i = this.controller.getAscendantFields(this.path);
+      for (let o = i.length - 1; o >= 0; o--) {
+        const a = i[o];
+        a != null && this.controller.events.emit("fieldDirtyUpdated", a.path);
+      }
+    }
   }
   bindElement(e) {
     e != null ? this.controller.events.emit("elementBound", this.path, e) : this.controller.events.emit("elementUnbound", this.path), this.target = e;
   }
-  static ensureImmerability(e) {
-    if (typeof e != "object" || e === null) return;
-    const i = Object.getPrototypeOf(e);
-    if (i === Object.prototype || i === null) return;
-    const n = i.constructor;
-    typeof n == "function" && (e instanceof Date || e instanceof RegExp || e instanceof Map || e instanceof Set || e instanceof WeakMap || e instanceof WeakSet || ArrayBuffer.isView(e) || n[$] !== !0 && (n[$] = !0));
-  }
-  setValue(e, i) {
-    return this.modifyValue(() => e, i);
+  setValue(e, n) {
+    return this.modifyValue(() => e, n);
   }
-  modifyValue(e, i) {
-    (i?.shouldTouch == null || i?.shouldTouch) && this.touch();
-    const n = S.getValue(
-      this.controller._initialData,
-      this.path
-    ), o = S.getValue(
-      this.controller._data,
-      this.path
-    );
-    x.ensureImmerability(n), x.ensureImmerability(o), this.controller._data = F(this.controller._data, (a) => {
-      S.modifyValue(
-        a,
-        this.path,
-        (r) => e(r, this)
-      );
+  modifyValue(e, n) {
+    (n?.shouldTouch == null || n?.shouldTouch) && this.touch();
+    const i = this.controller.getAscendantFields(this.path), o = i.map((s) => s?.initialValue);
+    o.forEach((s) => Y(s));
+    const a = i.map((s) => s?.value);
+    a.forEach((s) => Y(s)), this.controller._data = R(this.controller._data, (s) => {
+      m.modifyValue(s, this.path, (r) => e(r));
     });
-    const c = S.getValue(
-      this.controller._data,
-      this.path
-    );
-    x.ensureImmerability(c);
-    const l = (a, r) => {
-      if (typeof a != "object" || typeof r != "object") return;
-      const s = a.constructor, f = r.constructor;
-      if (s === f)
-        return this.controller.equalityComparators?.[s]?.(a, r);
+    const u = i.map((s) => s?.value);
+    u.forEach((s) => Y(s));
+    const h = (s, r) => {
+      if (typeof s != "object" || typeof r != "object") return;
+      const c = s.constructor, l = r.constructor;
+      if (c === l)
+        return this.controller.equalityComparators?.[c]?.(s, r);
     };
-    if (!S.deepEqual(o, c, l) && this.controller.events.emit(
-      "valueChanged",
-      this.path,
-      c,
-      o
-    ), i?.shouldMarkDirty == null || i?.shouldMarkDirty) {
-      const a = !S.deepEqual(n, c, l);
-      this._setDirty(a);
+    if (!m.deepEqual(
+      a[a.length - 1],
+      u[u.length - 1],
+      h
+    ))
+      for (let s = i.length - 1; s >= 0; s--) {
+        const r = i[s];
+        this.controller.events.emit(
+          "valueChanged",
+          r.path,
+          u[s],
+          a[s]
+        );
+      }
+    if (n?.shouldMarkDirty == null || n?.shouldMarkDirty) {
+      const s = !m.deepEqual(
+        o[o.length - 1],
+        u[u.length - 1],
+        h
+      );
+      this._setDirty(s);
     }
   }
   reset() {
@@ -1057,29 +1122,29 @@ class x {
     }), this.target?.scrollIntoView(), this.target?.focus();
   }
 }
-let ae = () => ({
+let ce = () => ({
   emit(t, ...e) {
-    for (let i = this.events[t] || [], n = 0, o = i.length; n < o; n++)
-      i[n](...e);
+    for (let n = this.events[t] || [], i = 0, o = n.length; i < o; i++)
+      n[i](...e);
   },
   events: {},
   on(t, e) {
     return (this.events[t] ||= []).push(e), () => {
-      this.events[t] = this.events[t]?.filter((i) => e !== i);
+      this.events[t] = this.events[t]?.filter((n) => e !== n);
     };
   }
 });
-function ce(t, e) {
-  let i = [];
-  for (let n = t.length - 1; n >= 0; n--)
-    e(t[n]) && i.push(n);
-  i.forEach((n) => t.splice(n, 1));
+function le(t, e) {
+  let n = [];
+  for (let i = t.length - 1; i >= 0; i--)
+    e(t[i]) && n.push(i);
+  n.forEach((i) => t.splice(i, 1));
 }
-ie();
 ne();
+ie();
 class ue {
   constructor(e) {
-    this._status = "idle", this._fields = /* @__PURE__ */ new Map(), this._issues = [], this.events = ae(), this.validationSchema = e.validationSchema, this.equalityComparators = e.equalityComparators, this._initialData = e.initialData ?? {}, this._data = F(this._initialData, () => {
+    this._isValidating = !1, this._isSubmitting = !1, this._fields = /* @__PURE__ */ new Map(), this._issues = [], this.events = ce(), this.validationSchema = e.validationSchema, this.equalityComparators = e.equalityComparators, this._initialData = e.initialData ?? {}, this._data = R(this._initialData, () => {
     });
   }
   get isDirty() {
@@ -1090,95 +1155,141 @@ class ue {
   get isValid() {
     return this._issues.length === 0;
   }
+  get isValidating() {
+    return this._isValidating;
+  }
   get isSubmitting() {
-    return this._status === "submitting";
-  }
-  setStatus(e) {
-    if (e === this._status) return;
-    const i = this._status;
-    this._status = e, this.events.emit("statusChanged", e, i);
-  }
-  _unsafeSetFieldValue(e, i, n) {
-    n?.updateInitialValue && (this._initialData = F(this._initialData, (o) => {
-      S.setValue(o, e, i);
-    })), this._data = F(this._data, (o) => {
-      S.setValue(o, e, i);
+    return this._isSubmitting;
+  }
+  setValidating(e) {
+    this._isValidating !== e && (this._isValidating = e, this.events.emit("validationStatusChange", e));
+  }
+  setSubmitting(e) {
+    this._isSubmitting !== e && (this._isSubmitting = e, this.events.emit("submissionStatusChange", e));
+  }
+  _unsafeSetFieldValue(e, n, i) {
+    Y(n), i?.updateInitialValue === !0 && (this._initialData = R(this._initialData, (o) => {
+      m.setValue(o, e, n);
+    })), this._data = R(this._data, (o) => {
+      m.setValue(o, e, n);
     });
   }
-  bindField(e, i) {
-    const n = new x(this, e);
-    return console.log("Binding", e, i?.defaultValue, n.id), this._fields.set(e, n), this.events.emit("fieldBound", e), i?.defaultValue != null && this._unsafeSetFieldValue(e, i.defaultValue, {
-      updateInitialValue: !0
-    }), i?.domElement != null && n.bindElement(i.domElement), n;
+  // TODO: Rename to "register" ??
+  bindField(e, n) {
+    let i = m.getValue(this._data, e);
+    i == null && n?.defaultValue != null && (this._unsafeSetFieldValue(e, n.defaultValue, {
+      updateInitialValue: n.overrideInitialValue
+    }), i = m.getValue(this._data, e));
+    const o = m.getValue(this._initialData, e), a = new ae(this, e, {
+      isDirty: !m.deepEqual(i, o)
+    });
+    return n?.domElement != null && a.bindElement(n.domElement), this._fields.set(e, a), this.events.emit("fieldBound", e), a;
   }
   unbindField(e) {
     this._fields.delete(e), this.events.emit("fieldUnbound", e);
   }
   // TODO: Add an option to keep dirty/touched fields as they are
   reset(e) {
-    this.setStatus("idle"), this._data = this._initialData, this._issues = [];
-    for (const i of this._fields.values())
-      i.reset();
-    e != null && (this._initialData = e, this._data = F(this._initialData, () => {
+    this._data = this._initialData, this._issues = [];
+    for (const n of this._fields.values())
+      n.reset();
+    e != null && (this._initialData = e, this._data = R(this._initialData, () => {
     }));
   }
-  getField(e, i) {
-    let n = this._fields.get(e);
-    return n == null && i?.bindIfMissing && (n = this.bindField(e)), n;
+  getAscendantFields(e) {
+    const n = m.parsePathFragments(e);
+    return n.map((o, a) => m.parsePath(
+      n.slice(0, a + 1)
+    )).map((o) => this.getField(o)).filter((o) => !!o);
+  }
+  getField(e) {
+    return this._fields.get(e);
   }
   clearFieldIssues(e) {
-    this._issues = this._issues.filter((i) => i.path == null ? !0 : i.path.join(".") !== e);
+    this._issues = this._issues.filter((n) => n.path == null ? !0 : m.parsePath(n.path) !== e);
   }
-  async applyValidation(e, i) {
-    const n = S.diff(
+  async applyValidation(e, n) {
+    const i = m.diff(
       this._issues,
       e.issues ?? [],
-      S.deepEqual,
-      (o) => o.path == null ? !1 : o.path.join(".") === i
+      m.deepEqual,
+      (o) => {
+        if (o.path == null) return !1;
+        const a = m.parsePath(o.path);
+        return a === n || m.isDescendant(n, a);
+      }
     );
-    ce(this._issues, (o) => n.removed.includes(o)), n.added.forEach((o) => this._issues.push(o)), (n.added.length !== 0 || n.removed.length !== 0) && this.events.emit("validationIssuesUpdated", i);
+    le(this._issues, (o) => i.removed.includes(o)), i.added.forEach((o) => this._issues.push(o)), (i.added.length !== 0 || i.removed.length !== 0) && this.events.emit("fieldIssuesUpdated", n);
   }
   async validateField(e) {
-    if (this._status !== "idle" || this.validationSchema == null) return;
-    this.setStatus("validating"), this.getField(e, { bindIfMissing: !0 });
-    const i = await this.validationSchema["~standard"].validate(
+    if (this._isValidating || this.validationSchema == null) return;
+    this.setValidating(!0), this.getField(e) == null && this.bindField(e);
+    const n = await this.validationSchema["~standard"].validate(
       this._data
     );
-    this.events.emit("validationTriggered", e), this.applyValidation(i, e), this.setStatus("idle");
+    this.events.emit("validationTriggered", e), this.applyValidation(n, e), this.setValidating(!1);
   }
   async validateForm() {
-    if (this._status !== "idle" || this.validationSchema == null) return;
-    this.setStatus("validating");
+    if (this._isValidating || this.validationSchema == null) return;
+    this.setValidating(!0);
     const e = await this.validationSchema["~standard"].validate(
       this._data
     );
-    for (const n of this._fields.keys())
-      this.events.emit("validationTriggered", n), this.applyValidation(e, n);
-    S.diff(this._issues, e.issues ?? [], S.deepEqual).added.forEach((n) => this._issues.push(n)), this.setStatus("idle");
+    for (const i of this._fields.keys())
+      this.events.emit("validationTriggered", i), this.applyValidation(e, i);
+    m.diff(this._issues, e.issues ?? [], m.deepEqual).added.forEach((i) => this._issues.push(i)), this.setValidating(!1);
   }
-  createSubmitHandler(e, i) {
-    return async (n) => {
-      if (n?.preventDefault(), this._status !== "idle") return;
+  createSubmitHandler(e, n) {
+    return async (i) => {
+      if (i?.preventDefault(), this._isValidating || this._isSubmitting) return;
       const o = new AbortController();
       if (await this.validateForm(), this._issues.length === 0) {
-        this.setStatus("submitting"), await e?.(this._data, n, o.signal), this.setStatus("idle");
+        this.setSubmitting(!0), await e?.(this._data, i, o.signal), this.setSubmitting(!1);
         return;
       }
-      for (const c of this._issues) {
-        if (c.path == null) continue;
-        const l = c.path.join("."), u = this.getField(l);
-        if (u != null && u.boundElement != null) {
-          u.focus();
+      for (const a of this._issues) {
+        if (a.path == null) continue;
+        const u = m.parsePath(a.path), h = this.getField(u);
+        if (h != null && h.boundElement != null) {
+          h.focus();
           break;
         }
       }
-      await i?.(this._issues, n, o.signal), this.setStatus("idle");
+      await n?.(this._issues, i, o.signal), this.setSubmitting(!1);
     };
   }
 }
+function fe(t) {
+  return {
+    "~standard": {
+      version: 1,
+      vendor: "goodie-forms/custom",
+      validate: async (e) => {
+        try {
+          const n = await t(e);
+          return n == null ? { value: e } : {
+            issues: n.map((i) => ({
+              path: m.parsePathFragments(i.path),
+              message: i.message
+            }))
+          };
+        } catch (n) {
+          return {
+            issues: [
+              {
+                message: n instanceof Error ? n.message : "Unknown error"
+              }
+            ]
+          };
+        }
+      }
+    }
+  };
+}
 export {
-  S as Field,
+  m as Field,
   ue as FormController,
-  x as FormField
+  ae as FormField,
+  fe as customValidation
 };
 //# sourceMappingURL=index.js.map