use-abcd 0.1.2 → 0.2.1
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/README.md +46 -30
- package/dist/useCrud.d.ts +90 -59
- package/dist/useCrud.js +1190 -1164
- package/package.json +13 -13
package/dist/useCrud.js
CHANGED
|
@@ -1,72 +1,72 @@
|
|
|
1
|
-
import { useRef as
|
|
2
|
-
var
|
|
3
|
-
function
|
|
4
|
-
var t =
|
|
1
|
+
import { useRef as pn, useMemo as K, useSyncExternalStore as dn, useCallback as C, useEffect as hn } from "react";
|
|
2
|
+
var Rt = typeof global == "object" && global && global.Object === Object && global, yn = typeof self == "object" && self && self.Object === Object && self, F = Rt || yn || Function("return this")(), G = F.Symbol, $t = Object.prototype, bn = $t.hasOwnProperty, gn = $t.toString, te = G ? G.toStringTag : void 0;
|
|
3
|
+
function mn(e) {
|
|
4
|
+
var t = bn.call(e, te), n = e[te];
|
|
5
5
|
try {
|
|
6
|
-
e[
|
|
7
|
-
var
|
|
6
|
+
e[te] = void 0;
|
|
7
|
+
var r = !0;
|
|
8
8
|
} catch {
|
|
9
9
|
}
|
|
10
|
-
var i =
|
|
11
|
-
return
|
|
10
|
+
var i = gn.call(e);
|
|
11
|
+
return r && (t ? e[te] = n : delete e[te]), i;
|
|
12
12
|
}
|
|
13
|
-
var
|
|
14
|
-
function
|
|
15
|
-
return
|
|
13
|
+
var vn = Object.prototype, wn = vn.toString;
|
|
14
|
+
function _n(e) {
|
|
15
|
+
return wn.call(e);
|
|
16
16
|
}
|
|
17
|
-
var
|
|
18
|
-
function
|
|
19
|
-
return e == null ? e === void 0 ?
|
|
17
|
+
var On = "[object Null]", Sn = "[object Undefined]", nt = G ? G.toStringTag : void 0;
|
|
18
|
+
function J(e) {
|
|
19
|
+
return e == null ? e === void 0 ? Sn : On : nt && nt in Object(e) ? mn(e) : _n(e);
|
|
20
20
|
}
|
|
21
|
-
function
|
|
21
|
+
function V(e) {
|
|
22
22
|
return e != null && typeof e == "object";
|
|
23
23
|
}
|
|
24
|
-
var
|
|
25
|
-
function
|
|
26
|
-
return typeof e == "symbol" ||
|
|
24
|
+
var An = "[object Symbol]";
|
|
25
|
+
function Ue(e) {
|
|
26
|
+
return typeof e == "symbol" || V(e) && J(e) == An;
|
|
27
27
|
}
|
|
28
|
-
function
|
|
29
|
-
for (var
|
|
30
|
-
i[
|
|
28
|
+
function jt(e, t) {
|
|
29
|
+
for (var n = -1, r = e == null ? 0 : e.length, i = Array(r); ++n < r; )
|
|
30
|
+
i[n] = t(e[n], n, e);
|
|
31
31
|
return i;
|
|
32
32
|
}
|
|
33
|
-
var
|
|
34
|
-
function
|
|
33
|
+
var T = Array.isArray, rt = G ? G.prototype : void 0, it = rt ? rt.toString : void 0;
|
|
34
|
+
function It(e) {
|
|
35
35
|
if (typeof e == "string")
|
|
36
36
|
return e;
|
|
37
|
-
if (
|
|
38
|
-
return
|
|
39
|
-
if (
|
|
40
|
-
return
|
|
37
|
+
if (T(e))
|
|
38
|
+
return jt(e, It) + "";
|
|
39
|
+
if (Ue(e))
|
|
40
|
+
return it ? it.call(e) : "";
|
|
41
41
|
var t = e + "";
|
|
42
42
|
return t == "0" && 1 / e == -1 / 0 ? "-0" : t;
|
|
43
43
|
}
|
|
44
|
-
function
|
|
44
|
+
function ae(e) {
|
|
45
45
|
var t = typeof e;
|
|
46
46
|
return e != null && (t == "object" || t == "function");
|
|
47
47
|
}
|
|
48
|
-
function
|
|
48
|
+
function Ke(e) {
|
|
49
49
|
return e;
|
|
50
50
|
}
|
|
51
|
-
var
|
|
52
|
-
function
|
|
53
|
-
if (!
|
|
51
|
+
var En = "[object AsyncFunction]", Mn = "[object Function]", Tn = "[object GeneratorFunction]", Pn = "[object Proxy]";
|
|
52
|
+
function zt(e) {
|
|
53
|
+
if (!ae(e))
|
|
54
54
|
return !1;
|
|
55
|
-
var t =
|
|
56
|
-
return t ==
|
|
55
|
+
var t = J(e);
|
|
56
|
+
return t == Mn || t == Tn || t == En || t == Pn;
|
|
57
57
|
}
|
|
58
|
-
var
|
|
59
|
-
var e = /[^.]+$/.exec(
|
|
58
|
+
var Se = F["__core-js_shared__"], ot = (function() {
|
|
59
|
+
var e = /[^.]+$/.exec(Se && Se.keys && Se.keys.IE_PROTO || "");
|
|
60
60
|
return e ? "Symbol(src)_1." + e : "";
|
|
61
61
|
})();
|
|
62
|
-
function
|
|
63
|
-
return !!
|
|
62
|
+
function Cn(e) {
|
|
63
|
+
return !!ot && ot in e;
|
|
64
64
|
}
|
|
65
|
-
var
|
|
66
|
-
function
|
|
65
|
+
var xn = Function.prototype, Rn = xn.toString;
|
|
66
|
+
function X(e) {
|
|
67
67
|
if (e != null) {
|
|
68
68
|
try {
|
|
69
|
-
return
|
|
69
|
+
return Rn.call(e);
|
|
70
70
|
} catch {
|
|
71
71
|
}
|
|
72
72
|
try {
|
|
@@ -76,976 +76,999 @@ function Y(e) {
|
|
|
76
76
|
}
|
|
77
77
|
return "";
|
|
78
78
|
}
|
|
79
|
-
var
|
|
80
|
-
"^" +
|
|
79
|
+
var $n = /[\\^$.*+?()[\]{}|]/g, jn = /^\[object .+?Constructor\]$/, In = Function.prototype, zn = Object.prototype, Dn = In.toString, Fn = zn.hasOwnProperty, Ln = RegExp(
|
|
80
|
+
"^" + Dn.call(Fn).replace($n, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
|
|
81
81
|
);
|
|
82
|
-
function
|
|
83
|
-
if (!
|
|
82
|
+
function Nn(e) {
|
|
83
|
+
if (!ae(e) || Cn(e))
|
|
84
84
|
return !1;
|
|
85
|
-
var t =
|
|
86
|
-
return t.test(
|
|
85
|
+
var t = zt(e) ? Ln : jn;
|
|
86
|
+
return t.test(X(e));
|
|
87
87
|
}
|
|
88
|
-
function
|
|
88
|
+
function Un(e, t) {
|
|
89
89
|
return e?.[t];
|
|
90
90
|
}
|
|
91
|
-
function
|
|
92
|
-
var
|
|
93
|
-
return
|
|
91
|
+
function Z(e, t) {
|
|
92
|
+
var n = Un(e, t);
|
|
93
|
+
return Nn(n) ? n : void 0;
|
|
94
94
|
}
|
|
95
|
-
var
|
|
95
|
+
var Te = Z(F, "WeakMap"), st = (function() {
|
|
96
96
|
try {
|
|
97
|
-
var e =
|
|
97
|
+
var e = Z(Object, "defineProperty");
|
|
98
98
|
return e({}, "", {}), e;
|
|
99
99
|
} catch {
|
|
100
100
|
}
|
|
101
|
-
})(),
|
|
102
|
-
function
|
|
103
|
-
var
|
|
104
|
-
return t = t ??
|
|
101
|
+
})(), Kn = 9007199254740991, Bn = /^(?:0|[1-9]\d*)$/;
|
|
102
|
+
function Be(e, t) {
|
|
103
|
+
var n = typeof e;
|
|
104
|
+
return t = t ?? Kn, !!t && (n == "number" || n != "symbol" && Bn.test(e)) && e > -1 && e % 1 == 0 && e < t;
|
|
105
105
|
}
|
|
106
|
-
function
|
|
107
|
-
t == "__proto__" &&
|
|
106
|
+
function Gn(e, t, n) {
|
|
107
|
+
t == "__proto__" && st ? st(e, t, {
|
|
108
108
|
configurable: !0,
|
|
109
109
|
enumerable: !0,
|
|
110
|
-
value:
|
|
110
|
+
value: n,
|
|
111
111
|
writable: !0
|
|
112
|
-
}) : e[t] =
|
|
112
|
+
}) : e[t] = n;
|
|
113
113
|
}
|
|
114
|
-
function
|
|
114
|
+
function Ge(e, t) {
|
|
115
115
|
return e === t || e !== e && t !== t;
|
|
116
116
|
}
|
|
117
|
-
var
|
|
118
|
-
function
|
|
119
|
-
var
|
|
120
|
-
(!(
|
|
117
|
+
var Hn = Object.prototype, Wn = Hn.hasOwnProperty;
|
|
118
|
+
function Vn(e, t, n) {
|
|
119
|
+
var r = e[t];
|
|
120
|
+
(!(Wn.call(e, t) && Ge(r, n)) || n === void 0 && !(t in e)) && Gn(e, t, n);
|
|
121
121
|
}
|
|
122
|
-
var
|
|
123
|
-
function
|
|
124
|
-
return typeof e == "number" && e > -1 && e % 1 == 0 && e <=
|
|
122
|
+
var qn = 9007199254740991;
|
|
123
|
+
function He(e) {
|
|
124
|
+
return typeof e == "number" && e > -1 && e % 1 == 0 && e <= qn;
|
|
125
125
|
}
|
|
126
|
-
function
|
|
127
|
-
return e != null &&
|
|
126
|
+
function ve(e) {
|
|
127
|
+
return e != null && He(e.length) && !zt(e);
|
|
128
128
|
}
|
|
129
|
-
var
|
|
130
|
-
function
|
|
131
|
-
var t = e && e.constructor,
|
|
132
|
-
return e ===
|
|
129
|
+
var Yn = Object.prototype;
|
|
130
|
+
function Jn(e) {
|
|
131
|
+
var t = e && e.constructor, n = typeof t == "function" && t.prototype || Yn;
|
|
132
|
+
return e === n;
|
|
133
133
|
}
|
|
134
|
-
function
|
|
135
|
-
for (var
|
|
136
|
-
n
|
|
137
|
-
return
|
|
134
|
+
function Xn(e, t) {
|
|
135
|
+
for (var n = -1, r = Array(e); ++n < e; )
|
|
136
|
+
r[n] = t(n);
|
|
137
|
+
return r;
|
|
138
138
|
}
|
|
139
|
-
var
|
|
140
|
-
function
|
|
141
|
-
return
|
|
139
|
+
var Zn = "[object Arguments]";
|
|
140
|
+
function at(e) {
|
|
141
|
+
return V(e) && J(e) == Zn;
|
|
142
142
|
}
|
|
143
|
-
var
|
|
143
|
+
var Dt = Object.prototype, Qn = Dt.hasOwnProperty, kn = Dt.propertyIsEnumerable, Ft = at(/* @__PURE__ */ (function() {
|
|
144
144
|
return arguments;
|
|
145
|
-
})()) ?
|
|
146
|
-
return
|
|
145
|
+
})()) ? at : function(e) {
|
|
146
|
+
return V(e) && Qn.call(e, "callee") && !kn.call(e, "callee");
|
|
147
147
|
};
|
|
148
|
-
function
|
|
148
|
+
function er() {
|
|
149
149
|
return !1;
|
|
150
150
|
}
|
|
151
|
-
var
|
|
152
|
-
g[
|
|
153
|
-
g[
|
|
154
|
-
function
|
|
155
|
-
return
|
|
151
|
+
var Lt = typeof exports == "object" && exports && !exports.nodeType && exports, ct = Lt && typeof module == "object" && module && !module.nodeType && module, tr = ct && ct.exports === Lt, ft = tr ? F.Buffer : void 0, nr = ft ? ft.isBuffer : void 0, Pe = nr || er, rr = "[object Arguments]", ir = "[object Array]", or = "[object Boolean]", sr = "[object Date]", ar = "[object Error]", cr = "[object Function]", fr = "[object Map]", ur = "[object Number]", lr = "[object Object]", pr = "[object RegExp]", dr = "[object Set]", hr = "[object String]", yr = "[object WeakMap]", br = "[object ArrayBuffer]", gr = "[object DataView]", mr = "[object Float32Array]", vr = "[object Float64Array]", wr = "[object Int8Array]", _r = "[object Int16Array]", Or = "[object Int32Array]", Sr = "[object Uint8Array]", Ar = "[object Uint8ClampedArray]", Er = "[object Uint16Array]", Mr = "[object Uint32Array]", g = {};
|
|
152
|
+
g[mr] = g[vr] = g[wr] = g[_r] = g[Or] = g[Sr] = g[Ar] = g[Er] = g[Mr] = !0;
|
|
153
|
+
g[rr] = g[ir] = g[br] = g[or] = g[gr] = g[sr] = g[ar] = g[cr] = g[fr] = g[ur] = g[lr] = g[pr] = g[dr] = g[hr] = g[yr] = !1;
|
|
154
|
+
function Tr(e) {
|
|
155
|
+
return V(e) && He(e.length) && !!g[J(e)];
|
|
156
156
|
}
|
|
157
|
-
function
|
|
157
|
+
function Pr(e) {
|
|
158
158
|
return function(t) {
|
|
159
159
|
return e(t);
|
|
160
160
|
};
|
|
161
161
|
}
|
|
162
|
-
var
|
|
162
|
+
var Nt = typeof exports == "object" && exports && !exports.nodeType && exports, oe = Nt && typeof module == "object" && module && !module.nodeType && module, Cr = oe && oe.exports === Nt, Ae = Cr && Rt.process, ut = (function() {
|
|
163
163
|
try {
|
|
164
|
-
var e =
|
|
165
|
-
return e ||
|
|
164
|
+
var e = oe && oe.require && oe.require("util").types;
|
|
165
|
+
return e || Ae && Ae.binding && Ae.binding("util");
|
|
166
166
|
} catch {
|
|
167
167
|
}
|
|
168
|
-
})(),
|
|
169
|
-
function
|
|
170
|
-
var
|
|
168
|
+
})(), lt = ut && ut.isTypedArray, Ut = lt ? Pr(lt) : Tr, xr = Object.prototype, Rr = xr.hasOwnProperty;
|
|
169
|
+
function $r(e, t) {
|
|
170
|
+
var n = T(e), r = !n && Ft(e), i = !n && !r && Pe(e), o = !n && !r && !i && Ut(e), s = n || r || i || o, c = s ? Xn(e.length, String) : [], a = c.length;
|
|
171
171
|
for (var f in e)
|
|
172
|
-
|
|
172
|
+
Rr.call(e, f) && !(s && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
173
173
|
(f == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
174
174
|
i && (f == "offset" || f == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
175
175
|
o && (f == "buffer" || f == "byteLength" || f == "byteOffset") || // Skip index properties.
|
|
176
|
-
|
|
176
|
+
Be(f, a))) && c.push(f);
|
|
177
177
|
return c;
|
|
178
178
|
}
|
|
179
|
-
function
|
|
180
|
-
return function(
|
|
181
|
-
return e(t(
|
|
179
|
+
function jr(e, t) {
|
|
180
|
+
return function(n) {
|
|
181
|
+
return e(t(n));
|
|
182
182
|
};
|
|
183
183
|
}
|
|
184
|
-
var
|
|
185
|
-
function
|
|
186
|
-
if (!
|
|
187
|
-
return
|
|
184
|
+
var Ir = jr(Object.keys, Object), zr = Object.prototype, Dr = zr.hasOwnProperty;
|
|
185
|
+
function Kt(e) {
|
|
186
|
+
if (!Jn(e))
|
|
187
|
+
return Ir(e);
|
|
188
188
|
var t = [];
|
|
189
|
-
for (var
|
|
190
|
-
|
|
189
|
+
for (var n in Object(e))
|
|
190
|
+
Dr.call(e, n) && n != "constructor" && t.push(n);
|
|
191
191
|
return t;
|
|
192
192
|
}
|
|
193
|
-
function
|
|
194
|
-
return
|
|
193
|
+
function We(e) {
|
|
194
|
+
return ve(e) ? $r(e) : Kt(e);
|
|
195
195
|
}
|
|
196
|
-
var
|
|
197
|
-
function
|
|
198
|
-
if (
|
|
196
|
+
var Fr = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, Lr = /^\w*$/;
|
|
197
|
+
function Ve(e, t) {
|
|
198
|
+
if (T(e))
|
|
199
199
|
return !1;
|
|
200
|
-
var
|
|
201
|
-
return
|
|
200
|
+
var n = typeof e;
|
|
201
|
+
return n == "number" || n == "symbol" || n == "boolean" || e == null || Ue(e) ? !0 : Lr.test(e) || !Fr.test(e) || t != null && e in Object(t);
|
|
202
202
|
}
|
|
203
|
-
var
|
|
204
|
-
function
|
|
205
|
-
this.__data__ =
|
|
203
|
+
var ce = Z(Object, "create");
|
|
204
|
+
function Nr() {
|
|
205
|
+
this.__data__ = ce ? ce(null) : {}, this.size = 0;
|
|
206
206
|
}
|
|
207
|
-
function
|
|
207
|
+
function Ur(e) {
|
|
208
208
|
var t = this.has(e) && delete this.__data__[e];
|
|
209
209
|
return this.size -= t ? 1 : 0, t;
|
|
210
210
|
}
|
|
211
|
-
var
|
|
212
|
-
function
|
|
211
|
+
var Kr = "__lodash_hash_undefined__", Br = Object.prototype, Gr = Br.hasOwnProperty;
|
|
212
|
+
function Hr(e) {
|
|
213
213
|
var t = this.__data__;
|
|
214
|
-
if (
|
|
215
|
-
var
|
|
216
|
-
return
|
|
214
|
+
if (ce) {
|
|
215
|
+
var n = t[e];
|
|
216
|
+
return n === Kr ? void 0 : n;
|
|
217
217
|
}
|
|
218
|
-
return
|
|
218
|
+
return Gr.call(t, e) ? t[e] : void 0;
|
|
219
219
|
}
|
|
220
|
-
var
|
|
221
|
-
function
|
|
220
|
+
var Wr = Object.prototype, Vr = Wr.hasOwnProperty;
|
|
221
|
+
function qr(e) {
|
|
222
222
|
var t = this.__data__;
|
|
223
|
-
return
|
|
223
|
+
return ce ? t[e] !== void 0 : Vr.call(t, e);
|
|
224
224
|
}
|
|
225
|
-
var
|
|
226
|
-
function
|
|
227
|
-
var
|
|
228
|
-
return this.size += this.has(e) ? 0 : 1,
|
|
225
|
+
var Yr = "__lodash_hash_undefined__";
|
|
226
|
+
function Jr(e, t) {
|
|
227
|
+
var n = this.__data__;
|
|
228
|
+
return this.size += this.has(e) ? 0 : 1, n[e] = ce && t === void 0 ? Yr : t, this;
|
|
229
229
|
}
|
|
230
|
-
function
|
|
231
|
-
var t = -1,
|
|
232
|
-
for (this.clear(); ++t <
|
|
233
|
-
var
|
|
234
|
-
this.set(
|
|
230
|
+
function q(e) {
|
|
231
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
232
|
+
for (this.clear(); ++t < n; ) {
|
|
233
|
+
var r = e[t];
|
|
234
|
+
this.set(r[0], r[1]);
|
|
235
235
|
}
|
|
236
236
|
}
|
|
237
|
-
|
|
238
|
-
|
|
239
|
-
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
function
|
|
237
|
+
q.prototype.clear = Nr;
|
|
238
|
+
q.prototype.delete = Ur;
|
|
239
|
+
q.prototype.get = Hr;
|
|
240
|
+
q.prototype.has = qr;
|
|
241
|
+
q.prototype.set = Jr;
|
|
242
|
+
function Xr() {
|
|
243
243
|
this.__data__ = [], this.size = 0;
|
|
244
244
|
}
|
|
245
|
-
function
|
|
246
|
-
for (var
|
|
247
|
-
if (
|
|
248
|
-
return
|
|
245
|
+
function we(e, t) {
|
|
246
|
+
for (var n = e.length; n--; )
|
|
247
|
+
if (Ge(e[n][0], t))
|
|
248
|
+
return n;
|
|
249
249
|
return -1;
|
|
250
250
|
}
|
|
251
|
-
var
|
|
252
|
-
function
|
|
253
|
-
var t = this.__data__,
|
|
254
|
-
if (
|
|
251
|
+
var Zr = Array.prototype, Qr = Zr.splice;
|
|
252
|
+
function kr(e) {
|
|
253
|
+
var t = this.__data__, n = we(t, e);
|
|
254
|
+
if (n < 0)
|
|
255
255
|
return !1;
|
|
256
|
-
var
|
|
257
|
-
return
|
|
256
|
+
var r = t.length - 1;
|
|
257
|
+
return n == r ? t.pop() : Qr.call(t, n, 1), --this.size, !0;
|
|
258
258
|
}
|
|
259
|
-
function
|
|
260
|
-
var t = this.__data__,
|
|
261
|
-
return
|
|
259
|
+
function ei(e) {
|
|
260
|
+
var t = this.__data__, n = we(t, e);
|
|
261
|
+
return n < 0 ? void 0 : t[n][1];
|
|
262
262
|
}
|
|
263
|
-
function
|
|
264
|
-
return
|
|
263
|
+
function ti(e) {
|
|
264
|
+
return we(this.__data__, e) > -1;
|
|
265
265
|
}
|
|
266
|
-
function
|
|
267
|
-
var
|
|
268
|
-
return
|
|
266
|
+
function ni(e, t) {
|
|
267
|
+
var n = this.__data__, r = we(n, e);
|
|
268
|
+
return r < 0 ? (++this.size, n.push([e, t])) : n[r][1] = t, this;
|
|
269
269
|
}
|
|
270
270
|
function L(e) {
|
|
271
|
-
var t = -1,
|
|
272
|
-
for (this.clear(); ++t <
|
|
273
|
-
var
|
|
274
|
-
this.set(
|
|
271
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
272
|
+
for (this.clear(); ++t < n; ) {
|
|
273
|
+
var r = e[t];
|
|
274
|
+
this.set(r[0], r[1]);
|
|
275
275
|
}
|
|
276
276
|
}
|
|
277
|
-
L.prototype.clear =
|
|
278
|
-
L.prototype.delete =
|
|
279
|
-
L.prototype.get =
|
|
280
|
-
L.prototype.has =
|
|
281
|
-
L.prototype.set =
|
|
282
|
-
var
|
|
283
|
-
function
|
|
277
|
+
L.prototype.clear = Xr;
|
|
278
|
+
L.prototype.delete = kr;
|
|
279
|
+
L.prototype.get = ei;
|
|
280
|
+
L.prototype.has = ti;
|
|
281
|
+
L.prototype.set = ni;
|
|
282
|
+
var fe = Z(F, "Map");
|
|
283
|
+
function ri() {
|
|
284
284
|
this.size = 0, this.__data__ = {
|
|
285
|
-
hash: new
|
|
286
|
-
map: new (
|
|
287
|
-
string: new
|
|
285
|
+
hash: new q(),
|
|
286
|
+
map: new (fe || L)(),
|
|
287
|
+
string: new q()
|
|
288
288
|
};
|
|
289
289
|
}
|
|
290
|
-
function
|
|
290
|
+
function ii(e) {
|
|
291
291
|
var t = typeof e;
|
|
292
292
|
return t == "string" || t == "number" || t == "symbol" || t == "boolean" ? e !== "__proto__" : e === null;
|
|
293
293
|
}
|
|
294
|
-
function
|
|
295
|
-
var
|
|
296
|
-
return
|
|
294
|
+
function _e(e, t) {
|
|
295
|
+
var n = e.__data__;
|
|
296
|
+
return ii(t) ? n[typeof t == "string" ? "string" : "hash"] : n.map;
|
|
297
297
|
}
|
|
298
|
-
function
|
|
299
|
-
var t =
|
|
298
|
+
function oi(e) {
|
|
299
|
+
var t = _e(this, e).delete(e);
|
|
300
300
|
return this.size -= t ? 1 : 0, t;
|
|
301
301
|
}
|
|
302
|
-
function
|
|
303
|
-
return
|
|
302
|
+
function si(e) {
|
|
303
|
+
return _e(this, e).get(e);
|
|
304
304
|
}
|
|
305
|
-
function
|
|
306
|
-
return
|
|
305
|
+
function ai(e) {
|
|
306
|
+
return _e(this, e).has(e);
|
|
307
307
|
}
|
|
308
|
-
function
|
|
309
|
-
var
|
|
310
|
-
return
|
|
308
|
+
function ci(e, t) {
|
|
309
|
+
var n = _e(this, e), r = n.size;
|
|
310
|
+
return n.set(e, t), this.size += n.size == r ? 0 : 1, this;
|
|
311
311
|
}
|
|
312
312
|
function N(e) {
|
|
313
|
-
var t = -1,
|
|
314
|
-
for (this.clear(); ++t <
|
|
315
|
-
var
|
|
316
|
-
this.set(
|
|
313
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
314
|
+
for (this.clear(); ++t < n; ) {
|
|
315
|
+
var r = e[t];
|
|
316
|
+
this.set(r[0], r[1]);
|
|
317
317
|
}
|
|
318
318
|
}
|
|
319
|
-
N.prototype.clear =
|
|
320
|
-
N.prototype.delete =
|
|
321
|
-
N.prototype.get =
|
|
322
|
-
N.prototype.has =
|
|
323
|
-
N.prototype.set =
|
|
324
|
-
var
|
|
325
|
-
function
|
|
319
|
+
N.prototype.clear = ri;
|
|
320
|
+
N.prototype.delete = oi;
|
|
321
|
+
N.prototype.get = si;
|
|
322
|
+
N.prototype.has = ai;
|
|
323
|
+
N.prototype.set = ci;
|
|
324
|
+
var fi = "Expected a function";
|
|
325
|
+
function qe(e, t) {
|
|
326
326
|
if (typeof e != "function" || t != null && typeof t != "function")
|
|
327
|
-
throw new TypeError(
|
|
328
|
-
var
|
|
329
|
-
var
|
|
327
|
+
throw new TypeError(fi);
|
|
328
|
+
var n = function() {
|
|
329
|
+
var r = arguments, i = t ? t.apply(this, r) : r[0], o = n.cache;
|
|
330
330
|
if (o.has(i))
|
|
331
331
|
return o.get(i);
|
|
332
|
-
var s = e.apply(this,
|
|
333
|
-
return
|
|
332
|
+
var s = e.apply(this, r);
|
|
333
|
+
return n.cache = o.set(i, s) || o, s;
|
|
334
334
|
};
|
|
335
|
-
return
|
|
336
|
-
}
|
|
337
|
-
|
|
338
|
-
var
|
|
339
|
-
function
|
|
340
|
-
var t =
|
|
341
|
-
return
|
|
342
|
-
}),
|
|
335
|
+
return n.cache = new (qe.Cache || N)(), n;
|
|
336
|
+
}
|
|
337
|
+
qe.Cache = N;
|
|
338
|
+
var ui = 500;
|
|
339
|
+
function li(e) {
|
|
340
|
+
var t = qe(e, function(r) {
|
|
341
|
+
return n.size === ui && n.clear(), r;
|
|
342
|
+
}), n = t.cache;
|
|
343
343
|
return t;
|
|
344
344
|
}
|
|
345
|
-
var
|
|
345
|
+
var pi = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, di = /\\(\\)?/g, hi = li(function(e) {
|
|
346
346
|
var t = [];
|
|
347
|
-
return e.charCodeAt(0) === 46 && t.push(""), e.replace(
|
|
348
|
-
t.push(i ? o.replace(
|
|
347
|
+
return e.charCodeAt(0) === 46 && t.push(""), e.replace(pi, function(n, r, i, o) {
|
|
348
|
+
t.push(i ? o.replace(di, "$1") : r || n);
|
|
349
349
|
}), t;
|
|
350
350
|
});
|
|
351
|
-
function
|
|
352
|
-
return e == null ? "" :
|
|
351
|
+
function yi(e) {
|
|
352
|
+
return e == null ? "" : It(e);
|
|
353
353
|
}
|
|
354
|
-
function
|
|
355
|
-
return
|
|
354
|
+
function Ye(e, t) {
|
|
355
|
+
return T(e) ? e : Ve(e, t) ? [e] : hi(yi(e));
|
|
356
356
|
}
|
|
357
|
-
function
|
|
358
|
-
if (typeof e == "string" ||
|
|
357
|
+
function le(e) {
|
|
358
|
+
if (typeof e == "string" || Ue(e))
|
|
359
359
|
return e;
|
|
360
360
|
var t = e + "";
|
|
361
361
|
return t == "0" && 1 / e == -1 / 0 ? "-0" : t;
|
|
362
362
|
}
|
|
363
|
-
function
|
|
364
|
-
t =
|
|
365
|
-
for (var
|
|
366
|
-
e = e[
|
|
367
|
-
return
|
|
363
|
+
function Bt(e, t) {
|
|
364
|
+
t = Ye(t, e);
|
|
365
|
+
for (var n = 0, r = t.length; e != null && n < r; )
|
|
366
|
+
e = e[le(t[n++])];
|
|
367
|
+
return n && n == r ? e : void 0;
|
|
368
368
|
}
|
|
369
|
-
function
|
|
370
|
-
var
|
|
371
|
-
return
|
|
369
|
+
function bi(e, t, n) {
|
|
370
|
+
var r = e == null ? void 0 : Bt(e, t);
|
|
371
|
+
return r === void 0 ? n : r;
|
|
372
372
|
}
|
|
373
|
-
function
|
|
374
|
-
for (var
|
|
375
|
-
e[i +
|
|
373
|
+
function gi(e, t) {
|
|
374
|
+
for (var n = -1, r = t.length, i = e.length; ++n < r; )
|
|
375
|
+
e[i + n] = t[n];
|
|
376
376
|
return e;
|
|
377
377
|
}
|
|
378
|
-
var
|
|
379
|
-
function
|
|
380
|
-
return
|
|
378
|
+
var mi = "\\ud800-\\udfff", vi = "\\u0300-\\u036f", wi = "\\ufe20-\\ufe2f", _i = "\\u20d0-\\u20ff", Oi = vi + wi + _i, Si = "\\ufe0e\\ufe0f", Ai = "\\u200d", Ei = RegExp("[" + Ai + mi + Oi + Si + "]");
|
|
379
|
+
function Mi(e) {
|
|
380
|
+
return Ei.test(e);
|
|
381
381
|
}
|
|
382
|
-
function
|
|
382
|
+
function Ti() {
|
|
383
383
|
this.__data__ = new L(), this.size = 0;
|
|
384
384
|
}
|
|
385
|
-
function
|
|
386
|
-
var t = this.__data__,
|
|
387
|
-
return this.size = t.size,
|
|
385
|
+
function Pi(e) {
|
|
386
|
+
var t = this.__data__, n = t.delete(e);
|
|
387
|
+
return this.size = t.size, n;
|
|
388
388
|
}
|
|
389
|
-
function
|
|
389
|
+
function Ci(e) {
|
|
390
390
|
return this.__data__.get(e);
|
|
391
391
|
}
|
|
392
|
-
function
|
|
392
|
+
function xi(e) {
|
|
393
393
|
return this.__data__.has(e);
|
|
394
394
|
}
|
|
395
|
-
var
|
|
396
|
-
function
|
|
397
|
-
var
|
|
398
|
-
if (
|
|
399
|
-
var
|
|
400
|
-
if (!
|
|
401
|
-
return
|
|
402
|
-
|
|
395
|
+
var Ri = 200;
|
|
396
|
+
function $i(e, t) {
|
|
397
|
+
var n = this.__data__;
|
|
398
|
+
if (n instanceof L) {
|
|
399
|
+
var r = n.__data__;
|
|
400
|
+
if (!fe || r.length < Ri - 1)
|
|
401
|
+
return r.push([e, t]), this.size = ++n.size, this;
|
|
402
|
+
n = this.__data__ = new N(r);
|
|
403
403
|
}
|
|
404
|
-
return
|
|
404
|
+
return n.set(e, t), this.size = n.size, this;
|
|
405
405
|
}
|
|
406
406
|
function I(e) {
|
|
407
407
|
var t = this.__data__ = new L(e);
|
|
408
408
|
this.size = t.size;
|
|
409
409
|
}
|
|
410
|
-
I.prototype.clear =
|
|
411
|
-
I.prototype.delete =
|
|
412
|
-
I.prototype.get =
|
|
413
|
-
I.prototype.has =
|
|
414
|
-
I.prototype.set =
|
|
415
|
-
function
|
|
416
|
-
for (var
|
|
417
|
-
var s = e[
|
|
418
|
-
t(s,
|
|
410
|
+
I.prototype.clear = Ti;
|
|
411
|
+
I.prototype.delete = Pi;
|
|
412
|
+
I.prototype.get = Ci;
|
|
413
|
+
I.prototype.has = xi;
|
|
414
|
+
I.prototype.set = $i;
|
|
415
|
+
function ji(e, t) {
|
|
416
|
+
for (var n = -1, r = e == null ? 0 : e.length, i = 0, o = []; ++n < r; ) {
|
|
417
|
+
var s = e[n];
|
|
418
|
+
t(s, n, e) && (o[i++] = s);
|
|
419
419
|
}
|
|
420
420
|
return o;
|
|
421
421
|
}
|
|
422
|
-
function
|
|
422
|
+
function Ii() {
|
|
423
423
|
return [];
|
|
424
424
|
}
|
|
425
|
-
var
|
|
426
|
-
return e == null ? [] : (e = Object(e),
|
|
427
|
-
return
|
|
425
|
+
var zi = Object.prototype, Di = zi.propertyIsEnumerable, pt = Object.getOwnPropertySymbols, Fi = pt ? function(e) {
|
|
426
|
+
return e == null ? [] : (e = Object(e), ji(pt(e), function(t) {
|
|
427
|
+
return Di.call(e, t);
|
|
428
428
|
}));
|
|
429
|
-
} :
|
|
430
|
-
function
|
|
431
|
-
var
|
|
432
|
-
return
|
|
433
|
-
}
|
|
434
|
-
function
|
|
435
|
-
return
|
|
436
|
-
}
|
|
437
|
-
var
|
|
438
|
-
(
|
|
439
|
-
var t =
|
|
440
|
-
if (
|
|
441
|
-
switch (
|
|
442
|
-
case
|
|
429
|
+
} : Ii;
|
|
430
|
+
function Li(e, t, n) {
|
|
431
|
+
var r = t(e);
|
|
432
|
+
return T(e) ? r : gi(r, n(e));
|
|
433
|
+
}
|
|
434
|
+
function dt(e) {
|
|
435
|
+
return Li(e, We, Fi);
|
|
436
|
+
}
|
|
437
|
+
var Ce = Z(F, "DataView"), xe = Z(F, "Promise"), Re = Z(F, "Set"), ht = "[object Map]", Ni = "[object Object]", yt = "[object Promise]", bt = "[object Set]", gt = "[object WeakMap]", mt = "[object DataView]", Ui = X(Ce), Ki = X(fe), Bi = X(xe), Gi = X(Re), Hi = X(Te), j = J;
|
|
438
|
+
(Ce && j(new Ce(new ArrayBuffer(1))) != mt || fe && j(new fe()) != ht || xe && j(xe.resolve()) != yt || Re && j(new Re()) != bt || Te && j(new Te()) != gt) && (j = function(e) {
|
|
439
|
+
var t = J(e), n = t == Ni ? e.constructor : void 0, r = n ? X(n) : "";
|
|
440
|
+
if (r)
|
|
441
|
+
switch (r) {
|
|
442
|
+
case Ui:
|
|
443
|
+
return mt;
|
|
444
|
+
case Ki:
|
|
443
445
|
return ht;
|
|
444
|
-
case
|
|
445
|
-
return
|
|
446
|
-
case
|
|
447
|
-
return
|
|
448
|
-
case
|
|
449
|
-
return
|
|
450
|
-
case Fi:
|
|
451
|
-
return dt;
|
|
446
|
+
case Bi:
|
|
447
|
+
return yt;
|
|
448
|
+
case Gi:
|
|
449
|
+
return bt;
|
|
450
|
+
case Hi:
|
|
451
|
+
return gt;
|
|
452
452
|
}
|
|
453
453
|
return t;
|
|
454
454
|
});
|
|
455
|
-
var
|
|
456
|
-
function
|
|
457
|
-
|
|
455
|
+
var vt = F.Uint8Array;
|
|
456
|
+
function wt(e) {
|
|
457
|
+
for (var t = -1, n = e == null ? 0 : e.length, r = 0, i = []; ++t < n; ) {
|
|
458
|
+
var o = e[t];
|
|
459
|
+
o && (i[r++] = o);
|
|
460
|
+
}
|
|
461
|
+
return i;
|
|
462
|
+
}
|
|
463
|
+
var Wi = "__lodash_hash_undefined__";
|
|
464
|
+
function Vi(e) {
|
|
465
|
+
return this.__data__.set(e, Wi), this;
|
|
458
466
|
}
|
|
459
|
-
function
|
|
467
|
+
function qi(e) {
|
|
460
468
|
return this.__data__.has(e);
|
|
461
469
|
}
|
|
462
|
-
function
|
|
463
|
-
var t = -1,
|
|
464
|
-
for (this.__data__ = new N(); ++t <
|
|
470
|
+
function be(e) {
|
|
471
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
472
|
+
for (this.__data__ = new N(); ++t < n; )
|
|
465
473
|
this.add(e[t]);
|
|
466
474
|
}
|
|
467
|
-
|
|
468
|
-
|
|
469
|
-
function
|
|
470
|
-
for (var
|
|
471
|
-
if (t(e[
|
|
475
|
+
be.prototype.add = be.prototype.push = Vi;
|
|
476
|
+
be.prototype.has = qi;
|
|
477
|
+
function Gt(e, t) {
|
|
478
|
+
for (var n = -1, r = e == null ? 0 : e.length; ++n < r; )
|
|
479
|
+
if (t(e[n], n, e))
|
|
472
480
|
return !0;
|
|
473
481
|
return !1;
|
|
474
482
|
}
|
|
475
|
-
function
|
|
483
|
+
function Yi(e, t) {
|
|
476
484
|
return e.has(t);
|
|
477
485
|
}
|
|
478
|
-
var
|
|
479
|
-
function
|
|
480
|
-
var s =
|
|
486
|
+
var Ji = 1, Xi = 2;
|
|
487
|
+
function Ht(e, t, n, r, i, o) {
|
|
488
|
+
var s = n & Ji, c = e.length, a = t.length;
|
|
481
489
|
if (c != a && !(s && a > c))
|
|
482
490
|
return !1;
|
|
483
491
|
var f = o.get(e), u = o.get(t);
|
|
484
492
|
if (f && u)
|
|
485
493
|
return f == t && u == e;
|
|
486
|
-
var l = -1,
|
|
494
|
+
var l = -1, p = !0, d = n & Xi ? new be() : void 0;
|
|
487
495
|
for (o.set(e, t), o.set(t, e); ++l < c; ) {
|
|
488
|
-
var
|
|
489
|
-
if (
|
|
490
|
-
var
|
|
491
|
-
if (
|
|
492
|
-
if (
|
|
496
|
+
var b = e[l], w = t[l];
|
|
497
|
+
if (r)
|
|
498
|
+
var _ = s ? r(w, b, l, t, e, o) : r(b, w, l, e, t, o);
|
|
499
|
+
if (_ !== void 0) {
|
|
500
|
+
if (_)
|
|
493
501
|
continue;
|
|
494
|
-
|
|
502
|
+
p = !1;
|
|
495
503
|
break;
|
|
496
504
|
}
|
|
497
|
-
if (
|
|
498
|
-
if (!
|
|
499
|
-
if (!
|
|
500
|
-
return
|
|
505
|
+
if (d) {
|
|
506
|
+
if (!Gt(t, function(O, m) {
|
|
507
|
+
if (!Yi(d, m) && (b === O || i(b, O, n, r, o)))
|
|
508
|
+
return d.push(m);
|
|
501
509
|
})) {
|
|
502
|
-
|
|
510
|
+
p = !1;
|
|
503
511
|
break;
|
|
504
512
|
}
|
|
505
|
-
} else if (!(
|
|
506
|
-
|
|
513
|
+
} else if (!(b === w || i(b, w, n, r, o))) {
|
|
514
|
+
p = !1;
|
|
507
515
|
break;
|
|
508
516
|
}
|
|
509
517
|
}
|
|
510
|
-
return o.delete(e), o.delete(t),
|
|
511
|
-
}
|
|
512
|
-
function
|
|
513
|
-
var t = -1,
|
|
514
|
-
return e.forEach(function(
|
|
515
|
-
|
|
516
|
-
}),
|
|
517
|
-
}
|
|
518
|
-
function
|
|
519
|
-
var t = -1,
|
|
520
|
-
return e.forEach(function(
|
|
521
|
-
|
|
522
|
-
}),
|
|
523
|
-
}
|
|
524
|
-
var
|
|
525
|
-
function
|
|
526
|
-
switch (
|
|
527
|
-
case
|
|
518
|
+
return o.delete(e), o.delete(t), p;
|
|
519
|
+
}
|
|
520
|
+
function Zi(e) {
|
|
521
|
+
var t = -1, n = Array(e.size);
|
|
522
|
+
return e.forEach(function(r, i) {
|
|
523
|
+
n[++t] = [i, r];
|
|
524
|
+
}), n;
|
|
525
|
+
}
|
|
526
|
+
function Qi(e) {
|
|
527
|
+
var t = -1, n = Array(e.size);
|
|
528
|
+
return e.forEach(function(r) {
|
|
529
|
+
n[++t] = r;
|
|
530
|
+
}), n;
|
|
531
|
+
}
|
|
532
|
+
var ki = 1, eo = 2, to = "[object Boolean]", no = "[object Date]", ro = "[object Error]", io = "[object Map]", oo = "[object Number]", so = "[object RegExp]", ao = "[object Set]", co = "[object String]", fo = "[object Symbol]", uo = "[object ArrayBuffer]", lo = "[object DataView]", _t = G ? G.prototype : void 0, Ee = _t ? _t.valueOf : void 0;
|
|
533
|
+
function po(e, t, n, r, i, o, s) {
|
|
534
|
+
switch (n) {
|
|
535
|
+
case lo:
|
|
528
536
|
if (e.byteLength != t.byteLength || e.byteOffset != t.byteOffset)
|
|
529
537
|
return !1;
|
|
530
538
|
e = e.buffer, t = t.buffer;
|
|
539
|
+
case uo:
|
|
540
|
+
return !(e.byteLength != t.byteLength || !o(new vt(e), new vt(t)));
|
|
541
|
+
case to:
|
|
531
542
|
case no:
|
|
532
|
-
|
|
533
|
-
|
|
534
|
-
case
|
|
535
|
-
case Qi:
|
|
536
|
-
return Le(+e, +t);
|
|
537
|
-
case Ji:
|
|
543
|
+
case oo:
|
|
544
|
+
return Ge(+e, +t);
|
|
545
|
+
case ro:
|
|
538
546
|
return e.name == t.name && e.message == t.message;
|
|
539
|
-
case
|
|
540
|
-
case
|
|
547
|
+
case so:
|
|
548
|
+
case co:
|
|
541
549
|
return e == t + "";
|
|
542
|
-
case
|
|
543
|
-
var c =
|
|
544
|
-
case
|
|
545
|
-
var a =
|
|
546
|
-
if (c || (c =
|
|
550
|
+
case io:
|
|
551
|
+
var c = Zi;
|
|
552
|
+
case ao:
|
|
553
|
+
var a = r & ki;
|
|
554
|
+
if (c || (c = Qi), e.size != t.size && !a)
|
|
547
555
|
return !1;
|
|
548
556
|
var f = s.get(e);
|
|
549
557
|
if (f)
|
|
550
558
|
return f == t;
|
|
551
|
-
|
|
552
|
-
var u =
|
|
559
|
+
r |= eo, s.set(e, t);
|
|
560
|
+
var u = Ht(c(e), c(t), r, i, o, s);
|
|
553
561
|
return s.delete(e), u;
|
|
554
|
-
case
|
|
555
|
-
if (
|
|
556
|
-
return
|
|
562
|
+
case fo:
|
|
563
|
+
if (Ee)
|
|
564
|
+
return Ee.call(e) == Ee.call(t);
|
|
557
565
|
}
|
|
558
566
|
return !1;
|
|
559
567
|
}
|
|
560
|
-
var
|
|
561
|
-
function
|
|
562
|
-
var s =
|
|
568
|
+
var ho = 1, yo = Object.prototype, bo = yo.hasOwnProperty;
|
|
569
|
+
function go(e, t, n, r, i, o) {
|
|
570
|
+
var s = n & ho, c = dt(e), a = c.length, f = dt(t), u = f.length;
|
|
563
571
|
if (a != u && !s)
|
|
564
572
|
return !1;
|
|
565
573
|
for (var l = a; l--; ) {
|
|
566
|
-
var
|
|
567
|
-
if (!(s ?
|
|
574
|
+
var p = c[l];
|
|
575
|
+
if (!(s ? p in t : bo.call(t, p)))
|
|
568
576
|
return !1;
|
|
569
577
|
}
|
|
570
|
-
var
|
|
571
|
-
if (
|
|
572
|
-
return
|
|
573
|
-
var
|
|
578
|
+
var d = o.get(e), b = o.get(t);
|
|
579
|
+
if (d && b)
|
|
580
|
+
return d == t && b == e;
|
|
581
|
+
var w = !0;
|
|
574
582
|
o.set(e, t), o.set(t, e);
|
|
575
|
-
for (var
|
|
576
|
-
|
|
577
|
-
var
|
|
578
|
-
if (
|
|
579
|
-
var A = s ?
|
|
580
|
-
if (!(A === void 0 ?
|
|
581
|
-
|
|
583
|
+
for (var _ = s; ++l < a; ) {
|
|
584
|
+
p = c[l];
|
|
585
|
+
var O = e[p], m = t[p];
|
|
586
|
+
if (r)
|
|
587
|
+
var A = s ? r(m, O, p, t, e, o) : r(O, m, p, e, t, o);
|
|
588
|
+
if (!(A === void 0 ? O === m || i(O, m, n, r, o) : A)) {
|
|
589
|
+
w = !1;
|
|
582
590
|
break;
|
|
583
591
|
}
|
|
584
|
-
|
|
592
|
+
_ || (_ = p == "constructor");
|
|
585
593
|
}
|
|
586
|
-
if (
|
|
587
|
-
var
|
|
588
|
-
|
|
594
|
+
if (w && !_) {
|
|
595
|
+
var H = e.constructor, y = t.constructor;
|
|
596
|
+
H != y && "constructor" in e && "constructor" in t && !(typeof H == "function" && H instanceof H && typeof y == "function" && y instanceof y) && (w = !1);
|
|
589
597
|
}
|
|
590
|
-
return o.delete(e), o.delete(t),
|
|
591
|
-
}
|
|
592
|
-
var
|
|
593
|
-
function
|
|
594
|
-
var s =
|
|
595
|
-
a = a ==
|
|
596
|
-
var u = a ==
|
|
597
|
-
if (
|
|
598
|
-
if (!
|
|
598
|
+
return o.delete(e), o.delete(t), w;
|
|
599
|
+
}
|
|
600
|
+
var mo = 1, Ot = "[object Arguments]", St = "[object Array]", de = "[object Object]", vo = Object.prototype, At = vo.hasOwnProperty;
|
|
601
|
+
function wo(e, t, n, r, i, o) {
|
|
602
|
+
var s = T(e), c = T(t), a = s ? St : j(e), f = c ? St : j(t);
|
|
603
|
+
a = a == Ot ? de : a, f = f == Ot ? de : f;
|
|
604
|
+
var u = a == de, l = f == de, p = a == f;
|
|
605
|
+
if (p && Pe(e)) {
|
|
606
|
+
if (!Pe(t))
|
|
599
607
|
return !1;
|
|
600
608
|
s = !0, u = !1;
|
|
601
609
|
}
|
|
602
|
-
if (
|
|
603
|
-
return o || (o = new I()), s ||
|
|
604
|
-
if (!(
|
|
605
|
-
var
|
|
606
|
-
if (
|
|
607
|
-
var
|
|
608
|
-
return o || (o = new I()), i(
|
|
610
|
+
if (p && !u)
|
|
611
|
+
return o || (o = new I()), s || Ut(e) ? Ht(e, t, n, r, i, o) : po(e, t, a, n, r, i, o);
|
|
612
|
+
if (!(n & mo)) {
|
|
613
|
+
var d = u && At.call(e, "__wrapped__"), b = l && At.call(t, "__wrapped__");
|
|
614
|
+
if (d || b) {
|
|
615
|
+
var w = d ? e.value() : e, _ = b ? t.value() : t;
|
|
616
|
+
return o || (o = new I()), i(w, _, n, r, o);
|
|
609
617
|
}
|
|
610
618
|
}
|
|
611
|
-
return
|
|
619
|
+
return p ? (o || (o = new I()), go(e, t, n, r, i, o)) : !1;
|
|
612
620
|
}
|
|
613
|
-
function
|
|
614
|
-
return e === t ? !0 : e == null || t == null || !
|
|
621
|
+
function Oe(e, t, n, r, i) {
|
|
622
|
+
return e === t ? !0 : e == null || t == null || !V(e) && !V(t) ? e !== e && t !== t : wo(e, t, n, r, Oe, i);
|
|
615
623
|
}
|
|
616
|
-
var
|
|
617
|
-
function
|
|
618
|
-
var i =
|
|
624
|
+
var _o = 1, Oo = 2;
|
|
625
|
+
function So(e, t, n, r) {
|
|
626
|
+
var i = n.length, o = i;
|
|
619
627
|
if (e == null)
|
|
620
628
|
return !o;
|
|
621
629
|
for (e = Object(e); i--; ) {
|
|
622
|
-
var s =
|
|
630
|
+
var s = n[i];
|
|
623
631
|
if (s[2] ? s[1] !== e[s[0]] : !(s[0] in e))
|
|
624
632
|
return !1;
|
|
625
633
|
}
|
|
626
634
|
for (; ++i < o; ) {
|
|
627
|
-
s =
|
|
635
|
+
s = n[i];
|
|
628
636
|
var c = s[0], a = e[c], f = s[1];
|
|
629
637
|
if (s[2]) {
|
|
630
638
|
if (a === void 0 && !(c in e))
|
|
631
639
|
return !1;
|
|
632
640
|
} else {
|
|
633
641
|
var u = new I(), l;
|
|
634
|
-
if (!(l === void 0 ?
|
|
642
|
+
if (!(l === void 0 ? Oe(f, a, _o | Oo, r, u) : l))
|
|
635
643
|
return !1;
|
|
636
644
|
}
|
|
637
645
|
}
|
|
638
646
|
return !0;
|
|
639
647
|
}
|
|
640
|
-
function
|
|
641
|
-
return e === e && !
|
|
648
|
+
function Wt(e) {
|
|
649
|
+
return e === e && !ae(e);
|
|
642
650
|
}
|
|
643
|
-
function
|
|
644
|
-
for (var t =
|
|
645
|
-
var
|
|
646
|
-
t[
|
|
651
|
+
function Ao(e) {
|
|
652
|
+
for (var t = We(e), n = t.length; n--; ) {
|
|
653
|
+
var r = t[n], i = e[r];
|
|
654
|
+
t[n] = [r, i, Wt(i)];
|
|
647
655
|
}
|
|
648
656
|
return t;
|
|
649
657
|
}
|
|
650
|
-
function
|
|
651
|
-
return function(
|
|
652
|
-
return
|
|
658
|
+
function Vt(e, t) {
|
|
659
|
+
return function(n) {
|
|
660
|
+
return n == null ? !1 : n[e] === t && (t !== void 0 || e in Object(n));
|
|
653
661
|
};
|
|
654
662
|
}
|
|
655
|
-
function
|
|
656
|
-
var t =
|
|
657
|
-
return t.length == 1 && t[0][2] ?
|
|
658
|
-
return
|
|
663
|
+
function Eo(e) {
|
|
664
|
+
var t = Ao(e);
|
|
665
|
+
return t.length == 1 && t[0][2] ? Vt(t[0][0], t[0][1]) : function(n) {
|
|
666
|
+
return n === e || So(n, e, t);
|
|
659
667
|
};
|
|
660
668
|
}
|
|
661
|
-
function
|
|
669
|
+
function Mo(e, t) {
|
|
662
670
|
return e != null && t in Object(e);
|
|
663
671
|
}
|
|
664
|
-
function
|
|
665
|
-
t =
|
|
666
|
-
for (var
|
|
667
|
-
var s =
|
|
668
|
-
if (!(o = e != null &&
|
|
672
|
+
function To(e, t, n) {
|
|
673
|
+
t = Ye(t, e);
|
|
674
|
+
for (var r = -1, i = t.length, o = !1; ++r < i; ) {
|
|
675
|
+
var s = le(t[r]);
|
|
676
|
+
if (!(o = e != null && n(e, s)))
|
|
669
677
|
break;
|
|
670
678
|
e = e[s];
|
|
671
679
|
}
|
|
672
|
-
return o || ++
|
|
680
|
+
return o || ++r != i ? o : (i = e == null ? 0 : e.length, !!i && He(i) && Be(s, i) && (T(e) || Ft(e)));
|
|
673
681
|
}
|
|
674
|
-
function
|
|
675
|
-
return e != null &&
|
|
682
|
+
function Po(e, t) {
|
|
683
|
+
return e != null && To(e, t, Mo);
|
|
676
684
|
}
|
|
677
|
-
var
|
|
678
|
-
function
|
|
679
|
-
return
|
|
680
|
-
var
|
|
681
|
-
return
|
|
685
|
+
var Co = 1, xo = 2;
|
|
686
|
+
function Ro(e, t) {
|
|
687
|
+
return Ve(e) && Wt(t) ? Vt(le(e), t) : function(n) {
|
|
688
|
+
var r = bi(n, e);
|
|
689
|
+
return r === void 0 && r === t ? Po(n, e) : Oe(t, r, Co | xo);
|
|
682
690
|
};
|
|
683
691
|
}
|
|
684
|
-
function
|
|
692
|
+
function qt(e) {
|
|
685
693
|
return function(t) {
|
|
686
694
|
return t?.[e];
|
|
687
695
|
};
|
|
688
696
|
}
|
|
689
|
-
function
|
|
697
|
+
function $o(e) {
|
|
690
698
|
return function(t) {
|
|
691
|
-
return
|
|
699
|
+
return Bt(t, e);
|
|
692
700
|
};
|
|
693
701
|
}
|
|
694
|
-
function
|
|
695
|
-
return
|
|
702
|
+
function jo(e) {
|
|
703
|
+
return Ve(e) ? qt(le(e)) : $o(e);
|
|
696
704
|
}
|
|
697
|
-
function
|
|
698
|
-
return typeof e == "function" ? e : e == null ?
|
|
705
|
+
function Yt(e) {
|
|
706
|
+
return typeof e == "function" ? e : e == null ? Ke : typeof e == "object" ? T(e) ? Ro(e[0], e[1]) : Eo(e) : jo(e);
|
|
699
707
|
}
|
|
700
|
-
function
|
|
701
|
-
return function(t,
|
|
702
|
-
for (var i = -1, o = Object(t), s =
|
|
708
|
+
function Io(e) {
|
|
709
|
+
return function(t, n, r) {
|
|
710
|
+
for (var i = -1, o = Object(t), s = r(t), c = s.length; c--; ) {
|
|
703
711
|
var a = s[++i];
|
|
704
|
-
if (
|
|
712
|
+
if (n(o[a], a, o) === !1)
|
|
705
713
|
break;
|
|
706
714
|
}
|
|
707
715
|
return t;
|
|
708
716
|
};
|
|
709
717
|
}
|
|
710
|
-
var
|
|
711
|
-
function
|
|
712
|
-
return e &&
|
|
713
|
-
}
|
|
714
|
-
function
|
|
715
|
-
return function(
|
|
716
|
-
if (
|
|
717
|
-
return
|
|
718
|
-
if (!
|
|
719
|
-
return e(
|
|
720
|
-
for (var i =
|
|
718
|
+
var zo = Io();
|
|
719
|
+
function Do(e, t) {
|
|
720
|
+
return e && zo(e, t, We);
|
|
721
|
+
}
|
|
722
|
+
function Fo(e, t) {
|
|
723
|
+
return function(n, r) {
|
|
724
|
+
if (n == null)
|
|
725
|
+
return n;
|
|
726
|
+
if (!ve(n))
|
|
727
|
+
return e(n, r);
|
|
728
|
+
for (var i = n.length, o = -1, s = Object(n); ++o < i && r(s[o], o, s) !== !1; )
|
|
721
729
|
;
|
|
722
|
-
return
|
|
730
|
+
return n;
|
|
723
731
|
};
|
|
724
732
|
}
|
|
725
|
-
var
|
|
726
|
-
function
|
|
727
|
-
|
|
733
|
+
var Jt = Fo(Do);
|
|
734
|
+
function Lo(e, t) {
|
|
735
|
+
var n = -1, r = ve(e) ? Array(e.length) : [];
|
|
736
|
+
return Jt(e, function(i, o, s) {
|
|
737
|
+
r[++n] = t(i, o, s);
|
|
738
|
+
}), r;
|
|
728
739
|
}
|
|
729
|
-
function
|
|
730
|
-
|
|
740
|
+
function No(e, t) {
|
|
741
|
+
var n = T(e) ? jt : Lo;
|
|
742
|
+
return n(e, Yt(t));
|
|
731
743
|
}
|
|
732
|
-
|
|
733
|
-
|
|
744
|
+
var Uo = "[object String]";
|
|
745
|
+
function Ko(e) {
|
|
746
|
+
return typeof e == "string" || !T(e) && V(e) && J(e) == Uo;
|
|
747
|
+
}
|
|
748
|
+
function Bo(e, t) {
|
|
749
|
+
return Oe(e, t);
|
|
750
|
+
}
|
|
751
|
+
var Go = Array.prototype, Ho = Go.join;
|
|
752
|
+
function Et(e, t) {
|
|
753
|
+
return e == null ? "" : Ho.call(e, t);
|
|
754
|
+
}
|
|
755
|
+
function Wo(e, t, n, r) {
|
|
756
|
+
if (!ae(e))
|
|
734
757
|
return e;
|
|
735
|
-
t =
|
|
758
|
+
t = Ye(t, e);
|
|
736
759
|
for (var i = -1, o = t.length, s = o - 1, c = e; c != null && ++i < o; ) {
|
|
737
|
-
var a =
|
|
760
|
+
var a = le(t[i]), f = n;
|
|
738
761
|
if (a === "__proto__" || a === "constructor" || a === "prototype")
|
|
739
762
|
return e;
|
|
740
763
|
if (i != s) {
|
|
741
764
|
var u = c[a];
|
|
742
|
-
f = void 0, f === void 0 && (f =
|
|
765
|
+
f = void 0, f === void 0 && (f = ae(u) ? u : Be(t[i + 1]) ? [] : {});
|
|
743
766
|
}
|
|
744
|
-
|
|
767
|
+
Vn(c, a, f), c = c[a];
|
|
745
768
|
}
|
|
746
769
|
return e;
|
|
747
770
|
}
|
|
748
|
-
var
|
|
749
|
-
function
|
|
750
|
-
for (var t =
|
|
771
|
+
var Vo = qt("length"), Xt = "\\ud800-\\udfff", qo = "\\u0300-\\u036f", Yo = "\\ufe20-\\ufe2f", Jo = "\\u20d0-\\u20ff", Xo = qo + Yo + Jo, Zo = "\\ufe0e\\ufe0f", Qo = "[" + Xt + "]", $e = "[" + Xo + "]", je = "\\ud83c[\\udffb-\\udfff]", ko = "(?:" + $e + "|" + je + ")", Zt = "[^" + Xt + "]", Qt = "(?:\\ud83c[\\udde6-\\uddff]){2}", kt = "[\\ud800-\\udbff][\\udc00-\\udfff]", es = "\\u200d", en = ko + "?", tn = "[" + Zo + "]?", ts = "(?:" + es + "(?:" + [Zt, Qt, kt].join("|") + ")" + tn + en + ")*", ns = tn + en + ts, rs = "(?:" + [Zt + $e + "?", $e, Qt, kt, Qo].join("|") + ")", Mt = RegExp(je + "(?=" + je + ")|" + rs + ns, "g");
|
|
772
|
+
function is(e) {
|
|
773
|
+
for (var t = Mt.lastIndex = 0; Mt.test(e); )
|
|
751
774
|
++t;
|
|
752
775
|
return t;
|
|
753
776
|
}
|
|
754
|
-
function
|
|
755
|
-
return
|
|
777
|
+
function os(e) {
|
|
778
|
+
return Mi(e) ? is(e) : Vo(e);
|
|
756
779
|
}
|
|
757
|
-
function
|
|
758
|
-
return e == null ? e :
|
|
780
|
+
function ss(e, t, n) {
|
|
781
|
+
return e == null ? e : Wo(e, t, n);
|
|
759
782
|
}
|
|
760
|
-
var
|
|
761
|
-
function
|
|
783
|
+
var as = "[object Map]", cs = "[object Set]";
|
|
784
|
+
function Ie(e) {
|
|
762
785
|
if (e == null)
|
|
763
786
|
return 0;
|
|
764
|
-
if (
|
|
765
|
-
return
|
|
787
|
+
if (ve(e))
|
|
788
|
+
return Ko(e) ? os(e) : e.length;
|
|
766
789
|
var t = j(e);
|
|
767
|
-
return t ==
|
|
790
|
+
return t == as || t == cs ? e.size : Kt(e).length;
|
|
768
791
|
}
|
|
769
|
-
function
|
|
770
|
-
var
|
|
771
|
-
return
|
|
772
|
-
return
|
|
773
|
-
}), !!
|
|
792
|
+
function fs(e, t) {
|
|
793
|
+
var n;
|
|
794
|
+
return Jt(e, function(r, i, o) {
|
|
795
|
+
return n = t(r, i, o), !n;
|
|
796
|
+
}), !!n;
|
|
774
797
|
}
|
|
775
|
-
function
|
|
776
|
-
var
|
|
777
|
-
return
|
|
798
|
+
function us(e, t, n) {
|
|
799
|
+
var r = T(e) ? Gt : fs;
|
|
800
|
+
return r(e, Yt(t));
|
|
778
801
|
}
|
|
779
|
-
const
|
|
802
|
+
const v = {
|
|
780
803
|
Remove: "remove",
|
|
781
804
|
Replace: "replace",
|
|
782
805
|
Add: "add"
|
|
783
|
-
},
|
|
806
|
+
}, nn = Symbol.for("__MUTATIVE_PROXY_DRAFT__"), ls = Symbol("__MUTATIVE_RAW_RETURN_SYMBOL__"), he = Symbol.iterator, M = {
|
|
784
807
|
mutable: "mutable",
|
|
785
808
|
immutable: "immutable"
|
|
786
|
-
},
|
|
787
|
-
function
|
|
809
|
+
}, Je = {};
|
|
810
|
+
function se(e, t) {
|
|
788
811
|
return e instanceof Map ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
|
|
789
812
|
}
|
|
790
|
-
function
|
|
813
|
+
function Tt(e, t) {
|
|
791
814
|
if (t in e) {
|
|
792
|
-
let
|
|
793
|
-
for (;
|
|
794
|
-
const
|
|
795
|
-
if (
|
|
796
|
-
return
|
|
797
|
-
|
|
815
|
+
let n = Reflect.getPrototypeOf(e);
|
|
816
|
+
for (; n; ) {
|
|
817
|
+
const r = Reflect.getOwnPropertyDescriptor(n, t);
|
|
818
|
+
if (r)
|
|
819
|
+
return r;
|
|
820
|
+
n = Reflect.getPrototypeOf(n);
|
|
798
821
|
}
|
|
799
822
|
}
|
|
800
823
|
}
|
|
801
|
-
function
|
|
824
|
+
function Xe(e) {
|
|
802
825
|
return Object.getPrototypeOf(e) === Set.prototype;
|
|
803
826
|
}
|
|
804
|
-
function
|
|
827
|
+
function Ze(e) {
|
|
805
828
|
return Object.getPrototypeOf(e) === Map.prototype;
|
|
806
829
|
}
|
|
807
|
-
function
|
|
830
|
+
function E(e) {
|
|
808
831
|
var t;
|
|
809
832
|
return (t = e.copy) !== null && t !== void 0 ? t : e.original;
|
|
810
833
|
}
|
|
811
|
-
function
|
|
812
|
-
return !!
|
|
834
|
+
function Y(e) {
|
|
835
|
+
return !!h(e);
|
|
813
836
|
}
|
|
814
|
-
function
|
|
815
|
-
return typeof e != "object" ? null : e?.[
|
|
837
|
+
function h(e) {
|
|
838
|
+
return typeof e != "object" ? null : e?.[nn];
|
|
816
839
|
}
|
|
817
|
-
function
|
|
840
|
+
function Qe(e) {
|
|
818
841
|
var t;
|
|
819
|
-
const
|
|
820
|
-
return
|
|
842
|
+
const n = h(e);
|
|
843
|
+
return n ? (t = n.copy) !== null && t !== void 0 ? t : n.original : e;
|
|
821
844
|
}
|
|
822
|
-
function
|
|
845
|
+
function x(e, t) {
|
|
823
846
|
if (!e || typeof e != "object")
|
|
824
847
|
return !1;
|
|
825
|
-
let
|
|
826
|
-
return Object.getPrototypeOf(e) === Object.prototype || Array.isArray(e) || e instanceof Map || e instanceof Set || !!t?.mark && ((
|
|
848
|
+
let n;
|
|
849
|
+
return Object.getPrototypeOf(e) === Object.prototype || Array.isArray(e) || e instanceof Map || e instanceof Set || !!t?.mark && ((n = t.mark(e, M)) === M.immutable || typeof n == "function");
|
|
827
850
|
}
|
|
828
|
-
function
|
|
851
|
+
function rn(e, t = []) {
|
|
829
852
|
if (Object.hasOwnProperty.call(e, "key")) {
|
|
830
|
-
const
|
|
831
|
-
if (
|
|
853
|
+
const n = e.parent.copy, r = h(D(n, e.key));
|
|
854
|
+
if (r !== null && r?.original !== e.original)
|
|
832
855
|
return null;
|
|
833
856
|
const i = e.parent.type === 3, o = i ? Array.from(e.parent.setMap.keys()).indexOf(e.key) : e.key;
|
|
834
|
-
if (!(i &&
|
|
857
|
+
if (!(i && n.size > o || se(n, o)))
|
|
835
858
|
return null;
|
|
836
859
|
t.push(o);
|
|
837
860
|
}
|
|
838
861
|
if (e.parent)
|
|
839
|
-
return
|
|
862
|
+
return rn(e.parent, t);
|
|
840
863
|
t.reverse();
|
|
841
864
|
try {
|
|
842
|
-
|
|
865
|
+
ps(e.copy, t);
|
|
843
866
|
} catch {
|
|
844
867
|
return null;
|
|
845
868
|
}
|
|
846
869
|
return t;
|
|
847
870
|
}
|
|
848
|
-
function
|
|
871
|
+
function Q(e) {
|
|
849
872
|
return Array.isArray(e) ? 1 : e instanceof Map ? 2 : e instanceof Set ? 3 : 0;
|
|
850
873
|
}
|
|
851
874
|
function D(e, t) {
|
|
852
|
-
return
|
|
875
|
+
return Q(e) === 2 ? e.get(t) : e[t];
|
|
853
876
|
}
|
|
854
|
-
function
|
|
855
|
-
|
|
877
|
+
function pe(e, t, n) {
|
|
878
|
+
Q(e) === 2 ? e.set(t, n) : e[t] = n;
|
|
856
879
|
}
|
|
857
|
-
function
|
|
858
|
-
const
|
|
859
|
-
return (
|
|
880
|
+
function Me(e, t) {
|
|
881
|
+
const n = h(e);
|
|
882
|
+
return (n ? E(n) : e)[t];
|
|
860
883
|
}
|
|
861
884
|
function z(e, t) {
|
|
862
885
|
return e === t ? e !== 0 || 1 / e === 1 / t : e !== e && t !== t;
|
|
863
886
|
}
|
|
864
|
-
function
|
|
887
|
+
function ze(e) {
|
|
865
888
|
if (e)
|
|
866
889
|
for (; e.finalities.revoke.length > 0; )
|
|
867
890
|
e.finalities.revoke.pop()();
|
|
868
891
|
}
|
|
869
|
-
function
|
|
870
|
-
return t ? e : [""].concat(e).map((
|
|
871
|
-
const
|
|
872
|
-
return
|
|
892
|
+
function W(e, t) {
|
|
893
|
+
return t ? e : [""].concat(e).map((n) => {
|
|
894
|
+
const r = `${n}`;
|
|
895
|
+
return r.indexOf("/") === -1 && r.indexOf("~") === -1 ? r : r.replace(/~/g, "~0").replace(/\//g, "~1");
|
|
873
896
|
}).join("/");
|
|
874
897
|
}
|
|
875
|
-
function
|
|
876
|
-
for (let
|
|
877
|
-
const
|
|
878
|
-
if (e = D(
|
|
898
|
+
function ps(e, t) {
|
|
899
|
+
for (let n = 0; n < t.length - 1; n += 1) {
|
|
900
|
+
const r = t[n];
|
|
901
|
+
if (e = D(Q(e) === 3 ? Array.from(e) : e, r), typeof e != "object")
|
|
879
902
|
throw new Error(`Cannot resolve patch at '${t.join("/")}'.`);
|
|
880
903
|
}
|
|
881
904
|
return e;
|
|
882
905
|
}
|
|
883
|
-
function
|
|
906
|
+
function ds(e) {
|
|
884
907
|
const t = Object.create(Object.getPrototypeOf(e));
|
|
885
|
-
return Reflect.ownKeys(e).forEach((
|
|
886
|
-
let
|
|
887
|
-
if (
|
|
888
|
-
t[
|
|
908
|
+
return Reflect.ownKeys(e).forEach((n) => {
|
|
909
|
+
let r = Reflect.getOwnPropertyDescriptor(e, n);
|
|
910
|
+
if (r.enumerable && r.configurable && r.writable) {
|
|
911
|
+
t[n] = e[n];
|
|
889
912
|
return;
|
|
890
913
|
}
|
|
891
|
-
|
|
914
|
+
r.writable || (r.writable = !0, r.configurable = !0), (r.get || r.set) && (r = {
|
|
892
915
|
configurable: !0,
|
|
893
916
|
writable: !0,
|
|
894
|
-
enumerable:
|
|
895
|
-
value: e[
|
|
896
|
-
}), Reflect.defineProperty(t,
|
|
917
|
+
enumerable: r.enumerable,
|
|
918
|
+
value: e[n]
|
|
919
|
+
}), Reflect.defineProperty(t, n, r);
|
|
897
920
|
}), t;
|
|
898
921
|
}
|
|
899
|
-
const
|
|
900
|
-
function
|
|
901
|
-
let
|
|
922
|
+
const hs = Object.prototype.propertyIsEnumerable;
|
|
923
|
+
function on(e, t) {
|
|
924
|
+
let n;
|
|
902
925
|
if (Array.isArray(e))
|
|
903
926
|
return Array.prototype.concat.call(e);
|
|
904
927
|
if (e instanceof Set) {
|
|
905
|
-
if (!
|
|
906
|
-
const
|
|
907
|
-
return new
|
|
928
|
+
if (!Xe(e)) {
|
|
929
|
+
const r = Object.getPrototypeOf(e).constructor;
|
|
930
|
+
return new r(e.values());
|
|
908
931
|
}
|
|
909
932
|
return Set.prototype.difference ? Set.prototype.difference.call(e, /* @__PURE__ */ new Set()) : new Set(e.values());
|
|
910
933
|
} else if (e instanceof Map) {
|
|
911
|
-
if (!
|
|
912
|
-
const
|
|
913
|
-
return new
|
|
934
|
+
if (!Ze(e)) {
|
|
935
|
+
const r = Object.getPrototypeOf(e).constructor;
|
|
936
|
+
return new r(e);
|
|
914
937
|
}
|
|
915
938
|
return new Map(e);
|
|
916
|
-
} else if (t?.mark && (
|
|
917
|
-
if (
|
|
918
|
-
return
|
|
919
|
-
if (typeof
|
|
939
|
+
} else if (t?.mark && (n = t.mark(e, M), n !== void 0) && n !== M.mutable) {
|
|
940
|
+
if (n === M.immutable)
|
|
941
|
+
return ds(e);
|
|
942
|
+
if (typeof n == "function") {
|
|
920
943
|
if (t.enablePatches || t.enableAutoFreeze)
|
|
921
944
|
throw new Error("You can't use mark and patches or auto freeze together.");
|
|
922
|
-
return
|
|
945
|
+
return n();
|
|
923
946
|
}
|
|
924
|
-
throw new Error(`Unsupported mark result: ${
|
|
947
|
+
throw new Error(`Unsupported mark result: ${n}`);
|
|
925
948
|
} else if (typeof e == "object" && Object.getPrototypeOf(e) === Object.prototype) {
|
|
926
|
-
const
|
|
949
|
+
const r = {};
|
|
927
950
|
return Object.keys(e).forEach((i) => {
|
|
928
|
-
|
|
951
|
+
r[i] = e[i];
|
|
929
952
|
}), Object.getOwnPropertySymbols(e).forEach((i) => {
|
|
930
|
-
|
|
931
|
-
}),
|
|
953
|
+
hs.call(e, i) && (r[i] = e[i]);
|
|
954
|
+
}), r;
|
|
932
955
|
} else
|
|
933
956
|
throw new Error("Please check mark() to ensure that it is a stable marker draftable function.");
|
|
934
957
|
}
|
|
935
958
|
function S(e) {
|
|
936
|
-
e.copy || (e.copy =
|
|
959
|
+
e.copy || (e.copy = on(e.original, e.options));
|
|
937
960
|
}
|
|
938
|
-
function
|
|
939
|
-
if (!
|
|
940
|
-
return
|
|
961
|
+
function re(e) {
|
|
962
|
+
if (!x(e))
|
|
963
|
+
return Qe(e);
|
|
941
964
|
if (Array.isArray(e))
|
|
942
|
-
return e.map(
|
|
965
|
+
return e.map(re);
|
|
943
966
|
if (e instanceof Map) {
|
|
944
|
-
const
|
|
945
|
-
|
|
946
|
-
|
|
967
|
+
const n = Array.from(e.entries()).map(([r, i]) => [
|
|
968
|
+
r,
|
|
969
|
+
re(i)
|
|
947
970
|
]);
|
|
948
|
-
if (!
|
|
949
|
-
const
|
|
950
|
-
return new n
|
|
971
|
+
if (!Ze(e)) {
|
|
972
|
+
const r = Object.getPrototypeOf(e).constructor;
|
|
973
|
+
return new r(n);
|
|
951
974
|
}
|
|
952
|
-
return new Map(
|
|
975
|
+
return new Map(n);
|
|
953
976
|
}
|
|
954
977
|
if (e instanceof Set) {
|
|
955
|
-
const
|
|
956
|
-
if (!
|
|
957
|
-
const
|
|
958
|
-
return new n
|
|
978
|
+
const n = Array.from(e).map(re);
|
|
979
|
+
if (!Xe(e)) {
|
|
980
|
+
const r = Object.getPrototypeOf(e).constructor;
|
|
981
|
+
return new r(n);
|
|
959
982
|
}
|
|
960
|
-
return new Set(
|
|
983
|
+
return new Set(n);
|
|
961
984
|
}
|
|
962
985
|
const t = Object.create(Object.getPrototypeOf(e));
|
|
963
|
-
for (const
|
|
964
|
-
t[
|
|
986
|
+
for (const n in e)
|
|
987
|
+
t[n] = re(e[n]);
|
|
965
988
|
return t;
|
|
966
989
|
}
|
|
967
|
-
function
|
|
968
|
-
return
|
|
990
|
+
function ye(e) {
|
|
991
|
+
return Y(e) ? re(e) : e;
|
|
969
992
|
}
|
|
970
|
-
function
|
|
993
|
+
function R(e) {
|
|
971
994
|
var t;
|
|
972
|
-
e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent &&
|
|
995
|
+
e.assignedMap = (t = e.assignedMap) !== null && t !== void 0 ? t : /* @__PURE__ */ new Map(), e.operated || (e.operated = !0, e.parent && R(e.parent));
|
|
973
996
|
}
|
|
974
|
-
function
|
|
997
|
+
function Pt() {
|
|
975
998
|
throw new Error("Cannot modify frozen object");
|
|
976
999
|
}
|
|
977
|
-
function
|
|
1000
|
+
function k(e, t, n, r, i) {
|
|
978
1001
|
{
|
|
979
|
-
|
|
980
|
-
const s =
|
|
981
|
-
if (
|
|
982
|
-
const c =
|
|
1002
|
+
n = n ?? /* @__PURE__ */ new WeakMap(), r = r ?? [], i = i ?? [];
|
|
1003
|
+
const s = n.has(e) ? n.get(e) : e;
|
|
1004
|
+
if (r.length > 0) {
|
|
1005
|
+
const c = r.indexOf(s);
|
|
983
1006
|
if (s && typeof s == "object" && c !== -1)
|
|
984
|
-
throw
|
|
1007
|
+
throw r[0] === s ? new Error("Forbids circular reference") : new Error(`Forbids circular reference: ~/${i.slice(0, c).map((a, f) => {
|
|
985
1008
|
if (typeof a == "symbol")
|
|
986
1009
|
return `[${a.toString()}]`;
|
|
987
|
-
const u =
|
|
1010
|
+
const u = r[f];
|
|
988
1011
|
return typeof a == "object" && (u instanceof Map || u instanceof Set) ? Array.from(u.keys()).indexOf(a) : a;
|
|
989
1012
|
}).join("/")}`);
|
|
990
|
-
|
|
1013
|
+
r.push(s), i.push(t);
|
|
991
1014
|
} else
|
|
992
|
-
|
|
1015
|
+
r.push(s);
|
|
993
1016
|
}
|
|
994
|
-
if (Object.isFrozen(e) ||
|
|
995
|
-
|
|
1017
|
+
if (Object.isFrozen(e) || Y(e)) {
|
|
1018
|
+
r.pop(), i.pop();
|
|
996
1019
|
return;
|
|
997
1020
|
}
|
|
998
|
-
switch (
|
|
1021
|
+
switch (Q(e)) {
|
|
999
1022
|
case 2:
|
|
1000
1023
|
for (const [c, a] of e)
|
|
1001
|
-
|
|
1002
|
-
e.set = e.clear = e.delete =
|
|
1024
|
+
k(c, c, n, r, i), k(a, c, n, r, i);
|
|
1025
|
+
e.set = e.clear = e.delete = Pt;
|
|
1003
1026
|
break;
|
|
1004
1027
|
case 3:
|
|
1005
1028
|
for (const c of e)
|
|
1006
|
-
|
|
1007
|
-
e.add = e.clear = e.delete =
|
|
1029
|
+
k(c, c, n, r, i);
|
|
1030
|
+
e.add = e.clear = e.delete = Pt;
|
|
1008
1031
|
break;
|
|
1009
1032
|
case 1:
|
|
1010
1033
|
Object.freeze(e);
|
|
1011
1034
|
let s = 0;
|
|
1012
1035
|
for (const c of e)
|
|
1013
|
-
|
|
1036
|
+
k(c, s, n, r, i), s += 1;
|
|
1014
1037
|
break;
|
|
1015
1038
|
default:
|
|
1016
1039
|
Object.freeze(e), Object.keys(e).forEach((c) => {
|
|
1017
1040
|
const a = e[c];
|
|
1018
|
-
|
|
1041
|
+
k(a, c, n, r, i);
|
|
1019
1042
|
});
|
|
1020
1043
|
}
|
|
1021
|
-
|
|
1044
|
+
r.pop(), i.pop();
|
|
1022
1045
|
}
|
|
1023
|
-
function
|
|
1024
|
-
const
|
|
1025
|
-
if (
|
|
1026
|
-
Reflect.ownKeys(e).forEach((
|
|
1027
|
-
t(
|
|
1046
|
+
function ke(e, t) {
|
|
1047
|
+
const n = Q(e);
|
|
1048
|
+
if (n === 0)
|
|
1049
|
+
Reflect.ownKeys(e).forEach((r) => {
|
|
1050
|
+
t(r, e[r], e);
|
|
1028
1051
|
});
|
|
1029
|
-
else if (
|
|
1030
|
-
let
|
|
1052
|
+
else if (n === 1) {
|
|
1053
|
+
let r = 0;
|
|
1031
1054
|
for (const i of e)
|
|
1032
|
-
t(
|
|
1055
|
+
t(r, i, e), r += 1;
|
|
1033
1056
|
} else
|
|
1034
|
-
e.forEach((
|
|
1057
|
+
e.forEach((r, i) => t(i, r, e));
|
|
1035
1058
|
}
|
|
1036
|
-
function
|
|
1037
|
-
if (
|
|
1059
|
+
function sn(e, t, n) {
|
|
1060
|
+
if (Y(e) || !x(e, n) || t.has(e) || Object.isFrozen(e))
|
|
1038
1061
|
return;
|
|
1039
|
-
const
|
|
1040
|
-
if (t.add(e),
|
|
1062
|
+
const r = e instanceof Set, i = r ? /* @__PURE__ */ new Map() : void 0;
|
|
1063
|
+
if (t.add(e), ke(e, (o, s) => {
|
|
1041
1064
|
var c;
|
|
1042
|
-
if (
|
|
1043
|
-
const a =
|
|
1065
|
+
if (Y(s)) {
|
|
1066
|
+
const a = h(s);
|
|
1044
1067
|
S(a);
|
|
1045
1068
|
const f = !((c = a.assignedMap) === null || c === void 0) && c.size || a.operated ? a.copy : a.original;
|
|
1046
|
-
|
|
1069
|
+
pe(r ? i : e, o, f);
|
|
1047
1070
|
} else
|
|
1048
|
-
|
|
1071
|
+
sn(s, t, n);
|
|
1049
1072
|
}), i) {
|
|
1050
1073
|
const o = e, s = Array.from(o);
|
|
1051
1074
|
o.clear(), s.forEach((c) => {
|
|
@@ -1053,104 +1076,104 @@ function Qt(e, t, r) {
|
|
|
1053
1076
|
});
|
|
1054
1077
|
}
|
|
1055
1078
|
}
|
|
1056
|
-
function
|
|
1057
|
-
const
|
|
1058
|
-
e.finalities.revoke.length > 1 && e.assignedMap.get(t) &&
|
|
1079
|
+
function ys(e, t) {
|
|
1080
|
+
const n = e.type === 3 ? e.setMap : e.copy;
|
|
1081
|
+
e.finalities.revoke.length > 1 && e.assignedMap.get(t) && n && sn(D(n, t), e.finalities.handledSet, e.options);
|
|
1059
1082
|
}
|
|
1060
|
-
function
|
|
1083
|
+
function De(e) {
|
|
1061
1084
|
e.type === 3 && e.copy && (e.copy.clear(), e.setMap.forEach((t) => {
|
|
1062
|
-
e.copy.add(
|
|
1085
|
+
e.copy.add(Qe(t));
|
|
1063
1086
|
}));
|
|
1064
1087
|
}
|
|
1065
|
-
function
|
|
1088
|
+
function Fe(e, t, n, r) {
|
|
1066
1089
|
if (e.operated && e.assignedMap && e.assignedMap.size > 0 && !e.finalized) {
|
|
1067
|
-
if (
|
|
1068
|
-
const o =
|
|
1069
|
-
o && t(e, o,
|
|
1090
|
+
if (n && r) {
|
|
1091
|
+
const o = rn(e);
|
|
1092
|
+
o && t(e, o, n, r);
|
|
1070
1093
|
}
|
|
1071
1094
|
e.finalized = !0;
|
|
1072
1095
|
}
|
|
1073
1096
|
}
|
|
1074
|
-
function
|
|
1075
|
-
const i =
|
|
1097
|
+
function et(e, t, n, r) {
|
|
1098
|
+
const i = h(n);
|
|
1076
1099
|
i && (i.callbacks || (i.callbacks = []), i.callbacks.push((o, s) => {
|
|
1077
1100
|
var c;
|
|
1078
1101
|
const a = e.type === 3 ? e.setMap : e.copy;
|
|
1079
|
-
if (z(D(a, t),
|
|
1102
|
+
if (z(D(a, t), n)) {
|
|
1080
1103
|
let f = i.original;
|
|
1081
|
-
i.copy && (f = i.copy),
|
|
1104
|
+
i.copy && (f = i.copy), De(e), Fe(e, r, o, s), e.options.enableAutoFreeze && (e.options.updatedValues = (c = e.options.updatedValues) !== null && c !== void 0 ? c : /* @__PURE__ */ new WeakMap(), e.options.updatedValues.set(f, i.original)), pe(a, t, f);
|
|
1082
1105
|
}
|
|
1083
|
-
}), e.options.enableAutoFreeze && i.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)),
|
|
1106
|
+
}), e.options.enableAutoFreeze && i.finalities !== e.finalities && (e.options.enableAutoFreeze = !1)), x(n, e.options) && e.finalities.draft.push(() => {
|
|
1084
1107
|
const o = e.type === 3 ? e.setMap : e.copy;
|
|
1085
|
-
z(D(o, t),
|
|
1108
|
+
z(D(o, t), n) && ys(e, t);
|
|
1086
1109
|
});
|
|
1087
1110
|
}
|
|
1088
|
-
function
|
|
1111
|
+
function bs(e, t, n, r, i) {
|
|
1089
1112
|
let { original: o, assignedMap: s, options: c } = e, a = e.copy;
|
|
1090
|
-
a.length < o.length && ([o, a] = [a, o], [
|
|
1113
|
+
a.length < o.length && ([o, a] = [a, o], [n, r] = [r, n]);
|
|
1091
1114
|
for (let f = 0; f < o.length; f += 1)
|
|
1092
1115
|
if (s.get(f.toString()) && a[f] !== o[f]) {
|
|
1093
|
-
const u = t.concat([f]), l =
|
|
1094
|
-
|
|
1095
|
-
op:
|
|
1116
|
+
const u = t.concat([f]), l = W(u, i);
|
|
1117
|
+
n.push({
|
|
1118
|
+
op: v.Replace,
|
|
1096
1119
|
path: l,
|
|
1097
1120
|
// If it is a draft, it needs to be deep cloned, and it may also be non-draft.
|
|
1098
|
-
value:
|
|
1099
|
-
}),
|
|
1100
|
-
op:
|
|
1121
|
+
value: ye(a[f])
|
|
1122
|
+
}), r.push({
|
|
1123
|
+
op: v.Replace,
|
|
1101
1124
|
path: l,
|
|
1102
1125
|
// If it is a draft, it needs to be deep cloned, and it may also be non-draft.
|
|
1103
|
-
value:
|
|
1126
|
+
value: ye(o[f])
|
|
1104
1127
|
});
|
|
1105
1128
|
}
|
|
1106
1129
|
for (let f = o.length; f < a.length; f += 1) {
|
|
1107
|
-
const u = t.concat([f]), l =
|
|
1108
|
-
|
|
1109
|
-
op:
|
|
1130
|
+
const u = t.concat([f]), l = W(u, i);
|
|
1131
|
+
n.push({
|
|
1132
|
+
op: v.Add,
|
|
1110
1133
|
path: l,
|
|
1111
1134
|
// If it is a draft, it needs to be deep cloned, and it may also be non-draft.
|
|
1112
|
-
value:
|
|
1135
|
+
value: ye(a[f])
|
|
1113
1136
|
});
|
|
1114
1137
|
}
|
|
1115
1138
|
if (o.length < a.length) {
|
|
1116
1139
|
const { arrayLengthAssignment: f = !0 } = c.enablePatches;
|
|
1117
1140
|
if (f) {
|
|
1118
|
-
const u = t.concat(["length"]), l =
|
|
1119
|
-
|
|
1120
|
-
op:
|
|
1141
|
+
const u = t.concat(["length"]), l = W(u, i);
|
|
1142
|
+
r.push({
|
|
1143
|
+
op: v.Replace,
|
|
1121
1144
|
path: l,
|
|
1122
1145
|
value: o.length
|
|
1123
1146
|
});
|
|
1124
1147
|
} else
|
|
1125
1148
|
for (let u = a.length; o.length < u; u -= 1) {
|
|
1126
|
-
const l = t.concat([u - 1]),
|
|
1127
|
-
|
|
1128
|
-
op:
|
|
1129
|
-
path:
|
|
1149
|
+
const l = t.concat([u - 1]), p = W(l, i);
|
|
1150
|
+
r.push({
|
|
1151
|
+
op: v.Remove,
|
|
1152
|
+
path: p
|
|
1130
1153
|
});
|
|
1131
1154
|
}
|
|
1132
1155
|
}
|
|
1133
1156
|
}
|
|
1134
|
-
function
|
|
1135
|
-
|
|
1136
|
-
const f = D(e, a), u =
|
|
1137
|
-
if (z(f, u) && l ===
|
|
1157
|
+
function gs({ original: e, copy: t, assignedMap: n }, r, i, o, s) {
|
|
1158
|
+
n.forEach((c, a) => {
|
|
1159
|
+
const f = D(e, a), u = ye(D(t, a)), l = c ? se(e, a) ? v.Replace : v.Add : v.Remove;
|
|
1160
|
+
if (z(f, u) && l === v.Replace)
|
|
1138
1161
|
return;
|
|
1139
|
-
const
|
|
1140
|
-
i.push(l ===
|
|
1162
|
+
const p = r.concat(a), d = W(p, s);
|
|
1163
|
+
i.push(l === v.Remove ? { op: l, path: d } : { op: l, path: d, value: u }), o.push(l === v.Add ? { op: v.Remove, path: d } : l === v.Remove ? { op: v.Add, path: d, value: f } : { op: v.Replace, path: d, value: f });
|
|
1141
1164
|
});
|
|
1142
1165
|
}
|
|
1143
|
-
function
|
|
1166
|
+
function ms({ original: e, copy: t }, n, r, i, o) {
|
|
1144
1167
|
let s = 0;
|
|
1145
1168
|
e.forEach((c) => {
|
|
1146
1169
|
if (!t.has(c)) {
|
|
1147
|
-
const a =
|
|
1148
|
-
|
|
1149
|
-
op:
|
|
1170
|
+
const a = n.concat([s]), f = W(a, o);
|
|
1171
|
+
r.push({
|
|
1172
|
+
op: v.Remove,
|
|
1150
1173
|
path: f,
|
|
1151
1174
|
value: c
|
|
1152
1175
|
}), i.unshift({
|
|
1153
|
-
op:
|
|
1176
|
+
op: v.Add,
|
|
1154
1177
|
path: f,
|
|
1155
1178
|
value: c
|
|
1156
1179
|
});
|
|
@@ -1158,13 +1181,13 @@ function us({ original: e, copy: t }, r, n, i, o) {
|
|
|
1158
1181
|
s += 1;
|
|
1159
1182
|
}), s = 0, t.forEach((c) => {
|
|
1160
1183
|
if (!e.has(c)) {
|
|
1161
|
-
const a =
|
|
1162
|
-
|
|
1163
|
-
op:
|
|
1184
|
+
const a = n.concat([s]), f = W(a, o);
|
|
1185
|
+
r.push({
|
|
1186
|
+
op: v.Add,
|
|
1164
1187
|
path: f,
|
|
1165
1188
|
value: c
|
|
1166
1189
|
}), i.unshift({
|
|
1167
|
-
op:
|
|
1190
|
+
op: v.Remove,
|
|
1168
1191
|
path: f,
|
|
1169
1192
|
value: c
|
|
1170
1193
|
});
|
|
@@ -1172,74 +1195,74 @@ function us({ original: e, copy: t }, r, n, i, o) {
|
|
|
1172
1195
|
s += 1;
|
|
1173
1196
|
});
|
|
1174
1197
|
}
|
|
1175
|
-
function
|
|
1198
|
+
function ue(e, t, n, r) {
|
|
1176
1199
|
const { pathAsArray: i = !0 } = e.options.enablePatches;
|
|
1177
1200
|
switch (e.type) {
|
|
1178
1201
|
case 0:
|
|
1179
1202
|
case 2:
|
|
1180
|
-
return
|
|
1203
|
+
return gs(e, t, n, r, i);
|
|
1181
1204
|
case 1:
|
|
1182
|
-
return
|
|
1205
|
+
return bs(e, t, n, r, i);
|
|
1183
1206
|
case 3:
|
|
1184
|
-
return
|
|
1207
|
+
return ms(e, t, n, r, i);
|
|
1185
1208
|
}
|
|
1186
1209
|
}
|
|
1187
|
-
const
|
|
1188
|
-
if (typeof e == "object" && e !== null && (!
|
|
1210
|
+
const ge = (e, t, n = !1) => {
|
|
1211
|
+
if (typeof e == "object" && e !== null && (!x(e, t) || n))
|
|
1189
1212
|
throw new Error("Strict mode: Mutable data cannot be accessed directly, please use 'unsafe(callback)' wrap.");
|
|
1190
|
-
},
|
|
1213
|
+
}, Le = {
|
|
1191
1214
|
get size() {
|
|
1192
|
-
return
|
|
1215
|
+
return E(h(this)).size;
|
|
1193
1216
|
},
|
|
1194
1217
|
has(e) {
|
|
1195
|
-
return
|
|
1218
|
+
return E(h(this)).has(e);
|
|
1196
1219
|
},
|
|
1197
1220
|
set(e, t) {
|
|
1198
|
-
const
|
|
1199
|
-
return (!
|
|
1221
|
+
const n = h(this), r = E(n);
|
|
1222
|
+
return (!r.has(e) || !z(r.get(e), t)) && (S(n), R(n), n.assignedMap.set(e, !0), n.copy.set(e, t), et(n, e, t, ue)), this;
|
|
1200
1223
|
},
|
|
1201
1224
|
delete(e) {
|
|
1202
1225
|
if (!this.has(e))
|
|
1203
1226
|
return !1;
|
|
1204
|
-
const t =
|
|
1205
|
-
return S(t),
|
|
1227
|
+
const t = h(this);
|
|
1228
|
+
return S(t), R(t), t.original.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.copy.delete(e), !0;
|
|
1206
1229
|
},
|
|
1207
1230
|
clear() {
|
|
1208
|
-
const e =
|
|
1231
|
+
const e = h(this);
|
|
1209
1232
|
if (this.size) {
|
|
1210
|
-
S(e),
|
|
1233
|
+
S(e), R(e), e.assignedMap = /* @__PURE__ */ new Map();
|
|
1211
1234
|
for (const [t] of e.original)
|
|
1212
1235
|
e.assignedMap.set(t, !1);
|
|
1213
1236
|
e.copy.clear();
|
|
1214
1237
|
}
|
|
1215
1238
|
},
|
|
1216
1239
|
forEach(e, t) {
|
|
1217
|
-
const
|
|
1218
|
-
|
|
1240
|
+
const n = h(this);
|
|
1241
|
+
E(n).forEach((r, i) => {
|
|
1219
1242
|
e.call(t, this.get(i), i, this);
|
|
1220
1243
|
});
|
|
1221
1244
|
},
|
|
1222
1245
|
get(e) {
|
|
1223
|
-
var t,
|
|
1224
|
-
const
|
|
1225
|
-
if (
|
|
1246
|
+
var t, n;
|
|
1247
|
+
const r = h(this), i = E(r).get(e), o = ((n = (t = r.options).mark) === null || n === void 0 ? void 0 : n.call(t, i, M)) === M.mutable;
|
|
1248
|
+
if (r.options.strict && ge(i, r.options, o), o || r.finalized || !x(i, r.options) || i !== r.original.get(e))
|
|
1226
1249
|
return i;
|
|
1227
|
-
const s =
|
|
1250
|
+
const s = Je.createDraft({
|
|
1228
1251
|
original: i,
|
|
1229
|
-
parentDraft:
|
|
1252
|
+
parentDraft: r,
|
|
1230
1253
|
key: e,
|
|
1231
|
-
finalities:
|
|
1232
|
-
options:
|
|
1254
|
+
finalities: r.finalities,
|
|
1255
|
+
options: r.options
|
|
1233
1256
|
});
|
|
1234
|
-
return S(
|
|
1257
|
+
return S(r), r.copy.set(e, s), s;
|
|
1235
1258
|
},
|
|
1236
1259
|
keys() {
|
|
1237
|
-
return
|
|
1260
|
+
return E(h(this)).keys();
|
|
1238
1261
|
},
|
|
1239
1262
|
values() {
|
|
1240
1263
|
const e = this.keys();
|
|
1241
1264
|
return {
|
|
1242
|
-
[
|
|
1265
|
+
[he]: () => this.values(),
|
|
1243
1266
|
next: () => {
|
|
1244
1267
|
const t = e.next();
|
|
1245
1268
|
return t.done ? t : {
|
|
@@ -1252,32 +1275,32 @@ const ye = (e, t, r = !1) => {
|
|
|
1252
1275
|
entries() {
|
|
1253
1276
|
const e = this.keys();
|
|
1254
1277
|
return {
|
|
1255
|
-
[
|
|
1278
|
+
[he]: () => this.entries(),
|
|
1256
1279
|
next: () => {
|
|
1257
1280
|
const t = e.next();
|
|
1258
1281
|
if (t.done)
|
|
1259
1282
|
return t;
|
|
1260
|
-
const
|
|
1283
|
+
const n = this.get(t.value);
|
|
1261
1284
|
return {
|
|
1262
1285
|
done: !1,
|
|
1263
|
-
value: [t.value,
|
|
1286
|
+
value: [t.value, n]
|
|
1264
1287
|
};
|
|
1265
1288
|
}
|
|
1266
1289
|
};
|
|
1267
1290
|
},
|
|
1268
|
-
[
|
|
1291
|
+
[he]() {
|
|
1269
1292
|
return this.entries();
|
|
1270
1293
|
}
|
|
1271
|
-
},
|
|
1272
|
-
var
|
|
1294
|
+
}, vs = Reflect.ownKeys(Le), Ct = (e, t, { isValuesIterator: n }) => () => {
|
|
1295
|
+
var r, i;
|
|
1273
1296
|
const o = t.next();
|
|
1274
1297
|
if (o.done)
|
|
1275
1298
|
return o;
|
|
1276
1299
|
const s = o.value;
|
|
1277
1300
|
let c = e.setMap.get(s);
|
|
1278
|
-
const a =
|
|
1279
|
-
if (e.options.strict &&
|
|
1280
|
-
const u =
|
|
1301
|
+
const a = h(c), f = ((i = (r = e.options).mark) === null || i === void 0 ? void 0 : i.call(r, c, M)) === M.mutable;
|
|
1302
|
+
if (e.options.strict && ge(s, e.options, f), !f && !a && x(s, e.options) && !e.finalized && e.original.has(s)) {
|
|
1303
|
+
const u = Je.createDraft({
|
|
1281
1304
|
original: s,
|
|
1282
1305
|
parentDraft: e,
|
|
1283
1306
|
key: s,
|
|
@@ -1288,57 +1311,57 @@ const ye = (e, t, r = !1) => {
|
|
|
1288
1311
|
} else a && (c = a.proxy);
|
|
1289
1312
|
return {
|
|
1290
1313
|
done: !1,
|
|
1291
|
-
value:
|
|
1314
|
+
value: n ? c : [c, c]
|
|
1292
1315
|
};
|
|
1293
|
-
},
|
|
1316
|
+
}, me = {
|
|
1294
1317
|
get size() {
|
|
1295
|
-
return
|
|
1318
|
+
return h(this).setMap.size;
|
|
1296
1319
|
},
|
|
1297
1320
|
has(e) {
|
|
1298
|
-
const t =
|
|
1321
|
+
const t = h(this);
|
|
1299
1322
|
if (t.setMap.has(e))
|
|
1300
1323
|
return !0;
|
|
1301
1324
|
S(t);
|
|
1302
|
-
const
|
|
1303
|
-
return !!(
|
|
1325
|
+
const n = h(e);
|
|
1326
|
+
return !!(n && t.setMap.has(n.original));
|
|
1304
1327
|
},
|
|
1305
1328
|
add(e) {
|
|
1306
|
-
const t =
|
|
1307
|
-
return this.has(e) || (S(t),
|
|
1329
|
+
const t = h(this);
|
|
1330
|
+
return this.has(e) || (S(t), R(t), t.assignedMap.set(e, !0), t.setMap.set(e, e), et(t, e, e, ue)), this;
|
|
1308
1331
|
},
|
|
1309
1332
|
delete(e) {
|
|
1310
1333
|
if (!this.has(e))
|
|
1311
1334
|
return !1;
|
|
1312
|
-
const t =
|
|
1313
|
-
S(t),
|
|
1314
|
-
const
|
|
1315
|
-
return
|
|
1335
|
+
const t = h(this);
|
|
1336
|
+
S(t), R(t);
|
|
1337
|
+
const n = h(e);
|
|
1338
|
+
return n && t.setMap.has(n.original) ? (t.assignedMap.set(n.original, !1), t.setMap.delete(n.original)) : (!n && t.setMap.has(e) ? t.assignedMap.set(e, !1) : t.assignedMap.delete(e), t.setMap.delete(e));
|
|
1316
1339
|
},
|
|
1317
1340
|
clear() {
|
|
1318
1341
|
if (!this.size)
|
|
1319
1342
|
return;
|
|
1320
|
-
const e =
|
|
1321
|
-
S(e),
|
|
1343
|
+
const e = h(this);
|
|
1344
|
+
S(e), R(e);
|
|
1322
1345
|
for (const t of e.original)
|
|
1323
1346
|
e.assignedMap.set(t, !1);
|
|
1324
1347
|
e.setMap.clear();
|
|
1325
1348
|
},
|
|
1326
1349
|
values() {
|
|
1327
|
-
const e =
|
|
1350
|
+
const e = h(this);
|
|
1328
1351
|
S(e);
|
|
1329
1352
|
const t = e.setMap.keys();
|
|
1330
1353
|
return {
|
|
1331
1354
|
[Symbol.iterator]: () => this.values(),
|
|
1332
|
-
next:
|
|
1355
|
+
next: Ct(e, t, { isValuesIterator: !0 })
|
|
1333
1356
|
};
|
|
1334
1357
|
},
|
|
1335
1358
|
entries() {
|
|
1336
|
-
const e =
|
|
1359
|
+
const e = h(this);
|
|
1337
1360
|
S(e);
|
|
1338
1361
|
const t = e.setMap.keys();
|
|
1339
1362
|
return {
|
|
1340
1363
|
[Symbol.iterator]: () => this.entries(),
|
|
1341
|
-
next:
|
|
1364
|
+
next: Ct(e, t, {
|
|
1342
1365
|
isValuesIterator: !1
|
|
1343
1366
|
})
|
|
1344
1367
|
};
|
|
@@ -1346,17 +1369,17 @@ const ye = (e, t, r = !1) => {
|
|
|
1346
1369
|
keys() {
|
|
1347
1370
|
return this.values();
|
|
1348
1371
|
},
|
|
1349
|
-
[
|
|
1372
|
+
[he]() {
|
|
1350
1373
|
return this.values();
|
|
1351
1374
|
},
|
|
1352
1375
|
forEach(e, t) {
|
|
1353
|
-
const
|
|
1354
|
-
let
|
|
1355
|
-
for (; !
|
|
1356
|
-
e.call(t,
|
|
1376
|
+
const n = this.values();
|
|
1377
|
+
let r = n.next();
|
|
1378
|
+
for (; !r.done; )
|
|
1379
|
+
e.call(t, r.value, r.value, this), r = n.next();
|
|
1357
1380
|
}
|
|
1358
1381
|
};
|
|
1359
|
-
Set.prototype.difference && Object.assign(
|
|
1382
|
+
Set.prototype.difference && Object.assign(me, {
|
|
1360
1383
|
intersection(e) {
|
|
1361
1384
|
return Set.prototype.intersection.call(new Set(this.values()), e);
|
|
1362
1385
|
},
|
|
@@ -1379,86 +1402,86 @@ Set.prototype.difference && Object.assign(be, {
|
|
|
1379
1402
|
return Set.prototype.isDisjointFrom.call(new Set(this.values()), e);
|
|
1380
1403
|
}
|
|
1381
1404
|
});
|
|
1382
|
-
const
|
|
1383
|
-
get(e, t,
|
|
1384
|
-
var
|
|
1385
|
-
const o = (
|
|
1386
|
-
if (o &&
|
|
1405
|
+
const ws = Reflect.ownKeys(me), an = /* @__PURE__ */ new WeakSet(), cn = {
|
|
1406
|
+
get(e, t, n) {
|
|
1407
|
+
var r, i;
|
|
1408
|
+
const o = (r = e.copy) === null || r === void 0 ? void 0 : r[t];
|
|
1409
|
+
if (o && an.has(o))
|
|
1387
1410
|
return o;
|
|
1388
|
-
if (t ===
|
|
1411
|
+
if (t === nn)
|
|
1389
1412
|
return e;
|
|
1390
1413
|
let s;
|
|
1391
1414
|
if (e.options.mark) {
|
|
1392
|
-
const f = t === "size" && (e.original instanceof Map || e.original instanceof Set) ? Reflect.get(e.original, t) : Reflect.get(e.original, t,
|
|
1393
|
-
if (s = e.options.mark(f,
|
|
1394
|
-
return e.options.strict &&
|
|
1415
|
+
const f = t === "size" && (e.original instanceof Map || e.original instanceof Set) ? Reflect.get(e.original, t) : Reflect.get(e.original, t, n);
|
|
1416
|
+
if (s = e.options.mark(f, M), s === M.mutable)
|
|
1417
|
+
return e.options.strict && ge(f, e.options, !0), f;
|
|
1395
1418
|
}
|
|
1396
|
-
const c =
|
|
1397
|
-
if (c instanceof Map &&
|
|
1419
|
+
const c = E(e);
|
|
1420
|
+
if (c instanceof Map && vs.includes(t)) {
|
|
1398
1421
|
if (t === "size")
|
|
1399
|
-
return Object.getOwnPropertyDescriptor(
|
|
1400
|
-
const f =
|
|
1422
|
+
return Object.getOwnPropertyDescriptor(Le, "size").get.call(e.proxy);
|
|
1423
|
+
const f = Le[t];
|
|
1401
1424
|
if (f)
|
|
1402
1425
|
return f.bind(e.proxy);
|
|
1403
1426
|
}
|
|
1404
|
-
if (c instanceof Set &&
|
|
1427
|
+
if (c instanceof Set && ws.includes(t)) {
|
|
1405
1428
|
if (t === "size")
|
|
1406
|
-
return Object.getOwnPropertyDescriptor(
|
|
1407
|
-
const f =
|
|
1429
|
+
return Object.getOwnPropertyDescriptor(me, "size").get.call(e.proxy);
|
|
1430
|
+
const f = me[t];
|
|
1408
1431
|
if (f)
|
|
1409
1432
|
return f.bind(e.proxy);
|
|
1410
1433
|
}
|
|
1411
|
-
if (!
|
|
1412
|
-
const f =
|
|
1434
|
+
if (!se(c, t)) {
|
|
1435
|
+
const f = Tt(c, t);
|
|
1413
1436
|
return f ? "value" in f ? f.value : (
|
|
1414
1437
|
// !case: support for getter
|
|
1415
1438
|
(i = f.get) === null || i === void 0 ? void 0 : i.call(e.proxy)
|
|
1416
1439
|
) : void 0;
|
|
1417
1440
|
}
|
|
1418
1441
|
const a = c[t];
|
|
1419
|
-
if (e.options.strict &&
|
|
1442
|
+
if (e.options.strict && ge(a, e.options), e.finalized || !x(a, e.options))
|
|
1420
1443
|
return a;
|
|
1421
|
-
if (a ===
|
|
1422
|
-
if (S(e), e.copy[t] =
|
|
1444
|
+
if (a === Me(e.original, t)) {
|
|
1445
|
+
if (S(e), e.copy[t] = tt({
|
|
1423
1446
|
original: e.original[t],
|
|
1424
1447
|
parentDraft: e,
|
|
1425
1448
|
key: e.type === 1 ? Number(t) : t,
|
|
1426
1449
|
finalities: e.finalities,
|
|
1427
1450
|
options: e.options
|
|
1428
1451
|
}), typeof s == "function") {
|
|
1429
|
-
const f =
|
|
1430
|
-
return S(f),
|
|
1452
|
+
const f = h(e.copy[t]);
|
|
1453
|
+
return S(f), R(f), f.copy;
|
|
1431
1454
|
}
|
|
1432
1455
|
return e.copy[t];
|
|
1433
1456
|
}
|
|
1434
1457
|
return a;
|
|
1435
1458
|
},
|
|
1436
|
-
set(e, t,
|
|
1437
|
-
var
|
|
1459
|
+
set(e, t, n) {
|
|
1460
|
+
var r;
|
|
1438
1461
|
if (e.type === 3 || e.type === 2)
|
|
1439
1462
|
throw new Error("Map/Set draft does not support any property assignment.");
|
|
1440
1463
|
let i;
|
|
1441
1464
|
if (e.type === 1 && t !== "length" && !(Number.isInteger(i = Number(t)) && i >= 0 && (t === 0 || i === 0 || String(i) === String(t))))
|
|
1442
1465
|
throw new Error("Only supports setting array indices and the 'length' property.");
|
|
1443
|
-
const o =
|
|
1466
|
+
const o = Tt(E(e), t);
|
|
1444
1467
|
if (o?.set)
|
|
1445
|
-
return o.set.call(e.proxy,
|
|
1446
|
-
const s =
|
|
1447
|
-
return c && z(c.original,
|
|
1468
|
+
return o.set.call(e.proxy, n), !0;
|
|
1469
|
+
const s = Me(E(e), t), c = h(s);
|
|
1470
|
+
return c && z(c.original, n) ? (e.copy[t] = n, e.assignedMap = (r = e.assignedMap) !== null && r !== void 0 ? r : /* @__PURE__ */ new Map(), e.assignedMap.set(t, !1), !0) : (z(n, s) && (n !== void 0 || se(e.original, t)) || (S(e), R(e), se(e.original, t) && z(n, e.original[t]) ? e.assignedMap.delete(t) : e.assignedMap.set(t, !0), e.copy[t] = n, et(e, t, n, ue)), !0);
|
|
1448
1471
|
},
|
|
1449
1472
|
has(e, t) {
|
|
1450
|
-
return t in
|
|
1473
|
+
return t in E(e);
|
|
1451
1474
|
},
|
|
1452
1475
|
ownKeys(e) {
|
|
1453
|
-
return Reflect.ownKeys(
|
|
1476
|
+
return Reflect.ownKeys(E(e));
|
|
1454
1477
|
},
|
|
1455
1478
|
getOwnPropertyDescriptor(e, t) {
|
|
1456
|
-
const
|
|
1457
|
-
return
|
|
1479
|
+
const n = E(e), r = Reflect.getOwnPropertyDescriptor(n, t);
|
|
1480
|
+
return r && {
|
|
1458
1481
|
writable: !0,
|
|
1459
1482
|
configurable: e.type !== 1 || t !== "length",
|
|
1460
|
-
enumerable:
|
|
1461
|
-
value:
|
|
1483
|
+
enumerable: r.enumerable,
|
|
1484
|
+
value: n[t]
|
|
1462
1485
|
};
|
|
1463
1486
|
},
|
|
1464
1487
|
getPrototypeOf(e) {
|
|
@@ -1471,15 +1494,15 @@ const ps = Reflect.ownKeys(be), kt = /* @__PURE__ */ new WeakSet(), er = {
|
|
|
1471
1494
|
throw new Error("Cannot call 'defineProperty()' on drafts");
|
|
1472
1495
|
},
|
|
1473
1496
|
deleteProperty(e, t) {
|
|
1474
|
-
var
|
|
1475
|
-
return e.type === 1 ?
|
|
1497
|
+
var n;
|
|
1498
|
+
return e.type === 1 ? cn.set.call(this, e, t, void 0, e.proxy) : (Me(e.original, t) !== void 0 || t in e.original ? (S(e), R(e), e.assignedMap.set(t, !1)) : (e.assignedMap = (n = e.assignedMap) !== null && n !== void 0 ? n : /* @__PURE__ */ new Map(), e.assignedMap.delete(t)), e.copy && delete e.copy[t], !0);
|
|
1476
1499
|
}
|
|
1477
1500
|
};
|
|
1478
|
-
function
|
|
1479
|
-
const { original: t, parentDraft:
|
|
1501
|
+
function tt(e) {
|
|
1502
|
+
const { original: t, parentDraft: n, key: r, finalities: i, options: o } = e, s = Q(t), c = {
|
|
1480
1503
|
type: s,
|
|
1481
1504
|
finalized: !1,
|
|
1482
|
-
parent:
|
|
1505
|
+
parent: n,
|
|
1483
1506
|
original: t,
|
|
1484
1507
|
copy: null,
|
|
1485
1508
|
proxy: null,
|
|
@@ -1488,72 +1511,72 @@ function Ze(e) {
|
|
|
1488
1511
|
// Mapping of draft Set items to their corresponding draft values.
|
|
1489
1512
|
setMap: s === 3 ? new Map(t.entries()) : void 0
|
|
1490
1513
|
};
|
|
1491
|
-
(
|
|
1492
|
-
const { proxy: a, revoke: f } = Proxy.revocable(s === 1 ? Object.assign([], c) : c,
|
|
1493
|
-
if (i.revoke.push(f),
|
|
1494
|
-
const u =
|
|
1495
|
-
u.finalities.draft.push((l,
|
|
1496
|
-
var
|
|
1497
|
-
const
|
|
1498
|
-
let
|
|
1499
|
-
const
|
|
1500
|
-
if (
|
|
1501
|
-
let A =
|
|
1502
|
-
|
|
1514
|
+
(r || "key" in e) && (c.key = r);
|
|
1515
|
+
const { proxy: a, revoke: f } = Proxy.revocable(s === 1 ? Object.assign([], c) : c, cn);
|
|
1516
|
+
if (i.revoke.push(f), an.add(a), c.proxy = a, n) {
|
|
1517
|
+
const u = n;
|
|
1518
|
+
u.finalities.draft.push((l, p) => {
|
|
1519
|
+
var d, b;
|
|
1520
|
+
const w = h(a);
|
|
1521
|
+
let _ = u.type === 3 ? u.setMap : u.copy;
|
|
1522
|
+
const O = D(_, r), m = h(O);
|
|
1523
|
+
if (m) {
|
|
1524
|
+
let A = m.original;
|
|
1525
|
+
m.operated && (A = Qe(O)), De(m), Fe(m, ue, l, p), u.options.enableAutoFreeze && (u.options.updatedValues = (d = u.options.updatedValues) !== null && d !== void 0 ? d : /* @__PURE__ */ new WeakMap(), u.options.updatedValues.set(A, m.original)), pe(_, r, A);
|
|
1503
1526
|
}
|
|
1504
|
-
(
|
|
1505
|
-
A(l,
|
|
1527
|
+
(b = w.callbacks) === null || b === void 0 || b.forEach((A) => {
|
|
1528
|
+
A(l, p);
|
|
1506
1529
|
});
|
|
1507
1530
|
});
|
|
1508
1531
|
} else {
|
|
1509
|
-
const u =
|
|
1510
|
-
u.finalities.draft.push((l,
|
|
1511
|
-
|
|
1532
|
+
const u = h(a);
|
|
1533
|
+
u.finalities.draft.push((l, p) => {
|
|
1534
|
+
De(u), Fe(u, ue, l, p);
|
|
1512
1535
|
});
|
|
1513
1536
|
}
|
|
1514
1537
|
return a;
|
|
1515
1538
|
}
|
|
1516
|
-
|
|
1517
|
-
function
|
|
1539
|
+
Je.createDraft = tt;
|
|
1540
|
+
function _s(e, t, n, r, i) {
|
|
1518
1541
|
var o;
|
|
1519
|
-
const s =
|
|
1542
|
+
const s = h(e), c = (o = s?.original) !== null && o !== void 0 ? o : e, a = !!t.length;
|
|
1520
1543
|
if (s?.operated)
|
|
1521
1544
|
for (; s.finalities.draft.length > 0; )
|
|
1522
|
-
s.finalities.draft.pop()(
|
|
1545
|
+
s.finalities.draft.pop()(n, r);
|
|
1523
1546
|
const f = a ? t[0] : s ? s.operated ? s.copy : s.original : e;
|
|
1524
|
-
return s &&
|
|
1547
|
+
return s && ze(s), i && k(f, f, s?.options.updatedValues), [
|
|
1525
1548
|
f,
|
|
1526
|
-
|
|
1527
|
-
|
|
1549
|
+
n && a ? [{ op: v.Replace, path: [], value: t[0] }] : n,
|
|
1550
|
+
r && a ? [{ op: v.Replace, path: [], value: c }] : r
|
|
1528
1551
|
];
|
|
1529
1552
|
}
|
|
1530
|
-
function
|
|
1531
|
-
var
|
|
1532
|
-
const
|
|
1553
|
+
function Os(e, t) {
|
|
1554
|
+
var n;
|
|
1555
|
+
const r = {
|
|
1533
1556
|
draft: [],
|
|
1534
1557
|
revoke: [],
|
|
1535
1558
|
handledSet: /* @__PURE__ */ new WeakSet()
|
|
1536
1559
|
};
|
|
1537
1560
|
let i, o;
|
|
1538
1561
|
t.enablePatches && (i = [], o = []);
|
|
1539
|
-
const c = ((
|
|
1562
|
+
const c = ((n = t.mark) === null || n === void 0 ? void 0 : n.call(t, e, M)) === M.mutable || !x(e, t) ? e : tt({
|
|
1540
1563
|
original: e,
|
|
1541
1564
|
parentDraft: null,
|
|
1542
|
-
finalities:
|
|
1565
|
+
finalities: r,
|
|
1543
1566
|
options: t
|
|
1544
1567
|
});
|
|
1545
1568
|
return [
|
|
1546
1569
|
c,
|
|
1547
1570
|
(a = []) => {
|
|
1548
|
-
const [f, u, l] =
|
|
1571
|
+
const [f, u, l] = _s(c, a, i, o, t.enableAutoFreeze);
|
|
1549
1572
|
return t.enablePatches ? [f, u, l] : f;
|
|
1550
1573
|
}
|
|
1551
1574
|
];
|
|
1552
1575
|
}
|
|
1553
|
-
function
|
|
1554
|
-
const { rootDraft: t, value:
|
|
1555
|
-
|
|
1556
|
-
const a =
|
|
1576
|
+
function Ne(e) {
|
|
1577
|
+
const { rootDraft: t, value: n, useRawReturn: r = !1, isRoot: i = !0 } = e;
|
|
1578
|
+
ke(n, (o, s, c) => {
|
|
1579
|
+
const a = h(s);
|
|
1557
1580
|
if (a && t && a.finalities === t.finalities) {
|
|
1558
1581
|
e.isContainDraft = !0;
|
|
1559
1582
|
const f = a.original;
|
|
@@ -1561,257 +1584,217 @@ function ze(e) {
|
|
|
1561
1584
|
const u = Array.from(c);
|
|
1562
1585
|
c.clear(), u.forEach((l) => c.add(o === l ? f : l));
|
|
1563
1586
|
} else
|
|
1564
|
-
|
|
1565
|
-
} else typeof s == "object" && s !== null && (e.value = s, e.isRoot = !1,
|
|
1566
|
-
}), i && (e.isContainDraft || console.warn("The return value does not contain any draft, please use 'rawReturn()' to wrap the return value to improve performance."),
|
|
1587
|
+
pe(c, o, f);
|
|
1588
|
+
} else typeof s == "object" && s !== null && (e.value = s, e.isRoot = !1, Ne(e));
|
|
1589
|
+
}), i && (e.isContainDraft || console.warn("The return value does not contain any draft, please use 'rawReturn()' to wrap the return value to improve performance."), r && console.warn("The return value contains drafts, please don't use 'rawReturn()' to wrap the return value."));
|
|
1567
1590
|
}
|
|
1568
|
-
function
|
|
1591
|
+
function fn(e) {
|
|
1569
1592
|
var t;
|
|
1570
|
-
const
|
|
1571
|
-
if (!
|
|
1593
|
+
const n = h(e);
|
|
1594
|
+
if (!x(e, n?.options))
|
|
1572
1595
|
return e;
|
|
1573
|
-
const
|
|
1574
|
-
if (
|
|
1575
|
-
return
|
|
1596
|
+
const r = Q(e);
|
|
1597
|
+
if (n && !n.operated)
|
|
1598
|
+
return n.original;
|
|
1576
1599
|
let i;
|
|
1577
1600
|
function o() {
|
|
1578
|
-
i =
|
|
1601
|
+
i = r === 2 ? Ze(e) ? new Map(e) : new (Object.getPrototypeOf(e)).constructor(e) : r === 3 ? Array.from(n.setMap.values()) : on(e, n?.options);
|
|
1579
1602
|
}
|
|
1580
|
-
if (
|
|
1581
|
-
|
|
1603
|
+
if (n) {
|
|
1604
|
+
n.finalized = !0;
|
|
1582
1605
|
try {
|
|
1583
1606
|
o();
|
|
1584
1607
|
} finally {
|
|
1585
|
-
|
|
1608
|
+
n.finalized = !1;
|
|
1586
1609
|
}
|
|
1587
1610
|
} else
|
|
1588
1611
|
i = e;
|
|
1589
|
-
if (
|
|
1590
|
-
if (
|
|
1612
|
+
if (ke(i, (s, c) => {
|
|
1613
|
+
if (n && z(D(n.original, s), c))
|
|
1591
1614
|
return;
|
|
1592
|
-
const a =
|
|
1593
|
-
a !== c && (i === e && o(),
|
|
1594
|
-
}),
|
|
1595
|
-
const s = (t =
|
|
1596
|
-
return
|
|
1615
|
+
const a = fn(c);
|
|
1616
|
+
a !== c && (i === e && o(), pe(i, s, a));
|
|
1617
|
+
}), r === 3) {
|
|
1618
|
+
const s = (t = n?.original) !== null && t !== void 0 ? t : i;
|
|
1619
|
+
return Xe(s) ? new Set(i) : new (Object.getPrototypeOf(s)).constructor(i);
|
|
1597
1620
|
}
|
|
1598
1621
|
return i;
|
|
1599
1622
|
}
|
|
1600
|
-
function
|
|
1601
|
-
if (!
|
|
1623
|
+
function xt(e) {
|
|
1624
|
+
if (!Y(e))
|
|
1602
1625
|
throw new Error(`current() is only used for Draft, parameter: ${e}`);
|
|
1603
|
-
return
|
|
1626
|
+
return fn(e);
|
|
1604
1627
|
}
|
|
1605
|
-
const
|
|
1628
|
+
const Ss = (e) => function t(n, r, i) {
|
|
1606
1629
|
var o, s, c;
|
|
1607
|
-
if (typeof
|
|
1608
|
-
return function(
|
|
1609
|
-
return t(
|
|
1630
|
+
if (typeof n == "function" && typeof r != "function")
|
|
1631
|
+
return function(y, ...$) {
|
|
1632
|
+
return t(y, (U) => n.call(this, U, ...$), r);
|
|
1610
1633
|
};
|
|
1611
|
-
const a =
|
|
1634
|
+
const a = n, f = r;
|
|
1612
1635
|
let u = i;
|
|
1613
|
-
if (typeof
|
|
1636
|
+
if (typeof r != "function" && (u = r), u !== void 0 && Object.prototype.toString.call(u) !== "[object Object]")
|
|
1614
1637
|
throw new Error(`Invalid options: ${u}, 'options' should be an object.`);
|
|
1615
1638
|
u = Object.assign(Object.assign({}, e), u);
|
|
1616
|
-
const l =
|
|
1639
|
+
const l = Y(a) ? xt(a) : a, p = Array.isArray(u.mark) ? ((y, $) => {
|
|
1617
1640
|
for (const U of u.mark) {
|
|
1618
1641
|
if (typeof U != "function")
|
|
1619
1642
|
throw new Error(`Invalid mark: ${U}, 'mark' should be a function.`);
|
|
1620
|
-
const
|
|
1621
|
-
if (
|
|
1622
|
-
return
|
|
1643
|
+
const ee = U(y, $);
|
|
1644
|
+
if (ee)
|
|
1645
|
+
return ee;
|
|
1623
1646
|
}
|
|
1624
|
-
}) : u.mark,
|
|
1647
|
+
}) : u.mark, d = (o = u.enablePatches) !== null && o !== void 0 ? o : !1, b = (s = u.strict) !== null && s !== void 0 ? s : !1, _ = {
|
|
1625
1648
|
enableAutoFreeze: (c = u.enableAutoFreeze) !== null && c !== void 0 ? c : !1,
|
|
1626
|
-
mark:
|
|
1627
|
-
strict:
|
|
1628
|
-
enablePatches:
|
|
1649
|
+
mark: p,
|
|
1650
|
+
strict: b,
|
|
1651
|
+
enablePatches: d
|
|
1629
1652
|
};
|
|
1630
|
-
if (!
|
|
1653
|
+
if (!x(l, _) && typeof l == "object" && l !== null)
|
|
1631
1654
|
throw new Error("Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.");
|
|
1632
|
-
const [
|
|
1633
|
-
if (typeof
|
|
1634
|
-
if (!
|
|
1655
|
+
const [O, m] = Os(l, _);
|
|
1656
|
+
if (typeof r != "function") {
|
|
1657
|
+
if (!x(l, _))
|
|
1635
1658
|
throw new Error("Invalid base state: create() only supports plain objects, arrays, Set, Map or using mark() to mark the state as immutable.");
|
|
1636
|
-
return [
|
|
1659
|
+
return [O, m];
|
|
1637
1660
|
}
|
|
1638
1661
|
let A;
|
|
1639
1662
|
try {
|
|
1640
|
-
A = f(
|
|
1641
|
-
} catch (
|
|
1642
|
-
throw
|
|
1663
|
+
A = f(O);
|
|
1664
|
+
} catch (y) {
|
|
1665
|
+
throw ze(h(O)), y;
|
|
1643
1666
|
}
|
|
1644
|
-
const
|
|
1645
|
-
const $ =
|
|
1646
|
-
if (!
|
|
1647
|
-
if (
|
|
1667
|
+
const H = (y) => {
|
|
1668
|
+
const $ = h(O);
|
|
1669
|
+
if (!Y(y)) {
|
|
1670
|
+
if (y !== void 0 && !z(y, O) && $?.operated)
|
|
1648
1671
|
throw new Error("Either the value is returned as a new non-draft value, or only the draft is modified without returning any value.");
|
|
1649
|
-
const
|
|
1650
|
-
if (
|
|
1651
|
-
const
|
|
1652
|
-
return
|
|
1672
|
+
const ee = y?.[ls];
|
|
1673
|
+
if (ee) {
|
|
1674
|
+
const ln = ee[0];
|
|
1675
|
+
return _.strict && typeof y == "object" && y !== null && Ne({
|
|
1653
1676
|
rootDraft: $,
|
|
1654
|
-
value:
|
|
1677
|
+
value: y,
|
|
1655
1678
|
useRawReturn: !0
|
|
1656
|
-
}),
|
|
1679
|
+
}), m([ln]);
|
|
1657
1680
|
}
|
|
1658
|
-
if (
|
|
1659
|
-
return typeof
|
|
1681
|
+
if (y !== void 0)
|
|
1682
|
+
return typeof y == "object" && y !== null && Ne({ rootDraft: $, value: y }), m([y]);
|
|
1660
1683
|
}
|
|
1661
|
-
if (
|
|
1662
|
-
return
|
|
1663
|
-
const U =
|
|
1664
|
-
if (
|
|
1684
|
+
if (y === O || y === void 0)
|
|
1685
|
+
return m([]);
|
|
1686
|
+
const U = h(y);
|
|
1687
|
+
if (_ === U.options) {
|
|
1665
1688
|
if (U.operated)
|
|
1666
1689
|
throw new Error("Cannot return a modified child draft.");
|
|
1667
|
-
return
|
|
1690
|
+
return m([xt(y)]);
|
|
1668
1691
|
}
|
|
1669
|
-
return
|
|
1692
|
+
return m([y]);
|
|
1670
1693
|
};
|
|
1671
|
-
return A instanceof Promise ? A.then(
|
|
1672
|
-
throw
|
|
1673
|
-
}) :
|
|
1674
|
-
}, P =
|
|
1694
|
+
return A instanceof Promise ? A.then(H, (y) => {
|
|
1695
|
+
throw ze(h(O)), y;
|
|
1696
|
+
}) : H(A);
|
|
1697
|
+
}, P = Ss();
|
|
1675
1698
|
Object.prototype.constructor.toString();
|
|
1676
|
-
const
|
|
1677
|
-
let
|
|
1678
|
-
let t = "",
|
|
1699
|
+
const As = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
|
|
1700
|
+
let Es = (e = 21) => {
|
|
1701
|
+
let t = "", n = crypto.getRandomValues(new Uint8Array(e |= 0));
|
|
1679
1702
|
for (; e--; )
|
|
1680
|
-
t +=
|
|
1703
|
+
t += As[n[e] & 63];
|
|
1681
1704
|
return t;
|
|
1682
1705
|
};
|
|
1683
|
-
class
|
|
1706
|
+
class Ms {
|
|
1684
1707
|
age = 0;
|
|
1685
1708
|
capacity = 0;
|
|
1686
1709
|
storage = /* @__PURE__ */ new Map();
|
|
1687
|
-
constructor(t = 0,
|
|
1688
|
-
this.age = t, this.capacity =
|
|
1710
|
+
constructor(t = 0, n = 0) {
|
|
1711
|
+
this.age = t, this.capacity = n;
|
|
1689
1712
|
}
|
|
1690
1713
|
invalidate() {
|
|
1691
1714
|
this.storage.clear();
|
|
1692
1715
|
}
|
|
1693
|
-
reset(t,
|
|
1694
|
-
this.invalidate(), this.age = t, this.capacity =
|
|
1716
|
+
reset(t, n) {
|
|
1717
|
+
this.invalidate(), this.age = t, this.capacity = n;
|
|
1695
1718
|
}
|
|
1696
1719
|
get(t) {
|
|
1697
1720
|
if (this.capacity === 0) return;
|
|
1698
|
-
const
|
|
1699
|
-
if (
|
|
1700
|
-
if (Date.now() -
|
|
1721
|
+
const n = this.storage.get(t);
|
|
1722
|
+
if (n)
|
|
1723
|
+
if (Date.now() - n.ts > this.age) {
|
|
1701
1724
|
this.storage.delete(t);
|
|
1702
1725
|
return;
|
|
1703
1726
|
} else
|
|
1704
|
-
return
|
|
1727
|
+
return n.data;
|
|
1705
1728
|
}
|
|
1706
|
-
put(t,
|
|
1707
|
-
if (this.capacity > 0 && this.storage.set(t, { data:
|
|
1708
|
-
const
|
|
1709
|
-
this.storage.delete(
|
|
1729
|
+
put(t, n) {
|
|
1730
|
+
if (this.capacity > 0 && this.storage.set(t, { data: n, ts: Date.now() }), this.storage.size > this.capacity) {
|
|
1731
|
+
const r = [...this.storage.keys()].at(0);
|
|
1732
|
+
this.storage.delete(r);
|
|
1710
1733
|
}
|
|
1711
1734
|
}
|
|
1712
1735
|
remove(t) {
|
|
1713
1736
|
this.storage.delete(t);
|
|
1714
1737
|
}
|
|
1715
|
-
withCache = async (t,
|
|
1716
|
-
const
|
|
1717
|
-
return
|
|
1738
|
+
withCache = async (t, n) => {
|
|
1739
|
+
const r = this.get(t);
|
|
1740
|
+
return r || n().then((i) => (this.put(t, i), i));
|
|
1718
1741
|
};
|
|
1719
1742
|
}
|
|
1720
|
-
|
|
1721
|
-
|
|
1743
|
+
const ie = "CANCEL_RECOVERABLE", ne = "CANCELLED_BY_USER", Ts = (e) => {
|
|
1744
|
+
const t = pn(e);
|
|
1745
|
+
return K(() => (Bo(e, t.current) || (t.current = e), t.current), [e]);
|
|
1746
|
+
};
|
|
1747
|
+
function Ps(e, t, n) {
|
|
1748
|
+
return new Promise((r, i) => {
|
|
1749
|
+
const o = setTimeout(() => {
|
|
1750
|
+
t.removeEventListener("abort", s), r("WAIT_COMPLETE");
|
|
1751
|
+
}, e), s = () => {
|
|
1752
|
+
n?.(), clearTimeout(o), i(ie);
|
|
1753
|
+
};
|
|
1754
|
+
t.addEventListener("abort", s);
|
|
1755
|
+
});
|
|
1756
|
+
}
|
|
1757
|
+
const un = Object.freeze({
|
|
1758
|
+
items: /* @__PURE__ */ new Map(),
|
|
1759
|
+
context: {},
|
|
1760
|
+
fetchState: {
|
|
1761
|
+
isLoading: !1,
|
|
1762
|
+
errors: [],
|
|
1763
|
+
metadata: {}
|
|
1764
|
+
}
|
|
1765
|
+
});
|
|
1766
|
+
class B {
|
|
1767
|
+
constructor(t = "<none>", n) {
|
|
1768
|
+
this.id = t, this.config = n, this.setItems([]);
|
|
1769
|
+
const { caching: { age: r = 0, capacity: i = 0 } = { age: 0, capacity: 0 }, context: o } = n;
|
|
1770
|
+
this.state.context = o, this.fetchCache.reset(r, i);
|
|
1771
|
+
}
|
|
1722
1772
|
batched = !1;
|
|
1723
|
-
state =
|
|
1724
|
-
items: /* @__PURE__ */ new Map(),
|
|
1725
|
-
fetchState: {
|
|
1726
|
-
isLoading: !1,
|
|
1727
|
-
errors: [],
|
|
1728
|
-
metadata: {}
|
|
1729
|
-
}
|
|
1730
|
-
};
|
|
1731
|
-
options = { initialData: [] };
|
|
1773
|
+
state = un;
|
|
1732
1774
|
subscribers = /* @__PURE__ */ new Set();
|
|
1733
1775
|
controllers = /* @__PURE__ */ new Map();
|
|
1734
1776
|
fetchController = new AbortController();
|
|
1735
|
-
fetchCache = new
|
|
1736
|
-
|
|
1737
|
-
|
|
1738
|
-
const { initialData: n = [], caching: i } = r;
|
|
1739
|
-
this.setItems(n), this.fetchCache.reset(i?.age || 0, i?.capacity || 0);
|
|
1740
|
-
}
|
|
1741
|
-
getCacheKey(t) {
|
|
1742
|
-
return `[${this.id}, ${JSON.stringify(t)}]`;
|
|
1743
|
-
}
|
|
1744
|
-
customLog = (t = "log", ...r) => {
|
|
1745
|
-
};
|
|
1746
|
-
wait = (t, r) => new Promise((n, i) => {
|
|
1747
|
-
const o = () => {
|
|
1748
|
-
this.customLog("delay", "Fetch operation canceled due to debounce re-entry"), i("DEBOUNCE_CANCELLED");
|
|
1749
|
-
};
|
|
1750
|
-
r.addEventListener("abort", o), setTimeout(() => {
|
|
1751
|
-
r.removeEventListener("abort", o), n("");
|
|
1752
|
-
}, t);
|
|
1753
|
-
});
|
|
1754
|
-
batch = (t) => {
|
|
1755
|
-
this.batched = !0, t(), this.batched = !1, this.notify();
|
|
1756
|
-
};
|
|
1757
|
-
setItems = (t) => {
|
|
1758
|
-
const r = /* @__PURE__ */ new Map();
|
|
1759
|
-
t.forEach((n) => {
|
|
1760
|
-
r.set(n.id, {
|
|
1761
|
-
data: n,
|
|
1762
|
-
state: "idle",
|
|
1763
|
-
optimistic: !1,
|
|
1764
|
-
errors: []
|
|
1765
|
-
});
|
|
1766
|
-
}), this.state = P(this.state, (n) => {
|
|
1767
|
-
n.items = r;
|
|
1768
|
-
}), this.notify();
|
|
1769
|
-
};
|
|
1770
|
-
setMetadata = (t) => {
|
|
1771
|
-
this.state = P(this.state, (r) => {
|
|
1772
|
-
r.fetchState.metadata = t;
|
|
1773
|
-
}), this.notify();
|
|
1774
|
-
};
|
|
1775
|
-
remove = (t) => {
|
|
1776
|
-
this.state = P(this.state, (r) => {
|
|
1777
|
-
r.items.delete(t);
|
|
1778
|
-
}), this.notify();
|
|
1779
|
-
};
|
|
1780
|
-
updateItem = (t) => {
|
|
1781
|
-
this.state = P(this.state, (r) => {
|
|
1782
|
-
const n = r.items.get(t.id);
|
|
1783
|
-
n && (Zo(n, "data", t), this.notify());
|
|
1784
|
-
});
|
|
1785
|
-
};
|
|
1786
|
-
clearFetchCache = (t) => {
|
|
1787
|
-
this.fetchCache.remove(this.getCacheKey(t));
|
|
1788
|
-
};
|
|
1789
|
-
startFetch = () => {
|
|
1790
|
-
this.fetchController.abort(), this.state = P(this.state, (t) => {
|
|
1791
|
-
t.fetchState.isLoading = !0;
|
|
1792
|
-
}), this.fetchController = new AbortController(), this.notify();
|
|
1793
|
-
};
|
|
1794
|
-
endFetch = (t = []) => {
|
|
1795
|
-
this.state = P(this.state, (r) => {
|
|
1796
|
-
r.fetchState.isLoading = !1, r.fetchState.errors = t;
|
|
1797
|
-
}), this.notify();
|
|
1798
|
-
};
|
|
1799
|
-
executeFetch = async (t, r) => {
|
|
1800
|
-
const n = this.getCacheKey(t);
|
|
1777
|
+
fetchCache = new Ms();
|
|
1778
|
+
executeFetch = async (t) => {
|
|
1779
|
+
const { fetch: n } = this.config, r = this.getCacheKey();
|
|
1801
1780
|
this.startFetch();
|
|
1802
1781
|
try {
|
|
1803
1782
|
let i = null;
|
|
1804
|
-
|
|
1783
|
+
n ? i = await this.fetchCache.withCache(r, async () => (await Ps(this.config.debounce || 0, this.fetchController.signal, () => {
|
|
1784
|
+
this.customLog("delay", "Fetch operation canceled due to debounce re-entry");
|
|
1785
|
+
}), this.customLog("fetch execution", "Executing fetch function"), n({
|
|
1805
1786
|
signal: this.fetchController.signal,
|
|
1806
1787
|
context: t
|
|
1807
1788
|
}))) : i = { items: [], metadata: {} }, this.batch(() => {
|
|
1808
|
-
this.setItems(i.items), this.setMetadata(i.metadata), this.endFetch();
|
|
1789
|
+
this.setItems(i.items), this.setMetadata(i.metadata), this.setContext(t), this.endFetch();
|
|
1809
1790
|
});
|
|
1810
1791
|
} catch (i) {
|
|
1811
|
-
if (i === "
|
|
1792
|
+
if (i.name === "AbortError" || i === ie) {
|
|
1793
|
+
this.customLog("fetch exception", "Fetch operation was cancelled by client");
|
|
1812
1794
|
return;
|
|
1813
|
-
|
|
1814
|
-
|
|
1795
|
+
}
|
|
1796
|
+
if (i === ne) {
|
|
1797
|
+
this.customLog("fetch exception", "Fetch operation was cancelled by user"), this.endFetch();
|
|
1815
1798
|
return;
|
|
1816
1799
|
}
|
|
1817
1800
|
this.batch(() => {
|
|
@@ -1819,73 +1802,84 @@ class K {
|
|
|
1819
1802
|
});
|
|
1820
1803
|
}
|
|
1821
1804
|
};
|
|
1822
|
-
executeRemove = async (t
|
|
1823
|
-
const i = this.startTransition({
|
|
1824
|
-
id: t.
|
|
1825
|
-
input: t
|
|
1805
|
+
executeRemove = async (t) => {
|
|
1806
|
+
const { context: n } = this.state, { remove: r } = this.config, i = this.startTransition({
|
|
1807
|
+
id: t.id,
|
|
1808
|
+
input: t,
|
|
1826
1809
|
state: "delete"
|
|
1827
1810
|
});
|
|
1828
|
-
if (
|
|
1811
|
+
if (r)
|
|
1829
1812
|
try {
|
|
1830
|
-
await
|
|
1813
|
+
await r(t, { signal: i.signal, context: n }), this.remove(t.id), this.startTransition({ id: t.id, state: "idle" });
|
|
1831
1814
|
} catch (o) {
|
|
1832
|
-
if (o.name === "AbortError")
|
|
1833
|
-
|
|
1834
|
-
const c = s.items.get(t.data.id);
|
|
1835
|
-
c && (c.state = "idle", c.action = void 0, c.errors = []);
|
|
1836
|
-
}), this.notify(), o;
|
|
1815
|
+
if (o.name === "AbortError" || o === ie || o === ne)
|
|
1816
|
+
return;
|
|
1837
1817
|
this.startTransition({
|
|
1838
|
-
id: t.
|
|
1839
|
-
input: t
|
|
1818
|
+
id: t.id,
|
|
1819
|
+
input: t,
|
|
1840
1820
|
state: "delete",
|
|
1841
1821
|
errors: [o.message]
|
|
1842
1822
|
});
|
|
1843
1823
|
}
|
|
1844
1824
|
else
|
|
1845
|
-
this.
|
|
1846
|
-
|
|
1825
|
+
this.batch(() => {
|
|
1826
|
+
this.remove(t.id), this.startTransition({ id: t.id, fromState: "delete", state: "idle" });
|
|
1827
|
+
});
|
|
1828
|
+
this.fetchCache.remove(this.getCacheKey());
|
|
1847
1829
|
};
|
|
1848
|
-
executeUpdate = async (
|
|
1849
|
-
|
|
1850
|
-
|
|
1851
|
-
|
|
1852
|
-
|
|
1853
|
-
|
|
1830
|
+
executeUpdate = async ({
|
|
1831
|
+
item: t,
|
|
1832
|
+
updater: n = Ke,
|
|
1833
|
+
isOptimistic: r = !1,
|
|
1834
|
+
skipSave: i = !1,
|
|
1835
|
+
tag: o = void 0
|
|
1836
|
+
// for multiple parallel updates use tags
|
|
1837
|
+
}) => {
|
|
1838
|
+
const { context: s } = this.state, { update: c } = this.config, a = t.id;
|
|
1839
|
+
if (this.state.items.has(a)) {
|
|
1840
|
+
const f = this.state.items.get(a).data, u = P(f, n), l = this.startTransition({
|
|
1841
|
+
id: a,
|
|
1842
|
+
input: u,
|
|
1854
1843
|
state: "update",
|
|
1855
|
-
isOptimistic:
|
|
1844
|
+
isOptimistic: r,
|
|
1845
|
+
tag: o
|
|
1856
1846
|
});
|
|
1857
|
-
if (
|
|
1847
|
+
if (r && this.updateItem(u), c && !i)
|
|
1858
1848
|
try {
|
|
1859
|
-
await
|
|
1860
|
-
} catch (
|
|
1861
|
-
if (
|
|
1862
|
-
|
|
1849
|
+
await c(u, { signal: l.signal, context: s }), this.updateItem(u), this.startTransition({ id: a, state: "idle", fromState: "update", tag: o });
|
|
1850
|
+
} catch (p) {
|
|
1851
|
+
if (p.name === "AbortError" || p === ie)
|
|
1852
|
+
return;
|
|
1853
|
+
if (p === ne) {
|
|
1854
|
+
this.batch(() => {
|
|
1855
|
+
this.updateItem(f), this.startTransition({ id: u.id, state: "idle", fromState: "update", tag: o });
|
|
1856
|
+
});
|
|
1863
1857
|
return;
|
|
1864
1858
|
}
|
|
1865
1859
|
this.startTransition({
|
|
1866
|
-
id:
|
|
1867
|
-
input:
|
|
1868
|
-
state: "
|
|
1869
|
-
errors: [
|
|
1860
|
+
id: a,
|
|
1861
|
+
input: u,
|
|
1862
|
+
state: "update",
|
|
1863
|
+
errors: [p.message],
|
|
1864
|
+
tag: o
|
|
1870
1865
|
});
|
|
1871
1866
|
}
|
|
1872
1867
|
else
|
|
1873
|
-
this.updateItem(
|
|
1874
|
-
this.fetchCache.remove(this.getCacheKey(
|
|
1868
|
+
this.updateItem(u), this.startTransition({ id: a, state: "changed", tag: o });
|
|
1869
|
+
this.fetchCache.remove(this.getCacheKey());
|
|
1875
1870
|
}
|
|
1876
1871
|
};
|
|
1877
|
-
executeCreate = async (t
|
|
1878
|
-
const i = `create_${
|
|
1872
|
+
executeCreate = async (t) => {
|
|
1873
|
+
const { context: n } = this.state, { create: r } = this.config, i = `create_${Es(8)}`, o = { ...t, id: i }, s = (a) => {
|
|
1879
1874
|
this.state = P(this.state, (f) => {
|
|
1880
1875
|
const u = {
|
|
1881
|
-
data: { ...
|
|
1882
|
-
errors:
|
|
1876
|
+
data: { ...t, id: i },
|
|
1877
|
+
errors: /* @__PURE__ */ new Map(),
|
|
1883
1878
|
optimistic: !0,
|
|
1884
1879
|
// always true for create
|
|
1885
|
-
|
|
1886
|
-
action: ["create", o]
|
|
1880
|
+
transitions: /* @__PURE__ */ new Map([["default", ["create", t, Date.now()]]])
|
|
1887
1881
|
};
|
|
1888
|
-
f.items.set(
|
|
1882
|
+
f.items.set(i, u);
|
|
1889
1883
|
}), this.notify();
|
|
1890
1884
|
};
|
|
1891
1885
|
s();
|
|
@@ -1896,27 +1890,28 @@ class K {
|
|
|
1896
1890
|
isOptimistic: !0,
|
|
1897
1891
|
errors: []
|
|
1898
1892
|
});
|
|
1899
|
-
if (
|
|
1893
|
+
if (r)
|
|
1900
1894
|
try {
|
|
1901
|
-
const { id: a } = await
|
|
1895
|
+
const { id: a } = await r(t, {
|
|
1902
1896
|
signal: c.signal,
|
|
1903
|
-
context:
|
|
1897
|
+
context: n
|
|
1904
1898
|
});
|
|
1905
|
-
if (
|
|
1906
|
-
|
|
1907
|
-
|
|
1908
|
-
|
|
1909
|
-
|
|
1910
|
-
|
|
1911
|
-
|
|
1912
|
-
})
|
|
1913
|
-
|
|
1914
|
-
|
|
1915
|
-
}
|
|
1916
|
-
s(a), this.startTransition({ id: a, state: "idle" });
|
|
1899
|
+
if (!a)
|
|
1900
|
+
throw new Error("create action must return id of the created item");
|
|
1901
|
+
const f = /* @__PURE__ */ new Map();
|
|
1902
|
+
this.state.items.forEach((u, l) => {
|
|
1903
|
+
l === i ? (f.delete(i), f.set(a, {
|
|
1904
|
+
...u,
|
|
1905
|
+
data: { ...u.data, id: a }
|
|
1906
|
+
})) : f.set(l, u);
|
|
1907
|
+
}), this.state = P(this.state, (u) => {
|
|
1908
|
+
u.items = f;
|
|
1909
|
+
}), this.startTransition({ id: a, state: "idle", fromState: "create" });
|
|
1917
1910
|
} catch (a) {
|
|
1918
|
-
if (a.name === "AbortError")
|
|
1919
|
-
|
|
1911
|
+
if (a.name === "AbortError" || a === ie)
|
|
1912
|
+
return;
|
|
1913
|
+
if (a === ne) {
|
|
1914
|
+
this.remove(i);
|
|
1920
1915
|
return;
|
|
1921
1916
|
}
|
|
1922
1917
|
this.startTransition({
|
|
@@ -1928,26 +1923,91 @@ class K {
|
|
|
1928
1923
|
}
|
|
1929
1924
|
else
|
|
1930
1925
|
s(), this.startTransition({ id: i, state: "idle" });
|
|
1931
|
-
this.fetchCache.remove(this.getCacheKey(
|
|
1926
|
+
this.fetchCache.remove(this.getCacheKey());
|
|
1932
1927
|
};
|
|
1933
|
-
|
|
1934
|
-
|
|
1935
|
-
|
|
1936
|
-
|
|
1937
|
-
|
|
1938
|
-
|
|
1939
|
-
}
|
|
1940
|
-
|
|
1941
|
-
|
|
1942
|
-
|
|
1943
|
-
|
|
1944
|
-
|
|
1928
|
+
getCacheKey() {
|
|
1929
|
+
const { context: t } = this.state;
|
|
1930
|
+
return `[${this.id}, ${JSON.stringify(t)}]`;
|
|
1931
|
+
}
|
|
1932
|
+
getControlerId = (t, n) => Et(wt([t, n === "default" ? null : n]), ":");
|
|
1933
|
+
customLog = (t = "log", ...n) => {
|
|
1934
|
+
};
|
|
1935
|
+
batch = (t) => {
|
|
1936
|
+
this.batched = !0, t(), this.batched = !1, this.notify();
|
|
1937
|
+
};
|
|
1938
|
+
setItems = (t) => {
|
|
1939
|
+
if (new Set(No(t, "id")).size !== Ie(t))
|
|
1940
|
+
throw new Error("Missing `id` prop on one or more items");
|
|
1941
|
+
const r = /* @__PURE__ */ new Map();
|
|
1942
|
+
t.forEach((i) => {
|
|
1943
|
+
i.id = `${i.id}`, r.set(i.id, {
|
|
1944
|
+
data: i,
|
|
1945
|
+
optimistic: !1,
|
|
1946
|
+
errors: /* @__PURE__ */ new Map(),
|
|
1947
|
+
transitions: /* @__PURE__ */ new Map()
|
|
1948
|
+
});
|
|
1949
|
+
}), this.state = P(this.state, (i) => {
|
|
1950
|
+
i.items = r;
|
|
1951
|
+
}), this.notify();
|
|
1952
|
+
};
|
|
1953
|
+
setMetadata = (t) => {
|
|
1954
|
+
this.state = P(this.state, (n) => {
|
|
1955
|
+
n.fetchState.metadata = t;
|
|
1956
|
+
}), this.notify();
|
|
1957
|
+
};
|
|
1958
|
+
setContext = (t) => {
|
|
1959
|
+
this.state = P(this.state, (n) => {
|
|
1960
|
+
n.context = t;
|
|
1961
|
+
}), this.notify();
|
|
1962
|
+
};
|
|
1963
|
+
remove = (t) => {
|
|
1964
|
+
this.state = P(this.state, (n) => {
|
|
1965
|
+
n.items.delete(t);
|
|
1966
|
+
}), this.notify();
|
|
1967
|
+
};
|
|
1968
|
+
updateItem = (t) => {
|
|
1969
|
+
this.state = P(this.state, (n) => {
|
|
1970
|
+
const r = n.items.get(t.id);
|
|
1971
|
+
r && (ss(r, "data", t), this.notify());
|
|
1972
|
+
});
|
|
1973
|
+
};
|
|
1974
|
+
clearFetchCache = () => {
|
|
1975
|
+
this.fetchCache.remove(this.getCacheKey());
|
|
1976
|
+
};
|
|
1977
|
+
startFetch = () => {
|
|
1978
|
+
this.fetchController.abort(), this.state = P(this.state, (t) => {
|
|
1979
|
+
t.fetchState.isLoading = !0;
|
|
1980
|
+
}), this.fetchController = new AbortController(), this.notify();
|
|
1981
|
+
};
|
|
1982
|
+
endFetch = (t = []) => {
|
|
1983
|
+
this.state = P(this.state, (n) => {
|
|
1984
|
+
n.fetchState.isLoading = !1, n.fetchState.errors = t;
|
|
1985
|
+
}), this.notify();
|
|
1945
1986
|
};
|
|
1946
1987
|
cancelFetch = () => {
|
|
1947
1988
|
this.fetchController.abort();
|
|
1948
1989
|
};
|
|
1949
|
-
cancelOperation = (t) => {
|
|
1950
|
-
this.
|
|
1990
|
+
cancelOperation = (t, n) => {
|
|
1991
|
+
const r = this.getControlerId(t, n);
|
|
1992
|
+
this.controllers.get(r)?.abort(ne);
|
|
1993
|
+
};
|
|
1994
|
+
startTransition = ({
|
|
1995
|
+
id: t,
|
|
1996
|
+
input: n = void 0,
|
|
1997
|
+
state: r,
|
|
1998
|
+
fromState: i = r,
|
|
1999
|
+
// only required for parallel updates
|
|
2000
|
+
isOptimistic: o = !1,
|
|
2001
|
+
errors: s = [],
|
|
2002
|
+
tag: c = "default"
|
|
2003
|
+
}) => {
|
|
2004
|
+
const a = new AbortController(), f = this.getControlerId(t, c);
|
|
2005
|
+
return this.state.items.has(t) && (this.controllers.get(f)?.abort(), this.controllers.set(f, a), this.state = P(this.state, (u) => {
|
|
2006
|
+
const l = u.items.get(t);
|
|
2007
|
+
l.optimistic = o;
|
|
2008
|
+
const p = Et(wt([i, c === "default" ? null : c]), ":");
|
|
2009
|
+
r === "idle" ? l.errors.delete(p) : Ie(s) > 0 && l.errors.set(p, s), r === "idle" ? l.transitions.delete(c) : l.transitions.set(c, [r, n, Date.now()]);
|
|
2010
|
+
}), this.notify()), a;
|
|
1951
2011
|
};
|
|
1952
2012
|
notify = () => {
|
|
1953
2013
|
this.subscribers.forEach((t) => {
|
|
@@ -1960,150 +2020,116 @@ class K {
|
|
|
1960
2020
|
});
|
|
1961
2021
|
static instances = /* @__PURE__ */ new Map();
|
|
1962
2022
|
static createStore(t) {
|
|
1963
|
-
const { id:
|
|
1964
|
-
return
|
|
2023
|
+
const { id: n } = t;
|
|
2024
|
+
return B.instances.has(n) || B.instances.set(n, new B(n, t)), B.instances.get(n);
|
|
1965
2025
|
}
|
|
1966
2026
|
}
|
|
1967
|
-
|
|
1968
|
-
const t =
|
|
1969
|
-
|
|
1970
|
-
|
|
1971
|
-
|
|
1972
|
-
|
|
1973
|
-
|
|
1974
|
-
|
|
1975
|
-
|
|
1976
|
-
|
|
1977
|
-
|
|
1978
|
-
|
|
1979
|
-
p.clearFetchCache(r), p.executeFetch(r, t.current.fetch);
|
|
1980
|
-
}, [r, n]), s = T(
|
|
1981
|
-
(p) => {
|
|
1982
|
-
n().executeCreate(r, p, t.current.create);
|
|
1983
|
-
},
|
|
1984
|
-
[r, n]
|
|
1985
|
-
), c = T(
|
|
1986
|
-
(p, y) => {
|
|
1987
|
-
n().executeUpdate(p, r, y, void 0, !0);
|
|
2027
|
+
function xs(e) {
|
|
2028
|
+
const t = B.createStore(e), n = dn(
|
|
2029
|
+
t.subscribe,
|
|
2030
|
+
t.getSnapshot,
|
|
2031
|
+
e.getServerSnapshot || (() => un)
|
|
2032
|
+
), r = Ts(e.context), i = C(() => {
|
|
2033
|
+
t.clearFetchCache(), t.executeFetch(r);
|
|
2034
|
+
}, [t, r]), o = C(() => {
|
|
2035
|
+
t.cancelFetch();
|
|
2036
|
+
}, [t]), s = C(
|
|
2037
|
+
(d, b) => {
|
|
2038
|
+
t.cancelOperation(d, b);
|
|
1988
2039
|
},
|
|
1989
|
-
[
|
|
1990
|
-
),
|
|
1991
|
-
(
|
|
1992
|
-
|
|
1993
|
-
y.getSnapshot().items.get(p.data.id) && t.current.update ? y.executeUpdate(p, r, Rt, t.current.update) : y.customLog("save", "Non existent item or update function does not exist in config");
|
|
2040
|
+
[t]
|
|
2041
|
+
), c = C(
|
|
2042
|
+
(d) => {
|
|
2043
|
+
t.executeCreate(d);
|
|
1994
2044
|
},
|
|
1995
|
-
[
|
|
1996
|
-
),
|
|
1997
|
-
(
|
|
1998
|
-
|
|
2045
|
+
[t]
|
|
2046
|
+
), a = C(
|
|
2047
|
+
(d) => {
|
|
2048
|
+
t.executeRemove(d);
|
|
1999
2049
|
},
|
|
2000
|
-
[
|
|
2001
|
-
),
|
|
2002
|
-
(
|
|
2003
|
-
|
|
2050
|
+
[t]
|
|
2051
|
+
), f = C(
|
|
2052
|
+
(d) => {
|
|
2053
|
+
t.executeFetch(d);
|
|
2004
2054
|
},
|
|
2005
|
-
[
|
|
2006
|
-
), l = T(
|
|
2007
|
-
(p) => {
|
|
2008
|
-
const y = n();
|
|
2009
|
-
if (p.action) {
|
|
2010
|
-
const [w, v] = p.action;
|
|
2011
|
-
switch (w) {
|
|
2012
|
-
case "create":
|
|
2013
|
-
y.executeCreate(r, v, t.current.create);
|
|
2014
|
-
break;
|
|
2015
|
-
case "delete":
|
|
2016
|
-
y.executeRemove(
|
|
2017
|
-
{ data: v, state: "idle", errors: [], optimistic: !1 },
|
|
2018
|
-
r,
|
|
2019
|
-
t.current.remove
|
|
2020
|
-
);
|
|
2021
|
-
break;
|
|
2022
|
-
case "update":
|
|
2023
|
-
y.executeUpdate(
|
|
2024
|
-
{ data: v, state: "idle", optimistic: !1, errors: [] },
|
|
2025
|
-
r,
|
|
2026
|
-
() => v,
|
|
2027
|
-
t.current.update
|
|
2028
|
-
);
|
|
2029
|
-
break;
|
|
2030
|
-
}
|
|
2031
|
-
y.executeRemove(p, r, t.current.remove);
|
|
2032
|
-
}
|
|
2033
|
-
},
|
|
2034
|
-
[r, n]
|
|
2035
|
-
), h = T(() => {
|
|
2036
|
-
n().cancelFetch();
|
|
2037
|
-
}, [n]), m = T(
|
|
2038
|
-
(p) => {
|
|
2039
|
-
n().cancelOperation(p);
|
|
2040
|
-
},
|
|
2041
|
-
[n]
|
|
2055
|
+
[t]
|
|
2042
2056
|
);
|
|
2043
|
-
|
|
2044
|
-
|
|
2045
|
-
|
|
2046
|
-
|
|
2047
|
-
update: f,
|
|
2048
|
-
change: c,
|
|
2049
|
-
save: a,
|
|
2050
|
-
retry: l,
|
|
2051
|
-
remove: u,
|
|
2052
|
-
cancelFetch: h,
|
|
2053
|
-
cancelOperation: m
|
|
2054
|
-
};
|
|
2055
|
-
}
|
|
2056
|
-
function _s(e) {
|
|
2057
|
-
const t = le(
|
|
2058
|
-
() => K.createStore({
|
|
2059
|
-
id: e.id,
|
|
2060
|
-
initialData: [],
|
|
2061
|
-
caching: e.caching,
|
|
2062
|
-
debounce: e.debounce
|
|
2063
|
-
}),
|
|
2064
|
-
[e.id, e.caching, e.debounce]
|
|
2065
|
-
), { fetch: r, create: n, update: i, change: o, save: s, retry: c, remove: a, cancelOperation: f, cancelFetch: u } = vs(e), l = ir(t.subscribe, t.getSnapshot, e.getServerSnapshot), h = rr(e.context);
|
|
2066
|
-
or(() => {
|
|
2067
|
-
r();
|
|
2068
|
-
}, [e.id, h]);
|
|
2069
|
-
const m = le(() => [...l.items.values()], [l.items]), p = le(
|
|
2057
|
+
hn(() => {
|
|
2058
|
+
f(r);
|
|
2059
|
+
}, [f, r]);
|
|
2060
|
+
const u = K(() => [...n.items.values()], [n.items]), l = Ie(n.fetchState.errors) > 0 || us(u, (d) => d.errors.size > 0), p = K(
|
|
2070
2061
|
() => ({
|
|
2071
|
-
itemsById:
|
|
2072
|
-
items:
|
|
2073
|
-
|
|
2074
|
-
|
|
2075
|
-
|
|
2076
|
-
|
|
2077
|
-
|
|
2078
|
-
|
|
2079
|
-
change: o,
|
|
2080
|
-
retry: c,
|
|
2081
|
-
save: s,
|
|
2062
|
+
itemsById: n.items,
|
|
2063
|
+
items: u,
|
|
2064
|
+
fetchState: n.fetchState,
|
|
2065
|
+
hasError: l,
|
|
2066
|
+
cancelFetch: o,
|
|
2067
|
+
cancelOperation: s,
|
|
2068
|
+
refetch: i,
|
|
2069
|
+
create: c,
|
|
2082
2070
|
remove: a,
|
|
2083
|
-
|
|
2084
|
-
cancelOperation: f
|
|
2071
|
+
store: t
|
|
2085
2072
|
}),
|
|
2086
2073
|
[
|
|
2087
|
-
|
|
2088
|
-
|
|
2089
|
-
|
|
2090
|
-
|
|
2091
|
-
m,
|
|
2092
|
-
n,
|
|
2093
|
-
i,
|
|
2094
|
-
c,
|
|
2074
|
+
t,
|
|
2075
|
+
n.items,
|
|
2076
|
+
n.fetchState,
|
|
2077
|
+
u,
|
|
2095
2078
|
o,
|
|
2096
2079
|
s,
|
|
2080
|
+
i,
|
|
2081
|
+
c,
|
|
2097
2082
|
a,
|
|
2098
|
-
|
|
2099
|
-
f
|
|
2083
|
+
l
|
|
2100
2084
|
]
|
|
2101
2085
|
);
|
|
2102
2086
|
return t.customLog("snapshot", p), p;
|
|
2103
2087
|
}
|
|
2088
|
+
function Rs(e, t) {
|
|
2089
|
+
const n = B.instances.get(e), r = K(() => t.data, [t.data]), i = K(() => t.transitions, [t.transitions]), o = C(
|
|
2090
|
+
(d, { tag: b, isOptimistic: w = !1 } = {}) => {
|
|
2091
|
+
n.executeUpdate({ item: r, updater: d, tag: b, isOptimistic: w });
|
|
2092
|
+
},
|
|
2093
|
+
[r, n]
|
|
2094
|
+
), s = C(() => {
|
|
2095
|
+
n.executeRemove(r);
|
|
2096
|
+
}, [r, n]), c = C(
|
|
2097
|
+
(d, b) => {
|
|
2098
|
+
n.executeUpdate({ item: r, updater: d, isOptimistic: !0, skipSave: !0, tag: b });
|
|
2099
|
+
},
|
|
2100
|
+
[r, n]
|
|
2101
|
+
), a = C(() => {
|
|
2102
|
+
n.executeUpdate({ item: r, updater: Ke, isOptimistic: !1 });
|
|
2103
|
+
}, [r, n]), f = C(
|
|
2104
|
+
(d) => {
|
|
2105
|
+
n.cancelOperation(r.id, d);
|
|
2106
|
+
},
|
|
2107
|
+
[n, r.id]
|
|
2108
|
+
), u = K(() => {
|
|
2109
|
+
const d = /* @__PURE__ */ new Set();
|
|
2110
|
+
return i.forEach((b, w) => {
|
|
2111
|
+
const [_] = b;
|
|
2112
|
+
d.add(`${_}${w === "default" ? "" : `:${w}`}`);
|
|
2113
|
+
}), d;
|
|
2114
|
+
}, [i]), l = K(() => t.errors.size > 0, [t.errors]), p = K(() => t.errors.size, [t.errors]);
|
|
2115
|
+
return [
|
|
2116
|
+
r,
|
|
2117
|
+
{
|
|
2118
|
+
update: o,
|
|
2119
|
+
change: c,
|
|
2120
|
+
save: a,
|
|
2121
|
+
remove: s,
|
|
2122
|
+
cancel: f,
|
|
2123
|
+
errors: t.errors,
|
|
2124
|
+
errorCount: p,
|
|
2125
|
+
hasError: l,
|
|
2126
|
+
states: u,
|
|
2127
|
+
itemWithState: t,
|
|
2128
|
+
store: n
|
|
2129
|
+
}
|
|
2130
|
+
];
|
|
2131
|
+
}
|
|
2104
2132
|
export {
|
|
2105
|
-
|
|
2106
|
-
|
|
2107
|
-
vs as useCrudOperations,
|
|
2108
|
-
rr as useMemoDeepEquals
|
|
2133
|
+
xs as useCrud,
|
|
2134
|
+
Rs as useItemState
|
|
2109
2135
|
};
|