@weasel-js/core 1.6.1 → 1.7.1

package/dist/animation/rig/solveIk.js

@@ -0,0 +1,103 @@
+import { mat3 as e } from "../../renderer/math/mat3.js";
+import { compose as t, resolveSkeleton as n, toMat3 as r } from "./resolveSkeleton.js";
+//#region src/animation/rig/solveIk.ts
+var i = Math.PI * 2;
+function a(e) {
+	return e - i * Math.round(e / i);
+}
+function o(e, t) {
+	if (!t) return e;
+	for (let n of [
+		e,
+		e - i,
+		e + i
+	]) if (n >= t.min && n <= t.max) return n;
+	return Math.abs(a(e - t.min)) <= Math.abs(a(e - t.max)) ? t.min : t.max;
+}
+var s = (e, t, n, r) => e * r - t * n;
+function c(i, c, l) {
+	let { tip: u, target: d, limits: f } = l, p = l.iterations ?? 32, m = l.tolerance ?? .01, h = /* @__PURE__ */ new Map();
+	for (let e of i.joints) h.set(e.name, e);
+	let g = l.joints.map((e, t) => {
+		let n = h.get(e);
+		if (!n) throw Error(`solveIk: the skeleton has no joint "${e}".`);
+		if (t > 0 && n.parent !== l.joints[t - 1]) throw Error(`solveIk: chain joint "${e}" names parent "${n.parent}", not "${l.joints[t - 1]}". Each chain joint must be the parent of the next.`);
+		return n;
+	}), _ = g.length;
+	if (_ === 0) return {
+		pose: { ...c },
+		distance: Infinity,
+		reached: !1,
+		iterations: 0
+	};
+	let v = g[0].parent, y = v == null ? e.identity() : n(i, c).get(v), b = g.map((e) => o(a(c[e.name]?.rotation ?? 0), f?.[e.name])), x = [], S = () => {
+		x = [];
+		let n = y;
+		for (let i = 0; i < _; i += 1) {
+			let a = g[i];
+			n = e.multiply(n, r(t(a.bind, {
+				...c[a.name],
+				rotation: b[i]
+			}))), x.push(n);
+		}
+	}, C = (t) => e.apply(x[t], 0, 0), w = () => e.apply(x[_ - 1], u.x, u.y), T = (e) => e + 1 < _ ? C(e + 1) : w(), E = (t, n, r) => {
+		let i = e.invert(t === 0 ? y : x[t - 1]);
+		if (!i) return !1;
+		let [s, c] = e.apply(i, ...C(t)), [l, u] = e.apply(i, ...n), [d, p] = e.apply(i, r.x, r.y);
+		if (Math.hypot(l - s, u - c) < 1e-9 || Math.hypot(d - s, p - c) < 1e-9) return !1;
+		let m = a(b[t] + Math.atan2(p - c, d - s) - Math.atan2(u - c, l - s));
+		return b[t] = o(m, f?.[g[t].name]), S(), Math.abs(a(b[t] - m)) > 1e-9;
+	}, D = () => {
+		let [e, t] = w();
+		return Math.hypot(e - d.x, t - d.y);
+	}, O = (e) => {
+		let t = { ...c };
+		g.forEach((e, n) => {
+			t[e.name] = {
+				...c[e.name],
+				rotation: b[n]
+			};
+		});
+		let n = D();
+		return {
+			pose: t,
+			distance: n,
+			reached: n <= m,
+			iterations: e
+		};
+	};
+	S();
+	let [k, A] = C(0), j = 0;
+	for (let e = 0; e < _; e += 1) {
+		let [t, n] = C(e), [r, i] = T(e);
+		j += Math.hypot(r - t, i - n);
+	}
+	let M = Math.hypot(d.x - k, d.y - A);
+	if (M >= j) {
+		for (let e = 0; e < _; e += 1) E(e, T(e), d);
+		return O(0);
+	}
+	if (_ === 2 && M > 1e-9) {
+		let e = b.slice(), [t, n] = C(1), [r, i] = w(), a = Math.hypot(t - k, n - A), o = Math.hypot(r - t, i - n), c = d.x - k, u = d.y - A, f = (l.pole ? s(c, u, l.pole.x - k, l.pole.y - A) : s(c, u, t - k, n - A)) < 0 ? -1 : 1, p = Math.acos(Math.max(-1, Math.min(1, (a * a + M * M - o * o) / (2 * a * M)))), h = Math.atan2(u, c), g = (t) => {
+			b.splice(0, 2, ...e), S();
+			let n = {
+				x: k + a * Math.cos(h + t * p),
+				y: A + a * Math.sin(h + t * p)
+			}, r = E(0, C(1), n);
+			return E(1, w(), d) || r;
+		};
+		if (!g(f) || !g(-f)) {
+			if (D() <= m) return O(0);
+		} else g(f);
+	}
+	let N = 0;
+	for (; N < p && D() > m;) {
+		for (let e = _ - 1; e >= 0; --e) E(e, w(), d);
+		N += 1;
+	}
+	return O(N);
+}
+//#endregion
+export { c as solveIk };
+
+//# sourceMappingURL=solveIk.js.map

package/dist/animation/rig/solveIk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"solveIk.js","names":["TAU","wrap","a","clampAngle","limit","v","c","cross","ax","by","ay","bx","solveIk","options","maxIterations","tolerance","byName","joint","skeleton","chain","name","i","n","pose","rootParent","base","mat3","resolveSkeleton","rot","limits","worlds","resolve","parent","toMat3","compose","pivot","tipWorld","tip","next","aim","inv","ox","oy","ex","ey","effector","gx","gy","goal","want","distance","x","y","target","result","out","d","rx","ry","reach","toTarget","start","mx","my","tx","ty","b","dx","dy","side","inner","heading","bend","elbow","s","cut","iterations"],"sources":["../../../src/animation/rig/solveIk.ts"],"sourcesContent":["import { mat3, type GlMat3 } from '../../renderer/math/mat3';\nimport { compose, resolveSkeleton, toMat3 } from './resolveSkeleton';\nimport type { Joint, Pose, Skeleton } from './types';\n\nconst TAU = Math.PI * 2;\n\n/** A point in the skeleton's space — the space `resolveSkeleton` resolves into. */\nexport interface IkPoint {\n  x: number;\n  y: number;\n}\n\n/** Bounds on a joint's rotation delta from its bind, in radians, with\n *  `-PI <= min <= max <= PI`. */\nexport interface IkLimit {\n  min: number;\n  max: number;\n}\n\n/** Options for {@link solveIk}. */\nexport interface SolveIkOptions {\n  /** The joints the solver may rotate, root first, each the parent of the next. */\n  joints: readonly string[];\n  /** The end effector, in the last joint's local frame — the forearm's length\n   *  along its +x for an arm, or a hand joint's bind offset. */\n  tip: IkPoint;\n  /** Where the tip should go, in skeleton space. A rig posed with a `root`\n   *  wants the target carried back through that root's inverse first. */\n  target: IkPoint;\n  /** Per-joint limits, keyed by joint name. A joint without one turns freely. */\n  limits?: Readonly<Record<string, IkLimit>>;\n  /** Two-joint chains only: the middle joint bends toward this point, in\n   *  skeleton space. Without it the chain keeps the bend the input pose has. */\n  pole?: IkPoint;\n  /** Most CCD sweeps to run. Default 32. */\n  iterations?: number;\n  /** Tip-to-target distance that counts as reached, in skeleton units.\n   *  Default 0.01. */\n  tolerance?: number;\n}\n\n/** What {@link solveIk} returns. */\nexport interface IkResult {\n  /** The input pose with each chain joint's rotation replaced. */\n  pose: Pose;\n  /** Tip-to-target distance the solve ended at. */\n  distance: number;\n  /** Whether `distance` is within the tolerance. False for a target out of\n   *  reach, which leaves the chain pointing straight at it. */\n  reached: boolean;\n  /** CCD sweeps run; 0 when the two-joint solution or the straight-line\n   *  answer for an unreachable target settled it. */\n  iterations: number;\n}\n\nfunction wrap(a: number): number {\n  return a - TAU * Math.round(a / TAU);\n}\n\n/** `v` held to `limit`, where out of range means the nearer bound around the circle. */\nfunction clampAngle(v: number, limit: IkLimit | undefined): number {\n  if (!limit) return v;\n  for (const c of [v, v - TAU, v + TAU]) if (c >= limit.min && c <= limit.max) return c;\n  return Math.abs(wrap(v - limit.min)) <= Math.abs(wrap(v - limit.max)) ? limit.min : limit.max;\n}\n\nconst cross = (ax: number, ay: number, bx: number, by: number) => ax * by - ay * bx;\n\n/**\n * Rotate a joint chain so its tip reaches `target`, returning the result as an\n * ordinary {@link Pose} — so it blends with `blendPoses` (weighting the IK\n * against an animated pose is `blendPoses([anim, solved], [1 - w, w])`),\n * samples on a `SampledTrack<Pose>` and drives a rig through `Rig.pose`.\n *\n * The solver is cyclic coordinate descent: each step turns one joint so the\n * tip lies on the ray from that joint to the target. A joint's rotation is the\n * one term the rig lets it change, and a CCD step is exactly a change to it, so\n * limits clamp the value the pose stores and nothing has to be converted back\n * from positions. Each step is solved in the joint's parent frame, which makes\n * it exact under any parent transform the skeleton composes, mirrors included.\n *\n * A two-joint chain is solved analytically first: of the two bends that reach\n * the target it takes the one on `pole`'s side, or the input pose's side, and\n * falls back to the other bend and then to CCD when limits refuse it. A target\n * beyond the chain's reach straightens the chain toward it.\n */\nexport function solveIk(skeleton: Skeleton, pose: Pose, options: SolveIkOptions): IkResult {\n  const { tip, target, limits } = options;\n  const maxIterations = options.iterations ?? 32;\n  const tolerance = options.tolerance ?? 0.01;\n\n  const byName = new Map<string, Joint>();\n  for (const joint of skeleton.joints) byName.set(joint.name, joint);\n  const chain = options.joints.map((name, i) => {\n    const joint = byName.get(name);\n    if (!joint) throw new Error(`solveIk: the skeleton has no joint \"${name}\".`);\n    if (i > 0 && joint.parent !== options.joints[i - 1]) {\n      throw new Error(\n        `solveIk: chain joint \"${name}\" names parent \"${joint.parent}\", not \"${options.joints[i - 1]}\". ` +\n        'Each chain joint must be the parent of the next.',\n      );\n    }\n    return joint;\n  });\n  const n = chain.length;\n  if (n === 0) return { pose: { ...pose }, distance: Infinity, reached: false, iterations: 0 };\n\n  const rootParent = chain[0].parent;\n  const base = rootParent == null ? mat3.identity() : resolveSkeleton(skeleton, pose).get(rootParent)!;\n  const rot = chain.map((joint) => clampAngle(wrap(pose[joint.name]?.rotation ?? 0), limits?.[joint.name]));\n\n  let worlds: GlMat3[] = [];\n  const resolve = () => {\n    worlds = [];\n    let parent = base;\n    for (let i = 0; i < n; i += 1) {\n      const joint = chain[i];\n      parent = mat3.multiply(parent, toMat3(compose(joint.bind, { ...pose[joint.name], rotation: rot[i] })));\n      worlds.push(parent);\n    }\n  };\n  const pivot = (i: number) => mat3.apply(worlds[i], 0, 0);\n  const tipWorld = () => mat3.apply(worlds[n - 1], tip.x, tip.y);\n  /** The point joint `i` swings: the next joint's pivot, or the tip. */\n  const next = (i: number) => (i + 1 < n ? pivot(i + 1) : tipWorld());\n\n  /** Turn joint `i` so `effector` lies on the ray toward `goal`. True when a\n   *  limit cut the turn short. */\n  const aim = (i: number, effector: [number, number], goal: IkPoint): boolean => {\n    const inv = mat3.invert(i === 0 ? base : worlds[i - 1]);\n    if (!inv) return false;\n    const [ox, oy] = mat3.apply(inv, ...pivot(i));\n    const [ex, ey] = mat3.apply(inv, ...effector);\n    const [gx, gy] = mat3.apply(inv, goal.x, goal.y);\n    if (Math.hypot(ex - ox, ey - oy) < 1e-9 || Math.hypot(gx - ox, gy - oy) < 1e-9) return false;\n    const want = wrap(rot[i] + Math.atan2(gy - oy, gx - ox) - Math.atan2(ey - oy, ex - ox));\n    rot[i] = clampAngle(want, limits?.[chain[i].name]);\n    resolve();\n    return Math.abs(wrap(rot[i] - want)) > 1e-9;\n  };\n\n  const distance = () => {\n    const [x, y] = tipWorld();\n    return Math.hypot(x - target.x, y - target.y);\n  };\n  const result = (iterations: number): IkResult => {\n    const out: Pose = { ...pose };\n    chain.forEach((joint, i) => { out[joint.name] = { ...pose[joint.name], rotation: rot[i] }; });\n    const d = distance();\n    return { pose: out, distance: d, reached: d <= tolerance, iterations };\n  };\n\n  resolve();\n  const [rx, ry] = pivot(0);\n  let reach = 0;\n  for (let i = 0; i < n; i += 1) {\n    const [ax, ay] = pivot(i);\n    const [bx, by] = next(i);\n    reach += Math.hypot(bx - ax, by - ay);\n  }\n  const toTarget = Math.hypot(target.x - rx, target.y - ry);\n\n  if (toTarget >= reach) {\n    for (let i = 0; i < n; i += 1) aim(i, next(i), target);\n    return result(0);\n  }\n\n  if (n === 2 && toTarget > 1e-9) {\n    const start = rot.slice();\n    const [mx, my] = pivot(1);\n    const [tx, ty] = tipWorld();\n    const a = Math.hypot(mx - rx, my - ry);\n    const b = Math.hypot(tx - mx, ty - my);\n    const dx = target.x - rx;\n    const dy = target.y - ry;\n    const bendSide = options.pole\n      ? cross(dx, dy, options.pole.x - rx, options.pole.y - ry)\n      : cross(dx, dy, mx - rx, my - ry);\n    const side = bendSide < 0 ? -1 : 1;\n    const inner = Math.acos(Math.max(-1, Math.min(1, (a * a + toTarget * toTarget - b * b) / (2 * a * toTarget))));\n    const heading = Math.atan2(dy, dx);\n\n    const bend = (s: number): boolean => {\n      rot.splice(0, 2, ...start);\n      resolve();\n      const elbow = { x: rx + a * Math.cos(heading + s * inner), y: ry + a * Math.sin(heading + s * inner) };\n      const cut = aim(0, pivot(1), elbow);\n      return aim(1, tipWorld(), target) || cut;\n    };\n    if (!bend(side) || !bend(-side)) {\n      if (distance() <= tolerance) return result(0);\n    } else {\n      bend(side);\n    }\n  }\n\n  let iterations = 0;\n  while (iterations < maxIterations && distance() > tolerance) {\n    for (let i = n - 1; i >= 0; i -= 1) aim(i, tipWorld(), target);\n    iterations += 1;\n  }\n  return result(iterations);\n}\n"],"mappings":";;;AAIA,IAAMA,IAAM,KAAK,KAAK;AAmDtB,SAASC,EAAK,GAAmB;CAC/B,OAAOC,IAAIF,IAAM,KAAK,MAAME,IAAIF,CAAG;AACrC;AAGA,SAASG,EAAW,GAAW,GAAoC;CACjE,IAAI,CAACC,GAAO,OAAOC;CACnB,KAAK,IAAMC,KAAK;EAACD;EAAGA,IAAIL;EAAKK,IAAIL;CAAG,GAAG,IAAIM,KAAKF,EAAM,OAAOE,KAAKF,EAAM,KAAK,OAAOE;CACpF,OAAO,KAAK,IAAIL,EAAKI,IAAID,EAAM,GAAG,CAAC,KAAK,KAAK,IAAIH,EAAKI,IAAID,EAAM,GAAG,CAAC,IAAIA,EAAM,MAAMA,EAAM;AAC5F;AAEA,IAAMG,KAAS,GAAY,GAAY,GAAY,MAAeC,IAAKC,IAAKC,IAAKC;AAoBjF,SAAgBC,EAAQ,GAAoB,GAAY,GAAmC;CACzF,IAAM,EAAE,QAAK,WAAQ,cAAWC,GAC1BC,IAAgBD,EAAQ,cAAc,IACtCE,IAAYF,EAAQ,aAAa,KAEjCG,oBAAS,IAAI,IAAmB;CACtC,KAAK,IAAMC,KAASC,EAAS,QAAQ,EAAO,IAAID,EAAM,MAAMA,CAAK;CACjE,IAAME,IAAQN,EAAQ,OAAO,KAAK,GAAM,MAAM;EAC5C,IAAMI,IAAQD,EAAO,IAAII,CAAI;EAC7B,IAAI,CAACH,GAAO,MAAU,MAAM,uCAAuCG,EAAK,GAAG;EAC3E,IAAIC,IAAI,KAAKJ,EAAM,WAAWJ,EAAQ,OAAOQ,IAAI,IAC/C,MAAU,MACR,yBAAyBD,EAAK,kBAAkBH,EAAM,OAAO,UAAUJ,EAAQ,OAAOQ,IAAI,GAAG,oDAE/F;EAEF,OAAOJ;CACT,CAAC,GACKK,IAAIH,EAAM;CAChB,IAAIG,MAAM,GAAG,OAAO;EAAE,MAAM,EAAE,GAAGC,EAAK;EAAG,UAAU;EAAU,SAAS;EAAO,YAAY;CAAE;CAE3F,IAAMC,IAAaL,EAAM,EAAE,CAAC,QACtBM,IAAOD,KAAc,OAAOE,EAAK,SAAS,IAAIC,EAAgBT,GAAUK,CAAI,CAAC,CAAC,IAAIC,CAAU,GAC5FI,IAAMT,EAAM,KAAK,MAAUhB,EAAWF,EAAKsB,EAAKN,EAAM,KAAK,EAAE,YAAY,CAAC,GAAGY,IAASZ,EAAM,KAAK,CAAC,GAEpGa,IAAmB,CAAC,GAClBC,UAAgB;EACpB,IAAS,CAAC;EACV,IAAIC,IAASP;EACb,KAAK,IAAI,IAAI,GAAG,IAAIH,GAAG,KAAK,GAAG;GAC7B,IAAML,IAAQE,EAAM;GAEpB,AADA,IAASO,EAAK,SAASM,GAAQC,EAAOC,EAAQjB,EAAM,MAAM;IAAE,GAAGM,EAAKN,EAAM;IAAO,UAAUW,EAAI;GAAG,CAAC,CAAC,CAAC,GACrGE,EAAO,KAAKE,CAAM;EACpB;CACF,GACMG,KAAS,MAAcT,EAAK,MAAMI,EAAOT,IAAI,GAAG,CAAC,GACjDe,UAAiBV,EAAK,MAAMI,EAAOR,IAAI,IAAIe,EAAI,GAAGA,EAAI,CAAC,GAEvDC,KAAQ,MAAejB,IAAI,IAAIC,IAAIa,EAAMd,IAAI,CAAC,IAAIe,EAAS,GAI3DG,KAAO,GAAW,GAA4B,MAA2B;EAC7E,IAAMC,IAAMd,EAAK,OAAOL,MAAM,IAAII,IAAOK,EAAOT,IAAI,EAAE;EACtD,IAAI,CAACmB,GAAK,OAAO;EACjB,IAAM,CAACC,GAAIC,KAAMhB,EAAK,MAAMc,GAAK,GAAGL,EAAMd,CAAC,CAAC,GACtC,CAACsB,GAAIC,KAAMlB,EAAK,MAAMc,GAAK,GAAGK,CAAQ,GACtC,CAACC,GAAIC,KAAMrB,EAAK,MAAMc,GAAKQ,EAAK,GAAGA,EAAK,CAAC;EAC/C,IAAI,KAAK,MAAML,IAAKF,GAAIG,IAAKF,CAAE,IAAI,QAAQ,KAAK,MAAMI,IAAKL,GAAIM,IAAKL,CAAE,IAAI,MAAM,OAAO;EACvF,IAAMO,IAAOhD,EAAK2B,EAAIP,KAAK,KAAK,MAAM0B,IAAKL,GAAII,IAAKL,CAAE,IAAI,KAAK,MAAMG,IAAKF,GAAIC,IAAKF,CAAE,CAAC;EAGtF,OAFA,EAAIpB,KAAKlB,EAAW8C,GAAMpB,IAASV,EAAME,EAAE,CAAC,KAAK,GACjDU,EAAQ,GACD,KAAK,IAAI9B,EAAK2B,EAAIP,KAAK4B,CAAI,CAAC,IAAI;CACzC,GAEMC,UAAiB;EACrB,IAAM,CAACC,GAAGC,KAAKhB,EAAS;EACxB,OAAO,KAAK,MAAMe,IAAIE,EAAO,GAAGD,IAAIC,EAAO,CAAC;CAC9C,GACMC,KAAU,MAAiC;EAC/C,IAAMC,IAAY,EAAE,GAAGhC,EAAK;EAC5B,EAAM,SAAS,GAAO,MAAM;GAAE,EAAIN,EAAM,QAAQ;IAAE,GAAGM,EAAKN,EAAM;IAAO,UAAUW,EAAIP;GAAG;EAAG,CAAC;EAC5F,IAAMmC,IAAIN,EAAS;EACnB,OAAO;GAAE,MAAMK;GAAK,UAAUC;GAAG,SAASA,KAAKzC;GAAW;EAAW;CACvE;CAEA,EAAQ;CACR,IAAM,CAAC0C,GAAIC,KAAMvB,EAAM,CAAC,GACpBwB,IAAQ;CACZ,KAAK,IAAItC,IAAI,GAAGA,IAAIC,GAAG,KAAK,GAAG;EAC7B,IAAM,CAACd,GAAIE,KAAMyB,EAAMd,CAAC,GAClB,CAACV,GAAIF,KAAM6B,EAAKjB,CAAC;EACvB,KAAS,KAAK,MAAMV,IAAKH,GAAIC,IAAKC,CAAE;CACtC;CACA,IAAMkD,IAAW,KAAK,MAAMP,EAAO,IAAII,GAAIJ,EAAO,IAAIK,CAAE;CAExD,IAAIE,KAAYD,GAAO;EACrB,KAAK,IAAItC,IAAI,GAAGA,IAAIC,GAAG,KAAK,GAAG,EAAID,GAAGiB,EAAKjB,CAAC,GAAGgC,CAAM;EACrD,OAAOC,EAAO,CAAC;CACjB;CAEA,IAAIhC,MAAM,KAAKsC,IAAW,MAAM;EAC9B,IAAMC,IAAQjC,EAAI,MAAM,GAClB,CAACkC,GAAIC,KAAM5B,EAAM,CAAC,GAClB,CAAC6B,GAAIC,KAAM7B,EAAS,GACpB,IAAI,KAAK,MAAM0B,IAAKL,GAAIM,IAAKL,CAAE,GAC/BQ,IAAI,KAAK,MAAMF,IAAKF,GAAIG,IAAKF,CAAE,GAC/BI,IAAKd,EAAO,IAAII,GAChBW,IAAKf,EAAO,IAAIK,GAIhBW,KAHWxD,EAAQ,OACrBN,EAAM4D,GAAIC,GAAIvD,EAAQ,KAAK,IAAI4C,GAAI5C,EAAQ,KAAK,IAAI6C,CAAE,IACtDnD,EAAM4D,GAAIC,GAAIN,IAAKL,GAAIM,IAAKL,CAAE,KACV,IAAI,KAAK,GAC3BY,IAAQ,KAAK,KAAK,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,IAAIV,IAAWA,IAAWM,IAAIA,MAAM,IAAI,IAAIN,EAAS,CAAC,CAAC,GACvGW,IAAU,KAAK,MAAMH,GAAID,CAAE,GAE3BK,KAAQ,MAAuB;GAEnC,AADA5C,EAAI,OAAO,GAAG,GAAG,GAAGiC,CAAK,GACzB9B,EAAQ;GACR,IAAM0C,IAAQ;IAAE,GAAGhB,IAAK,IAAI,KAAK,IAAIc,IAAUG,IAAIJ,CAAK;IAAG,GAAGZ,IAAK,IAAI,KAAK,IAAIa,IAAUG,IAAIJ,CAAK;GAAE,GAC/FK,IAAMpC,EAAI,GAAGJ,EAAM,CAAC,GAAGsC,CAAK;GAClC,OAAOlC,EAAI,GAAGH,EAAS,GAAGiB,CAAM,KAAKsB;EACvC;EACA,IAAI,CAACH,EAAKH,CAAI,KAAK,CAACG,EAAK,CAACH,CAAI,GACxB;OAAAnB,EAAS,KAAKnC,GAAW,OAAOuC,EAAO,CAAC;EAAA,OAE5C,EAAKe,CAAI;CAEb;CAEA,IAAIO,IAAa;CACjB,OAAOA,IAAa9D,KAAiBoC,EAAS,IAAInC,IAAW;EAC3D,KAAK,IAAIM,IAAIC,IAAI,GAAGD,KAAK,GAAG,KAAQ,EAAIA,GAAGe,EAAS,GAAGiB,CAAM;EAC7D,KAAc;CAChB;CACA,OAAOC,EAAOsB,CAAU;AAC1B"}

package/dist/animation/rig/types.js

@@ -0,0 +1,12 @@
+//#region src/animation/rig/types.ts
+var e = {
+	x: 0,
+	y: 0,
+	rotation: 0,
+	scaleX: 1,
+	scaleY: 1
+};
+//#endregion
+export { e as IDENTITY_JOINT };
+
+//# sourceMappingURL=types.js.map

package/dist/animation/rig/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","names":["IDENTITY_JOINT"],"sources":["../../../src/animation/rig/types.ts"],"sourcesContent":["/** A joint's local transform. Deliberately NOT the scene's generic `TPose`:\n *  `TPose` is consumer-defined and may be a bare AABB with no rotation term,\n *  which a joint chain cannot compose through. */\nexport interface JointTransform {\n  x: number;\n  y: number;\n  /** Radians. */\n  rotation: number;\n  scaleX: number;\n  scaleY: number;\n}\n\n/** One joint of a `Skeleton`. */\nexport interface Joint {\n  name: string;\n  /** Parent joint name, or null for a root. */\n  parent: string | null;\n  /** Local transform at rest. */\n  bind: JointTransform;\n}\n\n/** Joints in topological order: every joint appears after its parent. */\nexport interface Skeleton {\n  joints: Joint[];\n}\n\n/** Local deltas from the bind pose, keyed by joint name. Absent joints and\n *  absent fields mean \"no change from bind\". */\nexport type Pose = Record<string, Partial<JointTransform>>;\n\n/** The transform that changes nothing: origin, no rotation, unit scale. */\nexport const IDENTITY_JOINT: JointTransform = {\n  x: 0, y: 0, rotation: 0, scaleX: 1, scaleY: 1,\n};\n"],"mappings":";AA+BA,IAAaA,IAAiC;CAC5C,GAAG;CAAG,GAAG;CAAG,UAAU;CAAG,QAAQ;CAAG,QAAQ;AAC9C"}

package/dist/animation/rig/useRig.js

@@ -0,0 +1,23 @@
+import { bindRig as e } from "./bindRig.js";
+import { useEffect as t, useMemo as n } from "react";
+//#region src/animation/rig/useRig.ts
+function r(r) {
+	let { scene: i, skeleton: a, bindings: o, apply: s, descriptor: c } = r, l = n(() => e({
+		scene: i,
+		skeleton: a,
+		bindings: o,
+		apply: s,
+		descriptor: c
+	}), [
+		i,
+		a,
+		o,
+		s,
+		c
+	]);
+	return t(() => () => l.release(), [l]), l;
+}
+//#endregion
+export { r as useRig };
+
+//# sourceMappingURL=useRig.js.map

package/dist/animation/rig/useRig.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useRig.js","names":["useRig","options","rig","useMemo","bindRig","scene","skeleton","bindings","apply","descriptor","useEffect"],"sources":["../../../src/animation/rig/useRig.ts"],"sourcesContent":["import { useEffect, useMemo } from 'react';\nimport { bindRig, type BindRigOptions, type Rig } from './bindRig';\n\n/**\n * A {@link Rig} bound for the component's lifetime, its overrides dropped on\n * unmount. Rebinds — re-reading every node's rest pose — whenever an option's\n * identity changes, so hoist or memoize `skeleton` and `bindings`.\n */\nexport function useRig<TPose>(options: BindRigOptions<TPose>): Rig {\n  const { scene, skeleton, bindings, apply, descriptor } = options;\n  const rig = useMemo(\n    () => bindRig({ scene, skeleton, bindings, apply, descriptor }),\n    [scene, skeleton, bindings, apply, descriptor],\n  );\n  useEffect(() => () => rig.release(), [rig]);\n  return rig;\n}\n"],"mappings":";;;AAQA,SAAgBA,EAAc,GAAqC;CACjE,IAAM,EAAE,UAAO,aAAU,aAAU,UAAO,kBAAeC,GACnDC,IAAMC,QACJC,EAAQ;EAAE;EAAO;EAAU;EAAU;EAAO;CAAW,CAAC,GAC9D;EAACC;EAAOC;EAAUC;EAAUC;EAAOC;CAAU,CAC/C;CAEA,OADAC,cAAsBR,EAAI,QAAQ,GAAG,CAACA,CAAG,CAAC,GACnCA;AACT"}

package/dist/animation/slew.js

@@ -0,0 +1,27 @@
+//#region src/animation/slew.ts
+function e(e, t) {
+	if (t === void 0) return Infinity;
+	if (!(t >= 0)) throw RangeError(`slew: ${e} must be a rate >= 0, got ${t}`);
+	return t;
+}
+function t(t, n, r, i) {
+	let a = e("rise", i.rise), o = e("fall", i.fall);
+	return n > t ? Math.min(n, t + a * r) : n < t ? Math.max(n, t - o * r) : t;
+}
+function n(n = {}) {
+	let r = {
+		rise: e("rise", n.rise),
+		fall: e("fall", n.fall)
+	}, i = n.value ?? 0, a = {
+		value: i,
+		target: n.target ?? i,
+		step(e) {
+			return a.value = t(a.value, a.target, e, r), a.value;
+		}
+	};
+	return a;
+}
+//#endregion
+export { n as createSlew, t as slewToward };
+
+//# sourceMappingURL=slew.js.map

package/dist/animation/slew.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"slew.js","names":["checkRate","rate","name","slewToward","rise","rates","fall","target","value","dt","createSlew","options","slew"],"sources":["../../src/animation/slew.ts"],"sourcesContent":["/** Most a slewed value may change per second, in its own units, in each\n *  direction. A direction left out is unlimited: the value jumps to a target\n *  on that side. `0` holds the value where it is. */\nexport interface SlewRates {\n  rise?: number;\n  fall?: number;\n}\n\nfunction checkRate(name: string, rate: number | undefined): number {\n  if (rate === undefined) return Infinity;\n  if (!(rate >= 0)) throw new RangeError(`slew: ${name} must be a rate >= 0, got ${rate}`);\n  return rate;\n}\n\n/**\n * One step of a slew limiter: `value` moved toward `target` by at most the\n * rate for that direction times `dt` seconds, landing on `target` rather than\n * passing it. A fast `rise` with a slow `fall` is an attack/release envelope.\n */\nexport function slewToward(value: number, target: number, dt: number, rates: SlewRates): number {\n  const rise = checkRate('rise', rates.rise);\n  const fall = checkRate('fall', rates.fall);\n  if (target > value) return Math.min(target, value + rise * dt);\n  if (target < value) return Math.max(target, value - fall * dt);\n  return value;\n}\n\n/** A value that follows `target` at limited rates. Both fields are writable:\n *  set `target` to steer it, or write `value` to jump it and let it slew on\n *  from there. Nothing moves until `step` is called. */\nexport interface Slew {\n  value: number;\n  target: number;\n  /** Advance `dt` seconds and return the new value. */\n  step(dt: number): number;\n}\n\n/** A stateful {@link slewToward}. `target` defaults to `value`, so a new slew\n *  is at rest. */\nexport function createSlew(options: SlewRates & { value?: number; target?: number } = {}): Slew {\n  const rates: SlewRates = { rise: checkRate('rise', options.rise), fall: checkRate('fall', options.fall) };\n  const value = options.value ?? 0;\n  const slew: Slew = {\n    value,\n    target: options.target ?? value,\n    step(dt) {\n      slew.value = slewToward(slew.value, slew.target, dt, rates);\n      return slew.value;\n    },\n  };\n  return slew;\n}\n"],"mappings":";AAQA,SAASA,EAAU,GAAc,GAAkC;CACjE,IAAIC,MAAS,KAAA,GAAW,OAAO;CAC/B,IAAI,EAAEA,KAAQ,IAAI,MAAU,WAAW,SAASC,EAAK,4BAA4BD,GAAM;CACvF,OAAOA;AACT;AAOA,SAAgBE,EAAW,GAAe,GAAgB,GAAY,GAA0B;CAC9F,IAAMC,IAAOJ,EAAU,QAAQK,EAAM,IAAI,GACnCC,IAAON,EAAU,QAAQK,EAAM,IAAI;CAGzC,OAFIE,IAASC,IAAc,KAAK,IAAID,GAAQC,IAAQJ,IAAOK,CAAE,IACzDF,IAASC,IAAc,KAAK,IAAID,GAAQC,IAAQF,IAAOG,CAAE,IACtDD;AACT;AAcA,SAAgBE,EAAW,IAA2D,CAAC,GAAS;CAC9F,IAAML,IAAmB;EAAE,MAAML,EAAU,QAAQW,EAAQ,IAAI;EAAG,MAAMX,EAAU,QAAQW,EAAQ,IAAI;CAAE,GAClGH,IAAQG,EAAQ,SAAS,GACzBC,IAAa;EACjB;EACA,QAAQD,EAAQ,UAAUH;EAC1B,KAAK,GAAI;GAEP,OADA,EAAK,QAAQL,EAAWS,EAAK,OAAOA,EAAK,QAAQH,GAAIJ,CAAK,GACnDO,EAAK;EACd;CACF;CACA,OAAOA;AACT"}

package/dist/animation/stagger.js

@@ -0,0 +1,138 @@
+import { springPose as e } from "./poseHelpers.js";
+//#region src/animation/stagger.ts
+var t = class {
+	timers;
+	supervisor;
+	id;
+	cancelled = !1;
+	paused_ = !1;
+	timeScale_ = 1;
+	children = [];
+	pending = [];
+	outstanding;
+	finished = !1;
+	constructor(e, t, n) {
+		this.timers = e, this.supervisor = t, this.id = t.id, this.outstanding = n, t.setOnCancel(() => this.handleSupervisorCancel());
+	}
+	handleSupervisorCancel() {
+		if (this.cancelled) return;
+		this.cancelled = !0;
+		for (let e of this.pending) e.timer != null && this.timers.clearTimer(e.timer);
+		this.pending = [];
+		let e = this.children.slice();
+		this.children = [];
+		for (let t of e) t.cancel();
+	}
+	noteChildDone() {
+		this.cancelled || this.finished || (--this.outstanding, this.outstanding <= 0 && (this.finished = !0, this.children = [], this.supervisor.finish()));
+	}
+	addChild(e) {
+		if (this.cancelled) {
+			e.cancel();
+			return;
+		}
+		this.children.push(e), this.paused_ && e.pause(), this.timeScale_ !== 1 && e.setTimeScale(this.timeScale_);
+	}
+	schedule(e, t) {
+		if (this.cancelled) return;
+		let n = {
+			timer: null,
+			resolvedAt: this.timers.now() + e,
+			fire: () => {},
+			remainingMs: e,
+			paused: !1
+		};
+		n.fire = () => {
+			if (this.cancelled) return;
+			let e = this.pending.indexOf(n);
+			e >= 0 && this.pending.splice(e, 1), t();
+		}, this.paused_ ? n.paused = !0 : n.timer = this.timers.setTimer(n.fire, e), this.pending.push(n);
+	}
+	cancel() {
+		this.supervisor.cancel();
+	}
+	pause() {
+		if (this.paused_) return;
+		this.paused_ = !0;
+		let e = this.timers.now();
+		for (let t of this.pending) t.timer != null && (t.remainingMs = Math.max(0, t.resolvedAt - e), this.timers.clearTimer(t.timer), t.timer = null, t.paused = !0);
+		for (let e of this.children) e.pause();
+	}
+	resume() {
+		if (!this.paused_) return;
+		this.paused_ = !1;
+		let e = this.timers.now();
+		for (let t of this.pending) t.paused &&= (t.resolvedAt = e + t.remainingMs, t.timer = this.timers.setTimer(t.fire, t.remainingMs), !1);
+		for (let e of this.children) e.resume();
+	}
+	setTimeScale(e) {
+		this.timeScale_ = e;
+		for (let t of this.children) t.setTimeScale(e);
+	}
+	timeScale() {
+		return this.timeScale_;
+	}
+	isPaused() {
+		return this.paused_;
+	}
+};
+function n(e, t) {
+	return typeof e == "function" ? e(t) : e * t;
+}
+function r(e, t, n, r, a, o, c, l) {
+	return c ? i(t, n, r, a, o, c, l) : s(e, t, n, r, a, o);
+}
+function i(e, r, i, a, o, s, c) {
+	let l = r({
+		kind: "stagger",
+		cancelKey: c?.cancelKey,
+		label: c?.label
+	}), u = new t(e, l, a.length);
+	return a.length === 0 ? (l.finish(), u) : (a.forEach((e, t) => {
+		let r = n(o, t), a = () => {
+			let n = s(e, t);
+			i(n.id, () => u.noteChildDone()), u.addChild(n);
+		};
+		r <= 0 ? a() : u.schedule(r, a);
+	}), u);
+}
+function a(e, t, n) {
+	return typeof e == "function" ? e(t, n) : e;
+}
+function o(e) {
+	if (typeof e == "object" && e && "id" in e) {
+		let t = e.id;
+		if (typeof t == "string") return t;
+	}
+	if (typeof e == "string" || typeof e == "number") return String(e);
+	throw Error("stagger().springPose: each item must either be a primitive (string/number) or have a string `id` field. Otherwise pose ids would collide.");
+}
+function s(t, n, r, s, c, l) {
+	return {
+		each: (e, t) => i(n, r, s, c, l, e, t),
+		tween: (e) => i(n, r, s, c, l, (n, r) => t.tween({
+			from: a(e.from, n, r),
+			to: a(e.to, n, r),
+			ms: a(e.ms, n, r),
+			easing: e.easing,
+			interpolate: e.interpolate,
+			onTick: (t) => e.onTick(t, n, r),
+			onDone: e.onDone ? () => e.onDone(n, r) : void 0
+		}), e),
+		springPose: (a, u, d = {}) => i(n, r, s, c, l, (n, r) => e(t, a, {
+			id: o(n),
+			to: u(n, r),
+			preset: d.preset,
+			stiffness: d.stiffness,
+			damping: d.damping,
+			mass: d.mass,
+			geometry: d.geometry,
+			recordOp: d.recordOp,
+			opLabel: d.opLabel
+		}), d)
+	};
+}
+//#endregion
+export { r as createStagger };
+
+//# sourceMappingURL=stagger.js.map

package/dist/animation/stagger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stagger.js","names":["CompositeHandle","timers","supervisor","totalItems","p","kids","c","h","entry","delayMs","idx","fire","now","s","delayFor","delay","i","createStagger","factory","runStagger","createSupervisor","watchCompletion","items","opts","makeBuilder","animator","composite","ms","child","item","resolvePerItem","v","itemId","id","springPose","adapter","poseFn"],"sources":["../../src/animation/stagger.ts"],"sourcesContent":["import { springPose } from './poseHelpers';\nimport type { Supervisor, SupervisorFactory, WatchCompletion } from './supervisor';\nimport type {\n  AnimationHandle,\n  Animator,\n  StaggerBuilder,\n  StaggerDelay,\n  StaggerFactory,\n  StaggerOptions,\n  StaggerPerItem,\n  StaggerSpringPoseOptions,\n  StaggerTweenOptions,\n} from './types';\nimport type { SceneAdapter } from 'core/adapters/types';\n\n/** Resolved timer-pair + clock, supplied by `useAnimator` so stagger picks\n *  up the same test-time injection points the rAF loop uses. `now` is used\n *  by pause/resume to freeze pending timers at their remaining time. */\nexport interface StaggerTimers {\n  setTimer: (cb: () => void, ms: number) => unknown;\n  clearTimer: (handle: unknown) => void;\n  now: () => number;\n}\n\ninterface PendingEntry {\n  /** Active host-scheduler timer handle, or null while paused. */\n  timer: unknown | null;\n  /** Absolute virtual-time at which the entry should fire. */\n  resolvedAt: number;\n  /** Wrapped callback (drops itself from `pending` before invoking the user fire). */\n  fire: () => void;\n  /** Remaining ms when paused; ignored while running. */\n  remainingMs: number;\n  /** True while the timer is suspended by `composite.pause()`. */\n  paused: boolean;\n}\n\n/**\n * Composite handle returned by `createStagger`. Owns a list of in-flight\n * child handles and a list of pending timer entries; cancel cancels both.\n * Pause/resume/setTimeScale propagate to in-flight children; pause/resume\n * also freeze and thaw pending per-item timers, preserving each entry's\n * remaining time across the pause.\n *\n * Registered with the animator via a supervisor so animator.cancel /\n * cancelKey / isActive all work for it.\n */\nclass CompositeHandle implements AnimationHandle {\n  readonly id: number;\n  private cancelled = false;\n  private paused_ = false;\n  private timeScale_ = 1;\n  private children: AnimationHandle[] = [];\n  private pending: PendingEntry[] = [];\n  private outstanding: number;\n  private finished = false;\n\n  constructor(\n    private timers: StaggerTimers,\n    private supervisor: Supervisor,\n    totalItems: number,\n  ) {\n    this.id = supervisor.id;\n    this.outstanding = totalItems;\n    supervisor.setOnCancel(() => this.handleSupervisorCancel());\n  }\n\n  /** Invoked when the supervisor is cancelled externally (animator.cancel /\n   *  cancelKey) OR via this composite's own `cancel`. */\n  private handleSupervisorCancel(): void {\n    if (this.cancelled) return;\n    this.cancelled = true;\n    for (const p of this.pending) {\n      if (p.timer != null) this.timers.clearTimer(p.timer);\n    }\n    this.pending = [];\n    // Snapshot children first: child.cancel() may synchronously invoke our\n    // own noteChildDone path via the animator's completion listener, which\n    // would mutate this.children mid-iteration.\n    const kids = this.children.slice();\n    this.children = [];\n    for (const c of kids) c.cancel();\n  }\n\n  noteChildDone(): void {\n    if (this.cancelled || this.finished) return;\n    this.outstanding -= 1;\n    if (this.outstanding <= 0) {\n      this.finished = true;\n      this.children = [];\n      this.supervisor.finish();\n    }\n  }\n\n  addChild(h: AnimationHandle): void {\n    if (this.cancelled) {\n      h.cancel();\n      return;\n    }\n    this.children.push(h);\n    if (this.paused_) h.pause();\n    if (this.timeScale_ !== 1) h.setTimeScale(this.timeScale_);\n  }\n\n  schedule(delayMs: number, fire: () => void): void {\n    if (this.cancelled) return;\n    const entry: PendingEntry = {\n      timer: null,\n      resolvedAt: this.timers.now() + delayMs,\n      fire: () => {},\n      remainingMs: delayMs,\n      paused: false,\n    };\n    entry.fire = (): void => {\n      if (this.cancelled) return;\n      const idx = this.pending.indexOf(entry);\n      if (idx >= 0) this.pending.splice(idx, 1);\n      fire();\n    };\n    if (this.paused_) {\n      entry.paused = true;\n    } else {\n      entry.timer = this.timers.setTimer(entry.fire, delayMs);\n    }\n    this.pending.push(entry);\n  }\n\n  cancel(): void {\n    // Route through the supervisor so the animator's id table is kept in\n    // sync. The supervisor's onCancel forwards back to\n    // handleSupervisorCancel which actually tears down children + timers.\n    this.supervisor.cancel();\n  }\n\n  pause(): void {\n    if (this.paused_) return;\n    this.paused_ = true;\n    const now = this.timers.now();\n    for (const p of this.pending) {\n      if (p.timer != null) {\n        p.remainingMs = Math.max(0, p.resolvedAt - now);\n        this.timers.clearTimer(p.timer);\n        p.timer = null;\n        p.paused = true;\n      }\n    }\n    for (const c of this.children) c.pause();\n  }\n\n  resume(): void {\n    if (!this.paused_) return;\n    this.paused_ = false;\n    const now = this.timers.now();\n    for (const p of this.pending) {\n      if (p.paused) {\n        p.resolvedAt = now + p.remainingMs;\n        p.timer = this.timers.setTimer(p.fire, p.remainingMs);\n        p.paused = false;\n      }\n    }\n    for (const c of this.children) c.resume();\n  }\n\n  setTimeScale(s: number): void {\n    this.timeScale_ = s;\n    for (const c of this.children) c.setTimeScale(s);\n  }\n\n  timeScale(): number {\n    return this.timeScale_;\n  }\n\n  isPaused(): boolean {\n    return this.paused_;\n  }\n}\n\nfunction delayFor(delay: StaggerDelay, i: number): number {\n  return typeof delay === 'function' ? delay(i) : delay * i;\n}\n\n/**\n * Stagger primitive. With `factory`, returns the composite handle directly.\n * Without `factory`, returns a `StaggerBuilder` whose `.each` runs the\n * stagger with a factory.\n */\nexport function createStagger<TItem>(\n  animator: Animator,\n  timers: StaggerTimers,\n  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n  factory: StaggerFactory<TItem>,\n  opts?: StaggerOptions,\n): AnimationHandle;\nexport function createStagger<TItem>(\n  animator: Animator,\n  timers: StaggerTimers,\n  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n): StaggerBuilder<TItem>;\nexport function createStagger<TItem>(\n  animator: Animator,\n  timers: StaggerTimers,\n  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n  factory?: StaggerFactory<TItem>,\n  opts?: StaggerOptions,\n): AnimationHandle | StaggerBuilder<TItem> {\n  if (factory) return runStagger(timers, createSupervisor, watchCompletion, items, delay, factory, opts);\n  return makeBuilder(animator, timers, createSupervisor, watchCompletion, items, delay);\n}\n\nfunction runStagger<TItem>(\n  timers: StaggerTimers,\n  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n  factory: StaggerFactory<TItem>,\n  opts?: StaggerOptions,\n): AnimationHandle {\n  const supervisor = createSupervisor({ kind: 'stagger', cancelKey: opts?.cancelKey, label: opts?.label });\n  const composite = new CompositeHandle(timers, supervisor, items.length);\n  if (items.length === 0) {\n    supervisor.finish();\n    return composite;\n  }\n  items.forEach((item, i) => {\n    const ms = delayFor(delay, i);\n    const fire = (): void => {\n      const child = factory(item, i);\n      // Hook into the child's deregistration (natural OR cancel). If the\n      // composite is already cancelled, the watcher fires immediately on\n      // cancel and the noteChildDone branch is a no-op (cancelled guard).\n      watchCompletion(child.id, () => composite.noteChildDone());\n      composite.addChild(child);\n    };\n    if (ms <= 0) fire();\n    else composite.schedule(ms, fire);\n  });\n  return composite;\n}\n\nfunction resolvePerItem<T, TItem>(\n  v: StaggerPerItem<T, TItem>,\n  item: TItem,\n  i: number,\n): T {\n  return typeof v === 'function'\n    ? (v as (item: TItem, index: number) => T)(item, i)\n    : v;\n}\n\nfunction itemId(item: unknown): string {\n  if (item != null && typeof item === 'object' && 'id' in item) {\n    const id = (item as { id: unknown }).id;\n    if (typeof id === 'string') return id;\n  }\n  if (typeof item === 'string' || typeof item === 'number') return String(item);\n  throw new Error(\n    'stagger().springPose: each item must either be a primitive (string/number) ' +\n      'or have a string `id` field. Otherwise pose ids would collide.',\n  );\n}\n\nfunction makeBuilder<TItem>(\n  animator: Animator,\n  timers: StaggerTimers,\n  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n): StaggerBuilder<TItem> {\n  return {\n    each: (factory, opts) =>\n      runStagger(timers, createSupervisor, watchCompletion, items, delay, factory, opts),\n    tween: <T,>(opts: StaggerTweenOptions<T, TItem>) =>\n      runStagger(timers, createSupervisor, watchCompletion, items, delay, (item, i) =>\n        animator.tween<T>({\n          from: resolvePerItem(opts.from, item, i),\n          to: resolvePerItem(opts.to, item, i),\n          ms: resolvePerItem(opts.ms, item, i),\n          easing: opts.easing,\n          interpolate: opts.interpolate,\n          onTick: (v) => opts.onTick(v, item, i),\n          onDone: opts.onDone ? () => opts.onDone!(item, i) : undefined,\n        }),\n        opts,\n      ),\n    springPose: <TPose,>(\n      adapter: SceneAdapter<{ id: string }, TPose>,\n      poseFn: (item: TItem, index: number) => TPose,\n      opts: StaggerSpringPoseOptions<TPose> = {},\n    ) =>\n      runStagger(timers, createSupervisor, watchCompletion, items, delay, (item, i) =>\n        springPose(animator, adapter, {\n          id: itemId(item),\n          to: poseFn(item, i),\n          preset: opts.preset,\n          stiffness: opts.stiffness,\n          damping: opts.damping,\n          mass: opts.mass,\n          geometry: opts.geometry,\n          recordOp: opts.recordOp,\n          opLabel: opts.opLabel,\n        }),\n        opts,\n      ),\n  };\n}\n"],"mappings":";;AA+CA,IAAMA,IAAN,MAAiD;CAWrC;CACA;CAXV;CACA,YAAoB;CACpB,UAAkB;CAClB,aAAqB;CACrB,WAAsC,CAAC;CACvC,UAAkC,CAAC;CACnC;CACA,WAAmB;CAEnB,YACE,GACA,GACA,GACA;EAGA,AANQ,KAAA,SAAAC,GACA,KAAA,aAAAC,GAGR,KAAK,KAAKA,EAAW,IACrB,KAAK,cAAcC,GACnBD,EAAW,kBAAkB,KAAK,uBAAuB,CAAC;CAC5D;CAIA,yBAAuC;EACrC,IAAI,KAAK,WAAW;EACpB,KAAK,YAAY;EACjB,KAAK,IAAME,KAAK,KAAK,SACnB,AAAIA,EAAE,SAAS,QAAM,KAAK,OAAO,WAAWA,EAAE,KAAK;EAErD,KAAK,UAAU,CAAC;EAIhB,IAAMC,IAAO,KAAK,SAAS,MAAM;EACjC,KAAK,WAAW,CAAC;EACjB,KAAK,IAAMC,KAAKD,GAAM,EAAE,OAAO;CACjC;CAEA,gBAAsB;EACpB,AAAI,KAAK,aAAa,KAAK,aAC3B,OAAK,aACD,KAAK,eAAe,MACtB,KAAK,WAAW,IAChB,KAAK,WAAW,CAAC,GACjB,KAAK,WAAW,OAAO;CAE3B;CAEA,SAAS,GAA0B;EACjC,IAAI,KAAK,WAAW;GAClB,EAAE,OAAO;GACT;EACF;EAGA,AAFA,KAAK,SAAS,KAAKE,CAAC,GAChB,KAAK,WAASA,EAAE,MAAM,GACtB,KAAK,eAAe,KAAGA,EAAE,aAAa,KAAK,UAAU;CAC3D;CAEA,SAAS,GAAiB,GAAwB;EAChD,IAAI,KAAK,WAAW;EACpB,IAAMC,IAAsB;GAC1B,OAAO;GACP,YAAY,KAAK,OAAO,IAAI,IAAIC;GAChC,YAAY,CAAC;GACb,aAAaA;GACb,QAAQ;EACV;EAYA,AAXA,EAAM,aAAmB;GACvB,IAAI,KAAK,WAAW;GACpB,IAAMC,IAAM,KAAK,QAAQ,QAAQF,CAAK;GAEtC,AADIE,KAAO,KAAG,KAAK,QAAQ,OAAOA,GAAK,CAAC,GACxCC,EAAK;EACP,GACI,KAAK,UACP,EAAM,SAAS,KAEf,EAAM,QAAQ,KAAK,OAAO,SAASH,EAAM,MAAMC,CAAO,GAExD,KAAK,QAAQ,KAAKD,CAAK;CACzB;CAEA,SAAe;EAIb,KAAK,WAAW,OAAO;CACzB;CAEA,QAAc;EACZ,IAAI,KAAK,SAAS;EAClB,KAAK,UAAU;EACf,IAAMI,IAAM,KAAK,OAAO,IAAI;EAC5B,KAAK,IAAMR,KAAK,KAAK,SACnB,AAAIA,EAAE,SAAS,SACb,EAAE,cAAc,KAAK,IAAI,GAAGA,EAAE,aAAaQ,CAAG,GAC9C,KAAK,OAAO,WAAWR,EAAE,KAAK,GAC9B,EAAE,QAAQ,MACV,EAAE,SAAS;EAGf,KAAK,IAAME,KAAK,KAAK,UAAU,EAAE,MAAM;CACzC;CAEA,SAAe;EACb,IAAI,CAAC,KAAK,SAAS;EACnB,KAAK,UAAU;EACf,IAAMM,IAAM,KAAK,OAAO,IAAI;EAC5B,KAAK,IAAMR,KAAK,KAAK,SACnB,AAGEA,EAAE,YAFF,EAAE,aAAaQ,IAAMR,EAAE,aACvB,EAAE,QAAQ,KAAK,OAAO,SAASA,EAAE,MAAMA,EAAE,WAAW,GACzC;EAGf,KAAK,IAAME,KAAK,KAAK,UAAU,EAAE,OAAO;CAC1C;CAEA,aAAa,GAAiB;EAC5B,KAAK,aAAaO;EAClB,KAAK,IAAMP,KAAK,KAAK,UAAU,EAAE,aAAaO,CAAC;CACjD;CAEA,YAAoB;EAClB,OAAO,KAAK;CACd;CAEA,WAAoB;EAClB,OAAO,KAAK;CACd;AACF;AAEA,SAASC,EAAS,GAAqB,GAAmB;CACxD,OAAO,OAAOC,KAAU,aAAaA,EAAMC,CAAC,IAAID,IAAQC;AAC1D;AAyBA,SAAgBC,EACd,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACyC;CAEzC,OADIC,IAAgBC,EAAWlB,GAAQmB,GAAkBC,GAAiBC,GAAOP,GAAOG,GAASK,CAAI,IAC9FC,EAAYC,GAAUxB,GAAQmB,GAAkBC,GAAiBC,GAAOP,CAAK;AACtF;AAEA,SAASI,EACP,GACA,GACA,GACA,GACA,GACA,GACA,GACiB;CACjB,IAAMjB,IAAakB,EAAiB;EAAE,MAAM;EAAW,WAAWG,GAAM;EAAW,OAAOA,GAAM;CAAM,CAAC,GACjGG,IAAY,IAAI1B,EAAgBC,GAAQC,GAAYoB,EAAM,MAAM;CAkBtE,OAjBIA,EAAM,WAAW,KACnBpB,EAAW,OAAO,GACXwB,MAETJ,EAAM,SAAS,GAAM,MAAM;EACzB,IAAMK,IAAKb,EAASC,GAAOC,CAAC,GACtBL,UAAmB;GACvB,IAAMiB,IAAQV,EAAQW,GAAMb,CAAC;GAK7B,AADAK,EAAgBO,EAAM,UAAUF,EAAU,cAAc,CAAC,GACzDA,EAAU,SAASE,CAAK;EAC1B;EACA,AAAID,KAAM,IAAGhB,EAAK,IACbe,EAAU,SAASC,GAAIhB,CAAI;CAClC,CAAC,GACMe;AACT;AAEA,SAASI,EACP,GACA,GACA,GACG;CACH,OAAO,OAAOC,KAAM,aACfA,EAAwCF,GAAMb,CAAC,IAChDe;AACN;AAEA,SAASC,EAAO,GAAuB;CACrC,IAAoB,OAAOH,KAAS,YAAhCA,KAA4C,QAAQA,GAAM;EAC5D,IAAMI,IAAMJ,EAAyB;EACrC,IAAI,OAAOI,KAAO,UAAU,OAAOA;CACrC;CACA,IAAI,OAAOJ,KAAS,YAAY,OAAOA,KAAS,UAAU,OAAO,OAAOA,CAAI;CAC5E,MAAU,MACR,2IAEF;AACF;AAEA,SAASL,EACP,GACA,GACA,GACA,GACA,GACA,GACuB;CACvB,OAAO;EACL,OAAO,GAAS,MACdL,EAAWlB,GAAQmB,GAAkBC,GAAiBC,GAAOP,GAAOG,GAASK,CAAI;EACnF,QAAY,MACVJ,EAAWlB,GAAQmB,GAAkBC,GAAiBC,GAAOP,IAAQ,GAAM,MACzEU,EAAS,MAAS;GAChB,MAAMK,EAAeP,EAAK,MAAMM,GAAMb,CAAC;GACvC,IAAIc,EAAeP,EAAK,IAAIM,GAAMb,CAAC;GACnC,IAAIc,EAAeP,EAAK,IAAIM,GAAMb,CAAC;GACnC,QAAQO,EAAK;GACb,aAAaA,EAAK;GAClB,SAAS,MAAMA,EAAK,OAAOQ,GAAGF,GAAMb,CAAC;GACrC,QAAQO,EAAK,eAAeA,EAAK,OAAQM,GAAMb,CAAC,IAAI,KAAA;EACtD,CAAC,GACDO,CACF;EACF,aACE,GACA,GACA,IAAwC,CAAC,MAEzCJ,EAAWlB,GAAQmB,GAAkBC,GAAiBC,GAAOP,IAAQ,GAAM,MACzEmB,EAAWT,GAAUU,GAAS;GAC5B,IAAIH,EAAOH,CAAI;GACf,IAAIO,EAAOP,GAAMb,CAAC;GAClB,QAAQO,EAAK;GACb,WAAWA,EAAK;GAChB,SAASA,EAAK;GACd,MAAMA,EAAK;GACX,UAAUA,EAAK;GACf,UAAUA,EAAK;GACf,SAASA,EAAK;EAChB,CAAC,GACDA,CACF;CACJ;AACF"}

package/dist/animation/timeline/booking.js

@@ -0,0 +1,106 @@
+function e(e, t) {
+	let n = 0, r = e.length;
+	for (; n < r;) {
+		let i = n + r >> 1;
+		e[i].t > t ? r = i : n = i + 1;
+	}
+	return n;
+}
+var t = (e, t) => e.lap > t.lap || e.lap === t.lap && e.r > t.r;
+function n(n, r) {
+	let i = n.lookahead ?? 100, a = n.maxLate ?? Infinity, o = /* @__PURE__ */ new Map(), s = {
+		lap: 0,
+		r: -Infinity
+	}, c = [], l = null, u = 0, d = 0, f = () => ({
+		lap: r.lap(),
+		r: r.playhead()
+	}), p = (e) => (e.lap - r.lap()) * r.duration() + e.r, m = (e) => t(e, f()), h = (e, n) => {
+		c = c.filter((t) => {
+			if (!t.handle || t.when <= e || !m(t) || !n(t)) return !0;
+			try {
+				t.handle.stop();
+			} catch (e) {
+				console.error("timeline: booking stop threw", e);
+			}
+			return !1;
+		});
+		let r = f();
+		for (let [e, n] of o) t(n, r) && o.set(e, r);
+		t(s, r) && (s = r);
+	}, g = (e, t, n, r) => Math.max(l + (e - t) / n, r), _ = (t, n, i, l, u, d) => {
+		let f = r.lap(), p = r.duration(), m = r.playhead(), { events: h } = t, _ = o.get(t) ?? s;
+		for (;;) {
+			let t = (_.lap - f) * p;
+			if (t > i) break;
+			let r = e(h, _.r - n);
+			if (r >= h.length || n + h[r].t > p) {
+				if (_.lap >= l) break;
+				_ = {
+					lap: Math.max(_.lap + 1, f),
+					r: -Infinity
+				};
+				continue;
+			}
+			let o = n + h[r].t, s = t + o;
+			if (s > i) break;
+			_ = {
+				lap: _.lap,
+				r: o
+			};
+			for (let e = r; e < h.length && h[e].t === h[r].t; e += 1) {
+				let t = h[e];
+				if (!t.book || c.some((e) => e.event === t && e.lap === _.lap) || (m - s) / d > a) continue;
+				let n = g(s, m, d, u), r;
+				try {
+					r = t.book(n) ?? void 0;
+				} catch (e) {
+					console.error("timeline: book threw", e);
+				}
+				c.push({
+					event: t,
+					lap: _.lap,
+					r: o,
+					when: n,
+					handle: r
+				});
+			}
+		}
+		o.set(t, _);
+	}, v = (e, t, n, r, i, a) => {
+		for (let o of e) o.kind === "event" ? _(o, t, n, r, i, a) : o.kind === "timeline" && v(o.timeline.tracks, t + o.at, n, r, i, a);
+	};
+	return {
+		tick(e, t) {
+			let a = n.clock.now();
+			if (c = c.filter(m), !(t > 0)) {
+				d > 0 && h(a, () => !0), d = 0, l = null;
+				return;
+			}
+			let o = d > 0 && t !== d;
+			if (l === null) l = a;
+			else {
+				l += (e - u) / t;
+				let n = a - l;
+				Math.abs(n) > 50 ? (l = a, o = !0) : l += n * .05;
+			}
+			u = e, d = t;
+			let s = r.playhead();
+			o && h(a, (e) => Math.abs(g(p(e), s, t, a) - e.when) > 1);
+			let f = r.duration(), _ = r.lap() + (f > 0 ? r.lapsLeft() : 0);
+			v(r.tracks, 0, s + i * t, _, a, t);
+		},
+		retract() {
+			h(n.clock.now(), () => !0);
+		},
+		seek() {
+			c = [], o.clear(), s = f();
+		},
+		rearm() {
+			l = null;
+		}
+	};
+}
+//#endregion
+export { n as createBooker, e as firstAfter };
+
+//# sourceMappingURL=booking.js.map

package/dist/animation/timeline/booking.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"booking.js","names":["firstAfter","lo","hi","events","mid","isAfter","a","b","createBooker","lookahead","opts","maxLate","cursors","start","bookings","est","mapVirtual","lastScale","playheadCursor","host","unwrapped","ahead","stopWhere","now","pred","err","at","track","c","whenFor","u","playhead","scale","scanTrack","lap","duration","lapStart","horizon","i","lastLap","r","j","ev","when","handle","visit","tracks","moved","virtualNow","residual"],"sources":["../../../src/animation/timeline/booking.ts"],"sourcesContent":["import type { EventBooking, EventBookingHandle, EventTrack, TimelineEvent, Track } from './types';\n\n/** A clock read further than this from the frame clock's prediction is taken\n *  as a discontinuity — a hidden tab, a suspended context — not as jitter. */\nconst RESYNC_MS = 50;\n/** Share of each frame's clock residual folded into the estimate. Small enough\n *  to average out a per-frame read that lands a render quantum early or late;\n *  large enough to follow ppm-scale drift with well under a millisecond of lag. */\nconst SLEW = 0.05;\n/** A pending booking a rate change or resync moves by more than this is\n *  retracted and booked again; anything less is left standing. */\nconst RETIME_MS = 1;\n\n/** Index of the first event after `t`. Binary search: tracks may be long. */\nexport function firstAfter(events: EventTrack['events'], t: number): number {\n  let lo = 0;\n  let hi = events.length;\n  while (lo < hi) {\n    const mid = (lo + hi) >> 1;\n    if (events[mid].t > t) hi = mid; else lo = mid + 1;\n  }\n  return lo;\n}\n\n/** The timeline state a booker reads. `lap` counts wraps since creation and is\n *  never reset, so a (lap, root time) pair names one crossing for good. */\nexport interface BookerHost {\n  tracks: Track[];\n  duration(): number;\n  /** Laps still allowed after the current one; `Infinity` when endless. */\n  lapsLeft(): number;\n  lap(): number;\n  playhead(): number;\n}\n\nexport interface Booker {\n  /** After the frame's wraps and crossings. `scale` is the effective one this\n   *  frame's virtual time advanced at, zero while paused. */\n  tick(virtualNow: number, scale: number): void;\n  /** Stop every booking still ahead of both the playhead and the clock, and\n   *  let the next tick book that span again. */\n  retract(): void;\n  /** After the playhead jumped. Call `retract` first, while it still reads the\n   *  old playhead. */\n  seek(): void;\n  /** After the animator restarted the timeline's virtual clock at zero. */\n  rearm(): void;\n}\n\n/** Every event at root time `<= r` in lap `lap` has been taken. */\ninterface Cursor { lap: number; r: number }\n\ninterface Booking {\n  event: TimelineEvent;\n  lap: number;\n  r: number;\n  when: number;\n  handle?: EventBookingHandle;\n}\n\nconst isAfter = (a: Cursor, b: Cursor): boolean => a.lap > b.lap || (a.lap === b.lap && a.r > b.r);\n\nexport function createBooker(opts: EventBooking, host: BookerHost): Booker {\n  const lookahead = opts.lookahead ?? 100;\n  const maxLate = opts.maxLate ?? Infinity;\n  const cursors = new Map<EventTrack, Cursor>();\n  let start: Cursor = { lap: 0, r: -Infinity };\n  let bookings: Booking[] = [];\n  /** Clock time of the current frame, smoothed. Null until anchored. */\n  let est: number | null = null;\n  let mapVirtual = 0;\n  let lastScale = 0;\n\n  const playheadCursor = (): Cursor => ({ lap: host.lap(), r: host.playhead() });\n\n  const unwrapped = (b: { lap: number; r: number }): number =>\n    (b.lap - host.lap()) * host.duration() + b.r;\n\n  const ahead = (b: Booking): boolean => isAfter(b, playheadCursor());\n\n  const stopWhere = (now: number, pred: (b: Booking) => boolean): void => {\n    bookings = bookings.filter((b) => {\n      if (!b.handle || b.when <= now || !ahead(b) || !pred(b)) return true;\n      try { b.handle.stop(); } catch (err) { console.error('timeline: booking stop threw', err); }\n      return false;\n    });\n    // Back to the playhead, not to each retracted booking: whatever still\n    // stands is skipped by identity, and an edit may have added events behind\n    // the cursor that only a rescan finds.\n    const at = playheadCursor();\n    for (const [track, c] of cursors) if (isAfter(c, at)) cursors.set(track, at);\n    if (isAfter(start, at)) start = at;\n  };\n\n  const whenFor = (u: number, playhead: number, scale: number, now: number): number =>\n    Math.max(est! + (u - playhead) / scale, now);\n\n  const scanTrack = (\n    track: EventTrack, at: number, horizon: number, lastLap: number, now: number, scale: number,\n  ): void => {\n    const lap = host.lap();\n    const duration = host.duration();\n    const playhead = host.playhead();\n    const { events } = track;\n    let c = cursors.get(track) ?? start;\n    for (;;) {\n      const lapStart = (c.lap - lap) * duration;\n      if (lapStart > horizon) break;\n      const i = firstAfter(events, c.r - at);\n      if (i >= events.length || at + events[i].t > duration) {\n        if (c.lap >= lastLap) break;\n        // A frame that skipped whole laps books the outgoing lap's tail and\n        // nothing of the laps in between, as crossings do.\n        c = { lap: Math.max(c.lap + 1, lap), r: -Infinity };\n        continue;\n      }\n      const r = at + events[i].t;\n      const u = lapStart + r;\n      if (u > horizon) break;\n      c = { lap: c.lap, r };\n      for (let j = i; j < events.length && events[j].t === events[i].t; j += 1) {\n        const ev = events[j];\n        if (!ev.book || bookings.some((b) => b.event === ev && b.lap === c.lap)) continue;\n        if ((playhead - u) / scale > maxLate) continue;\n        const when = whenFor(u, playhead, scale, now);\n        let handle: EventBookingHandle | undefined;\n        try {\n          handle = ev.book(when) ?? undefined;\n        } catch (err) {\n          console.error('timeline: book threw', err);\n        }\n        bookings.push({ event: ev, lap: c.lap, r, when, handle });\n      }\n    }\n    cursors.set(track, c);\n  };\n\n  const visit = (\n    tracks: Track[], at: number, horizon: number, lastLap: number, now: number, scale: number,\n  ): void => {\n    for (const track of tracks) {\n      if (track.kind === 'event') scanTrack(track, at, horizon, lastLap, now, scale);\n      else if (track.kind === 'timeline') {\n        visit(track.timeline.tracks, at + track.at, horizon, lastLap, now, scale);\n      }\n    }\n  };\n\n  return {\n    tick(virtualNow, scale) {\n      const now = opts.clock.now();\n      bookings = bookings.filter(ahead);\n      if (!(scale > 0)) {\n        if (lastScale > 0) stopWhere(now, () => true);\n        lastScale = 0;\n        est = null;\n        return;\n      }\n\n      let moved = lastScale > 0 && scale !== lastScale;\n      if (est === null) {\n        est = now;\n      } else {\n        est += (virtualNow - mapVirtual) / scale;\n        const residual = now - est;\n        if (Math.abs(residual) > RESYNC_MS) {\n          est = now;\n          moved = true;\n        } else {\n          est += residual * SLEW;\n        }\n      }\n      mapVirtual = virtualNow;\n      lastScale = scale;\n\n      const playhead = host.playhead();\n      if (moved) {\n        stopWhere(now, (b) => Math.abs(whenFor(unwrapped(b), playhead, scale, now) - b.when) > RETIME_MS);\n      }\n\n      const duration = host.duration();\n      const lastLap = host.lap() + (duration > 0 ? host.lapsLeft() : 0);\n      visit(host.tracks, 0, playhead + lookahead * scale, lastLap, now, scale);\n    },\n    retract() {\n      stopWhere(opts.clock.now(), () => true);\n    },\n    seek() {\n      bookings = [];\n      cursors.clear();\n      start = playheadCursor();\n    },\n    rearm() {\n      est = null;\n    },\n  };\n}\n"],"mappings":"AAcA,SAAgBA,EAAW,GAA8B,GAAmB;CAC1E,IAAIC,IAAK,GACLC,IAAKC,EAAO;CAChB,OAAOF,IAAKC,IAAI;EACd,IAAME,IAAOH,IAAKC,KAAO;EACzB,AAAIC,EAAOC,EAAI,CAAC,IAAI,IAAG,IAAKA,IAAU,IAAKA,IAAM;CACnD;CACA,OAAOH;AACT;AAsCA,IAAMI,KAAW,GAAW,MAAuBC,EAAE,MAAMC,EAAE,OAAQD,EAAE,QAAQC,EAAE,OAAOD,EAAE,IAAIC,EAAE;AAEhG,SAAgBC,EAAa,GAAoB,GAA0B;CACzE,IAAMC,IAAYC,EAAK,aAAa,KAC9BC,IAAUD,EAAK,WAAW,UAC1BE,oBAAU,IAAI,IAAwB,GACxCC,IAAgB;EAAE,KAAK;EAAG,GAAG;CAAU,GACvCC,IAAsB,CAAC,GAEvBC,IAAqB,MACrBC,IAAa,GACbC,IAAY,GAEVC,WAAgC;EAAE,KAAKC,EAAK,IAAI;EAAG,GAAGA,EAAK,SAAS;CAAE,IAEtEC,KAAa,OAChBb,EAAE,MAAMY,EAAK,IAAI,KAAKA,EAAK,SAAS,IAAIZ,EAAE,GAEvCc,KAAS,MAAwBhB,EAAQE,GAAGW,EAAe,CAAC,GAE5DI,KAAa,GAAa,MAAwC;EACtE,IAAWR,EAAS,QAAQ,MAAM;GAChC,IAAI,CAACP,EAAE,UAAUA,EAAE,QAAQgB,KAAO,CAACF,EAAMd,CAAC,KAAK,CAACiB,EAAKjB,CAAC,GAAG,OAAO;GAChE,IAAI;IAAE,EAAE,OAAO,KAAK;GAAG,SAASkB,GAAK;IAAE,QAAQ,MAAM,gCAAgCA,CAAG;GAAG;GAC3F,OAAO;EACT,CAAC;EAID,IAAMC,IAAKR,EAAe;EAC1B,KAAK,IAAM,CAACS,GAAOC,MAAMhB,GAAS,AAAIP,EAAQuB,GAAGF,CAAE,KAAGd,EAAQ,IAAIe,GAAOD,CAAE;EAC3E,AAAIrB,EAAQQ,GAAOa,CAAE,MAAG,IAAQA;CAClC,GAEMG,KAAW,GAAW,GAAkB,GAAe,MAC3D,KAAK,IAAId,KAAQe,IAAIC,KAAYC,GAAOT,CAAG,GAEvCU,KACJ,GAAmB,GAAY,GAAiB,GAAiB,GAAa,MACrE;EACT,IAAMC,IAAMf,EAAK,IAAI,GACfgB,IAAWhB,EAAK,SAAS,GACzBY,IAAWZ,EAAK,SAAS,GACzB,EAAE,cAAWQ,GACfC,IAAIhB,EAAQ,IAAIe,CAAK,KAAKd;EAC9B,SAAS;GACP,IAAMuB,KAAYR,EAAE,MAAMM,KAAOC;GACjC,IAAIC,IAAWC,GAAS;GACxB,IAAMC,IAAItC,EAAWG,GAAQyB,EAAE,IAAIF,CAAE;GACrC,IAAIY,KAAKnC,EAAO,UAAUuB,IAAKvB,EAAOmC,EAAE,CAAC,IAAIH,GAAU;IACrD,IAAIP,EAAE,OAAOW,GAAS;IAGtB,IAAI;KAAE,KAAK,KAAK,IAAIX,EAAE,MAAM,GAAGM,CAAG;KAAG,GAAG;IAAU;IAClD;GACF;GACA,IAAMM,IAAId,IAAKvB,EAAOmC,EAAE,CAAC,GACnBR,IAAIM,IAAWI;GACrB,IAAIV,IAAIO,GAAS;GACjB,IAAI;IAAE,KAAKT,EAAE;IAAK;GAAE;GACpB,KAAK,IAAIa,IAAIH,GAAGG,IAAItC,EAAO,UAAUA,EAAOsC,EAAE,CAAC,MAAMtC,EAAOmC,EAAE,CAAC,GAAG,KAAK,GAAG;IACxE,IAAMI,IAAKvC,EAAOsC;IAElB,IADI,CAACC,EAAG,QAAQ5B,EAAS,MAAM,MAAMP,EAAE,UAAUmC,KAAMnC,EAAE,QAAQqB,EAAE,GAAG,MACjEG,IAAWD,KAAKE,IAAQrB,GAAS;IACtC,IAAMgC,IAAOd,EAAQC,GAAGC,GAAUC,GAAOT,CAAG,GACxCqB;IACJ,IAAI;KACF,IAASF,EAAG,KAAKC,CAAI,KAAK,KAAA;IAC5B,SAASlB,GAAK;KACZ,QAAQ,MAAM,wBAAwBA,CAAG;IAC3C;IACA,EAAS,KAAK;KAAE,OAAOiB;KAAI,KAAKd,EAAE;KAAK;KAAG;KAAM;IAAO,CAAC;GAC1D;EACF;EACA,EAAQ,IAAID,GAAOC,CAAC;CACtB,GAEMiB,KACJ,GAAiB,GAAY,GAAiB,GAAiB,GAAa,MACnE;EACT,KAAK,IAAMlB,KAASmB,GAClB,AAAInB,EAAM,SAAS,UAASM,EAAUN,GAAOD,GAAIW,GAASE,GAAShB,GAAKS,CAAK,IACpEL,EAAM,SAAS,cACtBkB,EAAMlB,EAAM,SAAS,QAAQD,IAAKC,EAAM,IAAIU,GAASE,GAAShB,GAAKS,CAAK;CAG9E;CAEA,OAAO;EACL,KAAK,GAAY,GAAO;GACtB,IAAMT,IAAMb,EAAK,MAAM,IAAI;GAE3B,IADA,IAAWI,EAAS,OAAOO,CAAK,GAC5B,EAAEW,IAAQ,IAAI;IAGhB,AAFIf,IAAY,KAAGK,EAAUC,SAAW,EAAI,GAC5C,IAAY,GACZ,IAAM;IACN;GACF;GAEA,IAAIwB,IAAQ9B,IAAY,KAAKe,MAAUf;GACvC,IAAIF,MAAQ,MACV,IAAMQ;QACD;IACL,MAAQyB,IAAahC,KAAcgB;IACnC,IAAMiB,IAAW1B,IAAMR;IACvB,AAAI,KAAK,IAAIkC,CAAQ,IAAI,MACvB,IAAM1B,GACN,IAAQ,MAER,KAAO0B,IAAW;GAEtB;GAEA,AADA,IAAaD,GACb,IAAYhB;GAEZ,IAAMD,IAAWZ,EAAK,SAAS;GAC/B,AAAI4B,KACFzB,EAAUC,IAAM,MAAM,KAAK,IAAIM,EAAQT,EAAUb,CAAC,GAAGwB,GAAUC,GAAOT,CAAG,IAAIhB,EAAE,IAAI,IAAI,CAAS;GAGlG,IAAM4B,IAAWhB,EAAK,SAAS,GACzBoB,IAAUpB,EAAK,IAAI,KAAKgB,IAAW,IAAIhB,EAAK,SAAS,IAAI;GAC/D,EAAMA,EAAK,QAAQ,GAAGY,IAAWtB,IAAYuB,GAAOO,GAAShB,GAAKS,CAAK;EACzE;EACA,UAAU;GACR,EAAUtB,EAAK,MAAM,IAAI,SAAS,EAAI;EACxC;EACA,OAAO;GAGL,AAFA,IAAW,CAAC,GACZE,EAAQ,MAAM,GACd,IAAQM,EAAe;EACzB;EACA,QAAQ;GACN,IAAM;EACR;CACF;AACF"}

package/dist/animation/timeline/createTimeline.js

@@ -0,0 +1,116 @@
+import { createBooker as e, firstAfter as t } from "./booking.js";
+import { sampleTrack as n } from "./sampleTrack.js";
+//#region src/animation/timeline/createTimeline.ts
+function r(e) {
+	switch (e.kind) {
+		case "sampled": return e.keys.length ? e.keys[e.keys.length - 1].t : 0;
+		case "event": return e.events.length ? e.events[e.events.length - 1].t : 0;
+		case "timeline": return e.at + i(e.timeline.tracks, e.timeline.duration);
+	}
+}
+function i(e, t) {
+	if (t != null) return t;
+	let n = 0;
+	for (let t of e) n = Math.max(n, r(t));
+	return n;
+}
+function a(r, a, o, s) {
+	let c = i(o.tracks, o.duration), l = 0, u = 0, d = 0, f = -Infinity, p = !1, m = !0, h = !1, g = o.autoplay === !1, _ = 1, v = /* @__PURE__ */ new Set(), y = o.loop ?? !1, b = y === !0 ? Infinity : y === !1 ? 0 : y, x = 0, S = o.booking ? e(o.booking, {
+		tracks: o.tracks,
+		duration: () => c,
+		lapsLeft: () => b,
+		lap: () => x,
+		playhead: () => d
+	}) : null, C = !1, w = /* @__PURE__ */ new WeakMap(), T = (e) => {
+		let t = w.get(e);
+		return t || (t = /* @__PURE__ */ new Map(), w.set(e, t)), t;
+	}, E = (e, t) => {
+		for (let r of e) if (r.kind === "sampled") {
+			let e = r, i = n(e, t, T(e));
+			i !== void 0 && e.onTick(i);
+		} else r.kind === "timeline" && E(r.timeline.tracks, t - r.at);
+	}, D = [], O = (e, n, r) => {
+		for (let i = 0; i < e.length; i += 1) {
+			let a = e[i];
+			if (a.kind === "event") {
+				let e = t(a.events, r);
+				for (let o = t(a.events, n); o < e; o += 1) {
+					let e = a.events[o];
+					e.fire?.(r - e.t), s?.watched && (D.push(i), s.fire(a, D, e, r - e.t), D.pop()), e.book && !S && !C && (C = !0, console.warn("timeline: an event has `book` but the timeline has no `booking` clock; it never books."));
+				}
+			} else a.kind === "timeline" && (D.push(i), O(a.timeline.tracks, n - a.at, r - a.at), D.pop());
+		}
+	}, k = () => {
+		O(o.tracks, f, c), f = -Infinity, s?.watched && s.lap(x);
+	}, A = (e, t) => {
+		if (u = e, d = e + l, c > 0 && d >= c) {
+			if (b === Infinity) {
+				let e = Math.floor(d / c);
+				l -= e * c, d -= e * c, x += e, k();
+			} else for (; d >= c && b > 0;) --b, l -= c, d -= c, x += 1, k();
+		}
+		let n = d >= c;
+		return d = Math.min(d, c), E(o.tracks, d), O(o.tracks, f, d), f = d, S?.tick(e, t ?? (N.isPaused() ? 0 : N.timeScale())), n && !p && (p = !0, o.onDone?.()), d < c ? !1 : (m = !1, !0);
+	}, j = () => {
+		h = !0, m = !1, S?.retract();
+	}, M = {
+		id: a,
+		cancelKey: o.cancelKey,
+		tick: A,
+		onCancel: j,
+		kind: "timeline",
+		label: o.label,
+		progress: () => c > 0 ? d / c : 1
+	}, N = r(M);
+	o.autoplay === !1 && N.pause();
+	let P = () => {
+		h || d >= c || (p = !1, !m && (S?.rearm(), u = 0, l = d, m = !0, r({
+			...M,
+			keepExisting: !0
+		}), g && N.pause(), N.setTimeScale(_)));
+	};
+	return {
+		...N,
+		cancel() {
+			j(), N.cancel();
+		},
+		pause() {
+			g = !0, N.pause(), S?.retract();
+		},
+		resume() {
+			g = !1, N.resume();
+		},
+		setTimeScale(e) {
+			_ = e, N.setTimeScale(e);
+		},
+		timeScale: () => m ? N.timeScale() : _,
+		isPaused: () => m ? N.isPaused() : g,
+		seek(e) {
+			S?.retract(), l = e - u, d = e, f = e, S?.seek(), P();
+		},
+		time: () => d,
+		duration: () => c,
+		tracks: () => o.tracks,
+		setLoop(e) {
+			b = e === !0 ? Infinity : e === !1 ? 0 : e, S?.retract();
+		},
+		loop: () => b === Infinity || b !== 0 && b,
+		edit(e) {
+			e(), w = /* @__PURE__ */ new WeakMap(), c = i(o.tracks, o.duration), S?.retract(), P();
+			for (let e of v) try {
+				e();
+			} catch (e) {
+				console.error("timeline: subscriber threw", e);
+			}
+		},
+		subscribe(e) {
+			return v.add(e), () => {
+				v.delete(e);
+			};
+		}
+	};
+}
+//#endregion
+export { a as createTimeline };
+
+//# sourceMappingURL=createTimeline.js.map