devworkspace 0.3.0 → 0.3.2

package/dist/services/features.js

@@ -0,0 +1,105 @@
+import { FEATURE_SCHEMA_VERSION, validateFeatures } from '../features/schema.js';
+import { readVersioned, writeVersioned } from '../core/versioned.js';
+import { requireWorkspace } from '../core/workspace.js';
+import { DevWorkspaceError } from '../errors/index.js';
+import { pathExists } from '../utils/fs.js';
+import { validateFeature, validateFeatureMap } from '../features/validate.js';
+import { isoNow, mutate } from './common.js';
+export async function loadFeatures(ws) {
+    if (!(await pathExists(ws.features))) {
+        return { schemaVersion: FEATURE_SCHEMA_VERSION, features: [] };
+    }
+    return (await readVersioned(ws.features, 'features', FEATURE_SCHEMA_VERSION, validateFeatures)).data;
+}
+export async function saveFeatures(ws, file) {
+    validateFeatures(file);
+    await writeVersioned(ws, ws.features, file);
+}
+function countComponents(f) {
+    let total = 0;
+    let tests = 0;
+    const countGroup = (g, isTest = false) => {
+        if (!g)
+            return;
+        for (const arr of Object.values(g)) {
+            if (Array.isArray(arr)) {
+                total += arr.length;
+                if (isTest)
+                    tests += arr.length;
+            }
+        }
+    };
+    countGroup(f.frontend);
+    countGroup(f.backend);
+    countGroup(f.database);
+    countGroup(f.tests, true);
+    return { total, tests };
+}
+export async function listFeaturesService(o) {
+    const ws = await requireWorkspace(o.cwd);
+    const file = await loadFeatures(ws);
+    return file.features.map((f) => {
+        const counts = countComponents(f);
+        return {
+            id: f.id,
+            name: f.name,
+            ...(f.description ? { description: f.description } : {}),
+            status: f.status ?? 'inferred',
+            componentsCount: counts.total,
+            testsCount: counts.tests,
+            ...(f.tags ? { tags: f.tags } : {}),
+            updatedAt: f.updatedAt ?? '',
+        };
+    });
+}
+export async function getFeatureService(o, id) {
+    const ws = await requireWorkspace(o.cwd);
+    const file = await loadFeatures(ws);
+    const target = file.features.find((f) => f.id.toLowerCase() === id.toLowerCase());
+    if (!target) {
+        throw new DevWorkspaceError('NOT_FOUND', `Feature "${id}" not found in .devworkspace/context/features.json.`, {
+            hint: 'Run "devworkspace feature list" to see existing features, or "devworkspace feature add" to create one.',
+        });
+    }
+    return target;
+}
+export async function validateFeatureMapService(o) {
+    const ws = await requireWorkspace(o.cwd);
+    const file = await loadFeatures(ws);
+    return validateFeatureMap(ws.root, file.features);
+}
+export async function saveFeatureService(o, input) {
+    const ws = await requireWorkspace(o.cwd);
+    const now = isoNow(o);
+    const item = {
+        id: input.id.trim(),
+        name: input.name.trim(),
+        ...(input.description ? { description: input.description.trim() } : {}),
+        status: input.status ?? 'inferred',
+        origin: input.origin ?? 'user',
+        ...(input.frontend ? { frontend: input.frontend } : {}),
+        ...(input.backend ? { backend: input.backend } : {}),
+        ...(input.database ? { database: input.database } : {}),
+        ...(input.tests ? { tests: input.tests } : {}),
+        ...(input.tags ? { tags: input.tags } : {}),
+        updatedAt: now,
+    };
+    // Perform self-validation through the schema
+    validateFeatures({ schemaVersion: FEATURE_SCHEMA_VERSION, features: [item] });
+    // Validate components against the disk to assign accurate initial status
+    const checked = await validateFeature(ws.root, item);
+    item.status = checked.status;
+    await mutate(o, async (w) => {
+        const current = await loadFeatures(w);
+        const index = current.features.findIndex((f) => f.id.toLowerCase() === item.id.toLowerCase());
+        if (index >= 0) {
+            current.features[index] = item;
+        }
+        else {
+            current.features.push(item);
+        }
+        await saveFeatures(w, current);
+    });
+    return item;
+}
+//# sourceMappingURL=features.js.map

package/dist/services/features.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.js","sourceRoot":"","sources":["../../src/services/features.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEjF,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACrE,OAAO,EAAE,gBAAgB,EAAW,MAAM,sBAAsB,CAAC;AACjE,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC9E,OAAO,EAAE,MAAM,EAAE,MAAM,EAAuB,MAAM,aAAa,CAAC;AAalE,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,EAAM;IACvC,IAAI,CAAC,CAAC,MAAM,UAAU,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;QACrC,OAAO,EAAE,aAAa,EAAE,sBAAsB,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IACjE,CAAC;IACD,OAAO,CAAC,MAAM,aAAa,CAAC,EAAE,CAAC,QAAQ,EAAE,UAAU,EAAE,sBAAsB,EAAE,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC;AACvG,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,EAAM,EAAE,IAAkB;IAC3D,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACvB,MAAM,cAAc,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,eAAe,CAAC,CAAc;IACrC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,MAAM,UAAU,GAAG,CAAC,CAAyC,EAAE,MAAM,GAAG,KAAK,EAAQ,EAAE;QACrF,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvB,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;gBACpB,IAAI,MAAM;oBAAE,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACvB,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACtB,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACvB,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAE1B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,CAAiB;IACzD,MAAM,EAAE,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC7B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAClC,OAAO;YACL,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxD,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,UAAU;YAC9B,eAAe,EAAE,MAAM,CAAC,KAAK;YAC7B,UAAU,EAAE,MAAM,CAAC,KAAK;YACxB,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACnC,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,EAAE;SAC7B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,CAAiB,EAAE,EAAU;IACnE,MAAM,EAAE,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;IAClF,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,iBAAiB,CAAC,WAAW,EAAE,YAAY,EAAE,qDAAqD,EAAE;YAC5G,IAAI,EAAE,wGAAwG;SAC/G,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAAC,CAAiB;IAC/D,MAAM,EAAE,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,OAAO,kBAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AACpD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,CAAiB,EAAE,KAA0D;IACpH,MAAM,EAAE,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAEtB,MAAM,IAAI,GAAgB;QACxB,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE;QACnB,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE;QACvB,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvE,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,UAAU;QAClC,MAAM,EAAE,KAAK,CAAC,MAAM,IAAI,MAAM;QAC9B,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvD,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACpD,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACvD,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,SAAS,EAAE,GAAG;KACf,CAAC;IAEF,6CAA6C;IAC7C,gBAAgB,CAAC,EAAE,aAAa,EAAE,sBAAsB,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE9E,yEAAyE;IACzE,MAAM,OAAO,GAAG,MAAM,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACrD,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAE7B,MAAM,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;QAC9F,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,MAAM,YAAY,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["import { FEATURE_SCHEMA_VERSION, validateFeatures } from '../features/schema.js';\nimport type { FeatureItem, FeaturesFile, FeatureValidationReport } from '../features/types.js';\nimport { readVersioned, writeVersioned } from '../core/versioned.js';\nimport { requireWorkspace, type Ws } from '../core/workspace.js';\nimport { DevWorkspaceError } from '../errors/index.js';\nimport { pathExists } from '../utils/fs.js';\nimport { validateFeature, validateFeatureMap } from '../features/validate.js';\nimport { isoNow, mutate, type ServiceOptions } from './common.js';\n\nexport interface FeatureSummary {\n  id: string;\n  name: string;\n  description?: string;\n  status: string;\n  componentsCount: number;\n  testsCount: number;\n  tags?: string[];\n  updatedAt: string;\n}\n\nexport async function loadFeatures(ws: Ws): Promise<FeaturesFile> {\n  if (!(await pathExists(ws.features))) {\n    return { schemaVersion: FEATURE_SCHEMA_VERSION, features: [] };\n  }\n  return (await readVersioned(ws.features, 'features', FEATURE_SCHEMA_VERSION, validateFeatures)).data;\n}\n\nexport async function saveFeatures(ws: Ws, file: FeaturesFile): Promise<void> {\n  validateFeatures(file);\n  await writeVersioned(ws, ws.features, file);\n}\n\nfunction countComponents(f: FeatureItem): { total: number; tests: number } {\n  let total = 0;\n  let tests = 0;\n\n  const countGroup = (g?: Record<string, unknown[] | undefined>, isTest = false): void => {\n    if (!g) return;\n    for (const arr of Object.values(g)) {\n      if (Array.isArray(arr)) {\n        total += arr.length;\n        if (isTest) tests += arr.length;\n      }\n    }\n  };\n\n  countGroup(f.frontend);\n  countGroup(f.backend);\n  countGroup(f.database);\n  countGroup(f.tests, true);\n\n  return { total, tests };\n}\n\nexport async function listFeaturesService(o: ServiceOptions): Promise<FeatureSummary[]> {\n  const ws = await requireWorkspace(o.cwd);\n  const file = await loadFeatures(ws);\n  return file.features.map((f) => {\n    const counts = countComponents(f);\n    return {\n      id: f.id,\n      name: f.name,\n      ...(f.description ? { description: f.description } : {}),\n      status: f.status ?? 'inferred',\n      componentsCount: counts.total,\n      testsCount: counts.tests,\n      ...(f.tags ? { tags: f.tags } : {}),\n      updatedAt: f.updatedAt ?? '',\n    };\n  });\n}\n\nexport async function getFeatureService(o: ServiceOptions, id: string): Promise<FeatureItem> {\n  const ws = await requireWorkspace(o.cwd);\n  const file = await loadFeatures(ws);\n  const target = file.features.find((f) => f.id.toLowerCase() === id.toLowerCase());\n  if (!target) {\n    throw new DevWorkspaceError('NOT_FOUND', `Feature \"${id}\" not found in .devworkspace/context/features.json.`, {\n      hint: 'Run \"devworkspace feature list\" to see existing features, or \"devworkspace feature add\" to create one.',\n    });\n  }\n  return target;\n}\n\nexport async function validateFeatureMapService(o: ServiceOptions): Promise<FeatureValidationReport> {\n  const ws = await requireWorkspace(o.cwd);\n  const file = await loadFeatures(ws);\n  return validateFeatureMap(ws.root, file.features);\n}\n\nexport async function saveFeatureService(o: ServiceOptions, input: Partial<FeatureItem> & { id: string; name: string }): Promise<FeatureItem> {\n  const ws = await requireWorkspace(o.cwd);\n  const now = isoNow(o);\n\n  const item: FeatureItem = {\n    id: input.id.trim(),\n    name: input.name.trim(),\n    ...(input.description ? { description: input.description.trim() } : {}),\n    status: input.status ?? 'inferred',\n    origin: input.origin ?? 'user',\n    ...(input.frontend ? { frontend: input.frontend } : {}),\n    ...(input.backend ? { backend: input.backend } : {}),\n    ...(input.database ? { database: input.database } : {}),\n    ...(input.tests ? { tests: input.tests } : {}),\n    ...(input.tags ? { tags: input.tags } : {}),\n    updatedAt: now,\n  };\n\n  // Perform self-validation through the schema\n  validateFeatures({ schemaVersion: FEATURE_SCHEMA_VERSION, features: [item] });\n\n  // Validate components against the disk to assign accurate initial status\n  const checked = await validateFeature(ws.root, item);\n  item.status = checked.status;\n\n  await mutate(o, async (w) => {\n    const current = await loadFeatures(w);\n    const index = current.features.findIndex((f) => f.id.toLowerCase() === item.id.toLowerCase());\n    if (index >= 0) {\n      current.features[index] = item;\n    } else {\n      current.features.push(item);\n    }\n    await saveFeatures(w, current);\n  });\n\n  return item;\n}\n\n"]}

package/dist/services/graph.d.ts

@@ -0,0 +1,97 @@
+import type { ServiceOptions } from './common.js';
+export type NodeVerificationStatus = 'verified' | 'hypothesis';
+export interface RawGraphNode {
+    id: string;
+    name?: string;
+    label?: string;
+    type?: string;
+    path?: string;
+    file?: string;
+    [key: string]: unknown;
+}
+export interface RawGraphEdge {
+    source: string;
+    target: string;
+    relation?: string;
+    type?: string;
+    label?: string;
+    weight?: number;
+    [key: string]: unknown;
+}
+export interface RawGraphData {
+    nodes?: RawGraphNode[];
+    edges?: RawGraphEdge[];
+    links?: RawGraphEdge[];
+    [key: string]: unknown;
+}
+export interface TracedNode {
+    id: string;
+    name: string;
+    type: string;
+    path: string | null;
+    symbol: string | null;
+    depth: number;
+    status: NodeVerificationStatus;
+    fileExists: boolean;
+    symbolFound: boolean | null;
+    reason?: string;
+}
+export interface TracedEdge {
+    source: string;
+    target: string;
+    relation: string;
+    status: NodeVerificationStatus;
+}
+export interface GraphStatusResult {
+    available: boolean;
+    graphPath: string;
+    nodesCount: number;
+    edgesCount: number;
+    nodeTypes: Record<string, number>;
+    message: string;
+    hint?: string;
+}
+export interface GraphTraceResult {
+    available: boolean;
+    query: string;
+    depth: number;
+    matchedNode: TracedNode | null;
+    totalNodes: number;
+    verifiedNodes: number;
+    hypothesisNodes: number;
+    nodes: TracedNode[];
+    edges: TracedEdge[];
+    warnings: string[];
+}
+/**
+ * Resolves the location of Graphify's output graph in the repository.
+ */
+export declare function getGraphPath(root: string): string;
+/**
+ * Loads and validates Graphify graph JSON data safely.
+ */
+export declare function loadGraphData(root: string): Promise<{
+    exists: boolean;
+    path: string;
+    data?: {
+        nodes: RawGraphNode[];
+        edges: RawGraphEdge[];
+    };
+}>;
+/**
+ * Reports the presence, size, and basic schema health of the Graphify graph.
+ */
+export declare function getGraphStatusService(o: ServiceOptions): Promise<GraphStatusResult>;
+/**
+ * Finds the starting node in a graph that matches the user's query.
+ */
+export declare function findMatchingStartNode(nodes: RawGraphNode[], query: string): RawGraphNode | null;
+/**
+ * Performs a bounded graph trace starting from a specified file or symbol node up to maxDepth.
+ * Verifies every traversed node against the repository filesystem, marking unverified nodes
+ * and edges as hypotheses.
+ */
+export declare function traceGraphService(o: ServiceOptions, query: string, options?: {
+    depth?: number;
+    maxNodes?: number;
+}): Promise<GraphTraceResult>;

package/dist/services/graph.js

@@ -0,0 +1,342 @@
+import { promises as fs } from 'node:fs';
+import path from 'node:path';
+import { pathExists, readTextBounded } from '../utils/fs.js';
+import { findSymbolInText } from '../features/validate.js';
+import { requireWorkspace } from '../core/workspace.js';
+import { DevWorkspaceError } from '../errors/index.js';
+/**
+ * Resolves the location of Graphify's output graph in the repository.
+ */
+export function getGraphPath(root) {
+    return path.join(root, 'graphify-out', 'graph.json');
+}
+/**
+ * Loads and validates Graphify graph JSON data safely.
+ */
+export async function loadGraphData(root) {
+    const gPath = getGraphPath(root);
+    if (!(await pathExists(gPath))) {
+        return { exists: false, path: gPath };
+    }
+    let raw;
+    try {
+        raw = await fs.readFile(gPath, 'utf8');
+    }
+    catch (e) {
+        throw new DevWorkspaceError('IO', `Failed to read Graphify output at "${gPath}": ${e.message}`, {
+            hint: 'Ensure graphify-out/graph.json is readable or regenerate with "graphify update .".',
+        });
+    }
+    let parsed;
+    try {
+        parsed = JSON.parse(raw);
+    }
+    catch {
+        throw new DevWorkspaceError('SCHEMA', `Graphify output at "${gPath}" is not valid JSON.`, {
+            hint: 'Regenerate the graph using "graphify update ." or "/graphify ." in Claude Code.',
+        });
+    }
+    if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed)) {
+        throw new DevWorkspaceError('SCHEMA', `Graphify output at "${gPath}" must be a JSON object with nodes and edges.`, {
+            hint: 'Regenerate the graph using "graphify update .".',
+        });
+    }
+    const obj = parsed;
+    const nodes = Array.isArray(obj.nodes) ? obj.nodes : [];
+    const edges = Array.isArray(obj.edges) ? obj.edges : Array.isArray(obj.links) ? obj.links : [];
+    return {
+        exists: true,
+        path: gPath,
+        data: { nodes, edges },
+    };
+}
+/**
+ * Reports the presence, size, and basic schema health of the Graphify graph.
+ */
+export async function getGraphStatusService(o) {
+    const ws = await requireWorkspace(o.cwd);
+    const loaded = await loadGraphData(ws.root);
+    if (!loaded.exists || !loaded.data) {
+        return {
+            available: false,
+            graphPath: loaded.path,
+            nodesCount: 0,
+            edgesCount: 0,
+            nodeTypes: {},
+            message: 'No Graphify knowledge graph found at graphify-out/graph.json.',
+            hint: 'In Claude Code run "/graphify ." to build the graph, or run "graphify update ." if already initialized.',
+        };
+    }
+    const { nodes, edges } = loaded.data;
+    const nodeTypes = {};
+    for (const n of nodes) {
+        const t = n.type || 'unknown';
+        nodeTypes[t] = (nodeTypes[t] || 0) + 1;
+    }
+    return {
+        available: true,
+        graphPath: loaded.path,
+        nodesCount: nodes.length,
+        edgesCount: edges.length,
+        nodeTypes,
+        message: `Graphify graph loaded: ${nodes.length} nodes, ${edges.length} edges.`,
+    };
+}
+/**
+ * Extracts a candidate file path and symbol from a node definition.
+ */
+function extractPathAndSymbol(node) {
+    // If explicitly declared:
+    const rawPath = typeof node.path === 'string' ? node.path : typeof node.file === 'string' ? node.file : null;
+    let relPath = rawPath ? rawPath.replace(/\\/g, '/').replace(/^\/+/, '') : null;
+    let symbol = null;
+    if (node.id.includes('::')) {
+        const parts = node.id.split('::');
+        if (!relPath && parts[0] && (parts[0].includes('/') || parts[0].includes('.'))) {
+            relPath = parts[0].replace(/\\/g, '/').replace(/^\/+/, '');
+        }
+        symbol = parts[1] || null;
+    }
+    else if (!relPath && (node.id.includes('/') || node.id.includes('.'))) {
+        relPath = node.id.replace(/\\/g, '/').replace(/^\/+/, '');
+    }
+    if (!symbol && typeof node.name === 'string' && node.name !== relPath) {
+        symbol = node.name;
+    }
+    return { relPath, symbol };
+}
+/**
+ * Verifies whether a node's physical path and symbol exist on disk.
+ */
+async function verifyNode(root, node, depth) {
+    const { relPath, symbol } = extractPathAndSymbol(node);
+    const name = typeof node.name === 'string' ? node.name : typeof node.label === 'string' ? node.label : node.id;
+    const type = typeof node.type === 'string' ? node.type : 'symbol';
+    if (!relPath) {
+        return {
+            id: node.id,
+            name,
+            type,
+            path: null,
+            symbol,
+            depth,
+            status: 'hypothesis',
+            fileExists: false,
+            symbolFound: null,
+            reason: 'No source file associated with node',
+        };
+    }
+    const fullPath = path.join(root, ...relPath.split('/'));
+    const exists = await pathExists(fullPath);
+    if (!exists) {
+        return {
+            id: node.id,
+            name,
+            type,
+            path: relPath,
+            symbol,
+            depth,
+            status: 'hypothesis',
+            fileExists: false,
+            symbolFound: null,
+            reason: `File "${relPath}" not found on disk`,
+        };
+    }
+    let symbolFound = null;
+    let status = 'verified';
+    let reason;
+    if (symbol) {
+        try {
+            const text = await readTextBounded(fullPath, 500_000);
+            if (text) {
+                symbolFound = findSymbolInText(text, symbol);
+                if (!symbolFound) {
+                    status = 'hypothesis';
+                    reason = `Symbol "${symbol}" not found in "${relPath}"`;
+                }
+            }
+        }
+        catch {
+            status = 'hypothesis';
+            reason = `Could not inspect symbols in "${relPath}"`;
+        }
+    }
+    return {
+        id: node.id,
+        name,
+        type,
+        path: relPath,
+        symbol,
+        depth,
+        status,
+        fileExists: true,
+        symbolFound,
+        ...(reason ? { reason } : {}),
+    };
+}
+/**
+ * Finds the starting node in a graph that matches the user's query.
+ */
+export function findMatchingStartNode(nodes, query) {
+    const q = query.trim().toLowerCase();
+    const qNorm = q.replace(/\\/g, '/');
+    // 1. Exact match on ID
+    const exactId = nodes.find((n) => n.id.toLowerCase() === q || n.id.toLowerCase().replace(/\\/g, '/') === qNorm);
+    if (exactId)
+        return exactId;
+    // 2. Exact match on path or file
+    const exactPath = nodes.find((n) => {
+        const p = (n.path || n.file || '').toLowerCase().replace(/\\/g, '/');
+        return p === qNorm;
+    });
+    if (exactPath)
+        return exactPath;
+    // 3. Exact match on name or symbol
+    const exactName = nodes.find((n) => {
+        const name = (n.name || n.label || '').toLowerCase();
+        return name === q;
+    });
+    if (exactName)
+        return exactName;
+    // 4. Substring match on ID or path
+    const subMatch = nodes.find((n) => {
+        const id = n.id.toLowerCase().replace(/\\/g, '/');
+        const p = (n.path || n.file || '').toLowerCase().replace(/\\/g, '/');
+        return id.includes(qNorm) || p.includes(qNorm);
+    });
+    if (subMatch)
+        return subMatch;
+    return null;
+}
+/**
+ * Performs a bounded graph trace starting from a specified file or symbol node up to maxDepth.
+ * Verifies every traversed node against the repository filesystem, marking unverified nodes
+ * and edges as hypotheses.
+ */
+export async function traceGraphService(o, query, options = {}) {
+    const ws = await requireWorkspace(o.cwd);
+    const loaded = await loadGraphData(ws.root);
+    const depthLimit = Math.min(Math.max(options.depth ?? 2, 1), 10);
+    const maxNodes = Math.min(options.maxNodes ?? 150, 500);
+    if (!loaded.exists || !loaded.data) {
+        return {
+            available: false,
+            query,
+            depth: depthLimit,
+            matchedNode: null,
+            totalNodes: 0,
+            verifiedNodes: 0,
+            hypothesisNodes: 0,
+            nodes: [],
+            edges: [],
+            warnings: ['No Graphify graph found at graphify-out/graph.json. Run "/graphify ." in Claude Code.'],
+        };
+    }
+    const { nodes, edges } = loaded.data;
+    const startNode = findMatchingStartNode(nodes, query);
+    if (!startNode) {
+        return {
+            available: true,
+            query,
+            depth: depthLimit,
+            matchedNode: null,
+            totalNodes: 0,
+            verifiedNodes: 0,
+            hypothesisNodes: 0,
+            nodes: [],
+            edges: [],
+            warnings: [`No graph node found matching "${query}". Check node IDs with "devworkspace graph status".`],
+        };
+    }
+    // Build adjacency index
+    const outgoing = new Map();
+    const incoming = new Map();
+    for (const e of edges) {
+        if (!outgoing.has(e.source))
+            outgoing.set(e.source, []);
+        outgoing.get(e.source).push(e);
+        if (!incoming.has(e.target))
+            incoming.set(e.target, []);
+        incoming.get(e.target).push(e);
+    }
+    const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+    // Breadth-first search bounded by depthLimit
+    const visitedDepths = new Map();
+    const queue = [{ id: startNode.id, depth: 0 }];
+    visitedDepths.set(startNode.id, 0);
+    const collectedEdges = [];
+    while (queue.length > 0 && visitedDepths.size < maxNodes) {
+        const current = queue.shift();
+        if (current.depth >= depthLimit)
+            continue;
+        // Explore outgoing edges
+        const outEdges = outgoing.get(current.id) || [];
+        for (const edge of outEdges) {
+            collectedEdges.push(edge);
+            if (!visitedDepths.has(edge.target)) {
+                visitedDepths.set(edge.target, current.depth + 1);
+                queue.push({ id: edge.target, depth: current.depth + 1 });
+            }
+        }
+        // Explore incoming edges
+        const inEdges = incoming.get(current.id) || [];
+        for (const edge of inEdges) {
+            collectedEdges.push(edge);
+            if (!visitedDepths.has(edge.source)) {
+                visitedDepths.set(edge.source, current.depth + 1);
+                queue.push({ id: edge.source, depth: current.depth + 1 });
+            }
+        }
+    }
+    // Verify all traversed nodes against disk
+    const tracedNodes = [];
+    const nodeStatusMap = new Map();
+    for (const [nodeId, depth] of visitedDepths.entries()) {
+        const rawNode = nodeMap.get(nodeId) || { id: nodeId };
+        const verified = await verifyNode(ws.root, rawNode, depth);
+        tracedNodes.push(verified);
+        nodeStatusMap.set(nodeId, verified.status);
+    }
+    // Deduplicate and verify collected edges
+    const edgeKeys = new Set();
+    const tracedEdges = [];
+    for (const e of collectedEdges) {
+        if (!visitedDepths.has(e.source) || !visitedDepths.has(e.target))
+            continue;
+        const key = `${e.source}->${e.target}::${e.relation || e.type || ''}`;
+        if (edgeKeys.has(key))
+            continue;
+        edgeKeys.add(key);
+        const srcStatus = nodeStatusMap.get(e.source);
+        const tgtStatus = nodeStatusMap.get(e.target);
+        const edgeStatus = srcStatus === 'verified' && tgtStatus === 'verified' ? 'verified' : 'hypothesis';
+        tracedEdges.push({
+            source: e.source,
+            target: e.target,
+            relation: typeof e.relation === 'string' ? e.relation : typeof e.type === 'string' ? e.type : 'relates_to',
+            status: edgeStatus,
+        });
+    }
+    // Sort nodes by depth, then by path/name
+    tracedNodes.sort((a, b) => a.depth - b.depth || (a.path || a.id).localeCompare(b.path || b.id));
+    const matched = tracedNodes.find((n) => n.id === startNode.id) || null;
+    const verifiedCount = tracedNodes.filter((n) => n.status === 'verified').length;
+    const hypothesisCount = tracedNodes.filter((n) => n.status === 'hypothesis').length;
+    const warnings = [];
+    if (hypothesisCount > 0) {
+        warnings.push(`${hypothesisCount} node(s) or connected dependencies are unverified hypotheses (files or symbols missing on disk).`);
+    }
+    return {
+        available: true,
+        query,
+        depth: depthLimit,
+        matchedNode: matched,
+        totalNodes: tracedNodes.length,
+        verifiedNodes: verifiedCount,
+        hypothesisNodes: hypothesisCount,
+        nodes: tracedNodes,
+        edges: tracedEdges,
+        warnings,
+    };
+}
+//# sourceMappingURL=graph.js.map

package/dist/services/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/services/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAExD,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AA0EvD;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,IAAY;IAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,CAAC,MAAM,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACxC,CAAC;IAED,IAAI,GAAW,CAAC;IAChB,IAAI,CAAC;QACH,GAAG,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACzC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,IAAI,iBAAiB,CAAC,IAAI,EAAE,sCAAsC,KAAK,MAAO,CAAW,CAAC,OAAO,EAAE,EAAE;YACzG,IAAI,EAAE,oFAAoF;SAC3F,CAAC,CAAC;IACL,CAAC;IAED,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,iBAAiB,CAAC,QAAQ,EAAE,uBAAuB,KAAK,sBAAsB,EAAE;YACxF,IAAI,EAAE,iFAAiF;SACxF,CAAC,CAAC;IACL,CAAC;IAED,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3E,MAAM,IAAI,iBAAiB,CAAC,QAAQ,EAAE,uBAAuB,KAAK,+CAA+C,EAAE;YACjH,IAAI,EAAE,iDAAiD;SACxD,CAAC,CAAC;IACL,CAAC;IAED,MAAM,GAAG,GAAG,MAAsB,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACxD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAE/F,OAAO;QACL,MAAM,EAAE,IAAI;QACZ,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE;KACvB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,CAAiB;IAC3D,MAAM,EAAE,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAE5C,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnC,OAAO;YACL,SAAS,EAAE,KAAK;YAChB,SAAS,EAAE,MAAM,CAAC,IAAI;YACtB,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,CAAC;YACb,SAAS,EAAE,EAAE;YACb,OAAO,EAAE,+DAA+D;YACxE,IAAI,EAAE,yGAAyG;SAChH,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC;IACrC,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,SAAS,CAAC;QAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,OAAO;QACL,SAAS,EAAE,IAAI;QACf,SAAS,EAAE,MAAM,CAAC,IAAI;QACtB,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,SAAS;QACT,OAAO,EAAE,0BAA0B,KAAK,CAAC,MAAM,WAAW,KAAK,CAAC,MAAM,SAAS;KAChF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,IAAkB;IAC9C,0BAA0B;IAC1B,MAAM,OAAO,GAAG,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7G,IAAI,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/E,IAAI,MAAM,GAAkB,IAAI,CAAC;IAEjC,IAAI,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/E,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAC5B,CAAC;SAAM,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACxE,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,CAAC;IAED,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACtE,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,UAAU,CAAC,IAAY,EAAE,IAAkB,EAAE,KAAa;IACvE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;IAC/G,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;IAElE,IAAI,CAAC,OAAO,EAAE,CAAC;QACb,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI;YACJ,IAAI;YACJ,IAAI,EAAE,IAAI;YACV,MAAM;YACN,KAAK;YACL,MAAM,EAAE,YAAY;YACpB,UAAU,EAAE,KAAK;YACjB,WAAW,EAAE,IAAI;YACjB,MAAM,EAAE,qCAAqC;SAC9C,CAAC;IACJ,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,QAAQ,CAAC,CAAC;IAE1C,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI;YACJ,IAAI;YACJ,IAAI,EAAE,OAAO;YACb,MAAM;YACN,KAAK;YACL,MAAM,EAAE,YAAY;YACpB,UAAU,EAAE,KAAK;YACjB,WAAW,EAAE,IAAI;YACjB,MAAM,EAAE,SAAS,OAAO,qBAAqB;SAC9C,CAAC;IACJ,CAAC;IAED,IAAI,WAAW,GAAmB,IAAI,CAAC;IACvC,IAAI,MAAM,GAA2B,UAAU,CAAC;IAChD,IAAI,MAA0B,CAAC;IAE/B,IAAI,MAAM,EAAE,CAAC;QACX,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,eAAe,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACtD,IAAI,IAAI,EAAE,CAAC;gBACT,WAAW,GAAG,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC7C,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,MAAM,GAAG,YAAY,CAAC;oBACtB,MAAM,GAAG,WAAW,MAAM,mBAAmB,OAAO,GAAG,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,GAAG,YAAY,CAAC;YACtB,MAAM,GAAG,iCAAiC,OAAO,GAAG,CAAC;QACvD,CAAC;IACH,CAAC;IAED,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI;QACJ,IAAI;QACJ,IAAI,EAAE,OAAO;QACb,MAAM;QACN,KAAK;QACL,MAAM;QACN,UAAU,EAAE,IAAI;QAChB,WAAW;QACX,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC9B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAqB,EAAE,KAAa;IACxE,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAEpC,uBAAuB;IACvB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC;IAChH,IAAI,OAAO;QAAE,OAAO,OAAO,CAAC;IAE5B,iCAAiC;IACjC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACrE,OAAO,CAAC,KAAK,KAAK,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,IAAI,SAAS;QAAE,OAAO,SAAS,CAAC;IAEhC,mCAAmC;IACnC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QACjC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACrD,OAAO,IAAI,KAAK,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IACH,IAAI,SAAS;QAAE,OAAO,SAAS,CAAC;IAEhC,mCAAmC;IACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;QAChC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACrE,OAAO,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IACH,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE9B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,CAAiB,EACjB,KAAa,EACb,UAAiD,EAAE;IAEnD,MAAM,EAAE,GAAG,MAAM,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,MAAM,aAAa,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAE5C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;IAExD,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnC,OAAO;YACL,SAAS,EAAE,KAAK;YAChB,KAAK;YACL,KAAK,EAAE,UAAU;YACjB,WAAW,EAAE,IAAI;YACjB,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,CAAC;YAClB,KAAK,EAAE,EAAE;YACT,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,CAAC,uFAAuF,CAAC;SACpG,CAAC;IACJ,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC;IACrC,MAAM,SAAS,GAAG,qBAAqB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAEtD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO;YACL,SAAS,EAAE,IAAI;YACf,KAAK;YACL,KAAK,EAAE,UAAU;YACjB,WAAW,EAAE,IAAI;YACjB,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,CAAC;YAClB,KAAK,EAAE,EAAE;YACT,KAAK,EAAE,EAAE;YACT,QAAQ,EAAE,CAAC,iCAAiC,KAAK,qDAAqD,CAAC;SACxG,CAAC;IACJ,CAAC;IAED,wBAAwB;IACxB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;IAEnD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACxD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEhC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACxD,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAuB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3E,6CAA6C;IAC7C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,KAAK,GAAoC,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAChF,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAEnC,MAAM,cAAc,GAAmB,EAAE,CAAC;IAE1C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,IAAI,GAAG,QAAQ,EAAE,CAAC;QACzD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,IAAI,OAAO,CAAC,KAAK,IAAI,UAAU;YAAE,SAAS;QAE1C,yBAAyB;QACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC/C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAClD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkC,CAAC;IAEhE,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;QACtD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC;QACtD,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAC3D,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED,yCAAyC;IACzC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,WAAW,GAAiB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,SAAS;QAC3E,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;QACtE,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAChC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAElB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,UAAU,GAA2B,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC;QAE5H,WAAW,CAAC,IAAI,CAAC;YACf,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;YAC1G,MAAM,EAAE,UAAU;SACnB,CAAC,CAAC;IACL,CAAC;IAED,yCAAyC;IACzC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhG,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IACvE,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;IAChF,MAAM,eAAe,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC,MAAM,CAAC;IAEpF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;QACxB,QAAQ,CAAC,IAAI,CAAC,GAAG,eAAe,kGAAkG,CAAC,CAAC;IACtI,CAAC;IAED,OAAO;QACL,SAAS,EAAE,IAAI;QACf,KAAK;QACL,KAAK,EAAE,UAAU;QACjB,WAAW,EAAE,OAAO;QACpB,UAAU,EAAE,WAAW,CAAC,MAAM;QAC9B,aAAa,EAAE,aAAa;QAC5B,eAAe,EAAE,eAAe;QAChC,KAAK,EAAE,WAAW;QAClB,KAAK,EAAE,WAAW;QAClB,QAAQ;KACT,CAAC;AACJ,CAAC","sourcesContent":["import { promises as fs } from 'node:fs';\nimport path from 'node:path';\nimport { pathExists, readTextBounded } from '../utils/fs.js';\nimport { findSymbolInText } from '../features/validate.js';\nimport { requireWorkspace } from '../core/workspace.js';\nimport type { ServiceOptions } from './common.js';\nimport { DevWorkspaceError } from '../errors/index.js';\n\nexport type NodeVerificationStatus = 'verified' | 'hypothesis';\n\nexport interface RawGraphNode {\n  id: string;\n  name?: string;\n  label?: string;\n  type?: string;\n  path?: string;\n  file?: string;\n  [key: string]: unknown;\n}\n\nexport interface RawGraphEdge {\n  source: string;\n  target: string;\n  relation?: string;\n  type?: string;\n  label?: string;\n  weight?: number;\n  [key: string]: unknown;\n}\n\nexport interface RawGraphData {\n  nodes?: RawGraphNode[];\n  edges?: RawGraphEdge[];\n  links?: RawGraphEdge[];\n  [key: string]: unknown;\n}\n\nexport interface TracedNode {\n  id: string;\n  name: string;\n  type: string;\n  path: string | null;\n  symbol: string | null;\n  depth: number;\n  status: NodeVerificationStatus;\n  fileExists: boolean;\n  symbolFound: boolean | null;\n  reason?: string;\n}\n\nexport interface TracedEdge {\n  source: string;\n  target: string;\n  relation: string;\n  status: NodeVerificationStatus;\n}\n\nexport interface GraphStatusResult {\n  available: boolean;\n  graphPath: string;\n  nodesCount: number;\n  edgesCount: number;\n  nodeTypes: Record<string, number>;\n  message: string;\n  hint?: string;\n}\n\nexport interface GraphTraceResult {\n  available: boolean;\n  query: string;\n  depth: number;\n  matchedNode: TracedNode | null;\n  totalNodes: number;\n  verifiedNodes: number;\n  hypothesisNodes: number;\n  nodes: TracedNode[];\n  edges: TracedEdge[];\n  warnings: string[];\n}\n\n/**\n * Resolves the location of Graphify's output graph in the repository.\n */\nexport function getGraphPath(root: string): string {\n  return path.join(root, 'graphify-out', 'graph.json');\n}\n\n/**\n * Loads and validates Graphify graph JSON data safely.\n */\nexport async function loadGraphData(root: string): Promise<{ exists: boolean; path: string; data?: { nodes: RawGraphNode[]; edges: RawGraphEdge[] } }> {\n  const gPath = getGraphPath(root);\n  if (!(await pathExists(gPath))) {\n    return { exists: false, path: gPath };\n  }\n\n  let raw: string;\n  try {\n    raw = await fs.readFile(gPath, 'utf8');\n  } catch (e) {\n    throw new DevWorkspaceError('IO', `Failed to read Graphify output at \"${gPath}\": ${(e as Error).message}`, {\n      hint: 'Ensure graphify-out/graph.json is readable or regenerate with \"graphify update .\".',\n    });\n  }\n\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch {\n    throw new DevWorkspaceError('SCHEMA', `Graphify output at \"${gPath}\" is not valid JSON.`, {\n      hint: 'Regenerate the graph using \"graphify update .\" or \"/graphify .\" in Claude Code.',\n    });\n  }\n\n  if (typeof parsed !== 'object' || parsed === null || Array.isArray(parsed)) {\n    throw new DevWorkspaceError('SCHEMA', `Graphify output at \"${gPath}\" must be a JSON object with nodes and edges.`, {\n      hint: 'Regenerate the graph using \"graphify update .\".',\n    });\n  }\n\n  const obj = parsed as RawGraphData;\n  const nodes = Array.isArray(obj.nodes) ? obj.nodes : [];\n  const edges = Array.isArray(obj.edges) ? obj.edges : Array.isArray(obj.links) ? obj.links : [];\n\n  return {\n    exists: true,\n    path: gPath,\n    data: { nodes, edges },\n  };\n}\n\n/**\n * Reports the presence, size, and basic schema health of the Graphify graph.\n */\nexport async function getGraphStatusService(o: ServiceOptions): Promise<GraphStatusResult> {\n  const ws = await requireWorkspace(o.cwd);\n  const loaded = await loadGraphData(ws.root);\n\n  if (!loaded.exists || !loaded.data) {\n    return {\n      available: false,\n      graphPath: loaded.path,\n      nodesCount: 0,\n      edgesCount: 0,\n      nodeTypes: {},\n      message: 'No Graphify knowledge graph found at graphify-out/graph.json.',\n      hint: 'In Claude Code run \"/graphify .\" to build the graph, or run \"graphify update .\" if already initialized.',\n    };\n  }\n\n  const { nodes, edges } = loaded.data;\n  const nodeTypes: Record<string, number> = {};\n  for (const n of nodes) {\n    const t = n.type || 'unknown';\n    nodeTypes[t] = (nodeTypes[t] || 0) + 1;\n  }\n\n  return {\n    available: true,\n    graphPath: loaded.path,\n    nodesCount: nodes.length,\n    edgesCount: edges.length,\n    nodeTypes,\n    message: `Graphify graph loaded: ${nodes.length} nodes, ${edges.length} edges.`,\n  };\n}\n\n/**\n * Extracts a candidate file path and symbol from a node definition.\n */\nfunction extractPathAndSymbol(node: RawGraphNode): { relPath: string | null; symbol: string | null } {\n  // If explicitly declared:\n  const rawPath = typeof node.path === 'string' ? node.path : typeof node.file === 'string' ? node.file : null;\n  let relPath = rawPath ? rawPath.replace(/\\\\/g, '/').replace(/^\\/+/, '') : null;\n  let symbol: string | null = null;\n\n  if (node.id.includes('::')) {\n    const parts = node.id.split('::');\n    if (!relPath && parts[0] && (parts[0].includes('/') || parts[0].includes('.'))) {\n      relPath = parts[0].replace(/\\\\/g, '/').replace(/^\\/+/, '');\n    }\n    symbol = parts[1] || null;\n  } else if (!relPath && (node.id.includes('/') || node.id.includes('.'))) {\n    relPath = node.id.replace(/\\\\/g, '/').replace(/^\\/+/, '');\n  }\n\n  if (!symbol && typeof node.name === 'string' && node.name !== relPath) {\n    symbol = node.name;\n  }\n\n  return { relPath, symbol };\n}\n\n/**\n * Verifies whether a node's physical path and symbol exist on disk.\n */\nasync function verifyNode(root: string, node: RawGraphNode, depth: number): Promise<TracedNode> {\n  const { relPath, symbol } = extractPathAndSymbol(node);\n  const name = typeof node.name === 'string' ? node.name : typeof node.label === 'string' ? node.label : node.id;\n  const type = typeof node.type === 'string' ? node.type : 'symbol';\n\n  if (!relPath) {\n    return {\n      id: node.id,\n      name,\n      type,\n      path: null,\n      symbol,\n      depth,\n      status: 'hypothesis',\n      fileExists: false,\n      symbolFound: null,\n      reason: 'No source file associated with node',\n    };\n  }\n\n  const fullPath = path.join(root, ...relPath.split('/'));\n  const exists = await pathExists(fullPath);\n\n  if (!exists) {\n    return {\n      id: node.id,\n      name,\n      type,\n      path: relPath,\n      symbol,\n      depth,\n      status: 'hypothesis',\n      fileExists: false,\n      symbolFound: null,\n      reason: `File \"${relPath}\" not found on disk`,\n    };\n  }\n\n  let symbolFound: boolean | null = null;\n  let status: NodeVerificationStatus = 'verified';\n  let reason: string | undefined;\n\n  if (symbol) {\n    try {\n      const text = await readTextBounded(fullPath, 500_000);\n      if (text) {\n        symbolFound = findSymbolInText(text, symbol);\n        if (!symbolFound) {\n          status = 'hypothesis';\n          reason = `Symbol \"${symbol}\" not found in \"${relPath}\"`;\n        }\n      }\n    } catch {\n      status = 'hypothesis';\n      reason = `Could not inspect symbols in \"${relPath}\"`;\n    }\n  }\n\n  return {\n    id: node.id,\n    name,\n    type,\n    path: relPath,\n    symbol,\n    depth,\n    status,\n    fileExists: true,\n    symbolFound,\n    ...(reason ? { reason } : {}),\n  };\n}\n\n/**\n * Finds the starting node in a graph that matches the user's query.\n */\nexport function findMatchingStartNode(nodes: RawGraphNode[], query: string): RawGraphNode | null {\n  const q = query.trim().toLowerCase();\n  const qNorm = q.replace(/\\\\/g, '/');\n\n  // 1. Exact match on ID\n  const exactId = nodes.find((n) => n.id.toLowerCase() === q || n.id.toLowerCase().replace(/\\\\/g, '/') === qNorm);\n  if (exactId) return exactId;\n\n  // 2. Exact match on path or file\n  const exactPath = nodes.find((n) => {\n    const p = (n.path || n.file || '').toLowerCase().replace(/\\\\/g, '/');\n    return p === qNorm;\n  });\n  if (exactPath) return exactPath;\n\n  // 3. Exact match on name or symbol\n  const exactName = nodes.find((n) => {\n    const name = (n.name || n.label || '').toLowerCase();\n    return name === q;\n  });\n  if (exactName) return exactName;\n\n  // 4. Substring match on ID or path\n  const subMatch = nodes.find((n) => {\n    const id = n.id.toLowerCase().replace(/\\\\/g, '/');\n    const p = (n.path || n.file || '').toLowerCase().replace(/\\\\/g, '/');\n    return id.includes(qNorm) || p.includes(qNorm);\n  });\n  if (subMatch) return subMatch;\n\n  return null;\n}\n\n/**\n * Performs a bounded graph trace starting from a specified file or symbol node up to maxDepth.\n * Verifies every traversed node against the repository filesystem, marking unverified nodes\n * and edges as hypotheses.\n */\nexport async function traceGraphService(\n  o: ServiceOptions,\n  query: string,\n  options: { depth?: number; maxNodes?: number } = {},\n): Promise<GraphTraceResult> {\n  const ws = await requireWorkspace(o.cwd);\n  const loaded = await loadGraphData(ws.root);\n\n  const depthLimit = Math.min(Math.max(options.depth ?? 2, 1), 10);\n  const maxNodes = Math.min(options.maxNodes ?? 150, 500);\n\n  if (!loaded.exists || !loaded.data) {\n    return {\n      available: false,\n      query,\n      depth: depthLimit,\n      matchedNode: null,\n      totalNodes: 0,\n      verifiedNodes: 0,\n      hypothesisNodes: 0,\n      nodes: [],\n      edges: [],\n      warnings: ['No Graphify graph found at graphify-out/graph.json. Run \"/graphify .\" in Claude Code.'],\n    };\n  }\n\n  const { nodes, edges } = loaded.data;\n  const startNode = findMatchingStartNode(nodes, query);\n\n  if (!startNode) {\n    return {\n      available: true,\n      query,\n      depth: depthLimit,\n      matchedNode: null,\n      totalNodes: 0,\n      verifiedNodes: 0,\n      hypothesisNodes: 0,\n      nodes: [],\n      edges: [],\n      warnings: [`No graph node found matching \"${query}\". Check node IDs with \"devworkspace graph status\".`],\n    };\n  }\n\n  // Build adjacency index\n  const outgoing = new Map<string, RawGraphEdge[]>();\n  const incoming = new Map<string, RawGraphEdge[]>();\n\n  for (const e of edges) {\n    if (!outgoing.has(e.source)) outgoing.set(e.source, []);\n    outgoing.get(e.source)!.push(e);\n\n    if (!incoming.has(e.target)) incoming.set(e.target, []);\n    incoming.get(e.target)!.push(e);\n  }\n\n  const nodeMap = new Map<string, RawGraphNode>(nodes.map((n) => [n.id, n]));\n\n  // Breadth-first search bounded by depthLimit\n  const visitedDepths = new Map<string, number>();\n  const queue: { id: string; depth: number }[] = [{ id: startNode.id, depth: 0 }];\n  visitedDepths.set(startNode.id, 0);\n\n  const collectedEdges: RawGraphEdge[] = [];\n\n  while (queue.length > 0 && visitedDepths.size < maxNodes) {\n    const current = queue.shift()!;\n    if (current.depth >= depthLimit) continue;\n\n    // Explore outgoing edges\n    const outEdges = outgoing.get(current.id) || [];\n    for (const edge of outEdges) {\n      collectedEdges.push(edge);\n      if (!visitedDepths.has(edge.target)) {\n        visitedDepths.set(edge.target, current.depth + 1);\n        queue.push({ id: edge.target, depth: current.depth + 1 });\n      }\n    }\n\n    // Explore incoming edges\n    const inEdges = incoming.get(current.id) || [];\n    for (const edge of inEdges) {\n      collectedEdges.push(edge);\n      if (!visitedDepths.has(edge.source)) {\n        visitedDepths.set(edge.source, current.depth + 1);\n        queue.push({ id: edge.source, depth: current.depth + 1 });\n      }\n    }\n  }\n\n  // Verify all traversed nodes against disk\n  const tracedNodes: TracedNode[] = [];\n  const nodeStatusMap = new Map<string, NodeVerificationStatus>();\n\n  for (const [nodeId, depth] of visitedDepths.entries()) {\n    const rawNode = nodeMap.get(nodeId) || { id: nodeId };\n    const verified = await verifyNode(ws.root, rawNode, depth);\n    tracedNodes.push(verified);\n    nodeStatusMap.set(nodeId, verified.status);\n  }\n\n  // Deduplicate and verify collected edges\n  const edgeKeys = new Set<string>();\n  const tracedEdges: TracedEdge[] = [];\n\n  for (const e of collectedEdges) {\n    if (!visitedDepths.has(e.source) || !visitedDepths.has(e.target)) continue;\n    const key = `${e.source}->${e.target}::${e.relation || e.type || ''}`;\n    if (edgeKeys.has(key)) continue;\n    edgeKeys.add(key);\n\n    const srcStatus = nodeStatusMap.get(e.source);\n    const tgtStatus = nodeStatusMap.get(e.target);\n    const edgeStatus: NodeVerificationStatus = srcStatus === 'verified' && tgtStatus === 'verified' ? 'verified' : 'hypothesis';\n\n    tracedEdges.push({\n      source: e.source,\n      target: e.target,\n      relation: typeof e.relation === 'string' ? e.relation : typeof e.type === 'string' ? e.type : 'relates_to',\n      status: edgeStatus,\n    });\n  }\n\n  // Sort nodes by depth, then by path/name\n  tracedNodes.sort((a, b) => a.depth - b.depth || (a.path || a.id).localeCompare(b.path || b.id));\n\n  const matched = tracedNodes.find((n) => n.id === startNode.id) || null;\n  const verifiedCount = tracedNodes.filter((n) => n.status === 'verified').length;\n  const hypothesisCount = tracedNodes.filter((n) => n.status === 'hypothesis').length;\n\n  const warnings: string[] = [];\n  if (hypothesisCount > 0) {\n    warnings.push(`${hypothesisCount} node(s) or connected dependencies are unverified hypotheses (files or symbols missing on disk).`);\n  }\n\n  return {\n    available: true,\n    query,\n    depth: depthLimit,\n    matchedNode: matched,\n    totalNodes: tracedNodes.length,\n    verifiedNodes: verifiedCount,\n    hypothesisNodes: hypothesisCount,\n    nodes: tracedNodes,\n    edges: tracedEdges,\n    warnings,\n  };\n}\n\n"]}

package/dist/services/refresh.js

@@ -4,6 +4,8 @@ import { loadProject } from '../core/workspace.js';
 import { readVersioned, writeVersioned } from '../core/versioned.js';
 import { packageVersion } from '../core/version.js';
 import { applyStaleness, evaluateStaleness, loadFacts, saveFacts } from '../knowledge/facts.js';
+import { loadFeatures, saveFeatures } from './features.js';
+import { validateFeature } from '../features/validate.js';
 import { buildRefreshPrompt } from '../prompts/refresh.js';
 import { pathExists, sha256Text, writeJsonIfChanged, writeTextIfChanged } from '../utils/fs.js';
 import { applyDetectorFacts, runDiscovery, writeCommands } from './analysis.js';
@@ -42,6 +44,19 @@ export async function refreshWorkspace(o) {
         const facts = await loadFacts(ws);
         const rep = await applyStaleness(ws.root, facts, now);
         await saveFacts(ws, facts);
+        if (await pathExists(ws.features)) {
+            try {
+                const featuresFile = await loadFeatures(ws);
+                for (const feat of featuresFile.features) {
+                    const checked = await validateFeature(ws.root, feat);
+                    feat.status = checked.status;
+                }
+                await saveFeatures(ws, featuresFile);
+            }
+            catch {
+                // preserve existing features on error
+            }
+        }
         const stale = facts.facts.filter((f) => f.status === 'STALE' && f.sourceType !== 'detector').map((f) => ({ key: f.key, value: f.value, reason: f.staleReason ?? 'evidence changed' }));
         let prompt = null;
         if (stale.length > 0 || rep.needsReview.length > 0) {