optave-codegraph 3.13.0

package/dist/graph/classifiers/roles.js

@@ -0,0 +1,180 @@
+/**
+ * Node role classification — pure logic, no DB.
+ *
+ * Roles: entry, core, utility, adapter, leaf, dead-*, test-only
+ *
+ * Dead sub-categories refine the coarse "dead" bucket:
+ *   dead-leaf       — parameters, properties, constants (leaf nodes by definition)
+ *   dead-entry      — framework dispatch: CLI commands, MCP tools, event handlers
+ *   dead-ffi        — cross-language FFI boundaries (e.g. Rust napi-rs bindings)
+ *   dead-unresolved — genuinely unreferenced callables (the real dead code)
+ */
+export const FRAMEWORK_ENTRY_PREFIXES = ['route:', 'event:', 'command:'];
+// ── Dead sub-classification helpers ────────────────────────────────
+const LEAF_KINDS = new Set(['parameter', 'property', 'constant']);
+/**
+ * Type definition kinds that are consumed via type annotations rather than calls.
+ * These have no inbound call edges by design — they are "used" by type references,
+ * struct literals, and generic parameters, none of which produce call edges.
+ * If the same file has active callables, type definitions are almost certainly live.
+ */
+const TYPE_DEF_KINDS = new Set(['struct', 'enum', 'trait', 'type', 'interface', 'record']);
+const FFI_EXTENSIONS = new Set(['.rs', '.c', '.cpp', '.h', '.go', '.java', '.cs']);
+/** Path patterns indicating framework-dispatched entry points. */
+const ENTRY_PATH_PATTERNS = [
+    /cli[/\\]commands[/\\]/,
+    /mcp[/\\]/,
+    /routes?[/\\]/,
+    /handlers?[/\\]/,
+    /middleware[/\\]/,
+];
+/**
+ * Well-known Commander.js dispatch method names.
+ * When a method with one of these names lives in a file that matches
+ * ENTRY_PATH_PATTERNS, it is the actual framework entry point — not merely a
+ * candidate — so it must be classified as `entry` rather than `dead-entry`.
+ *
+ * `execute` — the action callback invoked by Commander on `program.action()`.
+ * `validate` — a pre-execution argument/option validator called before `execute`.
+ */
+const COMMANDER_DISPATCH_NAMES = new Set(['execute', 'validate']);
+/**
+ * Refine a "dead" classification into a sub-category.
+ */
+function classifyDeadSubRole(node) {
+    // Leaf kinds are dead by definition — they can't have callers
+    if (node.kind && LEAF_KINDS.has(node.kind))
+        return 'dead-leaf';
+    if (node.file) {
+        // Cross-language FFI: compiled-language files in a JS/TS project
+        // Priority: dead-ffi is checked before dead-entry deliberately — an FFI
+        // boundary is a more fundamental classification than a path-based hint.
+        // A .so/.dll in a routes/ directory is still FFI, not an entry point.
+        const dotIdx = node.file.lastIndexOf('.');
+        if (dotIdx !== -1 && FFI_EXTENSIONS.has(node.file.slice(dotIdx)))
+            return 'dead-ffi';
+        // Framework-dispatched entry points (CLI commands, MCP tools, routes)
+        if (ENTRY_PATH_PATTERNS.some((p) => p.test(node.file)))
+            return 'dead-entry';
+    }
+    return 'dead-unresolved';
+}
+// ── Helpers ────────────────────────────────────────────────────────
+export function median(sorted) {
+    if (sorted.length === 0)
+        return 0;
+    const mid = Math.floor(sorted.length / 2);
+    return sorted.length % 2 === 0 ? (sorted[mid - 1] + sorted[mid]) / 2 : sorted[mid];
+}
+/**
+ * Compute median fan-in and fan-out across nodes with non-zero values.
+ * Used as thresholds for "high" fan-in/out classification.
+ */
+function computeFanMedians(nodes) {
+    const nonZeroFanIn = nodes
+        .filter((n) => n.fanIn > 0)
+        .map((n) => n.fanIn)
+        .sort((a, b) => a - b);
+    const nonZeroFanOut = nodes
+        .filter((n) => n.fanOut > 0)
+        .map((n) => n.fanOut)
+        .sort((a, b) => a - b);
+    return { fanIn: median(nonZeroFanIn), fanOut: median(nonZeroFanOut) };
+}
+/**
+ * Classify a node with `fanIn === 0` that is not exported.
+ * Covers framework-active constants, test-only callables, and the dead-* family.
+ */
+function classifyUnreferencedNode(node) {
+    if (node.hasActiveFileSiblings) {
+        if (node.kind === 'constant') {
+            // Constants consumed via identifier reference (not calls) have no
+            // inbound call edges. If the same file has active callables, the
+            // constant is almost certainly used locally — classify as leaf.
+            return 'leaf';
+        }
+        if (node.kind && TYPE_DEF_KINDS.has(node.kind)) {
+            // Type definitions (struct, enum, trait, type, interface, record) are
+            // consumed via type annotations and struct literals — not calls — so they
+            // never get inbound call edges. If the same file has active callables,
+            // these types are almost certainly live — classify as leaf.
+            return 'leaf';
+        }
+        if (node.kind === 'method' && node.fanOut > 0) {
+            // Methods implementing interfaces are dispatched via conditional property
+            // access e.g. `if (v.enterFunction) v.enterFunction(...)`. Codegraph
+            // resolves the call to the property accessor rather than to the concrete
+            // method implementation, so the method has no inbound call edge. We
+            // require `fanOut > 0` as evidence of non-triviality, mirroring the
+            // function case — trivially-inert dead helper methods remain visible.
+            return 'leaf';
+        }
+        if (node.kind === 'function' && node.fanOut > 0) {
+            // Functions referenced as logical-or fallback defaults — e.g.
+            // `const fn = options._fetchLatest || fetchLatestVersion` — appear as
+            // value references, not call sites, so no call edge is produced. We
+            // require `fanOut > 0` as evidence that the function is non-trivial
+            // (i.e. it calls something), ruling out truly inert dead helpers.
+            return 'leaf';
+        }
+    }
+    if (node.testOnlyFanIn != null && node.testOnlyFanIn > 0)
+        return 'test-only';
+    return classifyDeadSubRole(node);
+}
+/**
+ * Pick a role from fan-in/fan-out shape: core/utility/adapter/leaf.
+ * Called after entry/test-only/dead cases have been ruled out.
+ */
+function classifyByFanShape(highIn, highOut) {
+    if (highIn && !highOut)
+        return 'core';
+    if (highIn && highOut)
+        return 'utility';
+    if (!highIn && highOut)
+        return 'adapter';
+    return 'leaf';
+}
+/**
+ * Apply role-classification rules to a single node.
+ * Order matters — framework entries are tagged first, then dead/test cases,
+ * then the fan-in/fan-out shape decides among the structural roles.
+ */
+function classifyNodeRole(node, medFanIn, medFanOut) {
+    if (FRAMEWORK_ENTRY_PREFIXES.some((p) => node.name.startsWith(p)))
+        return 'entry';
+    if (node.fanIn === 0) {
+        if (!node.isExported) {
+            // Well-known Commander.js dispatch methods (execute, validate) in framework
+            // directories are confirmed entry points, not candidates. Promote them to
+            // `entry` directly so they don't appear in `--role dead` output.
+            if (node.file &&
+                COMMANDER_DISPATCH_NAMES.has(node.name) &&
+                ENTRY_PATH_PATTERNS.some((p) => p.test(node.file))) {
+                return 'entry';
+            }
+            return classifyUnreferencedNode(node);
+        }
+        return 'entry';
+    }
+    const hasProdFanIn = typeof node.productionFanIn === 'number';
+    if (hasProdFanIn && node.productionFanIn === 0 && !node.isExported)
+        return 'test-only';
+    const highIn = node.fanIn >= medFanIn;
+    const highOut = node.fanOut >= medFanOut && node.fanOut > 0;
+    return classifyByFanShape(highIn, highOut);
+}
+/**
+ * Classify nodes into architectural roles based on fan-in/fan-out metrics.
+ */
+export function classifyRoles(nodes, medianOverrides) {
+    if (nodes.length === 0)
+        return new Map();
+    const { fanIn: medFanIn, fanOut: medFanOut } = medianOverrides ?? computeFanMedians(nodes);
+    const result = new Map();
+    for (const node of nodes) {
+        result.set(node.id, classifyNodeRole(node, medFanIn, medFanOut));
+    }
+    return result;
+}
+//# sourceMappingURL=roles.js.map

package/dist/graph/classifiers/roles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"roles.js","sourceRoot":"","sources":["../../../src/graph/classifiers/roles.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,MAAM,CAAC,MAAM,wBAAwB,GAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;AAE5F,sEAAsE;AAEtE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;AAElE;;;;;GAKG;AACH,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAC;AAE3F,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAEnF,kEAAkE;AAClE,MAAM,mBAAmB,GAAsB;IAC7C,uBAAuB;IACvB,UAAU;IACV,cAAc;IACd,gBAAgB;IAChB,iBAAiB;CAClB,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,wBAAwB,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC;AAOlE;;GAEG;AACH,SAAS,mBAAmB,CAAC,IAAsB;IACjD,8DAA8D;IAC9D,IAAI,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,WAAW,CAAC;IAE/D,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,iEAAiE;QACjE,wEAAwE;QACxE,wEAAwE;QACxE,sEAAsE;QACtE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,MAAM,KAAK,CAAC,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YAAE,OAAO,UAAU,CAAC;QAEpF,sEAAsE;QACtE,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;YAAE,OAAO,YAAY,CAAC;IAC/E,CAAC;IAED,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAED,sEAAsE;AAEtE,MAAM,UAAU,MAAM,CAAC,MAAgB;IACrC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC1C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAE,GAAG,MAAM,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC;AACxF,CAAC;AAyBD;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAA+B;IACxD,MAAM,YAAY,GAAG,KAAK;SACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;SACnB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,MAAM,aAAa,GAAG,KAAK;SACxB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;SACpB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,YAAY,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC;AACxE,CAAC;AAED;;;GAGG;AACH,SAAS,wBAAwB,CAAC,IAA4B;IAC5D,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC7B,kEAAkE;YAClE,iEAAiE;YACjE,gEAAgE;YAChE,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,sEAAsE;YACtE,0EAA0E;YAC1E,uEAAuE;YACvE,4DAA4D;YAC5D,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,0EAA0E;YAC1E,qEAAqE;YACrE,yEAAyE;YACzE,oEAAoE;YACpE,oEAAoE;YACpE,sEAAsE;YACtE,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChD,8DAA8D;YAC9D,sEAAsE;YACtE,oEAAoE;YACpE,oEAAoE;YACpE,kEAAkE;YAClE,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC;IAC7E,OAAO,mBAAmB,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,MAAe,EAAE,OAAgB;IAC3D,IAAI,MAAM,IAAI,CAAC,OAAO;QAAE,OAAO,MAAM,CAAC;IACtC,IAAI,MAAM,IAAI,OAAO;QAAE,OAAO,SAAS,CAAC;IACxC,IAAI,CAAC,MAAM,IAAI,OAAO;QAAE,OAAO,SAAS,CAAC;IACzC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,IAA4B,EAAE,QAAgB,EAAE,SAAiB;IACzF,IAAI,wBAAwB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAAE,OAAO,OAAO,CAAC;IAElF,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,4EAA4E;YAC5E,0EAA0E;YAC1E,iEAAiE;YACjE,IACE,IAAI,CAAC,IAAI;gBACT,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;gBACvC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC,EACnD,CAAC;gBACD,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,OAAO,wBAAwB,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,YAAY,GAAG,OAAO,IAAI,CAAC,eAAe,KAAK,QAAQ,CAAC;IAC9D,IAAI,YAAY,IAAI,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;QAAE,OAAO,WAAW,CAAC;IAEvF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,QAAQ,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5D,OAAO,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC3B,KAA+B,EAC/B,eAAmD;IAEnD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAEzC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,GAAG,eAAe,IAAI,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE3F,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgB,CAAC;IACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/graph/index.d.ts

@@ -0,0 +1,5 @@
+export { bfs, fanInOut, louvainCommunities, shortestPath, tarjan } from './algorithms/index.js';
+export { buildDependencyGraph, buildStructureGraph, buildTemporalGraph } from './builders/index.js';
+export { classifyRoles, DEFAULT_WEIGHTS, FRAMEWORK_ENTRY_PREFIXES, minMaxNormalize, ROLE_WEIGHTS, scoreRisk, } from './classifiers/index.js';
+export { CodeGraph } from './model.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAChG,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACpG,OAAO,EACL,aAAa,EACb,eAAe,EACf,wBAAwB,EACxB,eAAe,EACf,YAAY,EACZ,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC"}

package/dist/graph/index.js

@@ -0,0 +1,6 @@
+// Graph subsystem barrel export
+export { bfs, fanInOut, louvainCommunities, shortestPath, tarjan } from './algorithms/index.js';
+export { buildDependencyGraph, buildStructureGraph, buildTemporalGraph } from './builders/index.js';
+export { classifyRoles, DEFAULT_WEIGHTS, FRAMEWORK_ENTRY_PREFIXES, minMaxNormalize, ROLE_WEIGHTS, scoreRisk, } from './classifiers/index.js';
+export { CodeGraph } from './model.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAEhC,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,kBAAkB,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAChG,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACpG,OAAO,EACL,aAAa,EACb,eAAe,EACf,wBAAwB,EACxB,eAAe,EACf,YAAY,EACZ,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC"}

package/dist/graph/model.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Unified in-memory graph model.
+ *
+ * Stores directed (default) or undirected graphs with node/edge attributes.
+ * Node IDs are always strings. DB integer IDs should be stringified before use.
+ */
+export interface NodeAttrs {
+    [key: string]: unknown;
+}
+export interface EdgeAttrs {
+    [key: string]: unknown;
+}
+export interface CodeGraphOpts {
+    directed?: boolean;
+}
+export declare class CodeGraph {
+    private _directed;
+    private _nodes;
+    private _successors;
+    private _predecessors;
+    constructor(opts?: CodeGraphOpts);
+    get directed(): boolean;
+    get nodeCount(): number;
+    get edgeCount(): number;
+    addNode(id: string | number, attrs?: NodeAttrs): this;
+    hasNode(id: string | number): boolean;
+    getNodeAttrs(id: string | number): NodeAttrs | undefined;
+    nodes(): IterableIterator<[string, NodeAttrs]>;
+    nodeIds(): string[];
+    addEdge(source: string | number, target: string | number, attrs?: EdgeAttrs): this;
+    hasEdge(source: string | number, target: string | number): boolean;
+    getEdgeAttrs(source: string | number, target: string | number): EdgeAttrs | undefined;
+    edges(): Generator<[string, string, EdgeAttrs]>;
+    private _directedEdges;
+    private _undirectedEdges;
+    /** Direct successors of a node (outgoing edges). */
+    successors(id: string | number): string[];
+    /** Direct predecessors of a node (incoming edges). */
+    predecessors(id: string | number): string[];
+    /** All neighbors (union of successors + predecessors). */
+    neighbors(id: string | number): string[];
+    outDegree(id: string | number): number;
+    inDegree(id: string | number): number;
+    /** Return a new graph containing only nodes matching the predicate. */
+    subgraph(predicate: (id: string, attrs: NodeAttrs) => boolean): CodeGraph;
+    /** Return a new graph containing only edges matching the predicate. */
+    filterEdges(predicate: (source: string, target: string, attrs: EdgeAttrs) => boolean): CodeGraph;
+    /** Convert to flat edge array for native Rust interop. */
+    toEdgeArray(): {
+        source: string;
+        target: string;
+    }[];
+    clone(): CodeGraph;
+    /** Merge another graph into this one. Nodes/edges from other override on conflict. */
+    merge(other: CodeGraph): this;
+}
+//# sourceMappingURL=model.d.ts.map

package/dist/graph/model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../src/graph/model.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,SAAS;IACxB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,SAAS;IACxB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAOD,qBAAa,SAAS;IACpB,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,MAAM,CAAyB;IACvC,OAAO,CAAC,WAAW,CAAsC;IACzD,OAAO,CAAC,aAAa,CAAsC;gBAE/C,IAAI,GAAE,aAAkB;IAOpC,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,IAAI,SAAS,IAAI,MAAM,CAKtB;IAID,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,GAAE,SAAc,GAAG,IAAI;IAQzD,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO;IAIrC,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS;IAIxD,KAAK,IAAI,gBAAgB,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAI9C,OAAO,IAAI,MAAM,EAAE;IAMnB,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,KAAK,GAAE,SAAc,GAAG,IAAI;IAiBtF,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO;IAMlE,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,SAAS;IAMpF,KAAK,IAAI,SAAS,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IAQhD,OAAO,CAAE,cAAc;IAMvB,OAAO,CAAE,gBAAgB;IAezB,oDAAoD;IACpD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE;IAMzC,sDAAsD;IACtD,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE;IAM3C,0DAA0D;IAC1D,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,EAAE;IAUxC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAKtC,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM;IAOrC,uEAAuE;IACvE,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,KAAK,OAAO,GAAG,SAAS;IAazE,uEAAuE;IACvE,WAAW,CAAC,SAAS,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,KAAK,OAAO,GAAG,SAAS;IAehG,0DAA0D;IAC1D,WAAW,IAAI;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE;IAUnD,KAAK,IAAI,SAAS;IAWlB,sFAAsF;IACtF,KAAK,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;CAS9B"}

package/dist/graph/model.js

@@ -0,0 +1,205 @@
+/**
+ * Unified in-memory graph model.
+ *
+ * Stores directed (default) or undirected graphs with node/edge attributes.
+ * Node IDs are always strings. DB integer IDs should be stringified before use.
+ */
+/** Canonical key for an undirected edge — smallest ID first, null-byte separated. */
+function undirectedEdgeKey(a, b) {
+    return a < b ? `${a}\0${b}` : `${b}\0${a}`;
+}
+export class CodeGraph {
+    _directed;
+    _nodes;
+    _successors;
+    _predecessors;
+    constructor(opts = {}) {
+        this._directed = opts.directed !== false;
+        this._nodes = new Map();
+        this._successors = new Map();
+        this._predecessors = new Map();
+    }
+    get directed() {
+        return this._directed;
+    }
+    get nodeCount() {
+        return this._nodes.size;
+    }
+    get edgeCount() {
+        let count = 0;
+        for (const targets of this._successors.values())
+            count += targets.size;
+        // Undirected graphs store each edge twice (a→b and b→a)
+        return this._directed ? count : count / 2;
+    }
+    // ─── Node operations ────────────────────────────────────────────
+    addNode(id, attrs = {}) {
+        const key = String(id);
+        this._nodes.set(key, attrs);
+        if (!this._successors.has(key))
+            this._successors.set(key, new Map());
+        if (!this._predecessors.has(key))
+            this._predecessors.set(key, new Map());
+        return this;
+    }
+    hasNode(id) {
+        return this._nodes.has(String(id));
+    }
+    getNodeAttrs(id) {
+        return this._nodes.get(String(id));
+    }
+    nodes() {
+        return this._nodes.entries();
+    }
+    nodeIds() {
+        return [...this._nodes.keys()];
+    }
+    // ─── Edge operations ────────────────────────────────────────────
+    addEdge(source, target, attrs = {}) {
+        const src = String(source);
+        const tgt = String(target);
+        // Auto-add nodes if missing
+        if (!this._nodes.has(src))
+            this.addNode(src);
+        if (!this._nodes.has(tgt))
+            this.addNode(tgt);
+        this._successors.get(src).set(tgt, attrs);
+        this._predecessors.get(tgt).set(src, attrs);
+        if (!this._directed) {
+            this._successors.get(tgt).set(src, attrs);
+            this._predecessors.get(src).set(tgt, attrs);
+        }
+        return this;
+    }
+    hasEdge(source, target) {
+        const src = String(source);
+        const tgt = String(target);
+        return this._successors.has(src) && this._successors.get(src).has(tgt);
+    }
+    getEdgeAttrs(source, target) {
+        const src = String(source);
+        const tgt = String(target);
+        return this._successors.get(src)?.get(tgt);
+    }
+    *edges() {
+        if (this._directed) {
+            yield* this._directedEdges();
+        }
+        else {
+            yield* this._undirectedEdges();
+        }
+    }
+    *_directedEdges() {
+        for (const [src, targets] of this._successors) {
+            for (const [tgt, attrs] of targets)
+                yield [src, tgt, attrs];
+        }
+    }
+    *_undirectedEdges() {
+        // \0 is safe as separator — node IDs are file paths/symbols, never contain null bytes
+        const seen = new Set();
+        for (const [src, targets] of this._successors) {
+            for (const [tgt, attrs] of targets) {
+                const key = undirectedEdgeKey(src, tgt);
+                if (seen.has(key))
+                    continue;
+                seen.add(key);
+                yield [src, tgt, attrs];
+            }
+        }
+    }
+    // ─── Adjacency ──────────────────────────────────────────────────
+    /** Direct successors of a node (outgoing edges). */
+    successors(id) {
+        const key = String(id);
+        const map = this._successors.get(key);
+        return map ? [...map.keys()] : [];
+    }
+    /** Direct predecessors of a node (incoming edges). */
+    predecessors(id) {
+        const key = String(id);
+        const map = this._predecessors.get(key);
+        return map ? [...map.keys()] : [];
+    }
+    /** All neighbors (union of successors + predecessors). */
+    neighbors(id) {
+        const key = String(id);
+        const set = new Set();
+        const succ = this._successors.get(key);
+        if (succ)
+            for (const k of succ.keys())
+                set.add(k);
+        const pred = this._predecessors.get(key);
+        if (pred)
+            for (const k of pred.keys())
+                set.add(k);
+        return [...set];
+    }
+    outDegree(id) {
+        const map = this._successors.get(String(id));
+        return map ? map.size : 0;
+    }
+    inDegree(id) {
+        const map = this._predecessors.get(String(id));
+        return map ? map.size : 0;
+    }
+    // ─── Filtering ──────────────────────────────────────────────────
+    /** Return a new graph containing only nodes matching the predicate. */
+    subgraph(predicate) {
+        const g = new CodeGraph({ directed: this._directed });
+        for (const [id, attrs] of this._nodes) {
+            if (predicate(id, attrs))
+                g.addNode(id, { ...attrs });
+        }
+        for (const [src, tgt, attrs] of this.edges()) {
+            if (g.hasNode(src) && g.hasNode(tgt)) {
+                g.addEdge(src, tgt, { ...attrs });
+            }
+        }
+        return g;
+    }
+    /** Return a new graph containing only edges matching the predicate. */
+    filterEdges(predicate) {
+        const g = new CodeGraph({ directed: this._directed });
+        for (const [id, attrs] of this._nodes) {
+            g.addNode(id, { ...attrs });
+        }
+        for (const [src, tgt, attrs] of this.edges()) {
+            if (predicate(src, tgt, attrs)) {
+                g.addEdge(src, tgt, { ...attrs });
+            }
+        }
+        return g;
+    }
+    // ─── Conversion ─────────────────────────────────────────────────
+    /** Convert to flat edge array for native Rust interop. */
+    toEdgeArray() {
+        const result = [];
+        for (const [source, target] of this.edges()) {
+            result.push({ source, target });
+        }
+        return result;
+    }
+    // ─── Utilities ──────────────────────────────────────────────────
+    clone() {
+        const g = new CodeGraph({ directed: this._directed });
+        for (const [id, attrs] of this._nodes) {
+            g.addNode(id, { ...attrs });
+        }
+        for (const [src, tgt, attrs] of this.edges()) {
+            g.addEdge(src, tgt, { ...attrs });
+        }
+        return g;
+    }
+    /** Merge another graph into this one. Nodes/edges from other override on conflict. */
+    merge(other) {
+        for (const [id, attrs] of other.nodes()) {
+            this.addNode(id, attrs);
+        }
+        for (const [src, tgt, attrs] of other.edges()) {
+            this.addEdge(src, tgt, attrs);
+        }
+        return this;
+    }
+}
+//# sourceMappingURL=model.js.map

package/dist/graph/model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../../src/graph/model.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAcH,qFAAqF;AACrF,SAAS,iBAAiB,CAAC,CAAS,EAAE,CAAS;IAC7C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;AAC7C,CAAC;AAED,MAAM,OAAO,SAAS;IACZ,SAAS,CAAU;IACnB,MAAM,CAAyB;IAC/B,WAAW,CAAsC;IACjD,aAAa,CAAsC;IAE3D,YAAY,OAAsB,EAAE;QAClC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;IACjC,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,IAAI,SAAS;QACX,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE;YAAE,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;QACvE,wDAAwD;QACxD,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,mEAAmE;IAEnE,OAAO,CAAC,EAAmB,EAAE,QAAmB,EAAE;QAChD,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACrE,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,EAAmB;QACzB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,YAAY,CAAC,EAAmB;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACjC,CAAC;IAED,mEAAmE;IAEnE,OAAO,CAAC,MAAuB,EAAE,MAAuB,EAAE,QAAmB,EAAE;QAC7E,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,4BAA4B;QAC5B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAE7C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAE7C,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC3C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,CAAC,MAAuB,EAAE,MAAuB;QACtD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1E,CAAC;IAED,YAAY,CAAC,MAAuB,EAAE,MAAuB;QAC3D,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED,CAAC,KAAK;QACJ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,KAAK,CAAC,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACjC,CAAC;IACH,CAAC;IAEO,CAAC,cAAc;QACrB,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO;gBAAE,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAEO,CAAC,gBAAgB;QACvB,sFAAsF;QACtF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAC9C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;gBACnC,MAAM,GAAG,GAAG,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACxC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,mEAAmE;IAEnE,oDAAoD;IACpD,UAAU,CAAC,EAAmB;QAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACpC,CAAC;IAED,sDAAsD;IACtD,YAAY,CAAC,EAAmB;QAC9B,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACpC,CAAC;IAED,0DAA0D;IAC1D,SAAS,CAAC,EAAmB;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,SAAS,CAAC,EAAmB;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,QAAQ,CAAC,EAAmB;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,mEAAmE;IAEnE,uEAAuE;IACvE,QAAQ,CAAC,SAAoD;QAC3D,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QACtD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,IAAI,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC;gBAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACxD,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,uEAAuE;IACvE,WAAW,CAAC,SAAwE;QAClF,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QACtD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC7C,IAAI,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC/B,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mEAAmE;IAEnE,0DAA0D;IAC1D,WAAW;QACT,MAAM,MAAM,GAAyC,EAAE,CAAC;QACxD,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC5C,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,mEAAmE;IAEnE,KAAK;QACH,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QACtD,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACtC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;YAC7C,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,sFAAsF;IACtF,KAAK,CAAC,KAAgB;QACpB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/index.cjs

@@ -0,0 +1,16 @@
+/**
+ * CJS compatibility wrapper — delegates to ESM via dynamic import().
+ *
+ * This wrapper always returns a Promise on every Node version, because
+ * import() is unconditionally async. You must always await the result:
+ *
+ *   const codegraph = await require('@optave/codegraph');
+ *
+ * // Named destructuring at require-time does NOT work — always await the full result first.
+ * // BAD:  const { buildGraph } = require('@optave/codegraph');  // buildGraph is undefined
+ * // GOOD: const { buildGraph } = await require('@optave/codegraph');
+ */
+// Note: if import() rejects (e.g. missing dependency), the rejected Promise is cached
+// by the CJS module system and every subsequent require() call will re-surface the same
+// rejection without re-attempting the load.
+module.exports = import('./index.js');

package/dist/index.d.ts

@@ -0,0 +1,37 @@
+/**
+ * codegraph — Programmatic API
+ *
+ * Curated public surface: *Data() query functions, graph building,
+ * export formats, and essential constants. CLI formatters and internal
+ * utilities are not exported — import them directly if needed.
+ *
+ * Usage:
+ *   import { buildGraph, queryNameData, findCycles, exportDOT } from 'optave-codegraph';
+ */
+export { buildGraph } from './domain/graph/builder.js';
+export { findCycles } from './domain/graph/cycles.js';
+export { briefData, childrenData, contextData, diffImpactData, explainData, exportsData, fileDepsData, fnDepsData, fnImpactData, impactAnalysisData, moduleMapData, pathData, queryNameData, rolesData, statsData, whereData, } from './domain/queries.js';
+export { buildEmbeddings, hybridSearchData, multiSearchData, searchData, } from './domain/search/index.js';
+export { astQueryData } from './features/ast.js';
+export { auditData } from './features/audit.js';
+export { batchData } from './features/batch.js';
+export { branchCompareData } from './features/branch-compare.js';
+export { cfgData } from './features/cfg.js';
+export { checkData } from './features/check.js';
+export { coChangeData } from './features/cochange.js';
+export { communitiesData } from './features/communities.js';
+export { complexityData } from './features/complexity.js';
+export { dataflowData } from './features/dataflow.js';
+export { exportDOT, exportJSON, exportMermaid } from './features/export.js';
+export { flowData, listEntryPointsData } from './features/flow.js';
+export { manifestoData } from './features/manifesto.js';
+export { ownersData } from './features/owners.js';
+export { sequenceData } from './features/sequence.js';
+export { hotspotsData, moduleBoundariesData, structureData } from './features/structure.js';
+export { triageData } from './features/triage.js';
+export { loadConfig, loadConfigWithProvenance, resolveUserConfigPath, } from './infrastructure/config.js';
+export type { ArrayCompatSet } from './shared/constants.js';
+export { EXTENSIONS, IGNORE_DIRS } from './shared/constants.js';
+export { AnalysisError, BoundaryError, CodegraphError, ConfigError, DbError, EngineError, ParseError, ResolutionError, } from './shared/errors.js';
+export { EVERY_EDGE_KIND, EVERY_SYMBOL_KIND } from './shared/kinds.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EACL,SAAS,EACT,YAAY,EACZ,WAAW,EACX,cAAc,EACd,WAAW,EACX,WAAW,EACX,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,aAAa,EACb,QAAQ,EACR,aAAa,EACb,SAAS,EACT,SAAS,EACT,SAAS,GACV,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,UAAU,GACX,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAC5E,OAAO,EAAE,QAAQ,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAC5F,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EACL,UAAU,EACV,wBAAwB,EACxB,qBAAqB,GACtB,MAAM,4BAA4B,CAAC;AACpC,YAAY,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EACL,aAAa,EACb,aAAa,EACb,cAAc,EACd,WAAW,EACX,OAAO,EACP,WAAW,EACX,UAAU,EACV,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/index.js

@@ -0,0 +1,36 @@
+/**
+ * codegraph — Programmatic API
+ *
+ * Curated public surface: *Data() query functions, graph building,
+ * export formats, and essential constants. CLI formatters and internal
+ * utilities are not exported — import them directly if needed.
+ *
+ * Usage:
+ *   import { buildGraph, queryNameData, findCycles, exportDOT } from 'optave-codegraph';
+ */
+export { buildGraph } from './domain/graph/builder.js';
+export { findCycles } from './domain/graph/cycles.js';
+export { briefData, childrenData, contextData, diffImpactData, explainData, exportsData, fileDepsData, fnDepsData, fnImpactData, impactAnalysisData, moduleMapData, pathData, queryNameData, rolesData, statsData, whereData, } from './domain/queries.js';
+export { buildEmbeddings, hybridSearchData, multiSearchData, searchData, } from './domain/search/index.js';
+export { astQueryData } from './features/ast.js';
+export { auditData } from './features/audit.js';
+export { batchData } from './features/batch.js';
+export { branchCompareData } from './features/branch-compare.js';
+export { cfgData } from './features/cfg.js';
+export { checkData } from './features/check.js';
+export { coChangeData } from './features/cochange.js';
+export { communitiesData } from './features/communities.js';
+export { complexityData } from './features/complexity.js';
+export { dataflowData } from './features/dataflow.js';
+export { exportDOT, exportJSON, exportMermaid } from './features/export.js';
+export { flowData, listEntryPointsData } from './features/flow.js';
+export { manifestoData } from './features/manifesto.js';
+export { ownersData } from './features/owners.js';
+export { sequenceData } from './features/sequence.js';
+export { hotspotsData, moduleBoundariesData, structureData } from './features/structure.js';
+export { triageData } from './features/triage.js';
+export { loadConfig, loadConfigWithProvenance, resolveUserConfigPath, } from './infrastructure/config.js';
+export { EXTENSIONS, IGNORE_DIRS } from './shared/constants.js';
+export { AnalysisError, BoundaryError, CodegraphError, ConfigError, DbError, EngineError, ParseError, ResolutionError, } from './shared/errors.js';
+export { EVERY_EDGE_KIND, EVERY_SYMBOL_KIND } from './shared/kinds.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EACL,SAAS,EACT,YAAY,EACZ,WAAW,EACX,cAAc,EACd,WAAW,EACX,WAAW,EACX,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,kBAAkB,EAClB,aAAa,EACb,QAAQ,EACR,aAAa,EACb,SAAS,EACT,SAAS,EACT,SAAS,GACV,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,eAAe,EACf,UAAU,GACX,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACjE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAC5E,OAAO,EAAE,QAAQ,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAC5F,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAClD,OAAO,EACL,UAAU,EACV,wBAAwB,EACxB,qBAAqB,GACtB,MAAM,4BAA4B,CAAC;AAEpC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EACL,aAAa,EACb,aAAa,EACb,cAAc,EACd,WAAW,EACX,OAAO,EACP,WAAW,EACX,UAAU,EACV,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC"}