@cyanheads/mcp-ts-core 0.1.0-beta.12

package/dist/services/graph/core/GraphService.d.ts

@@ -0,0 +1,205 @@
+/**
+ * @fileoverview Graph service orchestrator.
+ * Manages graph database operations with provider abstraction.
+ * @module src/services/graph/core/GraphService
+ */
+import type { RequestContext } from '../../../utils/internal/requestContext.js';
+import type { GraphStats } from '../types.js';
+import type { Edge, GraphPath, IGraphProvider, PathOptions, RelateOptions, TraversalOptions, TraversalResult } from './IGraphProvider.js';
+/**
+ * Provider-agnostic service for graph database operations.
+ *
+ * @remarks
+ * Wraps an {@link IGraphProvider} implementation and adds request-scoped debug
+ * logging around every operation. All graph I/O — relationship management,
+ * traversal, pathfinding, edge queries, statistics, and health checks — is
+ * delegated to the injected provider.
+ *
+ * @example
+ * ```ts
+ * import { GraphService } from './GraphService.js';
+ * import { MockGraphProvider } from '../providers/mock/MockGraphProvider.js';
+ *
+ * const graphService = new GraphService(new MockGraphProvider());
+ *
+ * // Create a relationship
+ * const edge = await graphService.relate(
+ *   'user:alice',
+ *   'follows',
+ *   'user:bob',
+ *   context,
+ *   { data: { since: '2025-01-01' } },
+ * );
+ *
+ * // Traverse the graph
+ * const result = await graphService.traverse('user:alice', context, {
+ *   maxDepth: 2,
+ *   edgeTypes: ['follows'],
+ * });
+ * ```
+ */
+export declare class GraphService {
+    private readonly provider;
+    constructor(provider: IGraphProvider);
+    /**
+     * Return the underlying {@link IGraphProvider} instance.
+     * Useful for accessing provider-specific extensions not exposed by this service.
+     *
+     * @returns The active graph provider
+     *
+     * @example
+     * ```ts
+     * const provider = graphService.getProvider();
+     * console.log(provider.name); // e.g. 'mock'
+     * ```
+     */
+    getProvider(): IGraphProvider;
+    /**
+     * Create a directed relationship edge between two vertices.
+     *
+     * @param from - ID of the source vertex
+     * @param edgeTable - Table (type) name for the edge (e.g. `'follows'`)
+     * @param to - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param options - Optional edge payload and duplicate-handling behaviour
+     * @returns The newly created edge
+     * @throws {Error} If either vertex does not exist or the provider rejects a duplicate
+     *
+     * @example
+     * ```ts
+     * const edge = await graphService.relate('user:alice', 'follows', 'user:bob', context, {
+     *   data: { since: '2025-01-01' },
+     * });
+     * ```
+     */
+    relate(from: string, edgeTable: string, to: string, context: RequestContext, options?: RelateOptions): Promise<Edge>;
+    /**
+     * Delete a relationship edge by its ID.
+     *
+     * @param edgeId - ID of the edge to remove
+     * @param context - Request context used for correlated logging
+     * @returns `true` if the edge was found and deleted, `false` if it did not exist
+     * @throws {Error} If the provider encounters a storage error
+     *
+     * @example
+     * ```ts
+     * const deleted = await graphService.unrelate('follows:1', context);
+     * ```
+     */
+    unrelate(edgeId: string, context: RequestContext): Promise<boolean>;
+    /**
+     * Traverse the graph outward (or inward/both) from a starting vertex.
+     *
+     * @param startVertexId - ID of the vertex to begin traversal from
+     * @param context - Request context used for correlated logging
+     * @param options - Direction, depth limit, edge/vertex type filters, and WHERE expression
+     * @returns All discovered paths and the resolved start vertex
+     * @throws {Error} If the start vertex does not exist or the provider query fails
+     *
+     * @example
+     * ```ts
+     * const result = await graphService.traverse('user:alice', context, {
+     *   maxDepth: 2,
+     *   edgeTypes: ['follows'],
+     *   direction: 'out',
+     * });
+     * console.log(`Found ${result.paths.length} paths`);
+     * ```
+     */
+    traverse(startVertexId: string, context: RequestContext, options?: TraversalOptions): Promise<TraversalResult>;
+    /**
+     * Find the lowest-cost path between two vertices using the specified algorithm.
+     *
+     * @param from - ID of the source vertex
+     * @param to - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param options - Algorithm selection, depth limit, and optional weight function
+     * @returns The shortest path, or `null` if no path exists within the constraints
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const path = await graphService.shortestPath('user:alice', 'user:charlie', context, {
+     *   algorithm: 'bfs',
+     *   maxLength: 4,
+     * });
+     * if (path) console.log(`${path.vertices.length} hops`);
+     * ```
+     */
+    shortestPath(from: string, to: string, context: RequestContext, options?: PathOptions): Promise<GraphPath | null>;
+    /**
+     * Get all outgoing edges originating from a vertex.
+     *
+     * @param vertexId - ID of the source vertex
+     * @param context - Request context used for correlated logging
+     * @param edgeTypes - When provided, only edges belonging to these tables are returned
+     * @returns Array of matching outgoing edges, or an empty array if none
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const edges = await graphService.getOutgoingEdges('user:alice', context, ['follows']);
+     * ```
+     */
+    getOutgoingEdges(vertexId: string, context: RequestContext, edgeTypes?: string[]): Promise<Edge[]>;
+    /**
+     * Get all incoming edges directed at a vertex.
+     *
+     * @param vertexId - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param edgeTypes - When provided, only edges belonging to these tables are returned
+     * @returns Array of matching incoming edges, or an empty array if none
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const edges = await graphService.getIncomingEdges('user:bob', context, ['follows']);
+     * ```
+     */
+    getIncomingEdges(vertexId: string, context: RequestContext, edgeTypes?: string[]): Promise<Edge[]>;
+    /**
+     * Determine whether any path exists between two vertices without returning it.
+     * More efficient than `shortestPath` when only reachability is needed.
+     *
+     * @param from - ID of the source vertex
+     * @param to - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param maxDepth - Maximum hop count to search. Unbounded when omitted.
+     * @returns `true` if at least one path exists within the depth limit
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const connected = await graphService.pathExists('user:alice', 'user:charlie', context, 3);
+     * ```
+     */
+    pathExists(from: string, to: string, context: RequestContext, maxDepth?: number): Promise<boolean>;
+    /**
+     * Compute aggregate statistics about the current graph.
+     *
+     * @param context - Request context used for correlated logging
+     * @returns Snapshot of vertex/edge counts and per-type breakdowns
+     * @throws {Error} If the provider cannot compute statistics
+     *
+     * @example
+     * ```ts
+     * const stats = await graphService.getStats(context);
+     * console.log(`${stats.vertexCount} vertices, avg degree ${stats.avgDegree}`);
+     * ```
+     */
+    getStats(context: RequestContext): Promise<GraphStats>;
+    /**
+     * Perform a liveness check on the underlying graph provider.
+     *
+     * @returns `true` if the provider is reachable and operational, `false` otherwise
+     *
+     * @example
+     * ```ts
+     * if (!(await graphService.healthCheck())) {
+     *   throw new Error('Graph provider is unhealthy');
+     * }
+     * ```
+     */
+    healthCheck(): Promise<boolean>;
+}
+//# sourceMappingURL=GraphService.d.ts.map

package/dist/services/graph/core/GraphService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphService.d.ts","sourceRoot":"","sources":["../../../../src/services/graph/core/GraphService.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AACzE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EACV,IAAI,EACJ,SAAS,EACT,cAAc,EACd,WAAW,EACX,aAAa,EACb,gBAAgB,EAChB,eAAe,EAChB,MAAM,qBAAqB,CAAC;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,qBAAa,YAAY;IACX,OAAO,CAAC,QAAQ,CAAC,QAAQ;gBAAR,QAAQ,EAAE,cAAc;IAIrD;;;;;;;;;;;OAWG;IACH,WAAW,IAAI,cAAc;IAI7B;;;;;;;;;;;;;;;;;OAiBG;IACG,MAAM,CACV,IAAI,EAAE,MAAM,EACZ,SAAS,EAAE,MAAM,EACjB,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,cAAc,EACvB,OAAO,CAAC,EAAE,aAAa,GACtB,OAAO,CAAC,IAAI,CAAC;IAMhB;;;;;;;;;;;;OAYG;IACG,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC;IAMzE;;;;;;;;;;;;;;;;;;OAkBG;IACG,QAAQ,CACZ,aAAa,EAAE,MAAM,EACrB,OAAO,EAAE,cAAc,EACvB,OAAO,CAAC,EAAE,gBAAgB,GACzB,OAAO,CAAC,eAAe,CAAC;IAM3B;;;;;;;;;;;;;;;;;;OAkBG;IACG,YAAY,CAChB,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,cAAc,EACvB,OAAO,CAAC,EAAE,WAAW,GACpB,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAM5B;;;;;;;;;;;;;OAaG;IACG,gBAAgB,CACpB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,cAAc,EACvB,SAAS,CAAC,EAAE,MAAM,EAAE,GACnB,OAAO,CAAC,IAAI,EAAE,CAAC;IAIlB;;;;;;;;;;;;;OAaG;IACG,gBAAgB,CACpB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,cAAc,EACvB,SAAS,CAAC,EAAE,MAAM,EAAE,GACnB,OAAO,CAAC,IAAI,EAAE,CAAC;IAIlB;;;;;;;;;;;;;;;OAeG;IACG,UAAU,CACd,IAAI,EAAE,MAAM,EACZ,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,cAAc,EACvB,QAAQ,CAAC,EAAE,MAAM,GAChB,OAAO,CAAC,OAAO,CAAC;IAInB;;;;;;;;;;;;OAYG;IACG,QAAQ,CAAC,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC;IAK5D;;;;;;;;;;;OAWG;IACG,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;CAGtC"}

package/dist/services/graph/core/GraphService.js

@@ -0,0 +1,231 @@
+/**
+ * @fileoverview Graph service orchestrator.
+ * Manages graph database operations with provider abstraction.
+ * @module src/services/graph/core/GraphService
+ */
+import { logger } from '../../../utils/internal/logger.js';
+/**
+ * Provider-agnostic service for graph database operations.
+ *
+ * @remarks
+ * Wraps an {@link IGraphProvider} implementation and adds request-scoped debug
+ * logging around every operation. All graph I/O — relationship management,
+ * traversal, pathfinding, edge queries, statistics, and health checks — is
+ * delegated to the injected provider.
+ *
+ * @example
+ * ```ts
+ * import { GraphService } from './GraphService.js';
+ * import { MockGraphProvider } from '../providers/mock/MockGraphProvider.js';
+ *
+ * const graphService = new GraphService(new MockGraphProvider());
+ *
+ * // Create a relationship
+ * const edge = await graphService.relate(
+ *   'user:alice',
+ *   'follows',
+ *   'user:bob',
+ *   context,
+ *   { data: { since: '2025-01-01' } },
+ * );
+ *
+ * // Traverse the graph
+ * const result = await graphService.traverse('user:alice', context, {
+ *   maxDepth: 2,
+ *   edgeTypes: ['follows'],
+ * });
+ * ```
+ */
+export class GraphService {
+    provider;
+    constructor(provider) {
+        this.provider = provider;
+        logger.info(`Graph service initialized with provider: ${provider.name}`);
+    }
+    /**
+     * Return the underlying {@link IGraphProvider} instance.
+     * Useful for accessing provider-specific extensions not exposed by this service.
+     *
+     * @returns The active graph provider
+     *
+     * @example
+     * ```ts
+     * const provider = graphService.getProvider();
+     * console.log(provider.name); // e.g. 'mock'
+     * ```
+     */
+    getProvider() {
+        return this.provider;
+    }
+    /**
+     * Create a directed relationship edge between two vertices.
+     *
+     * @param from - ID of the source vertex
+     * @param edgeTable - Table (type) name for the edge (e.g. `'follows'`)
+     * @param to - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param options - Optional edge payload and duplicate-handling behaviour
+     * @returns The newly created edge
+     * @throws {Error} If either vertex does not exist or the provider rejects a duplicate
+     *
+     * @example
+     * ```ts
+     * const edge = await graphService.relate('user:alice', 'follows', 'user:bob', context, {
+     *   data: { since: '2025-01-01' },
+     * });
+     * ```
+     */
+    async relate(from, edgeTable, to, context, options) {
+        logger.debug(`[GraphService] Creating relationship: ${from} -[${edgeTable}]-> ${to}`, context);
+        return await this.provider.relate(from, edgeTable, to, context, options);
+    }
+    /**
+     * Delete a relationship edge by its ID.
+     *
+     * @param edgeId - ID of the edge to remove
+     * @param context - Request context used for correlated logging
+     * @returns `true` if the edge was found and deleted, `false` if it did not exist
+     * @throws {Error} If the provider encounters a storage error
+     *
+     * @example
+     * ```ts
+     * const deleted = await graphService.unrelate('follows:1', context);
+     * ```
+     */
+    async unrelate(edgeId, context) {
+        logger.debug(`[GraphService] Deleting relationship: ${edgeId}`, context);
+        return await this.provider.unrelate(edgeId, context);
+    }
+    /**
+     * Traverse the graph outward (or inward/both) from a starting vertex.
+     *
+     * @param startVertexId - ID of the vertex to begin traversal from
+     * @param context - Request context used for correlated logging
+     * @param options - Direction, depth limit, edge/vertex type filters, and WHERE expression
+     * @returns All discovered paths and the resolved start vertex
+     * @throws {Error} If the start vertex does not exist or the provider query fails
+     *
+     * @example
+     * ```ts
+     * const result = await graphService.traverse('user:alice', context, {
+     *   maxDepth: 2,
+     *   edgeTypes: ['follows'],
+     *   direction: 'out',
+     * });
+     * console.log(`Found ${result.paths.length} paths`);
+     * ```
+     */
+    async traverse(startVertexId, context, options) {
+        logger.debug(`[GraphService] Traversing from: ${startVertexId}`, context);
+        return await this.provider.traverse(startVertexId, context, options);
+    }
+    /**
+     * Find the lowest-cost path between two vertices using the specified algorithm.
+     *
+     * @param from - ID of the source vertex
+     * @param to - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param options - Algorithm selection, depth limit, and optional weight function
+     * @returns The shortest path, or `null` if no path exists within the constraints
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const path = await graphService.shortestPath('user:alice', 'user:charlie', context, {
+     *   algorithm: 'bfs',
+     *   maxLength: 4,
+     * });
+     * if (path) console.log(`${path.vertices.length} hops`);
+     * ```
+     */
+    async shortestPath(from, to, context, options) {
+        logger.debug(`[GraphService] Finding shortest path: ${from} -> ${to}`, context);
+        return await this.provider.shortestPath(from, to, context, options);
+    }
+    /**
+     * Get all outgoing edges originating from a vertex.
+     *
+     * @param vertexId - ID of the source vertex
+     * @param context - Request context used for correlated logging
+     * @param edgeTypes - When provided, only edges belonging to these tables are returned
+     * @returns Array of matching outgoing edges, or an empty array if none
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const edges = await graphService.getOutgoingEdges('user:alice', context, ['follows']);
+     * ```
+     */
+    async getOutgoingEdges(vertexId, context, edgeTypes) {
+        return await this.provider.getOutgoingEdges(vertexId, context, edgeTypes);
+    }
+    /**
+     * Get all incoming edges directed at a vertex.
+     *
+     * @param vertexId - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param edgeTypes - When provided, only edges belonging to these tables are returned
+     * @returns Array of matching incoming edges, or an empty array if none
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const edges = await graphService.getIncomingEdges('user:bob', context, ['follows']);
+     * ```
+     */
+    async getIncomingEdges(vertexId, context, edgeTypes) {
+        return await this.provider.getIncomingEdges(vertexId, context, edgeTypes);
+    }
+    /**
+     * Determine whether any path exists between two vertices without returning it.
+     * More efficient than `shortestPath` when only reachability is needed.
+     *
+     * @param from - ID of the source vertex
+     * @param to - ID of the target vertex
+     * @param context - Request context used for correlated logging
+     * @param maxDepth - Maximum hop count to search. Unbounded when omitted.
+     * @returns `true` if at least one path exists within the depth limit
+     * @throws {Error} If the provider encounters a storage or query error
+     *
+     * @example
+     * ```ts
+     * const connected = await graphService.pathExists('user:alice', 'user:charlie', context, 3);
+     * ```
+     */
+    async pathExists(from, to, context, maxDepth) {
+        return await this.provider.pathExists(from, to, context, maxDepth);
+    }
+    /**
+     * Compute aggregate statistics about the current graph.
+     *
+     * @param context - Request context used for correlated logging
+     * @returns Snapshot of vertex/edge counts and per-type breakdowns
+     * @throws {Error} If the provider cannot compute statistics
+     *
+     * @example
+     * ```ts
+     * const stats = await graphService.getStats(context);
+     * console.log(`${stats.vertexCount} vertices, avg degree ${stats.avgDegree}`);
+     * ```
+     */
+    async getStats(context) {
+        logger.debug('[GraphService] Getting graph statistics', context);
+        return await this.provider.getStats(context);
+    }
+    /**
+     * Perform a liveness check on the underlying graph provider.
+     *
+     * @returns `true` if the provider is reachable and operational, `false` otherwise
+     *
+     * @example
+     * ```ts
+     * if (!(await graphService.healthCheck())) {
+     *   throw new Error('Graph provider is unhealthy');
+     * }
+     * ```
+     */
+    async healthCheck() {
+        return await this.provider.healthCheck();
+    }
+}
+//# sourceMappingURL=GraphService.js.map

package/dist/services/graph/core/GraphService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphService.js","sourceRoot":"","sources":["../../../../src/services/graph/core/GraphService.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAapD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,OAAO,YAAY;IACM;IAA7B,YAA6B,QAAwB;QAAxB,aAAQ,GAAR,QAAQ,CAAgB;QACnD,MAAM,CAAC,IAAI,CAAC,4CAA4C,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED;;;;;;;;;;;OAWG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,KAAK,CAAC,MAAM,CACV,IAAY,EACZ,SAAiB,EACjB,EAAU,EACV,OAAuB,EACvB,OAAuB;QAEvB,MAAM,CAAC,KAAK,CAAC,yCAAyC,IAAI,MAAM,SAAS,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;QAE/F,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAC3E,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,QAAQ,CAAC,MAAc,EAAE,OAAuB;QACpD,MAAM,CAAC,KAAK,CAAC,yCAAyC,MAAM,EAAE,EAAE,OAAO,CAAC,CAAC;QAEzE,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,KAAK,CAAC,QAAQ,CACZ,aAAqB,EACrB,OAAuB,EACvB,OAA0B;QAE1B,MAAM,CAAC,KAAK,CAAC,mCAAmC,aAAa,EAAE,EAAE,OAAO,CAAC,CAAC;QAE1E,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,KAAK,CAAC,YAAY,CAChB,IAAY,EACZ,EAAU,EACV,OAAuB,EACvB,OAAqB;QAErB,MAAM,CAAC,KAAK,CAAC,yCAAyC,IAAI,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;QAEhF,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,gBAAgB,CACpB,QAAgB,EAChB,OAAuB,EACvB,SAAoB;QAEpB,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAC5E,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,gBAAgB,CACpB,QAAgB,EAChB,OAAuB,EACvB,SAAoB;QAEpB,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAC5E,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,UAAU,CACd,IAAY,EACZ,EAAU,EACV,OAAuB,EACvB,QAAiB;QAEjB,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACrE,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,QAAQ,CAAC,OAAuB;QACpC,MAAM,CAAC,KAAK,CAAC,yCAAyC,EAAE,OAAO,CAAC,CAAC;QACjE,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,WAAW;QACf,OAAO,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;IAC3C,CAAC;CACF"}