@reformer/core 11.0.0-beta.5 → 11.0.0-beta.7

package/dist/behaviors.js

@@ -1,31 +1,31 @@
 import { effect as j } from "@preact/signals-core";
-import { d as $, a as C, w as F, t as M, r as O, s as A, b as D } from "./behaviors-value-C7dSEhCc.js";
-import { i as G, m as k, u as x } from "./model-signals-proxy-mV3WGdlO.js";
-import { e as T } from "./node-DGEFMTQu.js";
-let p = null;
-function P(e) {
-  if (!p)
+import { d as k, a as A, w as $, t as C, r as O, s as D, b as G } from "./behaviors-value-C7dSEhCc.js";
+import { d as T, i as I, m as x, u as P } from "./model-signals-proxy-2vqS243J.js";
+import { e as R } from "./node-DGEFMTQu.js";
+let h = null;
+function B(e) {
+  if (!h)
     throw new Error(
       `[@reformer/core/behaviors] "${e}" вызван вне defineFormBehavior(...) — операторы поведения можно вызывать только внутри схемы.`
     );
-  return p;
+  return h;
 }
-function s(e) {
-  P("onDispose").cleanups.push(e);
+function a(e) {
+  B("onDispose").cleanups.push(e);
 }
-function y() {
-  const e = P("getScope");
+function p() {
+  const e = B("getScope");
   return { model: e.model, form: e.form };
 }
-function I(e) {
+function q(e) {
   return {
     __run(t, n) {
-      const o = { cleanups: [], model: t, form: n }, r = p;
-      p = o;
+      const o = { cleanups: [], model: t, form: n }, r = h;
+      h = o;
       try {
         e({ model: t, form: n });
       } finally {
-        p = r;
+        h = r;
       }
       return () => {
         for (const c of o.cleanups) c();
@@ -33,28 +33,28 @@ function I(e) {
     }
   };
 }
-function h(e) {
-  s(j(e));
+function m(e) {
+  a(j(e));
 }
 function g(e) {
-  $(e);
+  k(e);
 }
-const m = (e) => typeof e == "object" && e !== null && typeof e.peek == "function" && !G(e), B = (e) => Array.isArray(e) ? e : [e];
-function E(e) {
+const _ = (e) => typeof e == "object" && e !== null && typeof e.peek == "function" && !I(e), b = (e) => _(e) || T(e), E = (e) => Array.isArray(e) ? e : [e];
+function S(e) {
   const t = {};
   for (const n of Object.keys(e)) {
     const o = e[n];
-    t[n] = m(o) ? o.value : E(o);
+    t[n] = b(o) ? o.value : S(o);
   }
   return t;
 }
-function W(e, t) {
+function V(e, t) {
   for (const n of Object.keys(e)) {
     const o = e[n];
-    m(o) ? o.value = t?.[n] : W(o, t?.[n] ?? {});
+    b(o) ? o.value = t?.[n] : V(o, t?.[n] ?? {});
   }
 }
-function S(e) {
+function W(e) {
   return (t) => {
     try {
       t();
@@ -69,18 +69,18 @@ function S(e) {
     }
   };
 }
-function _(e, t) {
+function F(e, t) {
   return t.split(".").reduce((n, o) => n?.[o], e);
 }
-function R(e) {
+function z(e) {
   if (!e) return;
-  const { form: t } = y();
+  const { form: t } = p();
   return t.getFieldByPath(e);
 }
-function X(e, t, n) {
-  k(e), s(() => x(e));
-  const o = S(e);
-  h(() => {
+function Z(e, t, n) {
+  x(e), a(() => P(e));
+  const o = W(e);
+  m(() => {
     if (n?.when && !n.when()) return;
     const r = t();
     e.peek() !== r && o(() => {
@@ -88,11 +88,11 @@ function X(e, t, n) {
     });
   });
 }
-function Y(e, t, n, o) {
-  k(t), s(() => x(t));
-  const r = S(t);
-  h(() => {
-    const c = e.map((f) => f.value);
+function ee(e, t, n, o) {
+  x(t), a(() => P(t));
+  const r = W(t);
+  m(() => {
+    const c = e.map((s) => s.value);
     if (o?.when && !o.when(...c)) return;
     const i = n(...c);
     t.peek() !== i && r(() => {
@@ -100,70 +100,70 @@ function Y(e, t, n, o) {
     });
   });
 }
-function Z(e, t, n) {
-  if (m(e) && m(t)) {
-    s(C(e, t, n));
+function ne(e, t, n) {
+  if (b(e) && b(t)) {
+    a(A(e, t, n));
     return;
   }
   const o = e, r = t;
-  h(() => {
-    const c = E(o);
-    n?.when && !n.when() || g(() => W(r, c));
+  m(() => {
+    const c = S(o);
+    n?.when && !n.when() || g(() => V(r, c));
   });
 }
-function q(e, t, n) {
+function H(e, t, n) {
   let o;
   const r = (c) => {
     o?.abort(), o = new AbortController();
     const { signal: i } = o;
-    $(() => t(c, { signal: i }));
+    k(() => t(c, { signal: i }));
   };
   if (!n?.debounce)
-    s(F(e, r, { immediate: n?.immediate }));
+    a($(e, r, { immediate: n?.immediate }));
   else {
     let c;
-    const i = F(
+    const i = $(
       e,
-      (f) => {
-        c && clearTimeout(c), c = setTimeout(() => r(f), n.debounce);
+      (s) => {
+        c && clearTimeout(c), c = setTimeout(() => r(s), n.debounce);
       },
       { immediate: n?.immediate }
     );
-    s(() => {
+    a(() => {
       c && clearTimeout(c), i();
     });
   }
-  s(() => o?.abort());
+  a(() => o?.abort());
 }
-function z(e, t, n) {
-  for (const o of B(e))
-    m(o) ? s(T(o, t, n)) : L(o, t, n);
+function L(e, t, n) {
+  for (const o of E(e))
+    _(o) ? a(R(o, t, n)) : N(o, t, n);
 }
-function ee(e, t, n) {
-  z(e, () => !t(), n);
+function te(e, t, n) {
+  L(e, () => !t(), n);
 }
-function L(e, t, n) {
-  const o = R(e.__path);
-  o && h(() => {
+function N(e, t, n) {
+  const o = z(e.__path);
+  o && m(() => {
     const r = t();
     g(() => {
       r ? o.enable() : (o.disable(), n?.resetOnDisable && o.reset());
     });
   });
 }
-function ne(e, t) {
-  s(M(e, t));
+function oe(e, t) {
+  a(C(e, t));
 }
-function te(e, t, n) {
-  s(O(e, t, n));
+function re(e, t, n) {
+  a(O(e, t, n));
 }
-function oe(e, t, n) {
-  s(A(e, t, n));
+function ce(e, t, n) {
+  a(D(e, t, n));
 }
-function re(e, t) {
-  s(D(e, t));
+function ie(e, t) {
+  a(G(e, t));
 }
-function V(e) {
+function M(e) {
   return new Proxy(
     {},
     {
@@ -172,12 +172,12 @@ function V(e) {
         if (typeof n != "string") return;
         const o = e[n];
         if (o != null)
-          return m(o) ? o.value : V(o);
+          return _(o) ? o.value : M(o);
       }
     }
   );
 }
-function N(e) {
+function J(e) {
   return new Proxy(
     {},
     {
@@ -192,28 +192,28 @@ function N(e) {
     }
   );
 }
-function H(e, t) {
-  const { model: n, form: o } = y(), r = e.__path;
+function K(e, t) {
+  const { model: n, form: o } = p(), r = e.__path;
   if (!r) return;
-  const c = _(n, r);
+  const c = F(n, r);
   if (!c) return;
   const i = o.getFieldByPath(
     r
-  ), f = i?.length, a = /* @__PURE__ */ new Map();
-  h(() => {
-    const d = f ? f.value : c.length, w = /* @__PURE__ */ new Set();
+  ), s = i?.length, f = /* @__PURE__ */ new Map();
+  m(() => {
+    const d = s ? s.value : c.length, y = /* @__PURE__ */ new Set();
     for (let u = 0; u < d; u++) {
       const l = c.at(u);
-      if (l != null && (w.add(l), !a.has(l))) {
-        const b = i?.at?.(u) ?? N(r);
-        a.set(l, t.__run(l, b));
+      if (l != null && (y.add(l), !f.has(l))) {
+        const w = i?.at?.(u) ?? J(r);
+        f.set(l, t.__run(l, w));
       }
     }
-    for (const [u, l] of a)
-      w.has(u) || (l(), a.delete(u));
-  }), s(() => {
-    for (const d of a.values()) d();
-    a.clear();
+    for (const [u, l] of f)
+      y.has(u) || (l(), f.delete(u));
+  }), a(() => {
+    for (const d of f.values()) d();
+    f.clear();
   });
 }
 function v(e) {
@@ -226,19 +226,19 @@ function v(e) {
   }
   for (const n of Object.keys(e)) v(e[n]);
 }
-function ce(e, t) {
-  const { model: n } = y(), o = e.__path;
+function se(e, t) {
+  const { model: n } = p(), o = e.__path;
   if (!o) return;
-  const r = _(n, o);
-  r && H(
+  const r = F(n, o);
+  r && K(
     e,
-    I(({ model: c }) => {
-      q(t(c), (i) => {
+    q(({ model: c }) => {
+      H(t(c), (i) => {
         if (i)
-          for (let f = 0; f < r.length; f++) {
-            const a = r.at(f);
-            if (a && a !== c) {
-              const d = t(a);
+          for (let s = 0; s < r.length; s++) {
+            const f = r.at(s);
+            if (f && f !== c) {
+              const d = t(f);
               d.peek() && (d.value = !1);
             }
           }
@@ -246,24 +246,24 @@ function ce(e, t) {
     })
   );
 }
-function ie(e, t) {
-  const { model: n } = y(), o = e.__path;
+function ae(e, t) {
+  const { model: n } = p(), o = e.__path;
   if (!o) return;
-  const r = _(n, o);
+  const r = F(n, o);
   if (!r) return;
   let c = !1, i = 0;
-  h(() => {
+  m(() => {
     v(r), !c && (c = !0, g(() => {
       c = !1;
-      const f = t(r.toArray());
-      let a = !1;
-      for (const { index: d, patch: w } of f) {
+      const s = t(r.toArray());
+      let f = !1;
+      for (const { index: d, patch: y } of s) {
         const u = r.at(d);
         if (u)
-          for (const [l, b] of Object.entries(w))
-            u[l] !== b && (u[l] = b, a = !0);
+          for (const [l, w] of Object.entries(y))
+            u[l] !== w && (u[l] = w, f = !0);
       }
-      if (i = a ? i + 1 : 0, i > 50)
+      if (i = f ? i + 1 : 0, i > 50)
         throw i = 0, new Error(
           `[@reformer/core/behaviors] aggregateInto("${o}"): запись не сходится (>50 проходов) — derive должна быть идемпотентной на фикспоинте.`
         );
@@ -271,32 +271,32 @@ function ie(e, t) {
   });
 }
 function fe(e, t) {
-  const { form: n } = y();
-  for (const o of B(e)) {
+  const { form: n } = p();
+  for (const o of E(e)) {
     const r = o, c = r.__path;
     if (!c) continue;
-    const i = n ? n.getFieldByPath(c) : void 0, f = i ? i.getProxy?.() ?? i : void 0;
-    s(t.__run(V(r), f));
+    const i = n ? n.getFieldByPath(c) : void 0, s = i ? i.getProxy?.() ?? i : void 0;
+    a(t.__run(M(r), s));
   }
 }
 export {
-  ie as aggregateInto,
+  ae as aggregateInto,
   fe as apply,
-  H as applyEach,
-  X as compute,
-  Y as computeFrom,
-  Z as copyFrom,
+  K as applyEach,
+  Z as compute,
+  ee as computeFrom,
+  ne as copyFrom,
   g as defer,
-  I as defineFormBehavior,
-  ee as disableWhen,
-  h as effect,
-  z as enableWhen,
-  ce as exclusiveFlag,
-  y as getScope,
-  q as onChange,
-  s as onDispose,
-  te as resetWhen,
-  re as revalidateWhen,
-  oe as syncFields,
-  ne as transformValue
+  q as defineFormBehavior,
+  te as disableWhen,
+  m as effect,
+  L as enableWhen,
+  se as exclusiveFlag,
+  p as getScope,
+  H as onChange,
+  a as onDispose,
+  re as resetWhen,
+  ie as revalidateWhen,
+  ce as syncFields,
+  oe as transformValue
 };

package/dist/create-model-B8U-COv-.js

@@ -0,0 +1,103 @@
+import { s as p, r as g, c as u, G as v } from "./model-signals-proxy-2vqS243J.js";
+function r(t) {
+  if (t)
+    return t.kind === "group" ? d(t) : t.kind === "array" ? w(t) : t.read();
+}
+function w(t) {
+  const i = {
+    get length() {
+      return t.items.value.length;
+    },
+    push: (e) => t.push(e),
+    insertAt: (e, n) => t.insertAt(e, n),
+    removeAt: (e) => t.removeAt(e),
+    move: (e, n) => t.move(e, n),
+    swap: (e, n) => t.swap(e, n),
+    clear: () => t.clear(),
+    at: (e) => r(t.items.value[e]),
+    map: (e) => t.items.value.map((n, s) => e(r(n), s)),
+    forEach: (e) => t.items.value.forEach((n, s) => e(r(n), s)),
+    toArray: () => t.peek(),
+    [Symbol.iterator]: function* () {
+      const e = t.items.value;
+      for (let n = 0; n < e.length; n++) yield r(e[n]);
+    }
+  };
+  return new Proxy(i, {
+    get: (e, n, s) => n === "__path" ? t.path : typeof n == "string" && u(n) ? r(t.items.value[Number(n)]) : Reflect.get(e, n, s),
+    has: (e, n) => typeof n == "string" && u(n) ? Number(n) < t.items.value.length : Reflect.has(e, n)
+  });
+}
+const h = /* @__PURE__ */ new Set([
+  "$",
+  "get",
+  "set",
+  "patch",
+  "isDirty",
+  "reset",
+  "captureInitial",
+  "signalAt"
+]), m = /* @__PURE__ */ new WeakMap(), o = /* @__PURE__ */ new WeakMap();
+function d(t) {
+  const i = m.get(t);
+  if (i) return i;
+  const e = {
+    $: p(t),
+    get: () => t.peek(),
+    set: (s) => t.set(s),
+    patch: (s) => t.set(s),
+    isDirty: () => t.dirty(),
+    reset: () => t.resetToInitial(),
+    captureInitial: () => t.captureInitial(),
+    signalAt: (s) => g(t, s)
+  }, n = new Proxy(
+    {},
+    {
+      get: (s, a) => {
+        if (a === "__path") return t.path;
+        if (typeof a != "string") return;
+        const c = t.children.get(a);
+        if (c) return r(c);
+        if (h.has(a)) return e[a];
+      },
+      set: (s, a, c) => {
+        if (typeof a != "string") return !1;
+        const f = t.children.get(a);
+        return f ? (f.set(c), !0) : !1;
+      },
+      has: (s, a) => typeof a == "string" && (t.children.has(a) || h.has(a)),
+      ownKeys: () => [...t.children.keys()],
+      getOwnPropertyDescriptor: (s, a) => typeof a == "string" && t.children.has(a) ? { enumerable: !0, configurable: !0 } : void 0
+    }
+  );
+  return m.set(t, n), o.set(n, t), n;
+}
+function l(t, i, e) {
+  if (t.kind === "leaf") {
+    i(t.signal);
+    return;
+  }
+  if (t.kind === "group") {
+    for (const n of t.children.values()) l(n, i, e);
+    return;
+  }
+  e && i(p(t));
+  for (const n of t.items.value) l(n, i, e);
+}
+function x(t, i) {
+  const e = o.get(t);
+  e && l(e, i, !1);
+}
+function y(t, i) {
+  const e = o.get(t);
+  e && l(e, i, !0);
+}
+function A(t) {
+  const i = new v(t, "");
+  return d(i);
+}
+export {
+  y as a,
+  A as c,
+  x as e
+};

package/dist/en-CjAqn7h0.js

@@ -0,0 +1,41 @@
+const a = {
+  "format.fileSize.b": "{value} B",
+  "format.fileSize.kb": "{value} KB",
+  "format.fileSize.mb": "{value} MB",
+  "format.fileSize.gb": "{value} GB",
+  "format.fileSize.tb": "{value} TB",
+  "validation.required": "This field is required",
+  "validation.pattern": "Invalid format",
+  "validation.email": "Enter a valid email address",
+  "validation.url": "Enter a valid URL",
+  "validation.url_protocol": "The URL must use one of these protocols: {allowedProtocols}",
+  "validation.phone": "Enter a valid phone number",
+  "validation.min": "Must be at least {min}",
+  "validation.max": "Must be at most {max}",
+  "validation.minLength": "Enter at least {minLength, plural, one{# character} other{# characters}}",
+  "validation.maxLength": "Enter no more than {maxLength, plural, one{# character} other{# characters}}",
+  "validation.isNumber": "Enter a number",
+  "validation.integer": "Enter a whole number",
+  "validation.multipleOf": "Must be a multiple of {multipleOf}",
+  "validation.nonNegative": "Must not be negative",
+  "validation.nonZero": "Must not be zero",
+  "validation.date_invalid": "Enter a valid date",
+  "validation.date_min": "The date must not be earlier than {minDate}",
+  "validation.date_max": "The date must not be later than {maxDate}",
+  "validation.date_past": "The date must not be in the past",
+  "validation.date_future": "The date must not be in the future",
+  "validation.date_min_age": "Age must be at least {minAge}",
+  "validation.date_max_age": "Age must be at most {maxAge}",
+  "validation.fileType": "File {fileName} has a type that is not allowed. Allowed: {accept}",
+  "validation.maxFileSize": "File {fileName} is larger than {maxFileSize}",
+  "validation.minFileSize": "File {fileName} is smaller than {minFileSize}",
+  "validation.maxFiles": "No more than {maxFiles, plural, one{# file} other{# files}}",
+  "validation.minFiles": "At least {minFiles, plural, one{# file} other{# files}}",
+  "validation.maxTotalFileSize": "The total size of the files exceeds {maxTotalFileSize}",
+  "validation.fileExists": "File {fileName} has already been added",
+  "validation.uploadAborted": "Upload cancelled",
+  "validation.uploadFailed": "Failed to upload {fileName}"
+};
+export {
+  a as m
+};

package/dist/form/behaviors/internals.d.ts

@@ -13,6 +13,15 @@ export type GroupSignals = Record<string, unknown> & {
  * read-only агрегат вместо рекурсивного `writeGroup`.
  */
 export declare const isLeafSignal: (v: unknown) => v is Signal<unknown>;
+/**
+ * Ручка значения целиком: лист либо узел-массив дерева `$`.
+ *
+ * Массив копируется и читается ЗНАЧЕНИЕМ — заменой целиком, а не обходом по ключам: у его узла
+ * собственный ключ один (`length`), и обход, годный для группы, отдавал бы вместо массива мусор.
+ * Для `enableWhen` массив при этом остаётся НЕ листом ({@link isLeafSignal}): его нода ищется по
+ * пути, а она бывает и полем, и массивом под-форм.
+ */
+export declare const isValueHandle: (v: unknown) => v is Signal<unknown>;
 export declare const asArray: <X>(v: X | X[]) => X[];
 export declare function readGroup(g: GroupSignals): Record<string, unknown>;
 export declare function writeGroup(g: GroupSignals, val: Record<string, unknown>): void;

package/dist/form/create-form.d.ts

@@ -52,9 +52,9 @@ export interface CreateFormFromModelArgs<T> {
  *   component: Section,
  *   children: [
  *     // Layout несёт только component/componentProps; правила — в отдельной ValidationSchema.
- *     { value: model.$.email, component: InputField },
+ *     { value: model.$.email, component: Input },
  *     // вложенная группа: `model.$.profile.name` (≡ под-модель `model.profile.$.name` — тот же сигнал)
- *     { value: model.$.profile.name, component: InputField },
+ *     { value: model.$.profile.name, component: Input },
  *   ],
  * };
  *
@@ -93,8 +93,8 @@ export declare function createFormFromModel<T>(args: CreateFormFromModelArgs<T>)
  * // Layout-схема НЕ несёт validators — только component/componentProps.
  * const schema = {
  *   children: [
- *     { value: model.$.email, component: InputField },
- *     { value: model.$.password, component: InputField },
+ *     { value: model.$.email, component: Input },
+ *     { value: model.$.password, component: Input },
  *   ],
  * };
  *
@@ -125,8 +125,8 @@ export declare function createForm<T>(config: GroupNodeConfig<T>): FormProxy<T>;
  * @example Legacy (back-compat) — плоская схема без модели
  * ```typescript
  * const form = createForm<UserForm>({
- *   email: { value: '', component: InputField },
- *   password: { value: '', component: InputField },
+ *   email: { value: '', component: Input },
+ *   password: { value: '', component: Input },
  * });
  * ```
  */