mcp-cognition-engine 1.0.0-alpha.1

package/dist/resources/cognition-resources.js

@@ -0,0 +1,124 @@
+/**
+ * Copyright 2026 熊高锐
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/**
+ * @file Cognition Engine MCP Resources
+ * Exposes three resources for Agent discovery:
+ *   cognition://schema  — Graph data model JSON Schema
+ *   cognition://stats   — Graph statistics (node/edge counts)
+ *   cognition://docs    — Integration documentation
+ */
+import { readFileSync } from "node:fs";
+import { join, dirname } from "node:path";
+import { fileURLToPath } from "node:url";
+import { getPrismaClient } from "../storage/client.js";
+const __dirname = dirname(fileURLToPath(import.meta.url));
+const projectRoot = join(__dirname, "../..");
+// ── Resource Definitions ───────────────────────────────────
+export const RESOURCES = [
+    {
+        uri: "cognition://schema",
+        name: "Cognition Graph Schema",
+        description: "JSON Schema of the cognition graph data model, including CognitionNode, CognitionEdge, and AstTemplate tables and their relationships.",
+        mimeType: "application/json",
+    },
+    {
+        uri: "cognition://stats",
+        name: "Cognition Engine Statistics",
+        description: "Current graph statistics: node count, edge count, feedback event count, and average traversal latency. Useful for health checks and capacity planning.",
+        mimeType: "application/json",
+    },
+    {
+        uri: "cognition://docs",
+        name: "Cognition Engine Documentation",
+        description: "Full MCP tool documentation from docs/phase4-mcp-feedback.md. Agents can read this to learn how to use cognition_query, cognition_validate, and cognition_feedback.",
+        mimeType: "text/markdown",
+    },
+    {
+        uri: "cognition://rules-changelog",
+        name: "Rules Changelog",
+        description: "Versioned changelog of global rule changes. Returns version = SHA-256 prefix of updated_at field. Agents must read this before making rule modifications.",
+        mimeType: "application/json",
+    },
+];
+// ── Resource Readers ──────────────────────────────────────
+/** Return the JSON schema for the cognition graph data model. */
+export async function readCognitionSchema() {
+    const schema = {
+        "": "http://json-schema.org/draft-07/schema#",
+        title: "CognitionGraph",
+        description: "Schema for the cognition graph data model",
+        type: "object",
+        properties: {
+            CognitionNode: {
+                type: "object",
+                properties: {
+                    id: { type: "string", description: "Unique node identifier (CUID)" },
+                    type: { type: "string", enum: ["INTENT", "CONSTRAINT", "HEURISTIC", "PATTERN"], description: "Node type" },
+                    semanticHash: { type: "string", description: "Semantic deduplication hash" },
+                    abstractionLevel: { type: "integer", minimum: 0, maximum: 3, description: "0=code, 1=function, 2=module, 3=architecture" },
+                    payload: { type: "object", description: "Structured AST/constraint data" },
+                    createdAt: { type: "string", format: "date-time" },
+                },
+            },
+            CognitionEdge: {
+                type: "object",
+                properties: {
+                    id: { type: "string" },
+                    sourceId: { type: "string", description: "Source node ID" },
+                    targetId: { type: "string", description: "Target node ID" },
+                    relation: { type: "string", enum: ["CAUSES", "PRECEDES", "MUTEX", "GENERALIZES", "REFINES"] },
+                    weight: { type: "number", minimum: 0, maximum: 10, default: 1.0 },
+                },
+            },
+            AstTemplate: {
+                type: "object",
+                properties: {
+                    nodeId: { type: "string" },
+                    language: { type: "string" },
+                    templateDsl: { type: "string", description: "AST constraint DSL" },
+                },
+            },
+        },
+    };
+    return JSON.stringify(schema, null, 2);
+}
+/** Return current graph statistics with approval rate. */
+export async function readCognitionStats() {
+    const prisma = getPrismaClient();
+    const sevenDaysAgo = new Date(Date.now() - 7 * 86400000);
+    const [nodeCount, edgeCount, feedbackCount, recentFeedback, approvedCount] = await Promise.all([
+        prisma.cognitionNode.count(),
+        prisma.cognitionEdge.count(),
+        prisma.metricEvent.count({ where: { eventType: { startsWith: "cognition_feedback" } } }),
+        prisma.metricEvent.count({ where: { eventType: { startsWith: "cognition_feedback" }, createdAt: { gte: sevenDaysAgo } } }),
+        prisma.metricEvent.count({ where: { eventType: { startsWith: "cognition_feedback" }, properties: { contains: "APPROVED" }, createdAt: { gte: sevenDaysAgo } } }),
+    ]);
+    const approvalRate7d = recentFeedback > 0 ? approvedCount / recentFeedback : 0;
+    const thresholdAdjustmentSuggestion = approvalRate7d > 0.4 || approvalRate7d < 0.05
+        ? "Threshold adjustment recommended: approvalRate7d = " + (approvalRate7d * 100).toFixed(1) + "%"
+        : undefined;
+    return JSON.stringify({ nodeCount, edgeCount, feedbackCount, approvalRate7d: Math.round(approvalRate7d * 100) / 100, thresholdAdjustmentSuggestion, timestamp: new Date().toISOString() }, null, 2);
+}
+/** Return the integration documentation markdown. */
+export async function readCognitionDocs() {
+    try {
+        return readFileSync(join(projectRoot, "docs", "phase4-mcp-feedback.md"), "utf-8");
+    }
+    catch {
+        return "# Cognition Engine APInnDocumentation file not found. See docs/phase4-mcp-feedback.mdn";
+    }
+}
+//# sourceMappingURL=cognition-resources.js.map

package/dist/resources/cognition-resources.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognition-resources.js","sourceRoot":"","sources":["../../src/resources/cognition-resources.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH;;;;;;GAMG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEvD,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAE7C,8DAA8D;AAE9D,MAAM,CAAC,MAAM,SAAS,GAAG;IACvB;QACE,GAAG,EAAE,oBAAoB;QACzB,IAAI,EAAE,wBAAwB;QAC9B,WAAW,EAAE,wIAAwI;QACrJ,QAAQ,EAAE,kBAAkB;KAC7B;IACD;QACE,GAAG,EAAE,mBAAmB;QACxB,IAAI,EAAE,6BAA6B;QACnC,WAAW,EAAE,wJAAwJ;QACrK,QAAQ,EAAE,kBAAkB;KAC7B;IACD;QACE,GAAG,EAAE,kBAAkB;QACvB,IAAI,EAAE,gCAAgC;QACtC,WAAW,EAAE,qKAAqK;QAClL,QAAQ,EAAE,eAAe;KAC1B;IACD;QACE,GAAG,EAAE,6BAA6B;QAClC,IAAI,EAAE,iBAAiB;QACvB,WAAW,EAAE,2JAA2J;QACxK,QAAQ,EAAE,kBAAkB;KAC7B;CACF,CAAC;AAEF,6DAA6D;AAE7D,iEAAiE;AACjE,MAAM,CAAC,KAAK,UAAU,mBAAmB;IACvC,MAAM,MAAM,GAAG;QACb,EAAE,EAAE,yCAAyC;QAC7C,KAAK,EAAE,gBAAgB;QACvB,WAAW,EAAE,2CAA2C;QACxD,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,aAAa,EAAE;gBACb,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,+BAA+B,EAAE;oBACpE,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,SAAS,CAAC,EAAE,WAAW,EAAE,WAAW,EAAE;oBAC1G,YAAY,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,6BAA6B,EAAE;oBAC5E,gBAAgB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,8CAA8C,EAAE;oBAC1H,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,gCAAgC,EAAE;oBAC1E,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE;iBACnD;aACF;YACD,aAAa,EAAE;gBACb,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,EAAE,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACtB,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,gBAAgB,EAAE;oBAC3D,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,gBAAgB,EAAE;oBAC3D,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,CAAC,EAAE;oBAC7F,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE;iBAClE;aACF;YACD,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBAC1B,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBAC5B,WAAW,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,oBAAoB,EAAE;iBACnE;aACF;SACF;KACF,CAAC;IACF,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,0DAA0D;AAC1D,MAAM,CAAC,KAAK,UAAU,kBAAkB;IACtC,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;IACjC,MAAM,YAAY,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;IACzD,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAC7F,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE;QAC5B,MAAM,CAAC,aAAa,CAAC,KAAK,EAAE;QAC5B,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,oBAAoB,EAAE,EAAE,EAAE,CAAC;QACxF,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,oBAAoB,EAAE,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;QAC1H,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,UAAU,EAAE,oBAAoB,EAAE,EAAE,UAAU,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;KACjK,CAAC,CAAC;IACH,MAAM,cAAc,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,6BAA6B,GAAG,cAAc,GAAG,GAAG,IAAI,cAAc,GAAG,IAAI;QACjF,CAAC,CAAC,qDAAqD,GAAG,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG;QACjG,CAAC,CAAC,SAAS,CAAC;IACd,OAAO,IAAI,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,aAAa,EAAE,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,6BAA6B,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACtM,CAAC;AAED,qDAAqD;AACrD,MAAM,CAAC,KAAK,UAAU,iBAAiB;IACrC,IAAI,CAAC;QACH,OAAO,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,wBAAwB,CAAC,EAAE,OAAO,CAAC,CAAC;IACpF,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,wFAAwF,CAAC;IAClG,CAAC;AACH,CAAC"}

package/dist/storage/client.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Copyright 2026 熊高锐
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { PrismaClient } from "@prisma/client";
+export declare function getPrismaClient(): PrismaClient;
+export declare function disconnectPrisma(): Promise<void>;
+/**
+ * Reset the Prisma client singleton, optionally with a new DATABASE_URL.
+ * Used by vitest setup to give each worker an isolated database file,
+ * preventing cross-worker FK race conditions.
+ * Calling with no URL re-creates the client with the current env var value.
+ */
+export declare function resetPrismaClient(databaseUrl?: string): Promise<PrismaClient>;
+//# sourceMappingURL=client.d.ts.map

package/dist/storage/client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../../src/storage/client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAI9C,wBAAgB,eAAe,IAAI,YAAY,CAO9C;AAED,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,IAAI,CAAC,CAKtD;AAED;;;;;GAKG;AACH,wBAAsB,iBAAiB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAMnF"}

package/dist/storage/client.js

@@ -0,0 +1,45 @@
+/**
+ * Copyright 2026 熊高锐
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { PrismaClient } from "@prisma/client";
+let client = null;
+export function getPrismaClient() {
+    if (!client) {
+        client = new PrismaClient({ log: ["warn", "error"] });
+        // Enable SQLite WAL mode for concurrent read/write performance (P1)
+        client.$queryRawUnsafe("PRAGMA journal_mode=WAL").catch(() => { });
+    }
+    return client;
+}
+export async function disconnectPrisma() {
+    if (client) {
+        await client.$disconnect();
+        client = null;
+    }
+}
+/**
+ * Reset the Prisma client singleton, optionally with a new DATABASE_URL.
+ * Used by vitest setup to give each worker an isolated database file,
+ * preventing cross-worker FK race conditions.
+ * Calling with no URL re-creates the client with the current env var value.
+ */
+export async function resetPrismaClient(databaseUrl) {
+    await disconnectPrisma();
+    if (databaseUrl !== undefined) {
+        process.env.DATABASE_URL = databaseUrl;
+    }
+    return getPrismaClient();
+}
+//# sourceMappingURL=client.js.map

package/dist/storage/client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.js","sourceRoot":"","sources":["../../src/storage/client.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,IAAI,MAAM,GAAwB,IAAI,CAAC;AAEvC,MAAM,UAAU,eAAe;IAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;QACtD,oEAAoE;QACpE,MAAM,CAAC,eAAe,CAAC,yBAAyB,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB;IACpC,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,MAAM,CAAC,WAAW,EAAE,CAAC;QAC3B,MAAM,GAAG,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,WAAoB;IAC1D,MAAM,gBAAgB,EAAE,CAAC;IACzB,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,YAAY,GAAG,WAAW,CAAC;IACzC,CAAC;IACD,OAAO,eAAe,EAAE,CAAC;AAC3B,CAAC"}

package/dist/storage/cognition-repository.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Copyright 2026 熊高锐
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { CognitionTypeStr, EdgeRelationStr, CognitionNodeInput, CognitionEdgeInput, AstTemplateInput, CognitionNodeData, CognitionEdgeData, AstTemplateData, SubgraphResult } from "./cognition-types.js";
+/** Generate a semantic hash from type + payload for deduplication. */
+export declare function computeSemanticHash(type: string, payload: Record<string, unknown>): string;
+/** Validate that a type string is a valid CognitionType. */
+export declare function isValidCognitionType(s: string): s is CognitionTypeStr;
+/** Validate that a relation string is a valid EdgeRelation. */
+export declare function isValidEdgeRelation(s: string): s is EdgeRelationStr;
+export declare class CognitionRepository {
+    /**
+     * Atomically create a cognition node and its associated edges.
+     * Uses a Prisma  for atomicity.
+    */
+    createNodeWithEdges(nodeInput: CognitionNodeInput, edgeInputs?: CognitionEdgeInput[]): Promise<CognitionNodeData>;
+    findNodesBySemanticHash(hash: string): Promise<CognitionNodeData[]>;
+    /**
+     * Get a subgraph starting from a root node, following outgoing edges up to maxDepth.
+     * Uses level-based BFS (no DB-side recursive CTE needed).
+     */
+    getSubgraph(rootNodeId: string, maxDepth?: number): Promise<SubgraphResult>;
+    /**
+     * Adjust an edge's weight by a delta (positive or negative).
+     * Prepares for the feedback loop in Phase 4.
+     */
+    updateEdgeWeight(edgeId: string, delta: number): Promise<CognitionEdgeData>;
+    /** Create an AST template linked to a cognition node. */
+    createAstTemplate(input: AstTemplateInput): Promise<AstTemplateData>;
+    /** Find a node by its database ID. */
+    findNodeById(id: string): Promise<CognitionNodeData | null>;
+    /** Find edges by relation type. */
+    findEdgesByRelation(relation: EdgeRelationStr): Promise<CognitionEdgeData[]>;
+    /** Delete a node and cascade-delete its edges and template. */
+    deleteNode(id: string): Promise<void>;
+    /** Record a feedback event (async, non-blocking, fire-and-forget). */
+    recordFeedbackEvent(nodeId: string, edgeId?: string, outcome?: string, comment?: string): Promise<{
+        feedbackId: string;
+    }>;
+    /** Resolve a pending feedback event with the final outcome. */
+    resolveFeedbackEvent(feedbackId: string, outcome: string, edgeId?: string, weightDelta?: number): Promise<void>;
+}
+//# sourceMappingURL=cognition-repository.d.ts.map

package/dist/storage/cognition-repository.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognition-repository.d.ts","sourceRoot":"","sources":["../../src/storage/cognition-repository.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EACL,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,EAChB,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,cAAc,EAGf,MAAM,sBAAsB,CAAC;AAe9B,sEAAsE;AACtE,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAG1F;AAED,4DAA4D;AAC5D,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,gBAAgB,CAErE;AAED,+DAA+D;AAC/D,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,eAAe,CAEnE;AA4DD,qBAAa,mBAAmB;IAC9B;;;MAGE;IACI,mBAAmB,CACvB,SAAS,EAAE,kBAAkB,EAC7B,UAAU,GAAE,kBAAkB,EAAO,GACpC,OAAO,CAAC,iBAAiB,CAAC;IAqCvB,uBAAuB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC;IASzE;;;OAGG;IACG,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,OAAO,CAAC,cAAc,CAAC;IAwDpF;;;OAGG;IACG,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAcjF,yDAAyD;IACnD,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;IAa1E,sCAAsC;IAChC,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC;IASjE,mCAAmC;IAC7B,mBAAmB,CAAC,QAAQ,EAAE,eAAe,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC;IAQlF,+DAA+D;IACzD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAO3C,sEAAsE;IAChE,mBAAmB,CACvB,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,MAAM,GACf,OAAO,CAAC;QAAE,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC;IAkBlC,+DAA+D;IACzD,oBAAoB,CACxB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,MAAM,EACf,MAAM,CAAC,EAAE,MAAM,EACf,WAAW,CAAC,EAAE,MAAM,GACnB,OAAO,CAAC,IAAI,CAAC;CAejB"}

package/dist/storage/cognition-repository.js

@@ -0,0 +1,287 @@
+/**
+ * Copyright 2026 熊高锐
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+import { getPrismaClient } from "./client.js";
+import { COGNITION_TYPES, EDGE_RELATIONS, } from "./cognition-types.js";
+// ── Helpers ────────────────────────────────────────────────
+/** Simple hash for semantic dedup. Consistent with ast-node.ts legacy style. */
+function simpleHash(s) {
+    if (!s)
+        return "0";
+    let hash = 0;
+    for (let i = 0; i < s.length; i++) {
+        hash = ((hash << 5) - hash) + s.charCodeAt(i);
+        hash |= 0;
+    }
+    return Math.abs(hash).toString(16);
+}
+/** Generate a semantic hash from type + payload for deduplication. */
+export function computeSemanticHash(type, payload) {
+    const normalized = JSON.stringify(payload, Object.keys(payload).sort());
+    return simpleHash(type + ":" + normalized);
+}
+/** Validate that a type string is a valid CognitionType. */
+export function isValidCognitionType(s) {
+    return Object.values(COGNITION_TYPES).includes(s);
+}
+/** Validate that a relation string is a valid EdgeRelation. */
+export function isValidEdgeRelation(s) {
+    return Object.values(EDGE_RELATIONS).includes(s);
+}
+function parseJsonField(val) {
+    if (!val)
+        return null;
+    try {
+        return JSON.parse(val);
+    }
+    catch {
+        return null;
+    }
+}
+function toCognitionNode(r) {
+    return {
+        id: r.id,
+        type: r.type,
+        semanticHash: r.semanticHash,
+        abstractionLevel: r.abstractionLevel,
+        payload: parseJsonField(r.payload) ?? {},
+        metadata: parseJsonField(r.metadata),
+        createdAt: r.createdAt,
+        updatedAt: r.updatedAt,
+        astTemplate: r.astTemplate ? toAstTemplate(r.astTemplate) : null,
+    };
+}
+function toCognitionNodeBasic(r) {
+    return {
+        id: r.id,
+        type: r.type,
+        semanticHash: r.semanticHash,
+        abstractionLevel: r.abstractionLevel,
+        payload: parseJsonField(r.payload) ?? {},
+        metadata: parseJsonField(r.metadata),
+        createdAt: r.createdAt,
+        updatedAt: r.updatedAt,
+        astTemplate: null,
+    };
+}
+function toCognitionEdge(r) {
+    return {
+        id: r.id,
+        sourceId: r.sourceId,
+        targetId: r.targetId,
+        relation: r.relation,
+        weight: r.weight,
+        metadata: parseJsonField(r.metadata),
+        createdAt: r.createdAt,
+    };
+}
+function toAstTemplate(r) {
+    return {
+        id: r.id,
+        nodeId: r.nodeId,
+        language: r.language,
+        templateDsl: r.templateDsl,
+        validationSchema: parseJsonField(r.validationSchema),
+        createdAt: r.createdAt,
+    };
+}
+// ── Repository ─────────────────────────────────────────────
+export class CognitionRepository {
+    /**
+     * Atomically create a cognition node and its associated edges.
+     * Uses a Prisma  for atomicity.
+    */
+    async createNodeWithEdges(nodeInput, edgeInputs = []) {
+        const prisma = getPrismaClient();
+        const payloadStr = JSON.stringify(nodeInput.payload);
+        const metadataStr = nodeInput.metadata ? JSON.stringify(nodeInput.metadata) : null;
+        return prisma.$transaction(async (tx) => {
+            const node = await tx.cognitionNode.create({
+                data: {
+                    type: nodeInput.type,
+                    semanticHash: nodeInput.semanticHash,
+                    abstractionLevel: nodeInput.abstractionLevel,
+                    payload: payloadStr,
+                    metadata: metadataStr,
+                },
+            });
+            if (edgeInputs.length > 0) {
+                await tx.cognitionEdge.createMany({
+                    data: edgeInputs.map((e) => ({
+                        sourceId: e.sourceId,
+                        targetId: e.targetId,
+                        relation: e.relation,
+                        weight: e.weight ?? 1.0,
+                        metadata: e.metadata ? JSON.stringify(e.metadata) : null,
+                    })),
+                });
+            }
+            const withTemplate = await tx.cognitionNode.findUnique({
+                where: { id: node.id },
+                include: { astTemplate: true },
+            });
+            return toCognitionNode(withTemplate);
+        });
+    }
+    async findNodesBySemanticHash(hash) {
+        const prisma = getPrismaClient();
+        const rows = await prisma.cognitionNode.findMany({
+            where: { semanticHash: hash },
+            include: { astTemplate: true },
+        });
+        return rows.map(toCognitionNode);
+    }
+    /**
+     * Get a subgraph starting from a root node, following outgoing edges up to maxDepth.
+     * Uses level-based BFS (no DB-side recursive CTE needed).
+     */
+    async getSubgraph(rootNodeId, maxDepth = 3) {
+        const prisma = getPrismaClient();
+        // 1. Fetch root node
+        const rootNode = await prisma.cognitionNode.findUnique({
+            where: { id: rootNodeId },
+            include: { astTemplate: true },
+        });
+        if (!rootNode) {
+            return { nodes: [], edges: [] };
+        }
+        const visitedNodeIds = new Set([rootNode.id]);
+        const visitedEdgeIds = new Set();
+        const nodes = [toCognitionNode(rootNode)];
+        const edges = [];
+        let frontier = [rootNode.id];
+        // BFS traversal level by level
+        for (let depth = 0; depth < maxDepth && frontier.length > 0; depth++) {
+            // Fetch all outgoing edges from frontier nodes
+            const outgoingEdges = await prisma.cognitionEdge.findMany({
+                where: { sourceId: { in: frontier } },
+            });
+            const nextFrontier = [];
+            for (const edge of outgoingEdges) {
+                if (!visitedEdgeIds.has(edge.id)) {
+                    visitedEdgeIds.add(edge.id);
+                    edges.push(toCognitionEdge(edge));
+                    if (!visitedNodeIds.has(edge.targetId)) {
+                        visitedNodeIds.add(edge.targetId);
+                        nextFrontier.push(edge.targetId);
+                    }
+                }
+            }
+            // Fetch target nodes for the next frontier
+            if (nextFrontier.length > 0) {
+                const targetNodes = await prisma.cognitionNode.findMany({
+                    where: { id: { in: nextFrontier } },
+                    include: { astTemplate: true },
+                });
+                for (const n of targetNodes) {
+                    nodes.push(toCognitionNode(n));
+                }
+            }
+            frontier = nextFrontier;
+        }
+        return { nodes, edges };
+    }
+    /**
+     * Adjust an edge's weight by a delta (positive or negative).
+     * Prepares for the feedback loop in Phase 4.
+     */
+    async updateEdgeWeight(edgeId, delta) {
+        const prisma = getPrismaClient();
+        const edge = await prisma.cognitionEdge.findUnique({ where: { id: edgeId } });
+        if (!edge) {
+            throw new Error(`Edge not found: ${edgeId}`);
+        }
+        const newWeight = Math.max(0, Math.min(10, edge.weight + delta));
+        const updated = await prisma.cognitionEdge.update({
+            where: { id: edgeId },
+            data: { weight: newWeight },
+        });
+        return toCognitionEdge(updated);
+    }
+    /** Create an AST template linked to a cognition node. */
+    async createAstTemplate(input) {
+        const prisma = getPrismaClient();
+        const tmpl = await prisma.astTemplate.create({
+            data: {
+                nodeId: input.nodeId,
+                language: input.language,
+                templateDsl: input.templateDsl,
+                validationSchema: input.validationSchema ? JSON.stringify(input.validationSchema) : null,
+            },
+        });
+        return toAstTemplate(tmpl);
+    }
+    /** Find a node by its database ID. */
+    async findNodeById(id) {
+        const prisma = getPrismaClient();
+        const row = await prisma.cognitionNode.findUnique({
+            where: { id },
+            include: { astTemplate: true },
+        });
+        return row ? toCognitionNode(row) : null;
+    }
+    /** Find edges by relation type. */
+    async findEdgesByRelation(relation) {
+        const prisma = getPrismaClient();
+        const rows = await prisma.cognitionEdge.findMany({
+            where: { relation },
+        });
+        return rows.map(toCognitionEdge);
+    }
+    /** Delete a node and cascade-delete its edges and template. */
+    async deleteNode(id) {
+        const prisma = getPrismaClient();
+        await prisma.cognitionNode.delete({ where: { id } });
+    }
+    // ── Feedback Event Tracking ────────────────────────────
+    /** Record a feedback event (async, non-blocking, fire-and-forget). */
+    async recordFeedbackEvent(nodeId, edgeId, outcome, comment) {
+        const prisma = getPrismaClient();
+        const event = await prisma.metricEvent.create({
+            data: {
+                eventType: "cognition_feedback_pending",
+                properties: JSON.stringify({
+                    nodeId,
+                    edgeId: edgeId ?? null,
+                    outcome: outcome ?? "PENDING",
+                    comment: comment ?? null,
+                    status: "PENDING",
+                    createdAt: new Date().toISOString(),
+                }),
+            },
+        });
+        return { feedbackId: event.id };
+    }
+    /** Resolve a pending feedback event with the final outcome. */
+    async resolveFeedbackEvent(feedbackId, outcome, edgeId, weightDelta) {
+        const prisma = getPrismaClient();
+        const existing = await prisma.metricEvent.findUnique({ where: { id: feedbackId } });
+        if (!existing)
+            return;
+        const props = JSON.parse(existing.properties || "{}");
+        props.status = "RESOLVED";
+        props.outcome = outcome;
+        props.resolvedAt = new Date().toISOString();
+        if (weightDelta !== undefined)
+            props.weightDelta = weightDelta;
+        if (edgeId)
+            props.edgeId = edgeId;
+        await prisma.metricEvent.update({
+            where: { id: feedbackId },
+            data: { properties: JSON.stringify(props) },
+        });
+    }
+}
+//# sourceMappingURL=cognition-repository.js.map

package/dist/storage/cognition-repository.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cognition-repository.js","sourceRoot":"","sources":["../../src/storage/cognition-repository.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,EAUL,eAAe,EACf,cAAc,GACf,MAAM,sBAAsB,CAAC;AAE9B,8DAA8D;AAE9D,gFAAgF;AAChF,SAAS,UAAU,CAAC,CAAS;IAC3B,IAAI,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACnB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,IAAI,CAAC,CAAC;IACZ,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;AACrC,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,OAAgC;IAChF,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACxE,OAAO,UAAU,CAAC,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC;AAC7C,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,oBAAoB,CAAC,CAAS;IAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,QAAQ,CAAC,CAAqB,CAAC,CAAC;AACxE,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,mBAAmB,CAAC,CAAS;IAC3C,OAAO,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,QAAQ,CAAC,CAAoB,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,cAAc,CAAI,GAA8B;IACvD,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,IAAI,CAAC;QAAC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAM,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;AAC7D,CAAC;AAED,SAAS,eAAe,CAAC,CAAqE;IAC5F,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAwB;QAChC,YAAY,EAAE,CAAC,CAAC,YAAY;QAC5B,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;QACpC,OAAO,EAAE,cAAc,CAA0B,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE;QACjE,QAAQ,EAAE,cAAc,CAA0B,CAAC,CAAC,QAAQ,CAAC;QAC7D,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI;KACjE,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,CAAqC;IACjE,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAwB;QAChC,YAAY,EAAE,CAAC,CAAC,YAAY;QAC5B,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;QACpC,OAAO,EAAE,cAAc,CAA0B,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE;QACjE,QAAQ,EAAE,cAAc,CAA0B,CAAC,CAAC,QAAQ,CAAC;QAC7D,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,WAAW,EAAE,IAAI;KAClB,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CAAC,CAAqC;IAC5D,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,QAAQ,EAAE,CAAC,CAAC,QAA2B;QACvC,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,QAAQ,EAAE,cAAc,CAA0B,CAAC,CAAC,QAAQ,CAAC;QAC7D,SAAS,EAAE,CAAC,CAAC,SAAS;KACvB,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,CAAmC;IACxD,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,WAAW,EAAE,CAAC,CAAC,WAAW;QAC1B,gBAAgB,EAAE,cAAc,CAA0B,CAAC,CAAC,gBAAgB,CAAC;QAC7E,SAAS,EAAE,CAAC,CAAC,SAAS;KACvB,CAAC;AACJ,CAAC;AAED,8DAA8D;AAE9D,MAAM,OAAO,mBAAmB;IAC9B;;;MAGE;IACF,KAAK,CAAC,mBAAmB,CACvB,SAA6B,EAC7B,aAAmC,EAAE;QAErC,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAEnF,OAAO,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;YACtC,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC;gBACzC,IAAI,EAAE;oBACJ,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,YAAY,EAAE,SAAS,CAAC,YAAY;oBACpC,gBAAgB,EAAE,SAAS,CAAC,gBAAgB;oBAC5C,OAAO,EAAE,UAAU;oBACnB,QAAQ,EAAE,WAAW;iBACtB;aACF,CAAC,CAAC;YAEH,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,EAAE,CAAC,aAAa,CAAC,UAAU,CAAC;oBAChC,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAC3B,QAAQ,EAAE,CAAC,CAAC,QAAQ;wBACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ;wBACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ;wBACpB,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,GAAG;wBACvB,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI;qBACzD,CAAC,CAAC;iBACJ,CAAC,CAAC;YACL,CAAC;YAED,MAAM,YAAY,GAAG,MAAM,EAAE,CAAC,aAAa,CAAC,UAAU,CAAC;gBACrD,KAAK,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE;gBACtB,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE;aAC/B,CAAC,CAAC;YAEH,OAAO,eAAe,CAAC,YAAa,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,uBAAuB,CAAC,IAAY;QACxC,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/C,KAAK,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE;YAC7B,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE;SAC/B,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,CAAC,UAAkB,EAAE,WAAmB,CAAC;QACxD,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QAEjC,qBAAqB;QACrB,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC;YACrD,KAAK,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE;YACzB,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE;SAC/B,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAClC,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,GAAG,CAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,KAAK,GAAwB,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAwB,EAAE,CAAC;QAEtC,IAAI,QAAQ,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAE7B,+BAA+B;QAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACrE,+CAA+C;YAC/C,MAAM,aAAa,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC;gBACxD,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE;aACtC,CAAC,CAAC;YAEH,MAAM,YAAY,GAAa,EAAE,CAAC;YAClC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;gBACjC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACjC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;oBAElC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;wBACvC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAClC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACnC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,2CAA2C;YAC3C,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,WAAW,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC;oBACtD,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE;oBACnC,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE;iBAC/B,CAAC,CAAC;gBACH,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;oBAC5B,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,QAAQ,GAAG,YAAY,CAAC;QAC1B,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,gBAAgB,CAAC,MAAc,EAAE,KAAa;QAClD,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;QAC9E,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,EAAE,CAAC,CAAC;QAC/C,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;QACjE,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC;YAChD,KAAK,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE;YACrB,IAAI,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE;SAC5B,CAAC,CAAC;QACH,OAAO,eAAe,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,yDAAyD;IACzD,KAAK,CAAC,iBAAiB,CAAC,KAAuB;QAC7C,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;YAC3C,IAAI,EAAE;gBACJ,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,WAAW,EAAE,KAAK,CAAC,WAAW;gBAC9B,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI;aACzF;SACF,CAAC,CAAC;QACH,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,sCAAsC;IACtC,KAAK,CAAC,YAAY,CAAC,EAAU;QAC3B,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC;YAChD,KAAK,EAAE,EAAE,EAAE,EAAE;YACb,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE;SAC/B,CAAC,CAAC;QACH,OAAO,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3C,CAAC;IAED,mCAAmC;IACnC,KAAK,CAAC,mBAAmB,CAAC,QAAyB;QACjD,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/C,KAAK,EAAE,EAAE,QAAQ,EAAE;SACpB,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IAED,+DAA+D;IAC/D,KAAK,CAAC,UAAU,CAAC,EAAU;QACzB,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,0DAA0D;IAE1D,sEAAsE;IACtE,KAAK,CAAC,mBAAmB,CACvB,MAAc,EACd,MAAe,EACf,OAAgB,EAChB,OAAgB;QAEhB,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;YAC5C,IAAI,EAAE;gBACJ,SAAS,EAAE,4BAA4B;gBACvC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC;oBACzB,MAAM;oBACN,MAAM,EAAE,MAAM,IAAI,IAAI;oBACtB,OAAO,EAAE,OAAO,IAAI,SAAS;oBAC7B,OAAO,EAAE,OAAO,IAAI,IAAI;oBACxB,MAAM,EAAE,SAAS;oBACjB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBACpC,CAAC;aACH;SACF,CAAC,CAAC;QACH,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;IAClC,CAAC;IAED,+DAA+D;IAC/D,KAAK,CAAC,oBAAoB,CACxB,UAAkB,EAClB,OAAe,EACf,MAAe,EACf,WAAoB;QAEpB,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACpF,IAAI,CAAC,QAAQ;YAAE,OAAO;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;QACtD,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC;QAC1B,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;QACxB,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC5C,IAAI,WAAW,KAAK,SAAS;YAAE,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/D,IAAI,MAAM;YAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;QAClC,MAAM,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;YAC9B,KAAK,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE;YACzB,IAAI,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE;SAC5C,CAAC,CAAC;IACL,CAAC;CACF"}