@quoreadmin/ui 1.10.21 → 1.10.22
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/index.css +1 -1
- package/dist/index183.js +3 -3
- package/dist/index186.js +4 -4
- package/dist/index193.js +10 -10
- package/dist/index195.js +10 -10
- package/dist/index198.js +17 -17
- package/dist/index201.js +28 -28
- package/dist/index202.js +2 -2
- package/dist/index203.js +2 -2
- package/dist/index204.js +1 -1
- package/dist/index206.js +2 -2
- package/dist/index208.js +14 -14
- package/dist/index209.js +1 -1
- package/dist/index210.js +1 -1
- package/dist/index211.js +3 -3
- package/dist/index212.js +6 -6
- package/dist/index216.js +2 -2
- package/dist/index227.js +106 -67
- package/dist/index228.js +26 -395
- package/dist/index229.js +406 -21
- package/dist/index230.js +76 -123
- package/dist/index231.js +19 -37
- package/dist/index232.js +85 -77
- package/dist/index233.js +12 -12
- package/dist/index234.js +3 -3
- package/dist/index235.js +3 -3
- package/dist/index236.js +11 -11
- package/dist/index237.js +22 -20
- package/dist/index238.js +159 -159
- package/dist/index239.js +20 -228
- package/dist/index240.js +21 -36
- package/dist/index241.js +198 -9
- package/dist/index242.js +49 -140
- package/dist/index243.js +34 -20
- package/dist/index244.js +39 -21
- package/dist/index245.js +21 -198
- package/dist/index246.js +21 -69
- package/dist/index247.js +20 -34
- package/dist/index248.js +823 -27
- package/dist/index249.js +701 -21
- package/dist/index250.js +176 -22
- package/dist/index251.js +15 -13
- package/dist/index252.js +20 -836
- package/dist/index253.js +19 -701
- package/dist/index254.js +3 -176
- package/dist/index255.js +186 -21
- package/dist/index256.js +132 -19
- package/dist/index257.js +1223 -20
- package/dist/index258.js +20 -3
- package/dist/index259.js +21 -186
- package/dist/index260.js +21 -132
- package/dist/index261.js +29 -1223
- package/dist/index262.js +12 -12
- package/dist/index263.js +13 -15
- package/dist/index264.js +2 -22
- package/dist/index265.js +2 -29
- package/dist/index266.js +3636 -20
- package/dist/index267.js +55 -20
- package/dist/index268.js +77 -2
- package/dist/index269.js +52 -2
- package/dist/index270.js +182 -3603
- package/dist/index271.js +8 -53
- package/dist/index272.js +40 -60
- package/dist/index273.js +44 -35
- package/dist/index274.js +32 -193
- package/dist/index275.js +74 -9
- package/dist/index276.js +707 -38
- package/dist/index277.js +25 -44
- package/dist/index278.js +46 -36
- package/dist/index279.js +10 -74
- package/dist/index280.js +679 -700
- package/dist/index281.js +817 -39
- package/dist/index282.js +160 -63
- package/dist/index283.js +227 -10
- package/dist/index284.js +36 -704
- package/dist/index285.js +9 -819
- package/dist/index287.js +2 -8
- package/dist/index290.js +79 -2
- package/dist/index291.js +8 -79
- package/dist/index292.js +3 -54
- package/dist/index293.js +26 -25
- package/dist/index294.js +53 -21
- package/dist/index295.js +17 -13
- package/dist/index296.js +22 -16
- package/dist/index297.js +22 -17
- package/dist/index298.js +15 -22
- package/dist/index299.js +17 -3
- package/dist/index300.js +23 -27
- package/dist/index302.js +1 -1
- package/dist/index303.js +2 -2
- package/dist/index304.js +1 -1
- package/dist/index305.js +1 -1
- package/dist/index306.js +1 -1
- package/dist/index310.js +1 -1
- package/dist/index311.js +1 -1
- package/dist/index313.js +1519 -247
- package/dist/index314.js +384 -4
- package/dist/index315.js +2715 -124
- package/dist/index316.js +82 -69
- package/dist/index317.js +3790 -85
- package/dist/index318.js +57 -26
- package/dist/index319.js +15 -16
- package/dist/index320.js +74 -65
- package/dist/index321.js +201 -3
- package/dist/index322.js +246 -2
- package/dist/index323.js +254 -75
- package/dist/index324.js +5 -52
- package/dist/index325.js +139 -5
- package/dist/index326.js +72 -4
- package/dist/index327.js +79 -171
- package/dist/index328.js +26 -60
- package/dist/index329.js +16 -75
- package/dist/index330.js +64 -1523
- package/dist/index331.js +3 -385
- package/dist/index332.js +2 -2731
- package/dist/index333.js +77 -80
- package/dist/index334.js +53 -3792
- package/dist/index335.js +4 -58
- package/dist/index336.js +5 -15
- package/dist/index337.js +166 -71
- package/dist/index338.js +57 -196
- package/dist/index339.js +75 -246
- package/dist/index364.js +1 -1
- package/dist/index365.js +1 -1
- package/dist/index366.js +1 -1
- package/dist/index368.js +2 -2
- package/dist/index369.js +1 -1
- package/dist/index370.js +6 -6
- package/dist/index371.js +2 -2
- package/dist/index372.js +2 -2
- package/dist/index374.js +2 -2
- package/dist/index375.js +2 -2
- package/dist/index376.js +1 -1
- package/dist/index378.js +8 -8
- package/dist/index379.js +8 -8
- package/dist/index38.js +2 -2
- package/dist/index381.js +98 -28
- package/dist/index382.js +90 -10
- package/dist/index383.js +98 -4
- package/dist/index384.js +30 -3
- package/dist/index385.js +11 -13
- package/dist/index386.js +4 -7
- package/dist/index387.js +3 -11
- package/dist/index388.js +13 -5
- package/dist/index389.js +7 -33
- package/dist/index390.js +11 -30
- package/dist/index391.js +5 -28
- package/dist/index392.js +33 -61
- package/dist/index393.js +29 -96
- package/dist/index394.js +26 -99
- package/dist/index395.js +61 -91
- package/dist/index396.js +1 -1
- package/dist/index402.js +1 -1
- package/package.json +1 -1
package/dist/index322.js
CHANGED
|
@@ -1,4 +1,248 @@
|
|
|
1
|
-
|
|
1
|
+
import P from "./index383.js";
|
|
2
|
+
import { Mapping as k } from "./index313.js";
|
|
3
|
+
import { Plugin as H, PluginKey as O } from "./index281.js";
|
|
4
|
+
const D = 500;
|
|
5
|
+
class c {
|
|
6
|
+
constructor(t, e) {
|
|
7
|
+
this.items = t, this.eventCount = e;
|
|
8
|
+
}
|
|
9
|
+
// Pop the latest event off the branch's history and apply it
|
|
10
|
+
// to a document transform.
|
|
11
|
+
popEvent(t, e) {
|
|
12
|
+
if (this.eventCount == 0)
|
|
13
|
+
return null;
|
|
14
|
+
let i = this.items.length;
|
|
15
|
+
for (; ; i--)
|
|
16
|
+
if (this.items.get(i - 1).selection) {
|
|
17
|
+
--i;
|
|
18
|
+
break;
|
|
19
|
+
}
|
|
20
|
+
let s, p;
|
|
21
|
+
e && (s = this.remapping(i, this.items.length), p = s.maps.length);
|
|
22
|
+
let l = t.tr, r, m, u = [], f = [];
|
|
23
|
+
return this.items.forEach((a, o) => {
|
|
24
|
+
if (!a.step) {
|
|
25
|
+
s || (s = this.remapping(i, o + 1), p = s.maps.length), p--, f.push(a);
|
|
26
|
+
return;
|
|
27
|
+
}
|
|
28
|
+
if (s) {
|
|
29
|
+
f.push(new g(a.map));
|
|
30
|
+
let d = a.step.map(s.slice(p)), v;
|
|
31
|
+
d && l.maybeStep(d).doc && (v = l.mapping.maps[l.mapping.maps.length - 1], u.push(new g(v, void 0, void 0, u.length + f.length))), p--, v && s.appendMap(v, p);
|
|
32
|
+
} else
|
|
33
|
+
l.maybeStep(a.step);
|
|
34
|
+
if (a.selection)
|
|
35
|
+
return r = s ? a.selection.map(s.slice(p)) : a.selection, m = new c(this.items.slice(0, i).append(f.reverse().concat(u)), this.eventCount - 1), !1;
|
|
36
|
+
}, this.items.length, 0), { remaining: m, transform: l, selection: r };
|
|
37
|
+
}
|
|
38
|
+
// Create a new branch with the given transform added.
|
|
39
|
+
addTransform(t, e, i, s) {
|
|
40
|
+
let p = [], l = this.eventCount, r = this.items, m = !s && r.length ? r.get(r.length - 1) : null;
|
|
41
|
+
for (let f = 0; f < t.steps.length; f++) {
|
|
42
|
+
let a = t.steps[f].invert(t.docs[f]), o = new g(t.mapping.maps[f], a, e), d;
|
|
43
|
+
(d = m && m.merge(o)) && (o = d, f ? p.pop() : r = r.slice(0, r.length - 1)), p.push(o), e && (l++, e = void 0), s || (m = o);
|
|
44
|
+
}
|
|
45
|
+
let u = l - i.depth;
|
|
46
|
+
return u > y && (r = x(r, u), l -= u), new c(r.append(p), l);
|
|
47
|
+
}
|
|
48
|
+
remapping(t, e) {
|
|
49
|
+
let i = new k();
|
|
50
|
+
return this.items.forEach((s, p) => {
|
|
51
|
+
let l = s.mirrorOffset != null && p - s.mirrorOffset >= t ? i.maps.length - s.mirrorOffset : void 0;
|
|
52
|
+
i.appendMap(s.map, l);
|
|
53
|
+
}, t, e), i;
|
|
54
|
+
}
|
|
55
|
+
addMaps(t) {
|
|
56
|
+
return this.eventCount == 0 ? this : new c(this.items.append(t.map((e) => new g(e))), this.eventCount);
|
|
57
|
+
}
|
|
58
|
+
// When the collab module receives remote changes, the history has
|
|
59
|
+
// to know about those, so that it can adjust the steps that were
|
|
60
|
+
// rebased on top of the remote changes, and include the position
|
|
61
|
+
// maps for the remote changes in its array of items.
|
|
62
|
+
rebased(t, e) {
|
|
63
|
+
if (!this.eventCount)
|
|
64
|
+
return this;
|
|
65
|
+
let i = [], s = Math.max(0, this.items.length - e), p = t.mapping, l = t.steps.length, r = this.eventCount;
|
|
66
|
+
this.items.forEach((o) => {
|
|
67
|
+
o.selection && r--;
|
|
68
|
+
}, s);
|
|
69
|
+
let m = e;
|
|
70
|
+
this.items.forEach((o) => {
|
|
71
|
+
let d = p.getMirror(--m);
|
|
72
|
+
if (d == null)
|
|
73
|
+
return;
|
|
74
|
+
l = Math.min(l, d);
|
|
75
|
+
let v = p.maps[d];
|
|
76
|
+
if (o.step) {
|
|
77
|
+
let S = t.steps[d].invert(t.docs[d]), E = o.selection && o.selection.map(p.slice(m + 1, d));
|
|
78
|
+
E && r++, i.push(new g(v, S, E));
|
|
79
|
+
} else
|
|
80
|
+
i.push(new g(v));
|
|
81
|
+
}, s);
|
|
82
|
+
let u = [];
|
|
83
|
+
for (let o = e; o < l; o++)
|
|
84
|
+
u.push(new g(p.maps[o]));
|
|
85
|
+
let f = this.items.slice(0, s).append(u).append(i), a = new c(f, r);
|
|
86
|
+
return a.emptyItemCount() > D && (a = a.compress(this.items.length - i.length)), a;
|
|
87
|
+
}
|
|
88
|
+
emptyItemCount() {
|
|
89
|
+
let t = 0;
|
|
90
|
+
return this.items.forEach((e) => {
|
|
91
|
+
e.step || t++;
|
|
92
|
+
}), t;
|
|
93
|
+
}
|
|
94
|
+
// Compressing a branch means rewriting it to push the air (map-only
|
|
95
|
+
// items) out. During collaboration, these naturally accumulate
|
|
96
|
+
// because each remote change adds one. The `upto` argument is used
|
|
97
|
+
// to ensure that only the items below a given level are compressed,
|
|
98
|
+
// because `rebased` relies on a clean, untouched set of items in
|
|
99
|
+
// order to associate old items with rebased steps.
|
|
100
|
+
compress(t = this.items.length) {
|
|
101
|
+
let e = this.remapping(0, t), i = e.maps.length, s = [], p = 0;
|
|
102
|
+
return this.items.forEach((l, r) => {
|
|
103
|
+
if (r >= t)
|
|
104
|
+
s.push(l), l.selection && p++;
|
|
105
|
+
else if (l.step) {
|
|
106
|
+
let m = l.step.map(e.slice(i)), u = m && m.getMap();
|
|
107
|
+
if (i--, u && e.appendMap(u, i), m) {
|
|
108
|
+
let f = l.selection && l.selection.map(e.slice(i));
|
|
109
|
+
f && p++;
|
|
110
|
+
let a = new g(u.invert(), m, f), o, d = s.length - 1;
|
|
111
|
+
(o = s.length && s[d].merge(a)) ? s[d] = o : s.push(a);
|
|
112
|
+
}
|
|
113
|
+
} else l.map && i--;
|
|
114
|
+
}, this.items.length, 0), new c(P.from(s.reverse()), p);
|
|
115
|
+
}
|
|
116
|
+
}
|
|
117
|
+
c.empty = new c(P.empty, 0);
|
|
118
|
+
function x(n, t) {
|
|
119
|
+
let e;
|
|
120
|
+
return n.forEach((i, s) => {
|
|
121
|
+
if (i.selection && t-- == 0)
|
|
122
|
+
return e = s, !1;
|
|
123
|
+
}), n.slice(e);
|
|
124
|
+
}
|
|
125
|
+
class g {
|
|
126
|
+
constructor(t, e, i, s) {
|
|
127
|
+
this.map = t, this.step = e, this.selection = i, this.mirrorOffset = s;
|
|
128
|
+
}
|
|
129
|
+
merge(t) {
|
|
130
|
+
if (this.step && t.step && !t.selection) {
|
|
131
|
+
let e = t.step.merge(this.step);
|
|
132
|
+
if (e)
|
|
133
|
+
return new g(e.getMap().invert(), e, this.selection);
|
|
134
|
+
}
|
|
135
|
+
}
|
|
136
|
+
}
|
|
137
|
+
class h {
|
|
138
|
+
constructor(t, e, i, s, p) {
|
|
139
|
+
this.done = t, this.undone = e, this.prevRanges = i, this.prevTime = s, this.prevComposition = p;
|
|
140
|
+
}
|
|
141
|
+
}
|
|
142
|
+
const y = 20;
|
|
143
|
+
function F(n, t, e, i) {
|
|
144
|
+
let s = e.getMeta(w), p;
|
|
145
|
+
if (s)
|
|
146
|
+
return s.historyState;
|
|
147
|
+
e.getMeta(j) && (n = new h(n.done, n.undone, null, 0, -1));
|
|
148
|
+
let l = e.getMeta("appendedTransaction");
|
|
149
|
+
if (e.steps.length == 0)
|
|
150
|
+
return n;
|
|
151
|
+
if (l && l.getMeta(w))
|
|
152
|
+
return l.getMeta(w).redo ? new h(n.done.addTransform(e, void 0, i, M(t)), n.undone, I(e.mapping.maps), n.prevTime, n.prevComposition) : new h(n.done, n.undone.addTransform(e, void 0, i, M(t)), null, n.prevTime, n.prevComposition);
|
|
153
|
+
if (e.getMeta("addToHistory") !== !1 && !(l && l.getMeta("addToHistory") === !1)) {
|
|
154
|
+
let r = e.getMeta("composition"), m = n.prevTime == 0 || !l && n.prevComposition != r && (n.prevTime < (e.time || 0) - i.newGroupDelay || !G(e, n.prevRanges)), u = l ? C(n.prevRanges, e.mapping) : I(e.mapping.maps);
|
|
155
|
+
return new h(n.done.addTransform(e, m ? t.selection.getBookmark() : void 0, i, M(t)), c.empty, u, e.time, r ?? n.prevComposition);
|
|
156
|
+
} else return (p = e.getMeta("rebased")) ? new h(n.done.rebased(e, p), n.undone.rebased(e, p), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition) : new h(n.done.addMaps(e.mapping.maps), n.undone.addMaps(e.mapping.maps), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition);
|
|
157
|
+
}
|
|
158
|
+
function G(n, t) {
|
|
159
|
+
if (!t)
|
|
160
|
+
return !1;
|
|
161
|
+
if (!n.docChanged)
|
|
162
|
+
return !0;
|
|
163
|
+
let e = !1;
|
|
164
|
+
return n.mapping.maps[0].forEach((i, s) => {
|
|
165
|
+
for (let p = 0; p < t.length; p += 2)
|
|
166
|
+
i <= t[p + 1] && s >= t[p] && (e = !0);
|
|
167
|
+
}), e;
|
|
168
|
+
}
|
|
169
|
+
function I(n) {
|
|
170
|
+
let t = [];
|
|
171
|
+
for (let e = n.length - 1; e >= 0 && t.length == 0; e--)
|
|
172
|
+
n[e].forEach((i, s, p, l) => t.push(p, l));
|
|
173
|
+
return t;
|
|
174
|
+
}
|
|
175
|
+
function C(n, t) {
|
|
176
|
+
if (!n)
|
|
177
|
+
return null;
|
|
178
|
+
let e = [];
|
|
179
|
+
for (let i = 0; i < n.length; i += 2) {
|
|
180
|
+
let s = t.map(n[i], 1), p = t.map(n[i + 1], -1);
|
|
181
|
+
s <= p && e.push(s, p);
|
|
182
|
+
}
|
|
183
|
+
return e;
|
|
184
|
+
}
|
|
185
|
+
function K(n, t, e) {
|
|
186
|
+
let i = M(t), s = w.get(t).spec.config, p = (e ? n.undone : n.done).popEvent(t, i);
|
|
187
|
+
if (!p)
|
|
188
|
+
return null;
|
|
189
|
+
let l = p.selection.resolve(p.transform.doc), r = (e ? n.done : n.undone).addTransform(p.transform, t.selection.getBookmark(), s, i), m = new h(e ? r : p.remaining, e ? p.remaining : r, null, 0, -1);
|
|
190
|
+
return p.transform.setSelection(l).setMeta(w, { redo: e, historyState: m });
|
|
191
|
+
}
|
|
192
|
+
let T = !1, b = null;
|
|
193
|
+
function M(n) {
|
|
194
|
+
let t = n.plugins;
|
|
195
|
+
if (b != t) {
|
|
196
|
+
T = !1, b = t;
|
|
197
|
+
for (let e = 0; e < t.length; e++)
|
|
198
|
+
if (t[e].spec.historyPreserveItems) {
|
|
199
|
+
T = !0;
|
|
200
|
+
break;
|
|
201
|
+
}
|
|
202
|
+
}
|
|
203
|
+
return T;
|
|
204
|
+
}
|
|
205
|
+
const w = new O("history"), j = new O("closeHistory");
|
|
206
|
+
function W(n = {}) {
|
|
207
|
+
return n = {
|
|
208
|
+
depth: n.depth || 100,
|
|
209
|
+
newGroupDelay: n.newGroupDelay || 500
|
|
210
|
+
}, new H({
|
|
211
|
+
key: w,
|
|
212
|
+
state: {
|
|
213
|
+
init() {
|
|
214
|
+
return new h(c.empty, c.empty, null, 0, -1);
|
|
215
|
+
},
|
|
216
|
+
apply(t, e, i) {
|
|
217
|
+
return F(e, i, t, n);
|
|
218
|
+
}
|
|
219
|
+
},
|
|
220
|
+
config: n,
|
|
221
|
+
props: {
|
|
222
|
+
handleDOMEvents: {
|
|
223
|
+
beforeinput(t, e) {
|
|
224
|
+
let i = e.inputType, s = i == "historyUndo" ? A : i == "historyRedo" ? U : null;
|
|
225
|
+
return !s || !t.editable ? !1 : (e.preventDefault(), s(t.state, t.dispatch));
|
|
226
|
+
}
|
|
227
|
+
}
|
|
228
|
+
}
|
|
229
|
+
});
|
|
230
|
+
}
|
|
231
|
+
function R(n, t) {
|
|
232
|
+
return (e, i) => {
|
|
233
|
+
let s = w.getState(e);
|
|
234
|
+
if (!s || (n ? s.undone : s.done).eventCount == 0)
|
|
235
|
+
return !1;
|
|
236
|
+
if (i) {
|
|
237
|
+
let p = K(s, e, n);
|
|
238
|
+
p && i(t ? p.scrollIntoView() : p);
|
|
239
|
+
}
|
|
240
|
+
return !0;
|
|
241
|
+
};
|
|
242
|
+
}
|
|
243
|
+
const A = R(!1, !0), U = R(!0, !0);
|
|
2
244
|
export {
|
|
3
|
-
|
|
245
|
+
W as history,
|
|
246
|
+
U as redo,
|
|
247
|
+
A as undo
|
|
4
248
|
};
|
package/dist/index323.js
CHANGED
|
@@ -1,85 +1,264 @@
|
|
|
1
|
-
import
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
return
|
|
1
|
+
import R from "./index324.js";
|
|
2
|
+
const { toString: T } = Object.prototype, { getPrototypeOf: h } = Object, { iterator: g, toStringTag: x } = Symbol, b = /* @__PURE__ */ ((e) => (t) => {
|
|
3
|
+
const r = T.call(t);
|
|
4
|
+
return e[r] || (e[r] = r.slice(8, -1).toLowerCase());
|
|
5
|
+
})(/* @__PURE__ */ Object.create(null)), f = (e) => (e = e.toLowerCase(), (t) => b(t) === e), O = (e) => (t) => typeof t === e, { isArray: p } = Array, a = O("undefined");
|
|
6
|
+
function d(e) {
|
|
7
|
+
return e !== null && !a(e) && e.constructor !== null && !a(e.constructor) && c(e.constructor.isBuffer) && e.constructor.isBuffer(e);
|
|
5
8
|
}
|
|
6
|
-
|
|
7
|
-
|
|
9
|
+
const S = f("ArrayBuffer");
|
|
10
|
+
function M(e) {
|
|
11
|
+
let t;
|
|
12
|
+
return typeof ArrayBuffer < "u" && ArrayBuffer.isView ? t = ArrayBuffer.isView(e) : t = e && e.buffer && S(e.buffer), t;
|
|
8
13
|
}
|
|
9
|
-
function O(
|
|
10
|
-
|
|
11
|
-
return
|
|
12
|
-
|
|
14
|
+
const _ = O("string"), c = O("function"), B = O("number"), y = (e) => e !== null && typeof e == "object", N = (e) => e === !0 || e === !1, w = (e) => {
|
|
15
|
+
if (b(e) !== "object")
|
|
16
|
+
return !1;
|
|
17
|
+
const t = h(e);
|
|
18
|
+
return (t === null || t === Object.prototype || Object.getPrototypeOf(t) === null) && !(x in e) && !(g in e);
|
|
19
|
+
}, U = (e) => {
|
|
20
|
+
if (!y(e) || d(e))
|
|
21
|
+
return !1;
|
|
22
|
+
try {
|
|
23
|
+
return Object.keys(e).length === 0 && Object.getPrototypeOf(e) === Object.prototype;
|
|
24
|
+
} catch {
|
|
25
|
+
return !1;
|
|
26
|
+
}
|
|
27
|
+
}, I = f("Date"), k = f("File"), V = f("Blob"), q = f("FileList"), H = (e) => y(e) && c(e.pipe), z = (e) => {
|
|
28
|
+
let t;
|
|
29
|
+
return e && (typeof FormData == "function" && e instanceof FormData || c(e.append) && ((t = b(e)) === "formdata" || // detect form-data instance
|
|
30
|
+
t === "object" && c(e.toString) && e.toString() === "[object FormData]"));
|
|
31
|
+
}, J = f("URLSearchParams"), [K, $, W, G] = [
|
|
32
|
+
"ReadableStream",
|
|
33
|
+
"Request",
|
|
34
|
+
"Response",
|
|
35
|
+
"Headers"
|
|
36
|
+
].map(f), Q = (e) => e.trim ? e.trim() : e.replace(/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, "");
|
|
37
|
+
function m(e, t, { allOwnKeys: r = !1 } = {}) {
|
|
38
|
+
if (e === null || typeof e > "u")
|
|
39
|
+
return;
|
|
40
|
+
let n, s;
|
|
41
|
+
if (typeof e != "object" && (e = [e]), p(e))
|
|
42
|
+
for (n = 0, s = e.length; n < s; n++)
|
|
43
|
+
t.call(null, e[n], n, e);
|
|
44
|
+
else {
|
|
45
|
+
if (d(e))
|
|
46
|
+
return;
|
|
47
|
+
const o = r ? Object.getOwnPropertyNames(e) : Object.keys(e), i = o.length;
|
|
48
|
+
let l;
|
|
49
|
+
for (n = 0; n < i; n++)
|
|
50
|
+
l = o[n], t.call(null, e[l], l, e);
|
|
51
|
+
}
|
|
13
52
|
}
|
|
14
|
-
function
|
|
15
|
-
|
|
53
|
+
function E(e, t) {
|
|
54
|
+
if (d(e))
|
|
55
|
+
return null;
|
|
56
|
+
t = t.toLowerCase();
|
|
57
|
+
const r = Object.keys(e);
|
|
58
|
+
let n = r.length, s;
|
|
59
|
+
for (; n-- > 0; )
|
|
60
|
+
if (s = r[n], t === s.toLowerCase())
|
|
61
|
+
return s;
|
|
62
|
+
return null;
|
|
16
63
|
}
|
|
17
|
-
const
|
|
18
|
-
|
|
19
|
-
})
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
64
|
+
const u = typeof globalThis < "u" ? globalThis : typeof self < "u" ? self : typeof window < "u" ? window : global, L = (e) => !a(e) && e !== u;
|
|
65
|
+
function F() {
|
|
66
|
+
const { caseless: e, skipUndefined: t } = L(this) && this || {}, r = {}, n = (s, o) => {
|
|
67
|
+
if (o === "__proto__" || o === "constructor" || o === "prototype")
|
|
68
|
+
return;
|
|
69
|
+
const i = e && E(r, o) || o;
|
|
70
|
+
w(r[i]) && w(s) ? r[i] = F(r[i], s) : w(s) ? r[i] = F({}, s) : p(s) ? r[i] = s.slice() : (!t || !a(s)) && (r[i] = s);
|
|
71
|
+
};
|
|
72
|
+
for (let s = 0, o = arguments.length; s < o; s++)
|
|
73
|
+
arguments[s] && m(arguments[s], n);
|
|
74
|
+
return r;
|
|
75
|
+
}
|
|
76
|
+
const X = (e, t, r, { allOwnKeys: n } = {}) => (m(
|
|
77
|
+
t,
|
|
78
|
+
(s, o) => {
|
|
79
|
+
r && c(s) ? Object.defineProperty(e, o, {
|
|
80
|
+
value: R(s, r),
|
|
81
|
+
writable: !0,
|
|
82
|
+
enumerable: !0,
|
|
83
|
+
configurable: !0
|
|
84
|
+
}) : Object.defineProperty(e, o, {
|
|
85
|
+
value: s,
|
|
86
|
+
writable: !0,
|
|
87
|
+
enumerable: !0,
|
|
88
|
+
configurable: !0
|
|
89
|
+
});
|
|
90
|
+
},
|
|
91
|
+
{ allOwnKeys: n }
|
|
92
|
+
), e), Y = (e) => (e.charCodeAt(0) === 65279 && (e = e.slice(1)), e), Z = (e, t, r, n) => {
|
|
93
|
+
e.prototype = Object.create(
|
|
94
|
+
t.prototype,
|
|
95
|
+
n
|
|
96
|
+
), Object.defineProperty(e.prototype, "constructor", {
|
|
97
|
+
value: e,
|
|
98
|
+
writable: !0,
|
|
99
|
+
enumerable: !1,
|
|
100
|
+
configurable: !0
|
|
101
|
+
}), Object.defineProperty(e, "super", {
|
|
102
|
+
value: t.prototype
|
|
103
|
+
}), r && Object.assign(e.prototype, r);
|
|
104
|
+
}, j = (e, t, r, n) => {
|
|
105
|
+
let s, o, i;
|
|
106
|
+
const l = {};
|
|
107
|
+
if (t = t || {}, e == null) return t;
|
|
108
|
+
do {
|
|
109
|
+
for (s = Object.getOwnPropertyNames(e), o = s.length; o-- > 0; )
|
|
110
|
+
i = s[o], (!n || n(i, e, t)) && !l[i] && (t[i] = e[i], l[i] = !0);
|
|
111
|
+
e = r !== !1 && h(e);
|
|
112
|
+
} while (e && (!r || r(e, t)) && e !== Object.prototype);
|
|
113
|
+
return t;
|
|
114
|
+
}, v = (e, t, r) => {
|
|
115
|
+
e = String(e), (r === void 0 || r > e.length) && (r = e.length), r -= t.length;
|
|
116
|
+
const n = e.indexOf(t, r);
|
|
117
|
+
return n !== -1 && n === r;
|
|
118
|
+
}, ee = (e) => {
|
|
119
|
+
if (!e) return null;
|
|
120
|
+
if (p(e)) return e;
|
|
121
|
+
let t = e.length;
|
|
122
|
+
if (!B(t)) return null;
|
|
123
|
+
const r = new Array(t);
|
|
124
|
+
for (; t-- > 0; )
|
|
125
|
+
r[t] = e[t];
|
|
126
|
+
return r;
|
|
127
|
+
}, te = /* @__PURE__ */ ((e) => (t) => e && t instanceof e)(typeof Uint8Array < "u" && h(Uint8Array)), re = (e, t) => {
|
|
128
|
+
const n = (e && e[g]).call(e);
|
|
129
|
+
let s;
|
|
130
|
+
for (; (s = n.next()) && !s.done; ) {
|
|
131
|
+
const o = s.value;
|
|
132
|
+
t.call(e, o[0], o[1]);
|
|
42
133
|
}
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
134
|
+
}, ne = (e, t) => {
|
|
135
|
+
let r;
|
|
136
|
+
const n = [];
|
|
137
|
+
for (; (r = e.exec(t)) !== null; )
|
|
138
|
+
n.push(r);
|
|
139
|
+
return n;
|
|
140
|
+
}, se = f("HTMLFormElement"), oe = (e) => e.toLowerCase().replace(/[-_\s]([a-z\d])(\w*)/g, function(r, n, s) {
|
|
141
|
+
return n.toUpperCase() + s;
|
|
142
|
+
}), P = (({ hasOwnProperty: e }) => (t, r) => e.call(t, r))(Object.prototype), ie = f("RegExp"), C = (e, t) => {
|
|
143
|
+
const r = Object.getOwnPropertyDescriptors(e), n = {};
|
|
144
|
+
m(r, (s, o) => {
|
|
145
|
+
let i;
|
|
146
|
+
(i = t(s, o, e)) !== !1 && (n[o] = i || s);
|
|
147
|
+
}), Object.defineProperties(e, n);
|
|
148
|
+
}, ce = (e) => {
|
|
149
|
+
C(e, (t, r) => {
|
|
150
|
+
if (c(e) && ["arguments", "caller", "callee"].indexOf(r) !== -1)
|
|
151
|
+
return !1;
|
|
152
|
+
const n = e[r];
|
|
153
|
+
if (c(n)) {
|
|
154
|
+
if (t.enumerable = !1, "writable" in t) {
|
|
155
|
+
t.writable = !1;
|
|
156
|
+
return;
|
|
157
|
+
}
|
|
158
|
+
t.set || (t.set = () => {
|
|
159
|
+
throw Error("Can not rewrite read-only method '" + r + "'");
|
|
160
|
+
});
|
|
56
161
|
}
|
|
57
|
-
return B(r) ? !0 : (e.append(O(u, n, d), l(r)), !1);
|
|
58
|
-
}
|
|
59
|
-
const a = [], F = Object.assign(S, {
|
|
60
|
-
defaultVisitor: j,
|
|
61
|
-
convertValue: l,
|
|
62
|
-
isVisitable: B
|
|
63
162
|
});
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
75
|
-
)) === !0 && A(f, n ? n.concat(c) : [c]);
|
|
76
|
-
}), a.pop();
|
|
77
|
-
}
|
|
78
|
-
}
|
|
79
|
-
if (!t.isObject(i))
|
|
80
|
-
throw new TypeError("data must be an object");
|
|
81
|
-
return A(i), e;
|
|
163
|
+
}, fe = (e, t) => {
|
|
164
|
+
const r = {}, n = (s) => {
|
|
165
|
+
s.forEach((o) => {
|
|
166
|
+
r[o] = !0;
|
|
167
|
+
});
|
|
168
|
+
};
|
|
169
|
+
return p(e) ? n(e) : n(String(e).split(t)), r;
|
|
170
|
+
}, le = () => {
|
|
171
|
+
}, ue = (e, t) => e != null && Number.isFinite(e = +e) ? e : t;
|
|
172
|
+
function ae(e) {
|
|
173
|
+
return !!(e && c(e.append) && e[x] === "FormData" && e[g]);
|
|
82
174
|
}
|
|
175
|
+
const pe = (e) => {
|
|
176
|
+
const t = new Array(10), r = (n, s) => {
|
|
177
|
+
if (y(n)) {
|
|
178
|
+
if (t.indexOf(n) >= 0)
|
|
179
|
+
return;
|
|
180
|
+
if (d(n))
|
|
181
|
+
return n;
|
|
182
|
+
if (!("toJSON" in n)) {
|
|
183
|
+
t[s] = n;
|
|
184
|
+
const o = p(n) ? [] : {};
|
|
185
|
+
return m(n, (i, l) => {
|
|
186
|
+
const A = r(i, s + 1);
|
|
187
|
+
!a(A) && (o[l] = A);
|
|
188
|
+
}), t[s] = void 0, o;
|
|
189
|
+
}
|
|
190
|
+
}
|
|
191
|
+
return n;
|
|
192
|
+
};
|
|
193
|
+
return r(e, 0);
|
|
194
|
+
}, de = f("AsyncFunction"), ye = (e) => e && (y(e) || c(e)) && c(e.then) && c(e.catch), D = ((e, t) => e ? setImmediate : t ? ((r, n) => (u.addEventListener(
|
|
195
|
+
"message",
|
|
196
|
+
({ source: s, data: o }) => {
|
|
197
|
+
s === u && o === r && n.length && n.shift()();
|
|
198
|
+
},
|
|
199
|
+
!1
|
|
200
|
+
), (s) => {
|
|
201
|
+
n.push(s), u.postMessage(r, "*");
|
|
202
|
+
}))(`axios@${Math.random()}`, []) : (r) => setTimeout(r))(typeof setImmediate == "function", c(u.postMessage)), me = typeof queueMicrotask < "u" ? queueMicrotask.bind(u) : typeof process < "u" && process.nextTick || D, we = (e) => e != null && c(e[g]), be = {
|
|
203
|
+
isArray: p,
|
|
204
|
+
isArrayBuffer: S,
|
|
205
|
+
isBuffer: d,
|
|
206
|
+
isFormData: z,
|
|
207
|
+
isArrayBufferView: M,
|
|
208
|
+
isString: _,
|
|
209
|
+
isNumber: B,
|
|
210
|
+
isBoolean: N,
|
|
211
|
+
isObject: y,
|
|
212
|
+
isPlainObject: w,
|
|
213
|
+
isEmptyObject: U,
|
|
214
|
+
isReadableStream: K,
|
|
215
|
+
isRequest: $,
|
|
216
|
+
isResponse: W,
|
|
217
|
+
isHeaders: G,
|
|
218
|
+
isUndefined: a,
|
|
219
|
+
isDate: I,
|
|
220
|
+
isFile: k,
|
|
221
|
+
isBlob: V,
|
|
222
|
+
isRegExp: ie,
|
|
223
|
+
isFunction: c,
|
|
224
|
+
isStream: H,
|
|
225
|
+
isURLSearchParams: J,
|
|
226
|
+
isTypedArray: te,
|
|
227
|
+
isFileList: q,
|
|
228
|
+
forEach: m,
|
|
229
|
+
merge: F,
|
|
230
|
+
extend: X,
|
|
231
|
+
trim: Q,
|
|
232
|
+
stripBOM: Y,
|
|
233
|
+
inherits: Z,
|
|
234
|
+
toFlatObject: j,
|
|
235
|
+
kindOf: b,
|
|
236
|
+
kindOfTest: f,
|
|
237
|
+
endsWith: v,
|
|
238
|
+
toArray: ee,
|
|
239
|
+
forEachEntry: re,
|
|
240
|
+
matchAll: ne,
|
|
241
|
+
isHTMLForm: se,
|
|
242
|
+
hasOwnProperty: P,
|
|
243
|
+
hasOwnProp: P,
|
|
244
|
+
// an alias to avoid ESLint no-prototype-builtins detection
|
|
245
|
+
reduceDescriptors: C,
|
|
246
|
+
freezeMethods: ce,
|
|
247
|
+
toObjectSet: fe,
|
|
248
|
+
toCamelCase: oe,
|
|
249
|
+
noop: le,
|
|
250
|
+
toFiniteNumber: ue,
|
|
251
|
+
findKey: E,
|
|
252
|
+
global: u,
|
|
253
|
+
isContextDefined: L,
|
|
254
|
+
isSpecCompliantForm: ae,
|
|
255
|
+
toJSONObject: pe,
|
|
256
|
+
isAsyncFn: de,
|
|
257
|
+
isThenable: ye,
|
|
258
|
+
setImmediate: D,
|
|
259
|
+
asap: me,
|
|
260
|
+
isIterable: we
|
|
261
|
+
};
|
|
83
262
|
export {
|
|
84
|
-
|
|
263
|
+
be as default
|
|
85
264
|
};
|
package/dist/index324.js
CHANGED
|
@@ -1,55 +1,8 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
return e.cause = E, e.name = E.name, O && Object.assign(e, O), e;
|
|
6
|
-
}
|
|
7
|
-
/**
|
|
8
|
-
* Create an Error with the specified message, config, error code, request and response.
|
|
9
|
-
*
|
|
10
|
-
* @param {string} message The error message.
|
|
11
|
-
* @param {string} [code] The error code (for example, 'ECONNABORTED').
|
|
12
|
-
* @param {Object} [config] The config.
|
|
13
|
-
* @param {Object} [request] The request.
|
|
14
|
-
* @param {Object} [response] The response.
|
|
15
|
-
*
|
|
16
|
-
* @returns {Error} The created error.
|
|
17
|
-
*/
|
|
18
|
-
constructor(E, t, _, i, s) {
|
|
19
|
-
super(E), this.name = "AxiosError", this.isAxiosError = !0, t && (this.code = t), _ && (this.config = _), i && (this.request = i), s && (this.response = s, this.status = s.status);
|
|
20
|
-
}
|
|
21
|
-
toJSON() {
|
|
22
|
-
return {
|
|
23
|
-
// Standard
|
|
24
|
-
message: this.message,
|
|
25
|
-
name: this.name,
|
|
26
|
-
// Microsoft
|
|
27
|
-
description: this.description,
|
|
28
|
-
number: this.number,
|
|
29
|
-
// Mozilla
|
|
30
|
-
fileName: this.fileName,
|
|
31
|
-
lineNumber: this.lineNumber,
|
|
32
|
-
columnNumber: this.columnNumber,
|
|
33
|
-
stack: this.stack,
|
|
34
|
-
// Axios
|
|
35
|
-
config: N.toJSONObject(this.config),
|
|
36
|
-
code: this.code,
|
|
37
|
-
status: this.status
|
|
38
|
-
};
|
|
39
|
-
}
|
|
1
|
+
function u(n, r) {
|
|
2
|
+
return function() {
|
|
3
|
+
return n.apply(r, arguments);
|
|
4
|
+
};
|
|
40
5
|
}
|
|
41
|
-
R.ERR_BAD_OPTION_VALUE = "ERR_BAD_OPTION_VALUE";
|
|
42
|
-
R.ERR_BAD_OPTION = "ERR_BAD_OPTION";
|
|
43
|
-
R.ECONNABORTED = "ECONNABORTED";
|
|
44
|
-
R.ETIMEDOUT = "ETIMEDOUT";
|
|
45
|
-
R.ERR_NETWORK = "ERR_NETWORK";
|
|
46
|
-
R.ERR_FR_TOO_MANY_REDIRECTS = "ERR_FR_TOO_MANY_REDIRECTS";
|
|
47
|
-
R.ERR_DEPRECATED = "ERR_DEPRECATED";
|
|
48
|
-
R.ERR_BAD_RESPONSE = "ERR_BAD_RESPONSE";
|
|
49
|
-
R.ERR_BAD_REQUEST = "ERR_BAD_REQUEST";
|
|
50
|
-
R.ERR_CANCELED = "ERR_CANCELED";
|
|
51
|
-
R.ERR_NOT_SUPPORT = "ERR_NOT_SUPPORT";
|
|
52
|
-
R.ERR_INVALID_URL = "ERR_INVALID_URL";
|
|
53
6
|
export {
|
|
54
|
-
|
|
7
|
+
u as default
|
|
55
8
|
};
|