@quoreadmin/ui 1.10.15 → 1.10.17
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/index182.js +14 -14
- package/dist/index183.js +3 -3
- package/dist/index186.js +4 -4
- package/dist/index193.js +9 -9
- package/dist/index194.js +1 -1
- package/dist/index195.js +2 -2
- package/dist/index198.js +17 -17
- package/dist/index201.js +4 -4
- package/dist/index202.js +1 -1
- package/dist/index203.js +1 -1
- package/dist/index204.js +1 -1
- package/dist/index212.js +4 -4
- package/dist/index213.js +29 -84
- package/dist/index214.js +109 -400
- package/dist/index215.js +36 -22
- package/dist/index216.js +26 -33
- package/dist/index217.js +31 -111
- package/dist/index218.js +50 -35
- package/dist/index219.js +43 -26
- package/dist/index220.js +3 -35
- package/dist/index221.js +9 -51
- package/dist/index222.js +18 -42
- package/dist/index223.js +10 -4
- package/dist/index224.js +10 -9
- package/dist/index225.js +38 -18
- package/dist/index226.js +21 -10
- package/dist/index227.js +88 -10
- package/dist/index228.js +403 -35
- package/dist/index229.js +22 -21
- 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 +156 -194
- package/dist/index246.js +224 -66
- package/dist/index247.js +37 -34
- package/dist/index248.js +9 -39
- package/dist/index252.js +8 -8
- package/dist/index253.js +2 -2
- package/dist/index259.js +2 -2
- package/dist/index260.js +2 -2
- package/dist/index261.js +5 -5
- package/dist/index270.js +6 -6
- package/dist/index271.js +1 -1
- package/dist/index272.js +1 -1
- package/dist/index285.js +2 -2
- package/dist/index291.js +1 -1
- package/dist/index292.js +54 -3
- package/dist/index293.js +25 -26
- package/dist/index294.js +21 -53
- package/dist/index295.js +13 -17
- package/dist/index296.js +16 -22
- package/dist/index297.js +17 -22
- package/dist/index298.js +22 -15
- package/dist/index299.js +261 -16
- package/dist/index300.js +6 -23
- package/dist/index301.js +130 -1524
- package/dist/index302.js +65 -378
- package/dist/index303.js +81 -2725
- package/dist/index304.js +26 -83
- package/dist/index305.js +13 -3789
- package/dist/index306.js +72 -57
- package/dist/index307.js +3 -78
- package/dist/index308.js +2 -22
- package/dist/index309.js +74 -926
- package/dist/index310.js +52 -21
- package/dist/index311.js +5 -19
- package/dist/index312.js +4 -19
- package/dist/index313.js +171 -61
- package/dist/index314.js +62 -18
- package/dist/index315.js +74 -18
- package/dist/index316.js +3 -22
- package/dist/index317.js +26 -21
- package/dist/index318.js +1534 -63
- package/dist/index319.js +385 -14
- package/dist/index320.js +2714 -67
- package/dist/index321.js +73 -189
- package/dist/index322.js +3767 -221
- package/dist/index323.js +52 -254
- package/dist/index324.js +78 -5
- package/dist/index325.js +21 -139
- package/dist/index326.js +928 -66
- package/dist/index327.js +21 -86
- package/dist/index328.js +19 -28
- package/dist/index329.js +19 -15
- package/dist/index330.js +67 -73
- package/dist/index331.js +19 -4
- package/dist/index332.js +19 -2
- package/dist/index333.js +21 -82
- package/dist/index334.js +21 -52
- package/dist/index335.js +63 -6
- package/dist/index336.js +15 -5
- package/dist/index337.js +71 -166
- package/dist/index338.js +196 -57
- package/dist/index339.js +246 -75
- package/dist/index341.js +18 -8
- package/dist/index342.js +56 -12
- package/dist/index343.js +27 -53
- package/dist/index344.js +6 -11
- package/dist/index345.js +50 -12
- package/dist/index346.js +7 -58
- package/dist/index347.js +10 -50
- package/dist/index348.js +7 -31
- package/dist/index349.js +28 -2
- package/dist/index350.js +2 -5
- package/dist/index351.js +70 -2
- package/dist/index352.js +165 -21
- package/dist/index353.js +8 -40
- package/dist/index354.js +13 -2
- package/dist/index355.js +55 -11
- package/dist/index356.js +10 -18
- package/dist/index357.js +14 -10
- package/dist/index358.js +58 -10
- package/dist/index359.js +51 -16
- package/dist/index360.js +31 -2
- package/dist/index361.js +2 -9
- package/dist/index362.js +5 -10
- package/dist/index363.js +2 -14
- package/dist/index364.js +23 -20
- package/dist/index365.js +40 -19
- package/dist/index366.js +2 -64
- package/dist/index367.js +10 -36
- package/dist/index368.js +17 -16
- package/dist/index369.js +10 -57
- package/dist/index370.js +10 -29
- package/dist/index371.js +16 -6
- package/dist/index372.js +2 -52
- package/dist/index373.js +8 -6
- package/dist/index374.js +9 -11
- package/dist/index375.js +13 -6
- package/dist/index376.js +20 -28
- package/dist/index377.js +20 -2
- package/dist/index378.js +61 -67
- package/dist/index379.js +36 -166
- package/dist/index380.js +28 -98
- package/dist/index381.js +10 -90
- package/dist/index382.js +4 -17
- package/dist/index383.js +4 -98
- package/dist/index384.js +12 -30
- package/dist/index385.js +7 -11
- package/dist/index386.js +11 -3
- package/dist/index387.js +4 -3
- package/dist/index388.js +33 -13
- package/dist/index389.js +31 -7
- package/dist/index390.js +28 -12
- package/dist/index391.js +61 -5
- package/dist/index392.js +101 -33
- package/dist/index393.js +91 -31
- package/dist/index394.js +16 -27
- package/dist/index395.js +96 -59
- package/dist/index396.js +1 -1
- package/dist/index4.js +5 -5
- package/dist/index401.js +1 -1
- package/dist/index402.js +2 -2
- package/package.json +1 -1
package/dist/index339.js
CHANGED
|
@@ -1,77 +1,248 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
|
|
51
|
-
|
|
52
|
-
|
|
53
|
-
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
69
|
-
|
|
70
|
-
|
|
71
|
-
|
|
72
|
-
|
|
73
|
-
|
|
74
|
-
|
|
1
|
+
import P from "./index395.js";
|
|
2
|
+
import { Mapping as k } from "./index318.js";
|
|
3
|
+
import { Plugin as H, PluginKey as O } from "./index285.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);
|
|
75
244
|
export {
|
|
76
|
-
|
|
245
|
+
W as history,
|
|
246
|
+
U as redo,
|
|
247
|
+
A as undo
|
|
77
248
|
};
|
package/dist/index341.js
CHANGED
|
@@ -1,11 +1,21 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
1
|
+
import a from "./index299.js";
|
|
2
|
+
import f from "./index380.js";
|
|
3
|
+
function d(e) {
|
|
4
|
+
return encodeURIComponent(e).replace(/%3A/gi, ":").replace(/%24/g, "$").replace(/%2C/gi, ",").replace(/%20/g, "+");
|
|
5
|
+
}
|
|
6
|
+
function m(e, i, n) {
|
|
7
|
+
if (!i)
|
|
8
|
+
return e;
|
|
9
|
+
const s = n && n.encode || d, c = a.isFunction(n) ? {
|
|
10
|
+
serialize: n
|
|
11
|
+
} : n, r = c && c.serialize;
|
|
12
|
+
let t;
|
|
13
|
+
if (r ? t = r(i, c) : t = a.isURLSearchParams(i) ? i.toString() : new f(i, c).toString(s), t) {
|
|
14
|
+
const o = e.indexOf("#");
|
|
15
|
+
o !== -1 && (e = e.slice(0, o)), e += (e.indexOf("?") === -1 ? "?" : "&") + t;
|
|
16
|
+
}
|
|
17
|
+
return e;
|
|
8
18
|
}
|
|
9
19
|
export {
|
|
10
|
-
|
|
20
|
+
m as default
|
|
11
21
|
};
|
package/dist/index342.js
CHANGED
|
@@ -1,15 +1,59 @@
|
|
|
1
|
-
import
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
1
|
+
import n from "./index299.js";
|
|
2
|
+
class a {
|
|
3
|
+
constructor() {
|
|
4
|
+
this.handlers = [];
|
|
5
|
+
}
|
|
6
|
+
/**
|
|
7
|
+
* Add a new interceptor to the stack
|
|
8
|
+
*
|
|
9
|
+
* @param {Function} fulfilled The function to handle `then` for a `Promise`
|
|
10
|
+
* @param {Function} rejected The function to handle `reject` for a `Promise`
|
|
11
|
+
* @param {Object} options The options for the interceptor, synchronous and runWhen
|
|
12
|
+
*
|
|
13
|
+
* @return {Number} An ID used to remove interceptor later
|
|
14
|
+
*/
|
|
15
|
+
use(s, h, r) {
|
|
16
|
+
return this.handlers.push({
|
|
17
|
+
fulfilled: s,
|
|
18
|
+
rejected: h,
|
|
19
|
+
synchronous: r ? r.synchronous : !1,
|
|
20
|
+
runWhen: r ? r.runWhen : null
|
|
21
|
+
}), this.handlers.length - 1;
|
|
22
|
+
}
|
|
23
|
+
/**
|
|
24
|
+
* Remove an interceptor from the stack
|
|
25
|
+
*
|
|
26
|
+
* @param {Number} id The ID that was returned by `use`
|
|
27
|
+
*
|
|
28
|
+
* @returns {void}
|
|
29
|
+
*/
|
|
30
|
+
eject(s) {
|
|
31
|
+
this.handlers[s] && (this.handlers[s] = null);
|
|
32
|
+
}
|
|
33
|
+
/**
|
|
34
|
+
* Clear all interceptors from the stack
|
|
35
|
+
*
|
|
36
|
+
* @returns {void}
|
|
37
|
+
*/
|
|
38
|
+
clear() {
|
|
39
|
+
this.handlers && (this.handlers = []);
|
|
40
|
+
}
|
|
41
|
+
/**
|
|
42
|
+
* Iterate over all the registered interceptors
|
|
43
|
+
*
|
|
44
|
+
* This method is particularly useful for skipping over any
|
|
45
|
+
* interceptors that may have become `null` calling `eject`.
|
|
46
|
+
*
|
|
47
|
+
* @param {Function} fn The function to call for each interceptor
|
|
48
|
+
*
|
|
49
|
+
* @returns {void}
|
|
50
|
+
*/
|
|
51
|
+
forEach(s) {
|
|
52
|
+
n.forEach(this.handlers, function(r) {
|
|
53
|
+
r !== null && s(r);
|
|
54
|
+
});
|
|
55
|
+
}
|
|
12
56
|
}
|
|
13
57
|
export {
|
|
14
|
-
|
|
58
|
+
a as default
|
|
15
59
|
};
|
package/dist/index343.js
CHANGED
|
@@ -1,57 +1,31 @@
|
|
|
1
|
-
import
|
|
2
|
-
import
|
|
3
|
-
import
|
|
4
|
-
import
|
|
5
|
-
import
|
|
6
|
-
import
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
function u(r) {
|
|
11
|
-
if (typeof r == "number")
|
|
12
|
-
return A;
|
|
13
|
-
if (typeof r == "string")
|
|
14
|
-
return d.test(r) ? x : g;
|
|
15
|
-
if (Array.isArray(r))
|
|
16
|
-
return h;
|
|
17
|
-
if (typeof r == "object")
|
|
18
|
-
return y;
|
|
1
|
+
import r from "./index381.js";
|
|
2
|
+
import p from "./index307.js";
|
|
3
|
+
import l from "./index303.js";
|
|
4
|
+
import m from "./index305.js";
|
|
5
|
+
import a from "./index313.js";
|
|
6
|
+
import o from "./index314.js";
|
|
7
|
+
function d(e) {
|
|
8
|
+
if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
|
|
9
|
+
throw new m(null, e);
|
|
19
10
|
}
|
|
20
|
-
function
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
|
|
29
|
-
|
|
30
|
-
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
return (f) => {
|
|
38
|
-
let n = 0, o = !1;
|
|
39
|
-
if (f <= r[0] ? o = !0 : f >= r[t] && (n = t - 1, o = !0), !o) {
|
|
40
|
-
let s = 1;
|
|
41
|
-
for (; s < i && !(r[s] > f || s === t); s++)
|
|
42
|
-
;
|
|
43
|
-
n = s - 1;
|
|
44
|
-
}
|
|
45
|
-
const m = c(r[n], r[n + 1], f);
|
|
46
|
-
return e[n](m);
|
|
47
|
-
};
|
|
48
|
-
}
|
|
49
|
-
function R(r, e, { clamp: i = !0, ease: t, mixer: f } = {}) {
|
|
50
|
-
const n = r.length;
|
|
51
|
-
l(n === e.length, "Both input and output ranges must be the same length"), l(!t || !Array.isArray(t) || t.length === n - 1, "Array of easing functions must be of length `input.length - 1`, as it applies to the transitions **between** the defined values."), r[0] > r[n - 1] && (r = [].concat(r), e = [].concat(e), r.reverse(), e.reverse());
|
|
52
|
-
const o = I(e, t, f), m = n === 2 ? M(r, o) : F(r, o);
|
|
53
|
-
return i ? (s) => m(p(r[0], r[n - 1], s)) : m;
|
|
11
|
+
function q(e) {
|
|
12
|
+
return d(e), e.headers = a.from(e.headers), e.data = r.call(
|
|
13
|
+
e,
|
|
14
|
+
e.transformRequest
|
|
15
|
+
), ["post", "put", "patch"].indexOf(e.method) !== -1 && e.headers.setContentType("application/x-www-form-urlencoded", !1), o.getAdapter(e.adapter || l.adapter, e)(e).then(function(t) {
|
|
16
|
+
return d(e), t.data = r.call(
|
|
17
|
+
e,
|
|
18
|
+
e.transformResponse,
|
|
19
|
+
t
|
|
20
|
+
), t.headers = a.from(t.headers), t;
|
|
21
|
+
}, function(t) {
|
|
22
|
+
return p(t) || (d(e), t && t.response && (t.response.data = r.call(
|
|
23
|
+
e,
|
|
24
|
+
e.transformResponse,
|
|
25
|
+
t.response
|
|
26
|
+
), t.response.headers = a.from(t.response.headers))), Promise.reject(t);
|
|
27
|
+
});
|
|
54
28
|
}
|
|
55
29
|
export {
|
|
56
|
-
|
|
30
|
+
q as default
|
|
57
31
|
};
|
package/dist/index344.js
CHANGED
|
@@ -1,14 +1,9 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
return
|
|
6
|
-
}
|
|
7
|
-
function c(r, e, n, t) {
|
|
8
|
-
return t ? r >= e + n : r <= -n;
|
|
1
|
+
import r from "./index382.js";
|
|
2
|
+
import f from "./index383.js";
|
|
3
|
+
function u(l, i, t) {
|
|
4
|
+
let o = !r(i);
|
|
5
|
+
return l && (o || t == !1) ? f(l, i) : i;
|
|
9
6
|
}
|
|
10
7
|
export {
|
|
11
|
-
|
|
12
|
-
p as loopElapsed,
|
|
13
|
-
u as reverseElapsed
|
|
8
|
+
u as default
|
|
14
9
|
};
|
package/dist/index345.js
CHANGED
|
@@ -1,16 +1,54 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
1
|
+
import { VERSION as w } from "./index308.js";
|
|
2
|
+
import s from "./index310.js";
|
|
3
|
+
const l = {};
|
|
4
|
+
["object", "boolean", "number", "function", "string", "symbol"].forEach((n, t) => {
|
|
5
|
+
l[n] = function(o) {
|
|
6
|
+
return typeof o === n || "a" + (t < 1 ? "n " : " ") + n;
|
|
7
|
+
};
|
|
8
|
+
});
|
|
9
|
+
const f = {};
|
|
10
|
+
l.transitional = function(t, i, o) {
|
|
11
|
+
function a(r, e) {
|
|
12
|
+
return "[Axios v" + w + "] Transitional option '" + r + "'" + e + (o ? ". " + o : "");
|
|
13
|
+
}
|
|
14
|
+
return (r, e, u) => {
|
|
15
|
+
if (t === !1)
|
|
16
|
+
throw new s(
|
|
17
|
+
a(e, " has been removed" + (i ? " in " + i : "")),
|
|
18
|
+
s.ERR_DEPRECATED
|
|
19
|
+
);
|
|
20
|
+
return i && !f[e] && (f[e] = !0, console.warn(
|
|
21
|
+
a(
|
|
22
|
+
e,
|
|
23
|
+
" has been deprecated since v" + i + " and will be removed in the near future"
|
|
24
|
+
)
|
|
25
|
+
)), t ? t(r, e, u) : !0;
|
|
12
26
|
};
|
|
27
|
+
};
|
|
28
|
+
l.spelling = function(t) {
|
|
29
|
+
return (i, o) => (console.warn(`${o} is likely a misspelling of ${t}`), !0);
|
|
30
|
+
};
|
|
31
|
+
function b(n, t, i) {
|
|
32
|
+
if (typeof n != "object")
|
|
33
|
+
throw new s("options must be an object", s.ERR_BAD_OPTION_VALUE);
|
|
34
|
+
const o = Object.keys(n);
|
|
35
|
+
let a = o.length;
|
|
36
|
+
for (; a-- > 0; ) {
|
|
37
|
+
const r = o[a], e = t[r];
|
|
38
|
+
if (e) {
|
|
39
|
+
const u = n[r], c = u === void 0 || e(u, r, n);
|
|
40
|
+
if (c !== !0)
|
|
41
|
+
throw new s("option " + r + " must be " + c, s.ERR_BAD_OPTION_VALUE);
|
|
42
|
+
continue;
|
|
43
|
+
}
|
|
44
|
+
if (i !== !0)
|
|
45
|
+
throw new s("Unknown option " + r, s.ERR_BAD_OPTION);
|
|
46
|
+
}
|
|
13
47
|
}
|
|
48
|
+
const m = {
|
|
49
|
+
assertOptions: b,
|
|
50
|
+
validators: l
|
|
51
|
+
};
|
|
14
52
|
export {
|
|
15
|
-
|
|
53
|
+
m as default
|
|
16
54
|
};
|
package/dist/index346.js
CHANGED
|
@@ -1,60 +1,9 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
}
|
|
7
|
-
function A(i) {
|
|
8
|
-
let n = Object.assign({ velocity: 0, stiffness: 100, damping: 10, mass: 1, isResolvedFromDuration: !1 }, i);
|
|
9
|
-
if (!y(i, V) && y(i, R)) {
|
|
10
|
-
const o = T(i);
|
|
11
|
-
n = Object.assign(Object.assign(Object.assign({}, n), o), { velocity: 0, mass: 1 }), n.isResolvedFromDuration = !0;
|
|
12
|
-
}
|
|
13
|
-
return n;
|
|
14
|
-
}
|
|
15
|
-
function w(i) {
|
|
16
|
-
var { from: n = 0, to: o = 1, restSpeed: q = 2, restDelta: f } = i, F = O(i, ["from", "to", "restSpeed", "restDelta"]);
|
|
17
|
-
const p = { done: !1, value: n };
|
|
18
|
-
let { stiffness: h, damping: D, mass: g, velocity: d, duration: S, isResolvedFromDuration: x } = A(F), u = b, m = b;
|
|
19
|
-
function M() {
|
|
20
|
-
const c = d ? -(d / 1e3) : 0, r = o - n, t = D / (2 * Math.sqrt(h * g)), s = Math.sqrt(h / g) / 1e3;
|
|
21
|
-
if (f === void 0 && (f = Math.min(Math.abs(o - n) / 100, 0.4)), t < 1) {
|
|
22
|
-
const e = j(s, t);
|
|
23
|
-
u = (a) => {
|
|
24
|
-
const l = Math.exp(-t * s * a);
|
|
25
|
-
return o - l * ((c + t * s * r) / e * Math.sin(e * a) + r * Math.cos(e * a));
|
|
26
|
-
}, m = (a) => {
|
|
27
|
-
const l = Math.exp(-t * s * a);
|
|
28
|
-
return t * s * l * (Math.sin(e * a) * (c + t * s * r) / e + r * Math.cos(e * a)) - l * (Math.cos(e * a) * (c + t * s * r) - e * r * Math.sin(e * a));
|
|
29
|
-
};
|
|
30
|
-
} else if (t === 1)
|
|
31
|
-
u = (e) => o - Math.exp(-s * e) * (r + (c + s * r) * e);
|
|
32
|
-
else {
|
|
33
|
-
const e = s * Math.sqrt(t * t - 1);
|
|
34
|
-
u = (a) => {
|
|
35
|
-
const l = Math.exp(-t * s * a), v = Math.min(e * a, 300);
|
|
36
|
-
return o - l * ((c + t * s * r) * Math.sinh(v) + e * r * Math.cosh(v)) / e;
|
|
37
|
-
};
|
|
38
|
-
}
|
|
39
|
-
}
|
|
40
|
-
return M(), {
|
|
41
|
-
next: (c) => {
|
|
42
|
-
const r = u(c);
|
|
43
|
-
if (x)
|
|
44
|
-
p.done = c >= S;
|
|
45
|
-
else {
|
|
46
|
-
const t = m(c) * 1e3, s = Math.abs(t) <= q, e = Math.abs(o - r) <= f;
|
|
47
|
-
p.done = s && e;
|
|
48
|
-
}
|
|
49
|
-
return p.value = p.done ? o : r, p;
|
|
50
|
-
},
|
|
51
|
-
flipTarget: () => {
|
|
52
|
-
d = -d, [n, o] = [o, n], M();
|
|
53
|
-
}
|
|
54
|
-
};
|
|
55
|
-
}
|
|
56
|
-
w.needsInterpolation = (i, n) => typeof i == "string" || typeof n == "string";
|
|
57
|
-
const b = (i) => 0;
|
|
1
|
+
const e = {
|
|
2
|
+
silentJSONParsing: !0,
|
|
3
|
+
forcedJSONParsing: !0,
|
|
4
|
+
clarifyTimeoutError: !1,
|
|
5
|
+
legacyInterceptorReqResOrdering: !0
|
|
6
|
+
};
|
|
58
7
|
export {
|
|
59
|
-
|
|
8
|
+
e as default
|
|
60
9
|
};
|