optiprune 2.1.4 → 2.1.7

package/dist/topology-manager.d.ts

@@ -1,23 +0,0 @@
-import { SemanticGraph, SemanticNode } from "./semantic-graph.js";
-export declare class TopologyManager {
-    private graph;
-    constructor(graph: SemanticGraph);
-    /**
-     * Processes a set of new/updated nodes for a file and updates the graph.
-     * Implements a Soft-Delete (Tombstone) strategy for resilient parsing.
-     */
-    updateFile(fileId: string, newNodes: SemanticNode[], parseSuccess?: boolean): Set<string>;
-    /**
-     * Transitively marks all nodes that depend on the given nodeId.
-     */
-    private markAffectedDependents;
-    /**
-     * Detects orphaned nodes (dead code) using Tarjan's algorithm for SCC-aware detection.
-     * This treats circular dependency cycles as a single unit.
-     */
-    detectDeadCode(): SemanticNode[];
-    /**
-     * Tarjan's algorithm for finding Strongly Connected Components.
-     */
-    private findSCCs;
-}

package/dist/topology-manager.js

@@ -1,144 +0,0 @@
-export class TopologyManager {
-    graph;
-    constructor(graph) {
-        this.graph = graph;
-    }
-    /**
-     * Processes a set of new/updated nodes for a file and updates the graph.
-     * Implements a Soft-Delete (Tombstone) strategy for resilient parsing.
-     */
-    updateFile(fileId, newNodes, parseSuccess = true) {
-        const affectedNodeIds = new Set();
-        const existingNodes = this.graph.getNodesInFile(fileId);
-        const existingNodeMap = new Map(existingNodes.map(n => [n.id, n]));
-        const newNodeMap = new Map(newNodes.map(n => [n.id, n]));
-        if (!parseSuccess) {
-            // If parse failed, mark all existing nodes as stale but don't purge them
-            for (const oldNode of existingNodes) {
-                oldNode.isStale = true;
-            }
-            return affectedNodeIds;
-        }
-        // 1. Identify removed nodes or nodes that changed content
-        for (const oldNode of existingNodes) {
-            const newNode = newNodeMap.get(oldNode.id);
-            if (!newNode) {
-                // Node was completely removed
-                this.markAffectedDependents(oldNode.id, affectedNodeIds);
-                this.graph.removeNode(oldNode.id);
-            }
-            else if (oldNode.contentHash !== newNode.contentHash) {
-                // Content changed, mark as affected but keep LEI
-                affectedNodeIds.add(oldNode.id);
-                oldNode.contentHash = newNode.contentHash;
-                oldNode.isStale = false;
-                // In a real implementation, we would re-extract references for the updated node
-            }
-            else {
-                // Node is still there and unchanged
-                oldNode.isStale = false;
-            }
-        }
-        // 2. Add new nodes
-        for (const newNode of newNodes) {
-            if (!existingNodeMap.has(newNode.id)) {
-                this.graph.addNode(newNode);
-                affectedNodeIds.add(newNode.id);
-            }
-        }
-        return affectedNodeIds;
-    }
-    /**
-     * Transitively marks all nodes that depend on the given nodeId.
-     */
-    markAffectedDependents(nodeId, affected) {
-        const node = this.graph.getNode(nodeId);
-        if (!node || affected.has(nodeId))
-            return;
-        affected.add(nodeId);
-        for (const ref of node.incomingReferences) {
-            this.markAffectedDependents(ref.sourceNodeId, affected);
-        }
-    }
-    /**
-     * Detects orphaned nodes (dead code) using Tarjan's algorithm for SCC-aware detection.
-     * This treats circular dependency cycles as a single unit.
-     */
-    detectDeadCode() {
-        const allNodes = this.graph.getAllNodes();
-        const deadNodes = [];
-        // 1. Find all SCCs in the graph
-        const sccs = this.findSCCs(allNodes);
-        // 2. For each SCC, check if it has any incoming references from outside the SCC
-        for (const scc of sccs) {
-            const sccNodeIds = new Set(scc.map(n => n.id));
-            let hasExternalInflow = false;
-            for (const node of scc) {
-                // Files are considered entry points for now
-                if (node.type === 'File') {
-                    hasExternalInflow = true;
-                    break;
-                }
-                for (const ref of node.incomingReferences) {
-                    if (!sccNodeIds.has(ref.sourceNodeId)) {
-                        hasExternalInflow = true;
-                        break;
-                    }
-                }
-                if (hasExternalInflow)
-                    break;
-            }
-            if (!hasExternalInflow) {
-                deadNodes.push(...scc);
-            }
-        }
-        return deadNodes;
-    }
-    /**
-     * Tarjan's algorithm for finding Strongly Connected Components.
-     */
-    findSCCs(nodes) {
-        let index = 0;
-        const stack = [];
-        const indices = new Map();
-        const lowlink = new Map();
-        const onStack = new Set();
-        const sccs = [];
-        const strongconnect = (v) => {
-            indices.set(v.id, index);
-            lowlink.set(v.id, index);
-            index++;
-            stack.push(v);
-            onStack.add(v.id);
-            for (const ref of v.outgoingReferences) {
-                const w = this.graph.getNode(ref.targetNodeId);
-                if (!w)
-                    continue;
-                if (!indices.has(w.id)) {
-                    strongconnect(w);
-                    lowlink.set(v.id, Math.min(lowlink.get(v.id), lowlink.get(w.id)));
-                }
-                else if (onStack.has(w.id)) {
-                    lowlink.set(v.id, Math.min(lowlink.get(v.id), indices.get(w.id)));
-                }
-            }
-            if (lowlink.get(v.id) === indices.get(v.id)) {
-                const scc = [];
-                let w;
-                do {
-                    w = stack.pop();
-                    onStack.delete(w.id);
-                    scc.push(w);
-                } while (w.id !== v.id);
-                sccs.push(scc);
-            }
-        };
-        for (const node of nodes) {
-            if (!indices.has(node.id)) {
-                strongconnect(node);
-            }
-        }
-        return sccs;
-    }
-}
-//# sourceMappingURL=topology-manager.js.map

package/dist/topology-manager.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"topology-manager.js","sourceRoot":"","sources":["../src/topology-manager.ts"],"names":[],"mappings":"AAEA,MAAM,OAAO,eAAe;IACN;IAApB,YAAoB,KAAoB;QAApB,UAAK,GAAL,KAAK,CAAe;IAAG,CAAC;IAE5C;;;OAGG;IACH,UAAU,CAAC,MAAc,EAAE,QAAwB,EAAE,eAAwB,IAAI;QAC/E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,yEAAyE;YACzE,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;gBACpC,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;YACzB,CAAC;YACD,OAAO,eAAe,CAAC;QACzB,CAAC;QAED,0DAA0D;QAC1D,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC3C,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,8BAA8B;gBAC9B,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,EAAE,EAAE,eAAe,CAAC,CAAC;gBACzD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACpC,CAAC;iBAAM,IAAI,OAAO,CAAC,WAAW,KAAK,OAAO,CAAC,WAAW,EAAE,CAAC;gBACvD,iDAAiD;gBACjD,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBAChC,OAAO,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;gBAC1C,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC;gBACxB,gFAAgF;YAClF,CAAC;iBAAM,CAAC;gBACN,oCAAoC;gBACpC,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC5B,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,MAAc,EAAE,QAAqB;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO;QAE1C,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAErB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC1C,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,cAAc;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC1C,MAAM,SAAS,GAAmB,EAAE,CAAC;QAErC,gCAAgC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAErC,gFAAgF;QAChF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/C,IAAI,iBAAiB,GAAG,KAAK,CAAC;YAE9B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;gBACvB,4CAA4C;gBAC5C,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;oBACzB,iBAAiB,GAAG,IAAI,CAAC;oBACzB,MAAM;gBACR,CAAC;gBAED,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;oBAC1C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;wBACtC,iBAAiB,GAAG,IAAI,CAAC;wBACzB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,iBAAiB;oBAAE,MAAM;YAC/B,CAAC;YAED,IAAI,CAAC,iBAAiB,EAAE,CAAC;gBACvB,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,KAAqB;QACpC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAmB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,IAAI,GAAqB,EAAE,CAAC;QAElC,MAAM,aAAa,GAAG,CAAC,CAAe,EAAE,EAAE;YACxC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACzB,KAAK,EAAE,CAAC;YACR,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAElB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,kBAAkB,EAAE,CAAC;gBACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;gBAC/C,IAAI,CAAC,CAAC;oBAAE,SAAS;gBAEjB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvB,aAAa,CAAC,CAAC,CAAC,CAAC;oBACjB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC;gBACtE,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC;gBACtE,CAAC;YACH,CAAC;YAED,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5C,MAAM,GAAG,GAAmB,EAAE,CAAC;gBAC/B,IAAI,CAAe,CAAC;gBACpB,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACjB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACrB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE;gBACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,aAAa,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/types.d.ts

@@ -1,265 +0,0 @@
-export type Confidence = "high" | "medium" | "low" | "info";
-export type FailOn = Confidence | "none";
-export type Severity = "error" | "warning" | "info";
-export type ParseStatus = "parsed" | "recovered" | "fallback";
-export type EdgeKind = "import" | "export-from" | "export-all" | "require" | "dynamic-literal" | "dynamic-pattern" | "unknown-dynamic";
-export interface Position {
-    line: number;
-    column: number;
-}
-export interface Range {
-    start: Position;
-    end: Position;
-}
-export interface ParseDiagnostic {
-    message: string;
-    file: string;
-    location?: Range;
-    recovered: boolean;
-}
-export interface ExportMember {
-    name: string;
-    location?: Range;
-}
-export interface ExportRecord {
-    name: string;
-    exportedAs: string;
-    location?: Range;
-    isDefault: boolean;
-    isReExport: boolean;
-    isWildcard: boolean;
-    isTypeOnly?: boolean;
-    isExternalContract?: boolean;
-    localReferences?: string[];
-    members?: ExportMember[];
-}
-export interface DependencyEdge {
-    source: string;
-    rawSpecifier: string;
-    kind: EdgeKind;
-    target?: string;
-    location?: Range;
-    importedNames: string[];
-    dynamicPattern?: DynamicPattern;
-    dynamicExpression?: string | undefined;
-    resolution: "resolved" | "unresolved" | "external" | "unknown";
-    isTypeOnly?: boolean;
-}
-export interface DynamicPattern {
-    prefix: string;
-    suffix: string;
-    baseDirectory: string;
-    candidates: string[];
-}
-export interface ModuleRecord {
-    id: string;
-    relativePath: string;
-    parseStatus: ParseStatus;
-    parseDiagnostics: ParseDiagnostic[];
-    ast?: unknown;
-    sourceText: string;
-    exports: ExportRecord[];
-    edges: DependencyEdge[];
-    hasUnknownDynamicBoundary: boolean;
-    hasParseError: boolean;
-    hasUnresolvedCommonJsExports: boolean;
-    scannedDirectories: string[];
-    dynamicImportCandidates: DynamicImportCandidate[];
-    localSymbolMap?: Record<string, string[]>;
-    localTypeMap?: Record<string, string>;
-    localReferences?: string[];
-}
-export interface WorkspacePackage {
-    name: string;
-    location: string;
-    relativePath: string;
-    manifestPath: string;
-    dependencies: Set<string>;
-    allDependencies: Set<string>;
-}
-export interface MonorepoGraph {
-    rootPath: string;
-    packageMap: Map<string, WorkspacePackage>;
-    topologicalOrder: string[];
-}
-export interface StronglyConnectedComponent {
-    id: number;
-    modules: string[];
-    isCycle: boolean;
-    isReachable?: boolean;
-    isMaybeReachable?: boolean;
-}
-export interface ConcolicVerificationResult {
-    pathReached: boolean;
-    executionTimeMs: number;
-    logs: string[];
-}
-export interface CandidateBranch {
-    file: string;
-    line: number;
-    instrumentedCode: string;
-    seedInput: Record<string, any>;
-}
-export interface DynamicImportCandidate {
-    file: string;
-    line: number;
-    column: number;
-    expression: string;
-    contextCode: string;
-}
-export interface Finding {
-    rule: "unreachable-file" | "unused-export" | "unused-member" | "unreachable-statement" | "constant-condition" | "contradictory-guard" | "schema-impossible-guard" | "parse-recovery" | "unresolved-import" | "unknown-dynamic-import" | "no-entry-points" | "unreachable-dynamic-path" | "protected-contract";
-    severity: Severity;
-    confidence: Confidence;
-    message: string;
-    file: string;
-    location?: Range | undefined;
-    evidence: Record<string, unknown>;
-}
-export interface AnalyzerOptions {
-    rootDir?: string;
-    entry?: string[];
-    extensions?: string[];
-    ignore?: string[];
-    reportUnusedExports?: boolean;
-    schemaEnums?: Record<string, string[]>;
-    externalContracts?: string[];
-    failOn?: FailOn;
-    json?: boolean;
-    includeConventionalEntries?: boolean;
-    skip3?: boolean;
-    skip4?: boolean;
-    verbose?: boolean;
-}
-export type RuleSeverity = "error" | "warning" | "off";
-export interface Config {
-    rootDir?: string;
-    entry?: string[];
-    extensions?: string[];
-    ignore?: string[];
-    externalContracts?: string[];
-    reportUnusedExports?: boolean;
-    includeConventionalEntries?: boolean;
-    failOn?: FailOn;
-    json?: boolean;
-    verbose?: boolean;
-    layers?: {
-        smtTimeoutMs?: number;
-        isolateMemoryLimitMb?: number;
-        enableConcolicProof?: boolean;
-        skip3?: boolean;
-        skip4?: boolean;
-    };
-    rules?: Record<string, RuleSeverity>;
-}
-export interface ResolvedOptions {
-    rootDir: string;
-    entry: string[];
-    extensions: string[];
-    ignore: string[];
-    reportUnusedExports: boolean;
-    schemaEnums: Record<string, string[]>;
-    failOn: FailOn;
-    json: boolean;
-    includeConventionalEntries: boolean;
-    monorepo?: MonorepoGraph;
-    pathAliases: Map<string, string[]>;
-    baseUrl?: string;
-    externalContracts: string[];
-    verbose: boolean;
-    layers: {
-        smtTimeoutMs: number;
-        isolateMemoryLimitMb: number;
-        enableConcolicProof: boolean;
-        skip3: boolean;
-        skip4: boolean;
-    };
-    rules: Record<string, RuleSeverity>;
-}
-export interface AnalysisSummary {
-    filesDiscovered: number;
-    filesParsed: number;
-    filesRecovered: number;
-    filesFallback: number;
-    edges: number;
-    entryPoints: number;
-    stronglyConnectedComponents: number;
-    cycles: number;
-    findings: number;
-    errors: number;
-    warnings: number;
-}
-export interface AnalysisReport {
-    version: string;
-    rootDir: string;
-    entryPoints: string[];
-    summary: AnalysisSummary;
-    findings: Finding[];
-    modules: Array<{
-        path: string;
-        parseStatus: ParseStatus;
-        exports: Array<{
-            name: string;
-            exportedAs: string;
-            isDefault: boolean;
-            isReExport: boolean;
-            isWildcard: boolean;
-            isTypeOnly?: boolean;
-            isExternalContract?: boolean;
-        }>;
-        edges: Array<{
-            kind: EdgeKind;
-            specifier: string;
-            target?: string;
-            resolution: DependencyEdge["resolution"];
-        }>;
-    }>;
-    components: Array<{
-        id: number;
-        modules: string[];
-        isCycle: boolean;
-    }>;
-}
-export interface AnalysisContext {
-    options: ResolvedOptions;
-    modules: Map<string, ModuleRecord>;
-    entryPoints: Set<string>;
-    reachable: Set<string>;
-    maybeReachable: Set<string>;
-    hasReachableUnknownDynamicBoundary: boolean;
-    components: StronglyConnectedComponent[];
-    usedExports: Set<string>;
-    usedMembers: Set<string>;
-    candidateBranches: CandidateBranch[];
-    dynamicImportCandidates: DynamicImportCandidate[];
-    monorepo?: MonorepoGraph;
-    semanticGraph?: any;
-    symbolicContracts?: Map<string, any>;
-}
-export interface PluginAdapter {
-    getAst(fileId: string): any;
-    getSymbol(name: string, fileId: string): any;
-    getType(node: any): string | undefined;
-    getDependencies(fileId: string): string[];
-    getConfig(): ResolvedOptions;
-    readFile(filename: string): Promise<string | null>;
-    readJson(filename: string): Promise<any | null>;
-    emitFinding(finding: Omit<Finding, "rule">): void;
-    markAsUsed(fileId: string, symbol?: string): void;
-    attachMetadata(node: any, key: string, value: any): void;
-}
-export interface PluginLifecycle {
-    onProjectInit?(adapter: PluginAdapter): void | Promise<void>;
-    onFileStart?(fileId: string, adapter: PluginAdapter): void | Promise<void>;
-    onASTNode?(node: any, fileId: string, adapter: PluginAdapter): void;
-    onAnalysisComplete?(adapter: PluginAdapter): void | Promise<void>;
-}
-export interface AnalyzerPlugin {
-    name: string;
-    version: string;
-    enabled?: boolean;
-    detect?(adapter: PluginAdapter): Promise<boolean>;
-    lifecycle: PluginLifecycle;
-}
-export declare const CONFIDENCE_RANK: Record<FailOn, number>;
-export declare function defineConfig(config: Config): Config;

package/dist/types.js

@@ -1,11 +0,0 @@
-export const CONFIDENCE_RANK = {
-    info: 0,
-    low: 1,
-    medium: 2,
-    high: 3,
-    none: -1, // A value for 'none' to allow comparison
-};
-export function defineConfig(config) {
-    return config;
-}
-//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAwTA,MAAM,CAAC,MAAM,eAAe,GAA2B;IACrD,IAAI,EAAE,CAAC;IACP,GAAG,EAAE,CAAC;IACN,MAAM,EAAE,CAAC;IACT,IAAI,EAAE,CAAC;IACP,IAAI,EAAE,CAAC,CAAC,EAAE,yCAAyC;CACpD,CAAC;AAEF,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/workspace.d.ts

@@ -1,6 +0,0 @@
-import type { MonorepoGraph } from './types.js';
-/**
- * Resolves all sub-packages in a Monorepo workspace.
- * Uses POSIX-style path logic for internal calculations to support Windows.
- */
-export declare function buildMonorepoTopology(rootPath: string): Promise<MonorepoGraph>;

package/dist/workspace.js

@@ -1,105 +0,0 @@
-import path from 'pathe';
-import fs from 'node:fs';
-import fg from 'fast-glob';
-import * as yaml from 'js-yaml';
-import { normalizeAbsolute, readJsonFile } from './fs-utils.js';
-/**
- * Resolves all sub-packages in a Monorepo workspace.
- * Uses POSIX-style path logic for internal calculations to support Windows.
- */
-export async function buildMonorepoTopology(rootPath) {
-    const absoluteRoot = normalizeAbsolute(rootPath);
-    const packageMap = new Map();
-    const packageGlobs = [];
-    // 1. Detect pnpm-workspace.yaml
-    const pnpmWorkspacePath = path.join(absoluteRoot, 'pnpm-workspace.yaml');
-    if (fs.existsSync(pnpmWorkspacePath)) {
-        try {
-            const content = fs.readFileSync(pnpmWorkspacePath, 'utf-8');
-            const doc = yaml.load(content);
-            if (doc?.packages && Array.isArray(doc.packages)) {
-                packageGlobs.push(...doc.packages);
-            }
-        }
-        catch (e) {
-            // Ignore parse warnings on malformed workspace configs
-        }
-    }
-    // 2. Detect Yarn/NPM workspaces in package.json
-    const rootPackageJsonPath = path.join(absoluteRoot, 'package.json');
-    if (fs.existsSync(rootPackageJsonPath)) {
-        const rootManifest = await readJsonFile(rootPackageJsonPath);
-        if (rootManifest) {
-            if (Array.isArray(rootManifest.workspaces)) {
-                packageGlobs.push(...rootManifest.workspaces);
-            }
-            else if (rootManifest.workspaces?.packages && Array.isArray(rootManifest.workspaces.packages)) {
-                packageGlobs.push(...rootManifest.workspaces.packages);
-            }
-        }
-    }
-    // Default to common patterns if nothing found
-    if (packageGlobs.length === 0) {
-        packageGlobs.push('packages/*', 'apps/*');
-    }
-    // 3. Find all package.json files matching the globs
-    const manifestFiles = await fg(packageGlobs.map(g => path.posix.join(g, 'package.json')), { cwd: absoluteRoot, absolute: true, ignore: ['**/node_modules/**'] });
-    for (const manifestPath of manifestFiles) {
-        const manifest = await readJsonFile(manifestPath);
-        if (!manifest || !manifest.name)
-            continue;
-        const pkgName = manifest.name;
-        const location = normalizeAbsolute(path.dirname(manifestPath));
-        const allDeps = new Set([
-            ...Object.keys(manifest.dependencies || {}),
-            ...Object.keys(manifest.devDependencies || {}),
-            ...Object.keys(manifest.peerDependencies || {}),
-        ]);
-        packageMap.set(pkgName, {
-            name: pkgName,
-            location,
-            relativePath: path.posix.relative(absoluteRoot, location),
-            manifestPath: normalizeAbsolute(manifestPath),
-            dependencies: new Set(),
-            allDependencies: allDeps,
-        });
-    }
-    // 4. Resolve internal workspace dependencies
-    const internalPackageNames = new Set(packageMap.keys());
-    for (const pkg of packageMap.values()) {
-        for (const depName of pkg.allDependencies) {
-            if (internalPackageNames.has(depName)) {
-                pkg.dependencies.add(depName);
-            }
-        }
-    }
-    // 5. Topological Sort
-    const topologicalOrder = [];
-    const visited = new Set();
-    const visiting = new Set();
-    function visit(name) {
-        if (visiting.has(name))
-            return;
-        if (visited.has(name))
-            return;
-        visiting.add(name);
-        const pkg = packageMap.get(name);
-        if (pkg) {
-            for (const dep of pkg.dependencies) {
-                visit(dep);
-            }
-        }
-        visiting.delete(name);
-        visited.add(name);
-        topologicalOrder.push(name);
-    }
-    for (const name of packageMap.keys()) {
-        visit(name);
-    }
-    return {
-        rootPath: absoluteRoot,
-        packageMap,
-        topologicalOrder,
-    };
-}
-//# sourceMappingURL=workspace.js.map

package/dist/workspace.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"workspace.js","sourceRoot":"","sources":["../src/workspace.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,OAAO,CAAC;AACzB,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,EAAE,MAAM,WAAW,CAAC;AAC3B,OAAO,KAAK,IAAI,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,iBAAiB,EAA0B,YAAY,EAAE,MAAM,eAAe,CAAC;AAGxF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,QAAgB;IAC1D,MAAM,YAAY,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACjD,MAAM,UAAU,GAAG,IAAI,GAAG,EAA4B,CAAC;IAEvD,MAAM,YAAY,GAAa,EAAE,CAAC;IAElC,gCAAgC;IAChC,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,qBAAqB,CAAC,CAAC;IACzE,IAAI,EAAE,CAAC,UAAU,CAAC,iBAAiB,CAAC,EAAE,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC;YAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAQ,CAAC;YACtC,IAAI,GAAG,EAAE,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjD,YAAY,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,uDAAuD;QACzD,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,MAAM,mBAAmB,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;IACpE,IAAI,EAAE,CAAC,UAAU,CAAC,mBAAmB,CAAC,EAAE,CAAC;QACvC,MAAM,YAAY,GAAG,MAAM,YAAY,CAAsB,mBAAmB,CAAC,CAAC;QAClF,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC3C,YAAY,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC;YAChD,CAAC;iBAAM,IAAI,YAAY,CAAC,UAAU,EAAE,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChG,YAAY,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,YAAY,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,oDAAoD;IACpD,MAAM,aAAa,GAAG,MAAM,EAAE,CAC5B,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,EACzD,EAAE,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,oBAAoB,CAAC,EAAE,CACtE,CAAC;IAEF,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,MAAM,YAAY,CAAsB,YAAY,CAAC,CAAC;QACvE,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI;YAAE,SAAS;QAE1C,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAc,CAAC;QACxC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS;YAC9B,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC;YAC3C,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,IAAI,EAAE,CAAC;YAC9C,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,IAAI,EAAE,CAAC;SAChD,CAAC,CAAC;QAEH,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE;YACtB,IAAI,EAAE,OAAO;YACb,QAAQ;YACR,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,YAAY,EAAE,QAAQ,CAAC;YACzD,YAAY,EAAE,iBAAiB,CAAC,YAAY,CAAC;YAC7C,YAAY,EAAE,IAAI,GAAG,EAAE;YACvB,eAAe,EAAE,OAAO;SACzB,CAAC,CAAC;IACL,CAAC;IAED,6CAA6C;IAC7C,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACxD,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,OAAO,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;YAC1C,IAAI,oBAAoB,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACtC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,SAAS,KAAK,CAAC,IAAY;QACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QAE9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,GAAG,EAAE,CAAC;YACR,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;gBACnC,KAAK,CAAC,GAAG,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,YAAY;QACtB,UAAU;QACV,gBAAgB;KACjB,CAAC;AACJ,CAAC"}