@reformer/core 11.0.0-beta.5 → 11.0.0-beta.7
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.
- package/dist/behaviors.js +124 -124
- package/dist/create-model-B8U-COv-.js +103 -0
- package/dist/en-CjAqn7h0.js +41 -0
- package/dist/form/behaviors/internals.d.ts +9 -0
- package/dist/form/create-form.d.ts +6 -6
- package/dist/form/factories/node-factory.d.ts +16 -16
- package/dist/form/nodes/array-node.d.ts +3 -3
- package/dist/form/nodes/field-node.d.ts +3 -3
- package/dist/form/nodes/group-node.d.ts +7 -7
- package/dist/form/nodes/model-array-node.d.ts +2 -2
- package/dist/form/types/contracts.d.ts +6 -0
- package/dist/form/types/deep-schema.d.ts +5 -5
- package/dist/form/types/validation-schema.d.ts +13 -1
- package/dist/form/validation/operators.d.ts +6 -1
- package/dist/form/validators/validation-error.d.ts +8 -0
- package/dist/i18n/descriptor.d.ts +54 -0
- package/dist/i18n/en.json.d.ts +45 -0
- package/dist/i18n/loader.d.ts +71 -0
- package/dist/i18n/locale-store.d.ts +39 -0
- package/dist/i18n/locale.d.ts +90 -0
- package/dist/i18n/message-format.d.ts +116 -0
- package/dist/i18n/resolve-localized.d.ts +17 -0
- package/dist/i18n/ru.json.d.ts +45 -0
- package/dist/i18n/translator.d.ts +50 -0
- package/dist/i18n/validation-message.d.ts +18 -0
- package/dist/i18n.d.ts +31 -0
- package/dist/i18n.js +303 -0
- package/dist/index-BrNkQj1y.js +105 -0
- package/dist/index.js +548 -601
- package/dist/loader-Dv_Hl7JC.js +216 -0
- package/dist/locale/en.d.ts +2 -0
- package/dist/locale/en.js +5 -0
- package/dist/locale/en.json +42 -0
- package/dist/locale/index.d.ts +18 -0
- package/dist/locale/ru.d.ts +2 -0
- package/dist/locale/ru.js +41 -0
- package/dist/locale/ru.json +42 -0
- package/dist/locale.d.ts +2 -0
- package/dist/locale.js +9 -0
- package/dist/model/create-model.d.ts +17 -3
- package/dist/model/index.d.ts +3 -3
- package/dist/model/model-signals-proxy.d.ts +25 -0
- package/dist/model/types.d.ts +19 -5
- package/dist/model-signals-proxy-2vqS243J.js +250 -0
- package/dist/model.js +18 -16
- package/dist/platforms/react/field-binding/field-adapter.d.ts +87 -0
- package/dist/platforms/react/field-binding/field-handle.d.ts +50 -0
- package/dist/platforms/react/hooks/types.d.ts +6 -3
- package/dist/platforms/react/hooks/useFormControlValue.d.ts +2 -1
- package/dist/platforms/react/i18n/context.d.ts +13 -0
- package/dist/platforms/react/i18n/hooks.d.ts +59 -0
- package/dist/platforms/react/i18n/provider.d.ts +52 -0
- package/dist/platforms/react/index.d.ts +4 -0
- package/dist/{strategy-DA3JwxsR.js → strategy-BXS_gBfz.js} +7 -7
- package/dist/validation-error-B-U3RsV0.js +11 -0
- package/dist/validation.js +1 -1
- package/dist/validators/email.js +5 -8
- package/dist/validators/future-date.js +8 -11
- package/dist/validators/integer.js +4 -7
- package/dist/validators/is-date.js +5 -8
- package/dist/validators/is-number.js +4 -7
- package/dist/validators/max-age.js +8 -11
- package/dist/validators/max-date.js +8 -11
- package/dist/validators/max-length.js +5 -8
- package/dist/validators/max.js +4 -7
- package/dist/validators/min-age.js +8 -11
- package/dist/validators/min-date.js +8 -11
- package/dist/validators/min-length.js +5 -8
- package/dist/validators/min.js +4 -7
- package/dist/validators/multiple-of.js +5 -8
- package/dist/validators/non-negative.js +4 -7
- package/dist/validators/non-zero.js +4 -7
- package/dist/validators/past-date.js +8 -11
- package/dist/validators/pattern.js +5 -8
- package/dist/validators/phone.js +6 -9
- package/dist/validators/required.js +4 -7
- package/dist/validators/url.js +9 -14
- package/dist/validators.js +84 -106
- package/docs/llms/02-quick-start.md +7 -7
- package/docs/llms/03-api-signatures.md +11 -5
- package/docs/llms/05-common-mistakes.md +1 -1
- package/docs/llms/09-formschema.md +12 -12
- package/docs/llms/10-arrays.md +34 -4
- package/docs/llms/14-extended-mistakes.md +1 -1
- package/docs/llms/15-project-structure.md +15 -13
- package/docs/llms/16-ui-components.md +36 -9
- package/docs/llms/17-nonexistent-api.md +16 -2
- package/docs/llms/29-async-preload.md +4 -4
- package/docs/llms/30-type-safety-recipes.md +1 -1
- package/docs/llms/34-i18n.md +272 -0
- package/llms-index.json +1 -1
- package/llms.txt +1925 -175
- package/package.json +22 -3
- package/dist/create-model-Dxh9cfLp.js +0 -97
- package/dist/model-signals-proxy-mV3WGdlO.js +0 -233
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@reformer/core",
|
|
3
|
-
"version": "11.0.0-beta.
|
|
3
|
+
"version": "11.0.0-beta.7",
|
|
4
4
|
"description": "Reactive form state management library for React with signals-based architecture",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"main": "./dist/index.js",
|
|
@@ -15,6 +15,24 @@
|
|
|
15
15
|
"types": "./dist/signals.d.ts",
|
|
16
16
|
"import": "./dist/signals.js"
|
|
17
17
|
},
|
|
18
|
+
"./i18n": {
|
|
19
|
+
"types": "./dist/i18n.d.ts",
|
|
20
|
+
"import": "./dist/i18n.js"
|
|
21
|
+
},
|
|
22
|
+
"./locale": {
|
|
23
|
+
"types": "./dist/locale.d.ts",
|
|
24
|
+
"import": "./dist/locale.js"
|
|
25
|
+
},
|
|
26
|
+
"./locale/en": {
|
|
27
|
+
"types": "./dist/locale/en.d.ts",
|
|
28
|
+
"import": "./dist/locale/en.js"
|
|
29
|
+
},
|
|
30
|
+
"./locale/ru": {
|
|
31
|
+
"types": "./dist/locale/ru.d.ts",
|
|
32
|
+
"import": "./dist/locale/ru.js"
|
|
33
|
+
},
|
|
34
|
+
"./locale/en.json": "./dist/locale/en.json",
|
|
35
|
+
"./locale/ru.json": "./dist/locale/ru.json",
|
|
18
36
|
"./model": {
|
|
19
37
|
"types": "./dist/model.d.ts",
|
|
20
38
|
"import": "./dist/model.js"
|
|
@@ -172,12 +190,13 @@
|
|
|
172
190
|
"use-sync-external-store": "^1.2.0"
|
|
173
191
|
},
|
|
174
192
|
"devDependencies": {
|
|
175
|
-
"@types/use-sync-external-store": "^0.0.6",
|
|
176
193
|
"@types/node": "^24.10.1",
|
|
177
|
-
"tsx": "^4.19.2",
|
|
178
194
|
"@types/react": "^19.2.7",
|
|
195
|
+
"@types/use-sync-external-store": "^0.0.6",
|
|
179
196
|
"@vitest/coverage-v8": "~4.0.15",
|
|
197
|
+
"intl-messageformat": "^12.1.2",
|
|
180
198
|
"react": "^19.2.1",
|
|
199
|
+
"tsx": "^4.19.2",
|
|
181
200
|
"typescript": "^5.9.3",
|
|
182
201
|
"vite": "^7.2.2",
|
|
183
202
|
"vite-plugin-dts": "^4.5.4",
|
|
@@ -1,97 +0,0 @@
|
|
|
1
|
-
import { s as p, r as v, b as f, G as g } from "./model-signals-proxy-mV3WGdlO.js";
|
|
2
|
-
function a(t) {
|
|
3
|
-
if (t)
|
|
4
|
-
return t.kind === "group" ? d(t) : t.kind === "array" ? w(t) : t.read();
|
|
5
|
-
}
|
|
6
|
-
function w(t) {
|
|
7
|
-
const s = {
|
|
8
|
-
get length() {
|
|
9
|
-
return t.items.value.length;
|
|
10
|
-
},
|
|
11
|
-
push: (e) => t.push(e),
|
|
12
|
-
insertAt: (e, n) => t.insertAt(e, n),
|
|
13
|
-
removeAt: (e) => t.removeAt(e),
|
|
14
|
-
move: (e, n) => t.move(e, n),
|
|
15
|
-
swap: (e, n) => t.swap(e, n),
|
|
16
|
-
clear: () => t.clear(),
|
|
17
|
-
at: (e) => a(t.items.value[e]),
|
|
18
|
-
map: (e) => t.items.value.map((n, i) => e(a(n), i)),
|
|
19
|
-
forEach: (e) => t.items.value.forEach((n, i) => e(a(n), i)),
|
|
20
|
-
toArray: () => t.peek(),
|
|
21
|
-
[Symbol.iterator]: function* () {
|
|
22
|
-
const e = t.items.value;
|
|
23
|
-
for (let n = 0; n < e.length; n++) yield a(e[n]);
|
|
24
|
-
}
|
|
25
|
-
};
|
|
26
|
-
return new Proxy(s, {
|
|
27
|
-
get: (e, n, i) => n === "__path" ? t.path : typeof n == "string" && f(n) ? a(t.items.value[Number(n)]) : Reflect.get(e, n, i),
|
|
28
|
-
has: (e, n) => typeof n == "string" && f(n) ? Number(n) < t.items.value.length : Reflect.has(e, n)
|
|
29
|
-
});
|
|
30
|
-
}
|
|
31
|
-
const u = /* @__PURE__ */ new Set([
|
|
32
|
-
"$",
|
|
33
|
-
"get",
|
|
34
|
-
"set",
|
|
35
|
-
"patch",
|
|
36
|
-
"isDirty",
|
|
37
|
-
"reset",
|
|
38
|
-
"captureInitial",
|
|
39
|
-
"signalAt"
|
|
40
|
-
]), h = /* @__PURE__ */ new WeakMap(), m = /* @__PURE__ */ new WeakMap();
|
|
41
|
-
function d(t) {
|
|
42
|
-
const s = h.get(t);
|
|
43
|
-
if (s) return s;
|
|
44
|
-
const e = {
|
|
45
|
-
$: p(t),
|
|
46
|
-
get: () => t.peek(),
|
|
47
|
-
set: (i) => t.set(i),
|
|
48
|
-
patch: (i) => t.set(i),
|
|
49
|
-
isDirty: () => t.dirty(),
|
|
50
|
-
reset: () => t.resetToInitial(),
|
|
51
|
-
captureInitial: () => t.captureInitial(),
|
|
52
|
-
signalAt: (i) => v(t, i)
|
|
53
|
-
}, n = new Proxy(
|
|
54
|
-
{},
|
|
55
|
-
{
|
|
56
|
-
get: (i, r) => {
|
|
57
|
-
if (r === "__path") return t.path;
|
|
58
|
-
if (typeof r != "string") return;
|
|
59
|
-
const c = t.children.get(r);
|
|
60
|
-
if (c) return a(c);
|
|
61
|
-
if (u.has(r)) return e[r];
|
|
62
|
-
},
|
|
63
|
-
set: (i, r, c) => {
|
|
64
|
-
if (typeof r != "string") return !1;
|
|
65
|
-
const o = t.children.get(r);
|
|
66
|
-
return o ? (o.set(c), !0) : !1;
|
|
67
|
-
},
|
|
68
|
-
has: (i, r) => typeof r == "string" && (t.children.has(r) || u.has(r)),
|
|
69
|
-
ownKeys: () => [...t.children.keys()],
|
|
70
|
-
getOwnPropertyDescriptor: (i, r) => typeof r == "string" && t.children.has(r) ? { enumerable: !0, configurable: !0 } : void 0
|
|
71
|
-
}
|
|
72
|
-
);
|
|
73
|
-
return h.set(t, n), m.set(n, t), n;
|
|
74
|
-
}
|
|
75
|
-
function l(t, s) {
|
|
76
|
-
if (t.kind === "leaf") {
|
|
77
|
-
s(t.signal);
|
|
78
|
-
return;
|
|
79
|
-
}
|
|
80
|
-
if (t.kind === "group") {
|
|
81
|
-
for (const e of t.children.values()) l(e, s);
|
|
82
|
-
return;
|
|
83
|
-
}
|
|
84
|
-
for (const e of t.items.value) l(e, s);
|
|
85
|
-
}
|
|
86
|
-
function A(t, s) {
|
|
87
|
-
const e = m.get(t);
|
|
88
|
-
e && l(e, s);
|
|
89
|
-
}
|
|
90
|
-
function _(t) {
|
|
91
|
-
const s = new g(t, "");
|
|
92
|
-
return d(s);
|
|
93
|
-
}
|
|
94
|
-
export {
|
|
95
|
-
_ as c,
|
|
96
|
-
A as e
|
|
97
|
-
};
|
|
@@ -1,233 +0,0 @@
|
|
|
1
|
-
import { batch as m, signal as y, computed as b } from "@preact/signals-core";
|
|
2
|
-
const c = /* @__PURE__ */ new WeakMap();
|
|
3
|
-
function R(t) {
|
|
4
|
-
c.set(t, (c.get(t) ?? 0) + 1);
|
|
5
|
-
}
|
|
6
|
-
function S(t) {
|
|
7
|
-
const e = c.get(t);
|
|
8
|
-
e !== void 0 && (e <= 1 ? c.delete(t) : c.set(t, e - 1));
|
|
9
|
-
}
|
|
10
|
-
function A(t) {
|
|
11
|
-
return c.has(t);
|
|
12
|
-
}
|
|
13
|
-
const f = (t) => !(t === null || typeof t != "object" || Array.isArray(t) || t instanceof Date || typeof Blob < "u" && t instanceof Blob || typeof File < "u" && t instanceof File), o = (t, e) => t === "" ? String(e) : `${t}.${e}`, w = (t) => /^\d+$/.test(t), l = (t) => {
|
|
14
|
-
if (Array.isArray(t)) return t.map(l);
|
|
15
|
-
if (f(t)) {
|
|
16
|
-
const e = {};
|
|
17
|
-
for (const i of Object.keys(t)) e[i] = l(t[i]);
|
|
18
|
-
return e;
|
|
19
|
-
}
|
|
20
|
-
return t;
|
|
21
|
-
}, h = (t, e) => {
|
|
22
|
-
if (t === e) return !0;
|
|
23
|
-
if (Array.isArray(t) && Array.isArray(e))
|
|
24
|
-
return t.length !== e.length ? !1 : t.every((i, r) => h(i, e[r]));
|
|
25
|
-
if (f(t) && f(e)) {
|
|
26
|
-
const i = Object.keys(t), r = Object.keys(e);
|
|
27
|
-
return i.length !== r.length ? !1 : i.every((s) => h(t[s], e[s]));
|
|
28
|
-
}
|
|
29
|
-
return !1;
|
|
30
|
-
};
|
|
31
|
-
class _ {
|
|
32
|
-
constructor(e, i) {
|
|
33
|
-
this.path = i;
|
|
34
|
-
const r = y(e);
|
|
35
|
-
r.__path = i, this.signal = r, this.initial = l(e);
|
|
36
|
-
}
|
|
37
|
-
kind = "leaf";
|
|
38
|
-
signal;
|
|
39
|
-
initial;
|
|
40
|
-
rebase(e) {
|
|
41
|
-
this.path = e, this.signal.__path = e;
|
|
42
|
-
}
|
|
43
|
-
/** Реактивное чтение (внутри effect/computed создаёт зависимость). */
|
|
44
|
-
read() {
|
|
45
|
-
return this.signal.value;
|
|
46
|
-
}
|
|
47
|
-
/** Нереактивный снимок. */
|
|
48
|
-
peek() {
|
|
49
|
-
return this.signal.peek();
|
|
50
|
-
}
|
|
51
|
-
set(e) {
|
|
52
|
-
this.signal.value = e;
|
|
53
|
-
}
|
|
54
|
-
resetToInitial() {
|
|
55
|
-
this.signal.value = l(this.initial);
|
|
56
|
-
}
|
|
57
|
-
captureInitial() {
|
|
58
|
-
this.initial = l(this.signal.peek());
|
|
59
|
-
}
|
|
60
|
-
dirty() {
|
|
61
|
-
return !h(this.signal.peek(), this.initial);
|
|
62
|
-
}
|
|
63
|
-
}
|
|
64
|
-
class j {
|
|
65
|
-
constructor(e, i) {
|
|
66
|
-
this.path = i;
|
|
67
|
-
for (const r of Object.keys(e))
|
|
68
|
-
this.children.set(r, u(e[r], o(i, r)));
|
|
69
|
-
}
|
|
70
|
-
kind = "group";
|
|
71
|
-
children = /* @__PURE__ */ new Map();
|
|
72
|
-
rebase(e) {
|
|
73
|
-
this.path = e;
|
|
74
|
-
for (const [i, r] of this.children) r.rebase(o(e, i));
|
|
75
|
-
}
|
|
76
|
-
/** Реактивное чтение поддерева (внутри effect/computed подписывает на все листья группы). */
|
|
77
|
-
read() {
|
|
78
|
-
const e = {};
|
|
79
|
-
for (const [i, r] of this.children) e[i] = r.read();
|
|
80
|
-
return e;
|
|
81
|
-
}
|
|
82
|
-
peek() {
|
|
83
|
-
const e = {};
|
|
84
|
-
for (const [i, r] of this.children) e[i] = r.peek();
|
|
85
|
-
return e;
|
|
86
|
-
}
|
|
87
|
-
set(e) {
|
|
88
|
-
if (e == null || typeof e != "object") return;
|
|
89
|
-
const i = e;
|
|
90
|
-
m(() => {
|
|
91
|
-
for (const [r, s] of this.children)
|
|
92
|
-
r in i && (s.kind === "leaf" && A(s.signal) || s.set(i[r]));
|
|
93
|
-
});
|
|
94
|
-
}
|
|
95
|
-
resetToInitial() {
|
|
96
|
-
m(() => {
|
|
97
|
-
for (const e of this.children.values()) e.resetToInitial();
|
|
98
|
-
});
|
|
99
|
-
}
|
|
100
|
-
captureInitial() {
|
|
101
|
-
for (const e of this.children.values()) e.captureInitial();
|
|
102
|
-
}
|
|
103
|
-
dirty() {
|
|
104
|
-
for (const e of this.children.values()) if (e.dirty()) return !0;
|
|
105
|
-
return !1;
|
|
106
|
-
}
|
|
107
|
-
}
|
|
108
|
-
class x {
|
|
109
|
-
constructor(e, i) {
|
|
110
|
-
this.path = i, this.items = y(e.map((r, s) => u(r, o(i, s)))), this.initial = l(e);
|
|
111
|
-
}
|
|
112
|
-
kind = "array";
|
|
113
|
-
items;
|
|
114
|
-
initial;
|
|
115
|
-
rebase(e) {
|
|
116
|
-
this.path = e, this.items.peek().forEach((i, r) => i.rebase(o(e, r)));
|
|
117
|
-
}
|
|
118
|
-
reindex() {
|
|
119
|
-
this.items.peek().forEach((e, i) => e.rebase(o(this.path, i)));
|
|
120
|
-
}
|
|
121
|
-
push(e) {
|
|
122
|
-
const i = this.items.peek();
|
|
123
|
-
this.items.value = [...i, u(e, o(this.path, i.length))];
|
|
124
|
-
}
|
|
125
|
-
insertAt(e, i) {
|
|
126
|
-
const r = [...this.items.peek()];
|
|
127
|
-
r.splice(e, 0, u(i, o(this.path, e))), this.items.value = r, this.reindex();
|
|
128
|
-
}
|
|
129
|
-
removeAt(e) {
|
|
130
|
-
const i = [...this.items.peek()];
|
|
131
|
-
i.splice(e, 1), this.items.value = i, this.reindex();
|
|
132
|
-
}
|
|
133
|
-
move(e, i) {
|
|
134
|
-
const r = [...this.items.peek()], [s] = r.splice(e, 1);
|
|
135
|
-
s && r.splice(i, 0, s), this.items.value = r, this.reindex();
|
|
136
|
-
}
|
|
137
|
-
swap(e, i) {
|
|
138
|
-
const r = [...this.items.peek()];
|
|
139
|
-
e < 0 || i < 0 || e >= r.length || i >= r.length || e === i || ([r[e], r[i]] = [r[i], r[e]], this.items.value = r, this.reindex());
|
|
140
|
-
}
|
|
141
|
-
clear() {
|
|
142
|
-
this.items.value = [];
|
|
143
|
-
}
|
|
144
|
-
/**
|
|
145
|
-
* Реактивное чтение массива. Читаем `items.value` (а не `.peek()`) — внутри effect/computed это
|
|
146
|
-
* подписка на СОСТАВ массива, поэтому push/removeAt/move ретригерят наравне с правкой элемента.
|
|
147
|
-
*/
|
|
148
|
-
read() {
|
|
149
|
-
return this.items.value.map((e) => e.read());
|
|
150
|
-
}
|
|
151
|
-
peek() {
|
|
152
|
-
return this.items.peek().map((e) => e.peek());
|
|
153
|
-
}
|
|
154
|
-
set(e) {
|
|
155
|
-
const i = Array.isArray(e) ? e : [];
|
|
156
|
-
this.items.value = i.map((r, s) => u(r, o(this.path, s)));
|
|
157
|
-
}
|
|
158
|
-
resetToInitial() {
|
|
159
|
-
this.set(l(this.initial));
|
|
160
|
-
}
|
|
161
|
-
captureInitial() {
|
|
162
|
-
this.initial = l(this.peek());
|
|
163
|
-
}
|
|
164
|
-
dirty() {
|
|
165
|
-
return !h(this.peek(), this.initial);
|
|
166
|
-
}
|
|
167
|
-
}
|
|
168
|
-
function u(t, e) {
|
|
169
|
-
return Array.isArray(t) ? new x(t, e) : f(t) ? new j(t, e) : new _(t, e);
|
|
170
|
-
}
|
|
171
|
-
const k = /* @__PURE__ */ new WeakMap();
|
|
172
|
-
function I(t) {
|
|
173
|
-
const e = b(() => t.read());
|
|
174
|
-
return {
|
|
175
|
-
get value() {
|
|
176
|
-
return e.value;
|
|
177
|
-
},
|
|
178
|
-
peek: () => e.peek(),
|
|
179
|
-
subscribe: (i) => e.subscribe(i),
|
|
180
|
-
valueOf: () => e.value,
|
|
181
|
-
toString: () => String(e.value),
|
|
182
|
-
toJSON: () => e.value,
|
|
183
|
-
brand: e.brand
|
|
184
|
-
};
|
|
185
|
-
}
|
|
186
|
-
function O(t) {
|
|
187
|
-
if (t.kind === "leaf") return t.signal;
|
|
188
|
-
const e = k.get(t);
|
|
189
|
-
if (e) return e;
|
|
190
|
-
const i = I(t), r = t.kind === "group", s = (a) => r ? t.children.get(a) : w(a) ? t.items.value[Number(a)] : void 0, d = r ? {} : {
|
|
191
|
-
get length() {
|
|
192
|
-
return t.items.value.length;
|
|
193
|
-
}
|
|
194
|
-
}, p = new Proxy(d, {
|
|
195
|
-
get: (a, n, v) => {
|
|
196
|
-
if (n === "__path") return t.path;
|
|
197
|
-
if (n === "__kind") return t.kind;
|
|
198
|
-
if (typeof n != "string") return Reflect.get(i, n, i);
|
|
199
|
-
const g = s(n);
|
|
200
|
-
return g ? O(g) : !r && Reflect.has(a, n) ? Reflect.get(a, n, v) : Reflect.get(i, n, i);
|
|
201
|
-
},
|
|
202
|
-
has: (a, n) => typeof n == "string" && (s(n) !== void 0 || !r && Reflect.has(a, n)),
|
|
203
|
-
ownKeys: () => r ? [...t.children.keys()] : Reflect.ownKeys(d),
|
|
204
|
-
getOwnPropertyDescriptor: (a, n) => typeof n == "string" && s(n) ? { enumerable: !0, configurable: !0 } : r ? void 0 : Reflect.getOwnPropertyDescriptor(a, n)
|
|
205
|
-
});
|
|
206
|
-
return k.set(t, p), p;
|
|
207
|
-
}
|
|
208
|
-
function D(t) {
|
|
209
|
-
if (t == null || typeof t != "object") return !1;
|
|
210
|
-
const e = t.__kind;
|
|
211
|
-
return e === "group" || e === "array";
|
|
212
|
-
}
|
|
213
|
-
function P(t, e) {
|
|
214
|
-
if (!e) return;
|
|
215
|
-
let i = t;
|
|
216
|
-
for (const r of e.split(".")) {
|
|
217
|
-
if (!i) return;
|
|
218
|
-
if (i.kind === "group") i = i.children.get(r);
|
|
219
|
-
else if (i.kind === "array") i = i.items.peek()[Number(r)];
|
|
220
|
-
else return;
|
|
221
|
-
}
|
|
222
|
-
return i && i.kind === "leaf" ? i.signal : void 0;
|
|
223
|
-
}
|
|
224
|
-
export {
|
|
225
|
-
j as G,
|
|
226
|
-
A as a,
|
|
227
|
-
w as b,
|
|
228
|
-
D as i,
|
|
229
|
-
R as m,
|
|
230
|
-
P as r,
|
|
231
|
-
O as s,
|
|
232
|
-
S as u
|
|
233
|
-
};
|