@orkestrel/scaffold 0.0.26 → 0.0.27

package/dist/src/core/index.cjs

@@ -283,8 +283,8 @@ var DEFAULT_ENGINES = `>=${MINIMUM_NODE_VERSION}`;
 /** The tooling versions scaffold and every generated workspace share. */
 var BASE_DEV_DEPENDENCIES = Object.freeze({
 	"@microsoft/api-extractor": "^7.58.12",
-	"@orkestrel/guide": "^0.0.9",
-	"@orkestrel/scaffold": "^0.0.26",
+	"@orkestrel/guide": "^0.0.10",
+	"@orkestrel/scaffold": "^0.0.27",
 	"@types/node": "^26.2.0",
 	oxfmt: "^0.62.0",
 	oxlint: "^1.77.0",
@@ -299,11 +299,11 @@ var SOURCE_BROWSER_DEV_DEPENDENCIES = Object.freeze({
 	playwright: "^1.62.1"
 });
 /** The development dependency every private `app` environment adds. */
-var APP_DEV_DEPENDENCIES = Object.freeze({ "@orkestrel/contract": "^0.0.10" });
+var APP_DEV_DEPENDENCIES = Object.freeze({ "@orkestrel/contract": "^0.0.11" });
 /** The development dependencies a private Vue browser application adds. */
 var APP_BROWSER_DEV_DEPENDENCIES = Object.freeze({
 	...SOURCE_BROWSER_DEV_DEPENDENCIES,
-	"@orkestrel/html": "^0.0.2",
+	"@orkestrel/html": "^0.0.3",
 	"@vitejs/plugin-vue": "^6.0.8",
 	vue: "^3.5.40",
 	"vue-tsc": "^3.3.7"
@@ -321,10 +321,10 @@ var APP_BROWSER_DEV_DEPENDENCIES = Object.freeze({
 var SHOWCASE_DEV_DEPENDENCIES = Object.freeze({ "vite-plugin-singlefile": "^2.3.3" });
 /** The development dependencies a private server application adds. */
 var APP_SERVER_DEV_DEPENDENCIES = Object.freeze({
-	"@orkestrel/emitter": "^0.0.5",
-	"@orkestrel/middleware": "^0.0.9",
-	"@orkestrel/router": "^0.0.8",
-	"@orkestrel/server": "^0.0.10"
+	"@orkestrel/emitter": "^0.0.6",
+	"@orkestrel/middleware": "^0.0.10",
+	"@orkestrel/router": "^0.0.9",
+	"@orkestrel/server": "^0.0.11"
 });
 //#endregion
 //#region src/core/templates.ts
@@ -1591,7 +1591,8 @@ var isMirror = (0, _orkestrel_contract.unionOf)((0, _orkestrel_contract.recordOf
 var isCatalogEntry = (0, _orkestrel_contract.unionOf)((0, _orkestrel_contract.recordOf)({
 	name: isDependencyName,
 	lookup: (0, _orkestrel_contract.literalOf)("found"),
-	version: _orkestrel_contract.isString
+	version: _orkestrel_contract.isString,
+	dependencies: (0, _orkestrel_contract.andOf)(isCollection, (0, _orkestrel_contract.arrayOf)(isDependency))
 }), (0, _orkestrel_contract.recordOf)({
 	name: isDependencyName,
 	lookup: (0, _orkestrel_contract.literalOf)("missing", "failed"),
@@ -2164,6 +2165,54 @@ function matchesDriftReachability(ownership, finding) {
 	return finding.drift === "stale" && ownership === "content";
 }
 /**
+* Project a catalog into the layers it publishes in.
+*
+* @param entries - The catalog rows to order.
+* @returns One layer per round, each holding the names publishable together,
+* sorted within the layer; a name whose edges never resolve is omitted.
+*
+* @remarks
+* A layer is a deterministic function of the catalog's own edges, so it is
+* computed here rather than stored on a row that could disagree with them.
+* Only RUNTIME edges between catalogued packages count: a development
+* dependency reaches no consumer, so it constrains nothing about publish order,
+* and an edge leaving the fleet is a package this catalog does not publish.
+*
+* The order matters because these packages are `0.0.x`, where a caret pins one
+* exact release. Publishing a dependent before its dependency leaves the
+* dependent pinned to the older release, and two ranges that disagree install
+* two copies of one package that the compiler reads as two distinct types.
+*
+* A cycle cannot be published in rounds, so its members are omitted rather than
+* placed in an order that would be wrong. An absent name is the report: compare
+* the returned names against the catalog to find one.
+*
+* @example
+* ```ts
+* import { catalogToLayers } from '@orkestrel/scaffold'
+*
+* catalogToLayers(entries)[0] // the names that depend on nothing in the fleet
+* ```
+*/
+function catalogToLayers(entries) {
+	const published = new Set(entries.filter((entry) => entry.lookup === "found").map((entry) => entry.name));
+	const pending = /* @__PURE__ */ new Map();
+	for (const entry of entries) {
+		if (entry.lookup !== "found") continue;
+		const edges = entry.dependencies.map((dependency) => dependency.name);
+		pending.set(entry.name, new Set(edges.filter((name) => published.has(name))));
+	}
+	const layers = [];
+	while (pending.size > 0) {
+		const ready = [...pending].filter(([, edges]) => edges.size === 0).map(([name]) => name);
+		if (ready.length === 0) break;
+		for (const name of ready) pending.delete(name);
+		for (const edges of pending.values()) for (const name of ready) edges.delete(name);
+		layers.push(ready.sort());
+	}
+	return layers;
+}
+/**
 * Project a plan into its tally by artifact origin.
 *
 * @param plan - The plan to summarize.
@@ -4355,6 +4404,7 @@ exports.blueprintToScripts = blueprintToScripts;
 exports.blueprintToSourceArtifacts = blueprintToSourceArtifacts;
 exports.blueprintToTestArtifacts = blueprintToTestArtifacts;
 exports.bytesToHex = bytesToHex;
+exports.catalogToLayers = catalogToLayers;
 exports.cloneValue = cloneValue;
 exports.compareVersions = compareVersions;
 exports.computeBytes = computeBytes;