opentasks 0.0.1 → 0.0.2

package/dist/graph/FederatedGraph.js

@@ -0,0 +1,406 @@
+/**
+ * Federated Graph for OpenTasks
+ *
+ * Provides unified traversal API over the in-memory Graphology graph.
+ * Supports queries across providers with lazy hydration (hydration handled separately).
+ */
+import { bidirectional } from 'graphology-shortest-path';
+import { getEdgeTypeRegistry } from './EdgeTypeRegistry.js';
+/**
+ * Implementation of FederatedGraph
+ */
+export class FederatedGraphImpl {
+    adapter;
+    constructor(adapter) {
+        this.adapter = adapter;
+    }
+    related(uri, options = {}) {
+        const { edgeType, direction = 'both' } = options;
+        if (!this.adapter.hasNode(uri)) {
+            return [];
+        }
+        const edgeTypes = normalizeEdgeTypes(edgeType);
+        const results = [];
+        const graph = this.adapter.graph;
+        if (direction === 'in' || direction === 'both') {
+            for (const edgeKey of graph.inEdges(uri)) {
+                const type = graph.getEdgeAttribute(edgeKey, 'type');
+                if (matchesEdgeType(type, edgeTypes)) {
+                    results.push(graph.source(edgeKey));
+                }
+            }
+        }
+        if (direction === 'out' || direction === 'both') {
+            for (const edgeKey of graph.outEdges(uri)) {
+                const type = graph.getEdgeAttribute(edgeKey, 'type');
+                if (matchesEdgeType(type, edgeTypes)) {
+                    results.push(graph.target(edgeKey));
+                }
+            }
+        }
+        // Remove duplicates (can occur with 'both' direction)
+        return [...new Set(results)];
+    }
+    reachable(uri, options = {}) {
+        const { edgeType, direction = 'out', maxDepth = Infinity } = options;
+        if (!this.adapter.hasNode(uri)) {
+            return [];
+        }
+        const edgeTypes = normalizeEdgeTypes(edgeType);
+        const results = [];
+        const visited = new Set();
+        visited.add(uri); // Don't include start in results
+        const traverse = (current, depth) => {
+            if (depth >= maxDepth) {
+                return;
+            }
+            const neighbors = this.getNeighbors(current, edgeTypes, direction);
+            for (const neighbor of neighbors) {
+                if (!visited.has(neighbor)) {
+                    visited.add(neighbor);
+                    results.push(neighbor);
+                    traverse(neighbor, depth + 1);
+                }
+            }
+        };
+        traverse(uri, 0);
+        return results;
+    }
+    shortestPath(from, to, options = {}) {
+        const { edgeTypes } = options;
+        if (!this.adapter.hasNode(from) || !this.adapter.hasNode(to)) {
+            return null;
+        }
+        // If no edge type filter, use unweighted bidirectional search
+        if (!edgeTypes || edgeTypes.length === 0) {
+            const path = bidirectional(this.adapter.graph, from, to);
+            return path;
+        }
+        // With edge type filter, use custom BFS that only follows specified edge types
+        return this.bfsShortestPath(from, to, edgeTypes);
+    }
+    /**
+     * BFS-based shortest path with edge type filtering
+     */
+    bfsShortestPath(from, to, edgeTypes) {
+        if (from === to) {
+            return [from];
+        }
+        const graph = this.adapter.graph;
+        const visited = new Set();
+        const parent = new Map();
+        const queue = [from];
+        visited.add(from);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            // Get neighbors through edges of specified types
+            for (const edgeKey of graph.outEdges(current)) {
+                const type = graph.getEdgeAttribute(edgeKey, 'type');
+                if (edgeTypes.includes(type)) {
+                    const neighbor = graph.target(edgeKey);
+                    if (!visited.has(neighbor)) {
+                        visited.add(neighbor);
+                        parent.set(neighbor, current);
+                        if (neighbor === to) {
+                            // Reconstruct path
+                            const path = [to];
+                            let node = to;
+                            while (parent.has(node)) {
+                                node = parent.get(node);
+                                path.unshift(node);
+                            }
+                            return path;
+                        }
+                        queue.push(neighbor);
+                    }
+                }
+            }
+            // Also check incoming edges (for undirected traversal)
+            for (const edgeKey of graph.inEdges(current)) {
+                const type = graph.getEdgeAttribute(edgeKey, 'type');
+                if (edgeTypes.includes(type)) {
+                    const neighbor = graph.source(edgeKey);
+                    if (!visited.has(neighbor)) {
+                        visited.add(neighbor);
+                        parent.set(neighbor, current);
+                        if (neighbor === to) {
+                            // Reconstruct path
+                            const path = [to];
+                            let node = to;
+                            while (parent.has(node)) {
+                                node = parent.get(node);
+                                path.unshift(node);
+                            }
+                            return path;
+                        }
+                        queue.push(neighbor);
+                    }
+                }
+            }
+        }
+        return null; // No path found
+    }
+    hasPath(from, to, options = {}) {
+        return this.shortestPath(from, to, options) !== null;
+    }
+    getNode(uri) {
+        return this.adapter.getNode(uri);
+    }
+    hasNode(uri) {
+        return this.adapter.hasNode(uri);
+    }
+    nodes() {
+        return Array.from(this.adapter.graph.nodes());
+    }
+    stats() {
+        return {
+            nodes: this.adapter.graph.order,
+            edges: this.adapter.graph.size,
+        };
+    }
+    async *traverse(startUris, pattern) {
+        const starts = Array.isArray(startUris) ? startUris : [startUris];
+        const { steps, limit, filter } = pattern;
+        if (steps.length === 0) {
+            return;
+        }
+        let yieldCount = 0;
+        // Process each starting node
+        for (const startUri of starts) {
+            if (!this.adapter.hasNode(startUri)) {
+                continue;
+            }
+            const queue = [
+                {
+                    uris: [startUri],
+                    stepIndex: 0,
+                    depth: 0,
+                    basePath: [startUri],
+                },
+            ];
+            while (queue.length > 0) {
+                const item = queue.shift();
+                const { uris, stepIndex, depth, basePath } = item;
+                if (stepIndex >= steps.length) {
+                    continue;
+                }
+                const step = steps[stepIndex];
+                const minHops = step.minHops ?? 1;
+                const maxHops = step.maxHops ?? 1;
+                const edgeTypes = [step.type];
+                // For each URI at this step, traverse according to step parameters
+                for (const uri of uris) {
+                    // Track visited within this step to avoid cycles
+                    const visitedInStep = new Set();
+                    visitedInStep.add(uri);
+                    // BFS for this step's traversal
+                    const stepQueue = [
+                        { uri, hopDepth: 0, path: basePath },
+                    ];
+                    while (stepQueue.length > 0) {
+                        const current = stepQueue.shift();
+                        if (current.hopDepth >= maxHops) {
+                            continue;
+                        }
+                        // Get neighbors for this hop
+                        const neighbors = this.getNeighbors(current.uri, edgeTypes, step.direction);
+                        for (const neighbor of neighbors) {
+                            if (visitedInStep.has(neighbor)) {
+                                continue;
+                            }
+                            visitedInStep.add(neighbor);
+                            const newHopDepth = current.hopDepth + 1;
+                            const newPath = [...current.path, neighbor];
+                            const totalDepth = depth + newHopDepth;
+                            // Yield result if we're at or past minHops
+                            if (newHopDepth >= minHops) {
+                                // Apply filter if provided
+                                if (filter) {
+                                    const attrs = this.adapter.getNode(neighbor);
+                                    if (!filter(neighbor, attrs)) {
+                                        // Skip this node but continue traversing through it
+                                        if (newHopDepth < maxHops) {
+                                            stepQueue.push({
+                                                uri: neighbor,
+                                                hopDepth: newHopDepth,
+                                                path: newPath,
+                                            });
+                                        }
+                                        continue;
+                                    }
+                                }
+                                yield {
+                                    uri: neighbor,
+                                    depth: totalDepth,
+                                    path: newPath,
+                                    stepIndex,
+                                    edgeType: step.type,
+                                };
+                                yieldCount++;
+                                if (limit && yieldCount >= limit) {
+                                    return;
+                                }
+                                // If there are more steps, queue the next step starting from this node
+                                if (stepIndex + 1 < steps.length) {
+                                    queue.push({
+                                        uris: [neighbor],
+                                        stepIndex: stepIndex + 1,
+                                        depth: totalDepth,
+                                        basePath: newPath,
+                                    });
+                                }
+                            }
+                            // Continue traversing if we haven't reached maxHops
+                            if (newHopDepth < maxHops) {
+                                stepQueue.push({
+                                    uri: neighbor,
+                                    hopDepth: newHopDepth,
+                                    path: newPath,
+                                });
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    // === Selector Syntax ===
+    parseSelector(selector) {
+        // Check for prefix selector: +uri (children)
+        if (selector.startsWith('+')) {
+            return {
+                type: 'children',
+                uri: selector.slice(1),
+                original: selector,
+            };
+        }
+        // Check for suffix selector: uri+ (descendants)
+        if (selector.endsWith('+')) {
+            return {
+                type: 'descendants',
+                uri: selector.slice(0, -1),
+                original: selector,
+            };
+        }
+        // Check for neighbor selector: @uri
+        if (selector.startsWith('@')) {
+            return {
+                type: 'neighbors',
+                uri: selector.slice(1),
+                original: selector,
+            };
+        }
+        // Literal URI
+        return {
+            type: 'literal',
+            uri: selector,
+            original: selector,
+        };
+    }
+    expandSelector(selector, options = {}) {
+        const parsed = this.parseSelector(selector);
+        switch (parsed.type) {
+            case 'literal':
+                // Return the URI itself if it exists
+                return this.adapter.hasNode(parsed.uri) ? [parsed.uri] : [];
+            case 'children':
+                // Direct outgoing neighbors (single hop)
+                return this.related(parsed.uri, {
+                    ...options,
+                    direction: 'out',
+                });
+            case 'descendants':
+                // Transitive outgoing (infinite depth)
+                return this.reachable(parsed.uri, {
+                    edgeType: options.edgeType,
+                    direction: 'out',
+                    maxDepth: Infinity,
+                });
+            case 'neighbors':
+                // All directly connected nodes (both directions)
+                return this.related(parsed.uri, {
+                    ...options,
+                    direction: 'both',
+                });
+        }
+    }
+    // === Introspection ===
+    edgeTypes() {
+        return getEdgeTypeRegistry().getAll();
+    }
+    capabilities() {
+        const registry = getEdgeTypeRegistry();
+        const allTypes = registry.getAll();
+        const readyTypes = registry.getReadyAffectingTypes();
+        // Build provider map
+        const providers = new Map();
+        const providerNames = new Set();
+        for (const type of allTypes) {
+            for (const provider of type.providers) {
+                providerNames.add(provider);
+            }
+        }
+        for (const provider of providerNames) {
+            providers.set(provider, registry.getTypesForProvider(provider));
+        }
+        return {
+            edgeTypes: allTypes,
+            readyAffectingTypes: readyTypes,
+            providers,
+        };
+    }
+    // === Private Helper Methods ===
+    getNeighbors(uri, edgeTypes, direction) {
+        const graph = this.adapter.graph;
+        const neighbors = [];
+        if (direction === 'in' || direction === 'both') {
+            for (const edgeKey of graph.inEdges(uri)) {
+                const type = graph.getEdgeAttribute(edgeKey, 'type');
+                if (matchesEdgeType(type, edgeTypes)) {
+                    neighbors.push(graph.source(edgeKey));
+                }
+            }
+        }
+        if (direction === 'out' || direction === 'both') {
+            for (const edgeKey of graph.outEdges(uri)) {
+                const type = graph.getEdgeAttribute(edgeKey, 'type');
+                if (matchesEdgeType(type, edgeTypes)) {
+                    neighbors.push(graph.target(edgeKey));
+                }
+            }
+        }
+        return neighbors;
+    }
+}
+// === Helper Functions ===
+/**
+ * Normalize edge type filter to array or null
+ */
+function normalizeEdgeTypes(edgeType) {
+    if (!edgeType) {
+        return null;
+    }
+    if (Array.isArray(edgeType)) {
+        return edgeType.length > 0 ? edgeType : null;
+    }
+    return [edgeType];
+}
+/**
+ * Check if an edge type matches the filter
+ */
+function matchesEdgeType(type, edgeTypes) {
+    if (!edgeTypes) {
+        return true; // No filter, match all
+    }
+    return edgeTypes.includes(type);
+}
+/**
+ * Create a FederatedGraph instance
+ *
+ * @param adapter - The GraphologyAdapter to use
+ * @returns A FederatedGraph instance
+ */
+export function createFederatedGraph(adapter) {
+    return new FederatedGraphImpl(adapter);
+}
+//# sourceMappingURL=FederatedGraph.js.map

package/dist/graph/FederatedGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FederatedGraph.js","sourceRoot":"","sources":["../../src/graph/FederatedGraph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAGzD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AA2S5D;;GAEG;AACH,MAAM,OAAO,kBAAkB;IACR;IAArB,YAAqB,OAA0B;QAA1B,YAAO,GAAP,OAAO,CAAmB;IAAG,CAAC;IAEnD,OAAO,CAAC,GAAY,EAAE,UAA0B,EAAE;QAChD,MAAM,EAAE,QAAQ,EAAE,SAAS,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC;QAEjD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,SAAS,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QAEjC,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/C,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzC,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;oBACrC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAChD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;oBACrC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,SAAS,CAAC,GAAY,EAAE,UAA4B,EAAE;QACpD,MAAM,EAAE,QAAQ,EAAE,SAAS,GAAG,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC;QAErE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,SAAS,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;QACnC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,iCAAiC;QAEnD,MAAM,QAAQ,GAAG,CAAC,OAAgB,EAAE,KAAa,EAAQ,EAAE;YACzD,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;gBACtB,OAAO;YACT,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACnE,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,QAAQ,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,YAAY,CAAC,IAAa,EAAE,EAAW,EAAE,UAA+B,EAAE;QACxE,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;QAE9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7D,OAAO,IAAI,CAAC;QACd,CAAC;QAED,8DAA8D;QAC9D,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,+EAA+E;QAC/E,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAa,EAAE,EAAW,EAAE,SAAmB;QACrE,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,CAAC;QAChB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,MAAM,KAAK,GAAc,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAElB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,iDAAiD;YACjD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACtB,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;wBAE9B,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;4BACpB,mBAAmB;4BACnB,MAAM,IAAI,GAAc,CAAC,EAAE,CAAC,CAAC;4BAC7B,IAAI,IAAI,GAAG,EAAE,CAAC;4BACd,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gCACxB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gCACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;4BACrB,CAAC;4BACD,OAAO,IAAI,CAAC;wBACd,CAAC;wBAED,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,uDAAuD;YACvD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACtB,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;wBAE9B,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;4BACpB,mBAAmB;4BACnB,MAAM,IAAI,GAAc,CAAC,EAAE,CAAC,CAAC;4BAC7B,IAAI,IAAI,GAAG,EAAE,CAAC;4BACd,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gCACxB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;gCACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;4BACrB,CAAC;4BACD,OAAO,IAAI,CAAC;wBACd,CAAC;wBAED,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;IAC/B,CAAC;IAED,OAAO,CAAC,IAAa,EAAE,EAAW,EAAE,UAA+B,EAAE;QACnE,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,CAAC,KAAK,IAAI,CAAC;IACvD,CAAC;IAED,OAAO,CAAC,GAAY;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,GAAY;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,KAAK;QACH,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,KAAK;QACH,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK;YAC/B,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI;SAC/B,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,CAAC,QAAQ,CACb,SAA8B,EAC9B,OAAyB;QAEzB,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAClE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QAEzC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QAED,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,6BAA6B;QAC7B,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;YAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpC,SAAS;YACX,CAAC;YAWD,MAAM,KAAK,GAAgB;gBACzB;oBACE,IAAI,EAAE,CAAC,QAAQ,CAAC;oBAChB,SAAS,EAAE,CAAC;oBACZ,KAAK,EAAE,CAAC;oBACR,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACrB;aACF,CAAC;YAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBAC5B,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC;gBAElD,IAAI,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;oBAC9B,SAAS;gBACX,CAAC;gBAED,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;gBAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;gBAClC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;gBAClC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAE9B,mEAAmE;gBACnE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,iDAAiD;oBACjD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAW,CAAC;oBACzC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAEvB,gCAAgC;oBAChC,MAAM,SAAS,GAA+D;wBAC5E,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE;qBACrC,CAAC;oBAEF,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC5B,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;wBAEnC,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,EAAE,CAAC;4BAChC,SAAS;wBACX,CAAC;wBAED,6BAA6B;wBAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;wBAE5E,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;4BACjC,IAAI,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gCAChC,SAAS;4BACX,CAAC;4BACD,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;4BAE5B,MAAM,WAAW,GAAG,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC;4BACzC,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;4BAC5C,MAAM,UAAU,GAAG,KAAK,GAAG,WAAW,CAAC;4BAEvC,2CAA2C;4BAC3C,IAAI,WAAW,IAAI,OAAO,EAAE,CAAC;gCAC3B,2BAA2B;gCAC3B,IAAI,MAAM,EAAE,CAAC;oCACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oCAC7C,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC;wCAC7B,oDAAoD;wCACpD,IAAI,WAAW,GAAG,OAAO,EAAE,CAAC;4CAC1B,SAAS,CAAC,IAAI,CAAC;gDACb,GAAG,EAAE,QAAQ;gDACb,QAAQ,EAAE,WAAW;gDACrB,IAAI,EAAE,OAAO;6CACd,CAAC,CAAC;wCACL,CAAC;wCACD,SAAS;oCACX,CAAC;gCACH,CAAC;gCAED,MAAM;oCACJ,GAAG,EAAE,QAAQ;oCACb,KAAK,EAAE,UAAU;oCACjB,IAAI,EAAE,OAAO;oCACb,SAAS;oCACT,QAAQ,EAAE,IAAI,CAAC,IAAI;iCACpB,CAAC;gCAEF,UAAU,EAAE,CAAC;gCACb,IAAI,KAAK,IAAI,UAAU,IAAI,KAAK,EAAE,CAAC;oCACjC,OAAO;gCACT,CAAC;gCAED,uEAAuE;gCACvE,IAAI,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;oCACjC,KAAK,CAAC,IAAI,CAAC;wCACT,IAAI,EAAE,CAAC,QAAQ,CAAC;wCAChB,SAAS,EAAE,SAAS,GAAG,CAAC;wCACxB,KAAK,EAAE,UAAU;wCACjB,QAAQ,EAAE,OAAO;qCAClB,CAAC,CAAC;gCACL,CAAC;4BACH,CAAC;4BAED,oDAAoD;4BACpD,IAAI,WAAW,GAAG,OAAO,EAAE,CAAC;gCAC1B,SAAS,CAAC,IAAI,CAAC;oCACb,GAAG,EAAE,QAAQ;oCACb,QAAQ,EAAE,WAAW;oCACrB,IAAI,EAAE,OAAO;iCACd,CAAC,CAAC;4BACL,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,0BAA0B;IAE1B,aAAa,CAAC,QAAgB;QAC5B,6CAA6C;QAC7C,IAAI,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,GAAG,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtB,QAAQ,EAAE,QAAQ;aACnB,CAAC;QACJ,CAAC;QAED,gDAAgD;QAChD,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3B,OAAO;gBACL,IAAI,EAAE,aAAa;gBACnB,GAAG,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1B,QAAQ,EAAE,QAAQ;aACnB,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,IAAI,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO;gBACL,IAAI,EAAE,WAAW;gBACjB,GAAG,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtB,QAAQ,EAAE,QAAQ;aACnB,CAAC;QACJ,CAAC;QAED,cAAc;QACd,OAAO;YACL,IAAI,EAAE,SAAS;YACf,GAAG,EAAE,QAAQ;YACb,QAAQ,EAAE,QAAQ;SACnB,CAAC;IACJ,CAAC;IAED,cAAc,CAAC,QAAgB,EAAE,UAA0B,EAAE;QAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QAE5C,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;YACpB,KAAK,SAAS;gBACZ,qCAAqC;gBACrC,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAE9D,KAAK,UAAU;gBACb,yCAAyC;gBACzC,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE;oBAC9B,GAAG,OAAO;oBACV,SAAS,EAAE,KAAK;iBACjB,CAAC,CAAC;YAEL,KAAK,aAAa;gBAChB,uCAAuC;gBACvC,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE;oBAChC,QAAQ,EAAE,OAAO,CAAC,QAAQ;oBAC1B,SAAS,EAAE,KAAK;oBAChB,QAAQ,EAAE,QAAQ;iBACnB,CAAC,CAAC;YAEL,KAAK,WAAW;gBACd,iDAAiD;gBACjD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE;oBAC9B,GAAG,OAAO;oBACV,SAAS,EAAE,MAAM;iBAClB,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IAED,wBAAwB;IAExB,SAAS;QACP,OAAO,mBAAmB,EAAE,CAAC,MAAM,EAAE,CAAC;IACxC,CAAC;IAED,YAAY;QACV,MAAM,QAAQ,GAAG,mBAAmB,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,QAAQ,CAAC,sBAAsB,EAAE,CAAC;QAErD,qBAAqB;QACrB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgC,CAAC;QAC1D,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACtC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;YACrC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,OAAO;YACL,SAAS,EAAE,QAAQ;YACnB,mBAAmB,EAAE,UAAU;YAC/B,SAAS;SACV,CAAC;IACJ,CAAC;IAED,iCAAiC;IAEzB,YAAY,CAClB,GAAY,EACZ,SAA0B,EAC1B,SAA6B;QAE7B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACjC,MAAM,SAAS,GAAc,EAAE,CAAC;QAEhC,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/C,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzC,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;oBACrC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAChD,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;oBACrC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED,2BAA2B;AAE3B;;GAEG;AACH,SAAS,kBAAkB,CAAC,QAA4B;IACtD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5B,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,CAAC;IACD,OAAO,CAAC,QAAQ,CAAC,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,IAAY,EAAE,SAA0B;IAC/D,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,CAAC,uBAAuB;IACtC,CAAC;IACD,OAAO,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAA0B;IAC7D,OAAO,IAAI,kBAAkB,CAAC,OAAO,CAAC,CAAC;AACzC,CAAC"}

package/dist/graph/GraphologyAdapter.d.ts

@@ -0,0 +1,151 @@
+/**
+ * Graphology Adapter for OpenTasks
+ *
+ * Provides an in-memory graph layer over SQLite storage using Graphology.
+ * All traversal operations query this graph, while SQLite remains authoritative.
+ */
+import { MultiDirectedGraph } from 'graphology';
+import type { StoredNode, StoredEdge } from '../schema/storage.js';
+import type { Storage } from '../storage/interface.js';
+/**
+ * Node URI type - universal identifier across providers
+ * Examples: 'native://s-abc', 'beads://./bd-123', 'external://x-456'
+ */
+export type NodeURI = string;
+/**
+ * Node attributes stored in the graph
+ */
+export interface GraphNodeAttributes {
+    /** Original node ID */
+    id: string;
+    /** Node type */
+    type: string;
+    /** Node title */
+    title: string;
+    /** Node status (if applicable) */
+    status?: string;
+    /** Priority (0-4) */
+    priority?: number;
+    /** Whether node is archived */
+    archived?: boolean;
+    /** When data was cached (for external nodes) */
+    cached_at?: string;
+    /** Source system for external nodes */
+    source?: string;
+    /** Full node data for resolution */
+    data: StoredNode;
+}
+/**
+ * Edge attributes stored in the graph
+ */
+export interface GraphEdgeAttributes {
+    /** Edge ID */
+    id: string;
+    /** Relationship type */
+    type: string;
+    /** Source system */
+    source?: string;
+    /** When edge was cached (for external edges) */
+    cached_at?: string;
+    /** Additional metadata */
+    metadata?: Record<string, unknown>;
+}
+/**
+ * Graphology Adapter Interface
+ *
+ * Provides access to the in-memory graph and methods for syncing with storage.
+ */
+export interface GraphologyAdapter {
+    /** The underlying Graphology graph instance */
+    readonly graph: MultiDirectedGraph<GraphNodeAttributes, GraphEdgeAttributes>;
+    /**
+     * Load all nodes and edges from storage into the graph
+     * Should be called once on startup
+     */
+    loadFromStorage(storage: Storage): Promise<void>;
+    /**
+     * Add a node to the graph after it was created in storage
+     */
+    onNodeCreated(node: StoredNode): void;
+    /**
+     * Update a node in the graph after it was updated in storage
+     */
+    onNodeUpdated(id: string, updates: Partial<StoredNode>): void;
+    /**
+     * Remove a node from the graph after it was deleted in storage
+     */
+    onNodeDeleted(id: string): void;
+    /**
+     * Add an edge to the graph after it was created in storage
+     */
+    onEdgeCreated(edge: StoredEdge): void;
+    /**
+     * Remove an edge from the graph after it was deleted in storage
+     */
+    onEdgeDeleted(id: string): void;
+    /**
+     * Add or update an external node in the graph
+     */
+    hydrateNode(uri: NodeURI, node: StoredNode): void;
+    /**
+     * Add edges for a node (typically from provider query)
+     */
+    hydrateEdges(uri: NodeURI, edges: StoredEdge[]): void;
+    /**
+     * Convert a stored node to its URI
+     */
+    nodeToUri(node: StoredNode): NodeURI;
+    /**
+     * Check if a node exists in the graph
+     */
+    hasNode(uri: NodeURI): boolean;
+    /**
+     * Get node attributes by URI
+     */
+    getNode(uri: NodeURI): GraphNodeAttributes | null;
+    /**
+     * Get all edges for a node
+     */
+    getEdges(uri: NodeURI, direction?: 'in' | 'out' | 'both'): GraphEdgeAttributes[];
+    /**
+     * Clear all data from the graph
+     */
+    clear(): void;
+}
+/**
+ * Implementation of GraphologyAdapter
+ */
+export declare class GraphologyAdapterImpl implements GraphologyAdapter {
+    readonly graph: MultiDirectedGraph<GraphNodeAttributes, GraphEdgeAttributes>;
+    private edgeIdToKey;
+    constructor();
+    loadFromStorage(storage: Storage): Promise<void>;
+    onNodeCreated(node: StoredNode): void;
+    onNodeUpdated(id: string, updates: Partial<StoredNode>): void;
+    onNodeDeleted(id: string): void;
+    onEdgeCreated(edge: StoredEdge): void;
+    onEdgeDeleted(id: string): void;
+    hydrateNode(uri: NodeURI, node: StoredNode): void;
+    hydrateEdges(uri: NodeURI, edges: StoredEdge[]): void;
+    nodeToUri(node: StoredNode): NodeURI;
+    hasNode(uri: NodeURI): boolean;
+    getNode(uri: NodeURI): GraphNodeAttributes | null;
+    getEdges(uri: NodeURI, direction?: 'in' | 'out' | 'both'): GraphEdgeAttributes[];
+    clear(): void;
+    private addNodeToGraph;
+    private addEdgeToGraph;
+    private nodeToAttributes;
+    private edgeToAttributes;
+    private placeholderAttributes;
+    /**
+     * Convert an ID to URI
+     * If it looks like a URI (contains ://), return as-is
+     * Otherwise, wrap in native:// scheme
+     */
+    private idToUri;
+}
+/**
+ * Create a new GraphologyAdapter instance
+ */
+export declare function createGraphologyAdapter(): GraphologyAdapter;
+//# sourceMappingURL=GraphologyAdapter.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GraphologyAdapter.d.ts","sourceRoot":"","sources":["../../src/graph/GraphologyAdapter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,kBAAkB,EAAE,MAAM,YAAY,CAAC;AAEhD,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAC;AAEvD;;;GAGG;AACH,MAAM,MAAM,OAAO,GAAG,MAAM,CAAC;AAE7B;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,uBAAuB;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,gBAAgB;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,iBAAiB;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,kCAAkC;IAClC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,qBAAqB;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,+BAA+B;IAC/B,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,gDAAgD;IAChD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,uCAAuC;IACvC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,oCAAoC;IACpC,IAAI,EAAE,UAAU,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,cAAc;IACd,EAAE,EAAE,MAAM,CAAC;IACX,wBAAwB;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,oBAAoB;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,gDAAgD;IAChD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0BAA0B;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,+CAA+C;IAC/C,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC,mBAAmB,EAAE,mBAAmB,CAAC,CAAC;IAE7E;;;OAGG;IACH,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAIjD;;OAEG;IACH,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IAEtC;;OAEG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC;IAE9D;;OAEG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;IAEhC;;OAEG;IACH,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IAEtC;;OAEG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;IAIhC;;OAEG;IACH,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI,CAAC;IAElD;;OAEG;IACH,YAAY,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC;IAItD;;OAEG;IACH,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO,CAAC;IAErC;;OAEG;IACH,OAAO,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAAC;IAE/B;;OAEG;IACH,OAAO,CAAC,GAAG,EAAE,OAAO,GAAG,mBAAmB,GAAG,IAAI,CAAC;IAElD;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,MAAM,GAAG,mBAAmB,EAAE,CAAC;IAEjF;;OAEG;IACH,KAAK,IAAI,IAAI,CAAC;CACf;AAED;;GAEG;AACH,qBAAa,qBAAsB,YAAW,iBAAiB;IAC7D,QAAQ,CAAC,KAAK,EAAE,kBAAkB,CAAC,mBAAmB,EAAE,mBAAmB,CAAC,CAAC;IAG7E,OAAO,CAAC,WAAW,CAAkC;;IAO/C,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAwBtD,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI;IAIrC,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,IAAI;IAmB7D,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAQ/B,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,IAAI;IAIrC,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAQ/B,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI;IAUjD,YAAY,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI;IAQrD,SAAS,CAAC,IAAI,EAAE,UAAU,GAAG,OAAO;IAUpC,OAAO,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO;IAI9B,OAAO,CAAC,GAAG,EAAE,OAAO,GAAG,mBAAmB,GAAG,IAAI;IAOjD,QAAQ,CAAC,GAAG,EAAE,OAAO,EAAE,SAAS,GAAE,IAAI,GAAG,KAAK,GAAG,MAAe,GAAG,mBAAmB,EAAE;IAsBxF,KAAK,IAAI,IAAI;IAOb,OAAO,CAAC,cAAc;IAOtB,OAAO,CAAC,cAAc;IAiBtB,OAAO,CAAC,gBAAgB;IAcxB,OAAO,CAAC,gBAAgB;IAUxB,OAAO,CAAC,qBAAqB;IAiB7B;;;;OAIG;IACH,OAAO,CAAC,OAAO;CAMhB;AAED;;GAEG;AACH,wBAAgB,uBAAuB,IAAI,iBAAiB,CAE3D"}