leangraph 1.1.1 → 1.1.3

package/dist/engine/memory-graph.d.ts

@@ -0,0 +1,68 @@
+/**
+ * In-memory graph structure for hybrid query execution.
+ * Optimized for traversal operations with O(1) node lookups
+ * and adjacency list access.
+ */
+export interface MemoryNode {
+    id: string;
+    labels: string[];
+    properties: Record<string, unknown>;
+}
+export interface MemoryEdge {
+    id: string;
+    type: string;
+    sourceId: string;
+    targetId: string;
+    properties: Record<string, unknown>;
+}
+export interface Path {
+    nodes: MemoryNode[];
+    edges: MemoryEdge[];
+}
+export type Direction = "out" | "in" | "both";
+/** Row format from SQLite nodes table */
+export interface NodeRow {
+    id: string;
+    label: string;
+    properties: string;
+}
+/** Row format from SQLite edges table */
+export interface EdgeRow {
+    id: string;
+    type: string;
+    source_id: string;
+    target_id: string;
+    properties: string;
+}
+export declare class MemoryGraph {
+    private nodes;
+    private outEdges;
+    private inEdges;
+    /**
+     * Build a MemoryGraph from SQLite row data.
+     */
+    static fromRows(nodeRows: NodeRow[], edgeRows: EdgeRow[]): MemoryGraph;
+    /**
+     * Get a node by ID. O(1) lookup.
+     */
+    getNode(id: string): MemoryNode | undefined;
+    /**
+     * Get outgoing edges from a node, optionally filtered by type.
+     */
+    getOutEdges(nodeId: string, type?: string): MemoryEdge[];
+    /**
+     * Get incoming edges to a node, optionally filtered by type.
+     */
+    getInEdges(nodeId: string, type?: string): MemoryEdge[];
+    /**
+     * Get neighboring nodes in a given direction, optionally filtered by edge type.
+     */
+    neighbors(nodeId: string, direction: Direction, type?: string): MemoryNode[];
+    /**
+     * Traverse variable-length paths from a starting node.
+     * Yields paths lazily using a generator for memory efficiency.
+     * Handles cycle detection to prevent infinite loops.
+     */
+    traversePaths(startId: string, edgeType: string | null, minDepth: number, maxDepth: number, direction: Direction): Generator<Path>;
+}
+//# sourceMappingURL=memory-graph.d.ts.map

package/dist/engine/memory-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph.d.ts","sourceRoot":"","sources":["../../src/engine/memory-graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,IAAI;IACnB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,KAAK,EAAE,UAAU,EAAE,CAAC;CACrB;AAED,MAAM,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,GAAG,MAAM,CAAC;AAE9C,yCAAyC;AACzC,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,yCAAyC;AACzC,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,KAAK,CAAsC;IACnD,OAAO,CAAC,QAAQ,CAAwC;IACxD,OAAO,CAAC,OAAO,CAAwC;IAEvD;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,WAAW;IA0CtE;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAI3C;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE;IAQxD;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE;IAQvD;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE;IA2B5E;;;;OAIG;IACF,aAAa,CACZ,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,MAAM,GAAG,IAAI,EACvB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,SAAS,GACnB,SAAS,CAAC,IAAI,CAAC;CA2FnB"}

package/dist/engine/memory-graph.js

@@ -0,0 +1,176 @@
+/**
+ * In-memory graph structure for hybrid query execution.
+ * Optimized for traversal operations with O(1) node lookups
+ * and adjacency list access.
+ */
+export class MemoryGraph {
+    nodes = new Map();
+    outEdges = new Map();
+    inEdges = new Map();
+    /**
+     * Build a MemoryGraph from SQLite row data.
+     */
+    static fromRows(nodeRows, edgeRows) {
+        const graph = new MemoryGraph();
+        // Parse and index nodes
+        for (const row of nodeRows) {
+            const node = {
+                id: row.id,
+                labels: JSON.parse(row.label),
+                properties: JSON.parse(row.properties),
+            };
+            graph.nodes.set(node.id, node);
+            // Initialize adjacency lists
+            graph.outEdges.set(node.id, []);
+            graph.inEdges.set(node.id, []);
+        }
+        // Parse and index edges
+        for (const row of edgeRows) {
+            const edge = {
+                id: row.id,
+                type: row.type,
+                sourceId: row.source_id,
+                targetId: row.target_id,
+                properties: JSON.parse(row.properties),
+            };
+            // Add to outgoing edges of source
+            const outList = graph.outEdges.get(edge.sourceId);
+            if (outList) {
+                outList.push(edge);
+            }
+            // Add to incoming edges of target
+            const inList = graph.inEdges.get(edge.targetId);
+            if (inList) {
+                inList.push(edge);
+            }
+        }
+        return graph;
+    }
+    /**
+     * Get a node by ID. O(1) lookup.
+     */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /**
+     * Get outgoing edges from a node, optionally filtered by type.
+     */
+    getOutEdges(nodeId, type) {
+        const edges = this.outEdges.get(nodeId) ?? [];
+        if (type === undefined) {
+            return edges;
+        }
+        return edges.filter((e) => e.type === type);
+    }
+    /**
+     * Get incoming edges to a node, optionally filtered by type.
+     */
+    getInEdges(nodeId, type) {
+        const edges = this.inEdges.get(nodeId) ?? [];
+        if (type === undefined) {
+            return edges;
+        }
+        return edges.filter((e) => e.type === type);
+    }
+    /**
+     * Get neighboring nodes in a given direction, optionally filtered by edge type.
+     */
+    neighbors(nodeId, direction, type) {
+        const result = [];
+        const seen = new Set();
+        if (direction === "out" || direction === "both") {
+            for (const edge of this.getOutEdges(nodeId, type)) {
+                const node = this.nodes.get(edge.targetId);
+                if (node && !seen.has(node.id)) {
+                    seen.add(node.id);
+                    result.push(node);
+                }
+            }
+        }
+        if (direction === "in" || direction === "both") {
+            for (const edge of this.getInEdges(nodeId, type)) {
+                const node = this.nodes.get(edge.sourceId);
+                if (node && !seen.has(node.id)) {
+                    seen.add(node.id);
+                    result.push(node);
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     * Traverse variable-length paths from a starting node.
+     * Yields paths lazily using a generator for memory efficiency.
+     * Handles cycle detection to prevent infinite loops.
+     */
+    *traversePaths(startId, edgeType, minDepth, maxDepth, direction) {
+        const startNode = this.nodes.get(startId);
+        if (!startNode) {
+            return;
+        }
+        // Handle minDepth = 0 case (include start node as a path)
+        if (minDepth === 0) {
+            yield { nodes: [startNode], edges: [] };
+        }
+        const initialEntry = {
+            nodeId: startId,
+            nodes: [startNode],
+            edges: [],
+            visitedEdges: new Set(),
+        };
+        const stack = [initialEntry];
+        while (stack.length > 0) {
+            const current = stack.pop();
+            const depth = current.edges.length;
+            // Get edges to traverse
+            const edgesToTraverse = [];
+            if (direction === "out" || direction === "both") {
+                const outEdges = this.getOutEdges(current.nodeId, edgeType ?? undefined);
+                edgesToTraverse.push(...outEdges);
+            }
+            if (direction === "in" || direction === "both") {
+                const inEdges = this.getInEdges(current.nodeId, edgeType ?? undefined);
+                edgesToTraverse.push(...inEdges);
+            }
+            // Explore each edge
+            for (const edge of edgesToTraverse) {
+                // Skip if edge already used in this path (cycle prevention)
+                if (current.visitedEdges.has(edge.id)) {
+                    continue;
+                }
+                // Determine the target node based on direction
+                let targetId;
+                if (edge.sourceId === current.nodeId) {
+                    targetId = edge.targetId;
+                }
+                else {
+                    targetId = edge.sourceId;
+                }
+                const targetNode = this.nodes.get(targetId);
+                if (!targetNode) {
+                    continue;
+                }
+                // Build new path
+                const newNodes = [...current.nodes, targetNode];
+                const newEdges = [...current.edges, edge];
+                const newVisited = new Set(current.visitedEdges);
+                newVisited.add(edge.id);
+                const newDepth = newEdges.length;
+                // Yield if within depth range
+                if (newDepth >= minDepth && newDepth <= maxDepth) {
+                    yield { nodes: newNodes, edges: newEdges };
+                }
+                // Continue exploring if we haven't reached max depth
+                if (newDepth < maxDepth) {
+                    stack.push({
+                        nodeId: targetId,
+                        nodes: newNodes,
+                        edges: newEdges,
+                        visitedEdges: newVisited,
+                    });
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=memory-graph.js.map

package/dist/engine/memory-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph.js","sourceRoot":"","sources":["../../src/engine/memory-graph.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAuCH,MAAM,OAAO,WAAW;IACd,KAAK,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC3C,QAAQ,GAA8B,IAAI,GAAG,EAAE,CAAC;IAChD,OAAO,GAA8B,IAAI,GAAG,EAAE,CAAC;IAEvD;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAmB,EAAE,QAAmB;QACtD,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAEhC,wBAAwB;QACxB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAe;gBACvB,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC7B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;aACvC,CAAC;YACF,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC/B,6BAA6B;YAC7B,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAChC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAe;gBACvB,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,QAAQ,EAAE,GAAG,CAAC,SAAS;gBACvB,QAAQ,EAAE,GAAG,CAAC,SAAS;gBACvB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;aACvC,CAAC;YAEF,kCAAkC;YAClC,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YAED,kCAAkC;YAClC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChD,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAAc,EAAE,IAAa;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,MAAc,EAAE,IAAa;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC7C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc,EAAE,SAAoB,EAAE,IAAa;QAC3D,MAAM,MAAM,GAAiB,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAChD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;gBAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3C,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAClB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3C,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAClB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,CAAC,aAAa,CACZ,OAAe,EACf,QAAuB,EACvB,QAAgB,EAChB,QAAgB,EAChB,SAAoB;QAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO;QACT,CAAC;QAED,0DAA0D;QAC1D,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAC1C,CAAC;QAWD,MAAM,YAAY,GAAe;YAC/B,MAAM,EAAE,OAAO;YACf,KAAK,EAAE,CAAC,SAAS,CAAC;YAClB,KAAK,EAAE,EAAE;YACT,YAAY,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC;QAEF,MAAM,KAAK,GAAiB,CAAC,YAAY,CAAC,CAAC;QAE3C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC;YAEnC,wBAAwB;YACxB,MAAM,eAAe,GAAiB,EAAE,CAAC;YAEzC,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,IAAI,SAAS,CAAC,CAAC;gBACzE,eAAe,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;YACpC,CAAC;YAED,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,IAAI,SAAS,CAAC,CAAC;gBACvE,eAAe,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;YACnC,CAAC;YAED,oBAAoB;YACpB,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;gBACnC,4DAA4D;gBAC5D,IAAI,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACtC,SAAS;gBACX,CAAC;gBAED,+CAA+C;gBAC/C,IAAI,QAAgB,CAAC;gBACrB,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;oBACrC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC3B,CAAC;qBAAM,CAAC;oBACN,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC3B,CAAC;gBAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,CAAC,UAAU,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBAED,iBAAiB;gBACjB,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;gBAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC1C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBACjD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAExB,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;gBAEjC,8BAA8B;gBAC9B,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;oBACjD,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;gBAC7C,CAAC;gBAED,qDAAqD;gBACrD,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM,EAAE,QAAQ;wBAChB,KAAK,EAAE,QAAQ;wBACf,KAAK,EAAE,QAAQ;wBACf,YAAY,EAAE,UAAU;qBACzB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/engine/query-planner.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Query Planner - Analyzes Cypher AST to determine if a query
+ * can use the hybrid execution engine.
+ *
+ * Supports generalized pattern chains with:
+ *   - N nodes (arbitrary chain length)
+ *   - Multiple variable-length edges
+ *   - Var-length edges at any position
+ */
+import { Query, WhereCondition, NodePattern } from "../parser.js";
+import { PatternChainParams } from "./hybrid-executor.js";
+import { MemoryNode } from "./memory-graph.js";
+export interface HybridAnalysisResult {
+    /** Whether the query is suitable for hybrid execution */
+    suitable: boolean;
+    /** Extracted parameters for HybridExecutor (if suitable) */
+    params?: PatternChainParams;
+    /** Reason why the query is not suitable (for debugging) */
+    reason?: string;
+}
+/**
+ * Analyze a parsed query to determine if it can use the hybrid executor.
+ * Returns extracted parameters if suitable, or a reason if not.
+ *
+ * Supports generalized pattern chains:
+ *   (a)-[*]->(b)-[:R1]->(c)-[:R2]->(d)  -- N nodes
+ *   (a)-[*]->(b)-[*]->(c)               -- multiple var-length
+ */
+export declare function analyzeForHybrid(query: Query, params: Record<string, unknown>): HybridAnalysisResult;
+/**
+ * Check if a query's structure matches a hybrid-compatible pattern.
+ *
+ * Supported patterns:
+ *   (a:Label)-[*min..max]->(b:Label)-[:TYPE]->(c:Label)     -- original
+ *   (a)-[*]->(b)-[:R1]->(c)-[:R2]->(d)                      -- longer chains
+ *   (a)-[*]->(b)-[*]->(c)                                   -- multiple var-length
+ *   (a)-[:R1]->(b)-[*]->(c)                                 -- var-length anywhere
+ *
+ * Requirements:
+ *   - No mutations (CREATE, SET, DELETE, MERGE)
+ *   - Has RETURN clause
+ *   - Exactly one MATCH clause
+ *   - At least 1 relationship pattern
+ *   - At least one variable-length edge
+ *   - No relationship property predicates (not supported in hybrid)
+ *   - All nodes must have labels (checked in analyzeForHybrid)
+ */
+export declare function isHybridCompatiblePattern(query: Query): boolean;
+/**
+ * Extract node information (label, properties) from a NodePattern.
+ */
+export declare function extractNodeInfo(node: NodePattern, params: Record<string, unknown>): {
+    label: string;
+    properties: Record<string, unknown>;
+} | null;
+/**
+ * Convert a WHERE condition to a filter function for the middle node.
+ * Returns null if the condition references nodes other than the middle node,
+ * or if it contains unsupported expressions.
+ */
+export declare function convertWhereToFilter(where: WhereCondition | undefined, middleVar: string, params: Record<string, unknown>): ((node: MemoryNode) => boolean) | null;
+//# sourceMappingURL=query-planner.d.ts.map

package/dist/engine/query-planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query-planner.d.ts","sourceRoot":"","sources":["../../src/engine/query-planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,KAAK,EAGL,cAAc,EACd,WAAW,EAIZ,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,kBAAkB,EAAuB,MAAM,sBAAsB,CAAC;AAC/E,OAAO,EAAE,UAAU,EAAa,MAAM,mBAAmB,CAAC;AAK1D,MAAM,WAAW,oBAAoB;IACnC,yDAAyD;IACzD,QAAQ,EAAE,OAAO,CAAC;IAClB,4DAA4D;IAC5D,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,2DAA2D;IAC3D,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,oBAAoB,CA8HtB;AAyHD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAuF/D;AAED;;GAEG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,WAAW,EACjB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;CAAE,GAAG,IAAI,CAsB/D;AAuBD;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,cAAc,GAAG,SAAS,EACjC,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,CAAC,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC,GAAG,IAAI,CAOxC"}