@quoreadmin/ui 1.6.4 → 1.6.6
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/index139.js +386 -347
- package/dist/index15.js +19 -19
- package/dist/index181.js +8 -8
- package/dist/index183.js +8 -8
- package/dist/index187.js +17 -17
- package/dist/index190.js +7 -7
- package/dist/index201.js +4 -4
- package/dist/index205.js +2 -2
- package/dist/index206.js +1 -1
- package/dist/index207.js +1 -1
- package/dist/index208.js +1 -1
- package/dist/index209.js +1 -1
- package/dist/index210.js +4 -4
- package/dist/index212.js +4 -4
- package/dist/index215.js +1 -1
- package/dist/index223.js +121 -155
- package/dist/index224.js +37 -19
- package/dist/index225.js +80 -20
- package/dist/index226.js +13 -15
- package/dist/index227.js +19 -198
- package/dist/index228.js +18 -68
- package/dist/index229.js +20 -34
- package/dist/index23.js +7 -6
- package/dist/index230.js +19 -39
- package/dist/index231.js +155 -121
- package/dist/index232.js +19 -37
- package/dist/index233.js +22 -80
- package/dist/index234.js +198 -19
- package/dist/index235.js +68 -18
- package/dist/index236.js +34 -20
- package/dist/index237.js +39 -19
- package/dist/index238.js +1 -1
- package/dist/index239.js +1 -1
- package/dist/index240.js +1 -1
- package/dist/index241.js +6 -6
- package/dist/index242.js +1 -1
- package/dist/index244.js +1 -1
- package/dist/index245.js +1 -1
- package/dist/index246.js +1 -1
- package/dist/index248.js +1 -1
- package/dist/index249.js +1 -1
- package/dist/index250.js +6 -6
- package/dist/index251.js +1 -1
- package/dist/index252.js +1 -1
- package/dist/index253.js +1 -1
- package/dist/index254.js +1 -1
- package/dist/index255.js +1 -1
- package/dist/index256.js +1 -1
- package/dist/index259.js +6 -6
- package/dist/index260.js +1 -1
- package/dist/index261.js +1 -1
- package/dist/index274.js +2 -2
- package/dist/index279.js +3 -54
- package/dist/index280.js +25 -77
- package/dist/index281.js +2 -26
- package/dist/index282.js +78 -21
- package/dist/index283.js +53 -21
- package/dist/index284.js +26 -16
- package/dist/index285.js +22 -17
- package/dist/index286.js +21 -22
- package/dist/index287.js +16 -2
- package/dist/index288.js +17 -235
- package/dist/index289.js +23 -6
- package/dist/index290.js +76 -131
- package/dist/index291.js +21 -67
- package/dist/index292.js +926 -78
- package/dist/index293.js +21 -28
- package/dist/index294.js +18 -7
- package/dist/index295.js +19 -74
- package/dist/index296.js +68 -3
- package/dist/index297.js +19 -2
- package/dist/index298.js +18 -82
- package/dist/index299.js +21 -53
- package/dist/index300.js +21 -5
- package/dist/index301.js +63 -5
- package/dist/index302.js +1488 -149
- package/dist/index303.js +378 -55
- package/dist/index304.js +2731 -75
- package/dist/index305.js +86 -3
- package/dist/index306.js +3764 -21
- package/dist/index307.js +55 -1513
- package/dist/index308.js +14 -385
- package/dist/index309.js +67 -2714
- package/dist/index310.js +189 -73
- package/dist/index311.js +222 -3746
- package/dist/index312.js +227 -52
- package/dist/index313.js +5 -78
- package/dist/index314.js +133 -21
- package/dist/index315.js +62 -929
- package/dist/index316.js +86 -21
- package/dist/index317.js +28 -19
- package/dist/index318.js +7 -18
- package/dist/index319.js +73 -67
- package/dist/index320.js +4 -19
- package/dist/index321.js +2 -19
- package/dist/index322.js +82 -21
- package/dist/index323.js +53 -21
- package/dist/index324.js +6 -63
- package/dist/index325.js +5 -15
- package/dist/index326.js +166 -71
- package/dist/index327.js +57 -196
- package/dist/index328.js +75 -246
- package/dist/index329.js +8 -36
- package/dist/index330.js +12 -20
- package/dist/index331.js +53 -54
- package/dist/index332.js +10 -27
- package/dist/index333.js +13 -6
- package/dist/index334.js +54 -48
- package/dist/index335.js +52 -6
- package/dist/index336.js +30 -11
- package/dist/index337.js +2 -7
- package/dist/index338.js +4 -27
- package/dist/index339.js +2 -2
- package/dist/index340.js +22 -69
- package/dist/index341.js +38 -164
- package/dist/index342.js +2 -9
- package/dist/index343.js +11 -13
- package/dist/index344.js +16 -51
- package/dist/index345.js +16 -11
- package/dist/index346.js +10 -14
- package/dist/index347.js +10 -58
- package/dist/index348.js +2 -52
- package/dist/index349.js +9 -31
- package/dist/index350.js +10 -2
- package/dist/index351.js +13 -4
- package/dist/index352.js +37 -2
- package/dist/index353.js +20 -23
- package/dist/index354.js +19 -40
- package/dist/index355.js +64 -2
- package/dist/index356.js +36 -10
- package/dist/index357.js +18 -17
- package/dist/index358.js +55 -16
- package/dist/index359.js +29 -10
- package/dist/index360.js +7 -10
- package/dist/index361.js +52 -2
- package/dist/index362.js +5 -8
- package/dist/index363.js +11 -9
- package/dist/index364.js +6 -13
- package/dist/index365.js +28 -20
- package/dist/index366.js +2 -20
- package/dist/index367.js +67 -61
- package/dist/index368.js +166 -36
- package/dist/index369.js +17 -31
- package/dist/index370.js +100 -10
- package/dist/index371.js +90 -3
- package/dist/index372.js +98 -4
- package/dist/index373.js +30 -12
- package/dist/index374.js +11 -7
- package/dist/index375.js +3 -11
- package/dist/index376.js +3 -4
- package/dist/index377.js +13 -33
- package/dist/index378.js +7 -31
- package/dist/index379.js +12 -28
- package/dist/index380.js +5 -61
- package/dist/index381.js +33 -91
- package/dist/index382.js +29 -99
- package/dist/index383.js +27 -16
- package/dist/index384.js +59 -96
- package/dist/index385.js +1 -1
- package/dist/index390.js +1 -1
- package/dist/index391.js +2 -2
- package/dist/index43.js +247 -217
- package/dist/index85.js +21 -17
- package/dist/src/components/data-filter/data-filter.d.ts +9 -0
- package/dist/src/components/data-list/data-list.d.ts +9 -0
- package/dist/src/components/grid/grid.stories.d.ts +9 -0
- package/dist/src/components/room-details-popover/room-details-popover.d.ts +18 -3
- package/dist/src/views/lists.vue.d.ts +18 -0
- package/dist/src/views/tables.vue.d.ts +9 -0
- package/package.json +1 -1
package/dist/index328.js
CHANGED
|
@@ -1,248 +1,77 @@
|
|
|
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
|
-
|
|
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);
|
|
1
|
+
const e = {
|
|
2
|
+
Continue: 100,
|
|
3
|
+
SwitchingProtocols: 101,
|
|
4
|
+
Processing: 102,
|
|
5
|
+
EarlyHints: 103,
|
|
6
|
+
Ok: 200,
|
|
7
|
+
Created: 201,
|
|
8
|
+
Accepted: 202,
|
|
9
|
+
NonAuthoritativeInformation: 203,
|
|
10
|
+
NoContent: 204,
|
|
11
|
+
ResetContent: 205,
|
|
12
|
+
PartialContent: 206,
|
|
13
|
+
MultiStatus: 207,
|
|
14
|
+
AlreadyReported: 208,
|
|
15
|
+
ImUsed: 226,
|
|
16
|
+
MultipleChoices: 300,
|
|
17
|
+
MovedPermanently: 301,
|
|
18
|
+
Found: 302,
|
|
19
|
+
SeeOther: 303,
|
|
20
|
+
NotModified: 304,
|
|
21
|
+
UseProxy: 305,
|
|
22
|
+
Unused: 306,
|
|
23
|
+
TemporaryRedirect: 307,
|
|
24
|
+
PermanentRedirect: 308,
|
|
25
|
+
BadRequest: 400,
|
|
26
|
+
Unauthorized: 401,
|
|
27
|
+
PaymentRequired: 402,
|
|
28
|
+
Forbidden: 403,
|
|
29
|
+
NotFound: 404,
|
|
30
|
+
MethodNotAllowed: 405,
|
|
31
|
+
NotAcceptable: 406,
|
|
32
|
+
ProxyAuthenticationRequired: 407,
|
|
33
|
+
RequestTimeout: 408,
|
|
34
|
+
Conflict: 409,
|
|
35
|
+
Gone: 410,
|
|
36
|
+
LengthRequired: 411,
|
|
37
|
+
PreconditionFailed: 412,
|
|
38
|
+
PayloadTooLarge: 413,
|
|
39
|
+
UriTooLong: 414,
|
|
40
|
+
UnsupportedMediaType: 415,
|
|
41
|
+
RangeNotSatisfiable: 416,
|
|
42
|
+
ExpectationFailed: 417,
|
|
43
|
+
ImATeapot: 418,
|
|
44
|
+
MisdirectedRequest: 421,
|
|
45
|
+
UnprocessableEntity: 422,
|
|
46
|
+
Locked: 423,
|
|
47
|
+
FailedDependency: 424,
|
|
48
|
+
TooEarly: 425,
|
|
49
|
+
UpgradeRequired: 426,
|
|
50
|
+
PreconditionRequired: 428,
|
|
51
|
+
TooManyRequests: 429,
|
|
52
|
+
RequestHeaderFieldsTooLarge: 431,
|
|
53
|
+
UnavailableForLegalReasons: 451,
|
|
54
|
+
InternalServerError: 500,
|
|
55
|
+
NotImplemented: 501,
|
|
56
|
+
BadGateway: 502,
|
|
57
|
+
ServiceUnavailable: 503,
|
|
58
|
+
GatewayTimeout: 504,
|
|
59
|
+
HttpVersionNotSupported: 505,
|
|
60
|
+
VariantAlsoNegotiates: 506,
|
|
61
|
+
InsufficientStorage: 507,
|
|
62
|
+
LoopDetected: 508,
|
|
63
|
+
NotExtended: 510,
|
|
64
|
+
NetworkAuthenticationRequired: 511,
|
|
65
|
+
WebServerIsDown: 521,
|
|
66
|
+
ConnectionTimedOut: 522,
|
|
67
|
+
OriginIsUnreachable: 523,
|
|
68
|
+
TimeoutOccurred: 524,
|
|
69
|
+
SslHandshakeFailed: 525,
|
|
70
|
+
InvalidSslCertificate: 526
|
|
71
|
+
};
|
|
72
|
+
Object.entries(e).forEach(([t, o]) => {
|
|
73
|
+
e[o] = t;
|
|
74
|
+
});
|
|
244
75
|
export {
|
|
245
|
-
|
|
246
|
-
U as redo,
|
|
247
|
-
A as undo
|
|
76
|
+
e as default
|
|
248
77
|
};
|
package/dist/index329.js
CHANGED
|
@@ -1,39 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
var
|
|
3
|
-
.
|
|
4
|
-
|
|
1
|
+
function f(e, n) {
|
|
2
|
+
var o = {};
|
|
3
|
+
for (var t in e) Object.prototype.hasOwnProperty.call(e, t) && n.indexOf(t) < 0 && (o[t] = e[t]);
|
|
4
|
+
if (e != null && typeof Object.getOwnPropertySymbols == "function")
|
|
5
|
+
for (var r = 0, t = Object.getOwnPropertySymbols(e); r < t.length; r++)
|
|
6
|
+
n.indexOf(t[r]) < 0 && Object.prototype.propertyIsEnumerable.call(e, t[r]) && (o[t[r]] = e[t[r]]);
|
|
7
|
+
return o;
|
|
5
8
|
}
|
|
6
|
-
|
|
7
|
-
.p-icon-spin {
|
|
8
|
-
-webkit-animation: p-icon-spin 2s infinite linear;
|
|
9
|
-
animation: p-icon-spin 2s infinite linear;
|
|
10
|
-
}
|
|
11
|
-
|
|
12
|
-
@-webkit-keyframes p-icon-spin {
|
|
13
|
-
0% {
|
|
14
|
-
-webkit-transform: rotate(0deg);
|
|
15
|
-
transform: rotate(0deg);
|
|
16
|
-
}
|
|
17
|
-
100% {
|
|
18
|
-
-webkit-transform: rotate(359deg);
|
|
19
|
-
transform: rotate(359deg);
|
|
20
|
-
}
|
|
21
|
-
}
|
|
22
|
-
|
|
23
|
-
@keyframes p-icon-spin {
|
|
24
|
-
0% {
|
|
25
|
-
-webkit-transform: rotate(0deg);
|
|
26
|
-
transform: rotate(0deg);
|
|
27
|
-
}
|
|
28
|
-
100% {
|
|
29
|
-
-webkit-transform: rotate(359deg);
|
|
30
|
-
transform: rotate(359deg);
|
|
31
|
-
}
|
|
32
|
-
}
|
|
33
|
-
`, i = n.extend({
|
|
34
|
-
name: "baseicon",
|
|
35
|
-
css: e
|
|
36
|
-
});
|
|
37
9
|
export {
|
|
38
|
-
|
|
10
|
+
f as __rest
|
|
39
11
|
};
|
package/dist/index330.js
CHANGED
|
@@ -1,23 +1,15 @@
|
|
|
1
|
-
import
|
|
2
|
-
import
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
});
|
|
13
|
-
const r = i && i.serialize;
|
|
14
|
-
let n;
|
|
15
|
-
if (r ? n = r(c, i) : n = f.isURLSearchParams(c) ? c.toString() : new d(c, i).toString(t), n) {
|
|
16
|
-
const a = e.indexOf("#");
|
|
17
|
-
a !== -1 && (e = e.slice(0, a)), e += (e.indexOf("?") === -1 ? "?" : "&") + n;
|
|
18
|
-
}
|
|
19
|
-
return e;
|
|
1
|
+
import { spring as a } from "./index334.js";
|
|
2
|
+
import { keyframes as s } from "./index336.js";
|
|
3
|
+
import { decay as i } from "./index333.js";
|
|
4
|
+
const r = { keyframes: s, spring: a, decay: i };
|
|
5
|
+
function p(t) {
|
|
6
|
+
if (Array.isArray(t.to))
|
|
7
|
+
return s;
|
|
8
|
+
if (r[t.type])
|
|
9
|
+
return r[t.type];
|
|
10
|
+
const e = new Set(Object.keys(t));
|
|
11
|
+
return e.has("ease") || e.has("duration") && !e.has("dampingRatio") ? s : e.has("dampingRatio") || e.has("stiffness") || e.has("mass") || e.has("damping") || e.has("restSpeed") || e.has("restDelta") ? a : s;
|
|
20
12
|
}
|
|
21
13
|
export {
|
|
22
|
-
|
|
14
|
+
p as detectAnimationFromOptions
|
|
23
15
|
};
|
package/dist/index331.js
CHANGED
|
@@ -1,58 +1,57 @@
|
|
|
1
|
-
import
|
|
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
|
-
eject(s) {
|
|
30
|
-
this.handlers[s] && (this.handlers[s] = null);
|
|
31
|
-
}
|
|
32
|
-
/**
|
|
33
|
-
* Clear all interceptors from the stack
|
|
34
|
-
*
|
|
35
|
-
* @returns {void}
|
|
36
|
-
*/
|
|
37
|
-
clear() {
|
|
38
|
-
this.handlers && (this.handlers = []);
|
|
39
|
-
}
|
|
40
|
-
/**
|
|
41
|
-
* Iterate over all the registered interceptors
|
|
42
|
-
*
|
|
43
|
-
* This method is particularly useful for skipping over any
|
|
44
|
-
* interceptors that may have become `null` calling `eject`.
|
|
45
|
-
*
|
|
46
|
-
* @param {Function} fn The function to call for each interceptor
|
|
47
|
-
*
|
|
48
|
-
* @returns {void}
|
|
49
|
-
*/
|
|
50
|
-
forEach(s) {
|
|
51
|
-
n.forEach(this.handlers, function(r) {
|
|
52
|
-
r !== null && s(r);
|
|
53
|
-
});
|
|
1
|
+
import { progress as c } from "./index338.js";
|
|
2
|
+
import { mix as a } from "./index339.js";
|
|
3
|
+
import { mixColor as x } from "./index340.js";
|
|
4
|
+
import { mixComplex as g, mixArray as h, mixObject as y } from "./index341.js";
|
|
5
|
+
import { clamp as p } from "./index337.js";
|
|
6
|
+
import { pipe as b } from "./index342.js";
|
|
7
|
+
import { invariant as l } from "./index343.js";
|
|
8
|
+
import { color as d } from "./index210.js";
|
|
9
|
+
const A = (r, e) => (i) => a(r, e, i);
|
|
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;
|
|
19
|
+
}
|
|
20
|
+
function I(r, e, i) {
|
|
21
|
+
const t = [], f = i || u(r[0]), n = r.length - 1;
|
|
22
|
+
for (let o = 0; o < n; o++) {
|
|
23
|
+
let m = f(r[o], r[o + 1]);
|
|
24
|
+
if (e) {
|
|
25
|
+
const s = Array.isArray(e) ? e[o] : e;
|
|
26
|
+
m = b(s, m);
|
|
27
|
+
}
|
|
28
|
+
t.push(m);
|
|
54
29
|
}
|
|
30
|
+
return t;
|
|
31
|
+
}
|
|
32
|
+
function M([r, e], [i]) {
|
|
33
|
+
return (t) => i(c(r, e, t));
|
|
34
|
+
}
|
|
35
|
+
function F(r, e) {
|
|
36
|
+
const i = r.length, t = i - 1;
|
|
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;
|
|
55
54
|
}
|
|
56
55
|
export {
|
|
57
|
-
|
|
56
|
+
R as interpolate
|
|
58
57
|
};
|
package/dist/index332.js
CHANGED
|
@@ -1,31 +1,14 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import l from "./index292.js";
|
|
4
|
-
import m from "./index294.js";
|
|
5
|
-
import a from "./index302.js";
|
|
6
|
-
import o from "./index303.js";
|
|
7
|
-
function d(e) {
|
|
8
|
-
if (e.cancelToken && e.cancelToken.throwIfRequested(), e.signal && e.signal.aborted)
|
|
9
|
-
throw new m(null, e);
|
|
1
|
+
function p(r, e, n = 0) {
|
|
2
|
+
return r - e - n;
|
|
10
3
|
}
|
|
11
|
-
function
|
|
12
|
-
return
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
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
|
-
});
|
|
4
|
+
function u(r, e, n = 0, t = !0) {
|
|
5
|
+
return t ? p(e + -r, e, n) : e - (r - e) + n;
|
|
6
|
+
}
|
|
7
|
+
function c(r, e, n, t) {
|
|
8
|
+
return t ? r >= e + n : r <= -n;
|
|
28
9
|
}
|
|
29
10
|
export {
|
|
30
|
-
|
|
11
|
+
c as hasRepeatDelayElapsed,
|
|
12
|
+
p as loopElapsed,
|
|
13
|
+
u as reverseElapsed
|
|
31
14
|
};
|
package/dist/index333.js
CHANGED
|
@@ -1,9 +1,16 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
4
|
-
|
|
5
|
-
return
|
|
1
|
+
function r({ velocity: o = 0, from: n = 0, power: i = 0.8, timeConstant: s = 350, restDelta: u = 0.5, modifyTarget: c }) {
|
|
2
|
+
const e = { done: !1, value: n };
|
|
3
|
+
let a = i * o;
|
|
4
|
+
const d = n + a, t = c === void 0 ? d : c(d);
|
|
5
|
+
return t !== d && (a = t - n), {
|
|
6
|
+
next: (p) => {
|
|
7
|
+
const l = -a * Math.exp(-p / s);
|
|
8
|
+
return e.done = !(l > u || l < -u), e.value = e.done ? t : t + l, e;
|
|
9
|
+
},
|
|
10
|
+
flipTarget: () => {
|
|
11
|
+
}
|
|
12
|
+
};
|
|
6
13
|
}
|
|
7
14
|
export {
|
|
8
|
-
|
|
15
|
+
r as decay
|
|
9
16
|
};
|