@algorisys/tinyfly 0.89.0 → 0.90.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +5 -5
- package/lib/addons/adapters.js +208 -177
- package/lib/addons/characters.js +1912 -1619
- package/lib/browser/tinyfly.iife.js +4 -4
- package/lib/browser/tinyfly.js +4845 -4464
- package/lib/browser/tinyfly.umd.js +4 -4
- package/lib/engine/tinyfly-engine.js +824 -767
- package/lib/engine/tinyfly-engine.umd.cjs +2 -2
- package/lib/headless/headless.js +39 -3
- package/lib/types/adapters/canvas/camera.d.ts +46 -0
- package/lib/types/adapters/canvas/index.d.ts +1 -0
- package/lib/types/browser/index.d.ts +2 -0
- package/lib/types/characters/acting/index.d.ts +2 -0
- package/lib/types/characters/acting/lip-sync.d.ts +115 -0
- package/lib/types/characters/acting/script.d.ts +83 -0
- package/lib/types/characters/gaits.d.ts +141 -0
- package/lib/types/characters/index.d.ts +1 -0
- package/lib/types/characters/stick-figure.d.ts +15 -0
- package/lib/types/engine/authoring/camera-shots.d.ts +73 -0
- package/lib/types/engine/authoring/index.d.ts +1 -0
- package/lib/types/headless/video-scene.d.ts +14 -0
- package/package.json +1 -1
|
@@ -1,11 +1,11 @@
|
|
|
1
|
-
function
|
|
1
|
+
function Fe(t) {
|
|
2
2
|
return typeof t == "object" && t !== null && t.type === "cubic-bezier";
|
|
3
3
|
}
|
|
4
4
|
function xt(t) {
|
|
5
5
|
return typeof t == "object" && t !== null && t.type !== "cubic-bezier";
|
|
6
6
|
}
|
|
7
|
-
const
|
|
8
|
-
function
|
|
7
|
+
const Nt = 2;
|
|
8
|
+
function re(t) {
|
|
9
9
|
return t.some((e) => e.interpolation !== void 0) ? 2 : 1;
|
|
10
10
|
}
|
|
11
11
|
function $t(t) {
|
|
@@ -17,16 +17,16 @@ function V(t) {
|
|
|
17
17
|
function j(t) {
|
|
18
18
|
return t.kind === "spring" && "spring" in t;
|
|
19
19
|
}
|
|
20
|
-
function
|
|
20
|
+
function se(t) {
|
|
21
21
|
return t.property === "motionPath" && "motionPathConfig" in t;
|
|
22
22
|
}
|
|
23
|
-
function
|
|
23
|
+
function vr(t) {
|
|
24
24
|
return typeof t == "object" && t !== null && "x" in t && "y" in t && "angle" in t;
|
|
25
25
|
}
|
|
26
|
-
function
|
|
26
|
+
function Xe(t) {
|
|
27
27
|
return "keyframes" in t;
|
|
28
28
|
}
|
|
29
|
-
class
|
|
29
|
+
class Pr {
|
|
30
30
|
_currentTime = 0;
|
|
31
31
|
_isRunning = !1;
|
|
32
32
|
onTick = null;
|
|
@@ -52,7 +52,7 @@ class Ar {
|
|
|
52
52
|
this._currentTime = e;
|
|
53
53
|
}
|
|
54
54
|
}
|
|
55
|
-
class
|
|
55
|
+
class $r {
|
|
56
56
|
_currentTime = 0;
|
|
57
57
|
_isRunning = !1;
|
|
58
58
|
_lastFrameTime = null;
|
|
@@ -99,12 +99,12 @@ class wr {
|
|
|
99
99
|
}
|
|
100
100
|
}
|
|
101
101
|
}
|
|
102
|
-
function
|
|
102
|
+
function Rr(t, e) {
|
|
103
103
|
if (!(e > 0)) return t;
|
|
104
104
|
const n = 1e3 / e;
|
|
105
105
|
return Math.floor(t / n + 1e-9) * n;
|
|
106
106
|
}
|
|
107
|
-
function
|
|
107
|
+
function oe(t, e, n = "start") {
|
|
108
108
|
if (e <= 1) return 0;
|
|
109
109
|
if (typeof n == "number") {
|
|
110
110
|
const r = Math.max(0, Math.min(e - 1, n));
|
|
@@ -121,27 +121,27 @@ function se(t, e, n = "start") {
|
|
|
121
121
|
return t;
|
|
122
122
|
}
|
|
123
123
|
}
|
|
124
|
-
function
|
|
124
|
+
function Ne(t, e = "start") {
|
|
125
125
|
if (t <= 1) return 0;
|
|
126
126
|
let n = 0;
|
|
127
127
|
for (let r = 0; r < t; r++)
|
|
128
|
-
n = Math.max(n,
|
|
128
|
+
n = Math.max(n, oe(r, t, e));
|
|
129
129
|
return n;
|
|
130
130
|
}
|
|
131
|
-
function
|
|
131
|
+
function ae(t, e, n) {
|
|
132
132
|
if (n.offsets) return n.offsets[t] ?? 0;
|
|
133
|
-
const r = n.from ?? "start", s =
|
|
133
|
+
const r = n.from ?? "start", s = oe(t, e, r);
|
|
134
134
|
if (n.amount !== void 0) {
|
|
135
|
-
const o =
|
|
135
|
+
const o = Ne(e, r);
|
|
136
136
|
return o === 0 ? 0 : n.amount * s / o;
|
|
137
137
|
}
|
|
138
138
|
return n.each !== void 0 ? n.each * s : 0;
|
|
139
139
|
}
|
|
140
|
-
function
|
|
141
|
-
return Array.from({ length: t }, (n, r) =>
|
|
140
|
+
function Ye(t, e) {
|
|
141
|
+
return Array.from({ length: t }, (n, r) => ae(r, t, e));
|
|
142
142
|
}
|
|
143
143
|
function Rt(t, e) {
|
|
144
|
-
return t <= 1 ? 0 : Math.max(...
|
|
144
|
+
return t <= 1 ? 0 : Math.max(...Ye(t, e));
|
|
145
145
|
}
|
|
146
146
|
const tt = 1, ie = 6e4, st = ie / tt, L = {
|
|
147
147
|
stiffness: 180,
|
|
@@ -150,7 +150,7 @@ const tt = 1, ie = 6e4, st = ie / tt, L = {
|
|
|
150
150
|
velocity: 0,
|
|
151
151
|
restDelta: 0.01,
|
|
152
152
|
restSpeed: 0.1
|
|
153
|
-
},
|
|
153
|
+
}, Dr = {
|
|
154
154
|
gentle: { stiffness: 120, damping: 18, mass: 1 },
|
|
155
155
|
default: { stiffness: 180, damping: 12, mass: 1 },
|
|
156
156
|
snappy: { stiffness: 280, damping: 20, mass: 1 },
|
|
@@ -219,10 +219,10 @@ class ut {
|
|
|
219
219
|
if (this.settledStep !== null) return;
|
|
220
220
|
const n = Math.min(e, st + 1), r = tt / 1e3;
|
|
221
221
|
for (; this.samples.length < n; ) {
|
|
222
|
-
const s = this.samples[this.samples.length - 1], o = s - this.to,
|
|
222
|
+
const s = this.samples[this.samples.length - 1], o = s - this.to, a = -this.stiffness * o, i = -this.damping * this.velocity, c = (a + i) / this.mass;
|
|
223
223
|
this.velocity += c * r;
|
|
224
|
-
const
|
|
225
|
-
if (this.samples.push(
|
|
224
|
+
const l = s + this.velocity * r;
|
|
225
|
+
if (this.samples.push(l), this.isAtRest(l)) {
|
|
226
226
|
this.settledStep = this.samples.length - 1;
|
|
227
227
|
return;
|
|
228
228
|
}
|
|
@@ -230,29 +230,29 @@ class ut {
|
|
|
230
230
|
this.samples.length > st && (this.settledStep = st);
|
|
231
231
|
}
|
|
232
232
|
}
|
|
233
|
-
function
|
|
233
|
+
function Cr(t, e) {
|
|
234
234
|
return new ut(t).valueAt(e);
|
|
235
235
|
}
|
|
236
|
-
function
|
|
236
|
+
function Ir(t) {
|
|
237
237
|
return new ut(t).settleTime();
|
|
238
238
|
}
|
|
239
|
-
function
|
|
239
|
+
function Er(t) {
|
|
240
240
|
const e = t.stiffness ?? L.stiffness, n = t.damping ?? L.damping, r = t.mass ?? L.mass;
|
|
241
241
|
return n < 2 * Math.sqrt(e * r);
|
|
242
242
|
}
|
|
243
|
-
function
|
|
243
|
+
function Lr(t) {
|
|
244
244
|
const e = t.stiffness ?? L.stiffness, n = t.mass ?? L.mass;
|
|
245
245
|
return 2 * Math.sqrt(e * n);
|
|
246
246
|
}
|
|
247
|
-
const
|
|
247
|
+
const Yt = 4, ze = 2e-3, Ue = 1e-4, Ve = 6e4;
|
|
248
248
|
function lt(t) {
|
|
249
|
-
const e = t.friction ??
|
|
250
|
-
return e > 0 ? e :
|
|
249
|
+
const e = t.friction ?? Yt;
|
|
250
|
+
return e > 0 ? e : Yt;
|
|
251
251
|
}
|
|
252
|
-
function
|
|
252
|
+
function je(t) {
|
|
253
253
|
return t.from + t.velocity / lt(t);
|
|
254
254
|
}
|
|
255
|
-
function
|
|
255
|
+
function He(t, e) {
|
|
256
256
|
if (e === void 0) return t;
|
|
257
257
|
if (typeof e == "number")
|
|
258
258
|
return e > 0 ? Math.round(t / e) * e : t;
|
|
@@ -263,16 +263,16 @@ function Ue(t, e) {
|
|
|
263
263
|
return n;
|
|
264
264
|
}
|
|
265
265
|
function ht(t) {
|
|
266
|
-
let e =
|
|
266
|
+
let e = He(je(t), t.end);
|
|
267
267
|
return t.min !== void 0 && (e = Math.max(t.min, e)), t.max !== void 0 && (e = Math.min(t.max, e)), e;
|
|
268
268
|
}
|
|
269
269
|
function ft(t) {
|
|
270
270
|
const e = Math.abs(ht(t) - t.from);
|
|
271
271
|
if (e === 0) return 0;
|
|
272
|
-
const n = t.restDelta ?? Math.max(
|
|
272
|
+
const n = t.restDelta ?? Math.max(Ue, e * ze);
|
|
273
273
|
if (n >= e) return 0;
|
|
274
274
|
const r = Math.log(e / n) / lt(t);
|
|
275
|
-
return Math.min(
|
|
275
|
+
return Math.min(Ve, r * 1e3);
|
|
276
276
|
}
|
|
277
277
|
function kt(t, e) {
|
|
278
278
|
if (e <= 0) return t.from;
|
|
@@ -281,47 +281,47 @@ function kt(t, e) {
|
|
|
281
281
|
const r = lt(t);
|
|
282
282
|
return t.from + (n - t.from) * (1 - Math.exp(-r * e / 1e3));
|
|
283
283
|
}
|
|
284
|
-
function
|
|
284
|
+
function Or(t, e) {
|
|
285
285
|
const n = lt(t), r = ht(t);
|
|
286
286
|
return e >= ft(t) ? 0 : (r - t.from) * n * Math.exp(-n * Math.max(0, e) / 1e3);
|
|
287
287
|
}
|
|
288
|
-
const St = (t) => t,
|
|
288
|
+
const St = (t) => t, Be = (t) => t * t, We = (t) => 1 - (1 - t) * (1 - t), Qe = (t) => t < 0.5 ? 2 * t * t : 1 - Math.pow(-2 * t + 2, 2) / 2, ce = (t) => t * t * t, ue = (t) => 1 - Math.pow(1 - t, 3), le = (t) => t < 0.5 ? 4 * t * t * t : 1 - Math.pow(-2 * t + 2, 3) / 2, Ge = ce, Ke = ue, Ze = le, qe = {
|
|
289
289
|
linear: St,
|
|
290
|
-
"ease-in":
|
|
291
|
-
"ease-out":
|
|
292
|
-
"ease-in-out":
|
|
293
|
-
"ease-in-quad":
|
|
294
|
-
"ease-out-quad":
|
|
295
|
-
"ease-in-out-quad":
|
|
296
|
-
"ease-in-cubic":
|
|
297
|
-
"ease-out-cubic":
|
|
298
|
-
"ease-in-out-cubic":
|
|
290
|
+
"ease-in": Ge,
|
|
291
|
+
"ease-out": Ke,
|
|
292
|
+
"ease-in-out": Ze,
|
|
293
|
+
"ease-in-quad": Be,
|
|
294
|
+
"ease-out-quad": We,
|
|
295
|
+
"ease-in-out-quad": Qe,
|
|
296
|
+
"ease-in-cubic": ce,
|
|
297
|
+
"ease-out-cubic": ue,
|
|
298
|
+
"ease-in-out-cubic": le
|
|
299
299
|
};
|
|
300
|
-
function
|
|
301
|
-
const [e, n, r, s] = t, o = 3 * e,
|
|
302
|
-
let g =
|
|
300
|
+
function Je(t) {
|
|
301
|
+
const [e, n, r, s] = t, o = 3 * e, a = 3 * (r - e) - o, i = 1 - o - a, c = 3 * n, l = 3 * (s - n) - c, h = 1 - c - l, u = (p) => ((i * p + a) * p + o) * p, f = (p) => ((h * p + l) * p + c) * p, d = (p) => (3 * i * p + 2 * a) * p + o, m = (p) => {
|
|
302
|
+
let g = p;
|
|
303
303
|
for (let k = 0; k < 8; k++) {
|
|
304
|
-
const
|
|
305
|
-
if (Math.abs(
|
|
304
|
+
const S = u(g) - p;
|
|
305
|
+
if (Math.abs(S) < 1e-7)
|
|
306
306
|
return g;
|
|
307
|
-
const
|
|
308
|
-
if (Math.abs(
|
|
307
|
+
const b = d(g);
|
|
308
|
+
if (Math.abs(b) < 1e-7)
|
|
309
309
|
break;
|
|
310
|
-
g -=
|
|
310
|
+
g -= S / b;
|
|
311
311
|
}
|
|
312
|
-
let
|
|
313
|
-
for (g =
|
|
314
|
-
const k =
|
|
315
|
-
if (Math.abs(k -
|
|
312
|
+
let M = 0, y = 1;
|
|
313
|
+
for (g = p; M < y; ) {
|
|
314
|
+
const k = u(g);
|
|
315
|
+
if (Math.abs(k - p) < 1e-7)
|
|
316
316
|
return g;
|
|
317
|
-
|
|
317
|
+
p > k ? M = g : y = g, g = (M + y) / 2;
|
|
318
318
|
}
|
|
319
319
|
return g;
|
|
320
320
|
};
|
|
321
|
-
return (
|
|
322
|
-
if (
|
|
323
|
-
if (
|
|
324
|
-
const g =
|
|
321
|
+
return (p) => {
|
|
322
|
+
if (p <= 0) return 0;
|
|
323
|
+
if (p >= 1) return 1;
|
|
324
|
+
const g = m(p);
|
|
325
325
|
return f(g);
|
|
326
326
|
};
|
|
327
327
|
}
|
|
@@ -330,11 +330,11 @@ function gt(t, e = "out") {
|
|
|
330
330
|
const n = (r) => 1 - t(1 - r);
|
|
331
331
|
return e === "in" ? n : (r) => r < 0.5 ? n(r * 2) / 2 : t(r * 2 - 1) / 2 + 0.5;
|
|
332
332
|
}
|
|
333
|
-
function
|
|
333
|
+
function tn(t = 1, e = 0.3) {
|
|
334
334
|
const n = Math.max(1, t), r = e / (2 * Math.PI) * Math.asin(1 / n);
|
|
335
335
|
return (s) => s <= 0 ? 0 : s >= 1 ? 1 : n * Math.pow(2, -10 * s) * Math.sin((s - r) * (2 * Math.PI) / e) + 1;
|
|
336
336
|
}
|
|
337
|
-
const
|
|
337
|
+
const en = (t) => {
|
|
338
338
|
if (t <= 0) return 0;
|
|
339
339
|
if (t >= 1) return 1;
|
|
340
340
|
if (t < 1 / 2.75) return 7.5625 * t * t;
|
|
@@ -349,7 +349,7 @@ const qe = (t) => {
|
|
|
349
349
|
const r = t - 2.625 / 2.75;
|
|
350
350
|
return 7.5625 * r * r + 0.984375;
|
|
351
351
|
};
|
|
352
|
-
function
|
|
352
|
+
function nn(t = 1.70158) {
|
|
353
353
|
return (e) => {
|
|
354
354
|
if (e <= 0) return 0;
|
|
355
355
|
if (e >= 1) return 1;
|
|
@@ -357,7 +357,7 @@ function Je(t = 1.70158) {
|
|
|
357
357
|
return n * n * ((t + 1) * n + t) + 1;
|
|
358
358
|
};
|
|
359
359
|
}
|
|
360
|
-
function
|
|
360
|
+
function rn(t, e = "end") {
|
|
361
361
|
const n = Math.max(1, Math.floor(t));
|
|
362
362
|
return (r) => {
|
|
363
363
|
if (r >= 1) return 1;
|
|
@@ -375,22 +375,22 @@ function tn(t, e = "end") {
|
|
|
375
375
|
}
|
|
376
376
|
};
|
|
377
377
|
}
|
|
378
|
-
function
|
|
378
|
+
function sn(t) {
|
|
379
379
|
switch (t.type) {
|
|
380
380
|
case "steps":
|
|
381
|
-
return
|
|
381
|
+
return rn(t.count, t.position);
|
|
382
382
|
case "elastic":
|
|
383
|
-
return gt(
|
|
383
|
+
return gt(tn(t.amplitude, t.period), t.mode);
|
|
384
384
|
case "bounce":
|
|
385
|
-
return gt(
|
|
385
|
+
return gt(en, t.mode);
|
|
386
386
|
case "back":
|
|
387
|
-
return gt(
|
|
387
|
+
return gt(nn(t.overshoot), t.mode);
|
|
388
388
|
}
|
|
389
389
|
}
|
|
390
|
-
function
|
|
391
|
-
return t === void 0 ? St :
|
|
390
|
+
function he(t) {
|
|
391
|
+
return t === void 0 ? St : Fe(t) ? Je(t.points) : xt(t) ? sn(t) : qe[t] ?? St;
|
|
392
392
|
}
|
|
393
|
-
const
|
|
393
|
+
const zt = 32, on = 256, W = /* @__PURE__ */ new Map(), an = /[MmLlHhVvCcSsQqTtAaZz]/, cn = /^[-+]?(?:\d+\.?\d*|\.\d+)(?:[eE][-+]?\d+)?/, un = {
|
|
394
394
|
M: 2,
|
|
395
395
|
L: 2,
|
|
396
396
|
H: 1,
|
|
@@ -402,7 +402,7 @@ const Yt = 32, nn = 256, W = /* @__PURE__ */ new Map(), rn = /[MmLlHhVvCcSsQqTtA
|
|
|
402
402
|
A: 7,
|
|
403
403
|
Z: 0
|
|
404
404
|
};
|
|
405
|
-
function
|
|
405
|
+
function ln(t) {
|
|
406
406
|
const e = [];
|
|
407
407
|
let n = 0, r = null;
|
|
408
408
|
const s = () => {
|
|
@@ -410,52 +410,52 @@ function an(t) {
|
|
|
410
410
|
};
|
|
411
411
|
for (; n < t.length && (s(), !(n >= t.length)); ) {
|
|
412
412
|
const o = t[n];
|
|
413
|
-
if (
|
|
413
|
+
if (an.test(o)) {
|
|
414
414
|
r = { type: o, args: [] }, e.push(r), n++;
|
|
415
415
|
continue;
|
|
416
416
|
}
|
|
417
417
|
if (!r) break;
|
|
418
|
-
const
|
|
419
|
-
if (
|
|
418
|
+
const a = r.type === "A" || r.type === "a", i = r.args.length % 7;
|
|
419
|
+
if (a && (i === 3 || i === 4)) {
|
|
420
420
|
if (o !== "0" && o !== "1") break;
|
|
421
421
|
r.args.push(o === "1" ? 1 : 0), n++;
|
|
422
422
|
continue;
|
|
423
423
|
}
|
|
424
|
-
const c =
|
|
424
|
+
const c = cn.exec(t.slice(n));
|
|
425
425
|
if (!c) break;
|
|
426
426
|
r.args.push(parseFloat(c[0])), n += c[0].length;
|
|
427
427
|
}
|
|
428
428
|
return e;
|
|
429
429
|
}
|
|
430
|
-
function
|
|
431
|
-
if (t ===
|
|
432
|
-
let
|
|
433
|
-
if (
|
|
434
|
-
const
|
|
435
|
-
if (
|
|
436
|
-
const R = Math.sqrt(
|
|
437
|
-
|
|
438
|
-
}
|
|
439
|
-
const k = o ===
|
|
440
|
-
const
|
|
430
|
+
function hn(t, e, n, r, s, o, a, i, c) {
|
|
431
|
+
if (t === i && e === c) return [];
|
|
432
|
+
let l = Math.abs(n), h = Math.abs(r);
|
|
433
|
+
if (l === 0 || h === 0) return [[t, e, i, c, i, c]];
|
|
434
|
+
const u = s * Math.PI / 180, f = Math.cos(u), d = Math.sin(u), m = (t - i) / 2, p = (e - c) / 2, g = f * m + d * p, M = -d * m + f * p, y = g * g / (l * l) + M * M / (h * h);
|
|
435
|
+
if (y > 1) {
|
|
436
|
+
const R = Math.sqrt(y);
|
|
437
|
+
l *= R, h *= R;
|
|
438
|
+
}
|
|
439
|
+
const k = o === a ? -1 : 1, S = l * l * h * h - l * l * M * M - h * h * g * g, b = l * l * M * M + h * h * g * g, v = k * Math.sqrt(Math.max(0, S / b)), A = v * l * M / h, D = -v * h * g / l, _ = f * A - d * D + (t + i) / 2, T = d * A + f * D + (e + c) / 2, x = (R, I, E, H) => {
|
|
440
|
+
const pt = R * E + I * H, rt = Math.sqrt((R * R + I * I) * (E * E + H * H)), Z = Math.acos(Math.max(-1, Math.min(1, pt / rt)));
|
|
441
441
|
return R * H - I * E < 0 ? -Z : Z;
|
|
442
|
-
},
|
|
443
|
-
let $ = x((g - A) /
|
|
444
|
-
!
|
|
445
|
-
const P = Math.max(1, Math.ceil(Math.abs($) / (Math.PI / 2))),
|
|
446
|
-
const I =
|
|
447
|
-
return [f * I -
|
|
442
|
+
}, w = x(1, 0, (g - A) / l, (M - D) / h);
|
|
443
|
+
let $ = x((g - A) / l, (M - D) / h, (-g - A) / l, (-M - D) / h);
|
|
444
|
+
!a && $ > 0 && ($ -= 2 * Math.PI), a && $ < 0 && ($ += 2 * Math.PI);
|
|
445
|
+
const P = Math.max(1, Math.ceil(Math.abs($) / (Math.PI / 2))), dt = $ / P, nt = 4 / 3 * Math.tan(dt / 4), Ot = (R) => {
|
|
446
|
+
const I = l * Math.cos(R), E = h * Math.sin(R);
|
|
447
|
+
return [f * I - d * E + _, d * I + f * E + T];
|
|
448
448
|
}, Ft = (R) => {
|
|
449
|
-
const I = -
|
|
450
|
-
return [f * I -
|
|
451
|
-
},
|
|
449
|
+
const I = -l * Math.sin(R), E = h * Math.cos(R);
|
|
450
|
+
return [f * I - d * E, d * I + f * E];
|
|
451
|
+
}, Xt = [];
|
|
452
452
|
for (let R = 0; R < P; R++) {
|
|
453
|
-
const I =
|
|
454
|
-
|
|
453
|
+
const I = w + R * dt, E = I + dt, [H, pt] = Ot(I), [rt, Z] = R === P - 1 ? [i, c] : Ot(E), [Ie, Ee] = Ft(I), [Le, Oe] = Ft(E);
|
|
454
|
+
Xt.push([H + nt * Ie, pt + nt * Ee, rt - nt * Le, Z - nt * Oe, rt, Z]);
|
|
455
455
|
}
|
|
456
|
-
return
|
|
456
|
+
return Xt;
|
|
457
457
|
}
|
|
458
|
-
function
|
|
458
|
+
function Y(t, e, n, r, s) {
|
|
459
459
|
const o = 1 - s;
|
|
460
460
|
return o * o * o * t + 3 * o * o * s * e + 3 * o * s * s * n + s * s * s * r;
|
|
461
461
|
}
|
|
@@ -476,172 +476,172 @@ function q(t, e, n, r) {
|
|
|
476
476
|
};
|
|
477
477
|
}
|
|
478
478
|
function ot(t, e, n) {
|
|
479
|
-
const [r, s, o,
|
|
480
|
-
let
|
|
481
|
-
for (let
|
|
482
|
-
const
|
|
483
|
-
f += Math.hypot(
|
|
479
|
+
const [r, s, o, a, i, c] = n, l = [0];
|
|
480
|
+
let h = t, u = e, f = 0;
|
|
481
|
+
for (let d = 1; d <= zt; d++) {
|
|
482
|
+
const m = d / zt, p = Y(t, r, o, i, m), g = Y(e, s, a, c, m);
|
|
483
|
+
f += Math.hypot(p - h, g - u), l.push(f), h = p, u = g;
|
|
484
484
|
}
|
|
485
485
|
return {
|
|
486
486
|
subpath: 0,
|
|
487
487
|
type: "C",
|
|
488
|
-
points: [r, s, o,
|
|
488
|
+
points: [r, s, o, a, i, c],
|
|
489
489
|
startX: t,
|
|
490
490
|
startY: e,
|
|
491
|
-
endX:
|
|
491
|
+
endX: i,
|
|
492
492
|
endY: c,
|
|
493
493
|
length: f,
|
|
494
|
-
lengths:
|
|
494
|
+
lengths: l
|
|
495
495
|
};
|
|
496
496
|
}
|
|
497
497
|
function G(t) {
|
|
498
498
|
const e = W.get(t);
|
|
499
499
|
if (e) return e;
|
|
500
500
|
const n = [];
|
|
501
|
-
let r = 0, s = 0, o = 0,
|
|
502
|
-
const
|
|
503
|
-
|
|
501
|
+
let r = 0, s = 0, o = 0, a = 0, i = null, c = null, l = -1;
|
|
502
|
+
const h = /* @__PURE__ */ new Set(), u = (p) => {
|
|
503
|
+
l < 0 && (l = 0), p.subpath = l, n.push(p);
|
|
504
504
|
};
|
|
505
|
-
for (const { type:
|
|
506
|
-
const
|
|
507
|
-
if (
|
|
508
|
-
(r !== o || s !==
|
|
505
|
+
for (const { type: p, args: g } of ln(t)) {
|
|
506
|
+
const M = p.toUpperCase(), y = p !== M, k = un[M];
|
|
507
|
+
if (M === "Z") {
|
|
508
|
+
(r !== o || s !== a) && u(q(r, s, o, a)), l >= 0 && h.add(l), r = o, s = a, i = c = null;
|
|
509
509
|
continue;
|
|
510
510
|
}
|
|
511
|
-
for (let
|
|
512
|
-
const
|
|
513
|
-
let D = null,
|
|
514
|
-
switch (
|
|
511
|
+
for (let S = 0; S + k <= g.length; S += k) {
|
|
512
|
+
const b = g.slice(S, S + k), v = y ? r : 0, A = y ? s : 0;
|
|
513
|
+
let D = null, _ = null;
|
|
514
|
+
switch (M) {
|
|
515
515
|
case "M":
|
|
516
|
-
|
|
516
|
+
S === 0 ? (r = b[0] + v, s = b[1] + A, o = r, a = s, (l < 0 || n[n.length - 1]?.subpath === l) && l++) : (u(q(r, s, b[0] + v, b[1] + A)), r = b[0] + v, s = b[1] + A);
|
|
517
517
|
break;
|
|
518
518
|
case "L":
|
|
519
|
-
|
|
519
|
+
u(q(r, s, b[0] + v, b[1] + A)), r = b[0] + v, s = b[1] + A;
|
|
520
520
|
break;
|
|
521
521
|
case "H":
|
|
522
|
-
|
|
522
|
+
u(q(r, s, b[0] + v, s)), r = b[0] + v;
|
|
523
523
|
break;
|
|
524
524
|
case "V":
|
|
525
|
-
|
|
525
|
+
u(q(r, s, r, b[0] + A)), s = b[0] + A;
|
|
526
526
|
break;
|
|
527
527
|
case "C": {
|
|
528
|
-
const T = [
|
|
529
|
-
|
|
528
|
+
const T = [b[0] + v, b[1] + A, b[2] + v, b[3] + A, b[4] + v, b[5] + A];
|
|
529
|
+
u(ot(r, s, T)), D = [T[2], T[3]], r = T[4], s = T[5];
|
|
530
530
|
break;
|
|
531
531
|
}
|
|
532
532
|
case "S": {
|
|
533
|
-
const [T, x] =
|
|
534
|
-
|
|
533
|
+
const [T, x] = i ? [2 * r - i[0], 2 * s - i[1]] : [r, s], w = [T, x, b[0] + v, b[1] + A, b[2] + v, b[3] + A];
|
|
534
|
+
u(ot(r, s, w)), D = [w[2], w[3]], r = w[4], s = w[5];
|
|
535
535
|
break;
|
|
536
536
|
}
|
|
537
537
|
case "Q":
|
|
538
538
|
case "T": {
|
|
539
539
|
let T = r, x = s;
|
|
540
|
-
|
|
541
|
-
const
|
|
542
|
-
|
|
540
|
+
M === "Q" ? (T = b[0] + v, x = b[1] + A) : c && (T = 2 * r - c[0], x = 2 * s - c[1]);
|
|
541
|
+
const w = M === "Q" ? b[2] + v : b[0] + v, $ = M === "Q" ? b[3] + A : b[1] + A;
|
|
542
|
+
u(
|
|
543
543
|
ot(r, s, [
|
|
544
544
|
r + 2 / 3 * (T - r),
|
|
545
545
|
s + 2 / 3 * (x - s),
|
|
546
|
-
|
|
546
|
+
w + 2 / 3 * (T - w),
|
|
547
547
|
$ + 2 / 3 * (x - $),
|
|
548
|
-
|
|
548
|
+
w,
|
|
549
549
|
$
|
|
550
550
|
])
|
|
551
|
-
),
|
|
551
|
+
), _ = [T, x], r = w, s = $;
|
|
552
552
|
break;
|
|
553
553
|
}
|
|
554
554
|
case "A": {
|
|
555
|
-
const T =
|
|
556
|
-
let
|
|
557
|
-
for (const P of
|
|
558
|
-
|
|
555
|
+
const T = b[5] + v, x = b[6] + A;
|
|
556
|
+
let w = r, $ = s;
|
|
557
|
+
for (const P of hn(r, s, b[0], b[1], b[2], b[3], b[4], T, x))
|
|
558
|
+
u(ot(w, $, P)), w = P[4], $ = P[5];
|
|
559
559
|
r = T, s = x;
|
|
560
560
|
break;
|
|
561
561
|
}
|
|
562
562
|
}
|
|
563
|
-
|
|
563
|
+
i = D, c = _;
|
|
564
564
|
}
|
|
565
565
|
}
|
|
566
|
-
const f = n.reduce((
|
|
567
|
-
for (let
|
|
568
|
-
const g = n[
|
|
569
|
-
let
|
|
570
|
-
for (;
|
|
571
|
-
const k = n[
|
|
572
|
-
|
|
566
|
+
const f = n.reduce((p, g) => p + g.length, 0), d = [];
|
|
567
|
+
for (let p = 0; p < n.length; ) {
|
|
568
|
+
const g = n[p].subpath;
|
|
569
|
+
let M = p, y = 0;
|
|
570
|
+
for (; M < n.length && n[M].subpath === g; ) y += n[M++].length;
|
|
571
|
+
const k = n[p], S = n[M - 1], b = h.has(g) || Math.abs(S.endX - k.startX) < 1e-9 && Math.abs(S.endY - k.startY) < 1e-9;
|
|
572
|
+
d.push({ start: p, end: M, length: y, closed: b }), p = M;
|
|
573
573
|
}
|
|
574
|
-
const
|
|
575
|
-
return W.size >=
|
|
574
|
+
const m = { segments: n, totalLength: f, subpaths: d };
|
|
575
|
+
return W.size >= on && W.delete(W.keys().next().value), W.set(t, m), m;
|
|
576
576
|
}
|
|
577
|
-
function
|
|
577
|
+
function fn(t, e) {
|
|
578
578
|
const n = t.lengths;
|
|
579
579
|
if (e <= 0) return 0;
|
|
580
580
|
if (e >= t.length) return 1;
|
|
581
581
|
let r = 0, s = n.length - 1;
|
|
582
582
|
for (; r < s - 1; ) {
|
|
583
|
-
const
|
|
584
|
-
n[
|
|
583
|
+
const i = r + s >> 1;
|
|
584
|
+
n[i] < e ? r = i : s = i;
|
|
585
585
|
}
|
|
586
|
-
const o = n[s] - n[r],
|
|
587
|
-
return (r +
|
|
586
|
+
const o = n[s] - n[r], a = o > 0 ? (e - n[r]) / o : 0;
|
|
587
|
+
return (r + a) / (n.length - 1);
|
|
588
588
|
}
|
|
589
|
-
function
|
|
589
|
+
function dn(t, e) {
|
|
590
590
|
if (t.type === "L") {
|
|
591
|
-
const
|
|
591
|
+
const u = t.length > 0 ? Math.max(0, Math.min(1, e / t.length)) : 0;
|
|
592
592
|
return {
|
|
593
|
-
x: t.startX + (t.endX - t.startX) *
|
|
594
|
-
y: t.startY + (t.endY - t.startY) *
|
|
593
|
+
x: t.startX + (t.endX - t.startX) * u,
|
|
594
|
+
y: t.startY + (t.endY - t.startY) * u,
|
|
595
595
|
angle: Math.atan2(t.endY - t.startY, t.endX - t.startX) * 180 / Math.PI
|
|
596
596
|
};
|
|
597
597
|
}
|
|
598
|
-
const [n, r, s, o,
|
|
599
|
-
let
|
|
600
|
-
if (Math.hypot(
|
|
601
|
-
const
|
|
602
|
-
|
|
598
|
+
const [n, r, s, o, a, i] = t.points, c = fn(t, e);
|
|
599
|
+
let l = Ut(t.startX, n, s, a, c), h = Ut(t.startY, r, o, i, c);
|
|
600
|
+
if (Math.hypot(l, h) < 1e-9) {
|
|
601
|
+
const u = c < 0.5 ? Math.min(1, c + 1e-3) : Math.max(0, c - 1e-3), f = Y(t.startX, n, s, a, u), d = Y(t.startY, r, o, i, u), m = Y(t.startX, n, s, a, c), p = Y(t.startY, r, o, i, c);
|
|
602
|
+
l = c < 0.5 ? f - m : m - f, h = c < 0.5 ? d - p : p - d;
|
|
603
603
|
}
|
|
604
604
|
return {
|
|
605
|
-
x:
|
|
606
|
-
y:
|
|
607
|
-
angle: Math.atan2(
|
|
605
|
+
x: Y(t.startX, n, s, a, c),
|
|
606
|
+
y: Y(t.startY, r, o, i, c),
|
|
607
|
+
angle: Math.atan2(h, l) * 180 / Math.PI
|
|
608
608
|
};
|
|
609
609
|
}
|
|
610
|
-
function
|
|
610
|
+
function fe(t, e, n = 0, r = t.length) {
|
|
611
611
|
if (r <= n) return { x: 0, y: 0, angle: 0 };
|
|
612
612
|
let s = 0;
|
|
613
613
|
for (let o = n; o < r; o++) {
|
|
614
|
-
const
|
|
615
|
-
if (s +
|
|
616
|
-
return
|
|
617
|
-
s +=
|
|
614
|
+
const a = t[o];
|
|
615
|
+
if (s + a.length >= e || o === r - 1)
|
|
616
|
+
return dn(a, e - s);
|
|
617
|
+
s += a.length;
|
|
618
618
|
}
|
|
619
619
|
return { x: 0, y: 0, angle: 0 };
|
|
620
620
|
}
|
|
621
|
-
function
|
|
621
|
+
function pn(t, e) {
|
|
622
622
|
const { segments: n, totalLength: r } = G(t);
|
|
623
|
-
return
|
|
623
|
+
return fe(n, Math.max(0, Math.min(1, e)) * r);
|
|
624
624
|
}
|
|
625
|
-
function
|
|
625
|
+
function Fr() {
|
|
626
626
|
W.clear();
|
|
627
627
|
}
|
|
628
|
-
function
|
|
628
|
+
function Xr(t) {
|
|
629
629
|
return G(t).totalLength;
|
|
630
630
|
}
|
|
631
|
-
const
|
|
632
|
-
let
|
|
631
|
+
const gn = 24, mn = 320, yn = 2.5, J = 72, Nr = 64, Mn = 0.2, _n = 128, et = /* @__PURE__ */ new Map();
|
|
632
|
+
let at = 0, N;
|
|
633
633
|
const Vt = (t) => Math.round(t * 100) / 100;
|
|
634
634
|
function jt(t, e) {
|
|
635
635
|
const { segments: n, subpaths: r, totalLength: s } = G(t);
|
|
636
636
|
if (n.length === 0) return [];
|
|
637
637
|
if (e) {
|
|
638
|
-
const o = r.every((
|
|
638
|
+
const o = r.every((a) => a.closed);
|
|
639
639
|
return [{ segments: n, start: 0, end: n.length, length: s, closed: o }];
|
|
640
640
|
}
|
|
641
641
|
return r.filter((o) => o.length > 0).map((o) => ({ segments: n, start: o.start, end: o.end, length: o.length, closed: o.closed }));
|
|
642
642
|
}
|
|
643
|
-
function
|
|
644
|
-
const n = t.closed ? (e % 1 + 1) % 1 : Math.max(0, Math.min(1, e)), r =
|
|
643
|
+
function wt(t, e) {
|
|
644
|
+
const n = t.closed ? (e % 1 + 1) % 1 : Math.max(0, Math.min(1, e)), r = fe(t.segments, n * t.length, t.start, t.end);
|
|
645
645
|
return [r.x, r.y];
|
|
646
646
|
}
|
|
647
647
|
function Ht(t) {
|
|
@@ -654,7 +654,7 @@ function Ht(t) {
|
|
|
654
654
|
function Bt(t, e) {
|
|
655
655
|
const n = [];
|
|
656
656
|
for (let r = 0; r < e; r++)
|
|
657
|
-
n.push(
|
|
657
|
+
n.push(wt(t, t.closed ? r / e : r / (e - 1)));
|
|
658
658
|
return n;
|
|
659
659
|
}
|
|
660
660
|
function Wt(t) {
|
|
@@ -663,184 +663,184 @@ function Wt(t) {
|
|
|
663
663
|
e += r, n += s;
|
|
664
664
|
return e /= t.length, n /= t.length, t.map(([r, s]) => [r - e, s - n]);
|
|
665
665
|
}
|
|
666
|
-
function
|
|
666
|
+
function bn(t, e, n) {
|
|
667
667
|
const r = t.closed && e.closed;
|
|
668
668
|
if (n !== void 0)
|
|
669
669
|
return { offset: r ? Math.abs(n) % J / J : 0, reversed: n < 0 };
|
|
670
|
-
const s = Wt(Bt(t, J)), o = Wt(Bt(e, J)),
|
|
671
|
-
let
|
|
672
|
-
for (const
|
|
673
|
-
const
|
|
674
|
-
for (let
|
|
670
|
+
const s = Wt(Bt(t, J)), o = Wt(Bt(e, J)), a = J;
|
|
671
|
+
let i = { offset: 0, reversed: !1 }, c = 1 / 0;
|
|
672
|
+
for (const l of [!1, !0]) {
|
|
673
|
+
const h = r ? a : 1;
|
|
674
|
+
for (let u = 0; u < h; u++) {
|
|
675
675
|
let f = 0;
|
|
676
|
-
for (let
|
|
677
|
-
const
|
|
678
|
-
f +=
|
|
676
|
+
for (let d = 0; d < a && f < c; d++) {
|
|
677
|
+
const m = r ? l ? (u - d + a) % a : (d + u) % a : l ? a - 1 - d : d, p = s[d][0] - o[m][0], g = s[d][1] - o[m][1];
|
|
678
|
+
f += p * p + g * g;
|
|
679
679
|
}
|
|
680
|
-
f < c && (c = f,
|
|
680
|
+
f < c && (c = f, i = { offset: r ? u / a : 0, reversed: l });
|
|
681
681
|
}
|
|
682
682
|
}
|
|
683
|
-
return
|
|
683
|
+
return i;
|
|
684
684
|
}
|
|
685
|
-
function
|
|
685
|
+
function Tn(t, e, n) {
|
|
686
686
|
return n ? ((e.reversed ? e.offset - t : t + e.offset) % 1 + 1) % 1 : e.reversed ? 1 - t : t;
|
|
687
687
|
}
|
|
688
|
-
function
|
|
688
|
+
function xn(t, e, n) {
|
|
689
689
|
return n ? ((e.reversed ? e.offset - t : t - e.offset) % 1 + 1) % 1 : e.reversed ? 1 - t : t;
|
|
690
690
|
}
|
|
691
|
-
function
|
|
692
|
-
const r = t.closed && e.closed, s =
|
|
693
|
-
|
|
694
|
-
Math.min(
|
|
695
|
-
),
|
|
696
|
-
for (let
|
|
697
|
-
for (const
|
|
698
|
-
for (const
|
|
699
|
-
let c = [...
|
|
700
|
-
r && (c = c.filter((
|
|
701
|
-
const
|
|
702
|
-
for (const
|
|
703
|
-
|
|
704
|
-
return
|
|
705
|
-
}
|
|
706
|
-
function
|
|
691
|
+
function kn(t, e, n) {
|
|
692
|
+
const r = t.closed && e.closed, s = bn(t, e, n.shapeIndex), o = Math.max(
|
|
693
|
+
gn,
|
|
694
|
+
Math.min(mn, Math.ceil(Math.max(t.length, e.length) / yn))
|
|
695
|
+
), a = /* @__PURE__ */ new Set(), i = (u) => a.add(Math.round(u * 1e7) / 1e7);
|
|
696
|
+
for (let u = 0; u <= o; u++) i(u / o);
|
|
697
|
+
for (const u of Ht(t)) i(u);
|
|
698
|
+
for (const u of Ht(e)) i(xn(u, s, r));
|
|
699
|
+
let c = [...a].sort((u, f) => u - f);
|
|
700
|
+
r && (c = c.filter((u) => u < 1));
|
|
701
|
+
const l = [], h = [];
|
|
702
|
+
for (const u of c)
|
|
703
|
+
l.push(...wt(t, u)), h.push(...wt(e, Tn(u, s, r)));
|
|
704
|
+
return Sn({ from: l, to: h, closed: r });
|
|
705
|
+
}
|
|
706
|
+
function Sn(t) {
|
|
707
707
|
const e = t.from.length / 2;
|
|
708
708
|
if (e <= 3) return t;
|
|
709
709
|
const n = new Uint8Array(e);
|
|
710
710
|
n[0] = 1, n[e - 1] = 1;
|
|
711
711
|
const r = [[0, e - 1]];
|
|
712
712
|
for (; r.length > 0; ) {
|
|
713
|
-
const [
|
|
714
|
-
let c = -1,
|
|
715
|
-
for (let
|
|
716
|
-
const
|
|
717
|
-
|
|
713
|
+
const [a, i] = r.pop();
|
|
714
|
+
let c = -1, l = Mn;
|
|
715
|
+
for (let h = a + 1; h < i; h++) {
|
|
716
|
+
const u = Math.max(Qt(t.from, a, i, h), Qt(t.to, a, i, h));
|
|
717
|
+
u > l && (l = u, c = h);
|
|
718
718
|
}
|
|
719
|
-
c !== -1 && (n[c] = 1, r.push([
|
|
719
|
+
c !== -1 && (n[c] = 1, r.push([a, c], [c, i]));
|
|
720
720
|
}
|
|
721
721
|
const s = [], o = [];
|
|
722
|
-
for (let
|
|
723
|
-
n[
|
|
722
|
+
for (let a = 0; a < e; a++)
|
|
723
|
+
n[a] && (s.push(t.from[a * 2], t.from[a * 2 + 1]), o.push(t.to[a * 2], t.to[a * 2 + 1]));
|
|
724
724
|
return { from: s, to: o, closed: t.closed };
|
|
725
725
|
}
|
|
726
726
|
function Qt(t, e, n, r) {
|
|
727
|
-
const s = t[e * 2], o = t[e * 2 + 1],
|
|
728
|
-
return Math.hypot(c -
|
|
727
|
+
const s = t[e * 2], o = t[e * 2 + 1], a = t[n * 2] - s, i = t[n * 2 + 1] - o, c = t[r * 2] - s, l = t[r * 2 + 1] - o, h = a * a + i * i, u = h === 0 ? 0 : Math.max(0, Math.min(1, (c * a + l * i) / h));
|
|
728
|
+
return Math.hypot(c - u * a, l - u * i);
|
|
729
729
|
}
|
|
730
|
-
function
|
|
730
|
+
function wn(t, e, n) {
|
|
731
731
|
const r = n.shapeIndex;
|
|
732
|
-
if (
|
|
732
|
+
if (N && N.from === t && N.to === e && N.shapeIndex === r) return N.plan;
|
|
733
733
|
const o = et.get(String(r ?? "auto"))?.get(t)?.get(e);
|
|
734
734
|
if (o)
|
|
735
|
-
return
|
|
736
|
-
const
|
|
737
|
-
pairs:
|
|
735
|
+
return N = { from: t, to: e, shapeIndex: r, plan: o }, o;
|
|
736
|
+
const a = G(t).subpaths.filter((d) => d.length > 0).length === G(e).subpaths.filter((d) => d.length > 0).length, i = jt(t, !a), c = jt(e, !a), l = {
|
|
737
|
+
pairs: i.map((d, m) => kn(d, c[m], n))
|
|
738
738
|
};
|
|
739
|
-
|
|
740
|
-
const
|
|
741
|
-
et.set(
|
|
742
|
-
const f =
|
|
743
|
-
return
|
|
739
|
+
at >= _n && (et.clear(), at = 0);
|
|
740
|
+
const h = String(r ?? "auto"), u = et.get(h) ?? /* @__PURE__ */ new Map();
|
|
741
|
+
et.set(h, u);
|
|
742
|
+
const f = u.get(t) ?? /* @__PURE__ */ new Map();
|
|
743
|
+
return u.set(t, f), f.set(e, l), at++, N = { from: t, to: e, shapeIndex: r, plan: l }, l;
|
|
744
744
|
}
|
|
745
|
-
function
|
|
745
|
+
function An(t, e, n, r = {}) {
|
|
746
746
|
if (!t) return e;
|
|
747
747
|
if (!e) return t;
|
|
748
748
|
const s = Math.max(0, Math.min(1, n));
|
|
749
749
|
if (s === 0) return t;
|
|
750
750
|
if (s === 1) return e;
|
|
751
|
-
const o =
|
|
751
|
+
const o = wn(t, e, r);
|
|
752
752
|
if (o.pairs.length === 0) return s < 0.5 ? t : e;
|
|
753
|
-
let
|
|
754
|
-
for (const
|
|
755
|
-
for (let c = 0; c <
|
|
756
|
-
const
|
|
757
|
-
|
|
753
|
+
let a = "";
|
|
754
|
+
for (const i of o.pairs) {
|
|
755
|
+
for (let c = 0; c < i.from.length; c += 2) {
|
|
756
|
+
const l = Vt(i.from[c] + (i.to[c] - i.from[c]) * s), h = Vt(i.from[c + 1] + (i.to[c + 1] - i.from[c + 1]) * s);
|
|
757
|
+
a += `${c === 0 ? a ? " M" : "M" : " L"}${l} ${h}`;
|
|
758
758
|
}
|
|
759
|
-
|
|
759
|
+
i.closed && (a += " Z");
|
|
760
760
|
}
|
|
761
|
-
return
|
|
761
|
+
return a;
|
|
762
762
|
}
|
|
763
|
-
function
|
|
764
|
-
et.clear(),
|
|
763
|
+
function Yr() {
|
|
764
|
+
et.clear(), at = 0, N = void 0;
|
|
765
765
|
}
|
|
766
|
-
function
|
|
766
|
+
function vn(t) {
|
|
767
767
|
return /^\s*[Mm]\s*[-+]?(?:\d|\.\d)/.test(t);
|
|
768
768
|
}
|
|
769
|
-
const Q = Math.PI / 180,
|
|
769
|
+
const Q = Math.PI / 180, Pn = 0.9995;
|
|
770
770
|
function Dt() {
|
|
771
771
|
return [0, 0, 0, 1];
|
|
772
772
|
}
|
|
773
|
-
function
|
|
773
|
+
function it(t, e) {
|
|
774
774
|
const n = Math.hypot(t[0], t[1], t[2]);
|
|
775
775
|
if (n === 0) return Dt();
|
|
776
776
|
const r = e * Q / 2, s = Math.sin(r) / n;
|
|
777
777
|
return [t[0] * s, t[1] * s, t[2] * s, Math.cos(r)];
|
|
778
778
|
}
|
|
779
|
-
function
|
|
780
|
-
return
|
|
779
|
+
function $n(t, e, n) {
|
|
780
|
+
return At(At(it([0, 1, 0], e), it([1, 0, 0], t)), it([0, 0, 1], n));
|
|
781
781
|
}
|
|
782
|
-
function
|
|
783
|
-
const [e, n, r, s] =
|
|
784
|
-
return Math.abs(c) < 0.9999999 ? [f / Q, Math.atan2(o,
|
|
782
|
+
function Rn(t) {
|
|
783
|
+
const [e, n, r, s] = z(t), o = 2 * (e * r + n * s), a = 2 * (e * n + r * s), i = 1 - 2 * (e * e + r * r), c = 2 * (n * r - e * s), l = 1 - 2 * (n * n + r * r), h = 2 * (e * r - n * s), u = 1 - 2 * (e * e + n * n), f = Math.asin(Math.max(-1, Math.min(1, -c)));
|
|
784
|
+
return Math.abs(c) < 0.9999999 ? [f / Q, Math.atan2(o, u) / Q, Math.atan2(a, i) / Q] : [f / Q, Math.atan2(-h, l) / Q, 0];
|
|
785
785
|
}
|
|
786
|
-
function
|
|
787
|
-
const [n, r, s, o] = t, [
|
|
786
|
+
function At(t, e) {
|
|
787
|
+
const [n, r, s, o] = t, [a, i, c, l] = e;
|
|
788
788
|
return [
|
|
789
|
-
o *
|
|
790
|
-
o *
|
|
791
|
-
o * c + n *
|
|
792
|
-
o *
|
|
789
|
+
o * a + n * l + r * c - s * i,
|
|
790
|
+
o * i - n * c + r * l + s * a,
|
|
791
|
+
o * c + n * i - r * a + s * l,
|
|
792
|
+
o * l - n * a - r * i - s * c
|
|
793
793
|
];
|
|
794
794
|
}
|
|
795
|
-
function
|
|
795
|
+
function de(t, e) {
|
|
796
796
|
return t[0] * e[0] + t[1] * e[1] + t[2] * e[2] + t[3] * e[3];
|
|
797
797
|
}
|
|
798
798
|
function pe(t) {
|
|
799
799
|
return Math.hypot(t[0], t[1], t[2], t[3]);
|
|
800
800
|
}
|
|
801
|
-
function
|
|
801
|
+
function z(t) {
|
|
802
802
|
const e = pe(t);
|
|
803
803
|
return e === 0 ? Dt() : [t[0] / e, t[1] / e, t[2] / e, t[3] / e];
|
|
804
804
|
}
|
|
805
|
-
function
|
|
805
|
+
function Dn(t) {
|
|
806
806
|
return [-t[0], -t[1], -t[2], t[3]];
|
|
807
807
|
}
|
|
808
|
-
function
|
|
809
|
-
const r =
|
|
810
|
-
let s =
|
|
811
|
-
if (o < 0 && (s = [-s[0], -s[1], -s[2], -s[3]], o = -o), o >
|
|
812
|
-
return
|
|
808
|
+
function ge(t, e, n) {
|
|
809
|
+
const r = z(t);
|
|
810
|
+
let s = z(e), o = de(r, s);
|
|
811
|
+
if (o < 0 && (s = [-s[0], -s[1], -s[2], -s[3]], o = -o), o > Pn)
|
|
812
|
+
return z([
|
|
813
813
|
r[0] + (s[0] - r[0]) * n,
|
|
814
814
|
r[1] + (s[1] - r[1]) * n,
|
|
815
815
|
r[2] + (s[2] - r[2]) * n,
|
|
816
816
|
r[3] + (s[3] - r[3]) * n
|
|
817
817
|
]);
|
|
818
|
-
const
|
|
819
|
-
return
|
|
820
|
-
r[0] * c + s[0] *
|
|
821
|
-
r[1] * c + s[1] *
|
|
822
|
-
r[2] * c + s[2] *
|
|
823
|
-
r[3] * c + s[3] *
|
|
818
|
+
const a = Math.acos(o), i = Math.sin(a), c = Math.sin((1 - n) * a) / i, l = Math.sin(n * a) / i;
|
|
819
|
+
return z([
|
|
820
|
+
r[0] * c + s[0] * l,
|
|
821
|
+
r[1] * c + s[1] * l,
|
|
822
|
+
r[2] * c + s[2] * l,
|
|
823
|
+
r[3] * c + s[3] * l
|
|
824
824
|
]);
|
|
825
825
|
}
|
|
826
|
-
function
|
|
827
|
-
const [n, r, s, o] =
|
|
828
|
-
return [e[0] + o *
|
|
826
|
+
function Cn(t, e) {
|
|
827
|
+
const [n, r, s, o] = z(t), a = 2 * (r * e[2] - s * e[1]), i = 2 * (s * e[0] - n * e[2]), c = 2 * (n * e[1] - r * e[0]);
|
|
828
|
+
return [e[0] + o * a + (r * c - s * i), e[1] + o * i + (s * a - n * c), e[2] + o * c + (n * i - r * a)];
|
|
829
829
|
}
|
|
830
|
-
const
|
|
830
|
+
const zr = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
831
831
|
__proto__: null,
|
|
832
|
-
conjugate:
|
|
833
|
-
dot:
|
|
834
|
-
fromAxisAngle:
|
|
835
|
-
fromEuler:
|
|
832
|
+
conjugate: Dn,
|
|
833
|
+
dot: de,
|
|
834
|
+
fromAxisAngle: it,
|
|
835
|
+
fromEuler: $n,
|
|
836
836
|
identity: Dt,
|
|
837
837
|
length: pe,
|
|
838
|
-
multiply:
|
|
839
|
-
normalize:
|
|
840
|
-
rotateVec3:
|
|
841
|
-
slerp:
|
|
842
|
-
toEuler:
|
|
843
|
-
}, Symbol.toStringTag, { value: "Module" })),
|
|
838
|
+
multiply: At,
|
|
839
|
+
normalize: z,
|
|
840
|
+
rotateVec3: Cn,
|
|
841
|
+
slerp: ge,
|
|
842
|
+
toEuler: Rn
|
|
843
|
+
}, Symbol.toStringTag, { value: "Module" })), X = (t, e, n) => t + (e - t) * n, me = 512, mt = /* @__PURE__ */ new Map(), yt = /* @__PURE__ */ new Map();
|
|
844
844
|
function Gt(t) {
|
|
845
845
|
const e = mt.get(t);
|
|
846
846
|
if (e) return e;
|
|
@@ -849,56 +849,56 @@ function Gt(t) {
|
|
|
849
849
|
parseInt(n.slice(2, 4), 16),
|
|
850
850
|
parseInt(n.slice(4, 6), 16)
|
|
851
851
|
];
|
|
852
|
-
return mt.size <
|
|
852
|
+
return mt.size < me && mt.set(t, r), r;
|
|
853
853
|
}
|
|
854
|
-
const Kt = (t) => t.charCodeAt(0) === 35, Zt = (t) => t.startsWith("rgb"), qt = (t) => t.startsWith("rgba"),
|
|
855
|
-
function
|
|
854
|
+
const Kt = (t) => t.charCodeAt(0) === 35, Zt = (t) => t.startsWith("rgb"), qt = (t) => t.startsWith("rgba"), In = /rgba?\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*(?:,\s*([\d.]+))?\s*\)/, Mt = (t) => Math.round(t).toString(16).padStart(2, "0");
|
|
855
|
+
function En(t, e, n) {
|
|
856
856
|
return `#${Mt(t)}${Mt(e)}${Mt(n)}`;
|
|
857
857
|
}
|
|
858
858
|
function Jt(t) {
|
|
859
859
|
const e = yt.get(t);
|
|
860
860
|
if (e) return e;
|
|
861
|
-
const n = t.match(
|
|
861
|
+
const n = t.match(In);
|
|
862
862
|
if (!n)
|
|
863
863
|
throw new Error(`Invalid rgb color: ${t}`);
|
|
864
|
-
const r = parseInt(n[1], 10), s = parseInt(n[2], 10), o = parseInt(n[3], 10),
|
|
865
|
-
return yt.size <
|
|
864
|
+
const r = parseInt(n[1], 10), s = parseInt(n[2], 10), o = parseInt(n[3], 10), a = n[4] !== void 0 ? [r, s, o, parseFloat(n[4])] : [r, s, o];
|
|
865
|
+
return yt.size < me && yt.set(t, a), a;
|
|
866
866
|
}
|
|
867
|
-
const
|
|
867
|
+
const Ln = (t, e, n) => {
|
|
868
868
|
if (Kt(t) && Kt(e)) {
|
|
869
|
-
const [r, s, o] = Gt(t), [
|
|
870
|
-
return
|
|
869
|
+
const [r, s, o] = Gt(t), [a, i, c] = Gt(e), l = X(r, a, n), h = X(s, i, n), u = X(o, c, n);
|
|
870
|
+
return En(l, h, u);
|
|
871
871
|
}
|
|
872
872
|
if ((Zt(t) || qt(t)) && (Zt(e) || qt(e))) {
|
|
873
|
-
const r = Jt(t), s = Jt(e), o = Math.round(
|
|
873
|
+
const r = Jt(t), s = Jt(e), o = Math.round(X(r[0], s[0], n)), a = Math.round(X(r[1], s[1], n)), i = Math.round(X(r[2], s[2], n));
|
|
874
874
|
if (r.length === 4 || s.length === 4) {
|
|
875
|
-
const c = r[3] ?? 1,
|
|
876
|
-
return `rgba(${o}, ${
|
|
875
|
+
const c = r[3] ?? 1, l = s[3] ?? 1, h = X(c, l, n);
|
|
876
|
+
return `rgba(${o}, ${a}, ${i}, ${h})`;
|
|
877
877
|
}
|
|
878
|
-
return `rgb(${o}, ${
|
|
878
|
+
return `rgb(${o}, ${a}, ${i})`;
|
|
879
879
|
}
|
|
880
880
|
return n < 1 ? t : e;
|
|
881
|
-
},
|
|
881
|
+
}, On = (t, e, n) => {
|
|
882
882
|
const r = Math.min(t.length, e.length), s = [];
|
|
883
883
|
for (let o = 0; o < r; o++)
|
|
884
|
-
s.push(
|
|
884
|
+
s.push(X(t[o], e[o], n));
|
|
885
885
|
return s;
|
|
886
|
-
},
|
|
887
|
-
function
|
|
888
|
-
return e === "slerp" ?
|
|
886
|
+
}, Fn = (t, e, n) => ge(t, e, n), te = (t, e, n) => n < 1 ? t : e, Xn = (t, e, n) => An(t, e, n);
|
|
887
|
+
function ye(t, e) {
|
|
888
|
+
return e === "slerp" ? Fn : typeof t == "number" ? X : Array.isArray(t) ? On : typeof t == "string" ? t.startsWith("#") || t.startsWith("rgb") ? Ln : vn(t) ? Xn : te : te;
|
|
889
889
|
}
|
|
890
|
-
const
|
|
891
|
-
function
|
|
890
|
+
const Me = 1e3 / 60;
|
|
891
|
+
function _e(t, e = {}) {
|
|
892
892
|
if (!j(t))
|
|
893
893
|
throw new Error(`bakeSpringTrack: track "${t.id}" is not a spring track`);
|
|
894
894
|
const n = new ut(t.spring);
|
|
895
|
-
return
|
|
895
|
+
return Te(t, (r) => n.valueAt(r), n.settleTime(), t.spring.from, t.spring.to, e);
|
|
896
896
|
}
|
|
897
|
-
function
|
|
897
|
+
function be(t, e = {}) {
|
|
898
898
|
if (!V(t))
|
|
899
899
|
throw new Error(`bakeInertiaTrack: track "${t.id}" is not an inertia track`);
|
|
900
900
|
const n = t.inertia;
|
|
901
|
-
return
|
|
901
|
+
return Te(
|
|
902
902
|
t,
|
|
903
903
|
(r) => kt(n, r),
|
|
904
904
|
ft(n),
|
|
@@ -907,66 +907,66 @@ function _e(t, e = {}) {
|
|
|
907
907
|
e
|
|
908
908
|
);
|
|
909
909
|
}
|
|
910
|
-
function
|
|
911
|
-
const
|
|
912
|
-
for (let
|
|
913
|
-
|
|
914
|
-
const
|
|
915
|
-
return !
|
|
910
|
+
function Te(t, e, n, r, s, o) {
|
|
911
|
+
const a = o.intervalMs ?? Me, i = o.tolerance ?? 0.01, c = t.delay ?? 0, l = [];
|
|
912
|
+
for (let u = 0; u <= n; u += a)
|
|
913
|
+
l.push({ time: u + c, value: e(u), easing: "linear" });
|
|
914
|
+
const h = l[l.length - 1];
|
|
915
|
+
return !h || h.time < n + c ? l.push({ time: n + c, value: s, easing: "linear" }) : h.value = s, c > 0 && l.unshift({ time: 0, value: r, easing: "linear" }), {
|
|
916
916
|
id: t.id,
|
|
917
917
|
target: t.target,
|
|
918
918
|
property: t.property,
|
|
919
|
-
keyframes:
|
|
919
|
+
keyframes: i > 0 ? zn(l, i) : l,
|
|
920
920
|
...t.targets && { targets: [...t.targets] },
|
|
921
921
|
...t.stagger && { stagger: { ...t.stagger } }
|
|
922
922
|
};
|
|
923
923
|
}
|
|
924
|
-
function
|
|
925
|
-
const s = r.intervalMs ??
|
|
926
|
-
if (
|
|
924
|
+
function Nn(t, e, n, r = {}) {
|
|
925
|
+
const s = r.intervalMs ?? Me, o = typeof n == "function" ? n : he(n), a = ye(t.value, r.interpolation), i = e.time - t.time;
|
|
926
|
+
if (i <= 0) return [e];
|
|
927
927
|
const c = [];
|
|
928
|
-
for (let
|
|
929
|
-
const
|
|
928
|
+
for (let h = s; h < i; h += s) {
|
|
929
|
+
const u = h / i;
|
|
930
930
|
c.push({
|
|
931
|
-
time: t.time +
|
|
932
|
-
value:
|
|
931
|
+
time: t.time + h,
|
|
932
|
+
value: a(t.value, e.value, o(u)),
|
|
933
933
|
easing: "linear"
|
|
934
934
|
});
|
|
935
935
|
}
|
|
936
|
-
const
|
|
937
|
-
return c.push({ ...e, ...
|
|
936
|
+
const l = o(1);
|
|
937
|
+
return c.push({ ...e, ...l !== 1 && { value: a(t.value, e.value, l) }, easing: "linear" }), c;
|
|
938
938
|
}
|
|
939
|
-
function
|
|
940
|
-
return j(t) ?
|
|
939
|
+
function Ur(t, e) {
|
|
940
|
+
return j(t) ? _e(t, e) : V(t) ? be(t, e) : t;
|
|
941
941
|
}
|
|
942
|
-
function
|
|
942
|
+
function Yn(t, e = {}) {
|
|
943
943
|
const n = t.keyframes;
|
|
944
944
|
if (!n.some((o) => xt(o.easing))) return t;
|
|
945
945
|
const r = n.length > 0 ? [n[0]] : [], s = { ...e, interpolation: t.interpolation ?? e.interpolation };
|
|
946
946
|
for (let o = 1; o < n.length; o++) {
|
|
947
|
-
const
|
|
948
|
-
xt(
|
|
947
|
+
const a = n[o];
|
|
948
|
+
xt(a.easing) ? r.push(...Nn(n[o - 1], a, a.easing, s)) : r.push(a);
|
|
949
949
|
}
|
|
950
950
|
return { ...t, keyframes: r };
|
|
951
951
|
}
|
|
952
|
-
function
|
|
953
|
-
return t.filter(
|
|
954
|
-
t.filter(j).map((n) =>
|
|
955
|
-
t.filter(V).map((n) =>
|
|
952
|
+
function Vr(t, e) {
|
|
953
|
+
return t.filter(Xe).map((n) => Yn(n, e)).concat(
|
|
954
|
+
t.filter(j).map((n) => _e(n, e)),
|
|
955
|
+
t.filter(V).map((n) => be(n, e))
|
|
956
956
|
);
|
|
957
957
|
}
|
|
958
|
-
function
|
|
958
|
+
function zn(t, e) {
|
|
959
959
|
if (t.length <= 2) return t;
|
|
960
960
|
const n = [t[0]];
|
|
961
961
|
for (let r = 1; r < t.length - 1; r++) {
|
|
962
|
-
const s = n[n.length - 1], o = t[r],
|
|
963
|
-
if (
|
|
964
|
-
const c = (o.time - s.time) /
|
|
965
|
-
Math.abs(o.value -
|
|
962
|
+
const s = n[n.length - 1], o = t[r], a = t[r + 1], i = a.time - s.time;
|
|
963
|
+
if (i <= 0) continue;
|
|
964
|
+
const c = (o.time - s.time) / i, l = s.value + (a.value - s.value) * c;
|
|
965
|
+
Math.abs(o.value - l) > e && n.push(o);
|
|
966
966
|
}
|
|
967
967
|
return n.push(t[t.length - 1]), n;
|
|
968
968
|
}
|
|
969
|
-
function
|
|
969
|
+
function Un(t) {
|
|
970
970
|
const e = [...t.keyframes].sort((n, r) => n.time - r.time);
|
|
971
971
|
return {
|
|
972
972
|
...t,
|
|
@@ -978,7 +978,7 @@ function U(t) {
|
|
|
978
978
|
}
|
|
979
979
|
function K(t, e, n, r) {
|
|
980
980
|
const s = n ?? 0;
|
|
981
|
-
return !r || e <= 1 ? s : s +
|
|
981
|
+
return !r || e <= 1 ? s : s + ae(t, e, r);
|
|
982
982
|
}
|
|
983
983
|
class _t {
|
|
984
984
|
track;
|
|
@@ -1004,8 +1004,8 @@ class _t {
|
|
|
1004
1004
|
getTargetValues(e) {
|
|
1005
1005
|
const n = this.targets.length, r = [];
|
|
1006
1006
|
for (let s = 0; s < n; s++) {
|
|
1007
|
-
const o = K(s, n, this.track.delay, this.track.stagger),
|
|
1008
|
-
|
|
1007
|
+
const o = K(s, n, this.track.delay, this.track.stagger), a = this.valueForOffset(e - o);
|
|
1008
|
+
a !== void 0 && r.push({ target: this.targets[s], value: a, start: o + this.track.keyframes[0].time });
|
|
1009
1009
|
}
|
|
1010
1010
|
return r;
|
|
1011
1011
|
}
|
|
@@ -1040,8 +1040,8 @@ class _t {
|
|
|
1040
1040
|
return;
|
|
1041
1041
|
if (r.time === e)
|
|
1042
1042
|
return r.value;
|
|
1043
|
-
const o = s.time - r.time,
|
|
1044
|
-
return
|
|
1043
|
+
const o = s.time - r.time, a = (e - r.time) / o, c = he(s.easing)(a);
|
|
1044
|
+
return ye(r.value, this.track.interpolation)(r.value, s.value, c);
|
|
1045
1045
|
}
|
|
1046
1046
|
/**
|
|
1047
1047
|
* Find the keyframes surrounding a given time.
|
|
@@ -1054,7 +1054,7 @@ class _t {
|
|
|
1054
1054
|
return { from: null, to: null };
|
|
1055
1055
|
}
|
|
1056
1056
|
}
|
|
1057
|
-
class
|
|
1057
|
+
class Vn {
|
|
1058
1058
|
track;
|
|
1059
1059
|
targets;
|
|
1060
1060
|
sampler;
|
|
@@ -1081,7 +1081,7 @@ class zn {
|
|
|
1081
1081
|
return this.track;
|
|
1082
1082
|
}
|
|
1083
1083
|
}
|
|
1084
|
-
class
|
|
1084
|
+
class jn {
|
|
1085
1085
|
track;
|
|
1086
1086
|
targets;
|
|
1087
1087
|
duration;
|
|
@@ -1108,53 +1108,53 @@ class Yn {
|
|
|
1108
1108
|
return this.track;
|
|
1109
1109
|
}
|
|
1110
1110
|
}
|
|
1111
|
-
function
|
|
1112
|
-
const n = { ...
|
|
1111
|
+
function xe(t, e) {
|
|
1112
|
+
const n = { ...pn(t.pathData, e) };
|
|
1113
1113
|
if (t.matrix) {
|
|
1114
|
-
const [r, s, o,
|
|
1115
|
-
n.x = r *
|
|
1116
|
-
const
|
|
1117
|
-
n.angle = Math.atan2(s * f +
|
|
1114
|
+
const [r, s, o, a, i, c] = t.matrix, { x: l, y: h } = n;
|
|
1115
|
+
n.x = r * l + o * h + i, n.y = s * l + a * h + c;
|
|
1116
|
+
const u = n.angle * Math.PI / 180, f = Math.cos(u), d = Math.sin(u);
|
|
1117
|
+
n.angle = Math.atan2(s * f + a * d, r * f + o * d) * 180 / Math.PI;
|
|
1118
1118
|
}
|
|
1119
1119
|
return t.autoRotate && t.rotateOffset && (n.angle += t.rotateOffset), n;
|
|
1120
1120
|
}
|
|
1121
|
-
function
|
|
1121
|
+
function jr(t, e, n, r) {
|
|
1122
1122
|
const s = e + (n - e) * r;
|
|
1123
|
-
return
|
|
1123
|
+
return xe(t, s);
|
|
1124
1124
|
}
|
|
1125
1125
|
const bt = {
|
|
1126
1126
|
upperCase: "ABCDEFGHIJKLMNOPQRSTUVWXYZ",
|
|
1127
1127
|
lowerCase: "abcdefghijklmnopqrstuvwxyz",
|
|
1128
1128
|
upperAndLowerCase: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz",
|
|
1129
1129
|
numbers: "0123456789"
|
|
1130
|
-
},
|
|
1131
|
-
function
|
|
1130
|
+
}, Hn = 20;
|
|
1131
|
+
function Bn(t) {
|
|
1132
1132
|
const e = bt[t ?? "upperCase"] ?? t ?? bt.upperCase, n = Array.from(e);
|
|
1133
1133
|
return n.length > 0 ? n : Array.from(bt.upperCase);
|
|
1134
1134
|
}
|
|
1135
|
-
function
|
|
1135
|
+
function Wn(t, e, n) {
|
|
1136
1136
|
let r = (t | 0) ^ Math.imul(e + 1, 2654435761) ^ Math.imul(n + 1, 2246822507);
|
|
1137
1137
|
return r = Math.imul(r ^ r >>> 16, 2146121005), r = Math.imul(r ^ r >>> 15, 2221713035), (r ^ r >>> 16) >>> 0;
|
|
1138
1138
|
}
|
|
1139
|
-
function
|
|
1139
|
+
function Qn(t, e, n = 0) {
|
|
1140
1140
|
const r = t.from ?? "", s = t.to, o = Math.max(0, Math.min(1, e));
|
|
1141
1141
|
if (o <= 0) return r;
|
|
1142
1142
|
if (o >= 1) return s;
|
|
1143
|
-
const
|
|
1143
|
+
const a = Array.from(r), i = Array.from(s), c = t.rightToLeft ?? !1;
|
|
1144
1144
|
if (t.mode === "type") {
|
|
1145
|
-
const
|
|
1146
|
-
return c ?
|
|
1145
|
+
const y = Math.round(o * Math.max(a.length, i.length));
|
|
1146
|
+
return c ? a.slice(0, Math.max(0, a.length - y)).join("") + i.slice(Math.max(0, i.length - y)).join("") : i.slice(0, y).join("") + a.slice(y).join("");
|
|
1147
1147
|
}
|
|
1148
|
-
const
|
|
1149
|
-
let
|
|
1150
|
-
for (let
|
|
1151
|
-
const k = c ?
|
|
1152
|
-
k &&
|
|
1153
|
-
` ?
|
|
1148
|
+
const l = Math.max(0, Math.min(0.999, t.revealDelay ?? 0)), h = Math.max(0, (o - l) / (1 - l)), u = Math.floor(h * i.length), f = t.tweenLength === !1 ? i.length : Math.round(a.length + (i.length - a.length) * o), d = Bn(t.chars), m = t.refreshRate ?? Hn, p = m > 0 ? Math.floor(n * m / 1e3) : 0, g = t.seed ?? 1;
|
|
1149
|
+
let M = "";
|
|
1150
|
+
for (let y = 0; y < f; y++) {
|
|
1151
|
+
const k = c ? y >= f - u : y < u, S = c ? i[i.length - (f - y)] : i[y];
|
|
1152
|
+
k && S !== void 0 || S === " " || S === `
|
|
1153
|
+
` ? M += S : M += d[Wn(g, y, p) % d.length];
|
|
1154
1154
|
}
|
|
1155
|
-
return
|
|
1155
|
+
return M;
|
|
1156
1156
|
}
|
|
1157
|
-
class
|
|
1157
|
+
class ke {
|
|
1158
1158
|
id;
|
|
1159
1159
|
name;
|
|
1160
1160
|
_captions;
|
|
@@ -1269,15 +1269,15 @@ class Bn {
|
|
|
1269
1269
|
return;
|
|
1270
1270
|
let s = e * this.speed;
|
|
1271
1271
|
if (this._repeatDelayRemaining > 0) {
|
|
1272
|
-
const
|
|
1273
|
-
if (this._repeatDelayRemaining -=
|
|
1272
|
+
const i = Math.min(this._repeatDelayRemaining, s);
|
|
1273
|
+
if (this._repeatDelayRemaining -= i, s -= i, this._repeatDelayRemaining > 0) {
|
|
1274
1274
|
this.onUpdate?.(this.getStateAtTime(this._currentTime));
|
|
1275
1275
|
return;
|
|
1276
1276
|
}
|
|
1277
1277
|
this._wrapAfterDelay && (this._wrapAfterDelay = !1, this._currentTime = 0);
|
|
1278
1278
|
}
|
|
1279
1279
|
const o = 1e3;
|
|
1280
|
-
for (let
|
|
1280
|
+
for (let i = 0; i < o && s > 0 && this._playbackState === "playing"; i++)
|
|
1281
1281
|
if (this._direction === "forward") {
|
|
1282
1282
|
const c = n - this._currentTime;
|
|
1283
1283
|
if (s >= c) {
|
|
@@ -1293,8 +1293,8 @@ class Bn {
|
|
|
1293
1293
|
} else
|
|
1294
1294
|
this._currentTime -= s, s = 0;
|
|
1295
1295
|
}
|
|
1296
|
-
const
|
|
1297
|
-
this.onUpdate?.(
|
|
1296
|
+
const a = this.getStateAtTime(this._currentTime);
|
|
1297
|
+
this.onUpdate?.(a);
|
|
1298
1298
|
}
|
|
1299
1299
|
/**
|
|
1300
1300
|
* Get the animation state at a specific time.
|
|
@@ -1306,8 +1306,8 @@ class Bn {
|
|
|
1306
1306
|
else
|
|
1307
1307
|
for (const [r, s] of this._trackPlayers) {
|
|
1308
1308
|
const o = s.getTrack().property;
|
|
1309
|
-
for (const { target:
|
|
1310
|
-
this._write(n, r,
|
|
1309
|
+
for (const { target: a, value: i, start: c } of s.getTargetValues(e))
|
|
1310
|
+
this._write(n, r, a, o, i, e - c);
|
|
1311
1311
|
}
|
|
1312
1312
|
return {
|
|
1313
1313
|
values: n,
|
|
@@ -1333,35 +1333,35 @@ class Bn {
|
|
|
1333
1333
|
_resolveShared(e, n) {
|
|
1334
1334
|
const r = /* @__PURE__ */ new Map();
|
|
1335
1335
|
for (const [s, o] of this._trackPlayers) {
|
|
1336
|
-
const
|
|
1337
|
-
for (const { target:
|
|
1338
|
-
const
|
|
1339
|
-
(!f || (
|
|
1336
|
+
const a = o.getTrack().property;
|
|
1337
|
+
for (const { target: i, value: c, start: l } of o.getTargetValues(e)) {
|
|
1338
|
+
const h = `${i}\0${a}`, u = l <= e, f = r.get(h);
|
|
1339
|
+
(!f || (u !== f.started ? u : u ? l >= f.start : l <= f.start)) && r.set(h, { trackId: s, target: i, property: a, value: c, start: l, started: u });
|
|
1340
1340
|
}
|
|
1341
1341
|
}
|
|
1342
|
-
for (const { trackId: s, target: o, property:
|
|
1343
|
-
this._write(n, s, o,
|
|
1342
|
+
for (const { trackId: s, target: o, property: a, value: i, start: c } of r.values())
|
|
1343
|
+
this._write(n, s, o, a, i, e - c);
|
|
1344
1344
|
}
|
|
1345
1345
|
/**
|
|
1346
1346
|
* Write one track's value for a target, expanding the progress of motion paths
|
|
1347
1347
|
* (into x/y/rotation) and text tracks (into the string). `elapsed` is the time
|
|
1348
1348
|
* since this target's animation on the track started.
|
|
1349
1349
|
*/
|
|
1350
|
-
_write(e, n, r, s, o,
|
|
1350
|
+
_write(e, n, r, s, o, a) {
|
|
1351
1351
|
if (o === void 0) return;
|
|
1352
|
-
let
|
|
1353
|
-
|
|
1352
|
+
let i = e.get(r);
|
|
1353
|
+
i || (i = /* @__PURE__ */ new Map(), e.set(r, i));
|
|
1354
1354
|
const c = this._textTracks.get(n);
|
|
1355
1355
|
if (c && typeof o == "number") {
|
|
1356
|
-
|
|
1356
|
+
i.set("text", Qn(c.textConfig, o, Math.max(0, a)));
|
|
1357
1357
|
return;
|
|
1358
1358
|
}
|
|
1359
|
-
const
|
|
1360
|
-
if (
|
|
1361
|
-
const
|
|
1362
|
-
|
|
1359
|
+
const l = this._motionPathTracks.get(n);
|
|
1360
|
+
if (l && typeof o == "number") {
|
|
1361
|
+
const h = xe(l.motionPathConfig, o);
|
|
1362
|
+
i.set("motionPathX", h.x), i.set("motionPathY", h.y), l.motionPathConfig.autoRotate && i.set("motionPathRotate", h.angle);
|
|
1363
1363
|
} else
|
|
1364
|
-
|
|
1364
|
+
i.set(s, o);
|
|
1365
1365
|
}
|
|
1366
1366
|
/** Cached: does any target+property have more than one track? */
|
|
1367
1367
|
_sharedWrites = null;
|
|
@@ -1386,16 +1386,16 @@ class Bn {
|
|
|
1386
1386
|
*/
|
|
1387
1387
|
addTrack(e) {
|
|
1388
1388
|
if (this._tracks.push(e), this._sharedWrites = null, V(e)) {
|
|
1389
|
-
this._trackPlayers.set(e.id, new
|
|
1389
|
+
this._trackPlayers.set(e.id, new jn(e));
|
|
1390
1390
|
return;
|
|
1391
1391
|
}
|
|
1392
1392
|
if (j(e)) {
|
|
1393
|
-
this._trackPlayers.set(e.id, new
|
|
1393
|
+
this._trackPlayers.set(e.id, new Vn(e)), this._springTracks.set(e.id, e);
|
|
1394
1394
|
return;
|
|
1395
1395
|
}
|
|
1396
1396
|
if ($t(e))
|
|
1397
1397
|
this._trackPlayers.set(e.id, new _t(e)), this._textTracks.set(e.id, e);
|
|
1398
|
-
else if (
|
|
1398
|
+
else if (se(e)) {
|
|
1399
1399
|
const n = {
|
|
1400
1400
|
id: e.id,
|
|
1401
1401
|
target: e.target,
|
|
@@ -1479,19 +1479,19 @@ class Bn {
|
|
|
1479
1479
|
const r = this._tracks[n], s = this.getTrackSpan(r.id);
|
|
1480
1480
|
if (s)
|
|
1481
1481
|
for (let o = 0; o < n; o++) {
|
|
1482
|
-
const
|
|
1483
|
-
if (
|
|
1484
|
-
const
|
|
1485
|
-
if (
|
|
1486
|
-
const c = this.getTrackSpan(
|
|
1482
|
+
const a = this._tracks[o];
|
|
1483
|
+
if (a.property !== r.property) continue;
|
|
1484
|
+
const i = U(a).filter((u) => U(r).includes(u));
|
|
1485
|
+
if (i.length === 0) continue;
|
|
1486
|
+
const c = this.getTrackSpan(a.id);
|
|
1487
1487
|
if (!c || !(c.from <= s.to && s.from <= c.to)) continue;
|
|
1488
|
-
const
|
|
1489
|
-
for (const
|
|
1488
|
+
const h = s.from >= c.from;
|
|
1489
|
+
for (const u of i)
|
|
1490
1490
|
e.push({
|
|
1491
|
-
target:
|
|
1491
|
+
target: u,
|
|
1492
1492
|
property: r.property,
|
|
1493
|
-
losingTrackId:
|
|
1494
|
-
winningTrackId:
|
|
1493
|
+
losingTrackId: h ? a.id : r.id,
|
|
1494
|
+
winningTrackId: h ? r.id : a.id
|
|
1495
1495
|
});
|
|
1496
1496
|
}
|
|
1497
1497
|
}
|
|
@@ -1510,7 +1510,7 @@ class Bn {
|
|
|
1510
1510
|
*/
|
|
1511
1511
|
toDefinition() {
|
|
1512
1512
|
return {
|
|
1513
|
-
formatVersion:
|
|
1513
|
+
formatVersion: re(this._tracks),
|
|
1514
1514
|
id: this.id,
|
|
1515
1515
|
name: this.name,
|
|
1516
1516
|
config: { ...this._config },
|
|
@@ -1568,31 +1568,31 @@ class Bn {
|
|
|
1568
1568
|
return this._config.alternate && (e === -1 || this._loopIteration < e) ? (this._loopIteration++, this._armRepeatDelay(), this._direction = "forward", this._repeatDelayRemaining === 0) : (this._playbackState = "idle", this.onComplete?.(), !1);
|
|
1569
1569
|
}
|
|
1570
1570
|
}
|
|
1571
|
-
const
|
|
1572
|
-
function
|
|
1573
|
-
const s = [], o = [], { duration:
|
|
1574
|
-
o.push([
|
|
1575
|
-
const
|
|
1576
|
-
t.forEach((
|
|
1577
|
-
(
|
|
1578
|
-
}),
|
|
1579
|
-
for (const
|
|
1571
|
+
const Gn = 100;
|
|
1572
|
+
function Hr(t, e, n, r) {
|
|
1573
|
+
const s = [], o = [], { duration: a, alternate: i } = r, c = (d, m, p, g) => {
|
|
1574
|
+
o.push([d, m]);
|
|
1575
|
+
const M = [];
|
|
1576
|
+
t.forEach((y, k) => {
|
|
1577
|
+
(p === "forward" ? (g ? y >= d : y > d) && y <= m : (g ? y <= d : y < d) && y >= m) && M.push(k);
|
|
1578
|
+
}), M.sort((y, k) => (p === "forward" ? t[y] - t[k] : t[k] - t[y]) || y - k);
|
|
1579
|
+
for (const y of M) s.push({ kind: "event", index: y, direction: p });
|
|
1580
1580
|
};
|
|
1581
|
-
let
|
|
1582
|
-
const f = Math.min(
|
|
1583
|
-
for (let
|
|
1584
|
-
const
|
|
1585
|
-
c(
|
|
1581
|
+
let l = e.time, h = e.direction, u = e.fresh === !0;
|
|
1582
|
+
const f = Math.min(Gn, Math.max(0, n.iteration - e.iteration));
|
|
1583
|
+
for (let d = 0; d < f; d++) {
|
|
1584
|
+
const m = h === "forward" ? a : 0;
|
|
1585
|
+
c(l, m, h, u), s.push({ kind: "repeat" }), i ? (h = h === "forward" ? "reverse" : "forward", l = m, u = !1) : (l = h === "forward" ? 0 : a, u = !0);
|
|
1586
1586
|
}
|
|
1587
|
-
return f > 0 && r.holding && !
|
|
1587
|
+
return f > 0 && r.holding && !i ? { crossings: s, passes: o } : (c(l, n.time, h, u), { crossings: s, passes: o });
|
|
1588
1588
|
}
|
|
1589
|
-
function
|
|
1589
|
+
function Kn(t) {
|
|
1590
1590
|
return V(t) ? {
|
|
1591
1591
|
id: t.id,
|
|
1592
1592
|
target: t.target,
|
|
1593
1593
|
property: t.property,
|
|
1594
1594
|
kind: "inertia",
|
|
1595
|
-
inertia:
|
|
1595
|
+
inertia: Se(t.inertia),
|
|
1596
1596
|
...F(t)
|
|
1597
1597
|
} : j(t) ? {
|
|
1598
1598
|
id: t.id,
|
|
@@ -1608,7 +1608,7 @@ function Qn(t) {
|
|
|
1608
1608
|
textConfig: { ...t.textConfig },
|
|
1609
1609
|
keyframes: t.keyframes.map(Tt),
|
|
1610
1610
|
...F(t)
|
|
1611
|
-
} :
|
|
1611
|
+
} : se(t) ? {
|
|
1612
1612
|
id: t.id,
|
|
1613
1613
|
target: t.target,
|
|
1614
1614
|
property: "motionPath",
|
|
@@ -1624,7 +1624,7 @@ function Qn(t) {
|
|
|
1624
1624
|
...F(t)
|
|
1625
1625
|
};
|
|
1626
1626
|
}
|
|
1627
|
-
function
|
|
1627
|
+
function Se(t) {
|
|
1628
1628
|
return { ...t, ...Array.isArray(t.end) && { end: [...t.end] } };
|
|
1629
1629
|
}
|
|
1630
1630
|
function Tt(t) {
|
|
@@ -1643,7 +1643,7 @@ function F(t) {
|
|
|
1643
1643
|
...t.stagger !== void 0 && { stagger: { ...t.stagger } }
|
|
1644
1644
|
};
|
|
1645
1645
|
}
|
|
1646
|
-
function
|
|
1646
|
+
function Zn(t) {
|
|
1647
1647
|
if (V(t)) {
|
|
1648
1648
|
const e = t;
|
|
1649
1649
|
return {
|
|
@@ -1651,7 +1651,7 @@ function Gn(t) {
|
|
|
1651
1651
|
target: e.target,
|
|
1652
1652
|
property: e.property,
|
|
1653
1653
|
kind: "inertia",
|
|
1654
|
-
inertia:
|
|
1654
|
+
inertia: Se(e.inertia),
|
|
1655
1655
|
...F(e)
|
|
1656
1656
|
};
|
|
1657
1657
|
}
|
|
@@ -1688,7 +1688,7 @@ function Gn(t) {
|
|
|
1688
1688
|
...F(e)
|
|
1689
1689
|
};
|
|
1690
1690
|
}
|
|
1691
|
-
return
|
|
1691
|
+
return Un({
|
|
1692
1692
|
id: t.id,
|
|
1693
1693
|
target: t.target,
|
|
1694
1694
|
property: t.property,
|
|
@@ -1697,10 +1697,10 @@ function Gn(t) {
|
|
|
1697
1697
|
...F(t)
|
|
1698
1698
|
});
|
|
1699
1699
|
}
|
|
1700
|
-
function
|
|
1700
|
+
function qn(t) {
|
|
1701
1701
|
const e = t._config.markers;
|
|
1702
1702
|
return {
|
|
1703
|
-
formatVersion:
|
|
1703
|
+
formatVersion: re(t.tracks),
|
|
1704
1704
|
id: t.id,
|
|
1705
1705
|
name: t.name,
|
|
1706
1706
|
config: {
|
|
@@ -1711,38 +1711,38 @@ function Kn(t) {
|
|
|
1711
1711
|
repeatDelay: t._config.repeatDelay,
|
|
1712
1712
|
...e && { markers: e.map((n) => ({ ...n })) }
|
|
1713
1713
|
},
|
|
1714
|
-
tracks: t.tracks.map(
|
|
1714
|
+
tracks: t.tracks.map(Kn),
|
|
1715
1715
|
...t.captions && { captions: JSON.parse(JSON.stringify(t.captions)) }
|
|
1716
1716
|
};
|
|
1717
1717
|
}
|
|
1718
|
-
function
|
|
1718
|
+
function Jn(t) {
|
|
1719
1719
|
const e = t.formatVersion ?? 1;
|
|
1720
|
-
if (e >
|
|
1720
|
+
if (e > Nt)
|
|
1721
1721
|
throw new Error(
|
|
1722
|
-
`tinyfly: this animation uses format version ${e}, but this tinyfly reads up to version ${
|
|
1722
|
+
`tinyfly: this animation uses format version ${e}, but this tinyfly reads up to version ${Nt}. Update tinyfly to play it.`
|
|
1723
1723
|
);
|
|
1724
|
-
return new
|
|
1724
|
+
return new ke({
|
|
1725
1725
|
id: t.id,
|
|
1726
1726
|
name: t.name,
|
|
1727
1727
|
config: t.config,
|
|
1728
|
-
tracks: t.tracks.map(
|
|
1728
|
+
tracks: t.tracks.map(Zn),
|
|
1729
1729
|
captions: t.captions
|
|
1730
1730
|
});
|
|
1731
1731
|
}
|
|
1732
|
-
function
|
|
1733
|
-
return JSON.stringify(
|
|
1732
|
+
function Br(t) {
|
|
1733
|
+
return JSON.stringify(qn(t));
|
|
1734
1734
|
}
|
|
1735
|
-
function
|
|
1735
|
+
function Wr(t) {
|
|
1736
1736
|
const e = JSON.parse(t);
|
|
1737
|
-
return
|
|
1737
|
+
return Jn(e);
|
|
1738
1738
|
}
|
|
1739
|
-
function
|
|
1739
|
+
function Qr(t) {
|
|
1740
1740
|
let e = 2166136261;
|
|
1741
1741
|
for (let n = 0; n < t.length; n++)
|
|
1742
1742
|
e ^= t.charCodeAt(n), e = Math.imul(e, 16777619);
|
|
1743
1743
|
return e >>> 0;
|
|
1744
1744
|
}
|
|
1745
|
-
function
|
|
1745
|
+
function we(t) {
|
|
1746
1746
|
let e = t >>> 0 || 2654435769;
|
|
1747
1747
|
return {
|
|
1748
1748
|
seed: t >>> 0,
|
|
@@ -1751,281 +1751,337 @@ function qn(t) {
|
|
|
1751
1751
|
}
|
|
1752
1752
|
};
|
|
1753
1753
|
}
|
|
1754
|
-
function
|
|
1754
|
+
function Ae(t, e, n) {
|
|
1755
1755
|
return e + t.next() * (n - e);
|
|
1756
1756
|
}
|
|
1757
|
-
function
|
|
1758
|
-
if (r <= 0) return
|
|
1757
|
+
function tr(t, e, n, r) {
|
|
1758
|
+
if (r <= 0) return Ae(t, e, n);
|
|
1759
1759
|
const s = Math.floor((n - e) / r), o = Math.round(t.next() * s);
|
|
1760
1760
|
return e + o * r;
|
|
1761
1761
|
}
|
|
1762
|
-
function
|
|
1762
|
+
function Gr(t, e) {
|
|
1763
1763
|
if (e.length !== 0)
|
|
1764
1764
|
return e[Math.floor(t.next() * e.length)];
|
|
1765
1765
|
}
|
|
1766
|
-
const
|
|
1767
|
-
function
|
|
1768
|
-
return typeof t != "string" ? !1 :
|
|
1766
|
+
const ve = /^([+\-*/])=\s*(-?[\d.]+)$/, Pe = /^random\(\s*(-?[\d.]+)\s*,\s*(-?[\d.]+)\s*(?:,\s*(-?[\d.]+)\s*)?\)$/i;
|
|
1767
|
+
function Kr(t) {
|
|
1768
|
+
return typeof t != "string" ? !1 : ve.test(t.trim()) || Pe.test(t.trim());
|
|
1769
1769
|
}
|
|
1770
|
-
function
|
|
1770
|
+
function $e(t, e = {}) {
|
|
1771
1771
|
if (typeof t != "string") return t;
|
|
1772
|
-
const n = t.trim(), r =
|
|
1772
|
+
const n = t.trim(), r = ve.exec(n);
|
|
1773
1773
|
if (r) {
|
|
1774
|
-
const [, o,
|
|
1774
|
+
const [, o, a] = r, i = e.base ?? 0, c = Number.parseFloat(a);
|
|
1775
1775
|
switch (o) {
|
|
1776
1776
|
case "+":
|
|
1777
|
-
return
|
|
1777
|
+
return i + c;
|
|
1778
1778
|
case "-":
|
|
1779
|
-
return
|
|
1779
|
+
return i - c;
|
|
1780
1780
|
case "*":
|
|
1781
|
-
return
|
|
1781
|
+
return i * c;
|
|
1782
1782
|
case "/":
|
|
1783
|
-
return c === 0 ?
|
|
1783
|
+
return c === 0 ? i : i / c;
|
|
1784
1784
|
}
|
|
1785
1785
|
}
|
|
1786
|
-
const s =
|
|
1786
|
+
const s = Pe.exec(n);
|
|
1787
1787
|
if (s) {
|
|
1788
1788
|
if (!e.random)
|
|
1789
1789
|
throw new Error(
|
|
1790
1790
|
`resolveValue: "${n}" needs a random source — pass one via context.random`
|
|
1791
1791
|
);
|
|
1792
|
-
const o = Number.parseFloat(s[1]),
|
|
1793
|
-
return
|
|
1792
|
+
const o = Number.parseFloat(s[1]), a = Number.parseFloat(s[2]), i = s[3] !== void 0 ? Number.parseFloat(s[3]) : void 0;
|
|
1793
|
+
return i !== void 0 ? tr(e.random, o, a, i) : Ae(e.random, o, a);
|
|
1794
1794
|
}
|
|
1795
1795
|
return t;
|
|
1796
1796
|
}
|
|
1797
|
-
function
|
|
1797
|
+
function er(t, e = 0, n) {
|
|
1798
1798
|
const r = [];
|
|
1799
1799
|
let s = e;
|
|
1800
1800
|
for (const o of t) {
|
|
1801
|
-
const
|
|
1802
|
-
r.push(
|
|
1801
|
+
const a = $e(o, { base: s, random: n });
|
|
1802
|
+
r.push(a), typeof a == "number" && (s = a);
|
|
1803
1803
|
}
|
|
1804
1804
|
return r;
|
|
1805
1805
|
}
|
|
1806
|
-
class
|
|
1806
|
+
class Zr {
|
|
1807
1807
|
random;
|
|
1808
1808
|
constructor(e) {
|
|
1809
|
-
this.random =
|
|
1809
|
+
this.random = we(e);
|
|
1810
1810
|
}
|
|
1811
1811
|
/** The seed, to be stored alongside the timeline so this can be reproduced. */
|
|
1812
1812
|
get seed() {
|
|
1813
1813
|
return this.random.seed;
|
|
1814
1814
|
}
|
|
1815
1815
|
resolve(e, n = 0) {
|
|
1816
|
-
return
|
|
1816
|
+
return $e(e, { base: n, random: this.random });
|
|
1817
1817
|
}
|
|
1818
1818
|
resolveSequence(e, n = 0) {
|
|
1819
|
-
return
|
|
1819
|
+
return er(e, n, this.random);
|
|
1820
1820
|
}
|
|
1821
1821
|
}
|
|
1822
|
-
const
|
|
1823
|
-
function
|
|
1822
|
+
const nr = 600;
|
|
1823
|
+
function qr(t) {
|
|
1824
1824
|
if (Array.isArray(t)) {
|
|
1825
|
-
const [f,
|
|
1826
|
-
return { fn: ee(f,
|
|
1825
|
+
const [f, d, m, p] = t;
|
|
1826
|
+
return { fn: ee(f, d, m, p), bezier: [f, d, m, p] };
|
|
1827
1827
|
}
|
|
1828
1828
|
const { segments: e } = G(t);
|
|
1829
1829
|
if (e.length === 0) throw new Error(`customEase: no curve in "${t}"`);
|
|
1830
|
-
const n = e[0].startX, r = e[0].startY, s = e[e.length - 1], o = s.endX - n,
|
|
1831
|
-
if (o === 0 ||
|
|
1832
|
-
const
|
|
1830
|
+
const n = e[0].startX, r = e[0].startY, s = e[e.length - 1], o = s.endX - n, a = s.endY - r;
|
|
1831
|
+
if (o === 0 || a === 0) throw new Error(`customEase: "${t}" must move along both axes`);
|
|
1832
|
+
const i = (f) => (f - n) / o, c = (f) => (f - r) / a;
|
|
1833
1833
|
if (e.length === 1 && s.type === "C") {
|
|
1834
|
-
const [f,
|
|
1834
|
+
const [f, d, m, p] = s.points, g = [i(f), c(d), i(m), c(p)];
|
|
1835
1835
|
return { fn: ee(...g), bezier: g };
|
|
1836
1836
|
}
|
|
1837
|
-
const
|
|
1837
|
+
const l = [], h = [], u = Math.max(8, Math.ceil(nr / e.length));
|
|
1838
1838
|
for (const f of e)
|
|
1839
|
-
for (let
|
|
1840
|
-
const [
|
|
1841
|
-
|
|
1839
|
+
for (let d = l.length === 0 ? 0 : 1; d <= u; d++) {
|
|
1840
|
+
const [m, p] = rr(f, d / u);
|
|
1841
|
+
l.push(i(m)), h.push(c(p));
|
|
1842
1842
|
}
|
|
1843
|
-
return { fn:
|
|
1843
|
+
return { fn: sr(l, h) };
|
|
1844
1844
|
}
|
|
1845
|
-
function
|
|
1845
|
+
function Jr(t = {}) {
|
|
1846
1846
|
const n = 0.1 + Math.max(0, Math.min(1, t.strength ?? 0.7)) * 0.7, r = [1];
|
|
1847
1847
|
for (let o = n; o > 2e-3; o *= n) r.push(2 * Math.sqrt(o));
|
|
1848
|
-
const s = r.reduce((o,
|
|
1848
|
+
const s = r.reduce((o, a) => o + a, 0);
|
|
1849
1849
|
return (o) => {
|
|
1850
1850
|
if (o <= 0) return 0;
|
|
1851
1851
|
if (o >= 1) return 1;
|
|
1852
|
-
let
|
|
1853
|
-
for (let
|
|
1854
|
-
if (
|
|
1855
|
-
if (
|
|
1856
|
-
const c = r[
|
|
1857
|
-
return 1 - (
|
|
1852
|
+
let a = o * s;
|
|
1853
|
+
for (let i = 0; i < r.length; i++) {
|
|
1854
|
+
if (a <= r[i]) {
|
|
1855
|
+
if (i === 0) return (a / r[0]) ** 2;
|
|
1856
|
+
const c = r[i] / 2, l = c * c, h = a - c;
|
|
1857
|
+
return 1 - (l - h * h);
|
|
1858
1858
|
}
|
|
1859
|
-
|
|
1859
|
+
a -= r[i];
|
|
1860
1860
|
}
|
|
1861
1861
|
return 1;
|
|
1862
1862
|
};
|
|
1863
1863
|
}
|
|
1864
|
-
function
|
|
1864
|
+
function ts(t = {}) {
|
|
1865
1865
|
const e = Math.max(1, t.wiggles ?? 10), n = t.type ?? "easeOut", r = (s) => n === "uniform" ? 1 : n === "easeInOut" ? Math.sin(Math.PI * s) : (1 - s) ** 2;
|
|
1866
1866
|
return (s) => s <= 0 || s >= 1 ? 0 : Math.sin(s * e * Math.PI * 2) * r(s);
|
|
1867
1867
|
}
|
|
1868
|
-
function
|
|
1868
|
+
function rr(t, e) {
|
|
1869
1869
|
if (t.type === "L") {
|
|
1870
|
-
const [
|
|
1871
|
-
return [t.startX + (
|
|
1870
|
+
const [l, h] = t.points;
|
|
1871
|
+
return [t.startX + (l - t.startX) * e, t.startY + (h - t.startY) * e];
|
|
1872
1872
|
}
|
|
1873
|
-
const [n, r, s, o,
|
|
1873
|
+
const [n, r, s, o, a, i] = t.points, c = 1 - e;
|
|
1874
1874
|
return [
|
|
1875
|
-
c * c * c * t.startX + 3 * c * c * e * n + 3 * c * e * e * s + e * e * e *
|
|
1876
|
-
c * c * c * t.startY + 3 * c * c * e * r + 3 * c * e * e * o + e * e * e *
|
|
1875
|
+
c * c * c * t.startX + 3 * c * c * e * n + 3 * c * e * e * s + e * e * e * a,
|
|
1876
|
+
c * c * c * t.startY + 3 * c * c * e * r + 3 * c * e * e * o + e * e * e * i
|
|
1877
1877
|
];
|
|
1878
1878
|
}
|
|
1879
|
-
function
|
|
1879
|
+
function sr(t, e) {
|
|
1880
1880
|
return (n) => {
|
|
1881
1881
|
if (n <= t[0]) return e[0];
|
|
1882
1882
|
if (n >= t[t.length - 1]) return e[e.length - 1];
|
|
1883
1883
|
let r = 0, s = t.length - 1;
|
|
1884
1884
|
for (; s - r > 1; ) {
|
|
1885
|
-
const
|
|
1886
|
-
t[
|
|
1885
|
+
const a = r + s >> 1;
|
|
1886
|
+
t[a] <= n ? r = a : s = a;
|
|
1887
1887
|
}
|
|
1888
1888
|
const o = t[s] - t[r];
|
|
1889
1889
|
return o === 0 ? e[s] : e[r] + (n - t[r]) / o * (e[s] - e[r]);
|
|
1890
1890
|
};
|
|
1891
1891
|
}
|
|
1892
1892
|
function ee(t, e, n, r) {
|
|
1893
|
-
const s = (
|
|
1894
|
-
return (
|
|
1895
|
-
if (
|
|
1896
|
-
if (
|
|
1897
|
-
let
|
|
1898
|
-
for (let
|
|
1899
|
-
const
|
|
1900
|
-
if (Math.abs(
|
|
1893
|
+
const s = (a, i, c) => 3 * (1 - a) * (1 - a) * a * i + 3 * (1 - a) * a * a * c + a * a * a, o = (a, i, c) => 3 * (1 - a) * (1 - a) * i + 6 * (1 - a) * a * (c - i) + 3 * a * a * (1 - c);
|
|
1894
|
+
return (a) => {
|
|
1895
|
+
if (a <= 0) return 0;
|
|
1896
|
+
if (a >= 1) return 1;
|
|
1897
|
+
let i = a;
|
|
1898
|
+
for (let h = 0; h < 8; h++) {
|
|
1899
|
+
const u = s(i, t, n) - a, f = o(i, t, n);
|
|
1900
|
+
if (Math.abs(u) < 1e-6) return s(i, e, r);
|
|
1901
1901
|
if (Math.abs(f) < 1e-6) break;
|
|
1902
|
-
|
|
1902
|
+
i -= u / f;
|
|
1903
1903
|
}
|
|
1904
|
-
let c = 0,
|
|
1905
|
-
|
|
1906
|
-
for (let
|
|
1907
|
-
s(
|
|
1908
|
-
return s(
|
|
1904
|
+
let c = 0, l = 1;
|
|
1905
|
+
i = a;
|
|
1906
|
+
for (let h = 0; h < 40; h++)
|
|
1907
|
+
s(i, t, n) < a ? c = i : l = i, i = (c + l) / 2;
|
|
1908
|
+
return s(i, e, r);
|
|
1909
1909
|
};
|
|
1910
1910
|
}
|
|
1911
|
-
const
|
|
1912
|
-
function
|
|
1913
|
-
const n = e.lead ??
|
|
1914
|
-
let
|
|
1915
|
-
return t.forEach((
|
|
1916
|
-
const
|
|
1917
|
-
let
|
|
1918
|
-
|
|
1911
|
+
const or = 350, ar = 300, ir = 550;
|
|
1912
|
+
function es(t, e = {}) {
|
|
1913
|
+
const n = e.lead ?? or, r = e.gap ?? ar, s = e.tail ?? ir, o = [];
|
|
1914
|
+
let a = 0;
|
|
1915
|
+
return t.forEach((i, c) => {
|
|
1916
|
+
const l = [];
|
|
1917
|
+
let h = a + n;
|
|
1918
|
+
i.lines.forEach((f, d) => {
|
|
1919
1919
|
if (!(f.duration >= 0))
|
|
1920
|
-
throw new Error(`narration: scene ${c} line ${
|
|
1921
|
-
|
|
1922
|
-
id: f.id ?? `s${c}-l${
|
|
1920
|
+
throw new Error(`narration: scene ${c} line ${d} has an invalid duration (${f.duration})`);
|
|
1921
|
+
d > 0 && (h += r), l.push({
|
|
1922
|
+
id: f.id ?? `s${c}-l${d}`,
|
|
1923
1923
|
scene: c,
|
|
1924
|
-
line:
|
|
1925
|
-
start:
|
|
1926
|
-
end:
|
|
1924
|
+
line: d,
|
|
1925
|
+
start: h,
|
|
1926
|
+
end: h + f.duration,
|
|
1927
1927
|
text: f.text
|
|
1928
|
-
}),
|
|
1928
|
+
}), h += f.duration;
|
|
1929
1929
|
});
|
|
1930
|
-
const
|
|
1931
|
-
o.push({ id:
|
|
1932
|
-
}), { duration:
|
|
1930
|
+
const u = h + s + (i.tail ?? 0);
|
|
1931
|
+
o.push({ id: i.id ?? `s${c}`, start: a, duration: u - a, cues: l }), a = u;
|
|
1932
|
+
}), { duration: a, scenes: o, cues: o.flatMap((i) => i.cues) };
|
|
1933
1933
|
}
|
|
1934
|
-
function
|
|
1934
|
+
function ns(t) {
|
|
1935
1935
|
return t.cues.map((e) => ({ id: e.id, time: e.start, label: e.text }));
|
|
1936
1936
|
}
|
|
1937
|
-
function
|
|
1937
|
+
function rs(t, e) {
|
|
1938
1938
|
let n = t.scenes[0];
|
|
1939
1939
|
for (const r of t.scenes)
|
|
1940
1940
|
if (e >= r.start) n = r;
|
|
1941
1941
|
else break;
|
|
1942
1942
|
return n;
|
|
1943
1943
|
}
|
|
1944
|
-
const
|
|
1944
|
+
const Re = (t) => 6e4 / t.bpm;
|
|
1945
1945
|
function Ct(t, e) {
|
|
1946
|
-
return t.offset + e *
|
|
1946
|
+
return t.offset + e * Re(t);
|
|
1947
1947
|
}
|
|
1948
1948
|
function It(t, e) {
|
|
1949
|
-
return (e - t.offset) /
|
|
1949
|
+
return (e - t.offset) / Re(t);
|
|
1950
1950
|
}
|
|
1951
|
-
function
|
|
1951
|
+
function ss(t, e) {
|
|
1952
1952
|
return Ct(t, Math.round(It(t, e)));
|
|
1953
1953
|
}
|
|
1954
|
-
function
|
|
1954
|
+
function os(t, e) {
|
|
1955
1955
|
return Ct(t, Math.ceil(It(t, e) - 1e-9));
|
|
1956
1956
|
}
|
|
1957
|
-
function
|
|
1957
|
+
function as(t, e, n) {
|
|
1958
1958
|
const r = Math.max(1, Math.round(t.beatsPerBar ?? 4)), s = [];
|
|
1959
1959
|
if (!(t.bpm > 0) || n < e) return s;
|
|
1960
1960
|
for (let o = Math.ceil(It(t, e) - 1e-9); ; o++) {
|
|
1961
|
-
const
|
|
1962
|
-
if (
|
|
1963
|
-
s.push({ time:
|
|
1961
|
+
const a = Ct(t, o);
|
|
1962
|
+
if (a > n + 1e-9) break;
|
|
1963
|
+
s.push({ time: a, bar: (o % r + r) % r === 0, n: o });
|
|
1964
1964
|
}
|
|
1965
1965
|
return s;
|
|
1966
1966
|
}
|
|
1967
1967
|
const B = 100;
|
|
1968
|
-
function
|
|
1969
|
-
const r = n.minBpm ?? 70, s = n.maxBpm ?? 180, o = Math.max(1, Math.round(e / B)),
|
|
1970
|
-
if (
|
|
1971
|
-
const c = new Float64Array(
|
|
1972
|
-
for (let
|
|
1968
|
+
function is(t, e, n = {}) {
|
|
1969
|
+
const r = n.minBpm ?? 70, s = n.maxBpm ?? 180, o = Math.max(1, Math.round(e / B)), a = Math.min(t.length, Math.round((n.maxSeconds ?? 60) * e)), i = Math.floor(a / o);
|
|
1970
|
+
if (i < 4) return { bpm: 120, offset: 0, confidence: 0 };
|
|
1971
|
+
const c = new Float64Array(i);
|
|
1972
|
+
for (let _ = 0; _ < i; _++) {
|
|
1973
1973
|
let T = 0;
|
|
1974
|
-
for (let x =
|
|
1975
|
-
c[
|
|
1976
|
-
}
|
|
1977
|
-
const
|
|
1978
|
-
for (let
|
|
1979
|
-
const
|
|
1980
|
-
for (let
|
|
1981
|
-
const
|
|
1974
|
+
for (let x = _ * o; x < (_ + 1) * o; x++) T += t[x] * t[x];
|
|
1975
|
+
c[_] = Math.log(1e-6 + T / o);
|
|
1976
|
+
}
|
|
1977
|
+
const l = new Float64Array(i);
|
|
1978
|
+
for (let _ = 1; _ < i; _++) l[_] = Math.max(0, c[_] - c[_ - 1]);
|
|
1979
|
+
const h = l.reduce((_, T) => _ + T, 0) / i;
|
|
1980
|
+
for (let _ = 0; _ < i; _++) l[_] = Math.max(0, l[_] - h);
|
|
1981
|
+
const u = Math.max(1, Math.floor(60 * B / s)), f = Math.min(i - 1, Math.ceil(60 * B / r)), d = (_) => {
|
|
1982
1982
|
let T = 0;
|
|
1983
|
-
for (let x =
|
|
1984
|
-
return T / (
|
|
1983
|
+
for (let x = _; x < i; x++) T += l[x] * l[x - _];
|
|
1984
|
+
return T / (i - _);
|
|
1985
1985
|
};
|
|
1986
|
-
let
|
|
1987
|
-
for (let
|
|
1988
|
-
|
|
1989
|
-
let
|
|
1990
|
-
for (let
|
|
1991
|
-
const T = 60 * B /
|
|
1992
|
-
|
|
1993
|
-
}
|
|
1994
|
-
const
|
|
1995
|
-
const T = Math.floor(
|
|
1996
|
-
return T < 0 || T + 1 >=
|
|
1997
|
-
},
|
|
1986
|
+
let m = 0;
|
|
1987
|
+
for (let _ = 0; _ < i; _++) m += l[_] * l[_];
|
|
1988
|
+
m /= i;
|
|
1989
|
+
let p = u, g = -1 / 0;
|
|
1990
|
+
for (let _ = u; _ <= f; _++) {
|
|
1991
|
+
const T = 60 * B / _, x = Math.exp(-0.5 * (Math.log2(T / 120) / 0.9) ** 2), w = d(_) * x;
|
|
1992
|
+
w > g && (g = w, p = _);
|
|
1993
|
+
}
|
|
1994
|
+
const M = (_) => {
|
|
1995
|
+
const T = Math.floor(_);
|
|
1996
|
+
return T < 0 || T + 1 >= i ? 0 : l[T] + (l[T + 1] - l[T]) * (_ - T);
|
|
1997
|
+
}, y = (_, T) => {
|
|
1998
1998
|
let x = 0;
|
|
1999
|
-
for (let
|
|
1999
|
+
for (let w = T; w < i; w += _) x += M(w);
|
|
2000
2000
|
return x;
|
|
2001
2001
|
};
|
|
2002
|
-
let k =
|
|
2003
|
-
for (let
|
|
2004
|
-
if (
|
|
2005
|
-
const T = Math.max(1, Math.round(
|
|
2002
|
+
let k = p, S = 0, b = -1 / 0;
|
|
2003
|
+
for (let _ = p - 0.6; _ <= p + 0.6 + 1e-9; _ += 0.02) {
|
|
2004
|
+
if (_ < 1) continue;
|
|
2005
|
+
const T = Math.max(1, Math.round(_ * 4));
|
|
2006
2006
|
for (let x = 0; x < T; x++) {
|
|
2007
|
-
const
|
|
2008
|
-
$ >
|
|
2007
|
+
const w = x / T * _, $ = y(_, w);
|
|
2008
|
+
$ > b && (b = $, S = w, k = _);
|
|
2009
2009
|
}
|
|
2010
2010
|
}
|
|
2011
|
-
const v = 60 * B / k, A =
|
|
2011
|
+
const v = 60 * B / k, A = m > 0 ? Math.max(0, Math.min(1, d(p) / m)) : 0, D = (S + 0.5) * 1e3 / B;
|
|
2012
2012
|
return { bpm: Math.round(v * 100) / 100, offset: Math.round(D % (6e4 / v)), confidence: A };
|
|
2013
2013
|
}
|
|
2014
|
+
const cr = 600, ur = 250, ne = 1;
|
|
2015
|
+
function cs(t, e) {
|
|
2016
|
+
const n = e.target ?? "Camera", r = { x: e.stage.width / 2, y: e.stage.height / 2 }, s = {}, o = (u, f, d, m) => {
|
|
2017
|
+
const p = s[u] ??= [];
|
|
2018
|
+
for (; p.length > 0 && p[p.length - 1].time >= f; ) p.pop();
|
|
2019
|
+
p.push({ time: f, value: d, ...m ? { easing: m } : {} });
|
|
2020
|
+
}, a = (u) => {
|
|
2021
|
+
const f = u.rotate * Math.PI / 180, d = (u.focusX - r.x) * u.scale, m = (u.focusY - r.y) * u.scale;
|
|
2022
|
+
return {
|
|
2023
|
+
x: -(d * Math.cos(f) - m * Math.sin(f)),
|
|
2024
|
+
y: -(d * Math.sin(f) + m * Math.cos(f)),
|
|
2025
|
+
scale: u.scale,
|
|
2026
|
+
rotate: u.rotate
|
|
2027
|
+
};
|
|
2028
|
+
}, i = (u, f, d) => {
|
|
2029
|
+
const m = a(f);
|
|
2030
|
+
for (const p of ["x", "y", "scale", "rotate"]) o(p, u, m[p], d);
|
|
2031
|
+
};
|
|
2032
|
+
let c = { focusX: r.x, focusY: r.y, scale: 1, rotate: 0 };
|
|
2033
|
+
const l = [...t].sort((u, f) => u.at - f.at), h = l.filter((u) => !("shake" in u));
|
|
2034
|
+
h.length > 0 && i(0, c);
|
|
2035
|
+
for (const u of h)
|
|
2036
|
+
if ("frame" in u) {
|
|
2037
|
+
const f = Math.max(ne, u.duration ?? cr);
|
|
2038
|
+
i(u.at, c), c = {
|
|
2039
|
+
focusX: u.frame.focus?.x ?? r.x,
|
|
2040
|
+
focusY: u.frame.focus?.y ?? r.y,
|
|
2041
|
+
scale: u.frame.scale ?? 1,
|
|
2042
|
+
rotate: u.frame.rotate ?? 0
|
|
2043
|
+
}, i(u.at + f, c, u.easing ?? (f > ne ? "ease-in-out" : void 0));
|
|
2044
|
+
} else {
|
|
2045
|
+
const { follow: f } = u, d = f.lag ?? ur, m = new ke({ id: "follow", tracks: [{ id: "x", target: "s", property: "x", keyframes: f.x }] }), p = (y) => m.getStateAtTime(y).values.get("s")?.get("x") ?? c.focusX, g = [u.at, ...f.x.map((y) => y.time).filter((y) => y > u.at && y < u.until), u.until];
|
|
2046
|
+
i(u.at, c);
|
|
2047
|
+
const M = (y) => ({
|
|
2048
|
+
focusX: p(y) + (f.lead ?? 0),
|
|
2049
|
+
focusY: f.y ?? c.focusY,
|
|
2050
|
+
scale: f.scale ?? c.scale,
|
|
2051
|
+
rotate: c.rotate
|
|
2052
|
+
});
|
|
2053
|
+
for (const y of g) {
|
|
2054
|
+
const k = f.x.find((S) => S.time === y)?.easing;
|
|
2055
|
+
i(y + d, M(y), y === u.at ? "ease-in-out" : k);
|
|
2056
|
+
}
|
|
2057
|
+
c = M(u.until);
|
|
2058
|
+
}
|
|
2059
|
+
for (const u of l.filter((f) => "shake" in f)) {
|
|
2060
|
+
const f = u.shake.strength ?? 12, d = u.shake.roll ?? 1.5, m = 1e3 / (u.shake.frequency ?? 24), p = we(u.shake.seed ?? Math.round(u.at) + 1), g = () => p.next() * 2 - 1;
|
|
2061
|
+
for (const M of ["shakeX", "shakeY", "shakeRotate"]) o(M, u.at, 0);
|
|
2062
|
+
for (let M = u.at + m; M < u.at + u.duration; M += m) {
|
|
2063
|
+
const y = 1 - (M - u.at) / u.duration;
|
|
2064
|
+
o("shakeX", M, g() * f * y), o("shakeY", M, g() * f * y), o("shakeRotate", M, g() * d * y);
|
|
2065
|
+
}
|
|
2066
|
+
for (const M of ["shakeX", "shakeY", "shakeRotate"]) o(M, u.at + u.duration, 0, "ease-out");
|
|
2067
|
+
}
|
|
2068
|
+
return Object.entries(s).map(([u, f]) => ({ id: `${n}-${u}`, target: n, property: u, keyframes: f }));
|
|
2069
|
+
}
|
|
2014
2070
|
const O = (t) => Math.round(t * 1e3) / 1e3;
|
|
2015
|
-
function
|
|
2071
|
+
function us(t, e = {}) {
|
|
2016
2072
|
if (t.length === 0) return "";
|
|
2017
2073
|
const n = e.curviness ?? 1, r = e.closed ?? !1, s = t.length;
|
|
2018
2074
|
let o = `M${O(t[0].x)} ${O(t[0].y)}`;
|
|
2019
2075
|
if (s === 1) return o;
|
|
2020
|
-
const
|
|
2021
|
-
for (let c = 0; c <
|
|
2022
|
-
const
|
|
2076
|
+
const a = (c) => r ? t[(c % s + s) % s] : t[Math.max(0, Math.min(s - 1, c))], i = r ? s : s - 1;
|
|
2077
|
+
for (let c = 0; c < i; c++) {
|
|
2078
|
+
const l = a(c - 1), h = a(c), u = a(c + 1), f = a(c + 2);
|
|
2023
2079
|
if (n === 0) {
|
|
2024
|
-
o += ` L${O(
|
|
2080
|
+
o += ` L${O(u.x)} ${O(u.y)}`;
|
|
2025
2081
|
continue;
|
|
2026
2082
|
}
|
|
2027
|
-
const
|
|
2028
|
-
o += ` C${O(
|
|
2083
|
+
const d = n / 6, m = h.x + (u.x - l.x) * d, p = h.y + (u.y - l.y) * d, g = u.x - (f.x - h.x) * d, M = u.y - (f.y - h.y) * d;
|
|
2084
|
+
o += ` C${O(m)} ${O(p)} ${O(g)} ${O(M)} ${O(u.x)} ${O(u.y)}`;
|
|
2029
2085
|
}
|
|
2030
2086
|
return r ? `${o} Z` : o;
|
|
2031
2087
|
}
|
|
@@ -2033,12 +2089,12 @@ const C = (t, e = 0) => {
|
|
|
2033
2089
|
const n = parseFloat(t ?? "");
|
|
2034
2090
|
return Number.isFinite(n) ? n : e;
|
|
2035
2091
|
};
|
|
2036
|
-
function
|
|
2092
|
+
function lr(t) {
|
|
2037
2093
|
const e = (t ?? "").trim().split(/[\s,]+/).filter(Boolean).map(Number), n = [];
|
|
2038
2094
|
for (let r = 0; r + 1 < e.length; r += 2) n.push({ x: e[r], y: e[r + 1] });
|
|
2039
2095
|
return n;
|
|
2040
2096
|
}
|
|
2041
|
-
function
|
|
2097
|
+
function ls(t) {
|
|
2042
2098
|
const e = t.attributes;
|
|
2043
2099
|
switch (t.tag.toLowerCase()) {
|
|
2044
2100
|
case "path":
|
|
@@ -2050,14 +2106,14 @@ function is(t) {
|
|
|
2050
2106
|
}
|
|
2051
2107
|
case "rect": {
|
|
2052
2108
|
const n = C(e.x), r = C(e.y), s = C(e.width), o = C(e.height);
|
|
2053
|
-
let
|
|
2054
|
-
return
|
|
2109
|
+
let a = e.rx != null ? C(e.rx) : e.ry != null ? C(e.ry) : 0, i = e.ry != null ? C(e.ry) : a;
|
|
2110
|
+
return a = Math.min(a, s / 2), i = Math.min(i, o / 2), a === 0 || i === 0 ? `M${n} ${r} H${n + s} V${r + o} H${n} Z` : `M${n + a} ${r} H${n + s - a} A${a} ${i} 0 0 1 ${n + s} ${r + i} V${r + o - i} A${a} ${i} 0 0 1 ${n + s - a} ${r + o} H${n + a} A${a} ${i} 0 0 1 ${n} ${r + o - i} V${r + i} A${a} ${i} 0 0 1 ${n + a} ${r} Z`;
|
|
2055
2111
|
}
|
|
2056
2112
|
case "line":
|
|
2057
2113
|
return `M${C(e.x1)} ${C(e.y1)} L${C(e.x2)} ${C(e.y2)}`;
|
|
2058
2114
|
case "polyline":
|
|
2059
2115
|
case "polygon": {
|
|
2060
|
-
const n =
|
|
2116
|
+
const n = lr(e.points);
|
|
2061
2117
|
if (n.length === 0) return null;
|
|
2062
2118
|
const r = n.map((s, o) => `${o === 0 ? "M" : "L"}${s.x} ${s.y}`).join(" ");
|
|
2063
2119
|
return t.tag.toLowerCase() === "polygon" ? `${r} Z` : r;
|
|
@@ -2066,53 +2122,53 @@ function is(t) {
|
|
|
2066
2122
|
return null;
|
|
2067
2123
|
}
|
|
2068
2124
|
}
|
|
2069
|
-
function
|
|
2125
|
+
function hs(t, e, n) {
|
|
2070
2126
|
const r = Math.max(2, Math.round(n.samples ?? 32)), s = Math.max(0, n.length), o = n.since !== void 0 ? Math.max(e - s, n.since) : e - s;
|
|
2071
2127
|
if (o >= e) return [];
|
|
2072
|
-
const
|
|
2128
|
+
const a = n.period, i = [];
|
|
2073
2129
|
for (let c = 0; c < r; c++) {
|
|
2074
|
-
const
|
|
2075
|
-
|
|
2130
|
+
const l = o + (e - o) * c / (r - 1), h = a && a > 0 && c < r - 1 ? (l % a + a) % a : l;
|
|
2131
|
+
i.push({ at: t(h), time: l, age: s > 0 ? (e - l) / s : 0 });
|
|
2076
2132
|
}
|
|
2077
|
-
return
|
|
2133
|
+
return i;
|
|
2078
2134
|
}
|
|
2079
|
-
const
|
|
2080
|
-
function
|
|
2081
|
-
const e = [], n = [], r = t.length, s = (o,
|
|
2082
|
-
for (let
|
|
2083
|
-
const c = (t[
|
|
2084
|
-
if (
|
|
2135
|
+
const hr = 2.5;
|
|
2136
|
+
function fs(t) {
|
|
2137
|
+
const e = [], n = [], r = t.length, s = (o, a) => {
|
|
2138
|
+
for (let i = o + a; i >= 0 && i < r; i += a) {
|
|
2139
|
+
const c = (t[i].x - t[o].x) * a, l = (t[i].y - t[o].y) * a, h = Math.hypot(c, l);
|
|
2140
|
+
if (h > 1e-9) return [c / h, l / h];
|
|
2085
2141
|
}
|
|
2086
2142
|
return null;
|
|
2087
2143
|
};
|
|
2088
2144
|
for (let o = 0; o < r; o++) {
|
|
2089
|
-
const
|
|
2090
|
-
let
|
|
2091
|
-
const
|
|
2092
|
-
|
|
2093
|
-
const
|
|
2094
|
-
e.push({ x:
|
|
2145
|
+
const a = t[o], i = s(o, -1), c = s(o, 1), l = i ?? c ?? [1, 0], h = c ?? i ?? [1, 0];
|
|
2146
|
+
let u = l[0] + h[0], f = l[1] + h[1];
|
|
2147
|
+
const d = Math.hypot(u, f);
|
|
2148
|
+
d < 1e-9 ? (u = l[0], f = l[1]) : (u /= d, f /= d);
|
|
2149
|
+
const m = u * l[0] + f * l[1], p = Math.min(hr, 1 / Math.max(m, 1e-6)), g = a.width / 2 * p;
|
|
2150
|
+
e.push({ x: a.x - f * g, y: a.y + u * g }), n.push({ x: a.x + f * g, y: a.y - u * g });
|
|
2095
2151
|
}
|
|
2096
2152
|
return { left: e, right: n };
|
|
2097
2153
|
}
|
|
2098
|
-
function
|
|
2154
|
+
function ds(t) {
|
|
2099
2155
|
const e = t.length;
|
|
2100
2156
|
if (e < 2) return null;
|
|
2101
2157
|
const n = t[e - 1];
|
|
2102
2158
|
for (let r = e - 2; r >= 0; r--) {
|
|
2103
|
-
const s = n.x - t[r].x, o = n.y - t[r].y,
|
|
2104
|
-
if (
|
|
2105
|
-
return { x: n.x, y: n.y, radius: n.width / 2, start: Math.atan2(s /
|
|
2159
|
+
const s = n.x - t[r].x, o = n.y - t[r].y, a = Math.hypot(s, o);
|
|
2160
|
+
if (a > 1e-9)
|
|
2161
|
+
return { x: n.x, y: n.y, radius: n.width / 2, start: Math.atan2(s / a, -o / a) };
|
|
2106
2162
|
}
|
|
2107
2163
|
return null;
|
|
2108
2164
|
}
|
|
2109
|
-
function
|
|
2165
|
+
function fr(t, e) {
|
|
2110
2166
|
return [t[0] + e[0], t[1] + e[1], t[2] + e[2]];
|
|
2111
2167
|
}
|
|
2112
2168
|
function Et(t, e) {
|
|
2113
2169
|
return [t[0] - e[0], t[1] - e[1], t[2] - e[2]];
|
|
2114
2170
|
}
|
|
2115
|
-
function
|
|
2171
|
+
function De(t, e) {
|
|
2116
2172
|
return [t[0] * e, t[1] * e, t[2] * e];
|
|
2117
2173
|
}
|
|
2118
2174
|
function ct(t, e) {
|
|
@@ -2124,48 +2180,48 @@ function vt(t, e) {
|
|
|
2124
2180
|
function Lt(t) {
|
|
2125
2181
|
return Math.hypot(t[0], t[1], t[2]);
|
|
2126
2182
|
}
|
|
2127
|
-
function
|
|
2183
|
+
function dr(t, e) {
|
|
2128
2184
|
return Lt(Et(t, e));
|
|
2129
2185
|
}
|
|
2130
2186
|
function Pt(t) {
|
|
2131
2187
|
const e = Lt(t);
|
|
2132
|
-
return e === 0 ? [0, 0, 0] :
|
|
2188
|
+
return e === 0 ? [0, 0, 0] : De(t, 1 / e);
|
|
2133
2189
|
}
|
|
2134
|
-
function
|
|
2190
|
+
function pr(t, e, n) {
|
|
2135
2191
|
return [t[0] + (e[0] - t[0]) * n, t[1] + (e[1] - t[1]) * n, t[2] + (e[2] - t[2]) * n];
|
|
2136
2192
|
}
|
|
2137
|
-
const
|
|
2193
|
+
const ps = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
2138
2194
|
__proto__: null,
|
|
2139
|
-
add:
|
|
2195
|
+
add: fr,
|
|
2140
2196
|
cross: vt,
|
|
2141
|
-
distance:
|
|
2197
|
+
distance: dr,
|
|
2142
2198
|
dot: ct,
|
|
2143
2199
|
length: Lt,
|
|
2144
|
-
lerp:
|
|
2200
|
+
lerp: pr,
|
|
2145
2201
|
normalize: Pt,
|
|
2146
|
-
scale:
|
|
2202
|
+
scale: De,
|
|
2147
2203
|
subtract: Et
|
|
2148
|
-
}, Symbol.toStringTag, { value: "Module" })),
|
|
2149
|
-
function
|
|
2204
|
+
}, Symbol.toStringTag, { value: "Module" })), gr = Math.PI / 180;
|
|
2205
|
+
function mr() {
|
|
2150
2206
|
return [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1];
|
|
2151
2207
|
}
|
|
2152
|
-
function
|
|
2208
|
+
function yr(t, e) {
|
|
2153
2209
|
const n = new Array(16);
|
|
2154
2210
|
for (let r = 0; r < 4; r++)
|
|
2155
2211
|
for (let s = 0; s < 4; s++) {
|
|
2156
2212
|
let o = 0;
|
|
2157
|
-
for (let
|
|
2213
|
+
for (let a = 0; a < 4; a++) o += t[a * 4 + s] * e[r * 4 + a];
|
|
2158
2214
|
n[r * 4 + s] = o;
|
|
2159
2215
|
}
|
|
2160
2216
|
return n;
|
|
2161
2217
|
}
|
|
2162
|
-
function
|
|
2218
|
+
function Mr(t) {
|
|
2163
2219
|
return [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, t[0], t[1], t[2], 1];
|
|
2164
2220
|
}
|
|
2165
|
-
function
|
|
2221
|
+
function _r(t) {
|
|
2166
2222
|
return [t[0], 0, 0, 0, 0, t[1], 0, 0, 0, 0, t[2], 0, 0, 0, 0, 1];
|
|
2167
2223
|
}
|
|
2168
|
-
function
|
|
2224
|
+
function Ce(t) {
|
|
2169
2225
|
const [e, n, r, s] = t;
|
|
2170
2226
|
return [
|
|
2171
2227
|
1 - 2 * (n * n + r * r),
|
|
@@ -2186,49 +2242,49 @@ function $e(t) {
|
|
|
2186
2242
|
1
|
|
2187
2243
|
];
|
|
2188
2244
|
}
|
|
2189
|
-
function
|
|
2190
|
-
const r =
|
|
2245
|
+
function br(t, e, n) {
|
|
2246
|
+
const r = Ce(e);
|
|
2191
2247
|
for (let s = 0; s < 3; s++)
|
|
2192
2248
|
r[s] *= n[0], r[4 + s] *= n[1], r[8 + s] *= n[2];
|
|
2193
2249
|
return r[12] = t[0], r[13] = t[1], r[14] = t[2], r;
|
|
2194
2250
|
}
|
|
2195
|
-
function
|
|
2251
|
+
function Tr(t) {
|
|
2196
2252
|
const e = new Array(16);
|
|
2197
2253
|
for (let n = 0; n < 4; n++) for (let r = 0; r < 4; r++) e[r * 4 + n] = t[n * 4 + r];
|
|
2198
2254
|
return e;
|
|
2199
2255
|
}
|
|
2200
|
-
function
|
|
2201
|
-
const [e, n, r, s, o,
|
|
2256
|
+
function xr(t) {
|
|
2257
|
+
const [e, n, r, s, o, a, i, c, l, h, u, f, d, m, p, g] = t, M = e * a - n * o, y = e * i - r * o, k = e * c - s * o, S = n * i - r * a, b = n * c - s * a, v = r * c - s * i, A = l * m - h * d, D = l * p - u * d, _ = l * g - f * d, T = h * p - u * m, x = h * g - f * m, w = u * g - f * p, $ = M * w - y * x + k * T + S * _ - b * D + v * A;
|
|
2202
2258
|
if (Math.abs($) < 1e-12) return null;
|
|
2203
2259
|
const P = 1 / $;
|
|
2204
2260
|
return [
|
|
2205
|
-
(
|
|
2206
|
-
(r * x - n *
|
|
2207
|
-
(
|
|
2208
|
-
(
|
|
2209
|
-
(
|
|
2210
|
-
(e *
|
|
2211
|
-
(
|
|
2212
|
-
(
|
|
2213
|
-
(o * x -
|
|
2214
|
-
(n *
|
|
2215
|
-
(
|
|
2216
|
-
(
|
|
2217
|
-
(
|
|
2261
|
+
(a * w - i * x + c * T) * P,
|
|
2262
|
+
(r * x - n * w - s * T) * P,
|
|
2263
|
+
(m * v - p * b + g * S) * P,
|
|
2264
|
+
(u * b - h * v - f * S) * P,
|
|
2265
|
+
(i * _ - o * w - c * D) * P,
|
|
2266
|
+
(e * w - r * _ + s * D) * P,
|
|
2267
|
+
(p * k - d * v - g * y) * P,
|
|
2268
|
+
(l * v - u * k + f * y) * P,
|
|
2269
|
+
(o * x - a * _ + c * A) * P,
|
|
2270
|
+
(n * _ - e * x - s * A) * P,
|
|
2271
|
+
(d * b - m * k + g * M) * P,
|
|
2272
|
+
(h * k - l * b - f * M) * P,
|
|
2273
|
+
(a * D - o * T - i * A) * P,
|
|
2218
2274
|
(e * T - n * D + r * A) * P,
|
|
2219
|
-
(
|
|
2220
|
-
(
|
|
2275
|
+
(m * y - d * S - p * M) * P,
|
|
2276
|
+
(l * S - h * y + u * M) * P
|
|
2221
2277
|
];
|
|
2222
2278
|
}
|
|
2223
|
-
function
|
|
2224
|
-
const s = 1 / Math.tan(t *
|
|
2279
|
+
function kr(t, e, n, r) {
|
|
2280
|
+
const s = 1 / Math.tan(t * gr / 2), o = 1 / (n - r);
|
|
2225
2281
|
return [s / e, 0, 0, 0, 0, s, 0, 0, 0, 0, (r + n) * o, -1, 0, 0, 2 * r * n * o, 0];
|
|
2226
2282
|
}
|
|
2227
|
-
function
|
|
2228
|
-
const
|
|
2229
|
-
return [2 *
|
|
2283
|
+
function Sr(t, e, n, r, s, o) {
|
|
2284
|
+
const a = 1 / (e - t), i = 1 / (r - n), c = 1 / (o - s);
|
|
2285
|
+
return [2 * a, 0, 0, 0, 0, 2 * i, 0, 0, 0, 0, -2 * c, 0, -(e + t) * a, -(r + n) * i, -(o + s) * c, 1];
|
|
2230
2286
|
}
|
|
2231
|
-
function
|
|
2287
|
+
function wr(t, e, n = [0, 1, 0]) {
|
|
2232
2288
|
const r = Pt(Et(t, e)), s = Pt(vt(n, r)), o = vt(r, s);
|
|
2233
2289
|
return [
|
|
2234
2290
|
s[0],
|
|
@@ -2249,146 +2305,147 @@ function xr(t, e, n = [0, 1, 0]) {
|
|
|
2249
2305
|
1
|
|
2250
2306
|
];
|
|
2251
2307
|
}
|
|
2252
|
-
function
|
|
2308
|
+
function Ar(t, e) {
|
|
2253
2309
|
const n = t[0] * e[0] + t[4] * e[1] + t[8] * e[2] + t[12], r = t[1] * e[0] + t[5] * e[1] + t[9] * e[2] + t[13], s = t[2] * e[0] + t[6] * e[1] + t[10] * e[2] + t[14], o = t[3] * e[0] + t[7] * e[1] + t[11] * e[2] + t[15];
|
|
2254
2310
|
return o === 1 || o === 0 ? [n, r, s] : [n / o, r / o, s / o];
|
|
2255
2311
|
}
|
|
2256
|
-
const
|
|
2312
|
+
const gs = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
|
|
2257
2313
|
__proto__: null,
|
|
2258
|
-
compose:
|
|
2259
|
-
fromQuat:
|
|
2260
|
-
identity:
|
|
2261
|
-
invert:
|
|
2262
|
-
lookAt:
|
|
2263
|
-
multiply:
|
|
2264
|
-
orthographic:
|
|
2265
|
-
perspective:
|
|
2266
|
-
scaling:
|
|
2267
|
-
transformPoint:
|
|
2268
|
-
translation:
|
|
2269
|
-
transpose:
|
|
2314
|
+
compose: br,
|
|
2315
|
+
fromQuat: Ce,
|
|
2316
|
+
identity: mr,
|
|
2317
|
+
invert: xr,
|
|
2318
|
+
lookAt: wr,
|
|
2319
|
+
multiply: yr,
|
|
2320
|
+
orthographic: Sr,
|
|
2321
|
+
perspective: kr,
|
|
2322
|
+
scaling: _r,
|
|
2323
|
+
transformPoint: Ar,
|
|
2324
|
+
translation: Mr,
|
|
2325
|
+
transpose: Tr
|
|
2270
2326
|
}, Symbol.toStringTag, { value: "Module" }));
|
|
2271
2327
|
export {
|
|
2272
|
-
|
|
2273
|
-
|
|
2274
|
-
|
|
2328
|
+
$r as Clock,
|
|
2329
|
+
Me as DEFAULT_BAKE_INTERVAL_MS,
|
|
2330
|
+
Yt as DEFAULT_INERTIA_FRICTION,
|
|
2275
2331
|
L as DEFAULT_SPRING,
|
|
2276
|
-
|
|
2277
|
-
|
|
2278
|
-
|
|
2279
|
-
|
|
2280
|
-
|
|
2332
|
+
Nt as FORMAT_VERSION,
|
|
2333
|
+
Ve as INERTIA_MAX_DURATION_MS,
|
|
2334
|
+
jn as InertiaTrackPlayer,
|
|
2335
|
+
Nr as MORPH_SAMPLES,
|
|
2336
|
+
Pr as ManualClock,
|
|
2281
2337
|
ie as SPRING_MAX_DURATION_MS,
|
|
2282
|
-
|
|
2338
|
+
Dr as SPRING_PRESETS,
|
|
2283
2339
|
tt as SPRING_STEP_MS,
|
|
2284
2340
|
ut as SpringSampler,
|
|
2285
|
-
|
|
2286
|
-
|
|
2341
|
+
Vn as SpringTrackPlayer,
|
|
2342
|
+
ke as Timeline,
|
|
2287
2343
|
_t as TrackPlayer,
|
|
2288
|
-
|
|
2289
|
-
|
|
2290
|
-
|
|
2291
|
-
|
|
2292
|
-
|
|
2344
|
+
Zr as ValueResolver,
|
|
2345
|
+
nn as backOut,
|
|
2346
|
+
Nn as bakeEasing,
|
|
2347
|
+
be as bakeInertiaTrack,
|
|
2348
|
+
_e as bakeSpringTrack,
|
|
2293
2349
|
It as beatAtTime,
|
|
2294
|
-
|
|
2350
|
+
Re as beatLength,
|
|
2295
2351
|
Ct as beatTime,
|
|
2296
|
-
|
|
2297
|
-
|
|
2298
|
-
|
|
2299
|
-
|
|
2300
|
-
|
|
2301
|
-
|
|
2302
|
-
|
|
2303
|
-
|
|
2304
|
-
|
|
2305
|
-
|
|
2306
|
-
|
|
2307
|
-
|
|
2308
|
-
|
|
2309
|
-
|
|
2310
|
-
|
|
2311
|
-
|
|
2312
|
-
|
|
2313
|
-
|
|
2314
|
-
|
|
2315
|
-
|
|
2316
|
-
|
|
2317
|
-
|
|
2318
|
-
|
|
2319
|
-
|
|
2320
|
-
|
|
2321
|
-
|
|
2322
|
-
|
|
2323
|
-
|
|
2324
|
-
|
|
2325
|
-
|
|
2326
|
-
|
|
2327
|
-
|
|
2328
|
-
|
|
2329
|
-
|
|
2330
|
-
|
|
2331
|
-
|
|
2352
|
+
as as beatsBetween,
|
|
2353
|
+
en as bounceOut,
|
|
2354
|
+
cs as cameraTracks,
|
|
2355
|
+
Bn as charactersFor,
|
|
2356
|
+
Yr as clearMorphCache,
|
|
2357
|
+
Fr as clearPathCache,
|
|
2358
|
+
Je as createCubicBezier,
|
|
2359
|
+
we as createRandom,
|
|
2360
|
+
Un as createTrack,
|
|
2361
|
+
Lr as criticalDamping,
|
|
2362
|
+
Jr as customBounce,
|
|
2363
|
+
qr as customEase,
|
|
2364
|
+
ts as customWiggle,
|
|
2365
|
+
Jn as deserializeTimeline,
|
|
2366
|
+
Zn as deserializeTrack,
|
|
2367
|
+
is as detectTempo,
|
|
2368
|
+
Ge as easeIn,
|
|
2369
|
+
ce as easeInCubic,
|
|
2370
|
+
Ze as easeInOut,
|
|
2371
|
+
le as easeInOutCubic,
|
|
2372
|
+
Qe as easeInOutQuad,
|
|
2373
|
+
Be as easeInQuad,
|
|
2374
|
+
Ke as easeOut,
|
|
2375
|
+
ue as easeOutCubic,
|
|
2376
|
+
We as easeOutQuad,
|
|
2377
|
+
tn as elasticOut,
|
|
2378
|
+
Yn as expandParametricEasings,
|
|
2379
|
+
re as formatVersionFor,
|
|
2380
|
+
Wr as fromJSON,
|
|
2381
|
+
he as getEasingFunction,
|
|
2382
|
+
ye as getInterpolator,
|
|
2383
|
+
xe as getMotionPathPoint,
|
|
2384
|
+
Xr as getPathLength,
|
|
2385
|
+
pn as getPointAtProgress,
|
|
2386
|
+
Xe as hasKeyframes,
|
|
2387
|
+
Qr as hashSeed,
|
|
2388
|
+
Rr as heldTime,
|
|
2332
2389
|
ft as inertiaDuration,
|
|
2333
2390
|
ht as inertiaRest,
|
|
2334
2391
|
kt as inertiaValueAt,
|
|
2335
|
-
|
|
2336
|
-
|
|
2337
|
-
|
|
2338
|
-
|
|
2339
|
-
|
|
2340
|
-
|
|
2341
|
-
|
|
2392
|
+
Or as inertiaVelocityAt,
|
|
2393
|
+
On as interpolateArray,
|
|
2394
|
+
Ln as interpolateColor,
|
|
2395
|
+
jr as interpolateMotionPath,
|
|
2396
|
+
X as interpolateNumber,
|
|
2397
|
+
Xn as interpolatePathString,
|
|
2398
|
+
Fn as interpolateQuaternion,
|
|
2342
2399
|
te as interpolateString,
|
|
2343
|
-
|
|
2400
|
+
Fe as isCubicBezierEasing,
|
|
2344
2401
|
V as isInertiaTrack,
|
|
2345
|
-
|
|
2346
|
-
|
|
2402
|
+
vr as isMotionPathPoint,
|
|
2403
|
+
se as isMotionPathTrack,
|
|
2347
2404
|
xt as isParametricEasing,
|
|
2348
|
-
|
|
2405
|
+
vn as isPathData,
|
|
2349
2406
|
j as isSpringTrack,
|
|
2350
2407
|
$t as isTextTrack,
|
|
2351
|
-
|
|
2352
|
-
|
|
2408
|
+
Er as isUnderdamped,
|
|
2409
|
+
Kr as isUnresolved,
|
|
2353
2410
|
St as linear,
|
|
2354
|
-
|
|
2355
|
-
|
|
2356
|
-
|
|
2357
|
-
|
|
2358
|
-
|
|
2359
|
-
|
|
2360
|
-
|
|
2361
|
-
|
|
2362
|
-
|
|
2411
|
+
gs as mat4,
|
|
2412
|
+
Ne as maxStaggerDistance,
|
|
2413
|
+
An as morphPath,
|
|
2414
|
+
ns as narrationMarkers,
|
|
2415
|
+
rs as narrationSceneAt,
|
|
2416
|
+
je as naturalRest,
|
|
2417
|
+
ss as nearestBeat,
|
|
2418
|
+
os as nextBeat,
|
|
2419
|
+
sn as parametricEasing,
|
|
2363
2420
|
G as parsePath,
|
|
2364
|
-
|
|
2365
|
-
|
|
2366
|
-
|
|
2367
|
-
|
|
2368
|
-
|
|
2369
|
-
|
|
2370
|
-
|
|
2371
|
-
|
|
2372
|
-
|
|
2373
|
-
|
|
2374
|
-
|
|
2375
|
-
|
|
2376
|
-
|
|
2377
|
-
|
|
2378
|
-
|
|
2379
|
-
|
|
2380
|
-
|
|
2381
|
-
|
|
2382
|
-
|
|
2383
|
-
|
|
2384
|
-
|
|
2421
|
+
es as planNarration,
|
|
2422
|
+
Hr as playheadCrossings,
|
|
2423
|
+
fe as pointAtDistance,
|
|
2424
|
+
us as pointsToPath,
|
|
2425
|
+
zr as quat,
|
|
2426
|
+
Ae as randomBetween,
|
|
2427
|
+
Gr as randomChoice,
|
|
2428
|
+
tr as randomSnapped,
|
|
2429
|
+
er as resolveSequence,
|
|
2430
|
+
$e as resolveValue,
|
|
2431
|
+
fs as ribbon,
|
|
2432
|
+
ds as ribbonHeadCap,
|
|
2433
|
+
qn as serializeTimeline,
|
|
2434
|
+
Kn as serializeTrack,
|
|
2435
|
+
ls as shapeToPathData,
|
|
2436
|
+
zn as simplifyKeyframes,
|
|
2437
|
+
Ir as springDuration,
|
|
2438
|
+
Cr as springValueAt,
|
|
2439
|
+
oe as staggerDistance,
|
|
2440
|
+
ae as staggerOffset,
|
|
2441
|
+
Ye as staggerOffsets,
|
|
2385
2442
|
Rt as staggerSpan,
|
|
2386
|
-
|
|
2387
|
-
|
|
2388
|
-
|
|
2389
|
-
|
|
2390
|
-
|
|
2443
|
+
rn as stepsEasing,
|
|
2444
|
+
Qn as textAt,
|
|
2445
|
+
Br as toJSON,
|
|
2446
|
+
Ur as toKeyframedTrack,
|
|
2447
|
+
Vr as toKeyframedTracks,
|
|
2391
2448
|
U as trackTargets,
|
|
2392
|
-
|
|
2393
|
-
|
|
2449
|
+
hs as trailSamples,
|
|
2450
|
+
ps as vec3
|
|
2394
2451
|
};
|