@okyiww/form 0.0.22 → 0.0.24
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/index.js +1454 -1338
- package/dist/types/core/adapter/ArcoVueAdapter.d.ts +2 -1
- package/dist/types/core/adapter/NaiveUIAdapter.d.ts +2 -1
- package/dist/types/core/adapter/NutUIAdapter.d.ts +2 -1
- package/dist/types/core/services/collectDisplayLabels.d.ts +6 -0
- package/dist/types/core/services/index.d.ts +1 -0
- package/dist/types/helpers/defineFormSetup/types.d.ts +6 -0
- package/dist/types/helpers/useForm/types.d.ts +1 -0
- package/dist/types/index.d.ts +1 -1
- package/package.json +2 -2
package/dist/index.js
CHANGED
|
@@ -1,115 +1,115 @@
|
|
|
1
|
-
var
|
|
2
|
-
var
|
|
3
|
-
var
|
|
4
|
-
import { ref as
|
|
5
|
-
var
|
|
6
|
-
function
|
|
7
|
-
var t =
|
|
1
|
+
var tn = Object.defineProperty;
|
|
2
|
+
var rn = (e, t, r) => t in e ? tn(e, t, { enumerable: !0, configurable: !0, writable: !0, value: r }) : e[t] = r;
|
|
3
|
+
var w = (e, t, r) => rn(e, typeof t != "symbol" ? t + "" : t, r);
|
|
4
|
+
import { ref as ie, toRaw as nn, createVNode as B, mergeProps as ze, defineComponent as sn, nextTick as cr, isRef as Ye, isReactive as on, watch as lr, computed as vt } from "vue";
|
|
5
|
+
var ar = typeof global == "object" && global && global.Object === Object && global, fn = typeof self == "object" && self && self.Object === Object && self, W = ar || fn || Function("return this")(), G = W.Symbol, hr = Object.prototype, un = hr.hasOwnProperty, cn = hr.toString, de = G ? G.toStringTag : void 0;
|
|
6
|
+
function ln(e) {
|
|
7
|
+
var t = un.call(e, de), r = e[de];
|
|
8
8
|
try {
|
|
9
9
|
e[de] = void 0;
|
|
10
10
|
var n = !0;
|
|
11
11
|
} catch {
|
|
12
12
|
}
|
|
13
|
-
var
|
|
14
|
-
return n && (t ? e[de] = r : delete e[de]),
|
|
13
|
+
var i = cn.call(e);
|
|
14
|
+
return n && (t ? e[de] = r : delete e[de]), i;
|
|
15
15
|
}
|
|
16
|
-
var
|
|
17
|
-
function
|
|
18
|
-
return
|
|
16
|
+
var an = Object.prototype, hn = an.toString;
|
|
17
|
+
function dn(e) {
|
|
18
|
+
return hn.call(e);
|
|
19
19
|
}
|
|
20
|
-
var
|
|
20
|
+
var pn = "[object Null]", gn = "[object Undefined]", Rt = G ? G.toStringTag : void 0;
|
|
21
21
|
function q(e) {
|
|
22
|
-
return e == null ? e === void 0 ?
|
|
22
|
+
return e == null ? e === void 0 ? gn : pn : Rt && Rt in Object(e) ? ln(e) : dn(e);
|
|
23
23
|
}
|
|
24
|
-
function
|
|
24
|
+
function H(e) {
|
|
25
25
|
return e != null && typeof e == "object";
|
|
26
26
|
}
|
|
27
|
-
var
|
|
27
|
+
var yn = "[object Symbol]";
|
|
28
28
|
function He(e) {
|
|
29
|
-
return typeof e == "symbol" ||
|
|
29
|
+
return typeof e == "symbol" || H(e) && q(e) == yn;
|
|
30
30
|
}
|
|
31
|
-
function
|
|
32
|
-
for (var r = -1, n = e == null ? 0 : e.length,
|
|
33
|
-
|
|
34
|
-
return
|
|
31
|
+
function dr(e, t) {
|
|
32
|
+
for (var r = -1, n = e == null ? 0 : e.length, i = Array(n); ++r < n; )
|
|
33
|
+
i[r] = t(e[r], r, e);
|
|
34
|
+
return i;
|
|
35
35
|
}
|
|
36
|
-
var
|
|
37
|
-
function
|
|
36
|
+
var m = Array.isArray, Mt = G ? G.prototype : void 0, xt = Mt ? Mt.toString : void 0;
|
|
37
|
+
function pr(e) {
|
|
38
38
|
if (typeof e == "string")
|
|
39
39
|
return e;
|
|
40
|
-
if (
|
|
41
|
-
return
|
|
40
|
+
if (m(e))
|
|
41
|
+
return dr(e, pr) + "";
|
|
42
42
|
if (He(e))
|
|
43
|
-
return
|
|
43
|
+
return xt ? xt.call(e) : "";
|
|
44
44
|
var t = e + "";
|
|
45
45
|
return t == "0" && 1 / e == -1 / 0 ? "-0" : t;
|
|
46
46
|
}
|
|
47
|
-
var
|
|
48
|
-
function
|
|
49
|
-
for (var t = e.length; t-- &&
|
|
47
|
+
var _n = /\s/;
|
|
48
|
+
function bn(e) {
|
|
49
|
+
for (var t = e.length; t-- && _n.test(e.charAt(t)); )
|
|
50
50
|
;
|
|
51
51
|
return t;
|
|
52
52
|
}
|
|
53
|
-
var
|
|
54
|
-
function
|
|
55
|
-
return e && e.slice(0,
|
|
53
|
+
var mn = /^\s+/;
|
|
54
|
+
function wn(e) {
|
|
55
|
+
return e && e.slice(0, bn(e) + 1).replace(mn, "");
|
|
56
56
|
}
|
|
57
|
-
function
|
|
57
|
+
function C(e) {
|
|
58
58
|
var t = typeof e;
|
|
59
59
|
return e != null && (t == "object" || t == "function");
|
|
60
60
|
}
|
|
61
|
-
var
|
|
62
|
-
function
|
|
61
|
+
var Ct = NaN, Sn = /^[-+]0x[0-9a-f]+$/i, Tn = /^0b[01]+$/i, An = /^0o[0-7]+$/i, On = parseInt;
|
|
62
|
+
function $n(e) {
|
|
63
63
|
if (typeof e == "number")
|
|
64
64
|
return e;
|
|
65
65
|
if (He(e))
|
|
66
|
-
return
|
|
67
|
-
if (
|
|
66
|
+
return Ct;
|
|
67
|
+
if (C(e)) {
|
|
68
68
|
var t = typeof e.valueOf == "function" ? e.valueOf() : e;
|
|
69
|
-
e =
|
|
69
|
+
e = C(t) ? t + "" : t;
|
|
70
70
|
}
|
|
71
71
|
if (typeof e != "string")
|
|
72
72
|
return e === 0 ? e : +e;
|
|
73
|
-
e =
|
|
74
|
-
var r =
|
|
75
|
-
return r ||
|
|
73
|
+
e = wn(e);
|
|
74
|
+
var r = Tn.test(e);
|
|
75
|
+
return r || An.test(e) ? On(e.slice(2), r ? 2 : 8) : Sn.test(e) ? Ct : +e;
|
|
76
76
|
}
|
|
77
|
-
var
|
|
78
|
-
function
|
|
77
|
+
var vn = 1 / 0, Rn = 17976931348623157e292;
|
|
78
|
+
function Mn(e) {
|
|
79
79
|
if (!e)
|
|
80
80
|
return e === 0 ? e : 0;
|
|
81
|
-
if (e =
|
|
81
|
+
if (e = $n(e), e === vn || e === -1 / 0) {
|
|
82
82
|
var t = e < 0 ? -1 : 1;
|
|
83
|
-
return t *
|
|
83
|
+
return t * Rn;
|
|
84
84
|
}
|
|
85
85
|
return e === e ? e : 0;
|
|
86
86
|
}
|
|
87
|
-
function
|
|
88
|
-
var t =
|
|
87
|
+
function xn(e) {
|
|
88
|
+
var t = Mn(e), r = t % 1;
|
|
89
89
|
return t === t ? r ? t - r : t : 0;
|
|
90
90
|
}
|
|
91
|
-
function
|
|
91
|
+
function Se(e) {
|
|
92
92
|
return e;
|
|
93
93
|
}
|
|
94
|
-
var
|
|
94
|
+
var Cn = "[object AsyncFunction]", En = "[object Function]", Pn = "[object GeneratorFunction]", Dn = "[object Proxy]";
|
|
95
95
|
function I(e) {
|
|
96
|
-
if (!
|
|
96
|
+
if (!C(e))
|
|
97
97
|
return !1;
|
|
98
98
|
var t = q(e);
|
|
99
|
-
return t ==
|
|
99
|
+
return t == En || t == Pn || t == Cn || t == Dn;
|
|
100
100
|
}
|
|
101
|
-
var
|
|
102
|
-
var e = /[^.]+$/.exec(
|
|
101
|
+
var Xe = W["__core-js_shared__"], Et = function() {
|
|
102
|
+
var e = /[^.]+$/.exec(Xe && Xe.keys && Xe.keys.IE_PROTO || "");
|
|
103
103
|
return e ? "Symbol(src)_1." + e : "";
|
|
104
104
|
}();
|
|
105
|
-
function
|
|
106
|
-
return !!
|
|
105
|
+
function jn(e) {
|
|
106
|
+
return !!Et && Et in e;
|
|
107
107
|
}
|
|
108
|
-
var
|
|
108
|
+
var Ln = Function.prototype, In = Ln.toString;
|
|
109
109
|
function oe(e) {
|
|
110
110
|
if (e != null) {
|
|
111
111
|
try {
|
|
112
|
-
return
|
|
112
|
+
return In.call(e);
|
|
113
113
|
} catch {
|
|
114
114
|
}
|
|
115
115
|
try {
|
|
@@ -119,36 +119,36 @@ function oe(e) {
|
|
|
119
119
|
}
|
|
120
120
|
return "";
|
|
121
121
|
}
|
|
122
|
-
var
|
|
123
|
-
"^" +
|
|
122
|
+
var Nn = /[\\^$.*+?()[\]{}|]/g, Hn = /^\[object .+?Constructor\]$/, Fn = Function.prototype, Kn = Object.prototype, Un = Fn.toString, Bn = Kn.hasOwnProperty, Vn = RegExp(
|
|
123
|
+
"^" + Un.call(Bn).replace(Nn, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
|
|
124
124
|
);
|
|
125
|
-
function
|
|
126
|
-
if (!
|
|
125
|
+
function kn(e) {
|
|
126
|
+
if (!C(e) || jn(e))
|
|
127
127
|
return !1;
|
|
128
|
-
var t = I(e) ?
|
|
128
|
+
var t = I(e) ? Vn : Hn;
|
|
129
129
|
return t.test(oe(e));
|
|
130
130
|
}
|
|
131
|
-
function
|
|
131
|
+
function Gn(e, t) {
|
|
132
132
|
return e == null ? void 0 : e[t];
|
|
133
133
|
}
|
|
134
134
|
function fe(e, t) {
|
|
135
|
-
var r =
|
|
136
|
-
return
|
|
135
|
+
var r = Gn(e, t);
|
|
136
|
+
return kn(r) ? r : void 0;
|
|
137
137
|
}
|
|
138
|
-
var
|
|
138
|
+
var nt = fe(W, "WeakMap"), Pt = Object.create, Wn = /* @__PURE__ */ function() {
|
|
139
139
|
function e() {
|
|
140
140
|
}
|
|
141
141
|
return function(t) {
|
|
142
|
-
if (!
|
|
142
|
+
if (!C(t))
|
|
143
143
|
return {};
|
|
144
|
-
if (
|
|
145
|
-
return
|
|
144
|
+
if (Pt)
|
|
145
|
+
return Pt(t);
|
|
146
146
|
e.prototype = t;
|
|
147
147
|
var r = new e();
|
|
148
148
|
return e.prototype = void 0, r;
|
|
149
149
|
};
|
|
150
150
|
}();
|
|
151
|
-
function
|
|
151
|
+
function qn(e, t, r) {
|
|
152
152
|
switch (r.length) {
|
|
153
153
|
case 0:
|
|
154
154
|
return e.call(t);
|
|
@@ -161,280 +161,280 @@ function Vn(e, t, r) {
|
|
|
161
161
|
}
|
|
162
162
|
return e.apply(t, r);
|
|
163
163
|
}
|
|
164
|
-
function
|
|
164
|
+
function zn(e, t) {
|
|
165
165
|
var r = -1, n = e.length;
|
|
166
166
|
for (t || (t = Array(n)); ++r < n; )
|
|
167
167
|
t[r] = e[r];
|
|
168
168
|
return t;
|
|
169
169
|
}
|
|
170
|
-
var
|
|
171
|
-
function
|
|
170
|
+
var Yn = 800, Xn = 16, Zn = Date.now;
|
|
171
|
+
function Jn(e) {
|
|
172
172
|
var t = 0, r = 0;
|
|
173
173
|
return function() {
|
|
174
|
-
var n =
|
|
175
|
-
if (r = n,
|
|
176
|
-
if (++t >=
|
|
174
|
+
var n = Zn(), i = Xn - (n - r);
|
|
175
|
+
if (r = n, i > 0) {
|
|
176
|
+
if (++t >= Yn)
|
|
177
177
|
return arguments[0];
|
|
178
178
|
} else
|
|
179
179
|
t = 0;
|
|
180
180
|
return e.apply(void 0, arguments);
|
|
181
181
|
};
|
|
182
182
|
}
|
|
183
|
-
function
|
|
183
|
+
function gr(e) {
|
|
184
184
|
return function() {
|
|
185
185
|
return e;
|
|
186
186
|
};
|
|
187
187
|
}
|
|
188
|
-
var
|
|
188
|
+
var Ce = function() {
|
|
189
189
|
try {
|
|
190
190
|
var e = fe(Object, "defineProperty");
|
|
191
191
|
return e({}, "", {}), e;
|
|
192
192
|
} catch {
|
|
193
193
|
}
|
|
194
|
-
}(),
|
|
195
|
-
return
|
|
194
|
+
}(), Qn = Ce ? function(e, t) {
|
|
195
|
+
return Ce(e, "toString", {
|
|
196
196
|
configurable: !0,
|
|
197
197
|
enumerable: !1,
|
|
198
|
-
value:
|
|
198
|
+
value: gr(t),
|
|
199
199
|
writable: !0
|
|
200
200
|
});
|
|
201
|
-
} :
|
|
202
|
-
function
|
|
201
|
+
} : Se, ei = Jn(Qn);
|
|
202
|
+
function yr(e, t) {
|
|
203
203
|
for (var r = -1, n = e == null ? 0 : e.length; ++r < n && t(e[r], r, e) !== !1; )
|
|
204
204
|
;
|
|
205
205
|
return e;
|
|
206
206
|
}
|
|
207
|
-
function
|
|
208
|
-
for (var
|
|
209
|
-
if (t(e[
|
|
210
|
-
return
|
|
207
|
+
function ti(e, t, r, n) {
|
|
208
|
+
for (var i = e.length, s = r + -1; ++s < i; )
|
|
209
|
+
if (t(e[s], s, e))
|
|
210
|
+
return s;
|
|
211
211
|
return -1;
|
|
212
212
|
}
|
|
213
|
-
var
|
|
214
|
-
function
|
|
213
|
+
var ri = 9007199254740991, ni = /^(?:0|[1-9]\d*)$/;
|
|
214
|
+
function Fe(e, t) {
|
|
215
215
|
var r = typeof e;
|
|
216
|
-
return t = t ??
|
|
216
|
+
return t = t ?? ri, !!t && (r == "number" || r != "symbol" && ni.test(e)) && e > -1 && e % 1 == 0 && e < t;
|
|
217
217
|
}
|
|
218
|
-
function
|
|
219
|
-
t == "__proto__" &&
|
|
218
|
+
function Ke(e, t, r) {
|
|
219
|
+
t == "__proto__" && Ce ? Ce(e, t, {
|
|
220
220
|
configurable: !0,
|
|
221
221
|
enumerable: !0,
|
|
222
222
|
value: r,
|
|
223
223
|
writable: !0
|
|
224
224
|
}) : e[t] = r;
|
|
225
225
|
}
|
|
226
|
-
function
|
|
226
|
+
function Te(e, t) {
|
|
227
227
|
return e === t || e !== e && t !== t;
|
|
228
228
|
}
|
|
229
|
-
var
|
|
230
|
-
function
|
|
229
|
+
var ii = Object.prototype, si = ii.hasOwnProperty;
|
|
230
|
+
function dt(e, t, r) {
|
|
231
231
|
var n = e[t];
|
|
232
|
-
(!(
|
|
232
|
+
(!(si.call(e, t) && Te(n, r)) || r === void 0 && !(t in e)) && Ke(e, t, r);
|
|
233
233
|
}
|
|
234
|
-
function
|
|
235
|
-
var
|
|
234
|
+
function oi(e, t, r, n) {
|
|
235
|
+
var i = !r;
|
|
236
236
|
r || (r = {});
|
|
237
|
-
for (var
|
|
238
|
-
var f = t[
|
|
239
|
-
u === void 0 && (u = e[f]),
|
|
237
|
+
for (var s = -1, o = t.length; ++s < o; ) {
|
|
238
|
+
var f = t[s], u = void 0;
|
|
239
|
+
u === void 0 && (u = e[f]), i ? Ke(r, f, u) : dt(r, f, u);
|
|
240
240
|
}
|
|
241
241
|
return r;
|
|
242
242
|
}
|
|
243
|
-
var
|
|
244
|
-
function
|
|
245
|
-
return t =
|
|
246
|
-
for (var n = arguments,
|
|
247
|
-
o[
|
|
248
|
-
|
|
249
|
-
for (var f = Array(t + 1); ++
|
|
250
|
-
f[
|
|
251
|
-
return f[t] = r(o),
|
|
243
|
+
var Dt = Math.max;
|
|
244
|
+
function fi(e, t, r) {
|
|
245
|
+
return t = Dt(t === void 0 ? e.length - 1 : t, 0), function() {
|
|
246
|
+
for (var n = arguments, i = -1, s = Dt(n.length - t, 0), o = Array(s); ++i < s; )
|
|
247
|
+
o[i] = n[t + i];
|
|
248
|
+
i = -1;
|
|
249
|
+
for (var f = Array(t + 1); ++i < t; )
|
|
250
|
+
f[i] = n[i];
|
|
251
|
+
return f[t] = r(o), qn(e, this, f);
|
|
252
252
|
};
|
|
253
253
|
}
|
|
254
|
-
function
|
|
255
|
-
return
|
|
254
|
+
function ui(e, t) {
|
|
255
|
+
return ei(fi(e, t, Se), e + "");
|
|
256
256
|
}
|
|
257
|
-
var
|
|
258
|
-
function
|
|
259
|
-
return typeof e == "number" && e > -1 && e % 1 == 0 && e <=
|
|
257
|
+
var ci = 9007199254740991;
|
|
258
|
+
function pt(e) {
|
|
259
|
+
return typeof e == "number" && e > -1 && e % 1 == 0 && e <= ci;
|
|
260
260
|
}
|
|
261
261
|
function te(e) {
|
|
262
|
-
return e != null &&
|
|
262
|
+
return e != null && pt(e.length) && !I(e);
|
|
263
263
|
}
|
|
264
|
-
function
|
|
265
|
-
if (!
|
|
264
|
+
function li(e, t, r) {
|
|
265
|
+
if (!C(r))
|
|
266
266
|
return !1;
|
|
267
267
|
var n = typeof t;
|
|
268
|
-
return (n == "number" ? te(r) &&
|
|
268
|
+
return (n == "number" ? te(r) && Fe(t, r.length) : n == "string" && t in r) ? Te(r[t], e) : !1;
|
|
269
269
|
}
|
|
270
|
-
function
|
|
271
|
-
return
|
|
272
|
-
var n = -1,
|
|
273
|
-
for (
|
|
270
|
+
function ai(e) {
|
|
271
|
+
return ui(function(t, r) {
|
|
272
|
+
var n = -1, i = r.length, s = i > 1 ? r[i - 1] : void 0, o = i > 2 ? r[2] : void 0;
|
|
273
|
+
for (s = e.length > 3 && typeof s == "function" ? (i--, s) : void 0, o && li(r[0], r[1], o) && (s = i < 3 ? void 0 : s, i = 1), t = Object(t); ++n < i; ) {
|
|
274
274
|
var f = r[n];
|
|
275
|
-
f && e(t, f, n,
|
|
275
|
+
f && e(t, f, n, s);
|
|
276
276
|
}
|
|
277
277
|
return t;
|
|
278
278
|
});
|
|
279
279
|
}
|
|
280
|
-
var
|
|
280
|
+
var hi = Object.prototype;
|
|
281
281
|
function Ue(e) {
|
|
282
|
-
var t = e && e.constructor, r = typeof t == "function" && t.prototype ||
|
|
282
|
+
var t = e && e.constructor, r = typeof t == "function" && t.prototype || hi;
|
|
283
283
|
return e === r;
|
|
284
284
|
}
|
|
285
|
-
function
|
|
285
|
+
function di(e, t) {
|
|
286
286
|
for (var r = -1, n = Array(e); ++r < e; )
|
|
287
287
|
n[r] = t(r);
|
|
288
288
|
return n;
|
|
289
289
|
}
|
|
290
|
-
var
|
|
291
|
-
function
|
|
292
|
-
return
|
|
290
|
+
var pi = "[object Arguments]";
|
|
291
|
+
function jt(e) {
|
|
292
|
+
return H(e) && q(e) == pi;
|
|
293
293
|
}
|
|
294
|
-
var
|
|
294
|
+
var _r = Object.prototype, gi = _r.hasOwnProperty, yi = _r.propertyIsEnumerable, _e = jt(/* @__PURE__ */ function() {
|
|
295
295
|
return arguments;
|
|
296
|
-
}()) ?
|
|
297
|
-
return
|
|
296
|
+
}()) ? jt : function(e) {
|
|
297
|
+
return H(e) && gi.call(e, "callee") && !yi.call(e, "callee");
|
|
298
298
|
};
|
|
299
|
-
function
|
|
299
|
+
function _i() {
|
|
300
300
|
return !1;
|
|
301
301
|
}
|
|
302
|
-
var
|
|
303
|
-
|
|
304
|
-
|
|
305
|
-
function
|
|
306
|
-
return
|
|
302
|
+
var br = typeof exports == "object" && exports && !exports.nodeType && exports, Lt = br && typeof module == "object" && module && !module.nodeType && module, bi = Lt && Lt.exports === br, It = bi ? W.Buffer : void 0, mi = It ? It.isBuffer : void 0, le = mi || _i, wi = "[object Arguments]", Si = "[object Array]", Ti = "[object Boolean]", Ai = "[object Date]", Oi = "[object Error]", $i = "[object Function]", vi = "[object Map]", Ri = "[object Number]", Mi = "[object Object]", xi = "[object RegExp]", Ci = "[object Set]", Ei = "[object String]", Pi = "[object WeakMap]", Di = "[object ArrayBuffer]", ji = "[object DataView]", Li = "[object Float32Array]", Ii = "[object Float64Array]", Ni = "[object Int8Array]", Hi = "[object Int16Array]", Fi = "[object Int32Array]", Ki = "[object Uint8Array]", Ui = "[object Uint8ClampedArray]", Bi = "[object Uint16Array]", Vi = "[object Uint32Array]", R = {};
|
|
303
|
+
R[Li] = R[Ii] = R[Ni] = R[Hi] = R[Fi] = R[Ki] = R[Ui] = R[Bi] = R[Vi] = !0;
|
|
304
|
+
R[wi] = R[Si] = R[Di] = R[Ti] = R[ji] = R[Ai] = R[Oi] = R[$i] = R[vi] = R[Ri] = R[Mi] = R[xi] = R[Ci] = R[Ei] = R[Pi] = !1;
|
|
305
|
+
function ki(e) {
|
|
306
|
+
return H(e) && pt(e.length) && !!R[q(e)];
|
|
307
307
|
}
|
|
308
|
-
function
|
|
308
|
+
function gt(e) {
|
|
309
309
|
return function(t) {
|
|
310
310
|
return e(t);
|
|
311
311
|
};
|
|
312
312
|
}
|
|
313
|
-
var
|
|
313
|
+
var mr = typeof exports == "object" && exports && !exports.nodeType && exports, ge = mr && typeof module == "object" && module && !module.nodeType && module, Gi = ge && ge.exports === mr, Ze = Gi && ar.process, ae = function() {
|
|
314
314
|
try {
|
|
315
315
|
var e = ge && ge.require && ge.require("util").types;
|
|
316
|
-
return e ||
|
|
316
|
+
return e || Ze && Ze.binding && Ze.binding("util");
|
|
317
317
|
} catch {
|
|
318
318
|
}
|
|
319
|
-
}(),
|
|
320
|
-
function
|
|
321
|
-
var r =
|
|
322
|
-
for (var
|
|
323
|
-
(t ||
|
|
324
|
-
(
|
|
325
|
-
|
|
326
|
-
|
|
327
|
-
|
|
319
|
+
}(), Nt = ae && ae.isTypedArray, Be = Nt ? gt(Nt) : ki, Wi = Object.prototype, qi = Wi.hasOwnProperty;
|
|
320
|
+
function wr(e, t) {
|
|
321
|
+
var r = m(e), n = !r && _e(e), i = !r && !n && le(e), s = !r && !n && !i && Be(e), o = r || n || i || s, f = o ? di(e.length, String) : [], u = f.length;
|
|
322
|
+
for (var l in e)
|
|
323
|
+
(t || qi.call(e, l)) && !(o && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
324
|
+
(l == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
325
|
+
i && (l == "offset" || l == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
326
|
+
s && (l == "buffer" || l == "byteLength" || l == "byteOffset") || // Skip index properties.
|
|
327
|
+
Fe(l, u))) && f.push(l);
|
|
328
328
|
return f;
|
|
329
329
|
}
|
|
330
|
-
function
|
|
330
|
+
function Sr(e, t) {
|
|
331
331
|
return function(r) {
|
|
332
332
|
return e(t(r));
|
|
333
333
|
};
|
|
334
334
|
}
|
|
335
|
-
var
|
|
336
|
-
function
|
|
335
|
+
var zi = Sr(Object.keys, Object), Yi = Object.prototype, Xi = Yi.hasOwnProperty;
|
|
336
|
+
function Tr(e) {
|
|
337
337
|
if (!Ue(e))
|
|
338
|
-
return
|
|
338
|
+
return zi(e);
|
|
339
339
|
var t = [];
|
|
340
340
|
for (var r in Object(e))
|
|
341
|
-
|
|
341
|
+
Xi.call(e, r) && r != "constructor" && t.push(r);
|
|
342
342
|
return t;
|
|
343
343
|
}
|
|
344
344
|
function Ve(e) {
|
|
345
|
-
return te(e) ?
|
|
345
|
+
return te(e) ? wr(e) : Tr(e);
|
|
346
346
|
}
|
|
347
|
-
function
|
|
347
|
+
function Zi(e) {
|
|
348
348
|
var t = [];
|
|
349
349
|
if (e != null)
|
|
350
350
|
for (var r in Object(e))
|
|
351
351
|
t.push(r);
|
|
352
352
|
return t;
|
|
353
353
|
}
|
|
354
|
-
var
|
|
355
|
-
function
|
|
356
|
-
if (!
|
|
357
|
-
return
|
|
354
|
+
var Ji = Object.prototype, Qi = Ji.hasOwnProperty;
|
|
355
|
+
function es(e) {
|
|
356
|
+
if (!C(e))
|
|
357
|
+
return Zi(e);
|
|
358
358
|
var t = Ue(e), r = [];
|
|
359
359
|
for (var n in e)
|
|
360
|
-
n == "constructor" && (t || !
|
|
360
|
+
n == "constructor" && (t || !Qi.call(e, n)) || r.push(n);
|
|
361
361
|
return r;
|
|
362
362
|
}
|
|
363
|
-
function
|
|
364
|
-
return te(e) ?
|
|
363
|
+
function Ar(e) {
|
|
364
|
+
return te(e) ? wr(e, !0) : es(e);
|
|
365
365
|
}
|
|
366
|
-
var
|
|
367
|
-
function
|
|
368
|
-
if (
|
|
366
|
+
var ts = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, rs = /^\w*$/;
|
|
367
|
+
function yt(e, t) {
|
|
368
|
+
if (m(e))
|
|
369
369
|
return !1;
|
|
370
370
|
var r = typeof e;
|
|
371
|
-
return r == "number" || r == "symbol" || r == "boolean" || e == null || He(e) ? !0 :
|
|
371
|
+
return r == "number" || r == "symbol" || r == "boolean" || e == null || He(e) ? !0 : rs.test(e) || !ts.test(e) || t != null && e in Object(t);
|
|
372
372
|
}
|
|
373
|
-
var
|
|
374
|
-
function
|
|
375
|
-
this.__data__ =
|
|
373
|
+
var be = fe(Object, "create");
|
|
374
|
+
function ns() {
|
|
375
|
+
this.__data__ = be ? be(null) : {}, this.size = 0;
|
|
376
376
|
}
|
|
377
|
-
function
|
|
377
|
+
function is(e) {
|
|
378
378
|
var t = this.has(e) && delete this.__data__[e];
|
|
379
379
|
return this.size -= t ? 1 : 0, t;
|
|
380
380
|
}
|
|
381
|
-
var
|
|
382
|
-
function
|
|
381
|
+
var ss = "__lodash_hash_undefined__", os = Object.prototype, fs = os.hasOwnProperty;
|
|
382
|
+
function us(e) {
|
|
383
383
|
var t = this.__data__;
|
|
384
|
-
if (
|
|
384
|
+
if (be) {
|
|
385
385
|
var r = t[e];
|
|
386
|
-
return r ===
|
|
386
|
+
return r === ss ? void 0 : r;
|
|
387
387
|
}
|
|
388
|
-
return
|
|
388
|
+
return fs.call(t, e) ? t[e] : void 0;
|
|
389
389
|
}
|
|
390
|
-
var
|
|
391
|
-
function
|
|
390
|
+
var cs = Object.prototype, ls = cs.hasOwnProperty;
|
|
391
|
+
function as(e) {
|
|
392
392
|
var t = this.__data__;
|
|
393
|
-
return
|
|
393
|
+
return be ? t[e] !== void 0 : ls.call(t, e);
|
|
394
394
|
}
|
|
395
|
-
var
|
|
396
|
-
function
|
|
395
|
+
var hs = "__lodash_hash_undefined__";
|
|
396
|
+
function ds(e, t) {
|
|
397
397
|
var r = this.__data__;
|
|
398
|
-
return this.size += this.has(e) ? 0 : 1, r[e] =
|
|
398
|
+
return this.size += this.has(e) ? 0 : 1, r[e] = be && t === void 0 ? hs : t, this;
|
|
399
399
|
}
|
|
400
|
-
function
|
|
400
|
+
function se(e) {
|
|
401
401
|
var t = -1, r = e == null ? 0 : e.length;
|
|
402
402
|
for (this.clear(); ++t < r; ) {
|
|
403
403
|
var n = e[t];
|
|
404
404
|
this.set(n[0], n[1]);
|
|
405
405
|
}
|
|
406
406
|
}
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
411
|
-
|
|
412
|
-
function
|
|
407
|
+
se.prototype.clear = ns;
|
|
408
|
+
se.prototype.delete = is;
|
|
409
|
+
se.prototype.get = us;
|
|
410
|
+
se.prototype.has = as;
|
|
411
|
+
se.prototype.set = ds;
|
|
412
|
+
function ps() {
|
|
413
413
|
this.__data__ = [], this.size = 0;
|
|
414
414
|
}
|
|
415
|
-
function
|
|
415
|
+
function ke(e, t) {
|
|
416
416
|
for (var r = e.length; r--; )
|
|
417
|
-
if (
|
|
417
|
+
if (Te(e[r][0], t))
|
|
418
418
|
return r;
|
|
419
419
|
return -1;
|
|
420
420
|
}
|
|
421
|
-
var
|
|
422
|
-
function
|
|
423
|
-
var t = this.__data__, r =
|
|
421
|
+
var gs = Array.prototype, ys = gs.splice;
|
|
422
|
+
function _s(e) {
|
|
423
|
+
var t = this.__data__, r = ke(t, e);
|
|
424
424
|
if (r < 0)
|
|
425
425
|
return !1;
|
|
426
426
|
var n = t.length - 1;
|
|
427
|
-
return r == n ? t.pop() :
|
|
427
|
+
return r == n ? t.pop() : ys.call(t, r, 1), --this.size, !0;
|
|
428
428
|
}
|
|
429
|
-
function
|
|
430
|
-
var t = this.__data__, r =
|
|
429
|
+
function bs(e) {
|
|
430
|
+
var t = this.__data__, r = ke(t, e);
|
|
431
431
|
return r < 0 ? void 0 : t[r][1];
|
|
432
432
|
}
|
|
433
|
-
function
|
|
434
|
-
return
|
|
433
|
+
function ms(e) {
|
|
434
|
+
return ke(this.__data__, e) > -1;
|
|
435
435
|
}
|
|
436
|
-
function
|
|
437
|
-
var r = this.__data__, n =
|
|
436
|
+
function ws(e, t) {
|
|
437
|
+
var r = this.__data__, n = ke(r, e);
|
|
438
438
|
return n < 0 ? (++this.size, r.push([e, t])) : r[n][1] = t, this;
|
|
439
439
|
}
|
|
440
440
|
function Z(e) {
|
|
@@ -444,39 +444,39 @@ function Z(e) {
|
|
|
444
444
|
this.set(n[0], n[1]);
|
|
445
445
|
}
|
|
446
446
|
}
|
|
447
|
-
Z.prototype.clear =
|
|
448
|
-
Z.prototype.delete =
|
|
449
|
-
Z.prototype.get =
|
|
450
|
-
Z.prototype.has =
|
|
451
|
-
Z.prototype.set =
|
|
452
|
-
var
|
|
453
|
-
function
|
|
447
|
+
Z.prototype.clear = ps;
|
|
448
|
+
Z.prototype.delete = _s;
|
|
449
|
+
Z.prototype.get = bs;
|
|
450
|
+
Z.prototype.has = ms;
|
|
451
|
+
Z.prototype.set = ws;
|
|
452
|
+
var me = fe(W, "Map");
|
|
453
|
+
function Ss() {
|
|
454
454
|
this.size = 0, this.__data__ = {
|
|
455
|
-
hash: new
|
|
456
|
-
map: new (
|
|
457
|
-
string: new
|
|
455
|
+
hash: new se(),
|
|
456
|
+
map: new (me || Z)(),
|
|
457
|
+
string: new se()
|
|
458
458
|
};
|
|
459
459
|
}
|
|
460
|
-
function
|
|
460
|
+
function Ts(e) {
|
|
461
461
|
var t = typeof e;
|
|
462
462
|
return t == "string" || t == "number" || t == "symbol" || t == "boolean" ? e !== "__proto__" : e === null;
|
|
463
463
|
}
|
|
464
|
-
function
|
|
464
|
+
function Ge(e, t) {
|
|
465
465
|
var r = e.__data__;
|
|
466
|
-
return
|
|
466
|
+
return Ts(t) ? r[typeof t == "string" ? "string" : "hash"] : r.map;
|
|
467
467
|
}
|
|
468
|
-
function
|
|
469
|
-
var t =
|
|
468
|
+
function As(e) {
|
|
469
|
+
var t = Ge(this, e).delete(e);
|
|
470
470
|
return this.size -= t ? 1 : 0, t;
|
|
471
471
|
}
|
|
472
|
-
function
|
|
473
|
-
return
|
|
472
|
+
function Os(e) {
|
|
473
|
+
return Ge(this, e).get(e);
|
|
474
474
|
}
|
|
475
|
-
function
|
|
476
|
-
return
|
|
475
|
+
function $s(e) {
|
|
476
|
+
return Ge(this, e).has(e);
|
|
477
477
|
}
|
|
478
|
-
function
|
|
479
|
-
var r =
|
|
478
|
+
function vs(e, t) {
|
|
479
|
+
var r = Ge(this, e), n = r.size;
|
|
480
480
|
return r.set(e, t), this.size += r.size == n ? 0 : 1, this;
|
|
481
481
|
}
|
|
482
482
|
function J(e) {
|
|
@@ -486,718 +486,721 @@ function J(e) {
|
|
|
486
486
|
this.set(n[0], n[1]);
|
|
487
487
|
}
|
|
488
488
|
}
|
|
489
|
-
J.prototype.clear =
|
|
490
|
-
J.prototype.delete =
|
|
491
|
-
J.prototype.get =
|
|
492
|
-
J.prototype.has =
|
|
493
|
-
J.prototype.set =
|
|
494
|
-
var
|
|
495
|
-
function
|
|
489
|
+
J.prototype.clear = Ss;
|
|
490
|
+
J.prototype.delete = As;
|
|
491
|
+
J.prototype.get = Os;
|
|
492
|
+
J.prototype.has = $s;
|
|
493
|
+
J.prototype.set = vs;
|
|
494
|
+
var Rs = "Expected a function";
|
|
495
|
+
function _t(e, t) {
|
|
496
496
|
if (typeof e != "function" || t != null && typeof t != "function")
|
|
497
|
-
throw new TypeError(
|
|
497
|
+
throw new TypeError(Rs);
|
|
498
498
|
var r = function() {
|
|
499
|
-
var n = arguments,
|
|
500
|
-
if (
|
|
501
|
-
return
|
|
499
|
+
var n = arguments, i = t ? t.apply(this, n) : n[0], s = r.cache;
|
|
500
|
+
if (s.has(i))
|
|
501
|
+
return s.get(i);
|
|
502
502
|
var o = e.apply(this, n);
|
|
503
|
-
return r.cache =
|
|
503
|
+
return r.cache = s.set(i, o) || s, o;
|
|
504
504
|
};
|
|
505
|
-
return r.cache = new (
|
|
505
|
+
return r.cache = new (_t.Cache || J)(), r;
|
|
506
506
|
}
|
|
507
|
-
|
|
508
|
-
var
|
|
509
|
-
function
|
|
510
|
-
var t =
|
|
511
|
-
return r.size ===
|
|
507
|
+
_t.Cache = J;
|
|
508
|
+
var Ms = 500;
|
|
509
|
+
function xs(e) {
|
|
510
|
+
var t = _t(e, function(n) {
|
|
511
|
+
return r.size === Ms && r.clear(), n;
|
|
512
512
|
}), r = t.cache;
|
|
513
513
|
return t;
|
|
514
514
|
}
|
|
515
|
-
var
|
|
515
|
+
var Cs = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, Es = /\\(\\)?/g, Ps = xs(function(e) {
|
|
516
516
|
var t = [];
|
|
517
|
-
return e.charCodeAt(0) === 46 && t.push(""), e.replace(
|
|
518
|
-
t.push(
|
|
517
|
+
return e.charCodeAt(0) === 46 && t.push(""), e.replace(Cs, function(r, n, i, s) {
|
|
518
|
+
t.push(i ? s.replace(Es, "$1") : n || r);
|
|
519
519
|
}), t;
|
|
520
520
|
});
|
|
521
|
-
function
|
|
522
|
-
return e == null ? "" :
|
|
521
|
+
function Or(e) {
|
|
522
|
+
return e == null ? "" : pr(e);
|
|
523
523
|
}
|
|
524
|
-
function
|
|
525
|
-
return
|
|
524
|
+
function bt(e, t) {
|
|
525
|
+
return m(e) ? e : yt(e, t) ? [e] : Ps(Or(e));
|
|
526
526
|
}
|
|
527
|
-
function
|
|
527
|
+
function Ae(e) {
|
|
528
528
|
if (typeof e == "string" || He(e))
|
|
529
529
|
return e;
|
|
530
530
|
var t = e + "";
|
|
531
531
|
return t == "0" && 1 / e == -1 / 0 ? "-0" : t;
|
|
532
532
|
}
|
|
533
|
-
function
|
|
534
|
-
t =
|
|
533
|
+
function $r(e, t) {
|
|
534
|
+
t = bt(t, e);
|
|
535
535
|
for (var r = 0, n = t.length; e != null && r < n; )
|
|
536
|
-
e = e[
|
|
536
|
+
e = e[Ae(t[r++])];
|
|
537
537
|
return r && r == n ? e : void 0;
|
|
538
538
|
}
|
|
539
|
-
function
|
|
540
|
-
var n = e == null ? void 0 :
|
|
539
|
+
function T(e, t, r) {
|
|
540
|
+
var n = e == null ? void 0 : $r(e, t);
|
|
541
541
|
return n === void 0 ? r : n;
|
|
542
542
|
}
|
|
543
|
-
function
|
|
544
|
-
for (var r = -1, n = t.length,
|
|
545
|
-
e[
|
|
543
|
+
function Ds(e, t) {
|
|
544
|
+
for (var r = -1, n = t.length, i = e.length; ++r < n; )
|
|
545
|
+
e[i + r] = t[r];
|
|
546
546
|
return e;
|
|
547
547
|
}
|
|
548
|
-
var
|
|
548
|
+
var vr = Sr(Object.getPrototypeOf, Object), js = "[object Object]", Ls = Function.prototype, Is = Object.prototype, Rr = Ls.toString, Ns = Is.hasOwnProperty, Hs = Rr.call(Object);
|
|
549
549
|
function X(e) {
|
|
550
|
-
if (!
|
|
550
|
+
if (!H(e) || q(e) != js)
|
|
551
551
|
return !1;
|
|
552
|
-
var t =
|
|
552
|
+
var t = vr(e);
|
|
553
553
|
if (t === null)
|
|
554
554
|
return !0;
|
|
555
|
-
var r =
|
|
556
|
-
return typeof r == "function" && r instanceof r &&
|
|
555
|
+
var r = Ns.call(t, "constructor") && t.constructor;
|
|
556
|
+
return typeof r == "function" && r instanceof r && Rr.call(r) == Hs;
|
|
557
557
|
}
|
|
558
|
-
function
|
|
558
|
+
function Fs() {
|
|
559
559
|
this.__data__ = new Z(), this.size = 0;
|
|
560
560
|
}
|
|
561
|
-
function
|
|
561
|
+
function Ks(e) {
|
|
562
562
|
var t = this.__data__, r = t.delete(e);
|
|
563
563
|
return this.size = t.size, r;
|
|
564
564
|
}
|
|
565
|
-
function
|
|
565
|
+
function Us(e) {
|
|
566
566
|
return this.__data__.get(e);
|
|
567
567
|
}
|
|
568
|
-
function
|
|
568
|
+
function Bs(e) {
|
|
569
569
|
return this.__data__.has(e);
|
|
570
570
|
}
|
|
571
|
-
var
|
|
572
|
-
function
|
|
571
|
+
var Vs = 200;
|
|
572
|
+
function ks(e, t) {
|
|
573
573
|
var r = this.__data__;
|
|
574
574
|
if (r instanceof Z) {
|
|
575
575
|
var n = r.__data__;
|
|
576
|
-
if (!
|
|
576
|
+
if (!me || n.length < Vs - 1)
|
|
577
577
|
return n.push([e, t]), this.size = ++r.size, this;
|
|
578
578
|
r = this.__data__ = new J(n);
|
|
579
579
|
}
|
|
580
580
|
return r.set(e, t), this.size = r.size, this;
|
|
581
581
|
}
|
|
582
|
-
function
|
|
582
|
+
function k(e) {
|
|
583
583
|
var t = this.__data__ = new Z(e);
|
|
584
584
|
this.size = t.size;
|
|
585
585
|
}
|
|
586
|
-
|
|
587
|
-
|
|
588
|
-
|
|
589
|
-
|
|
590
|
-
|
|
591
|
-
var
|
|
592
|
-
function
|
|
586
|
+
k.prototype.clear = Fs;
|
|
587
|
+
k.prototype.delete = Ks;
|
|
588
|
+
k.prototype.get = Us;
|
|
589
|
+
k.prototype.has = Bs;
|
|
590
|
+
k.prototype.set = ks;
|
|
591
|
+
var Mr = typeof exports == "object" && exports && !exports.nodeType && exports, Ht = Mr && typeof module == "object" && module && !module.nodeType && module, Gs = Ht && Ht.exports === Mr, Ft = Gs ? W.Buffer : void 0, Kt = Ft ? Ft.allocUnsafe : void 0;
|
|
592
|
+
function xr(e, t) {
|
|
593
593
|
if (t)
|
|
594
594
|
return e.slice();
|
|
595
|
-
var r = e.length, n =
|
|
595
|
+
var r = e.length, n = Kt ? Kt(r) : new e.constructor(r);
|
|
596
596
|
return e.copy(n), n;
|
|
597
597
|
}
|
|
598
|
-
function
|
|
599
|
-
for (var r = -1, n = e == null ? 0 : e.length,
|
|
598
|
+
function Ws(e, t) {
|
|
599
|
+
for (var r = -1, n = e == null ? 0 : e.length, i = 0, s = []; ++r < n; ) {
|
|
600
600
|
var o = e[r];
|
|
601
|
-
t(o, r, e) && (i
|
|
601
|
+
t(o, r, e) && (s[i++] = o);
|
|
602
602
|
}
|
|
603
|
-
return
|
|
603
|
+
return s;
|
|
604
604
|
}
|
|
605
|
-
function
|
|
605
|
+
function qs() {
|
|
606
606
|
return [];
|
|
607
607
|
}
|
|
608
|
-
var
|
|
609
|
-
return e == null ? [] : (e = Object(e),
|
|
610
|
-
return
|
|
608
|
+
var zs = Object.prototype, Ys = zs.propertyIsEnumerable, Ut = Object.getOwnPropertySymbols, Xs = Ut ? function(e) {
|
|
609
|
+
return e == null ? [] : (e = Object(e), Ws(Ut(e), function(t) {
|
|
610
|
+
return Ys.call(e, t);
|
|
611
611
|
}));
|
|
612
|
-
} :
|
|
613
|
-
function
|
|
612
|
+
} : qs;
|
|
613
|
+
function Zs(e, t, r) {
|
|
614
614
|
var n = t(e);
|
|
615
|
-
return
|
|
615
|
+
return m(e) ? n : Ds(n, r(e));
|
|
616
616
|
}
|
|
617
|
-
function
|
|
618
|
-
return
|
|
617
|
+
function it(e) {
|
|
618
|
+
return Zs(e, Ve, Xs);
|
|
619
619
|
}
|
|
620
|
-
var st = fe(W, "DataView"),
|
|
621
|
-
(st &&
|
|
622
|
-
var t = q(e), r = t ==
|
|
620
|
+
var st = fe(W, "DataView"), ot = fe(W, "Promise"), ft = fe(W, "Set"), Bt = "[object Map]", Js = "[object Object]", Vt = "[object Promise]", kt = "[object Set]", Gt = "[object WeakMap]", Wt = "[object DataView]", Qs = oe(st), eo = oe(me), to = oe(ot), ro = oe(ft), no = oe(nt), K = q;
|
|
621
|
+
(st && K(new st(new ArrayBuffer(1))) != Wt || me && K(new me()) != Bt || ot && K(ot.resolve()) != Vt || ft && K(new ft()) != kt || nt && K(new nt()) != Gt) && (K = function(e) {
|
|
622
|
+
var t = q(e), r = t == Js ? e.constructor : void 0, n = r ? oe(r) : "";
|
|
623
623
|
if (n)
|
|
624
624
|
switch (n) {
|
|
625
|
-
case
|
|
626
|
-
return
|
|
627
|
-
case
|
|
628
|
-
return Ut;
|
|
629
|
-
case Xi:
|
|
625
|
+
case Qs:
|
|
626
|
+
return Wt;
|
|
627
|
+
case eo:
|
|
630
628
|
return Bt;
|
|
631
|
-
case
|
|
629
|
+
case to:
|
|
632
630
|
return Vt;
|
|
633
|
-
case
|
|
631
|
+
case ro:
|
|
632
|
+
return kt;
|
|
633
|
+
case no:
|
|
634
634
|
return Gt;
|
|
635
635
|
}
|
|
636
636
|
return t;
|
|
637
637
|
});
|
|
638
|
-
var
|
|
639
|
-
function
|
|
638
|
+
var io = Object.prototype, so = io.hasOwnProperty;
|
|
639
|
+
function oo(e) {
|
|
640
640
|
var t = e.length, r = new e.constructor(t);
|
|
641
|
-
return t && typeof e[0] == "string" &&
|
|
641
|
+
return t && typeof e[0] == "string" && so.call(e, "index") && (r.index = e.index, r.input = e.input), r;
|
|
642
642
|
}
|
|
643
|
-
var
|
|
644
|
-
function
|
|
643
|
+
var Ee = W.Uint8Array;
|
|
644
|
+
function mt(e) {
|
|
645
645
|
var t = new e.constructor(e.byteLength);
|
|
646
|
-
return new
|
|
646
|
+
return new Ee(t).set(new Ee(e)), t;
|
|
647
647
|
}
|
|
648
|
-
function
|
|
649
|
-
var r =
|
|
648
|
+
function fo(e, t) {
|
|
649
|
+
var r = mt(e.buffer);
|
|
650
650
|
return new e.constructor(r, e.byteOffset, e.byteLength);
|
|
651
651
|
}
|
|
652
|
-
var
|
|
653
|
-
function
|
|
654
|
-
var t = new e.constructor(e.source,
|
|
652
|
+
var uo = /\w*$/;
|
|
653
|
+
function co(e) {
|
|
654
|
+
var t = new e.constructor(e.source, uo.exec(e));
|
|
655
655
|
return t.lastIndex = e.lastIndex, t;
|
|
656
656
|
}
|
|
657
|
-
var
|
|
658
|
-
function
|
|
659
|
-
return
|
|
657
|
+
var qt = G ? G.prototype : void 0, zt = qt ? qt.valueOf : void 0;
|
|
658
|
+
function lo(e) {
|
|
659
|
+
return zt ? Object(zt.call(e)) : {};
|
|
660
660
|
}
|
|
661
|
-
function
|
|
662
|
-
var r = t ?
|
|
661
|
+
function Cr(e, t) {
|
|
662
|
+
var r = t ? mt(e.buffer) : e.buffer;
|
|
663
663
|
return new e.constructor(r, e.byteOffset, e.length);
|
|
664
664
|
}
|
|
665
|
-
var
|
|
666
|
-
function
|
|
665
|
+
var ao = "[object Boolean]", ho = "[object Date]", po = "[object Map]", go = "[object Number]", yo = "[object RegExp]", _o = "[object Set]", bo = "[object String]", mo = "[object Symbol]", wo = "[object ArrayBuffer]", So = "[object DataView]", To = "[object Float32Array]", Ao = "[object Float64Array]", Oo = "[object Int8Array]", $o = "[object Int16Array]", vo = "[object Int32Array]", Ro = "[object Uint8Array]", Mo = "[object Uint8ClampedArray]", xo = "[object Uint16Array]", Co = "[object Uint32Array]";
|
|
666
|
+
function Eo(e, t, r) {
|
|
667
667
|
var n = e.constructor;
|
|
668
668
|
switch (t) {
|
|
669
|
-
case go:
|
|
670
|
-
return yt(e);
|
|
671
|
-
case oo:
|
|
672
|
-
case fo:
|
|
673
|
-
return new n(+e);
|
|
674
|
-
case _o:
|
|
675
|
-
return ro(e);
|
|
676
|
-
case yo:
|
|
677
|
-
case mo:
|
|
678
|
-
case bo:
|
|
679
669
|
case wo:
|
|
670
|
+
return mt(e);
|
|
671
|
+
case ao:
|
|
672
|
+
case ho:
|
|
673
|
+
return new n(+e);
|
|
680
674
|
case So:
|
|
675
|
+
return fo(e);
|
|
681
676
|
case To:
|
|
682
677
|
case Ao:
|
|
683
678
|
case Oo:
|
|
684
679
|
case $o:
|
|
685
|
-
|
|
686
|
-
case
|
|
680
|
+
case vo:
|
|
681
|
+
case Ro:
|
|
682
|
+
case Mo:
|
|
683
|
+
case xo:
|
|
684
|
+
case Co:
|
|
685
|
+
return Cr(e, r);
|
|
686
|
+
case po:
|
|
687
687
|
return new n();
|
|
688
|
-
case
|
|
689
|
-
case
|
|
688
|
+
case go:
|
|
689
|
+
case bo:
|
|
690
690
|
return new n(e);
|
|
691
|
-
case
|
|
692
|
-
return
|
|
693
|
-
case
|
|
691
|
+
case yo:
|
|
692
|
+
return co(e);
|
|
693
|
+
case _o:
|
|
694
694
|
return new n();
|
|
695
|
-
case
|
|
696
|
-
return
|
|
695
|
+
case mo:
|
|
696
|
+
return lo(e);
|
|
697
697
|
}
|
|
698
698
|
}
|
|
699
|
-
function
|
|
700
|
-
return typeof e.constructor == "function" && !Ue(e) ?
|
|
699
|
+
function Er(e) {
|
|
700
|
+
return typeof e.constructor == "function" && !Ue(e) ? Wn(vr(e)) : {};
|
|
701
701
|
}
|
|
702
|
-
var
|
|
703
|
-
function
|
|
704
|
-
return
|
|
702
|
+
var Po = "[object Map]";
|
|
703
|
+
function Do(e) {
|
|
704
|
+
return H(e) && K(e) == Po;
|
|
705
705
|
}
|
|
706
|
-
var
|
|
707
|
-
function
|
|
708
|
-
return
|
|
706
|
+
var Yt = ae && ae.isMap, jo = Yt ? gt(Yt) : Do, Lo = "[object Set]";
|
|
707
|
+
function Io(e) {
|
|
708
|
+
return H(e) && K(e) == Lo;
|
|
709
709
|
}
|
|
710
|
-
var
|
|
711
|
-
|
|
712
|
-
|
|
713
|
-
function
|
|
714
|
-
var o, f = t &
|
|
710
|
+
var Xt = ae && ae.isSet, No = Xt ? gt(Xt) : Io, Ho = 1, Pr = "[object Arguments]", Fo = "[object Array]", Ko = "[object Boolean]", Uo = "[object Date]", Bo = "[object Error]", Dr = "[object Function]", Vo = "[object GeneratorFunction]", ko = "[object Map]", Go = "[object Number]", jr = "[object Object]", Wo = "[object RegExp]", qo = "[object Set]", zo = "[object String]", Yo = "[object Symbol]", Xo = "[object WeakMap]", Zo = "[object ArrayBuffer]", Jo = "[object DataView]", Qo = "[object Float32Array]", ef = "[object Float64Array]", tf = "[object Int8Array]", rf = "[object Int16Array]", nf = "[object Int32Array]", sf = "[object Uint8Array]", of = "[object Uint8ClampedArray]", ff = "[object Uint16Array]", uf = "[object Uint32Array]", v = {};
|
|
711
|
+
v[Pr] = v[Fo] = v[Zo] = v[Jo] = v[Ko] = v[Uo] = v[Qo] = v[ef] = v[tf] = v[rf] = v[nf] = v[ko] = v[Go] = v[jr] = v[Wo] = v[qo] = v[zo] = v[Yo] = v[sf] = v[of] = v[ff] = v[uf] = !0;
|
|
712
|
+
v[Bo] = v[Dr] = v[Xo] = !1;
|
|
713
|
+
function Me(e, t, r, n, i, s) {
|
|
714
|
+
var o, f = t & Ho;
|
|
715
715
|
if (o !== void 0)
|
|
716
716
|
return o;
|
|
717
|
-
if (!
|
|
717
|
+
if (!C(e))
|
|
718
718
|
return e;
|
|
719
|
-
var u =
|
|
719
|
+
var u = m(e);
|
|
720
720
|
if (u)
|
|
721
|
-
o =
|
|
721
|
+
o = oo(e);
|
|
722
722
|
else {
|
|
723
|
-
var
|
|
724
|
-
if (
|
|
725
|
-
return
|
|
726
|
-
if (
|
|
727
|
-
o = c ? {} :
|
|
723
|
+
var l = K(e), c = l == Dr || l == Vo;
|
|
724
|
+
if (le(e))
|
|
725
|
+
return xr(e, f);
|
|
726
|
+
if (l == jr || l == Pr || c && !i)
|
|
727
|
+
o = c ? {} : Er(e);
|
|
728
728
|
else {
|
|
729
|
-
if (
|
|
730
|
-
return
|
|
731
|
-
o =
|
|
729
|
+
if (!v[l])
|
|
730
|
+
return i ? e : {};
|
|
731
|
+
o = Eo(e, l, f);
|
|
732
732
|
}
|
|
733
733
|
}
|
|
734
|
-
|
|
735
|
-
var
|
|
736
|
-
if (
|
|
737
|
-
return
|
|
738
|
-
|
|
739
|
-
o.add(
|
|
740
|
-
}) :
|
|
741
|
-
o.set(
|
|
734
|
+
s || (s = new k());
|
|
735
|
+
var a = s.get(e);
|
|
736
|
+
if (a)
|
|
737
|
+
return a;
|
|
738
|
+
s.set(e, o), No(e) ? e.forEach(function(g) {
|
|
739
|
+
o.add(Me(g, t, r, g, e, s));
|
|
740
|
+
}) : jo(e) && e.forEach(function(g, S) {
|
|
741
|
+
o.set(S, Me(g, t, r, S, e, s));
|
|
742
742
|
});
|
|
743
|
-
var p =
|
|
744
|
-
return
|
|
745
|
-
|
|
743
|
+
var p = it, b = u ? void 0 : p(e);
|
|
744
|
+
return yr(b || e, function(g, S) {
|
|
745
|
+
b && (S = g, g = e[S]), dt(o, S, Me(g, t, r, S, e, s));
|
|
746
746
|
}), o;
|
|
747
747
|
}
|
|
748
|
-
var
|
|
748
|
+
var cf = 1, lf = 4;
|
|
749
749
|
function F(e) {
|
|
750
|
-
return
|
|
750
|
+
return Me(e, cf | lf);
|
|
751
751
|
}
|
|
752
|
-
function
|
|
753
|
-
for (var t = -1, r = e == null ? 0 : e.length, n = 0,
|
|
754
|
-
var
|
|
755
|
-
|
|
752
|
+
function Je(e) {
|
|
753
|
+
for (var t = -1, r = e == null ? 0 : e.length, n = 0, i = []; ++t < r; ) {
|
|
754
|
+
var s = e[t];
|
|
755
|
+
s && (i[n++] = s);
|
|
756
756
|
}
|
|
757
|
-
return
|
|
757
|
+
return i;
|
|
758
758
|
}
|
|
759
|
-
var
|
|
760
|
-
function
|
|
761
|
-
return this.__data__.set(e,
|
|
759
|
+
var af = "__lodash_hash_undefined__";
|
|
760
|
+
function hf(e) {
|
|
761
|
+
return this.__data__.set(e, af), this;
|
|
762
762
|
}
|
|
763
|
-
function
|
|
763
|
+
function df(e) {
|
|
764
764
|
return this.__data__.has(e);
|
|
765
765
|
}
|
|
766
|
-
function
|
|
766
|
+
function Pe(e) {
|
|
767
767
|
var t = -1, r = e == null ? 0 : e.length;
|
|
768
768
|
for (this.__data__ = new J(); ++t < r; )
|
|
769
769
|
this.add(e[t]);
|
|
770
770
|
}
|
|
771
|
-
|
|
772
|
-
|
|
773
|
-
function
|
|
771
|
+
Pe.prototype.add = Pe.prototype.push = hf;
|
|
772
|
+
Pe.prototype.has = df;
|
|
773
|
+
function pf(e, t) {
|
|
774
774
|
for (var r = -1, n = e == null ? 0 : e.length; ++r < n; )
|
|
775
775
|
if (t(e[r], r, e))
|
|
776
776
|
return !0;
|
|
777
777
|
return !1;
|
|
778
778
|
}
|
|
779
|
-
function
|
|
779
|
+
function gf(e, t) {
|
|
780
780
|
return e.has(t);
|
|
781
781
|
}
|
|
782
|
-
var
|
|
783
|
-
function
|
|
784
|
-
var o = r &
|
|
782
|
+
var yf = 1, _f = 2;
|
|
783
|
+
function Lr(e, t, r, n, i, s) {
|
|
784
|
+
var o = r & yf, f = e.length, u = t.length;
|
|
785
785
|
if (f != u && !(o && u > f))
|
|
786
786
|
return !1;
|
|
787
|
-
var
|
|
788
|
-
if (
|
|
789
|
-
return
|
|
790
|
-
var
|
|
791
|
-
for (
|
|
792
|
-
var g = e[
|
|
787
|
+
var l = s.get(e), c = s.get(t);
|
|
788
|
+
if (l && c)
|
|
789
|
+
return l == t && c == e;
|
|
790
|
+
var a = -1, p = !0, b = r & _f ? new Pe() : void 0;
|
|
791
|
+
for (s.set(e, t), s.set(t, e); ++a < f; ) {
|
|
792
|
+
var g = e[a], S = t[a];
|
|
793
793
|
if (n)
|
|
794
|
-
var
|
|
795
|
-
if (
|
|
796
|
-
if (
|
|
794
|
+
var A = o ? n(S, g, a, t, e, s) : n(g, S, a, e, t, s);
|
|
795
|
+
if (A !== void 0) {
|
|
796
|
+
if (A)
|
|
797
797
|
continue;
|
|
798
798
|
p = !1;
|
|
799
799
|
break;
|
|
800
800
|
}
|
|
801
|
-
if (
|
|
802
|
-
if (!
|
|
803
|
-
if (!
|
|
804
|
-
return
|
|
801
|
+
if (b) {
|
|
802
|
+
if (!pf(t, function(O, P) {
|
|
803
|
+
if (!gf(b, P) && (g === O || i(g, O, r, n, s)))
|
|
804
|
+
return b.push(P);
|
|
805
805
|
})) {
|
|
806
806
|
p = !1;
|
|
807
807
|
break;
|
|
808
808
|
}
|
|
809
|
-
} else if (!(g ===
|
|
809
|
+
} else if (!(g === S || i(g, S, r, n, s))) {
|
|
810
810
|
p = !1;
|
|
811
811
|
break;
|
|
812
812
|
}
|
|
813
813
|
}
|
|
814
|
-
return
|
|
814
|
+
return s.delete(e), s.delete(t), p;
|
|
815
815
|
}
|
|
816
|
-
function
|
|
816
|
+
function bf(e) {
|
|
817
817
|
var t = -1, r = Array(e.size);
|
|
818
|
-
return e.forEach(function(n,
|
|
819
|
-
r[++t] = [
|
|
818
|
+
return e.forEach(function(n, i) {
|
|
819
|
+
r[++t] = [i, n];
|
|
820
820
|
}), r;
|
|
821
821
|
}
|
|
822
|
-
function
|
|
822
|
+
function mf(e) {
|
|
823
823
|
var t = -1, r = Array(e.size);
|
|
824
824
|
return e.forEach(function(n) {
|
|
825
825
|
r[++t] = n;
|
|
826
826
|
}), r;
|
|
827
827
|
}
|
|
828
|
-
var
|
|
829
|
-
function
|
|
828
|
+
var wf = 1, Sf = 2, Tf = "[object Boolean]", Af = "[object Date]", Of = "[object Error]", $f = "[object Map]", vf = "[object Number]", Rf = "[object RegExp]", Mf = "[object Set]", xf = "[object String]", Cf = "[object Symbol]", Ef = "[object ArrayBuffer]", Pf = "[object DataView]", Zt = G ? G.prototype : void 0, Qe = Zt ? Zt.valueOf : void 0;
|
|
829
|
+
function Df(e, t, r, n, i, s, o) {
|
|
830
830
|
switch (r) {
|
|
831
|
-
case
|
|
831
|
+
case Pf:
|
|
832
832
|
if (e.byteLength != t.byteLength || e.byteOffset != t.byteOffset)
|
|
833
833
|
return !1;
|
|
834
834
|
e = e.buffer, t = t.buffer;
|
|
835
|
-
case
|
|
836
|
-
return !(e.byteLength != t.byteLength || !
|
|
837
|
-
case yf:
|
|
838
|
-
case mf:
|
|
839
|
-
case Sf:
|
|
840
|
-
return Se(+e, +t);
|
|
841
|
-
case bf:
|
|
842
|
-
return e.name == t.name && e.message == t.message;
|
|
835
|
+
case Ef:
|
|
836
|
+
return !(e.byteLength != t.byteLength || !s(new Ee(e), new Ee(t)));
|
|
843
837
|
case Tf:
|
|
838
|
+
case Af:
|
|
839
|
+
case vf:
|
|
840
|
+
return Te(+e, +t);
|
|
844
841
|
case Of:
|
|
842
|
+
return e.name == t.name && e.message == t.message;
|
|
843
|
+
case Rf:
|
|
844
|
+
case xf:
|
|
845
845
|
return e == t + "";
|
|
846
|
-
case
|
|
847
|
-
var f =
|
|
848
|
-
case
|
|
849
|
-
var u = n &
|
|
850
|
-
if (f || (f =
|
|
846
|
+
case $f:
|
|
847
|
+
var f = bf;
|
|
848
|
+
case Mf:
|
|
849
|
+
var u = n & wf;
|
|
850
|
+
if (f || (f = mf), e.size != t.size && !u)
|
|
851
851
|
return !1;
|
|
852
|
-
var
|
|
853
|
-
if (
|
|
854
|
-
return
|
|
855
|
-
n |=
|
|
856
|
-
var c =
|
|
852
|
+
var l = o.get(e);
|
|
853
|
+
if (l)
|
|
854
|
+
return l == t;
|
|
855
|
+
n |= Sf, o.set(e, t);
|
|
856
|
+
var c = Lr(f(e), f(t), n, i, s, o);
|
|
857
857
|
return o.delete(e), c;
|
|
858
|
-
case
|
|
859
|
-
if (
|
|
860
|
-
return
|
|
858
|
+
case Cf:
|
|
859
|
+
if (Qe)
|
|
860
|
+
return Qe.call(e) == Qe.call(t);
|
|
861
861
|
}
|
|
862
862
|
return !1;
|
|
863
863
|
}
|
|
864
|
-
var
|
|
865
|
-
function
|
|
866
|
-
var o = r &
|
|
864
|
+
var jf = 1, Lf = Object.prototype, If = Lf.hasOwnProperty;
|
|
865
|
+
function Nf(e, t, r, n, i, s) {
|
|
866
|
+
var o = r & jf, f = it(e), u = f.length, l = it(t), c = l.length;
|
|
867
867
|
if (u != c && !o)
|
|
868
868
|
return !1;
|
|
869
|
-
for (var
|
|
870
|
-
var p = f[
|
|
871
|
-
if (!(o ? p in t :
|
|
869
|
+
for (var a = u; a--; ) {
|
|
870
|
+
var p = f[a];
|
|
871
|
+
if (!(o ? p in t : If.call(t, p)))
|
|
872
872
|
return !1;
|
|
873
873
|
}
|
|
874
|
-
var
|
|
875
|
-
if (
|
|
876
|
-
return
|
|
877
|
-
var
|
|
878
|
-
|
|
879
|
-
for (var
|
|
880
|
-
p = f[
|
|
881
|
-
var
|
|
874
|
+
var b = s.get(e), g = s.get(t);
|
|
875
|
+
if (b && g)
|
|
876
|
+
return b == t && g == e;
|
|
877
|
+
var S = !0;
|
|
878
|
+
s.set(e, t), s.set(t, e);
|
|
879
|
+
for (var A = o; ++a < u; ) {
|
|
880
|
+
p = f[a];
|
|
881
|
+
var O = e[p], P = t[p];
|
|
882
882
|
if (n)
|
|
883
|
-
var
|
|
884
|
-
if (!(
|
|
885
|
-
|
|
883
|
+
var x = o ? n(P, O, p, t, e, s) : n(O, P, p, e, t, s);
|
|
884
|
+
if (!(x === void 0 ? O === P || i(O, P, r, n, s) : x)) {
|
|
885
|
+
S = !1;
|
|
886
886
|
break;
|
|
887
887
|
}
|
|
888
|
-
|
|
888
|
+
A || (A = p == "constructor");
|
|
889
889
|
}
|
|
890
|
-
if (
|
|
891
|
-
var
|
|
892
|
-
|
|
890
|
+
if (S && !A) {
|
|
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) && (S = !1);
|
|
893
893
|
}
|
|
894
|
-
return
|
|
894
|
+
return s.delete(e), s.delete(t), S;
|
|
895
895
|
}
|
|
896
|
-
var
|
|
897
|
-
function
|
|
898
|
-
var o =
|
|
899
|
-
u = u ==
|
|
900
|
-
var c = u ==
|
|
901
|
-
if (p &&
|
|
902
|
-
if (!
|
|
896
|
+
var Hf = 1, Jt = "[object Arguments]", Qt = "[object Array]", Oe = "[object Object]", Ff = Object.prototype, er = Ff.hasOwnProperty;
|
|
897
|
+
function Kf(e, t, r, n, i, s) {
|
|
898
|
+
var o = m(e), f = m(t), u = o ? Qt : K(e), l = f ? Qt : K(t);
|
|
899
|
+
u = u == Jt ? Oe : u, l = l == Jt ? Oe : l;
|
|
900
|
+
var c = u == Oe, a = l == Oe, p = u == l;
|
|
901
|
+
if (p && le(e)) {
|
|
902
|
+
if (!le(t))
|
|
903
903
|
return !1;
|
|
904
904
|
o = !0, c = !1;
|
|
905
905
|
}
|
|
906
906
|
if (p && !c)
|
|
907
|
-
return
|
|
908
|
-
if (!(r &
|
|
909
|
-
var
|
|
910
|
-
if (
|
|
911
|
-
var
|
|
912
|
-
return
|
|
907
|
+
return s || (s = new k()), o || Be(e) ? Lr(e, t, r, n, i, s) : Df(e, t, u, r, n, i, s);
|
|
908
|
+
if (!(r & Hf)) {
|
|
909
|
+
var b = c && er.call(e, "__wrapped__"), g = a && er.call(t, "__wrapped__");
|
|
910
|
+
if (b || g) {
|
|
911
|
+
var S = b ? e.value() : e, A = g ? t.value() : t;
|
|
912
|
+
return s || (s = new k()), i(S, A, r, n, s);
|
|
913
913
|
}
|
|
914
914
|
}
|
|
915
|
-
return p ? (
|
|
915
|
+
return p ? (s || (s = new k()), Nf(e, t, r, n, i, s)) : !1;
|
|
916
916
|
}
|
|
917
|
-
function
|
|
918
|
-
return e === t ? !0 : e == null || t == null || !
|
|
917
|
+
function wt(e, t, r, n, i) {
|
|
918
|
+
return e === t ? !0 : e == null || t == null || !H(e) && !H(t) ? e !== e && t !== t : Kf(e, t, r, n, wt, i);
|
|
919
919
|
}
|
|
920
|
-
var
|
|
921
|
-
function
|
|
922
|
-
var
|
|
920
|
+
var Uf = 1, Bf = 2;
|
|
921
|
+
function Vf(e, t, r, n) {
|
|
922
|
+
var i = r.length, s = i;
|
|
923
923
|
if (e == null)
|
|
924
|
-
return !
|
|
925
|
-
for (e = Object(e);
|
|
926
|
-
var o = r[
|
|
924
|
+
return !s;
|
|
925
|
+
for (e = Object(e); i--; ) {
|
|
926
|
+
var o = r[i];
|
|
927
927
|
if (o[2] ? o[1] !== e[o[0]] : !(o[0] in e))
|
|
928
928
|
return !1;
|
|
929
929
|
}
|
|
930
|
-
for (; ++
|
|
931
|
-
o = r[
|
|
932
|
-
var f = o[0], u = e[f],
|
|
930
|
+
for (; ++i < s; ) {
|
|
931
|
+
o = r[i];
|
|
932
|
+
var f = o[0], u = e[f], l = o[1];
|
|
933
933
|
if (o[2]) {
|
|
934
934
|
if (u === void 0 && !(f in e))
|
|
935
935
|
return !1;
|
|
936
936
|
} else {
|
|
937
|
-
var c = new
|
|
938
|
-
if (!(
|
|
937
|
+
var c = new k(), a;
|
|
938
|
+
if (!(a === void 0 ? wt(l, u, Uf | Bf, n, c) : a))
|
|
939
939
|
return !1;
|
|
940
940
|
}
|
|
941
941
|
}
|
|
942
942
|
return !0;
|
|
943
943
|
}
|
|
944
|
-
function
|
|
945
|
-
return e === e && !
|
|
944
|
+
function Ir(e) {
|
|
945
|
+
return e === e && !C(e);
|
|
946
946
|
}
|
|
947
|
-
function
|
|
947
|
+
function kf(e) {
|
|
948
948
|
for (var t = Ve(e), r = t.length; r--; ) {
|
|
949
|
-
var n = t[r],
|
|
950
|
-
t[r] = [n,
|
|
949
|
+
var n = t[r], i = e[n];
|
|
950
|
+
t[r] = [n, i, Ir(i)];
|
|
951
951
|
}
|
|
952
952
|
return t;
|
|
953
953
|
}
|
|
954
|
-
function
|
|
954
|
+
function Nr(e, t) {
|
|
955
955
|
return function(r) {
|
|
956
956
|
return r == null ? !1 : r[e] === t && (t !== void 0 || e in Object(r));
|
|
957
957
|
};
|
|
958
958
|
}
|
|
959
|
-
function
|
|
960
|
-
var t =
|
|
961
|
-
return t.length == 1 && t[0][2] ?
|
|
962
|
-
return r === e ||
|
|
959
|
+
function Gf(e) {
|
|
960
|
+
var t = kf(e);
|
|
961
|
+
return t.length == 1 && t[0][2] ? Nr(t[0][0], t[0][1]) : function(r) {
|
|
962
|
+
return r === e || Vf(r, e, t);
|
|
963
963
|
};
|
|
964
964
|
}
|
|
965
|
-
function
|
|
965
|
+
function Wf(e, t) {
|
|
966
966
|
return e != null && t in Object(e);
|
|
967
967
|
}
|
|
968
|
-
function
|
|
969
|
-
t =
|
|
970
|
-
for (var n = -1,
|
|
971
|
-
var o =
|
|
972
|
-
if (!(
|
|
968
|
+
function qf(e, t, r) {
|
|
969
|
+
t = bt(t, e);
|
|
970
|
+
for (var n = -1, i = t.length, s = !1; ++n < i; ) {
|
|
971
|
+
var o = Ae(t[n]);
|
|
972
|
+
if (!(s = e != null && r(e, o)))
|
|
973
973
|
break;
|
|
974
974
|
e = e[o];
|
|
975
975
|
}
|
|
976
|
-
return
|
|
976
|
+
return s || ++n != i ? s : (i = e == null ? 0 : e.length, !!i && pt(i) && Fe(o, i) && (m(e) || _e(e)));
|
|
977
977
|
}
|
|
978
|
-
function
|
|
979
|
-
return e != null &&
|
|
978
|
+
function zf(e, t) {
|
|
979
|
+
return e != null && qf(e, t, Wf);
|
|
980
980
|
}
|
|
981
|
-
var
|
|
982
|
-
function
|
|
983
|
-
return
|
|
984
|
-
var n =
|
|
985
|
-
return n === void 0 && n === t ?
|
|
981
|
+
var Yf = 1, Xf = 2;
|
|
982
|
+
function Zf(e, t) {
|
|
983
|
+
return yt(e) && Ir(t) ? Nr(Ae(e), t) : function(r) {
|
|
984
|
+
var n = T(r, e);
|
|
985
|
+
return n === void 0 && n === t ? zf(r, e) : wt(t, n, Yf | Xf);
|
|
986
986
|
};
|
|
987
987
|
}
|
|
988
|
-
function
|
|
988
|
+
function Jf(e) {
|
|
989
989
|
return function(t) {
|
|
990
990
|
return t == null ? void 0 : t[e];
|
|
991
991
|
};
|
|
992
992
|
}
|
|
993
|
-
function
|
|
993
|
+
function Qf(e) {
|
|
994
994
|
return function(t) {
|
|
995
|
-
return
|
|
995
|
+
return $r(t, e);
|
|
996
996
|
};
|
|
997
997
|
}
|
|
998
|
-
function
|
|
999
|
-
return
|
|
998
|
+
function eu(e) {
|
|
999
|
+
return yt(e) ? Jf(Ae(e)) : Qf(e);
|
|
1000
1000
|
}
|
|
1001
|
-
function
|
|
1002
|
-
return typeof e == "function" ? e : e == null ?
|
|
1001
|
+
function We(e) {
|
|
1002
|
+
return typeof e == "function" ? e : e == null ? Se : typeof e == "object" ? m(e) ? Zf(e[0], e[1]) : Gf(e) : eu(e);
|
|
1003
1003
|
}
|
|
1004
|
-
function
|
|
1005
|
-
for (var
|
|
1006
|
-
var o = e[
|
|
1004
|
+
function tu(e, t, r, n) {
|
|
1005
|
+
for (var i = -1, s = e == null ? 0 : e.length; ++i < s; ) {
|
|
1006
|
+
var o = e[i];
|
|
1007
1007
|
t(n, o, r(o), e);
|
|
1008
1008
|
}
|
|
1009
1009
|
return n;
|
|
1010
1010
|
}
|
|
1011
|
-
function
|
|
1011
|
+
function ru(e) {
|
|
1012
1012
|
return function(t, r, n) {
|
|
1013
|
-
for (var
|
|
1014
|
-
var u = o[++
|
|
1015
|
-
if (r(
|
|
1013
|
+
for (var i = -1, s = Object(t), o = n(t), f = o.length; f--; ) {
|
|
1014
|
+
var u = o[++i];
|
|
1015
|
+
if (r(s[u], u, s) === !1)
|
|
1016
1016
|
break;
|
|
1017
1017
|
}
|
|
1018
1018
|
return t;
|
|
1019
1019
|
};
|
|
1020
1020
|
}
|
|
1021
|
-
var
|
|
1022
|
-
function
|
|
1023
|
-
return e &&
|
|
1021
|
+
var Hr = ru();
|
|
1022
|
+
function Fr(e, t) {
|
|
1023
|
+
return e && Hr(e, t, Ve);
|
|
1024
1024
|
}
|
|
1025
|
-
function
|
|
1025
|
+
function nu(e, t) {
|
|
1026
1026
|
return function(r, n) {
|
|
1027
1027
|
if (r == null)
|
|
1028
1028
|
return r;
|
|
1029
1029
|
if (!te(r))
|
|
1030
1030
|
return e(r, n);
|
|
1031
|
-
for (var
|
|
1031
|
+
for (var i = r.length, s = -1, o = Object(r); ++s < i && n(o[s], s, o) !== !1; )
|
|
1032
1032
|
;
|
|
1033
1033
|
return r;
|
|
1034
1034
|
};
|
|
1035
1035
|
}
|
|
1036
|
-
var
|
|
1037
|
-
function
|
|
1038
|
-
return
|
|
1039
|
-
t(n,
|
|
1036
|
+
var St = nu(Fr);
|
|
1037
|
+
function iu(e, t, r, n) {
|
|
1038
|
+
return St(e, function(i, s, o) {
|
|
1039
|
+
t(n, i, r(i), o);
|
|
1040
1040
|
}), n;
|
|
1041
1041
|
}
|
|
1042
|
-
function
|
|
1042
|
+
function su(e, t) {
|
|
1043
1043
|
return function(r, n) {
|
|
1044
|
-
var
|
|
1045
|
-
return
|
|
1044
|
+
var i = m(r) ? tu : iu, s = {};
|
|
1045
|
+
return i(r, e, We(n), s);
|
|
1046
1046
|
};
|
|
1047
1047
|
}
|
|
1048
|
-
function
|
|
1049
|
-
(r !== void 0 && !
|
|
1048
|
+
function ut(e, t, r) {
|
|
1049
|
+
(r !== void 0 && !Te(e[t], r) || r === void 0 && !(t in e)) && Ke(e, t, r);
|
|
1050
1050
|
}
|
|
1051
|
-
function
|
|
1052
|
-
return
|
|
1051
|
+
function ou(e) {
|
|
1052
|
+
return H(e) && te(e);
|
|
1053
1053
|
}
|
|
1054
|
-
function
|
|
1054
|
+
function ct(e, t) {
|
|
1055
1055
|
if (!(t === "constructor" && typeof e[t] == "function") && t != "__proto__")
|
|
1056
1056
|
return e[t];
|
|
1057
1057
|
}
|
|
1058
|
-
function
|
|
1059
|
-
return
|
|
1058
|
+
function fu(e) {
|
|
1059
|
+
return oi(e, Ar(e));
|
|
1060
1060
|
}
|
|
1061
|
-
function
|
|
1062
|
-
var f =
|
|
1063
|
-
if (
|
|
1064
|
-
|
|
1061
|
+
function uu(e, t, r, n, i, s, o) {
|
|
1062
|
+
var f = ct(e, r), u = ct(t, r), l = o.get(u);
|
|
1063
|
+
if (l) {
|
|
1064
|
+
ut(e, r, l);
|
|
1065
1065
|
return;
|
|
1066
1066
|
}
|
|
1067
|
-
var c =
|
|
1068
|
-
if (
|
|
1069
|
-
var p =
|
|
1070
|
-
c = u, p ||
|
|
1067
|
+
var c = s ? s(f, u, r + "", e, t, o) : void 0, a = c === void 0;
|
|
1068
|
+
if (a) {
|
|
1069
|
+
var p = m(u), b = !p && le(u), g = !p && !b && Be(u);
|
|
1070
|
+
c = u, p || b || g ? m(f) ? c = f : ou(f) ? c = zn(f) : b ? (a = !1, c = xr(u, !0)) : g ? (a = !1, c = Cr(u, !0)) : c = [] : X(u) || _e(u) ? (c = f, _e(f) ? c = fu(f) : (!C(f) || I(f)) && (c = Er(u))) : a = !1;
|
|
1071
1071
|
}
|
|
1072
|
-
|
|
1072
|
+
a && (o.set(u, c), i(c, u, n, s, o), o.delete(u)), ut(e, r, c);
|
|
1073
1073
|
}
|
|
1074
|
-
function
|
|
1075
|
-
e !== t &&
|
|
1076
|
-
if (
|
|
1077
|
-
|
|
1074
|
+
function Kr(e, t, r, n, i) {
|
|
1075
|
+
e !== t && Hr(t, function(s, o) {
|
|
1076
|
+
if (i || (i = new k()), C(s))
|
|
1077
|
+
uu(e, t, o, r, Kr, n, i);
|
|
1078
1078
|
else {
|
|
1079
|
-
var f = n ? n(
|
|
1080
|
-
f === void 0 && (f =
|
|
1079
|
+
var f = n ? n(ct(e, o), s, o + "", e, t, i) : void 0;
|
|
1080
|
+
f === void 0 && (f = s), ut(e, o, f);
|
|
1081
1081
|
}
|
|
1082
|
-
},
|
|
1082
|
+
}, Ar);
|
|
1083
1083
|
}
|
|
1084
|
-
function
|
|
1085
|
-
return typeof e == "function" ? e :
|
|
1084
|
+
function cu(e) {
|
|
1085
|
+
return typeof e == "function" ? e : Se;
|
|
1086
1086
|
}
|
|
1087
|
-
function
|
|
1088
|
-
var r =
|
|
1089
|
-
return r(e,
|
|
1087
|
+
function lu(e, t) {
|
|
1088
|
+
var r = m(e) ? yr : St;
|
|
1089
|
+
return r(e, cu(t));
|
|
1090
1090
|
}
|
|
1091
|
-
var
|
|
1091
|
+
var Ur = /[\\^$.*+?()[\]{}|]/g, au = RegExp(Ur.source);
|
|
1092
1092
|
function z(e) {
|
|
1093
|
-
return e =
|
|
1093
|
+
return e = Or(e), e && au.test(e) ? e.replace(Ur, "\\$&") : e;
|
|
1094
1094
|
}
|
|
1095
|
-
function
|
|
1095
|
+
function hu(e) {
|
|
1096
1096
|
return function(t, r, n) {
|
|
1097
|
-
var
|
|
1097
|
+
var i = Object(t);
|
|
1098
1098
|
if (!te(t)) {
|
|
1099
|
-
var
|
|
1099
|
+
var s = We(r);
|
|
1100
1100
|
t = Ve(t), r = function(f) {
|
|
1101
|
-
return i
|
|
1101
|
+
return s(i[f], f, i);
|
|
1102
1102
|
};
|
|
1103
1103
|
}
|
|
1104
1104
|
var o = e(t, r, n);
|
|
1105
|
-
return o > -1 ? s
|
|
1105
|
+
return o > -1 ? i[s ? t[o] : o] : void 0;
|
|
1106
1106
|
};
|
|
1107
1107
|
}
|
|
1108
|
-
var
|
|
1109
|
-
function
|
|
1108
|
+
var du = Math.max;
|
|
1109
|
+
function pu(e, t, r) {
|
|
1110
1110
|
var n = e == null ? 0 : e.length;
|
|
1111
1111
|
if (!n)
|
|
1112
1112
|
return -1;
|
|
1113
|
-
var
|
|
1114
|
-
return
|
|
1113
|
+
var i = r == null ? 0 : xn(r);
|
|
1114
|
+
return i < 0 && (i = du(n + i, 0)), ti(e, We(t), i);
|
|
1115
1115
|
}
|
|
1116
|
-
var
|
|
1117
|
-
function
|
|
1116
|
+
var gu = hu(pu);
|
|
1117
|
+
function yu(e, t) {
|
|
1118
1118
|
var r = -1, n = te(e) ? Array(e.length) : [];
|
|
1119
|
-
return
|
|
1120
|
-
n[++r] = t(
|
|
1119
|
+
return St(e, function(i, s, o) {
|
|
1120
|
+
n[++r] = t(i, s, o);
|
|
1121
1121
|
}), n;
|
|
1122
1122
|
}
|
|
1123
1123
|
function pe(e, t) {
|
|
1124
|
-
var r =
|
|
1125
|
-
return r(e,
|
|
1124
|
+
var r = m(e) ? dr : yu;
|
|
1125
|
+
return r(e, We(t));
|
|
1126
1126
|
}
|
|
1127
|
-
var
|
|
1127
|
+
var _u = "[object String]";
|
|
1128
1128
|
function L(e) {
|
|
1129
|
-
return typeof e == "string" || !
|
|
1129
|
+
return typeof e == "string" || !m(e) && H(e) && q(e) == _u;
|
|
1130
1130
|
}
|
|
1131
|
-
function
|
|
1132
|
-
return
|
|
1133
|
-
t(n, r(
|
|
1131
|
+
function bu(e, t, r, n) {
|
|
1132
|
+
return Fr(e, function(i, s, o) {
|
|
1133
|
+
t(n, r(i), s, o);
|
|
1134
1134
|
}), n;
|
|
1135
1135
|
}
|
|
1136
|
-
function
|
|
1136
|
+
function mu(e, t) {
|
|
1137
1137
|
return function(r, n) {
|
|
1138
|
-
return
|
|
1138
|
+
return bu(r, e, t(n), {});
|
|
1139
1139
|
};
|
|
1140
1140
|
}
|
|
1141
|
-
var
|
|
1142
|
-
t != null && typeof t.toString != "function" && (t =
|
|
1143
|
-
},
|
|
1144
|
-
function
|
|
1145
|
-
return e === !0 || e === !1 ||
|
|
1141
|
+
var wu = Object.prototype, Su = wu.toString, Tu = mu(function(e, t, r) {
|
|
1142
|
+
t != null && typeof t.toString != "function" && (t = Su.call(t)), e[t] = r;
|
|
1143
|
+
}, gr(Se)), Au = "[object Boolean]";
|
|
1144
|
+
function Br(e) {
|
|
1145
|
+
return e === !0 || e === !1 || H(e) && q(e) == Au;
|
|
1146
1146
|
}
|
|
1147
|
-
var
|
|
1148
|
-
function
|
|
1147
|
+
var Ou = "[object Map]", $u = "[object Set]", vu = Object.prototype, Ru = vu.hasOwnProperty;
|
|
1148
|
+
function De(e) {
|
|
1149
1149
|
if (e == null)
|
|
1150
1150
|
return !0;
|
|
1151
|
-
if (te(e) && (
|
|
1151
|
+
if (te(e) && (m(e) || typeof e == "string" || typeof e.splice == "function" || le(e) || Be(e) || _e(e)))
|
|
1152
1152
|
return !e.length;
|
|
1153
|
-
var t =
|
|
1154
|
-
if (t ==
|
|
1153
|
+
var t = K(e);
|
|
1154
|
+
if (t == Ou || t == $u)
|
|
1155
1155
|
return !e.size;
|
|
1156
1156
|
if (Ue(e))
|
|
1157
|
-
return !
|
|
1157
|
+
return !Tr(e).length;
|
|
1158
1158
|
for (var r in e)
|
|
1159
|
-
if (
|
|
1159
|
+
if (Ru.call(e, r))
|
|
1160
1160
|
return !1;
|
|
1161
1161
|
return !0;
|
|
1162
1162
|
}
|
|
1163
|
-
var
|
|
1164
|
-
function
|
|
1165
|
-
return typeof e == "number" ||
|
|
1163
|
+
var Mu = "[object Number]";
|
|
1164
|
+
function xu(e) {
|
|
1165
|
+
return typeof e == "number" || H(e) && q(e) == Mu;
|
|
1166
1166
|
}
|
|
1167
|
-
function
|
|
1167
|
+
function we(e) {
|
|
1168
|
+
return e == null;
|
|
1169
|
+
}
|
|
1170
|
+
function et(e) {
|
|
1168
1171
|
return e === void 0;
|
|
1169
1172
|
}
|
|
1170
|
-
var
|
|
1171
|
-
|
|
1172
|
-
}),
|
|
1173
|
-
|
|
1173
|
+
var Cu = su(function(e, t, r) {
|
|
1174
|
+
Ke(e, r, t);
|
|
1175
|
+
}), Tt = ai(function(e, t, r) {
|
|
1176
|
+
Kr(e, t, r);
|
|
1174
1177
|
});
|
|
1175
|
-
function
|
|
1176
|
-
if (!
|
|
1178
|
+
function Eu(e, t, r, n) {
|
|
1179
|
+
if (!C(e))
|
|
1177
1180
|
return e;
|
|
1178
|
-
t =
|
|
1179
|
-
for (var
|
|
1180
|
-
var u =
|
|
1181
|
+
t = bt(t, e);
|
|
1182
|
+
for (var i = -1, s = t.length, o = s - 1, f = e; f != null && ++i < s; ) {
|
|
1183
|
+
var u = Ae(t[i]), l = r;
|
|
1181
1184
|
if (u === "__proto__" || u === "constructor" || u === "prototype")
|
|
1182
1185
|
return e;
|
|
1183
|
-
if (
|
|
1186
|
+
if (i != o) {
|
|
1184
1187
|
var c = f[u];
|
|
1185
|
-
|
|
1188
|
+
l = void 0, l === void 0 && (l = C(c) ? c : Fe(t[i + 1]) ? [] : {});
|
|
1186
1189
|
}
|
|
1187
|
-
|
|
1190
|
+
dt(f, u, l), f = f[u];
|
|
1188
1191
|
}
|
|
1189
1192
|
return e;
|
|
1190
1193
|
}
|
|
1191
|
-
var
|
|
1192
|
-
function
|
|
1193
|
-
return e == null ? e :
|
|
1194
|
+
var Pu = Array.prototype, Du = Pu.reverse;
|
|
1195
|
+
function ju(e) {
|
|
1196
|
+
return e == null ? e : Du.call(e);
|
|
1194
1197
|
}
|
|
1195
|
-
function
|
|
1196
|
-
return e == null ? e :
|
|
1198
|
+
function V(e, t, r) {
|
|
1199
|
+
return e == null ? e : Eu(e, t, r);
|
|
1197
1200
|
}
|
|
1198
|
-
class
|
|
1201
|
+
class U {
|
|
1199
1202
|
static processContext() {
|
|
1200
|
-
this.templateById =
|
|
1203
|
+
this.templateById = Cu(this.context.templates, "id");
|
|
1201
1204
|
}
|
|
1202
1205
|
static parseLoader(t) {
|
|
1203
1206
|
return t().then((r) => {
|
|
@@ -1208,26 +1211,26 @@ class B {
|
|
|
1208
1211
|
return this.templateById[t];
|
|
1209
1212
|
}
|
|
1210
1213
|
}
|
|
1211
|
-
|
|
1212
|
-
function
|
|
1214
|
+
w(U, "context"), w(U, "templateById");
|
|
1215
|
+
function Zc(e) {
|
|
1213
1216
|
return e;
|
|
1214
1217
|
}
|
|
1215
|
-
function
|
|
1218
|
+
function Jc(e) {
|
|
1216
1219
|
return e;
|
|
1217
1220
|
}
|
|
1218
|
-
const
|
|
1221
|
+
const Qc = {
|
|
1219
1222
|
install(e, t) {
|
|
1220
1223
|
const { loader: r } = t;
|
|
1221
1224
|
if (!r)
|
|
1222
1225
|
throw new Error("loader is required.");
|
|
1223
1226
|
const n = e.mount;
|
|
1224
|
-
t.env === "weapp" ? e.mount = (
|
|
1227
|
+
t.env === "weapp" ? e.mount = (i) => (U.parseLoader(r), n(i)) : e.mount = async (i) => (await U.parseLoader(r), n(i));
|
|
1225
1228
|
}
|
|
1226
1229
|
};
|
|
1227
|
-
class
|
|
1230
|
+
class Lu {
|
|
1228
1231
|
constructor(t) {
|
|
1229
|
-
|
|
1230
|
-
|
|
1232
|
+
w(this, "formModelName", "model");
|
|
1233
|
+
w(this, "formModelKey", "field");
|
|
1231
1234
|
this.runtime = t;
|
|
1232
1235
|
}
|
|
1233
1236
|
validate() {
|
|
@@ -1235,11 +1238,19 @@ class xu {
|
|
|
1235
1238
|
n ? r(n) : t();
|
|
1236
1239
|
}));
|
|
1237
1240
|
}
|
|
1241
|
+
resolveKeys(t) {
|
|
1242
|
+
const r = t == null ? void 0 : t.fieldNames;
|
|
1243
|
+
return r ? {
|
|
1244
|
+
labelKey: r.label ?? r.title ?? "label",
|
|
1245
|
+
valueKey: r.value ?? r.key ?? "value",
|
|
1246
|
+
childrenKey: r.children ?? "children"
|
|
1247
|
+
} : null;
|
|
1248
|
+
}
|
|
1238
1249
|
}
|
|
1239
|
-
class
|
|
1250
|
+
class Iu {
|
|
1240
1251
|
constructor(t) {
|
|
1241
|
-
|
|
1242
|
-
|
|
1252
|
+
w(this, "formModelName", "model");
|
|
1253
|
+
w(this, "formModelKey", "key");
|
|
1243
1254
|
this.runtime = t;
|
|
1244
1255
|
}
|
|
1245
1256
|
validate() {
|
|
@@ -1247,31 +1258,43 @@ class Cu {
|
|
|
1247
1258
|
n ? r(n) : t();
|
|
1248
1259
|
}));
|
|
1249
1260
|
}
|
|
1261
|
+
// NaiveUI uses standalone labelField / valueField / keyField props
|
|
1262
|
+
resolveKeys(t) {
|
|
1263
|
+
const r = t == null ? void 0 : t.labelField, n = (t == null ? void 0 : t.valueField) ?? (t == null ? void 0 : t.keyField);
|
|
1264
|
+
return !r && !n ? null : {
|
|
1265
|
+
labelKey: r ?? "label",
|
|
1266
|
+
valueKey: n ?? "value",
|
|
1267
|
+
childrenKey: "children"
|
|
1268
|
+
};
|
|
1269
|
+
}
|
|
1250
1270
|
}
|
|
1251
|
-
class
|
|
1271
|
+
class Nu {
|
|
1252
1272
|
constructor(t) {
|
|
1253
|
-
|
|
1254
|
-
|
|
1273
|
+
w(this, "formModelName", "modelValue");
|
|
1274
|
+
w(this, "formModelKey", "prop");
|
|
1255
1275
|
this.runtime = t;
|
|
1256
1276
|
}
|
|
1257
1277
|
validate() {
|
|
1258
|
-
return new Promise((t, r) => this.runtime._render.formRef.value.validate().then(({ valid: n, errors:
|
|
1259
|
-
n ? t() : r(
|
|
1278
|
+
return new Promise((t, r) => this.runtime._render.formRef.value.validate().then(({ valid: n, errors: i }) => {
|
|
1279
|
+
n ? t() : r(i);
|
|
1260
1280
|
}));
|
|
1261
1281
|
}
|
|
1282
|
+
resolveKeys(t) {
|
|
1283
|
+
return null;
|
|
1284
|
+
}
|
|
1262
1285
|
}
|
|
1263
|
-
class
|
|
1286
|
+
class Hu {
|
|
1264
1287
|
constructor(t) {
|
|
1265
|
-
|
|
1266
|
-
|
|
1288
|
+
w(this, "presetAdapters");
|
|
1289
|
+
w(this, "adaptee", {});
|
|
1267
1290
|
this.runtime = t, this.presetAdapters = {
|
|
1268
|
-
ArcoVue: new
|
|
1269
|
-
NutUI: new
|
|
1270
|
-
NaiveUI: new
|
|
1291
|
+
ArcoVue: new Lu(t),
|
|
1292
|
+
NutUI: new Nu(t),
|
|
1293
|
+
NaiveUI: new Iu(t)
|
|
1271
1294
|
}, this.initAdapters();
|
|
1272
1295
|
}
|
|
1273
1296
|
initAdapters() {
|
|
1274
|
-
const t =
|
|
1297
|
+
const t = U.getTemplate(
|
|
1275
1298
|
this.runtime._options.templateId
|
|
1276
1299
|
);
|
|
1277
1300
|
if (t.adapter) {
|
|
@@ -1284,140 +1307,140 @@ class Du {
|
|
|
1284
1307
|
});
|
|
1285
1308
|
}
|
|
1286
1309
|
}
|
|
1287
|
-
function
|
|
1310
|
+
function Fu(e, t, r) {
|
|
1288
1311
|
if (r.lookups.value.get(t))
|
|
1289
1312
|
return;
|
|
1290
|
-
const
|
|
1313
|
+
const i = I(e.lookup), s = i ? null : e.lookup, o = !i && L(s == null ? void 0 : s.source) ? s.source : null;
|
|
1291
1314
|
r.lookups.value.set(t, {
|
|
1292
1315
|
sourceKey: o,
|
|
1293
|
-
match:
|
|
1316
|
+
match: s == null ? void 0 : s.match,
|
|
1294
1317
|
fieldTarget: t,
|
|
1295
1318
|
schema: e
|
|
1296
1319
|
});
|
|
1297
1320
|
}
|
|
1298
|
-
function
|
|
1321
|
+
function lt(e, t, r) {
|
|
1299
1322
|
for (const n of r.lookups.value.values()) {
|
|
1300
1323
|
if (n.fieldTarget !== e) continue;
|
|
1301
|
-
const
|
|
1302
|
-
let
|
|
1303
|
-
if (I(
|
|
1304
|
-
const c =
|
|
1324
|
+
const i = n.schema.lookup;
|
|
1325
|
+
let s;
|
|
1326
|
+
if (I(i)) {
|
|
1327
|
+
const c = i;
|
|
1305
1328
|
if (c.format || c.render || c.valid)
|
|
1306
|
-
|
|
1329
|
+
s = {
|
|
1307
1330
|
format: c.format,
|
|
1308
1331
|
render: c.render,
|
|
1309
1332
|
valid: c.valid
|
|
1310
1333
|
};
|
|
1311
1334
|
else {
|
|
1312
|
-
const
|
|
1313
|
-
|
|
1335
|
+
const a = i();
|
|
1336
|
+
s = C(a) && !m(a) ? a : !0;
|
|
1314
1337
|
}
|
|
1315
1338
|
} else
|
|
1316
|
-
|
|
1317
|
-
const o =
|
|
1339
|
+
s = i;
|
|
1340
|
+
const o = s !== !0 && n.match;
|
|
1318
1341
|
let f, u;
|
|
1319
1342
|
if (o) {
|
|
1320
|
-
let c =
|
|
1321
|
-
if (n.sourceKey && (c =
|
|
1343
|
+
let c = s == null ? void 0 : s.source;
|
|
1344
|
+
if (n.sourceKey && (c = T(n.schema.componentProps, n.sourceKey)), c === void 0)
|
|
1322
1345
|
return;
|
|
1323
|
-
if (u = n.match, f =
|
|
1346
|
+
if (u = n.match, f = Ku(c, u, t), !f || De(f))
|
|
1324
1347
|
return r.lookupResults.value.delete(n.fieldTarget);
|
|
1325
1348
|
} else {
|
|
1326
1349
|
if (!t)
|
|
1327
1350
|
return r.lookupResults.value.delete(n.fieldTarget);
|
|
1328
1351
|
f = t;
|
|
1329
1352
|
}
|
|
1330
|
-
const
|
|
1331
|
-
if (
|
|
1353
|
+
const l = s != null && s.format ? s.format(f) : f;
|
|
1354
|
+
if (s != null && s.valid && !s.valid(l))
|
|
1332
1355
|
return r.lookupResults.value.delete(n.fieldTarget);
|
|
1333
1356
|
r.lookupResults.value.set(n.fieldTarget, {
|
|
1334
1357
|
label: n.schema.label,
|
|
1335
|
-
matchResult:
|
|
1336
|
-
delete:
|
|
1337
|
-
render:
|
|
1358
|
+
matchResult: l,
|
|
1359
|
+
delete: Uu(r, n.fieldTarget, u),
|
|
1360
|
+
render: s == null ? void 0 : s.render
|
|
1338
1361
|
});
|
|
1339
1362
|
}
|
|
1340
1363
|
}
|
|
1341
|
-
function
|
|
1342
|
-
const { childrenKey:
|
|
1343
|
-
if (
|
|
1344
|
-
if (
|
|
1345
|
-
for (const
|
|
1346
|
-
if (o(
|
|
1347
|
-
const g = f(
|
|
1364
|
+
function Ku(e, t, r, n) {
|
|
1365
|
+
const { childrenKey: i, format: s } = {}, o = (a, p) => !C(a) || m(a) ? !1 : typeof t == "function" ? t(a, p) : T(a, t) === p, f = (a, p) => {
|
|
1366
|
+
if (C(a)) {
|
|
1367
|
+
if (m(a)) {
|
|
1368
|
+
for (const b of a) {
|
|
1369
|
+
if (o(b, p)) return b;
|
|
1370
|
+
const g = f(b, p);
|
|
1348
1371
|
if (g) return g;
|
|
1349
1372
|
}
|
|
1350
1373
|
return;
|
|
1351
1374
|
}
|
|
1352
|
-
if (o(
|
|
1353
|
-
for (const
|
|
1354
|
-
const g = f(
|
|
1375
|
+
if (o(a, p)) return a;
|
|
1376
|
+
for (const b of Object.values(a)) {
|
|
1377
|
+
const g = f(b, p);
|
|
1355
1378
|
if (g) return g;
|
|
1356
1379
|
}
|
|
1357
1380
|
}
|
|
1358
|
-
}, u = (
|
|
1381
|
+
}, u = (a) => {
|
|
1359
1382
|
let p = e;
|
|
1360
|
-
return
|
|
1361
|
-
pe(
|
|
1362
|
-
const g =
|
|
1363
|
-
return p = g ?
|
|
1383
|
+
return Je(
|
|
1384
|
+
pe(a, (b) => {
|
|
1385
|
+
const g = gu(p, (S) => o(S, b));
|
|
1386
|
+
return p = g ? T(g, i) : void 0, g;
|
|
1364
1387
|
})
|
|
1365
1388
|
);
|
|
1366
1389
|
};
|
|
1367
|
-
let
|
|
1368
|
-
const c =
|
|
1369
|
-
return
|
|
1390
|
+
let l;
|
|
1391
|
+
const c = m(r) && m(r[0]);
|
|
1392
|
+
return i ? l = c ? pe(r, u) : m(r) ? u(r) : f(e, r) : l = c ? pe(
|
|
1370
1393
|
r,
|
|
1371
|
-
(
|
|
1372
|
-
) :
|
|
1394
|
+
(a) => Je(pe(a, (p) => f(e, p)))
|
|
1395
|
+
) : m(r) ? Je(pe(r, (a) => f(e, a))) : f(e, r), s && l !== void 0 ? s(l) : l;
|
|
1373
1396
|
}
|
|
1374
|
-
function
|
|
1397
|
+
function Uu(e, t, r) {
|
|
1375
1398
|
return (n) => {
|
|
1376
1399
|
if (n === void 0) {
|
|
1377
1400
|
e.deleteField(t);
|
|
1378
1401
|
return;
|
|
1379
1402
|
}
|
|
1380
|
-
const
|
|
1381
|
-
if (!
|
|
1403
|
+
const i = T(e._model.model.value, t);
|
|
1404
|
+
if (!m(i)) {
|
|
1382
1405
|
e.deleteField(t);
|
|
1383
1406
|
return;
|
|
1384
1407
|
}
|
|
1385
|
-
const
|
|
1386
|
-
|
|
1408
|
+
const s = i.filter((o) => I(n) ? !n(o) : C(o) && !m(o) && r ? I(r) ? !r(o, n) : T(o, r) !== n : o !== n);
|
|
1409
|
+
V(e._model.model.value, t, s);
|
|
1387
1410
|
};
|
|
1388
1411
|
}
|
|
1389
|
-
function
|
|
1390
|
-
return
|
|
1412
|
+
function Bu(e) {
|
|
1413
|
+
return xu(e) ? !0 : L(e) ? /^-?\d+$/.test(e) : !1;
|
|
1391
1414
|
}
|
|
1392
1415
|
function ne(e) {
|
|
1393
|
-
return
|
|
1416
|
+
return Bu(e) ? `[${e}]` : e;
|
|
1394
1417
|
}
|
|
1395
|
-
function
|
|
1396
|
-
|
|
1397
|
-
t(n,
|
|
1418
|
+
function Vr(e, t, r) {
|
|
1419
|
+
lu(e, (n, i) => {
|
|
1420
|
+
t(n, i, r) !== !1 && (De(n.children) || Vr(
|
|
1398
1421
|
n.children,
|
|
1399
1422
|
t,
|
|
1400
1423
|
r ? `${ne(r)}.children.${ne(
|
|
1401
|
-
|
|
1402
|
-
)}` : ne(
|
|
1424
|
+
i
|
|
1425
|
+
)}` : ne(i)
|
|
1403
1426
|
));
|
|
1404
1427
|
});
|
|
1405
1428
|
}
|
|
1406
|
-
function
|
|
1407
|
-
return e instanceof Promise ||
|
|
1429
|
+
function tt(e) {
|
|
1430
|
+
return e instanceof Promise || C(e) && I(e == null ? void 0 : e.then) && I(e == null ? void 0 : e.catch);
|
|
1408
1431
|
}
|
|
1409
|
-
function
|
|
1432
|
+
function Vu(e, t) {
|
|
1410
1433
|
return e ? ["component", "layout"].includes(e) && X(t) : !1;
|
|
1411
1434
|
}
|
|
1412
|
-
function
|
|
1435
|
+
function kr(e) {
|
|
1413
1436
|
const t = e.match(/^(.+)\.children\.\[\d+\]$/);
|
|
1414
1437
|
return t ? t[1] : null;
|
|
1415
1438
|
}
|
|
1416
|
-
function
|
|
1439
|
+
function ku(e) {
|
|
1417
1440
|
const t = [];
|
|
1418
1441
|
let r = e;
|
|
1419
1442
|
for (; ; ) {
|
|
1420
|
-
const n =
|
|
1443
|
+
const n = kr(r);
|
|
1421
1444
|
if (n)
|
|
1422
1445
|
t.push(n), r = n;
|
|
1423
1446
|
else
|
|
@@ -1425,29 +1448,110 @@ function Fu(e) {
|
|
|
1425
1448
|
}
|
|
1426
1449
|
return t;
|
|
1427
1450
|
}
|
|
1428
|
-
function
|
|
1429
|
-
const r =
|
|
1430
|
-
return e.has(t) && n.push(t), r.forEach((
|
|
1431
|
-
e.has(
|
|
1451
|
+
function Gu(e, t) {
|
|
1452
|
+
const r = ku(t), n = [];
|
|
1453
|
+
return e.has(t) && n.push(t), r.forEach((i) => {
|
|
1454
|
+
e.has(i) && n.push(i);
|
|
1432
1455
|
}), {
|
|
1433
1456
|
isListChild: n.length > 0,
|
|
1434
|
-
existingRelations: n.map((
|
|
1435
|
-
const
|
|
1457
|
+
existingRelations: n.map((i) => {
|
|
1458
|
+
const s = e.get(i), o = kr(i), f = o ? e.get(o) : null;
|
|
1436
1459
|
return {
|
|
1437
|
-
current:
|
|
1460
|
+
current: s,
|
|
1438
1461
|
parent: f
|
|
1439
1462
|
};
|
|
1440
1463
|
})
|
|
1441
1464
|
};
|
|
1442
1465
|
}
|
|
1443
|
-
const
|
|
1444
|
-
|
|
1466
|
+
const tr = [
|
|
1467
|
+
["value", "label", "children"],
|
|
1468
|
+
["key", "title", "children"],
|
|
1469
|
+
["key", "label", "children"],
|
|
1470
|
+
["id", "name", "children"]
|
|
1471
|
+
];
|
|
1472
|
+
function Gr(e, t = {}) {
|
|
1473
|
+
for (const r of e) {
|
|
1474
|
+
const n = r.type ?? "item";
|
|
1475
|
+
n === "group" || n === "list" ? Gr(r.children ?? [], t) : r.field && r.labelMode && (t[r.field] = r.labelMode);
|
|
1476
|
+
}
|
|
1477
|
+
return t;
|
|
1478
|
+
}
|
|
1479
|
+
function Wu(e, t, r, n = {}) {
|
|
1480
|
+
const i = {};
|
|
1481
|
+
return at(e, t, "", i, r, n), i;
|
|
1482
|
+
}
|
|
1483
|
+
function at(e, t, r, n, i, s) {
|
|
1484
|
+
for (const o of e) {
|
|
1485
|
+
const f = o.type ?? "item";
|
|
1486
|
+
if (f === "group") {
|
|
1487
|
+
at(o.children ?? [], t, r, n, i, s);
|
|
1488
|
+
continue;
|
|
1489
|
+
}
|
|
1490
|
+
if (f === "list") {
|
|
1491
|
+
const p = r ? `${r}.${o.field}` : o.field, b = T(t, p);
|
|
1492
|
+
m(b) && b.forEach((g, S) => {
|
|
1493
|
+
at(
|
|
1494
|
+
o.children ?? [],
|
|
1495
|
+
t,
|
|
1496
|
+
`${p}.${S}`,
|
|
1497
|
+
n,
|
|
1498
|
+
i,
|
|
1499
|
+
s
|
|
1500
|
+
);
|
|
1501
|
+
});
|
|
1502
|
+
continue;
|
|
1503
|
+
}
|
|
1504
|
+
if (!o.field || !o.componentProps) continue;
|
|
1505
|
+
const u = r ? `${r}.${o.field}` : o.field, l = T(t, u);
|
|
1506
|
+
if (we(l)) continue;
|
|
1507
|
+
const c = s[o.field] ?? "leaf", a = qu(o.componentProps, l, i, c);
|
|
1508
|
+
we(a) || (n[u] = a);
|
|
1509
|
+
}
|
|
1510
|
+
}
|
|
1511
|
+
function qu(e, t, r, n) {
|
|
1512
|
+
var o;
|
|
1513
|
+
const i = (o = r.resolveKeys) == null ? void 0 : o.call(r, e), s = i ? [[i.valueKey, i.labelKey, i.childrenKey], ...tr] : tr;
|
|
1514
|
+
for (const f of Object.values(e))
|
|
1515
|
+
if (!(!m(f) || !f.length || !C(f[0]) || m(f[0])))
|
|
1516
|
+
for (const [u, l, c] of s) {
|
|
1517
|
+
const a = zu(f, t, u, l, c, n);
|
|
1518
|
+
if (!we(a)) return a;
|
|
1519
|
+
}
|
|
1520
|
+
return null;
|
|
1521
|
+
}
|
|
1522
|
+
function zu(e, t, r, n, i, s) {
|
|
1523
|
+
const o = (f) => {
|
|
1524
|
+
const u = Wr(e, f, r, n, i);
|
|
1525
|
+
return u ? s === "leaf" ? u[u.length - 1] ?? null : s === "path" ? u.join(", ") : u.slice(-2).join(", ") : null;
|
|
1526
|
+
};
|
|
1527
|
+
if (m(t)) {
|
|
1528
|
+
const f = t.map(o).filter((u) => !we(u));
|
|
1529
|
+
return f.length ? f : null;
|
|
1530
|
+
}
|
|
1531
|
+
return o(t);
|
|
1532
|
+
}
|
|
1533
|
+
function Wr(e, t, r, n, i, s = []) {
|
|
1534
|
+
for (const o of e) {
|
|
1535
|
+
if (!C(o) || m(o)) continue;
|
|
1536
|
+
const f = T(o, n), u = we(f) ? null : String(f);
|
|
1537
|
+
if (T(o, r) === t)
|
|
1538
|
+
return u ? [...s, u] : s.length ? s : null;
|
|
1539
|
+
const l = T(o, i);
|
|
1540
|
+
if (m(l) && l.length) {
|
|
1541
|
+
const c = u ? [...s, u] : s, a = Wr(l, t, r, n, i, c);
|
|
1542
|
+
if (a !== null) return a;
|
|
1543
|
+
}
|
|
1544
|
+
}
|
|
1545
|
+
return null;
|
|
1546
|
+
}
|
|
1547
|
+
const Q = ".", At = Symbol("target"), qr = Symbol("unsubscribe");
|
|
1548
|
+
function ht(e) {
|
|
1445
1549
|
return e instanceof Date || e instanceof Set || e instanceof Map || e instanceof WeakSet || e instanceof WeakMap || ArrayBuffer.isView(e);
|
|
1446
1550
|
}
|
|
1447
|
-
function
|
|
1551
|
+
function Yu(e) {
|
|
1448
1552
|
return e === null || typeof e != "object" && typeof e != "function" || e instanceof RegExp;
|
|
1449
1553
|
}
|
|
1450
|
-
function
|
|
1554
|
+
function je(e) {
|
|
1451
1555
|
return typeof e == "symbol";
|
|
1452
1556
|
}
|
|
1453
1557
|
const j = {
|
|
@@ -1455,7 +1559,7 @@ const j = {
|
|
|
1455
1559
|
return Array.isArray(e) ? e.slice(t.length) : t === "" ? e : e.slice(t.length + 1);
|
|
1456
1560
|
},
|
|
1457
1561
|
concat(e, t) {
|
|
1458
|
-
return Array.isArray(e) ? (e = [...e], t && e.push(t), e) : t && t.toString !== void 0 ? (e !== "" && (e += Q),
|
|
1562
|
+
return Array.isArray(e) ? (e = [...e], t && e.push(t), e) : t && t.toString !== void 0 ? (e !== "" && (e += Q), je(t) ? e + t.toString() : e + t) : e;
|
|
1459
1563
|
},
|
|
1460
1564
|
initial(e) {
|
|
1461
1565
|
if (Array.isArray(e))
|
|
@@ -1506,25 +1610,25 @@ const j = {
|
|
|
1506
1610
|
return Array.isArray(e) ? e.length === 0 : e === "";
|
|
1507
1611
|
}
|
|
1508
1612
|
};
|
|
1509
|
-
function
|
|
1613
|
+
function Le(e) {
|
|
1510
1614
|
return Object.prototype.toString.call(e) === "[object Object]";
|
|
1511
1615
|
}
|
|
1512
|
-
function
|
|
1616
|
+
function Xu(e) {
|
|
1513
1617
|
return e !== null && typeof e == "object" && typeof e.next == "function";
|
|
1514
1618
|
}
|
|
1515
|
-
function
|
|
1516
|
-
const
|
|
1517
|
-
if (typeof
|
|
1619
|
+
function Zu(e, t, r, n, i) {
|
|
1620
|
+
const s = e == null ? void 0 : e.next;
|
|
1621
|
+
if (typeof s != "function")
|
|
1518
1622
|
return e;
|
|
1519
1623
|
if (t.name === "entries")
|
|
1520
1624
|
e.next = function() {
|
|
1521
|
-
const o =
|
|
1522
|
-
return o && o.done === !1 && (o.value[0] =
|
|
1625
|
+
const o = s.call(this);
|
|
1626
|
+
return o && o.done === !1 && (o.value[0] = i(
|
|
1523
1627
|
o.value[0],
|
|
1524
1628
|
t,
|
|
1525
1629
|
o.value[0],
|
|
1526
1630
|
n
|
|
1527
|
-
), o.value[1] =
|
|
1631
|
+
), o.value[1] = i(
|
|
1528
1632
|
o.value[1],
|
|
1529
1633
|
t,
|
|
1530
1634
|
o.value[0],
|
|
@@ -1532,10 +1636,10 @@ function Gu(e, t, r, n, s) {
|
|
|
1532
1636
|
)), o;
|
|
1533
1637
|
};
|
|
1534
1638
|
else if (t.name === "values") {
|
|
1535
|
-
const o = r[
|
|
1639
|
+
const o = r[At].keys();
|
|
1536
1640
|
e.next = function() {
|
|
1537
|
-
const f =
|
|
1538
|
-
return f && f.done === !1 && (f.value =
|
|
1641
|
+
const f = s.call(this);
|
|
1642
|
+
return f && f.done === !1 && (f.value = i(
|
|
1539
1643
|
f.value,
|
|
1540
1644
|
t,
|
|
1541
1645
|
o.next().value,
|
|
@@ -1544,8 +1648,8 @@ function Gu(e, t, r, n, s) {
|
|
|
1544
1648
|
};
|
|
1545
1649
|
} else
|
|
1546
1650
|
e.next = function() {
|
|
1547
|
-
const o =
|
|
1548
|
-
return o && o.done === !1 && (o.value =
|
|
1651
|
+
const o = s.call(this);
|
|
1652
|
+
return o && o.done === !1 && (o.value = i(
|
|
1549
1653
|
o.value,
|
|
1550
1654
|
t,
|
|
1551
1655
|
o.value,
|
|
@@ -1554,18 +1658,18 @@ function Gu(e, t, r, n, s) {
|
|
|
1554
1658
|
};
|
|
1555
1659
|
return e;
|
|
1556
1660
|
}
|
|
1557
|
-
function
|
|
1558
|
-
if (e.isUnsubscribed || t.ignoreSymbols &&
|
|
1661
|
+
function rr(e, t, r) {
|
|
1662
|
+
if (e.isUnsubscribed || t.ignoreSymbols && je(r) || t.ignoreUnderscores && typeof r == "string" && r.charAt(0) === "_")
|
|
1559
1663
|
return !0;
|
|
1560
1664
|
const n = t.ignoreKeys;
|
|
1561
1665
|
return n ? Array.isArray(n) ? n.includes(r) : n instanceof Set ? n.has(r) : !1 : !1;
|
|
1562
1666
|
}
|
|
1563
|
-
class
|
|
1667
|
+
class Ju {
|
|
1564
1668
|
constructor(t) {
|
|
1565
1669
|
this._equals = t, this._proxyCache = /* @__PURE__ */ new WeakMap(), this._pathCache = /* @__PURE__ */ new WeakMap(), this._allPathsCache = /* @__PURE__ */ new WeakMap(), this.isUnsubscribed = !1;
|
|
1566
1670
|
}
|
|
1567
1671
|
_pathsEqual(t, r) {
|
|
1568
|
-
return !Array.isArray(t) || !Array.isArray(r) ? t === r : t.length === r.length && t.every((n,
|
|
1672
|
+
return !Array.isArray(t) || !Array.isArray(r) ? t === r : t.length === r.length && t.every((n, i) => n === r[i]);
|
|
1569
1673
|
}
|
|
1570
1674
|
_getDescriptorCache() {
|
|
1571
1675
|
return this._descriptorCache === void 0 && (this._descriptorCache = /* @__PURE__ */ new WeakMap()), this._descriptorCache;
|
|
@@ -1579,18 +1683,18 @@ class Ku {
|
|
|
1579
1683
|
if (this.isUnsubscribed)
|
|
1580
1684
|
return Reflect.getOwnPropertyDescriptor(t, r);
|
|
1581
1685
|
const n = this._getProperties(t);
|
|
1582
|
-
let
|
|
1583
|
-
return
|
|
1686
|
+
let i = n[r];
|
|
1687
|
+
return i === void 0 && (i = Reflect.getOwnPropertyDescriptor(t, r), n[r] = i), i;
|
|
1584
1688
|
}
|
|
1585
|
-
getProxy(t, r, n,
|
|
1689
|
+
getProxy(t, r, n, i) {
|
|
1586
1690
|
if (this.isUnsubscribed)
|
|
1587
1691
|
return t;
|
|
1588
|
-
const
|
|
1692
|
+
const s = i === void 0 ? void 0 : t[i], o = s ?? t;
|
|
1589
1693
|
this._pathCache.set(o, r);
|
|
1590
1694
|
let f = this._allPathsCache.get(o);
|
|
1591
1695
|
f || (f = [], this._allPathsCache.set(o, f)), f.some((c) => this._pathsEqual(c, r)) || f.push(r);
|
|
1592
|
-
let
|
|
1593
|
-
return
|
|
1696
|
+
let l = this._proxyCache.get(o);
|
|
1697
|
+
return l === void 0 && (l = s === void 0 ? new Proxy(t, n) : t, this._proxyCache.set(o, l)), l;
|
|
1594
1698
|
}
|
|
1595
1699
|
getPath(t) {
|
|
1596
1700
|
return this.isUnsubscribed ? void 0 : this._pathCache.get(t);
|
|
@@ -1605,8 +1709,8 @@ class Ku {
|
|
|
1605
1709
|
defineProperty(t, r, n) {
|
|
1606
1710
|
return Reflect.defineProperty(t, r, n) ? (this.isUnsubscribed || (this._getProperties(t)[r] = n), !0) : !1;
|
|
1607
1711
|
}
|
|
1608
|
-
setProperty(t, r, n,
|
|
1609
|
-
if (!this._equals(
|
|
1712
|
+
setProperty(t, r, n, i, s) {
|
|
1713
|
+
if (!this._equals(s, n) || !(r in t)) {
|
|
1610
1714
|
let o = !1, f = t;
|
|
1611
1715
|
for (; f; ) {
|
|
1612
1716
|
const u = Reflect.getOwnPropertyDescriptor(f, r);
|
|
@@ -1616,23 +1720,23 @@ class Ku {
|
|
|
1616
1720
|
}
|
|
1617
1721
|
f = Object.getPrototypeOf(f);
|
|
1618
1722
|
}
|
|
1619
|
-
return o ? Reflect.set(t, r, n,
|
|
1723
|
+
return o ? Reflect.set(t, r, n, i) : Reflect.set(t, r, n);
|
|
1620
1724
|
}
|
|
1621
1725
|
return !0;
|
|
1622
1726
|
}
|
|
1623
1727
|
deleteProperty(t, r, n) {
|
|
1624
1728
|
if (Reflect.deleteProperty(t, r)) {
|
|
1625
1729
|
if (!this.isUnsubscribed) {
|
|
1626
|
-
const
|
|
1627
|
-
|
|
1730
|
+
const i = this._getDescriptorCache().get(t);
|
|
1731
|
+
i && (delete i[r], this._pathCache.delete(n));
|
|
1628
1732
|
}
|
|
1629
1733
|
return !0;
|
|
1630
1734
|
}
|
|
1631
1735
|
return !1;
|
|
1632
1736
|
}
|
|
1633
1737
|
isSameDescriptor(t, r, n) {
|
|
1634
|
-
const
|
|
1635
|
-
return t !== void 0 &&
|
|
1738
|
+
const i = this._getOwnPropertyDescriptor(r, n);
|
|
1739
|
+
return t !== void 0 && i !== void 0 && Object.is(t.value, i.value) && (t.writable || !1) === (i.writable || !1) && (t.enumerable || !1) === (i.enumerable || !1) && (t.configurable || !1) === (i.configurable || !1) && t.get === i.get && t.set === i.set;
|
|
1636
1740
|
}
|
|
1637
1741
|
isGetInvariant(t, r) {
|
|
1638
1742
|
const n = this._getOwnPropertyDescriptor(t, r);
|
|
@@ -1642,44 +1746,44 @@ class Ku {
|
|
|
1642
1746
|
this._descriptorCache = null, this._pathCache = null, this._proxyCache = null, this._allPathsCache = null, this.isUnsubscribed = !0;
|
|
1643
1747
|
}
|
|
1644
1748
|
}
|
|
1645
|
-
const
|
|
1646
|
-
function
|
|
1749
|
+
const ye = Array.isArray;
|
|
1750
|
+
function $e() {
|
|
1647
1751
|
return !0;
|
|
1648
1752
|
}
|
|
1649
1753
|
function ce(e, t) {
|
|
1650
1754
|
return e === t ? !1 : e.length !== t.length || e.some((r, n) => t[n] !== r);
|
|
1651
1755
|
}
|
|
1652
|
-
const
|
|
1756
|
+
const zr = /* @__PURE__ */ new Set([
|
|
1653
1757
|
"hasOwnProperty",
|
|
1654
1758
|
"isPrototypeOf",
|
|
1655
1759
|
"propertyIsEnumerable",
|
|
1656
1760
|
"toLocaleString",
|
|
1657
1761
|
"toString",
|
|
1658
1762
|
"valueOf"
|
|
1659
|
-
]),
|
|
1763
|
+
]), Qu = /* @__PURE__ */ new Set([
|
|
1660
1764
|
"concat",
|
|
1661
1765
|
"includes",
|
|
1662
1766
|
"indexOf",
|
|
1663
1767
|
"join",
|
|
1664
1768
|
"keys",
|
|
1665
1769
|
"lastIndexOf"
|
|
1666
|
-
]),
|
|
1667
|
-
push:
|
|
1668
|
-
pop:
|
|
1669
|
-
shift:
|
|
1670
|
-
unshift:
|
|
1770
|
+
]), Yr = {
|
|
1771
|
+
push: $e,
|
|
1772
|
+
pop: $e,
|
|
1773
|
+
shift: $e,
|
|
1774
|
+
unshift: $e,
|
|
1671
1775
|
copyWithin: ce,
|
|
1672
1776
|
reverse: ce,
|
|
1673
1777
|
sort: ce,
|
|
1674
1778
|
splice: ce,
|
|
1675
1779
|
flat: ce,
|
|
1676
1780
|
fill: ce
|
|
1677
|
-
},
|
|
1678
|
-
...
|
|
1679
|
-
...
|
|
1680
|
-
...Object.keys(
|
|
1781
|
+
}, ec = /* @__PURE__ */ new Set([
|
|
1782
|
+
...zr,
|
|
1783
|
+
...Qu,
|
|
1784
|
+
...Object.keys(Yr)
|
|
1681
1785
|
]);
|
|
1682
|
-
function
|
|
1786
|
+
function ve(e, t) {
|
|
1683
1787
|
if (e === t)
|
|
1684
1788
|
return !1;
|
|
1685
1789
|
if (e.size !== t.size)
|
|
@@ -1689,57 +1793,57 @@ function $e(e, t) {
|
|
|
1689
1793
|
return !0;
|
|
1690
1794
|
return !1;
|
|
1691
1795
|
}
|
|
1692
|
-
const
|
|
1796
|
+
const Xr = [
|
|
1693
1797
|
"keys",
|
|
1694
1798
|
"values",
|
|
1695
1799
|
"entries"
|
|
1696
|
-
],
|
|
1800
|
+
], Zr = /* @__PURE__ */ new Set([
|
|
1697
1801
|
"has",
|
|
1698
1802
|
"toString"
|
|
1699
|
-
]),
|
|
1700
|
-
add:
|
|
1701
|
-
clear:
|
|
1702
|
-
delete:
|
|
1703
|
-
forEach:
|
|
1704
|
-
},
|
|
1705
|
-
...
|
|
1706
|
-
...Object.keys(
|
|
1707
|
-
...
|
|
1803
|
+
]), Jr = {
|
|
1804
|
+
add: ve,
|
|
1805
|
+
clear: ve,
|
|
1806
|
+
delete: ve,
|
|
1807
|
+
forEach: ve
|
|
1808
|
+
}, tc = /* @__PURE__ */ new Set([
|
|
1809
|
+
...Zr,
|
|
1810
|
+
...Object.keys(Jr),
|
|
1811
|
+
...Xr
|
|
1708
1812
|
]);
|
|
1709
|
-
function
|
|
1813
|
+
function Re(e, t) {
|
|
1710
1814
|
if (e === t)
|
|
1711
1815
|
return !1;
|
|
1712
1816
|
if (e.size !== t.size)
|
|
1713
1817
|
return !0;
|
|
1714
1818
|
for (const [r, n] of e) {
|
|
1715
|
-
const
|
|
1716
|
-
if (
|
|
1819
|
+
const i = t.get(r);
|
|
1820
|
+
if (i !== n || i === void 0 && !t.has(r))
|
|
1717
1821
|
return !0;
|
|
1718
1822
|
}
|
|
1719
1823
|
return !1;
|
|
1720
1824
|
}
|
|
1721
|
-
const
|
|
1722
|
-
set:
|
|
1723
|
-
clear:
|
|
1724
|
-
delete:
|
|
1725
|
-
forEach:
|
|
1726
|
-
},
|
|
1727
|
-
...
|
|
1728
|
-
...Object.keys(
|
|
1729
|
-
...
|
|
1825
|
+
const rc = /* @__PURE__ */ new Set([...Zr, "get"]), Qr = {
|
|
1826
|
+
set: Re,
|
|
1827
|
+
clear: Re,
|
|
1828
|
+
delete: Re,
|
|
1829
|
+
forEach: Re
|
|
1830
|
+
}, nc = /* @__PURE__ */ new Set([
|
|
1831
|
+
...rc,
|
|
1832
|
+
...Object.keys(Qr),
|
|
1833
|
+
...Xr
|
|
1730
1834
|
]);
|
|
1731
1835
|
class ee {
|
|
1732
|
-
constructor(t, r, n,
|
|
1733
|
-
this._path = r, this._isChanged = !1, this._clonedCache = /* @__PURE__ */ new Set(), this._hasOnValidate =
|
|
1836
|
+
constructor(t, r, n, i) {
|
|
1837
|
+
this._path = r, this._isChanged = !1, this._clonedCache = /* @__PURE__ */ new Set(), this._hasOnValidate = i, this._changes = i ? [] : null, this.clone = r === void 0 ? t : this._shallowClone(t);
|
|
1734
1838
|
}
|
|
1735
1839
|
static isHandledMethod(t) {
|
|
1736
|
-
return
|
|
1840
|
+
return zr.has(t);
|
|
1737
1841
|
}
|
|
1738
1842
|
_shallowClone(t) {
|
|
1739
1843
|
let r = t;
|
|
1740
|
-
if (
|
|
1844
|
+
if (Le(t))
|
|
1741
1845
|
r = { ...t };
|
|
1742
|
-
else if (
|
|
1846
|
+
else if (ye(t) || ArrayBuffer.isView(t))
|
|
1743
1847
|
r = [...t];
|
|
1744
1848
|
else if (t instanceof Date)
|
|
1745
1849
|
r = new Date(t);
|
|
@@ -1747,25 +1851,25 @@ class ee {
|
|
|
1747
1851
|
r = new Set([...t].map((n) => this._shallowClone(n)));
|
|
1748
1852
|
else if (t instanceof Map) {
|
|
1749
1853
|
r = /* @__PURE__ */ new Map();
|
|
1750
|
-
for (const [n,
|
|
1751
|
-
r.set(n, this._shallowClone(
|
|
1854
|
+
for (const [n, i] of t.entries())
|
|
1855
|
+
r.set(n, this._shallowClone(i));
|
|
1752
1856
|
}
|
|
1753
1857
|
return this._clonedCache.add(r), r;
|
|
1754
1858
|
}
|
|
1755
|
-
preferredThisArg(t, r, n,
|
|
1756
|
-
return t ? (
|
|
1859
|
+
preferredThisArg(t, r, n, i) {
|
|
1860
|
+
return t ? (ye(i) ? this._onIsChanged = Yr[r] : i instanceof Set ? this._onIsChanged = Jr[r] : i instanceof Map && (this._onIsChanged = Qr[r]), i) : n;
|
|
1757
1861
|
}
|
|
1758
1862
|
update(t, r, n) {
|
|
1759
|
-
const
|
|
1863
|
+
const i = j.after(t, this._path);
|
|
1760
1864
|
if (r !== "length") {
|
|
1761
|
-
let
|
|
1762
|
-
j.walk(
|
|
1763
|
-
|
|
1865
|
+
let s = this.clone;
|
|
1866
|
+
j.walk(i, (o) => {
|
|
1867
|
+
s != null && s[o] && (this._clonedCache.has(s[o]) || (s[o] = this._shallowClone(s[o])), s = s[o]);
|
|
1764
1868
|
}), this._hasOnValidate && this._changes.push({
|
|
1765
|
-
path:
|
|
1869
|
+
path: i,
|
|
1766
1870
|
property: r,
|
|
1767
1871
|
previous: n
|
|
1768
|
-
}),
|
|
1872
|
+
}), s != null && s[r] && (s[r] = n);
|
|
1769
1873
|
}
|
|
1770
1874
|
this._isChanged = !0;
|
|
1771
1875
|
}
|
|
@@ -1781,12 +1885,12 @@ class ee {
|
|
|
1781
1885
|
return j.isRootPath(this._path) || j.isSubPath(t, this._path);
|
|
1782
1886
|
}
|
|
1783
1887
|
}
|
|
1784
|
-
class
|
|
1888
|
+
class nr extends ee {
|
|
1785
1889
|
static isHandledMethod(t) {
|
|
1786
|
-
return
|
|
1890
|
+
return ec.has(t);
|
|
1787
1891
|
}
|
|
1788
1892
|
}
|
|
1789
|
-
class
|
|
1893
|
+
class ic extends ee {
|
|
1790
1894
|
undo(t) {
|
|
1791
1895
|
t.setTime(this.clone.getTime());
|
|
1792
1896
|
}
|
|
@@ -1794,9 +1898,9 @@ class Xu extends ee {
|
|
|
1794
1898
|
return !r(this.clone.valueOf(), t.valueOf());
|
|
1795
1899
|
}
|
|
1796
1900
|
}
|
|
1797
|
-
class
|
|
1901
|
+
class ir extends ee {
|
|
1798
1902
|
static isHandledMethod(t) {
|
|
1799
|
-
return
|
|
1903
|
+
return tc.has(t);
|
|
1800
1904
|
}
|
|
1801
1905
|
undo(t) {
|
|
1802
1906
|
for (const r of this.clone)
|
|
@@ -1805,9 +1909,9 @@ class tr extends ee {
|
|
|
1805
1909
|
this.clone.has(r) || t.delete(r);
|
|
1806
1910
|
}
|
|
1807
1911
|
}
|
|
1808
|
-
class
|
|
1912
|
+
class sr extends ee {
|
|
1809
1913
|
static isHandledMethod(t) {
|
|
1810
|
-
return
|
|
1914
|
+
return nc.has(t);
|
|
1811
1915
|
}
|
|
1812
1916
|
undo(t) {
|
|
1813
1917
|
for (const [r, n] of this.clone.entries())
|
|
@@ -1816,9 +1920,9 @@ class rr extends ee {
|
|
|
1816
1920
|
this.clone.has(r) || t.delete(r);
|
|
1817
1921
|
}
|
|
1818
1922
|
}
|
|
1819
|
-
class
|
|
1820
|
-
constructor(t, r, n,
|
|
1821
|
-
super(void 0, r, n,
|
|
1923
|
+
class sc extends ee {
|
|
1924
|
+
constructor(t, r, n, i) {
|
|
1925
|
+
super(void 0, r, n, i), this._argument1 = n[0], this._weakValue = t.has(this._argument1);
|
|
1822
1926
|
}
|
|
1823
1927
|
isChanged(t, r) {
|
|
1824
1928
|
return this._weakValue !== t.has(this._argument1);
|
|
@@ -1827,9 +1931,9 @@ class Zu extends ee {
|
|
|
1827
1931
|
this._weakValue && !t.has(this._argument1) ? t.add(this._argument1) : t.delete(this._argument1);
|
|
1828
1932
|
}
|
|
1829
1933
|
}
|
|
1830
|
-
class
|
|
1831
|
-
constructor(t, r, n,
|
|
1832
|
-
super(void 0, r, n,
|
|
1934
|
+
class oc extends ee {
|
|
1935
|
+
constructor(t, r, n, i) {
|
|
1936
|
+
super(void 0, r, n, i), this._weakKey = n[0], this._weakHas = t.has(this._weakKey), this._weakValue = t.get(this._weakKey);
|
|
1833
1937
|
}
|
|
1834
1938
|
isChanged(t, r) {
|
|
1835
1939
|
return this._weakValue !== t.get(this._weakKey);
|
|
@@ -1844,24 +1948,24 @@ class Y {
|
|
|
1844
1948
|
this._stack = [], this._hasOnValidate = t;
|
|
1845
1949
|
}
|
|
1846
1950
|
static isHandledType(t) {
|
|
1847
|
-
return
|
|
1951
|
+
return Le(t) || ye(t) || ht(t);
|
|
1848
1952
|
}
|
|
1849
1953
|
static isHandledMethod(t, r) {
|
|
1850
|
-
return
|
|
1954
|
+
return Le(t) ? ee.isHandledMethod(r) : ye(t) ? nr.isHandledMethod(r) : t instanceof Set ? ir.isHandledMethod(r) : t instanceof Map ? sr.isHandledMethod(r) : ht(t);
|
|
1851
1955
|
}
|
|
1852
1956
|
get isCloning() {
|
|
1853
1957
|
return this._stack.length > 0;
|
|
1854
1958
|
}
|
|
1855
1959
|
start(t, r, n) {
|
|
1856
|
-
let
|
|
1857
|
-
|
|
1960
|
+
let i = ee;
|
|
1961
|
+
ye(t) ? i = nr : t instanceof Date ? i = ic : t instanceof Set ? i = ir : t instanceof Map ? i = sr : t instanceof WeakSet ? i = sc : t instanceof WeakMap && (i = oc), this._stack.push(new i(t, r, n, this._hasOnValidate));
|
|
1858
1962
|
}
|
|
1859
1963
|
update(t, r, n) {
|
|
1860
1964
|
this._stack.at(-1).update(t, r, n);
|
|
1861
1965
|
}
|
|
1862
1966
|
preferredThisArg(t, r, n) {
|
|
1863
|
-
const { name:
|
|
1864
|
-
return this._stack.at(-1).preferredThisArg(
|
|
1967
|
+
const { name: i } = t, s = Y.isHandledMethod(n, i);
|
|
1968
|
+
return this._stack.at(-1).preferredThisArg(s, i, r, n);
|
|
1865
1969
|
}
|
|
1866
1970
|
isChanged(t, r) {
|
|
1867
1971
|
return this._stack.at(-1).isChanged(t, r);
|
|
@@ -1876,7 +1980,7 @@ class Y {
|
|
|
1876
1980
|
return this._previousClone = this._stack.pop(), this._previousClone.clone;
|
|
1877
1981
|
}
|
|
1878
1982
|
}
|
|
1879
|
-
const
|
|
1983
|
+
const fc = /* @__PURE__ */ new Set(["values", "keys", "entries"]), uc = /* @__PURE__ */ new Set(["indexOf", "lastIndexOf", "includes"]), cc = {
|
|
1880
1984
|
equals: Object.is,
|
|
1881
1985
|
isShallow: !1,
|
|
1882
1986
|
pathAsArray: !1,
|
|
@@ -1884,140 +1988,140 @@ const Qu = /* @__PURE__ */ new Set(["values", "keys", "entries"]), ec = /* @__PU
|
|
|
1884
1988
|
ignoreUnderscores: !1,
|
|
1885
1989
|
ignoreDetached: !1,
|
|
1886
1990
|
details: !1
|
|
1887
|
-
},
|
|
1991
|
+
}, or = (e, t) => e === !1 || e === !0 || Array.isArray(e) && e.includes(t), qe = (e, t, r = {}) => {
|
|
1888
1992
|
r = {
|
|
1889
|
-
...
|
|
1993
|
+
...cc,
|
|
1890
1994
|
...r
|
|
1891
1995
|
};
|
|
1892
|
-
const n = Symbol("ProxyTarget"), { equals:
|
|
1893
|
-
if (
|
|
1996
|
+
const n = Symbol("ProxyTarget"), { equals: i, isShallow: s, ignoreDetached: o, details: f } = r, u = new Ju(i), l = typeof r.onValidate == "function", c = new Y(l), a = (h, d, y, _, $) => !l || c.isCloning || r.onValidate(j.concat(u.getPath(h), d), y, _, $) === !0, p = (h, d, y, _, $) => {
|
|
1997
|
+
if (rr(u, r, d) || o && u.isDetached(h, e))
|
|
1894
1998
|
return;
|
|
1895
|
-
const
|
|
1999
|
+
const M = u.getAllPaths(h), D = !c.isCloning && M && M.length > 1 ? M : [u.getPath(h)];
|
|
1896
2000
|
for (const ue of D)
|
|
1897
|
-
|
|
1898
|
-
},
|
|
1899
|
-
c.isCloning && c.isPartOfClone(
|
|
1900
|
-
}, g = (
|
|
1901
|
-
if (
|
|
1902
|
-
return
|
|
1903
|
-
|
|
1904
|
-
const
|
|
1905
|
-
return
|
|
1906
|
-
},
|
|
1907
|
-
if (
|
|
2001
|
+
b(ue, d, y, _, $);
|
|
2002
|
+
}, b = (h, d, y, _, $) => {
|
|
2003
|
+
c.isCloning && c.isPartOfClone(h) ? c.update(h, d, _) : t(j.concat(h, d), y, _, $);
|
|
2004
|
+
}, g = (h) => h !== null && (typeof h == "object" || typeof h == "function") ? h[n] ?? h : h, S = (h, d, y, _) => {
|
|
2005
|
+
if (Yu(h) || y === "constructor" || s && !Y.isHandledMethod(d, y) || rr(u, r, y) || u.isGetInvariant(d, y) || o && u.isDetached(d, e))
|
|
2006
|
+
return h;
|
|
2007
|
+
_ === void 0 && (_ = u.getPath(d));
|
|
2008
|
+
const $ = j.concat(_, y), M = u.getPath(h);
|
|
2009
|
+
return M && A($, M) ? u.getProxy(h, M, P, n) : u.getProxy(h, $, P, n);
|
|
2010
|
+
}, A = (h, d) => {
|
|
2011
|
+
if (je(h) || h.length <= d.length || Array.isArray(d) && d.length === 0)
|
|
1908
2012
|
return !1;
|
|
1909
|
-
const
|
|
1910
|
-
return
|
|
1911
|
-
},
|
|
1912
|
-
let
|
|
1913
|
-
const
|
|
1914
|
-
c.start(
|
|
2013
|
+
const y = Array.isArray(h) ? h : h.split(Q), _ = Array.isArray(d) ? d : d.split(Q);
|
|
2014
|
+
return y.length <= _.length ? !1 : !_.some(($, M) => $ !== y[M]);
|
|
2015
|
+
}, O = (h, d, y, _) => {
|
|
2016
|
+
let $ = j.initial(u.getPath(h));
|
|
2017
|
+
const M = Y.isHandledMethod(y, h.name);
|
|
2018
|
+
c.start(y, $, _);
|
|
1915
2019
|
let D;
|
|
1916
|
-
Array.isArray(
|
|
1917
|
-
proxyArray:
|
|
1918
|
-
methodName:
|
|
1919
|
-
searchElement:
|
|
1920
|
-
fromIndex:
|
|
2020
|
+
Array.isArray(y) && uc.has(h.name) ? D = lc({
|
|
2021
|
+
proxyArray: y,
|
|
2022
|
+
methodName: h.name,
|
|
2023
|
+
searchElement: _[0],
|
|
2024
|
+
fromIndex: _[1],
|
|
1921
2025
|
getProxyTarget: g
|
|
1922
2026
|
}) : D = Reflect.apply(
|
|
1923
|
-
|
|
1924
|
-
c.preferredThisArg(
|
|
1925
|
-
|
|
2027
|
+
h,
|
|
2028
|
+
c.preferredThisArg(h, d, y),
|
|
2029
|
+
M ? _.map((re) => g(re)) : _
|
|
1926
2030
|
);
|
|
1927
|
-
const ue = c.isChanged(
|
|
1928
|
-
if (Y.isHandledType(D) &&
|
|
1929
|
-
const re =
|
|
1930
|
-
name:
|
|
1931
|
-
args:
|
|
2031
|
+
const ue = c.isChanged(y, i), he = c.stop();
|
|
2032
|
+
if (Y.isHandledType(D) && M && (d instanceof Map && h.name === "get" && ($ = j.concat($, _[0])), D = u.getProxy(D, $, P)), ue) {
|
|
2033
|
+
const re = or(f, h.name) ? {
|
|
2034
|
+
name: h.name,
|
|
2035
|
+
args: _,
|
|
1932
2036
|
result: D
|
|
1933
|
-
} : void 0,
|
|
1934
|
-
|
|
2037
|
+
} : void 0, Ot = c.isCloning ? j.initial($) : $, $t = c.isCloning ? j.last($) : "";
|
|
2038
|
+
a(j.get(e, Ot), $t, y, he, re) ? b(Ot, $t, y, he, re) : c.undo(y);
|
|
1935
2039
|
}
|
|
1936
|
-
return (d instanceof Map || d instanceof Set) &&
|
|
1937
|
-
},
|
|
1938
|
-
get(
|
|
1939
|
-
if (
|
|
1940
|
-
if (d === n || d ===
|
|
1941
|
-
return
|
|
1942
|
-
if (d ===
|
|
1943
|
-
return u.unsubscribe(),
|
|
2040
|
+
return (d instanceof Map || d instanceof Set) && Xu(D) ? Zu(D, h, d, $, S) : D;
|
|
2041
|
+
}, P = {
|
|
2042
|
+
get(h, d, y) {
|
|
2043
|
+
if (je(d)) {
|
|
2044
|
+
if (d === n || d === At)
|
|
2045
|
+
return h;
|
|
2046
|
+
if (d === qr && !u.isUnsubscribed && u.getPath(h).length === 0)
|
|
2047
|
+
return u.unsubscribe(), h;
|
|
1944
2048
|
}
|
|
1945
|
-
const
|
|
1946
|
-
return
|
|
2049
|
+
const _ = ht(h) ? Reflect.get(h, d) : Reflect.get(h, d, y);
|
|
2050
|
+
return S(_, h, d);
|
|
1947
2051
|
},
|
|
1948
|
-
set(
|
|
1949
|
-
|
|
1950
|
-
const
|
|
1951
|
-
if (
|
|
2052
|
+
set(h, d, y, _) {
|
|
2053
|
+
y = g(y);
|
|
2054
|
+
const $ = h[n] ?? h, M = $[d];
|
|
2055
|
+
if (i(M, y) && d in h)
|
|
1952
2056
|
return !0;
|
|
1953
|
-
const D = h
|
|
1954
|
-
return D && u.setProperty(
|
|
2057
|
+
const D = a(h, d, y, M);
|
|
2058
|
+
return D && u.setProperty($, d, y, _, M) ? (p(h, d, h[d], M), !0) : !D;
|
|
1955
2059
|
},
|
|
1956
|
-
defineProperty(
|
|
1957
|
-
if (!u.isSameDescriptor(
|
|
1958
|
-
const
|
|
1959
|
-
if (h
|
|
1960
|
-
const
|
|
2060
|
+
defineProperty(h, d, y) {
|
|
2061
|
+
if (!u.isSameDescriptor(y, h, d)) {
|
|
2062
|
+
const _ = h[d];
|
|
2063
|
+
if (a(h, d, y.value, _) && u.defineProperty(h, d, y)) {
|
|
2064
|
+
const M = Object.hasOwn(y, "value") ? y.value : (() => {
|
|
1961
2065
|
try {
|
|
1962
|
-
return
|
|
2066
|
+
return h[d];
|
|
1963
2067
|
} catch {
|
|
1964
2068
|
return;
|
|
1965
2069
|
}
|
|
1966
2070
|
})();
|
|
1967
|
-
p(
|
|
2071
|
+
p(h, d, M, _);
|
|
1968
2072
|
}
|
|
1969
2073
|
}
|
|
1970
2074
|
return !0;
|
|
1971
2075
|
},
|
|
1972
|
-
deleteProperty(
|
|
1973
|
-
if (!Reflect.has(
|
|
2076
|
+
deleteProperty(h, d) {
|
|
2077
|
+
if (!Reflect.has(h, d))
|
|
1974
2078
|
return !0;
|
|
1975
|
-
const
|
|
1976
|
-
return
|
|
2079
|
+
const y = Reflect.get(h, d), _ = a(h, d, void 0, y);
|
|
2080
|
+
return _ && u.deleteProperty(h, d, y) ? (p(h, d, void 0, y), !0) : !_;
|
|
1977
2081
|
},
|
|
1978
|
-
apply(
|
|
1979
|
-
const
|
|
2082
|
+
apply(h, d, y) {
|
|
2083
|
+
const _ = (d == null ? void 0 : d[n]) ?? d;
|
|
1980
2084
|
if (u.isUnsubscribed)
|
|
1981
|
-
return Reflect.apply(
|
|
1982
|
-
if (Y.isHandledType(
|
|
1983
|
-
return
|
|
1984
|
-
if (
|
|
1985
|
-
const
|
|
1986
|
-
if (!
|
|
1987
|
-
const ue = u.getPath(
|
|
1988
|
-
if (
|
|
2085
|
+
return Reflect.apply(h, _, y);
|
|
2086
|
+
if (Y.isHandledType(_) && !(Le(_) && !Y.isHandledMethod(_, h.name)) && (typeof h.name == "symbol" || fc.has(h.name) || f === !1 || Array.isArray(f) && !f.includes(h.name)))
|
|
2087
|
+
return O(h, d, _, y);
|
|
2088
|
+
if (_ instanceof Date && Y.isHandledMethod(_, h.name)) {
|
|
2089
|
+
const $ = _.getTime(), M = Reflect.apply(h, _, y), D = _.getTime();
|
|
2090
|
+
if (!i($, D)) {
|
|
2091
|
+
const ue = u.getPath(_);
|
|
2092
|
+
if (or(f, h.name)) {
|
|
1989
2093
|
const he = {
|
|
1990
|
-
name:
|
|
1991
|
-
args:
|
|
1992
|
-
result:
|
|
1993
|
-
}, re = new Date(
|
|
1994
|
-
|
|
2094
|
+
name: h.name,
|
|
2095
|
+
args: y,
|
|
2096
|
+
result: M
|
|
2097
|
+
}, re = new Date($);
|
|
2098
|
+
a(j.get(e, ue), "", _, re, he) ? b(ue, "", _, re, he) : _.setTime($);
|
|
1995
2099
|
}
|
|
1996
2100
|
}
|
|
1997
|
-
return
|
|
2101
|
+
return M;
|
|
1998
2102
|
}
|
|
1999
|
-
return Reflect.apply(
|
|
2103
|
+
return Reflect.apply(h, d, y);
|
|
2000
2104
|
}
|
|
2001
|
-
},
|
|
2002
|
-
return t = t.bind(
|
|
2003
|
-
},
|
|
2004
|
-
const { proxyArray: t, methodName: r, searchElement: n, fromIndex:
|
|
2105
|
+
}, x = u.getProxy(e, r.pathAsArray ? [] : "", P);
|
|
2106
|
+
return t = t.bind(x), l && (r.onValidate = r.onValidate.bind(x)), x;
|
|
2107
|
+
}, lc = (e) => {
|
|
2108
|
+
const { proxyArray: t, methodName: r, searchElement: n, fromIndex: i, getProxyTarget: s } = e, { length: o } = t;
|
|
2005
2109
|
if (o === 0)
|
|
2006
2110
|
return r === "includes" ? !1 : -1;
|
|
2007
2111
|
const f = r === "lastIndexOf";
|
|
2008
|
-
let u =
|
|
2112
|
+
let u = i === void 0 ? f ? o - 1 : 0 : Math.trunc(Number(i)) || 0;
|
|
2009
2113
|
u < 0 ? u = Math.max(0, o + u) : f && (u = Math.min(u, o - 1));
|
|
2010
|
-
const
|
|
2011
|
-
for (let
|
|
2012
|
-
const g = t[
|
|
2013
|
-
if (g === n ||
|
|
2014
|
-
return r === "includes" ? !0 :
|
|
2114
|
+
const l = s(n), c = r === "lastIndexOf", a = c ? -1 : o, p = c ? -1 : 1;
|
|
2115
|
+
for (let b = u; c ? b > a : b < a; b += p) {
|
|
2116
|
+
const g = t[b];
|
|
2117
|
+
if (g === n || s(g) === l)
|
|
2118
|
+
return r === "includes" ? !0 : b;
|
|
2015
2119
|
}
|
|
2016
2120
|
return r === "includes" ? !1 : -1;
|
|
2017
2121
|
};
|
|
2018
|
-
|
|
2019
|
-
|
|
2020
|
-
class
|
|
2122
|
+
qe.target = (e) => (e == null ? void 0 : e[At]) ?? e;
|
|
2123
|
+
qe.unsubscribe = (e) => (e == null ? void 0 : e[qr]) ?? e;
|
|
2124
|
+
class ac {
|
|
2021
2125
|
constructor(t) {
|
|
2022
2126
|
/**
|
|
2023
2127
|
* 我们知道 model 的关键是 field 和 defaultValue, 由于我们根本不知道这个过程什么时候
|
|
@@ -2026,22 +2130,22 @@ class nc {
|
|
|
2026
2130
|
* 就是没有提供 defaultValue 的 field,那么我们再给他设置为 undefined
|
|
2027
2131
|
*/
|
|
2028
2132
|
// 关系表,用于收集 field 和 defaultValue 的对应关系, key 是 path
|
|
2029
|
-
|
|
2133
|
+
w(this, "relationMap", /* @__PURE__ */ new Map());
|
|
2030
2134
|
// 暂停 onChange 回调处理的标志
|
|
2031
|
-
|
|
2032
|
-
|
|
2033
|
-
|
|
2034
|
-
this.pauseOnChange || (this.runtime._update.trigger("model", t), this.runtime._options.noAutoLookup ||
|
|
2135
|
+
w(this, "pauseOnChange", !1);
|
|
2136
|
+
w(this, "model", ie(
|
|
2137
|
+
qe({}, (t, r) => {
|
|
2138
|
+
this.pauseOnChange || (this.runtime._update.trigger("model", t), this.runtime._options.noAutoLookup || lt(t, r, this.runtime));
|
|
2035
2139
|
})
|
|
2036
2140
|
));
|
|
2037
|
-
|
|
2038
|
-
|
|
2141
|
+
w(this, "immutableModel", {});
|
|
2142
|
+
w(this, "allConsumed", ie(!1));
|
|
2039
2143
|
this.runtime = t;
|
|
2040
2144
|
}
|
|
2041
2145
|
triggerLookup() {
|
|
2042
2146
|
for (const [t] of this.runtime.lookups.value.entries()) {
|
|
2043
|
-
const r =
|
|
2044
|
-
|
|
2147
|
+
const r = T(this.model.value, t);
|
|
2148
|
+
lt(t, r, this.runtime);
|
|
2045
2149
|
}
|
|
2046
2150
|
}
|
|
2047
2151
|
// 默认是记录关系,如果检测到同 path 的 defaultValue 和 field 都已经稳定 processed,那么则可以消费记录
|
|
@@ -2051,16 +2155,16 @@ class nc {
|
|
|
2051
2155
|
!t.path.endsWith("]") || t.propertyKey === "type" && r === "group")
|
|
2052
2156
|
return;
|
|
2053
2157
|
const n = this.relationMap.get(t.path);
|
|
2054
|
-
let
|
|
2055
|
-
if (n && n.isConsumed === !0 && (
|
|
2158
|
+
let i = !1;
|
|
2159
|
+
if (n && n.isConsumed === !0 && (i = !0), !i) {
|
|
2056
2160
|
this.relationMap.set(t.path, {
|
|
2057
2161
|
metadata: t,
|
|
2058
2162
|
...this.relationMap.get(t.path),
|
|
2059
2163
|
[t.propertyKey]: r,
|
|
2060
2164
|
isConsumed: !1
|
|
2061
2165
|
});
|
|
2062
|
-
const
|
|
2063
|
-
"defaultValue" in
|
|
2166
|
+
const s = this.relationMap.get(t.path);
|
|
2167
|
+
"defaultValue" in s && "field" in s && "type" in s && this.consumeRelation(t.path);
|
|
2064
2168
|
return;
|
|
2065
2169
|
}
|
|
2066
2170
|
}
|
|
@@ -2080,8 +2184,8 @@ class nc {
|
|
|
2080
2184
|
* 4、同理,如果找不到这样的前缀,那么它一定是在 group 里
|
|
2081
2185
|
*/
|
|
2082
2186
|
consume(t) {
|
|
2083
|
-
const r = t.metadata.path, n =
|
|
2084
|
-
r.includes("children") ? n.isListChild ? this.resolveRelations(
|
|
2187
|
+
const r = t.metadata.path, n = Gu(this.relationMap, r);
|
|
2188
|
+
r.includes("children") ? n.isListChild ? this.resolveRelations(ju(n.existingRelations)) : V(this.model.value, t.field, t.defaultValue) : V(this.model.value, t.field, t.defaultValue), this.checkingConsume();
|
|
2085
2189
|
}
|
|
2086
2190
|
defaultValueCalcByType(t) {
|
|
2087
2191
|
if (t === "list")
|
|
@@ -2089,22 +2193,22 @@ class nc {
|
|
|
2089
2193
|
}
|
|
2090
2194
|
resolveRelations(t, r) {
|
|
2091
2195
|
if (t.length === 0) return;
|
|
2092
|
-
const { current: n, parent:
|
|
2196
|
+
const { current: n, parent: i } = t[0];
|
|
2093
2197
|
if (n.field) {
|
|
2094
2198
|
if (!("defaultValue" in n)) {
|
|
2095
2199
|
t.shift(), this.resolveRelations(
|
|
2096
2200
|
[...t],
|
|
2097
|
-
r ? `${r}.[0].${n.field}` :
|
|
2201
|
+
r ? `${r}.[0].${n.field}` : i ? `[0].${n.field}` : n.field
|
|
2098
2202
|
);
|
|
2099
2203
|
return;
|
|
2100
2204
|
}
|
|
2101
|
-
n.isConsumed || (
|
|
2205
|
+
n.isConsumed || (V(
|
|
2102
2206
|
this.model.value,
|
|
2103
2207
|
`${r ? `${r}.[0].${n.field}` : `${n.field}`}`,
|
|
2104
2208
|
n.defaultValue ?? this.defaultValueCalcByType(n.type)
|
|
2105
2209
|
), n.isConsumed = !0), t.shift(), this.resolveRelations(
|
|
2106
2210
|
[...t],
|
|
2107
|
-
r ? `${r}.[0].${n.field}` :
|
|
2211
|
+
r ? `${r}.[0].${n.field}` : i ? `[0].${n.field}` : n.field
|
|
2108
2212
|
);
|
|
2109
2213
|
}
|
|
2110
2214
|
}
|
|
@@ -2119,71 +2223,71 @@ class nc {
|
|
|
2119
2223
|
this.isAllConsumed() && (this.immutableModel = F(this.model.value));
|
|
2120
2224
|
}
|
|
2121
2225
|
}
|
|
2122
|
-
function
|
|
2226
|
+
function hc(e) {
|
|
2123
2227
|
var r, n;
|
|
2124
2228
|
return {
|
|
2125
|
-
gap: `${e ?? ((r =
|
|
2229
|
+
gap: `${e ?? ((r = U.context.default) == null ? void 0 : r.layoutGap) ?? 16}px`,
|
|
2126
2230
|
width: "100%",
|
|
2127
2231
|
height: "100%",
|
|
2128
2232
|
display: "flex",
|
|
2129
2233
|
flexWrap: "wrap",
|
|
2130
2234
|
justifyContent: "flex-start",
|
|
2131
|
-
background: ((n =
|
|
2235
|
+
background: ((n = U.context.default) == null ? void 0 : n.gapBgColor) ?? "transparent"
|
|
2132
2236
|
};
|
|
2133
2237
|
}
|
|
2134
|
-
function
|
|
2238
|
+
function dc(e) {
|
|
2135
2239
|
var r, n;
|
|
2136
2240
|
return {
|
|
2137
|
-
gap: `${e ?? ((r =
|
|
2241
|
+
gap: `${e ?? ((r = U.context.default) == null ? void 0 : r.listLayoutGap) ?? 16}px`,
|
|
2138
2242
|
width: "100%",
|
|
2139
2243
|
height: "100%",
|
|
2140
2244
|
display: "flex",
|
|
2141
2245
|
flexWrap: "wrap",
|
|
2142
2246
|
justifyContent: "flex-start",
|
|
2143
|
-
background: ((n =
|
|
2247
|
+
background: ((n = U.context.default) == null ? void 0 : n.gapBgColor) ?? "transparent"
|
|
2144
2248
|
};
|
|
2145
2249
|
}
|
|
2146
|
-
function
|
|
2250
|
+
function pc(e, t, r) {
|
|
2147
2251
|
return {
|
|
2148
2252
|
[e._adapter.adaptee.formModelKey]: r ? `${r}.${t.field}` : t.field,
|
|
2149
2253
|
...t.formItemProps
|
|
2150
2254
|
};
|
|
2151
2255
|
}
|
|
2152
|
-
function
|
|
2256
|
+
function gc(e) {
|
|
2153
2257
|
var r;
|
|
2154
2258
|
return {
|
|
2155
|
-
...((r =
|
|
2259
|
+
...((r = U.context.default) == null ? void 0 : r.formProps) ?? {},
|
|
2156
2260
|
...e._options.formProps
|
|
2157
2261
|
};
|
|
2158
2262
|
}
|
|
2159
|
-
function
|
|
2263
|
+
function yc(e, t) {
|
|
2160
2264
|
if (!e) return;
|
|
2161
2265
|
if (!t || L(e))
|
|
2162
2266
|
return e;
|
|
2163
2267
|
const r = t.split(".").pop();
|
|
2164
2268
|
return e(r);
|
|
2165
2269
|
}
|
|
2166
|
-
const
|
|
2270
|
+
const _c = {
|
|
2167
2271
|
item: "Item",
|
|
2168
2272
|
group: "Group",
|
|
2169
2273
|
list: "List",
|
|
2170
2274
|
listItem: "ListItem"
|
|
2171
2275
|
};
|
|
2172
|
-
function
|
|
2173
|
-
var n,
|
|
2276
|
+
function bc(e, t, r) {
|
|
2277
|
+
var n, i;
|
|
2174
2278
|
if (t.type === "list") {
|
|
2175
|
-
const
|
|
2279
|
+
const s = {
|
|
2176
2280
|
List: e._render.meta.layouts.List,
|
|
2177
2281
|
ListItem: e._render.meta.layouts.ListItem
|
|
2178
2282
|
};
|
|
2179
|
-
return (n = t.layout) != null && n.List || (
|
|
2180
|
-
...
|
|
2283
|
+
return (n = t.layout) != null && n.List || (i = t.layout) != null && i.ListItem ? {
|
|
2284
|
+
...s,
|
|
2181
2285
|
...Object.keys(t.layout).reduce((o, f) => L(t.layout[f]) ? (o[f] = e._render.meta.layouts[t.layout[f]], o) : X(t.layout[f]) ? (o[f] = t.layout[f], o) : (o[f] = e._render.meta.layouts[f], o), {})
|
|
2182
|
-
} :
|
|
2286
|
+
} : s;
|
|
2183
2287
|
}
|
|
2184
|
-
return L(t.layout) ? e._render.meta.layouts[t.layout] : X(t.layout) ? t.layout : e._render.meta.layouts[
|
|
2288
|
+
return L(t.layout) ? e._render.meta.layouts[t.layout] : X(t.layout) ? t.layout : e._render.meta.layouts[_c[t.type]];
|
|
2185
2289
|
}
|
|
2186
|
-
function
|
|
2290
|
+
function rt(e, t = 16) {
|
|
2187
2291
|
if (!e.span)
|
|
2188
2292
|
return {
|
|
2189
2293
|
width: "100%"
|
|
@@ -2196,7 +2300,7 @@ function tt(e, t = 16) {
|
|
|
2196
2300
|
verticalAlign: "top"
|
|
2197
2301
|
};
|
|
2198
2302
|
}
|
|
2199
|
-
function
|
|
2303
|
+
function mc(e) {
|
|
2200
2304
|
const t = {};
|
|
2201
2305
|
for (const r in e)
|
|
2202
2306
|
e[r].forEach((n) => {
|
|
@@ -2204,39 +2308,39 @@ function lc(e) {
|
|
|
2204
2308
|
});
|
|
2205
2309
|
return t;
|
|
2206
2310
|
}
|
|
2207
|
-
const
|
|
2311
|
+
const fr = mc({
|
|
2208
2312
|
请选择: ["select", "tree", "cascader"],
|
|
2209
2313
|
请输入: ["input"]
|
|
2210
2314
|
});
|
|
2211
|
-
function
|
|
2315
|
+
function wc(e, t) {
|
|
2212
2316
|
if (!e) return;
|
|
2213
2317
|
let r = `请输入${e}`;
|
|
2214
|
-
return Object.keys(
|
|
2215
|
-
t != null && t.toLowerCase().includes(n.toLowerCase()) && (r = `${
|
|
2318
|
+
return Object.keys(fr).forEach((n) => {
|
|
2319
|
+
t != null && t.toLowerCase().includes(n.toLowerCase()) && (r = `${fr[n]}${e}`);
|
|
2216
2320
|
}), r;
|
|
2217
2321
|
}
|
|
2218
|
-
function
|
|
2322
|
+
function Sc(e) {
|
|
2219
2323
|
let { rules: t, required: r } = e;
|
|
2220
2324
|
t = t ? [...t] : [];
|
|
2221
2325
|
const n = t.findIndex(
|
|
2222
|
-
(
|
|
2326
|
+
(i) => r in i
|
|
2223
2327
|
);
|
|
2224
2328
|
if (L(r)) {
|
|
2225
|
-
const
|
|
2226
|
-
n >= 0 ? t[n] =
|
|
2227
|
-
} else if (
|
|
2228
|
-
const
|
|
2229
|
-
n >= 0 ? t[n] =
|
|
2329
|
+
const i = { required: !0, message: r };
|
|
2330
|
+
n >= 0 ? t[n] = i : t.unshift(i);
|
|
2331
|
+
} else if (Br(r) && r) {
|
|
2332
|
+
const i = { required: !0, message: `${e.label}不能为空` };
|
|
2333
|
+
n >= 0 ? t[n] = i : t.unshift(i);
|
|
2230
2334
|
}
|
|
2231
2335
|
return t;
|
|
2232
2336
|
}
|
|
2233
|
-
class
|
|
2337
|
+
class Tc {
|
|
2234
2338
|
constructor(t) {
|
|
2235
|
-
|
|
2339
|
+
w(this, "formRef", ie());
|
|
2236
2340
|
this.runtime = t, this.meta = this.getRenderMeta();
|
|
2237
2341
|
}
|
|
2238
2342
|
getRenderMeta() {
|
|
2239
|
-
const t =
|
|
2343
|
+
const t = U.getTemplate(this.runtime._options.templateId);
|
|
2240
2344
|
return {
|
|
2241
2345
|
Form: t.providers.Form,
|
|
2242
2346
|
FormItem: t.providers.FormItem,
|
|
@@ -2244,48 +2348,48 @@ class pc {
|
|
|
2244
2348
|
adapters: {}
|
|
2245
2349
|
};
|
|
2246
2350
|
}
|
|
2247
|
-
renderItemSchema(t, r = this.runtime._model.model.value, n,
|
|
2248
|
-
const
|
|
2249
|
-
this.runtime._schema.refs.set(
|
|
2250
|
-
const f =
|
|
2351
|
+
renderItemSchema(t, r = this.runtime._model.model.value, n, i) {
|
|
2352
|
+
const s = n ? `${n}.${t.field}` : t.field, o = ie();
|
|
2353
|
+
this.runtime._schema.refs.set(s, o);
|
|
2354
|
+
const f = nn(t.component);
|
|
2251
2355
|
if (!f) return;
|
|
2252
|
-
const u =
|
|
2253
|
-
return t.lookup &&
|
|
2254
|
-
style:
|
|
2356
|
+
const u = pc(this.runtime, t, n), l = Br(t.show) ? t.show : !0, c = yc(t.label, n), a = wc(c, f.name);
|
|
2357
|
+
return t.lookup && Fu(t, s, this.runtime), l && B(i, {
|
|
2358
|
+
style: rt(t, this.runtime._options.layoutGap)
|
|
2255
2359
|
}, {
|
|
2256
|
-
default: () => [
|
|
2360
|
+
default: () => [B(this.meta.FormItem, ze(u, {
|
|
2257
2361
|
label: c,
|
|
2258
|
-
rules:
|
|
2362
|
+
rules: Sc(t)
|
|
2259
2363
|
}), {
|
|
2260
2364
|
...t.formItemSlots,
|
|
2261
|
-
default: () =>
|
|
2365
|
+
default: () => B(f, ze({
|
|
2262
2366
|
ref: o,
|
|
2263
|
-
modelValue:
|
|
2367
|
+
modelValue: T(r, t.field),
|
|
2264
2368
|
"onUpdate:modelValue": (p) => {
|
|
2265
|
-
|
|
2369
|
+
V(r, t.field, p);
|
|
2266
2370
|
},
|
|
2267
|
-
placeholder: t.placeholder ??
|
|
2371
|
+
placeholder: t.placeholder ?? a
|
|
2268
2372
|
}, t.componentProps), {
|
|
2269
2373
|
...t.componentSlots
|
|
2270
2374
|
})
|
|
2271
2375
|
})]
|
|
2272
2376
|
});
|
|
2273
2377
|
}
|
|
2274
|
-
renderListSchema(t, r = this.runtime._model.model.value, n,
|
|
2275
|
-
const o =
|
|
2276
|
-
return
|
|
2378
|
+
renderListSchema(t, r = this.runtime._model.model.value, n, i, s) {
|
|
2379
|
+
const o = T(r, t.field) ?? [{}];
|
|
2380
|
+
return B(s.List, {
|
|
2277
2381
|
listModel: o,
|
|
2278
|
-
style:
|
|
2382
|
+
style: rt(t, this.runtime._options.layoutGap)
|
|
2279
2383
|
}, {
|
|
2280
|
-
default: () => o.map((f, u) =>
|
|
2281
|
-
default: () =>
|
|
2282
|
-
style:
|
|
2283
|
-
}, [t.children.map((
|
|
2384
|
+
default: () => o.map((f, u) => B(s.ListItem, null, {
|
|
2385
|
+
default: () => B("div", {
|
|
2386
|
+
style: dc(this.runtime._options.listLayoutGap)
|
|
2387
|
+
}, [t.children.map((l) => this.renderParsedSchema(l, f, n ? `${n}.${t.field}.${u}` : `${t.field}.${u}`, i ? `${i}.${t.field}.[0]` : `${t.field}.[0]`))]),
|
|
2284
2388
|
delete: ({
|
|
2285
|
-
render:
|
|
2389
|
+
render: l
|
|
2286
2390
|
}) => {
|
|
2287
|
-
const c =
|
|
2288
|
-
return o.length >
|
|
2391
|
+
const c = l(), a = t.minLen ?? 1;
|
|
2392
|
+
return o.length > a && B(c, {
|
|
2289
2393
|
disabled: !this.runtime._model.allConsumed.value,
|
|
2290
2394
|
onClick: () => {
|
|
2291
2395
|
o.splice(o.indexOf(f), 1);
|
|
@@ -2297,423 +2401,423 @@ class pc {
|
|
|
2297
2401
|
render: f
|
|
2298
2402
|
}) => {
|
|
2299
2403
|
const u = f();
|
|
2300
|
-
return
|
|
2404
|
+
return B(u, {
|
|
2301
2405
|
disabled: !this.runtime._model.allConsumed.value,
|
|
2302
2406
|
onClick: () => {
|
|
2303
|
-
const
|
|
2407
|
+
const l = `${i ? `${i}.${t.field}.[0]` : `${t.field}.[0]`}`, c = T(this.runtime._model.immutableModel, l);
|
|
2304
2408
|
r[t.field].push(F(c));
|
|
2305
2409
|
}
|
|
2306
2410
|
}, null);
|
|
2307
2411
|
}
|
|
2308
2412
|
});
|
|
2309
2413
|
}
|
|
2310
|
-
renderGroupSchema(t, r = this.runtime._model.model.value, n,
|
|
2311
|
-
return
|
|
2312
|
-
style:
|
|
2414
|
+
renderGroupSchema(t, r = this.runtime._model.model.value, n, i) {
|
|
2415
|
+
return B(i, {
|
|
2416
|
+
style: rt(t, this.runtime._options.layoutGap),
|
|
2313
2417
|
schema: t
|
|
2314
2418
|
}, {
|
|
2315
|
-
default: () => t.children.map((
|
|
2419
|
+
default: () => t.children.map((s) => this.renderParsedSchema(s, r, n))
|
|
2316
2420
|
});
|
|
2317
2421
|
}
|
|
2318
|
-
renderParsedSchema(t, r = this.runtime._model.model.value, n,
|
|
2319
|
-
const
|
|
2422
|
+
renderParsedSchema(t, r = this.runtime._model.model.value, n, i) {
|
|
2423
|
+
const s = bc(this.runtime, t);
|
|
2320
2424
|
switch (t.type) {
|
|
2321
2425
|
case "item":
|
|
2322
|
-
return this.renderItemSchema(t, r, n,
|
|
2426
|
+
return this.renderItemSchema(t, r, n, s);
|
|
2323
2427
|
case "group":
|
|
2324
|
-
return this.renderGroupSchema(t, r, n,
|
|
2428
|
+
return this.renderGroupSchema(t, r, n, s);
|
|
2325
2429
|
case "list":
|
|
2326
|
-
return this.renderListSchema(t, r, n,
|
|
2430
|
+
return this.renderListSchema(t, r, n, i, s);
|
|
2327
2431
|
default:
|
|
2328
|
-
return this.renderItemSchema(t, r, n,
|
|
2432
|
+
return this.renderItemSchema(t, r, n, s);
|
|
2329
2433
|
}
|
|
2330
2434
|
}
|
|
2331
2435
|
render() {
|
|
2332
|
-
return /* @__PURE__ */
|
|
2436
|
+
return /* @__PURE__ */ sn({
|
|
2333
2437
|
setup: () => {
|
|
2334
|
-
const t =
|
|
2335
|
-
return () =>
|
|
2438
|
+
const t = gc(this.runtime);
|
|
2439
|
+
return () => B(this.meta.Form, ze({
|
|
2336
2440
|
ref: this.formRef
|
|
2337
2441
|
}, t, {
|
|
2338
2442
|
[this.runtime._adapter.adaptee.formModelName]: this.runtime._model.model.value
|
|
2339
2443
|
}), {
|
|
2340
2444
|
...this.runtime._options.formSlots,
|
|
2341
|
-
default: () =>
|
|
2342
|
-
style:
|
|
2445
|
+
default: () => B("div", {
|
|
2446
|
+
style: hc(this.runtime._options.layoutGap)
|
|
2343
2447
|
}, [this.runtime._schema.parsedSchemas.value.map((r) => this.renderParsedSchema.bind(this)(r))])
|
|
2344
2448
|
});
|
|
2345
2449
|
}
|
|
2346
2450
|
});
|
|
2347
2451
|
}
|
|
2348
2452
|
}
|
|
2349
|
-
function
|
|
2350
|
-
const r = (
|
|
2351
|
-
let
|
|
2352
|
-
for (const o of
|
|
2353
|
-
if (
|
|
2354
|
-
|
|
2453
|
+
function Ac(e, t) {
|
|
2454
|
+
const r = (i) => {
|
|
2455
|
+
let s = e;
|
|
2456
|
+
for (const o of i) {
|
|
2457
|
+
if (s == null) return;
|
|
2458
|
+
s = s[o];
|
|
2355
2459
|
}
|
|
2356
|
-
return
|
|
2357
|
-
}, n = (
|
|
2358
|
-
const
|
|
2460
|
+
return s;
|
|
2461
|
+
}, n = (i) => {
|
|
2462
|
+
const s = r(i), o = typeof s == "function" ? () => {
|
|
2359
2463
|
} : {};
|
|
2360
2464
|
return new Proxy(o, {
|
|
2361
2465
|
get(f, u) {
|
|
2362
2466
|
if (u === "__raw__")
|
|
2363
|
-
return
|
|
2467
|
+
return s;
|
|
2364
2468
|
if (u === "valueOf" || u === "toString" || u === Symbol.toPrimitive)
|
|
2365
2469
|
return () => {
|
|
2366
|
-
const
|
|
2367
|
-
return
|
|
2470
|
+
const a = i.join("."), p = r(i);
|
|
2471
|
+
return i.length > 0 && t(a), u === "toString" ? typeof p == "object" && p !== null ? "[object Object]" : String(p) : p;
|
|
2368
2472
|
};
|
|
2369
2473
|
if (typeof u == "symbol") return;
|
|
2370
|
-
const
|
|
2474
|
+
const l = [...i, String(u)], c = r(l);
|
|
2371
2475
|
if (c == null || typeof c != "object" && typeof c != "function") {
|
|
2372
|
-
const
|
|
2373
|
-
return t(
|
|
2476
|
+
const a = l.join(".");
|
|
2477
|
+
return t(a), c;
|
|
2374
2478
|
}
|
|
2375
|
-
return n(
|
|
2479
|
+
return n(l);
|
|
2376
2480
|
},
|
|
2377
|
-
apply(f, u,
|
|
2378
|
-
const c =
|
|
2379
|
-
|
|
2380
|
-
const
|
|
2381
|
-
if (typeof
|
|
2382
|
-
const p =
|
|
2383
|
-
return
|
|
2481
|
+
apply(f, u, l) {
|
|
2482
|
+
const c = i.join(".");
|
|
2483
|
+
i.length > 0 && t(c);
|
|
2484
|
+
const a = r(i);
|
|
2485
|
+
if (typeof a == "function") {
|
|
2486
|
+
const p = i.slice(0, -1), b = r(p) || e;
|
|
2487
|
+
return a.apply(b, l);
|
|
2384
2488
|
}
|
|
2385
2489
|
},
|
|
2386
2490
|
has(f, u) {
|
|
2387
|
-
const
|
|
2388
|
-
return
|
|
2491
|
+
const l = r(i);
|
|
2492
|
+
return l && typeof l == "object" ? Reflect.has(l, u) : !1;
|
|
2389
2493
|
},
|
|
2390
2494
|
getOwnPropertyDescriptor(f, u) {
|
|
2391
|
-
const
|
|
2392
|
-
if (
|
|
2393
|
-
const c = Reflect.getOwnPropertyDescriptor(
|
|
2495
|
+
const l = r(i);
|
|
2496
|
+
if (l && typeof l == "object") {
|
|
2497
|
+
const c = Reflect.getOwnPropertyDescriptor(l, u);
|
|
2394
2498
|
return c && !c.configurable && !Reflect.getOwnPropertyDescriptor(f, u) ? { ...c, configurable: !0 } : c;
|
|
2395
2499
|
}
|
|
2396
2500
|
},
|
|
2397
2501
|
ownKeys(f) {
|
|
2398
|
-
const u = r(
|
|
2502
|
+
const u = r(i);
|
|
2399
2503
|
return u && typeof u == "object" ? Reflect.ownKeys(u) : [];
|
|
2400
2504
|
}
|
|
2401
2505
|
});
|
|
2402
2506
|
};
|
|
2403
2507
|
return n([]);
|
|
2404
2508
|
}
|
|
2405
|
-
function
|
|
2509
|
+
function Oc(e, t) {
|
|
2406
2510
|
return L(e) ? async () => await t.ssr.renderComponent(e) : e;
|
|
2407
2511
|
}
|
|
2408
|
-
function
|
|
2409
|
-
function r(n,
|
|
2512
|
+
function $c(e, t) {
|
|
2513
|
+
function r(n, i) {
|
|
2410
2514
|
if (!(typeof n != "object" || n === null))
|
|
2411
2515
|
if (Array.isArray(n))
|
|
2412
|
-
for (let
|
|
2413
|
-
const o = n[
|
|
2414
|
-
key:
|
|
2415
|
-
path: [...
|
|
2516
|
+
for (let s = 0; s < n.length; s++) {
|
|
2517
|
+
const o = n[s], f = typeof o != "object" || o === null, u = {
|
|
2518
|
+
key: s,
|
|
2519
|
+
path: [...i, s],
|
|
2416
2520
|
parent: n,
|
|
2417
2521
|
isLeaf: f
|
|
2418
|
-
},
|
|
2419
|
-
n[
|
|
2522
|
+
}, l = t(o, u);
|
|
2523
|
+
n[s] = l, typeof l == "object" && l !== null && r(l, u.path);
|
|
2420
2524
|
}
|
|
2421
2525
|
else {
|
|
2422
|
-
const
|
|
2423
|
-
for (const o of
|
|
2424
|
-
const f = n[o], u = typeof f != "object" || f === null,
|
|
2526
|
+
const s = Object.keys(n);
|
|
2527
|
+
for (const o of s) {
|
|
2528
|
+
const f = n[o], u = typeof f != "object" || f === null, l = {
|
|
2425
2529
|
key: o,
|
|
2426
|
-
path: [...
|
|
2530
|
+
path: [...i, o],
|
|
2427
2531
|
parent: n,
|
|
2428
2532
|
isLeaf: u
|
|
2429
|
-
}, c = t(f,
|
|
2430
|
-
n[o] = c, typeof c == "object" && c !== null && r(c,
|
|
2533
|
+
}, c = t(f, l);
|
|
2534
|
+
n[o] = c, typeof c == "object" && c !== null && r(c, l.path);
|
|
2431
2535
|
}
|
|
2432
2536
|
}
|
|
2433
2537
|
}
|
|
2434
2538
|
return r(e, []), e;
|
|
2435
2539
|
}
|
|
2436
|
-
function
|
|
2540
|
+
function vc(e) {
|
|
2437
2541
|
return ["GET", "POST", "PUT", "DELETE", "PATCH"].includes(e);
|
|
2438
2542
|
}
|
|
2439
|
-
function
|
|
2543
|
+
function Rc(e) {
|
|
2440
2544
|
return ["CONDITION"].includes(e);
|
|
2441
2545
|
}
|
|
2442
|
-
function
|
|
2546
|
+
function Mc(e) {
|
|
2443
2547
|
return ["EVENT_HANDLER"].includes(e);
|
|
2444
2548
|
}
|
|
2445
|
-
function
|
|
2549
|
+
function xc(e) {
|
|
2446
2550
|
return ["SET_MODEL"].includes(e);
|
|
2447
2551
|
}
|
|
2448
|
-
function
|
|
2552
|
+
function Cc(e) {
|
|
2449
2553
|
return ["SET_SHARED"].includes(e);
|
|
2450
2554
|
}
|
|
2451
|
-
function
|
|
2555
|
+
function Ec(e) {
|
|
2452
2556
|
return ["GET_MODEL"].includes(e);
|
|
2453
2557
|
}
|
|
2454
|
-
function
|
|
2558
|
+
function Pc(e) {
|
|
2455
2559
|
return ["GET_SHARED"].includes(e);
|
|
2456
2560
|
}
|
|
2457
|
-
function
|
|
2561
|
+
function Dc(e) {
|
|
2458
2562
|
return ["REFS"].includes(e);
|
|
2459
2563
|
}
|
|
2460
|
-
function
|
|
2461
|
-
var o, f, u,
|
|
2462
|
-
const r = (o = t.ssr.definitions) == null ? void 0 : o.model, n = (f = t.ssr.definitions) == null ? void 0 : f.shared,
|
|
2463
|
-
return !!(r && e.includes(r) || n && e.includes(n) ||
|
|
2564
|
+
function jc(e, t) {
|
|
2565
|
+
var o, f, u, l;
|
|
2566
|
+
const r = (o = t.ssr.definitions) == null ? void 0 : o.model, n = (f = t.ssr.definitions) == null ? void 0 : f.shared, i = (u = t.ssr.definitions) == null ? void 0 : u.res, s = (l = t.ssr.definitions) == null ? void 0 : l.err;
|
|
2567
|
+
return !!(r && e.includes(r) || n && e.includes(n) || i && e.includes(i) || s && e.includes(s));
|
|
2464
2568
|
}
|
|
2465
|
-
function
|
|
2466
|
-
var
|
|
2467
|
-
const
|
|
2569
|
+
function N(e, { model: t, shared: r }, n, i) {
|
|
2570
|
+
var a, p, b, g, S;
|
|
2571
|
+
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, l = (S = n.ssr.definitions) == null ? void 0 : S.args;
|
|
2468
2572
|
if (!L(e))
|
|
2469
|
-
return
|
|
2573
|
+
return m(e) ? Lc(
|
|
2470
2574
|
e,
|
|
2471
2575
|
{ model: t, shared: r },
|
|
2472
2576
|
n,
|
|
2473
|
-
|
|
2474
|
-
) : X(e) ?
|
|
2577
|
+
i
|
|
2578
|
+
) : X(e) ? Ic(
|
|
2475
2579
|
e,
|
|
2476
2580
|
{ model: t, shared: r },
|
|
2477
2581
|
n,
|
|
2478
|
-
|
|
2582
|
+
i
|
|
2479
2583
|
) : e;
|
|
2480
|
-
if (
|
|
2481
|
-
const
|
|
2584
|
+
if (s) {
|
|
2585
|
+
const A = z(s), O = new RegExp(`^${A}\\.([\\w\\.\\[\\]]+)$`).exec(
|
|
2482
2586
|
e
|
|
2483
2587
|
);
|
|
2484
|
-
if (
|
|
2485
|
-
return
|
|
2588
|
+
if (O)
|
|
2589
|
+
return T(t, O[1]);
|
|
2486
2590
|
}
|
|
2487
2591
|
if (o) {
|
|
2488
|
-
const
|
|
2592
|
+
const A = z(o), O = new RegExp(`^${A}\\.([\\w\\.\\[\\]]+)$`).exec(
|
|
2489
2593
|
e
|
|
2490
2594
|
);
|
|
2491
|
-
if (
|
|
2492
|
-
return
|
|
2595
|
+
if (O)
|
|
2596
|
+
return T(r, O[1]);
|
|
2493
2597
|
}
|
|
2494
2598
|
if (f) {
|
|
2495
|
-
const
|
|
2599
|
+
const A = z(f), O = new RegExp(`^${A}\\.([\\w\\.\\[\\]]+)$`).exec(
|
|
2496
2600
|
e
|
|
2497
2601
|
);
|
|
2498
|
-
if (
|
|
2499
|
-
return
|
|
2602
|
+
if (O)
|
|
2603
|
+
return T(i == null ? void 0 : i[Ie], O[1]);
|
|
2500
2604
|
}
|
|
2501
2605
|
if (u) {
|
|
2502
|
-
const
|
|
2606
|
+
const A = z(u), O = new RegExp(`^${A}\\.([\\w\\.\\[\\]]+)$`).exec(
|
|
2503
2607
|
e
|
|
2504
2608
|
);
|
|
2505
|
-
if (
|
|
2506
|
-
return
|
|
2609
|
+
if (O)
|
|
2610
|
+
return T(i == null ? void 0 : i[en], O[1]);
|
|
2507
2611
|
}
|
|
2508
|
-
if (
|
|
2509
|
-
const
|
|
2612
|
+
if (l) {
|
|
2613
|
+
const A = z(l), O = new RegExp(`^${A}\\.([\\w\\.\\[\\]]+)$`).exec(
|
|
2510
2614
|
e
|
|
2511
2615
|
);
|
|
2512
|
-
if (
|
|
2513
|
-
return
|
|
2616
|
+
if (O)
|
|
2617
|
+
return T(i == null ? void 0 : i[Ne], O[1]);
|
|
2514
2618
|
}
|
|
2515
2619
|
let c = e;
|
|
2516
|
-
if (
|
|
2517
|
-
const
|
|
2620
|
+
if (s) {
|
|
2621
|
+
const A = z(s);
|
|
2518
2622
|
c = c.replace(
|
|
2519
|
-
new RegExp(`${
|
|
2520
|
-
(
|
|
2521
|
-
const
|
|
2522
|
-
return
|
|
2623
|
+
new RegExp(`${A}\\.([\\w\\.\\[\\]]+)`, "g"),
|
|
2624
|
+
(O, P) => {
|
|
2625
|
+
const x = T(t, P);
|
|
2626
|
+
return x == null ? "" : String(x);
|
|
2523
2627
|
}
|
|
2524
2628
|
);
|
|
2525
2629
|
}
|
|
2526
2630
|
if (o) {
|
|
2527
|
-
const
|
|
2631
|
+
const A = z(o);
|
|
2528
2632
|
c = c.replace(
|
|
2529
|
-
new RegExp(`${
|
|
2530
|
-
(
|
|
2531
|
-
const
|
|
2532
|
-
return
|
|
2633
|
+
new RegExp(`${A}\\.([\\w\\.\\[\\]]+)`, "g"),
|
|
2634
|
+
(O, P) => {
|
|
2635
|
+
const x = T(r, P);
|
|
2636
|
+
return x == null ? "" : String(x);
|
|
2533
2637
|
}
|
|
2534
2638
|
);
|
|
2535
2639
|
}
|
|
2536
2640
|
if (f) {
|
|
2537
|
-
const
|
|
2641
|
+
const A = z(f);
|
|
2538
2642
|
c = c.replace(
|
|
2539
|
-
new RegExp(`${
|
|
2540
|
-
(
|
|
2541
|
-
const
|
|
2542
|
-
return
|
|
2643
|
+
new RegExp(`${A}\\.([\\w\\.\\[\\]]+)`, "g"),
|
|
2644
|
+
(O, P) => {
|
|
2645
|
+
const x = T(i == null ? void 0 : i[Ie], P);
|
|
2646
|
+
return x == null ? "" : String(x);
|
|
2543
2647
|
}
|
|
2544
2648
|
);
|
|
2545
2649
|
}
|
|
2546
|
-
if (
|
|
2547
|
-
const
|
|
2650
|
+
if (l) {
|
|
2651
|
+
const A = z(l);
|
|
2548
2652
|
c = c.replace(
|
|
2549
|
-
new RegExp(`${
|
|
2550
|
-
(
|
|
2551
|
-
const
|
|
2552
|
-
return
|
|
2653
|
+
new RegExp(`${A}\\.([\\w\\.\\[\\]]+)`, "g"),
|
|
2654
|
+
(O, P) => {
|
|
2655
|
+
const x = T(i == null ? void 0 : i[Ne], P);
|
|
2656
|
+
return x == null ? "" : String(x);
|
|
2553
2657
|
}
|
|
2554
2658
|
);
|
|
2555
2659
|
}
|
|
2556
2660
|
return c;
|
|
2557
2661
|
}
|
|
2558
|
-
function
|
|
2662
|
+
function Lc(e, { model: t, shared: r }, n, i) {
|
|
2559
2663
|
return e.map(
|
|
2560
|
-
(
|
|
2664
|
+
(s) => N(s, { model: t, shared: r }, n, i)
|
|
2561
2665
|
);
|
|
2562
2666
|
}
|
|
2563
|
-
function
|
|
2667
|
+
function Ic(e, { model: t, shared: r }, n, i) {
|
|
2564
2668
|
return Object.fromEntries(
|
|
2565
|
-
Object.entries(e).map(([
|
|
2566
|
-
|
|
2567
|
-
|
|
2669
|
+
Object.entries(e).map(([s, o]) => [
|
|
2670
|
+
s,
|
|
2671
|
+
N(o, { model: t, shared: r }, n, i)
|
|
2568
2672
|
])
|
|
2569
2673
|
);
|
|
2570
2674
|
}
|
|
2571
|
-
async function
|
|
2572
|
-
if ((!L(e.left) || !L(e.right)) && !
|
|
2573
|
-
let c,
|
|
2574
|
-
if (L(e.left) || (c = await
|
|
2675
|
+
async function xe(e, t, r, n, i = !1) {
|
|
2676
|
+
if ((!L(e.left) || !L(e.right)) && !i) {
|
|
2677
|
+
let c, a, p = [];
|
|
2678
|
+
if (L(e.left) || (c = await E(
|
|
2575
2679
|
e.left,
|
|
2576
2680
|
t,
|
|
2577
2681
|
r,
|
|
2578
2682
|
n
|
|
2579
2683
|
), e.left = c), !L(e.right))
|
|
2580
|
-
if (
|
|
2581
|
-
const
|
|
2684
|
+
if (m(e.right)) {
|
|
2685
|
+
const b = e.right.map((g) => E(
|
|
2582
2686
|
g,
|
|
2583
2687
|
t,
|
|
2584
2688
|
r,
|
|
2585
2689
|
n
|
|
2586
2690
|
));
|
|
2587
|
-
await Promise.all(
|
|
2691
|
+
await Promise.all(b).then((g) => {
|
|
2588
2692
|
p = g;
|
|
2589
2693
|
}), e.right = p;
|
|
2590
2694
|
} else
|
|
2591
|
-
|
|
2695
|
+
a = await E(
|
|
2592
2696
|
e.right,
|
|
2593
2697
|
t,
|
|
2594
2698
|
r,
|
|
2595
2699
|
n
|
|
2596
|
-
), e.right =
|
|
2597
|
-
return
|
|
2700
|
+
), e.right = a;
|
|
2701
|
+
return xe(e, t, r, n, !0);
|
|
2598
2702
|
}
|
|
2599
|
-
const
|
|
2703
|
+
const s = N(e.left, t, r, n), o = N(
|
|
2600
2704
|
e.right,
|
|
2601
2705
|
t,
|
|
2602
2706
|
r,
|
|
2603
2707
|
n
|
|
2604
|
-
), f =
|
|
2605
|
-
(c) =>
|
|
2606
|
-
) :
|
|
2607
|
-
(c) =>
|
|
2708
|
+
), f = m(e.right) ? e.right.map(
|
|
2709
|
+
(c) => N(c, t, r, n)
|
|
2710
|
+
) : m(e.values) ? e.values.map(
|
|
2711
|
+
(c) => N(c, t, r, n)
|
|
2608
2712
|
) : null;
|
|
2609
2713
|
if (e.op === "eq")
|
|
2610
|
-
return
|
|
2714
|
+
return s === o;
|
|
2611
2715
|
if (e.op === "ne")
|
|
2612
|
-
return
|
|
2716
|
+
return s !== o;
|
|
2613
2717
|
if (e.op === "gt")
|
|
2614
|
-
return
|
|
2718
|
+
return s > o;
|
|
2615
2719
|
if (e.op === "ge" || e.op === "gte")
|
|
2616
|
-
return
|
|
2720
|
+
return s >= o;
|
|
2617
2721
|
if (e.op === "lt")
|
|
2618
|
-
return
|
|
2722
|
+
return s < o;
|
|
2619
2723
|
if (e.op === "le" || e.op === "lte")
|
|
2620
|
-
return
|
|
2724
|
+
return s <= o;
|
|
2621
2725
|
if (e.op === "between")
|
|
2622
|
-
return !f || f.length < 2 ? !1 :
|
|
2726
|
+
return !f || f.length < 2 ? !1 : s >= f[0] && s <= f[1];
|
|
2623
2727
|
if (e.op === "not_between")
|
|
2624
|
-
return !f || f.length < 2 ? !0 :
|
|
2728
|
+
return !f || f.length < 2 ? !0 : s < f[0] || s > f[1];
|
|
2625
2729
|
if (e.op === "in")
|
|
2626
|
-
return !f || f.length === 0 ? !1 : f.includes(
|
|
2730
|
+
return !f || f.length === 0 ? !1 : f.includes(s);
|
|
2627
2731
|
if (e.op === "not_in")
|
|
2628
|
-
return !f || f.length === 0 ? !0 : !f.includes(
|
|
2629
|
-
const u = String(
|
|
2630
|
-
return e.op === "like" ? f && f.length > 0 ? f.some((c) => u.includes(String(c))) : u.includes(
|
|
2732
|
+
return !f || f.length === 0 ? !0 : !f.includes(s);
|
|
2733
|
+
const u = String(s), l = String(o);
|
|
2734
|
+
return e.op === "like" ? f && f.length > 0 ? f.some((c) => u.includes(String(c))) : u.includes(l) : e.op === "not_like" ? f && f.length > 0 ? !f.some((c) => u.includes(String(c))) : !u.includes(l) : e.op === "like_left" ? f && f.length > 0 ? f.some((c) => u.startsWith(String(c))) : u.startsWith(l) : e.op === "not_like_left" ? f && f.length > 0 ? !f.some((c) => u.startsWith(String(c))) : !u.startsWith(l) : e.op === "like_right" ? f && f.length > 0 ? f.some((c) => u.endsWith(String(c))) : u.endsWith(l) : e.op === "not_like_right" ? f && f.length > 0 ? !f.some((c) => u.endsWith(String(c))) : !u.endsWith(l) : !1;
|
|
2631
2735
|
}
|
|
2632
|
-
async function
|
|
2633
|
-
const
|
|
2634
|
-
return await (
|
|
2736
|
+
async function Nc(e, t, r, n, i) {
|
|
2737
|
+
const s = n.ssr.actions[e], o = Hc(t, r, n, i), f = Fc(t, r, n, i);
|
|
2738
|
+
return await (s == null ? void 0 : s({
|
|
2635
2739
|
...t,
|
|
2636
2740
|
params: o,
|
|
2637
2741
|
data: f
|
|
2638
2742
|
}));
|
|
2639
2743
|
}
|
|
2640
|
-
function
|
|
2744
|
+
function Hc(e, t, r, n) {
|
|
2641
2745
|
if (!e.params) return {};
|
|
2642
|
-
const
|
|
2643
|
-
return Object.entries(e.params).forEach(([
|
|
2644
|
-
s
|
|
2746
|
+
const i = {};
|
|
2747
|
+
return Object.entries(e.params).forEach(([s, o]) => {
|
|
2748
|
+
i[s] = N(
|
|
2645
2749
|
o,
|
|
2646
2750
|
t,
|
|
2647
2751
|
r,
|
|
2648
2752
|
n
|
|
2649
2753
|
);
|
|
2650
|
-
}),
|
|
2754
|
+
}), i;
|
|
2651
2755
|
}
|
|
2652
|
-
function
|
|
2756
|
+
function Fc(e, t, r, n) {
|
|
2653
2757
|
if (!e.data) return {};
|
|
2654
|
-
const
|
|
2655
|
-
return Object.entries(e.data).forEach(([
|
|
2656
|
-
s
|
|
2758
|
+
const i = {};
|
|
2759
|
+
return Object.entries(e.data).forEach(([s, o]) => {
|
|
2760
|
+
i[s] = N(
|
|
2657
2761
|
o,
|
|
2658
2762
|
t,
|
|
2659
2763
|
r,
|
|
2660
2764
|
n
|
|
2661
2765
|
);
|
|
2662
|
-
}),
|
|
2766
|
+
}), i;
|
|
2663
2767
|
}
|
|
2664
|
-
function
|
|
2768
|
+
function Kc(e, t) {
|
|
2665
2769
|
switch (t.method) {
|
|
2666
2770
|
case "map":
|
|
2667
|
-
return
|
|
2771
|
+
return m(e) ? e.map((r) => ({
|
|
2668
2772
|
...r,
|
|
2669
|
-
...Object.keys(t.relation).reduce((n,
|
|
2773
|
+
...Object.keys(t.relation).reduce((n, i) => ({
|
|
2670
2774
|
...n,
|
|
2671
|
-
[t.relation[
|
|
2775
|
+
[t.relation[i]]: r[i]
|
|
2672
2776
|
}), {})
|
|
2673
2777
|
})) : e;
|
|
2674
2778
|
default:
|
|
2675
2779
|
return e;
|
|
2676
2780
|
}
|
|
2677
2781
|
}
|
|
2678
|
-
const
|
|
2679
|
-
async function
|
|
2680
|
-
var
|
|
2681
|
-
if (
|
|
2782
|
+
const Ie = Symbol("requestRes"), en = Symbol("requestErr"), Ne = Symbol("eventArgs");
|
|
2783
|
+
async function E(e, t, r, n) {
|
|
2784
|
+
var s, o;
|
|
2785
|
+
if (m(e))
|
|
2682
2786
|
return Promise.all(
|
|
2683
2787
|
e.map(
|
|
2684
|
-
(f) =>
|
|
2788
|
+
(f) => E(f, t, r, n)
|
|
2685
2789
|
)
|
|
2686
2790
|
);
|
|
2687
|
-
if (!((
|
|
2688
|
-
const
|
|
2689
|
-
if (!
|
|
2791
|
+
if (!((s = r.ssr.definitions) != null && s.dispatch)) return;
|
|
2792
|
+
const i = e[(o = r.ssr.definitions) == null ? void 0 : o.dispatch];
|
|
2793
|
+
if (!i)
|
|
2690
2794
|
return e;
|
|
2691
|
-
if (
|
|
2692
|
-
return await
|
|
2693
|
-
let u = e.path ?
|
|
2694
|
-
return "transform" in e && (u =
|
|
2695
|
-
"then" in e &&
|
|
2696
|
-
[
|
|
2697
|
-
parentRes: n == null ? void 0 : n[
|
|
2795
|
+
if (vc(i))
|
|
2796
|
+
return await Nc(i, e, t, r, n).then((f) => {
|
|
2797
|
+
let u = e.path ? T(f, e.path) : f;
|
|
2798
|
+
return "transform" in e && (u = Kc(u, e.transform)), setTimeout(() => {
|
|
2799
|
+
"then" in e && E(e.then, t, r, {
|
|
2800
|
+
[Ie]: {
|
|
2801
|
+
parentRes: n == null ? void 0 : n[Ie],
|
|
2698
2802
|
data: u
|
|
2699
2803
|
}
|
|
2700
2804
|
});
|
|
2701
2805
|
}), u;
|
|
2702
2806
|
}).catch((f) => {
|
|
2703
|
-
"catch" in e &&
|
|
2704
|
-
[
|
|
2807
|
+
"catch" in e && E(e.catch, t, r, {
|
|
2808
|
+
[en]: f
|
|
2705
2809
|
});
|
|
2706
2810
|
});
|
|
2707
|
-
if (
|
|
2708
|
-
if (await
|
|
2709
|
-
const u = e.and.map((c) =>
|
|
2710
|
-
return
|
|
2811
|
+
if (Rc(i)) {
|
|
2812
|
+
if (await cr(), m(e.and)) {
|
|
2813
|
+
const u = e.and.map((c) => xe(c, t, r, n)), l = (await Promise.all(u)).every(Boolean);
|
|
2814
|
+
return l && "then" in e ? E(e.then, t, r, n) : !l && "else" in e ? E(e.else, t, r, n) : l;
|
|
2711
2815
|
}
|
|
2712
|
-
if (
|
|
2713
|
-
const u = e.or.map((c) =>
|
|
2714
|
-
return
|
|
2816
|
+
if (m(e.or)) {
|
|
2817
|
+
const u = e.or.map((c) => xe(c, t, r, n)), l = (await Promise.all(u)).some(Boolean);
|
|
2818
|
+
return l && "then" in e ? E(e.then, t, r, n) : !l && "else" in e ? E(e.else, t, r, n) : l;
|
|
2715
2819
|
}
|
|
2716
|
-
const f = await
|
|
2820
|
+
const f = await xe(
|
|
2717
2821
|
e,
|
|
2718
2822
|
t,
|
|
2719
2823
|
r,
|
|
@@ -2722,105 +2826,105 @@ async function x(e, t, r, n) {
|
|
|
2722
2826
|
if (!("then" in e || "else" in e))
|
|
2723
2827
|
return f;
|
|
2724
2828
|
if (f && "then" in e)
|
|
2725
|
-
return
|
|
2829
|
+
return E(e.then, t, r, n);
|
|
2726
2830
|
if (!f && "else" in e)
|
|
2727
|
-
return
|
|
2831
|
+
return E(e.else, t, r, n);
|
|
2728
2832
|
}
|
|
2729
|
-
if (
|
|
2730
|
-
return
|
|
2731
|
-
e.pipes.forEach((
|
|
2732
|
-
|
|
2833
|
+
if (Mc(i))
|
|
2834
|
+
return qc((f, ...u) => {
|
|
2835
|
+
e.pipes.forEach((l) => {
|
|
2836
|
+
E(l, f, r, {
|
|
2733
2837
|
...n,
|
|
2734
|
-
[
|
|
2735
|
-
parentArgs: n == null ? void 0 : n[
|
|
2838
|
+
[Ne]: {
|
|
2839
|
+
parentArgs: n == null ? void 0 : n[Ne],
|
|
2736
2840
|
...u
|
|
2737
2841
|
}
|
|
2738
2842
|
});
|
|
2739
2843
|
});
|
|
2740
2844
|
});
|
|
2741
|
-
if (
|
|
2845
|
+
if (xc(i)) {
|
|
2742
2846
|
if (L(e.as)) {
|
|
2743
|
-
const u =
|
|
2847
|
+
const u = V(
|
|
2744
2848
|
r._model.model.value,
|
|
2745
2849
|
e.field,
|
|
2746
|
-
|
|
2850
|
+
N(e.as, t, r, n)
|
|
2747
2851
|
);
|
|
2748
|
-
return "then" in e ?
|
|
2852
|
+
return "then" in e ? E(e.then, t, r, n) : u;
|
|
2749
2853
|
}
|
|
2750
|
-
const f =
|
|
2854
|
+
const f = V(
|
|
2751
2855
|
r._model.model.value,
|
|
2752
2856
|
e.field,
|
|
2753
|
-
await
|
|
2857
|
+
await E(e.as, t, r, n)
|
|
2754
2858
|
);
|
|
2755
|
-
return "then" in e ?
|
|
2859
|
+
return "then" in e ? E(e.then, t, r, n) : f;
|
|
2756
2860
|
}
|
|
2757
|
-
if (
|
|
2861
|
+
if (Cc(i)) {
|
|
2758
2862
|
if (L(e.as)) {
|
|
2759
|
-
const u =
|
|
2863
|
+
const u = V(
|
|
2760
2864
|
r.shared,
|
|
2761
2865
|
e.field,
|
|
2762
|
-
|
|
2866
|
+
N(e.as, t, r, n)
|
|
2763
2867
|
);
|
|
2764
|
-
return "then" in e ?
|
|
2868
|
+
return "then" in e ? E(e.then, t, r, n) : u;
|
|
2765
2869
|
}
|
|
2766
|
-
const f =
|
|
2870
|
+
const f = V(
|
|
2767
2871
|
r.shared,
|
|
2768
2872
|
e.field,
|
|
2769
|
-
await
|
|
2873
|
+
await E(e.as, t, r, n)
|
|
2770
2874
|
);
|
|
2771
|
-
return "then" in e ?
|
|
2875
|
+
return "then" in e ? E(e.then, t, r, n) : f;
|
|
2772
2876
|
}
|
|
2773
|
-
if (
|
|
2774
|
-
return
|
|
2775
|
-
if (
|
|
2776
|
-
return
|
|
2777
|
-
if (
|
|
2877
|
+
if (Pc(i))
|
|
2878
|
+
return T(t.shared, e.field);
|
|
2879
|
+
if (Ec(i))
|
|
2880
|
+
return T(r._model.model.value, e.field);
|
|
2881
|
+
if (Dc(i)) {
|
|
2778
2882
|
const f = t.refs.get(e.field);
|
|
2779
2883
|
if (!f) return;
|
|
2780
2884
|
if (e.get)
|
|
2781
2885
|
return f.value[e.get];
|
|
2782
2886
|
e.call && f.value[e.call](
|
|
2783
|
-
|
|
2887
|
+
N(e.args, t, r, n)
|
|
2784
2888
|
);
|
|
2785
2889
|
return;
|
|
2786
2890
|
}
|
|
2787
|
-
if (r.ssr.actions[
|
|
2891
|
+
if (r.ssr.actions[i]) {
|
|
2788
2892
|
const f = {};
|
|
2789
2893
|
for (const u of Object.keys(e)) {
|
|
2790
|
-
const
|
|
2894
|
+
const l = await E(
|
|
2791
2895
|
e[u],
|
|
2792
2896
|
t,
|
|
2793
2897
|
r,
|
|
2794
2898
|
n
|
|
2795
2899
|
);
|
|
2796
|
-
f[u] =
|
|
2900
|
+
f[u] = l;
|
|
2797
2901
|
}
|
|
2798
|
-
return r.ssr.actions[
|
|
2902
|
+
return r.ssr.actions[i](f, n);
|
|
2799
2903
|
}
|
|
2800
|
-
return
|
|
2904
|
+
return N(e, t, r, n);
|
|
2801
2905
|
}
|
|
2802
|
-
function
|
|
2803
|
-
return (r) =>
|
|
2906
|
+
function Uc(e, t) {
|
|
2907
|
+
return (r) => E(e, r, t);
|
|
2804
2908
|
}
|
|
2805
|
-
class
|
|
2909
|
+
class Bc {
|
|
2806
2910
|
constructor(t) {
|
|
2807
|
-
|
|
2808
|
-
|
|
2809
|
-
|
|
2810
|
-
|
|
2911
|
+
w(this, "rawSchemas");
|
|
2912
|
+
w(this, "parsedSchemas", ie([]));
|
|
2913
|
+
w(this, "refs", /* @__PURE__ */ new Map());
|
|
2914
|
+
w(this, "usageTracker", /* @__PURE__ */ new Map());
|
|
2811
2915
|
this.runtime = t, this.processSchemas();
|
|
2812
2916
|
}
|
|
2813
2917
|
processSSR(t) {
|
|
2814
2918
|
if (this.runtime.isSsr) {
|
|
2815
2919
|
const r = /* @__PURE__ */ new WeakSet();
|
|
2816
|
-
|
|
2817
|
-
var
|
|
2920
|
+
$c(t, (n, i) => {
|
|
2921
|
+
var s, o;
|
|
2818
2922
|
if (typeof n == "object" && n !== null) {
|
|
2819
2923
|
if (r.has(n))
|
|
2820
2924
|
return n;
|
|
2821
2925
|
r.add(n);
|
|
2822
2926
|
}
|
|
2823
|
-
return (
|
|
2927
|
+
return (s = this.runtime.ssr.definitions) != null && s.dispatch && n[(o = this.runtime.ssr.definitions) == null ? void 0 : o.dispatch] ? Uc(n, this.runtime) : i.key === "component" ? Oc(n, this.runtime) : L(n) && jc(n, this.runtime) ? (f) => N(n, f, this.runtime) : n;
|
|
2824
2928
|
});
|
|
2825
2929
|
}
|
|
2826
2930
|
return t;
|
|
@@ -2828,10 +2932,10 @@ class jc {
|
|
|
2828
2932
|
processSchemas() {
|
|
2829
2933
|
if (I(this.runtime._options.schemas)) {
|
|
2830
2934
|
const t = this.runtime._options.schemas();
|
|
2831
|
-
|
|
2935
|
+
tt(t) ? t.then((r) => {
|
|
2832
2936
|
this.rawSchemas = F(r), this.traverseSchemas(this.processSSR(F(r)));
|
|
2833
2937
|
}) : this.traverseSchemas(this.processSSR(F(t)));
|
|
2834
|
-
} else
|
|
2938
|
+
} else tt(this.runtime._options.schemas) ? this.runtime._options.schemas.then(
|
|
2835
2939
|
(t) => {
|
|
2836
2940
|
this.rawSchemas = F(t), this.traverseSchemas(this.processSSR(F(t)));
|
|
2837
2941
|
}
|
|
@@ -2841,22 +2945,22 @@ class jc {
|
|
|
2841
2945
|
}
|
|
2842
2946
|
// I hope this function can only be called once
|
|
2843
2947
|
traverseSchemas(t) {
|
|
2844
|
-
|
|
2845
|
-
const
|
|
2846
|
-
return
|
|
2847
|
-
path:
|
|
2848
|
-
setter: (f, u,
|
|
2849
|
-
!
|
|
2948
|
+
Vr(t, (r, n, i) => {
|
|
2949
|
+
const s = i ? `${ne(i)}.children.${ne(n)}` : ne(n), o = T(t, s);
|
|
2950
|
+
return et(o.type) && (o.type = "item"), this.parseSchema(o, {
|
|
2951
|
+
path: s,
|
|
2952
|
+
setter: (f, u, l = !1) => {
|
|
2953
|
+
!l && this.runtime._model.processRelation(u, f), u.propertyKey === "field" && et(o.defaultValue) && (o.defaultValue = void 0, this.runtime._model.processRelation(
|
|
2850
2954
|
{
|
|
2851
2955
|
...u,
|
|
2852
2956
|
propertyKey: "defaultValue"
|
|
2853
2957
|
},
|
|
2854
2958
|
void 0
|
|
2855
|
-
)),
|
|
2959
|
+
)), V(
|
|
2856
2960
|
this.parsedSchemas.value,
|
|
2857
2961
|
`${u.path}.${u.propertyKey}`,
|
|
2858
2962
|
f
|
|
2859
|
-
), !
|
|
2963
|
+
), !l && u.path.includes("componentProps") && f !== void 0 && this.triggerLookupForSource(u.propertyKey, o.field);
|
|
2860
2964
|
}
|
|
2861
2965
|
}), !0;
|
|
2862
2966
|
});
|
|
@@ -2868,8 +2972,8 @@ class jc {
|
|
|
2868
2972
|
*/
|
|
2869
2973
|
parseSchema(t, r) {
|
|
2870
2974
|
Object.keys(t).forEach((n) => {
|
|
2871
|
-
const
|
|
2872
|
-
this.parseProperty(n,
|
|
2975
|
+
const i = t[n];
|
|
2976
|
+
this.parseProperty(n, i, {
|
|
2873
2977
|
...r
|
|
2874
2978
|
});
|
|
2875
2979
|
});
|
|
@@ -2888,10 +2992,10 @@ class jc {
|
|
|
2888
2992
|
* 2、调用 metadata 里的 setter,并且将处理完成的值和 metadata 传入
|
|
2889
2993
|
*/
|
|
2890
2994
|
parseProperty(t, r, n) {
|
|
2891
|
-
|
|
2995
|
+
Tt(n, {
|
|
2892
2996
|
propertyKey: t,
|
|
2893
|
-
processedSetter(
|
|
2894
|
-
n.setter(
|
|
2997
|
+
processedSetter(i, s = !1) {
|
|
2998
|
+
n.setter(i, n, s);
|
|
2895
2999
|
}
|
|
2896
3000
|
}), this.processing(r, n);
|
|
2897
3001
|
}
|
|
@@ -2907,10 +3011,10 @@ class jc {
|
|
|
2907
3011
|
* processNonFunction 函数进行处理
|
|
2908
3012
|
*/
|
|
2909
3013
|
processing(t, r) {
|
|
2910
|
-
var n,
|
|
2911
|
-
if (
|
|
3014
|
+
var n, i;
|
|
3015
|
+
if (zc(t)) {
|
|
2912
3016
|
if (I(t)) {
|
|
2913
|
-
const
|
|
3017
|
+
const s = {
|
|
2914
3018
|
model: this.runtime._model.model.value,
|
|
2915
3019
|
share: this.runtime.share.bind(this.runtime),
|
|
2916
3020
|
shared: this.runtime.shared,
|
|
@@ -2918,13 +3022,13 @@ class jc {
|
|
|
2918
3022
|
};
|
|
2919
3023
|
return (n = r.processedSetter) == null ? void 0 : n.call(
|
|
2920
3024
|
r,
|
|
2921
|
-
(...o) => t(
|
|
3025
|
+
(...o) => t(s, ...o)
|
|
2922
3026
|
);
|
|
2923
3027
|
}
|
|
2924
|
-
return (
|
|
3028
|
+
return (i = r.processedSetter) == null ? void 0 : i.call(r, t);
|
|
2925
3029
|
}
|
|
2926
3030
|
if (I(t)) {
|
|
2927
|
-
const
|
|
3031
|
+
const s = `${r.path}.${r.propertyKey}`, o = Ac(
|
|
2928
3032
|
{
|
|
2929
3033
|
model: this.runtime._model.model.value,
|
|
2930
3034
|
share: this.runtime.share.bind(this.runtime),
|
|
@@ -2932,13 +3036,13 @@ class jc {
|
|
|
2932
3036
|
refs: this.refs
|
|
2933
3037
|
},
|
|
2934
3038
|
(u) => {
|
|
2935
|
-
u.startsWith("model.") && (
|
|
2936
|
-
effectKey:
|
|
3039
|
+
u.startsWith("model.") && (ur(t) || this.runtime._update.track(s, {
|
|
3040
|
+
effectKey: s,
|
|
2937
3041
|
trackedEffect: f,
|
|
2938
3042
|
trackingType: "model",
|
|
2939
3043
|
trackingPath: u.replace(/^model\./, "")
|
|
2940
|
-
})), u.startsWith("shared.") && (
|
|
2941
|
-
effectKey:
|
|
3044
|
+
})), u.startsWith("shared.") && (ur(t) || this.runtime._update.track(s, {
|
|
3045
|
+
effectKey: s,
|
|
2942
3046
|
trackedEffect: f,
|
|
2943
3047
|
trackingType: "share",
|
|
2944
3048
|
trackingPath: u.replace(/^shared\./, "")
|
|
@@ -2946,9 +3050,9 @@ class jc {
|
|
|
2946
3050
|
}
|
|
2947
3051
|
), f = () => {
|
|
2948
3052
|
const u = t(o);
|
|
2949
|
-
if (
|
|
2950
|
-
this.processingNonFunction(void 0, F(r), !0), u.then((
|
|
2951
|
-
this.processingNonFunction(
|
|
3053
|
+
if (tt(u)) {
|
|
3054
|
+
this.processingNonFunction(void 0, F(r), !0), u.then((l) => {
|
|
3055
|
+
this.processingNonFunction(l, F(r));
|
|
2952
3056
|
});
|
|
2953
3057
|
return;
|
|
2954
3058
|
}
|
|
@@ -2961,9 +3065,9 @@ class jc {
|
|
|
2961
3065
|
// 处理非函数性数据
|
|
2962
3066
|
// 通过 jumpConsume 跳过消费,用于在一些中间状态提供立即的数据支持
|
|
2963
3067
|
processingNonFunction(t, r, n = !1) {
|
|
2964
|
-
var
|
|
2965
|
-
if (
|
|
2966
|
-
return (
|
|
3068
|
+
var i, s, o;
|
|
3069
|
+
if (Vu(r.propertyKey, t))
|
|
3070
|
+
return (i = r.processedSetter) == null ? void 0 : i.call(r, t);
|
|
2967
3071
|
if (X(t)) {
|
|
2968
3072
|
let f = r.propertyKey;
|
|
2969
3073
|
r.path = `${r.path}.${ne(f)}`, this.parseSchema(t, r);
|
|
@@ -2972,17 +3076,17 @@ class jc {
|
|
|
2972
3076
|
this.processing(t, r);
|
|
2973
3077
|
return;
|
|
2974
3078
|
}
|
|
2975
|
-
if (
|
|
2976
|
-
const f =
|
|
2977
|
-
(
|
|
2978
|
-
const u = (c) => !(
|
|
3079
|
+
if (Ye(t) || on(t)) {
|
|
3080
|
+
const f = Ye(t) ? t.value : t;
|
|
3081
|
+
(s = r.processedSetter) == null || s.call(r, f, n);
|
|
3082
|
+
const u = (c) => !(et(c) || c === null || m(c) && De(c) || X(c) && De(c));
|
|
2979
3083
|
if (u(f))
|
|
2980
3084
|
return;
|
|
2981
|
-
const
|
|
2982
|
-
() =>
|
|
3085
|
+
const l = lr(
|
|
3086
|
+
() => Ye(t) ? t.value : t,
|
|
2983
3087
|
(c) => {
|
|
2984
|
-
var
|
|
2985
|
-
(
|
|
3088
|
+
var a;
|
|
3089
|
+
(a = r.processedSetter) == null || a.call(r, c), u(c) && l();
|
|
2986
3090
|
},
|
|
2987
3091
|
{ deep: !0 }
|
|
2988
3092
|
);
|
|
@@ -2993,18 +3097,18 @@ class jc {
|
|
|
2993
3097
|
// 当 componentProps 下的属性(如 options)更新时,触发对应字段的 lookup 计算
|
|
2994
3098
|
triggerLookupForSource(t, r) {
|
|
2995
3099
|
if (!(!t || !r)) {
|
|
2996
|
-
for (const [n,
|
|
2997
|
-
if (
|
|
2998
|
-
const
|
|
2999
|
-
|
|
3100
|
+
for (const [n, i] of this.runtime.lookups.value.entries())
|
|
3101
|
+
if (i.sourceKey === t && n === r) {
|
|
3102
|
+
const s = T(this.runtime._model.model.value, n);
|
|
3103
|
+
s !== void 0 && lt(n, s, this.runtime);
|
|
3000
3104
|
break;
|
|
3001
3105
|
}
|
|
3002
3106
|
}
|
|
3003
3107
|
}
|
|
3004
3108
|
}
|
|
3005
|
-
class
|
|
3109
|
+
class Vc {
|
|
3006
3110
|
constructor(t) {
|
|
3007
|
-
|
|
3111
|
+
w(this, "effects", /* @__PURE__ */ new Map());
|
|
3008
3112
|
this.runtime = t;
|
|
3009
3113
|
}
|
|
3010
3114
|
track(t, r) {
|
|
@@ -3015,62 +3119,62 @@ class Lc {
|
|
|
3015
3119
|
// TODO 优化数据结构,提升更新效能
|
|
3016
3120
|
trigger(t = "model", r) {
|
|
3017
3121
|
for (const n of this.effects.values())
|
|
3018
|
-
for (const
|
|
3019
|
-
if (
|
|
3020
|
-
|
|
3122
|
+
for (const i of n.values()) {
|
|
3123
|
+
if (i.trackingType !== t) break;
|
|
3124
|
+
i.trackingPath.includes(r) && i.trackedEffect(t);
|
|
3021
3125
|
}
|
|
3022
3126
|
}
|
|
3023
3127
|
reset() {
|
|
3024
3128
|
this.effects.clear();
|
|
3025
3129
|
}
|
|
3026
3130
|
}
|
|
3027
|
-
function
|
|
3131
|
+
function kc(e, t) {
|
|
3028
3132
|
const r = (n) => {
|
|
3029
3133
|
if (Array.isArray(n))
|
|
3030
|
-
return n.map((
|
|
3134
|
+
return n.map((i) => r(i));
|
|
3031
3135
|
if (X(n)) {
|
|
3032
|
-
const
|
|
3033
|
-
for (const
|
|
3034
|
-
const o = t[
|
|
3035
|
-
|
|
3136
|
+
const i = {};
|
|
3137
|
+
for (const s of Object.keys(n)) {
|
|
3138
|
+
const o = t[s] ?? s;
|
|
3139
|
+
i[o] = r(n[s]);
|
|
3036
3140
|
}
|
|
3037
|
-
return
|
|
3141
|
+
return i;
|
|
3038
3142
|
}
|
|
3039
3143
|
return n;
|
|
3040
3144
|
};
|
|
3041
3145
|
return r(e);
|
|
3042
3146
|
}
|
|
3043
|
-
function
|
|
3044
|
-
const r =
|
|
3045
|
-
if (Array.isArray(
|
|
3046
|
-
return
|
|
3047
|
-
if (X(
|
|
3048
|
-
const
|
|
3049
|
-
for (const o of Object.keys(
|
|
3147
|
+
function Gc(e, t) {
|
|
3148
|
+
const r = Tu(t), n = (i) => {
|
|
3149
|
+
if (Array.isArray(i))
|
|
3150
|
+
return i.map((s) => n(s));
|
|
3151
|
+
if (X(i)) {
|
|
3152
|
+
const s = {};
|
|
3153
|
+
for (const o of Object.keys(i)) {
|
|
3050
3154
|
const f = r[o] ?? o;
|
|
3051
|
-
|
|
3155
|
+
s[f] = n(i[o]);
|
|
3052
3156
|
}
|
|
3053
|
-
return
|
|
3157
|
+
return s;
|
|
3054
3158
|
}
|
|
3055
|
-
return
|
|
3159
|
+
return i;
|
|
3056
3160
|
};
|
|
3057
3161
|
return n(e);
|
|
3058
3162
|
}
|
|
3059
|
-
class
|
|
3163
|
+
class Wc {
|
|
3060
3164
|
constructor(t) {
|
|
3061
|
-
|
|
3062
|
-
|
|
3063
|
-
|
|
3064
|
-
|
|
3065
|
-
|
|
3066
|
-
|
|
3067
|
-
|
|
3068
|
-
|
|
3165
|
+
w(this, "_schema");
|
|
3166
|
+
w(this, "_model");
|
|
3167
|
+
w(this, "_render");
|
|
3168
|
+
w(this, "_update");
|
|
3169
|
+
w(this, "_options");
|
|
3170
|
+
w(this, "_context");
|
|
3171
|
+
w(this, "_adapter");
|
|
3172
|
+
w(this, "shared", qe({}, (t) => {
|
|
3069
3173
|
this._update.trigger("share", t);
|
|
3070
3174
|
}));
|
|
3071
|
-
|
|
3072
|
-
|
|
3073
|
-
|
|
3175
|
+
w(this, "isSsr", !1);
|
|
3176
|
+
w(this, "ssr", {});
|
|
3177
|
+
w(this, "defaultSSRDefinitions", {
|
|
3074
3178
|
dispatch: "$dispatch",
|
|
3075
3179
|
model: "$model",
|
|
3076
3180
|
shared: "$shared",
|
|
@@ -3078,12 +3182,12 @@ class Nc {
|
|
|
3078
3182
|
err: "$err",
|
|
3079
3183
|
args: "$args"
|
|
3080
3184
|
});
|
|
3081
|
-
|
|
3082
|
-
|
|
3083
|
-
this._options = t, this.processSSR(t), this._context =
|
|
3185
|
+
w(this, "lookups", ie(/* @__PURE__ */ new Map()));
|
|
3186
|
+
w(this, "lookupResults", ie(/* @__PURE__ */ new Map()));
|
|
3187
|
+
this._options = t, this.processSSR(t), this._context = U, this._model = new ac(this), this._render = new Tc(this), this._update = new Vc(this), this._schema = new Bc(this), this._adapter = new Hu(this);
|
|
3084
3188
|
}
|
|
3085
3189
|
getLookupResults(t) {
|
|
3086
|
-
return t === void 0 ?
|
|
3190
|
+
return t === void 0 ? vt(() => Array.from(this.lookupResults.value.values())) : vt(() => this.lookupResults.value.get(t));
|
|
3087
3191
|
}
|
|
3088
3192
|
processSSR(t) {
|
|
3089
3193
|
t.ssr ? (this.isSsr = !0, this.ssr = t.ssr, this.ssr.definitions = {
|
|
@@ -3095,20 +3199,32 @@ class Nc {
|
|
|
3095
3199
|
return this._render.render();
|
|
3096
3200
|
}
|
|
3097
3201
|
submit() {
|
|
3098
|
-
return this._adapter.adaptee.validate().then(() =>
|
|
3099
|
-
this.
|
|
3100
|
-
|
|
3101
|
-
|
|
3202
|
+
return this._adapter.adaptee.validate().then(() => {
|
|
3203
|
+
const t = this._options.namesToRemember ? kc(
|
|
3204
|
+
this._model.model.value,
|
|
3205
|
+
this._options.namesToRemember
|
|
3206
|
+
) : this._model.model.value;
|
|
3207
|
+
if (this._options.includeLabel) {
|
|
3208
|
+
const r = Gr(this._schema.rawSchemas ?? []), n = Wu(
|
|
3209
|
+
this._schema.parsedSchemas.value,
|
|
3210
|
+
this._model.model.value,
|
|
3211
|
+
this._adapter.adaptee,
|
|
3212
|
+
r
|
|
3213
|
+
);
|
|
3214
|
+
return { ...t, displayLabels: n };
|
|
3215
|
+
}
|
|
3216
|
+
return t;
|
|
3217
|
+
});
|
|
3102
3218
|
}
|
|
3103
3219
|
share(t) {
|
|
3104
3220
|
Object.assign(this.shared, t);
|
|
3105
3221
|
}
|
|
3106
3222
|
isReady(t) {
|
|
3107
|
-
const r =
|
|
3223
|
+
const r = lr(
|
|
3108
3224
|
() => this._model.allConsumed.value,
|
|
3109
3225
|
(n) => {
|
|
3110
3226
|
n && setTimeout(() => {
|
|
3111
|
-
t(),
|
|
3227
|
+
t(), cr(() => {
|
|
3112
3228
|
r();
|
|
3113
3229
|
});
|
|
3114
3230
|
}, 0);
|
|
@@ -3122,18 +3238,18 @@ class Nc {
|
|
|
3122
3238
|
hydrate(t) {
|
|
3123
3239
|
return new Promise((r) => {
|
|
3124
3240
|
this.isReady(() => {
|
|
3125
|
-
const n = this._options.namesToRemember ?
|
|
3241
|
+
const n = this._options.namesToRemember ? Gc(
|
|
3126
3242
|
t,
|
|
3127
3243
|
this._options.namesToRemember
|
|
3128
3244
|
) : t;
|
|
3129
|
-
Object.keys(n).forEach((
|
|
3130
|
-
this._model.model.value[
|
|
3245
|
+
Object.keys(n).forEach((i) => {
|
|
3246
|
+
this._model.model.value[i] = n[i];
|
|
3131
3247
|
}), r(this._model.model.value);
|
|
3132
3248
|
});
|
|
3133
3249
|
});
|
|
3134
3250
|
}
|
|
3135
3251
|
deleteField(t) {
|
|
3136
|
-
this.lookupResults.value.delete(t),
|
|
3252
|
+
this.lookupResults.value.delete(t), V(this._model.model.value, t, void 0);
|
|
3137
3253
|
}
|
|
3138
3254
|
getFormRef() {
|
|
3139
3255
|
return this._render.formRef;
|
|
@@ -3142,15 +3258,15 @@ class Nc {
|
|
|
3142
3258
|
* 使用新的 schema 重新渲染整个表单
|
|
3143
3259
|
*/
|
|
3144
3260
|
updateForm(t) {
|
|
3145
|
-
this._options = t, this._model.pauseOnChange = !0, this._update.reset(), this._model.relationMap.clear(), this._model.allConsumed.value = !1, this._model.immutableModel = {}, Object.keys(this._model.model.value).forEach((r) => {
|
|
3261
|
+
this._options = { ...this._options, ...t }, this._model.pauseOnChange = !0, this._update.reset(), this._model.relationMap.clear(), this._model.allConsumed.value = !1, this._model.immutableModel = {}, Object.keys(this._model.model.value).forEach((r) => {
|
|
3146
3262
|
delete this._model.model.value[r];
|
|
3147
3263
|
}), this.lookups.value.clear(), this.lookupResults.value.clear(), Object.keys(this.shared).forEach((r) => {
|
|
3148
3264
|
delete this.shared[r];
|
|
3149
3265
|
}), this._options.schemas = t.schemas, this._schema.parsedSchemas.value = [], this._schema.refs.clear(), this._schema.usageTracker.clear(), this._schema.rawSchemas = void 0, this._model.pauseOnChange = !1, this._schema.processSchemas();
|
|
3150
3266
|
}
|
|
3151
3267
|
}
|
|
3152
|
-
function
|
|
3153
|
-
const t = new
|
|
3268
|
+
function el(e) {
|
|
3269
|
+
const t = new Wc(e);
|
|
3154
3270
|
return [
|
|
3155
3271
|
t.render(),
|
|
3156
3272
|
{
|
|
@@ -3168,32 +3284,32 @@ function Wc(e) {
|
|
|
3168
3284
|
}
|
|
3169
3285
|
];
|
|
3170
3286
|
}
|
|
3171
|
-
function
|
|
3172
|
-
return
|
|
3287
|
+
function qc(e) {
|
|
3288
|
+
return C(e) ? Tt(e, {
|
|
3173
3289
|
__okyiww_form_raw__: !0
|
|
3174
3290
|
}) : e;
|
|
3175
3291
|
}
|
|
3176
|
-
function
|
|
3292
|
+
function zc(e) {
|
|
3177
3293
|
return (e == null ? void 0 : e.__okyiww_form_raw__) === !0;
|
|
3178
3294
|
}
|
|
3179
|
-
function
|
|
3180
|
-
return
|
|
3295
|
+
function tl(e) {
|
|
3296
|
+
return C(e) ? Tt(e, {
|
|
3181
3297
|
__okyiww_form_once__: !0
|
|
3182
3298
|
}) : e;
|
|
3183
3299
|
}
|
|
3184
|
-
function
|
|
3300
|
+
function ur(e) {
|
|
3185
3301
|
return (e == null ? void 0 : e.__okyiww_form_once__) === !0;
|
|
3186
3302
|
}
|
|
3187
|
-
const
|
|
3303
|
+
const rl = "0.0.23";
|
|
3188
3304
|
export {
|
|
3189
|
-
|
|
3190
|
-
|
|
3191
|
-
|
|
3192
|
-
|
|
3193
|
-
|
|
3194
|
-
|
|
3195
|
-
|
|
3196
|
-
|
|
3197
|
-
|
|
3198
|
-
|
|
3305
|
+
U as FormContext,
|
|
3306
|
+
Jc as defineFormSchema,
|
|
3307
|
+
Zc as defineFormSetup,
|
|
3308
|
+
Qc as initForm,
|
|
3309
|
+
ur as isOnce,
|
|
3310
|
+
zc as isRaw,
|
|
3311
|
+
tl as once,
|
|
3312
|
+
qc as raw,
|
|
3313
|
+
el as useForm,
|
|
3314
|
+
rl as version
|
|
3199
3315
|
};
|