@grafema/api 0.2.5-beta

package/dist/resolvers/query.d.ts

@@ -0,0 +1,169 @@
+/**
+ * Query Resolvers
+ *
+ * Implements all Query type fields.
+ */
+import type { BaseNodeRecord } from '@grafema/types';
+import type { GraphQLContext } from '../context.js';
+export interface NodeFilter {
+    type?: string | null;
+    name?: string | null;
+    file?: string | null;
+    exported?: boolean | null;
+}
+export declare const queryResolvers: {
+    /**
+     * Get node by ID.
+     *
+     * Complexity: O(1)
+     */
+    node(_: unknown, args: {
+        id: string;
+    }, context: GraphQLContext): Promise<BaseNodeRecord | null>;
+    /**
+     * Find nodes matching criteria with cursor-based pagination.
+     *
+     * Complexity: O(n) where n = nodes matching type filter
+     * This is acceptable because:
+     * - We filter by type first (uses RFDB's type index)
+     * - Results are paginated
+     */
+    nodes(_: unknown, args: {
+        filter?: NodeFilter | null;
+        first?: number | null;
+        after?: string | null;
+    }, context: GraphQLContext): Promise<import("../pagination.js").Connection<BaseNodeRecord>>;
+    /**
+     * BFS traversal.
+     *
+     * Complexity: O(V + E) for reachable subgraph
+     * Bounded by maxDepth parameter.
+     */
+    bfs(_: unknown, args: {
+        startIds: string[];
+        maxDepth: number;
+        edgeTypes: string[];
+    }, context: GraphQLContext): Promise<string[]>;
+    /**
+     * DFS traversal.
+     *
+     * Complexity: O(V + E) for reachable subgraph
+     */
+    dfs(_: unknown, args: {
+        startIds: string[];
+        maxDepth: number;
+        edgeTypes?: string[] | null;
+    }, context: GraphQLContext): Promise<string[]>;
+    /**
+     * Reachability check.
+     *
+     * Complexity: O(V + E) worst case, often O(d) with early termination
+     */
+    reachability(_: unknown, args: {
+        from: string;
+        to: string;
+        edgeTypes?: string[] | null;
+        maxDepth?: number | null;
+    }, context: GraphQLContext): Promise<boolean>;
+    /**
+     * Execute Datalog query.
+     *
+     * Complexity: Depends on query, bounded by RFDB's timeout
+     */
+    datalog(_: unknown, args: {
+        query: string;
+        limit?: number | null;
+        offset?: number | null;
+    }, context: GraphQLContext): Promise<{
+        success: boolean;
+        count: number;
+        results: {
+            bindings: {
+                [k: string]: string;
+            };
+            node: BaseNodeRecord | null;
+        }[];
+        error: null;
+    } | {
+        success: boolean;
+        count: number;
+        results: never[];
+        error: string;
+    }>;
+    /**
+     * Get graph statistics.
+     *
+     * Complexity: O(1) - cached in backend
+     */
+    stats(_: unknown, _args: unknown, context: GraphQLContext): Promise<import("@grafema/core/storage/backends/RFDBServerBackend").BackendStats>;
+    /**
+     * Get analysis status.
+     * Placeholder - actual implementation depends on analysis state tracking.
+     */
+    analysisStatus(_: unknown, _args: unknown, _context: GraphQLContext): Promise<{
+        running: boolean;
+        phase: null;
+        message: null;
+        servicesDiscovered: number;
+        servicesAnalyzed: number;
+        error: null;
+    }>;
+    /**
+     * List all guarantees.
+     * Placeholder - actual implementation depends on GuaranteeManager.
+     */
+    guarantees(_: unknown, _args: unknown, _context: GraphQLContext): Promise<never[]>;
+    /**
+     * Get guarantee by ID.
+     * Placeholder.
+     */
+    guarantee(_: unknown, _args: {
+        id: string;
+    }, _context: GraphQLContext): Promise<null>;
+    /**
+     * Find calls to a function/method.
+     * Placeholder - would reuse MCP handler logic.
+     */
+    findCalls(_: unknown, _args: {
+        target: string;
+        className?: string | null;
+        limit?: number | null;
+        offset?: number | null;
+    }, _context: GraphQLContext): Promise<never[]>;
+    /**
+     * Get function details.
+     * Placeholder - would reuse MCP handler logic.
+     */
+    getFunctionDetails(_: unknown, _args: {
+        name: string;
+        file?: string | null;
+        transitive?: boolean | null;
+    }, _context: GraphQLContext): Promise<null>;
+    /**
+     * Find guards protecting a node.
+     * Placeholder.
+     */
+    findGuards(_: unknown, _args: {
+        nodeId: string;
+    }, _context: GraphQLContext): Promise<never[]>;
+    /**
+     * Trace alias chain.
+     * Placeholder.
+     */
+    traceAlias(_: unknown, _args: {
+        variableName: string;
+        file: string;
+        maxDepth?: number | null;
+    }, _context: GraphQLContext): Promise<never[]>;
+    /**
+     * Trace data flow.
+     * Placeholder.
+     */
+    traceDataFlow(_: unknown, _args: {
+        source: string;
+        file?: string | null;
+        direction?: string | null;
+        maxDepth?: number | null;
+    }, _context: GraphQLContext): Promise<never[]>;
+};
+//# sourceMappingURL=query.d.ts.map

package/dist/resolvers/query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../../src/resolvers/query.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AACrD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAGpD,MAAM,WAAW,UAAU;IACzB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,QAAQ,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;CAC3B;AAED,eAAO,MAAM,cAAc;IACzB;;;;OAIG;YAEE,OAAO,QACJ;QAAE,EAAE,EAAE,MAAM,CAAA;KAAE,WACX,cAAc;IAKzB;;;;;;;OAOG;aAEE,OAAO,QACJ;QACJ,MAAM,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC;QAC3B,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KACvB,WACQ,cAAc;IA2BzB;;;;;OAKG;WAEE,OAAO,QACJ;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,EAAE,CAAA;KAAE,WAC1D,cAAc;IAKzB;;;;OAIG;WAEE,OAAO,QACJ;QAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;KAAE,WAClE,cAAc;IASzB;;;;OAIG;oBAEE,OAAO,QACJ;QACJ,IAAI,EAAE,MAAM,CAAC;QACb,EAAE,EAAE,MAAM,CAAC;QACX,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAC5B,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KAC1B,WACQ,cAAc;IAWzB;;;;OAIG;eAEE,OAAO,QACJ;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,WAC7D,cAAc;;;;;;;;;;;;;;;;IA6CzB;;;;OAIG;aACY,OAAO,SAAS,OAAO,WAAW,cAAc;IAI/D;;;OAGG;sBACqB,OAAO,SAAS,OAAO,YAAY,cAAc;;;;;;;;IAYzE;;;OAGG;kBACiB,OAAO,SAAS,OAAO,YAAY,cAAc;IAKrE;;;OAGG;iBAEE,OAAO,SACH;QAAE,EAAE,EAAE,MAAM,CAAA;KAAE,YACX,cAAc;IAK1B;;;OAGG;iBAEE,OAAO,SACH;QACL,MAAM,EAAE,MAAM,CAAC;QACf,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACtB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KACxB,YACS,cAAc;IAM1B;;;OAGG;0BAEE,OAAO,SACH;QACL,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACrB,UAAU,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC;KAC7B,YACS,cAAc;IAM1B;;;OAGG;kBAEE,OAAO,SACH;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,YACf,cAAc;IAK1B;;;OAGG;kBAEE,OAAO,SACH;QACL,YAAY,EAAE,MAAM,CAAC;QACrB,IAAI,EAAE,MAAM,CAAC;QACb,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KAC1B,YACS,cAAc;IAK1B;;;OAGG;qBAEE,OAAO,SACH;QACL,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QACrB,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;KAC1B,YACS,cAAc;CAI3B,CAAC"}

package/dist/resolvers/query.js

@@ -0,0 +1,188 @@
+/**
+ * Query Resolvers
+ *
+ * Implements all Query type fields.
+ */
+import { paginateArray } from '../pagination.js';
+export const queryResolvers = {
+    /**
+     * Get node by ID.
+     *
+     * Complexity: O(1)
+     */
+    async node(_, args, context) {
+        return context.loaders.node.load(args.id);
+    },
+    /**
+     * Find nodes matching criteria with cursor-based pagination.
+     *
+     * Complexity: O(n) where n = nodes matching type filter
+     * This is acceptable because:
+     * - We filter by type first (uses RFDB's type index)
+     * - Results are paginated
+     */
+    async nodes(_, args, context) {
+        const filter = args.filter || {};
+        // Build query for backend
+        const query = {};
+        if (filter.type)
+            query.type = filter.type;
+        if (filter.name)
+            query.name = filter.name;
+        if (filter.file)
+            query.file = filter.file;
+        // Get all matching nodes
+        const nodes = await context.backend.getAllNodes(query);
+        // Apply exported filter (not supported by backend query)
+        let filteredNodes = nodes;
+        if (filter.exported !== null && filter.exported !== undefined) {
+            filteredNodes = nodes.filter((n) => n.exported === filter.exported);
+        }
+        return paginateArray(filteredNodes, args.first, args.after, (n) => n.id);
+    },
+    /**
+     * BFS traversal.
+     *
+     * Complexity: O(V + E) for reachable subgraph
+     * Bounded by maxDepth parameter.
+     */
+    async bfs(_, args, context) {
+        return context.backend.bfs(args.startIds, args.maxDepth, args.edgeTypes);
+    },
+    /**
+     * DFS traversal.
+     *
+     * Complexity: O(V + E) for reachable subgraph
+     */
+    async dfs(_, args, context) {
+        return context.backend.dfs(args.startIds, args.maxDepth, args.edgeTypes || []);
+    },
+    /**
+     * Reachability check.
+     *
+     * Complexity: O(V + E) worst case, often O(d) with early termination
+     */
+    async reachability(_, args, context) {
+        const maxDepth = args.maxDepth ?? 10;
+        const reachable = await context.backend.bfs([args.from], maxDepth, args.edgeTypes || []);
+        return reachable.includes(args.to);
+    },
+    /**
+     * Execute Datalog query.
+     *
+     * Complexity: Depends on query, bounded by RFDB's timeout
+     */
+    async datalog(_, args, context) {
+        const limit = args.limit ?? 50;
+        const offset = args.offset ?? 0;
+        try {
+            const results = await context.backend.checkGuarantee(args.query);
+            const total = results.length;
+            const paginatedResults = results.slice(offset, offset + limit);
+            // Enrich with node data
+            const enrichedResults = await Promise.all(paginatedResults.map(async (r) => {
+                const bindings = r.bindings || [];
+                const xBinding = bindings.find((b) => b.name === 'X');
+                const nodeId = xBinding?.value;
+                const node = nodeId
+                    ? await context.loaders.node.load(String(nodeId))
+                    : null;
+                return {
+                    bindings: Object.fromEntries(bindings.map((b) => [b.name, b.value])),
+                    node,
+                };
+            }));
+            return {
+                success: true,
+                count: total,
+                results: enrichedResults,
+                error: null,
+            };
+        }
+        catch (error) {
+            const message = error instanceof Error ? error.message : String(error);
+            return {
+                success: false,
+                count: 0,
+                results: [],
+                error: message,
+            };
+        }
+    },
+    /**
+     * Get graph statistics.
+     *
+     * Complexity: O(1) - cached in backend
+     */
+    async stats(_, _args, context) {
+        return context.backend.getStats();
+    },
+    /**
+     * Get analysis status.
+     * Placeholder - actual implementation depends on analysis state tracking.
+     */
+    async analysisStatus(_, _args, _context) {
+        // Placeholder - would need to track analysis state
+        return {
+            running: false,
+            phase: null,
+            message: null,
+            servicesDiscovered: 0,
+            servicesAnalyzed: 0,
+            error: null,
+        };
+    },
+    /**
+     * List all guarantees.
+     * Placeholder - actual implementation depends on GuaranteeManager.
+     */
+    async guarantees(_, _args, _context) {
+        // Placeholder - would need GuaranteeManager integration
+        return [];
+    },
+    /**
+     * Get guarantee by ID.
+     * Placeholder.
+     */
+    async guarantee(_, _args, _context) {
+        return null;
+    },
+    /**
+     * Find calls to a function/method.
+     * Placeholder - would reuse MCP handler logic.
+     */
+    async findCalls(_, _args, _context) {
+        // Placeholder - would reuse MCP find_calls handler
+        return [];
+    },
+    /**
+     * Get function details.
+     * Placeholder - would reuse MCP handler logic.
+     */
+    async getFunctionDetails(_, _args, _context) {
+        // Placeholder - would reuse MCP get_function_details handler
+        return null;
+    },
+    /**
+     * Find guards protecting a node.
+     * Placeholder.
+     */
+    async findGuards(_, _args, _context) {
+        return [];
+    },
+    /**
+     * Trace alias chain.
+     * Placeholder.
+     */
+    async traceAlias(_, _args, _context) {
+        return [];
+    },
+    /**
+     * Trace data flow.
+     * Placeholder.
+     */
+    async traceDataFlow(_, _args, _context) {
+        return [];
+    },
+};
+//# sourceMappingURL=query.js.map

package/dist/resolvers/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/resolvers/query.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AASjD,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B;;;;OAIG;IACH,KAAK,CAAC,IAAI,CACR,CAAU,EACV,IAAoB,EACpB,OAAuB;QAEvB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,KAAK,CACT,CAAU,EACV,IAIC,EACD,OAAuB;QAEvB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;QAEjC,0BAA0B;QAC1B,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QAC1C,IAAI,MAAM,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QAC1C,IAAI,MAAM,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QAE1C,yBAAyB;QACzB,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAEvD,yDAAyD;QACzD,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,IAAI,MAAM,CAAC,QAAQ,KAAK,IAAI,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC9D,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,aAAa,CAClB,aAAa,EACb,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,KAAK,EACV,CAAC,CAAiB,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAC5B,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,GAAG,CACP,CAAU,EACV,IAAmE,EACnE,OAAuB;QAEvB,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC3E,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,GAAG,CACP,CAAU,EACV,IAA2E,EAC3E,OAAuB;QAEvB,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,CACxB,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,SAAS,IAAI,EAAE,CACrB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,YAAY,CAChB,CAAU,EACV,IAKC,EACD,OAAuB;QAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,GAAG,CACzC,CAAC,IAAI,CAAC,IAAI,CAAC,EACX,QAAQ,EACR,IAAI,CAAC,SAAS,IAAI,EAAE,CACrB,CAAC;QACF,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,OAAO,CACX,CAAU,EACV,IAAsE,EACtE,OAAuB;QAEvB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QAEhC,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjE,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC;YAC7B,MAAM,gBAAgB,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;YAE/D,wBAAwB;YACxB,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,GAAG,CACvC,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;gBAC/B,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC;gBAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC;gBACtD,MAAM,MAAM,GAAG,QAAQ,EAAE,KAAK,CAAC;gBAC/B,MAAM,IAAI,GAAG,MAAM;oBACjB,CAAC,CAAC,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACjD,CAAC,CAAC,IAAI,CAAC;gBACT,OAAO;oBACL,QAAQ,EAAE,MAAM,CAAC,WAAW,CAC1B,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CACvC;oBACD,IAAI;iBACL,CAAC;YACJ,CAAC,CAAC,CACH,CAAC;YAEF,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,KAAK,EAAE,KAAK;gBACZ,OAAO,EAAE,eAAe;gBACxB,KAAK,EAAE,IAAI;aACZ,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,CAAC;gBACR,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,OAAO;aACf,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAK,CAAC,CAAU,EAAE,KAAc,EAAE,OAAuB;QAC7D,OAAO,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;IACpC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,cAAc,CAAC,CAAU,EAAE,KAAc,EAAE,QAAwB;QACvE,mDAAmD;QACnD,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,IAAI;YACX,OAAO,EAAE,IAAI;YACb,kBAAkB,EAAE,CAAC;YACrB,gBAAgB,EAAE,CAAC;YACnB,KAAK,EAAE,IAAI;SACZ,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU,CAAC,CAAU,EAAE,KAAc,EAAE,QAAwB;QACnE,wDAAwD;QACxD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CACb,CAAU,EACV,KAAqB,EACrB,QAAwB;QAExB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CACb,CAAU,EACV,KAKC,EACD,QAAwB;QAExB,mDAAmD;QACnD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,kBAAkB,CACtB,CAAU,EACV,KAIC,EACD,QAAwB;QAExB,6DAA6D;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU,CACd,CAAU,EACV,KAAyB,EACzB,QAAwB;QAExB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU,CACd,CAAU,EACV,KAIC,EACD,QAAwB;QAExB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,aAAa,CACjB,CAAU,EACV,KAKC,EACD,QAAwB;QAExB,OAAO,EAAE,CAAC;IACZ,CAAC;CACF,CAAC"}

package/dist/schema/enums.graphql

@@ -0,0 +1,27 @@
+"""
+Direction for graph traversal.
+"""
+enum TraversalDirection {
+  FORWARD
+  BACKWARD
+  BOTH
+}
+
+"""
+Severity levels for guarantees.
+"""
+enum Severity {
+  ERROR
+  WARNING
+  INFO
+}
+
+"""
+Priority levels for contract guarantees.
+"""
+enum Priority {
+  CRITICAL
+  IMPORTANT
+  OBSERVED
+  TRACKED
+}

package/dist/schema/mutations.graphql

@@ -0,0 +1,53 @@
+type Mutation {
+  # ============================================================================
+  # Analysis
+  # ============================================================================
+
+  """
+  Run project analysis.
+  Blocks until complete (with timeout).
+  """
+  analyzeProject(
+    """Optional: analyze only this service"""
+    service: String
+
+    """Force re-analysis even if already analyzed"""
+    force: Boolean
+  ): AnalysisResult!
+
+  # ============================================================================
+  # Guarantees
+  # ============================================================================
+
+  """
+  Create a new guarantee.
+
+  For Datalog-based: provide name + rule
+  For contract-based: provide name + type + priority
+  """
+  createGuarantee(input: CreateGuaranteeInput!): Guarantee!
+
+  """
+  Delete a guarantee by name.
+  """
+  deleteGuarantee(name: String!): Boolean!
+
+  """
+  Check all guarantees or specific ones.
+  """
+  checkGuarantees(
+    """Specific guarantee names to check (null = all)"""
+    names: [String!]
+  ): GuaranteeCheckResult!
+
+  """
+  Check a single ad-hoc invariant without persisting.
+  """
+  checkInvariant(
+    """Datalog rule"""
+    rule: String!
+
+    """Description for error messages"""
+    description: String
+  ): GuaranteeResult!
+}

package/dist/schema/queries.graphql

@@ -0,0 +1,213 @@
+type Query {
+  # ============================================================================
+  # Node Lookups
+  # ============================================================================
+
+  """
+  Get a single node by ID.
+  Returns null if not found.
+  """
+  node(id: ID!): Node
+
+  """
+  Find nodes matching filter criteria.
+  Uses cursor-based pagination (Relay spec).
+  """
+  nodes(
+    """Filter criteria"""
+    filter: NodeFilter
+
+    """Number of items to return (default: 50, max: 250)"""
+    first: Int
+
+    """Cursor to start after"""
+    after: String
+  ): NodeConnection!
+
+  # ============================================================================
+  # Graph Traversal
+  # ============================================================================
+
+  """
+  BFS traversal from starting nodes.
+  Returns all node IDs reachable within maxDepth.
+
+  Complexity: O(V + E) where V = reachable nodes, E = traversed edges
+  """
+  bfs(
+    """Starting node IDs"""
+    startIds: [ID!]!
+
+    """Maximum traversal depth"""
+    maxDepth: Int!
+
+    """Edge types to traverse (empty = all)"""
+    edgeTypes: [String!]!
+  ): [ID!]!
+
+  """
+  DFS traversal from starting nodes.
+  Returns all node IDs reachable within maxDepth.
+
+  Complexity: O(V + E) where V = reachable nodes, E = traversed edges
+  """
+  dfs(
+    """Starting node IDs"""
+    startIds: [ID!]!
+
+    """Maximum traversal depth"""
+    maxDepth: Int!
+
+    """Edge types to traverse (null = all)"""
+    edgeTypes: [String!]
+  ): [ID!]!
+
+  """
+  Check if a path exists between two nodes.
+  Uses BFS internally with early termination.
+
+  Complexity: O(V + E) worst case, often much faster with early termination
+  """
+  reachability(
+    """Source node ID"""
+    from: ID!
+
+    """Target node ID"""
+    to: ID!
+
+    """Edge types to traverse (null = all)"""
+    edgeTypes: [String!]
+
+    """Maximum depth to search (default: 10)"""
+    maxDepth: Int
+  ): Boolean!
+
+  # ============================================================================
+  # Datalog Queries
+  # ============================================================================
+
+  """
+  Execute a Datalog query on the code graph.
+
+  The query must define a violation/1 predicate.
+
+  Available predicates:
+  - node(Id, Type) - match nodes by type
+  - edge(Src, Dst, Type) - match edges
+  - attr(Id, Name, Value) - match node attributes
+
+  Example: violation(X) :- node(X, "FUNCTION"), attr(X, "async", true).
+  """
+  datalog(
+    """Datalog query defining violation/1"""
+    query: String!
+
+    """Maximum results (default: 50)"""
+    limit: Int
+
+    """Results to skip (for simple pagination)"""
+    offset: Int
+  ): DatalogResult!
+
+  # ============================================================================
+  # High-Level Queries (from MCP handlers)
+  # ============================================================================
+
+  """
+  Find all calls to a function/method.
+  """
+  findCalls(
+    """Function or method name"""
+    target: String!
+
+    """Optional class name for method calls"""
+    className: String
+
+    """Maximum results"""
+    limit: Int
+
+    """Results to skip"""
+    offset: Int
+  ): [CallInfo!]!
+
+  """
+  Get comprehensive function details including calls and callers.
+  """
+  getFunctionDetails(
+    """Function name"""
+    name: String!
+
+    """File path for disambiguation"""
+    file: String
+
+    """Follow transitive call chains"""
+    transitive: Boolean
+  ): FunctionDetails
+
+  """
+  Find guards (conditional scopes) protecting a node.
+  """
+  findGuards(
+    """Node ID to find guards for"""
+    nodeId: ID!
+  ): [GuardInfo!]!
+
+  """
+  Trace variable alias chain to original source.
+  """
+  traceAlias(
+    """Variable name"""
+    variableName: String!
+
+    """File where variable is defined"""
+    file: String!
+
+    """Maximum trace depth (default: 20)"""
+    maxDepth: Int
+  ): [Node!]!
+
+  """
+  Trace data flow from/to a node.
+  """
+  traceDataFlow(
+    """Source node ID or variable name"""
+    source: String!
+
+    """File path"""
+    file: String
+
+    """Direction of trace"""
+    direction: TraversalDirection
+
+    """Maximum depth (default: 10)"""
+    maxDepth: Int
+  ): [[String!]!]!
+
+  # ============================================================================
+  # Guarantees
+  # ============================================================================
+
+  """
+  List all defined guarantees.
+  """
+  guarantees: [Guarantee!]!
+
+  """
+  Get a specific guarantee by ID.
+  """
+  guarantee(id: ID!): Guarantee
+
+  # ============================================================================
+  # Statistics
+  # ============================================================================
+
+  """
+  Get graph statistics.
+  """
+  stats: GraphStats!
+
+  """
+  Get current analysis status.
+  """
+  analysisStatus: AnalysisStatus!
+}

package/dist/schema/scalars.graphql

@@ -0,0 +1,2 @@
+"""Custom JSON scalar for arbitrary metadata."""
+scalar JSON