@harness-engineering/graph 0.8.0 → 0.10.0

package/dist/index.d.mts

@@ -497,6 +497,16 @@ declare function resolveSkipDirs(options?: {
     skipDirs?: Iterable<string>;
     additionalSkipDirs?: Iterable<string>;
 }): ReadonlySet<string>;
+/**
+ * Convert a skip-dirs set into minimatch glob patterns of the form
+ * `**\/<name>/\**`. Use for tools that exclude via globs (security scan, doc
+ * coverage, entropy analysis) rather than by reading directory names during
+ * traversal. Defaults to {@link DEFAULT_SKIP_DIRS}.
+ *
+ * Returns a fresh array each call so callers may freely mutate/append
+ * domain-specific patterns (e.g. test/fixture file globs).
+ */
+declare function skipDirGlobs(skipDirs?: ReadonlySet<string>): string[];
 
 type GitRunner = (rootDir: string, args: string[]) => Promise<string>;
 /**
@@ -544,11 +554,13 @@ declare class KnowledgeIngestor {
     ingestADRs(adrDir: string): Promise<IngestResult>;
     ingestLearnings(projectPath: string): Promise<IngestResult>;
     ingestFailures(projectPath: string): Promise<IngestResult>;
+    ingestGeneralDocs(projectPath: string): Promise<IngestResult>;
     ingestAll(projectPath: string, opts?: {
         adrDir?: string;
     }): Promise<IngestResult>;
     private linkToCode;
     private findMarkdownFiles;
+    private scanDocsDir;
 }
 
 declare class BusinessKnowledgeIngestor {
@@ -1766,6 +1778,28 @@ interface DesignViolation {
     suggestion?: string;
 }
 type DesignStrictness = 'strict' | 'standard' | 'permissive';
+/**
+ * Generic finding shape accepted by `recordFindings()` — covers ANAT-*
+ * (audit-component-anatomy, design-pipeline #2) and CRAFT-*
+ * (harness-design-craft, design-pipeline #6) namespaces. Skills convert
+ * their internal finding types into this shape before recording.
+ */
+interface CraftFindingRecord {
+    /** Finding code, e.g. "ANAT-D023", "CRAFT-C001", "CRAFT-P001" */
+    code: string;
+    /** Project-relative file path (becomes the `file` node id) */
+    file: string;
+    /** Line number, if known */
+    line?: number;
+    /** Human-readable message */
+    message: string;
+    /** Severity at emission time */
+    severity: 'error' | 'warn' | 'info';
+    /** Optional evidence snippet */
+    evidence?: string;
+    /** Optional run identifier so #4 verifier can detect fixpoint across runs */
+    runId?: string;
+}
 declare class DesignConstraintAdapter {
     private readonly store;
     constructor(store: GraphStore);
@@ -1773,6 +1807,30 @@ declare class DesignConstraintAdapter {
     checkForHardcodedFonts(source: string, file: string, strictness?: DesignStrictness): DesignViolation[];
     checkAll(source: string, file: string, strictness?: DesignStrictness): DesignViolation[];
     private mapSeverity;
+    /**
+     * Record externally-computed craft findings (audit-component-anatomy,
+     * harness-design-craft, etc.) as graph state. Idempotent — re-running on
+     * the same findings produces no duplicate nodes or edges thanks to
+     * GraphStore's keyed merge semantics.
+     *
+     * Each finding becomes:
+     *   • a `design_constraint` node keyed by finding code (created lazily
+     *     if absent; metadata merged on re-record so the most recent message
+     *     / severity wins)
+     *   • a `violates_design` edge from the source file (id = file path) to
+     *     the constraint node, with per-finding metadata (line, severity,
+     *     message, evidence, runId)
+     *
+     * The file node is NOT created here — it's assumed to already exist in
+     * the graph from a prior ingest. If it does not, the edge will still be
+     * created (graph stores edges by key, not by referential integrity) and
+     * a subsequent ingest will populate the file node.
+     */
+    recordFindings(findings: readonly CraftFindingRecord[]): {
+        constraintsAdded: number;
+        edgesAdded: number;
+    };
+    private labelForCode;
 }
 
 interface GraphImpactData {
@@ -1969,6 +2027,6 @@ declare class CascadeSimulator {
     private buildResult;
 }
 
-declare const VERSION = "0.6.0";
+declare const VERSION = "0.9.0";
 
-export { ALL_EXTRACTORS, type AggregateResult, type AnomalyDetectionOptions, type AnomalyReport, ApiPathExtractor, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, BusinessKnowledgeIngestor, CIConnector, CURRENT_SCHEMA_VERSION, type PackedEnvelope as CacheableEnvelope, type CascadeLayer, type CascadeNode, type CascadeResult, type CascadeSimulationOptions, CascadeSimulator, type ClassificationResult, CodeIngestor, type CodeIngestorOptions, CompositeProbabilityStrategy, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, type ConflictType, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, type Contradiction, ContradictionDetector, type ContradictionEntry, type ContradictionResult, type CoverageReport, CoverageScorer, D2Parser, DEFAULT_BLOCKLIST, DEFAULT_PATTERNS, DEFAULT_SKIP_DIRS, DecisionIngestor, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, type DetectedElement, type DiagramEntity, type DiagramFormatParser, type DiagramParseResult, DiagramParser, type DiagramRelationship, type DomainCoverage, type DomainCoverageScore, type DomainInferenceOptions, type DriftClassification, type DriftDetector, type DriftFinding, type DriftResult, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, EnumConstantExtractor, type ExtractionCounts, type ExtractionRecord, ExtractionRunner, FigmaConnector, FusionLayer, type FusionResult, type GapEntry, type GapReport, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, type GraphStabilityTier, GraphStore, type HttpClient, INTENTS, ImageAnalysisExtractor, type ImageAnalysisExtractorOptions, type AnalysisProvider as ImageAnalysisProvider, type ImageAnalysisResult, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeDocMaterializer, KnowledgeIngestor, type KnowledgePipelineOptions, type KnowledgePipelineResult, KnowledgePipelineRunner, type KnowledgeSnapshot, type KnowledgeSnapshotEntry, KnowledgeStagingAggregator, type Language, type LinkResult, type LoadGraphResult, type LoadMetadataResult, type MaterializeOptions, type MaterializeResult, type MaterializedDoc, MermaidParser, MiroConnector, NODE_STABILITY, NODE_TYPES, type NodeCategory, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, PackedSummaryCache, type PairResult, PlantUmlParser, type ProbabilityStrategy, type ProjectionSpec, type RequirementCoverage, RequirementIngestor, type ResolvedEntity, ResponseFormatter, type SignalExtractor, type SkippedEntry, SlackConnector, type SourceLocation, type StagedEntry, type StatisticalOutlier, StructuralDriftDetector, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TestDescriptionExtractor, TopologicalLinker, type TraceabilityOptions, type TraceabilityResult, type TracedFile, VERSION, ValidationRuleExtractor, type VectorSearchResult, VectorStore, askGraph, classifyNodeCategory, createExtractionRunner, detectLanguage, groupNodesByImpact, inferDomain, linkToCode, loadGraph, loadGraphMetadata, normalizeIntent, project, queryTraceability, resolveSkipDirs, saveGraph };
+export { ALL_EXTRACTORS, type AggregateResult, type AnomalyDetectionOptions, type AnomalyReport, ApiPathExtractor, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, BusinessKnowledgeIngestor, CIConnector, CURRENT_SCHEMA_VERSION, type PackedEnvelope as CacheableEnvelope, type CascadeLayer, type CascadeNode, type CascadeResult, type CascadeSimulationOptions, CascadeSimulator, type ClassificationResult, CodeIngestor, type CodeIngestorOptions, CompositeProbabilityStrategy, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, type ConflictType, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, type Contradiction, ContradictionDetector, type ContradictionEntry, type ContradictionResult, type CoverageReport, CoverageScorer, type CraftFindingRecord, D2Parser, DEFAULT_BLOCKLIST, DEFAULT_PATTERNS, DEFAULT_SKIP_DIRS, DecisionIngestor, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, type DetectedElement, type DiagramEntity, type DiagramFormatParser, type DiagramParseResult, DiagramParser, type DiagramRelationship, type DomainCoverage, type DomainCoverageScore, type DomainInferenceOptions, type DriftClassification, type DriftDetector, type DriftFinding, type DriftResult, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, EnumConstantExtractor, type ExtractionCounts, type ExtractionRecord, ExtractionRunner, FigmaConnector, FusionLayer, type FusionResult, type GapEntry, type GapReport, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, type GraphStabilityTier, GraphStore, type HttpClient, INTENTS, ImageAnalysisExtractor, type ImageAnalysisExtractorOptions, type AnalysisProvider as ImageAnalysisProvider, type ImageAnalysisResult, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeDocMaterializer, KnowledgeIngestor, type KnowledgePipelineOptions, type KnowledgePipelineResult, KnowledgePipelineRunner, type KnowledgeSnapshot, type KnowledgeSnapshotEntry, KnowledgeStagingAggregator, type Language, type LinkResult, type LoadGraphResult, type LoadMetadataResult, type MaterializeOptions, type MaterializeResult, type MaterializedDoc, MermaidParser, MiroConnector, NODE_STABILITY, NODE_TYPES, type NodeCategory, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, PackedSummaryCache, type PairResult, PlantUmlParser, type ProbabilityStrategy, type ProjectionSpec, type RequirementCoverage, RequirementIngestor, type ResolvedEntity, ResponseFormatter, type SignalExtractor, type SkippedEntry, SlackConnector, type SourceLocation, type StagedEntry, type StatisticalOutlier, StructuralDriftDetector, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TestDescriptionExtractor, TopologicalLinker, type TraceabilityOptions, type TraceabilityResult, type TracedFile, VERSION, ValidationRuleExtractor, type VectorSearchResult, VectorStore, askGraph, classifyNodeCategory, createExtractionRunner, detectLanguage, groupNodesByImpact, inferDomain, linkToCode, loadGraph, loadGraphMetadata, normalizeIntent, project, queryTraceability, resolveSkipDirs, saveGraph, skipDirGlobs };

package/dist/index.d.ts

@@ -497,6 +497,16 @@ declare function resolveSkipDirs(options?: {
     skipDirs?: Iterable<string>;
     additionalSkipDirs?: Iterable<string>;
 }): ReadonlySet<string>;
+/**
+ * Convert a skip-dirs set into minimatch glob patterns of the form
+ * `**\/<name>/\**`. Use for tools that exclude via globs (security scan, doc
+ * coverage, entropy analysis) rather than by reading directory names during
+ * traversal. Defaults to {@link DEFAULT_SKIP_DIRS}.
+ *
+ * Returns a fresh array each call so callers may freely mutate/append
+ * domain-specific patterns (e.g. test/fixture file globs).
+ */
+declare function skipDirGlobs(skipDirs?: ReadonlySet<string>): string[];
 
 type GitRunner = (rootDir: string, args: string[]) => Promise<string>;
 /**
@@ -544,11 +554,13 @@ declare class KnowledgeIngestor {
     ingestADRs(adrDir: string): Promise<IngestResult>;
     ingestLearnings(projectPath: string): Promise<IngestResult>;
     ingestFailures(projectPath: string): Promise<IngestResult>;
+    ingestGeneralDocs(projectPath: string): Promise<IngestResult>;
     ingestAll(projectPath: string, opts?: {
         adrDir?: string;
     }): Promise<IngestResult>;
     private linkToCode;
     private findMarkdownFiles;
+    private scanDocsDir;
 }
 
 declare class BusinessKnowledgeIngestor {
@@ -1766,6 +1778,28 @@ interface DesignViolation {
     suggestion?: string;
 }
 type DesignStrictness = 'strict' | 'standard' | 'permissive';
+/**
+ * Generic finding shape accepted by `recordFindings()` — covers ANAT-*
+ * (audit-component-anatomy, design-pipeline #2) and CRAFT-*
+ * (harness-design-craft, design-pipeline #6) namespaces. Skills convert
+ * their internal finding types into this shape before recording.
+ */
+interface CraftFindingRecord {
+    /** Finding code, e.g. "ANAT-D023", "CRAFT-C001", "CRAFT-P001" */
+    code: string;
+    /** Project-relative file path (becomes the `file` node id) */
+    file: string;
+    /** Line number, if known */
+    line?: number;
+    /** Human-readable message */
+    message: string;
+    /** Severity at emission time */
+    severity: 'error' | 'warn' | 'info';
+    /** Optional evidence snippet */
+    evidence?: string;
+    /** Optional run identifier so #4 verifier can detect fixpoint across runs */
+    runId?: string;
+}
 declare class DesignConstraintAdapter {
     private readonly store;
     constructor(store: GraphStore);
@@ -1773,6 +1807,30 @@ declare class DesignConstraintAdapter {
     checkForHardcodedFonts(source: string, file: string, strictness?: DesignStrictness): DesignViolation[];
     checkAll(source: string, file: string, strictness?: DesignStrictness): DesignViolation[];
     private mapSeverity;
+    /**
+     * Record externally-computed craft findings (audit-component-anatomy,
+     * harness-design-craft, etc.) as graph state. Idempotent — re-running on
+     * the same findings produces no duplicate nodes or edges thanks to
+     * GraphStore's keyed merge semantics.
+     *
+     * Each finding becomes:
+     *   • a `design_constraint` node keyed by finding code (created lazily
+     *     if absent; metadata merged on re-record so the most recent message
+     *     / severity wins)
+     *   • a `violates_design` edge from the source file (id = file path) to
+     *     the constraint node, with per-finding metadata (line, severity,
+     *     message, evidence, runId)
+     *
+     * The file node is NOT created here — it's assumed to already exist in
+     * the graph from a prior ingest. If it does not, the edge will still be
+     * created (graph stores edges by key, not by referential integrity) and
+     * a subsequent ingest will populate the file node.
+     */
+    recordFindings(findings: readonly CraftFindingRecord[]): {
+        constraintsAdded: number;
+        edgesAdded: number;
+    };
+    private labelForCode;
 }
 
 interface GraphImpactData {
@@ -1969,6 +2027,6 @@ declare class CascadeSimulator {
     private buildResult;
 }
 
-declare const VERSION = "0.6.0";
+declare const VERSION = "0.9.0";
 
-export { ALL_EXTRACTORS, type AggregateResult, type AnomalyDetectionOptions, type AnomalyReport, ApiPathExtractor, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, BusinessKnowledgeIngestor, CIConnector, CURRENT_SCHEMA_VERSION, type PackedEnvelope as CacheableEnvelope, type CascadeLayer, type CascadeNode, type CascadeResult, type CascadeSimulationOptions, CascadeSimulator, type ClassificationResult, CodeIngestor, type CodeIngestorOptions, CompositeProbabilityStrategy, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, type ConflictType, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, type Contradiction, ContradictionDetector, type ContradictionEntry, type ContradictionResult, type CoverageReport, CoverageScorer, D2Parser, DEFAULT_BLOCKLIST, DEFAULT_PATTERNS, DEFAULT_SKIP_DIRS, DecisionIngestor, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, type DetectedElement, type DiagramEntity, type DiagramFormatParser, type DiagramParseResult, DiagramParser, type DiagramRelationship, type DomainCoverage, type DomainCoverageScore, type DomainInferenceOptions, type DriftClassification, type DriftDetector, type DriftFinding, type DriftResult, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, EnumConstantExtractor, type ExtractionCounts, type ExtractionRecord, ExtractionRunner, FigmaConnector, FusionLayer, type FusionResult, type GapEntry, type GapReport, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, type GraphStabilityTier, GraphStore, type HttpClient, INTENTS, ImageAnalysisExtractor, type ImageAnalysisExtractorOptions, type AnalysisProvider as ImageAnalysisProvider, type ImageAnalysisResult, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeDocMaterializer, KnowledgeIngestor, type KnowledgePipelineOptions, type KnowledgePipelineResult, KnowledgePipelineRunner, type KnowledgeSnapshot, type KnowledgeSnapshotEntry, KnowledgeStagingAggregator, type Language, type LinkResult, type LoadGraphResult, type LoadMetadataResult, type MaterializeOptions, type MaterializeResult, type MaterializedDoc, MermaidParser, MiroConnector, NODE_STABILITY, NODE_TYPES, type NodeCategory, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, PackedSummaryCache, type PairResult, PlantUmlParser, type ProbabilityStrategy, type ProjectionSpec, type RequirementCoverage, RequirementIngestor, type ResolvedEntity, ResponseFormatter, type SignalExtractor, type SkippedEntry, SlackConnector, type SourceLocation, type StagedEntry, type StatisticalOutlier, StructuralDriftDetector, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TestDescriptionExtractor, TopologicalLinker, type TraceabilityOptions, type TraceabilityResult, type TracedFile, VERSION, ValidationRuleExtractor, type VectorSearchResult, VectorStore, askGraph, classifyNodeCategory, createExtractionRunner, detectLanguage, groupNodesByImpact, inferDomain, linkToCode, loadGraph, loadGraphMetadata, normalizeIntent, project, queryTraceability, resolveSkipDirs, saveGraph };
+export { ALL_EXTRACTORS, type AggregateResult, type AnomalyDetectionOptions, type AnomalyReport, ApiPathExtractor, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, BusinessKnowledgeIngestor, CIConnector, CURRENT_SCHEMA_VERSION, type PackedEnvelope as CacheableEnvelope, type CascadeLayer, type CascadeNode, type CascadeResult, type CascadeSimulationOptions, CascadeSimulator, type ClassificationResult, CodeIngestor, type CodeIngestorOptions, CompositeProbabilityStrategy, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, type ConflictType, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, type Contradiction, ContradictionDetector, type ContradictionEntry, type ContradictionResult, type CoverageReport, CoverageScorer, type CraftFindingRecord, D2Parser, DEFAULT_BLOCKLIST, DEFAULT_PATTERNS, DEFAULT_SKIP_DIRS, DecisionIngestor, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, type DetectedElement, type DiagramEntity, type DiagramFormatParser, type DiagramParseResult, DiagramParser, type DiagramRelationship, type DomainCoverage, type DomainCoverageScore, type DomainInferenceOptions, type DriftClassification, type DriftDetector, type DriftFinding, type DriftResult, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, EnumConstantExtractor, type ExtractionCounts, type ExtractionRecord, ExtractionRunner, FigmaConnector, FusionLayer, type FusionResult, type GapEntry, type GapReport, GitIngestor, type GitRunner, GraphAnomalyAdapter, type GraphBudget, GraphComplexityAdapter, type GraphComplexityHotspot, type GraphComplexityResult, type GraphConnector, GraphConstraintAdapter, GraphCouplingAdapter, type GraphCouplingFileData, type GraphCouplingResult, type GraphCoverageReport, type GraphDeadCodeData, type GraphDependencyData, type GraphDriftData, type GraphEdge, GraphEdgeSchema, GraphEntropyAdapter, GraphFeedbackAdapter, type GraphFilterResult, type GraphHarnessCheckData, type GraphImpactData, type GraphLayerViolation, type GraphMetadata, type GraphNode, GraphNodeSchema, type GraphSnapshotSummary, type GraphStabilityTier, GraphStore, type HttpClient, INTENTS, ImageAnalysisExtractor, type ImageAnalysisExtractorOptions, type AnalysisProvider as ImageAnalysisProvider, type ImageAnalysisResult, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeDocMaterializer, KnowledgeIngestor, type KnowledgePipelineOptions, type KnowledgePipelineResult, KnowledgePipelineRunner, type KnowledgeSnapshot, type KnowledgeSnapshotEntry, KnowledgeStagingAggregator, type Language, type LinkResult, type LoadGraphResult, type LoadMetadataResult, type MaterializeOptions, type MaterializeResult, type MaterializedDoc, MermaidParser, MiroConnector, NODE_STABILITY, NODE_TYPES, type NodeCategory, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, PackedSummaryCache, type PairResult, PlantUmlParser, type ProbabilityStrategy, type ProjectionSpec, type RequirementCoverage, RequirementIngestor, type ResolvedEntity, ResponseFormatter, type SignalExtractor, type SkippedEntry, SlackConnector, type SourceLocation, type StagedEntry, type StatisticalOutlier, StructuralDriftDetector, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TestDescriptionExtractor, TopologicalLinker, type TraceabilityOptions, type TraceabilityResult, type TracedFile, VERSION, ValidationRuleExtractor, type VectorSearchResult, VectorStore, askGraph, classifyNodeCategory, createExtractionRunner, detectLanguage, groupNodesByImpact, inferDomain, linkToCode, loadGraph, loadGraphMetadata, normalizeIntent, project, queryTraceability, resolveSkipDirs, saveGraph, skipDirGlobs };

package/dist/index.js

@@ -108,7 +108,8 @@ __export(index_exports, {
   project: () => project,
   queryTraceability: () => queryTraceability,
   resolveSkipDirs: () => resolveSkipDirs,
-  saveGraph: () => saveGraph
+  saveGraph: () => saveGraph,
+  skipDirGlobs: () => skipDirGlobs
 });
 module.exports = __toCommonJS(index_exports);
 
@@ -978,6 +979,9 @@ function resolveSkipDirs(options) {
   }
   return base;
 }
+function skipDirGlobs(skipDirs = DEFAULT_SKIP_DIRS) {
+  return Array.from(skipDirs, (name) => `**/${name}/**`);
+}
 
 // src/ingest/CodeIngestor.ts
 var SKIP_METHOD_NAMES = /* @__PURE__ */ new Set(["constructor", "if", "for", "while", "switch"]);
@@ -2005,6 +2009,7 @@ function emptyResult(durationMs = 0) {
 
 // src/ingest/KnowledgeIngestor.ts
 var CODE_NODE_TYPES = ["file", "function", "class", "method", "interface", "variable"];
+var DOCS_OWNED_BY_OTHER_INGESTORS = /* @__PURE__ */ new Set(["adr", "knowledge", "changes", "solutions"]);
 var KnowledgeIngestor = class {
   constructor(store) {
     this.store = store;
@@ -2076,15 +2081,53 @@ var KnowledgeIngestor = class {
     }
     return buildResult(nodesAdded, edgesAdded, [], start);
   }
+  async ingestGeneralDocs(projectPath) {
+    const start = Date.now();
+    const errors = [];
+    let nodesAdded = 0;
+    let edgesAdded = 0;
+    const files = /* @__PURE__ */ new Set();
+    try {
+      const entries = await fs2.readdir(projectPath, { withFileTypes: true });
+      for (const entry of entries) {
+        if (entry.isFile() && entry.name.endsWith(".md")) {
+          files.add(path3.join(projectPath, entry.name));
+        }
+      }
+    } catch {
+      return emptyResult(Date.now() - start);
+    }
+    const docsRoot = path3.join(projectPath, "docs");
+    try {
+      const scanned = await this.scanDocsDir(docsRoot);
+      for (const f of scanned) files.add(f);
+    } catch {
+    }
+    for (const filePath of files) {
+      try {
+        const content = await fs2.readFile(filePath, "utf-8");
+        const relPath = path3.relative(projectPath, filePath).replaceAll("\\", "/");
+        const nodeId = `doc:${relPath}`;
+        if (this.store.getNode(nodeId)) continue;
+        this.store.addNode(parseDocumentNode(nodeId, filePath, relPath, content));
+        nodesAdded++;
+        edgesAdded += this.linkToCode(content, nodeId, "documents");
+      } catch (err) {
+        errors.push(`${filePath}: ${err instanceof Error ? err.message : String(err)}`);
+      }
+    }
+    return buildResult(nodesAdded, edgesAdded, errors, start);
+  }
   async ingestAll(projectPath, opts) {
     const start = Date.now();
     const adrDir = opts?.adrDir ?? path3.join(projectPath, "docs", "adr");
-    const [adrResult, learningsResult, failuresResult] = await Promise.all([
+    const [adrResult, learningsResult, failuresResult, docsResult] = await Promise.all([
       this.ingestADRs(adrDir),
       this.ingestLearnings(projectPath),
-      this.ingestFailures(projectPath)
+      this.ingestFailures(projectPath),
+      this.ingestGeneralDocs(projectPath)
     ]);
-    const merged = mergeResults(adrResult, learningsResult, failuresResult);
+    const merged = mergeResults(adrResult, learningsResult, failuresResult, docsResult);
     return { ...merged, durationMs: Date.now() - start };
   }
   linkToCode(content, sourceNodeId, edgeType) {
@@ -2119,7 +2162,22 @@ var KnowledgeIngestor = class {
     const entries = await fs2.readdir(dir, { withFileTypes: true });
     for (const entry of entries) {
       const fullPath = path3.join(dir, entry.name);
-      if (entry.isDirectory() && entry.name !== "node_modules" && entry.name !== "dist" && entry.name !== "target" && entry.name !== "build" && entry.name !== ".git" && entry.name !== ".gradle" && entry.name !== ".harness" && entry.name !== "vendor" && entry.name !== "bin" && entry.name !== "obj" && entry.name !== "venv" && entry.name !== "_build" && entry.name !== "deps" && entry.name !== "coverage") {
+      if (entry.isDirectory() && !DEFAULT_SKIP_DIRS.has(entry.name)) {
+        results.push(...await this.findMarkdownFiles(fullPath));
+      } else if (entry.isFile() && entry.name.endsWith(".md")) {
+        results.push(fullPath);
+      }
+    }
+    return results;
+  }
+  async scanDocsDir(docsRoot) {
+    const results = [];
+    const rootEntries = await fs2.readdir(docsRoot, { withFileTypes: true });
+    for (const entry of rootEntries) {
+      const fullPath = path3.join(docsRoot, entry.name);
+      if (entry.isDirectory()) {
+        if (DEFAULT_SKIP_DIRS.has(entry.name)) continue;
+        if (DOCS_OWNED_BY_OTHER_INGESTORS.has(entry.name)) continue;
         results.push(...await this.findMarkdownFiles(fullPath));
       } else if (entry.isFile() && entry.name.endsWith(".md")) {
         results.push(fullPath);
@@ -2145,6 +2203,17 @@ function buildResult(nodesAdded, edgesAdded, errors, start) {
     durationMs: Date.now() - start
   };
 }
+function parseDocumentNode(nodeId, filePath, relPath, content) {
+  const titleMatch = content.match(/^#\s+(.+)$/m);
+  const title = titleMatch ? titleMatch[1].trim() : path3.basename(filePath, ".md");
+  return {
+    id: nodeId,
+    type: "document",
+    name: title,
+    path: filePath,
+    metadata: { relPath }
+  };
+}
 function parseADRNode(nodeId, filePath, filename, content) {
   const titleMatch = content.match(/^#\s+(.+)$/m);
   const title = titleMatch ? titleMatch[1].trim() : filename;
@@ -2431,7 +2500,7 @@ var BusinessKnowledgeIngestor = class {
     const entries = await fs3.readdir(dir, { withFileTypes: true });
     for (const entry of entries) {
       const fullPath = path4.join(dir, entry.name);
-      if (entry.isDirectory() && entry.name !== "node_modules" && entry.name !== "dist" && entry.name !== "target" && entry.name !== "build" && entry.name !== ".git" && entry.name !== ".gradle" && entry.name !== ".harness" && entry.name !== "vendor" && entry.name !== "bin" && entry.name !== "obj" && entry.name !== "venv" && entry.name !== "_build" && entry.name !== "deps" && entry.name !== "coverage") {
+      if (entry.isDirectory() && !DEFAULT_SKIP_DIRS.has(entry.name)) {
         results.push(...await this.findMarkdownFiles(fullPath));
       } else if (entry.isFile() && entry.name.endsWith(".md")) {
         results.push(fullPath);
@@ -3275,7 +3344,6 @@ var PlantUmlParser = class {
 
 // src/ingest/DiagramParser.ts
 var DIAGRAM_EXTENSIONS = /* @__PURE__ */ new Set([".mmd", ".mermaid", ".d2", ".puml", ".plantuml"]);
-var SKIP_DIRS = /* @__PURE__ */ new Set(["node_modules", ".git", "dist", "build", ".harness"]);
 var DiagramParser = class {
   constructor(store) {
     this.store = store;
@@ -3380,7 +3448,7 @@ var DiagramParser = class {
       }
       for (const entry of entries) {
         if (entry.isDirectory()) {
-          if (!SKIP_DIRS.has(entry.name)) {
+          if (!DEFAULT_SKIP_DIRS.has(entry.name)) {
             await walk(path7.join(currentDir, entry.name));
           }
         } else if (entry.isFile()) {
@@ -3904,31 +3972,6 @@ var KnowledgeStagingAggregator = class {
 // src/ingest/extractors/ExtractionRunner.ts
 var fs9 = __toESM(require("fs/promises"));
 var path10 = __toESM(require("path"));
-var SKIP_DIRS2 = /* @__PURE__ */ new Set([
-  "node_modules",
-  "dist",
-  "target",
-  "build",
-  ".git",
-  "__pycache__",
-  ".venv",
-  ".turbo",
-  ".harness",
-  ".next",
-  ".vscode",
-  ".idea",
-  "vendor",
-  "out",
-  ".gradle",
-  ".gradle-home",
-  "bin",
-  "obj",
-  "venv",
-  "_build",
-  "deps",
-  "coverage",
-  ".nyc_output"
-]);
 var EXT_TO_LANGUAGE = {
   ".ts": "typescript",
   ".tsx": "typescript",
@@ -4107,7 +4150,7 @@ var ExtractionRunner = class {
     }
     for (const entry of entries) {
       const fullPath = path10.join(dir, entry.name);
-      if (entry.isDirectory() && !SKIP_DIRS2.has(entry.name)) {
+      if (entry.isDirectory() && !DEFAULT_SKIP_DIRS.has(entry.name)) {
         results.push(...await this.findSourceFiles(fullPath));
       } else if (entry.isFile() && detectLanguage(fullPath) !== void 0) {
         results.push(fullPath);
@@ -9340,6 +9383,16 @@ var DesignIngestor = class {
 };
 
 // src/constraints/DesignConstraintAdapter.ts
+var CODE_PREFIX_LABELS = {
+  "ANAT-D": "Component anatomy (definition)",
+  "ANAT-P": "Component anatomy (pattern presence)",
+  "ANAT-U": "Component anatomy (usage)",
+  "CRAFT-C": "Design craft (critique)",
+  "CRAFT-P": "Design craft (polish)",
+  "CRAFT-B": "Design craft (benchmark)",
+  "DESIGN-": "Design constraint (legacy)",
+  "A11Y-": "Accessibility"
+};
 var DesignConstraintAdapter = class {
   constructor(store) {
     this.store = store;
@@ -9421,6 +9474,76 @@ var DesignConstraintAdapter = class {
         return "error";
     }
   }
+  /**
+   * Record externally-computed craft findings (audit-component-anatomy,
+   * harness-design-craft, etc.) as graph state. Idempotent — re-running on
+   * the same findings produces no duplicate nodes or edges thanks to
+   * GraphStore's keyed merge semantics.
+   *
+   * Each finding becomes:
+   *   • a `design_constraint` node keyed by finding code (created lazily
+   *     if absent; metadata merged on re-record so the most recent message
+   *     / severity wins)
+   *   • a `violates_design` edge from the source file (id = file path) to
+   *     the constraint node, with per-finding metadata (line, severity,
+   *     message, evidence, runId)
+   *
+   * The file node is NOT created here — it's assumed to already exist in
+   * the graph from a prior ingest. If it does not, the edge will still be
+   * created (graph stores edges by key, not by referential integrity) and
+   * a subsequent ingest will populate the file node.
+   */
+  recordFindings(findings) {
+    let constraintsAdded = 0;
+    let edgesAdded = 0;
+    const seenConstraintIds = /* @__PURE__ */ new Set();
+    for (const finding of findings) {
+      const constraintId = `design_constraint:${finding.code}`;
+      if (!seenConstraintIds.has(finding.code)) {
+        const existing = this.store.getNode(constraintId);
+        if (!existing) constraintsAdded += 1;
+        this.store.addNode({
+          id: constraintId,
+          type: "design_constraint",
+          name: finding.code,
+          metadata: {
+            code: finding.code,
+            label: this.labelForCode(finding.code),
+            mostRecentMessage: finding.message,
+            mostRecentSeverity: finding.severity
+          }
+        });
+        seenConstraintIds.add(finding.code);
+      }
+      const fileId = finding.file;
+      const edgeMetadata = {
+        message: finding.message,
+        severity: finding.severity
+      };
+      if (finding.line !== void 0) edgeMetadata.line = finding.line;
+      if (finding.evidence !== void 0) edgeMetadata.evidence = finding.evidence;
+      if (finding.runId !== void 0) edgeMetadata.runId = finding.runId;
+      const before = this.store.getEdges({
+        from: fileId,
+        to: constraintId,
+        type: "violates_design"
+      });
+      this.store.addEdge({
+        from: fileId,
+        to: constraintId,
+        type: "violates_design",
+        metadata: edgeMetadata
+      });
+      if (before.length === 0) edgesAdded += 1;
+    }
+    return { constraintsAdded, edgesAdded };
+  }
+  labelForCode(code) {
+    for (const prefix of Object.keys(CODE_PREFIX_LABELS)) {
+      if (code.startsWith(prefix)) return CODE_PREFIX_LABELS[prefix];
+    }
+    return "Design constraint";
+  }
 };
 
 // src/feedback/GraphFeedbackAdapter.ts
@@ -9948,7 +10071,7 @@ var ConflictPredictor = class {
 };
 
 // src/index.ts
-var VERSION = "0.6.0";
+var VERSION = "0.9.0";
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   ALL_EXTRACTORS,
@@ -10029,5 +10152,6 @@ var VERSION = "0.6.0";
   project,
   queryTraceability,
   resolveSkipDirs,
-  saveGraph
+  saveGraph,
+  skipDirGlobs
 });

package/dist/index.mjs

@@ -864,6 +864,9 @@ function resolveSkipDirs(options) {
   }
   return base;
 }
+function skipDirGlobs(skipDirs = DEFAULT_SKIP_DIRS) {
+  return Array.from(skipDirs, (name) => `**/${name}/**`);
+}
 
 // src/ingest/CodeIngestor.ts
 var SKIP_METHOD_NAMES = /* @__PURE__ */ new Set(["constructor", "if", "for", "while", "switch"]);
@@ -1891,6 +1894,7 @@ function emptyResult(durationMs = 0) {
 
 // src/ingest/KnowledgeIngestor.ts
 var CODE_NODE_TYPES = ["file", "function", "class", "method", "interface", "variable"];
+var DOCS_OWNED_BY_OTHER_INGESTORS = /* @__PURE__ */ new Set(["adr", "knowledge", "changes", "solutions"]);
 var KnowledgeIngestor = class {
   constructor(store) {
     this.store = store;
@@ -1962,15 +1966,53 @@ var KnowledgeIngestor = class {
     }
     return buildResult(nodesAdded, edgesAdded, [], start);
   }
+  async ingestGeneralDocs(projectPath) {
+    const start = Date.now();
+    const errors = [];
+    let nodesAdded = 0;
+    let edgesAdded = 0;
+    const files = /* @__PURE__ */ new Set();
+    try {
+      const entries = await fs2.readdir(projectPath, { withFileTypes: true });
+      for (const entry of entries) {
+        if (entry.isFile() && entry.name.endsWith(".md")) {
+          files.add(path3.join(projectPath, entry.name));
+        }
+      }
+    } catch {
+      return emptyResult(Date.now() - start);
+    }
+    const docsRoot = path3.join(projectPath, "docs");
+    try {
+      const scanned = await this.scanDocsDir(docsRoot);
+      for (const f of scanned) files.add(f);
+    } catch {
+    }
+    for (const filePath of files) {
+      try {
+        const content = await fs2.readFile(filePath, "utf-8");
+        const relPath = path3.relative(projectPath, filePath).replaceAll("\\", "/");
+        const nodeId = `doc:${relPath}`;
+        if (this.store.getNode(nodeId)) continue;
+        this.store.addNode(parseDocumentNode(nodeId, filePath, relPath, content));
+        nodesAdded++;
+        edgesAdded += this.linkToCode(content, nodeId, "documents");
+      } catch (err) {
+        errors.push(`${filePath}: ${err instanceof Error ? err.message : String(err)}`);
+      }
+    }
+    return buildResult(nodesAdded, edgesAdded, errors, start);
+  }
   async ingestAll(projectPath, opts) {
     const start = Date.now();
     const adrDir = opts?.adrDir ?? path3.join(projectPath, "docs", "adr");
-    const [adrResult, learningsResult, failuresResult] = await Promise.all([
+    const [adrResult, learningsResult, failuresResult, docsResult] = await Promise.all([
       this.ingestADRs(adrDir),
       this.ingestLearnings(projectPath),
-      this.ingestFailures(projectPath)
+      this.ingestFailures(projectPath),
+      this.ingestGeneralDocs(projectPath)
     ]);
-    const merged = mergeResults(adrResult, learningsResult, failuresResult);
+    const merged = mergeResults(adrResult, learningsResult, failuresResult, docsResult);
     return { ...merged, durationMs: Date.now() - start };
   }
   linkToCode(content, sourceNodeId, edgeType) {
@@ -2005,7 +2047,22 @@ var KnowledgeIngestor = class {
     const entries = await fs2.readdir(dir, { withFileTypes: true });
     for (const entry of entries) {
       const fullPath = path3.join(dir, entry.name);
-      if (entry.isDirectory() && entry.name !== "node_modules" && entry.name !== "dist" && entry.name !== "target" && entry.name !== "build" && entry.name !== ".git" && entry.name !== ".gradle" && entry.name !== ".harness" && entry.name !== "vendor" && entry.name !== "bin" && entry.name !== "obj" && entry.name !== "venv" && entry.name !== "_build" && entry.name !== "deps" && entry.name !== "coverage") {
+      if (entry.isDirectory() && !DEFAULT_SKIP_DIRS.has(entry.name)) {
+        results.push(...await this.findMarkdownFiles(fullPath));
+      } else if (entry.isFile() && entry.name.endsWith(".md")) {
+        results.push(fullPath);
+      }
+    }
+    return results;
+  }
+  async scanDocsDir(docsRoot) {
+    const results = [];
+    const rootEntries = await fs2.readdir(docsRoot, { withFileTypes: true });
+    for (const entry of rootEntries) {
+      const fullPath = path3.join(docsRoot, entry.name);
+      if (entry.isDirectory()) {
+        if (DEFAULT_SKIP_DIRS.has(entry.name)) continue;
+        if (DOCS_OWNED_BY_OTHER_INGESTORS.has(entry.name)) continue;
         results.push(...await this.findMarkdownFiles(fullPath));
       } else if (entry.isFile() && entry.name.endsWith(".md")) {
         results.push(fullPath);
@@ -2031,6 +2088,17 @@ function buildResult(nodesAdded, edgesAdded, errors, start) {
     durationMs: Date.now() - start
   };
 }
+function parseDocumentNode(nodeId, filePath, relPath, content) {
+  const titleMatch = content.match(/^#\s+(.+)$/m);
+  const title = titleMatch ? titleMatch[1].trim() : path3.basename(filePath, ".md");
+  return {
+    id: nodeId,
+    type: "document",
+    name: title,
+    path: filePath,
+    metadata: { relPath }
+  };
+}
 function parseADRNode(nodeId, filePath, filename, content) {
   const titleMatch = content.match(/^#\s+(.+)$/m);
   const title = titleMatch ? titleMatch[1].trim() : filename;
@@ -2317,7 +2385,7 @@ var BusinessKnowledgeIngestor = class {
     const entries = await fs3.readdir(dir, { withFileTypes: true });
     for (const entry of entries) {
       const fullPath = path4.join(dir, entry.name);
-      if (entry.isDirectory() && entry.name !== "node_modules" && entry.name !== "dist" && entry.name !== "target" && entry.name !== "build" && entry.name !== ".git" && entry.name !== ".gradle" && entry.name !== ".harness" && entry.name !== "vendor" && entry.name !== "bin" && entry.name !== "obj" && entry.name !== "venv" && entry.name !== "_build" && entry.name !== "deps" && entry.name !== "coverage") {
+      if (entry.isDirectory() && !DEFAULT_SKIP_DIRS.has(entry.name)) {
         results.push(...await this.findMarkdownFiles(fullPath));
       } else if (entry.isFile() && entry.name.endsWith(".md")) {
         results.push(fullPath);
@@ -3161,7 +3229,6 @@ var PlantUmlParser = class {
 
 // src/ingest/DiagramParser.ts
 var DIAGRAM_EXTENSIONS = /* @__PURE__ */ new Set([".mmd", ".mermaid", ".d2", ".puml", ".plantuml"]);
-var SKIP_DIRS = /* @__PURE__ */ new Set(["node_modules", ".git", "dist", "build", ".harness"]);
 var DiagramParser = class {
   constructor(store) {
     this.store = store;
@@ -3266,7 +3333,7 @@ var DiagramParser = class {
       }
       for (const entry of entries) {
         if (entry.isDirectory()) {
-          if (!SKIP_DIRS.has(entry.name)) {
+          if (!DEFAULT_SKIP_DIRS.has(entry.name)) {
             await walk(path7.join(currentDir, entry.name));
           }
         } else if (entry.isFile()) {
@@ -3790,31 +3857,6 @@ var KnowledgeStagingAggregator = class {
 // src/ingest/extractors/ExtractionRunner.ts
 import * as fs9 from "fs/promises";
 import * as path10 from "path";
-var SKIP_DIRS2 = /* @__PURE__ */ new Set([
-  "node_modules",
-  "dist",
-  "target",
-  "build",
-  ".git",
-  "__pycache__",
-  ".venv",
-  ".turbo",
-  ".harness",
-  ".next",
-  ".vscode",
-  ".idea",
-  "vendor",
-  "out",
-  ".gradle",
-  ".gradle-home",
-  "bin",
-  "obj",
-  "venv",
-  "_build",
-  "deps",
-  "coverage",
-  ".nyc_output"
-]);
 var EXT_TO_LANGUAGE = {
   ".ts": "typescript",
   ".tsx": "typescript",
@@ -3993,7 +4035,7 @@ var ExtractionRunner = class {
     }
     for (const entry of entries) {
       const fullPath = path10.join(dir, entry.name);
-      if (entry.isDirectory() && !SKIP_DIRS2.has(entry.name)) {
+      if (entry.isDirectory() && !DEFAULT_SKIP_DIRS.has(entry.name)) {
         results.push(...await this.findSourceFiles(fullPath));
       } else if (entry.isFile() && detectLanguage(fullPath) !== void 0) {
         results.push(fullPath);
@@ -9003,7 +9045,7 @@ function queryTraceability(store, options) {
 
 // src/constraints/GraphConstraintAdapter.ts
 import { minimatch as minimatch2 } from "minimatch";
-import { relative as relative5 } from "path";
+import { relative as relative6 } from "path";
 var GraphConstraintAdapter = class {
   constructor(store) {
     this.store = store;
@@ -9032,8 +9074,8 @@ var GraphConstraintAdapter = class {
     const { edges } = this.computeDependencyGraph();
     const violations = [];
     for (const edge of edges) {
-      const fromRelative = relative5(rootDir, edge.from).replaceAll("\\", "/");
-      const toRelative = relative5(rootDir, edge.to).replaceAll("\\", "/");
+      const fromRelative = relative6(rootDir, edge.from).replaceAll("\\", "/");
+      const toRelative = relative6(rootDir, edge.to).replaceAll("\\", "/");
       const fromLayer = this.resolveLayer(fromRelative, layers);
       const toLayer = this.resolveLayer(toRelative, layers);
       if (!fromLayer || !toLayer) continue;
@@ -9226,6 +9268,16 @@ var DesignIngestor = class {
 };
 
 // src/constraints/DesignConstraintAdapter.ts
+var CODE_PREFIX_LABELS = {
+  "ANAT-D": "Component anatomy (definition)",
+  "ANAT-P": "Component anatomy (pattern presence)",
+  "ANAT-U": "Component anatomy (usage)",
+  "CRAFT-C": "Design craft (critique)",
+  "CRAFT-P": "Design craft (polish)",
+  "CRAFT-B": "Design craft (benchmark)",
+  "DESIGN-": "Design constraint (legacy)",
+  "A11Y-": "Accessibility"
+};
 var DesignConstraintAdapter = class {
   constructor(store) {
     this.store = store;
@@ -9307,6 +9359,76 @@ var DesignConstraintAdapter = class {
         return "error";
     }
   }
+  /**
+   * Record externally-computed craft findings (audit-component-anatomy,
+   * harness-design-craft, etc.) as graph state. Idempotent — re-running on
+   * the same findings produces no duplicate nodes or edges thanks to
+   * GraphStore's keyed merge semantics.
+   *
+   * Each finding becomes:
+   *   • a `design_constraint` node keyed by finding code (created lazily
+   *     if absent; metadata merged on re-record so the most recent message
+   *     / severity wins)
+   *   • a `violates_design` edge from the source file (id = file path) to
+   *     the constraint node, with per-finding metadata (line, severity,
+   *     message, evidence, runId)
+   *
+   * The file node is NOT created here — it's assumed to already exist in
+   * the graph from a prior ingest. If it does not, the edge will still be
+   * created (graph stores edges by key, not by referential integrity) and
+   * a subsequent ingest will populate the file node.
+   */
+  recordFindings(findings) {
+    let constraintsAdded = 0;
+    let edgesAdded = 0;
+    const seenConstraintIds = /* @__PURE__ */ new Set();
+    for (const finding of findings) {
+      const constraintId = `design_constraint:${finding.code}`;
+      if (!seenConstraintIds.has(finding.code)) {
+        const existing = this.store.getNode(constraintId);
+        if (!existing) constraintsAdded += 1;
+        this.store.addNode({
+          id: constraintId,
+          type: "design_constraint",
+          name: finding.code,
+          metadata: {
+            code: finding.code,
+            label: this.labelForCode(finding.code),
+            mostRecentMessage: finding.message,
+            mostRecentSeverity: finding.severity
+          }
+        });
+        seenConstraintIds.add(finding.code);
+      }
+      const fileId = finding.file;
+      const edgeMetadata = {
+        message: finding.message,
+        severity: finding.severity
+      };
+      if (finding.line !== void 0) edgeMetadata.line = finding.line;
+      if (finding.evidence !== void 0) edgeMetadata.evidence = finding.evidence;
+      if (finding.runId !== void 0) edgeMetadata.runId = finding.runId;
+      const before = this.store.getEdges({
+        from: fileId,
+        to: constraintId,
+        type: "violates_design"
+      });
+      this.store.addEdge({
+        from: fileId,
+        to: constraintId,
+        type: "violates_design",
+        metadata: edgeMetadata
+      });
+      if (before.length === 0) edgesAdded += 1;
+    }
+    return { constraintsAdded, edgesAdded };
+  }
+  labelForCode(code) {
+    for (const prefix of Object.keys(CODE_PREFIX_LABELS)) {
+      if (code.startsWith(prefix)) return CODE_PREFIX_LABELS[prefix];
+    }
+    return "Design constraint";
+  }
 };
 
 // src/feedback/GraphFeedbackAdapter.ts
@@ -9834,7 +9956,7 @@ var ConflictPredictor = class {
 };
 
 // src/index.ts
-var VERSION = "0.6.0";
+var VERSION = "0.9.0";
 export {
   ALL_EXTRACTORS,
   ApiPathExtractor,
@@ -9914,5 +10036,6 @@ export {
   project,
   queryTraceability,
   resolveSkipDirs,
-  saveGraph
+  saveGraph,
+  skipDirGlobs
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@harness-engineering/graph",
-  "version": "0.8.0",
+  "version": "0.10.0",
   "license": "MIT",
   "description": "Knowledge graph for context assembly in Harness Engineering",
   "main": "./dist/index.js",