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