@cmmd-center/forge 0.13.16 → 0.13.18

package/dist/bin.mjs

@@ -25521,160 +25521,6 @@ const WorkspaceEnsureScratchResult = Struct({
 	workspaceRoot: String$1,
 	title: String$1
 });
-const CodeGraphRelation = Literals([
-	"contains",
-	"imports",
-	"calls",
-	"imports_from",
-	"method",
-	"references",
-	"re_exports",
-	"indirect_call",
-	"dynamic_import",
-	"inherits",
-	"rationale_for",
-	"implements",
-	"cites",
-	"triggers"
-]);
-const CodeGraphConfidence = Literals(["EXTRACTED", "INFERRED"]);
-const CodeGraphEdgeClass = Literals([
-	"containment",
-	"dependency",
-	"behavior"
-]);
-/**
-* Relation to drawn class. Exhaustive over CODE_GRAPH_RELATIONS by construction
-* — `codeGraph.test.ts` fails if a relation is added without a class.
-*/
-const CODE_GRAPH_RELATION_CLASS = {
-	contains: "containment",
-	method: "containment",
-	imports: "dependency",
-	imports_from: "dependency",
-	re_exports: "dependency",
-	dynamic_import: "dependency",
-	inherits: "dependency",
-	implements: "dependency",
-	calls: "behavior",
-	indirect_call: "behavior",
-	references: "behavior",
-	triggers: "behavior",
-	cites: "behavior",
-	rationale_for: "behavior"
-};
-const CodeGraphNodeKind = Literals(["file", "symbol"]);
-/**
-* One community, positioned.
-*
-* Positions are computed server-side and are stable for a given graph build, so
-* the map does not rearrange itself between openings. A map you have to re-learn
-* every time is not a map.
-*/
-const CodeGraphRegion = Struct({
-	id: NonNegativeInt,
-	label: TrimmedNonEmptyString,
-	nodeCount: PositiveInt,
-	x: Number$1,
-	y: Number$1
-});
-/** An aggregated edge between two regions, weighted by how many edges cross. */
-const CodeGraphRegionLink = Struct({
-	source: NonNegativeInt,
-	target: NonNegativeInt,
-	weight: PositiveInt
-});
-/**
-* The default view: the whole repository as ~120 named regions.
-*
-* `truncatedRegions` is not decoration. When a graph has more regions than the
-* map shows, the surface says so — a view that silently drops a third of the
-* codebase while looking complete is the failure mode this field exists to
-* prevent.
-*/
-const CodeGraphSummary = Struct({
-	repoLabel: TrimmedNonEmptyString,
-	builtAtCommit: NullOr(String$1),
-	nodeCount: NonNegativeInt,
-	edgeCount: NonNegativeInt,
-	extractedEdgeCount: NonNegativeInt,
-	inferredEdgeCount: NonNegativeInt,
-	regionCount: NonNegativeInt,
-	regions: ArraySchema(CodeGraphRegion),
-	links: ArraySchema(CodeGraphRegionLink),
-	truncatedRegions: NonNegativeInt
-});
-/** A node as it appears in a list, a search result, or a neighborhood. */
-const CodeGraphNodeSummary = Struct({
-	id: TrimmedNonEmptyString,
-	label: TrimmedNonEmptyString,
-	kind: CodeGraphNodeKind,
-	sourceFile: NullOr(String$1),
-	sourceLocation: NullOr(String$1),
-	regionId: NullOr(NonNegativeInt),
-	regionLabel: NullOr(String$1),
-	degree: NonNegativeInt
-});
-/** One edge, carrying both the exact relation and the class it is drawn as. */
-const CodeGraphEdgeView = Struct({
-	source: TrimmedNonEmptyString,
-	target: TrimmedNonEmptyString,
-	relation: CodeGraphRelation,
-	edgeClass: CodeGraphEdgeClass,
-	confidence: CodeGraphConfidence,
-	confidenceScore: Number$1
-});
-/**
-* One node and what surrounds it — the view a person actually works in.
-*
-* `truncated` fires when a hub's fan-out exceeds the cap. A god node with
-* thousands of edges must degrade to "showing 150 of 2,310", never to a frozen
-* tab or a quietly partial picture.
-*/
-const CodeGraphNeighborhood = Struct({
-	root: CodeGraphNodeSummary,
-	nodes: ArraySchema(CodeGraphNodeSummary),
-	edges: ArraySchema(CodeGraphEdgeView),
-	depth: PositiveInt,
-	truncated: Boolean$1,
-	omittedCount: NonNegativeInt
-});
-const CodeGraphSearchResult = Struct({
-	nodes: ArraySchema(CodeGraphNodeSummary),
-	truncated: Boolean$1
-});
-const CodeGraphSummaryInput = Struct({ cwd: TrimmedNonEmptyString });
-const CodeGraphNeighborhoodInput = Struct({
-	cwd: TrimmedNonEmptyString,
-	nodeId: TrimmedNonEmptyString,
-	depth: optional$4(PositiveInt)
-});
-const CodeGraphSearchInput = Struct({
-	cwd: TrimmedNonEmptyString,
-	query: TrimmedNonEmptyString,
-	limit: optional$4(PositiveInt)
-});
-/** Where the extractor writes, relative to the project root. */
-const CODE_GRAPH_ARTIFACT_PATH = "graphify-out/graph.json";
-/**
-* No graph in this checkout, or one that cannot be read.
-*
-* Distinct from a read failure on purpose: "not indexed yet" is the normal
-* first-run state and gets an action, while a malformed or unreadable artifact
-* is a fault and gets an explanation. Collapsing them would tell a user with a
-* corrupt file to run a build they have already run.
-*/
-var CodeGraphUnavailableError = class extends TaggedErrorClass()("CodeGraphUnavailableError", {
-	reason: Literals([
-		"missing",
-		"unreadable",
-		"malformed",
-		"lfs-pointer"
-	]),
-	message: String$1
-}) {};
-/** A node id that is not in this graph — usually a stale link into a rebuilt graph. */
-var CodeGraphNodeNotFoundError = class extends TaggedErrorClass()("CodeGraphNodeNotFoundError", { nodeId: String$1 }) {};
 //#endregion
 //#region ../../packages/contracts/src/relay.ts
 const RELAY_PROTOCOL_FAMILY = "forge-relay";
@@ -26055,9 +25901,6 @@ const WS_METHODS = {
 	projectsWriteFile: "projects.writeFile",
 	projectCheckoutDeletionPreview: "projectCheckoutDeletion.preview",
 	projectCheckoutDeletionExecute: "projectCheckoutDeletion.execute",
-	codeGraphSummary: "codeGraph.summary",
-	codeGraphNeighborhood: "codeGraph.neighborhood",
-	codeGraphSearch: "codeGraph.search",
 	workspaceReadFile: "workspace.readFile",
 	workspaceBeginWriteFile: "workspace.beginWriteFile",
 	workspaceWriteFileChunk: "workspace.writeFileChunk",
@@ -26343,21 +26186,6 @@ const WsProjectCheckoutDeletionExecuteRpc = make$30(WS_METHODS.projectCheckoutDe
 	payload: ProjectCheckoutDeletionExecuteInput,
 	success: ProjectCheckoutDeletionResult
 });
-const WsCodeGraphSummaryRpc = make$30(WS_METHODS.codeGraphSummary, {
-	payload: CodeGraphSummaryInput,
-	success: CodeGraphSummary,
-	error: CodeGraphUnavailableError
-});
-const WsCodeGraphNeighborhoodRpc = make$30(WS_METHODS.codeGraphNeighborhood, {
-	payload: CodeGraphNeighborhoodInput,
-	success: CodeGraphNeighborhood,
-	error: Union([CodeGraphUnavailableError, CodeGraphNodeNotFoundError])
-});
-const WsCodeGraphSearchRpc = make$30(WS_METHODS.codeGraphSearch, {
-	payload: CodeGraphSearchInput,
-	success: CodeGraphSearchResult,
-	error: CodeGraphUnavailableError
-});
 const WsWorkspaceReadFileRpc = make$30(WS_METHODS.workspaceReadFile, {
 	payload: BulkTransferReadFileInput,
 	success: BulkTransferStreamEvent,
@@ -26807,7 +26635,7 @@ const WsRpcGroup = make$29(WsServerGetConfigRpc, WsServerRefreshProvidersRpc, Ws
 	payload: UsageSummaryInput,
 	success: UsageSummary,
 	error: UsageReadError
-}), WsPullRequestsListRpc, WsPullRequestsListStatsRpc, WsPullRequestsDetailRpc, WsPullRequestsActivityRpc, WsPullRequestsThreadCommentsRpc, WsPullRequestsDiffFileContentsRpc, WsPullRequestsRunActionRpc, WsPullRequestsUpdateRpc, WsPullRequestsCommentRpc, WsPullRequestsUpdateCommentRpc, WsPullRequestsSubmitReviewRpc, WsPullRequestsReplyToThreadRpc, WsPullRequestsSetThreadResolutionRpc, WsPullRequestsSetReactionRpc, WsPullRequestsInvalidateRpc, WsPullRequestsReviewerCandidatesRpc, WsPullRequestsRequestReviewersRpc, WsProjectsSearchContentsRpc, WsProjectsSearchEntriesRpc, WsProjectsWriteFileRpc, WsProjectCheckoutDeletionPreviewRpc, WsProjectCheckoutDeletionExecuteRpc, WsCodeGraphSummaryRpc, WsCodeGraphNeighborhoodRpc, WsCodeGraphSearchRpc, WsWorkspaceReadFileRpc, WsWorkspaceBeginWriteFileRpc, WsWorkspaceWriteFileChunkRpc, WsWorkspaceCommitWriteFileRpc, WsWorkspaceCancelWriteFileRpc, WsShellOpenInEditorRpc, WsSubscribeGitStatusRpc, WsGitPullRpc, WsGitRefreshStatusRpc, WsGitRunStackedActionRpc, WsGitResolvePullRequestRpc, WsGitPreparePullRequestThreadRpc, WsGitListBranchesRpc, WsVcsListRefsRpc, WsVcsRefreshStatusRpc, WsSubscribeVcsStatusRpc, WsVcsPullRpc, WsVcsCreateWorktreeRpc, WsVcsRemoveWorktreeRpc, WsVcsCreateRefRpc, WsVcsSwitchRefRpc, WsVcsInitRpc, WsGitCreateWorktreeRpc, WsGitRemoveWorktreeRpc, WsGitCreateBranchRpc, WsGitCheckoutRpc, WsGitInitRpc, WsFilesystemBrowseRpc, WsProjectsReadFileRpc, WsReviewGetDiffPreviewRpc, WsCloudListRuntimesRpc, WsTerminalOpenRpc, WsTerminalAttachRpc, WsTerminalWriteRpc, WsTerminalResizeRpc, WsTerminalSignalRpc, WsTerminalClearRpc, WsTerminalRestartRpc, WsTerminalCloseRpc, WsBrowserOpenSessionRpc, WsBrowserListSessionsRpc, WsBrowserCloseSessionRpc, WsBrowserGetSessionRpc, WsBrowserCommandRpc, WsBrowserClearBrowsingDataRpc, WsBrowserAttachDisplayRpc, WsBrowserAddDisplayIceCandidateRpc, WsComputerInputRpc, WsDevTunnelRegisterRpc, WsDevTunnelUnregisterRpc, WsDevTunnelListRpc, WsThreadDevRuntimeGetRpc, WsThreadDevRuntimeAllocatePortRpc, WsThreadDevRuntimeReleaseRpc, WsWorkspaceEnvironmentPreflightRpc, WsWorkspaceEnsureScratchRpc, WsSubscribeTerminalEventsRpc, WsSubscribeTerminalMetadataRpc, WsProjectsListEntriesRpc, WsServerDiscoverSourceControlRpc, WsServerReportClientActivityRpc, WsSubscribeBrowserEventsRpc, WsSubscribeServerConfigRpc, WsSubscribeServerLifecycleRpc, WsSubscribeAuthAccessRpc, WsSubscribeWorkspaceReadinessRpc, WsOrchestrationDispatchCommandRpc, WsOrchestrationGetTurnDiffRpc, WsOrchestrationGetFullThreadDiffRpc, WsOrchestrationStreamTurnDiffRpc, WsOrchestrationStreamFullThreadDiffRpc, WsOrchestrationReplayEventsRpc, WsOrchestrationGetArchivedShellSnapshotRpc, WsOrchestrationSubscribeShellRpc, WsOrchestrationSubscribeThreadRpc, make$30(WS_METHODS.assetsCreateUrl, {
+}), WsPullRequestsListRpc, WsPullRequestsListStatsRpc, WsPullRequestsDetailRpc, WsPullRequestsActivityRpc, WsPullRequestsThreadCommentsRpc, WsPullRequestsDiffFileContentsRpc, WsPullRequestsRunActionRpc, WsPullRequestsUpdateRpc, WsPullRequestsCommentRpc, WsPullRequestsUpdateCommentRpc, WsPullRequestsSubmitReviewRpc, WsPullRequestsReplyToThreadRpc, WsPullRequestsSetThreadResolutionRpc, WsPullRequestsSetReactionRpc, WsPullRequestsInvalidateRpc, WsPullRequestsReviewerCandidatesRpc, WsPullRequestsRequestReviewersRpc, WsProjectsSearchContentsRpc, WsProjectsSearchEntriesRpc, WsProjectsWriteFileRpc, WsProjectCheckoutDeletionPreviewRpc, WsProjectCheckoutDeletionExecuteRpc, WsWorkspaceReadFileRpc, WsWorkspaceBeginWriteFileRpc, WsWorkspaceWriteFileChunkRpc, WsWorkspaceCommitWriteFileRpc, WsWorkspaceCancelWriteFileRpc, WsShellOpenInEditorRpc, WsSubscribeGitStatusRpc, WsGitPullRpc, WsGitRefreshStatusRpc, WsGitRunStackedActionRpc, WsGitResolvePullRequestRpc, WsGitPreparePullRequestThreadRpc, WsGitListBranchesRpc, WsVcsListRefsRpc, WsVcsRefreshStatusRpc, WsSubscribeVcsStatusRpc, WsVcsPullRpc, WsVcsCreateWorktreeRpc, WsVcsRemoveWorktreeRpc, WsVcsCreateRefRpc, WsVcsSwitchRefRpc, WsVcsInitRpc, WsGitCreateWorktreeRpc, WsGitRemoveWorktreeRpc, WsGitCreateBranchRpc, WsGitCheckoutRpc, WsGitInitRpc, WsFilesystemBrowseRpc, WsProjectsReadFileRpc, WsReviewGetDiffPreviewRpc, WsCloudListRuntimesRpc, WsTerminalOpenRpc, WsTerminalAttachRpc, WsTerminalWriteRpc, WsTerminalResizeRpc, WsTerminalSignalRpc, WsTerminalClearRpc, WsTerminalRestartRpc, WsTerminalCloseRpc, WsBrowserOpenSessionRpc, WsBrowserListSessionsRpc, WsBrowserCloseSessionRpc, WsBrowserGetSessionRpc, WsBrowserCommandRpc, WsBrowserClearBrowsingDataRpc, WsBrowserAttachDisplayRpc, WsBrowserAddDisplayIceCandidateRpc, WsComputerInputRpc, WsDevTunnelRegisterRpc, WsDevTunnelUnregisterRpc, WsDevTunnelListRpc, WsThreadDevRuntimeGetRpc, WsThreadDevRuntimeAllocatePortRpc, WsThreadDevRuntimeReleaseRpc, WsWorkspaceEnvironmentPreflightRpc, WsWorkspaceEnsureScratchRpc, WsSubscribeTerminalEventsRpc, WsSubscribeTerminalMetadataRpc, WsProjectsListEntriesRpc, WsServerDiscoverSourceControlRpc, WsServerReportClientActivityRpc, WsSubscribeBrowserEventsRpc, WsSubscribeServerConfigRpc, WsSubscribeServerLifecycleRpc, WsSubscribeAuthAccessRpc, WsSubscribeWorkspaceReadinessRpc, WsOrchestrationDispatchCommandRpc, WsOrchestrationGetTurnDiffRpc, WsOrchestrationGetFullThreadDiffRpc, WsOrchestrationStreamTurnDiffRpc, WsOrchestrationStreamFullThreadDiffRpc, WsOrchestrationReplayEventsRpc, WsOrchestrationGetArchivedShellSnapshotRpc, WsOrchestrationSubscribeShellRpc, WsOrchestrationSubscribeThreadRpc, make$30(WS_METHODS.assetsCreateUrl, {
 	payload: AssetsRpcSchemas.createUrl.input,
 	success: AssetsRpcSchemas.createUrl.output,
 	error: AssetAccessError
@@ -31496,21 +31324,6 @@ const RELAY_METHOD_POLICY_BASES = [
 		requiredScope: "runtime.read",
 		deliveryClass: "read"
 	},
-	{
-		method: WS_METHODS.codeGraphSummary,
-		requiredScope: "workspace.read",
-		deliveryClass: "read"
-	},
-	{
-		method: WS_METHODS.codeGraphNeighborhood,
-		requiredScope: "workspace.read",
-		deliveryClass: "read"
-	},
-	{
-		method: WS_METHODS.codeGraphSearch,
-		requiredScope: "workspace.read",
-		deliveryClass: "read"
-	},
 	{
 		method: WS_METHODS.projectsWriteFile,
 		requiredScope: "workspace.write",
@@ -66123,7 +65936,7 @@ function normalizeNumberish(value) {
 }
 //#endregion
 //#region package.json
-var version$1 = "0.13.16";
+var version$1 = "0.13.18";
 //#endregion
 //#region src/sentry.ts
 const SERVER_APP_NAME = "forge-server";
@@ -67161,7 +66974,7 @@ function toPersistenceDecodeDefect(operation) {
 const isPersistenceError = (u) => is$1(PersistenceSqlError)(u) || is$1(PersistenceDecodeError)(u);
 //#endregion
 //#region src/cmmdConnection/CmmdConnectionStore.ts
-const cache$1 = /* @__PURE__ */ new Map();
+const cache = /* @__PURE__ */ new Map();
 const jwtCache = /* @__PURE__ */ new Map();
 const jwtExpiryCache = /* @__PURE__ */ new Map();
 const refreshTokenCache = /* @__PURE__ */ new Map();
@@ -67302,7 +67115,7 @@ const hydrateCommandAccessTokenStore = gen(function* () {
       session_grant AS "sessionGrant"
     FROM command_access_tokens
   `.pipe(mapError(toPersistenceSqlError("CommandAccessTokenStore.hydrate:query")))).pipe(mapError(toPersistenceDecodeError("CommandAccessTokenStore.hydrate:decodeRows")));
-	cache$1.clear();
+	cache.clear();
 	jwtCache.clear();
 	jwtExpiryCache.clear();
 	refreshTokenCache.clear();
@@ -67312,7 +67125,7 @@ const hydrateCommandAccessTokenStore = gen(function* () {
 		try: () => {
 			for (const row of decoded) {
 				const sessionId = row.sessionId;
-				cache$1.set(sessionId, decodeSensitiveValue(ACCESS_TOKEN_SCOPE, row.accessToken));
+				cache.set(sessionId, decodeSensitiveValue(ACCESS_TOKEN_SCOPE, row.accessToken));
 				const jwtToken = decryptNullable(JWT_TOKEN_SCOPE, row.jwtToken);
 				if (jwtToken) jwtCache.set(sessionId, jwtToken);
 				if (row.jwtExpiresAt) jwtExpiryCache.set(sessionId, row.jwtExpiresAt);
@@ -67332,7 +67145,7 @@ const hydrateCommandAccessTokenStore = gen(function* () {
 * Returns `null` when the session has no paired CMMD token.
 */
 function readCommandAccessTokenForSession(sessionId) {
-	return cache$1.get(sessionId) ?? null;
+	return cache.get(sessionId) ?? null;
 }
 const threadSessions = /* @__PURE__ */ new Map();
 /**
@@ -67709,7 +67522,7 @@ const promoteMostRecentOwnerCommandAuthToSession = (sessionId) => gen(function*
         cmmd_user_identity = excluded.cmmd_user_identity,
         updated_at = excluded.updated_at
     `.pipe(mapError(toPersistenceSqlError("CommandAccessTokenStore.promoteLatestOwnerAuth:upsert")));
-	cache$1.set(sessionId, accessToken);
+	cache.set(sessionId, accessToken);
 	if (jwtToken) jwtCache.set(sessionId, jwtToken);
 	else jwtCache.delete(sessionId);
 	if (row.jwtExpiresAt) jwtExpiryCache.set(sessionId, row.jwtExpiresAt);
@@ -67754,7 +67567,7 @@ const setCommandAccessTokenForSession = (sessionId, accessToken) => gen(function
         access_token = excluded.access_token,
         updated_at = excluded.updated_at
     `.pipe(mapError(toPersistenceSqlError("CommandAccessTokenStore.set:query")));
-	cache$1.set(sessionId, token);
+	cache.set(sessionId, token);
 });
 /**
 * Remove the PAT for a session from both durable persistence and the in-memory cache.
@@ -67767,7 +67580,7 @@ const clearCommandAccessTokenForSession = (sessionId) => gen(function* () {
 	forgetCommandAccessTokenCachesForSession(sessionId);
 });
 function forgetCommandAccessTokenCachesForSession(sessionId) {
-	cache$1.delete(sessionId);
+	cache.delete(sessionId);
 	jwtCache.delete(sessionId);
 	jwtExpiryCache.delete(sessionId);
 	refreshTokenCache.delete(sessionId);
@@ -77318,500 +77131,6 @@ const makeSocketProtocol = /* @__PURE__ */ gen(function* () {
 	};
 });
 //#endregion
-//#region src/codeGraph/aggregate.ts
-/**
-* Turning a 26 MB graph into slices small enough to draw.
-*
-* Pure functions over an already-parsed graph, deliberately free of Effect, the
-* filesystem and the RPC layer, so the interesting parts — capping, ranking,
-* hub suppression — are testable without a runtime or a fixture file on disk.
-*
-* The whole module exists because of one number: this repo's graph is 34,102
-* nodes and 86,347 edges. Nothing here ever returns more than a few hundred of
-* either. A view that tries to show everything shows nothing.
-*/
-function pushInto(map, key, link) {
-	const existing = map.get(key);
-	if (existing === void 0) {
-		map.set(key, [link]);
-		return;
-	}
-	existing.push(link);
-}
-function isKnownRelation(relation) {
-	return Object.hasOwn(CODE_GRAPH_RELATION_CLASS, relation);
-}
-/**
-* Index a parsed graph once so every later query is a map lookup.
-*
-* Edges naming a node the artifact does not define are dropped rather than
-* synthesised. Graphify does emit these — a call into a module outside the scan
-* root — and inventing a placeholder node for one would put a file in the map
-* that is not in the repository.
-*/
-function indexGraph(raw, repoLabel) {
-	const nodes = /* @__PURE__ */ new Map();
-	for (const node of raw.nodes) nodes.set(node.id, node);
-	const outbound = /* @__PURE__ */ new Map();
-	const inbound = /* @__PURE__ */ new Map();
-	const degree = /* @__PURE__ */ new Map();
-	const unknownRelations = /* @__PURE__ */ new Set();
-	let extractedEdgeCount = 0;
-	let inferredEdgeCount = 0;
-	let edgeCount = 0;
-	for (const link of raw.links) {
-		if (!nodes.has(link.source) || !nodes.has(link.target)) continue;
-		const relation = link.relation ?? "";
-		if (relation !== "" && !isKnownRelation(relation)) {
-			unknownRelations.add(relation);
-			continue;
-		}
-		edgeCount += 1;
-		if (link.confidence === "INFERRED") inferredEdgeCount += 1;
-		else extractedEdgeCount += 1;
-		pushInto(outbound, link.source, link);
-		pushInto(inbound, link.target, link);
-		degree.set(link.source, (degree.get(link.source) ?? 0) + 1);
-		degree.set(link.target, (degree.get(link.target) ?? 0) + 1);
-	}
-	return {
-		repoLabel,
-		builtAtCommit: raw.built_at_commit ?? null,
-		nodes,
-		outbound,
-		inbound,
-		degree,
-		edgeCount,
-		extractedEdgeCount,
-		inferredEdgeCount,
-		unknownRelations: [...unknownRelations].toSorted()
-	};
-}
-/**
-* Deterministic sunflower placement.
-*
-* A phyllotaxis spiral rather than a force simulation, for three reasons: it
-* needs no dependency, it is O(n), and — the one that actually matters — it is
-* *stable*. The same graph opens to the same picture every time, so the spatial
-* memory a person builds up survives closing the panel. A force layout reshuffles
-* on every mount and quietly costs them that.
-*
-* Index 0 lands nearest the centre, so ordering regions by size puts the
-* architectural core where the eye starts.
-*/
-function spiralPosition(index, total) {
-	const goldenAngle = Math.PI * (3 - Math.sqrt(5));
-	const radius = total <= 1 ? 0 : Math.sqrt(index / (total - 1));
-	const angle = index * goldenAngle;
-	return {
-		x: .5 + radius * Math.cos(angle) * .44,
-		y: .5 + radius * Math.sin(angle) * .44
-	};
-}
-/** Group nodes into their communities, and remember which community each is in. */
-function accumulateRegions(graph) {
-	const accumulators = /* @__PURE__ */ new Map();
-	const regionOfNode = /* @__PURE__ */ new Map();
-	for (const node of graph.nodes.values()) {
-		const community = node.community;
-		if (community === void 0) continue;
-		regionOfNode.set(node.id, community);
-		const existing = accumulators.get(community);
-		if (existing === void 0) {
-			accumulators.set(community, {
-				id: community,
-				label: node.community_name ?? `Region ${String(community)}`,
-				nodeCount: 1
-			});
-			continue;
-		}
-		existing.nodeCount += 1;
-	}
-	return {
-		ordered: [...accumulators.values()].toSorted((a, b) => b.nodeCount - a.nodeCount || a.id - b.id),
-		regionOfNode
-	};
-}
-/**
-* Collapse node-level edges into weighted links between drawn regions.
-*
-* Undirected: "these two areas talk" is the question at this altitude, and
-* drawing both arcs doubles the ink for no added meaning.
-*/
-function aggregateRegionLinks(graph, regionOfNode, shownIds) {
-	const linkWeights = /* @__PURE__ */ new Map();
-	for (const links of graph.outbound.values()) for (const link of links) {
-		const from = regionOfNode.get(link.source);
-		const to = regionOfNode.get(link.target);
-		if (from === void 0 || to === void 0 || from === to) continue;
-		if (!shownIds.has(from) || !shownIds.has(to)) continue;
-		const key = `${String(Math.min(from, to))}:${String(Math.max(from, to))}`;
-		linkWeights.set(key, (linkWeights.get(key) ?? 0) + 1);
-	}
-	return [...linkWeights.entries()].map(([key, weight]) => {
-		const [source, target] = key.split(":");
-		return {
-			source: Number(source),
-			target: Number(target),
-			weight
-		};
-	});
-}
-/**
-* The default view: the repository as named regions.
-*
-* Regions come from graphify's own community detection, and their names come
-* from the community's hub node — so a region is labelled `AIGateway.ts` or
-* `IStorage`, something a person recognises, rather than "Community 469".
-*/
-function buildSummary(graph) {
-	const { ordered, regionOfNode } = accumulateRegions(graph);
-	const shown = ordered.slice(0, 120);
-	const shownIds = new Set(shown.map((region) => region.id));
-	const regions = shown.map((region, index) => {
-		const position = spiralPosition(index, shown.length);
-		return {
-			id: region.id,
-			label: region.label,
-			nodeCount: region.nodeCount,
-			x: position.x,
-			y: position.y
-		};
-	});
-	return {
-		repoLabel: graph.repoLabel,
-		builtAtCommit: graph.builtAtCommit,
-		nodeCount: graph.nodes.size,
-		edgeCount: graph.edgeCount,
-		extractedEdgeCount: graph.extractedEdgeCount,
-		inferredEdgeCount: graph.inferredEdgeCount,
-		regionCount: ordered.length,
-		regions,
-		links: aggregateRegionLinks(graph, regionOfNode, shownIds),
-		truncatedRegions: Math.max(0, ordered.length - shown.length)
-	};
-}
-function summariseNode(graph, node) {
-	return {
-		id: node.id,
-		label: node.label ?? node.id,
-		kind: node._callable === true ? "symbol" : "file",
-		sourceFile: node.source_file ?? null,
-		sourceLocation: node.source_location ?? null,
-		regionId: node.community ?? null,
-		regionLabel: node.community_name ?? null,
-		degree: graph.degree.get(node.id) ?? 0
-	};
-}
-function toEdgeView(link) {
-	const relation = link.relation ?? "";
-	if (!isKnownRelation(relation)) return null;
-	const confidence = link.confidence === "INFERRED" ? "INFERRED" : "EXTRACTED";
-	return {
-		source: link.source,
-		target: link.target,
-		relation,
-		edgeClass: CODE_GRAPH_RELATION_CLASS[relation],
-		confidence,
-		confidenceScore: link.confidence_score ?? 1
-	};
-}
-/**
-* Pull one node's neighbours into the result; return how many it had to drop.
-*
-* Split out of `buildNeighborhood` because the two read differently: the caller
-* owns *how far to walk*, this owns *what one step collects*. Together they sat
-* well past the repo's cognitive-complexity gate.
-*/
-/** Links touching a node, most-connected neighbour first. */
-function rankNeighbourLinks(graph, current) {
-	return [...graph.outbound.get(current) ?? [], ...graph.inbound.get(current) ?? []].toSorted((a, b) => {
-		const aOther = a.source === current ? a.target : a.source;
-		const bOther = b.source === current ? b.target : b.source;
-		return (graph.degree.get(bOther) ?? 0) - (graph.degree.get(aOther) ?? 0);
-	});
-}
-/** Take a neighbour into the result. False means the budget is spent. */
-function admitNeighbour(state, id, node) {
-	if (state.included.has(id)) return true;
-	if (state.included.size >= 150) return false;
-	state.included.set(id, node);
-	state.next.push(id);
-	return true;
-}
-/** Record an edge once, dropping any relation this build cannot classify. */
-function recordEdge(state, link) {
-	const edgeKey = `${link.source}>${link.target}:${link.relation ?? ""}`;
-	if (state.seenEdges.has(edgeKey)) return;
-	const view = toEdgeView(link);
-	if (view === null) return;
-	state.seenEdges.add(edgeKey);
-	state.edges.push(view);
-}
-/**
-* Pull one node's neighbours into the result; return how many it had to drop.
-*
-* Split out of `buildNeighborhood` because the two read differently: the caller
-* owns *how far to walk*, this owns *what one step collects*.
-*/
-function expandNode(graph, current, state) {
-	let omitted = 0;
-	for (const link of rankNeighbourLinks(graph, current)) {
-		const other = link.source === current ? link.target : link.source;
-		const otherNode = graph.nodes.get(other);
-		if (otherNode === void 0) continue;
-		if (!admitNeighbour(state, other, otherNode)) {
-			omitted += 1;
-			continue;
-		}
-		recordEdge(state, link);
-	}
-	return omitted;
-}
-/**
-* One node and what surrounds it.
-*
-* Two caps, and they do different jobs. `CODE_GRAPH_MAX_NEIGHBORS` bounds the
-* answer so the canvas stays drawable. `CODE_GRAPH_MAX_FANOUT` bounds the
-* *traversal*: a hub is included as a neighbor but never expanded through, so
-* one `logger.ts` in the second ring cannot drag the entire repository in
-* behind it. Without the second cap the first one is reached instantly and the
-* result is 150 arbitrary nodes rather than the 150 nearest ones.
-*/
-function buildNeighborhood(graph, nodeId, requestedDepth) {
-	const root = graph.nodes.get(nodeId);
-	if (root === void 0) return null;
-	const depth = Math.min(Math.max(1, requestedDepth), 2);
-	const included = new Map([[root.id, root]]);
-	const seenEdges = /* @__PURE__ */ new Set();
-	const edges = [];
-	let omittedCount = 0;
-	let frontier = [root.id];
-	for (let level = 0; level < depth; level += 1) {
-		const next = [];
-		for (const current of frontier) {
-			const fanout = graph.degree.get(current) ?? 0;
-			if (current !== root.id && fanout > 200) continue;
-			omittedCount += expandNode(graph, current, {
-				included,
-				seenEdges,
-				edges,
-				next
-			});
-		}
-		frontier = next;
-		if (frontier.length === 0) break;
-	}
-	const nodes = [...included.values()].filter((node) => node.id !== root.id).map((node) => summariseNode(graph, node)).toSorted((a, b) => b.degree - a.degree || a.label.localeCompare(b.label));
-	return {
-		root: summariseNode(graph, root),
-		nodes,
-		edges: edges.filter((edge) => included.has(edge.source) && included.has(edge.target)),
-		depth,
-		truncated: omittedCount > 0,
-		omittedCount
-	};
-}
-/**
-* Rank one node against a query: lower is better, negative means no match.
-*
-* A file-path hit ranks last because "the query appears somewhere in this path"
-* is much weaker evidence than "this thing is called that".
-*/
-function matchScore(node, query) {
-	const label = (node.label ?? node.id).toLowerCase();
-	if (label === query) return 0;
-	if (label.startsWith(query)) return 1;
-	if (label.includes(query)) return 2;
-	return (node.source_file ?? "").toLowerCase().includes(query) ? 3 : -1;
-}
-/**
-* Find a node by name or path.
-*
-* Entry to this surface is search, not the canvas — you usually arrive already
-* knowing what you are looking for, and clicking around 34,000 nodes to find it
-* is not a workflow. Ranking is exact, then prefix, then substring, with degree
-* breaking ties so the `logger.ts` everything imports outranks a test fixture
-* that merely shares the word.
-*/
-function searchNodes(graph, rawQuery, limit = 40) {
-	const query = rawQuery.trim().toLowerCase();
-	if (query === "") return {
-		nodes: [],
-		truncated: false
-	};
-	const scored = [];
-	for (const node of graph.nodes.values()) {
-		const score = matchScore(node, query);
-		if (score < 0) continue;
-		scored.push({
-			node,
-			score
-		});
-	}
-	const ranked = scored.toSorted((a, b) => a.score - b.score || (graph.degree.get(b.node.id) ?? 0) - (graph.degree.get(a.node.id) ?? 0) || (a.node.label ?? a.node.id).localeCompare(b.node.label ?? b.node.id));
-	const capped = ranked.slice(0, limit);
-	return {
-		nodes: capped.map((entry) => summariseNode(graph, entry.node)),
-		truncated: ranked.length > capped.length
-	};
-}
-//#endregion
-//#region src/codeGraph/graphArtifact.ts
-/**
-* Reading `graphify-out/graph.json` off disk, once.
-*
-* The artifact is 26 MB here and 40 MB for CMMD's server tree, and parsing it
-* costs roughly a second. Every panel open would pay that again without a cache,
-* so one indexed graph is held per project and reused until the file changes.
-*
-* Kept free of Effect on purpose: the failure modes worth distinguishing are all
-* filesystem-shaped, and a plain promise keeps this unit-testable against real
-* fixtures without constructing a runtime. `ws.ts` wraps it at the boundary.
-*/
-const cache = /* @__PURE__ */ new Map();
-/** Git LFS writes a pointer file that is valid text and useless as a graph. */
-const LFS_POINTER_PREFIX = "version https://git-lfs.github.com/spec/v1";
-function codeGraphArtifactPath(cwd) {
-	return path.join(cwd, CODE_GRAPH_ARTIFACT_PATH);
-}
-function isRawGraph(value) {
-	if (typeof value !== "object" || value === null) return false;
-	const candidate = value;
-	return Array.isArray(candidate.nodes) && Array.isArray(candidate.links);
-}
-/**
-* Load and index the graph for one project checkout.
-*
-* The LFS-pointer case is called out separately rather than folded into
-* "malformed" because it is the single most likely failure on a fresh clone —
-* the file is present, tracked, and 133 bytes of metadata. Telling someone their
-* graph is corrupt when they simply have not run `git lfs pull` sends them to
-* rebuild something that is fine.
-*/
-async function loadIndexedGraph(cwd) {
-	const artifactPath = codeGraphArtifactPath(cwd);
-	let stats;
-	try {
-		stats = await stat(artifactPath);
-	} catch {
-		return {
-			ok: false,
-			failure: {
-				kind: "missing",
-				artifactPath
-			}
-		};
-	}
-	if (!stats.isFile()) return {
-		ok: false,
-		failure: {
-			kind: "missing",
-			artifactPath
-		}
-	};
-	const cached = cache.get(artifactPath);
-	if (cached !== void 0 && cached.mtimeMs === stats.mtimeMs && cached.size === stats.size) return {
-		ok: true,
-		graph: cached.graph
-	};
-	let contents;
-	try {
-		contents = await readFile$1(artifactPath, "utf8");
-	} catch (error) {
-		return {
-			ok: false,
-			failure: {
-				kind: "unreadable",
-				artifactPath,
-				detail: error instanceof Error ? error.message : String(error)
-			}
-		};
-	}
-	if (contents.startsWith(LFS_POINTER_PREFIX)) return {
-		ok: false,
-		failure: {
-			kind: "lfs-pointer",
-			artifactPath
-		}
-	};
-	let parsed;
-	try {
-		parsed = JSON.parse(contents);
-	} catch (error) {
-		return {
-			ok: false,
-			failure: {
-				kind: "malformed",
-				artifactPath,
-				detail: error instanceof Error ? error.message : String(error)
-			}
-		};
-	}
-	if (!isRawGraph(parsed)) return {
-		ok: false,
-		failure: {
-			kind: "malformed",
-			artifactPath,
-			detail: "Expected an object with `nodes` and `links` arrays."
-		}
-	};
-	const graph = indexGraph(parsed, path.basename(cwd));
-	cache.set(artifactPath, {
-		mtimeMs: stats.mtimeMs,
-		size: stats.size,
-		graph
-	});
-	return {
-		ok: true,
-		graph
-	};
-}
-//#endregion
-//#region src/codeGraph/service.ts
-/**
-* The code-graph RPC surface, as Effects.
-*
-* A thin seam between `ws.ts` and the pure aggregator: load the artifact, turn
-* a filesystem failure into the tagged error the client can act on, and slice.
-*
-* The failure mapping is the substance here. Each reason produces different
-* advice — pull LFS, run the extractor, report a corrupt file — so collapsing
-* them into one "graph unavailable" would send people to fix the wrong thing.
-*/
-function toUnavailable(failure) {
-	switch (failure.kind) {
-		case "missing": return new CodeGraphUnavailableError({
-			reason: "missing",
-			message: `No code graph in this checkout. Run \`graphify update .\` to build ${failure.artifactPath}.`
-		});
-		case "lfs-pointer": return new CodeGraphUnavailableError({
-			reason: "lfs-pointer",
-			message: `The graph is a Git LFS pointer, not the graph itself. Run \`git lfs pull\` to fetch it.`
-		});
-		case "malformed": return new CodeGraphUnavailableError({
-			reason: "malformed",
-			message: `The graph file could not be parsed: ${failure.detail}`
-		});
-		case "unreadable": return new CodeGraphUnavailableError({
-			reason: "unreadable",
-			message: `The graph file could not be read: ${failure.detail}`
-		});
-	}
-}
-function withGraph(cwd, use) {
-	return flatMap(promise(() => loadIndexedGraph(cwd)), (result) => result.ok ? succeed(use(result.graph)) : fail(toUnavailable(result.failure)));
-}
-function readCodeGraphSummary(input) {
-	return withGraph(input.cwd, buildSummary);
-}
-function readCodeGraphNeighborhood(input) {
-	return flatMap(withGraph(input.cwd, (graph) => buildNeighborhood(graph, input.nodeId, input.depth ?? 1)), (neighborhood) => neighborhood === null ? fail(new CodeGraphNodeNotFoundError({ nodeId: input.nodeId })) : succeed(neighborhood));
-}
-function readCodeGraphSearch(input) {
-	return withGraph(input.cwd, (graph) => searchNodes(graph, input.query, input.limit ?? 40));
-}
-//#endregion
 //#region src/checkpointing/Services/CheckpointDiffQuery.ts
 /**
 * CheckpointDiffQuery - Service tag for checkpoint diff queries.
@@ -107314,9 +106633,6 @@ const makeWsRpcLayer = (currentSessionId, currentUserId) => WsRpcGroup.toLayer(g
 		}))), { "rpc.aggregate": "workspace" }),
 		[WS_METHODS.serverDiscoverSourceControl]: () => observeRpcEffect(WS_METHODS.serverDiscoverSourceControl, discoverSourceControl, { "rpc.aggregate": "server" }),
 		[WS_METHODS.serverReportClientActivity]: () => observeRpcEffect(WS_METHODS.serverReportClientActivity, void_$1, { "rpc.aggregate": "server" }),
-		[WS_METHODS.codeGraphSummary]: (input) => observeRpcEffect(WS_METHODS.codeGraphSummary, readCodeGraphSummary(input), { "rpc.aggregate": "codeGraph" }),
-		[WS_METHODS.codeGraphNeighborhood]: (input) => observeRpcEffect(WS_METHODS.codeGraphNeighborhood, readCodeGraphNeighborhood(input), { "rpc.aggregate": "codeGraph" }),
-		[WS_METHODS.codeGraphSearch]: (input) => observeRpcEffect(WS_METHODS.codeGraphSearch, readCodeGraphSearch(input), { "rpc.aggregate": "codeGraph" }),
 		[WS_METHODS.projectsWriteFile]: (input) => observeRpcEffect(WS_METHODS.projectsWriteFile, workspaceFileSystem.writeFile(input).pipe(mapError((cause) => {
 			return new ProjectWriteFileError({
 				message: is$1(WorkspacePathOutsideRootError)(cause) ? "Workspace file path must stay within the project root." : "Failed to write workspace file",
@@ -298327,7 +297643,7 @@ function resolveBuildCommitFromEnv(env) {
 * environment descriptor down instead of reporting an honest "unknown".
 */
 function readBakedBuildCommit() {
-	return "b06001f4e16f7a336e9108920f9250b366862f3d";
+	return "ccfffcbf86c28599b61bac158032499398ed9713";
 }
 async function resolveServerBuildCommit(input) {
 	if (isFullCommitSha(input.baked)) return input.baked;