@cratis/scene.engine 0.1.0

package/dist/esm/resolvePackageDependencies.js

@@ -0,0 +1,147 @@
+import { isVersionSatisfiedBy } from './packageVersionRange.js';
+
+// Copyright (c) Cratis. All rights reserved.
+// Licensed under the MIT license. See LICENSE file in the project root for full license information.
+/**
+ * Expands a chosen set of package names into the complete, correctly ordered list a {@link UiProfile}
+ * needs — the runtime half. The C# twin in `Cratis.Scene.Engine` implements the same algorithm for
+ * Studio's package picker and Stage's build; both are asserted against the same shared fixture corpus so
+ * they cannot drift apart.
+ *
+ * This is a different concern from `resolveComponentName`, which resolves one component *name* against
+ * an already-decided package list. This decides what that list is.
+ *
+ * Ordering is a stable topological sort: among packages whose dependencies are equally satisfied, the one
+ * the caller named first comes first, and packages pulled in transitively follow in the order they were
+ * discovered. When a cycle makes ordering impossible, the packages involved are reported in `cycles` and
+ * appended in discovery order rather than dropped.
+ */ function resolvePackageDependencies(selected, catalog) {
+    const index = new Map(catalog.map((scenePackage)=>[
+            scenePackage.name,
+            scenePackage
+        ]));
+    const discovered = [];
+    const seen = new Set(selected);
+    const missing = [];
+    const versionConflicts = [];
+    const pending = [
+        ...selected
+    ];
+    while(pending.length > 0){
+        const name = pending.shift();
+        discovered.push(name);
+        const scenePackage = index.get(name);
+        if (!scenePackage) continue;
+        for (const dependency of scenePackage.dependencies){
+            const dependedOn = index.get(dependency.name);
+            if (!dependedOn) {
+                missing.push({
+                    package: scenePackage.name,
+                    dependsOn: dependency.name
+                });
+                continue;
+            }
+            if (!isVersionSatisfiedBy(dependedOn.version, dependency.versionRange)) {
+                versionConflicts.push({
+                    package: scenePackage.name,
+                    dependsOn: dependency.name,
+                    requiredRange: dependency.versionRange,
+                    actualVersion: dependedOn.version
+                });
+            }
+            if (!seen.has(dependency.name)) {
+                seen.add(dependency.name);
+                pending.push(dependency.name);
+            }
+        }
+    }
+    const cycles = findCycles(discovered, index);
+    const packages = topologicallyOrder(discovered, index);
+    const chosen = new Set(selected);
+    return {
+        packages,
+        added: packages.filter((name)=>!chosen.has(name)),
+        missing,
+        versionConflicts,
+        cycles
+    };
+}
+function dependenciesWithin(name, index, within) {
+    const scenePackage = index.get(name);
+    if (!scenePackage) return [];
+    const names = scenePackage.dependencies.map((dependency)=>dependency.name).filter((dependency)=>within.has(dependency));
+    return [
+        ...new Set(names)
+    ];
+}
+/**
+ * Orders an already-closed set of package names so each follows the packages it depends on.
+ */ function topologicallyOrder(names, index) {
+    const within = new Set(names);
+    const remaining = new Map(names.map((name)=>[
+            name,
+            dependenciesWithin(name, index, within).length
+        ]));
+    const ordered = [];
+    const placed = new Set();
+    let progressed = true;
+    while(progressed){
+        progressed = false;
+        for (const name of names){
+            if (placed.has(name) || remaining.get(name) !== 0) continue;
+            ordered.push(name);
+            placed.add(name);
+            progressed = true;
+            for (const other of names){
+                if (placed.has(other)) continue;
+                if (dependenciesWithin(other, index, within).includes(name)) {
+                    remaining.set(other, remaining.get(other) - 1);
+                }
+            }
+        }
+    }
+    // Anything left is inside a cycle, or downstream of one. It is reported through `cycles`; keeping it
+    // in the list means a package picker never silently loses a package it was told about.
+    ordered.push(...names.filter((name)=>!placed.has(name)));
+    return ordered;
+}
+/**
+ * Finds every dependency cycle, walking depth-first from each package in discovery order so the result
+ * is deterministic. A cycle is recorded once, keyed by the set of packages in it.
+ */ function findCycles(names, index) {
+    const within = new Set(names);
+    const cycles = [];
+    const recorded = new Set();
+    const path = [];
+    const onPath = new Set();
+    const explored = new Set();
+    const walk = (name)=>{
+        if (onPath.has(name)) {
+            const cycle = path.slice(path.indexOf(name));
+            const key = [
+                ...cycle
+            ].sort().join(' ');
+            if (!recorded.has(key)) {
+                recorded.add(key);
+                cycles.push(cycle);
+            }
+            return;
+        }
+        if (explored.has(name)) return;
+        explored.add(name);
+        path.push(name);
+        onPath.add(name);
+        for (const dependency of dependenciesWithin(name, index, within)){
+            walk(dependency);
+        }
+        onPath.delete(name);
+        path.pop();
+    };
+    for (const name of names){
+        walk(name);
+    }
+    return cycles;
+}
+
+export { resolvePackageDependencies };
+//# sourceMappingURL=resolvePackageDependencies.js.map

package/dist/esm/resolvePackageDependencies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolvePackageDependencies.js","sources":["../../resolvePackageDependencies.ts"],"sourcesContent":["// Copyright (c) Cratis. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\nimport { ScenePackage } from '@cratis/scene.model';\nimport { MissingPackageDependency, PackageSelection, PackageVersionConflict } from './PackageSelection';\nimport { isVersionSatisfiedBy } from './packageVersionRange';\n\n/**\n * Expands a chosen set of package names into the complete, correctly ordered list a {@link UiProfile}\n * needs — the runtime half. The C# twin in `Cratis.Scene.Engine` implements the same algorithm for\n * Studio's package picker and Stage's build; both are asserted against the same shared fixture corpus so\n * they cannot drift apart.\n *\n * This is a different concern from `resolveComponentName`, which resolves one component *name* against\n * an already-decided package list. This decides what that list is.\n *\n * Ordering is a stable topological sort: among packages whose dependencies are equally satisfied, the one\n * the caller named first comes first, and packages pulled in transitively follow in the order they were\n * discovered. When a cycle makes ordering impossible, the packages involved are reported in `cycles` and\n * appended in discovery order rather than dropped.\n */\nexport function resolvePackageDependencies(selected: string[], catalog: ScenePackage[]): PackageSelection {\n    const index = new Map(catalog.map((scenePackage) => [scenePackage.name, scenePackage]));\n    const discovered: string[] = [];\n    const seen = new Set<string>(selected);\n    const missing: MissingPackageDependency[] = [];\n    const versionConflicts: PackageVersionConflict[] = [];\n\n    const pending = [...selected];\n    while (pending.length > 0) {\n        const name = pending.shift()!;\n        discovered.push(name);\n\n        const scenePackage = index.get(name);\n        if (!scenePackage) continue;\n\n        for (const dependency of scenePackage.dependencies) {\n            const dependedOn = index.get(dependency.name);\n            if (!dependedOn) {\n                missing.push({ package: scenePackage.name, dependsOn: dependency.name });\n                continue;\n            }\n\n            if (!isVersionSatisfiedBy(dependedOn.version, dependency.versionRange)) {\n                versionConflicts.push({\n                    package: scenePackage.name,\n                    dependsOn: dependency.name,\n                    requiredRange: dependency.versionRange!,\n                    actualVersion: dependedOn.version,\n                });\n            }\n\n            if (!seen.has(dependency.name)) {\n                seen.add(dependency.name);\n                pending.push(dependency.name);\n            }\n        }\n    }\n\n    const cycles = findCycles(discovered, index);\n    const packages = topologicallyOrder(discovered, index);\n    const chosen = new Set(selected);\n\n    return {\n        packages,\n        added: packages.filter((name) => !chosen.has(name)),\n        missing,\n        versionConflicts,\n        cycles,\n    };\n}\n\nfunction dependenciesWithin(name: string, index: Map<string, ScenePackage>, within: Set<string>): string[] {\n    const scenePackage = index.get(name);\n    if (!scenePackage) return [];\n    const names = scenePackage.dependencies.map((dependency) => dependency.name).filter((dependency) => within.has(dependency));\n    return [...new Set(names)];\n}\n\n/**\n * Orders an already-closed set of package names so each follows the packages it depends on.\n */\nfunction topologicallyOrder(names: string[], index: Map<string, ScenePackage>): string[] {\n    const within = new Set(names);\n    const remaining = new Map(names.map((name) => [name, dependenciesWithin(name, index, within).length]));\n\n    const ordered: string[] = [];\n    const placed = new Set<string>();\n    let progressed = true;\n    while (progressed) {\n        progressed = false;\n        for (const name of names) {\n            if (placed.has(name) || remaining.get(name) !== 0) continue;\n\n            ordered.push(name);\n            placed.add(name);\n            progressed = true;\n\n            for (const other of names) {\n                if (placed.has(other)) continue;\n                if (dependenciesWithin(other, index, within).includes(name)) {\n                    remaining.set(other, remaining.get(other)! - 1);\n                }\n            }\n        }\n    }\n\n    // Anything left is inside a cycle, or downstream of one. It is reported through `cycles`; keeping it\n    // in the list means a package picker never silently loses a package it was told about.\n    ordered.push(...names.filter((name) => !placed.has(name)));\n    return ordered;\n}\n\n/**\n * Finds every dependency cycle, walking depth-first from each package in discovery order so the result\n * is deterministic. A cycle is recorded once, keyed by the set of packages in it.\n */\nfunction findCycles(names: string[], index: Map<string, ScenePackage>): string[][] {\n    const within = new Set(names);\n    const cycles: string[][] = [];\n    const recorded = new Set<string>();\n    const path: string[] = [];\n    const onPath = new Set<string>();\n    const explored = new Set<string>();\n\n    const walk = (name: string) => {\n        if (onPath.has(name)) {\n            const cycle = path.slice(path.indexOf(name));\n            const key = [...cycle].sort().join(' ');\n            if (!recorded.has(key)) {\n                recorded.add(key);\n                cycles.push(cycle);\n            }\n\n            return;\n        }\n\n        if (explored.has(name)) return;\n        explored.add(name);\n\n        path.push(name);\n        onPath.add(name);\n        for (const dependency of dependenciesWithin(name, index, within)) {\n            walk(dependency);\n        }\n\n        onPath.delete(name);\n        path.pop();\n    };\n\n    for (const name of names) {\n        walk(name);\n    }\n\n    return cycles;\n}\n"],"names":["resolvePackageDependencies","selected","catalog","index","Map","map","scenePackage","name","discovered","seen","Set","missing","versionConflicts","pending","length","shift","push","get","dependency","dependencies","dependedOn","package","dependsOn","isVersionSatisfiedBy","version","versionRange","requiredRange","actualVersion","has","add","cycles","findCycles","packages","topologicallyOrder","chosen","added","filter","dependenciesWithin","within","names","remaining","ordered","placed","progressed","other","includes","set","recorded","path","onPath","explored","walk","cycle","slice","indexOf","key","sort","join","delete","pop"],"mappings":";;AAAA;AACA;AAMA;;;;;;;;;;;;;AAaC,IACM,SAASA,0BAAAA,CAA2BC,QAAkB,EAAEC,OAAuB,EAAA;AAClF,IAAA,MAAMC,QAAQ,IAAIC,GAAAA,CAAIF,QAAQG,GAAG,CAAC,CAACC,YAAAA,GAAiB;AAACA,YAAAA,YAAAA,CAAaC,IAAI;AAAED,YAAAA;AAAa,SAAA,CAAA,CAAA;AACrF,IAAA,MAAME,aAAuB,EAAE;IAC/B,MAAMC,IAAAA,GAAO,IAAIC,GAAAA,CAAYT,QAAAA,CAAAA;AAC7B,IAAA,MAAMU,UAAsC,EAAE;AAC9C,IAAA,MAAMC,mBAA6C,EAAE;AAErD,IAAA,MAAMC,OAAAA,GAAU;AAAIZ,QAAAA,GAAAA;AAAS,KAAA;IAC7B,MAAOY,OAAAA,CAAQC,MAAM,GAAG,CAAA,CAAG;QACvB,MAAMP,IAAAA,GAAOM,QAAQE,KAAK,EAAA;AAC1BP,QAAAA,UAAAA,CAAWQ,IAAI,CAACT,IAAAA,CAAAA;QAEhB,MAAMD,YAAAA,GAAeH,KAAAA,CAAMc,GAAG,CAACV,IAAAA,CAAAA;AAC/B,QAAA,IAAI,CAACD,YAAAA,EAAc;AAEnB,QAAA,KAAK,MAAMY,UAAAA,IAAcZ,YAAAA,CAAaa,YAAY,CAAE;AAChD,YAAA,MAAMC,UAAAA,GAAajB,KAAAA,CAAMc,GAAG,CAACC,WAAWX,IAAI,CAAA;AAC5C,YAAA,IAAI,CAACa,UAAAA,EAAY;AACbT,gBAAAA,OAAAA,CAAQK,IAAI,CAAC;AAAEK,oBAAAA,OAAAA,EAASf,aAAaC,IAAI;AAAEe,oBAAAA,SAAAA,EAAWJ,WAAWX;AAAK,iBAAA,CAAA;AACtE,gBAAA;AACJ,YAAA;AAEA,YAAA,IAAI,CAACgB,oBAAAA,CAAqBH,UAAAA,CAAWI,OAAO,EAAEN,UAAAA,CAAWO,YAAY,CAAA,EAAG;AACpEb,gBAAAA,gBAAAA,CAAiBI,IAAI,CAAC;AAClBK,oBAAAA,OAAAA,EAASf,aAAaC,IAAI;AAC1Be,oBAAAA,SAAAA,EAAWJ,WAAWX,IAAI;AAC1BmB,oBAAAA,aAAAA,EAAeR,WAAWO,YAAY;AACtCE,oBAAAA,aAAAA,EAAeP,WAAWI;AAC9B,iBAAA,CAAA;AACJ,YAAA;AAEA,YAAA,IAAI,CAACf,IAAAA,CAAKmB,GAAG,CAACV,UAAAA,CAAWX,IAAI,CAAA,EAAG;gBAC5BE,IAAAA,CAAKoB,GAAG,CAACX,UAAAA,CAAWX,IAAI,CAAA;gBACxBM,OAAAA,CAAQG,IAAI,CAACE,UAAAA,CAAWX,IAAI,CAAA;AAChC,YAAA;AACJ,QAAA;AACJ,IAAA;IAEA,MAAMuB,MAAAA,GAASC,WAAWvB,UAAAA,EAAYL,KAAAA,CAAAA;IACtC,MAAM6B,QAAAA,GAAWC,mBAAmBzB,UAAAA,EAAYL,KAAAA,CAAAA;IAChD,MAAM+B,MAAAA,GAAS,IAAIxB,GAAAA,CAAIT,QAAAA,CAAAA;IAEvB,OAAO;AACH+B,QAAAA,QAAAA;QACAG,KAAAA,EAAOH,QAAAA,CAASI,MAAM,CAAC,CAAC7B,OAAS,CAAC2B,MAAAA,CAAON,GAAG,CAACrB,IAAAA,CAAAA,CAAAA;AAC7CI,QAAAA,OAAAA;AACAC,QAAAA,gBAAAA;AACAkB,QAAAA;AACJ,KAAA;AACJ;AAEA,SAASO,kBAAAA,CAAmB9B,IAAY,EAAEJ,KAAgC,EAAEmC,MAAmB,EAAA;IAC3F,MAAMhC,YAAAA,GAAeH,KAAAA,CAAMc,GAAG,CAACV,IAAAA,CAAAA;IAC/B,IAAI,CAACD,YAAAA,EAAc,OAAO,EAAE;AAC5B,IAAA,MAAMiC,QAAQjC,YAAAA,CAAaa,YAAY,CAACd,GAAG,CAAC,CAACa,UAAAA,GAAeA,UAAAA,CAAWX,IAAI,EAAE6B,MAAM,CAAC,CAAClB,UAAAA,GAAeoB,MAAAA,CAAOV,GAAG,CAACV,UAAAA,CAAAA,CAAAA;IAC/G,OAAO;AAAI,QAAA,GAAA,IAAIR,GAAAA,CAAI6B,KAAAA;AAAO,KAAA;AAC9B;AAEA;;AAEC,IACD,SAASN,kBAAAA,CAAmBM,KAAe,EAAEpC,KAAgC,EAAA;IACzE,MAAMmC,MAAAA,GAAS,IAAI5B,GAAAA,CAAI6B,KAAAA,CAAAA;AACvB,IAAA,MAAMC,YAAY,IAAIpC,GAAAA,CAAImC,MAAMlC,GAAG,CAAC,CAACE,IAAAA,GAAS;AAACA,YAAAA,IAAAA;YAAM8B,kBAAAA,CAAmB9B,IAAAA,EAAMJ,KAAAA,EAAOmC,MAAAA,CAAAA,CAAQxB;AAAO,SAAA,CAAA,CAAA;AAEpG,IAAA,MAAM2B,UAAoB,EAAE;AAC5B,IAAA,MAAMC,SAAS,IAAIhC,GAAAA,EAAAA;AACnB,IAAA,IAAIiC,UAAAA,GAAa,IAAA;AACjB,IAAA,MAAOA,UAAAA,CAAY;QACfA,UAAAA,GAAa,KAAA;QACb,KAAK,MAAMpC,QAAQgC,KAAAA,CAAO;YACtB,IAAIG,MAAAA,CAAOd,GAAG,CAACrB,IAAAA,CAAAA,IAASiC,UAAUvB,GAAG,CAACV,UAAU,CAAA,EAAG;AAEnDkC,YAAAA,OAAAA,CAAQzB,IAAI,CAACT,IAAAA,CAAAA;AACbmC,YAAAA,MAAAA,CAAOb,GAAG,CAACtB,IAAAA,CAAAA;YACXoC,UAAAA,GAAa,IAAA;YAEb,KAAK,MAAMC,SAASL,KAAAA,CAAO;gBACvB,IAAIG,MAAAA,CAAOd,GAAG,CAACgB,KAAAA,CAAAA,EAAQ;AACvB,gBAAA,IAAIP,mBAAmBO,KAAAA,EAAOzC,KAAAA,EAAOmC,MAAAA,CAAAA,CAAQO,QAAQ,CAACtC,IAAAA,CAAAA,EAAO;AACzDiC,oBAAAA,SAAAA,CAAUM,GAAG,CAACF,KAAAA,EAAOJ,SAAAA,CAAUvB,GAAG,CAAC2B,KAAAA,CAAAA,GAAU,CAAA,CAAA;AACjD,gBAAA;AACJ,YAAA;AACJ,QAAA;AACJ,IAAA;;;IAIAH,OAAAA,CAAQzB,IAAI,CAAA,GAAIuB,KAAAA,CAAMH,MAAM,CAAC,CAAC7B,IAAAA,GAAS,CAACmC,MAAAA,CAAOd,GAAG,CAACrB,IAAAA,CAAAA,CAAAA,CAAAA;IACnD,OAAOkC,OAAAA;AACX;AAEA;;;AAGC,IACD,SAASV,UAAAA,CAAWQ,KAAe,EAAEpC,KAAgC,EAAA;IACjE,MAAMmC,MAAAA,GAAS,IAAI5B,GAAAA,CAAI6B,KAAAA,CAAAA;AACvB,IAAA,MAAMT,SAAqB,EAAE;AAC7B,IAAA,MAAMiB,WAAW,IAAIrC,GAAAA,EAAAA;AACrB,IAAA,MAAMsC,OAAiB,EAAE;AACzB,IAAA,MAAMC,SAAS,IAAIvC,GAAAA,EAAAA;AACnB,IAAA,MAAMwC,WAAW,IAAIxC,GAAAA,EAAAA;AAErB,IAAA,MAAMyC,OAAO,CAAC5C,IAAAA,GAAAA;QACV,IAAI0C,MAAAA,CAAOrB,GAAG,CAACrB,IAAAA,CAAAA,EAAO;AAClB,YAAA,MAAM6C,QAAQJ,IAAAA,CAAKK,KAAK,CAACL,IAAAA,CAAKM,OAAO,CAAC/C,IAAAA,CAAAA,CAAAA;AACtC,YAAA,MAAMgD,GAAAA,GAAM;AAAIH,gBAAAA,GAAAA;aAAM,CAACI,IAAI,EAAA,CAAGC,IAAI,CAAC,GAAA,CAAA;AACnC,YAAA,IAAI,CAACV,QAAAA,CAASnB,GAAG,CAAC2B,GAAAA,CAAAA,EAAM;AACpBR,gBAAAA,QAAAA,CAASlB,GAAG,CAAC0B,GAAAA,CAAAA;AACbzB,gBAAAA,MAAAA,CAAOd,IAAI,CAACoC,KAAAA,CAAAA;AAChB,YAAA;AAEA,YAAA;AACJ,QAAA;QAEA,IAAIF,QAAAA,CAAStB,GAAG,CAACrB,IAAAA,CAAAA,EAAO;AACxB2C,QAAAA,QAAAA,CAASrB,GAAG,CAACtB,IAAAA,CAAAA;AAEbyC,QAAAA,IAAAA,CAAKhC,IAAI,CAACT,IAAAA,CAAAA;AACV0C,QAAAA,MAAAA,CAAOpB,GAAG,CAACtB,IAAAA,CAAAA;AACX,QAAA,KAAK,MAAMW,UAAAA,IAAcmB,kBAAAA,CAAmB9B,IAAAA,EAAMJ,OAAOmC,MAAAA,CAAAA,CAAS;YAC9Da,IAAAA,CAAKjC,UAAAA,CAAAA;AACT,QAAA;AAEA+B,QAAAA,MAAAA,CAAOS,MAAM,CAACnD,IAAAA,CAAAA;AACdyC,QAAAA,IAAAA,CAAKW,GAAG,EAAA;AACZ,IAAA,CAAA;IAEA,KAAK,MAAMpD,QAAQgC,KAAAA,CAAO;QACtBY,IAAAA,CAAK5C,IAAAA,CAAAA;AACT,IAAA;IAEA,OAAOuB,MAAAA;AACX;;;;"}

package/dist/esm/resolveScreenTemplates.d.ts

@@ -0,0 +1,20 @@
+import { Layout, ScreenTemplate } from '@cratis/scene.model';
+export interface ScreenTemplatePlacement {
+    template: string;
+    slot: string;
+    container: string;
+    depth: number;
+}
+export interface UnplacedScreenTemplate {
+    template: string;
+    slot: string;
+    candidates: string[];
+}
+export interface ScreenTemplateResolution {
+    placements: ScreenTemplatePlacement[];
+    unplaced: UnplacedScreenTemplate[];
+    cycles: string[][];
+}
+export declare function isScreenTemplateResolutionValid(resolution: ScreenTemplateResolution): boolean;
+export declare function resolveScreenTemplates(layout: Layout, templates: ScreenTemplate[]): ScreenTemplateResolution;
+//# sourceMappingURL=resolveScreenTemplates.d.ts.map

package/dist/esm/resolveScreenTemplates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolveScreenTemplates.d.ts","sourceRoot":"","sources":["../../resolveScreenTemplates.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAM7D,MAAM,WAAW,uBAAuB;IAEpC,QAAQ,EAAE,MAAM,CAAC;IAEjB,IAAI,EAAE,MAAM,CAAC;IAEb,SAAS,EAAE,MAAM,CAAC;IAElB,KAAK,EAAE,MAAM,CAAC;CACjB;AAMD,MAAM,WAAW,sBAAsB;IAEnC,QAAQ,EAAE,MAAM,CAAC;IAEjB,IAAI,EAAE,MAAM,CAAC;IAKb,UAAU,EAAE,MAAM,EAAE,CAAC;CACxB;AAKD,MAAM,WAAW,wBAAwB;IAErC,UAAU,EAAE,uBAAuB,EAAE,CAAC;IAMtC,QAAQ,EAAE,sBAAsB,EAAE,CAAC;IAEnC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CACtB;AAKD,wBAAgB,+BAA+B,CAAC,UAAU,EAAE,wBAAwB,GAAG,OAAO,CAE7F;AAcD,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,GAAG,wBAAwB,CA0C5G"}

package/dist/esm/resolveScreenTemplates.js

@@ -0,0 +1,133 @@
+// Copyright (c) Cratis. All rights reserved.
+// Licensed under the MIT license. See LICENSE file in the project root for full license information.
+/**
+ * Whether every template found exactly one home and nothing nests inside itself.
+ */ function isScreenTemplateResolutionValid(resolution) {
+    return resolution.unplaced.length === 0 && resolution.cycles.length === 0;
+}
+/**
+ * Works out how a blueprint's {@link ScreenTemplate}s nest inside its {@link Layout}.
+ *
+ * A template declares only the *name* of the slot it fits, never which container owns that slot. That is
+ * what makes templates reusable — a feature's template says "I go in the module content area", not "I go
+ * inside this specific module". Resolution is the step that turns those names into a tree, by finding which
+ * layout or template declares each name.
+ *
+ * The same rule applies at every level, so nesting has no depth limit and no separate mechanism per level.
+ * The C# twin in `Cratis.Scene.Engine` implements the same algorithm; both are asserted against the same
+ * shared fixture corpus so they cannot drift apart.
+ */ function resolveScreenTemplates(layout, templates) {
+    const containersBySlot = buildSlotIndex(layout, templates);
+    const parents = new Map();
+    const slots = new Map();
+    const unplaced = [];
+    for (const template of templates){
+        if (template.fitsSlot === undefined) continue;
+        const [qualifier, slot] = splitQualifiedSlot(template.fitsSlot);
+        const candidates = (containersBySlot.get(slot) ?? []).filter((container)=>container !== template.name && (qualifier === undefined || container === qualifier));
+        if (candidates.length === 1) {
+            parents.set(template.name, candidates[0]);
+            slots.set(template.name, slot);
+        } else {
+            unplaced.push({
+                template: template.name,
+                slot: template.fitsSlot,
+                candidates
+            });
+        }
+    }
+    const cycles = findCycles(parents);
+    const inCycle = new Set(cycles.flat());
+    const placements = [];
+    for (const template of templates){
+        const container = parents.get(template.name);
+        if (container === undefined || inCycle.has(template.name)) continue;
+        placements.push({
+            template: template.name,
+            slot: slots.get(template.name),
+            container,
+            depth: depthOf(template.name, parents, layout.name)
+        });
+    }
+    placements.sort((left, right)=>left.depth - right.depth || left.template.localeCompare(right.template));
+    return {
+        placements,
+        unplaced,
+        cycles
+    };
+}
+/**
+ * Splits a `fitsSlot` into the container it names and the slot within it.
+ *
+ * The same rule component names use: a bare name searches, a qualified one goes straight to what it names.
+ * A slot called `body` is a good name at every level of a nesting chain, so several templates legitimately
+ * declare one — and a bare `body` then has no single answer. Qualifying it says which, without forcing
+ * every slot in an application to carry a unique name.
+ */ function splitQualifiedSlot(fitsSlot) {
+    const lastDot = fitsSlot.lastIndexOf('.');
+    return lastDot < 0 ? [
+        undefined,
+        fitsSlot
+    ] : [
+        fitsSlot.substring(0, lastDot),
+        fitsSlot.substring(lastDot + 1)
+    ];
+}
+function buildSlotIndex(layout, templates) {
+    const index = new Map();
+    const declare = (slot, container)=>{
+        const containers = index.get(slot) ?? [];
+        if (!containers.includes(container)) containers.push(container);
+        index.set(slot, containers);
+    };
+    for (const slot of layout.slots)declare(slot.name, layout.name);
+    for (const template of templates){
+        for (const slot of template.slots)declare(slot.name, template.name);
+    }
+    return index;
+}
+function findCycles(parents) {
+    const cycles = [];
+    const recorded = new Set();
+    for (const start of [
+        ...parents.keys()
+    ].sort()){
+        const path = [];
+        const onPath = new Set();
+        let current = start;
+        for(;;){
+            const parent = parents.get(current);
+            if (parent === undefined) break;
+            path.push(current);
+            onPath.add(current);
+            if (onPath.has(parent)) {
+                const cycle = path.slice(path.indexOf(parent));
+                const key = [
+                    ...cycle
+                ].sort().join(' ');
+                if (!recorded.has(key)) {
+                    recorded.add(key);
+                    cycles.push(cycle);
+                }
+                break;
+            }
+            onPath.add(parent);
+            current = parent;
+        }
+    }
+    return cycles;
+}
+function depthOf(template, parents, layoutName) {
+    let depth = 0;
+    let current = template;
+    while(parents.has(current) && depth <= parents.size){
+        depth++;
+        const parent = parents.get(current);
+        if (parent === layoutName) break;
+        current = parent;
+    }
+    return depth;
+}
+
+export { isScreenTemplateResolutionValid, resolveScreenTemplates };
+//# sourceMappingURL=resolveScreenTemplates.js.map

package/dist/esm/resolveScreenTemplates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolveScreenTemplates.js","sources":["../../resolveScreenTemplates.ts"],"sourcesContent":["// Copyright (c) Cratis. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\nimport { Layout, ScreenTemplate } from '@cratis/scene.model';\n\n/**\n * Where one {@link ScreenTemplate} ended up: the slot it declared, and the layout or template that turned\n * out to declare that slot.\n */\nexport interface ScreenTemplatePlacement {\n    /** The template being placed. */\n    template: string;\n    /** The slot name the template declared it fits. */\n    slot: string;\n    /** The name of the {@link Layout} or {@link ScreenTemplate} declaring that slot. */\n    container: string;\n    /** How far below the layout the template sits — 1 directly inside the layout, 2 inside a template that is. */\n    depth: number;\n}\n\n/**\n * A template that names a slot, where the set of containers in scope does not agree on exactly one home for\n * it.\n */\nexport interface UnplacedScreenTemplate {\n    /** The template that could not be placed. */\n    template: string;\n    /** The slot name it declared it fits. */\n    slot: string;\n    /**\n     * The containers declaring a slot of that name. Empty when nothing declares it; more than one when the\n     * name is ambiguous. Never exactly one — that case is a {@link ScreenTemplatePlacement} instead.\n     */\n    candidates: string[];\n}\n\n/**\n * The outcome of working out how a blueprint's templates nest inside its layout.\n */\nexport interface ScreenTemplateResolution {\n    /** Every template that found exactly one home, ordered shallowest first so a caller can build the tree top-down. */\n    placements: ScreenTemplatePlacement[];\n    /**\n     * Templates that found none or several. Reported rather than guessed: placing a template in the wrong\n     * parent renders content in the wrong region, which is far harder to diagnose than being told the slot\n     * name is ambiguous.\n     */\n    unplaced: UnplacedScreenTemplate[];\n    /** Template nesting cycles — a template that transitively contains itself. */\n    cycles: string[][];\n}\n\n/**\n * Whether every template found exactly one home and nothing nests inside itself.\n */\nexport function isScreenTemplateResolutionValid(resolution: ScreenTemplateResolution): boolean {\n    return resolution.unplaced.length === 0 && resolution.cycles.length === 0;\n}\n\n/**\n * Works out how a blueprint's {@link ScreenTemplate}s nest inside its {@link Layout}.\n *\n * A template declares only the *name* of the slot it fits, never which container owns that slot. That is\n * what makes templates reusable — a feature's template says \"I go in the module content area\", not \"I go\n * inside this specific module\". Resolution is the step that turns those names into a tree, by finding which\n * layout or template declares each name.\n *\n * The same rule applies at every level, so nesting has no depth limit and no separate mechanism per level.\n * The C# twin in `Cratis.Scene.Engine` implements the same algorithm; both are asserted against the same\n * shared fixture corpus so they cannot drift apart.\n */\nexport function resolveScreenTemplates(layout: Layout, templates: ScreenTemplate[]): ScreenTemplateResolution {\n    const containersBySlot = buildSlotIndex(layout, templates);\n    const parents = new Map<string, string>();\n    const slots = new Map<string, string>();\n    const unplaced: UnplacedScreenTemplate[] = [];\n\n    for (const template of templates) {\n        if (template.fitsSlot === undefined) continue;\n\n        const [qualifier, slot] = splitQualifiedSlot(template.fitsSlot);\n\n        const candidates = (containersBySlot.get(slot) ?? []).filter(\n            (container) => container !== template.name && (qualifier === undefined || container === qualifier)\n        );\n\n        if (candidates.length === 1) {\n            parents.set(template.name, candidates[0]);\n            slots.set(template.name, slot);\n        } else {\n            unplaced.push({ template: template.name, slot: template.fitsSlot, candidates });\n        }\n    }\n\n    const cycles = findCycles(parents);\n    const inCycle = new Set(cycles.flat());\n\n    const placements: ScreenTemplatePlacement[] = [];\n    for (const template of templates) {\n        const container = parents.get(template.name);\n        if (container === undefined || inCycle.has(template.name)) continue;\n\n        placements.push({\n            template: template.name,\n            slot: slots.get(template.name)!,\n            container,\n            depth: depthOf(template.name, parents, layout.name),\n        });\n    }\n\n    placements.sort((left, right) => left.depth - right.depth || left.template.localeCompare(right.template));\n\n    return { placements, unplaced, cycles };\n}\n\n/**\n * Splits a `fitsSlot` into the container it names and the slot within it.\n *\n * The same rule component names use: a bare name searches, a qualified one goes straight to what it names.\n * A slot called `body` is a good name at every level of a nesting chain, so several templates legitimately\n * declare one — and a bare `body` then has no single answer. Qualifying it says which, without forcing\n * every slot in an application to carry a unique name.\n */\nfunction splitQualifiedSlot(fitsSlot: string): [string | undefined, string] {\n    const lastDot = fitsSlot.lastIndexOf('.');\n    return lastDot < 0 ? [undefined, fitsSlot] : [fitsSlot.substring(0, lastDot), fitsSlot.substring(lastDot + 1)];\n}\n\nfunction buildSlotIndex(layout: Layout, templates: ScreenTemplate[]): Map<string, string[]> {\n    const index = new Map<string, string[]>();\n\n    const declare = (slot: string, container: string) => {\n        const containers = index.get(slot) ?? [];\n        if (!containers.includes(container)) containers.push(container);\n        index.set(slot, containers);\n    };\n\n    for (const slot of layout.slots) declare(slot.name, layout.name);\n    for (const template of templates) {\n        for (const slot of template.slots) declare(slot.name, template.name);\n    }\n\n    return index;\n}\n\nfunction findCycles(parents: Map<string, string>): string[][] {\n    const cycles: string[][] = [];\n    const recorded = new Set<string>();\n\n    for (const start of [...parents.keys()].sort()) {\n        const path: string[] = [];\n        const onPath = new Set<string>();\n        let current = start;\n\n        for (;;) {\n            const parent = parents.get(current);\n            if (parent === undefined) break;\n\n            path.push(current);\n            onPath.add(current);\n            if (onPath.has(parent)) {\n                const cycle = path.slice(path.indexOf(parent));\n                const key = [...cycle].sort().join(' ');\n                if (!recorded.has(key)) {\n                    recorded.add(key);\n                    cycles.push(cycle);\n                }\n\n                break;\n            }\n\n            onPath.add(parent);\n            current = parent;\n        }\n    }\n\n    return cycles;\n}\n\nfunction depthOf(template: string, parents: Map<string, string>, layoutName: string): number {\n    let depth = 0;\n    let current = template;\n    while (parents.has(current) && depth <= parents.size) {\n        depth++;\n        const parent = parents.get(current)!;\n        if (parent === layoutName) break;\n        current = parent;\n    }\n\n    return depth;\n}\n"],"names":["isScreenTemplateResolutionValid","resolution","unplaced","length","cycles","resolveScreenTemplates","layout","templates","containersBySlot","buildSlotIndex","parents","Map","slots","template","fitsSlot","undefined","qualifier","slot","splitQualifiedSlot","candidates","get","filter","container","name","set","push","findCycles","inCycle","Set","flat","placements","has","depth","depthOf","sort","left","right","localeCompare","lastDot","lastIndexOf","substring","index","declare","containers","includes","recorded","start","keys","path","onPath","current","parent","add","cycle","slice","indexOf","key","join","layoutName","size"],"mappings":"AAAA;AACA;AAmDA;;IAGO,SAASA,+BAAAA,CAAgCC,UAAoC,EAAA;IAChF,OAAOA,UAAAA,CAAWC,QAAQ,CAACC,MAAM,KAAK,KAAKF,UAAAA,CAAWG,MAAM,CAACD,MAAM,KAAK,CAAA;AAC5E;AAEA;;;;;;;;;;;AAWC,IACM,SAASE,sBAAAA,CAAuBC,MAAc,EAAEC,SAA2B,EAAA;IAC9E,MAAMC,gBAAAA,GAAmBC,eAAeH,MAAAA,EAAQC,SAAAA,CAAAA;AAChD,IAAA,MAAMG,UAAU,IAAIC,GAAAA,EAAAA;AACpB,IAAA,MAAMC,QAAQ,IAAID,GAAAA,EAAAA;AAClB,IAAA,MAAMT,WAAqC,EAAE;IAE7C,KAAK,MAAMW,YAAYN,SAAAA,CAAW;QAC9B,IAAIM,QAAAA,CAASC,QAAQ,KAAKC,SAAAA,EAAW;AAErC,QAAA,MAAM,CAACC,SAAAA,EAAWC,IAAAA,CAAK,GAAGC,kBAAAA,CAAmBL,SAASC,QAAQ,CAAA;QAE9D,MAAMK,UAAAA,GAAa,CAACX,gBAAAA,CAAiBY,GAAG,CAACH,IAAAA,CAAAA,IAAS,EAAC,EAAGI,MAAM,CACxD,CAACC,SAAAA,GAAcA,cAAcT,QAAAA,CAASU,IAAI,KAAKP,SAAAA,KAAcD,SAAAA,IAAaO,SAAAA,KAAcN,SAAQ,CAAA,CAAA;QAGpG,IAAIG,UAAAA,CAAWhB,MAAM,KAAK,CAAA,EAAG;AACzBO,YAAAA,OAAAA,CAAQc,GAAG,CAACX,QAAAA,CAASU,IAAI,EAAEJ,UAAU,CAAC,CAAA,CAAE,CAAA;AACxCP,YAAAA,KAAAA,CAAMY,GAAG,CAACX,QAAAA,CAASU,IAAI,EAAEN,IAAAA,CAAAA;QAC7B,CAAA,MAAO;AACHf,YAAAA,QAAAA,CAASuB,IAAI,CAAC;AAAEZ,gBAAAA,QAAAA,EAAUA,SAASU,IAAI;AAAEN,gBAAAA,IAAAA,EAAMJ,SAASC,QAAQ;AAAEK,gBAAAA;AAAW,aAAA,CAAA;AACjF,QAAA;AACJ,IAAA;AAEA,IAAA,MAAMf,SAASsB,UAAAA,CAAWhB,OAAAA,CAAAA;AAC1B,IAAA,MAAMiB,OAAAA,GAAU,IAAIC,GAAAA,CAAIxB,MAAAA,CAAOyB,IAAI,EAAA,CAAA;AAEnC,IAAA,MAAMC,aAAwC,EAAE;IAChD,KAAK,MAAMjB,YAAYN,SAAAA,CAAW;AAC9B,QAAA,MAAMe,SAAAA,GAAYZ,OAAAA,CAAQU,GAAG,CAACP,SAASU,IAAI,CAAA;AAC3C,QAAA,IAAID,cAAcP,SAAAA,IAAaY,OAAAA,CAAQI,GAAG,CAAClB,QAAAA,CAASU,IAAI,CAAA,EAAG;AAE3DO,QAAAA,UAAAA,CAAWL,IAAI,CAAC;AACZZ,YAAAA,QAAAA,EAAUA,SAASU,IAAI;AACvBN,YAAAA,IAAAA,EAAML,KAAAA,CAAMQ,GAAG,CAACP,QAAAA,CAASU,IAAI,CAAA;AAC7BD,YAAAA,SAAAA;AACAU,YAAAA,KAAAA,EAAOC,QAAQpB,QAAAA,CAASU,IAAI,EAAEb,OAAAA,EAASJ,OAAOiB,IAAI;AACtD,SAAA,CAAA;AACJ,IAAA;AAEAO,IAAAA,UAAAA,CAAWI,IAAI,CAAC,CAACC,IAAAA,EAAMC,KAAAA,GAAUD,KAAKH,KAAK,GAAGI,KAAAA,CAAMJ,KAAK,IAAIG,IAAAA,CAAKtB,QAAQ,CAACwB,aAAa,CAACD,MAAMvB,QAAQ,CAAA,CAAA;IAEvG,OAAO;AAAEiB,QAAAA,UAAAA;AAAY5B,QAAAA,QAAAA;AAAUE,QAAAA;AAAO,KAAA;AAC1C;AAEA;;;;;;;IAQA,SAASc,mBAAmBJ,QAAgB,EAAA;IACxC,MAAMwB,OAAAA,GAAUxB,QAAAA,CAASyB,WAAW,CAAC,GAAA,CAAA;AACrC,IAAA,OAAOD,UAAU,CAAA,GAAI;AAACvB,QAAAA,SAAAA;AAAWD,QAAAA;KAAS,GAAG;QAACA,QAAAA,CAAS0B,SAAS,CAAC,CAAA,EAAGF,OAAAA,CAAAA;QAAUxB,QAAAA,CAAS0B,SAAS,CAACF,OAAAA,GAAU,CAAA;AAAG,KAAA;AAClH;AAEA,SAAS7B,cAAAA,CAAeH,MAAc,EAAEC,SAA2B,EAAA;AAC/D,IAAA,MAAMkC,QAAQ,IAAI9B,GAAAA,EAAAA;IAElB,MAAM+B,OAAAA,GAAU,CAACzB,IAAAA,EAAcK,SAAAA,GAAAA;AAC3B,QAAA,MAAMqB,UAAAA,GAAaF,KAAAA,CAAMrB,GAAG,CAACH,SAAS,EAAE;AACxC,QAAA,IAAI,CAAC0B,UAAAA,CAAWC,QAAQ,CAACtB,SAAAA,CAAAA,EAAYqB,UAAAA,CAAWlB,IAAI,CAACH,SAAAA,CAAAA;QACrDmB,KAAAA,CAAMjB,GAAG,CAACP,IAAAA,EAAM0B,UAAAA,CAAAA;AACpB,IAAA,CAAA;IAEA,KAAK,MAAM1B,IAAAA,IAAQX,MAAAA,CAAOM,KAAK,CAAE8B,QAAQzB,IAAAA,CAAKM,IAAI,EAAEjB,MAAAA,CAAOiB,IAAI,CAAA;IAC/D,KAAK,MAAMV,YAAYN,SAAAA,CAAW;QAC9B,KAAK,MAAMU,IAAAA,IAAQJ,QAAAA,CAASD,KAAK,CAAE8B,QAAQzB,IAAAA,CAAKM,IAAI,EAAEV,QAAAA,CAASU,IAAI,CAAA;AACvE,IAAA;IAEA,OAAOkB,KAAAA;AACX;AAEA,SAASf,WAAWhB,OAA4B,EAAA;AAC5C,IAAA,MAAMN,SAAqB,EAAE;AAC7B,IAAA,MAAMyC,WAAW,IAAIjB,GAAAA,EAAAA;AAErB,IAAA,KAAK,MAAMkB,KAAAA,IAAS;AAAIpC,QAAAA,GAAAA,OAAAA,CAAQqC,IAAI;AAAG,KAAA,CAACb,IAAI,EAAA,CAAI;AAC5C,QAAA,MAAMc,OAAiB,EAAE;AACzB,QAAA,MAAMC,SAAS,IAAIrB,GAAAA,EAAAA;AACnB,QAAA,IAAIsB,OAAAA,GAAUJ,KAAAA;QAEd,OAAS;YACL,MAAMK,MAAAA,GAASzC,OAAAA,CAAQU,GAAG,CAAC8B,OAAAA,CAAAA;AAC3B,YAAA,IAAIC,WAAWpC,SAAAA,EAAW;AAE1BiC,YAAAA,IAAAA,CAAKvB,IAAI,CAACyB,OAAAA,CAAAA;AACVD,YAAAA,MAAAA,CAAOG,GAAG,CAACF,OAAAA,CAAAA;YACX,IAAID,MAAAA,CAAOlB,GAAG,CAACoB,MAAAA,CAAAA,EAAS;AACpB,gBAAA,MAAME,QAAQL,IAAAA,CAAKM,KAAK,CAACN,IAAAA,CAAKO,OAAO,CAACJ,MAAAA,CAAAA,CAAAA;AACtC,gBAAA,MAAMK,GAAAA,GAAM;AAAIH,oBAAAA,GAAAA;iBAAM,CAACnB,IAAI,EAAA,CAAGuB,IAAI,CAAC,GAAA,CAAA;AACnC,gBAAA,IAAI,CAACZ,QAAAA,CAASd,GAAG,CAACyB,GAAAA,CAAAA,EAAM;AACpBX,oBAAAA,QAAAA,CAASO,GAAG,CAACI,GAAAA,CAAAA;AACbpD,oBAAAA,MAAAA,CAAOqB,IAAI,CAAC4B,KAAAA,CAAAA;AAChB,gBAAA;AAEA,gBAAA;AACJ,YAAA;AAEAJ,YAAAA,MAAAA,CAAOG,GAAG,CAACD,MAAAA,CAAAA;YACXD,OAAAA,GAAUC,MAAAA;AACd,QAAA;AACJ,IAAA;IAEA,OAAO/C,MAAAA;AACX;AAEA,SAAS6B,OAAAA,CAAQpB,QAAgB,EAAEH,OAA4B,EAAEgD,UAAkB,EAAA;AAC/E,IAAA,IAAI1B,KAAAA,GAAQ,CAAA;AACZ,IAAA,IAAIkB,OAAAA,GAAUrC,QAAAA;AACd,IAAA,MAAOH,QAAQqB,GAAG,CAACmB,YAAYlB,KAAAA,IAAStB,OAAAA,CAAQiD,IAAI,CAAE;AAClD3B,QAAAA,KAAAA,EAAAA;QACA,MAAMmB,MAAAA,GAASzC,OAAAA,CAAQU,GAAG,CAAC8B,OAAAA,CAAAA;AAC3B,QAAA,IAAIC,WAAWO,UAAAA,EAAY;QAC3BR,OAAAA,GAAUC,MAAAA;AACd,IAAA;IAEA,OAAOnB,KAAAA;AACX;;;;"}

package/dist/esm/themeCompatibility.d.ts

@@ -0,0 +1,5 @@
+import { Theme, UiProfile } from '@cratis/scene.model';
+export declare function incompatiblePackages(theme: Theme, profile: UiProfile): string[];
+export declare function isThemeCompatible(theme: Theme, profile: UiProfile): boolean;
+export declare function applicableThemePackages(theme: Theme, profile: UiProfile): string[];
+//# sourceMappingURL=themeCompatibility.d.ts.map

package/dist/esm/themeCompatibility.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"themeCompatibility.d.ts","sourceRoot":"","sources":["../../themeCompatibility.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAevD,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAG,MAAM,EAAE,CAE/E;AASD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAG,OAAO,CAE3E;AAYD,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAG,MAAM,EAAE,CAElF"}

package/dist/esm/themeCompatibility.js

@@ -0,0 +1,41 @@
+// Copyright (c) Cratis. All rights reserved.
+// Licensed under the MIT license. See LICENSE file in the project root for full license information.
+/**
+ * Finds the packages a {@link UiProfile} declares that a {@link Theme} is not declared compatible with -
+ * part of Cratis/Scene#5, the same rule Screenplay's compiler already applies to warn on an incompatible
+ * `ui profile`/`theme` pairing, reused here so `Scene.React` knows which packages to actually apply a
+ * theme's tokens to, and so Studio's design-time tooling and Stage's build-time checks don't each
+ * reimplement it. There is deliberately no implicit exemption for `core`: a theme wanting broad
+ * applicability declares `compatible with core` itself, exactly like the profile/package resolver has no
+ * implicit special case for it either.
+ *
+ * @param theme The {@link Theme} to check.
+ * @param profile The {@link UiProfile} whose packages to check against.
+ * @returns The packages in `profile.packages` that `theme` does not declare compatibility with.
+ */ function incompatiblePackages(theme, profile) {
+    return profile.packages.filter((package_)=>!theme.compatibleWith.includes(package_));
+}
+/**
+ * Whether a {@link Theme} is compatible with every package a {@link UiProfile} declares.
+ *
+ * @param theme The {@link Theme} to check.
+ * @param profile The {@link UiProfile} whose packages to check against.
+ * @returns `true` when `theme` declares compatibility with every package `profile` lists.
+ */ function isThemeCompatible(theme, profile) {
+    return incompatiblePackages(theme, profile).length === 0;
+}
+/**
+ * Finds the packages a {@link Theme}'s tokens actually apply to for a given {@link UiProfile} - the
+ * packages the profile activates that the theme also declares compatibility with. This is what a
+ * renderer scopes token application to, rather than applying a theme's tokens globally - and is
+ * recomputed on every theme switch for the live re-resolution Cratis/Scene#5 requires (no reload).
+ *
+ * @param theme The {@link Theme} to apply.
+ * @param profile The active {@link UiProfile}.
+ * @returns The packages both active in `profile` and declared compatible by `theme`.
+ */ function applicableThemePackages(theme, profile) {
+    return profile.packages.filter((package_)=>theme.compatibleWith.includes(package_));
+}
+
+export { applicableThemePackages, incompatiblePackages, isThemeCompatible };
+//# sourceMappingURL=themeCompatibility.js.map

package/dist/esm/themeCompatibility.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"themeCompatibility.js","sources":["../../themeCompatibility.ts"],"sourcesContent":["// Copyright (c) Cratis. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\nimport { Theme, UiProfile } from '@cratis/scene.model';\n\n/**\n * Finds the packages a {@link UiProfile} declares that a {@link Theme} is not declared compatible with -\n * part of Cratis/Scene#5, the same rule Screenplay's compiler already applies to warn on an incompatible\n * `ui profile`/`theme` pairing, reused here so `Scene.React` knows which packages to actually apply a\n * theme's tokens to, and so Studio's design-time tooling and Stage's build-time checks don't each\n * reimplement it. There is deliberately no implicit exemption for `core`: a theme wanting broad\n * applicability declares `compatible with core` itself, exactly like the profile/package resolver has no\n * implicit special case for it either.\n *\n * @param theme The {@link Theme} to check.\n * @param profile The {@link UiProfile} whose packages to check against.\n * @returns The packages in `profile.packages` that `theme` does not declare compatibility with.\n */\nexport function incompatiblePackages(theme: Theme, profile: UiProfile): string[] {\n    return profile.packages.filter(package_ => !theme.compatibleWith.includes(package_));\n}\n\n/**\n * Whether a {@link Theme} is compatible with every package a {@link UiProfile} declares.\n *\n * @param theme The {@link Theme} to check.\n * @param profile The {@link UiProfile} whose packages to check against.\n * @returns `true` when `theme` declares compatibility with every package `profile` lists.\n */\nexport function isThemeCompatible(theme: Theme, profile: UiProfile): boolean {\n    return incompatiblePackages(theme, profile).length === 0;\n}\n\n/**\n * Finds the packages a {@link Theme}'s tokens actually apply to for a given {@link UiProfile} - the\n * packages the profile activates that the theme also declares compatibility with. This is what a\n * renderer scopes token application to, rather than applying a theme's tokens globally - and is\n * recomputed on every theme switch for the live re-resolution Cratis/Scene#5 requires (no reload).\n *\n * @param theme The {@link Theme} to apply.\n * @param profile The active {@link UiProfile}.\n * @returns The packages both active in `profile` and declared compatible by `theme`.\n */\nexport function applicableThemePackages(theme: Theme, profile: UiProfile): string[] {\n    return profile.packages.filter(package_ => theme.compatibleWith.includes(package_));\n}\n"],"names":["incompatiblePackages","theme","profile","packages","filter","package_","compatibleWith","includes","isThemeCompatible","length","applicableThemePackages"],"mappings":"AAAA;AACA;AAIA;;;;;;;;;;;;AAYC,IACM,SAASA,oBAAAA,CAAqBC,KAAY,EAAEC,OAAkB,EAAA;AACjE,IAAA,OAAOA,OAAAA,CAAQC,QAAQ,CAACC,MAAM,CAACC,CAAAA,QAAAA,GAAY,CAACJ,KAAAA,CAAMK,cAAc,CAACC,QAAQ,CAACF,QAAAA,CAAAA,CAAAA;AAC9E;AAEA;;;;;;AAMC,IACM,SAASG,iBAAAA,CAAkBP,KAAY,EAAEC,OAAkB,EAAA;AAC9D,IAAA,OAAOF,oBAAAA,CAAqBC,KAAAA,EAAOC,OAAAA,CAAAA,CAASO,MAAM,KAAK,CAAA;AAC3D;AAEA;;;;;;;;;AASC,IACM,SAASC,uBAAAA,CAAwBT,KAAY,EAAEC,OAAkB,EAAA;IACpE,OAAOA,OAAAA,CAAQC,QAAQ,CAACC,MAAM,CAACC,CAAAA,QAAAA,GAAYJ,KAAAA,CAAMK,cAAc,CAACC,QAAQ,CAACF,QAAAA,CAAAA,CAAAA;AAC7E;;;;"}