@drqedwards/pmll 2.0.4

package/dist/index.js

@@ -0,0 +1,645 @@
+#!/usr/bin/env node
+/**
+ * index.ts — PMLL Memory MCP Server entrypoint.
+ *
+ * Exposes 15 MCP tools for Claude Sonnet/Opus agents:
+ *
+ * Short-term KV memory (5 tools):
+ *   init    — Set up the PMLL memory silo and Q-promise chain for a session.
+ *   peek    — Non-destructive context check (core deduplication primitive).
+ *   set     — Store a KV pair in the session's PMLL silo.
+ *   resolve — Resolve a pending Q-promise continuation.
+ *   flush   — Clear all short-term KV slots at agent task completion.
+ *
+ * GraphQL (1 tool):
+ *   graphql — Execute GraphQL queries/mutations against the memory store.
+ *
+ * Long-term memory graph (6 tools — adapted from Context+ by @ForLoopCodes):
+ *   upsert_memory_node      — Create/update memory nodes with TF-IDF embeddings.
+ *   create_relation          — Create typed edges between nodes.
+ *   search_memory_graph      — Semantic search with graph traversal.
+ *   prune_stale_links        — Remove decayed edges and orphan nodes.
+ *   add_interlinked_context  — Bulk-add nodes with auto-similarity linking.
+ *   retrieve_with_traversal  — Walk outward from a node.
+ *
+ * Solution engine (3 tools):
+ *   resolve_context      — Unified short-term → long-term context lookup.
+ *   promote_to_long_term — Promote KV entries to the memory graph.
+ *   memory_status        — Unified memory view across both layers.
+ *
+ * The server is designed as the **3rd initializer** alongside Playwright and
+ * other MCP tools.  Agents call `init` once at task start, then use
+ * `peek` before any expensive MCP tool invocation to avoid redundant calls.
+ *
+ * Context+ integration by @ForLoopCodes (https://github.com/ForLoopCodes/contextplus).
+ *
+ * Architecture:
+ *     - KV layer  → `PMMemoryStore` (mirrors PMLL.c memory_silo_t)
+ *     - Async layer → `QPromiseRegistry` (mirrors Q_promise_lib QMemNode chain)
+ *     - Guard function → `peekContext()` (peek.ts)
+ *     - Long-term → `memory-graph.ts` (adapted from Context+)
+ *     - Engine → `solution-engine.ts` (bridges short-term + long-term)
+ *
+ * Usage:
+ *     npx pmll-memory-mcp                        # stdio transport
+ *     node dist/index.js                         # via compiled output
+ *
+ * License: MIT
+ */
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { z } from "zod";
+import { getStore, dropStore, resetStore } from "./kv-store.js";
+import { QPromiseRegistry } from "./q-promise-bridge.js";
+import { peekContext } from "./peek.js";
+import { executeGraphQL, GRAPHQL_QUERY, GRAPHQL_MUTATION, GRAPHQL_DEFAULT_VARIABLES } from "./graphql.js";
+import { upsertNode, createRelation, searchGraph, pruneStaleLinks, addInterlinkedContext, retrieveWithTraversal, getGraphStats, } from "./memory-graph.js";
+import { resolveContext, promoteToLongTerm, getMemoryStatus } from "./solution-engine.js";
+// ---------------------------------------------------------------------------
+// MCP server instance
+// ---------------------------------------------------------------------------
+const server = new McpServer({
+    name: "pmll-memory-mcp",
+    version: "1.0.0",
+}, {
+    instructions: "PMLL Memory MCP — persistent memory logic loop with short-term KV " +
+        "context memory, Q-promise deduplication, and Context+ long-term " +
+        "semantic memory graph designed to improve context retention and retrieval for coding agents. " +
+        "Short-term tools: `init`, `peek`, `set`, `resolve`, `flush`. " +
+        "Long-term tools: `upsert_memory_node`, `create_relation`, " +
+        "`search_memory_graph`, `prune_stale_links`, `add_interlinked_context`, " +
+        "`retrieve_with_traversal`. " +
+        "Solution engine: `resolve_context` (unified short+long term lookup), " +
+        "`promote_to_long_term` (promote KV entries to graph), " +
+        "`memory_status` (unified memory view).",
+});
+// Module-level Q-promise registry shared across all sessions.
+// Mirrors the global QMemNode chain pool in Q_promise_lib.
+export const _promiseRegistry = new QPromiseRegistry();
+// Track which sessions have been initialised (sessionId → siloSize).
+export const _activeSessions = new Map();
+// ---------------------------------------------------------------------------
+// Tool: init
+// ---------------------------------------------------------------------------
+server.tool("init", "Initialise the PMLL memory silo for an agent session. " +
+    "Call this once at the start of every agent task, as the 3rd " +
+    "initializer alongside Playwright.  Sets up the KV silo and prepares " +
+    "the Q-promise chain for the session.", {
+    session_id: z.string().describe("Unique identifier for this agent task (e.g. a UUID)."),
+    silo_size: z
+        .number()
+        .int()
+        .positive()
+        .default(256)
+        .describe("Maximum number of KV slots (mirrors memory_silo_t.size)."),
+}, async ({ session_id, silo_size }) => {
+    // clear_on_init: re-initing the same session resets the short-term KV silo.
+    resetStore(session_id, silo_size);
+    _activeSessions.set(session_id, silo_size);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    status: "initialized",
+                    session_id,
+                    silo_size,
+                    cleared: true,
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: peek
+// ---------------------------------------------------------------------------
+server.tool("peek", "Non-destructive context check — the core deduplication primitive. " +
+    "Call this before any Playwright or other MCP tool invocation to " +
+    "check whether the required context already exists in the PMLL silo or " +
+    "is in-flight as a Q-promise.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    key: z.string().describe("The context key to look up."),
+}, async ({ session_id, key }) => {
+    const store = getStore(session_id);
+    const result = peekContext(key, session_id, store, _promiseRegistry);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify(result),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: set
+// ---------------------------------------------------------------------------
+server.tool("set", "Store a KV pair in the session's PMLL memory silo. " +
+    "Call after a successful (non-cached) MCP tool invocation to populate " +
+    "the silo so future `peek` calls return a cache hit. " +
+    "Mirrors PMLL.c::update_silo() writing a var/value pair into the silo.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    key: z.string().describe("The context key."),
+    value: z.string().describe("The string value to cache."),
+}, async ({ session_id, key, value }) => {
+    const store = getStore(session_id);
+    const index = store.set(key, value);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({ status: "stored", index }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: resolve
+// ---------------------------------------------------------------------------
+server.tool("resolve", "Check or resolve a Q-promise continuation. " +
+    "Mirrors the `QThenCallback` mechanism in Q_promise_lib/Q_promises.h — " +
+    "the callback is invoked when a QMemNode's payload becomes available. " +
+    "If the promise is already resolved, returns its payload immediately. " +
+    "If still pending, returns `{status: \"pending\", payload: null}`.", {
+    session_id: z
+        .string()
+        .describe("The session identifier (for context; not used to namespace promises)."),
+    promise_id: z.string().describe("The promise identifier previously registered."),
+}, async ({ session_id: _sessionId, promise_id }) => {
+    const [found, status, payload] = _promiseRegistry.peekPromise(promise_id);
+    let result;
+    if (!found) {
+        result = { status: "pending", payload: null };
+    }
+    else {
+        result = { status: status, payload };
+    }
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify(result),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: flush
+// ---------------------------------------------------------------------------
+server.tool("flush", "Clear all short-term KV slots for a session. " +
+    "Call at agent task completion to free memory.  Mirrors the teardown " +
+    "of a memory_silo_t allocation (PMLL.c::free_pml).", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+}, async ({ session_id }) => {
+    const cleared = dropStore(session_id);
+    _activeSessions.delete(session_id);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({ status: "flushed", cleared_count: cleared }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: graphql
+// ---------------------------------------------------------------------------
+server.tool("graphql", "Execute a GraphQL query or mutation against a remote endpoint, with " +
+    "optional PMLL cache integration. " +
+    "Supply `operation` as a GraphQL document string and `variables` as a " +
+    "JSON object.  Pass `cache_key` to store/retrieve the result from the " +
+    "PMLL silo so redundant network calls are avoided on subsequent `peek` " +
+    "checks.  The `operation` defaults to the pre-built canonical Query " +
+    "document when omitted.  Use `use_mutation` to switch the default to the " +
+    "canonical Mutation document.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    endpoint: z.string().url().describe("Full URL of the GraphQL endpoint."),
+    operation: z
+        .string()
+        .optional()
+        .describe("GraphQL operation document.  Defaults to the canonical Query " +
+        "when omitted (or the canonical Mutation when `use_mutation` is true)."),
+    variables: z
+        .record(z.unknown())
+        .optional()
+        .default({})
+        .describe("Variables to pass with the operation (JSON object)."),
+    headers: z
+        .record(z.string())
+        .optional()
+        .default({})
+        .describe("Additional HTTP headers, e.g. { Authorization: 'Bearer <token>' }."),
+    cache_key: z
+        .string()
+        .optional()
+        .describe("When provided, the result is stored under this key in the PMLL silo. " +
+        "A subsequent `peek` with the same key will return the cached value " +
+        "without re-executing the operation."),
+    use_mutation: z
+        .boolean()
+        .optional()
+        .default(false)
+        .describe("When true and `operation` is omitted, use the canonical Mutation " +
+        "document instead of the canonical Query document."),
+}, async ({ session_id, endpoint, operation, variables, headers, cache_key, use_mutation }) => {
+    const store = getStore(session_id);
+    // Check PMLL cache first when a cache key is provided.
+    if (cache_key) {
+        const cached = peekContext(cache_key, session_id, store, _promiseRegistry);
+        if (cached.hit && "value" in cached) {
+            let parsedData = cached.value;
+            try {
+                parsedData = JSON.parse(cached.value);
+            }
+            catch {
+                // Cached value is not JSON; return as a raw string.
+            }
+            return {
+                content: [
+                    {
+                        type: "text",
+                        text: JSON.stringify({ cached: true, data: parsedData }),
+                    },
+                ],
+            };
+        }
+    }
+    // Resolve the operation document.
+    const doc = operation ?? (use_mutation ? GRAPHQL_MUTATION : GRAPHQL_QUERY);
+    // Merge caller variables on top of the default (all-null) variable set
+    // so the operation document receives every declared variable.
+    const mergedVariables = {
+        ...GRAPHQL_DEFAULT_VARIABLES,
+        ...variables,
+    };
+    let result;
+    try {
+        result = await executeGraphQL(endpoint, doc, mergedVariables, headers);
+    }
+    catch (err) {
+        const message = err instanceof Error ? err.message : String(err);
+        return {
+            content: [
+                {
+                    type: "text",
+                    text: JSON.stringify({ error: message }),
+                },
+            ],
+        };
+    }
+    const resultStr = JSON.stringify(result);
+    // Populate the PMLL silo so future peek calls return a cache hit.
+    if (cache_key) {
+        store.set(cache_key, resultStr);
+    }
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({ cached: false, data: result }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: upsert_memory_node (Long-term memory)
+// ---------------------------------------------------------------------------
+server.tool("upsert_memory_node", "Create or update a memory node in the long-term semantic graph. " +
+    "Nodes represent concepts, files, symbols, or notes with auto-generated " +
+    "TF-IDF embeddings for semantic search. Part of the Context+ solution " +
+    "engine for durable context retention and retrieval.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    type: z
+        .enum(["concept", "file", "symbol", "note"])
+        .describe("Node type: concept, file, symbol, or note."),
+    label: z.string().describe("Short label for the node."),
+    content: z.string().describe("Full content/description of the node."),
+    metadata: z
+        .record(z.string())
+        .optional()
+        .default({})
+        .describe("Optional key-value metadata for the node."),
+}, async ({ session_id, type, label, content, metadata }) => {
+    const node = upsertNode(session_id, type, label, content, metadata);
+    const stats = getGraphStats(session_id);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    status: "upserted",
+                    node_id: node.id,
+                    label: node.label,
+                    node_type: node.type,
+                    access_count: node.accessCount,
+                    graph_nodes: stats.nodes,
+                    graph_edges: stats.edges,
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: create_relation (Long-term memory)
+// ---------------------------------------------------------------------------
+server.tool("create_relation", "Create a typed edge between two memory nodes in the long-term graph. " +
+    "Supported relation types: relates_to, depends_on, implements, " +
+    "references, similar_to, contains.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    source_id: z.string().describe("Source node ID."),
+    target_id: z.string().describe("Target node ID."),
+    relation: z
+        .enum([
+        "relates_to",
+        "depends_on",
+        "implements",
+        "references",
+        "similar_to",
+        "contains",
+    ])
+        .describe("Relation type for the edge."),
+    weight: z
+        .number()
+        .optional()
+        .default(1.0)
+        .describe("Edge weight (default: 1.0)."),
+}, async ({ session_id, source_id, target_id, relation, weight }) => {
+    const edge = createRelation(session_id, source_id, target_id, relation, weight);
+    if (!edge) {
+        return {
+            content: [
+                {
+                    type: "text",
+                    text: JSON.stringify({
+                        status: "error",
+                        message: "One or both node IDs not found",
+                    }),
+                },
+            ],
+        };
+    }
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    status: "created",
+                    edge_id: edge.id,
+                    relation: edge.relation,
+                    weight: edge.weight,
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: search_memory_graph (Long-term memory)
+// ---------------------------------------------------------------------------
+server.tool("search_memory_graph", "Semantic search with graph traversal — finds direct matches then walks " +
+    "1st/2nd-degree neighbors. Returns ranked results scored by cosine " +
+    "similarity and edge decay.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    query: z.string().describe("Natural language search query."),
+    max_depth: z
+        .number()
+        .int()
+        .optional()
+        .default(1)
+        .describe("Maximum traversal depth (default: 1)."),
+    top_k: z
+        .number()
+        .int()
+        .optional()
+        .default(5)
+        .describe("Maximum number of direct hits (default: 5)."),
+}, async ({ session_id, query, max_depth, top_k }) => {
+    const result = searchGraph(session_id, query, max_depth, top_k);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    query,
+                    direct: result.direct.map((d) => ({
+                        node_id: d.node.id,
+                        label: d.node.label,
+                        type: d.node.type,
+                        content: d.node.content,
+                        score: d.relevanceScore,
+                    })),
+                    neighbors: result.neighbors.map((n) => ({
+                        node_id: n.node.id,
+                        label: n.node.label,
+                        type: n.node.type,
+                        content: n.node.content,
+                        score: n.relevanceScore,
+                        depth: n.depth,
+                        path: n.pathRelations,
+                    })),
+                    total_nodes: result.totalNodes,
+                    total_edges: result.totalEdges,
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: prune_stale_links (Long-term memory)
+// ---------------------------------------------------------------------------
+server.tool("prune_stale_links", "Remove decayed edges (e^(-λt) below threshold) and orphan nodes with " +
+    "low access counts from the long-term memory graph.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    threshold: z
+        .number()
+        .optional()
+        .default(0.15)
+        .describe("Decay threshold below which edges are pruned (default: 0.15)."),
+}, async ({ session_id, threshold }) => {
+    const result = pruneStaleLinks(session_id, threshold);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    status: "pruned",
+                    removed: result.removed,
+                    remaining_edges: result.remaining,
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: add_interlinked_context (Long-term memory)
+// ---------------------------------------------------------------------------
+server.tool("add_interlinked_context", "Bulk-add nodes with auto-similarity linking (cosine ≥ 0.72 creates " +
+    "edges automatically). Efficient for adding multiple related concepts " +
+    "at once.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    items: z
+        .array(z.object({
+        type: z.enum(["concept", "file", "symbol", "note"]),
+        label: z.string(),
+        content: z.string(),
+        metadata: z.record(z.string()).optional(),
+    }))
+        .describe("Array of nodes to add."),
+    auto_link: z
+        .boolean()
+        .optional()
+        .default(true)
+        .describe("Auto-create similarity edges (default: true)."),
+}, async ({ session_id, items, auto_link }) => {
+    const result = addInterlinkedContext(session_id, items.map((i) => ({
+        type: i.type,
+        label: i.label,
+        content: i.content,
+        metadata: i.metadata,
+    })), auto_link);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    status: "added",
+                    nodes_created: result.nodes.length,
+                    edges_created: result.edges.length,
+                    nodes: result.nodes.map((n) => ({
+                        id: n.id,
+                        label: n.label,
+                        type: n.type,
+                    })),
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: retrieve_with_traversal (Long-term memory)
+// ---------------------------------------------------------------------------
+server.tool("retrieve_with_traversal", "Start from a node and walk outward — returns all reachable neighbors " +
+    "scored by decay and depth. Used for exploring the knowledge graph " +
+    "from a known starting point.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    start_node_id: z.string().describe("ID of the starting node."),
+    max_depth: z
+        .number()
+        .int()
+        .optional()
+        .default(2)
+        .describe("Maximum traversal depth (default: 2)."),
+}, async ({ session_id, start_node_id, max_depth }) => {
+    const results = retrieveWithTraversal(session_id, start_node_id, max_depth);
+    if (results.length === 0) {
+        return {
+            content: [
+                {
+                    type: "text",
+                    text: JSON.stringify({
+                        status: "error",
+                        message: `Node not found: ${start_node_id}`,
+                    }),
+                },
+            ],
+        };
+    }
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify({
+                    start_node: results[0].node.label,
+                    results: results.map((r) => ({
+                        node_id: r.node.id,
+                        label: r.node.label,
+                        type: r.node.type,
+                        content: r.node.content,
+                        depth: r.depth,
+                        score: r.relevanceScore,
+                        path: r.pathRelations,
+                    })),
+                }),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: resolve_context (Solution Engine)
+// ---------------------------------------------------------------------------
+server.tool("resolve_context", "Unified context resolution across both short-term (KV cache) and " +
+    "long-term (semantic graph) memory layers. Checks KV cache first, " +
+    "then falls back to semantic graph search. This is the primary " +
+    "Context+ solution engine tool for unified KV + graph retrieval.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    key: z.string().describe("The context key to resolve."),
+}, async ({ session_id, key }) => {
+    const store = getStore(session_id);
+    const result = resolveContext(session_id, key, store);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify(result),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: promote_to_long_term (Solution Engine)
+// ---------------------------------------------------------------------------
+server.tool("promote_to_long_term", "Promote a short-term KV cache entry to the long-term semantic memory " +
+    "graph. Creates a persistent memory node from a frequently accessed " +
+    "cache entry, ensuring important context survives session flushes.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+    key: z.string().describe("The context key/label for the memory node."),
+    value: z.string().describe("The content to store in long-term memory."),
+    node_type: z
+        .enum(["concept", "file", "symbol", "note"])
+        .optional()
+        .default("concept")
+        .describe("Node type (default: concept)."),
+}, async ({ session_id, key, value, node_type }) => {
+    const result = promoteToLongTerm(session_id, key, value, node_type);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify(result),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Tool: memory_status (Solution Engine)
+// ---------------------------------------------------------------------------
+server.tool("memory_status", "Get a unified status view of both short-term (KV cache) and long-term " +
+    "(semantic graph) memory layers. Shows slot usage, graph statistics, " +
+    "and promotion threshold.", {
+    session_id: z.string().describe("The session identifier (from `init`)."),
+}, async ({ session_id }) => {
+    const store = getStore(session_id);
+    const status = getMemoryStatus(session_id, store);
+    return {
+        content: [
+            {
+                type: "text",
+                text: JSON.stringify(status),
+            },
+        ],
+    };
+});
+// ---------------------------------------------------------------------------
+// Entry-point
+// ---------------------------------------------------------------------------
+/** Run the MCP server over stdio (default transport). */
+async function main() {
+    const transport = new StdioServerTransport();
+    await server.connect(transport);
+}
+main().catch((error) => {
+    console.error("Fatal error in MCP server:", error);
+    process.exit(1);
+});
+export { server };
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AACxC,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,gBAAgB,EAAE,yBAAyB,EAAE,MAAM,cAAc,CAAC;AAC1G,OAAO,EACL,UAAU,EACV,cAAc,EACd,WAAW,EACX,eAAe,EACf,qBAAqB,EACrB,qBAAqB,EACrB,aAAa,GAId,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAE1F,8EAA8E;AAC9E,sBAAsB;AACtB,8EAA8E;AAC9E,MAAM,MAAM,GAAG,IAAI,SAAS,CAC1B;IACE,IAAI,EAAE,iBAAiB;IACvB,OAAO,EAAE,OAAO;CACjB,EACD;IACE,YAAY,EACV,oEAAoE;QACpE,kEAAkE;QAClE,+FAA+F;QAC/F,+DAA+D;QAC/D,4DAA4D;QAC5D,yEAAyE;QACzE,6BAA6B;QAC7B,uEAAuE;QACvE,wDAAwD;QACxD,wCAAwC;CAC3C,CACF,CAAC;AAEF,8DAA8D;AAC9D,2DAA2D;AAC3D,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,gBAAgB,EAAE,CAAC;AAEvD,qEAAqE;AACrE,MAAM,CAAC,MAAM,eAAe,GAAwB,IAAI,GAAG,EAAE,CAAC;AAE9D,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,MAAM,EACN,wDAAwD;IACtD,8DAA8D;IAC9D,sEAAsE;IACtE,sCAAsC,EACxC;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,sDAAsD,CAAC;IACvF,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,OAAO,CAAC,GAAG,CAAC;SACZ,QAAQ,CAAC,0DAA0D,CAAC;CACxE,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,EAAE,EAAE;IAClC,4EAA4E;IAC5E,UAAU,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAClC,eAAe,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IAE3C,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,MAAM,EAAE,aAAa;oBACrB,UAAU;oBACV,SAAS;oBACT,OAAO,EAAE,IAAI;iBACd,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,MAAM,EACN,oEAAoE;IAClE,kEAAkE;IAClE,wEAAwE;IACxE,8BAA8B,EAChC;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6BAA6B,CAAC;CACxD,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,GAAG,EAAE,EAAE,EAAE;IAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;IAErE,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7B;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,KAAK,EACL,qDAAqD;IACnD,uEAAuE;IACvE,sDAAsD;IACtD,uEAAuE,EACzE;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,kBAAkB,CAAC;IAC5C,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,4BAA4B,CAAC;CACzD,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE;IACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAEpC,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;aAClD;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,SAAS,EACT,6CAA6C;IAC3C,wEAAwE;IACxE,uEAAuE;IACvE,uEAAuE;IACvE,mEAAmE,EACrE;IACE,UAAU,EAAE,CAAC;SACV,MAAM,EAAE;SACR,QAAQ,CAAC,uEAAuE,CAAC;IACpF,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,+CAA+C,CAAC;CACjF,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,EAAE,EAAE;IAC/C,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,GAAG,gBAAgB,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IAE1E,IAAI,MAAkD,CAAC;IACvD,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAChD,CAAC;SAAM,CAAC;QACN,MAAM,GAAG,EAAE,MAAM,EAAE,MAAO,EAAE,OAAO,EAAE,CAAC;IACxC,CAAC;IAED,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7B;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,OAAO,EACP,+CAA+C;IAC7C,sEAAsE;IACtE,mDAAmD,EACrD;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;CACzE,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;IACvB,MAAM,OAAO,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC;IACtC,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAEnC,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC;aACpE;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,SAAS,EACT,sEAAsE;IACpE,mCAAmC;IACnC,uEAAuE;IACvE,uEAAuE;IACvE,wEAAwE;IACxE,qEAAqE;IACrE,0EAA0E;IAC1E,8BAA8B,EAChC;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,mCAAmC,CAAC;IACxE,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,+DAA+D;QAC7D,uEAAuE,CAC1E;IACH,SAAS,EAAE,CAAC;SACT,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;SACnB,QAAQ,EAAE;SACV,OAAO,CAAC,EAAE,CAAC;SACX,QAAQ,CAAC,qDAAqD,CAAC;IAClE,OAAO,EAAE,CAAC;SACP,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SAClB,QAAQ,EAAE;SACV,OAAO,CAAC,EAAE,CAAC;SACX,QAAQ,CAAC,oEAAoE,CAAC;IACjF,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,uEAAuE;QACrE,qEAAqE;QACrE,qCAAqC,CACxC;IACH,YAAY,EAAE,CAAC;SACZ,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,OAAO,CAAC,KAAK,CAAC;SACd,QAAQ,CACP,mEAAmE;QACjE,mDAAmD,CACtD;CACJ,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE;IACzF,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IAEnC,uDAAuD;IACvD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,MAAM,GAAG,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC3E,IAAI,MAAM,CAAC,GAAG,IAAI,OAAO,IAAI,MAAM,EAAE,CAAC;YACpC,IAAI,UAAU,GAAY,MAAM,CAAC,KAAK,CAAC;YACvC,IAAI,CAAC;gBACH,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACxC,CAAC;YAAC,MAAM,CAAC;gBACP,oDAAoD;YACtD,CAAC;YACD,OAAO;gBACL,OAAO,EAAE;oBACP;wBACE,IAAI,EAAE,MAAe;wBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;qBACzD;iBACF;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,MAAM,GAAG,GACP,SAAS,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;IAEjE,uEAAuE;IACvE,8DAA8D;IAC9D,MAAM,eAAe,GAA4B;QAC/C,GAAG,yBAAyB;QAC5B,GAAG,SAAS;KACb,CAAC;IAEF,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,MAAM,cAAc,CAAC,QAAQ,EAAE,GAAG,EAAE,eAAe,EAAE,OAAO,CAAC,CAAC;IACzE,CAAC;IAAC,OAAO,GAAY,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjE,OAAO;YACL,OAAO,EAAE;gBACP;oBACE,IAAI,EAAE,MAAe;oBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;iBACzC;aACF;SACF,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAEzC,kEAAkE;IAClE,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAClC,CAAC;IAED,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;aACtD;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,8CAA8C;AAC9C,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,oBAAoB,EACpB,kEAAkE;IAChE,yEAAyE;IACzE,uEAAuE;IACvE,qDAAqD,EACvD;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,IAAI,EAAE,CAAC;SACJ,IAAI,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SAC3C,QAAQ,CAAC,4CAA4C,CAAC;IACzD,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,2BAA2B,CAAC;IACvD,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACrE,QAAQ,EAAE,CAAC;SACR,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;SAClB,QAAQ,EAAE;SACV,OAAO,CAAC,EAAE,CAAC;SACX,QAAQ,CAAC,2CAA2C,CAAC;CACzD,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE;IACvD,MAAM,IAAI,GAAG,UAAU,CAAC,UAAU,EAAE,IAAgB,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IAChF,MAAM,KAAK,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;IACxC,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,MAAM,EAAE,UAAU;oBAClB,OAAO,EAAE,IAAI,CAAC,EAAE;oBAChB,KAAK,EAAE,IAAI,CAAC,KAAK;oBACjB,SAAS,EAAE,IAAI,CAAC,IAAI;oBACpB,YAAY,EAAE,IAAI,CAAC,WAAW;oBAC9B,WAAW,EAAE,KAAK,CAAC,KAAK;oBACxB,WAAW,EAAE,KAAK,CAAC,KAAK;iBACzB,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,2CAA2C;AAC3C,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,iBAAiB,EACjB,uEAAuE;IACrE,gEAAgE;IAChE,mCAAmC,EACrC;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IACjD,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,iBAAiB,CAAC;IACjD,QAAQ,EAAE,CAAC;SACR,IAAI,CAAC;QACJ,YAAY;QACZ,YAAY;QACZ,YAAY;QACZ,YAAY;QACZ,YAAY;QACZ,UAAU;KACX,CAAC;SACD,QAAQ,CAAC,6BAA6B,CAAC;IAC1C,MAAM,EAAE,CAAC;SACN,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,OAAO,CAAC,GAAG,CAAC;SACZ,QAAQ,CAAC,6BAA6B,CAAC;CAC3C,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE;IAC/D,MAAM,IAAI,GAAG,cAAc,CACzB,UAAU,EACV,SAAS,EACT,SAAS,EACT,QAAwB,EACxB,MAAM,CACP,CAAC;IACF,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO;YACL,OAAO,EAAE;gBACP;oBACE,IAAI,EAAE,MAAe;oBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;wBACnB,MAAM,EAAE,OAAO;wBACf,OAAO,EAAE,gCAAgC;qBAC1C,CAAC;iBACH;aACF;SACF,CAAC;IACJ,CAAC;IACD,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,MAAM,EAAE,SAAS;oBACjB,OAAO,EAAE,IAAI,CAAC,EAAE;oBAChB,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;iBACpB,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,+CAA+C;AAC/C,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,qBAAqB,EACrB,yEAAyE;IACvE,oEAAoE;IACpE,4BAA4B,EAC9B;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,gCAAgC,CAAC;IAC5D,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,OAAO,CAAC,CAAC,CAAC;SACV,QAAQ,CAAC,uCAAuC,CAAC;IACpD,KAAK,EAAE,CAAC;SACL,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,OAAO,CAAC,CAAC,CAAC;SACV,QAAQ,CAAC,6CAA6C,CAAC;CAC3D,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE;IAChD,MAAM,MAAM,GAAG,WAAW,CAAC,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAChE,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,KAAK;oBACL,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAChC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;wBAClB,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK;wBACnB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;wBACjB,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO;wBACvB,KAAK,EAAE,CAAC,CAAC,cAAc;qBACxB,CAAC,CAAC;oBACH,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBACtC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;wBAClB,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK;wBACnB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;wBACjB,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO;wBACvB,KAAK,EAAE,CAAC,CAAC,cAAc;wBACvB,KAAK,EAAE,CAAC,CAAC,KAAK;wBACd,IAAI,EAAE,CAAC,CAAC,aAAa;qBACtB,CAAC,CAAC;oBACH,WAAW,EAAE,MAAM,CAAC,UAAU;oBAC9B,WAAW,EAAE,MAAM,CAAC,UAAU;iBAC/B,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,6CAA6C;AAC7C,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,mBAAmB,EACnB,uEAAuE;IACrE,oDAAoD,EACtD;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,OAAO,CAAC,IAAI,CAAC;SACb,QAAQ,CAAC,+DAA+D,CAAC;CAC7E,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,EAAE,EAAE;IAClC,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACtD,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,MAAM,EAAE,QAAQ;oBAChB,OAAO,EAAE,MAAM,CAAC,OAAO;oBACvB,eAAe,EAAE,MAAM,CAAC,SAAS;iBAClC,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,mDAAmD;AACnD,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,yBAAyB,EACzB,qEAAqE;IACnE,uEAAuE;IACvE,UAAU,EACZ;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,KAAK,EAAE,CAAC;SACL,KAAK,CACJ,CAAC,CAAC,MAAM,CAAC;QACP,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACnD,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE;QACjB,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;QACnB,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE;KAC1C,CAAC,CACH;SACA,QAAQ,CAAC,wBAAwB,CAAC;IACrC,SAAS,EAAE,CAAC;SACT,OAAO,EAAE;SACT,QAAQ,EAAE;SACV,OAAO,CAAC,IAAI,CAAC;SACb,QAAQ,CAAC,+CAA+C,CAAC;CAC7D,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE;IACzC,MAAM,MAAM,GAAG,qBAAqB,CAClC,UAAU,EACV,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChB,IAAI,EAAE,CAAC,CAAC,IAAgB;QACxB,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,QAAQ,EAAE,CAAC,CAAC,QAAQ;KACrB,CAAC,CAAC,EACH,SAAS,CACV,CAAC;IACF,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,MAAM,EAAE,OAAO;oBACf,aAAa,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;oBAClC,aAAa,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;oBAClC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAC9B,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,KAAK,EAAE,CAAC,CAAC,KAAK;wBACd,IAAI,EAAE,CAAC,CAAC,IAAI;qBACb,CAAC,CAAC;iBACJ,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,mDAAmD;AACnD,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,yBAAyB,EACzB,uEAAuE;IACrE,oEAAoE;IACpE,8BAA8B,EAChC;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,aAAa,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,0BAA0B,CAAC;IAC9D,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,OAAO,CAAC,CAAC,CAAC;SACV,QAAQ,CAAC,uCAAuC,CAAC;CACrD,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,EAAE,EAAE,EAAE;IACjD,MAAM,OAAO,GAAG,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;IAC5E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO;YACL,OAAO,EAAE;gBACP;oBACE,IAAI,EAAE,MAAe;oBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;wBACnB,MAAM,EAAE,OAAO;wBACf,OAAO,EAAE,mBAAmB,aAAa,EAAE;qBAC5C,CAAC;iBACH;aACF;SACF,CAAC;IACJ,CAAC;IACD,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;oBACjC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAC3B,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;wBAClB,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK;wBACnB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;wBACjB,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO;wBACvB,KAAK,EAAE,CAAC,CAAC,KAAK;wBACd,KAAK,EAAE,CAAC,CAAC,cAAc;wBACvB,IAAI,EAAE,CAAC,CAAC,aAAa;qBACtB,CAAC,CAAC;iBACJ,CAAC;aACH;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,0CAA0C;AAC1C,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,iBAAiB,EACjB,mEAAmE;IACjE,mEAAmE;IACnE,gEAAgE;IAChE,iEAAiE,EACnE;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,6BAA6B,CAAC;CACxD,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,GAAG,EAAE,EAAE,EAAE;IAC5B,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,cAAc,CAAC,UAAU,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACtD,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7B;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,+CAA+C;AAC/C,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,sBAAsB,EACtB,uEAAuE;IACrE,qEAAqE;IACrE,mEAAmE,EACrE;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;IACxE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,4CAA4C,CAAC;IACtE,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,2CAA2C,CAAC;IACvE,SAAS,EAAE,CAAC;SACT,IAAI,CAAC,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SAC3C,QAAQ,EAAE;SACV,OAAO,CAAC,SAAS,CAAC;SAClB,QAAQ,CAAC,+BAA+B,CAAC;CAC7C,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,EAAE;IAC9C,MAAM,MAAM,GAAG,iBAAiB,CAC9B,UAAU,EACV,GAAG,EACH,KAAK,EACL,SAAqB,CACtB,CAAC;IACF,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7B;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAC9E,MAAM,CAAC,IAAI,CACT,eAAe,EACf,wEAAwE;IACtE,sEAAsE;IACtE,0BAA0B,EAC5B;IACE,UAAU,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,uCAAuC,CAAC;CACzE,EACD,KAAK,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE;IACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IACnC,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IAClD,OAAO;QACL,OAAO,EAAE;YACP;gBACE,IAAI,EAAE,MAAe;gBACrB,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;aAC7B;SACF;KACF,CAAC;AACJ,CAAC,CACF,CAAC;AAEF,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,yDAAyD;AACzD,KAAK,UAAU,IAAI;IACjB,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AAClC,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE;IAC9B,OAAO,CAAC,KAAK,CAAC,4BAA4B,EAAE,KAAK,CAAC,CAAC;IACnD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC;AAEH,OAAO,EAAE,MAAM,EAAE,CAAC"}