suprform 1.1.2 → 1.1.3

package/dist/suprform.es.js

@@ -78,7 +78,7 @@ var St = (t, r, e, s = !0) => {
     });
   return u;
 };
-const Ce = typeof window < "u" ? b.useLayoutEffect : b.useEffect;
+const ke = typeof window < "u" ? b.useLayoutEffect : b.useEffect;
 function tr(t) {
   const r = Ve(), { control: e = r.control, disabled: s, name: u, exact: i } = t || {}, [c, l] = b.useState(e._formState), V = b.useRef({
     isDirty: !1,
@@ -90,7 +90,7 @@ function tr(t) {
     isValid: !1,
     errors: !1
   });
-  return Ce(() => e._subscribe({
+  return ke(() => e._subscribe({
     name: u,
     formState: V.current,
     exact: i,
@@ -147,7 +147,7 @@ function Je(t) {
         L(d);
     }
   }, [e._formValues, e._names, i, s]);
-  Ce(() => ((g.current !== e || !te(F.current, s)) && (g.current = e, F.current = s, N()), e._subscribe({
+  ke(() => ((g.current !== e || !te(F.current, s)) && (g.current = e, F.current = s, N()), e._subscribe({
     name: s,
     formState: {
       values: !0
@@ -326,13 +326,13 @@ var or = (t) => {
       return !0;
   return !1;
 };
-function Ct(t) {
+function kt(t) {
   return Array.isArray(t) || P(t) && !or(t);
 }
 function je(t, r = {}) {
   for (const e in t) {
     const s = t[e];
-    Ct(s) ? (r[e] = Array.isArray(s) ? [] : {}, je(s, r[e])) : O(s) || (r[e] = !0);
+    kt(s) ? (r[e] = Array.isArray(s) ? [] : {}, je(s, r[e])) : O(s) || (r[e] = !0);
   }
   return r;
 }
@@ -340,7 +340,7 @@ function fe(t, r, e) {
   e || (e = je(r));
   for (const s in t) {
     const u = t[s];
-    if (Ct(u))
+    if (kt(u))
       O(r) || qe(e[s]) ? e[s] = je(u, Array.isArray(u) ? [] : {}) : fe(u, G(r) ? {} : r[s], e[s]);
     else {
       const i = r[s];
@@ -353,7 +353,7 @@ const yt = {
   value: !1,
   isValid: !1
 }, mt = { value: !0, isValid: !0 };
-var kt = (t) => {
+var Ct = (t) => {
   if (Array.isArray(t)) {
     if (t.length > 1) {
       const r = t.filter((e) => e && e.checked && !e.disabled).map((e) => e.value);
@@ -376,7 +376,7 @@ var Rt = (t) => Array.isArray(t) ? t.reduce((r, e) => e && e.checked && !e.disab
 } : r, _t) : _t;
 function gt(t) {
   const r = t.ref;
-  return Xe(r) ? r.files : Ze(r) ? Rt(t.refs).value : wt(r) ? [...r.selectedOptions].map(({ value: e }) => e) : ve(r) ? kt(t.refs).value : Dt(O(r.value) ? t.ref.value : r.value, t);
+  return Xe(r) ? r.files : Ze(r) ? Rt(t.refs).value : wt(r) ? [...r.selectedOptions].map(({ value: e }) => e) : ve(r) ? Ct(t.refs).value : Dt(O(r.value) ? t.ref.value : r.value, t);
 }
 var lr = (t, r, e, s) => {
   const u = {};
@@ -467,20 +467,20 @@ var de = (t) => P(t) && !Se(t) ? t : {
   const { ref: c, refs: l, required: V, maxLength: v, minLength: x, min: g, max: F, pattern: $, validate: L, name: w, valueAsNumber: N, mount: H } = t._f, S = m(e, w);
   if (!H || r.has(w))
     return {};
-  const M = l ? l[0] : c, f = (C) => {
-    u && M.reportValidity && (M.setCustomValidity(K(C) ? "" : C || ""), M.reportValidity());
-  }, d = {}, p = Ze(c), E = ve(c), Z = p || E, W = (N || Xe(c)) && O(c.value) && O(S) || xe(c) && c.value === "" || S === "" || Array.isArray(S) && !S.length, oe = ar.bind(null, w, s, d), se = (C, D, I, j = ne.maxLength, Q = ne.minLength) => {
-    const ae = C ? D : I;
+  const M = l ? l[0] : c, f = (k) => {
+    u && M.reportValidity && (M.setCustomValidity(K(k) ? "" : k || ""), M.reportValidity());
+  }, d = {}, p = Ze(c), E = ve(c), Z = p || E, W = (N || Xe(c)) && O(c.value) && O(S) || xe(c) && c.value === "" || S === "" || Array.isArray(S) && !S.length, oe = ar.bind(null, w, s, d), se = (k, D, I, j = ne.maxLength, Q = ne.minLength) => {
+    const ae = k ? D : I;
     d[w] = {
-      type: C ? j : Q,
+      type: k ? j : Q,
       message: ae,
       ref: c,
-      ...oe(C ? j : Q, ae)
+      ...oe(k ? j : Q, ae)
     };
   };
-  if (i ? !Array.isArray(S) || !S.length : V && (!Z && (W || G(S)) || K(S) && !S || E && !kt(l).isValid || p && !Rt(l).isValid)) {
-    const { value: C, message: D } = Y(V) ? { value: !!V, message: V } : de(V);
-    if (C && (d[w] = {
+  if (i ? !Array.isArray(S) || !S.length : V && (!Z && (W || G(S)) || K(S) && !S || E && !Ct(l).isValid || p && !Rt(l).isValid)) {
+    const { value: k, message: D } = Y(V) ? { value: !!V, message: V } : de(V);
+    if (k && (d[w] = {
       type: ne.required,
       message: D,
       ref: M,
@@ -489,26 +489,26 @@ var de = (t) => P(t) && !Se(t) ? t : {
       return f(D), d;
   }
   if (!W && (!G(g) || !G(F))) {
-    let C, D;
+    let k, D;
     const I = de(F), j = de(g);
     if (!G(S) && !isNaN(S)) {
       const Q = c.valueAsNumber || S && +S;
-      G(I.value) || (C = Q > I.value), G(j.value) || (D = Q < j.value);
+      G(I.value) || (k = Q > I.value), G(j.value) || (D = Q < j.value);
     } else {
       const Q = c.valueAsDate || new Date(S), ae = (Fe) => /* @__PURE__ */ new Date((/* @__PURE__ */ new Date()).toDateString() + " " + Fe), _e = c.type == "time", ce = c.type == "week";
-      Y(I.value) && S && (C = _e ? ae(S) > ae(I.value) : ce ? S > I.value : Q > new Date(I.value)), Y(j.value) && S && (D = _e ? ae(S) < ae(j.value) : ce ? S < j.value : Q < new Date(j.value));
+      Y(I.value) && S && (k = _e ? ae(S) > ae(I.value) : ce ? S > I.value : Q > new Date(I.value)), Y(j.value) && S && (D = _e ? ae(S) < ae(j.value) : ce ? S < j.value : Q < new Date(j.value));
     }
-    if ((C || D) && (se(!!C, I.message, j.message, ne.max, ne.min), !s))
+    if ((k || D) && (se(!!k, I.message, j.message, ne.max, ne.min), !s))
       return f(d[w].message), d;
   }
   if ((v || x) && !W && (Y(S) || i && Array.isArray(S))) {
-    const C = de(v), D = de(x), I = !G(C.value) && S.length > +C.value, j = !G(D.value) && S.length < +D.value;
-    if ((I || j) && (se(I, C.message, D.message), !s))
+    const k = de(v), D = de(x), I = !G(k.value) && S.length > +k.value, j = !G(D.value) && S.length < +D.value;
+    if ((I || j) && (se(I, k.message, D.message), !s))
       return f(d[w].message), d;
   }
   if ($ && !W && Y(S)) {
-    const { value: C, message: D } = de($);
-    if (Se(C) && !S.match(C) && (d[w] = {
+    const { value: k, message: D } = de($);
+    if (Se(k) && !S.match(k) && (d[w] = {
       type: ne.pattern,
       message: D,
       ref: c,
@@ -518,26 +518,26 @@ var de = (t) => P(t) && !Se(t) ? t : {
   }
   if (L) {
     if (re(L)) {
-      const C = await L(S, e), D = Vt(C, M);
+      const k = await L(S, e), D = Vt(k, M);
       if (D && (d[w] = {
         ...D,
         ...oe(ne.validate, D.message)
       }, !s))
         return f(D.message), d;
     } else if (P(L)) {
-      let C = {};
+      let k = {};
       for (const D in L) {
-        if (!q(C) && !s)
+        if (!q(k) && !s)
           break;
         const I = Vt(await L[D](S, e), M, D);
-        I && (C = {
+        I && (k = {
           ...I,
           ...oe(D, I.message)
-        }, f(I.message), s && (d[w] = C));
+        }, f(I.message), s && (d[w] = k));
       }
-      if (!q(C) && (d[w] = {
+      if (!q(k) && (d[w] = {
         ref: M,
-        ...C
+        ...k
       }, !s))
         return d;
     }
@@ -650,22 +650,22 @@ function hr(t = {}) {
     }
   }, d = (a, n, o, h, _) => {
     let y = !1, A = !1;
-    const k = {
+    const C = {
       name: a
     };
     if (!r.disabled) {
       if (!o || h) {
-        (x.isDirty || g.isDirty) && (A = e.isDirty, e.isDirty = k.isDirty = se(), y = A !== k.isDirty);
+        (x.isDirty || g.isDirty) && (A = e.isDirty, e.isDirty = C.isDirty = se(), y = A !== C.isDirty);
         const T = te(m(u, a), n);
-        A = !!m(e.dirtyFields, a), T ? B(e.dirtyFields, a) : R(e.dirtyFields, a, !0), k.dirtyFields = e.dirtyFields, y = y || (x.dirtyFields || g.dirtyFields) && A !== !T;
+        A = !!m(e.dirtyFields, a), T ? B(e.dirtyFields, a) : R(e.dirtyFields, a, !0), C.dirtyFields = e.dirtyFields, y = y || (x.dirtyFields || g.dirtyFields) && A !== !T;
       }
       if (o) {
         const T = m(e.touchedFields, a);
-        T || (R(e.touchedFields, a, o), k.touchedFields = e.touchedFields, y = y || (x.touchedFields || g.touchedFields) && T !== o);
+        T || (R(e.touchedFields, a, o), C.touchedFields = e.touchedFields, y = y || (x.touchedFields || g.touchedFields) && T !== o);
       }
-      y && _ && F.state.next(k);
+      y && _ && F.state.next(C);
     }
-    return y ? k : {};
+    return y ? C : {};
   }, p = (a, n, o, h) => {
     const _ = m(e.errors, a), y = (x.isValid || g.isValid) && K(n) && e.isValid !== n;
     if (r.delayError && o ? (V = L(() => S(a, o)), V(r.delayError)) : (clearTimeout(v), V = null, o ? R(e.errors, a, o) : B(e.errors, a)), (o ? !te(_, o) : _) || !q(h) || y) {
@@ -702,12 +702,12 @@ function hr(t = {}) {
       if (_) {
         const { _f: y, ...A } = _;
         if (y) {
-          const k = l.array.has(y.name), T = _._f && cr(_._f);
+          const C = l.array.has(y.name), T = _._f && cr(_._f);
           T && x.validatingFields && N([y.name], !0);
-          const J = await Ge(_, l.disabled, i, $, r.shouldUseNativeValidation && !n, k);
+          const J = await Ge(_, l.disabled, i, $, r.shouldUseNativeValidation && !n, C);
           if (T && x.validatingFields && N([y.name]), J[y.name] && (o.valid = !1, n))
             break;
-          !n && (m(J, y.name) ? k ? Tt(e.errors, J, y.name) : R(e.errors, y.name, J[y.name]) : B(e.errors, y.name));
+          !n && (m(J, y.name) ? C ? Tt(e.errors, J, y.name) : R(e.errors, y.name, J[y.name]) : B(e.errors, y.name));
         }
         !q(A) && await W(A, n, o);
       }
@@ -716,10 +716,10 @@ function hr(t = {}) {
   }, oe = () => {
     for (const a of l.unMount) {
       const n = m(s, a);
-      n && (n._f.refs ? n._f.refs.every((o) => !Ue(o)) : !Ue(n._f.ref)) && ke(a);
+      n && (n._f.refs ? n._f.refs.every((o) => !Ue(o)) : !Ue(n._f.ref)) && Ce(a);
     }
     l.unMount = /* @__PURE__ */ new Set();
-  }, se = (a, n) => !r.disabled && (a && n && R(i, a, n), !te(Fe(), u)), C = (a, n, o) => He(a, l, {
+  }, se = (a, n) => !r.disabled && (a && n && R(i, a, n), !te(Fe(), u)), k = (a, n, o) => He(a, l, {
     ...c.mount ? i : O(n) ? u : Y(a) ? { [a]: n } : n
   }, o, n), D = (a) => we(m(c.mount ? i : u, a, r.shouldUnregister ? m(u, a, []) : [])), I = (a, n, o = {}) => {
     const h = m(s, a);
@@ -727,7 +727,7 @@ function hr(t = {}) {
     if (h) {
       const y = h._f;
       y && (!y.disabled && R(i, a, Dt(n, y)), _ = xe(y.ref) && G(n) ? "" : n, wt(y.ref) ? [...y.ref.options].forEach((A) => A.selected = _.includes(A.value)) : y.refs ? ve(y.ref) ? y.refs.forEach((A) => {
-        (!A.defaultChecked || !A.disabled) && (Array.isArray(_) ? A.checked = !!_.find((k) => k === A.value) : A.checked = _ === A.value || !!_);
+        (!A.defaultChecked || !A.disabled) && (Array.isArray(_) ? A.checked = !!_.find((C) => C === A.value) : A.checked = _ === A.value || !!_);
       }) : y.refs.forEach((A) => A.checked = A.value === _) : Xe(y.ref) ? y.ref.value = "" : (y.ref.value = _, y.ref.type || F.state.next({
         name: a,
         values: U(i)
@@ -760,10 +760,10 @@ function hr(t = {}) {
     let o = n.name, h = !0;
     const _ = m(s, o), y = (T) => {
       h = Number.isNaN(T) || le(T) && isNaN(T.getTime()) || te(T, m(i, o, T));
-    }, A = ye(r.mode), k = ye(r.reValidateMode);
+    }, A = ye(r.mode), C = ye(r.reValidateMode);
     if (_) {
       let T, J;
-      const be = n.type ? gt(_._f) : pt(a), ie = a.type === pe.BLUR || a.type === pe.FOCUS_OUT, Ht = !dr(_._f) && !r.resolver && !m(e.errors, o) && !_._f.deps || mr(ie, m(e.touchedFields, o), e.isSubmitted, k, A), Te = Qe(o, l, ie);
+      const be = n.type ? gt(_._f) : pt(a), ie = a.type === pe.BLUR || a.type === pe.FOCUS_OUT, Ht = !dr(_._f) && !r.resolver && !m(e.errors, o) && !_._f.deps || mr(ie, m(e.touchedFields, o), e.isSubmitted, C, A), Te = Qe(o, l, ie);
       R(i, o, be), ie ? (!n || !n.readOnly) && (_._f.onBlur && _._f.onBlur(a), V && V(0)) : _._f.onChange && _._f.onChange(a);
       const Oe = d(o, be, ie), qt = !q(Oe) || Te;
       if (!ie && F.state.next({
@@ -816,7 +816,7 @@ function hr(t = {}) {
       errors: a ? e.errors : {}
     });
   }, rt = (a, n, o) => {
-    const h = (m(s, a, { _f: {} })._f || {}).ref, _ = m(e.errors, a) || {}, { ref: y, message: A, type: k, ...T } = _;
+    const h = (m(s, a, { _f: {} })._f || {}).ref, _ = m(e.errors, a) || {}, { ref: y, message: A, type: C, ...T } = _;
     R(e.errors, a, {
       ...T,
       ...n,
@@ -827,8 +827,8 @@ function hr(t = {}) {
       isValid: !1
     }), o && o.shouldFocus && h && h.focus && h.focus();
   }, Mt = (a, n) => re(a) ? F.state.subscribe({
-    next: (o) => "values" in o && a(C(void 0, n), o)
-  }) : C(a, n, !0), st = (a) => F.state.subscribe({
+    next: (o) => "values" in o && a(k(void 0, n), o)
+  }) : k(a, n, !0), st = (a) => F.state.subscribe({
     next: (n) => {
       yr(a.name, n.name, a.exact) && fr(n, a.formState || x, $t, a.reRenderRoot) && a.callback({
         values: { ...i },
@@ -843,7 +843,7 @@ function hr(t = {}) {
   }, st({
     ...a,
     formState: g
-  })), ke = (a, n = {}) => {
+  })), Ce = (a, n = {}) => {
     for (const o of a ? z(a) : l.mount)
       l.mount.delete(o), l.array.delete(o), n.keepValue || (B(s, o), B(i, o)), !n.keepError && B(e.errors, o), !n.keepDirty && B(e.dirtyFields, o), !n.keepTouched && B(e.touchedFields, o), !n.keepIsValidating && B(e.validatingFields, o), !r.shouldUnregister && !n.keepDefaultValue && B(u, o);
     F.state.next({
@@ -884,15 +884,15 @@ function hr(t = {}) {
       ref: (_) => {
         if (_) {
           De(a, n), o = m(s, a);
-          const y = O(_.value) && _.querySelectorAll && _.querySelectorAll("input,select,textarea")[0] || _, A = nr(y), k = o._f.refs || [];
-          if (A ? k.find((T) => T === y) : y === o._f.ref)
+          const y = O(_.value) && _.querySelectorAll && _.querySelectorAll("input,select,textarea")[0] || _, A = nr(y), C = o._f.refs || [];
+          if (A ? C.find((T) => T === y) : y === o._f.ref)
             return;
           R(s, a, {
             _f: {
               ...o._f,
               ...A ? {
                 refs: [
-                  ...k.filter(Ue),
+                  ...C.filter(Ue),
                   y,
                   ...Array.isArray(m(u, a)) ? [{}] : []
                 ],
@@ -954,14 +954,14 @@ function hr(t = {}) {
           ...l.mount,
           ...Object.keys(fe(u, i))
         ]);
-        for (const k of Array.from(A))
-          m(e.dirtyFields, k) ? R(y, k, m(i, k)) : Q(k, m(y, k));
+        for (const C of Array.from(A))
+          m(e.dirtyFields, C) ? R(y, C, m(i, C)) : Q(C, m(y, C));
       } else {
         if (ze && O(a))
           for (const A of l.mount) {
-            const k = m(s, A);
-            if (k && k._f) {
-              const T = Array.isArray(k._f.refs) ? k._f.refs[0] : k._f.ref;
+            const C = m(s, A);
+            if (C && C._f) {
+              const T = Array.isArray(C._f.refs) ? C._f.refs[0] : C._f.ref;
               if (xe(T)) {
                 const J = T.closest("form");
                 if (J) {
@@ -1016,14 +1016,14 @@ function hr(t = {}) {
   }, ot = {
     control: {
       register: De,
-      unregister: ke,
+      unregister: Ce,
       getFieldState: tt,
       handleSubmit: nt,
       setError: rt,
       _subscribe: st,
       _runSchema: E,
       _focusError: Re,
-      _getWatch: C,
+      _getWatch: k,
       _getDirty: se,
       _setValid: w,
       _setFieldArray: H,
@@ -1084,7 +1084,7 @@ function hr(t = {}) {
     reset: ut,
     resetField: Pt,
     clearErrors: Lt,
-    unregister: ke,
+    unregister: Ce,
     setError: rt,
     setFocus: Wt,
     getFieldState: tt
@@ -1130,7 +1130,7 @@ var We = (t, r) => O(r) ? [] : vr(t, z(r).sort((e, s) => e - s)), $e = (t, r, e)
 }, Ft = (t, r, e) => (t[r] = e, t);
 function Vr(t) {
   const r = Ve(), { control: e = r.control, name: s, keyName: u = "id", shouldUnregister: i, rules: c } = t, [l, V] = b.useState(e._getFieldArray(s)), v = b.useRef(e._getFieldArray(s).map(ue)), x = b.useRef(!1);
-  e._names.array.add(s), b.useMemo(() => c && l.length >= 0 && e.register(s, c), [e, s, l.length, c]), Ce(() => e._subjects.array.subscribe({
+  e._names.array.add(s), b.useMemo(() => c && l.length >= 0 && e.register(s, c), [e, s, l.length, c]), ke(() => e._subjects.array.subscribe({
     next: ({ values: f, name: d }) => {
       if (d === s || !d) {
         const p = m(f, s);
@@ -1260,7 +1260,7 @@ function Fr(t = {}) {
       };
     }
   const i = r.current.control;
-  return i._options = t, Ce(() => {
+  return i._options = t, ke(() => {
     const c = i._subscribe({
       formState: i._proxyFormState,
       callback: () => u({ ...i._formState }),
@@ -1335,19 +1335,14 @@ const pr = ({
   children: t,
   visibility: r
 }) => {
-  const e = he(() => typeof r == "boolean" ? [] : (r == null ? void 0 : r.conditions.map((i) => i.name)) || [], [r]), s = Je({ name: e }), u = he(() => typeof r == "boolean" ? r : !r || (r == null ? void 0 : r.conditions.length) === 0 ? !0 : Ut(e, s, r), [r, e, s]);
-  return console.log(
-    "ConditionChecker - evaluateCondition:",
-    u,
-    "namesToWatch:",
-    e
-  ), u ? t : null;
+  const e = he(() => typeof r == "boolean" ? [] : (r == null ? void 0 : r.conditions.map((i) => i.name)) || [], [r]), s = Je({ name: e });
+  return he(() => typeof r == "boolean" ? r : !r || (r == null ? void 0 : r.conditions.length) === 0 ? !0 : Ut(e, s, r), [r, e, s]) ? t : null;
 }, xr = ({
   children: t,
   disabled: r
 }) => {
   const e = he(() => typeof r == "boolean" ? [] : (r == null ? void 0 : r.conditions.map((i) => i.name)) || [], [r]), s = Je({ name: e }), u = he(() => typeof r == "boolean" ? r : !r || (r == null ? void 0 : r.conditions.length) === 0 ? !1 : Ut(e, s, r), [r, e, s]);
-  return console.log("DisabilityChecker - isDisabled:", u, "namesToWatch:", e), Ae(t, { ...t.props, disabled: u });
+  return Ae(t, { ...t.props, disabled: u });
 }, Nt = ({
   children: t,
   onSubmit: r = () => {