coily 0.13.1 → 0.15.0

package/dist/system-Br_cPnaN.js

@@ -0,0 +1,2188 @@
+import { a as RESOLVED, c as isNumber, i as State, l as isRecord, n as OverdampedSolver, o as invariant, r as UnderdampedSolver, s as isArray, t as CriticallyDampedSolver, u as isRecordOrArray } from "./solver-CVXOTDkZ.js";
+//#region src/flush-queue.ts
+/**
+* Defers callbacks while inside a batch or tick: `request` runs the
+* callback immediately at depth 0 and queues it — deduplicated — until
+* the outermost exit otherwise. Composite springs use it to coalesce
+* per-channel events into composite ones.
+*/
+var FlushQueue = class {
+	#callbacks = /* @__PURE__ */ new Set();
+	#depth = 0;
+	request(callback) {
+		if (this.#depth > 0) this.#callbacks.add(callback);
+		else callback();
+	}
+	batch(fn) {
+		this.enter();
+		try {
+			fn();
+		} finally {
+			this.exit();
+		}
+	}
+	enter() {
+		this.#depth++;
+	}
+	exit() {
+		this.#depth--;
+		if (this.#depth === 0) for (const callback of this.#callbacks) {
+			this.#callbacks.delete(callback);
+			callback();
+		}
+	}
+};
+//#endregion
+//#region src/config.ts
+/**
+* Immutable, resolved spring parameters. Whatever `defineSpring` input
+* shape produced it, a config carries concrete `mass`, `tension`,
+* `damping`, and `precision`, plus the quantities derived from them.
+* Instances are frozen and safe to share between springs; to change a
+* spring's behavior, assign a new config via `spring.config`.
+*/
+var SpringDefinition = class SpringDefinition {
+	/** The config for springs created without one: critically damped, settling in about 500ms. */
+	static default = new SpringDefinition({
+		dampingRatio: 1,
+		duration: 500
+	});
+	/** Mass of the moving value, as provided or derived. */
+	mass;
+	/** Spring stiffness, as provided or derived. */
+	tension;
+	/** Friction strength, as provided or derived. */
+	damping;
+	/** Decimal places of the resting threshold — see `restingMagnitude`. */
+	precision;
+	/**
+	* Velocity multiplier applied when the value crosses the target, as
+	* provided or resolved from its named form. 1 (`'passthrough'`) leaves
+	* the motion untouched, 0 (`'stop'`) ends it at the target, negative
+	* values rebound.
+	*/
+	arrival;
+	/** Oscillation rate with no damping: `sqrt(tension / mass)`, in radians per second. */
+	naturalFrequency;
+	/** The damping at which bounce disappears: `2 * mass * naturalFrequency`. */
+	criticalDamping;
+	/**
+	* `damping / criticalDamping`. Below 1 the spring overshoots and
+	* bounces, at 1 it settles fastest without overshooting, above 1 it
+	* settles slower.
+	*/
+	dampingRatio;
+	/** Resting threshold in value units: half a unit in the last `precision` place. */
+	restingMagnitude;
+	constructor(input) {
+		const raw = input;
+		const mass = raw.mass;
+		const tension = raw.tension;
+		const damping = raw.damping;
+		const bounce = raw.bounce;
+		const duration = raw.duration !== void 0 ? raw.duration / 1e3 : void 0;
+		const displacement = raw.displacement ?? 1;
+		const precision = raw.precision ?? 2;
+		const arrival = raw.arrival;
+		for (const key of Object.keys(raw)) {
+			if (key === "arrival") continue;
+			const value = raw[key];
+			if (value !== void 0) invariant(Number.isFinite(value), () => `Invalid ${key}: expected a finite number`);
+		}
+		if (mass !== void 0) invariant(mass > 0, "Mass must be greater than 0");
+		if (tension !== void 0) invariant(tension > 0, "Tension must be greater than 0");
+		if (damping !== void 0) invariant(damping >= 0, "Damping must be greater than or equal to 0");
+		if (bounce !== void 0) invariant(bounce >= -1 && bounce <= 1, "Bounce must be between -1 and 1");
+		invariant(raw.dampingRatio === void 0 || bounce === void 0, "Provide either dampingRatio or bounce, not both");
+		const dampingRatio = raw.dampingRatio ?? (bounce !== void 0 ? Math.max(1e-4, 1 - bounce) : void 0);
+		if (dampingRatio !== void 0) invariant(dampingRatio >= 0, "Damping ratio must be greater than or equal to 0");
+		if (duration !== void 0) invariant(duration > 0, "Duration must be greater than 0");
+		invariant(displacement !== 0, "Displacement must not be 0");
+		invariant(precision >= 0, "Precision must be greater than or equal to 0");
+		invariant(arrival === void 0 || arrival === "passthrough" || arrival === "stop" || typeof arrival === "number" && Number.isFinite(arrival) && arrival >= -1 && arrival <= 1, "Arrival must be 'passthrough', 'stop', or a number between -1 and 1");
+		this.precision = precision;
+		this.restingMagnitude = .5 / 10 ** precision;
+		if (arrival === void 0 || arrival === "passthrough") this.arrival = 1;
+		else if (arrival === "stop") this.arrival = 0;
+		else this.arrival = arrival === 0 ? 0 : arrival;
+		const hasM = mass !== void 0;
+		const hasK = tension !== void 0;
+		const hasC = damping !== void 0;
+		const hasZ = dampingRatio !== void 0;
+		const hasT = duration !== void 0;
+		if (hasK && hasC && !hasZ && !hasT) {
+			this.mass = mass ?? 1;
+			this.tension = tension;
+			this.damping = damping;
+		} else if (hasK && hasZ && !hasC && !hasT) {
+			this.mass = mass ?? 1;
+			this.tension = tension;
+			this.damping = 2 * dampingRatio * Math.sqrt(this.mass * tension);
+		} else if (hasC && hasZ && !hasK && !hasT) {
+			invariant(dampingRatio > 0, "dampingRatio must be > 0 to derive tension");
+			this.mass = mass ?? 1;
+			this.tension = damping ** 2 / (4 * dampingRatio ** 2 * this.mass);
+			this.damping = damping;
+		} else if (hasK && hasC && hasZ && !hasT) {
+			invariant(!hasM, "mass is derived when tension, damping, and dampingRatio are all provided");
+			invariant(dampingRatio > 0, "dampingRatio must be > 0 to derive mass");
+			this.mass = damping ** 2 / (4 * dampingRatio ** 2 * tension);
+			this.tension = tension;
+			this.damping = damping;
+		} else if (hasZ && hasT) {
+			const threshold = .005;
+			const x0 = Math.abs(displacement);
+			invariant(x0 > threshold, "displacement must be greater than the precision threshold");
+			invariant(dampingRatio > 0, "dampingRatio must be > 0 for duration-based config");
+			const wn = restUnits(dampingRatio, x0 / threshold) / duration;
+			if (!hasK && !hasC) {
+				this.mass = mass ?? 1;
+				this.tension = wn ** 2 * this.mass;
+				this.damping = 2 * dampingRatio * this.mass * wn;
+			} else if (hasK && !hasC) {
+				invariant(!hasM, "mass is derived in duration-based configs with tension");
+				this.mass = tension / wn ** 2;
+				this.tension = tension;
+				this.damping = 2 * dampingRatio * this.mass * wn;
+			} else if (hasC && !hasK) {
+				invariant(!hasM, "mass is derived in duration-based configs with damping");
+				this.mass = damping / (2 * dampingRatio * wn);
+				this.tension = wn ** 2 * this.mass;
+				this.damping = damping;
+			} else throw new Error("Invalid spring config: provide one of the supported input shapes.");
+		} else throw new Error("Invalid spring config: provide one of the supported input shapes.");
+		this.naturalFrequency = Math.sqrt(this.tension / this.mass);
+		this.criticalDamping = 2 * this.mass * this.naturalFrequency;
+		this.dampingRatio = this.damping / this.criticalDamping;
+		Object.freeze(this);
+	}
+	/**
+	* Computes when a spring with this config comes to rest from `state`,
+	* in ms.
+	*
+	* The time is solved from the motion's decay bound rather than
+	* estimated: the spring is resting at the first tick at or after it.
+	* An underdamped spring can also rest earlier — its rest amplitude
+	* pulses, and a frame that samples a dip inside the resting threshold
+	* rests there — so read the value as "no later than", tight in
+	* practice. See
+	* https://github.com/tkofh/coily/blob/main/PRECISION.md.
+	*
+	* Returns 0 when `state` is already inside the resting threshold.
+	* Returns Infinity when the motion never settles: a `dampingRatio` of
+	* 0 whose `arrival` neither stops nor slows it. When `arrival` is 0
+	* the result is capped at the first target crossing, where such a
+	* spring rests exactly; other multipliers fold their per-crossing
+	* velocity loss into the time.
+	*/
+	computeTimeRemaining(state) {
+		const { position, velocity } = state;
+		if (Math.abs(position) + Math.abs(velocity) / this.naturalFrequency <= this.restingMagnitude) return 0;
+		const crossing = this.arrival === 0 ? firstCrossing(this, position, velocity) * 1e3 : Infinity;
+		return Math.min(restTime(this, position, velocity) * 1e3, crossing);
+	}
+};
+function solveEntry(f, threshold, peak) {
+	let low = 0;
+	let high = Math.max(peak, 1e-6);
+	while (f(high) > threshold) {
+		low = high;
+		high *= 2;
+	}
+	for (let i = 0; i < 60; i++) {
+		const mid = (low + high) / 2;
+		if (f(mid) > threshold) low = mid;
+		else high = mid;
+	}
+	return high;
+}
+function restTime(config, position, velocity) {
+	const { naturalFrequency, dampingRatio, restingMagnitude, arrival } = config;
+	if (dampingRatio < 1) {
+		const sigma = dampingRatio * naturalFrequency;
+		const wd = naturalFrequency * Math.sqrt(1 - dampingRatio ** 2);
+		const R = Math.hypot(position, (velocity + sigma * position) / wd);
+		const drop = Math.log(R * Math.sqrt(2 + 2 * dampingRatio) / restingMagnitude);
+		const plain = sigma > 0 ? drop / sigma : Infinity;
+		const strength = Math.abs(arrival);
+		if (strength === 0 || strength === 1) return plain;
+		const first = firstCrossing(config, position, velocity);
+		if (plain <= first) return plain;
+		const loss = -Math.log(strength) * wd / Math.PI;
+		return (drop + loss * first) / (sigma + loss);
+	}
+	if (dampingRatio === 1) {
+		const a0 = Math.abs(position) + Math.abs(velocity) / naturalFrequency;
+		const beta = 2 * Math.abs(velocity + naturalFrequency * position);
+		return solveEntry((t) => Math.exp(-naturalFrequency * t) * (a0 + beta * t), restingMagnitude, beta > 0 ? Math.max(0, 1 / naturalFrequency - a0 / beta) : 0);
+	}
+	const wd = naturalFrequency * Math.sqrt(dampingRatio ** 2 - 1);
+	const slow = dampingRatio * naturalFrequency - wd;
+	const fast = dampingRatio * naturalFrequency + wd;
+	const slowAmplitude = Math.abs(velocity + fast * position) / (2 * wd) * (1 + slow / naturalFrequency);
+	const fastAmplitude = Math.abs(velocity + slow * position) / (2 * wd) * (1 + fast / naturalFrequency);
+	return solveEntry((t) => slowAmplitude * Math.exp(-slow * t) + fastAmplitude * Math.exp(-fast * t), restingMagnitude, 0);
+}
+function restUnits(dampingRatio, ratio) {
+	if (dampingRatio < 1) return Math.log(ratio * Math.sqrt(2 / (1 - dampingRatio))) / dampingRatio;
+	if (dampingRatio === 1) return solveEntry((u) => Math.exp(-u) * (1 + 2 * u), 1 / ratio, .5);
+	const wd = Math.sqrt(dampingRatio ** 2 - 1);
+	const slow = dampingRatio - wd;
+	const fast = dampingRatio + wd;
+	const slowAmplitude = fast / (2 * wd) * (1 + slow);
+	const fastAmplitude = slow / (2 * wd) * (1 + fast);
+	return solveEntry((u) => slowAmplitude * Math.exp(-slow * u) + fastAmplitude * Math.exp(-fast * u), 1 / ratio, 0);
+}
+function firstCrossing(config, position, velocity) {
+	const { naturalFrequency, dampingRatio } = config;
+	if (dampingRatio < 1) {
+		const wd = naturalFrequency * Math.sqrt(1 - dampingRatio ** 2);
+		const c2 = (velocity + dampingRatio * naturalFrequency * position) / wd;
+		let theta = Math.atan2(-position, c2) % Math.PI;
+		if (theta <= 0) theta += Math.PI;
+		return theta / wd;
+	}
+	if (dampingRatio === 1) {
+		const t = -position / (velocity + naturalFrequency * position);
+		return t > 0 ? t : Infinity;
+	}
+	const wd = naturalFrequency * Math.sqrt(dampingRatio ** 2 - 1);
+	const theta = Math.atanh(-position * wd / (velocity + dampingRatio * naturalFrequency * position));
+	return theta > 0 ? theta / wd : Infinity;
+}
+function defineSpring(input) {
+	return new SpringDefinition(input);
+}
+//#endregion
+//#region src/emitter.ts
+/** Minimal fixed-event emitter behind motions and composite springs. */
+var Emitter = class {
+	#update = [];
+	#start = [];
+	#stop = [];
+	#dispose = [];
+	on(type, handler) {
+		this.#list(type).push(handler);
+		return () => {
+			this.off(type, handler);
+		};
+	}
+	off(type, handler) {
+		const list = this.#list(type);
+		if (handler) list.splice(list.indexOf(handler) >>> 0, 1);
+		else list.length = 0;
+	}
+	clear() {
+		this.#update.length = 0;
+		this.#start.length = 0;
+		this.#stop.length = 0;
+		this.#dispose.length = 0;
+	}
+	emit(type) {
+		const list = this.#list(type);
+		if (list.length === 1) list[0]();
+		else if (list.length > 1) for (const handler of list.slice()) handler();
+	}
+	#list(type) {
+		switch (type) {
+			case "update": return this.#update;
+			case "start": return this.#start;
+			case "stop": return this.#stop;
+			case "dispose": return this.#dispose;
+		}
+	}
+};
+//#endregion
+//#region src/motion.ts
+let nextMotionId = 0;
+/**
+* One spring simulation in displacement space: position is measured from
+* the target (0 means settled), so retargeting is a rebase performed by
+* the owning `Spring`. Picks the closed-form solver for the config's
+* damping regime and emits update/start/stop/dispose events.
+*/
+var Motion = class {
+	/** Monotone creation id: breaks ties wherever motions need a deterministic order. */
+	_id = nextMotionId++;
+	/** Tick-pass marker written by `MotionSet` so a motion re-added mid-pass isn't ticked twice. */
+	_pass = 0;
+	/**
+	* Frame marker written by `MotionSet`: sub-steps share one frame, and
+	* the first advance in it queues the motion for the settle sweep.
+	*/
+	_frame = 0;
+	/**
+	* Dependency rank written by `FollowGraph`: motions the follow graph
+	* touches count up from 0, leaders before followers; -1 marks a motion
+	* outside the graph.
+	*/
+	_rank = -1;
+	/**
+	* The edge this motion follows through, or null. Written by
+	* `FollowGraph` on edge add/remove so the tick's hot loop reads a
+	* field instead of a map.
+	*/
+	_edge = null;
+	/**
+	* A first-order-hold ramp slope in value units per second, armed by a
+	* ramped `recouple` immediately before the `_advance` that consumes
+	* it (read-and-clear; no user code runs between the two). 0 means the
+	* target holds still across the step — every path but a ramped
+	* recouple.
+	*/
+	_ramp = 0;
+	/**
+	* The edges reading this motion, or null when none. Written by
+	* `FollowGraph` with the rank cache, so it can lag a mid-pass edge
+	* change until the next recompute; the tick tolerates stale entries.
+	*/
+	_followers = null;
+	respectsReducedMotion = true;
+	#config;
+	#state;
+	#underdampedSolver = null;
+	#criticallyDampedSolver = null;
+	#overdampedSolver = null;
+	#currentSolver = null;
+	#needsUpdate = false;
+	#needsReset = false;
+	#running;
+	#emitter;
+	constructor(config, position, velocity) {
+		this.#config = config;
+		this.#state = new State(config, position, velocity);
+		this.#emitter = new Emitter();
+		this.#running = !this.#state.isResting;
+		this.#updateSolver();
+	}
+	get position() {
+		return this.#state.position;
+	}
+	set position(value) {
+		this.#state.position = value;
+		this.#needsReset = true;
+		this.#syncStart();
+	}
+	get velocity() {
+		return this.#state.velocity;
+	}
+	set velocity(value) {
+		this.#state.velocity = value;
+		this.#needsReset = true;
+		this.#syncStart();
+	}
+	get timeRemaining() {
+		return this.#config.computeTimeRemaining(this.#state);
+	}
+	get isResting() {
+		return this.#state.isResting;
+	}
+	configure(config) {
+		this.#config = config;
+		this.#state.configure(config);
+		this.#needsUpdate = true;
+		this.#syncStart();
+	}
+	tick(dt, emit = true) {
+		this._advance(dt);
+		if (emit) this._settleFrame();
+		else this.#reconcileRunning();
+	}
+	/**
+	* Advances the simulation and emits nothing. The tick pass advances
+	* every motion through this, then delivers the frame's events with
+	* `_settleFrame`; the synchronous `tick` wraps the two.
+	*
+	* A pending `_ramp` integrates the step against a target moving at
+	* that slope instead of holding still: one affine transform around
+	* the unchanged solver. With the target at `p(t) = p0 + g*t`, the
+	* displacement u = x - p(t) obeys the homogeneous equation shifted by
+	* the constant u_ss = -(2*zeta/wn)*g = -(damping/tension)*g, so the
+	* solver ticks w = u - u_ss exactly and the results shift back.
+	* Measuring u from the moving target makes the ramp endpoint and the
+	* new target coincide — the armer assigns the target, no rebase
+	* arithmetic exists. The ramp is an argument of the step, never
+	* persistent solver state: g = 0 takes the plain step below, so a
+	* motion that never ramps steps bit-exactly like an isolated spring.
+	*/
+	_advance(dt) {
+		invariant(this.#currentSolver, "Cannot tick a disposed motion");
+		const g = this._ramp;
+		if (g !== 0) {
+			this._ramp = 0;
+			const state = this.#state;
+			const shift = this.#config.damping / this.#config.tension * g;
+			state.position += shift;
+			state.velocity -= g;
+			if (this.#needsUpdate) {
+				this.#updateSolver();
+				this.#needsUpdate = false;
+			} else this.#currentSolver.configure();
+			this.#currentSolver.tick(dt);
+			state.position -= shift;
+			state.velocity += g;
+			this.#needsReset = true;
+			if (state.isResting) {
+				state.position = 0;
+				state.velocity = 0;
+			}
+			return;
+		}
+		if (this.#needsUpdate) {
+			this.#updateSolver();
+			this.#needsUpdate = false;
+			this.#needsReset = false;
+		} else if (this.#needsReset) {
+			this.#currentSolver.configure();
+			this.#needsReset = false;
+		}
+		this.#currentSolver.tick(dt);
+		if (this.#state.isResting) {
+			this.#state.position = 0;
+			this.#state.velocity = 0;
+			this.#needsReset = true;
+		}
+	}
+	/**
+	* Emits the frame's `update`, then reconciles `stop`/`start`. The tick
+	* pass calls this in dependency order after every motion has advanced,
+	* so update callbacks read frame-final values everywhere.
+	*/
+	_settleFrame() {
+		this.#emitter.emit("update");
+		this.#reconcileRunning();
+	}
+	#reconcileRunning() {
+		if (this.#state.isResting) {
+			if (this.#running) {
+				this.#running = false;
+				this.#emitter.emit("stop");
+			}
+		} else if (!this.#running) {
+			this.#running = true;
+			this.#emitter.emit("start");
+		}
+	}
+	finish() {
+		this.position = 0;
+		this.velocity = 0;
+		this.tick(0);
+	}
+	/**
+	* The sub-step controller's shock signal, read by a follower's `plan`
+	* with this motion as its leader: deviation from the quasi-steady
+	* tracking manifold x = -(damping/tension) * v, where damping/tension
+	* is 2*zeta/wn. Near zero while chasing any smoothly moving target at
+	* any speed; the full displacement after a target teleport;
+	* (damping/tension) * |v| after a fling.
+	*/
+	_manifoldDeviation() {
+		const config = this.#config;
+		return Math.abs(this.#state.position + config.damping / config.tension * this.#state.velocity);
+	}
+	/** Acceleration from current state, for `plan`'s kinematic bound on a shock frame. */
+	_acceleration() {
+		const config = this.#config;
+		return -(config.tension * this.#state.position + config.damping * this.#state.velocity) / config.mass;
+	}
+	onUpdate(callback) {
+		return this.#emitter.on("update", callback);
+	}
+	onStart(callback) {
+		return this.#emitter.on("start", callback);
+	}
+	onStop(callback) {
+		return this.#emitter.on("stop", callback);
+	}
+	onDispose(callback) {
+		return this.#emitter.on("dispose", callback);
+	}
+	dispose() {
+		this.#emitter.emit("dispose");
+		this.#emitter.clear();
+		this.#underdampedSolver = null;
+		this.#criticallyDampedSolver = null;
+		this.#overdampedSolver = null;
+		this.#currentSolver = null;
+	}
+	#syncStart() {
+		if (!this.#running && !this.#state.isResting) {
+			this.#running = true;
+			this.#emitter.emit("start");
+		}
+	}
+	#updateSolver() {
+		if (this.#config.dampingRatio < 1) {
+			this.#underdampedSolver ||= new UnderdampedSolver(this.#state);
+			this.#currentSolver = this.#underdampedSolver;
+		} else if (this.#config.dampingRatio === 1) {
+			this.#criticallyDampedSolver ||= new CriticallyDampedSolver(this.#state);
+			this.#currentSolver = this.#criticallyDampedSolver;
+		} else {
+			this.#overdampedSolver ||= new OverdampedSolver(this.#state);
+			this.#currentSolver = this.#overdampedSolver;
+		}
+		this.#currentSolver.configure(this.#config);
+	}
+};
+//#endregion
+//#region src/shape-tree.ts
+function joinPath(path, key) {
+	return path ? `${path}.${key}` : String(key);
+}
+function describePath(path) {
+	return path ? `'${path}'` : "the root";
+}
+/** The sentinel a resolver returns to descend into a node instead of covering it. */
+const BRANCH = Symbol("branch");
+/** The standard scatter leaf guard: partial numeric shapes take only finite numbers at channels. */
+function acceptNumber(input, path) {
+	invariant(isNumber(input) && Number.isFinite(input), () => `Expected a finite number for channel '${path}'`);
+	return input;
+}
+/**
+* The canonical numeric `LeafParser`: finite-number leaves built through
+* `factory`, named "channels" in structural errors. The default for value
+* shapes, whose leaves are all numbers.
+*/
+function channelParser(factory) {
+	return {
+		match(value, path) {
+			if (!isNumber(value)) return void 0;
+			invariant(Number.isFinite(value), () => `Invalid value at '${path}': channel values must be finite`);
+			return factory(value, path);
+		},
+		mismatch: (path) => `Invalid value at '${path}': expected a number or a nested shape of numbers`,
+		empty: (path) => `Invalid value at ${describePath(path)}: a shape must contain at least one channel`
+	};
+}
+var LeafNode = class LeafNode {
+	path;
+	leaf;
+	constructor(leaf, path) {
+		this.path = path;
+		this.leaf = leaf;
+	}
+	mirror(read, slots, carrier, key) {
+		carrier[key] = read(this.leaf);
+		slots.push({
+			leaf: this.leaf,
+			key,
+			carrier
+		});
+	}
+	scatter(input, accept, apply) {
+		apply(this.leaf, accept(input, this.path));
+	}
+	zip(theirs, fn) {
+		invariant(theirs instanceof LeafNode, () => `Shape mismatch at ${describePath(this.path)}`);
+		fn(this.leaf, theirs.leaf);
+	}
+	broadcast(input, resolve, apply, _label) {
+		const resolved = resolve(input, this.path);
+		invariant(resolved !== BRANCH, `Cannot descend into channel '${this.path}'`);
+		apply(this.leaf, resolved);
+	}
+	cover(value, apply) {
+		apply(this.leaf, value);
+	}
+};
+var ListNode = class ListNode {
+	path;
+	children;
+	constructor(children, path) {
+		this.path = path;
+		this.children = children;
+	}
+	mirror(read, slots, carrier, key) {
+		const mine = [];
+		carrier[key] = mine;
+		const slotcarrier = mine;
+		for (let i = 0; i < this.children.length; i++) this.children[i].mirror(read, slots, slotcarrier, i);
+	}
+	scatter(input, accept, apply) {
+		invariant(isArray(input), () => `Expected an array at ${describePath(this.path)}`);
+		invariant(input.length <= this.children.length, `Unknown channel '${joinPath(this.path, this.children.length)}'`);
+		for (let i = 0; i < input.length; i++) {
+			if (input[i] === void 0) continue;
+			this.children[i].scatter(input[i], accept, apply);
+		}
+	}
+	zip(theirs, fn) {
+		invariant(theirs instanceof ListNode && theirs.children.length === this.children.length, () => `Shape mismatch at ${describePath(this.path)}`);
+		for (let i = 0; i < this.children.length; i++) this.children[i].zip(theirs.children[i], fn);
+	}
+	broadcast(input, resolve, apply, label) {
+		const resolved = resolve(input, this.path);
+		if (resolved !== BRANCH) {
+			this.cover(resolved, apply);
+			return;
+		}
+		invariant(isArray(input), () => `Expected an array at ${describePath(this.path)} in ${label}`);
+		invariant(input.length <= this.children.length, () => `Unknown channel '${joinPath(this.path, this.children.length)}' in ${label}`);
+		for (let i = 0; i < input.length; i++) {
+			if (input[i] === void 0) continue;
+			this.children[i].broadcast(input[i], resolve, apply, label);
+		}
+	}
+	cover(value, apply) {
+		for (const child of this.children) child.cover(value, apply);
+	}
+};
+var RecordNode = class RecordNode {
+	path;
+	children;
+	constructor(children, path) {
+		this.path = path;
+		this.children = children;
+	}
+	mirror(read, slots, carrier, key) {
+		const mine = {};
+		carrier[key] = mine;
+		for (const [childKey, child] of this.children) child.mirror(read, slots, mine, childKey);
+	}
+	scatter(input, accept, apply) {
+		invariant(isRecord(input), () => `Expected an object at ${describePath(this.path)}`);
+		for (const key of Object.keys(input)) {
+			const value = input[key];
+			if (value === void 0) continue;
+			const child = this.children.get(key);
+			invariant(child !== void 0, () => `Unknown channel '${joinPath(this.path, key)}'`);
+			child.scatter(value, accept, apply);
+		}
+	}
+	zip(theirs, fn) {
+		invariant(theirs instanceof RecordNode && theirs.children.size === this.children.size, () => `Shape mismatch at ${describePath(this.path)}`);
+		for (const [key, child] of this.children) {
+			const their = theirs.children.get(key);
+			invariant(their !== void 0, () => `Shape mismatch at ${describePath(this.path)}`);
+			child.zip(their, fn);
+		}
+	}
+	broadcast(input, resolve, apply, label) {
+		const resolved = resolve(input, this.path);
+		if (resolved !== BRANCH) {
+			this.cover(resolved, apply);
+			return;
+		}
+		invariant(isRecord(input), () => `Expected an object at ${describePath(this.path)} in ${label}`);
+		for (const key of Object.keys(input)) {
+			const value = input[key];
+			if (value === void 0) continue;
+			const child = this.children.get(key);
+			invariant(child !== void 0, () => `Unknown channel '${joinPath(this.path, key)}' in ${label}`);
+			child.broadcast(value, resolve, apply, label);
+		}
+	}
+	cover(value, apply) {
+		for (const child of this.children.values()) child.cover(value, apply);
+	}
+};
+/**
+* A shape parsed into a node tree, paired with its leaves flattened in
+* depth-first shape order. `parser.match` decides leaf vs branch at every
+* position; the root must already be a container — callers validate that
+* (with their own message) before building. Nested non-containers and
+* empty nodes throw through `parser.mismatch`/`parser.empty`.
+*
+* Holds no behavior of its own: traversals run through `root`, and a live
+* view comes from `new ShapeView(root, read)`.
+*/
+var ShapeTree = class {
+	root;
+	leaves;
+	constructor(shape, parser) {
+		const leaves = [];
+		this.root = buildContainer(shape, "", parser, leaves);
+		this.leaves = leaves;
+	}
+};
+function buildContainer(shape, path, parser, leaves) {
+	if (isArray(shape)) {
+		invariant(shape.length > 0, () => parser.empty(path));
+		return new ListNode(shape.map((child, i) => buildChild(child, joinPath(path, i), parser, leaves)), path);
+	}
+	const keys = Object.keys(shape);
+	invariant(keys.length > 0, () => parser.empty(path));
+	const children = /* @__PURE__ */ new Map();
+	for (const key of keys) children.set(key, buildChild(shape[key], joinPath(path, key), parser, leaves));
+	return new RecordNode(children, path);
+}
+function buildChild(value, path, parser, leaves) {
+	const leaf = parser.match(value, path);
+	if (leaf !== void 0) {
+		leaves.push(leaf);
+		return new LeafNode(leaf, path);
+	}
+	invariant(isRecordOrArray(value), () => parser.mismatch(path));
+	return buildContainer(value, path, parser, leaves);
+}
+/**
+* A live view of a shape: `read(leaf)` at every leaf, mirrored into a stable
+* object — `refresh` rewrites the values in place through slots recorded at
+* construction, so per-frame reads do no traversal or allocation.
+*/
+var ShapeView = class {
+	root;
+	#read;
+	#slots = [];
+	constructor(root, read) {
+		this.#read = read;
+		const scratch = {};
+		root.mirror(read, this.#slots, scratch, "root");
+		this.root = scratch["root"];
+	}
+	/** Re-reads every leaf into the view. */
+	refresh() {
+		for (const slot of this.#slots) slot.carrier[slot.key] = this.#read(slot.leaf);
+	}
+};
+//#endregion
+//#region src/spring-source.ts
+/**
+* The property key that brands a `SpringSource` and holds the channel its
+* followers read. A registry symbol (`Symbol.for('coily/spring-source')`),
+* so sources from one copy of coily are recognized by another when a
+* bundle duplicates the library.
+*/
+const SpringSourceSymbol = Symbol.for("coily/spring-source");
+function isSpringSource(value) {
+	return typeof value === "object" && value !== null && SpringSourceSymbol in value;
+}
+const RECIPES = /* @__PURE__ */ new WeakMap();
+/** The flattened recipe behind `source`, when it is a derived source. */
+function recipeOf(source) {
+	return RECIPES.get(source);
+}
+/**
+* Registers a derived source's recipe. Every source built on other
+* sources must register at creation: `mapSpring` composition and
+* `resolveLeaderMotions` both reach a derivation's roots through the
+* registry rather than through the wrapper object.
+*/
+function registerRecipe(source, recipe) {
+	RECIPES.set(source, recipe);
+}
+function applyFns(fns, value) {
+	let result = value;
+	for (const fn of fns) result = fn(result);
+	return result;
+}
+function sourceMismatch(path) {
+	return `Invalid value at ${describePath(path)}: expected a SpringSource or a nested shape of SpringSources`;
+}
+/**
+* Parses a shape of sources into a live view, collecting subscription
+* roots along the way (a mapped leaf contributes its recipe's roots and
+* reads through its pipeline). Structure is validated once at creation;
+* reads refresh a stable mirror through the view's slots, so per-update
+* reads do no traversal or allocation.
+*/
+function compileShape(shape, roots) {
+	const { root } = new ShapeTree(shape, {
+		match(value) {
+			if (!isSpringSource(value)) return void 0;
+			const recipe = RECIPES.get(value);
+			if (recipe) {
+				roots.push(...recipe.sources);
+				return () => applyFns(recipe.fns, recipe.read());
+			}
+			roots.push(value);
+			const api = value[SpringSourceSymbol];
+			return () => api.value;
+		},
+		mismatch: sourceMismatch,
+		empty: (path) => `Invalid value at ${describePath(path)}: a shape must contain at least one source`
+	});
+	return new ShapeView(root, (leaf) => leaf());
+}
+function mapSpring(source, map) {
+	const compute = map;
+	let recipe;
+	if (isSpringSource(source)) {
+		const flat = RECIPES.get(source);
+		if (flat) recipe = {
+			sources: flat.sources,
+			read: flat.read,
+			fns: [...flat.fns, compute]
+		};
+		else {
+			const api = source[SpringSourceSymbol];
+			recipe = {
+				sources: [source],
+				read: () => api.value,
+				fns: [compute]
+			};
+		}
+	} else {
+		invariant(isRecordOrArray(source), () => sourceMismatch(""));
+		const roots = [];
+		const view = compileShape(source, roots);
+		recipe = {
+			sources: [...new Set(roots)],
+			read: () => {
+				view.refresh();
+				return view.root;
+			},
+			fns: [compute]
+		};
+	}
+	const { sources, read, fns } = recipe;
+	const single = sources.length === 1 ? sources[0][SpringSourceSymbol] : null;
+	const apis = single ? null : sources.map((leaf) => leaf[SpringSourceSymbol]);
+	const mapped = Object.freeze({ [SpringSourceSymbol]: Object.freeze({
+		get value() {
+			return applyFns(fns, read());
+		},
+		onUpdate: single ? (callback) => single.onUpdate(callback) : (callback) => {
+			const unsubscribes = apis.map((api) => api.onUpdate(callback));
+			return () => {
+				for (const unsubscribe of unsubscribes) unsubscribe();
+			};
+		},
+		onDispose: single ? (callback) => single.onDispose(callback) : (callback) => {
+			let fired = false;
+			const unsubscribes = apis.map((api) => api.onDispose(() => {
+				if (fired) return;
+				fired = true;
+				for (const unsubscribe of unsubscribes) unsubscribe();
+				callback();
+			}));
+			return () => {
+				for (const unsubscribe of unsubscribes) unsubscribe();
+			};
+		}
+	}) });
+	RECIPES.set(mapped, recipe);
+	return mapped;
+}
+//#endregion
+//#region src/follow-graph.ts
+const MOTION_BACKING = /* @__PURE__ */ new WeakMap();
+/**
+* Records what advances `source`: its own `Motion` for a scalar spring,
+* or the aggregated sources whose own registrations lead to motions (a
+* composite registers its channel springs). Called from the
+* `SpringSourceSymbol` brand getters on every api read — lazily, so
+* springs never used as sources stay out of the weak registry, and
+* idempotently, so repeated reads just overwrite the entry.
+*/
+function registerBacking(source, backing) {
+	MOTION_BACKING.set(source, backing);
+}
+/**
+* Resolves the motions behind `source`, deduplicated: every spring
+* reached through any chain of derivations — `mapSpring` pipelines,
+* `velocityOf`/`accelerationOf` wrappers, composite channels. A foreign
+* source resolves to nothing: it imposes no tick-ordering constraint and
+* couples through its emitter alone.
+*/
+function resolveLeaderMotions(source) {
+	const leaders = /* @__PURE__ */ new Set();
+	collectInto(source, leaders);
+	return [...leaders];
+}
+function collectInto(source, leaders) {
+	const recipe = recipeOf(source);
+	if (recipe) {
+		for (const root of recipe.sources) collectInto(root, leaders);
+		return;
+	}
+	let backing = MOTION_BACKING.get(source);
+	if (backing === void 0 && isSpringSource(source)) {
+		const api = source[SpringSourceSymbol];
+		backing = MOTION_BACKING.get(source);
+		if (backing === void 0 && typeof api === "object" && api !== null && api !== source) {
+			collectInto(api, leaders);
+			return;
+		}
+	}
+	if (backing === void 0) return;
+	if (backing instanceof Motion) leaders.add(backing);
+	else for (const part of backing) collectInto(part, leaders);
+}
+const NO_LEADERS = [];
+/**
+* The follow graph as a walkable structure: one edge per following
+* motion, and a cached dependency rank over every motion the edges
+* touch. `MotionSet` owns one; springs register and unregister edges as
+* follows are wired and torn down. What the tick reads per motion —
+* `_edge`, `_followers`, `_rank` — lives on the motions themselves;
+* this class is their writer.
+*/
+var FollowGraph = class {
+	#edges = /* @__PURE__ */ new Map();
+	/** Motions holding a rank from the last recompute, so stale ranks reset to -1. */
+	#ranked = [];
+	/** Motions holding a follower list from the last recompute, so stale lists reset to null. */
+	#withFollowers = [];
+	/** Edge list mirroring the map, rebuilt with the ranks, so the per-frame plan pass iterates an array. */
+	#edgeList = [];
+	#dirty = false;
+	/** Whether no edges are registered, letting the tick skip ordering work entirely. */
+	get isEmpty() {
+		return this.#edges.size === 0;
+	}
+	/** Every registered edge, valid after `ensureOrder`; the plan pass walks this once per frame. */
+	get edges() {
+		return this.#edgeList;
+	}
+	/**
+	* Registers `edge`, replacing any edge with the same follower: a
+	* spring follows at most one source at a time.
+	*/
+	addEdge(edge) {
+		this.#edges.set(edge.follower, edge);
+		edge.follower._edge = edge;
+		this.#dirty = true;
+	}
+	/** Drops the edge whose follower is `motion`, if one is registered. */
+	removeEdge(follower) {
+		if (this.#edges.delete(follower)) {
+			follower._edge = null;
+			this.#dirty = true;
+		}
+	}
+	/**
+	* Recomputes ranks if an edge was added or removed since the last
+	* call; clean calls return immediately. Afterward, motions the graph
+	* touches hold ranks counting up from 0 with every leader ranked
+	* before its followers, members of a cycle rank in ascending creation
+	* id, and motions outside the graph hold -1. Ranks are canonical: a
+	* function of graph structure and creation order, never of wiring
+	* order.
+	*/
+	ensureOrder() {
+		if (!this.#dirty) return;
+		this.#dirty = false;
+		this.#recompute();
+	}
+	#recompute() {
+		for (const motion of this.#ranked) motion._rank = -1;
+		for (const motion of this.#withFollowers) motion._followers = null;
+		const withFollowers = [];
+		for (const edge of this.#edges.values()) for (const leader of edge.leaders) {
+			if (leader._followers === null) {
+				leader._followers = [];
+				withFollowers.push(leader);
+			}
+			leader._followers.push(edge);
+		}
+		this.#withFollowers = withFollowers;
+		const nodes = /* @__PURE__ */ new Set();
+		for (const [follower, edge] of this.#edges) {
+			nodes.add(follower);
+			for (const leader of edge.leaders) nodes.add(leader);
+		}
+		const roots = [...nodes].sort((a, b) => a._id - b._id);
+		const indexOf = /* @__PURE__ */ new Map();
+		const lowOf = /* @__PURE__ */ new Map();
+		const onStack = /* @__PURE__ */ new Set();
+		const stack = [];
+		const ranked = [];
+		const sccOf = /* @__PURE__ */ new Map();
+		let index = 0;
+		let rank = 0;
+		let scc = 0;
+		for (const root of roots) {
+			if (indexOf.has(root)) continue;
+			const frames = [{
+				node: root,
+				leaders: this.#leadersOf(root),
+				next: 0
+			}];
+			indexOf.set(root, index);
+			lowOf.set(root, index);
+			index++;
+			stack.push(root);
+			onStack.add(root);
+			while (frames.length > 0) {
+				const frame = frames.at(-1);
+				if (frame.next < frame.leaders.length) {
+					const leader = frame.leaders[frame.next++];
+					const seen = indexOf.get(leader);
+					if (seen === void 0) {
+						indexOf.set(leader, index);
+						lowOf.set(leader, index);
+						index++;
+						stack.push(leader);
+						onStack.add(leader);
+						frames.push({
+							node: leader,
+							leaders: this.#leadersOf(leader),
+							next: 0
+						});
+					} else if (onStack.has(leader)) lowOf.set(frame.node, Math.min(lowOf.get(frame.node), seen));
+				} else {
+					frames.pop();
+					const low = lowOf.get(frame.node);
+					const parent = frames.at(-1);
+					if (parent !== void 0) lowOf.set(parent.node, Math.min(lowOf.get(parent.node), low));
+					if (low === indexOf.get(frame.node)) {
+						const members = [];
+						let member;
+						do {
+							member = stack.pop();
+							onStack.delete(member);
+							members.push(member);
+						} while (member !== frame.node);
+						members.sort((a, b) => a._id - b._id);
+						for (const motion of members) {
+							motion._rank = rank++;
+							sccOf.set(motion, scc);
+							ranked.push(motion);
+						}
+						scc++;
+					}
+				}
+			}
+		}
+		this.#ranked = ranked;
+		const edgeList = [...this.#edges.values()];
+		for (const edge of edgeList) {
+			const home = sccOf.get(edge.follower);
+			edge._cyclic = edge.leaders.some((leader) => sccOf.get(leader) === home);
+		}
+		this.#edgeList = edgeList;
+	}
+	#leadersOf(motion) {
+		return this.#edges.get(motion)?.leaders ?? NO_LEADERS;
+	}
+};
+//#endregion
+//#region src/motion-set.ts
+function compareMotions(a, b) {
+	return a._rank - b._rank || a._id - b._id;
+}
+const MAX_SUBSTEPS = 8;
+/**
+* A binary min-heap over (rank, creation id): the ordered pass worklist.
+* Duplicate pushes are expected — the tick's pass marker deduplicates at
+* pop.
+*/
+var MotionHeap = class {
+	#items = [];
+	clear() {
+		this.#items.length = 0;
+	}
+	push(motion) {
+		const items = this.#items;
+		let hole = items.length;
+		items.push(motion);
+		while (hole > 0) {
+			const parent = hole - 1 >> 1;
+			if (compareMotions(items[parent], motion) <= 0) break;
+			items[hole] = items[parent];
+			hole = parent;
+		}
+		items[hole] = motion;
+	}
+	pop() {
+		const items = this.#items;
+		if (items.length === 0) return void 0;
+		const top = items[0];
+		const last = items.pop();
+		if (items.length > 0) {
+			let hole = 0;
+			for (;;) {
+				const left = 2 * hole + 1;
+				if (left >= items.length) break;
+				const right = left + 1;
+				const child = right < items.length && compareMotions(items[right], items[left]) < 0 ? right : left;
+				if (compareMotions(last, items[child]) <= 0) break;
+				items[hole] = items[child];
+				hole = child;
+			}
+			items[hole] = last;
+		}
+		return top;
+	}
+};
+/**
+* The set of motions currently moving. Motions leave the set as they
+* rest and re-enter on any write that disturbs them; `onWake` tells the
+* ticker the set became non-empty so it can stop sleeping.
+*/
+var MotionSet = class {
+	reduced = false;
+	onWake = null;
+	/**
+	* The coupling error budget, in value units: the local per-frame error
+	* the sub-step controller targets on each follow edge, floored by the
+	* follower's resting magnitude. `SpringSystem` exposes it as the
+	* `couplingTolerance` option and property; validation lives there.
+	*/
+	couplingTolerance = .1;
+	flushes = new FlushQueue();
+	/** Follow edges registered by following springs, with the dependency rank over their motions. */
+	graph = new FollowGraph();
+	#motions = /* @__PURE__ */ new Set();
+	#heap = new MotionHeap();
+	#advanced = [];
+	/** The live pass worklist while an advance phase runs, so mid-phase wakes join it. */
+	#activeHeap = null;
+	/** Whether any tick is on the stack, settle sweep included — a reentrant advance must not share the pass structures. */
+	#inTick = false;
+	#debug;
+	#lastSize = 0;
+	#pass = 0;
+	/** Ordered-frame counter: sub-steps share one id, deduplicating the settle list. */
+	#frame = 0;
+	constructor(debug = false) {
+		this.#debug = debug;
+	}
+	get size() {
+		return this.#motions.size;
+	}
+	add(motion) {
+		const wasEmpty = this.#motions.size === 0;
+		this.#motions.add(motion);
+		this.#activeHeap?.push(motion);
+		if (wasEmpty) this.onWake?.();
+	}
+	remove(motion) {
+		this.#motions.delete(motion);
+	}
+	finishAll() {
+		this.flushes.batch(() => {
+			for (const motion of this.#motions) {
+				if (!motion.respectsReducedMotion) continue;
+				motion.finish();
+				this.#motions.delete(motion);
+			}
+		});
+	}
+	tick(dt) {
+		const reentrant = this.#inTick;
+		this.#inTick = true;
+		this.flushes.enter();
+		try {
+			this.graph.ensureOrder();
+			if (this.graph.isEmpty) this.#tickUnordered(dt, reentrant);
+			else this.#tickOrdered(dt, reentrant);
+		} finally {
+			this.#inTick = reentrant;
+			this.flushes.exit();
+		}
+		if (this.#debug && this.#motions.size !== this.#lastSize) {
+			this.#lastSize = this.#motions.size;
+			console.log(`coily: ${this.#lastSize} active motions`);
+		}
+	}
+	/** The no-edge fast path: nothing constrains order, so insertion order serves for free. */
+	#tickUnordered(dt, reentrant) {
+		this.#pass++;
+		const advanced = reentrant ? [] : this.#advanced;
+		advanced.length = 0;
+		for (const motion of this.#motions) {
+			if (motion._pass === this.#pass) continue;
+			motion._pass = this.#pass;
+			motion._advance(dt);
+			advanced.push(motion);
+			if (motion.isResting) this.#motions.delete(motion);
+		}
+		this.#settle(advanced);
+	}
+	#tickOrdered(dt, reentrant) {
+		const heap = reentrant ? new MotionHeap() : this.#heap;
+		const advanced = reentrant ? [] : this.#advanced;
+		const previous = this.#activeHeap;
+		this.#activeHeap = heap;
+		advanced.length = 0;
+		const frame = ++this.#frame;
+		let demand = 1;
+		if (!this.reduced) {
+			for (const edge of this.graph.edges) if (this.#shouldPlan(edge)) {
+				const k = edge.plan(dt);
+				if (k > demand) demand = k;
+			}
+		}
+		const K = Math.min(demand, MAX_SUBSTEPS);
+		const h = dt / K;
+		try {
+			for (let step = 0; step < K; step++) this.#advancePass(dt, h, step === 0, heap, advanced, frame);
+		} finally {
+			this.#activeHeap = previous;
+		}
+		this.#settle(advanced);
+	}
+	#advancePass(dt, h, first, heap, advanced, frame) {
+		this.#pass++;
+		heap.clear();
+		for (const motion of this.#motions) {
+			if (!first && motion._rank === -1) continue;
+			heap.push(motion);
+		}
+		for (let motion = heap.pop(); motion !== void 0; motion = heap.pop()) {
+			if (motion._pass === this.#pass) continue;
+			const edge = motion._edge;
+			if (edge !== null && this.#shouldRecouple(edge)) edge.recouple(h);
+			if (!this.#motions.has(motion)) continue;
+			motion._pass = this.#pass;
+			motion._advance(motion._rank === -1 ? dt : h);
+			if (motion._frame !== frame) {
+				motion._frame = frame;
+				advanced.push(motion);
+			}
+			if (motion.isResting) this.#motions.delete(motion);
+			const followers = motion._followers;
+			if (followers !== null) for (const out of followers) heap.push(out.follower);
+		}
+	}
+	#settle(advanced) {
+		for (const motion of advanced) motion._settleFrame();
+	}
+	#shouldRecouple(edge) {
+		for (const leader of edge.leaders) if (leader._pass === this.#pass || this.#motions.has(leader)) return true;
+		return false;
+	}
+	#shouldPlan(edge) {
+		for (const leader of edge.leaders) if (this.#motions.has(leader)) return true;
+		return false;
+	}
+};
+//#endregion
+//#region src/spring.ts
+/**
+* One animated number, driven toward its target with damped spring
+* motion. Create springs with `SpringSystem.createSpring`; the owning
+* system advances them, so a spring only moves while its system runs.
+*
+* Reads return the exact simulated state; nothing is rounded. Numeric
+* writes — `target`, `value`, `velocity`, `jumpTo` — require finite
+* numbers: `NaN` or an infinity throws rather than poisoning the
+* simulation. See
+* https://github.com/tkofh/coily/blob/main/PRECISION.md for the
+* numerical contract.
+*/
+var Spring = class {
+	/** Brands the spring as a `KinematicSource` whose api is the spring itself. */
+	get [SpringSourceSymbol]() {
+		registerBacking(this, this.#motion);
+		return this;
+	}
+	#target;
+	#config;
+	#purpose;
+	#motion;
+	#motions;
+	#leader = null;
+	#unsubLeader = null;
+	#settled = null;
+	#resolveSettled = null;
+	#disposed = false;
+	constructor(motions, value, config, purpose = "motion") {
+		invariant(Number.isFinite(value), "Spring value must be a finite number");
+		invariant(purpose === "motion" || purpose === "appearance", "Spring purpose must be 'motion' or 'appearance'");
+		this.#motions = motions;
+		this.#config = config ?? SpringDefinition.default;
+		this.#target = value;
+		this.#purpose = purpose;
+		this.#motion = new Motion(this.#config, 0, 0);
+		this.#motion.respectsReducedMotion = purpose === "motion";
+	}
+	/**
+	* The value the spring is animating toward. While following a source,
+	* reads return the source's value as of its last update.
+	*
+	* Assignment accepts any `SpringTarget`:
+	* - A number retargets the spring. The current value and momentum carry
+	*   over, so mid-flight retargets stay smooth. Assigning a number while
+	*   following also stops the following.
+	* - A `SpringSource` — a `Spring`, or a value derived with `mapSpring` —
+	*   makes this spring follow the source's live value.
+	*
+	* Under reduced motion, retargets apply instantly — unless `purpose` is
+	* `'appearance'`, in which case they animate as normal.
+	*/
+	get target() {
+		return this.#target;
+	}
+	set target(value) {
+		if (typeof value === "number") {
+			this.#unfollow();
+			this.#setTarget(value);
+		} else {
+			invariant(isSpringSource(value), "Spring target must be a number or a SpringSource");
+			invariant(typeof value[SpringSourceSymbol].value === "number", "A spring can only follow a scalar SpringSource; derive one from a composite with mapSpring");
+			this.#follow(value);
+		}
+	}
+	/**
+	* The current animated value: the target plus the remaining
+	* displacement.
+	*
+	* Writing displaces the spring: it keeps its target and springs back
+	* from the written value, notifying update listeners synchronously.
+	* Writing the current value is a no-op. Under reduced motion a write
+	* jumps the spring — target included — to the written value, unless
+	* `purpose` is `'appearance'`, in which case it displaces as normal.
+	*/
+	get value() {
+		return this.#target + this.#motion.position;
+	}
+	set value(value) {
+		invariant(Number.isFinite(value), "Spring value must be a finite number");
+		if (this.#motions.reduced && this.#purpose === "motion") {
+			if (value !== this.value) this.jumpTo(value);
+			return;
+		}
+		const position = value - this.#target;
+		if (position !== this.#motion.position) {
+			this.#motions.add(this.#motion);
+			this.#motion.position = position;
+			this.#motion.tick(0);
+		}
+	}
+	/**
+	* The current velocity, in value units per second.
+	*
+	* Writing flings the spring: motion continues from the current value
+	* with the written velocity, then settles back to the target. Under
+	* reduced motion writes are ignored, unless `purpose` is `'appearance'`,
+	* in which case the fling applies as normal.
+	*/
+	get velocity() {
+		return this.#motion.velocity;
+	}
+	set velocity(value) {
+		invariant(Number.isFinite(value), "Spring velocity must be a finite number");
+		if (this.#motions.reduced && this.#purpose === "motion") return;
+		this.#motions.add(this.#motion);
+		this.#motion.velocity = value;
+	}
+	/**
+	* The current acceleration, in value units per second squared — how
+	* fast the velocity is changing. Read-only: acceleration is the
+	* spring's stiffness and friction acting on its current displacement
+	* and velocity, so it follows from the motion rather than being set.
+	* To fling the spring, write `velocity` instead.
+	*/
+	get acceleration() {
+		const { tension, damping, mass } = this.#config;
+		return -(tension * this.#motion.position + damping * this.#motion.velocity) / mass;
+	}
+	/**
+	* What the spring animates — `'motion'` or `'appearance'` — fixed when
+	* it was created. An `'appearance'` spring opts out of reduced motion:
+	* it keeps animating where a `'motion'` spring snaps to its target. See
+	* `Purpose`.
+	*/
+	get purpose() {
+		return this.#purpose;
+	}
+	/**
+	* The spring's `SpringDefinition`: the one it was created with or last
+	* assigned, otherwise `SpringDefinition.default`. Following a source
+	* never changes it — how a spring chases its target is the spring's
+	* own setting.
+	*
+	* Assigning a config reconfigures the spring in place — value and
+	* velocity are preserved, so mid-flight reconfigures stay smooth.
+	* Assigning `null` reverts to the default.
+	*/
+	get config() {
+		return this.#config;
+	}
+	/** The config's mass. */
+	get mass() {
+		return this.#config.mass;
+	}
+	/** The config's tension (stiffness). */
+	get tension() {
+		return this.#config.tension;
+	}
+	/** The config's damping (friction). */
+	get damping() {
+		return this.#config.damping;
+	}
+	/** The config's damping ratio. */
+	get dampingRatio() {
+		return this.#config.dampingRatio;
+	}
+	/** The config's resting precision. */
+	get precision() {
+		return this.#config.precision;
+	}
+	/** The config's arrival multiplier. */
+	get arrival() {
+		return this.#config.arrival;
+	}
+	set config(value) {
+		const next = value ?? SpringDefinition.default;
+		if (this.#config === next) return;
+		this.#config = next;
+		this.#motion.configure(next);
+		if (!this.#motion.isResting) this.#motions.add(this.#motion);
+	}
+	/**
+	* Milliseconds until the spring rests: 0 while resting, Infinity when
+	* the motion never settles. The time is solved from the motion, not
+	* estimated — the spring is resting at the first tick at or after it,
+	* and a bouncy spring can rest up to one oscillation earlier when a
+	* frame samples a low pulse. When the config's `arrival` is 0, it is
+	* capped at the exact ms of the first target crossing.
+	*/
+	get timeRemaining() {
+		return this.#motion.timeRemaining;
+	}
+	/**
+	* Whether the spring's remaining motion is inside its resting
+	* threshold. Resting springs cost nothing until the next write. See
+	* https://github.com/tkofh/coily/blob/main/PRECISION.md for the rest
+	* test.
+	*/
+	get isResting() {
+		return this.#motion.isResting;
+	}
+	/**
+	* A promise that resolves when the spring next comes to rest — already
+	* resolved while resting or after dispose. Retargeting mid-flight
+	* extends the wait; disposing resolves it.
+	*
+	* @example
+	* ```ts
+	* spring.target = 300
+	* await spring.settled
+	* // the spring is at 300 and resting
+	* ```
+	*/
+	get settled() {
+		if (this.#disposed || this.#motion.isResting) return RESOLVED;
+		this.#settled ??= new Promise((resolve) => {
+			this.#resolveSettled = resolve;
+			const unsubscribe = this.onStop(() => {
+				unsubscribe();
+				this.#settled = null;
+				this.#resolveSettled = null;
+				resolve();
+			});
+		});
+		return this.#settled;
+	}
+	/**
+	* Snaps the spring to `value` with no animation: target and value both
+	* become `value` and velocity clears. Listeners are notified
+	* synchronously — `update`, plus `stop` if the spring was moving.
+	*/
+	jumpTo(value) {
+		invariant(Number.isFinite(value), "Spring value must be a finite number");
+		this.#target = value;
+		this.#motion.finish();
+	}
+	/**
+	* Releases the spring permanently: stops following, detaches followers
+	* (each keeps its current target), resolves `settled`, and notifies
+	* dispose listeners. Calling it again is a no-op.
+	*
+	* A disposed spring keeps its final value readable; writes throw.
+	*/
+	dispose() {
+		if (this.#disposed) return;
+		this.#disposed = true;
+		if (this.#resolveSettled) {
+			this.#resolveSettled();
+			this.#settled = null;
+			this.#resolveSettled = null;
+		}
+		if (this.#unsubLeader) {
+			this.#unsubLeader();
+			this.#unsubLeader = null;
+			this.#leader = null;
+		}
+		this.#motions.remove(this.#motion);
+		this.#motion.dispose();
+	}
+	/**
+	* Subscribes to value changes: every tick the spring moves, plus
+	* synchronous `value` writes and `jumpTo` calls. Returns an unsubscribe
+	* function.
+	*/
+	onUpdate(callback) {
+		return this.#motion.onUpdate(callback);
+	}
+	/**
+	* Subscribes to the spring leaving rest. `start` and `stop` always
+	* alternate; retargeting mid-flight fires neither. Returns an
+	* unsubscribe function.
+	*/
+	onStart(callback) {
+		return this.#motion.onStart(callback);
+	}
+	/**
+	* Subscribes to the spring coming to rest, whether by settling or by
+	* `jumpTo`. Always alternates with `start`. Returns an unsubscribe
+	* function.
+	*/
+	onStop(callback) {
+		return this.#motion.onStop(callback);
+	}
+	/** Subscribes to `dispose`, which fires once. Returns an unsubscribe function. */
+	onDispose(callback) {
+		return this.#motion.onDispose(callback);
+	}
+	#setTarget(value) {
+		invariant(Number.isFinite(value), "Spring target must be a finite number");
+		if (value !== this.#target) {
+			if (this.#motions.reduced && this.#purpose === "motion") {
+				this.jumpTo(value);
+				return;
+			}
+			this.#motions.add(this.#motion);
+			const current = this.value;
+			this.#target = value;
+			this.#motion.position = current - this.#target;
+			this.#motion.tick(0, false);
+		}
+	}
+	#follow(source) {
+		this.#unsubLeader?.();
+		this.#leader = source;
+		const api = source[SpringSourceSymbol];
+		const unsubUpdate = api.onUpdate(() => {
+			this.#setTarget(api.value);
+		});
+		const unsubDispose = api.onDispose(() => {
+			this.#unfollow();
+		});
+		const leaders = resolveLeaderMotions(source);
+		if (leaders.length > 0) {
+			const edge = {
+				follower: this.#motion,
+				leaders,
+				_cyclic: false,
+				_prevValue: 0,
+				_d1: 0,
+				_d2: 0,
+				recouple: (h) => {
+					if (edge._cyclic || h === 0 || this.#config.arrival !== 1 || this.#motions.reduced && this.#purpose === "motion") {
+						this.#setTarget(api.value);
+						return;
+					}
+					const value = api.value;
+					invariant(Number.isFinite(value), "Spring target must be a finite number");
+					if (value === this.#target) return;
+					this.#motions.add(this.#motion);
+					this.#motion._ramp = (value - this.#target) / h;
+					this.#target = value;
+				},
+				plan: (dt) => {
+					const target = this.#target;
+					const d = target - edge._prevValue;
+					edge._d2 = edge._d1;
+					edge._d1 = d;
+					edge._prevValue = target;
+					let dHat = Math.abs(d);
+					let error = Math.abs(d - edge._d2) / 8;
+					for (const leader of leaders) if (leader._manifoldDeviation() > 4 * Math.abs(d)) {
+						const accel = Math.abs(leader._acceleration());
+						const speed = Math.abs(leader.velocity);
+						dHat = Math.max(dHat, speed * dt + .5 * accel * dt * dt);
+						error = Math.max(error, accel * dt * dt / 8);
+					}
+					const tol = Math.max(this.#config.restingMagnitude, this.#motions.couplingTolerance);
+					return edge._cyclic || this.#config.arrival !== 1 ? Math.ceil(dHat / (2 * tol)) : Math.ceil(Math.sqrt(error / tol));
+				}
+			};
+			this.#motions.graph.addEdge(edge);
+			this.#unsubLeader = () => {
+				unsubUpdate();
+				unsubDispose();
+				this.#motions.graph.removeEdge(this.#motion);
+			};
+			this.#setTarget(api.value);
+			edge._prevValue = this.#target;
+			return;
+		}
+		this.#unsubLeader = () => {
+			unsubUpdate();
+			unsubDispose();
+			this.#motions.graph.removeEdge(this.#motion);
+		};
+		this.#setTarget(api.value);
+	}
+	#unfollow() {
+		if (!this.#leader) return;
+		this.#unsubLeader();
+		this.#unsubLeader = null;
+		this.#leader = null;
+	}
+};
+//#endregion
+//#region src/composite-spring.ts
+function invalidConfig(path) {
+	return `Invalid config for ${describePath(path)}: expected a SpringDefinition, null, or a config shape matching the value`;
+}
+/**
+* Decides what a config node means: `null` and `SpringDefinition` instances are
+* configs covering the whole subtree, any other object or array is a config
+* shape to descend into (its structure is checked on the way down), and
+* anything else — a bare number, string, or options object — is invalid.
+*/
+function resolveConfigNode(node, path) {
+	if (node === null) return null;
+	if (node instanceof SpringDefinition) return node;
+	if (isRecordOrArray(node)) return BRANCH;
+	throw new Error(invalidConfig(path));
+}
+function invalidPurpose(path) {
+	return `Invalid purpose for ${describePath(path)}: expected 'motion', 'appearance', or a purpose shape matching the value`;
+}
+/**
+* Decides what a purpose node means: a `Purpose` string covers the whole
+* subtree, any object or array is a purpose shape to descend into, and
+* anything else is invalid.
+*/
+function resolvePurposeNode(node, path) {
+	if (node === "motion" || node === "appearance") return node;
+	if (isRecordOrArray(node)) return BRANCH;
+	throw new Error(invalidPurpose(path));
+}
+const readTarget = (spring) => spring.target;
+const readValue = (spring) => spring.value;
+const readVelocity = (spring) => spring.velocity;
+const readAcceleration = (spring) => spring.acceleration;
+/**
+* The target scatter's leaf guard: a channel animates toward a number,
+* or follows a scalar source. Checked here so the error carries the
+* channel's path.
+*/
+function acceptChannelTarget(input, path) {
+	invariant(isNumber(input) && Number.isFinite(input) || isSpringSource(input) && typeof input[SpringSourceSymbol].value === "number", () => `Invalid value at '${path}': expected a finite number or a scalar SpringSource`);
+	return input;
+}
+const assignTarget = (spring, value) => {
+	spring.target = value;
+};
+const assignValue = (spring, value) => {
+	spring.value = value;
+};
+const assignVelocity = (spring, value) => {
+	spring.velocity = value;
+};
+const applyJump = (spring, value) => {
+	spring.jumpTo(value);
+};
+const assignConfig = (spring, config) => {
+	spring.config = config;
+};
+const followChannel = (mine, theirs) => {
+	mine.target = theirs;
+};
+/**
+* A composite spring over a fixed numeric shape — a nested plain object
+* or array whose leaves are all numbers. Each leaf runs an independent
+* spring, called a channel, behind one API: targets, values, velocities,
+* and configs read and write as (partial) shapes, and events are
+* coalesced across channels. Create composite springs with
+* `SpringSystem.createSpring`.
+*
+* A composite spring is a `SpringSource` of its value shape: `mapSpring`
+* derives scalar sources from it — alone or at the leaves of a shape —
+* which springs can then follow. Only scalar sources are followable
+* directly.
+*
+* The shape is fixed at construction. Writes naming unknown channels
+* throw with the channel's path (`position.z`), and so do non-finite
+* channel values.
+*/
+var CompositeSpring = class CompositeSpring {
+	/** Brands the composite as a `KinematicSource` whose api is the composite itself. */
+	get [SpringSourceSymbol]() {
+		registerBacking(this, this.#tree.leaves);
+		return this;
+	}
+	#motions;
+	#tree;
+	#valueView;
+	#targetView = null;
+	#velocityView = null;
+	#accelerationView = null;
+	#emitter = new Emitter();
+	#running = false;
+	#dirty = false;
+	#settled = null;
+	#resolveSettled = null;
+	#disposed = false;
+	#flush = () => {
+		if (this.#disposed) return;
+		if (this.#dirty) {
+			this.#dirty = false;
+			this.#emitter.emit("update");
+		}
+		if (this.#running) {
+			if (this.isResting) {
+				this.#running = false;
+				this.#emitter.emit("stop");
+			}
+		} else if (!this.isResting) {
+			this.#running = true;
+			this.#emitter.emit("start");
+		}
+	};
+	constructor(motions, value, config, purpose) {
+		this.#motions = motions;
+		invariant(isRecordOrArray(value), "Composite spring value must be a plain object or an array of numeric channels");
+		let purposeByPath = null;
+		if (purpose !== void 0) {
+			const byPath = /* @__PURE__ */ new Map();
+			new ShapeTree(value, channelParser((_leafValue, path) => path)).root.broadcast(purpose, resolvePurposeNode, (path, p) => byPath.set(path, p), "purpose");
+			purposeByPath = byPath;
+		}
+		this.#tree = new ShapeTree(value, channelParser((leafValue, path) => new Spring(motions, leafValue, void 0, purposeByPath?.get(path) ?? "motion")));
+		if (config !== void 0) this.#tree.root.broadcast(config, resolveConfigNode, assignConfig, "config");
+		this.#valueView = new ShapeView(this.#tree.root, readValue);
+		const markDirty = () => {
+			this.#dirty = true;
+			this.#motions.flushes.request(this.#flush);
+		};
+		const schedule = () => {
+			this.#motions.flushes.request(this.#flush);
+		};
+		for (const channel of this.#tree.leaves) {
+			channel.onUpdate(markDirty);
+			channel.onStart(schedule);
+			channel.onStop(schedule);
+		}
+	}
+	/**
+	* The value each channel is animating toward, as a read-only mirror of
+	* the shape. The mirror object is reused: every read refreshes its
+	* numbers in place, so read it fresh rather than holding it across
+	* frames.
+	*
+	* Assignment accepts a `CompositeSpringTarget`:
+	* - A partial shape retargets the channels it names and leaves the
+	*   others alone. Each named channel takes a number, or a scalar
+	*   `SpringSource` to follow — a `Spring`, or a value derived with
+	*   `mapSpring`. While following a leader, naming a channel also
+	*   detaches that channel from it.
+	* - A `CompositeSpring` of the same shape follows the leader channel by
+	*   channel.
+	*
+	* Unknown channels throw with their path.
+	*/
+	get target() {
+		const view = this.#targetView ??= new ShapeView(this.#tree.root, readTarget);
+		view.refresh();
+		return view.root;
+	}
+	set target(value) {
+		if (value instanceof CompositeSpring) this.#follow(value);
+		else this.#motions.flushes.batch(() => {
+			this.#tree.root.scatter(value, acceptChannelTarget, assignTarget);
+		});
+	}
+	/**
+	* The current animated value of every channel, as a read-only mirror of
+	* the shape. The mirror object is reused: every read refreshes its
+	* numbers in place, so read it fresh rather than holding it across
+	* frames.
+	*
+	* Assignment takes a partial shape and displaces the channels it names:
+	* each keeps its target and springs back from the written value, with
+	* one coalesced `update` fired synchronously. Under reduced motion a
+	* write jumps the named channels — targets included — except channels
+	* whose `purpose` is `'appearance'`, which displace as normal.
+	*/
+	get value() {
+		this.#valueView.refresh();
+		return this.#valueView.root;
+	}
+	set value(value) {
+		this.#motions.flushes.batch(() => {
+			this.#tree.root.scatter(value, acceptNumber, assignValue);
+		});
+	}
+	/**
+	* The current velocity of every channel in value units per second, as a
+	* read-only mirror of the shape — reused and refreshed in place on each
+	* read.
+	*
+	* Assignment takes a partial shape and flings the channels it names;
+	* the rest are untouched. Under reduced motion writes are ignored,
+	* except on channels whose `purpose` is `'appearance'`.
+	*/
+	get velocity() {
+		const view = this.#velocityView ??= new ShapeView(this.#tree.root, readVelocity);
+		view.refresh();
+		return view.root;
+	}
+	set velocity(value) {
+		this.#motions.flushes.batch(() => {
+			this.#tree.root.scatter(value, acceptNumber, assignVelocity);
+		});
+	}
+	/**
+	* The current acceleration of every channel in value units per second
+	* squared, as a read-only mirror of the shape — reused and refreshed in
+	* place on each read. Read-only, like each channel's: acceleration
+	* follows from the motion. To fling channels, write `velocity`.
+	*/
+	get acceleration() {
+		const view = this.#accelerationView ??= new ShapeView(this.#tree.root, readAcceleration);
+		view.refresh();
+		return view.root;
+	}
+	/**
+	* The shared config when every channel resolves to the same
+	* `SpringDefinition`, and `null` when they differ.
+	*
+	* Assignment accepts a `ConfigShape`: one config for every channel,
+	* `null` to revert every channel to the default, or a shape mirroring
+	* the value with configs at any level — a config at a subtree covers
+	* every channel below it. Non-config leaves throw with their path.
+	*/
+	get config() {
+		const channels = this.#tree.leaves;
+		const first = channels[0].config;
+		for (let i = 1; i < channels.length; i++) if (channels[i].config !== first) return null;
+		return first;
+	}
+	set config(value) {
+		this.#motions.flushes.batch(() => {
+			this.#tree.root.broadcast(value ?? null, resolveConfigNode, assignConfig, "config");
+		});
+	}
+	/**
+	* The shared purpose when every channel resolves to the same `Purpose`,
+	* and `null` when they differ. Fixed when the spring is created — an
+	* `'appearance'` channel opts out of reduced motion. See `Purpose`.
+	*/
+	get purpose() {
+		const channels = this.#tree.leaves;
+		const first = channels[0].purpose;
+		for (let i = 1; i < channels.length; i++) if (channels[i].purpose !== first) return null;
+		return first;
+	}
+	/** The largest `timeRemaining` across channels, in milliseconds. */
+	get timeRemaining() {
+		let max = 0;
+		for (const channel of this.#tree.leaves) {
+			const remaining = channel.timeRemaining;
+			if (remaining > max) max = remaining;
+		}
+		return max;
+	}
+	/** Whether every channel is resting. */
+	get isResting() {
+		for (const channel of this.#tree.leaves) if (!channel.isResting) return false;
+		return true;
+	}
+	/**
+	* A promise that resolves when every channel next rests — already
+	* resolved while resting or after dispose. Retargeting any channel
+	* mid-flight extends the wait; disposing resolves it.
+	*/
+	get settled() {
+		if (this.#disposed || this.isResting) return RESOLVED;
+		this.#settled ??= new Promise((resolve) => {
+			this.#resolveSettled = resolve;
+			const unsubscribe = this.onStop(() => {
+				unsubscribe();
+				this.#settled = null;
+				this.#resolveSettled = null;
+				resolve();
+			});
+		});
+		return this.#settled;
+	}
+	/**
+	* Snaps the channels the partial shape names to the given values with
+	* no animation, notifying listeners synchronously. Channels it leaves
+	* out are untouched.
+	*/
+	jumpTo(value) {
+		this.#motions.flushes.batch(() => {
+			this.#tree.root.scatter(value, acceptNumber, applyJump);
+		});
+	}
+	/**
+	* Releases every channel permanently: resolves `settled` and notifies
+	* dispose listeners. Calling it again is a no-op.
+	*
+	* A disposed composite spring keeps its final values readable; writes
+	* throw.
+	*/
+	dispose() {
+		if (this.#disposed) return;
+		this.#disposed = true;
+		if (this.#resolveSettled) {
+			this.#resolveSettled();
+			this.#settled = null;
+			this.#resolveSettled = null;
+		}
+		for (const channel of this.#tree.leaves) channel.dispose();
+		this.#emitter.clear();
+	}
+	/**
+	* Subscribes to coalesced value changes: at most one `update` per tick,
+	* fired after every channel has advanced, plus one per synchronous
+	* write. Returns an unsubscribe function.
+	*/
+	onUpdate(callback) {
+		return this.#emitter.on("update", callback);
+	}
+	/**
+	* Subscribes to the composite leaving rest: a channel starts moving
+	* while all were resting. Always alternates with `stop`. Returns an
+	* unsubscribe function.
+	*/
+	onStart(callback) {
+		return this.#emitter.on("start", callback);
+	}
+	/**
+	* Subscribes to the composite coming to rest: every channel resting,
+	* fired after that tick's final `update`. Always alternates with
+	* `start`. Returns an unsubscribe function.
+	*/
+	onStop(callback) {
+		return this.#emitter.on("stop", callback);
+	}
+	/** Subscribes to `dispose`, which fires once. Returns an unsubscribe function. */
+	onDispose(callback) {
+		return this.#tree.leaves[0].onDispose(callback);
+	}
+	#follow(leader) {
+		this.#motions.flushes.batch(() => {
+			this.#tree.root.zip(leader.#tree.root, followChannel);
+		});
+	}
+};
+//#endregion
+//#region src/ticker.ts
+const request = (callback) => typeof window !== "undefined" ? window.requestAnimationFrame(callback) : setTimeout(() => callback(performance.now()), 16);
+const cancel = (id) => {
+	if (typeof window !== "undefined") window.cancelAnimationFrame(id);
+	else clearTimeout(id);
+};
+/**
+* Drives a `MotionSet` from animation frames. Schedules frames only
+* while motions exist — otherwise it sleeps and the set's `onWake`
+* rearms it — paces fps caps to whole display frames, and clamps lag
+* gaps.
+*/
+var Ticker = class {
+	#fps;
+	#gap;
+	#capGap;
+	#lagThreshold;
+	#adjustedLag;
+	#motion;
+	#frame = 0;
+	#time = 0;
+	#delta = 0;
+	#acc = 0;
+	#lastWallTime = 0;
+	#primed = false;
+	#id = 0;
+	#stopped = true;
+	#sleeping = false;
+	constructor(motions, options) {
+		this.#motion = motions;
+		const fps = options?.fps ?? 0;
+		const lagThreshold = options?.lagThreshold ?? 500;
+		const adjustedLag = options?.adjustedLag ?? 33;
+		invariant(fps >= 0, "FPS must be greater than or equal to 0");
+		invariant(lagThreshold >= 0, "Lag threshold must be greater than or equal to 0");
+		invariant(adjustedLag >= 0, "Adjusted lag must be greater than or equal to 0");
+		this.#fps = fps;
+		this.#gap = fps === 0 ? 1e3 / 60 : 1e3 / fps;
+		this.#capGap = fps === 0 ? 0 : 1e3 / fps;
+		this.#lagThreshold = lagThreshold === 0 ? 1e8 : lagThreshold;
+		this.#adjustedLag = Math.min(adjustedLag, this.#lagThreshold);
+		motions.onWake = () => this.#wake();
+	}
+	get fps() {
+		return this.#fps;
+	}
+	set fps(value) {
+		invariant(value >= 0, "FPS must be greater than or equal to 0");
+		this.#fps = value;
+		this.#gap = value === 0 ? 1e3 / 60 : 1e3 / value;
+		this.#capGap = value === 0 ? 0 : 1e3 / value;
+	}
+	get lagThreshold() {
+		return this.#lagThreshold;
+	}
+	set lagThreshold(value) {
+		invariant(value >= 0, "Lag threshold must be greater than or equal to 0");
+		this.#lagThreshold = value === 0 ? 1e8 : value;
+		this.#adjustedLag = Math.min(this.#adjustedLag, this.#lagThreshold);
+	}
+	get adjustedLag() {
+		return this.#adjustedLag;
+	}
+	set adjustedLag(value) {
+		invariant(value >= 0, "Adjusted lag must be greater than or equal to 0");
+		this.#adjustedLag = Math.min(value, this.#lagThreshold);
+	}
+	get time() {
+		return this.#time;
+	}
+	get frame() {
+		return this.#frame;
+	}
+	get delta() {
+		return this.#delta;
+	}
+	get deltaRatio() {
+		return this.#delta / this.#gap;
+	}
+	get stopped() {
+		return this.#stopped;
+	}
+	start() {
+		if (this.#stopped) {
+			this.#stopped = false;
+			this.#primed = false;
+			this.#acc = 0;
+			this.#schedule();
+		}
+	}
+	stop() {
+		if (!this.#stopped) {
+			if (!this.#sleeping) cancel(this.#id);
+			this.#stopped = true;
+			this.#sleeping = false;
+		}
+	}
+	tick() {
+		this.#step(this.#gap);
+	}
+	#schedule() {
+		if (this.#motion.size === 0) {
+			this.#sleeping = true;
+			this.#acc = 0;
+		} else {
+			this.#sleeping = false;
+			this.#id = request((t) => this.#onFrame(t));
+		}
+	}
+	#wake() {
+		if (!this.#stopped && this.#sleeping) {
+			this.#primed = false;
+			this.#schedule();
+		}
+	}
+	#onFrame(timestamp) {
+		if (this.#stopped) return;
+		try {
+			if (this.#primed) {
+				const wallElapsed = timestamp - this.#lastWallTime;
+				const elapsed = wallElapsed > this.#lagThreshold ? this.#adjustedLag : wallElapsed;
+				this.#acc += elapsed;
+				if (this.#acc + elapsed / 2 >= this.#capGap) {
+					const delta = this.#acc;
+					this.#acc = 0;
+					this.#step(delta);
+				}
+			} else this.#primed = true;
+		} finally {
+			this.#lastWallTime = timestamp;
+			if (!this.#stopped) this.#schedule();
+		}
+	}
+	#step(dt) {
+		this.#time += dt;
+		this.#frame++;
+		this.#delta = dt;
+		this.#motion.tick(dt / 1e3);
+	}
+};
+//#endregion
+//#region src/system.ts
+var SpringSystemImpl = class {
+	#motion;
+	#ticker;
+	constructor(options) {
+		this.#motion = new MotionSet(options?.debug);
+		this.#ticker = new Ticker(this.#motion, options);
+		if (options?.couplingTolerance !== void 0) this.couplingTolerance = options.couplingTolerance;
+		const mode = options?.reducedMotion ?? "user";
+		if (mode === "always") this.#motion.reduced = true;
+		else if (mode === "user" && typeof window !== "undefined" && typeof window.matchMedia === "function") {
+			const query = window.matchMedia("(prefers-reduced-motion: reduce)");
+			this.#applyReducedMotion(query.matches);
+			query.addEventListener("change", (event) => {
+				this.#applyReducedMotion(event.matches);
+			});
+		}
+	}
+	#applyReducedMotion(reduced) {
+		this.#motion.reduced = reduced;
+		if (reduced) this.#motion.finishAll();
+	}
+	get reducedMotion() {
+		return this.#motion.reduced;
+	}
+	get couplingTolerance() {
+		return this.#motion.couplingTolerance;
+	}
+	set couplingTolerance(value) {
+		invariant(Number.isFinite(value) && value >= 0, "couplingTolerance must be a finite, non-negative number");
+		this.#motion.couplingTolerance = value;
+	}
+	createSpring(value, config, options) {
+		if (typeof value === "number") return new Spring(this.#motion, value, config, options?.purpose);
+		if (isSpringSource(value)) {
+			const api = value[SpringSourceSymbol];
+			invariant(typeof api.value === "number", "A spring can only follow a scalar SpringSource; derive one from a composite with mapSpring");
+			const spring = new Spring(this.#motion, api.value, config, options?.purpose);
+			spring.target = value;
+			return spring;
+		}
+		return new CompositeSpring(this.#motion, value, config, options?.purpose);
+	}
+	advance(dt) {
+		invariant(Number.isFinite(dt), "dt must be a finite number of milliseconds");
+		this.#motion.tick(dt / 1e3);
+	}
+	start() {
+		this.#ticker.start();
+	}
+	stop() {
+		this.#ticker.stop();
+	}
+	get running() {
+		return !this.#ticker.stopped;
+	}
+	get fps() {
+		return this.#ticker.fps;
+	}
+	set fps(value) {
+		this.#ticker.fps = value;
+	}
+	get lagThreshold() {
+		return this.#ticker.lagThreshold;
+	}
+	set lagThreshold(value) {
+		this.#ticker.lagThreshold = value;
+	}
+	get adjustedLag() {
+		return this.#ticker.adjustedLag;
+	}
+	set adjustedLag(value) {
+		this.#ticker.adjustedLag = value;
+	}
+};
+/**
+* Creates a spring system: the entry point of the library.
+*
+* @example
+* ```ts
+* const system = createSpringSystem()
+* system.start()
+*
+* const spring = system.createSpring(0)
+* spring.onUpdate(() => {
+*   element.style.translate = `${spring.value}px 0`
+* })
+* spring.target = 300
+* ```
+*/
+function createSpringSystem(options) {
+	return new SpringSystemImpl(options);
+}
+//#endregion
+export { registerRecipe as a, mapSpring as i, SpringSourceSymbol as n, SpringDefinition as o, isSpringSource as r, defineSpring as s, createSpringSystem as t };