paas-component-library 1.1.6 → 1.1.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/Delta-THK_X9-0.js +1440 -0
- package/dist/paas-ui.js +58943 -28644
- package/dist/paas-ui.umd.cjs +106 -57
- package/dist/quill-8ExwX4WW.js +5483 -0
- package/dist/style.css +1 -1
- package/package.json +9 -9
- package/src/components/MentionInput/index.vue +1 -3
- package/src/components/PaasUploadModal/index.vue +1 -1
|
@@ -0,0 +1,1440 @@
|
|
|
1
|
+
//#region \0rolldown/runtime.js
|
|
2
|
+
var e = Object.create, t = Object.defineProperty, n = Object.getOwnPropertyDescriptor, r = Object.getOwnPropertyNames, i = Object.getPrototypeOf, a = Object.prototype.hasOwnProperty, o = (e, t) => () => (t || (e((t = { exports: {} }).exports, t), e = null), t.exports), s = (e, n) => {
|
|
3
|
+
let r = {};
|
|
4
|
+
for (var i in e) t(r, i, {
|
|
5
|
+
get: e[i],
|
|
6
|
+
enumerable: !0
|
|
7
|
+
});
|
|
8
|
+
return n || t(r, Symbol.toStringTag, { value: "Module" }), r;
|
|
9
|
+
}, c = (e, i, o, s) => {
|
|
10
|
+
if (i && typeof i == "object" || typeof i == "function") for (var c = r(i), l = 0, u = c.length, d; l < u; l++) d = c[l], !a.call(e, d) && d !== o && t(e, d, {
|
|
11
|
+
get: ((e) => i[e]).bind(null, d),
|
|
12
|
+
enumerable: !(s = n(i, d)) || s.enumerable
|
|
13
|
+
});
|
|
14
|
+
return e;
|
|
15
|
+
}, l = (n, r, a) => (a = n == null ? {} : e(i(n)), c(r || !n || !n.__esModule ? t(a, "default", {
|
|
16
|
+
value: n,
|
|
17
|
+
enumerable: !0
|
|
18
|
+
}) : a, n)), u = typeof global == "object" && global && global.Object === Object && global, d = typeof self == "object" && self && self.Object === Object && self, f = u || d || Function("return this")(), p = f.Symbol, m = Object.prototype, h = m.hasOwnProperty, g = m.toString, _ = p ? p.toStringTag : void 0;
|
|
19
|
+
function v(e) {
|
|
20
|
+
var t = h.call(e, _), n = e[_];
|
|
21
|
+
try {
|
|
22
|
+
e[_] = void 0;
|
|
23
|
+
var r = !0;
|
|
24
|
+
} catch {}
|
|
25
|
+
var i = g.call(e);
|
|
26
|
+
return r && (t ? e[_] = n : delete e[_]), i;
|
|
27
|
+
}
|
|
28
|
+
//#endregion
|
|
29
|
+
//#region node_modules/lodash-es/_objectToString.js
|
|
30
|
+
var y = Object.prototype.toString;
|
|
31
|
+
function b(e) {
|
|
32
|
+
return y.call(e);
|
|
33
|
+
}
|
|
34
|
+
//#endregion
|
|
35
|
+
//#region node_modules/lodash-es/_baseGetTag.js
|
|
36
|
+
var x = "[object Null]", S = "[object Undefined]", C = p ? p.toStringTag : void 0;
|
|
37
|
+
function w(e) {
|
|
38
|
+
return e == null ? e === void 0 ? S : x : C && C in Object(e) ? v(e) : b(e);
|
|
39
|
+
}
|
|
40
|
+
//#endregion
|
|
41
|
+
//#region node_modules/lodash-es/isObject.js
|
|
42
|
+
function T(e) {
|
|
43
|
+
var t = typeof e;
|
|
44
|
+
return e != null && (t == "object" || t == "function");
|
|
45
|
+
}
|
|
46
|
+
//#endregion
|
|
47
|
+
//#region node_modules/lodash-es/isObjectLike.js
|
|
48
|
+
function E(e) {
|
|
49
|
+
return typeof e == "object" && !!e;
|
|
50
|
+
}
|
|
51
|
+
//#endregion
|
|
52
|
+
//#region node_modules/fast-diff/diff.js
|
|
53
|
+
var D = /* @__PURE__ */ o(((e, t) => {
|
|
54
|
+
var n = -1, r = 1, i = 0;
|
|
55
|
+
function a(e, t, n, r, a) {
|
|
56
|
+
if (e === t) return e ? [[i, e]] : [];
|
|
57
|
+
if (n != null) {
|
|
58
|
+
var s = D(e, t, n);
|
|
59
|
+
if (s) return s;
|
|
60
|
+
}
|
|
61
|
+
var c = l(e, t), u = e.substring(0, c);
|
|
62
|
+
e = e.substring(c), t = t.substring(c), c = d(e, t);
|
|
63
|
+
var f = e.substring(e.length - c);
|
|
64
|
+
e = e.substring(0, e.length - c), t = t.substring(0, t.length - c);
|
|
65
|
+
var m = o(e, t);
|
|
66
|
+
return u && m.unshift([i, u]), f && m.push([i, f]), b(m, a), r && p(m), m;
|
|
67
|
+
}
|
|
68
|
+
function o(e, t) {
|
|
69
|
+
var o;
|
|
70
|
+
if (!e) return [[r, t]];
|
|
71
|
+
if (!t) return [[n, e]];
|
|
72
|
+
var c = e.length > t.length ? e : t, l = e.length > t.length ? t : e, u = c.indexOf(l);
|
|
73
|
+
if (u !== -1) return o = [
|
|
74
|
+
[r, c.substring(0, u)],
|
|
75
|
+
[i, l],
|
|
76
|
+
[r, c.substring(u + l.length)]
|
|
77
|
+
], e.length > t.length && (o[0][0] = o[2][0] = n), o;
|
|
78
|
+
if (l.length === 1) return [[n, e], [r, t]];
|
|
79
|
+
var d = f(e, t);
|
|
80
|
+
if (d) {
|
|
81
|
+
var p = d[0], m = d[1], h = d[2], g = d[3], _ = d[4], v = a(p, h), y = a(m, g);
|
|
82
|
+
return v.concat([[i, _]], y);
|
|
83
|
+
}
|
|
84
|
+
return s(e, t);
|
|
85
|
+
}
|
|
86
|
+
function s(e, t) {
|
|
87
|
+
for (var i = e.length, a = t.length, o = Math.ceil((i + a) / 2), s = o, l = 2 * o, u = Array(l), d = Array(l), f = 0; f < l; f++) u[f] = -1, d[f] = -1;
|
|
88
|
+
u[s + 1] = 0, d[s + 1] = 0;
|
|
89
|
+
for (var p = i - a, m = p % 2 != 0, h = 0, g = 0, _ = 0, v = 0, y = 0; y < o; y++) {
|
|
90
|
+
for (var b = -y + h; b <= y - g; b += 2) {
|
|
91
|
+
for (var x = s + b, S = b === -y || b !== y && u[x - 1] < u[x + 1] ? u[x + 1] : u[x - 1] + 1, C = S - b; S < i && C < a && e.charAt(S) === t.charAt(C);) S++, C++;
|
|
92
|
+
if (u[x] = S, S > i) g += 2;
|
|
93
|
+
else if (C > a) h += 2;
|
|
94
|
+
else if (m) {
|
|
95
|
+
var w = s + p - b;
|
|
96
|
+
if (w >= 0 && w < l && d[w] !== -1) {
|
|
97
|
+
var T = i - d[w];
|
|
98
|
+
if (S >= T) return c(e, t, S, C);
|
|
99
|
+
}
|
|
100
|
+
}
|
|
101
|
+
}
|
|
102
|
+
for (var E = -y + _; E <= y - v; E += 2) {
|
|
103
|
+
for (var w = s + E, T = E === -y || E !== y && d[w - 1] < d[w + 1] ? d[w + 1] : d[w - 1] + 1, D = T - E; T < i && D < a && e.charAt(i - T - 1) === t.charAt(a - D - 1);) T++, D++;
|
|
104
|
+
if (d[w] = T, T > i) v += 2;
|
|
105
|
+
else if (D > a) _ += 2;
|
|
106
|
+
else if (!m) {
|
|
107
|
+
var x = s + p - E;
|
|
108
|
+
if (x >= 0 && x < l && u[x] !== -1) {
|
|
109
|
+
var S = u[x], C = s + S - x;
|
|
110
|
+
if (T = i - T, S >= T) return c(e, t, S, C);
|
|
111
|
+
}
|
|
112
|
+
}
|
|
113
|
+
}
|
|
114
|
+
}
|
|
115
|
+
return [[n, e], [r, t]];
|
|
116
|
+
}
|
|
117
|
+
function c(e, t, n, r) {
|
|
118
|
+
var i = e.substring(0, n), o = t.substring(0, r), s = e.substring(n), c = t.substring(r), l = a(i, o), u = a(s, c);
|
|
119
|
+
return l.concat(u);
|
|
120
|
+
}
|
|
121
|
+
function l(e, t) {
|
|
122
|
+
if (!e || !t || e.charAt(0) !== t.charAt(0)) return 0;
|
|
123
|
+
for (var n = 0, r = Math.min(e.length, t.length), i = r, a = 0; n < i;) e.substring(a, i) == t.substring(a, i) ? (n = i, a = n) : r = i, i = Math.floor((r - n) / 2 + n);
|
|
124
|
+
return x(e.charCodeAt(i - 1)) && i--, i;
|
|
125
|
+
}
|
|
126
|
+
function u(e, t) {
|
|
127
|
+
var n = e.length, r = t.length;
|
|
128
|
+
if (n == 0 || r == 0) return 0;
|
|
129
|
+
n > r ? e = e.substring(n - r) : n < r && (t = t.substring(0, n));
|
|
130
|
+
var i = Math.min(n, r);
|
|
131
|
+
if (e == t) return i;
|
|
132
|
+
for (var a = 0, o = 1;;) {
|
|
133
|
+
var s = e.substring(i - o), c = t.indexOf(s);
|
|
134
|
+
if (c == -1) return a;
|
|
135
|
+
o += c, (c == 0 || e.substring(i - o) == t.substring(0, o)) && (a = o, o++);
|
|
136
|
+
}
|
|
137
|
+
}
|
|
138
|
+
function d(e, t) {
|
|
139
|
+
if (!e || !t || e.slice(-1) !== t.slice(-1)) return 0;
|
|
140
|
+
for (var n = 0, r = Math.min(e.length, t.length), i = r, a = 0; n < i;) e.substring(e.length - i, e.length - a) == t.substring(t.length - i, t.length - a) ? (n = i, a = n) : r = i, i = Math.floor((r - n) / 2 + n);
|
|
141
|
+
return S(e.charCodeAt(e.length - i)) && i--, i;
|
|
142
|
+
}
|
|
143
|
+
function f(e, t) {
|
|
144
|
+
var n = e.length > t.length ? e : t, r = e.length > t.length ? t : e;
|
|
145
|
+
if (n.length < 4 || r.length * 2 < n.length) return null;
|
|
146
|
+
function i(e, t, n) {
|
|
147
|
+
for (var r = e.substring(n, n + Math.floor(e.length / 4)), i = -1, a = "", o, s, c, u; (i = t.indexOf(r, i + 1)) !== -1;) {
|
|
148
|
+
var f = l(e.substring(n), t.substring(i)), p = d(e.substring(0, n), t.substring(0, i));
|
|
149
|
+
a.length < p + f && (a = t.substring(i - p, i) + t.substring(i, i + f), o = e.substring(0, n - p), s = e.substring(n + f), c = t.substring(0, i - p), u = t.substring(i + f));
|
|
150
|
+
}
|
|
151
|
+
return a.length * 2 >= e.length ? [
|
|
152
|
+
o,
|
|
153
|
+
s,
|
|
154
|
+
c,
|
|
155
|
+
u,
|
|
156
|
+
a
|
|
157
|
+
] : null;
|
|
158
|
+
}
|
|
159
|
+
var a = i(n, r, Math.ceil(n.length / 4)), o = i(n, r, Math.ceil(n.length / 2)), s;
|
|
160
|
+
if (!a && !o) return null;
|
|
161
|
+
s = o ? a && a[4].length > o[4].length ? a : o : a;
|
|
162
|
+
var c, u, f, p;
|
|
163
|
+
e.length > t.length ? (c = s[0], u = s[1], f = s[2], p = s[3]) : (f = s[0], p = s[1], c = s[2], u = s[3]);
|
|
164
|
+
var m = s[4];
|
|
165
|
+
return [
|
|
166
|
+
c,
|
|
167
|
+
u,
|
|
168
|
+
f,
|
|
169
|
+
p,
|
|
170
|
+
m
|
|
171
|
+
];
|
|
172
|
+
}
|
|
173
|
+
function p(e) {
|
|
174
|
+
for (var t = !1, a = [], o = 0, s = null, c = 0, l = 0, d = 0, f = 0, p = 0; c < e.length;) e[c][0] == i ? (a[o++] = c, l = f, d = p, f = 0, p = 0, s = e[c][1]) : (e[c][0] == r ? f += e[c][1].length : p += e[c][1].length, s && s.length <= Math.max(l, d) && s.length <= Math.max(f, p) && (e.splice(a[o - 1], 0, [n, s]), e[a[o - 1] + 1][0] = r, o--, o--, c = o > 0 ? a[o - 1] : -1, l = 0, d = 0, f = 0, p = 0, s = null, t = !0)), c++;
|
|
175
|
+
for (t && b(e), y(e), c = 1; c < e.length;) {
|
|
176
|
+
if (e[c - 1][0] == n && e[c][0] == r) {
|
|
177
|
+
var m = e[c - 1][1], h = e[c][1], g = u(m, h), _ = u(h, m);
|
|
178
|
+
g >= _ ? (g >= m.length / 2 || g >= h.length / 2) && (e.splice(c, 0, [i, h.substring(0, g)]), e[c - 1][1] = m.substring(0, m.length - g), e[c + 1][1] = h.substring(g), c++) : (_ >= m.length / 2 || _ >= h.length / 2) && (e.splice(c, 0, [i, m.substring(0, _)]), e[c - 1][0] = r, e[c - 1][1] = h.substring(0, h.length - _), e[c + 1][0] = n, e[c + 1][1] = m.substring(_), c++), c++;
|
|
179
|
+
}
|
|
180
|
+
c++;
|
|
181
|
+
}
|
|
182
|
+
}
|
|
183
|
+
var m = /[^a-zA-Z0-9]/, h = /\s/, g = /[\r\n]/, _ = /\n\r?\n$/, v = /^\r?\n\r?\n/;
|
|
184
|
+
function y(e) {
|
|
185
|
+
function t(e, t) {
|
|
186
|
+
if (!e || !t) return 6;
|
|
187
|
+
var n = e.charAt(e.length - 1), r = t.charAt(0), i = n.match(m), a = r.match(m), o = i && n.match(h), s = a && r.match(h), c = o && n.match(g), l = s && r.match(g), u = c && e.match(_), d = l && t.match(v);
|
|
188
|
+
return u || d ? 5 : c || l ? 4 : i && !o && s ? 3 : o || s ? 2 : i || a ? 1 : 0;
|
|
189
|
+
}
|
|
190
|
+
for (var n = 1; n < e.length - 1;) {
|
|
191
|
+
if (e[n - 1][0] == i && e[n + 1][0] == i) {
|
|
192
|
+
var r = e[n - 1][1], a = e[n][1], o = e[n + 1][1], s = d(r, a);
|
|
193
|
+
if (s) {
|
|
194
|
+
var c = a.substring(a.length - s);
|
|
195
|
+
r = r.substring(0, r.length - s), a = c + a.substring(0, a.length - s), o = c + o;
|
|
196
|
+
}
|
|
197
|
+
for (var l = r, u = a, f = o, p = t(r, a) + t(a, o); a.charAt(0) === o.charAt(0);) {
|
|
198
|
+
r += a.charAt(0), a = a.substring(1) + o.charAt(0), o = o.substring(1);
|
|
199
|
+
var y = t(r, a) + t(a, o);
|
|
200
|
+
y >= p && (p = y, l = r, u = a, f = o);
|
|
201
|
+
}
|
|
202
|
+
e[n - 1][1] != l && (l ? e[n - 1][1] = l : (e.splice(n - 1, 1), n--), e[n][1] = u, f ? e[n + 1][1] = f : (e.splice(n + 1, 1), n--));
|
|
203
|
+
}
|
|
204
|
+
n++;
|
|
205
|
+
}
|
|
206
|
+
}
|
|
207
|
+
function b(e, t) {
|
|
208
|
+
e.push([i, ""]);
|
|
209
|
+
for (var a = 0, o = 0, s = 0, c = "", u = "", f; a < e.length;) {
|
|
210
|
+
if (a < e.length - 1 && !e[a][1]) {
|
|
211
|
+
e.splice(a, 1);
|
|
212
|
+
continue;
|
|
213
|
+
}
|
|
214
|
+
switch (e[a][0]) {
|
|
215
|
+
case r:
|
|
216
|
+
s++, u += e[a][1], a++;
|
|
217
|
+
break;
|
|
218
|
+
case n:
|
|
219
|
+
o++, c += e[a][1], a++;
|
|
220
|
+
break;
|
|
221
|
+
case i:
|
|
222
|
+
var p = a - s - o - 1;
|
|
223
|
+
if (t) {
|
|
224
|
+
if (p >= 0 && w(e[p][1])) {
|
|
225
|
+
var m = e[p][1].slice(-1);
|
|
226
|
+
if (e[p][1] = e[p][1].slice(0, -1), c = m + c, u = m + u, !e[p][1]) {
|
|
227
|
+
e.splice(p, 1), a--;
|
|
228
|
+
var h = p - 1;
|
|
229
|
+
e[h] && e[h][0] === r && (s++, u = e[h][1] + u, h--), e[h] && e[h][0] === n && (o++, c = e[h][1] + c, h--), p = h;
|
|
230
|
+
}
|
|
231
|
+
}
|
|
232
|
+
if (C(e[a][1])) {
|
|
233
|
+
var m = e[a][1].charAt(0);
|
|
234
|
+
e[a][1] = e[a][1].slice(1), c += m, u += m;
|
|
235
|
+
}
|
|
236
|
+
}
|
|
237
|
+
if (a < e.length - 1 && !e[a][1]) {
|
|
238
|
+
e.splice(a, 1);
|
|
239
|
+
break;
|
|
240
|
+
}
|
|
241
|
+
if (c.length > 0 || u.length > 0) {
|
|
242
|
+
c.length > 0 && u.length > 0 && (f = l(u, c), f !== 0 && (p >= 0 ? e[p][1] += u.substring(0, f) : (e.splice(0, 0, [i, u.substring(0, f)]), a++), u = u.substring(f), c = c.substring(f)), f = d(u, c), f !== 0 && (e[a][1] = u.substring(u.length - f) + e[a][1], u = u.substring(0, u.length - f), c = c.substring(0, c.length - f)));
|
|
243
|
+
var g = s + o;
|
|
244
|
+
c.length === 0 && u.length === 0 ? (e.splice(a - g, g), a -= g) : c.length === 0 ? (e.splice(a - g, g, [r, u]), a = a - g + 1) : u.length === 0 ? (e.splice(a - g, g, [n, c]), a = a - g + 1) : (e.splice(a - g, g, [n, c], [r, u]), a = a - g + 2);
|
|
245
|
+
}
|
|
246
|
+
a !== 0 && e[a - 1][0] === i ? (e[a - 1][1] += e[a][1], e.splice(a, 1)) : a++, s = 0, o = 0, c = "", u = "";
|
|
247
|
+
break;
|
|
248
|
+
}
|
|
249
|
+
}
|
|
250
|
+
e[e.length - 1][1] === "" && e.pop();
|
|
251
|
+
var _ = !1;
|
|
252
|
+
for (a = 1; a < e.length - 1;) e[a - 1][0] === i && e[a + 1][0] === i && (e[a][1].substring(e[a][1].length - e[a - 1][1].length) === e[a - 1][1] ? (e[a][1] = e[a - 1][1] + e[a][1].substring(0, e[a][1].length - e[a - 1][1].length), e[a + 1][1] = e[a - 1][1] + e[a + 1][1], e.splice(a - 1, 1), _ = !0) : e[a][1].substring(0, e[a + 1][1].length) == e[a + 1][1] && (e[a - 1][1] += e[a + 1][1], e[a][1] = e[a][1].substring(e[a + 1][1].length) + e[a + 1][1], e.splice(a + 1, 1), _ = !0)), a++;
|
|
253
|
+
_ && b(e, t);
|
|
254
|
+
}
|
|
255
|
+
function x(e) {
|
|
256
|
+
return e >= 55296 && e <= 56319;
|
|
257
|
+
}
|
|
258
|
+
function S(e) {
|
|
259
|
+
return e >= 56320 && e <= 57343;
|
|
260
|
+
}
|
|
261
|
+
function C(e) {
|
|
262
|
+
return S(e.charCodeAt(0));
|
|
263
|
+
}
|
|
264
|
+
function w(e) {
|
|
265
|
+
return x(e.charCodeAt(e.length - 1));
|
|
266
|
+
}
|
|
267
|
+
function T(e) {
|
|
268
|
+
for (var t = [], n = 0; n < e.length; n++) e[n][1].length > 0 && t.push(e[n]);
|
|
269
|
+
return t;
|
|
270
|
+
}
|
|
271
|
+
function E(e, t, a, o) {
|
|
272
|
+
return w(e) || C(o) ? null : T([
|
|
273
|
+
[i, e],
|
|
274
|
+
[n, t],
|
|
275
|
+
[r, a],
|
|
276
|
+
[i, o]
|
|
277
|
+
]);
|
|
278
|
+
}
|
|
279
|
+
function D(e, t, n) {
|
|
280
|
+
var r = typeof n == "number" ? {
|
|
281
|
+
index: n,
|
|
282
|
+
length: 0
|
|
283
|
+
} : n.oldRange, i = typeof n == "number" ? null : n.newRange, a = e.length, o = t.length;
|
|
284
|
+
if (r.length === 0 && (i === null || i.length === 0)) {
|
|
285
|
+
var s = r.index, c = e.slice(0, s), l = e.slice(s), u = i ? i.index : null;
|
|
286
|
+
editBefore: {
|
|
287
|
+
var d = s + o - a;
|
|
288
|
+
if (u !== null && u !== d || d < 0 || d > o) break editBefore;
|
|
289
|
+
var f = t.slice(0, d), p = t.slice(d);
|
|
290
|
+
if (p !== l) break editBefore;
|
|
291
|
+
var m = Math.min(s, d), h = c.slice(0, m), g = f.slice(0, m);
|
|
292
|
+
if (h !== g) break editBefore;
|
|
293
|
+
var _ = c.slice(m), v = f.slice(m);
|
|
294
|
+
return E(h, _, v, l);
|
|
295
|
+
}
|
|
296
|
+
editAfter: {
|
|
297
|
+
if (u !== null && u !== s) break editAfter;
|
|
298
|
+
var y = s, f = t.slice(0, y), p = t.slice(y);
|
|
299
|
+
if (f !== c) break editAfter;
|
|
300
|
+
var b = Math.min(a - y, o - y), x = l.slice(l.length - b), S = p.slice(p.length - b);
|
|
301
|
+
if (x !== S) break editAfter;
|
|
302
|
+
var _ = l.slice(0, l.length - b), v = p.slice(0, p.length - b);
|
|
303
|
+
return E(c, _, v, x);
|
|
304
|
+
}
|
|
305
|
+
}
|
|
306
|
+
if (r.length > 0 && i && i.length === 0) replaceRange: {
|
|
307
|
+
var h = e.slice(0, r.index), x = e.slice(r.index + r.length), m = h.length, b = x.length;
|
|
308
|
+
if (o < m + b) break replaceRange;
|
|
309
|
+
var g = t.slice(0, m), S = t.slice(o - b);
|
|
310
|
+
if (h !== g || x !== S) break replaceRange;
|
|
311
|
+
var _ = e.slice(m, a - b), v = t.slice(m, o - b);
|
|
312
|
+
return E(h, _, v, x);
|
|
313
|
+
}
|
|
314
|
+
return null;
|
|
315
|
+
}
|
|
316
|
+
function O(e, t, n, r) {
|
|
317
|
+
return a(e, t, n, r, !0);
|
|
318
|
+
}
|
|
319
|
+
O.INSERT = r, O.DELETE = n, O.EQUAL = i, t.exports = O;
|
|
320
|
+
})), O = /* @__PURE__ */ o(((e, t) => {
|
|
321
|
+
var n = "__lodash_hash_undefined__", r = 9007199254740991, i = "[object Arguments]", a = "[object Array]", o = "[object Boolean]", s = "[object Date]", c = "[object Error]", l = "[object Function]", u = "[object GeneratorFunction]", d = "[object Map]", f = "[object Number]", p = "[object Object]", m = "[object Promise]", h = "[object RegExp]", g = "[object Set]", _ = "[object String]", v = "[object Symbol]", y = "[object WeakMap]", b = "[object ArrayBuffer]", x = "[object DataView]", S = "[object Float32Array]", C = "[object Float64Array]", w = "[object Int8Array]", T = "[object Int16Array]", E = "[object Int32Array]", D = "[object Uint8Array]", O = "[object Uint8ClampedArray]", ee = "[object Uint16Array]", te = "[object Uint32Array]", ne = /[\\^$.*+?()[\]{}|]/g, re = /\w*$/, ie = /^\[object .+?Constructor\]$/, k = /^(?:0|[1-9]\d*)$/, A = {};
|
|
322
|
+
A[i] = A[a] = A[b] = A[x] = A[o] = A[s] = A[S] = A[C] = A[w] = A[T] = A[E] = A[d] = A[f] = A[p] = A[h] = A[g] = A[_] = A[v] = A[D] = A[O] = A[ee] = A[te] = !0, A[c] = A[l] = A[y] = !1;
|
|
323
|
+
var ae = typeof global == "object" && global && global.Object === Object && global, j = typeof self == "object" && self && self.Object === Object && self, M = ae || j || Function("return this")(), oe = typeof e == "object" && e && !e.nodeType && e, se = oe && typeof t == "object" && t && !t.nodeType && t, ce = se && se.exports === oe;
|
|
324
|
+
function le(e, t) {
|
|
325
|
+
return e.set(t[0], t[1]), e;
|
|
326
|
+
}
|
|
327
|
+
function ue(e, t) {
|
|
328
|
+
return e.add(t), e;
|
|
329
|
+
}
|
|
330
|
+
function de(e, t) {
|
|
331
|
+
for (var n = -1, r = e ? e.length : 0; ++n < r && t(e[n], n, e) !== !1;);
|
|
332
|
+
return e;
|
|
333
|
+
}
|
|
334
|
+
function fe(e, t) {
|
|
335
|
+
for (var n = -1, r = t.length, i = e.length; ++n < r;) e[i + n] = t[n];
|
|
336
|
+
return e;
|
|
337
|
+
}
|
|
338
|
+
function pe(e, t, n, r) {
|
|
339
|
+
var i = -1, a = e ? e.length : 0;
|
|
340
|
+
for (r && a && (n = e[++i]); ++i < a;) n = t(n, e[i], i, e);
|
|
341
|
+
return n;
|
|
342
|
+
}
|
|
343
|
+
function me(e, t) {
|
|
344
|
+
for (var n = -1, r = Array(e); ++n < e;) r[n] = t(n);
|
|
345
|
+
return r;
|
|
346
|
+
}
|
|
347
|
+
function he(e, t) {
|
|
348
|
+
return e?.[t];
|
|
349
|
+
}
|
|
350
|
+
function ge(e) {
|
|
351
|
+
var t = !1;
|
|
352
|
+
if (e != null && typeof e.toString != "function") try {
|
|
353
|
+
t = !!(e + "");
|
|
354
|
+
} catch {}
|
|
355
|
+
return t;
|
|
356
|
+
}
|
|
357
|
+
function _e(e) {
|
|
358
|
+
var t = -1, n = Array(e.size);
|
|
359
|
+
return e.forEach(function(e, r) {
|
|
360
|
+
n[++t] = [r, e];
|
|
361
|
+
}), n;
|
|
362
|
+
}
|
|
363
|
+
function ve(e, t) {
|
|
364
|
+
return function(n) {
|
|
365
|
+
return e(t(n));
|
|
366
|
+
};
|
|
367
|
+
}
|
|
368
|
+
function ye(e) {
|
|
369
|
+
var t = -1, n = Array(e.size);
|
|
370
|
+
return e.forEach(function(e) {
|
|
371
|
+
n[++t] = e;
|
|
372
|
+
}), n;
|
|
373
|
+
}
|
|
374
|
+
var be = Array.prototype, xe = Function.prototype, Se = Object.prototype, N = M["__core-js_shared__"], Ce = function() {
|
|
375
|
+
var e = /[^.]+$/.exec(N && N.keys && N.keys.IE_PROTO || "");
|
|
376
|
+
return e ? "Symbol(src)_1." + e : "";
|
|
377
|
+
}(), we = xe.toString, P = Se.hasOwnProperty, Te = Se.toString, Ee = RegExp("^" + we.call(P).replace(ne, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"), De = ce ? M.Buffer : void 0, Oe = M.Symbol, F = M.Uint8Array, ke = ve(Object.getPrototypeOf, Object), Ae = Object.create, je = Se.propertyIsEnumerable, I = be.splice, Me = Object.getOwnPropertySymbols, Ne = De ? De.isBuffer : void 0, Pe = ve(Object.keys, Object), Fe = Y(M, "DataView"), L = Y(M, "Map"), Ie = Y(M, "Promise"), Le = Y(M, "Set"), R = Y(M, "WeakMap"), z = Y(Object, "create"), Re = Q(Fe), ze = Q(L), Be = Q(Ie), Ve = Q(Le), He = Q(R), Ue = Oe ? Oe.prototype : void 0, We = Ue ? Ue.valueOf : void 0;
|
|
378
|
+
function B(e) {
|
|
379
|
+
var t = -1, n = e ? e.length : 0;
|
|
380
|
+
for (this.clear(); ++t < n;) {
|
|
381
|
+
var r = e[t];
|
|
382
|
+
this.set(r[0], r[1]);
|
|
383
|
+
}
|
|
384
|
+
}
|
|
385
|
+
function Ge() {
|
|
386
|
+
this.__data__ = z ? z(null) : {};
|
|
387
|
+
}
|
|
388
|
+
function Ke(e) {
|
|
389
|
+
return this.has(e) && delete this.__data__[e];
|
|
390
|
+
}
|
|
391
|
+
function qe(e) {
|
|
392
|
+
var t = this.__data__;
|
|
393
|
+
if (z) {
|
|
394
|
+
var r = t[e];
|
|
395
|
+
return r === n ? void 0 : r;
|
|
396
|
+
}
|
|
397
|
+
return P.call(t, e) ? t[e] : void 0;
|
|
398
|
+
}
|
|
399
|
+
function Je(e) {
|
|
400
|
+
var t = this.__data__;
|
|
401
|
+
return z ? t[e] !== void 0 : P.call(t, e);
|
|
402
|
+
}
|
|
403
|
+
function Ye(e, t) {
|
|
404
|
+
var r = this.__data__;
|
|
405
|
+
return r[e] = z && t === void 0 ? n : t, this;
|
|
406
|
+
}
|
|
407
|
+
B.prototype.clear = Ge, B.prototype.delete = Ke, B.prototype.get = qe, B.prototype.has = Je, B.prototype.set = Ye;
|
|
408
|
+
function V(e) {
|
|
409
|
+
var t = -1, n = e ? e.length : 0;
|
|
410
|
+
for (this.clear(); ++t < n;) {
|
|
411
|
+
var r = e[t];
|
|
412
|
+
this.set(r[0], r[1]);
|
|
413
|
+
}
|
|
414
|
+
}
|
|
415
|
+
function Xe() {
|
|
416
|
+
this.__data__ = [];
|
|
417
|
+
}
|
|
418
|
+
function Ze(e) {
|
|
419
|
+
var t = this.__data__, n = ft(t, e);
|
|
420
|
+
return n < 0 ? !1 : (n == t.length - 1 ? t.pop() : I.call(t, n, 1), !0);
|
|
421
|
+
}
|
|
422
|
+
function Qe(e) {
|
|
423
|
+
var t = this.__data__, n = ft(t, e);
|
|
424
|
+
return n < 0 ? void 0 : t[n][1];
|
|
425
|
+
}
|
|
426
|
+
function $e(e) {
|
|
427
|
+
return ft(this.__data__, e) > -1;
|
|
428
|
+
}
|
|
429
|
+
function et(e, t) {
|
|
430
|
+
var n = this.__data__, r = ft(n, e);
|
|
431
|
+
return r < 0 ? n.push([e, t]) : n[r][1] = t, this;
|
|
432
|
+
}
|
|
433
|
+
V.prototype.clear = Xe, V.prototype.delete = Ze, V.prototype.get = Qe, V.prototype.has = $e, V.prototype.set = et;
|
|
434
|
+
function H(e) {
|
|
435
|
+
var t = -1, n = e ? e.length : 0;
|
|
436
|
+
for (this.clear(); ++t < n;) {
|
|
437
|
+
var r = e[t];
|
|
438
|
+
this.set(r[0], r[1]);
|
|
439
|
+
}
|
|
440
|
+
}
|
|
441
|
+
function tt() {
|
|
442
|
+
this.__data__ = {
|
|
443
|
+
hash: new B(),
|
|
444
|
+
map: new (L || V)(),
|
|
445
|
+
string: new B()
|
|
446
|
+
};
|
|
447
|
+
}
|
|
448
|
+
function nt(e) {
|
|
449
|
+
return Ot(this, e).delete(e);
|
|
450
|
+
}
|
|
451
|
+
function rt(e) {
|
|
452
|
+
return Ot(this, e).get(e);
|
|
453
|
+
}
|
|
454
|
+
function it(e) {
|
|
455
|
+
return Ot(this, e).has(e);
|
|
456
|
+
}
|
|
457
|
+
function at(e, t) {
|
|
458
|
+
return Ot(this, e).set(e, t), this;
|
|
459
|
+
}
|
|
460
|
+
H.prototype.clear = tt, H.prototype.delete = nt, H.prototype.get = rt, H.prototype.has = it, H.prototype.set = at;
|
|
461
|
+
function U(e) {
|
|
462
|
+
this.__data__ = new V(e);
|
|
463
|
+
}
|
|
464
|
+
function ot() {
|
|
465
|
+
this.__data__ = new V();
|
|
466
|
+
}
|
|
467
|
+
function st(e) {
|
|
468
|
+
return this.__data__.delete(e);
|
|
469
|
+
}
|
|
470
|
+
function W(e) {
|
|
471
|
+
return this.__data__.get(e);
|
|
472
|
+
}
|
|
473
|
+
function ct(e) {
|
|
474
|
+
return this.__data__.has(e);
|
|
475
|
+
}
|
|
476
|
+
function lt(e, t) {
|
|
477
|
+
var n = this.__data__;
|
|
478
|
+
if (n instanceof V) {
|
|
479
|
+
var r = n.__data__;
|
|
480
|
+
if (!L || r.length < 199) return r.push([e, t]), this;
|
|
481
|
+
n = this.__data__ = new H(r);
|
|
482
|
+
}
|
|
483
|
+
return n.set(e, t), this;
|
|
484
|
+
}
|
|
485
|
+
U.prototype.clear = ot, U.prototype.delete = st, U.prototype.get = W, U.prototype.has = ct, U.prototype.set = lt;
|
|
486
|
+
function ut(e, t) {
|
|
487
|
+
var n = $(e) || Rt(e) ? me(e.length, String) : [], r = n.length, i = !!r;
|
|
488
|
+
for (var a in e) (t || P.call(e, a)) && !(i && (a == "length" || Mt(a, r))) && n.push(a);
|
|
489
|
+
return n;
|
|
490
|
+
}
|
|
491
|
+
function dt(e, t, n) {
|
|
492
|
+
var r = e[t];
|
|
493
|
+
(!(P.call(e, t) && Lt(r, n)) || n === void 0 && !(t in e)) && (e[t] = n);
|
|
494
|
+
}
|
|
495
|
+
function ft(e, t) {
|
|
496
|
+
for (var n = e.length; n--;) if (Lt(e[n][0], t)) return n;
|
|
497
|
+
return -1;
|
|
498
|
+
}
|
|
499
|
+
function pt(e, t) {
|
|
500
|
+
return e && Et(t, Kt(t), e);
|
|
501
|
+
}
|
|
502
|
+
function G(e, t, n, r, a, o, s) {
|
|
503
|
+
var c;
|
|
504
|
+
if (r && (c = o ? r(e, a, o, s) : r(e)), c !== void 0) return c;
|
|
505
|
+
if (!Wt(e)) return e;
|
|
506
|
+
var d = $(e);
|
|
507
|
+
if (d) {
|
|
508
|
+
if (c = At(e), !t) return q(e, c);
|
|
509
|
+
} else {
|
|
510
|
+
var f = X(e), m = f == l || f == u;
|
|
511
|
+
if (Vt(e)) return vt(e, t);
|
|
512
|
+
if (f == p || f == i || m && !o) {
|
|
513
|
+
if (ge(e)) return o ? e : {};
|
|
514
|
+
if (c = Z(m ? {} : e), !t) return Dt(e, pt(c, e));
|
|
515
|
+
} else {
|
|
516
|
+
if (!A[f]) return o ? e : {};
|
|
517
|
+
c = jt(e, f, G, t);
|
|
518
|
+
}
|
|
519
|
+
}
|
|
520
|
+
s ||= new U();
|
|
521
|
+
var h = s.get(e);
|
|
522
|
+
if (h) return h;
|
|
523
|
+
if (s.set(e, c), !d) var g = n ? J(e) : Kt(e);
|
|
524
|
+
return de(g || e, function(i, a) {
|
|
525
|
+
g && (a = i, i = e[a]), dt(c, a, G(i, t, n, r, a, e, s));
|
|
526
|
+
}), c;
|
|
527
|
+
}
|
|
528
|
+
function mt(e) {
|
|
529
|
+
return Wt(e) ? Ae(e) : {};
|
|
530
|
+
}
|
|
531
|
+
function K(e, t, n) {
|
|
532
|
+
var r = t(e);
|
|
533
|
+
return $(e) ? r : fe(r, n(e));
|
|
534
|
+
}
|
|
535
|
+
function ht(e) {
|
|
536
|
+
return Te.call(e);
|
|
537
|
+
}
|
|
538
|
+
function gt(e) {
|
|
539
|
+
return !Wt(e) || Pt(e) ? !1 : (Ht(e) || ge(e) ? Ee : ie).test(Q(e));
|
|
540
|
+
}
|
|
541
|
+
function _t(e) {
|
|
542
|
+
if (!Ft(e)) return Pe(e);
|
|
543
|
+
var t = [];
|
|
544
|
+
for (var n in Object(e)) P.call(e, n) && n != "constructor" && t.push(n);
|
|
545
|
+
return t;
|
|
546
|
+
}
|
|
547
|
+
function vt(e, t) {
|
|
548
|
+
if (t) return e.slice();
|
|
549
|
+
var n = new e.constructor(e.length);
|
|
550
|
+
return e.copy(n), n;
|
|
551
|
+
}
|
|
552
|
+
function yt(e) {
|
|
553
|
+
var t = new e.constructor(e.byteLength);
|
|
554
|
+
return new F(t).set(new F(e)), t;
|
|
555
|
+
}
|
|
556
|
+
function bt(e, t) {
|
|
557
|
+
var n = t ? yt(e.buffer) : e.buffer;
|
|
558
|
+
return new e.constructor(n, e.byteOffset, e.byteLength);
|
|
559
|
+
}
|
|
560
|
+
function xt(e, t, n) {
|
|
561
|
+
return pe(t ? n(_e(e), !0) : _e(e), le, new e.constructor());
|
|
562
|
+
}
|
|
563
|
+
function St(e) {
|
|
564
|
+
var t = new e.constructor(e.source, re.exec(e));
|
|
565
|
+
return t.lastIndex = e.lastIndex, t;
|
|
566
|
+
}
|
|
567
|
+
function Ct(e, t, n) {
|
|
568
|
+
return pe(t ? n(ye(e), !0) : ye(e), ue, new e.constructor());
|
|
569
|
+
}
|
|
570
|
+
function wt(e) {
|
|
571
|
+
return We ? Object(We.call(e)) : {};
|
|
572
|
+
}
|
|
573
|
+
function Tt(e, t) {
|
|
574
|
+
var n = t ? yt(e.buffer) : e.buffer;
|
|
575
|
+
return new e.constructor(n, e.byteOffset, e.length);
|
|
576
|
+
}
|
|
577
|
+
function q(e, t) {
|
|
578
|
+
var n = -1, r = e.length;
|
|
579
|
+
for (t ||= Array(r); ++n < r;) t[n] = e[n];
|
|
580
|
+
return t;
|
|
581
|
+
}
|
|
582
|
+
function Et(e, t, n, r) {
|
|
583
|
+
n ||= {};
|
|
584
|
+
for (var i = -1, a = t.length; ++i < a;) {
|
|
585
|
+
var o = t[i], s = r ? r(n[o], e[o], o, n, e) : void 0;
|
|
586
|
+
dt(n, o, s === void 0 ? e[o] : s);
|
|
587
|
+
}
|
|
588
|
+
return n;
|
|
589
|
+
}
|
|
590
|
+
function Dt(e, t) {
|
|
591
|
+
return Et(e, kt(e), t);
|
|
592
|
+
}
|
|
593
|
+
function J(e) {
|
|
594
|
+
return K(e, Kt, kt);
|
|
595
|
+
}
|
|
596
|
+
function Ot(e, t) {
|
|
597
|
+
var n = e.__data__;
|
|
598
|
+
return Nt(t) ? n[typeof t == "string" ? "string" : "hash"] : n.map;
|
|
599
|
+
}
|
|
600
|
+
function Y(e, t) {
|
|
601
|
+
var n = he(e, t);
|
|
602
|
+
return gt(n) ? n : void 0;
|
|
603
|
+
}
|
|
604
|
+
var kt = Me ? ve(Me, Object) : qt, X = ht;
|
|
605
|
+
(Fe && X(new Fe(/* @__PURE__ */ new ArrayBuffer(1))) != x || L && X(new L()) != d || Ie && X(Ie.resolve()) != m || Le && X(new Le()) != g || R && X(new R()) != y) && (X = function(e) {
|
|
606
|
+
var t = Te.call(e), n = t == p ? e.constructor : void 0, r = n ? Q(n) : void 0;
|
|
607
|
+
if (r) switch (r) {
|
|
608
|
+
case Re: return x;
|
|
609
|
+
case ze: return d;
|
|
610
|
+
case Be: return m;
|
|
611
|
+
case Ve: return g;
|
|
612
|
+
case He: return y;
|
|
613
|
+
}
|
|
614
|
+
return t;
|
|
615
|
+
});
|
|
616
|
+
function At(e) {
|
|
617
|
+
var t = e.length, n = e.constructor(t);
|
|
618
|
+
return t && typeof e[0] == "string" && P.call(e, "index") && (n.index = e.index, n.input = e.input), n;
|
|
619
|
+
}
|
|
620
|
+
function Z(e) {
|
|
621
|
+
return typeof e.constructor == "function" && !Ft(e) ? mt(ke(e)) : {};
|
|
622
|
+
}
|
|
623
|
+
function jt(e, t, n, r) {
|
|
624
|
+
var i = e.constructor;
|
|
625
|
+
switch (t) {
|
|
626
|
+
case b: return yt(e);
|
|
627
|
+
case o:
|
|
628
|
+
case s: return new i(+e);
|
|
629
|
+
case x: return bt(e, r);
|
|
630
|
+
case S:
|
|
631
|
+
case C:
|
|
632
|
+
case w:
|
|
633
|
+
case T:
|
|
634
|
+
case E:
|
|
635
|
+
case D:
|
|
636
|
+
case O:
|
|
637
|
+
case ee:
|
|
638
|
+
case te: return Tt(e, r);
|
|
639
|
+
case d: return xt(e, r, n);
|
|
640
|
+
case f:
|
|
641
|
+
case _: return new i(e);
|
|
642
|
+
case h: return St(e);
|
|
643
|
+
case g: return Ct(e, r, n);
|
|
644
|
+
case v: return wt(e);
|
|
645
|
+
}
|
|
646
|
+
}
|
|
647
|
+
function Mt(e, t) {
|
|
648
|
+
return t ??= r, !!t && (typeof e == "number" || k.test(e)) && e > -1 && e % 1 == 0 && e < t;
|
|
649
|
+
}
|
|
650
|
+
function Nt(e) {
|
|
651
|
+
var t = typeof e;
|
|
652
|
+
return t == "string" || t == "number" || t == "symbol" || t == "boolean" ? e !== "__proto__" : e === null;
|
|
653
|
+
}
|
|
654
|
+
function Pt(e) {
|
|
655
|
+
return !!Ce && Ce in e;
|
|
656
|
+
}
|
|
657
|
+
function Ft(e) {
|
|
658
|
+
var t = e && e.constructor;
|
|
659
|
+
return e === (typeof t == "function" && t.prototype || Se);
|
|
660
|
+
}
|
|
661
|
+
function Q(e) {
|
|
662
|
+
if (e != null) {
|
|
663
|
+
try {
|
|
664
|
+
return we.call(e);
|
|
665
|
+
} catch {}
|
|
666
|
+
try {
|
|
667
|
+
return e + "";
|
|
668
|
+
} catch {}
|
|
669
|
+
}
|
|
670
|
+
return "";
|
|
671
|
+
}
|
|
672
|
+
function It(e) {
|
|
673
|
+
return G(e, !0, !0);
|
|
674
|
+
}
|
|
675
|
+
function Lt(e, t) {
|
|
676
|
+
return e === t || e !== e && t !== t;
|
|
677
|
+
}
|
|
678
|
+
function Rt(e) {
|
|
679
|
+
return Bt(e) && P.call(e, "callee") && (!je.call(e, "callee") || Te.call(e) == i);
|
|
680
|
+
}
|
|
681
|
+
var $ = Array.isArray;
|
|
682
|
+
function zt(e) {
|
|
683
|
+
return e != null && Ut(e.length) && !Ht(e);
|
|
684
|
+
}
|
|
685
|
+
function Bt(e) {
|
|
686
|
+
return Gt(e) && zt(e);
|
|
687
|
+
}
|
|
688
|
+
var Vt = Ne || Jt;
|
|
689
|
+
function Ht(e) {
|
|
690
|
+
var t = Wt(e) ? Te.call(e) : "";
|
|
691
|
+
return t == l || t == u;
|
|
692
|
+
}
|
|
693
|
+
function Ut(e) {
|
|
694
|
+
return typeof e == "number" && e > -1 && e % 1 == 0 && e <= r;
|
|
695
|
+
}
|
|
696
|
+
function Wt(e) {
|
|
697
|
+
var t = typeof e;
|
|
698
|
+
return !!e && (t == "object" || t == "function");
|
|
699
|
+
}
|
|
700
|
+
function Gt(e) {
|
|
701
|
+
return !!e && typeof e == "object";
|
|
702
|
+
}
|
|
703
|
+
function Kt(e) {
|
|
704
|
+
return zt(e) ? ut(e) : _t(e);
|
|
705
|
+
}
|
|
706
|
+
function qt() {
|
|
707
|
+
return [];
|
|
708
|
+
}
|
|
709
|
+
function Jt() {
|
|
710
|
+
return !1;
|
|
711
|
+
}
|
|
712
|
+
t.exports = It;
|
|
713
|
+
})), ee = /* @__PURE__ */ o(((e, t) => {
|
|
714
|
+
var n = "__lodash_hash_undefined__", r = 1, i = 2, a = 9007199254740991, o = "[object Arguments]", s = "[object Array]", c = "[object Boolean]", l = "[object Date]", u = "[object Error]", d = "[object Function]", f = "[object Map]", p = "[object Number]", m = "[object Object]", h = "[object Promise]", g = "[object RegExp]", _ = "[object Set]", v = "[object String]", y = "[object WeakMap]", b = "[object ArrayBuffer]", x = "[object DataView]", S = "[object Float32Array]", C = "[object Float64Array]", w = "[object Int8Array]", T = "[object Int16Array]", E = "[object Int32Array]", D = "[object Uint8Array]", O = "[object Uint8ClampedArray]", ee = "[object Uint16Array]", te = "[object Uint32Array]", ne = /[\\^$.*+?()[\]{}|]/g, re = /^\[object .+?Constructor\]$/, ie = /^(?:0|[1-9]\d*)$/, k = {};
|
|
715
|
+
k[S] = k[C] = k[w] = k[T] = k[E] = k[D] = k[O] = k[ee] = k[te] = !0, k[o] = k[s] = k[b] = k[c] = k[x] = k[l] = k[u] = k[d] = k[f] = k[p] = k[m] = k[g] = k[_] = k[v] = k[y] = !1;
|
|
716
|
+
var A = typeof global == "object" && global && global.Object === Object && global, ae = typeof self == "object" && self && self.Object === Object && self, j = A || ae || Function("return this")(), M = typeof e == "object" && e && !e.nodeType && e, oe = M && typeof t == "object" && t && !t.nodeType && t, se = oe && oe.exports === M, ce = se && A.process, le = function() {
|
|
717
|
+
try {
|
|
718
|
+
return ce && ce.binding && ce.binding("util");
|
|
719
|
+
} catch {}
|
|
720
|
+
}(), ue = le && le.isTypedArray;
|
|
721
|
+
function de(e, t) {
|
|
722
|
+
for (var n = -1, r = e == null ? 0 : e.length, i = 0, a = []; ++n < r;) {
|
|
723
|
+
var o = e[n];
|
|
724
|
+
t(o, n, e) && (a[i++] = o);
|
|
725
|
+
}
|
|
726
|
+
return a;
|
|
727
|
+
}
|
|
728
|
+
function fe(e, t) {
|
|
729
|
+
for (var n = -1, r = t.length, i = e.length; ++n < r;) e[i + n] = t[n];
|
|
730
|
+
return e;
|
|
731
|
+
}
|
|
732
|
+
function pe(e, t) {
|
|
733
|
+
for (var n = -1, r = e == null ? 0 : e.length; ++n < r;) if (t(e[n], n, e)) return !0;
|
|
734
|
+
return !1;
|
|
735
|
+
}
|
|
736
|
+
function me(e, t) {
|
|
737
|
+
for (var n = -1, r = Array(e); ++n < e;) r[n] = t(n);
|
|
738
|
+
return r;
|
|
739
|
+
}
|
|
740
|
+
function he(e) {
|
|
741
|
+
return function(t) {
|
|
742
|
+
return e(t);
|
|
743
|
+
};
|
|
744
|
+
}
|
|
745
|
+
function ge(e, t) {
|
|
746
|
+
return e.has(t);
|
|
747
|
+
}
|
|
748
|
+
function _e(e, t) {
|
|
749
|
+
return e?.[t];
|
|
750
|
+
}
|
|
751
|
+
function ve(e) {
|
|
752
|
+
var t = -1, n = Array(e.size);
|
|
753
|
+
return e.forEach(function(e, r) {
|
|
754
|
+
n[++t] = [r, e];
|
|
755
|
+
}), n;
|
|
756
|
+
}
|
|
757
|
+
function ye(e, t) {
|
|
758
|
+
return function(n) {
|
|
759
|
+
return e(t(n));
|
|
760
|
+
};
|
|
761
|
+
}
|
|
762
|
+
function be(e) {
|
|
763
|
+
var t = -1, n = Array(e.size);
|
|
764
|
+
return e.forEach(function(e) {
|
|
765
|
+
n[++t] = e;
|
|
766
|
+
}), n;
|
|
767
|
+
}
|
|
768
|
+
var xe = Array.prototype, Se = Function.prototype, N = Object.prototype, Ce = j["__core-js_shared__"], we = Se.toString, P = N.hasOwnProperty, Te = function() {
|
|
769
|
+
var e = /[^.]+$/.exec(Ce && Ce.keys && Ce.keys.IE_PROTO || "");
|
|
770
|
+
return e ? "Symbol(src)_1." + e : "";
|
|
771
|
+
}(), Ee = N.toString, De = RegExp("^" + we.call(P).replace(ne, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"), Oe = se ? j.Buffer : void 0, F = j.Symbol, ke = j.Uint8Array, Ae = N.propertyIsEnumerable, je = xe.splice, I = F ? F.toStringTag : void 0, Me = Object.getOwnPropertySymbols, Ne = Oe ? Oe.isBuffer : void 0, Pe = ye(Object.keys, Object), Fe = q(j, "DataView"), L = q(j, "Map"), Ie = q(j, "Promise"), Le = q(j, "Set"), R = q(j, "WeakMap"), z = q(Object, "create"), Re = Z(Fe), ze = Z(L), Be = Z(Ie), Ve = Z(Le), He = Z(R), Ue = F ? F.prototype : void 0, We = Ue ? Ue.valueOf : void 0;
|
|
772
|
+
function B(e) {
|
|
773
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
774
|
+
for (this.clear(); ++t < n;) {
|
|
775
|
+
var r = e[t];
|
|
776
|
+
this.set(r[0], r[1]);
|
|
777
|
+
}
|
|
778
|
+
}
|
|
779
|
+
function Ge() {
|
|
780
|
+
this.__data__ = z ? z(null) : {}, this.size = 0;
|
|
781
|
+
}
|
|
782
|
+
function Ke(e) {
|
|
783
|
+
var t = this.has(e) && delete this.__data__[e];
|
|
784
|
+
return this.size -= +!!t, t;
|
|
785
|
+
}
|
|
786
|
+
function qe(e) {
|
|
787
|
+
var t = this.__data__;
|
|
788
|
+
if (z) {
|
|
789
|
+
var r = t[e];
|
|
790
|
+
return r === n ? void 0 : r;
|
|
791
|
+
}
|
|
792
|
+
return P.call(t, e) ? t[e] : void 0;
|
|
793
|
+
}
|
|
794
|
+
function Je(e) {
|
|
795
|
+
var t = this.__data__;
|
|
796
|
+
return z ? t[e] !== void 0 : P.call(t, e);
|
|
797
|
+
}
|
|
798
|
+
function Ye(e, t) {
|
|
799
|
+
var r = this.__data__;
|
|
800
|
+
return this.size += +!this.has(e), r[e] = z && t === void 0 ? n : t, this;
|
|
801
|
+
}
|
|
802
|
+
B.prototype.clear = Ge, B.prototype.delete = Ke, B.prototype.get = qe, B.prototype.has = Je, B.prototype.set = Ye;
|
|
803
|
+
function V(e) {
|
|
804
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
805
|
+
for (this.clear(); ++t < n;) {
|
|
806
|
+
var r = e[t];
|
|
807
|
+
this.set(r[0], r[1]);
|
|
808
|
+
}
|
|
809
|
+
}
|
|
810
|
+
function Xe() {
|
|
811
|
+
this.__data__ = [], this.size = 0;
|
|
812
|
+
}
|
|
813
|
+
function Ze(e) {
|
|
814
|
+
var t = this.__data__, n = G(t, e);
|
|
815
|
+
return n < 0 ? !1 : (n == t.length - 1 ? t.pop() : je.call(t, n, 1), --this.size, !0);
|
|
816
|
+
}
|
|
817
|
+
function Qe(e) {
|
|
818
|
+
var t = this.__data__, n = G(t, e);
|
|
819
|
+
return n < 0 ? void 0 : t[n][1];
|
|
820
|
+
}
|
|
821
|
+
function $e(e) {
|
|
822
|
+
return G(this.__data__, e) > -1;
|
|
823
|
+
}
|
|
824
|
+
function et(e, t) {
|
|
825
|
+
var n = this.__data__, r = G(n, e);
|
|
826
|
+
return r < 0 ? (++this.size, n.push([e, t])) : n[r][1] = t, this;
|
|
827
|
+
}
|
|
828
|
+
V.prototype.clear = Xe, V.prototype.delete = Ze, V.prototype.get = Qe, V.prototype.has = $e, V.prototype.set = et;
|
|
829
|
+
function H(e) {
|
|
830
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
831
|
+
for (this.clear(); ++t < n;) {
|
|
832
|
+
var r = e[t];
|
|
833
|
+
this.set(r[0], r[1]);
|
|
834
|
+
}
|
|
835
|
+
}
|
|
836
|
+
function tt() {
|
|
837
|
+
this.size = 0, this.__data__ = {
|
|
838
|
+
hash: new B(),
|
|
839
|
+
map: new (L || V)(),
|
|
840
|
+
string: new B()
|
|
841
|
+
};
|
|
842
|
+
}
|
|
843
|
+
function nt(e) {
|
|
844
|
+
var t = Tt(this, e).delete(e);
|
|
845
|
+
return this.size -= +!!t, t;
|
|
846
|
+
}
|
|
847
|
+
function rt(e) {
|
|
848
|
+
return Tt(this, e).get(e);
|
|
849
|
+
}
|
|
850
|
+
function it(e) {
|
|
851
|
+
return Tt(this, e).has(e);
|
|
852
|
+
}
|
|
853
|
+
function at(e, t) {
|
|
854
|
+
var n = Tt(this, e), r = n.size;
|
|
855
|
+
return n.set(e, t), this.size += n.size == r ? 0 : 1, this;
|
|
856
|
+
}
|
|
857
|
+
H.prototype.clear = tt, H.prototype.delete = nt, H.prototype.get = rt, H.prototype.has = it, H.prototype.set = at;
|
|
858
|
+
function U(e) {
|
|
859
|
+
var t = -1, n = e == null ? 0 : e.length;
|
|
860
|
+
for (this.__data__ = new H(); ++t < n;) this.add(e[t]);
|
|
861
|
+
}
|
|
862
|
+
function ot(e) {
|
|
863
|
+
return this.__data__.set(e, n), this;
|
|
864
|
+
}
|
|
865
|
+
function st(e) {
|
|
866
|
+
return this.__data__.has(e);
|
|
867
|
+
}
|
|
868
|
+
U.prototype.add = U.prototype.push = ot, U.prototype.has = st;
|
|
869
|
+
function W(e) {
|
|
870
|
+
var t = this.__data__ = new V(e);
|
|
871
|
+
this.size = t.size;
|
|
872
|
+
}
|
|
873
|
+
function ct() {
|
|
874
|
+
this.__data__ = new V(), this.size = 0;
|
|
875
|
+
}
|
|
876
|
+
function lt(e) {
|
|
877
|
+
var t = this.__data__, n = t.delete(e);
|
|
878
|
+
return this.size = t.size, n;
|
|
879
|
+
}
|
|
880
|
+
function ut(e) {
|
|
881
|
+
return this.__data__.get(e);
|
|
882
|
+
}
|
|
883
|
+
function dt(e) {
|
|
884
|
+
return this.__data__.has(e);
|
|
885
|
+
}
|
|
886
|
+
function ft(e, t) {
|
|
887
|
+
var n = this.__data__;
|
|
888
|
+
if (n instanceof V) {
|
|
889
|
+
var r = n.__data__;
|
|
890
|
+
if (!L || r.length < 199) return r.push([e, t]), this.size = ++n.size, this;
|
|
891
|
+
n = this.__data__ = new H(r);
|
|
892
|
+
}
|
|
893
|
+
return n.set(e, t), this.size = n.size, this;
|
|
894
|
+
}
|
|
895
|
+
W.prototype.clear = ct, W.prototype.delete = lt, W.prototype.get = ut, W.prototype.has = dt, W.prototype.set = ft;
|
|
896
|
+
function pt(e, t) {
|
|
897
|
+
var n = Nt(e), r = !n && Mt(e), i = !n && !r && Ft(e), a = !n && !r && !i && zt(e), o = n || r || i || a, s = o ? me(e.length, String) : [], c = s.length;
|
|
898
|
+
for (var l in e) (t || P.call(e, l)) && !(o && (l == "length" || i && (l == "offset" || l == "parent") || a && (l == "buffer" || l == "byteLength" || l == "byteOffset") || Ot(l, c))) && s.push(l);
|
|
899
|
+
return s;
|
|
900
|
+
}
|
|
901
|
+
function G(e, t) {
|
|
902
|
+
for (var n = e.length; n--;) if (jt(e[n][0], t)) return n;
|
|
903
|
+
return -1;
|
|
904
|
+
}
|
|
905
|
+
function mt(e, t, n) {
|
|
906
|
+
var r = t(e);
|
|
907
|
+
return Nt(e) ? r : fe(r, n(e));
|
|
908
|
+
}
|
|
909
|
+
function K(e) {
|
|
910
|
+
return e == null ? e === void 0 ? "[object Undefined]" : "[object Null]" : I && I in Object(e) ? Et(e) : At(e);
|
|
911
|
+
}
|
|
912
|
+
function ht(e) {
|
|
913
|
+
return $(e) && K(e) == o;
|
|
914
|
+
}
|
|
915
|
+
function gt(e, t, n, r, i) {
|
|
916
|
+
return e === t ? !0 : e == null || t == null || !$(e) && !$(t) ? e !== e && t !== t : _t(e, t, n, r, gt, i);
|
|
917
|
+
}
|
|
918
|
+
function _t(e, t, n, i, a, c) {
|
|
919
|
+
var l = Nt(e), u = Nt(t), d = l ? s : J(e), f = u ? s : J(t);
|
|
920
|
+
d = d == o ? m : d, f = f == o ? m : f;
|
|
921
|
+
var p = d == m, h = f == m, g = d == f;
|
|
922
|
+
if (g && Ft(e)) {
|
|
923
|
+
if (!Ft(t)) return !1;
|
|
924
|
+
l = !0, p = !1;
|
|
925
|
+
}
|
|
926
|
+
if (g && !p) return c ||= new W(), l || zt(e) ? xt(e, t, n, i, a, c) : St(e, t, d, n, i, a, c);
|
|
927
|
+
if (!(n & r)) {
|
|
928
|
+
var _ = p && P.call(e, "__wrapped__"), v = h && P.call(t, "__wrapped__");
|
|
929
|
+
if (_ || v) {
|
|
930
|
+
var y = _ ? e.value() : e, b = v ? t.value() : t;
|
|
931
|
+
return c ||= new W(), a(y, b, n, i, c);
|
|
932
|
+
}
|
|
933
|
+
}
|
|
934
|
+
return g ? (c ||= new W(), Ct(e, t, n, i, a, c)) : !1;
|
|
935
|
+
}
|
|
936
|
+
function vt(e) {
|
|
937
|
+
return !Rt(e) || kt(e) ? !1 : (It(e) ? De : re).test(Z(e));
|
|
938
|
+
}
|
|
939
|
+
function yt(e) {
|
|
940
|
+
return $(e) && Lt(e.length) && !!k[K(e)];
|
|
941
|
+
}
|
|
942
|
+
function bt(e) {
|
|
943
|
+
if (!X(e)) return Pe(e);
|
|
944
|
+
var t = [];
|
|
945
|
+
for (var n in Object(e)) P.call(e, n) && n != "constructor" && t.push(n);
|
|
946
|
+
return t;
|
|
947
|
+
}
|
|
948
|
+
function xt(e, t, n, a, o, s) {
|
|
949
|
+
var c = n & r, l = e.length, u = t.length;
|
|
950
|
+
if (l != u && !(c && u > l)) return !1;
|
|
951
|
+
var d = s.get(e);
|
|
952
|
+
if (d && s.get(t)) return d == t;
|
|
953
|
+
var f = -1, p = !0, m = n & i ? new U() : void 0;
|
|
954
|
+
for (s.set(e, t), s.set(t, e); ++f < l;) {
|
|
955
|
+
var h = e[f], g = t[f];
|
|
956
|
+
if (a) var _ = c ? a(g, h, f, t, e, s) : a(h, g, f, e, t, s);
|
|
957
|
+
if (_ !== void 0) {
|
|
958
|
+
if (_) continue;
|
|
959
|
+
p = !1;
|
|
960
|
+
break;
|
|
961
|
+
}
|
|
962
|
+
if (m) {
|
|
963
|
+
if (!pe(t, function(e, t) {
|
|
964
|
+
if (!ge(m, t) && (h === e || o(h, e, n, a, s))) return m.push(t);
|
|
965
|
+
})) {
|
|
966
|
+
p = !1;
|
|
967
|
+
break;
|
|
968
|
+
}
|
|
969
|
+
} else if (!(h === g || o(h, g, n, a, s))) {
|
|
970
|
+
p = !1;
|
|
971
|
+
break;
|
|
972
|
+
}
|
|
973
|
+
}
|
|
974
|
+
return s.delete(e), s.delete(t), p;
|
|
975
|
+
}
|
|
976
|
+
function St(e, t, n, a, o, s, d) {
|
|
977
|
+
switch (n) {
|
|
978
|
+
case x:
|
|
979
|
+
if (e.byteLength != t.byteLength || e.byteOffset != t.byteOffset) return !1;
|
|
980
|
+
e = e.buffer, t = t.buffer;
|
|
981
|
+
case b: return !(e.byteLength != t.byteLength || !s(new ke(e), new ke(t)));
|
|
982
|
+
case c:
|
|
983
|
+
case l:
|
|
984
|
+
case p: return jt(+e, +t);
|
|
985
|
+
case u: return e.name == t.name && e.message == t.message;
|
|
986
|
+
case g:
|
|
987
|
+
case v: return e == t + "";
|
|
988
|
+
case f: var m = ve;
|
|
989
|
+
case _:
|
|
990
|
+
var h = a & r;
|
|
991
|
+
if (m ||= be, e.size != t.size && !h) return !1;
|
|
992
|
+
var y = d.get(e);
|
|
993
|
+
if (y) return y == t;
|
|
994
|
+
a |= i, d.set(e, t);
|
|
995
|
+
var S = xt(m(e), m(t), a, o, s, d);
|
|
996
|
+
return d.delete(e), S;
|
|
997
|
+
case "[object Symbol]": if (We) return We.call(e) == We.call(t);
|
|
998
|
+
}
|
|
999
|
+
return !1;
|
|
1000
|
+
}
|
|
1001
|
+
function Ct(e, t, n, i, a, o) {
|
|
1002
|
+
var s = n & r, c = wt(e), l = c.length;
|
|
1003
|
+
if (l != wt(t).length && !s) return !1;
|
|
1004
|
+
for (var u = l; u--;) {
|
|
1005
|
+
var d = c[u];
|
|
1006
|
+
if (!(s ? d in t : P.call(t, d))) return !1;
|
|
1007
|
+
}
|
|
1008
|
+
var f = o.get(e);
|
|
1009
|
+
if (f && o.get(t)) return f == t;
|
|
1010
|
+
var p = !0;
|
|
1011
|
+
o.set(e, t), o.set(t, e);
|
|
1012
|
+
for (var m = s; ++u < l;) {
|
|
1013
|
+
d = c[u];
|
|
1014
|
+
var h = e[d], g = t[d];
|
|
1015
|
+
if (i) var _ = s ? i(g, h, d, t, e, o) : i(h, g, d, e, t, o);
|
|
1016
|
+
if (!(_ === void 0 ? h === g || a(h, g, n, i, o) : _)) {
|
|
1017
|
+
p = !1;
|
|
1018
|
+
break;
|
|
1019
|
+
}
|
|
1020
|
+
m ||= d == "constructor";
|
|
1021
|
+
}
|
|
1022
|
+
if (p && !m) {
|
|
1023
|
+
var v = e.constructor, y = t.constructor;
|
|
1024
|
+
v != y && "constructor" in e && "constructor" in t && !(typeof v == "function" && v instanceof v && typeof y == "function" && y instanceof y) && (p = !1);
|
|
1025
|
+
}
|
|
1026
|
+
return o.delete(e), o.delete(t), p;
|
|
1027
|
+
}
|
|
1028
|
+
function wt(e) {
|
|
1029
|
+
return mt(e, Bt, Dt);
|
|
1030
|
+
}
|
|
1031
|
+
function Tt(e, t) {
|
|
1032
|
+
var n = e.__data__;
|
|
1033
|
+
return Y(t) ? n[typeof t == "string" ? "string" : "hash"] : n.map;
|
|
1034
|
+
}
|
|
1035
|
+
function q(e, t) {
|
|
1036
|
+
var n = _e(e, t);
|
|
1037
|
+
return vt(n) ? n : void 0;
|
|
1038
|
+
}
|
|
1039
|
+
function Et(e) {
|
|
1040
|
+
var t = P.call(e, I), n = e[I];
|
|
1041
|
+
try {
|
|
1042
|
+
e[I] = void 0;
|
|
1043
|
+
var r = !0;
|
|
1044
|
+
} catch {}
|
|
1045
|
+
var i = Ee.call(e);
|
|
1046
|
+
return r && (t ? e[I] = n : delete e[I]), i;
|
|
1047
|
+
}
|
|
1048
|
+
var Dt = Me ? function(e) {
|
|
1049
|
+
return e == null ? [] : (e = Object(e), de(Me(e), function(t) {
|
|
1050
|
+
return Ae.call(e, t);
|
|
1051
|
+
}));
|
|
1052
|
+
} : Vt, J = K;
|
|
1053
|
+
(Fe && J(new Fe(/* @__PURE__ */ new ArrayBuffer(1))) != x || L && J(new L()) != f || Ie && J(Ie.resolve()) != h || Le && J(new Le()) != _ || R && J(new R()) != y) && (J = function(e) {
|
|
1054
|
+
var t = K(e), n = t == m ? e.constructor : void 0, r = n ? Z(n) : "";
|
|
1055
|
+
if (r) switch (r) {
|
|
1056
|
+
case Re: return x;
|
|
1057
|
+
case ze: return f;
|
|
1058
|
+
case Be: return h;
|
|
1059
|
+
case Ve: return _;
|
|
1060
|
+
case He: return y;
|
|
1061
|
+
}
|
|
1062
|
+
return t;
|
|
1063
|
+
});
|
|
1064
|
+
function Ot(e, t) {
|
|
1065
|
+
return t ??= a, !!t && (typeof e == "number" || ie.test(e)) && e > -1 && e % 1 == 0 && e < t;
|
|
1066
|
+
}
|
|
1067
|
+
function Y(e) {
|
|
1068
|
+
var t = typeof e;
|
|
1069
|
+
return t == "string" || t == "number" || t == "symbol" || t == "boolean" ? e !== "__proto__" : e === null;
|
|
1070
|
+
}
|
|
1071
|
+
function kt(e) {
|
|
1072
|
+
return !!Te && Te in e;
|
|
1073
|
+
}
|
|
1074
|
+
function X(e) {
|
|
1075
|
+
var t = e && e.constructor;
|
|
1076
|
+
return e === (typeof t == "function" && t.prototype || N);
|
|
1077
|
+
}
|
|
1078
|
+
function At(e) {
|
|
1079
|
+
return Ee.call(e);
|
|
1080
|
+
}
|
|
1081
|
+
function Z(e) {
|
|
1082
|
+
if (e != null) {
|
|
1083
|
+
try {
|
|
1084
|
+
return we.call(e);
|
|
1085
|
+
} catch {}
|
|
1086
|
+
try {
|
|
1087
|
+
return e + "";
|
|
1088
|
+
} catch {}
|
|
1089
|
+
}
|
|
1090
|
+
return "";
|
|
1091
|
+
}
|
|
1092
|
+
function jt(e, t) {
|
|
1093
|
+
return e === t || e !== e && t !== t;
|
|
1094
|
+
}
|
|
1095
|
+
var Mt = ht(function() {
|
|
1096
|
+
return arguments;
|
|
1097
|
+
}()) ? ht : function(e) {
|
|
1098
|
+
return $(e) && P.call(e, "callee") && !Ae.call(e, "callee");
|
|
1099
|
+
}, Nt = Array.isArray;
|
|
1100
|
+
function Pt(e) {
|
|
1101
|
+
return e != null && Lt(e.length) && !It(e);
|
|
1102
|
+
}
|
|
1103
|
+
var Ft = Ne || Ht;
|
|
1104
|
+
function Q(e, t) {
|
|
1105
|
+
return gt(e, t);
|
|
1106
|
+
}
|
|
1107
|
+
function It(e) {
|
|
1108
|
+
if (!Rt(e)) return !1;
|
|
1109
|
+
var t = K(e);
|
|
1110
|
+
return t == d || t == "[object GeneratorFunction]" || t == "[object AsyncFunction]" || t == "[object Proxy]";
|
|
1111
|
+
}
|
|
1112
|
+
function Lt(e) {
|
|
1113
|
+
return typeof e == "number" && e > -1 && e % 1 == 0 && e <= a;
|
|
1114
|
+
}
|
|
1115
|
+
function Rt(e) {
|
|
1116
|
+
var t = typeof e;
|
|
1117
|
+
return e != null && (t == "object" || t == "function");
|
|
1118
|
+
}
|
|
1119
|
+
function $(e) {
|
|
1120
|
+
return typeof e == "object" && !!e;
|
|
1121
|
+
}
|
|
1122
|
+
var zt = ue ? he(ue) : yt;
|
|
1123
|
+
function Bt(e) {
|
|
1124
|
+
return Pt(e) ? pt(e) : bt(e);
|
|
1125
|
+
}
|
|
1126
|
+
function Vt() {
|
|
1127
|
+
return [];
|
|
1128
|
+
}
|
|
1129
|
+
function Ht() {
|
|
1130
|
+
return !1;
|
|
1131
|
+
}
|
|
1132
|
+
t.exports = Q;
|
|
1133
|
+
})), te = /* @__PURE__ */ o(((e) => {
|
|
1134
|
+
Object.defineProperty(e, "__esModule", { value: !0 });
|
|
1135
|
+
var t = O(), n = ee(), r;
|
|
1136
|
+
(function(e) {
|
|
1137
|
+
function r(e = {}, n = {}, r = !1) {
|
|
1138
|
+
typeof e != "object" && (e = {}), typeof n != "object" && (n = {});
|
|
1139
|
+
let i = t(n);
|
|
1140
|
+
r || (i = Object.keys(i).reduce((e, t) => (i[t] != null && (e[t] = i[t]), e), {}));
|
|
1141
|
+
for (let t in e) e[t] !== void 0 && n[t] === void 0 && (i[t] = e[t]);
|
|
1142
|
+
return Object.keys(i).length > 0 ? i : void 0;
|
|
1143
|
+
}
|
|
1144
|
+
e.compose = r;
|
|
1145
|
+
function i(e = {}, t = {}) {
|
|
1146
|
+
typeof e != "object" && (e = {}), typeof t != "object" && (t = {});
|
|
1147
|
+
let r = Object.keys(e).concat(Object.keys(t)).reduce((r, i) => (n(e[i], t[i]) || (r[i] = t[i] === void 0 ? null : t[i]), r), {});
|
|
1148
|
+
return Object.keys(r).length > 0 ? r : void 0;
|
|
1149
|
+
}
|
|
1150
|
+
e.diff = i;
|
|
1151
|
+
function a(e = {}, t = {}) {
|
|
1152
|
+
e ||= {};
|
|
1153
|
+
let n = Object.keys(t).reduce((n, r) => (t[r] !== e[r] && e[r] !== void 0 && (n[r] = t[r]), n), {});
|
|
1154
|
+
return Object.keys(e).reduce((n, r) => (e[r] !== t[r] && t[r] === void 0 && (n[r] = null), n), n);
|
|
1155
|
+
}
|
|
1156
|
+
e.invert = a;
|
|
1157
|
+
function o(e, t, n = !1) {
|
|
1158
|
+
if (typeof e != "object") return t;
|
|
1159
|
+
if (typeof t != "object") return;
|
|
1160
|
+
if (!n) return t;
|
|
1161
|
+
let r = Object.keys(t).reduce((n, r) => (e[r] === void 0 && (n[r] = t[r]), n), {});
|
|
1162
|
+
return Object.keys(r).length > 0 ? r : void 0;
|
|
1163
|
+
}
|
|
1164
|
+
e.transform = o;
|
|
1165
|
+
})(r ||= {}), e.default = r;
|
|
1166
|
+
})), ne = /* @__PURE__ */ o(((e) => {
|
|
1167
|
+
Object.defineProperty(e, "__esModule", { value: !0 });
|
|
1168
|
+
var t;
|
|
1169
|
+
(function(e) {
|
|
1170
|
+
function t(e) {
|
|
1171
|
+
return typeof e.delete == "number" ? e.delete : typeof e.retain == "number" ? e.retain : typeof e.retain == "object" && e.retain !== null ? 1 : typeof e.insert == "string" ? e.insert.length : 1;
|
|
1172
|
+
}
|
|
1173
|
+
e.length = t;
|
|
1174
|
+
})(t ||= {}), e.default = t;
|
|
1175
|
+
})), re = /* @__PURE__ */ o(((e) => {
|
|
1176
|
+
Object.defineProperty(e, "__esModule", { value: !0 });
|
|
1177
|
+
var t = ne();
|
|
1178
|
+
e.default = class {
|
|
1179
|
+
constructor(e) {
|
|
1180
|
+
this.ops = e, this.index = 0, this.offset = 0;
|
|
1181
|
+
}
|
|
1182
|
+
hasNext() {
|
|
1183
|
+
return this.peekLength() < Infinity;
|
|
1184
|
+
}
|
|
1185
|
+
next(e) {
|
|
1186
|
+
e ||= Infinity;
|
|
1187
|
+
let n = this.ops[this.index];
|
|
1188
|
+
if (n) {
|
|
1189
|
+
let r = this.offset, i = t.default.length(n);
|
|
1190
|
+
if (e >= i - r ? (e = i - r, this.index += 1, this.offset = 0) : this.offset += e, typeof n.delete == "number") return { delete: e };
|
|
1191
|
+
{
|
|
1192
|
+
let t = {};
|
|
1193
|
+
return n.attributes && (t.attributes = n.attributes), typeof n.retain == "number" ? t.retain = e : typeof n.retain == "object" && n.retain !== null ? t.retain = n.retain : typeof n.insert == "string" ? t.insert = n.insert.substr(r, e) : t.insert = n.insert, t;
|
|
1194
|
+
}
|
|
1195
|
+
} else return { retain: Infinity };
|
|
1196
|
+
}
|
|
1197
|
+
peek() {
|
|
1198
|
+
return this.ops[this.index];
|
|
1199
|
+
}
|
|
1200
|
+
peekLength() {
|
|
1201
|
+
return this.ops[this.index] ? t.default.length(this.ops[this.index]) - this.offset : Infinity;
|
|
1202
|
+
}
|
|
1203
|
+
peekType() {
|
|
1204
|
+
let e = this.ops[this.index];
|
|
1205
|
+
return e ? typeof e.delete == "number" ? "delete" : typeof e.retain == "number" || typeof e.retain == "object" && e.retain !== null ? "retain" : "insert" : "retain";
|
|
1206
|
+
}
|
|
1207
|
+
rest() {
|
|
1208
|
+
if (!this.hasNext()) return [];
|
|
1209
|
+
if (this.offset === 0) return this.ops.slice(this.index);
|
|
1210
|
+
{
|
|
1211
|
+
let e = this.offset, t = this.index, n = this.next(), r = this.ops.slice(this.index);
|
|
1212
|
+
return this.offset = e, this.index = t, [n].concat(r);
|
|
1213
|
+
}
|
|
1214
|
+
}
|
|
1215
|
+
};
|
|
1216
|
+
})), ie = /* @__PURE__ */ o(((e, t) => {
|
|
1217
|
+
Object.defineProperty(e, "__esModule", { value: !0 }), e.AttributeMap = e.OpIterator = e.Op = void 0;
|
|
1218
|
+
var n = D(), r = O(), i = ee(), a = te();
|
|
1219
|
+
e.AttributeMap = a.default;
|
|
1220
|
+
var o = ne();
|
|
1221
|
+
e.Op = o.default;
|
|
1222
|
+
var s = re();
|
|
1223
|
+
e.OpIterator = s.default;
|
|
1224
|
+
var c = "\0", l = (e, t) => {
|
|
1225
|
+
if (typeof e != "object" || !e) throw Error(`cannot retain a ${typeof e}`);
|
|
1226
|
+
if (typeof t != "object" || !t) throw Error(`cannot retain a ${typeof t}`);
|
|
1227
|
+
let n = Object.keys(e)[0];
|
|
1228
|
+
if (!n || n !== Object.keys(t)[0]) throw Error(`embed types not matched: ${n} != ${Object.keys(t)[0]}`);
|
|
1229
|
+
return [
|
|
1230
|
+
n,
|
|
1231
|
+
e[n],
|
|
1232
|
+
t[n]
|
|
1233
|
+
];
|
|
1234
|
+
}, u = class e {
|
|
1235
|
+
constructor(e) {
|
|
1236
|
+
Array.isArray(e) ? this.ops = e : e != null && Array.isArray(e.ops) ? this.ops = e.ops : this.ops = [];
|
|
1237
|
+
}
|
|
1238
|
+
static registerEmbed(e, t) {
|
|
1239
|
+
this.handlers[e] = t;
|
|
1240
|
+
}
|
|
1241
|
+
static unregisterEmbed(e) {
|
|
1242
|
+
delete this.handlers[e];
|
|
1243
|
+
}
|
|
1244
|
+
static getHandler(e) {
|
|
1245
|
+
let t = this.handlers[e];
|
|
1246
|
+
if (!t) throw Error(`no handlers for embed type "${e}"`);
|
|
1247
|
+
return t;
|
|
1248
|
+
}
|
|
1249
|
+
insert(e, t) {
|
|
1250
|
+
let n = {};
|
|
1251
|
+
return typeof e == "string" && e.length === 0 ? this : (n.insert = e, typeof t == "object" && t && Object.keys(t).length > 0 && (n.attributes = t), this.push(n));
|
|
1252
|
+
}
|
|
1253
|
+
delete(e) {
|
|
1254
|
+
return e <= 0 ? this : this.push({ delete: e });
|
|
1255
|
+
}
|
|
1256
|
+
retain(e, t) {
|
|
1257
|
+
if (typeof e == "number" && e <= 0) return this;
|
|
1258
|
+
let n = { retain: e };
|
|
1259
|
+
return typeof t == "object" && t && Object.keys(t).length > 0 && (n.attributes = t), this.push(n);
|
|
1260
|
+
}
|
|
1261
|
+
push(e) {
|
|
1262
|
+
let t = this.ops.length, n = this.ops[t - 1];
|
|
1263
|
+
if (e = r(e), typeof n == "object") {
|
|
1264
|
+
if (typeof e.delete == "number" && typeof n.delete == "number") return this.ops[t - 1] = { delete: n.delete + e.delete }, this;
|
|
1265
|
+
if (typeof n.delete == "number" && e.insert != null && (--t, n = this.ops[t - 1], typeof n != "object")) return this.ops.unshift(e), this;
|
|
1266
|
+
if (i(e.attributes, n.attributes)) {
|
|
1267
|
+
if (typeof e.insert == "string" && typeof n.insert == "string") return this.ops[t - 1] = { insert: n.insert + e.insert }, typeof e.attributes == "object" && (this.ops[t - 1].attributes = e.attributes), this;
|
|
1268
|
+
if (typeof e.retain == "number" && typeof n.retain == "number") return this.ops[t - 1] = { retain: n.retain + e.retain }, typeof e.attributes == "object" && (this.ops[t - 1].attributes = e.attributes), this;
|
|
1269
|
+
}
|
|
1270
|
+
}
|
|
1271
|
+
return t === this.ops.length ? this.ops.push(e) : this.ops.splice(t, 0, e), this;
|
|
1272
|
+
}
|
|
1273
|
+
chop() {
|
|
1274
|
+
let e = this.ops[this.ops.length - 1];
|
|
1275
|
+
return e && typeof e.retain == "number" && !e.attributes && this.ops.pop(), this;
|
|
1276
|
+
}
|
|
1277
|
+
filter(e) {
|
|
1278
|
+
return this.ops.filter(e);
|
|
1279
|
+
}
|
|
1280
|
+
forEach(e) {
|
|
1281
|
+
this.ops.forEach(e);
|
|
1282
|
+
}
|
|
1283
|
+
map(e) {
|
|
1284
|
+
return this.ops.map(e);
|
|
1285
|
+
}
|
|
1286
|
+
partition(e) {
|
|
1287
|
+
let t = [], n = [];
|
|
1288
|
+
return this.forEach((r) => {
|
|
1289
|
+
(e(r) ? t : n).push(r);
|
|
1290
|
+
}), [t, n];
|
|
1291
|
+
}
|
|
1292
|
+
reduce(e, t) {
|
|
1293
|
+
return this.ops.reduce(e, t);
|
|
1294
|
+
}
|
|
1295
|
+
changeLength() {
|
|
1296
|
+
return this.reduce((e, t) => t.insert ? e + o.default.length(t) : t.delete ? e - t.delete : e, 0);
|
|
1297
|
+
}
|
|
1298
|
+
length() {
|
|
1299
|
+
return this.reduce((e, t) => e + o.default.length(t), 0);
|
|
1300
|
+
}
|
|
1301
|
+
slice(t = 0, n = Infinity) {
|
|
1302
|
+
let r = [], i = new s.default(this.ops), a = 0;
|
|
1303
|
+
for (; a < n && i.hasNext();) {
|
|
1304
|
+
let e;
|
|
1305
|
+
a < t ? e = i.next(t - a) : (e = i.next(n - a), r.push(e)), a += o.default.length(e);
|
|
1306
|
+
}
|
|
1307
|
+
return new e(r);
|
|
1308
|
+
}
|
|
1309
|
+
compose(t) {
|
|
1310
|
+
let n = new s.default(this.ops), r = new s.default(t.ops), o = [], c = r.peek();
|
|
1311
|
+
if (c != null && typeof c.retain == "number" && c.attributes == null) {
|
|
1312
|
+
let e = c.retain;
|
|
1313
|
+
for (; n.peekType() === "insert" && n.peekLength() <= e;) e -= n.peekLength(), o.push(n.next());
|
|
1314
|
+
c.retain - e > 0 && r.next(c.retain - e);
|
|
1315
|
+
}
|
|
1316
|
+
let u = new e(o);
|
|
1317
|
+
for (; n.hasNext() || r.hasNext();) if (r.peekType() === "insert") u.push(r.next());
|
|
1318
|
+
else if (n.peekType() === "delete") u.push(n.next());
|
|
1319
|
+
else {
|
|
1320
|
+
let t = Math.min(n.peekLength(), r.peekLength()), o = n.next(t), s = r.next(t);
|
|
1321
|
+
if (s.retain) {
|
|
1322
|
+
let c = {};
|
|
1323
|
+
if (typeof o.retain == "number") c.retain = typeof s.retain == "number" ? t : s.retain;
|
|
1324
|
+
else if (typeof s.retain == "number") o.retain == null ? c.insert = o.insert : c.retain = o.retain;
|
|
1325
|
+
else {
|
|
1326
|
+
let t = o.retain == null ? "insert" : "retain", [n, r, i] = l(o[t], s.retain), a = e.getHandler(n);
|
|
1327
|
+
c[t] = { [n]: a.compose(r, i, t === "retain") };
|
|
1328
|
+
}
|
|
1329
|
+
let d = a.default.compose(o.attributes, s.attributes, typeof o.retain == "number");
|
|
1330
|
+
if (d && (c.attributes = d), u.push(c), !r.hasNext() && i(u.ops[u.ops.length - 1], c)) {
|
|
1331
|
+
let t = new e(n.rest());
|
|
1332
|
+
return u.concat(t).chop();
|
|
1333
|
+
}
|
|
1334
|
+
} else typeof s.delete == "number" && (typeof o.retain == "number" || typeof o.retain == "object" && o.retain !== null) && u.push(s);
|
|
1335
|
+
}
|
|
1336
|
+
return u.chop();
|
|
1337
|
+
}
|
|
1338
|
+
concat(t) {
|
|
1339
|
+
let n = new e(this.ops.slice());
|
|
1340
|
+
return t.ops.length > 0 && (n.push(t.ops[0]), n.ops = n.ops.concat(t.ops.slice(1))), n;
|
|
1341
|
+
}
|
|
1342
|
+
diff(t, r) {
|
|
1343
|
+
if (this.ops === t.ops) return new e();
|
|
1344
|
+
let o = [this, t].map((e) => e.map((n) => {
|
|
1345
|
+
if (n.insert != null) return typeof n.insert == "string" ? n.insert : c;
|
|
1346
|
+
throw Error("diff() called " + (e === t ? "on" : "with") + " non-document");
|
|
1347
|
+
}).join("")), l = new e(), u = n(o[0], o[1], r, !0), d = new s.default(this.ops), f = new s.default(t.ops);
|
|
1348
|
+
return u.forEach((e) => {
|
|
1349
|
+
let t = e[1].length;
|
|
1350
|
+
for (; t > 0;) {
|
|
1351
|
+
let r = 0;
|
|
1352
|
+
switch (e[0]) {
|
|
1353
|
+
case n.INSERT:
|
|
1354
|
+
r = Math.min(f.peekLength(), t), l.push(f.next(r));
|
|
1355
|
+
break;
|
|
1356
|
+
case n.DELETE:
|
|
1357
|
+
r = Math.min(t, d.peekLength()), d.next(r), l.delete(r);
|
|
1358
|
+
break;
|
|
1359
|
+
case n.EQUAL:
|
|
1360
|
+
r = Math.min(d.peekLength(), f.peekLength(), t);
|
|
1361
|
+
let e = d.next(r), o = f.next(r);
|
|
1362
|
+
i(e.insert, o.insert) ? l.retain(r, a.default.diff(e.attributes, o.attributes)) : l.push(o).delete(r);
|
|
1363
|
+
break;
|
|
1364
|
+
}
|
|
1365
|
+
t -= r;
|
|
1366
|
+
}
|
|
1367
|
+
}), l.chop();
|
|
1368
|
+
}
|
|
1369
|
+
eachLine(t, n = "\n") {
|
|
1370
|
+
let r = new s.default(this.ops), i = new e(), a = 0;
|
|
1371
|
+
for (; r.hasNext();) {
|
|
1372
|
+
if (r.peekType() !== "insert") return;
|
|
1373
|
+
let s = r.peek(), c = o.default.length(s) - r.peekLength(), l = typeof s.insert == "string" ? s.insert.indexOf(n, c) - c : -1;
|
|
1374
|
+
if (l < 0) i.push(r.next());
|
|
1375
|
+
else if (l > 0) i.push(r.next(l));
|
|
1376
|
+
else {
|
|
1377
|
+
if (t(i, r.next(1).attributes || {}, a) === !1) return;
|
|
1378
|
+
a += 1, i = new e();
|
|
1379
|
+
}
|
|
1380
|
+
}
|
|
1381
|
+
i.length() > 0 && t(i, {}, a);
|
|
1382
|
+
}
|
|
1383
|
+
invert(t) {
|
|
1384
|
+
let n = new e();
|
|
1385
|
+
return this.reduce((r, i) => {
|
|
1386
|
+
if (i.insert) n.delete(o.default.length(i));
|
|
1387
|
+
else if (typeof i.retain == "number" && i.attributes == null) return n.retain(i.retain), r + i.retain;
|
|
1388
|
+
else if (i.delete || typeof i.retain == "number") {
|
|
1389
|
+
let e = i.delete || i.retain;
|
|
1390
|
+
return t.slice(r, r + e).forEach((e) => {
|
|
1391
|
+
i.delete ? n.push(e) : i.retain && i.attributes && n.retain(o.default.length(e), a.default.invert(i.attributes, e.attributes));
|
|
1392
|
+
}), r + e;
|
|
1393
|
+
} else if (typeof i.retain == "object" && i.retain !== null) {
|
|
1394
|
+
let o = t.slice(r, r + 1), c = new s.default(o.ops).next(), [u, d, f] = l(i.retain, c.insert), p = e.getHandler(u);
|
|
1395
|
+
return n.retain({ [u]: p.invert(d, f) }, a.default.invert(i.attributes, c.attributes)), r + 1;
|
|
1396
|
+
}
|
|
1397
|
+
return r;
|
|
1398
|
+
}, 0), n.chop();
|
|
1399
|
+
}
|
|
1400
|
+
transform(t, n = !1) {
|
|
1401
|
+
if (n = !!n, typeof t == "number") return this.transformPosition(t, n);
|
|
1402
|
+
let r = t, i = new s.default(this.ops), c = new s.default(r.ops), l = new e();
|
|
1403
|
+
for (; i.hasNext() || c.hasNext();) if (i.peekType() === "insert" && (n || c.peekType() !== "insert")) l.retain(o.default.length(i.next()));
|
|
1404
|
+
else if (c.peekType() === "insert") l.push(c.next());
|
|
1405
|
+
else {
|
|
1406
|
+
let t = Math.min(i.peekLength(), c.peekLength()), r = i.next(t), o = c.next(t);
|
|
1407
|
+
if (r.delete) continue;
|
|
1408
|
+
if (o.delete) l.push(o);
|
|
1409
|
+
else {
|
|
1410
|
+
let i = r.retain, s = o.retain, c = typeof s == "object" && s ? s : t;
|
|
1411
|
+
if (typeof i == "object" && i && typeof s == "object" && s) {
|
|
1412
|
+
let t = Object.keys(i)[0];
|
|
1413
|
+
if (t === Object.keys(s)[0]) {
|
|
1414
|
+
let r = e.getHandler(t);
|
|
1415
|
+
r && (c = { [t]: r.transform(i[t], s[t], n) });
|
|
1416
|
+
}
|
|
1417
|
+
}
|
|
1418
|
+
l.retain(c, a.default.transform(r.attributes, o.attributes, n));
|
|
1419
|
+
}
|
|
1420
|
+
}
|
|
1421
|
+
return l.chop();
|
|
1422
|
+
}
|
|
1423
|
+
transformPosition(e, t = !1) {
|
|
1424
|
+
t = !!t;
|
|
1425
|
+
let n = new s.default(this.ops), r = 0;
|
|
1426
|
+
for (; n.hasNext() && r <= e;) {
|
|
1427
|
+
let i = n.peekLength(), a = n.peekType();
|
|
1428
|
+
if (n.next(), a === "delete") {
|
|
1429
|
+
e -= Math.min(i, e - r);
|
|
1430
|
+
continue;
|
|
1431
|
+
} else a === "insert" && (r < e || !t) && (e += i);
|
|
1432
|
+
r += i;
|
|
1433
|
+
}
|
|
1434
|
+
return e;
|
|
1435
|
+
}
|
|
1436
|
+
};
|
|
1437
|
+
u.Op = o.default, u.OpIterator = s.default, u.AttributeMap = a.default, u.handlers = {}, e.default = u, typeof t == "object" && (t.exports = u, t.exports.default = u);
|
|
1438
|
+
}));
|
|
1439
|
+
//#endregion
|
|
1440
|
+
export { p as a, o as c, w as i, s as l, E as n, f as o, T as r, u as s, ie as t, l as u };
|