@weasel-js/core 1.9.4 → 1.10.1

package/dist/animation/rig/mirrorPose.js

@@ -1,19 +0,0 @@
-//#region src/animation/rig/mirrorPose.ts
-function e(e, t) {
-	let n = {}, r = /* @__PURE__ */ new Map();
-	for (let t of e.joints) r.set(t.name, t.bind);
-	let i = /* @__PURE__ */ new Set([...r.keys(), ...Object.keys(t)]);
-	for (let e of i) {
-		let i = r.get(e), a = t[e];
-		n[e] = {
-			...a,
-			x: -2 * (i?.x ?? 0) - (a?.x ?? 0),
-			rotation: -2 * (i?.rotation ?? 0) - (a?.rotation ?? 0)
-		};
-	}
-	return n;
-}
-//#endregion
-export { e as mirrorPose };
-
-//# sourceMappingURL=mirrorPose.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"mirrorPose.js","names":["mirrorPose","out","binds","joint","skeleton","names","pose","name","bind","d"],"sources":["../../../src/animation/rig/mirrorPose.ts"],"sourcesContent":["import type { JointTransform, Pose, Skeleton } from './types';\n\n/**\n * `pose` reflected across the rig's y axis, as deltas against the same\n * skeleton — so the mirrored pose still blends, samples and resolves like any\n * other.\n *\n * Reflecting a joint chain is conjugation: every local transform `T·R·S`\n * becomes `F·T·R·S·F` with `F` the flip, which is again a plain transform\n * with `x` and `rotation` negated. Every resolved joint is then exactly the\n * original's reflection, which is how a rig faces the other way without a\n * negative scale anywhere — a scene pose such as `RectPose` has no term to\n * carry one. The negation applies to bind plus delta, so the delta for a\n * joint the pose leaves at its bind is nonzero whenever the bind is.\n *\n * Applying it twice gives the original pose back.\n */\nexport function mirrorPose(skeleton: Skeleton, pose: Pose): Pose {\n  const out: Pose = {};\n  const binds = new Map<string, JointTransform>();\n  for (const joint of skeleton.joints) binds.set(joint.name, joint.bind);\n  const names = new Set([...binds.keys(), ...Object.keys(pose)]);\n  for (const name of names) {\n    const bind = binds.get(name);\n    const d = pose[name];\n    out[name] = {\n      ...d,\n      x: -2 * (bind?.x ?? 0) - (d?.x ?? 0),\n      rotation: -2 * (bind?.rotation ?? 0) - (d?.rotation ?? 0),\n    };\n  }\n  return out;\n}\n"],"mappings":";AAiBA,SAAgBA,EAAW,GAAoB,GAAkB;CAC/D,IAAMC,IAAY,CAAC,GACbC,oBAAQ,IAAI,IAA4B;CAC9C,KAAK,IAAMC,KAASC,EAAS,QAAQ,EAAM,IAAID,EAAM,MAAMA,EAAM,IAAI;CACrE,IAAME,oBAAQ,IAAI,IAAI,CAAC,GAAGH,EAAM,KAAK,GAAG,GAAG,OAAO,KAAKI,CAAI,CAAC,CAAC;CAC7D,KAAK,IAAMC,KAAQF,GAAO;EACxB,IAAMG,IAAON,EAAM,IAAIK,CAAI,GACrBE,IAAIH,EAAKC;EACf,EAAIA,KAAQ;GACV,GAAGE;GACH,GAAG,MAAMD,GAAM,KAAK,MAAMC,GAAG,KAAK;GAClC,UAAU,MAAMD,GAAM,YAAY,MAAMC,GAAG,YAAY;EACzD;CACF;CACA,OAAOR;AACT"}

package/dist/animation/rig/resolveSkeleton.js

@@ -1,33 +0,0 @@
-import { mat3 as e } from "../../renderer/math/mat3.js";
-//#region src/animation/rig/resolveSkeleton.ts
-function t(e, t) {
-	return t ? {
-		x: e.x + (t.x ?? 0),
-		y: e.y + (t.y ?? 0),
-		rotation: e.rotation + (t.rotation ?? 0),
-		scaleX: e.scaleX * (t.scaleX ?? 1),
-		scaleY: e.scaleY * (t.scaleY ?? 1)
-	} : e;
-}
-function n(e) {
-	let t = Math.cos(e.rotation), n = Math.sin(e.rotation), r = /* @__PURE__ */ new Float32Array(9);
-	return r[0] = t * e.scaleX, r[1] = n * e.scaleX, r[2] = 0, r[3] = -n * e.scaleY, r[4] = t * e.scaleY, r[5] = 0, r[6] = e.x, r[7] = e.y, r[8] = 1, r;
-}
-function r(r, i) {
-	let a = /* @__PURE__ */ new Map();
-	for (let o of r.joints) {
-		let r = n(t(o.bind, i[o.name]));
-		if (o.parent == null) {
-			a.set(o.name, r);
-			continue;
-		}
-		let s = a.get(o.parent);
-		if (!s) throw Error(`resolveSkeleton: joint "${o.name}" names parent "${o.parent}", which has not been resolved. Skeleton.joints must be in topological order.`);
-		a.set(o.name, e.multiply(s, r));
-	}
-	return a;
-}
-//#endregion
-export { t as compose, r as resolveSkeleton, n as toMat3 };
-
-//# sourceMappingURL=resolveSkeleton.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"resolveSkeleton.js","names":["compose","delta","bind","toMat3","c","t","s","m","resolveSkeleton","out","joint","skeleton","local","pose","parent","mat3"],"sources":["../../../src/animation/rig/resolveSkeleton.ts"],"sourcesContent":["import { mat3, type GlMat3 } from '../../renderer/math/mat3';\nimport type { JointTransform, Pose, Skeleton } from './types';\n\n/** bind + delta, field by field. Scale is multiplicative, the rest additive. */\nexport function compose(bind: JointTransform, delta: Partial<JointTransform> | undefined): JointTransform {\n  if (!delta) return bind;\n  return {\n    x: bind.x + (delta.x ?? 0),\n    y: bind.y + (delta.y ?? 0),\n    rotation: bind.rotation + (delta.rotation ?? 0),\n    scaleX: bind.scaleX * (delta.scaleX ?? 1),\n    scaleY: bind.scaleY * (delta.scaleY ?? 1),\n  };\n}\n\n/** TRS as a GlMat3: translate * rotate * scale, applied to a column vector. */\nexport function toMat3(t: JointTransform): GlMat3 {\n  const c = Math.cos(t.rotation);\n  const s = Math.sin(t.rotation);\n  const m = new Float32Array(9) as GlMat3;\n  m[0] = c * t.scaleX;  m[1] = s * t.scaleX;  m[2] = 0;\n  m[3] = -s * t.scaleY; m[4] = c * t.scaleY;  m[5] = 0;\n  m[6] = t.x;           m[7] = t.y;           m[8] = 1;\n  return m;\n}\n\n/**\n * Resolve every joint's world transform by walking the skeleton once and\n * composing each joint onto its already-resolved parent.\n *\n * `skeleton.joints` must be in topological order — a joint whose parent has not\n * been resolved yet throws rather than silently resolving against identity,\n * because that failure is otherwise invisible until a limb renders in the wrong\n * place.\n */\nexport function resolveSkeleton(skeleton: Skeleton, pose: Pose): Map<string, GlMat3> {\n  const out = new Map<string, GlMat3>();\n  for (const joint of skeleton.joints) {\n    const local = toMat3(compose(joint.bind, pose[joint.name]));\n    if (joint.parent == null) {\n      out.set(joint.name, local);\n      continue;\n    }\n    const parent = out.get(joint.parent);\n    if (!parent) {\n      throw new Error(\n        `resolveSkeleton: joint \"${joint.name}\" names parent \"${joint.parent}\", which has not ` +\n        'been resolved. Skeleton.joints must be in topological order.',\n      );\n    }\n    out.set(joint.name, mat3.multiply(parent, local));\n  }\n  return out;\n}\n"],"mappings":";;AAIA,SAAgBA,EAAQ,GAAsB,GAA4D;CAExG,OADKC,IACE;EACL,GAAGC,EAAK,KAAKD,EAAM,KAAK;EACxB,GAAGC,EAAK,KAAKD,EAAM,KAAK;EACxB,UAAUC,EAAK,YAAYD,EAAM,YAAY;EAC7C,QAAQC,EAAK,UAAUD,EAAM,UAAU;EACvC,QAAQC,EAAK,UAAUD,EAAM,UAAU;CACzC,IAPmBC;AAQrB;AAGA,SAAgBC,EAAO,GAA2B;CAChD,IAAMC,IAAI,KAAK,IAAIC,EAAE,QAAQ,GACvBC,IAAI,KAAK,IAAID,EAAE,QAAQ,GACvBE,oBAAI,IAAI,aAAa,CAAC;CAI5B,OAHA,EAAE,KAAKH,IAAIC,EAAE,QAAS,EAAE,KAAKC,IAAID,EAAE,QAAS,EAAE,KAAK,GACnD,EAAE,KAAK,CAACC,IAAID,EAAE,QAAQ,EAAE,KAAKD,IAAIC,EAAE,QAAS,EAAE,KAAK,GACnD,EAAE,KAAKA,EAAE,GAAa,EAAE,KAAKA,EAAE,GAAa,EAAE,KAAK,GAC5CE;AACT;AAWA,SAAgBC,EAAgB,GAAoB,GAAiC;CACnF,IAAMC,oBAAM,IAAI,IAAoB;CACpC,KAAK,IAAMC,KAASC,EAAS,QAAQ;EACnC,IAAMC,IAAQT,EAAOH,EAAQU,EAAM,MAAMG,EAAKH,EAAM,KAAK,CAAC;EAC1D,IAAIA,EAAM,UAAU,MAAM;GACxB,EAAI,IAAIA,EAAM,MAAME,CAAK;GACzB;EACF;EACA,IAAME,IAASL,EAAI,IAAIC,EAAM,MAAM;EACnC,IAAI,CAACI,GACH,MAAU,MACR,2BAA2BJ,EAAM,KAAK,kBAAkBA,EAAM,OAAO,8EAEvE;EAEF,EAAI,IAAIA,EAAM,MAAMK,EAAK,SAASD,GAAQF,CAAK,CAAC;CAClD;CACA,OAAOH;AACT"}

package/dist/animation/rig/solveIk.js

@@ -1,103 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

@@ -1,12 +0,0 @@
-//#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

@@ -1 +0,0 @@
-{"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/slew.js

@@ -1,27 +0,0 @@
-//#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

@@ -1 +0,0 @@
-{"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

@@ -1,146 +0,0 @@
-import { springPose as e } from "./poseHelpers.js";
-//#region src/animation/stagger.ts
-var t = class {
-	supervisor;
-	id;
-	cancelled = !1;
-	paused_ = !1;
-	timeScale_ = 1;
-	children = [];
-	pending = [];
-	outstanding;
-	finished = !1;
-	constructor(e, t) {
-		this.supervisor = e, this.id = e.id, this.outstanding = t, e.setOnCancel(() => this.handleSupervisorCancel()), e.setOnRate((e, t) => {
-			e ? this.applyPause() : this.applyResume(), this.applyTimeScale(t);
-		}), e.setOnFrame((e) => this.fireDue(e));
-	}
-	handleSupervisorCancel() {
-		if (this.cancelled) return;
-		this.cancelled = !0, 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) {
-		this.cancelled || this.pending.push({
-			at: e,
-			fire: t
-		});
-	}
-	fireDue(e) {
-		if (this.cancelled || this.pending.length === 0) return;
-		let t = this.pending.filter((t) => t.at <= e).sort((e, t) => e.at - t.at);
-		this.pending = this.pending.filter((t) => t.at > e);
-		for (let e of t) {
-			if (this.cancelled) return;
-			e.fire();
-		}
-	}
-	cancel() {
-		this.supervisor.cancel();
-	}
-	pause() {
-		this.supervisor.pause();
-	}
-	resume() {
-		this.supervisor.resume();
-	}
-	setTimeScale(e) {
-		this.supervisor.setTimeScale(e);
-	}
-	applyPause() {
-		if (!this.paused_) {
-			this.paused_ = !0;
-			for (let e of this.children) e.pause();
-		}
-	}
-	applyResume() {
-		if (this.paused_) {
-			this.paused_ = !1;
-			for (let e of this.children) e.resume();
-		}
-	}
-	applyTimeScale(e) {
-		if (e !== this.timeScale_) {
-			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) {
-	return o ? i(t, n, r, a, o, c) : s(e, t, n, r, a);
-}
-function i(e, r, i, a, o, s) {
-	let c = e({
-		kind: "stagger",
-		cancelKey: s?.cancelKey,
-		label: s?.label
-	}), l = new t(c, i.length);
-	return i.length === 0 ? (c.finish(), l) : (i.forEach((e, t) => {
-		let i = n(a, t), s = () => {
-			let n = o(e, t);
-			r(n.id, () => l.noteChildDone()), l.addChild(n);
-		};
-		i <= 0 ? s() : l.schedule(i, s);
-	}), l);
-}
-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) {
-	return {
-		each: (e, t) => i(n, r, s, c, e, t),
-		tween: (e) => i(n, r, s, c, (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, l, u = {}) => i(n, r, s, c, (n, r) => e(t, a, {
-			id: o(n),
-			to: l(n, r),
-			preset: u.preset,
-			stiffness: u.stiffness,
-			damping: u.damping,
-			mass: u.mass,
-			geometry: u.geometry,
-			recordOp: u.recordOp,
-			opLabel: u.opLabel
-		}), u)
-	};
-}
-//#endregion
-export { r as createStagger };
-
-//# sourceMappingURL=stagger.js.map

package/dist/animation/stagger.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stagger.js","names":["CompositeHandle","supervisor","totalItems","paused","timeScale","virtualNow","kids","c","h","delayMs","due","p","a","b","s","delayFor","delay","i","createStagger","factory","runStagger","createSupervisor","watchCompletion","items","opts","makeBuilder","animator","composite","ms","fire","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/** An item still waiting: `fire` starts it once the stagger's own virtual\n *  time reaches `at`. */\ninterface PendingEntry {\n  at: number;\n  fire: () => void;\n}\n\n/**\n * Composite handle returned by `createStagger`. Owns a list of in-flight\n * child handles and a list of items still waiting; cancel cancels both.\n * Pause/resume/setTimeScale propagate to in-flight children. The waiting\n * items are counted in the supervisor entry's virtual time, so whatever\n * holds or scales that entry holds or scales the delays with it.\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 supervisor: Supervisor,\n    totalItems: number,\n  ) {\n    this.id = supervisor.id;\n    this.outstanding = totalItems;\n    supervisor.setOnCancel(() => this.handleSupervisorCancel());\n    supervisor.setOnRate((paused, timeScale) => {\n      if (paused) this.applyPause();\n      else this.applyResume();\n      this.applyTimeScale(timeScale);\n    });\n    supervisor.setOnFrame((virtualNow) => this.fireDue(virtualNow));\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    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    this.pending.push({ at: delayMs, fire });\n  }\n\n  private fireDue(virtualNow: number): void {\n    if (this.cancelled || this.pending.length === 0) return;\n    const due = this.pending.filter((p) => p.at <= virtualNow).sort((a, b) => a.at - b.at);\n    this.pending = this.pending.filter((p) => p.at > virtualNow);\n    for (const p of due) {\n      if (this.cancelled) return;\n      p.fire();\n    }\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 + waiting items.\n    this.supervisor.cancel();\n  }\n\n  pause(): void {\n    this.supervisor.pause();\n  }\n\n  resume(): void {\n    this.supervisor.resume();\n  }\n\n  setTimeScale(s: number): void {\n    this.supervisor.setTimeScale(s);\n  }\n\n  private applyPause(): void {\n    if (this.paused_) return;\n    this.paused_ = true;\n    for (const c of this.children) c.pause();\n  }\n\n  private applyResume(): void {\n    if (!this.paused_) return;\n    this.paused_ = false;\n    for (const c of this.children) c.resume();\n  }\n\n  private applyTimeScale(s: number): void {\n    if (s === this.timeScale_) return;\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  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  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n): StaggerBuilder<TItem>;\nexport function createStagger<TItem>(\n  animator: Animator,\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(createSupervisor, watchCompletion, items, delay, factory, opts);\n  return makeBuilder(animator, createSupervisor, watchCompletion, items, delay);\n}\n\nfunction runStagger<TItem>(\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(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  createSupervisor: SupervisorFactory,\n  watchCompletion: WatchCompletion,\n  items: readonly TItem[],\n  delay: StaggerDelay,\n): StaggerBuilder<TItem> {\n  return {\n    each: (factory, opts) =>\n      runStagger(createSupervisor, watchCompletion, items, delay, factory, opts),\n    tween: <T,>(opts: StaggerTweenOptions<T, TItem>) =>\n      runStagger(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(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":";;AAgCA,IAAMA,IAAN,MAAiD;CAWrC;CAVV;CACA,YAAoB;CACpB,UAAkB;CAClB,aAAqB;CACrB,WAAsC,CAAC;CACvC,UAAkC,CAAC;CACnC;CACA,WAAmB;CAEnB,YACE,GACA,GACA;EASA,AAXQ,KAAA,aAAAC,GAGR,KAAK,KAAKA,EAAW,IACrB,KAAK,cAAcC,GACnBD,EAAW,kBAAkB,KAAK,uBAAuB,CAAC,GAC1DA,EAAW,WAAW,GAAQ,MAAc;GAG1C,AAFIE,IAAQ,KAAK,WAAW,IACvB,KAAK,YAAY,GACtB,KAAK,eAAeC,CAAS;EAC/B,CAAC,GACDH,EAAW,YAAY,MAAe,KAAK,QAAQI,CAAU,CAAC;CAChE;CAIA,yBAAuC;EACrC,IAAI,KAAK,WAAW;EAEpB,AADA,KAAK,YAAY,IACjB,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,AAAI,KAAK,aACT,KAAK,QAAQ,KAAK;GAAE,IAAIC;GAAS;EAAK,CAAC;CACzC;CAEA,QAAgB,GAA0B;EACxC,IAAI,KAAK,aAAa,KAAK,QAAQ,WAAW,GAAG;EACjD,IAAMC,IAAM,KAAK,QAAQ,QAAQ,MAAMC,EAAE,MAAMN,CAAU,CAAC,CAAC,MAAM,GAAG,MAAMO,EAAE,KAAKC,EAAE,EAAE;EACrF,KAAK,UAAU,KAAK,QAAQ,QAAQ,MAAMF,EAAE,KAAKN,CAAU;EAC3D,KAAK,IAAMM,KAAKD,GAAK;GACnB,IAAI,KAAK,WAAW;GACpB,EAAE,KAAK;EACT;CACF;CAEA,SAAe;EAIb,KAAK,WAAW,OAAO;CACzB;CAEA,QAAc;EACZ,KAAK,WAAW,MAAM;CACxB;CAEA,SAAe;EACb,KAAK,WAAW,OAAO;CACzB;CAEA,aAAa,GAAiB;EAC5B,KAAK,WAAW,aAAaI,CAAC;CAChC;CAEA,aAA2B;EACzB,IAAI,MAAK,SACT;QAAK,UAAU;GACf,KAAK,IAAMP,KAAK,KAAK,UAAU,EAAE,MAAM;EADxB;CAEjB;CAEA,cAA4B;EAC1B,IAAK,KAAK,SACV;QAAK,UAAU;GACf,KAAK,IAAMA,KAAK,KAAK,UAAU,EAAE,OAAO;EADzB;CAEjB;CAEA,eAAuB,GAAiB;EACtC,IAAIO,MAAM,KAAK,YACf;QAAK,aAAaA;GAClB,KAAK,IAAMP,KAAK,KAAK,UAAU,EAAE,aAAaO,CAAC;EAD7B;CAEpB;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;AAuBA,SAAgBC,EACd,GACA,GACA,GACA,GACA,GACA,GACA,GACyC;CAEzC,OADIC,IAAgBC,EAAWC,GAAkBC,GAAiBC,GAAOP,GAAOG,GAASK,CAAI,IACtFC,EAAYC,GAAUL,GAAkBC,GAAiBC,GAAOP,CAAK;AAC9E;AAEA,SAASI,EACP,GACA,GACA,GACA,GACA,GACA,GACiB;CACjB,IAAMnB,IAAaoB,EAAiB;EAAE,MAAM;EAAW,WAAWG,GAAM;EAAW,OAAOA,GAAM;CAAM,CAAC,GACjGG,IAAY,IAAI3B,EAAgBC,GAAYsB,EAAM,MAAM;CAkB9D,OAjBIA,EAAM,WAAW,KACnBtB,EAAW,OAAO,GACX0B,MAETJ,EAAM,SAAS,GAAM,MAAM;EACzB,IAAMK,IAAKb,EAASC,GAAOC,CAAC,GACtBY,UAAmB;GACvB,IAAMC,IAAQX,EAAQY,GAAMd,CAAC;GAK7B,AADAK,EAAgBQ,EAAM,UAAUH,EAAU,cAAc,CAAC,GACzDA,EAAU,SAASG,CAAK;EAC1B;EACA,AAAIF,KAAM,IAAGC,EAAK,IACbF,EAAU,SAASC,GAAIC,CAAI;CAClC,CAAC,GACMF;AACT;AAEA,SAASK,EACP,GACA,GACA,GACG;CACH,OAAO,OAAOC,KAAM,aACfA,EAAwCF,GAAMd,CAAC,IAChDgB;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,SAASN,EACP,GACA,GACA,GACA,GACA,GACuB;CACvB,OAAO;EACL,OAAO,GAAS,MACdL,EAAWC,GAAkBC,GAAiBC,GAAOP,GAAOG,GAASK,CAAI;EAC3E,QAAY,MACVJ,EAAWC,GAAkBC,GAAiBC,GAAOP,IAAQ,GAAM,MACjEU,EAAS,MAAS;GAChB,MAAMM,EAAeR,EAAK,MAAMO,GAAMd,CAAC;GACvC,IAAIe,EAAeR,EAAK,IAAIO,GAAMd,CAAC;GACnC,IAAIe,EAAeR,EAAK,IAAIO,GAAMd,CAAC;GACnC,QAAQO,EAAK;GACb,aAAaA,EAAK;GAClB,SAAS,MAAMA,EAAK,OAAOS,GAAGF,GAAMd,CAAC;GACrC,QAAQO,EAAK,eAAeA,EAAK,OAAQO,GAAMd,CAAC,IAAI,KAAA;EACtD,CAAC,GACDO,CACF;EACF,aACE,GACA,GACA,IAAwC,CAAC,MAEzCJ,EAAWC,GAAkBC,GAAiBC,GAAOP,IAAQ,GAAM,MACjEoB,EAAWV,GAAUW,GAAS;GAC5B,IAAIH,EAAOH,CAAI;GACf,IAAIO,EAAOP,GAAMd,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

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

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

@@ -1 +0,0 @@
-{"version":3,"file":"booking.js","names":["firstAfter","lo","hi","events","mid","firstAtOrAfter","i","t","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","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/** Index of the first event at or after `t`. */\nexport function firstAtOrAfter(events: EventTrack['events'], t: number): number {\n  let i = firstAfter(events, t);\n  while (i > 0 && events[i - 1].t === t) i -= 1;\n  return i;\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; with `open`,\n *  only those before `r`, which is where a seek leaves the cursor. */\ninterface Cursor { lap: number; r: number; open?: boolean }\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 = (c.open ? firstAtOrAfter : 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(), open: true };\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;AAGA,SAAgBI,EAAe,GAA8B,GAAmB;CAC9E,IAAIC,IAAIN,EAAWG,GAAQI,CAAC;CAC5B,OAAOD,IAAI,KAAKH,EAAOG,IAAI,EAAE,CAAC,MAAMC,IAAG;CACvC,OAAOD;AACT;AAuCA,IAAME,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,IAAM,KAAKT,EAAE,OAAO1B,IAAiBL,EAAA,CAAYG,GAAQ4B,EAAE,IAAIF,CAAE;GACjE,IAAI,KAAK1B,EAAO,UAAU0B,IAAK1B,EAAO,EAAE,CAAC,IAAImC,GAAU;IACrD,IAAIP,EAAE,OAAOU,GAAS;IAGtB,IAAI;KAAE,KAAK,KAAK,IAAIV,EAAE,MAAM,GAAGM,CAAG;KAAG,GAAG;IAAU;IAClD;GACF;GACA,IAAMK,IAAIb,IAAK1B,EAAO,EAAE,CAAC,GACnB8B,IAAIM,IAAWG;GACrB,IAAIT,IAAIO,GAAS;GACjB,IAAI;IAAE,KAAKT,EAAE;IAAK;GAAE;GACpB,KAAK,IAAIY,IAAI,GAAGA,IAAIxC,EAAO,UAAUA,EAAOwC,EAAE,CAAC,MAAMxC,EAAO,EAAE,CAAC,GAAG,KAAK,GAAG;IACxE,IAAMyC,IAAKzC,EAAOwC;IAElB,IADI,CAACC,EAAG,QAAQ3B,EAAS,MAAM,MAAMP,EAAE,UAAUkC,KAAMlC,EAAE,QAAQqB,EAAE,GAAG,MACjEG,IAAWD,KAAKE,IAAQrB,GAAS;IACtC,IAAM+B,IAAOb,EAAQC,GAAGC,GAAUC,GAAOT,CAAG,GACxCoB;IACJ,IAAI;KACF,IAASF,EAAG,KAAKC,CAAI,KAAK,KAAA;IAC5B,SAASjB,GAAK;KACZ,QAAQ,MAAM,wBAAwBA,CAAG;IAC3C;IACA,EAAS,KAAK;KAAE,OAAOgB;KAAI,KAAKb,EAAE;KAAK;KAAG;KAAM;IAAO,CAAC;GAC1D;EACF;EACA,EAAQ,IAAID,GAAOC,CAAC;CACtB,GAEMgB,KACJ,GAAiB,GAAY,GAAiB,GAAiB,GAAa,MACnE;EACT,KAAK,IAAMjB,KAASkB,GAClB,AAAIlB,EAAM,SAAS,UAASM,EAAUN,GAAOD,GAAIW,GAASC,GAASf,GAAKS,CAAK,IACpEL,EAAM,SAAS,cACtBiB,EAAMjB,EAAM,SAAS,QAAQD,IAAKC,EAAM,IAAIU,GAASC,GAASf,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,IAAIuB,IAAQ7B,IAAY,KAAKe,MAAUf;GACvC,IAAIF,MAAQ,MACV,IAAMQ;QACD;IACL,MAAQwB,IAAa/B,KAAcgB;IACnC,IAAMgB,IAAWzB,IAAMR;IACvB,AAAI,KAAK,IAAIiC,CAAQ,IAAI,MACvB,IAAMzB,GACN,IAAQ,MAER,KAAOyB,IAAW;GAEtB;GAEA,AADA,IAAaD,GACb,IAAYf;GAEZ,IAAMD,IAAWZ,EAAK,SAAS;GAC/B,AAAI2B,KACFxB,EAAUC,IAAM,MAAM,KAAK,IAAIM,EAAQT,EAAUb,CAAC,GAAGwB,GAAUC,GAAOT,CAAG,IAAIhB,EAAE,IAAI,IAAI,CAAS;GAGlG,IAAM4B,IAAWhB,EAAK,SAAS,GACzBmB,IAAUnB,EAAK,IAAI,KAAKgB,IAAW,IAAIhB,EAAK,SAAS,IAAI;GAC/D,EAAMA,EAAK,QAAQ,GAAGY,IAAWtB,IAAYuB,GAAOM,GAASf,GAAKS,CAAK;EACzE;EACA,UAAU;GACR,EAAUtB,EAAK,MAAM,IAAI,SAAS,EAAI;EACxC;EACA,OAAO;GAGL,AAFA,IAAW,CAAC,GACZE,EAAQ,MAAM,GACd,IAAQ;IAAE,GAAGM,EAAe;IAAG,MAAM;GAAK;EAC5C;EACA,QAAQ;GACN,IAAM;EACR;CACF;AACF"}