palistor 0.0.25 → 0.0.27

package/dist/store/compute/recompute/recomputeLeaves.d.ts

@@ -4,20 +4,21 @@ import type { ComputeEntry } from "../../store/registerNodes";
 import { type ValuesCache } from "../../valuesCache/valuesCache";
 import type { TrackingWrap } from "./types";
 /**
- * Пересчитать вычисленное состояние для заданного списка листовых узлов.
+ * Recompute the computed state for a given list of leaf nodes.
  *
- * Фаза 1: Пересчитать computed-значения (value — функция) в топологическом порядке.
- * Фаза 2: Пересчитать FieldState (isVisible, isRequired, error…) для всех полей.
+ * Phase 1: recompute computed values (value is a function) in topological order.
+ * Phase 2: recompute FieldState (isVisible, isRequired, error…) for all fields.
  *
- * Каждый узел получает group-scoped values — значения Parent-группы из nodeSlot.
- * Это позволяет конфигу писать функции в терминах своей группы (без навигации
- * от корня), даже когда конфиг вложен в глобальный store.
- * Для кросс-групповых зависимостей используется явная навигация через объект parent.
+ * Each node receives group-scoped values — the parent group's values from
+ * nodeSlot. This lets a config write functions in terms of its own group
+ * (no navigation from the root), even when the config is nested inside a
+ * global store. Cross-group dependencies use explicit navigation through the
+ * parent object.
  *
- * @param trackingWrap — опциональная обёртка для отслеживания кросс-групповых зависимостей.
- *                       Если передана, group-scoped values оборачиваются через неё.
+ * @param trackingWrap — optional wrapper for tracking cross-group dependencies.
+ *                       When provided, group-scoped values are wrapped by it.
  *
- * Возвращает Set узлов, чьё состояние изменилось (для notify).
+ * Returns the Set of nodes whose state changed (for notify).
  */
 export declare function recomputeLeaves(computeNodes: ComputeEntry[], nodeState: WeakMap<object, FieldState>, valuesCache: ValuesCache, translate: TranslateFn, trackingWrap?: TrackingWrap): Set<object>;
 //# sourceMappingURL=recomputeLeaves.d.ts.map

package/dist/store/compute/recompute/recomputeLeaves.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recomputeLeaves.d.ts","sourceRoot":"","sources":["../../../../store/compute/recompute/recomputeLeaves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,UAAU,EAAwC,MAAM,UAAU,CAAC;AACjF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAA0B,KAAK,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAEzF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,eAAe,CAC7B,YAAY,EAAE,YAAY,EAAE,EAC5B,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,EACtC,WAAW,EAAE,WAAW,EACxB,SAAS,EAAE,WAAW,EACtB,YAAY,CAAC,EAAE,YAAY,GAC1B,GAAG,CAAC,MAAM,CAAC,CA8Db"}
+{"version":3,"file":"recomputeLeaves.d.ts","sourceRoot":"","sources":["../../../../store/compute/recompute/recomputeLeaves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,UAAU,EAAwC,MAAM,UAAU,CAAC;AACjF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAA0B,KAAK,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAEzF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,eAAe,CAC7B,YAAY,EAAE,YAAY,EAAE,EAC5B,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,EACtC,WAAW,EAAE,WAAW,EACxB,SAAS,EAAE,WAAW,EACtB,YAAY,CAAC,EAAE,YAAY,GAC1B,GAAG,CAAC,MAAM,CAAC,CA4Db"}

package/dist/store/compute/recompute/recomputeLeaves.js

@@ -2,60 +2,60 @@ import { computeFieldState, fieldStateChanged } from "../index";
 import { updateValuesCacheEntry } from "../../valuesCache/valuesCache";
 import { topologicalSortComputed } from "./topologicalSortComputed";
 /**
- * Пересчитать вычисленное состояние для заданного списка листовых узлов.
+ * Recompute the computed state for a given list of leaf nodes.
  *
- * Фаза 1: Пересчитать computed-значения (value — функция) в топологическом порядке.
- * Фаза 2: Пересчитать FieldState (isVisible, isRequired, error…) для всех полей.
+ * Phase 1: recompute computed values (value is a function) in topological order.
+ * Phase 2: recompute FieldState (isVisible, isRequired, error…) for all fields.
  *
- * Каждый узел получает group-scoped values — значения Parent-группы из nodeSlot.
- * Это позволяет конфигу писать функции в терминах своей группы (без навигации
- * от корня), даже когда конфиг вложен в глобальный store.
- * Для кросс-групповых зависимостей используется явная навигация через объект parent.
+ * Each node receives group-scoped values — the parent group's values from
+ * nodeSlot. This lets a config write functions in terms of its own group
+ * (no navigation from the root), even when the config is nested inside a
+ * global store. Cross-group dependencies use explicit navigation through the
+ * parent object.
  *
- * @param trackingWrap — опциональная обёртка для отслеживания кросс-групповых зависимостей.
- *                       Если передана, group-scoped values оборачиваются через неё.
+ * @param trackingWrap — optional wrapper for tracking cross-group dependencies.
+ *                       When provided, group-scoped values are wrapped by it.
  *
- * Возвращает Set узлов, чьё состояние изменилось (для notify).
+ * Returns the Set of nodes whose state changed (for notify).
  */
 export function recomputeLeaves(computeNodes, nodeState, valuesCache, translate, trackingWrap) {
-    // ── Фаза 1: Пересчёт computed-значений ──────────────────────────────────
+    // ── Phase 1: recompute computed values ───────────────────────────────────
     const computedEntries = computeNodes.filter(({ node }) => typeof node.value === "function");
     const changed = new Set();
     if (computedEntries.length > 0) {
         const sorted = topologicalSortComputed(computedEntries);
         for (const { node } of sorted) {
-            // Получаем group-scoped values: parent-объект из nodeSlot, чтобы computed-функция
-            // работала в терминах своей группы, а не глобального корня.
+            // Group-scoped values: the parent object from nodeSlot, so the computed
+            // function works in terms of its group rather than the global root.
             const groupValues = valuesCache.nodeSlot.get(node)?.parent ?? valuesCache.values;
             const currentValues = trackingWrap ? trackingWrap(node, groupValues) : groupValues;
             const state = nodeState.get(node);
             if (!state)
-                continue; // Узел ещё не инициализирован — пропускаем молча; Phase 2 всё равно возьмёт prev?.value ?? "".
-            // Вычисляем новое значение, передавая в функцию текущий снапшот.
-            // node.value здесь — selector вида (values) => values.a + values.b.
+                continue; // Node not initialized yet — skip silently; Phase 2 falls back to prev?.value ?? "".
+            // Compute the new value from the current snapshot.
+            // node.value here is a selector like (values) => values.a + values.b.
             const computedValue = node.value(currentValues);
-            // Сравнение по ссылке (===): computed-функция должна возвращать стабильную ссылку,
-            // если содержимое не изменилось; иначе Phase 2 излишне пересчитает downstream-узлы.
-            // Если state отсутствует (узел ещё не инициализирован) — пропускаем молча;
-            // Phase 2 всё равно возьмёт prev?.value ?? "".
+            // Reference comparison (===): the computed function must return a stable
+            // reference when the content is unchanged; otherwise Phase 2 needlessly
+            // recomputes downstream nodes.
             if (state && state.value !== computedValue) {
                 nodeState.set(node, { ...state, value: computedValue });
-                // Мутируем valuesCache.values in-place через slot (O(1)), чтобы узлы,
-                // идущие дальше в топологическом порядке, уже видели обновлённое значение.
+                // Mutate valuesCache.values in place via the slot (O(1)) so nodes later
+                // in the topological order already see the updated value.
                 updateValuesCacheEntry(valuesCache, node, computedValue);
                 changed.add(node);
             }
         }
     }
-    // ── Фаза 2: Пересчёт FieldState (флаги, валидация, строки) ──────────────
+    // ── Phase 2: recompute FieldState (flags, validation, strings) ───────────
     for (const { node } of computeNodes) {
         const prev = nodeState.get(node);
         const currentValue = prev?.value ?? "";
         // Preserve revalidate flag: skip validation when revalidate is false
         const revalidate = prev?.revalidate ?? false;
-        // Group-scoped values: config functions получают значения своей группы,
-        // а не глобального корня, что позволяет писать isVisible/validate/value
-        // в терминах текущего контекста независимо от глубины вложенности.
+        // Group-scoped values: config functions see their own group's values, not
+        // the global root — isVisible/validate/value are written in terms of the
+        // current context regardless of nesting depth.
         const groupValues = valuesCache.nodeSlot.get(node)?.parent ?? valuesCache.values;
         const allValues = trackingWrap ? trackingWrap(node, groupValues) : groupValues;
         const next = computeFieldState(node, currentValue, allValues, revalidate, translate);
@@ -66,7 +66,6 @@ export function recomputeLeaves(computeNodes, nodeState, valuesCache, translate,
             next.dirty = prev.dirty;
         if (prev?.revalidate !== undefined)
             next.revalidate = prev.revalidate;
-        // Проверяем, изменилось ли что-то
         if (prev && !fieldStateChanged(prev, next))
             continue;
         nodeState.set(node, next);

package/dist/store/compute/recompute/recomputeLeaves.js.map

@@ -1 +1 @@
-{"version":3,"file":"recomputeLeaves.js","sourceRoot":"","sources":["../../../../store/compute/recompute/recomputeLeaves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmB,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAGjF,OAAO,EAAE,sBAAsB,EAAoB,MAAM,+BAA+B,CAAC;AACzF,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAGpE;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,eAAe,CAC7B,YAA4B,EAC5B,SAAsC,EACtC,WAAwB,EACxB,SAAsB,EACtB,YAA2B;IAE3B,2EAA2E;IAC3E,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;IAC5F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,uBAAuB,CAAC,eAAe,CAAC,CAAC;QAExD,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;YAC9B,kFAAkF;YAClF,4DAA4D;YAC5D,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,WAAW,CAAC,MAAM,CAAC;YACjF,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;YAEnF,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,SAAS,CAAC,+FAA+F;YAErH,iEAAiE;YACjE,oEAAoE;YACpE,MAAM,aAAa,GAAI,IAAI,CAAC,KAAsD,CAAC,aAAa,CAAC,CAAC;YAElG,mFAAmF;YACnF,oFAAoF;YACpF,2EAA2E;YAC3E,+CAA+C;YAC/C,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,aAAa,EAAE,CAAC;gBAC3C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;gBACxD,sEAAsE;gBACtE,2EAA2E;gBAC3E,sBAAsB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;gBACzD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,2EAA2E;IAE3E,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,YAAY,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,YAAY,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QACvC,qEAAqE;QACrE,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,KAAK,CAAC;QAC7C,wEAAwE;QACxE,wEAAwE;QACxE,mEAAmE;QACnE,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,WAAW,CAAC,MAAM,CAAC;QACjF,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAC/E,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;QAErF,mEAAmE;QACnE,IAAI,IAAI,EAAE,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACtE,IAAI,IAAI,EAAE,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvD,IAAI,IAAI,EAAE,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAEtE,kCAAkC;QAClC,IAAI,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,SAAS;QAErD,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}
+{"version":3,"file":"recomputeLeaves.js","sourceRoot":"","sources":["../../../../store/compute/recompute/recomputeLeaves.ts"],"names":[],"mappings":"AAAA,OAAO,EAAmB,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAGjF,OAAO,EAAE,sBAAsB,EAAoB,MAAM,+BAA+B,CAAC;AACzF,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAGpE;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,eAAe,CAC7B,YAA4B,EAC5B,SAAsC,EACtC,WAAwB,EACxB,SAAsB,EACtB,YAA2B;IAE3B,4EAA4E;IAC5E,MAAM,eAAe,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;IAC5F,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,uBAAuB,CAAC,eAAe,CAAC,CAAC;QAExD,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,MAAM,EAAE,CAAC;YAC9B,wEAAwE;YACxE,oEAAoE;YACpE,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,WAAW,CAAC,MAAM,CAAC;YACjF,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;YAEnF,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK;gBAAE,SAAS,CAAC,qFAAqF;YAE3G,mDAAmD;YACnD,sEAAsE;YACtE,MAAM,aAAa,GAAI,IAAI,CAAC,KAAsD,CAAC,aAAa,CAAC,CAAC;YAElG,yEAAyE;YACzE,wEAAwE;YACxE,+BAA+B;YAC/B,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,aAAa,EAAE,CAAC;gBAC3C,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC;gBACxD,wEAAwE;gBACxE,0DAA0D;gBAC1D,sBAAsB,CAAC,WAAW,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC;gBACzD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAE5E,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,YAAY,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,YAAY,GAAG,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;QACvC,qEAAqE;QACrE,MAAM,UAAU,GAAG,IAAI,EAAE,UAAU,IAAI,KAAK,CAAC;QAC7C,0EAA0E;QAC1E,yEAAyE;QACzE,+CAA+C;QAC/C,MAAM,WAAW,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,WAAW,CAAC,MAAM,CAAC;QACjF,MAAM,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAC/E,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;QAErF,mEAAmE;QACnE,IAAI,IAAI,EAAE,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACtE,IAAI,IAAI,EAAE,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvD,IAAI,IAAI,EAAE,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAEtE,IAAI,IAAI,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,SAAS;QAErD,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/store/compute/recompute/recomputeTargeted.d.ts

@@ -1,14 +1,14 @@
 import type { RecomputeTargetedDeps } from "./types";
 /**
- * Таргетированный пересчёт: вместо пересчёта ВСЕХ групп,
- * пересчитывает только затронутые группы + их реципиентов.
+ * Targeted recompute: instead of recomputing ALL groups,
+ * recomputes only the affected groups + their recipients.
  *
- * Алгоритм:
- * 1. Определить группы изменённых узлов (source groups).
- * 2. BFS по карте зависимостей: собрать все группы-реципиенты в топологическом порядке.
- * 3. Для каждой затронутой группы пересчитать только её OWN листья (не рекурсивно).
+ * Algorithm:
+ * 1. Determine the groups of the changed nodes (source groups).
+ * 2. BFS over the dependency map: collect all recipient groups in topological order.
+ * 3. For each affected group, recompute only its OWN leaves (non-recursively).
  *
- * @param changedNodes — узлы, чьи значения изменились (написанный узел + setter targets)
+ * @param changedNodes — nodes whose values changed (the written node + setter targets)
  */
 export declare function recomputeTargeted(changedNodes: Set<object>, deps: RecomputeTargetedDeps): Set<object>;
 //# sourceMappingURL=recomputeTargeted.d.ts.map

package/dist/store/compute/recompute/recomputeTargeted.js

@@ -1,25 +1,25 @@
 import { getNodeGroupPath, getRecipientGroups, resolveGroupByPath, } from "../../groupDeps/groupDeps";
 import { recomputeLeaves } from "./recomputeLeaves";
-// ─── Таргетированный пересчёт ────────────────────────────────────────────────
+// ─── Targeted recompute ──────────────────────────────────────────────────────
 /**
- * Таргетированный пересчёт: вместо пересчёта ВСЕХ групп,
- * пересчитывает только затронутые группы + их реципиентов.
+ * Targeted recompute: instead of recomputing ALL groups,
+ * recomputes only the affected groups + their recipients.
  *
- * Алгоритм:
- * 1. Определить группы изменённых узлов (source groups).
- * 2. BFS по карте зависимостей: собрать все группы-реципиенты в топологическом порядке.
- * 3. Для каждой затронутой группы пересчитать только её OWN листья (не рекурсивно).
+ * Algorithm:
+ * 1. Determine the groups of the changed nodes (source groups).
+ * 2. BFS over the dependency map: collect all recipient groups in topological order.
+ * 3. For each affected group, recompute only its OWN leaves (non-recursively).
  *
- * @param changedNodes — узлы, чьи значения изменились (написанный узел + setter targets)
+ * @param changedNodes — nodes whose values changed (the written node + setter targets)
  */
 export function recomputeTargeted(changedNodes, deps) {
     const { rootConfig, groupComputeMap, nodeState, nodeParents, nodePaths, groupDeps, valuesCache, translate, } = deps;
-    // 1. Находим группы-источники изменений
+    // 1. Find the source groups of the changes
     const sourceGroups = new Set();
     for (const node of changedNodes) {
         sourceGroups.add(getNodeGroupPath(node, nodeParents, nodePaths));
     }
-    // 2. BFS — собираем все затронутые группы в порядке "сначала доноры, потом реципиенты"
+    // 2. BFS — collect all affected groups in "donors first, then recipients" order
     const orderedGroups = [...sourceGroups];
     const visited = new Set(sourceGroups);
     let i = 0;
@@ -33,11 +33,11 @@ export function recomputeTargeted(changedNodes, deps) {
             }
         }
     }
-    // 3. Пересчитываем каждую группу (только OWN листья, не рекурсивно)
+    // 3. Recompute each group (only its OWN leaves, non-recursively)
     const allChanged = new Set();
     for (const groupPath of orderedGroups) {
         const groupNode = resolveGroupByPath(rootConfig, groupPath);
-        // Entity-группы (пути "_entity_.*") не существуют в rootConfig — пропускаем
+        // Entity groups ("_entity_.*" paths) don't exist in rootConfig — skip
         if (!groupNode)
             continue;
         const ownEntries = groupComputeMap.get(groupNode) ?? [];

package/dist/store/compute/recompute/recomputeTargeted.js.map

@@ -1 +1 @@
-{"version":3,"file":"recomputeTargeted.js","sourceRoot":"","sources":["../../../../store/compute/recompute/recomputeTargeted.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,YAAyB,EACzB,IAA2B;IAG3B,MAAM,EACJ,UAAU,EAAE,eAAe,EAC3B,SAAS,EAAE,WAAW,EAAE,SAAS,EACjC,SAAS,EAAE,WAAW,EAAE,SAAS,GAClC,GAAG,IAAI,CAAC;IAET,wCAAwC;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,YAAY,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,uFAAuF;IACvF,MAAM,aAAa,GAAa,CAAC,GAAG,YAAY,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IAEtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,UAAU,GAAG,kBAAkB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE1D,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,SAAS,IAAI,aAAa,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,kBAAkB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC5D,4EAA4E;QAC5E,IAAI,CAAC,SAAS;YAAE,SAAS;QACzB,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,eAAe,CAAC,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC/E,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC"}
+{"version":3,"file":"recomputeTargeted.js","sourceRoot":"","sources":["../../../../store/compute/recompute/recomputeTargeted.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAC/B,YAAyB,EACzB,IAA2B;IAG3B,MAAM,EACJ,UAAU,EAAE,eAAe,EAC3B,SAAS,EAAE,WAAW,EAAE,SAAS,EACjC,SAAS,EAAE,WAAW,EAAE,SAAS,GAClC,GAAG,IAAI,CAAC;IAET,2CAA2C;IAC3C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,YAAY,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,gFAAgF;IAChF,MAAM,aAAa,GAAa,CAAC,GAAG,YAAY,CAAC,CAAC;IAClD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IAEtC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,UAAU,GAAG,kBAAkB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAE1D,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACf,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,SAAS,IAAI,aAAa,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,kBAAkB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC5D,sEAAsE;QACtE,IAAI,CAAC,SAAS;YAAE,SAAS;QACzB,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,eAAe,CAAC,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC/E,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC"}

package/dist/store/compute/recompute/topologicalSortComputed.d.ts

@@ -1,10 +1,10 @@
 import type { AnyConfigNode } from "../../store/types";
 /**
- * Топологическая сортировка computed-узлов по dependencies.
+ * Topological sort of computed nodes by dependencies.
  *
- * Если computed A зависит от computed B (B.path ∈ A.dependencies),
- * B будет вычислен раньше A. Это гарантирует корректный порядок
- * при цепочках вычислений (subtotal → tax → total).
+ * If computed A depends on computed B (B.path ∈ A.dependencies),
+ * B is evaluated before A. This guarantees the correct order for
+ * computation chains (subtotal → tax → total).
  */
 export declare function topologicalSortComputed(computedEntries: Array<{
     node: AnyConfigNode;

package/dist/store/compute/recompute/topologicalSortComputed.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"topologicalSortComputed.d.ts","sourceRoot":"","sources":["../../../../store/compute/recompute/topologicalSortComputed.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEvD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,eAAe,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAC5D,KAAK,CAAC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,CA4D9C"}
+{"version":3,"file":"topologicalSortComputed.d.ts","sourceRoot":"","sources":["../../../../store/compute/recompute/topologicalSortComputed.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAEvD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,eAAe,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GAC5D,KAAK,CAAC;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,CA0D9C"}

package/dist/store/compute/recompute/topologicalSortComputed.js

@@ -1,32 +1,30 @@
 /**
- * Топологическая сортировка computed-узлов по dependencies.
+ * Topological sort of computed nodes by dependencies.
  *
- * Если computed A зависит от computed B (B.path ∈ A.dependencies),
- * B будет вычислен раньше A. Это гарантирует корректный порядок
- * при цепочках вычислений (subtotal → tax → total).
+ * If computed A depends on computed B (B.path ∈ A.dependencies),
+ * B is evaluated before A. This guarantees the correct order for
+ * computation chains (subtotal → tax → total).
  */
 export function topologicalSortComputed(computedEntries) {
     if (computedEntries.length <= 1)
         return computedEntries;
-    // Множество путей computed-узлов для быстрой проверки
+    // Set of computed node paths for fast lookup
     const computedPaths = new Set(computedEntries.map((e) => e.path));
-    // Строим граф: path → зависимости (только те, которые сами computed)
+    // Build the graph: path → dependencies (only those that are computed themselves)
     const deps = new Map();
     const entryByPath = new Map();
     for (const entry of computedEntries) {
         entryByPath.set(entry.path, entry);
         const nodeDeps = entry.node.dependencies ?? [];
-        // Оставляем только зависимости на другие computed-узлы
+        // Keep only dependencies on other computed nodes
         deps.set(entry.path, nodeDeps.filter((d) => computedPaths.has(d)));
     }
-    // Алгоритм Кана (BFS topological sort)
-    // Инвертируем: нам нужно «кто зависит от кого», а не «от кого зависит».
-    // inDeg считает входящие рёбра: если A зависит от B, то A имеет inDeg += кол-во зависимостей.
+    // Kahn's algorithm (BFS topological sort).
+    // inDeg counts incoming edges: if A depends on B, A's inDeg equals its dependency count.
     const inDeg = new Map();
     for (const path of computedPaths)
         inDeg.set(path, 0);
     for (const [path, d] of deps) {
-        // path зависит от каждого d[i] → path имеет inDeg += кол-во зависимостей
         inDeg.set(path, d.length);
     }
     const queue = [];
@@ -38,7 +36,7 @@ export function topologicalSortComputed(computedEntries) {
     while (queue.length > 0) {
         const current = queue.shift();
         sorted.push(entryByPath.get(current));
-        // Уменьшаем inDeg для всех, кто зависит от current
+        // Decrease inDeg for everything that depends on current
         for (const [path, d] of deps) {
             if (d.includes(current)) {
                 const newDeg = (inDeg.get(path) ?? 0) - 1;
@@ -48,7 +46,7 @@ export function topologicalSortComputed(computedEntries) {
             }
         }
     }
-    // Если остались узлы (циклическая зависимость) — добавляем как есть
+    // Leftover nodes (cyclic dependency) — appended as-is
     if (sorted.length < computedEntries.length) {
         for (const entry of computedEntries) {
             if (!sorted.includes(entry))

package/dist/store/compute/recompute/topologicalSortComputed.js.map

@@ -1 +1 @@
-{"version":3,"file":"topologicalSortComputed.js","sourceRoot":"","sources":["../../../../store/compute/recompute/topologicalSortComputed.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,eAA6D;IAE7D,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,eAAe,CAAC;IAExD,sDAAsD;IACtD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAElE,qEAAqE;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAiD,CAAC;IAE7E,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAI,KAAK,CAAC,IAAI,CAAC,YAAqC,IAAI,EAAE,CAAC;QACzE,uDAAuD;QACvD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,uCAAuC;IACvC,wEAAwE;IACxE,8FAA8F;IAC9F,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,aAAa;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAGrD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7B,yEAAyE;QACzE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAChC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,MAAM,GAAiD,EAAE,CAAC;IAEhE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,CAAC;QAEvC,mDAAmD;QACnD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC1C,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBACxB,IAAI,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,IAAI,MAAM,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;QAC3C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}
+{"version":3,"file":"topologicalSortComputed.js","sourceRoot":"","sources":["../../../../store/compute/recompute/topologicalSortComputed.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,eAA6D;IAE7D,IAAI,eAAe,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,eAAe,CAAC;IAExD,6CAA6C;IAC7C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAElE,iFAAiF;IACjF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAiD,CAAC;IAE7E,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;QACpC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAI,KAAK,CAAC,IAAI,CAAC,YAAqC,IAAI,EAAE,CAAC;QACzE,iDAAiD;QACjD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,2CAA2C;IAC3C,yFAAyF;IACzF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,aAAa;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAGrD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7B,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAChC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,MAAM,GAAiD,EAAE,CAAC;IAEhE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC,CAAC;QAEvC,wDAAwD;QACxD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBACxB,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC1C,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBACxB,IAAI,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,IAAI,MAAM,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;QAC3C,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/store/compute/recompute/types.d.ts

@@ -3,13 +3,13 @@ import type { AnyConfigNode, TranslateFn } from "../../store/types";
 import type { GroupComputeMap } from "../../store/registerNodes";
 import type { ValuesCache } from "../../valuesCache/valuesCache";
 /**
- * Обёртка для отслеживания кросс-групповых зависимостей.
- * Принимает узел (для определения группы-реципиента) и сырые значения,
- * возвращает те же значения, обёрнутые в tracking-proxy.
+ * Wrapper for tracking cross-group dependencies.
+ * Takes a node (to determine the recipient group) and raw values,
+ * returns the same values wrapped in a tracking proxy.
  */
 export type TrackingWrap = (node: object, values: Record<string, unknown>) => Record<string, unknown>;
 /**
- * Зависимости для таргетированного пересчёта.
+ * Dependencies for a targeted recompute.
  */
 export interface RecomputeTargetedDeps {
     rootConfig: AnyConfigNode;

package/dist/store/compute/resolveFlag.d.ts

@@ -1,7 +1,7 @@
 import { TranslateFn } from "../store/types";
 /**
- * Вычисляет одно свойство-флаг из конфига: если это функция — вызывает с values,
- * иначе возвращает как есть. Если undefined — возвращает defaultValue.
+ * Resolves a single flag property from the config: a function is called with
+ * the values, anything else is returned as-is. undefined → defaultValue.
  */
 export declare function resolveFlag(configValue: boolean | ((values: any, translate: TranslateFn) => boolean) | undefined, values: Record<string, any>, defaultValue: boolean, translate: TranslateFn): boolean;
 //# sourceMappingURL=resolveFlag.d.ts.map

package/dist/store/compute/resolveFlag.js

@@ -1,6 +1,6 @@
 /**
- * Вычисляет одно свойство-флаг из конфига: если это функция — вызывает с values,
- * иначе возвращает как есть. Если undefined — возвращает defaultValue.
+ * Resolves a single flag property from the config: a function is called with
+ * the values, anything else is returned as-is. undefined → defaultValue.
  */
 export function resolveFlag(configValue, values, defaultValue, translate) {
     if (configValue === undefined)

package/dist/store/compute/resolveString.d.ts

@@ -1,11 +1,11 @@
 import type { TranslateFn } from "../store/types";
 /**
- * Вычисляет строковое свойство (label, placeholder, description) из конфига.
- * Может быть строкой или функцией `(t: TranslateFn, values) => string`.
+ * Resolves a string property (label, placeholder, description) from the config.
+ * Can be a string or a `(t: TranslateFn, values) => string` function.
  *
- * Если translator зарегистрирован — реальный резолв происходит лениво
- * в proxy GET trap (buildProxy.ts). Здесь сохраняем fallback:
- * для функций — вызываем с identity → возвращаем ключ перевода.
+ * When a translator is registered, the real resolution happens lazily in the
+ * proxy GET trap (buildProxy.ts). Here we keep the fallback: functions are
+ * called with identity → the translation key is returned.
  */
 export declare function resolveString(configValue: string | ((t: TranslateFn, values: Record<string, any>) => string) | undefined, values?: Record<string, any>): string | undefined;
 //# sourceMappingURL=resolveString.d.ts.map

package/dist/store/compute/resolveString.js

@@ -1,16 +1,16 @@
 /**
- * Вычисляет строковое свойство (label, placeholder, description) из конфига.
- * Может быть строкой или функцией `(t: TranslateFn, values) => string`.
+ * Resolves a string property (label, placeholder, description) from the config.
+ * Can be a string or a `(t: TranslateFn, values) => string` function.
  *
- * Если translator зарегистрирован — реальный резолв происходит лениво
- * в proxy GET trap (buildProxy.ts). Здесь сохраняем fallback:
- * для функций — вызываем с identity → возвращаем ключ перевода.
+ * When a translator is registered, the real resolution happens lazily in the
+ * proxy GET trap (buildProxy.ts). Here we keep the fallback: functions are
+ * called with identity → the translation key is returned.
  */
 export function resolveString(configValue, values = {}) {
     if (configValue === undefined)
         return undefined;
     if (typeof configValue === "function") {
-        // identity — вернёт ключ как есть (fallback до регистрации translator)
+        // identity — returns the key as-is (fallback until a translator is registered)
         return configValue((v) => v, values);
     }
     return configValue;

package/dist/store/compute/resolveString.js.map

@@ -1 +1 @@
-{"version":3,"file":"resolveString.js","sourceRoot":"","sources":["../../../store/compute/resolveString.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,WAA2F,EAC3F,SAA8B,EAAE;IAEhC,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAChD,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE,CAAC;QACtC,uEAAuE;QACvE,OAAO,WAAW,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC"}
+{"version":3,"file":"resolveString.js","sourceRoot":"","sources":["../../../store/compute/resolveString.ts"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,WAA2F,EAC3F,SAA8B,EAAE;IAEhC,IAAI,WAAW,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAChD,IAAI,OAAO,WAAW,KAAK,UAAU,EAAE,CAAC;QACtC,+EAA+E;QAC/E,OAAO,WAAW,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC"}

package/dist/store/compute/types.d.ts

@@ -1,8 +1,8 @@
 /**
- * Полное вычисленное состояние одного поля.
+ * The full computed state of a single field.
  *
- * Хранится в WeakMap<configNode, FieldState>. Все функции из конфига
- * (isVisible, isRequired, validate…) уже вызваны, результат — чистые значения.
+ * Stored in WeakMap<configNode, FieldState>. All config functions
+ * (isVisible, isRequired, validate…) have been called; only plain values remain.
  */
 export interface FieldState {
     value: unknown;