yann-useorderfun 0.3.2 → 1.0.0
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 +34 -0
- package/dist/index.js +668 -741
- package/dist/index.umd.cjs +2 -0
- package/index.d.ts +83 -83
- package/package.json +18 -12
- package/dist/index.umd.js +0 -2
package/dist/index.js
CHANGED
|
@@ -1,60 +1,111 @@
|
|
|
1
|
-
/*! yann-useorderfun
|
|
2
|
-
import { isRef as
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
1
|
+
/*! yann-useorderfun v1.0.0 by Yann */
|
|
2
|
+
import { isRef as zt, shallowRef as Z, ref as ve, getCurrentScope as ye, onScopeDispose as $e, readonly as H, watch as _e, triggerRef as Q } from "vue";
|
|
3
|
+
function Te() {
|
|
4
|
+
this.__data__ = [], this.size = 0;
|
|
5
|
+
}
|
|
6
|
+
function Kt(t, e) {
|
|
7
|
+
return t === e || t !== t && e !== e;
|
|
8
|
+
}
|
|
9
|
+
function W(t, e) {
|
|
10
|
+
for (var r = t.length; r--; )
|
|
11
|
+
if (Kt(t[r][0], e))
|
|
12
|
+
return r;
|
|
13
|
+
return -1;
|
|
14
|
+
}
|
|
15
|
+
var me = Array.prototype, je = me.splice;
|
|
16
|
+
function we(t) {
|
|
17
|
+
var e = this.__data__, r = W(e, t);
|
|
18
|
+
if (r < 0)
|
|
19
|
+
return !1;
|
|
20
|
+
var o = e.length - 1;
|
|
21
|
+
return r == o ? e.pop() : je.call(e, r, 1), --this.size, !0;
|
|
22
|
+
}
|
|
23
|
+
function Oe(t) {
|
|
24
|
+
var e = this.__data__, r = W(e, t);
|
|
25
|
+
return r < 0 ? void 0 : e[r][1];
|
|
26
|
+
}
|
|
27
|
+
function Ae(t) {
|
|
28
|
+
return W(this.__data__, t) > -1;
|
|
29
|
+
}
|
|
30
|
+
function Se(t, e) {
|
|
31
|
+
var r = this.__data__, o = W(r, t);
|
|
32
|
+
return o < 0 ? (++this.size, r.push([t, e])) : r[o][1] = e, this;
|
|
33
|
+
}
|
|
34
|
+
function m(t) {
|
|
35
|
+
var e = -1, r = t == null ? 0 : t.length;
|
|
36
|
+
for (this.clear(); ++e < r; ) {
|
|
37
|
+
var o = t[e];
|
|
38
|
+
this.set(o[0], o[1]);
|
|
39
|
+
}
|
|
40
|
+
}
|
|
41
|
+
m.prototype.clear = Te;
|
|
42
|
+
m.prototype.delete = we;
|
|
43
|
+
m.prototype.get = Oe;
|
|
44
|
+
m.prototype.has = Ae;
|
|
45
|
+
m.prototype.set = Se;
|
|
46
|
+
function xe() {
|
|
47
|
+
this.__data__ = new m(), this.size = 0;
|
|
48
|
+
}
|
|
49
|
+
function Pe(t) {
|
|
50
|
+
var e = this.__data__, r = e.delete(t);
|
|
51
|
+
return this.size = e.size, r;
|
|
52
|
+
}
|
|
53
|
+
function Ee(t) {
|
|
54
|
+
return this.__data__.get(t);
|
|
55
|
+
}
|
|
56
|
+
function Ce(t) {
|
|
57
|
+
return this.__data__.has(t);
|
|
58
|
+
}
|
|
59
|
+
var Ie = typeof global == "object" && global && global.Object === Object && global;
|
|
60
|
+
const Ht = Ie;
|
|
61
|
+
var Fe = typeof self == "object" && self && self.Object === Object && self, Me = Ht || Fe || Function("return this")();
|
|
62
|
+
const _ = Me;
|
|
63
|
+
var De = _.Symbol;
|
|
64
|
+
const E = De;
|
|
65
|
+
var Vt = Object.prototype, Ue = Vt.hasOwnProperty, Re = Vt.toString, U = E ? E.toStringTag : void 0;
|
|
66
|
+
function Be(t) {
|
|
67
|
+
var e = Ue.call(t, U), r = t[U];
|
|
12
68
|
try {
|
|
13
|
-
t[
|
|
14
|
-
var
|
|
69
|
+
t[U] = void 0;
|
|
70
|
+
var o = !0;
|
|
15
71
|
} catch {
|
|
16
72
|
}
|
|
17
|
-
var
|
|
18
|
-
return
|
|
73
|
+
var c = Re.call(t);
|
|
74
|
+
return o && (e ? t[U] = r : delete t[U]), c;
|
|
19
75
|
}
|
|
20
|
-
var
|
|
21
|
-
function
|
|
22
|
-
return
|
|
23
|
-
}
|
|
24
|
-
var ge = "[object Null]", he = "[object Undefined]", lt = I ? I.toStringTag : void 0;
|
|
25
|
-
function z(t) {
|
|
26
|
-
return t == null ? t === void 0 ? he : ge : lt && lt in Object(t) ? le(t) : de(t);
|
|
76
|
+
var Le = Object.prototype, Ge = Le.toString;
|
|
77
|
+
function Ne(t) {
|
|
78
|
+
return Ge.call(t);
|
|
27
79
|
}
|
|
28
|
-
|
|
29
|
-
|
|
80
|
+
var ze = "[object Null]", Ke = "[object Undefined]", $t = E ? E.toStringTag : void 0;
|
|
81
|
+
function N(t) {
|
|
82
|
+
return t == null ? t === void 0 ? Ke : ze : $t && $t in Object(t) ? Be(t) : Ne(t);
|
|
30
83
|
}
|
|
31
|
-
|
|
32
|
-
const M = ve;
|
|
33
|
-
function K(t) {
|
|
84
|
+
function z(t) {
|
|
34
85
|
var e = typeof t;
|
|
35
86
|
return t != null && (e == "object" || e == "function");
|
|
36
87
|
}
|
|
37
|
-
var
|
|
38
|
-
function
|
|
39
|
-
if (!
|
|
88
|
+
var He = "[object AsyncFunction]", Ve = "[object Function]", We = "[object GeneratorFunction]", qe = "[object Proxy]";
|
|
89
|
+
function Wt(t) {
|
|
90
|
+
if (!z(t))
|
|
40
91
|
return !1;
|
|
41
|
-
var e =
|
|
42
|
-
return e ==
|
|
92
|
+
var e = N(t);
|
|
93
|
+
return e == Ve || e == We || e == He || e == qe;
|
|
43
94
|
}
|
|
44
|
-
var
|
|
45
|
-
const
|
|
46
|
-
var
|
|
47
|
-
var t = /[^.]+$/.exec(
|
|
95
|
+
var Ye = _["__core-js_shared__"];
|
|
96
|
+
const k = Ye;
|
|
97
|
+
var _t = function() {
|
|
98
|
+
var t = /[^.]+$/.exec(k && k.keys && k.keys.IE_PROTO || "");
|
|
48
99
|
return t ? "Symbol(src)_1." + t : "";
|
|
49
100
|
}();
|
|
50
|
-
function
|
|
51
|
-
return !!
|
|
101
|
+
function Je(t) {
|
|
102
|
+
return !!_t && _t in t;
|
|
52
103
|
}
|
|
53
|
-
var
|
|
54
|
-
function
|
|
104
|
+
var Xe = Function.prototype, Ze = Xe.toString;
|
|
105
|
+
function S(t) {
|
|
55
106
|
if (t != null) {
|
|
56
107
|
try {
|
|
57
|
-
return
|
|
108
|
+
return Ze.call(t);
|
|
58
109
|
} catch {
|
|
59
110
|
}
|
|
60
111
|
try {
|
|
@@ -64,821 +115,697 @@ function x(t) {
|
|
|
64
115
|
}
|
|
65
116
|
return "";
|
|
66
117
|
}
|
|
67
|
-
var
|
|
68
|
-
"^" +
|
|
118
|
+
var Qe = /[\\^$.*+?()[\]{}|]/g, ke = /^\[object .+?Constructor\]$/, tr = Function.prototype, er = Object.prototype, rr = tr.toString, nr = er.hasOwnProperty, or = RegExp(
|
|
119
|
+
"^" + rr.call(nr).replace(Qe, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
|
|
69
120
|
);
|
|
70
|
-
function
|
|
71
|
-
if (!
|
|
121
|
+
function ar(t) {
|
|
122
|
+
if (!z(t) || Je(t))
|
|
72
123
|
return !1;
|
|
73
|
-
var e =
|
|
74
|
-
return e.test(
|
|
124
|
+
var e = Wt(t) ? or : ke;
|
|
125
|
+
return e.test(S(t));
|
|
75
126
|
}
|
|
76
|
-
function
|
|
127
|
+
function ir(t, e) {
|
|
77
128
|
return t == null ? void 0 : t[e];
|
|
78
129
|
}
|
|
79
|
-
function
|
|
80
|
-
var r =
|
|
81
|
-
return
|
|
130
|
+
function x(t, e) {
|
|
131
|
+
var r = ir(t, e);
|
|
132
|
+
return ar(r) ? r : void 0;
|
|
82
133
|
}
|
|
83
|
-
var
|
|
84
|
-
const
|
|
85
|
-
var
|
|
86
|
-
|
|
134
|
+
var sr = x(_, "Map");
|
|
135
|
+
const L = sr;
|
|
136
|
+
var cr = x(Object, "create");
|
|
137
|
+
const G = cr;
|
|
138
|
+
function ur() {
|
|
139
|
+
this.__data__ = G ? G(null) : {}, this.size = 0;
|
|
140
|
+
}
|
|
141
|
+
function fr(t) {
|
|
142
|
+
var e = this.has(t) && delete this.__data__[t];
|
|
143
|
+
return this.size -= e ? 1 : 0, e;
|
|
144
|
+
}
|
|
145
|
+
var lr = "__lodash_hash_undefined__", pr = Object.prototype, dr = pr.hasOwnProperty;
|
|
146
|
+
function gr(t) {
|
|
147
|
+
var e = this.__data__;
|
|
148
|
+
if (G) {
|
|
149
|
+
var r = e[t];
|
|
150
|
+
return r === lr ? void 0 : r;
|
|
87
151
|
}
|
|
88
|
-
return
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
95
|
-
|
|
152
|
+
return dr.call(e, t) ? e[t] : void 0;
|
|
153
|
+
}
|
|
154
|
+
var hr = Object.prototype, br = hr.hasOwnProperty;
|
|
155
|
+
function vr(t) {
|
|
156
|
+
var e = this.__data__;
|
|
157
|
+
return G ? e[t] !== void 0 : br.call(e, t);
|
|
158
|
+
}
|
|
159
|
+
var yr = "__lodash_hash_undefined__";
|
|
160
|
+
function $r(t, e) {
|
|
161
|
+
var r = this.__data__;
|
|
162
|
+
return this.size += this.has(t) ? 0 : 1, r[t] = G && e === void 0 ? yr : e, this;
|
|
163
|
+
}
|
|
164
|
+
function A(t) {
|
|
165
|
+
var e = -1, r = t == null ? 0 : t.length;
|
|
166
|
+
for (this.clear(); ++e < r; ) {
|
|
167
|
+
var o = t[e];
|
|
168
|
+
this.set(o[0], o[1]);
|
|
169
|
+
}
|
|
170
|
+
}
|
|
171
|
+
A.prototype.clear = ur;
|
|
172
|
+
A.prototype.delete = fr;
|
|
173
|
+
A.prototype.get = gr;
|
|
174
|
+
A.prototype.has = vr;
|
|
175
|
+
A.prototype.set = $r;
|
|
176
|
+
function _r() {
|
|
177
|
+
this.size = 0, this.__data__ = {
|
|
178
|
+
hash: new A(),
|
|
179
|
+
map: new (L || m)(),
|
|
180
|
+
string: new A()
|
|
96
181
|
};
|
|
97
|
-
}();
|
|
98
|
-
const Ue = De;
|
|
99
|
-
function Be(t, e) {
|
|
100
|
-
var r = -1, n = t.length;
|
|
101
|
-
for (e || (e = Array(n)); ++r < n; )
|
|
102
|
-
e[r] = t[r];
|
|
103
|
-
return e;
|
|
104
182
|
}
|
|
105
|
-
|
|
183
|
+
function Tr(t) {
|
|
184
|
+
var e = typeof t;
|
|
185
|
+
return e == "string" || e == "number" || e == "symbol" || e == "boolean" ? t !== "__proto__" : t === null;
|
|
186
|
+
}
|
|
187
|
+
function q(t, e) {
|
|
188
|
+
var r = t.__data__;
|
|
189
|
+
return Tr(e) ? r[typeof e == "string" ? "string" : "hash"] : r.map;
|
|
190
|
+
}
|
|
191
|
+
function mr(t) {
|
|
192
|
+
var e = q(this, t).delete(t);
|
|
193
|
+
return this.size -= e ? 1 : 0, e;
|
|
194
|
+
}
|
|
195
|
+
function jr(t) {
|
|
196
|
+
return q(this, t).get(t);
|
|
197
|
+
}
|
|
198
|
+
function wr(t) {
|
|
199
|
+
return q(this, t).has(t);
|
|
200
|
+
}
|
|
201
|
+
function Or(t, e) {
|
|
202
|
+
var r = q(this, t), o = r.size;
|
|
203
|
+
return r.set(t, e), this.size += r.size == o ? 0 : 1, this;
|
|
204
|
+
}
|
|
205
|
+
function I(t) {
|
|
206
|
+
var e = -1, r = t == null ? 0 : t.length;
|
|
207
|
+
for (this.clear(); ++e < r; ) {
|
|
208
|
+
var o = t[e];
|
|
209
|
+
this.set(o[0], o[1]);
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
I.prototype.clear = _r;
|
|
213
|
+
I.prototype.delete = mr;
|
|
214
|
+
I.prototype.get = jr;
|
|
215
|
+
I.prototype.has = wr;
|
|
216
|
+
I.prototype.set = Or;
|
|
217
|
+
var Ar = 200;
|
|
218
|
+
function Sr(t, e) {
|
|
219
|
+
var r = this.__data__;
|
|
220
|
+
if (r instanceof m) {
|
|
221
|
+
var o = r.__data__;
|
|
222
|
+
if (!L || o.length < Ar - 1)
|
|
223
|
+
return o.push([t, e]), this.size = ++r.size, this;
|
|
224
|
+
r = this.__data__ = new I(o);
|
|
225
|
+
}
|
|
226
|
+
return r.set(t, e), this.size = r.size, this;
|
|
227
|
+
}
|
|
228
|
+
function F(t) {
|
|
229
|
+
var e = this.__data__ = new m(t);
|
|
230
|
+
this.size = e.size;
|
|
231
|
+
}
|
|
232
|
+
F.prototype.clear = xe;
|
|
233
|
+
F.prototype.delete = Pe;
|
|
234
|
+
F.prototype.get = Ee;
|
|
235
|
+
F.prototype.has = Ce;
|
|
236
|
+
F.prototype.set = Sr;
|
|
237
|
+
function xr(t, e) {
|
|
238
|
+
for (var r = -1, o = t == null ? 0 : t.length; ++r < o && e(t[r], r, t) !== !1; )
|
|
239
|
+
;
|
|
240
|
+
return t;
|
|
241
|
+
}
|
|
242
|
+
var Pr = function() {
|
|
106
243
|
try {
|
|
107
|
-
var t =
|
|
244
|
+
var t = x(Object, "defineProperty");
|
|
108
245
|
return t({}, "", {}), t;
|
|
109
246
|
} catch {
|
|
110
247
|
}
|
|
111
248
|
}();
|
|
112
|
-
const
|
|
113
|
-
function
|
|
114
|
-
|
|
115
|
-
;
|
|
116
|
-
return t;
|
|
117
|
-
}
|
|
118
|
-
var Ne = 9007199254740991, ze = /^(?:0|[1-9]\d*)$/;
|
|
119
|
-
function Re(t, e) {
|
|
120
|
-
var r = typeof t;
|
|
121
|
-
return e = e ?? Ne, !!e && (r == "number" || r != "symbol" && ze.test(t)) && t > -1 && t % 1 == 0 && t < e;
|
|
122
|
-
}
|
|
123
|
-
function Bt(t, e, r) {
|
|
124
|
-
e == "__proto__" && dt ? dt(t, e, {
|
|
249
|
+
const Tt = Pr;
|
|
250
|
+
function qt(t, e, r) {
|
|
251
|
+
e == "__proto__" && Tt ? Tt(t, e, {
|
|
125
252
|
configurable: !0,
|
|
126
253
|
enumerable: !0,
|
|
127
254
|
value: r,
|
|
128
255
|
writable: !0
|
|
129
256
|
}) : t[e] = r;
|
|
130
257
|
}
|
|
131
|
-
|
|
132
|
-
|
|
133
|
-
|
|
134
|
-
|
|
135
|
-
function Lt(t, e, r) {
|
|
136
|
-
var n = t[e];
|
|
137
|
-
(!(He.call(t, e) && Gt(n, r)) || r === void 0 && !(e in t)) && Bt(t, e, r);
|
|
258
|
+
var Er = Object.prototype, Cr = Er.hasOwnProperty;
|
|
259
|
+
function Yt(t, e, r) {
|
|
260
|
+
var o = t[e];
|
|
261
|
+
(!(Cr.call(t, e) && Kt(o, r)) || r === void 0 && !(e in t)) && qt(t, e, r);
|
|
138
262
|
}
|
|
139
|
-
function
|
|
140
|
-
var
|
|
263
|
+
function Y(t, e, r, o) {
|
|
264
|
+
var c = !r;
|
|
141
265
|
r || (r = {});
|
|
142
|
-
for (var
|
|
143
|
-
var
|
|
144
|
-
|
|
266
|
+
for (var s = -1, i = e.length; ++s < i; ) {
|
|
267
|
+
var d = e[s], b = o ? o(r[d], t[d], d, r, t) : void 0;
|
|
268
|
+
b === void 0 && (b = t[d]), c ? qt(r, d, b) : Yt(r, d, b);
|
|
145
269
|
}
|
|
146
270
|
return r;
|
|
147
271
|
}
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
272
|
+
function Ir(t, e) {
|
|
273
|
+
for (var r = -1, o = Array(t); ++r < t; )
|
|
274
|
+
o[r] = e(r);
|
|
275
|
+
return o;
|
|
151
276
|
}
|
|
152
|
-
function
|
|
153
|
-
return t != null &&
|
|
154
|
-
}
|
|
155
|
-
var We = Object.prototype;
|
|
156
|
-
function et(t) {
|
|
157
|
-
var e = t && t.constructor, r = typeof e == "function" && e.prototype || We;
|
|
158
|
-
return t === r;
|
|
159
|
-
}
|
|
160
|
-
function qe(t, e) {
|
|
161
|
-
for (var r = -1, n = Array(t); ++r < t; )
|
|
162
|
-
n[r] = e(r);
|
|
163
|
-
return n;
|
|
277
|
+
function K(t) {
|
|
278
|
+
return t != null && typeof t == "object";
|
|
164
279
|
}
|
|
165
|
-
var
|
|
166
|
-
function
|
|
167
|
-
return
|
|
280
|
+
var Fr = "[object Arguments]";
|
|
281
|
+
function mt(t) {
|
|
282
|
+
return K(t) && N(t) == Fr;
|
|
168
283
|
}
|
|
169
|
-
var
|
|
284
|
+
var Jt = Object.prototype, Mr = Jt.hasOwnProperty, Dr = Jt.propertyIsEnumerable, Ur = mt(function() {
|
|
170
285
|
return arguments;
|
|
171
|
-
}()) ?
|
|
172
|
-
return
|
|
286
|
+
}()) ? mt : function(t) {
|
|
287
|
+
return K(t) && Mr.call(t, "callee") && !Dr.call(t, "callee");
|
|
173
288
|
};
|
|
174
|
-
const
|
|
175
|
-
|
|
289
|
+
const Rr = Ur;
|
|
290
|
+
var Br = Array.isArray;
|
|
291
|
+
const at = Br;
|
|
292
|
+
function Lr() {
|
|
176
293
|
return !1;
|
|
177
294
|
}
|
|
178
|
-
var
|
|
179
|
-
const
|
|
180
|
-
var
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
295
|
+
var Xt = typeof exports == "object" && exports && !exports.nodeType && exports, jt = Xt && typeof module == "object" && module && !module.nodeType && module, Gr = jt && jt.exports === Xt, wt = Gr ? _.Buffer : void 0, Nr = wt ? wt.isBuffer : void 0, zr = Nr || Lr;
|
|
296
|
+
const Zt = zr;
|
|
297
|
+
var Kr = 9007199254740991, Hr = /^(?:0|[1-9]\d*)$/;
|
|
298
|
+
function Vr(t, e) {
|
|
299
|
+
var r = typeof t;
|
|
300
|
+
return e = e ?? Kr, !!e && (r == "number" || r != "symbol" && Hr.test(t)) && t > -1 && t % 1 == 0 && t < e;
|
|
301
|
+
}
|
|
302
|
+
var Wr = 9007199254740991;
|
|
303
|
+
function Qt(t) {
|
|
304
|
+
return typeof t == "number" && t > -1 && t % 1 == 0 && t <= Wr;
|
|
305
|
+
}
|
|
306
|
+
var qr = "[object Arguments]", Yr = "[object Array]", Jr = "[object Boolean]", Xr = "[object Date]", Zr = "[object Error]", Qr = "[object Function]", kr = "[object Map]", tn = "[object Number]", en = "[object Object]", rn = "[object RegExp]", nn = "[object Set]", on = "[object String]", an = "[object WeakMap]", sn = "[object ArrayBuffer]", cn = "[object DataView]", un = "[object Float32Array]", fn = "[object Float64Array]", ln = "[object Int8Array]", pn = "[object Int16Array]", dn = "[object Int32Array]", gn = "[object Uint8Array]", hn = "[object Uint8ClampedArray]", bn = "[object Uint16Array]", vn = "[object Uint32Array]", l = {};
|
|
307
|
+
l[un] = l[fn] = l[ln] = l[pn] = l[dn] = l[gn] = l[hn] = l[bn] = l[vn] = !0;
|
|
308
|
+
l[qr] = l[Yr] = l[sn] = l[Jr] = l[cn] = l[Xr] = l[Zr] = l[Qr] = l[kr] = l[tn] = l[en] = l[rn] = l[nn] = l[on] = l[an] = !1;
|
|
309
|
+
function yn(t) {
|
|
310
|
+
return K(t) && Qt(t.length) && !!l[N(t)];
|
|
185
311
|
}
|
|
186
|
-
function
|
|
312
|
+
function it(t) {
|
|
187
313
|
return function(e) {
|
|
188
314
|
return t(e);
|
|
189
315
|
};
|
|
190
316
|
}
|
|
191
|
-
var
|
|
317
|
+
var kt = typeof exports == "object" && exports && !exports.nodeType && exports, R = kt && typeof module == "object" && module && !module.nodeType && module, $n = R && R.exports === kt, tt = $n && Ht.process, _n = function() {
|
|
192
318
|
try {
|
|
193
|
-
var t =
|
|
194
|
-
return t ||
|
|
319
|
+
var t = R && R.require && R.require("util").types;
|
|
320
|
+
return t || tt && tt.binding && tt.binding("util");
|
|
195
321
|
} catch {
|
|
196
322
|
}
|
|
197
323
|
}();
|
|
198
|
-
const C =
|
|
199
|
-
var
|
|
200
|
-
const
|
|
201
|
-
var
|
|
202
|
-
function
|
|
203
|
-
var r =
|
|
324
|
+
const C = _n;
|
|
325
|
+
var Ot = C && C.isTypedArray, Tn = Ot ? it(Ot) : yn;
|
|
326
|
+
const mn = Tn;
|
|
327
|
+
var jn = Object.prototype, wn = jn.hasOwnProperty;
|
|
328
|
+
function te(t, e) {
|
|
329
|
+
var r = at(t), o = !r && Rr(t), c = !r && !o && Zt(t), s = !r && !o && !c && mn(t), i = r || o || c || s, d = i ? Ir(t.length, String) : [], b = d.length;
|
|
204
330
|
for (var g in t)
|
|
205
|
-
(e ||
|
|
331
|
+
(e || wn.call(t, g)) && !(i && // Safari 9 has enumerable `arguments.length` in strict mode.
|
|
206
332
|
(g == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
return
|
|
333
|
+
c && (g == "offset" || g == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
|
|
334
|
+
s && (g == "buffer" || g == "byteLength" || g == "byteOffset") || // Skip index properties.
|
|
335
|
+
Vr(g, b))) && d.push(g);
|
|
336
|
+
return d;
|
|
337
|
+
}
|
|
338
|
+
var On = Object.prototype;
|
|
339
|
+
function st(t) {
|
|
340
|
+
var e = t && t.constructor, r = typeof e == "function" && e.prototype || On;
|
|
341
|
+
return t === r;
|
|
211
342
|
}
|
|
212
|
-
function
|
|
343
|
+
function ee(t, e) {
|
|
213
344
|
return function(r) {
|
|
214
345
|
return t(e(r));
|
|
215
346
|
};
|
|
216
347
|
}
|
|
217
|
-
var
|
|
218
|
-
const
|
|
219
|
-
var
|
|
220
|
-
function
|
|
221
|
-
if (!
|
|
222
|
-
return
|
|
348
|
+
var An = ee(Object.keys, Object);
|
|
349
|
+
const Sn = An;
|
|
350
|
+
var xn = Object.prototype, Pn = xn.hasOwnProperty;
|
|
351
|
+
function En(t) {
|
|
352
|
+
if (!st(t))
|
|
353
|
+
return Sn(t);
|
|
223
354
|
var e = [];
|
|
224
355
|
for (var r in Object(t))
|
|
225
|
-
|
|
356
|
+
Pn.call(t, r) && r != "constructor" && e.push(r);
|
|
226
357
|
return e;
|
|
227
358
|
}
|
|
228
|
-
function
|
|
229
|
-
return
|
|
359
|
+
function re(t) {
|
|
360
|
+
return t != null && Qt(t.length) && !Wt(t);
|
|
230
361
|
}
|
|
231
|
-
function
|
|
362
|
+
function ct(t) {
|
|
363
|
+
return re(t) ? te(t) : En(t);
|
|
364
|
+
}
|
|
365
|
+
function Cn(t, e) {
|
|
366
|
+
return t && Y(e, ct(e), t);
|
|
367
|
+
}
|
|
368
|
+
function In(t) {
|
|
232
369
|
var e = [];
|
|
233
370
|
if (t != null)
|
|
234
371
|
for (var r in Object(t))
|
|
235
372
|
e.push(r);
|
|
236
373
|
return e;
|
|
237
374
|
}
|
|
238
|
-
var
|
|
239
|
-
function
|
|
240
|
-
if (!
|
|
241
|
-
return
|
|
242
|
-
var e =
|
|
243
|
-
for (var
|
|
244
|
-
|
|
375
|
+
var Fn = Object.prototype, Mn = Fn.hasOwnProperty;
|
|
376
|
+
function Dn(t) {
|
|
377
|
+
if (!z(t))
|
|
378
|
+
return In(t);
|
|
379
|
+
var e = st(t), r = [];
|
|
380
|
+
for (var o in t)
|
|
381
|
+
o == "constructor" && (e || !Mn.call(t, o)) || r.push(o);
|
|
245
382
|
return r;
|
|
246
383
|
}
|
|
247
|
-
function
|
|
248
|
-
return
|
|
249
|
-
}
|
|
250
|
-
var Kr = E(Object, "create");
|
|
251
|
-
const L = Kr;
|
|
252
|
-
function Hr() {
|
|
253
|
-
this.__data__ = L ? L(null) : {}, this.size = 0;
|
|
254
|
-
}
|
|
255
|
-
function Vr(t) {
|
|
256
|
-
var e = this.has(t) && delete this.__data__[t];
|
|
257
|
-
return this.size -= e ? 1 : 0, e;
|
|
258
|
-
}
|
|
259
|
-
var Wr = "__lodash_hash_undefined__", qr = Object.prototype, Yr = qr.hasOwnProperty;
|
|
260
|
-
function Jr(t) {
|
|
261
|
-
var e = this.__data__;
|
|
262
|
-
if (L) {
|
|
263
|
-
var r = e[t];
|
|
264
|
-
return r === Wr ? void 0 : r;
|
|
265
|
-
}
|
|
266
|
-
return Yr.call(e, t) ? e[t] : void 0;
|
|
267
|
-
}
|
|
268
|
-
var Xr = Object.prototype, Zr = Xr.hasOwnProperty;
|
|
269
|
-
function Qr(t) {
|
|
270
|
-
var e = this.__data__;
|
|
271
|
-
return L ? e[t] !== void 0 : Zr.call(e, t);
|
|
272
|
-
}
|
|
273
|
-
var kr = "__lodash_hash_undefined__";
|
|
274
|
-
function tn(t, e) {
|
|
275
|
-
var r = this.__data__;
|
|
276
|
-
return this.size += this.has(t) ? 0 : 1, r[t] = L && e === void 0 ? kr : e, this;
|
|
277
|
-
}
|
|
278
|
-
function P(t) {
|
|
279
|
-
var e = -1, r = t == null ? 0 : t.length;
|
|
280
|
-
for (this.clear(); ++e < r; ) {
|
|
281
|
-
var n = t[e];
|
|
282
|
-
this.set(n[0], n[1]);
|
|
283
|
-
}
|
|
284
|
-
}
|
|
285
|
-
P.prototype.clear = Hr;
|
|
286
|
-
P.prototype.delete = Vr;
|
|
287
|
-
P.prototype.get = Jr;
|
|
288
|
-
P.prototype.has = Qr;
|
|
289
|
-
P.prototype.set = tn;
|
|
290
|
-
function en() {
|
|
291
|
-
this.__data__ = [], this.size = 0;
|
|
292
|
-
}
|
|
293
|
-
function q(t, e) {
|
|
294
|
-
for (var r = t.length; r--; )
|
|
295
|
-
if (Gt(t[r][0], e))
|
|
296
|
-
return r;
|
|
297
|
-
return -1;
|
|
298
|
-
}
|
|
299
|
-
var rn = Array.prototype, nn = rn.splice;
|
|
300
|
-
function an(t) {
|
|
301
|
-
var e = this.__data__, r = q(e, t);
|
|
302
|
-
if (r < 0)
|
|
303
|
-
return !1;
|
|
304
|
-
var n = e.length - 1;
|
|
305
|
-
return r == n ? e.pop() : nn.call(e, r, 1), --this.size, !0;
|
|
306
|
-
}
|
|
307
|
-
function on(t) {
|
|
308
|
-
var e = this.__data__, r = q(e, t);
|
|
309
|
-
return r < 0 ? void 0 : e[r][1];
|
|
310
|
-
}
|
|
311
|
-
function sn(t) {
|
|
312
|
-
return q(this.__data__, t) > -1;
|
|
313
|
-
}
|
|
314
|
-
function un(t, e) {
|
|
315
|
-
var r = this.__data__, n = q(r, t);
|
|
316
|
-
return n < 0 ? (++this.size, r.push([t, e])) : r[n][1] = e, this;
|
|
317
|
-
}
|
|
318
|
-
function m(t) {
|
|
319
|
-
var e = -1, r = t == null ? 0 : t.length;
|
|
320
|
-
for (this.clear(); ++e < r; ) {
|
|
321
|
-
var n = t[e];
|
|
322
|
-
this.set(n[0], n[1]);
|
|
323
|
-
}
|
|
324
|
-
}
|
|
325
|
-
m.prototype.clear = en;
|
|
326
|
-
m.prototype.delete = an;
|
|
327
|
-
m.prototype.get = on;
|
|
328
|
-
m.prototype.has = sn;
|
|
329
|
-
m.prototype.set = un;
|
|
330
|
-
var cn = E(w, "Map");
|
|
331
|
-
const N = cn;
|
|
332
|
-
function ln() {
|
|
333
|
-
this.size = 0, this.__data__ = {
|
|
334
|
-
hash: new P(),
|
|
335
|
-
map: new (N || m)(),
|
|
336
|
-
string: new P()
|
|
337
|
-
};
|
|
338
|
-
}
|
|
339
|
-
function fn(t) {
|
|
340
|
-
var e = typeof t;
|
|
341
|
-
return e == "string" || e == "number" || e == "symbol" || e == "boolean" ? t !== "__proto__" : t === null;
|
|
342
|
-
}
|
|
343
|
-
function Y(t, e) {
|
|
344
|
-
var r = t.__data__;
|
|
345
|
-
return fn(e) ? r[typeof e == "string" ? "string" : "hash"] : r.map;
|
|
346
|
-
}
|
|
347
|
-
function pn(t) {
|
|
348
|
-
var e = Y(this, t).delete(t);
|
|
349
|
-
return this.size -= e ? 1 : 0, e;
|
|
350
|
-
}
|
|
351
|
-
function dn(t) {
|
|
352
|
-
return Y(this, t).get(t);
|
|
353
|
-
}
|
|
354
|
-
function gn(t) {
|
|
355
|
-
return Y(this, t).has(t);
|
|
356
|
-
}
|
|
357
|
-
function hn(t, e) {
|
|
358
|
-
var r = Y(this, t), n = r.size;
|
|
359
|
-
return r.set(t, e), this.size += r.size == n ? 0 : 1, this;
|
|
360
|
-
}
|
|
361
|
-
function D(t) {
|
|
362
|
-
var e = -1, r = t == null ? 0 : t.length;
|
|
363
|
-
for (this.clear(); ++e < r; ) {
|
|
364
|
-
var n = t[e];
|
|
365
|
-
this.set(n[0], n[1]);
|
|
366
|
-
}
|
|
367
|
-
}
|
|
368
|
-
D.prototype.clear = ln;
|
|
369
|
-
D.prototype.delete = pn;
|
|
370
|
-
D.prototype.get = dn;
|
|
371
|
-
D.prototype.has = gn;
|
|
372
|
-
D.prototype.set = hn;
|
|
373
|
-
function Yt(t, e) {
|
|
374
|
-
for (var r = -1, n = e.length, o = t.length; ++r < n; )
|
|
375
|
-
t[o + r] = e[r];
|
|
376
|
-
return t;
|
|
377
|
-
}
|
|
378
|
-
var vn = qt(Object.getPrototypeOf, Object);
|
|
379
|
-
const Jt = vn;
|
|
380
|
-
function bn() {
|
|
381
|
-
this.__data__ = new m(), this.size = 0;
|
|
382
|
-
}
|
|
383
|
-
function yn(t) {
|
|
384
|
-
var e = this.__data__, r = e.delete(t);
|
|
385
|
-
return this.size = e.size, r;
|
|
386
|
-
}
|
|
387
|
-
function jn(t) {
|
|
388
|
-
return this.__data__.get(t);
|
|
389
|
-
}
|
|
390
|
-
function _n(t) {
|
|
391
|
-
return this.__data__.has(t);
|
|
392
|
-
}
|
|
393
|
-
var $n = 200;
|
|
394
|
-
function Tn(t, e) {
|
|
395
|
-
var r = this.__data__;
|
|
396
|
-
if (r instanceof m) {
|
|
397
|
-
var n = r.__data__;
|
|
398
|
-
if (!N || n.length < $n - 1)
|
|
399
|
-
return n.push([t, e]), this.size = ++r.size, this;
|
|
400
|
-
r = this.__data__ = new D(n);
|
|
401
|
-
}
|
|
402
|
-
return r.set(t, e), this.size = r.size, this;
|
|
403
|
-
}
|
|
404
|
-
function U(t) {
|
|
405
|
-
var e = this.__data__ = new m(t);
|
|
406
|
-
this.size = e.size;
|
|
407
|
-
}
|
|
408
|
-
U.prototype.clear = bn;
|
|
409
|
-
U.prototype.delete = yn;
|
|
410
|
-
U.prototype.get = jn;
|
|
411
|
-
U.prototype.has = _n;
|
|
412
|
-
U.prototype.set = Tn;
|
|
413
|
-
function wn(t, e) {
|
|
414
|
-
return t && W(e, nt(e), t);
|
|
384
|
+
function ut(t) {
|
|
385
|
+
return re(t) ? te(t, !0) : Dn(t);
|
|
415
386
|
}
|
|
416
|
-
function
|
|
417
|
-
return t &&
|
|
387
|
+
function Un(t, e) {
|
|
388
|
+
return t && Y(e, ut(e), t);
|
|
418
389
|
}
|
|
419
|
-
var
|
|
420
|
-
function
|
|
390
|
+
var ne = typeof exports == "object" && exports && !exports.nodeType && exports, At = ne && typeof module == "object" && module && !module.nodeType && module, Rn = At && At.exports === ne, St = Rn ? _.Buffer : void 0, xt = St ? St.allocUnsafe : void 0;
|
|
391
|
+
function Bn(t, e) {
|
|
421
392
|
if (e)
|
|
422
393
|
return t.slice();
|
|
423
|
-
var r = t.length,
|
|
424
|
-
return t.copy(
|
|
394
|
+
var r = t.length, o = xt ? xt(r) : new t.constructor(r);
|
|
395
|
+
return t.copy(o), o;
|
|
425
396
|
}
|
|
426
|
-
function
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
e
|
|
397
|
+
function Ln(t, e) {
|
|
398
|
+
var r = -1, o = t.length;
|
|
399
|
+
for (e || (e = Array(o)); ++r < o; )
|
|
400
|
+
e[r] = t[r];
|
|
401
|
+
return e;
|
|
402
|
+
}
|
|
403
|
+
function Gn(t, e) {
|
|
404
|
+
for (var r = -1, o = t == null ? 0 : t.length, c = 0, s = []; ++r < o; ) {
|
|
405
|
+
var i = t[r];
|
|
406
|
+
e(i, r, t) && (s[c++] = i);
|
|
430
407
|
}
|
|
431
|
-
return
|
|
408
|
+
return s;
|
|
432
409
|
}
|
|
433
|
-
function
|
|
410
|
+
function oe() {
|
|
434
411
|
return [];
|
|
435
412
|
}
|
|
436
|
-
var
|
|
437
|
-
return t == null ? [] : (t = Object(t),
|
|
438
|
-
return
|
|
413
|
+
var Nn = Object.prototype, zn = Nn.propertyIsEnumerable, Pt = Object.getOwnPropertySymbols, Kn = Pt ? function(t) {
|
|
414
|
+
return t == null ? [] : (t = Object(t), Gn(Pt(t), function(e) {
|
|
415
|
+
return zn.call(t, e);
|
|
439
416
|
}));
|
|
440
|
-
} :
|
|
441
|
-
const
|
|
442
|
-
function
|
|
443
|
-
return
|
|
417
|
+
} : oe;
|
|
418
|
+
const ft = Kn;
|
|
419
|
+
function Hn(t, e) {
|
|
420
|
+
return Y(t, ft(t), e);
|
|
421
|
+
}
|
|
422
|
+
function ae(t, e) {
|
|
423
|
+
for (var r = -1, o = e.length, c = t.length; ++r < o; )
|
|
424
|
+
t[c + r] = e[r];
|
|
425
|
+
return t;
|
|
444
426
|
}
|
|
445
|
-
var
|
|
427
|
+
var Vn = ee(Object.getPrototypeOf, Object);
|
|
428
|
+
const ie = Vn;
|
|
429
|
+
var Wn = Object.getOwnPropertySymbols, qn = Wn ? function(t) {
|
|
446
430
|
for (var e = []; t; )
|
|
447
|
-
|
|
431
|
+
ae(e, ft(t)), t = ie(t);
|
|
448
432
|
return e;
|
|
449
|
-
} :
|
|
450
|
-
const
|
|
451
|
-
function
|
|
452
|
-
return
|
|
453
|
-
}
|
|
454
|
-
function
|
|
455
|
-
var
|
|
456
|
-
return
|
|
457
|
-
}
|
|
458
|
-
function
|
|
459
|
-
return
|
|
460
|
-
}
|
|
461
|
-
function
|
|
462
|
-
return
|
|
463
|
-
}
|
|
464
|
-
var
|
|
465
|
-
const
|
|
466
|
-
var
|
|
467
|
-
const
|
|
468
|
-
var
|
|
469
|
-
const
|
|
470
|
-
var
|
|
471
|
-
|
|
472
|
-
|
|
473
|
-
|
|
474
|
-
|
|
475
|
-
|
|
476
|
-
|
|
477
|
-
case
|
|
478
|
-
return
|
|
479
|
-
case
|
|
480
|
-
return
|
|
481
|
-
case
|
|
482
|
-
return
|
|
483
|
-
case
|
|
484
|
-
return
|
|
433
|
+
} : oe;
|
|
434
|
+
const se = qn;
|
|
435
|
+
function Yn(t, e) {
|
|
436
|
+
return Y(t, se(t), e);
|
|
437
|
+
}
|
|
438
|
+
function ce(t, e, r) {
|
|
439
|
+
var o = e(t);
|
|
440
|
+
return at(t) ? o : ae(o, r(t));
|
|
441
|
+
}
|
|
442
|
+
function Jn(t) {
|
|
443
|
+
return ce(t, ct, ft);
|
|
444
|
+
}
|
|
445
|
+
function Xn(t) {
|
|
446
|
+
return ce(t, ut, se);
|
|
447
|
+
}
|
|
448
|
+
var Zn = x(_, "DataView");
|
|
449
|
+
const et = Zn;
|
|
450
|
+
var Qn = x(_, "Promise");
|
|
451
|
+
const rt = Qn;
|
|
452
|
+
var kn = x(_, "Set");
|
|
453
|
+
const nt = kn;
|
|
454
|
+
var to = x(_, "WeakMap");
|
|
455
|
+
const ot = to;
|
|
456
|
+
var Et = "[object Map]", eo = "[object Object]", Ct = "[object Promise]", It = "[object Set]", Ft = "[object WeakMap]", Mt = "[object DataView]", ro = S(et), no = S(L), oo = S(rt), ao = S(nt), io = S(ot), O = N;
|
|
457
|
+
(et && O(new et(new ArrayBuffer(1))) != Mt || L && O(new L()) != Et || rt && O(rt.resolve()) != Ct || nt && O(new nt()) != It || ot && O(new ot()) != Ft) && (O = function(t) {
|
|
458
|
+
var e = N(t), r = e == eo ? t.constructor : void 0, o = r ? S(r) : "";
|
|
459
|
+
if (o)
|
|
460
|
+
switch (o) {
|
|
461
|
+
case ro:
|
|
462
|
+
return Mt;
|
|
463
|
+
case no:
|
|
464
|
+
return Et;
|
|
465
|
+
case oo:
|
|
466
|
+
return Ct;
|
|
467
|
+
case ao:
|
|
468
|
+
return It;
|
|
469
|
+
case io:
|
|
470
|
+
return Ft;
|
|
485
471
|
}
|
|
486
472
|
return e;
|
|
487
473
|
});
|
|
488
|
-
const
|
|
489
|
-
var
|
|
490
|
-
function
|
|
474
|
+
const lt = O;
|
|
475
|
+
var so = Object.prototype, co = so.hasOwnProperty;
|
|
476
|
+
function uo(t) {
|
|
491
477
|
var e = t.length, r = new t.constructor(e);
|
|
492
|
-
return e && typeof t[0] == "string" &&
|
|
478
|
+
return e && typeof t[0] == "string" && co.call(t, "index") && (r.index = t.index, r.input = t.input), r;
|
|
493
479
|
}
|
|
494
|
-
var
|
|
495
|
-
const
|
|
496
|
-
function
|
|
480
|
+
var fo = _.Uint8Array;
|
|
481
|
+
const Dt = fo;
|
|
482
|
+
function pt(t) {
|
|
497
483
|
var e = new t.constructor(t.byteLength);
|
|
498
|
-
return new
|
|
484
|
+
return new Dt(e).set(new Dt(t)), e;
|
|
499
485
|
}
|
|
500
|
-
function
|
|
501
|
-
var r = e ?
|
|
486
|
+
function lo(t, e) {
|
|
487
|
+
var r = e ? pt(t.buffer) : t.buffer;
|
|
502
488
|
return new t.constructor(r, t.byteOffset, t.byteLength);
|
|
503
489
|
}
|
|
504
|
-
var
|
|
505
|
-
function
|
|
506
|
-
var e = new t.constructor(t.source,
|
|
490
|
+
var po = /\w*$/;
|
|
491
|
+
function go(t) {
|
|
492
|
+
var e = new t.constructor(t.source, po.exec(t));
|
|
507
493
|
return e.lastIndex = t.lastIndex, e;
|
|
508
494
|
}
|
|
509
|
-
var
|
|
510
|
-
function
|
|
511
|
-
return
|
|
495
|
+
var Ut = E ? E.prototype : void 0, Rt = Ut ? Ut.valueOf : void 0;
|
|
496
|
+
function ho(t) {
|
|
497
|
+
return Rt ? Object(Rt.call(t)) : {};
|
|
512
498
|
}
|
|
513
|
-
function
|
|
514
|
-
var r = e ?
|
|
499
|
+
function bo(t, e) {
|
|
500
|
+
var r = e ? pt(t.buffer) : t.buffer;
|
|
515
501
|
return new t.constructor(r, t.byteOffset, t.length);
|
|
516
502
|
}
|
|
517
|
-
var
|
|
518
|
-
function
|
|
519
|
-
var
|
|
503
|
+
var vo = "[object Boolean]", yo = "[object Date]", $o = "[object Map]", _o = "[object Number]", To = "[object RegExp]", mo = "[object Set]", jo = "[object String]", wo = "[object Symbol]", Oo = "[object ArrayBuffer]", Ao = "[object DataView]", So = "[object Float32Array]", xo = "[object Float64Array]", Po = "[object Int8Array]", Eo = "[object Int16Array]", Co = "[object Int32Array]", Io = "[object Uint8Array]", Fo = "[object Uint8ClampedArray]", Mo = "[object Uint16Array]", Do = "[object Uint32Array]";
|
|
504
|
+
function Uo(t, e, r) {
|
|
505
|
+
var o = t.constructor;
|
|
520
506
|
switch (e) {
|
|
521
|
-
case
|
|
522
|
-
return
|
|
523
|
-
case
|
|
524
|
-
case
|
|
525
|
-
return new
|
|
526
|
-
case
|
|
527
|
-
return
|
|
528
|
-
case
|
|
529
|
-
case
|
|
530
|
-
case
|
|
531
|
-
case
|
|
532
|
-
case
|
|
533
|
-
case
|
|
534
|
-
case
|
|
535
|
-
case
|
|
536
|
-
case
|
|
537
|
-
return
|
|
538
|
-
case
|
|
539
|
-
return new
|
|
540
|
-
case
|
|
541
|
-
case
|
|
542
|
-
return new
|
|
543
|
-
case
|
|
544
|
-
return
|
|
545
|
-
case
|
|
546
|
-
return new
|
|
547
|
-
case
|
|
548
|
-
return
|
|
507
|
+
case Oo:
|
|
508
|
+
return pt(t);
|
|
509
|
+
case vo:
|
|
510
|
+
case yo:
|
|
511
|
+
return new o(+t);
|
|
512
|
+
case Ao:
|
|
513
|
+
return lo(t, r);
|
|
514
|
+
case So:
|
|
515
|
+
case xo:
|
|
516
|
+
case Po:
|
|
517
|
+
case Eo:
|
|
518
|
+
case Co:
|
|
519
|
+
case Io:
|
|
520
|
+
case Fo:
|
|
521
|
+
case Mo:
|
|
522
|
+
case Do:
|
|
523
|
+
return bo(t, r);
|
|
524
|
+
case $o:
|
|
525
|
+
return new o();
|
|
526
|
+
case _o:
|
|
527
|
+
case jo:
|
|
528
|
+
return new o(t);
|
|
529
|
+
case To:
|
|
530
|
+
return go(t);
|
|
531
|
+
case mo:
|
|
532
|
+
return new o();
|
|
533
|
+
case wo:
|
|
534
|
+
return ho(t);
|
|
549
535
|
}
|
|
550
536
|
}
|
|
551
|
-
function
|
|
552
|
-
|
|
553
|
-
}
|
|
554
|
-
|
|
555
|
-
|
|
556
|
-
|
|
557
|
-
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
var
|
|
561
|
-
|
|
562
|
-
|
|
563
|
-
}
|
|
564
|
-
|
|
565
|
-
|
|
566
|
-
|
|
567
|
-
|
|
568
|
-
|
|
569
|
-
function
|
|
570
|
-
|
|
571
|
-
|
|
572
|
-
|
|
573
|
-
|
|
537
|
+
var Bt = Object.create, Ro = function() {
|
|
538
|
+
function t() {
|
|
539
|
+
}
|
|
540
|
+
return function(e) {
|
|
541
|
+
if (!z(e))
|
|
542
|
+
return {};
|
|
543
|
+
if (Bt)
|
|
544
|
+
return Bt(e);
|
|
545
|
+
t.prototype = e;
|
|
546
|
+
var r = new t();
|
|
547
|
+
return t.prototype = void 0, r;
|
|
548
|
+
};
|
|
549
|
+
}();
|
|
550
|
+
const Bo = Ro;
|
|
551
|
+
function Lo(t) {
|
|
552
|
+
return typeof t.constructor == "function" && !st(t) ? Bo(ie(t)) : {};
|
|
553
|
+
}
|
|
554
|
+
var Go = "[object Map]";
|
|
555
|
+
function No(t) {
|
|
556
|
+
return K(t) && lt(t) == Go;
|
|
557
|
+
}
|
|
558
|
+
var Lt = C && C.isMap, zo = Lt ? it(Lt) : No;
|
|
559
|
+
const Ko = zo;
|
|
560
|
+
var Ho = "[object Set]";
|
|
561
|
+
function Vo(t) {
|
|
562
|
+
return K(t) && lt(t) == Ho;
|
|
563
|
+
}
|
|
564
|
+
var Gt = C && C.isSet, Wo = Gt ? it(Gt) : Vo;
|
|
565
|
+
const qo = Wo;
|
|
566
|
+
var Yo = 1, Jo = 2, Xo = 4, ue = "[object Arguments]", Zo = "[object Array]", Qo = "[object Boolean]", ko = "[object Date]", ta = "[object Error]", fe = "[object Function]", ea = "[object GeneratorFunction]", ra = "[object Map]", na = "[object Number]", le = "[object Object]", oa = "[object RegExp]", aa = "[object Set]", ia = "[object String]", sa = "[object Symbol]", ca = "[object WeakMap]", ua = "[object ArrayBuffer]", fa = "[object DataView]", la = "[object Float32Array]", pa = "[object Float64Array]", da = "[object Int8Array]", ga = "[object Int16Array]", ha = "[object Int32Array]", ba = "[object Uint8Array]", va = "[object Uint8ClampedArray]", ya = "[object Uint16Array]", $a = "[object Uint32Array]", u = {};
|
|
567
|
+
u[ue] = u[Zo] = u[ua] = u[fa] = u[Qo] = u[ko] = u[la] = u[pa] = u[da] = u[ga] = u[ha] = u[ra] = u[na] = u[le] = u[oa] = u[aa] = u[ia] = u[sa] = u[ba] = u[va] = u[ya] = u[$a] = !0;
|
|
568
|
+
u[ta] = u[fe] = u[ca] = !1;
|
|
569
|
+
function V(t, e, r, o, c, s) {
|
|
570
|
+
var i, d = e & Yo, b = e & Jo, g = e & Xo;
|
|
571
|
+
if (r && (i = c ? r(t, o, c, s) : r(t)), i !== void 0)
|
|
572
|
+
return i;
|
|
573
|
+
if (!z(t))
|
|
574
574
|
return t;
|
|
575
|
-
var
|
|
576
|
-
if (
|
|
577
|
-
if (
|
|
578
|
-
return
|
|
575
|
+
var $ = at(t);
|
|
576
|
+
if ($) {
|
|
577
|
+
if (i = uo(t), !d)
|
|
578
|
+
return Ln(t, i);
|
|
579
579
|
} else {
|
|
580
|
-
var
|
|
581
|
-
if (
|
|
582
|
-
return
|
|
583
|
-
if (
|
|
584
|
-
if (
|
|
585
|
-
return
|
|
580
|
+
var v = lt(t), T = v == fe || v == ea;
|
|
581
|
+
if (Zt(t))
|
|
582
|
+
return Bn(t, d);
|
|
583
|
+
if (v == le || v == ue || T && !c) {
|
|
584
|
+
if (i = b || T ? {} : Lo(t), !d)
|
|
585
|
+
return b ? Yn(t, Un(i, t)) : Hn(t, Cn(i, t));
|
|
586
586
|
} else {
|
|
587
|
-
if (!
|
|
588
|
-
return
|
|
589
|
-
|
|
587
|
+
if (!u[v])
|
|
588
|
+
return c ? t : {};
|
|
589
|
+
i = Uo(t, v, d);
|
|
590
590
|
}
|
|
591
591
|
}
|
|
592
|
-
|
|
593
|
-
var
|
|
594
|
-
if (
|
|
595
|
-
return
|
|
596
|
-
|
|
597
|
-
|
|
598
|
-
}) :
|
|
599
|
-
|
|
600
|
-
});
|
|
601
|
-
var v = g ? p ? Un : Dn : p ? at : nt, j = i ? void 0 : v(t);
|
|
602
|
-
return Le(j || t, function(b, T) {
|
|
603
|
-
j && (T = b, b = t[T]), Lt(s, T, H(b, e, r, T, t, a));
|
|
604
|
-
}), s;
|
|
605
|
-
}
|
|
606
|
-
var ro = 1, no = 4;
|
|
607
|
-
function O(t) {
|
|
608
|
-
return H(t, ro | no);
|
|
609
|
-
}
|
|
610
|
-
function it(t, e) {
|
|
611
|
-
return t.then(function(r) {
|
|
612
|
-
return [null, r];
|
|
613
|
-
}).catch(function(r) {
|
|
614
|
-
return e && Object.assign(r, e), [r, void 0];
|
|
592
|
+
s || (s = new F());
|
|
593
|
+
var j = s.get(t);
|
|
594
|
+
if (j)
|
|
595
|
+
return j;
|
|
596
|
+
s.set(t, i), qo(t) ? t.forEach(function(h) {
|
|
597
|
+
i.add(V(h, e, r, h, t, s));
|
|
598
|
+
}) : Ko(t) && t.forEach(function(h, y) {
|
|
599
|
+
i.set(y, V(h, e, r, y, t, s));
|
|
615
600
|
});
|
|
601
|
+
var P = g ? b ? Xn : Jn : b ? ut : ct, M = $ ? void 0 : P(t);
|
|
602
|
+
return xr(M || t, function(h, y) {
|
|
603
|
+
M && (y = h, h = t[y]), Yt(i, y, V(h, e, r, y, t, s));
|
|
604
|
+
}), i;
|
|
616
605
|
}
|
|
617
|
-
|
|
618
|
-
|
|
619
|
-
|
|
620
|
-
|
|
621
|
-
|
|
622
|
-
|
|
606
|
+
var _a = 1, Ta = 4;
|
|
607
|
+
function ma(t) {
|
|
608
|
+
return V(t, _a | Ta);
|
|
609
|
+
}
|
|
610
|
+
const Nt = (t) => t instanceof Error ? t : new Error(String(t));
|
|
611
|
+
function ja(t) {
|
|
612
|
+
return t !== null && (typeof t == "object" || typeof t == "function") && typeof t.then == "function";
|
|
613
|
+
}
|
|
614
|
+
function B(t) {
|
|
615
|
+
if (!Array.isArray(t))
|
|
616
|
+
throw new Error("Entry must be a list of functions");
|
|
617
|
+
}
|
|
618
|
+
function dt(t, e, r) {
|
|
619
|
+
B(t());
|
|
620
|
+
const o = Z(null), c = Z(), s = ve(!1), i = Z([]), d = r.clone ?? !0, b = r.retainResults ?? !0, g = (n) => d === !1 ? n : typeof d == "function" ? d(n) : ma(n);
|
|
621
|
+
let $, v = !1, T = 0, j, P = [];
|
|
622
|
+
function M() {
|
|
623
|
+
if (o.value)
|
|
624
|
+
return [o.value, void 0];
|
|
625
|
+
try {
|
|
626
|
+
return [null, g(c.value)];
|
|
627
|
+
} catch (n) {
|
|
628
|
+
return [Nt(n), void 0];
|
|
629
|
+
}
|
|
623
630
|
}
|
|
624
|
-
|
|
625
|
-
|
|
626
|
-
|
|
627
|
-
|
|
628
|
-
|
|
629
|
-
|
|
631
|
+
function h(n, a) {
|
|
632
|
+
if (n.settled)
|
|
633
|
+
return;
|
|
634
|
+
n.active = !1, n.settled = !0, n.outcome = a, n.resolve(a);
|
|
635
|
+
const f = n.callback;
|
|
636
|
+
n.callback = void 0, f == null || f(a);
|
|
630
637
|
}
|
|
631
|
-
|
|
632
|
-
|
|
633
|
-
return
|
|
634
|
-
const a = t[n];
|
|
635
|
-
if (typeof a != "function")
|
|
636
|
-
throw e.value[n].status = "rejected", new Error(`The parameter at index ${n} is not a function.`);
|
|
637
|
-
try {
|
|
638
|
-
const [s, l] = await it(ao(a, o));
|
|
639
|
-
if (s)
|
|
640
|
-
throw e.value[n].status = "rejected", s;
|
|
641
|
-
{
|
|
642
|
-
e.value[n] = { status: "fulfilled", data: l };
|
|
643
|
-
const p = n + 1;
|
|
644
|
-
return V(p, t) ? r.value ? l : ct(
|
|
645
|
-
t,
|
|
646
|
-
e,
|
|
647
|
-
r,
|
|
648
|
-
p,
|
|
649
|
-
l
|
|
650
|
-
) : e.value[t.length - 1].data;
|
|
651
|
-
}
|
|
652
|
-
} catch (s) {
|
|
653
|
-
throw s;
|
|
638
|
+
function y(n) {
|
|
639
|
+
const a = ++T, f = $;
|
|
640
|
+
return $ = void 0, f && (f.cancelled = !0, f.tasks = [], f.data = void 0, h(f, [new Error(n), void 0])), a;
|
|
654
641
|
}
|
|
655
|
-
|
|
656
|
-
|
|
657
|
-
const s = t[n];
|
|
658
|
-
if (typeof s != "function")
|
|
659
|
-
throw e.value[n].status = "rejected", new Error(`The parameter at index ${n} is not a function.`);
|
|
660
|
-
const l = (p) => {
|
|
661
|
-
const [g, i] = p;
|
|
662
|
-
if (g)
|
|
663
|
-
e.value[n].status = "rejected", a([g, void 0]);
|
|
664
|
-
else {
|
|
665
|
-
e.value[n] = { status: "fulfilled", data: i };
|
|
666
|
-
const c = n + 1;
|
|
667
|
-
V(c, t) ? (r.value && a([null, i]), ne(
|
|
668
|
-
t,
|
|
669
|
-
e,
|
|
670
|
-
r,
|
|
671
|
-
c,
|
|
672
|
-
i,
|
|
673
|
-
a
|
|
674
|
-
)) : a([null, e.value[t.length - 1].data]);
|
|
675
|
-
}
|
|
676
|
-
};
|
|
677
|
-
try {
|
|
678
|
-
oo(s, l, o);
|
|
679
|
-
} catch (p) {
|
|
680
|
-
a([p, void 0]);
|
|
642
|
+
function J(n) {
|
|
643
|
+
P = n.slice(), i.value = n.map(() => ({ status: "unStart", data: void 0 }));
|
|
681
644
|
}
|
|
682
|
-
|
|
683
|
-
|
|
684
|
-
|
|
685
|
-
|
|
686
|
-
|
|
687
|
-
|
|
688
|
-
|
|
689
|
-
|
|
690
|
-
|
|
691
|
-
|
|
692
|
-
|
|
693
|
-
reject: null
|
|
694
|
-
}, a = _(
|
|
695
|
-
F(t.value)
|
|
696
|
-
);
|
|
697
|
-
Ft(
|
|
698
|
-
t,
|
|
699
|
-
() => {
|
|
700
|
-
a.value = F(t.value);
|
|
701
|
-
},
|
|
702
|
-
{
|
|
703
|
-
deep: !0
|
|
704
|
-
}
|
|
705
|
-
);
|
|
706
|
-
const s = async (i, c = 0) => {
|
|
645
|
+
J(t());
|
|
646
|
+
function D(n, a) {
|
|
647
|
+
if (n.cancelled || n.settled)
|
|
648
|
+
return;
|
|
649
|
+
const f = Nt(a), p = i.value[n.index];
|
|
650
|
+
p && (p.status = "rejected"), c.value = void 0, !n.cancelled && (o.value = f, !n.cancelled && (s.value = !1, !n.cancelled && (Q(i), !n.cancelled && ($ = void 0, n.tasks = [], n.data = void 0, h(n, [f, void 0])))));
|
|
651
|
+
}
|
|
652
|
+
function gt(n) {
|
|
653
|
+
if (n.cancelled || n.settled)
|
|
654
|
+
return;
|
|
655
|
+
let a;
|
|
707
656
|
try {
|
|
708
|
-
|
|
709
|
-
|
|
710
|
-
|
|
711
|
-
|
|
712
|
-
if (u) {
|
|
713
|
-
e.value = u, r.value = y;
|
|
714
|
-
const v = [u, y];
|
|
715
|
-
return o.reject && o.reject(v), v;
|
|
716
|
-
} else {
|
|
717
|
-
r.value = h, e.value = null;
|
|
718
|
-
const v = [null, O(h)];
|
|
719
|
-
return o.resolve && o.resolve(v), v;
|
|
720
|
-
}
|
|
721
|
-
} catch (u) {
|
|
722
|
-
u.value = u, r.value = y;
|
|
723
|
-
const h = [u, y];
|
|
724
|
-
return o.reject && o.reject(h), h;
|
|
657
|
+
a = [null, g(n.data)];
|
|
658
|
+
} catch (f) {
|
|
659
|
+
D(n, f);
|
|
660
|
+
return;
|
|
725
661
|
}
|
|
726
|
-
|
|
727
|
-
|
|
728
|
-
|
|
729
|
-
|
|
730
|
-
|
|
731
|
-
|
|
732
|
-
|
|
733
|
-
|
|
734
|
-
|
|
735
|
-
|
|
662
|
+
c.value = n.data, !n.cancelled && (o.value = null, !n.cancelled && (n.index === n.tasks.length && ($ = void 0, n.tasks = [], n.data = void 0, s.value = !1), h(n, a)));
|
|
663
|
+
}
|
|
664
|
+
function ht(n, a) {
|
|
665
|
+
n.cancelled || (!b && n.index > 0 && (i.value[n.index - 1].data = void 0), i.value[n.index] = { status: "fulfilled", data: a }, n.data = a, n.index++, Q(i));
|
|
666
|
+
}
|
|
667
|
+
function X(n) {
|
|
668
|
+
for (; !n.cancelled && n.index < n.tasks.length; ) {
|
|
669
|
+
const a = n.tasks[n.index];
|
|
670
|
+
if (typeof a != "function") {
|
|
671
|
+
D(n, new Error(`The parameter at index ${n.index} is not a function.`));
|
|
672
|
+
return;
|
|
673
|
+
}
|
|
674
|
+
if (i.value[n.index].status = "start", Q(i), n.cancelled)
|
|
675
|
+
return;
|
|
676
|
+
let f, p;
|
|
677
|
+
try {
|
|
678
|
+
f = a(g(n.data)), p = e || ja(f);
|
|
679
|
+
} catch (w) {
|
|
680
|
+
D(n, w);
|
|
681
|
+
return;
|
|
682
|
+
}
|
|
683
|
+
if (p) {
|
|
684
|
+
Promise.resolve(f).then(
|
|
685
|
+
(w) => {
|
|
686
|
+
n.cancelled || (ht(n, w), s.value || n.index === n.tasks.length ? gt(n) : X(n));
|
|
687
|
+
},
|
|
688
|
+
(w) => D(n, w)
|
|
689
|
+
// 兜底:兑现链自身抛出时也交给「fail」,避免运行因未捕获异常而永不结算。
|
|
690
|
+
).catch((w) => D(n, w));
|
|
691
|
+
return;
|
|
692
|
+
}
|
|
693
|
+
if (ht(n, f), s.value)
|
|
694
|
+
break;
|
|
736
695
|
}
|
|
737
|
-
|
|
696
|
+
gt(n);
|
|
697
|
+
}
|
|
698
|
+
function bt(n, a) {
|
|
699
|
+
n.active = !0, n.settled = !1, n.outcome = void 0, n.callback = a, n.promise = new Promise((f) => {
|
|
700
|
+
n.resolve = f;
|
|
701
|
+
});
|
|
702
|
+
}
|
|
703
|
+
function de(n, a) {
|
|
704
|
+
B(t());
|
|
705
|
+
const f = y("Execution superseded by start()"), p = {
|
|
706
|
+
tasks: t().slice(),
|
|
707
|
+
index: 0,
|
|
708
|
+
data: n,
|
|
709
|
+
active: !1,
|
|
710
|
+
cancelled: !1,
|
|
711
|
+
settled: !1,
|
|
712
|
+
promise: Promise.resolve([null, void 0]),
|
|
713
|
+
resolve: () => {
|
|
714
|
+
}
|
|
715
|
+
};
|
|
716
|
+
return bt(p, a), f !== T ? (h(p, [new Error("Execution superseded by a newer operation"), void 0]), p) : v ? (h(p, [new Error("Runner has been disposed"), void 0]), p) : ($ = p, s.value = !1, p.cancelled || (o.value = null, p.cancelled) || (c.value = void 0, p.cancelled) || (J(p.tasks), X(p)), p);
|
|
717
|
+
}
|
|
718
|
+
function ge(n) {
|
|
719
|
+
const a = $;
|
|
720
|
+
if (!(!a || v))
|
|
721
|
+
return s.value = !1, a.cancelled || a.active || (bt(a, n), X(a)), a;
|
|
722
|
+
}
|
|
723
|
+
function he() {
|
|
724
|
+
const n = $;
|
|
725
|
+
if (!n)
|
|
726
|
+
return Promise.resolve(M());
|
|
727
|
+
const a = n.promise;
|
|
728
|
+
return s.value = !0, a;
|
|
729
|
+
}
|
|
730
|
+
function vt(n) {
|
|
731
|
+
if (v)
|
|
732
|
+
throw new Error("Runner has been disposed");
|
|
733
|
+
B(n);
|
|
734
|
+
const a = y("Execution invalidated by a list update");
|
|
735
|
+
a === T && (s.value = !1, a === T && (c.value = void 0, a === T && (o.value = null, a === T && J(n))));
|
|
736
|
+
}
|
|
737
|
+
function be(n) {
|
|
738
|
+
j = _e(() => n.value.slice(), (a) => {
|
|
739
|
+
(a.length !== P.length || a.some((f, p) => f !== P[p])) && vt(a);
|
|
740
|
+
});
|
|
741
|
+
}
|
|
742
|
+
function yt() {
|
|
743
|
+
v || (v = !0, j == null || j(), j = void 0, y("Runner has been disposed"), t = () => [], P = [], s.value = !1, c.value = void 0, o.value = null, i.value = []);
|
|
744
|
+
}
|
|
745
|
+
return ye() && $e(yt), { state: {
|
|
746
|
+
error: H(o),
|
|
747
|
+
result: H(c),
|
|
748
|
+
statusList: H(i),
|
|
749
|
+
isSuspend: H(s),
|
|
750
|
+
suspend: he,
|
|
751
|
+
dispose: yt
|
|
752
|
+
}, start: de, resume: ge, currentOutcome: M, reset: vt, observe: be };
|
|
753
|
+
}
|
|
754
|
+
function pe(t) {
|
|
738
755
|
return {
|
|
739
|
-
|
|
740
|
-
|
|
741
|
-
|
|
742
|
-
|
|
743
|
-
|
|
744
|
-
|
|
745
|
-
resume: g
|
|
756
|
+
...t.state,
|
|
757
|
+
start: (e) => t.start(e).promise,
|
|
758
|
+
resume: () => {
|
|
759
|
+
var e;
|
|
760
|
+
return ((e = t.resume()) == null ? void 0 : e.promise) ?? Promise.resolve(t.currentOutcome());
|
|
761
|
+
}
|
|
746
762
|
};
|
|
747
763
|
}
|
|
748
|
-
function
|
|
749
|
-
|
|
750
|
-
|
|
751
|
-
|
|
752
|
-
|
|
753
|
-
|
|
754
|
-
|
|
755
|
-
|
|
756
|
-
|
|
757
|
-
|
|
758
|
-
|
|
759
|
-
|
|
760
|
-
|
|
761
|
-
|
|
762
|
-
|
|
763
|
-
|
|
764
|
-
|
|
765
|
-
if (v) {
|
|
766
|
-
r.value = v, n.value = y;
|
|
767
|
-
const b = [v, y];
|
|
768
|
-
return a.reject && a.reject(b), b;
|
|
769
|
-
} else {
|
|
770
|
-
n.value = j, r.value = null;
|
|
771
|
-
const b = [null, O(j)];
|
|
772
|
-
return a.resolve && a.resolve(b), b;
|
|
764
|
+
function Aa(t, e = {}) {
|
|
765
|
+
B(t);
|
|
766
|
+
let r = t;
|
|
767
|
+
const o = dt(() => r, !0, e);
|
|
768
|
+
return {
|
|
769
|
+
...pe(o),
|
|
770
|
+
dispose: () => {
|
|
771
|
+
o.state.dispose(), r = [];
|
|
772
|
+
},
|
|
773
|
+
update: (c) => {
|
|
774
|
+
B(c);
|
|
775
|
+
const s = r;
|
|
776
|
+
r = c;
|
|
777
|
+
try {
|
|
778
|
+
o.reset(c);
|
|
779
|
+
} catch (i) {
|
|
780
|
+
throw r = s, i;
|
|
773
781
|
}
|
|
774
|
-
} catch (v) {
|
|
775
|
-
v.value = v, n.value = y;
|
|
776
|
-
const j = [v, y];
|
|
777
|
-
return a.reject && a.reject(j), j;
|
|
778
782
|
}
|
|
779
|
-
}, g = async (u) => (o.value = !1, e.value.length === 0 ? (n.value = u, r.value = null, [null, O(n.value)]) : p(u, 0)), i = () => new Promise((u, h) => {
|
|
780
|
-
a.reject = h, a.resolve = u, o.value = !0;
|
|
781
|
-
}), c = () => {
|
|
782
|
-
if (o.value) {
|
|
783
|
-
o.value = !1;
|
|
784
|
-
const u = s.value.findIndex((h) => h.data === y);
|
|
785
|
-
return p(
|
|
786
|
-
s.value[Math.max(u - 1, 0)].data,
|
|
787
|
-
u
|
|
788
|
-
);
|
|
789
|
-
}
|
|
790
|
-
};
|
|
791
|
-
return {
|
|
792
|
-
error: $(r),
|
|
793
|
-
result: $(n),
|
|
794
|
-
statusList: $(s),
|
|
795
|
-
isSuspend: $(o),
|
|
796
|
-
start: g,
|
|
797
|
-
suspend: i,
|
|
798
|
-
resume: c,
|
|
799
|
-
update: l
|
|
800
783
|
};
|
|
801
784
|
}
|
|
802
|
-
function
|
|
803
|
-
if (!
|
|
785
|
+
function Sa(t, e = {}) {
|
|
786
|
+
if (!zt(t))
|
|
804
787
|
throw new Error("Entry must be a ref");
|
|
805
|
-
|
|
806
|
-
|
|
807
|
-
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
|
|
811
|
-
|
|
812
|
-
)
|
|
813
|
-
|
|
814
|
-
|
|
815
|
-
() => {
|
|
816
|
-
|
|
817
|
-
|
|
818
|
-
|
|
819
|
-
|
|
820
|
-
|
|
821
|
-
);
|
|
822
|
-
const s = (i, c = 0, u) => {
|
|
823
|
-
let h = [
|
|
824
|
-
null,
|
|
825
|
-
i
|
|
826
|
-
];
|
|
827
|
-
try {
|
|
828
|
-
o.reject = null, o.resolve = null;
|
|
829
|
-
const v = (j) => {
|
|
830
|
-
const [b, T] = j;
|
|
831
|
-
if (b) {
|
|
832
|
-
e.value = b, r.value = y;
|
|
833
|
-
const A = [b, y];
|
|
834
|
-
o.reject && o.reject(A), h = A, typeof u == "function" && u(A);
|
|
835
|
-
} else {
|
|
836
|
-
r.value = T, e.value = null;
|
|
837
|
-
const A = [null, O(T)];
|
|
838
|
-
o.resolve && o.resolve(A), h = A, typeof u == "function" && u(A);
|
|
839
|
-
}
|
|
840
|
-
};
|
|
841
|
-
ne(t.value, a, n, c, i, v);
|
|
842
|
-
} catch (v) {
|
|
843
|
-
const j = [v, y];
|
|
844
|
-
o.reject && o.reject(j), h = j, typeof u == "function" && u(j);
|
|
845
|
-
}
|
|
846
|
-
return h;
|
|
847
|
-
}, l = (i, c) => {
|
|
848
|
-
if (n.value = !1, t.value.length === 0) {
|
|
849
|
-
r.value = i, e.value = null;
|
|
850
|
-
const u = [
|
|
851
|
-
null,
|
|
852
|
-
O(r.value)
|
|
853
|
-
];
|
|
854
|
-
return typeof c == "function" && c(u), u;
|
|
855
|
-
}
|
|
856
|
-
return s(i, 0, c);
|
|
857
|
-
}, p = () => new Promise((i, c) => {
|
|
858
|
-
o.reject = c, o.resolve = i, n.value = !0;
|
|
859
|
-
}), g = (i) => {
|
|
860
|
-
if (n.value) {
|
|
861
|
-
n.value = !1;
|
|
862
|
-
const c = a.value.findIndex((u) => u.data === y);
|
|
863
|
-
return s(
|
|
864
|
-
a.value[Math.max(c - 1, 0)].data,
|
|
865
|
-
c,
|
|
866
|
-
i
|
|
867
|
-
);
|
|
788
|
+
const r = dt(() => t.value, !0, e);
|
|
789
|
+
return r.observe(t), pe(r);
|
|
790
|
+
}
|
|
791
|
+
function xa(t, e = {}) {
|
|
792
|
+
if (!zt(t))
|
|
793
|
+
throw new Error("Entry must be a ref");
|
|
794
|
+
const r = dt(() => t.value, !1, e);
|
|
795
|
+
return r.observe(t), {
|
|
796
|
+
...r.state,
|
|
797
|
+
start: (o, c) => r.start(o, c).outcome,
|
|
798
|
+
resume: (o) => {
|
|
799
|
+
const c = r.resume(o);
|
|
800
|
+
if (c)
|
|
801
|
+
return c.outcome;
|
|
802
|
+
const s = r.currentOutcome();
|
|
803
|
+
return o == null || o(s), s;
|
|
868
804
|
}
|
|
869
805
|
};
|
|
870
|
-
return {
|
|
871
|
-
error: $(e),
|
|
872
|
-
result: $(r),
|
|
873
|
-
statusList: $(a),
|
|
874
|
-
isSuspend: $(n),
|
|
875
|
-
start: l,
|
|
876
|
-
suspend: p,
|
|
877
|
-
resume: g
|
|
878
|
-
};
|
|
879
806
|
}
|
|
880
807
|
export {
|
|
881
|
-
|
|
882
|
-
|
|
883
|
-
|
|
808
|
+
Aa as useOrderFun,
|
|
809
|
+
Sa as useWatchOrderFun,
|
|
810
|
+
xa as useWatchOrderFunSync
|
|
884
811
|
};
|