@weasel-js/core 1.10.1 → 1.11.1

package/dist/canvas/kitRequirements.js

@@ -1,177 +1,216 @@
-import { VERSION as e } from "../version.js";
+import { VERSION } from "../version.js";
+
 //#region src/canvas/kitRequirements.ts
-var t = { core: e }, n = "-unknown", r = /^v?(\d+)\.(\d+)\.(\d+)(?:-([0-9A-Za-z.-]+))?(?:\+[0-9A-Za-z.-]+)?$/, i = /^v?(\d+|[xX*])(?:\.(\d+|[xX*]))?(?:\.(\d+|[xX*]))?(?:-([0-9A-Za-z.-]+))?(?:\+[0-9A-Za-z.-]+)?$/;
-function a(e) {
-	return e ? e.split(".").map((e) => /^\d+$/.test(e) ? Number(e) : e) : [];
+/**
+* Version negotiation for contributions: a `requires` map of semver ranges,
+* matched against the versions the running kit packages report.
+*
+* The range grammar is npm's everyday subset — `^`, `~`, `>=`, `>`, `<=`, `<`,
+* `=`, bare and partial versions (`1.7`, `1.x`, `*`), space for AND and `||`
+* for OR. Hyphen ranges are not read. A prerelease orders below its release,
+* without npm's rule that a range must opt into prereleases by naming one —
+* except at an exclusive upper bound, which also excludes that version's own
+* prereleases, so `^1.4` does not admit `2.0.0-rc.1`.
+*/
+/** The running kit's versions. */
+var KIT_VERSIONS = { core: VERSION };
+var UNKNOWN_SUFFIX = "-unknown";
+var VERSION_RE = /^v?(\d+)\.(\d+)\.(\d+)(?:-([0-9A-Za-z.-]+))?(?:\+[0-9A-Za-z.-]+)?$/;
+var PARTIAL_RE = /^v?(\d+|[xX*])(?:\.(\d+|[xX*]))?(?:\.(\d+|[xX*]))?(?:-([0-9A-Za-z.-]+))?(?:\+[0-9A-Za-z.-]+)?$/;
+function preOf(s) {
+	return s ? s.split(".").map((id) => /^\d+$/.test(id) ? Number(id) : id) : [];
 }
-function o(e) {
-	let t = r.exec(e.trim());
-	return t ? {
+function parseVersion(s) {
+	const m = VERSION_RE.exec(s.trim());
+	return m ? {
 		triple: [
-			Number(t[1]),
-			Number(t[2]),
-			Number(t[3])
+			Number(m[1]),
+			Number(m[2]),
+			Number(m[3])
 		],
-		pre: a(t[4])
+		pre: preOf(m[4])
 	} : null;
 }
-function s(e, t) {
-	for (let n = 0; n < 3; n++) {
-		let r = e.triple[n] - t.triple[n];
-		if (r !== 0) return r;
+function compare(a, b) {
+	for (let i = 0; i < 3; i++) {
+		const d = a.triple[i] - b.triple[i];
+		if (d !== 0) return d;
 	}
-	if (e.pre.length === 0 || t.pre.length === 0) return t.pre.length - e.pre.length;
-	for (let n = 0; n < Math.max(e.pre.length, t.pre.length); n++) {
-		let r = e.pre[n], i = t.pre[n];
-		if (r === void 0) return -1;
-		if (i === void 0) return 1;
-		if (r !== i) return typeof r == "number" && typeof i == "number" ? r - i : typeof r == "number" ? -1 : typeof i == "number" ? 1 : r < i ? -1 : 1;
+	if (a.pre.length === 0 || b.pre.length === 0) return b.pre.length - a.pre.length;
+	for (let i = 0; i < Math.max(a.pre.length, b.pre.length); i++) {
+		const x = a.pre[i];
+		const y = b.pre[i];
+		if (x === void 0) return -1;
+		if (y === void 0) return 1;
+		if (x === y) continue;
+		if (typeof x === "number" && typeof y === "number") return x - y;
+		if (typeof x === "number") return -1;
+		if (typeof y === "number") return 1;
+		return x < y ? -1 : 1;
 	}
 	return 0;
 }
-var c = (e, t, n, r = []) => ({
+var v = (a, b, c, pre = []) => ({
 	triple: [
-		e,
-		t,
-		n
+		a,
+		b,
+		c
 	],
-	pre: r
+	pre
 });
-function l(e) {
-	let t = /^(\^|~|>=|<=|>|<|=)?(.*)$/.exec(e), n = t[1] ?? "", r = i.exec(t[2]);
-	if (!r) return null;
-	let o = [];
-	for (let e of [
-		r[1],
-		r[2],
-		r[3]
+/** One comparator token as the interval it names. `null` when unreadable. */
+function parseComparator(token) {
+	const m = /^(\^|~|>=|<=|>|<|=)?(.*)$/.exec(token);
+	const op = m[1] ?? "";
+	const p = PARTIAL_RE.exec(m[2]);
+	if (!p) return null;
+	const nums = [];
+	for (const part of [
+		p[1],
+		p[2],
+		p[3]
 	]) {
-		if (e === void 0 || /^[xX*]$/.test(e)) break;
-		o.push(Number(e));
+		if (part === void 0 || /^[xX*]$/.test(part)) break;
+		nums.push(Number(part));
 	}
-	let s = a(r[4]);
-	if (s.length > 0 && o.length < 3) return null;
-	let [l = 0, u = 0, d = 0] = o, f = c(l, u, d, s), p = o.length === 0 ? null : o.length === 1 ? c(l + 1, 0, 0) : o.length === 2 ? c(l, u + 1, 0) : c(l, u, d + 1);
-	switch (n) {
+	const pre = preOf(p[4]);
+	if (pre.length > 0 && nums.length < 3) return null;
+	const [M = 0, mi = 0, pa = 0] = nums;
+	const lower = v(M, mi, pa, pre);
+	const upper = nums.length === 0 ? null : nums.length === 1 ? v(M + 1, 0, 0) : nums.length === 2 ? v(M, mi + 1, 0) : v(M, mi, pa + 1);
+	switch (op) {
 		case ">=": return [{
 			op: ">=",
-			v: f
+			v: lower
 		}];
-		case "<": return o.length === 0 ? [{
+		case "<": return nums.length === 0 ? [{
 			op: "<",
-			v: c(0, 0, 0)
+			v: v(0, 0, 0)
 		}] : [{
 			op: "<",
-			v: f
+			v: lower
 		}];
-		case ">": return o.length === 3 ? [{
+		case ">": return nums.length === 3 ? [{
 			op: ">",
-			v: f
-		}] : p ? [{
+			v: lower
+		}] : upper ? [{
 			op: ">=",
-			v: p
+			v: upper
 		}] : [{
 			op: "<",
-			v: c(0, 0, 0)
+			v: v(0, 0, 0)
 		}];
-		case "<=": return o.length === 3 ? [{
+		case "<=": return nums.length === 3 ? [{
 			op: "<=",
-			v: f
-		}] : p ? [{
+			v: lower
+		}] : upper ? [{
 			op: "<",
-			v: p
+			v: upper
 		}] : [];
 		case "~": {
-			let e = o.length <= 1 ? c(l + 1, 0, 0) : c(l, u + 1, 0);
+			const top = nums.length <= 1 ? v(M + 1, 0, 0) : v(M, mi + 1, 0);
 			return [{
 				op: ">=",
-				v: f
+				v: lower
 			}, {
 				op: "<",
-				v: e
+				v: top
 			}];
 		}
 		case "^": {
-			let e = l > 0 || o.length === 1 ? c(l + 1, 0, 0) : u > 0 || o.length === 2 ? c(0, u + 1, 0) : c(0, 0, d + 1);
-			return o.length === 0 ? [] : [{
+			const top = M > 0 || nums.length === 1 ? v(M + 1, 0, 0) : mi > 0 || nums.length === 2 ? v(0, mi + 1, 0) : v(0, 0, pa + 1);
+			return nums.length === 0 ? [] : [{
 				op: ">=",
-				v: f
+				v: lower
 			}, {
 				op: "<",
-				v: e
+				v: top
 			}];
 		}
-		default: return o.length === 3 ? [{
-			op: ">=",
-			v: f
-		}, {
-			op: "<=",
-			v: f
-		}] : p ? [{
-			op: ">=",
-			v: f
-		}, {
-			op: "<",
-			v: p
-		}] : [];
+		default:
+			if (nums.length === 3) return [{
+				op: ">=",
+				v: lower
+			}, {
+				op: "<=",
+				v: lower
+			}];
+			return upper ? [{
+				op: ">=",
+				v: lower
+			}, {
+				op: "<",
+				v: upper
+			}] : [];
 	}
 }
-function u(e, t) {
-	let n = s(e, t.v);
-	switch (t.op) {
-		case ">=": return n >= 0;
-		case ">": return n > 0;
-		case "<=": return n <= 0;
-		case "<": return t.v.pre.length > 0 ? n < 0 : s(c(...e.triple), t.v) < 0;
+function holds(version, c) {
+	const d = compare(version, c.v);
+	switch (c.op) {
+		case ">=": return d >= 0;
+		case ">": return d > 0;
+		case "<=": return d <= 0;
+		case "<": return c.v.pre.length > 0 ? d < 0 : compare(v(...version.triple), c.v) < 0;
 	}
 }
-function d(e, t) {
-	let n = o(e);
-	if (!n) return null;
-	let r = t.split("||").map((e) => e.trim()), i = !1;
-	for (let e of r) {
-		if (e === "") return null;
-		let t = [];
-		for (let n of e.replace(/(\^|~|>=|<=|>|<|=)\s+/g, "$1").split(/\s+/)) {
-			let e = l(n);
-			if (!e) return null;
-			t.push(...e);
+/**
+* Whether `version` falls in `range`. `null` when either cannot be read, so a
+* caller can tell a mismatch from a requirement it could not check.
+*/
+function satisfiesRange(version, range) {
+	const parsed = parseVersion(version);
+	if (!parsed) return null;
+	const alternatives = range.split("||").map((alt) => alt.trim());
+	let any = false;
+	for (const alt of alternatives) {
+		if (alt === "") return null;
+		const set = [];
+		for (const token of alt.replace(/(\^|~|>=|<=|>|<|=)\s+/g, "$1").split(/\s+/)) {
+			const cs = parseComparator(token);
+			if (!cs) return null;
+			set.push(...cs);
 		}
-		t.every((e) => u(n, e)) && (i = !0);
+		if (set.every((c) => holds(parsed, c))) any = true;
 	}
-	return i;
+	return any;
 }
-function f(e, r = t) {
-	let i = [];
-	for (let [t, a] of Object.entries(e)) {
-		if (a === void 0) continue;
-		let e = r[t];
-		if (e === void 0) {
-			i.push({
-				package: t,
-				range: a,
+/**
+* Every requirement in `requires` the running kit does not meet. A package
+* whose build does not know its own version (`0.0.0-unknown`, core's source
+* bundled without its define) is skipped: nothing can be said about it.
+*/
+function checkRequirements(requires, running = KIT_VERSIONS) {
+	const out = [];
+	for (const [pkg, range] of Object.entries(requires)) {
+		if (range === void 0) continue;
+		const have = running[pkg];
+		if (have === void 0) {
+			out.push({
+				package: pkg,
+				range,
 				running: void 0,
 				reason: "unknown-package"
 			});
 			continue;
 		}
-		if (e.endsWith(n)) continue;
-		let o = d(e, a);
-		o === null ? i.push({
-			package: t,
-			range: a,
-			running: e,
+		if (have.endsWith(UNKNOWN_SUFFIX)) continue;
+		const ok = satisfiesRange(have, range);
+		if (ok === null) out.push({
+			package: pkg,
+			range,
+			running: have,
 			reason: "invalid-range"
-		}) : o || i.push({
-			package: t,
-			range: a,
-			running: e,
+		});
+		else if (!ok) out.push({
+			package: pkg,
+			range,
+			running: have,
 			reason: "unsatisfied"
 		});
 	}
-	return i;
+	return out;
 }
-//#endregion
-export { t as KIT_VERSIONS, f as checkRequirements, d as satisfiesRange };
 
+//#endregion
+export { KIT_VERSIONS, checkRequirements, satisfiesRange };
 //# sourceMappingURL=kitRequirements.js.map

package/dist/canvas/kitRequirements.js.map

@@ -1 +1 @@
-{"version":3,"file":"kitRequirements.js","names":["KIT_VERSIONS","VERSION","UNKNOWN_SUFFIX","VERSION_RE","PARTIAL_RE","preOf","s","id","parseVersion","m","compare","i","d","a","b","x","y","v","c","parseComparator","token","op","p","nums","part","pre","M","mi","pa","lower","upper","top","holds","version","satisfiesRange","parsed","alternatives","range","alt","any","set","cs","checkRequirements","out","pkg","requires","have","running","ok"],"sources":["../../src/canvas/kitRequirements.ts"],"sourcesContent":["/**\n * Version negotiation for contributions: a `requires` map of semver ranges,\n * matched against the versions the running kit packages report.\n *\n * The range grammar is npm's everyday subset — `^`, `~`, `>=`, `>`, `<=`, `<`,\n * `=`, bare and partial versions (`1.7`, `1.x`, `*`), space for AND and `||`\n * for OR. Hyphen ranges are not read. A prerelease orders below its release,\n * without npm's rule that a range must opt into prereleases by naming one —\n * except at an exclusive upper bound, which also excludes that version's own\n * prereleases, so `^1.4` does not admit `2.0.0-rc.1`.\n */\nimport { VERSION } from '../version';\n\n/**\n * The versions a contribution can require, keyed by package without its\n * `@weasel-js/` scope. Only core reports its version today.\n */\nexport interface KitVersions {\n  core: string;\n}\n\n/** A contribution's `requires`: a semver range per package it was written against. */\nexport type KitRequirements = { readonly [K in keyof KitVersions]?: string };\n\n/** The running kit's versions. */\nexport const KIT_VERSIONS: Readonly<KitVersions> = { core: VERSION };\n\n/** One requirement the running kit does not meet. */\nexport interface RequirementMismatch {\n  package: string;\n  range: string;\n  /** The running version, or `undefined` when that package reports none. */\n  running: string | undefined;\n  reason: 'unsatisfied' | 'invalid-range' | 'unknown-package';\n}\n\ntype Triple = readonly [number, number, number];\ninterface Version { triple: Triple; pre: readonly (string | number)[] }\ninterface Comparator { op: '>=' | '<' | '>' | '<='; v: Version }\n\nconst UNKNOWN_SUFFIX = '-unknown';\nconst VERSION_RE = /^v?(\\d+)\\.(\\d+)\\.(\\d+)(?:-([0-9A-Za-z.-]+))?(?:\\+[0-9A-Za-z.-]+)?$/;\nconst PARTIAL_RE = /^v?(\\d+|[xX*])(?:\\.(\\d+|[xX*]))?(?:\\.(\\d+|[xX*]))?(?:-([0-9A-Za-z.-]+))?(?:\\+[0-9A-Za-z.-]+)?$/;\n\nfunction preOf(s: string | undefined): (string | number)[] {\n  return s ? s.split('.').map((id) => (/^\\d+$/.test(id) ? Number(id) : id)) : [];\n}\n\nfunction parseVersion(s: string): Version | null {\n  const m = VERSION_RE.exec(s.trim());\n  return m ? { triple: [Number(m[1]), Number(m[2]), Number(m[3])], pre: preOf(m[4]) } : null;\n}\n\nfunction compare(a: Version, b: Version): number {\n  for (let i = 0; i < 3; i++) {\n    const d = a.triple[i]! - b.triple[i]!;\n    if (d !== 0) return d;\n  }\n  if (a.pre.length === 0 || b.pre.length === 0) return b.pre.length - a.pre.length;\n  for (let i = 0; i < Math.max(a.pre.length, b.pre.length); i++) {\n    const x = a.pre[i];\n    const y = b.pre[i];\n    if (x === undefined) return -1;\n    if (y === undefined) return 1;\n    if (x === y) continue;\n    if (typeof x === 'number' && typeof y === 'number') return x - y;\n    if (typeof x === 'number') return -1;\n    if (typeof y === 'number') return 1;\n    return x < y ? -1 : 1;\n  }\n  return 0;\n}\n\nconst v = (a: number, b: number, c: number, pre: readonly (string | number)[] = []): Version =>\n  ({ triple: [a, b, c], pre });\n\n/** One comparator token as the interval it names. `null` when unreadable. */\nfunction parseComparator(token: string): Comparator[] | null {\n  const m = /^(\\^|~|>=|<=|>|<|=)?(.*)$/.exec(token)!;\n  const op = m[1] ?? '';\n  const p = PARTIAL_RE.exec(m[2]!);\n  if (!p) return null;\n  const nums: number[] = [];\n  for (const part of [p[1], p[2], p[3]]) {\n    if (part === undefined || /^[xX*]$/.test(part)) break;\n    nums.push(Number(part));\n  }\n  const pre = preOf(p[4]);\n  if (pre.length > 0 && nums.length < 3) return null;\n  const [M = 0, mi = 0, pa = 0] = nums;\n  const lower = v(M, mi, pa, pre);\n  // The first version past everything the partial names: `1.7` → `1.8.0`.\n  const upper = nums.length === 0 ? null\n    : nums.length === 1 ? v(M + 1, 0, 0)\n    : nums.length === 2 ? v(M, mi + 1, 0)\n    : v(M, mi, pa + 1);\n\n  switch (op) {\n    case '>=': return [{ op: '>=', v: lower }];\n    case '<': return nums.length === 0 ? [{ op: '<', v: v(0, 0, 0) }] : [{ op: '<', v: lower }];\n    case '>': return nums.length === 3 ? [{ op: '>', v: lower }] : upper ? [{ op: '>=', v: upper }] : [{ op: '<', v: v(0, 0, 0) }];\n    case '<=': return nums.length === 3 ? [{ op: '<=', v: lower }] : upper ? [{ op: '<', v: upper }] : [];\n    case '~': {\n      const top = nums.length <= 1 ? v(M + 1, 0, 0) : v(M, mi + 1, 0);\n      return [{ op: '>=', v: lower }, { op: '<', v: top }];\n    }\n    case '^': {\n      const top = M > 0 || nums.length === 1 ? v(M + 1, 0, 0)\n        : mi > 0 || nums.length === 2 ? v(0, mi + 1, 0)\n        : v(0, 0, pa + 1);\n      return nums.length === 0 ? [] : [{ op: '>=', v: lower }, { op: '<', v: top }];\n    }\n    default:\n      if (nums.length === 3) return [{ op: '>=', v: lower }, { op: '<=', v: lower }];\n      return upper ? [{ op: '>=', v: lower }, { op: '<', v: upper }] : [];\n  }\n}\n\nfunction holds(version: Version, c: Comparator): boolean {\n  const d = compare(version, c.v);\n  switch (c.op) {\n    case '>=': return d >= 0;\n    case '>': return d > 0;\n    case '<=': return d <= 0;\n    case '<': return c.v.pre.length > 0 ? d < 0 : compare(v(...version.triple), c.v) < 0;\n  }\n}\n\n/**\n * Whether `version` falls in `range`. `null` when either cannot be read, so a\n * caller can tell a mismatch from a requirement it could not check.\n */\nexport function satisfiesRange(version: string, range: string): boolean | null {\n  const parsed = parseVersion(version);\n  if (!parsed) return null;\n  const alternatives = range.split('||').map((alt) => alt.trim());\n  let any = false;\n  for (const alt of alternatives) {\n    if (alt === '') return null;\n    const set: Comparator[] = [];\n    for (const token of alt.replace(/(\\^|~|>=|<=|>|<|=)\\s+/g, '$1').split(/\\s+/)) {\n      const cs = parseComparator(token);\n      if (!cs) return null;\n      set.push(...cs);\n    }\n    if (set.every((c) => holds(parsed, c))) any = true;\n  }\n  return any;\n}\n\n/**\n * Every requirement in `requires` the running kit does not meet. A package\n * whose build does not know its own version (`0.0.0-unknown`, core's source\n * bundled without its define) is skipped: nothing can be said about it.\n */\nexport function checkRequirements(\n  requires: KitRequirements,\n  running: Readonly<Partial<Record<string, string>>> = KIT_VERSIONS,\n): RequirementMismatch[] {\n  const out: RequirementMismatch[] = [];\n  for (const [pkg, range] of Object.entries(requires)) {\n    if (range === undefined) continue;\n    const have = running[pkg];\n    if (have === undefined) {\n      out.push({ package: pkg, range, running: undefined, reason: 'unknown-package' });\n      continue;\n    }\n    if (have.endsWith(UNKNOWN_SUFFIX)) continue;\n    const ok = satisfiesRange(have, range);\n    if (ok === null) out.push({ package: pkg, range, running: have, reason: 'invalid-range' });\n    else if (!ok) out.push({ package: pkg, range, running: have, reason: 'unsatisfied' });\n  }\n  return out;\n}\n"],"mappings":";;AAyBA,IAAaA,IAAsC,EAAE,MAAMC,EAAQ,GAe7DC,IAAiB,YACjBC,IAAa,sEACbC,IAAa;AAEnB,SAASC,EAAM,GAA4C;CACzD,OAAOC,IAAIA,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,MAAQ,QAAQ,KAAKC,CAAE,IAAI,OAAOA,CAAE,IAAIA,CAAG,IAAI,CAAC;AAC/E;AAEA,SAASC,EAAa,GAA2B;CAC/C,IAAMC,IAAIN,EAAW,KAAKG,EAAE,KAAK,CAAC;CAClC,OAAOG,IAAI;EAAE,QAAQ;GAAC,OAAOA,EAAE,EAAE;GAAG,OAAOA,EAAE,EAAE;GAAG,OAAOA,EAAE,EAAE;EAAC;EAAG,KAAKJ,EAAMI,EAAE,EAAE;CAAE,IAAI;AACxF;AAEA,SAASC,EAAQ,GAAY,GAAoB;CAC/C,KAAK,IAAIC,IAAI,GAAGA,IAAI,GAAG,KAAK;EAC1B,IAAMC,IAAIC,EAAE,OAAOF,KAAMG,EAAE,OAAOH;EAClC,IAAIC,MAAM,GAAG,OAAOA;CACtB;CACA,IAAIC,EAAE,IAAI,WAAW,KAAKC,EAAE,IAAI,WAAW,GAAG,OAAOA,EAAE,IAAI,SAASD,EAAE,IAAI;CAC1E,KAAK,IAAIF,IAAI,GAAGA,IAAI,KAAK,IAAIE,EAAE,IAAI,QAAQC,EAAE,IAAI,MAAM,GAAG,KAAK;EAC7D,IAAMC,IAAIF,EAAE,IAAIF,IACVK,IAAIF,EAAE,IAAIH;EAChB,IAAII,MAAM,KAAA,GAAW,OAAO;EAC5B,IAAIC,MAAM,KAAA,GAAW,OAAO;EAC5B,IAAID,MAAMC,GAIV,OAHI,OAAOD,KAAM,YAAY,OAAOC,KAAM,WAAiBD,IAAIC,IAC3D,OAAOD,KAAM,WAAiB,KAC9B,OAAOC,KAAM,WAAiB,IAC3BD,IAAIC,IAAI,KAAK;CACtB;CACA,OAAO;AACT;AAEA,IAAMC,KAAK,GAAW,GAAW,GAAW,IAAoC,CAAC,OAC9E;CAAE,QAAQ;EAACJ;EAAGC;EAAGI;CAAC;CAAG;AAAI;AAG5B,SAASC,EAAgB,GAAoC;CAC3D,IAAMV,IAAI,4BAA4B,KAAKW,CAAK,GAC1CC,IAAKZ,EAAE,MAAM,IACba,IAAIlB,EAAW,KAAKK,EAAE,EAAG;CAC/B,IAAI,CAACa,GAAG,OAAO;CACf,IAAMC,IAAiB,CAAC;CACxB,KAAK,IAAMC,KAAQ;EAACF,EAAE;EAAIA,EAAE;EAAIA,EAAE;CAAE,GAAG;EACrC,IAAIE,MAAS,KAAA,KAAa,UAAU,KAAKA,CAAI,GAAG;EAChD,EAAK,KAAK,OAAOA,CAAI,CAAC;CACxB;CACA,IAAMC,IAAMpB,EAAMiB,EAAE,EAAE;CACtB,IAAIG,EAAI,SAAS,KAAKF,EAAK,SAAS,GAAG,OAAO;CAC9C,IAAM,CAACG,IAAI,GAAGC,IAAK,GAAGC,IAAK,KAAKL,GAC1BM,IAAQZ,EAAES,GAAGC,GAAIC,GAAIH,CAAG,GAExBK,IAAQP,EAAK,WAAW,IAAI,OAC9BA,EAAK,WAAW,IAAIN,EAAES,IAAI,GAAG,GAAG,CAAC,IACjCH,EAAK,WAAW,IAAIN,EAAES,GAAGC,IAAK,GAAG,CAAC,IAClCV,EAAES,GAAGC,GAAIC,IAAK,CAAC;CAEnB,QAAQP,GAAR;EACE,KAAK,MAAM,OAAO,CAAC;GAAE,IAAI;GAAM,GAAGQ;EAAM,CAAC;EACzC,KAAK,KAAK,OAAON,EAAK,WAAW,IAAI,CAAC;GAAE,IAAI;GAAK,GAAGN,EAAE,GAAG,GAAG,CAAC;EAAE,CAAC,IAAI,CAAC;GAAE,IAAI;GAAK,GAAGY;EAAM,CAAC;EAC1F,KAAK,KAAK,OAAON,EAAK,WAAW,IAAI,CAAC;GAAE,IAAI;GAAK,GAAGM;EAAM,CAAC,IAAIC,IAAQ,CAAC;GAAE,IAAI;GAAM,GAAGA;EAAM,CAAC,IAAI,CAAC;GAAE,IAAI;GAAK,GAAGb,EAAE,GAAG,GAAG,CAAC;EAAE,CAAC;EAC7H,KAAK,MAAM,OAAOM,EAAK,WAAW,IAAI,CAAC;GAAE,IAAI;GAAM,GAAGM;EAAM,CAAC,IAAIC,IAAQ,CAAC;GAAE,IAAI;GAAK,GAAGA;EAAM,CAAC,IAAI,CAAC;EACpG,KAAK,KAAK;GACR,IAAMC,IAAMR,EAAK,UAAU,IAAIN,EAAES,IAAI,GAAG,GAAG,CAAC,IAAIT,EAAES,GAAGC,IAAK,GAAG,CAAC;GAC9D,OAAO,CAAC;IAAE,IAAI;IAAM,GAAGE;GAAM,GAAG;IAAE,IAAI;IAAK,GAAGE;GAAI,CAAC;EACrD;EACA,KAAK,KAAK;GACR,IAAMA,IAAML,IAAI,KAAKH,EAAK,WAAW,IAAIN,EAAES,IAAI,GAAG,GAAG,CAAC,IAClDC,IAAK,KAAKJ,EAAK,WAAW,IAAIN,EAAE,GAAGU,IAAK,GAAG,CAAC,IAC5CV,EAAE,GAAG,GAAGW,IAAK,CAAC;GAClB,OAAOL,EAAK,WAAW,IAAI,CAAC,IAAI,CAAC;IAAE,IAAI;IAAM,GAAGM;GAAM,GAAG;IAAE,IAAI;IAAK,GAAGE;GAAI,CAAC;EAC9E;EACA,SAEE,OADIR,EAAK,WAAW,IAAU,CAAC;GAAE,IAAI;GAAM,GAAGM;EAAM,GAAG;GAAE,IAAI;GAAM,GAAGA;EAAM,CAAC,IACtEC,IAAQ,CAAC;GAAE,IAAI;GAAM,GAAGD;EAAM,GAAG;GAAE,IAAI;GAAK,GAAGC;EAAM,CAAC,IAAI,CAAC;CACtE;AACF;AAEA,SAASE,EAAM,GAAkB,GAAwB;CACvD,IAAMpB,IAAIF,EAAQuB,GAASf,EAAE,CAAC;CAC9B,QAAQA,EAAE,IAAV;EACE,KAAK,MAAM,OAAON,KAAK;EACvB,KAAK,KAAK,OAAOA,IAAI;EACrB,KAAK,MAAM,OAAOA,KAAK;EACvB,KAAK,KAAK,OAAOM,EAAE,EAAE,IAAI,SAAS,IAAIN,IAAI,IAAIF,EAAQO,EAAE,GAAGgB,EAAQ,MAAM,GAAGf,EAAE,CAAC,IAAI;CACrF;AACF;AAMA,SAAgBgB,EAAe,GAAiB,GAA+B;CAC7E,IAAMC,IAAS3B,EAAayB,CAAO;CACnC,IAAI,CAACE,GAAQ,OAAO;CACpB,IAAMC,IAAeC,EAAM,MAAM,IAAI,CAAC,CAAC,KAAK,MAAQC,EAAI,KAAK,CAAC,GAC1DC,IAAM;CACV,KAAK,IAAMD,KAAOF,GAAc;EAC9B,IAAIE,MAAQ,IAAI,OAAO;EACvB,IAAME,IAAoB,CAAC;EAC3B,KAAK,IAAMpB,KAASkB,EAAI,QAAQ,0BAA0B,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG;GAC5E,IAAMG,IAAKtB,EAAgBC,CAAK;GAChC,IAAI,CAACqB,GAAI,OAAO;GAChB,EAAI,KAAK,GAAGA,CAAE;EAChB;EACA,AAAID,EAAI,OAAO,MAAMR,EAAMG,GAAQjB,CAAC,CAAC,MAAG,IAAM;CAChD;CACA,OAAOqB;AACT;AAOA,SAAgBG,EACd,GACA,IAAqD1C,GAC9B;CACvB,IAAM2C,IAA6B,CAAC;CACpC,KAAK,IAAM,CAACC,GAAKP,MAAU,OAAO,QAAQQ,CAAQ,GAAG;EACnD,IAAIR,MAAU,KAAA,GAAW;EACzB,IAAMS,IAAOC,EAAQH;EACrB,IAAIE,MAAS,KAAA,GAAW;GACtB,EAAI,KAAK;IAAE,SAASF;IAAK;IAAO,SAAS,KAAA;IAAW,QAAQ;GAAkB,CAAC;GAC/E;EACF;EACA,IAAIE,EAAK,SAAS5C,CAAc,GAAG;EACnC,IAAM8C,IAAKd,EAAeY,GAAMT,CAAK;EACrC,AAAIW,MAAO,OAAML,EAAI,KAAK;GAAE,SAASC;GAAK;GAAO,SAASE;GAAM,QAAQ;EAAgB,CAAC,IAC/EE,KAAIL,EAAI,KAAK;GAAE,SAASC;GAAK;GAAO,SAASE;GAAM,QAAQ;EAAc,CAAC;CACtF;CACA,OAAOH;AACT"}
+{"version":3,"file":"kitRequirements.js","names":[],"sources":["../../src/canvas/kitRequirements.ts"],"sourcesContent":["/**\n * Version negotiation for contributions: a `requires` map of semver ranges,\n * matched against the versions the running kit packages report.\n *\n * The range grammar is npm's everyday subset — `^`, `~`, `>=`, `>`, `<=`, `<`,\n * `=`, bare and partial versions (`1.7`, `1.x`, `*`), space for AND and `||`\n * for OR. Hyphen ranges are not read. A prerelease orders below its release,\n * without npm's rule that a range must opt into prereleases by naming one —\n * except at an exclusive upper bound, which also excludes that version's own\n * prereleases, so `^1.4` does not admit `2.0.0-rc.1`.\n */\nimport { VERSION } from '../version';\n\n/**\n * The versions a contribution can require, keyed by package without its\n * `@weasel-js/` scope. Only core reports its version today.\n */\nexport interface KitVersions {\n  core: string;\n}\n\n/** A contribution's `requires`: a semver range per package it was written against. */\nexport type KitRequirements = { readonly [K in keyof KitVersions]?: string };\n\n/** The running kit's versions. */\nexport const KIT_VERSIONS: Readonly<KitVersions> = { core: VERSION };\n\n/** One requirement the running kit does not meet. */\nexport interface RequirementMismatch {\n  package: string;\n  range: string;\n  /** The running version, or `undefined` when that package reports none. */\n  running: string | undefined;\n  reason: 'unsatisfied' | 'invalid-range' | 'unknown-package';\n}\n\ntype Triple = readonly [number, number, number];\ninterface Version { triple: Triple; pre: readonly (string | number)[] }\ninterface Comparator { op: '>=' | '<' | '>' | '<='; v: Version }\n\nconst UNKNOWN_SUFFIX = '-unknown';\nconst VERSION_RE = /^v?(\\d+)\\.(\\d+)\\.(\\d+)(?:-([0-9A-Za-z.-]+))?(?:\\+[0-9A-Za-z.-]+)?$/;\nconst PARTIAL_RE = /^v?(\\d+|[xX*])(?:\\.(\\d+|[xX*]))?(?:\\.(\\d+|[xX*]))?(?:-([0-9A-Za-z.-]+))?(?:\\+[0-9A-Za-z.-]+)?$/;\n\nfunction preOf(s: string | undefined): (string | number)[] {\n  return s ? s.split('.').map((id) => (/^\\d+$/.test(id) ? Number(id) : id)) : [];\n}\n\nfunction parseVersion(s: string): Version | null {\n  const m = VERSION_RE.exec(s.trim());\n  return m ? { triple: [Number(m[1]), Number(m[2]), Number(m[3])], pre: preOf(m[4]) } : null;\n}\n\nfunction compare(a: Version, b: Version): number {\n  for (let i = 0; i < 3; i++) {\n    const d = a.triple[i]! - b.triple[i]!;\n    if (d !== 0) return d;\n  }\n  if (a.pre.length === 0 || b.pre.length === 0) return b.pre.length - a.pre.length;\n  for (let i = 0; i < Math.max(a.pre.length, b.pre.length); i++) {\n    const x = a.pre[i];\n    const y = b.pre[i];\n    if (x === undefined) return -1;\n    if (y === undefined) return 1;\n    if (x === y) continue;\n    if (typeof x === 'number' && typeof y === 'number') return x - y;\n    if (typeof x === 'number') return -1;\n    if (typeof y === 'number') return 1;\n    return x < y ? -1 : 1;\n  }\n  return 0;\n}\n\nconst v = (a: number, b: number, c: number, pre: readonly (string | number)[] = []): Version =>\n  ({ triple: [a, b, c], pre });\n\n/** One comparator token as the interval it names. `null` when unreadable. */\nfunction parseComparator(token: string): Comparator[] | null {\n  const m = /^(\\^|~|>=|<=|>|<|=)?(.*)$/.exec(token)!;\n  const op = m[1] ?? '';\n  const p = PARTIAL_RE.exec(m[2]!);\n  if (!p) return null;\n  const nums: number[] = [];\n  for (const part of [p[1], p[2], p[3]]) {\n    if (part === undefined || /^[xX*]$/.test(part)) break;\n    nums.push(Number(part));\n  }\n  const pre = preOf(p[4]);\n  if (pre.length > 0 && nums.length < 3) return null;\n  const [M = 0, mi = 0, pa = 0] = nums;\n  const lower = v(M, mi, pa, pre);\n  // The first version past everything the partial names: `1.7` → `1.8.0`.\n  const upper = nums.length === 0 ? null\n    : nums.length === 1 ? v(M + 1, 0, 0)\n    : nums.length === 2 ? v(M, mi + 1, 0)\n    : v(M, mi, pa + 1);\n\n  switch (op) {\n    case '>=': return [{ op: '>=', v: lower }];\n    case '<': return nums.length === 0 ? [{ op: '<', v: v(0, 0, 0) }] : [{ op: '<', v: lower }];\n    case '>': return nums.length === 3 ? [{ op: '>', v: lower }] : upper ? [{ op: '>=', v: upper }] : [{ op: '<', v: v(0, 0, 0) }];\n    case '<=': return nums.length === 3 ? [{ op: '<=', v: lower }] : upper ? [{ op: '<', v: upper }] : [];\n    case '~': {\n      const top = nums.length <= 1 ? v(M + 1, 0, 0) : v(M, mi + 1, 0);\n      return [{ op: '>=', v: lower }, { op: '<', v: top }];\n    }\n    case '^': {\n      const top = M > 0 || nums.length === 1 ? v(M + 1, 0, 0)\n        : mi > 0 || nums.length === 2 ? v(0, mi + 1, 0)\n        : v(0, 0, pa + 1);\n      return nums.length === 0 ? [] : [{ op: '>=', v: lower }, { op: '<', v: top }];\n    }\n    default:\n      if (nums.length === 3) return [{ op: '>=', v: lower }, { op: '<=', v: lower }];\n      return upper ? [{ op: '>=', v: lower }, { op: '<', v: upper }] : [];\n  }\n}\n\nfunction holds(version: Version, c: Comparator): boolean {\n  const d = compare(version, c.v);\n  switch (c.op) {\n    case '>=': return d >= 0;\n    case '>': return d > 0;\n    case '<=': return d <= 0;\n    case '<': return c.v.pre.length > 0 ? d < 0 : compare(v(...version.triple), c.v) < 0;\n  }\n}\n\n/**\n * Whether `version` falls in `range`. `null` when either cannot be read, so a\n * caller can tell a mismatch from a requirement it could not check.\n */\nexport function satisfiesRange(version: string, range: string): boolean | null {\n  const parsed = parseVersion(version);\n  if (!parsed) return null;\n  const alternatives = range.split('||').map((alt) => alt.trim());\n  let any = false;\n  for (const alt of alternatives) {\n    if (alt === '') return null;\n    const set: Comparator[] = [];\n    for (const token of alt.replace(/(\\^|~|>=|<=|>|<|=)\\s+/g, '$1').split(/\\s+/)) {\n      const cs = parseComparator(token);\n      if (!cs) return null;\n      set.push(...cs);\n    }\n    if (set.every((c) => holds(parsed, c))) any = true;\n  }\n  return any;\n}\n\n/**\n * Every requirement in `requires` the running kit does not meet. A package\n * whose build does not know its own version (`0.0.0-unknown`, core's source\n * bundled without its define) is skipped: nothing can be said about it.\n */\nexport function checkRequirements(\n  requires: KitRequirements,\n  running: Readonly<Partial<Record<string, string>>> = KIT_VERSIONS,\n): RequirementMismatch[] {\n  const out: RequirementMismatch[] = [];\n  for (const [pkg, range] of Object.entries(requires)) {\n    if (range === undefined) continue;\n    const have = running[pkg];\n    if (have === undefined) {\n      out.push({ package: pkg, range, running: undefined, reason: 'unknown-package' });\n      continue;\n    }\n    if (have.endsWith(UNKNOWN_SUFFIX)) continue;\n    const ok = satisfiesRange(have, range);\n    if (ok === null) out.push({ package: pkg, range, running: have, reason: 'invalid-range' });\n    else if (!ok) out.push({ package: pkg, range, running: have, reason: 'unsatisfied' });\n  }\n  return out;\n}\n"],"mappings":";;;;;;;;;;;;;;;AAyBA,IAAa,eAAsC,EAAE,MAAM,QAAQ;AAenE,IAAM,iBAAiB;AACvB,IAAM,aAAa;AACnB,IAAM,aAAa;AAEnB,SAAS,MAAM,GAA4C;CACzD,OAAO,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,OAAQ,QAAQ,KAAK,EAAE,IAAI,OAAO,EAAE,IAAI,EAAG,IAAI,CAAC;AAC/E;AAEA,SAAS,aAAa,GAA2B;CAC/C,MAAM,IAAI,WAAW,KAAK,EAAE,KAAK,CAAC;CAClC,OAAO,IAAI;EAAE,QAAQ;GAAC,OAAO,EAAE,EAAE;GAAG,OAAO,EAAE,EAAE;GAAG,OAAO,EAAE,EAAE;EAAC;EAAG,KAAK,MAAM,EAAE,EAAE;CAAE,IAAI;AACxF;AAEA,SAAS,QAAQ,GAAY,GAAoB;CAC/C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,EAAE,OAAO,KAAM,EAAE,OAAO;EAClC,IAAI,MAAM,GAAG,OAAO;CACtB;CACA,IAAI,EAAE,IAAI,WAAW,KAAK,EAAE,IAAI,WAAW,GAAG,OAAO,EAAE,IAAI,SAAS,EAAE,IAAI;CAC1E,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,IAAI,QAAQ,EAAE,IAAI,MAAM,GAAG,KAAK;EAC7D,MAAM,IAAI,EAAE,IAAI;EAChB,MAAM,IAAI,EAAE,IAAI;EAChB,IAAI,MAAM,QAAW,OAAO;EAC5B,IAAI,MAAM,QAAW,OAAO;EAC5B,IAAI,MAAM,GAAG;EACb,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO,IAAI;EAC/D,IAAI,OAAO,MAAM,UAAU,OAAO;EAClC,IAAI,OAAO,MAAM,UAAU,OAAO;EAClC,OAAO,IAAI,IAAI,KAAK;CACtB;CACA,OAAO;AACT;AAEA,IAAM,KAAK,GAAW,GAAW,GAAW,MAAoC,CAAC,OAC9E;CAAE,QAAQ;EAAC;EAAG;EAAG;CAAC;CAAG;AAAI;;AAG5B,SAAS,gBAAgB,OAAoC;CAC3D,MAAM,IAAI,4BAA4B,KAAK,KAAK;CAChD,MAAM,KAAK,EAAE,MAAM;CACnB,MAAM,IAAI,WAAW,KAAK,EAAE,EAAG;CAC/B,IAAI,CAAC,GAAG,OAAO;CACf,MAAM,OAAiB,CAAC;CACxB,KAAK,MAAM,QAAQ;EAAC,EAAE;EAAI,EAAE;EAAI,EAAE;CAAE,GAAG;EACrC,IAAI,SAAS,UAAa,UAAU,KAAK,IAAI,GAAG;EAChD,KAAK,KAAK,OAAO,IAAI,CAAC;CACxB;CACA,MAAM,MAAM,MAAM,EAAE,EAAE;CACtB,IAAI,IAAI,SAAS,KAAK,KAAK,SAAS,GAAG,OAAO;CAC9C,MAAM,CAAC,IAAI,GAAG,KAAK,GAAG,KAAK,KAAK;CAChC,MAAM,QAAQ,EAAE,GAAG,IAAI,IAAI,GAAG;CAE9B,MAAM,QAAQ,KAAK,WAAW,IAAI,OAC9B,KAAK,WAAW,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,IACjC,KAAK,WAAW,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC,IAClC,EAAE,GAAG,IAAI,KAAK,CAAC;CAEnB,QAAQ,IAAR;EACE,KAAK,MAAM,OAAO,CAAC;GAAE,IAAI;GAAM,GAAG;EAAM,CAAC;EACzC,KAAK,KAAK,OAAO,KAAK,WAAW,IAAI,CAAC;GAAE,IAAI;GAAK,GAAG,EAAE,GAAG,GAAG,CAAC;EAAE,CAAC,IAAI,CAAC;GAAE,IAAI;GAAK,GAAG;EAAM,CAAC;EAC1F,KAAK,KAAK,OAAO,KAAK,WAAW,IAAI,CAAC;GAAE,IAAI;GAAK,GAAG;EAAM,CAAC,IAAI,QAAQ,CAAC;GAAE,IAAI;GAAM,GAAG;EAAM,CAAC,IAAI,CAAC;GAAE,IAAI;GAAK,GAAG,EAAE,GAAG,GAAG,CAAC;EAAE,CAAC;EAC7H,KAAK,MAAM,OAAO,KAAK,WAAW,IAAI,CAAC;GAAE,IAAI;GAAM,GAAG;EAAM,CAAC,IAAI,QAAQ,CAAC;GAAE,IAAI;GAAK,GAAG;EAAM,CAAC,IAAI,CAAC;EACpG,KAAK,KAAK;GACR,MAAM,MAAM,KAAK,UAAU,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC;GAC9D,OAAO,CAAC;IAAE,IAAI;IAAM,GAAG;GAAM,GAAG;IAAE,IAAI;IAAK,GAAG;GAAI,CAAC;EACrD;EACA,KAAK,KAAK;GACR,MAAM,MAAM,IAAI,KAAK,KAAK,WAAW,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,IAClD,KAAK,KAAK,KAAK,WAAW,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC,IAC5C,EAAE,GAAG,GAAG,KAAK,CAAC;GAClB,OAAO,KAAK,WAAW,IAAI,CAAC,IAAI,CAAC;IAAE,IAAI;IAAM,GAAG;GAAM,GAAG;IAAE,IAAI;IAAK,GAAG;GAAI,CAAC;EAC9E;EACA;GACE,IAAI,KAAK,WAAW,GAAG,OAAO,CAAC;IAAE,IAAI;IAAM,GAAG;GAAM,GAAG;IAAE,IAAI;IAAM,GAAG;GAAM,CAAC;GAC7E,OAAO,QAAQ,CAAC;IAAE,IAAI;IAAM,GAAG;GAAM,GAAG;IAAE,IAAI;IAAK,GAAG;GAAM,CAAC,IAAI,CAAC;CACtE;AACF;AAEA,SAAS,MAAM,SAAkB,GAAwB;CACvD,MAAM,IAAI,QAAQ,SAAS,EAAE,CAAC;CAC9B,QAAQ,EAAE,IAAV;EACE,KAAK,MAAM,OAAO,KAAK;EACvB,KAAK,KAAK,OAAO,IAAI;EACrB,KAAK,MAAM,OAAO,KAAK;EACvB,KAAK,KAAK,OAAO,EAAE,EAAE,IAAI,SAAS,IAAI,IAAI,IAAI,QAAQ,EAAE,GAAG,QAAQ,MAAM,GAAG,EAAE,CAAC,IAAI;CACrF;AACF;;;;;AAMA,SAAgB,eAAe,SAAiB,OAA+B;CAC7E,MAAM,SAAS,aAAa,OAAO;CACnC,IAAI,CAAC,QAAQ,OAAO;CACpB,MAAM,eAAe,MAAM,MAAM,IAAI,CAAC,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC;CAC9D,IAAI,MAAM;CACV,KAAK,MAAM,OAAO,cAAc;EAC9B,IAAI,QAAQ,IAAI,OAAO;EACvB,MAAM,MAAoB,CAAC;EAC3B,KAAK,MAAM,SAAS,IAAI,QAAQ,0BAA0B,IAAI,CAAC,CAAC,MAAM,KAAK,GAAG;GAC5E,MAAM,KAAK,gBAAgB,KAAK;GAChC,IAAI,CAAC,IAAI,OAAO;GAChB,IAAI,KAAK,GAAG,EAAE;EAChB;EACA,IAAI,IAAI,OAAO,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,MAAM;CAChD;CACA,OAAO;AACT;;;;;;AAOA,SAAgB,kBACd,UACA,UAAqD,cAC9B;CACvB,MAAM,MAA6B,CAAC;CACpC,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,QAAQ,GAAG;EACnD,IAAI,UAAU,QAAW;EACzB,MAAM,OAAO,QAAQ;EACrB,IAAI,SAAS,QAAW;GACtB,IAAI,KAAK;IAAE,SAAS;IAAK;IAAO,SAAS;IAAW,QAAQ;GAAkB,CAAC;GAC/E;EACF;EACA,IAAI,KAAK,SAAS,cAAc,GAAG;EACnC,MAAM,KAAK,eAAe,MAAM,KAAK;EACrC,IAAI,OAAO,MAAM,IAAI,KAAK;GAAE,SAAS;GAAK;GAAO,SAAS;GAAM,QAAQ;EAAgB,CAAC;OACpF,IAAI,CAAC,IAAI,IAAI,KAAK;GAAE,SAAS;GAAK;GAAO,SAAS;GAAM,QAAQ;EAAc,CAAC;CACtF;CACA,OAAO;AACT"}

package/dist/canvas/layerHover.js

@@ -0,0 +1,28 @@
+import { isLayerPainted } from "../core/layers/render.js";
+import { NO_LAYER_VISIBILITY } from "./useExtraLayers.js";
+
+//#region src/canvas/layerHover.ts
+/** Deliver an uncaptured hover, and the pointer leaving, to every painted layer that asks. */
+function layerHover(layers, frame) {
+	return {
+		onHover: (_el, e) => {
+			const view = frame.viewRef.current;
+			const [worldX, worldY] = frame.toWorld(e.clientX, e.clientY);
+			const visibility = frame.layerVisibility ?? NO_LAYER_VISIBILITY;
+			for (const layer of layers) {
+				if (!layer.onUncapturedMove || !isLayerPainted(layer, visibility, frame.layerOrder)) continue;
+				layer.onUncapturedMove(worldX, worldY, e, view, {
+					width: frame.dims.width,
+					height: frame.dims.height
+				});
+			}
+		},
+		onLeave: () => {
+			for (const layer of layers) layer.onUncapturedLeave?.();
+		}
+	};
+}
+
+//#endregion
+export { layerHover };
+//# sourceMappingURL=layerHover.js.map

package/dist/canvas/layerHover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layerHover.js","names":[],"sources":["../../src/canvas/layerHover.ts"],"sourcesContent":["import { isLayerPainted, type Dims, type RenderLayer } from 'core/layers/render';\nimport type { View } from 'core/viewport/view';\nimport type { SurfaceInputHandlers } from './useSurfaceInput';\nimport { NO_LAYER_VISIBILITY } from './useExtraLayers';\n\n/** Where a hover lands, as of the render that built the handlers. */\nexport interface HoverFrame {\n  viewRef: { readonly current: View };\n  toWorld: (clientX: number, clientY: number) => [number, number];\n  layerVisibility: Record<string, boolean> | undefined;\n  layerOrder: string[] | undefined;\n  dims: Dims;\n}\n\n/** Deliver an uncaptured hover, and the pointer leaving, to every painted layer that asks. */\nexport function layerHover(\n  layers: readonly RenderLayer<unknown>[],\n  frame: HoverFrame,\n): Pick<SurfaceInputHandlers, 'onHover' | 'onLeave'> {\n  return {\n    onHover: (_el, e) => {\n      const view = frame.viewRef.current;\n      const [worldX, worldY] = frame.toWorld(e.clientX, e.clientY);\n      const visibility = frame.layerVisibility ?? NO_LAYER_VISIBILITY;\n      // Same gate as `hitTestExtrasIn`: a layer nobody can see takes no input.\n      for (const layer of layers) {\n        if (!layer.onUncapturedMove || !isLayerPainted(layer, visibility, frame.layerOrder)) continue;\n        layer.onUncapturedMove(worldX, worldY, e, view, { width: frame.dims.width, height: frame.dims.height });\n      }\n    },\n    onLeave: () => {\n      for (const layer of layers) layer.onUncapturedLeave?.();\n    },\n  };\n}\n"],"mappings":";;;;;AAeA,SAAgB,WACd,QACA,OACmD;CACnD,OAAO;EACL,UAAU,KAAK,MAAM;GACnB,MAAM,OAAO,MAAM,QAAQ;GAC3B,MAAM,CAAC,QAAQ,UAAU,MAAM,QAAQ,EAAE,SAAS,EAAE,OAAO;GAC3D,MAAM,aAAa,MAAM,mBAAmB;GAE5C,KAAK,MAAM,SAAS,QAAQ;IAC1B,IAAI,CAAC,MAAM,oBAAoB,CAAC,eAAe,OAAO,YAAY,MAAM,UAAU,GAAG;IACrF,MAAM,iBAAiB,QAAQ,QAAQ,GAAG,MAAM;KAAE,OAAO,MAAM,KAAK;KAAO,QAAQ,MAAM,KAAK;IAAO,CAAC;GACxG;EACF;EACA,eAAe;GACb,KAAK,MAAM,SAAS,QAAQ,MAAM,oBAAoB;EACxD;CACF;AACF"}

package/dist/canvas/layerOrder.js

@@ -1,73 +1,123 @@
-import { STANDARD_SLOTS as e, isCustomEntry as t } from "./layerSlots.js";
+import { STANDARD_SLOTS, isCustomEntry } from "./layerSlots.js";
+
 //#region src/canvas/layerOrder.ts
-var n = new Set(e);
-function r(r, i, a, o) {
-	let s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Map(), l = [], u = /* @__PURE__ */ new Set();
-	for (let [e, i] of Object.entries(r)) if (!n.has(e) && t(i)) {
-		if (u.add(e), i.after) {
-			let t = s.get(i.after) ?? [];
-			t.push({
-				key: e,
-				layer: i.layer
-			}), s.set(i.after, t);
-		} else if (i.before) {
-			let t = c.get(i.before) ?? [];
-			t.push({
-				key: e,
-				layer: i.layer
-			}), c.set(i.before, t);
-		} else l.push({
-			key: e,
-			layer: i.layer
+var STANDARD_SLOT_SET = new Set(STANDARD_SLOTS);
+/**
+* Compose the final ordered layer list from a layersMap and the resolved
+* standard-slot layers.
+*
+* - Standard slots are emitted in `STANDARD_SLOTS` order.
+* - `after: 'X'` / `before: 'X'` accept standard slot names OR other
+*   custom-layer keys, and chains may mix the two.
+* - Customs with neither `after` nor `before` are emitted after all standard
+*   slots.
+* - Dangling references and cycles go to the tail with a `console.warn`.
+* - An entry with both `after` and `before` is placed by `after`.
+*/
+function composeOrderedLayers(layersMap, standardLayers, sceneLayers, background) {
+	const afterByParent = /* @__PURE__ */ new Map();
+	const beforeByParent = /* @__PURE__ */ new Map();
+	const tail = [];
+	const allCustomKeys = /* @__PURE__ */ new Set();
+	for (const [key, value] of Object.entries(layersMap)) {
+		if (STANDARD_SLOT_SET.has(key)) continue;
+		if (!isCustomEntry(value)) continue;
+		allCustomKeys.add(key);
+		if (value.after) {
+			const arr = afterByParent.get(value.after) ?? [];
+			arr.push({
+				key,
+				layer: value.layer
+			});
+			afterByParent.set(value.after, arr);
+		} else if (value.before) {
+			const arr = beforeByParent.get(value.before) ?? [];
+			arr.push({
+				key,
+				layer: value.layer
+			});
+			beforeByParent.set(value.before, arr);
+		} else tail.push({
+			key,
+			layer: value.layer
 		});
 	}
-	let d = /* @__PURE__ */ new Set(), f = o ? [o] : [];
-	function p(e) {
-		d.has(e.key) || (d.add(e.key), h(e.key), f.push(e.layer), m(e.key));
+	const emitted = /* @__PURE__ */ new Set();
+	const out = background ? [background] : [];
+	function emitChild(child) {
+		if (emitted.has(child.key)) return;
+		emitted.add(child.key);
+		emitBefore(child.key);
+		out.push(child.layer);
+		emitAfter(child.key);
 	}
-	function m(e) {
-		for (let t of s.get(e) ?? []) p(t);
+	function emitAfter(parentKey) {
+		for (const child of afterByParent.get(parentKey) ?? []) emitChild(child);
 	}
-	function h(e) {
-		for (let t of c.get(e) ?? []) p(t);
+	function emitBefore(parentKey) {
+		for (const child of beforeByParent.get(parentKey) ?? []) emitChild(child);
 	}
-	for (let t of e) {
-		if (t === "scene" && a) {
-			h("scene");
-			for (let e of a) h(e.key), f.push(e.layer), m(e.key);
-			m("scene");
+	for (const slot of STANDARD_SLOTS) {
+		if (slot === "scene" && sceneLayers) {
+			emitBefore("scene");
+			for (const sl of sceneLayers) {
+				emitBefore(sl.key);
+				out.push(sl.layer);
+				emitAfter(sl.key);
+			}
+			emitAfter("scene");
 			continue;
 		}
-		h(t);
-		let e = i[t];
-		e && f.push(e), m(t);
+		emitBefore(slot);
+		const layer = standardLayers[slot];
+		if (layer) out.push(layer);
+		emitAfter(slot);
+	}
+	for (const t of tail) {
+		if (emitted.has(t.key)) continue;
+		emitted.add(t.key);
+		out.push(t.layer);
 	}
-	for (let e of l) d.has(e.key) || (d.add(e.key), f.push(e.layer));
-	let g = (e) => {
-		let n = r[e];
-		return t(n) ? n.after ?? n.before : void 0;
-	}, _ = (e) => {
-		let t = g(e);
-		for (let n = 0; t !== void 0 && n < u.size; n++) {
-			if (t === e) return !0;
-			t = g(t);
+	const anchorOf = (key) => {
+		const value = layersMap[key];
+		return isCustomEntry(value) ? value.after ?? value.before : void 0;
+	};
+	const inCycle = (key) => {
+		let at = anchorOf(key);
+		for (let hops = 0; at !== void 0 && hops < allCustomKeys.size; hops++) {
+			if (at === key) return true;
+			at = anchorOf(at);
 		}
-		return !1;
+		return false;
 	};
-	for (let e of u) {
-		if (d.has(e)) continue;
-		let n = r[e];
-		if (!t(n)) continue;
-		let i = n.after ?? n.before;
-		console.warn(_(e) ? `composeOrderedLayers: cycle detected involving custom layer "${e}" — falling back to tail` : `composeOrderedLayers: dangling reference "${i}" from custom layer "${e}" — falling back to tail`), d.add(e), f.push(n.layer);
+	for (const key of allCustomKeys) {
+		if (emitted.has(key)) continue;
+		const value = layersMap[key];
+		if (!isCustomEntry(value)) continue;
+		const ref = value.after ?? value.before;
+		console.warn(inCycle(key) ? `composeOrderedLayers: cycle detected involving custom layer "${key}" — falling back to tail` : `composeOrderedLayers: dangling reference "${ref}" from custom layer "${key}" — falling back to tail`);
+		emitted.add(key);
+		out.push(value.layer);
 	}
-	return f;
+	return out;
 }
-function i(e, t, n) {
-	let r = n("before-selection"), i = n("after-selection"), a = t ? e.indexOf(t) : -1;
-	return a >= 0 ? (e.splice(a + 1, 0, ...i), e.splice(a, 0, ...r)) : e.push(...r, ...i), e.push(...n("top")), e;
+/**
+* Splice a tool's positioned overlays into an already-composed layer list.
+* With no selection chrome present the anchored overlays fall back to the
+* tail, keeping their relative order. Mutates and returns `ordered`.
+*/
+function placeToolOverlays(ordered, selectionOverlay, overlays) {
+	const before = overlays("before-selection");
+	const after = overlays("after-selection");
+	const at = selectionOverlay ? ordered.indexOf(selectionOverlay) : -1;
+	if (at >= 0) {
+		ordered.splice(at + 1, 0, ...after);
+		ordered.splice(at, 0, ...before);
+	} else ordered.push(...before, ...after);
+	ordered.push(...overlays("top"));
+	return ordered;
 }
-//#endregion
-export { r as composeOrderedLayers, i as placeToolOverlays };
 
+//#endregion
+export { composeOrderedLayers, placeToolOverlays };
 //# sourceMappingURL=layerOrder.js.map