@okyiww/form 0.0.27 → 0.0.28

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (2) hide show
  1. package/dist/index.js +85 -86
  2. package/package.json +1 -1
package/dist/index.js CHANGED
@@ -740,7 +740,7 @@ function Re(e, t, r, n, i, s) {
740
740
  }) : No(e) && e.forEach(function(g, A) {
741
741
  o.set(A, Re(g, t, r, A, e, s));
742
742
  });
743
- var p = nt, b = u ? void 0 : p(e);
743
+ var d = nt, b = u ? void 0 : d(e);
744
744
  return br(b || e, function(g, A) {
745
745
  b && (A = g, g = e[A]), ht(o, A, Re(g, t, r, A, e, s));
746
746
  }), o;
@@ -787,7 +787,7 @@ function Nr(e, t, r, n, i, s) {
787
787
  var c = s.get(e), l = s.get(t);
788
788
  if (c && l)
789
789
  return c == t && l == e;
790
- var a = -1, p = !0, b = r & wf ? new Ce() : void 0;
790
+ var a = -1, d = !0, b = r & wf ? new Ce() : void 0;
791
791
  for (s.set(e, t), s.set(t, e); ++a < f; ) {
792
792
  var g = e[a], A = t[a];
793
793
  if (n)
@@ -795,7 +795,7 @@ function Nr(e, t, r, n, i, s) {
795
795
  if (S !== void 0) {
796
796
  if (S)
797
797
  continue;
798
- p = !1;
798
+ d = !1;
799
799
  break;
800
800
  }
801
801
  if (b) {
@@ -803,15 +803,15 @@ function Nr(e, t, r, n, i, s) {
803
803
  if (!bf(b, P) && (g === O || i(g, O, r, n, s)))
804
804
  return b.push(P);
805
805
  })) {
806
- p = !1;
806
+ d = !1;
807
807
  break;
808
808
  }
809
809
  } else if (!(g === A || i(g, A, r, n, s))) {
810
- p = !1;
810
+ d = !1;
811
811
  break;
812
812
  }
813
813
  }
814
- return s.delete(e), s.delete(t), p;
814
+ return s.delete(e), s.delete(t), d;
815
815
  }
816
816
  function Sf(e) {
817
817
  var t = -1, r = Array(e.size);
@@ -867,8 +867,8 @@ function Kf(e, t, r, n, i, s) {
867
867
  if (u != l && !o)
868
868
  return !1;
869
869
  for (var a = u; a--; ) {
870
- var p = f[a];
871
- if (!(o ? p in t : Hf.call(t, p)))
870
+ var d = f[a];
871
+ if (!(o ? d in t : Hf.call(t, d)))
872
872
  return !1;
873
873
  }
874
874
  var b = s.get(e), g = s.get(t);
@@ -877,19 +877,19 @@ function Kf(e, t, r, n, i, s) {
877
877
  var A = !0;
878
878
  s.set(e, t), s.set(t, e);
879
879
  for (var S = o; ++a < u; ) {
880
- p = f[a];
881
- var O = e[p], P = t[p];
880
+ d = f[a];
881
+ var O = e[d], P = t[d];
882
882
  if (n)
883
- var x = o ? n(P, O, p, t, e, s) : n(O, P, p, e, t, s);
883
+ var x = o ? n(P, O, d, t, e, s) : n(O, P, d, e, t, s);
884
884
  if (!(x === void 0 ? O === P || i(O, P, r, n, s) : x)) {
885
885
  A = !1;
886
886
  break;
887
887
  }
888
- S || (S = p == "constructor");
888
+ S || (S = d == "constructor");
889
889
  }
890
890
  if (A && !S) {
891
- var h = e.constructor, d = t.constructor;
892
- h != d && "constructor" in e && "constructor" in t && !(typeof h == "function" && h instanceof h && typeof d == "function" && d instanceof d) && (A = !1);
891
+ var h = e.constructor, p = t.constructor;
892
+ h != p && "constructor" in e && "constructor" in t && !(typeof h == "function" && h instanceof h && typeof p == "function" && p instanceof p) && (A = !1);
893
893
  }
894
894
  return s.delete(e), s.delete(t), A;
895
895
  }
@@ -897,13 +897,13 @@ var Uf = 1, Jt = "[object Arguments]", Qt = "[object Array]", Ae = "[object Obje
897
897
  function Vf(e, t, r, n, i, s) {
898
898
  var o = m(e), f = m(t), u = o ? Qt : K(e), c = f ? Qt : K(t);
899
899
  u = u == Jt ? Ae : u, c = c == Jt ? Ae : c;
900
- var l = u == Ae, a = c == Ae, p = u == c;
901
- if (p && ce(e)) {
900
+ var l = u == Ae, a = c == Ae, d = u == c;
901
+ if (d && ce(e)) {
902
902
  if (!ce(t))
903
903
  return !1;
904
904
  o = !0, l = !1;
905
905
  }
906
- if (p && !l)
906
+ if (d && !l)
907
907
  return s || (s = new k()), o || Ue(e) ? Nr(e, t, r, n, i, s) : If(e, t, u, r, n, i, s);
908
908
  if (!(r & Uf)) {
909
909
  var b = l && er.call(e, "__wrapped__"), g = a && er.call(t, "__wrapped__");
@@ -912,7 +912,7 @@ function Vf(e, t, r, n, i, s) {
912
912
  return s || (s = new k()), i(A, S, r, n, s);
913
913
  }
914
914
  }
915
- return p ? (s || (s = new k()), Kf(e, t, r, n, i, s)) : !1;
915
+ return d ? (s || (s = new k()), Kf(e, t, r, n, i, s)) : !1;
916
916
  }
917
917
  function mt(e, t, r, n, i) {
918
918
  return e === t ? !0 : e == null || t == null || !H(e) && !H(t) ? e !== e && t !== t : Vf(e, t, r, n, mt, i);
@@ -1066,8 +1066,8 @@ function au(e, t, r, n, i, s, o) {
1066
1066
  }
1067
1067
  var l = s ? s(f, u, r + "", e, t, o) : void 0, a = l === void 0;
1068
1068
  if (a) {
1069
- var p = m(u), b = !p && ce(u), g = !p && !b && Ue(u);
1070
- l = u, p || b || g ? m(f) ? l = f : lu(f) ? l = Zn(f) : b ? (a = !1, l = Cr(u, !0)) : g ? (a = !1, l = Pr(u, !0)) : l = [] : X(u) || _e(u) ? (l = f, _e(f) ? l = cu(f) : (!E(f) || I(f)) && (l = Dr(u))) : a = !1;
1069
+ var d = m(u), b = !d && ce(u), g = !d && !b && Ue(u);
1070
+ l = u, d || b || g ? m(f) ? l = f : lu(f) ? l = Zn(f) : b ? (a = !1, l = Cr(u, !0)) : g ? (a = !1, l = Pr(u, !0)) : l = [] : X(u) || _e(u) ? (l = f, _e(f) ? l = cu(f) : (!E(f) || I(f)) && (l = Dr(u))) : a = !1;
1071
1071
  }
1072
1072
  a && (o.set(u, l), i(l, u, n, s, o), o.delete(u)), ft(e, r, l);
1073
1073
  }
@@ -1362,28 +1362,28 @@ function lt(e, t, r) {
1362
1362
  }
1363
1363
  }
1364
1364
  function Vu(e, t, r, n) {
1365
- const { childrenKey: i, format: s } = {}, o = (a, p) => !E(a) || m(a) ? !1 : typeof t == "function" ? t(a, p) : T(a, t) === p, f = (a, p) => {
1365
+ const { childrenKey: i, format: s } = {}, o = (a, d) => !E(a) || m(a) ? !1 : typeof t == "function" ? t(a, d) : T(a, t) === d, f = (a, d) => {
1366
1366
  if (E(a)) {
1367
1367
  if (m(a)) {
1368
1368
  for (const b of a) {
1369
- if (o(b, p)) return b;
1370
- const g = f(b, p);
1369
+ if (o(b, d)) return b;
1370
+ const g = f(b, d);
1371
1371
  if (g) return g;
1372
1372
  }
1373
1373
  return;
1374
1374
  }
1375
- if (o(a, p)) return a;
1375
+ if (o(a, d)) return a;
1376
1376
  for (const b of Object.values(a)) {
1377
- const g = f(b, p);
1377
+ const g = f(b, d);
1378
1378
  if (g) return g;
1379
1379
  }
1380
1380
  }
1381
1381
  }, u = (a) => {
1382
- let p = e;
1382
+ let d = e;
1383
1383
  return Ze(
1384
1384
  pe(a, (b) => {
1385
- const g = bu(p, (A) => o(A, b));
1386
- return p = g ? T(g, i) : void 0, g;
1385
+ const g = bu(d, (A) => o(A, b));
1386
+ return d = g ? T(g, i) : void 0, g;
1387
1387
  })
1388
1388
  );
1389
1389
  };
@@ -1391,7 +1391,7 @@ function Vu(e, t, r, n) {
1391
1391
  const l = m(r) && m(r[0]);
1392
1392
  return i ? c = l ? pe(r, u) : m(r) ? u(r) : f(e, r) : c = l ? pe(
1393
1393
  r,
1394
- (a) => Ze(pe(a, (p) => f(e, p)))
1394
+ (a) => Ze(pe(a, (d) => f(e, d)))
1395
1395
  ) : m(r) ? Ze(pe(r, (a) => f(e, a))) : f(e, r), s && c !== void 0 ? s(c) : c;
1396
1396
  }
1397
1397
  function ku(e, t, r) {
@@ -1507,10 +1507,9 @@ function ct(e, t, r, n, i, s, o) {
1507
1507
  continue;
1508
1508
  }
1509
1509
  if (!f.field) continue;
1510
- const c = r ? `${r}.${f.field}` : f.field, l = T(t, c);
1511
- if (St(l)) continue;
1512
- const a = s[f.field] ?? "leaf", p = (f.componentProps ? Ju(f.componentProps, l, i, a) : null) ?? Xu(o.get(c), l);
1513
- p !== null && (n[c] = p);
1510
+ const c = r ? `${r}.${f.field}` : f.field, l = T(t, c), a = s[f.field] ?? "leaf";
1511
+ let d = null;
1512
+ !St(l) && f.componentProps && (d = Ju(f.componentProps, l, i, a)), d === null && (d = Xu(o.get(c), l)), d !== null && (n[c] = d);
1514
1513
  }
1515
1514
  }
1516
1515
  function Xu(e, t) {
@@ -1543,7 +1542,7 @@ function Ju(e, t, r, n) {
1543
1542
  if (!(!m(f) || !f.length || !E(f[0]) || m(f[0])))
1544
1543
  for (const [u, c, l] of s)
1545
1544
  if (m(t)) {
1546
- const a = t.map((p) => nr(f, p, u, c, l, n)).filter((p) => p !== null);
1545
+ const a = t.map((d) => nr(f, d, u, c, l, n)).filter((d) => d !== null);
1547
1546
  if (a.length) return a;
1548
1547
  } else {
1549
1548
  const a = nr(f, t, u, c, l, n);
@@ -2020,26 +2019,26 @@ const al = /* @__PURE__ */ new Set(["values", "keys", "entries"]), hl = /* @__PU
2020
2019
  ...dl,
2021
2020
  ...r
2022
2021
  };
2023
- const n = Symbol("ProxyTarget"), { equals: i, isShallow: s, ignoreDetached: o, details: f } = r, u = new rl(i), c = typeof r.onValidate == "function", l = new Y(c), a = (h, d, y, _, v) => !c || l.isCloning || r.onValidate(j.concat(u.getPath(h), d), y, _, v) === !0, p = (h, d, y, _, v) => {
2024
- if (ir(u, r, d) || o && u.isDetached(h, e))
2022
+ const n = Symbol("ProxyTarget"), { equals: i, isShallow: s, ignoreDetached: o, details: f } = r, u = new rl(i), c = typeof r.onValidate == "function", l = new Y(c), a = (h, p, y, _, v) => !c || l.isCloning || r.onValidate(j.concat(u.getPath(h), p), y, _, v) === !0, d = (h, p, y, _, v) => {
2023
+ if (ir(u, r, p) || o && u.isDetached(h, e))
2025
2024
  return;
2026
2025
  const M = u.getAllPaths(h), D = !l.isCloning && M && M.length > 1 ? M : [u.getPath(h)];
2027
2026
  for (const ue of D)
2028
- b(ue, d, y, _, v);
2029
- }, b = (h, d, y, _, v) => {
2030
- l.isCloning && l.isPartOfClone(h) ? l.update(h, d, _) : t(j.concat(h, d), y, _, v);
2031
- }, g = (h) => h !== null && (typeof h == "object" || typeof h == "function") ? h[n] ?? h : h, A = (h, d, y, _) => {
2032
- if (Qu(h) || y === "constructor" || s && !Y.isHandledMethod(d, y) || ir(u, r, y) || u.isGetInvariant(d, y) || o && u.isDetached(d, e))
2027
+ b(ue, p, y, _, v);
2028
+ }, b = (h, p, y, _, v) => {
2029
+ l.isCloning && l.isPartOfClone(h) ? l.update(h, p, _) : t(j.concat(h, p), y, _, v);
2030
+ }, g = (h) => h !== null && (typeof h == "object" || typeof h == "function") ? h[n] ?? h : h, A = (h, p, y, _) => {
2031
+ if (Qu(h) || y === "constructor" || s && !Y.isHandledMethod(p, y) || ir(u, r, y) || u.isGetInvariant(p, y) || o && u.isDetached(p, e))
2033
2032
  return h;
2034
- _ === void 0 && (_ = u.getPath(d));
2033
+ _ === void 0 && (_ = u.getPath(p));
2035
2034
  const v = j.concat(_, y), M = u.getPath(h);
2036
2035
  return M && S(v, M) ? u.getProxy(h, M, P, n) : u.getProxy(h, v, P, n);
2037
- }, S = (h, d) => {
2038
- if (De(h) || h.length <= d.length || Array.isArray(d) && d.length === 0)
2036
+ }, S = (h, p) => {
2037
+ if (De(h) || h.length <= p.length || Array.isArray(p) && p.length === 0)
2039
2038
  return !1;
2040
- const y = Array.isArray(h) ? h : h.split(Q), _ = Array.isArray(d) ? d : d.split(Q);
2039
+ const y = Array.isArray(h) ? h : h.split(Q), _ = Array.isArray(p) ? p : p.split(Q);
2041
2040
  return y.length <= _.length ? !1 : !_.some((v, M) => v !== y[M]);
2042
- }, O = (h, d, y, _) => {
2041
+ }, O = (h, p, y, _) => {
2043
2042
  let v = j.initial(u.getPath(h));
2044
2043
  const M = Y.isHandledMethod(y, h.name);
2045
2044
  l.start(y, v, _);
@@ -2052,11 +2051,11 @@ const al = /* @__PURE__ */ new Set(["values", "keys", "entries"]), hl = /* @__PU
2052
2051
  getProxyTarget: g
2053
2052
  }) : D = Reflect.apply(
2054
2053
  h,
2055
- l.preferredThisArg(h, d, y),
2054
+ l.preferredThisArg(h, p, y),
2056
2055
  M ? _.map((re) => g(re)) : _
2057
2056
  );
2058
2057
  const ue = l.isChanged(y, i), he = l.stop();
2059
- if (Y.isHandledType(D) && M && (d instanceof Map && h.name === "get" && (v = j.concat(v, _[0])), D = u.getProxy(D, v, P)), ue) {
2058
+ if (Y.isHandledType(D) && M && (p instanceof Map && h.name === "get" && (v = j.concat(v, _[0])), D = u.getProxy(D, v, P)), ue) {
2060
2059
  const re = ur(f, h.name) ? {
2061
2060
  name: h.name,
2062
2061
  args: _,
@@ -2064,54 +2063,54 @@ const al = /* @__PURE__ */ new Set(["values", "keys", "entries"]), hl = /* @__PU
2064
2063
  } : void 0, Ot = l.isCloning ? j.initial(v) : v, vt = l.isCloning ? j.last(v) : "";
2065
2064
  a(j.get(e, Ot), vt, y, he, re) ? b(Ot, vt, y, he, re) : l.undo(y);
2066
2065
  }
2067
- return (d instanceof Map || d instanceof Set) && el(D) ? tl(D, h, d, v, A) : D;
2066
+ return (p instanceof Map || p instanceof Set) && el(D) ? tl(D, h, p, v, A) : D;
2068
2067
  }, P = {
2069
- get(h, d, y) {
2070
- if (De(d)) {
2071
- if (d === n || d === At)
2068
+ get(h, p, y) {
2069
+ if (De(p)) {
2070
+ if (p === n || p === At)
2072
2071
  return h;
2073
- if (d === Yr && !u.isUnsubscribed && u.getPath(h).length === 0)
2072
+ if (p === Yr && !u.isUnsubscribed && u.getPath(h).length === 0)
2074
2073
  return u.unsubscribe(), h;
2075
2074
  }
2076
- const _ = at(h) ? Reflect.get(h, d) : Reflect.get(h, d, y);
2077
- return A(_, h, d);
2075
+ const _ = at(h) ? Reflect.get(h, p) : Reflect.get(h, p, y);
2076
+ return A(_, h, p);
2078
2077
  },
2079
- set(h, d, y, _) {
2078
+ set(h, p, y, _) {
2080
2079
  y = g(y);
2081
- const v = h[n] ?? h, M = v[d];
2082
- if (i(M, y) && d in h)
2080
+ const v = h[n] ?? h, M = v[p];
2081
+ if (i(M, y) && p in h)
2083
2082
  return !0;
2084
- const D = a(h, d, y, M);
2085
- return D && u.setProperty(v, d, y, _, M) ? (p(h, d, h[d], M), !0) : !D;
2083
+ const D = a(h, p, y, M);
2084
+ return D && u.setProperty(v, p, y, _, M) ? (d(h, p, h[p], M), !0) : !D;
2086
2085
  },
2087
- defineProperty(h, d, y) {
2088
- if (!u.isSameDescriptor(y, h, d)) {
2089
- const _ = h[d];
2090
- if (a(h, d, y.value, _) && u.defineProperty(h, d, y)) {
2086
+ defineProperty(h, p, y) {
2087
+ if (!u.isSameDescriptor(y, h, p)) {
2088
+ const _ = h[p];
2089
+ if (a(h, p, y.value, _) && u.defineProperty(h, p, y)) {
2091
2090
  const M = Object.hasOwn(y, "value") ? y.value : (() => {
2092
2091
  try {
2093
- return h[d];
2092
+ return h[p];
2094
2093
  } catch {
2095
2094
  return;
2096
2095
  }
2097
2096
  })();
2098
- p(h, d, M, _);
2097
+ d(h, p, M, _);
2099
2098
  }
2100
2099
  }
2101
2100
  return !0;
2102
2101
  },
2103
- deleteProperty(h, d) {
2104
- if (!Reflect.has(h, d))
2102
+ deleteProperty(h, p) {
2103
+ if (!Reflect.has(h, p))
2105
2104
  return !0;
2106
- const y = Reflect.get(h, d), _ = a(h, d, void 0, y);
2107
- return _ && u.deleteProperty(h, d, y) ? (p(h, d, void 0, y), !0) : !_;
2105
+ const y = Reflect.get(h, p), _ = a(h, p, void 0, y);
2106
+ return _ && u.deleteProperty(h, p, y) ? (d(h, p, void 0, y), !0) : !_;
2108
2107
  },
2109
- apply(h, d, y) {
2110
- const _ = (d == null ? void 0 : d[n]) ?? d;
2108
+ apply(h, p, y) {
2109
+ const _ = (p == null ? void 0 : p[n]) ?? p;
2111
2110
  if (u.isUnsubscribed)
2112
2111
  return Reflect.apply(h, _, y);
2113
2112
  if (Y.isHandledType(_) && !(je(_) && !Y.isHandledMethod(_, h.name)) && (typeof h.name == "symbol" || al.has(h.name) || f === !1 || Array.isArray(f) && !f.includes(h.name)))
2114
- return O(h, d, _, y);
2113
+ return O(h, p, _, y);
2115
2114
  if (_ instanceof Date && Y.isHandledMethod(_, h.name)) {
2116
2115
  const v = _.getTime(), M = Reflect.apply(h, _, y), D = _.getTime();
2117
2116
  if (!i(v, D)) {
@@ -2127,7 +2126,7 @@ const al = /* @__PURE__ */ new Set(["values", "keys", "entries"]), hl = /* @__PU
2127
2126
  }
2128
2127
  return M;
2129
2128
  }
2130
- return Reflect.apply(h, d, y);
2129
+ return Reflect.apply(h, p, y);
2131
2130
  }
2132
2131
  }, x = u.getProxy(e, r.pathAsArray ? [] : "", P);
2133
2132
  return t = t.bind(x), c && (r.onValidate = r.onValidate.bind(x)), x;
@@ -2138,8 +2137,8 @@ const al = /* @__PURE__ */ new Set(["values", "keys", "entries"]), hl = /* @__PU
2138
2137
  const f = r === "lastIndexOf";
2139
2138
  let u = i === void 0 ? f ? o - 1 : 0 : Math.trunc(Number(i)) || 0;
2140
2139
  u < 0 ? u = Math.max(0, o + u) : f && (u = Math.min(u, o - 1));
2141
- const c = s(n), l = r === "lastIndexOf", a = l ? -1 : o, p = l ? -1 : 1;
2142
- for (let b = u; l ? b > a : b < a; b += p) {
2140
+ const c = s(n), l = r === "lastIndexOf", a = l ? -1 : o, d = l ? -1 : 1;
2141
+ for (let b = u; l ? b > a : b < a; b += d) {
2143
2142
  const g = t[b];
2144
2143
  if (g === n || s(g) === c)
2145
2144
  return r === "includes" ? !0 : b;
@@ -2392,8 +2391,8 @@ class $l {
2392
2391
  default: () => V(f, qe({
2393
2392
  ref: o,
2394
2393
  modelValue: T(r, t.field),
2395
- "onUpdate:modelValue": (p) => {
2396
- U(r, t.field, p);
2394
+ "onUpdate:modelValue": (d) => {
2395
+ U(r, t.field, d);
2397
2396
  },
2398
2397
  placeholder: t.placeholder ?? a
2399
2398
  }, t.componentProps), {
@@ -2494,8 +2493,8 @@ function Rl(e, t) {
2494
2493
  return s;
2495
2494
  if (u === "valueOf" || u === "toString" || u === Symbol.toPrimitive)
2496
2495
  return () => {
2497
- const a = i.join("."), p = r(i);
2498
- return i.length > 0 && t(a), u === "toString" ? typeof p == "object" && p !== null ? "[object Object]" : String(p) : p;
2496
+ const a = i.join("."), d = r(i);
2497
+ return i.length > 0 && t(a), u === "toString" ? typeof d == "object" && d !== null ? "[object Object]" : String(d) : d;
2499
2498
  };
2500
2499
  if (typeof u == "symbol") return;
2501
2500
  const c = [...i, String(u)], l = r(c);
@@ -2510,7 +2509,7 @@ function Rl(e, t) {
2510
2509
  i.length > 0 && t(l);
2511
2510
  const a = r(i);
2512
2511
  if (typeof a == "function") {
2513
- const p = i.slice(0, -1), b = r(p) || e;
2512
+ const d = i.slice(0, -1), b = r(d) || e;
2514
2513
  return a.apply(b, c);
2515
2514
  }
2516
2515
  },
@@ -2594,8 +2593,8 @@ function Fl(e, t) {
2594
2593
  return !!(r && e.includes(r) || n && e.includes(n) || i && e.includes(i) || s && e.includes(s));
2595
2594
  }
2596
2595
  function F(e, { model: t, shared: r }, n, i) {
2597
- var a, p, b, g, A;
2598
- const s = (a = n.ssr.definitions) == null ? void 0 : a.model, o = (p = n.ssr.definitions) == null ? void 0 : p.shared, f = (b = n.ssr.definitions) == null ? void 0 : b.res, u = (g = n.ssr.definitions) == null ? void 0 : g.err, c = (A = n.ssr.definitions) == null ? void 0 : A.args;
2596
+ var a, d, b, g, A;
2597
+ const s = (a = n.ssr.definitions) == null ? void 0 : a.model, o = (d = n.ssr.definitions) == null ? void 0 : d.shared, f = (b = n.ssr.definitions) == null ? void 0 : b.res, u = (g = n.ssr.definitions) == null ? void 0 : g.err, c = (A = n.ssr.definitions) == null ? void 0 : A.args;
2599
2598
  if (!L(e))
2600
2599
  return m(e) ? Hl(
2601
2600
  e,
@@ -2701,7 +2700,7 @@ function Kl(e, { model: t, shared: r }, n, i) {
2701
2700
  }
2702
2701
  async function Me(e, t, r, n, i = !1) {
2703
2702
  if ((!L(e.left) || !L(e.right)) && !i) {
2704
- let l, a, p = [];
2703
+ let l, a, d = [];
2705
2704
  if (L(e.left) || (l = await C(
2706
2705
  e.left,
2707
2706
  t,
@@ -2716,8 +2715,8 @@ async function Me(e, t, r, n, i = !1) {
2716
2715
  n
2717
2716
  ));
2718
2717
  await Promise.all(b).then((g) => {
2719
- p = g;
2720
- }), e.right = p;
2718
+ d = g;
2719
+ }), e.right = d;
2721
2720
  } else
2722
2721
  a = await C(
2723
2722
  e.right,
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@okyiww/form",
3
- "version": "0.0.27",
3
+ "version": "0.0.28",
4
4
  "main": "./dist/index.js",
5
5
  "module": "./dist/index.js",
6
6
  "type": "module",