@harness-engineering/graph 0.4.1 → 0.4.2

package/dist/index.d.mts

@@ -179,6 +179,8 @@ declare class GraphStore {
     /** Pick the most selective index to start from. */
     private selectCandidates;
     getNeighbors(nodeId: string, direction?: 'outbound' | 'inbound' | 'both'): GraphNode[];
+    private collectNeighborIds;
+    private resolveNodes;
     get nodeCount(): number;
     get edgeCount(): number;
     clear(): void;
@@ -325,8 +327,16 @@ declare class GitIngestor {
     private readonly gitRunner?;
     constructor(store: GraphStore, gitRunner?: GitRunner | undefined);
     ingest(rootDir: string): Promise<IngestResult>;
+    private ingestCommit;
+    private ingestCoChanges;
     private runGit;
     private parseGitLog;
+    /**
+     * Process one line from git log output, updating the in-progress commit builder
+     * and flushing completed commits into the accumulator.
+     * Returns the updated current builder (null if flushed and not replaced).
+     */
+    private processLogLine;
     private computeCoChanges;
 }
 
@@ -368,10 +378,22 @@ declare class RequirementIngestor {
      * and create requirement nodes with convention-based edges.
      */
     ingestSpecs(specsDir: string): Promise<IngestResult>;
+    private ingestFeatureDir;
+    private ingestSpec;
+    private ingestRequirement;
     /**
      * Parse markdown content and extract numbered items from recognized sections.
      */
     private extractRequirements;
+    /**
+     * Check if a line is a section heading and return updated section state,
+     * or return null if the line is not a heading.
+     */
+    private processHeadingLine;
+    /**
+     * Build a requirement GraphNode from a matched numbered-item line.
+     */
+    private buildRequirementNode;
     /**
      * Convention-based linking: match requirement to code/test files
      * by feature name in their path.
@@ -434,6 +456,7 @@ declare class JiraConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAllIssues;
     private processIssue;
 }
 
@@ -452,6 +475,7 @@ declare class ConfluenceConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAllPagesHandled;
     private fetchAllPages;
     private processPage;
 }
@@ -462,6 +486,7 @@ declare class CIConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAndIngestRuns;
 }
 
 interface FusionResult {
@@ -480,6 +505,9 @@ declare class FusionLayer {
     private readonly semanticWeight;
     constructor(store: GraphStore, vectorStore?: VectorStore, keywordWeight?: number, semanticWeight?: number);
     search(query: string, topK?: number, queryEmbedding?: readonly number[]): FusionResult[];
+    private buildSemanticScores;
+    private resolveWeights;
+    private scoreNodes;
     private extractKeywords;
     private keywordScore;
     private singleKeywordScore;
@@ -524,6 +552,7 @@ declare class GraphEntropyAdapter {
      * 4. If target exists -> compare lastModified timestamps to determine staleness
      */
     computeDriftData(): GraphDriftData;
+    private classifyDocEdge;
     /**
      * BFS from entry points to find reachable vs unreachable code nodes.
      *
@@ -645,6 +674,9 @@ declare class GraphAnomalyAdapter {
     private readonly store;
     constructor(store: GraphStore);
     detect(options?: AnomalyDetectionOptions): AnomalyReport;
+    private filterMetrics;
+    private computeAllOutliers;
+    private computeOverlap;
     private collectMetricValues;
     private computeZScoreOutliers;
     private findArticulationPoints;
@@ -741,6 +773,14 @@ declare class EntityExtractor {
      * @returns Array of raw entity strings in priority order, deduplicated
      */
     extract(query: string): readonly string[];
+    /** Strategy 1: Quoted strings. Returns the set of consumed tokens. */
+    private extractQuoted;
+    /** Strategy 2: PascalCase/camelCase tokens. Returns the set of consumed tokens. */
+    private extractCasing;
+    /** Strategy 3: File paths. Returns the set of consumed tokens. */
+    private extractPaths;
+    /** Strategy 4: Remaining significant nouns after stop-word and intent-keyword removal. */
+    private extractNouns;
 }
 
 /**
@@ -828,17 +868,17 @@ declare class Assembler {
     assembleContext(intent: string, tokenBudget?: number): AssembledContext;
     private expandSearchResults;
     private truncateToFit;
-    /**
-     * Compute a token budget allocation across node types.
-     */
+    private countNodesByType;
+    private computeModuleDensity;
+    private computeTypeWeights;
+    private allocateProportionally;
     computeBudget(totalTokens: number, phase?: string): GraphBudget;
     /**
      * Filter graph nodes relevant to a development phase.
      */
     filterForPhase(phase: string): GraphFilterResult;
-    /**
-     * Generate a markdown repository map from graph structure.
-     */
+    private buildModuleLines;
+    private buildEntryPointLines;
     generateMap(): string;
     /**
      * Check documentation coverage of code nodes.
@@ -905,6 +945,8 @@ declare class GraphConstraintAdapter {
     private readonly store;
     constructor(store: GraphStore);
     computeDependencyGraph(): GraphDependencyData;
+    private collectFileNodePaths;
+    private collectImportEdges;
     computeLayerViolations(layers: LayerDef[], rootDir: string): GraphLayerViolation[];
     private resolveLayer;
 }
@@ -958,7 +1000,10 @@ declare class GraphFeedbackAdapter {
     private readonly store;
     constructor(store: GraphStore);
     computeImpactData(changedFiles: string[]): GraphImpactData;
+    private collectFileImpact;
     computeHarnessCheckData(): GraphHarnessCheckData;
+    private countUndocumentedFiles;
+    private countUnreachableNodes;
 }
 
 interface TaskDefinition {
@@ -993,6 +1038,8 @@ declare class TaskIndependenceAnalyzer {
     private readonly store;
     constructor(store?: GraphStore);
     analyze(params: IndependenceCheckParams): IndependenceResult;
+    private buildFileSets;
+    private computeAllPairs;
     private validate;
     private expandViaGraph;
     private computePairOverlap;
@@ -1027,6 +1074,10 @@ declare class ConflictPredictor {
     private readonly store;
     constructor(store?: GraphStore);
     predict(params: IndependenceCheckParams): ConflictPrediction;
+    private buildMetricMaps;
+    private classifyConflicts;
+    private countBySeverity;
+    private classifyTransitiveOverlap;
     private classifyPair;
     private severityRank;
     private computePercentile;
@@ -1120,6 +1171,6 @@ declare class CascadeSimulator {
     private buildResult;
 }
 
-declare const VERSION = "0.4.0";
+declare const VERSION = "0.4.1";
 
 export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, type CascadeLayer, type CascadeNode, type CascadeResult, type CascadeSimulationOptions, CascadeSimulator, type ClassificationResult, CodeIngestor, CompositeProbabilityStrategy, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, FusionLayer, type FusionResult, 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, GraphStore, type HttpClient, INTENTS, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeCategory, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, type PairResult, type ProbabilityStrategy, type ProjectionSpec, type RequirementCoverage, RequirementIngestor, type ResolvedEntity, ResponseFormatter, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TopologicalLinker, type TraceabilityOptions, type TraceabilityResult, type TracedFile, VERSION, type VectorSearchResult, VectorStore, askGraph, classifyNodeCategory, groupNodesByImpact, linkToCode, loadGraph, project, queryTraceability, saveGraph };

package/dist/index.d.ts

@@ -179,6 +179,8 @@ declare class GraphStore {
     /** Pick the most selective index to start from. */
     private selectCandidates;
     getNeighbors(nodeId: string, direction?: 'outbound' | 'inbound' | 'both'): GraphNode[];
+    private collectNeighborIds;
+    private resolveNodes;
     get nodeCount(): number;
     get edgeCount(): number;
     clear(): void;
@@ -325,8 +327,16 @@ declare class GitIngestor {
     private readonly gitRunner?;
     constructor(store: GraphStore, gitRunner?: GitRunner | undefined);
     ingest(rootDir: string): Promise<IngestResult>;
+    private ingestCommit;
+    private ingestCoChanges;
     private runGit;
     private parseGitLog;
+    /**
+     * Process one line from git log output, updating the in-progress commit builder
+     * and flushing completed commits into the accumulator.
+     * Returns the updated current builder (null if flushed and not replaced).
+     */
+    private processLogLine;
     private computeCoChanges;
 }
 
@@ -368,10 +378,22 @@ declare class RequirementIngestor {
      * and create requirement nodes with convention-based edges.
      */
     ingestSpecs(specsDir: string): Promise<IngestResult>;
+    private ingestFeatureDir;
+    private ingestSpec;
+    private ingestRequirement;
     /**
      * Parse markdown content and extract numbered items from recognized sections.
      */
     private extractRequirements;
+    /**
+     * Check if a line is a section heading and return updated section state,
+     * or return null if the line is not a heading.
+     */
+    private processHeadingLine;
+    /**
+     * Build a requirement GraphNode from a matched numbered-item line.
+     */
+    private buildRequirementNode;
     /**
      * Convention-based linking: match requirement to code/test files
      * by feature name in their path.
@@ -434,6 +456,7 @@ declare class JiraConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAllIssues;
     private processIssue;
 }
 
@@ -452,6 +475,7 @@ declare class ConfluenceConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAllPagesHandled;
     private fetchAllPages;
     private processPage;
 }
@@ -462,6 +486,7 @@ declare class CIConnector implements GraphConnector {
     private readonly httpClient;
     constructor(httpClient?: HttpClient);
     ingest(store: GraphStore, config: ConnectorConfig): Promise<IngestResult>;
+    private fetchAndIngestRuns;
 }
 
 interface FusionResult {
@@ -480,6 +505,9 @@ declare class FusionLayer {
     private readonly semanticWeight;
     constructor(store: GraphStore, vectorStore?: VectorStore, keywordWeight?: number, semanticWeight?: number);
     search(query: string, topK?: number, queryEmbedding?: readonly number[]): FusionResult[];
+    private buildSemanticScores;
+    private resolveWeights;
+    private scoreNodes;
     private extractKeywords;
     private keywordScore;
     private singleKeywordScore;
@@ -524,6 +552,7 @@ declare class GraphEntropyAdapter {
      * 4. If target exists -> compare lastModified timestamps to determine staleness
      */
     computeDriftData(): GraphDriftData;
+    private classifyDocEdge;
     /**
      * BFS from entry points to find reachable vs unreachable code nodes.
      *
@@ -645,6 +674,9 @@ declare class GraphAnomalyAdapter {
     private readonly store;
     constructor(store: GraphStore);
     detect(options?: AnomalyDetectionOptions): AnomalyReport;
+    private filterMetrics;
+    private computeAllOutliers;
+    private computeOverlap;
     private collectMetricValues;
     private computeZScoreOutliers;
     private findArticulationPoints;
@@ -741,6 +773,14 @@ declare class EntityExtractor {
      * @returns Array of raw entity strings in priority order, deduplicated
      */
     extract(query: string): readonly string[];
+    /** Strategy 1: Quoted strings. Returns the set of consumed tokens. */
+    private extractQuoted;
+    /** Strategy 2: PascalCase/camelCase tokens. Returns the set of consumed tokens. */
+    private extractCasing;
+    /** Strategy 3: File paths. Returns the set of consumed tokens. */
+    private extractPaths;
+    /** Strategy 4: Remaining significant nouns after stop-word and intent-keyword removal. */
+    private extractNouns;
 }
 
 /**
@@ -828,17 +868,17 @@ declare class Assembler {
     assembleContext(intent: string, tokenBudget?: number): AssembledContext;
     private expandSearchResults;
     private truncateToFit;
-    /**
-     * Compute a token budget allocation across node types.
-     */
+    private countNodesByType;
+    private computeModuleDensity;
+    private computeTypeWeights;
+    private allocateProportionally;
     computeBudget(totalTokens: number, phase?: string): GraphBudget;
     /**
      * Filter graph nodes relevant to a development phase.
      */
     filterForPhase(phase: string): GraphFilterResult;
-    /**
-     * Generate a markdown repository map from graph structure.
-     */
+    private buildModuleLines;
+    private buildEntryPointLines;
     generateMap(): string;
     /**
      * Check documentation coverage of code nodes.
@@ -905,6 +945,8 @@ declare class GraphConstraintAdapter {
     private readonly store;
     constructor(store: GraphStore);
     computeDependencyGraph(): GraphDependencyData;
+    private collectFileNodePaths;
+    private collectImportEdges;
     computeLayerViolations(layers: LayerDef[], rootDir: string): GraphLayerViolation[];
     private resolveLayer;
 }
@@ -958,7 +1000,10 @@ declare class GraphFeedbackAdapter {
     private readonly store;
     constructor(store: GraphStore);
     computeImpactData(changedFiles: string[]): GraphImpactData;
+    private collectFileImpact;
     computeHarnessCheckData(): GraphHarnessCheckData;
+    private countUndocumentedFiles;
+    private countUnreachableNodes;
 }
 
 interface TaskDefinition {
@@ -993,6 +1038,8 @@ declare class TaskIndependenceAnalyzer {
     private readonly store;
     constructor(store?: GraphStore);
     analyze(params: IndependenceCheckParams): IndependenceResult;
+    private buildFileSets;
+    private computeAllPairs;
     private validate;
     private expandViaGraph;
     private computePairOverlap;
@@ -1027,6 +1074,10 @@ declare class ConflictPredictor {
     private readonly store;
     constructor(store?: GraphStore);
     predict(params: IndependenceCheckParams): ConflictPrediction;
+    private buildMetricMaps;
+    private classifyConflicts;
+    private countBySeverity;
+    private classifyTransitiveOverlap;
     private classifyPair;
     private severityRank;
     private computePercentile;
@@ -1120,6 +1171,6 @@ declare class CascadeSimulator {
     private buildResult;
 }
 
-declare const VERSION = "0.4.0";
+declare const VERSION = "0.4.1";
 
 export { type AnomalyDetectionOptions, type AnomalyReport, type ArticulationPoint, type AskGraphResult, type AssembledContext, Assembler, CIConnector, CURRENT_SCHEMA_VERSION, type CascadeLayer, type CascadeNode, type CascadeResult, type CascadeSimulationOptions, CascadeSimulator, type ClassificationResult, CodeIngestor, CompositeProbabilityStrategy, type ConflictDetail, type ConflictPrediction, ConflictPredictor, type ConflictSeverity, ConfluenceConnector, type ConnectorConfig, ContextQL, type ContextQLParams, type ContextQLResult, DesignConstraintAdapter, DesignIngestor, type DesignStrictness, type DesignViolation, EDGE_TYPES, type EdgeQuery, type EdgeType, EntityExtractor, EntityResolver, FusionLayer, type FusionResult, 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, GraphStore, type HttpClient, INTENTS, type ImpactGroups, type IndependenceCheckParams, type IndependenceResult, type IngestResult, type Intent, IntentClassifier, JiraConnector, KnowledgeIngestor, type LinkResult, NODE_TYPES, type NodeCategory, type NodeQuery, type NodeType, OBSERVABILITY_TYPES, type OverlapDetail, type PairResult, type ProbabilityStrategy, type ProjectionSpec, type RequirementCoverage, RequirementIngestor, type ResolvedEntity, ResponseFormatter, SlackConnector, type SourceLocation, type StatisticalOutlier, SyncManager, type SyncMetadata, type TaskDefinition, TaskIndependenceAnalyzer, TopologicalLinker, type TraceabilityOptions, type TraceabilityResult, type TracedFile, VERSION, type VectorSearchResult, VectorStore, askGraph, classifyNodeCategory, groupNodesByImpact, linkToCode, loadGraph, project, queryTraceability, saveGraph };