@elaraai/e3-core 0.0.1-alpha.2

package/dist/src/dataflow.js

@@ -0,0 +1,562 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Licensed under BSL 1.1. See LICENSE for details.
+ */
+/**
+ * Dataflow execution for e3 workspaces.
+ *
+ * Executes tasks in a workspace based on their dependency graph. Tasks are
+ * executed in parallel where possible, respecting a concurrency limit.
+ *
+ * The execution model is event-driven with a work queue:
+ * 1. Build dependency graph from tasks (input paths -> task -> output path)
+ * 2. Compute reverse dependencies (which tasks depend on each output)
+ * 3. Initialize ready queue with tasks whose inputs are all assigned
+ * 4. Execute tasks from ready queue, respecting concurrency limit
+ * 5. On task completion, queue workspace update then check dependents for readiness
+ * 6. On failure, stop launching new tasks but wait for running ones
+ *
+ * IMPORTANT: Workspace state updates are serialized through an async queue to
+ * prevent race conditions when multiple tasks complete concurrently. Each task's
+ * output is written to the workspace and dependents are notified only after the
+ * write completes, ensuring downstream tasks see consistent state.
+ */
+import { decodeBeast2For } from '@elaraai/east';
+import { PackageObjectType, TaskObjectType, WorkspaceStateType, pathToString, } from '@elaraai/e3-types';
+import { objectRead } from './objects.js';
+import { taskExecute, executionGetOutput, inputsHash, } from './executions.js';
+import { workspaceGetDatasetHash, workspaceSetDatasetByHash, } from './trees.js';
+import { E3Error, WorkspaceNotFoundError, WorkspaceNotDeployedError, TaskNotFoundError, DataflowError, DataflowAbortedError, isNotFoundError, } from './errors.js';
+import { acquireWorkspaceLock, } from './workspaceLock.js';
+import * as fs from 'fs/promises';
+import * as path from 'path';
+// =============================================================================
+// Async Mutex for Workspace Updates
+// =============================================================================
+/**
+ * Simple async mutex to serialize workspace state updates.
+ *
+ * When multiple tasks complete concurrently, their workspace writes must be
+ * serialized to prevent race conditions (read-modify-write on the workspace
+ * root hash). This mutex ensures only one update runs at a time.
+ */
+class AsyncMutex {
+    queue = [];
+    locked = false;
+    /**
+     * Acquire the mutex, execute the callback, then release.
+     * If the mutex is already held, waits until it's available.
+     */
+    async runExclusive(fn) {
+        await this.acquire();
+        try {
+            return await fn();
+        }
+        finally {
+            this.release();
+        }
+    }
+    acquire() {
+        return new Promise((resolve) => {
+            if (!this.locked) {
+                this.locked = true;
+                resolve();
+            }
+            else {
+                this.queue.push(resolve);
+            }
+        });
+    }
+    release() {
+        const next = this.queue.shift();
+        if (next) {
+            next();
+        }
+        else {
+            this.locked = false;
+        }
+    }
+}
+// =============================================================================
+// Workspace State Reader
+// =============================================================================
+/**
+ * Read workspace state from file.
+ * @throws {WorkspaceNotFoundError} If workspace doesn't exist
+ * @throws {WorkspaceNotDeployedError} If workspace has no package deployed
+ */
+async function readWorkspaceState(repoPath, ws) {
+    const stateFile = path.join(repoPath, 'workspaces', `${ws}.beast2`);
+    let data;
+    try {
+        data = await fs.readFile(stateFile);
+    }
+    catch (err) {
+        if (isNotFoundError(err)) {
+            throw new WorkspaceNotFoundError(ws);
+        }
+        throw err;
+    }
+    if (data.length === 0) {
+        throw new WorkspaceNotDeployedError(ws);
+    }
+    const decoder = decodeBeast2For(WorkspaceStateType);
+    return decoder(data);
+}
+// =============================================================================
+// Dependency Graph Building
+// =============================================================================
+/**
+ * Build the dependency graph for a workspace.
+ *
+ * Returns:
+ * - taskNodes: Map of task name -> TaskNode
+ * - outputToTask: Map of output path string -> task name
+ * - taskDependents: Map of task name -> set of dependent task names
+ */
+async function buildDependencyGraph(repoPath, ws) {
+    // Read workspace state to get package hash
+    const state = await readWorkspaceState(repoPath, ws);
+    // Read package object to get tasks map
+    const pkgData = await objectRead(repoPath, state.packageHash);
+    const pkgDecoder = decodeBeast2For(PackageObjectType);
+    const pkgObject = pkgDecoder(Buffer.from(pkgData));
+    const taskNodes = new Map();
+    const outputToTask = new Map(); // output path -> task name
+    // First pass: load all tasks and build output->task map
+    const taskDecoder = decodeBeast2For(TaskObjectType);
+    for (const [taskName, taskHash] of pkgObject.tasks) {
+        const taskData = await objectRead(repoPath, taskHash);
+        const task = taskDecoder(Buffer.from(taskData));
+        const outputPathStr = pathToString(task.output);
+        outputToTask.set(outputPathStr, taskName);
+        taskNodes.set(taskName, {
+            name: taskName,
+            hash: taskHash,
+            task,
+            inputPaths: task.inputs,
+            outputPath: task.output,
+            unresolvedCount: 0, // Will be computed below
+        });
+    }
+    // Build reverse dependency map: task -> tasks that depend on it
+    const taskDependents = new Map();
+    for (const taskName of taskNodes.keys()) {
+        taskDependents.set(taskName, new Set());
+    }
+    // Second pass: compute dependencies and unresolved counts
+    for (const [taskName, node] of taskNodes) {
+        for (const inputPath of node.inputPaths) {
+            const inputPathStr = pathToString(inputPath);
+            const producerTask = outputToTask.get(inputPathStr);
+            if (producerTask) {
+                // This input comes from another task's output.
+                // The task cannot run until the producer task completes,
+                // regardless of whether the output is currently assigned
+                // (it might be stale from a previous run).
+                taskDependents.get(producerTask).add(taskName);
+                node.unresolvedCount++;
+            }
+            // If not produced by a task, it's an external input - check if assigned
+            else {
+                const { refType } = await workspaceGetDatasetHash(repoPath, ws, inputPath);
+                if (refType === 'unassigned') {
+                    // External input that is unassigned - this task can never run
+                    node.unresolvedCount++;
+                }
+            }
+        }
+    }
+    return { taskNodes, outputToTask, taskDependents };
+}
+// =============================================================================
+// Dataflow Execution
+// =============================================================================
+/**
+ * Execute all tasks in a workspace according to the dependency graph.
+ *
+ * Tasks are executed in parallel where dependencies allow, respecting
+ * the concurrency limit. On failure, no new tasks are launched but
+ * running tasks are allowed to complete.
+ *
+ * Acquires an exclusive lock on the workspace for the duration of execution
+ * to prevent concurrent modifications. If options.lock is provided, uses that
+ * lock instead (caller is responsible for releasing it).
+ *
+ * @param repoPath - Path to .e3 repository
+ * @param ws - Workspace name
+ * @param options - Execution options
+ * @returns Result of the dataflow execution
+ * @throws {WorkspaceLockError} If workspace is locked by another process
+ * @throws {WorkspaceNotFoundError} If workspace doesn't exist
+ * @throws {WorkspaceNotDeployedError} If workspace has no package deployed
+ * @throws {TaskNotFoundError} If filter specifies a task that doesn't exist
+ * @throws {DataflowError} If execution fails for other reasons
+ */
+export async function dataflowExecute(repoPath, ws, options = {}) {
+    // Acquire lock if not provided externally
+    const externalLock = options.lock;
+    const lock = externalLock ?? await acquireWorkspaceLock(repoPath, ws);
+    try {
+        return await dataflowExecuteWithLock(repoPath, ws, options);
+    }
+    finally {
+        // Only release the lock if we acquired it internally
+        if (!externalLock) {
+            await lock.release();
+        }
+    }
+}
+/**
+ * Start dataflow execution in the background (non-blocking).
+ *
+ * Returns a promise immediately without awaiting execution. The lock is
+ * released automatically when execution completes.
+ *
+ * @param repoPath - Path to .e3 repository
+ * @param ws - Workspace name
+ * @param options - Execution options (lock must be provided)
+ * @returns Promise that resolves when execution completes
+ * @throws {WorkspaceNotFoundError} If workspace doesn't exist
+ * @throws {WorkspaceNotDeployedError} If workspace has no package deployed
+ * @throws {TaskNotFoundError} If filter specifies a task that doesn't exist
+ * @throws {DataflowError} If execution fails for other reasons
+ */
+export function dataflowStart(repoPath, ws, options) {
+    return dataflowExecuteWithLock(repoPath, ws, options)
+        .finally(() => options.lock.release());
+}
+/**
+ * Internal: Execute dataflow with lock already held.
+ */
+async function dataflowExecuteWithLock(repoPath, ws, options) {
+    const startTime = Date.now();
+    const concurrency = options.concurrency ?? 4;
+    let taskNodes;
+    let taskDependents;
+    try {
+        // Build dependency graph
+        const graph = await buildDependencyGraph(repoPath, ws);
+        taskNodes = graph.taskNodes;
+        taskDependents = graph.taskDependents;
+    }
+    catch (err) {
+        // Re-throw E3Errors as-is
+        if (err instanceof E3Error)
+            throw err;
+        // Wrap unexpected errors
+        throw new DataflowError(`Failed to build dependency graph: ${err instanceof Error ? err.message : err}`);
+    }
+    // Apply filter if specified
+    const filteredTaskNames = options.filter
+        ? new Set([options.filter])
+        : null;
+    // Validate filter
+    if (filteredTaskNames && options.filter && !taskNodes.has(options.filter)) {
+        throw new TaskNotFoundError(options.filter);
+    }
+    // Track execution state
+    const results = [];
+    let executed = 0;
+    let cached = 0;
+    let failed = 0;
+    let skipped = 0;
+    let hasFailure = false;
+    let aborted = false;
+    // Check for abort signal
+    const checkAborted = () => {
+        if (options.signal?.aborted && !aborted) {
+            aborted = true;
+        }
+        return aborted;
+    };
+    // Mutex to serialize workspace state updates.
+    // When multiple tasks complete concurrently, their writes to the workspace
+    // must be serialized to prevent lost updates (read-modify-write race).
+    const workspaceUpdateMutex = new AsyncMutex();
+    // Ready queue: tasks with all dependencies resolved
+    const readyQueue = [];
+    const completed = new Set();
+    const inProgress = new Set();
+    // Initialize ready queue with tasks that have no unresolved dependencies
+    // and pass the filter (if any)
+    for (const [taskName, node] of taskNodes) {
+        if (node.unresolvedCount === 0) {
+            if (!filteredTaskNames || filteredTaskNames.has(taskName)) {
+                readyQueue.push(taskName);
+            }
+        }
+    }
+    // Check if the task has a valid cached execution for current inputs
+    // Returns the output hash if cached, null if re-execution is needed
+    async function getCachedOutput(taskName) {
+        const node = taskNodes.get(taskName);
+        // Gather current input hashes
+        const currentInputHashes = [];
+        for (const inputPath of node.inputPaths) {
+            const { refType, hash } = await workspaceGetDatasetHash(repoPath, ws, inputPath);
+            if (refType !== 'value' || hash === null) {
+                // Input not assigned, can't be cached
+                return null;
+            }
+            currentInputHashes.push(hash);
+        }
+        // Check if there's a cached execution for these inputs
+        const inHash = inputsHash(currentInputHashes);
+        const cachedOutputHash = await executionGetOutput(repoPath, node.hash, inHash);
+        if (cachedOutputHash === null) {
+            // No cached execution for current inputs
+            return null;
+        }
+        // Also verify the workspace output matches the cached output
+        // (in case the workspace was modified outside of execution)
+        const { refType, hash: wsOutputHash } = await workspaceGetDatasetHash(repoPath, ws, node.outputPath);
+        if (refType !== 'value' || wsOutputHash !== cachedOutputHash) {
+            // Workspace output doesn't match cached output, need to re-execute
+            // (or update workspace with cached value)
+            return null;
+        }
+        return cachedOutputHash;
+    }
+    // Execute a single task (does NOT write to workspace - caller must do that)
+    async function executeTask(taskName) {
+        const node = taskNodes.get(taskName);
+        const taskStartTime = Date.now();
+        options.onTaskStart?.(taskName);
+        // Gather input hashes
+        const inputHashes = [];
+        for (const inputPath of node.inputPaths) {
+            const { refType, hash } = await workspaceGetDatasetHash(repoPath, ws, inputPath);
+            if (refType !== 'value' || hash === null) {
+                // Input not available - should not happen if dependency tracking is correct
+                return {
+                    name: taskName,
+                    cached: false,
+                    state: 'error',
+                    error: `Input at ${pathToString(inputPath)} is not assigned (refType: ${refType})`,
+                    duration: Date.now() - taskStartTime,
+                };
+            }
+            inputHashes.push(hash);
+        }
+        // Execute the task
+        const execOptions = {
+            force: options.force,
+            signal: options.signal,
+            onStdout: options.onStdout ? (data) => options.onStdout(taskName, data) : undefined,
+            onStderr: options.onStderr ? (data) => options.onStderr(taskName, data) : undefined,
+        };
+        const result = await taskExecute(repoPath, node.hash, inputHashes, execOptions);
+        // Build task result (NOTE: workspace update happens later, in mutex-protected section)
+        const taskResult = {
+            name: taskName,
+            cached: result.cached,
+            state: result.state,
+            duration: Date.now() - taskStartTime,
+        };
+        if (result.state === 'error') {
+            taskResult.error = result.error ?? undefined;
+        }
+        else if (result.state === 'failed') {
+            taskResult.exitCode = result.exitCode ?? undefined;
+            taskResult.error = result.error ?? undefined;
+        }
+        // Pass output hash to caller for workspace update (if successful)
+        if (result.state === 'success' && result.outputHash) {
+            taskResult.outputHash = result.outputHash;
+        }
+        return taskResult;
+    }
+    // Process dependents when a task completes
+    function notifyDependents(taskName) {
+        const dependents = taskDependents.get(taskName) ?? new Set();
+        for (const depName of dependents) {
+            if (completed.has(depName) || inProgress.has(depName))
+                continue;
+            // Skip dependents not in the filter
+            if (filteredTaskNames && !filteredTaskNames.has(depName))
+                continue;
+            const depNode = taskNodes.get(depName);
+            depNode.unresolvedCount--;
+            if (depNode.unresolvedCount === 0 && !readyQueue.includes(depName)) {
+                readyQueue.push(depName);
+            }
+        }
+    }
+    // Mark dependents as skipped when a task fails
+    function skipDependents(taskName) {
+        const dependents = taskDependents.get(taskName) ?? new Set();
+        for (const depName of dependents) {
+            if (completed.has(depName) || inProgress.has(depName))
+                continue;
+            // Skip dependents not in the filter
+            if (filteredTaskNames && !filteredTaskNames.has(depName))
+                continue;
+            // Recursively skip
+            completed.add(depName);
+            skipped++;
+            results.push({
+                name: depName,
+                cached: false,
+                state: 'skipped',
+                duration: 0,
+            });
+            options.onTaskComplete?.({
+                name: depName,
+                cached: false,
+                state: 'skipped',
+                duration: 0,
+            });
+            skipDependents(depName);
+        }
+    }
+    // Main execution loop using a work-stealing approach
+    const runningPromises = new Map();
+    async function processQueue() {
+        while (true) {
+            // Check if we're done
+            if (readyQueue.length === 0 && runningPromises.size === 0) {
+                break;
+            }
+            // Launch tasks up to concurrency limit if no failure and not aborted
+            while (!hasFailure && !checkAborted() && readyQueue.length > 0 && runningPromises.size < concurrency) {
+                const taskName = readyQueue.shift();
+                if (completed.has(taskName) || inProgress.has(taskName))
+                    continue;
+                // Check if there's a valid cached execution for current inputs
+                const cachedOutputHash = await getCachedOutput(taskName);
+                if (cachedOutputHash !== null && !options.force) {
+                    // Valid cached execution exists for current inputs.
+                    // No workspace write needed (output already matches), but we still
+                    // need mutex protection for state updates to prevent races with
+                    // concurrent task completions.
+                    await workspaceUpdateMutex.runExclusive(() => {
+                        completed.add(taskName);
+                        cached++;
+                        const result = {
+                            name: taskName,
+                            cached: true,
+                            state: 'success',
+                            duration: 0,
+                        };
+                        results.push(result);
+                        options.onTaskComplete?.(result);
+                        notifyDependents(taskName);
+                    });
+                    continue;
+                }
+                inProgress.add(taskName);
+                const promise = (async () => {
+                    try {
+                        const result = await executeTask(taskName);
+                        // Use mutex to serialize workspace updates and dependent notifications.
+                        // This prevents race conditions where two tasks complete simultaneously,
+                        // both read the same workspace state, and one overwrites the other's changes.
+                        await workspaceUpdateMutex.runExclusive(async () => {
+                            // Write output to workspace BEFORE notifying dependents
+                            if (result.state === 'success' && result.outputHash) {
+                                const node = taskNodes.get(taskName);
+                                await workspaceSetDatasetByHash(repoPath, ws, node.outputPath, result.outputHash);
+                            }
+                            // Now safe to update execution state and notify dependents
+                            inProgress.delete(taskName);
+                            completed.add(taskName);
+                            results.push(result);
+                            options.onTaskComplete?.(result);
+                            if (result.state === 'success') {
+                                if (result.cached) {
+                                    cached++;
+                                }
+                                else {
+                                    executed++;
+                                }
+                                notifyDependents(taskName);
+                            }
+                            else {
+                                failed++;
+                                hasFailure = true;
+                                skipDependents(taskName);
+                            }
+                        });
+                    }
+                    finally {
+                        runningPromises.delete(taskName);
+                    }
+                })();
+                runningPromises.set(taskName, promise);
+            }
+            // Wait for at least one task to complete if we can't launch more
+            if (runningPromises.size > 0) {
+                await Promise.race(runningPromises.values());
+            }
+            else if (readyQueue.length === 0) {
+                // No running tasks and no ready tasks - we might have unresolvable dependencies
+                break;
+            }
+        }
+    }
+    await processQueue();
+    // Wait for any remaining tasks
+    if (runningPromises.size > 0) {
+        await Promise.all(runningPromises.values());
+    }
+    // Check for abort one final time
+    checkAborted();
+    // If aborted, throw with partial results
+    if (aborted) {
+        throw new DataflowAbortedError(results);
+    }
+    return {
+        success: !hasFailure,
+        executed,
+        cached,
+        failed,
+        skipped,
+        tasks: results,
+        duration: Date.now() - startTime,
+    };
+}
+/**
+ * Get the dependency graph for a workspace (for visualization/debugging).
+ *
+ * @param repoPath - Path to .e3 repository
+ * @param ws - Workspace name
+ * @returns Graph information
+ * @throws {WorkspaceNotFoundError} If workspace doesn't exist
+ * @throws {WorkspaceNotDeployedError} If workspace has no package deployed
+ * @throws {DataflowError} If graph building fails for other reasons
+ */
+export async function dataflowGetGraph(repoPath, ws) {
+    let taskNodes;
+    let outputToTask;
+    try {
+        const graph = await buildDependencyGraph(repoPath, ws);
+        taskNodes = graph.taskNodes;
+        outputToTask = graph.outputToTask;
+    }
+    catch (err) {
+        if (err instanceof E3Error)
+            throw err;
+        throw new DataflowError(`Failed to build dependency graph: ${err instanceof Error ? err.message : err}`);
+    }
+    const tasks = [];
+    for (const [taskName, node] of taskNodes) {
+        const dependsOn = [];
+        for (const inputPath of node.inputPaths) {
+            const inputPathStr = pathToString(inputPath);
+            const producerTask = outputToTask.get(inputPathStr);
+            if (producerTask) {
+                dependsOn.push(producerTask);
+            }
+        }
+        tasks.push({
+            name: taskName,
+            hash: node.hash,
+            inputs: node.inputPaths.map(pathToString),
+            output: pathToString(node.outputPath),
+            dependsOn,
+        });
+    }
+    return { tasks };
+}
+//# sourceMappingURL=dataflow.js.map

package/dist/src/dataflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataflow.js","sourceRoot":"","sources":["../../src/dataflow.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AAChD,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,YAAY,GAGb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EACL,WAAW,EACX,kBAAkB,EAClB,UAAU,GAEX,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,uBAAuB,EACvB,yBAAyB,GAC1B,MAAM,YAAY,CAAC;AACpB,OAAO,EACL,OAAO,EACP,sBAAsB,EACtB,yBAAyB,EACzB,iBAAiB,EACjB,aAAa,EACb,oBAAoB,EACpB,eAAe,GAChB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,oBAAoB,GAErB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,KAAK,EAAE,MAAM,aAAa,CAAC;AAClC,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAE7B,gFAAgF;AAChF,oCAAoC;AACpC,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU;IACN,KAAK,GAAsB,EAAE,CAAC;IAC9B,MAAM,GAAG,KAAK,CAAC;IAEvB;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAI,EAAW;QAC/B,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACrB,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,OAAO,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAEO,OAAO;QACb,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;gBACnB,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,OAAO;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,EAAE,CAAC;QACT,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACtB,CAAC;IACH,CAAC;CACF;AAkGD,gFAAgF;AAChF,yBAAyB;AACzB,gFAAgF;AAEhF;;;;GAIG;AACH,KAAK,UAAU,kBAAkB,CAAC,QAAgB,EAAE,EAAU;IAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,YAAY,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;IACpE,IAAI,IAAY,CAAC;IACjB,IAAI,CAAC;QACH,IAAI,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,sBAAsB,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,GAAG,CAAC;IACZ,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,yBAAyB,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,OAAO,GAAG,eAAe,CAAC,kBAAkB,CAAC,CAAC;IACpD,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;AACvB,CAAC;AAED,gFAAgF;AAChF,4BAA4B;AAC5B,gFAAgF;AAEhF;;;;;;;GAOG;AACH,KAAK,UAAU,oBAAoB,CACjC,QAAgB,EAChB,EAAU;IAMV,2CAA2C;IAC3C,MAAM,KAAK,GAAG,MAAM,kBAAkB,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAErD,uCAAuC;IACvC,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;IAC9D,MAAM,UAAU,GAAG,eAAe,CAAC,iBAAiB,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAEnD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,2BAA2B;IAE3E,wDAAwD;IACxD,MAAM,WAAW,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC;IACpD,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE,CAAC;QACnD,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAEhD,MAAM,aAAa,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,YAAY,CAAC,GAAG,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;QAE1C,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE;YACtB,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,QAAQ;YACd,IAAI;YACJ,UAAU,EAAE,IAAI,CAAC,MAAM;YACvB,UAAU,EAAE,IAAI,CAAC,MAAM;YACvB,eAAe,EAAE,CAAC,EAAE,yBAAyB;SAC9C,CAAC,CAAC;IACL,CAAC;IAED,gEAAgE;IAChE,MAAM,cAAc,GAAG,IAAI,GAAG,EAAuB,CAAC;IACtD,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;QACxC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,0DAA0D;IAC1D,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACzC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;YAC7C,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAEpD,IAAI,YAAY,EAAE,CAAC;gBACjB,+CAA+C;gBAC/C,yDAAyD;gBACzD,yDAAyD;gBACzD,2CAA2C;gBAC3C,cAAc,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChD,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,CAAC;YACD,wEAAwE;iBACnE,CAAC;gBACJ,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,uBAAuB,CAAC,QAAQ,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;gBAC3E,IAAI,OAAO,KAAK,YAAY,EAAE,CAAC;oBAC7B,8DAA8D;oBAC9D,IAAI,CAAC,eAAe,EAAE,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC;AACrD,CAAC;AAED,gFAAgF;AAChF,qBAAqB;AACrB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,QAAgB,EAChB,EAAU,EACV,UAA2B,EAAE;IAE7B,0CAA0C;IAC1C,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;IAClC,MAAM,IAAI,GAAG,YAAY,IAAI,MAAM,oBAAoB,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAEtE,IAAI,CAAC;QACH,OAAO,MAAM,uBAAuB,CAAC,QAAQ,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;IAC9D,CAAC;YAAS,CAAC;QACT,qDAAqD;QACrD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,aAAa,CAC3B,QAAgB,EAChB,EAAU,EACV,OAAwD;IAExD,OAAO,uBAAuB,CAAC,QAAQ,EAAE,EAAE,EAAE,OAAO,CAAC;SAClD,OAAO,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,uBAAuB,CACpC,QAAgB,EAChB,EAAU,EACV,OAAwB;IAExB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC;IAE7C,IAAI,SAAgC,CAAC;IACrC,IAAI,cAAwC,CAAC;IAE7C,IAAI,CAAC;QACH,yBAAyB;QACzB,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACvD,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;QAC5B,cAAc,GAAG,KAAK,CAAC,cAAc,CAAC;IACxC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,0BAA0B;QAC1B,IAAI,GAAG,YAAY,OAAO;YAAE,MAAM,GAAG,CAAC;QACtC,yBAAyB;QACzB,MAAM,IAAI,aAAa,CAAC,qCAAqC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3G,CAAC;IAED,4BAA4B;IAC5B,MAAM,iBAAiB,GAAG,OAAO,CAAC,MAAM;QACtC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3B,CAAC,CAAC,IAAI,CAAC;IAET,kBAAkB;IAClB,IAAI,iBAAiB,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1E,MAAM,IAAI,iBAAiB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,wBAAwB;IACxB,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,UAAU,GAAG,KAAK,CAAC;IACvB,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,yBAAyB;IACzB,MAAM,YAAY,GAAG,GAAG,EAAE;QACxB,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;YACxC,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IAEF,8CAA8C;IAC9C,2EAA2E;IAC3E,uEAAuE;IACvE,MAAM,oBAAoB,GAAG,IAAI,UAAU,EAAE,CAAC;IAE9C,oDAAoD;IACpD,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,yEAAyE;IACzE,+BAA+B;IAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,eAAe,KAAK,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1D,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,oEAAoE;IACpE,KAAK,UAAU,eAAe,CAAC,QAAgB;QAC7C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QAEtC,8BAA8B;QAC9B,MAAM,kBAAkB,GAAa,EAAE,CAAC;QACxC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,MAAM,uBAAuB,CAAC,QAAQ,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YACjF,IAAI,OAAO,KAAK,OAAO,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBACzC,sCAAsC;gBACtC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;QAED,uDAAuD;QACvD,MAAM,MAAM,GAAG,UAAU,CAAC,kBAAkB,CAAC,CAAC;QAC9C,MAAM,gBAAgB,GAAG,MAAM,kBAAkB,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAE/E,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;YAC9B,yCAAyC;YACzC,OAAO,IAAI,CAAC;QACd,CAAC;QAED,6DAA6D;QAC7D,4DAA4D;QAC5D,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,uBAAuB,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACrG,IAAI,OAAO,KAAK,OAAO,IAAI,YAAY,KAAK,gBAAgB,EAAE,CAAC;YAC7D,mEAAmE;YACnE,0CAA0C;YAC1C,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAOD,4EAA4E;IAC5E,KAAK,UAAU,WAAW,CAAC,QAAgB;QACzC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACtC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEjC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC;QAEhC,sBAAsB;QACtB,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,MAAM,uBAAuB,CAAC,QAAQ,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YACjF,IAAI,OAAO,KAAK,OAAO,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;gBACzC,4EAA4E;gBAC5E,OAAO;oBACL,IAAI,EAAE,QAAQ;oBACd,MAAM,EAAE,KAAK;oBACb,KAAK,EAAE,OAAO;oBACd,KAAK,EAAE,YAAY,YAAY,CAAC,SAAS,CAAC,8BAA8B,OAAO,GAAG;oBAClF,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa;iBACrC,CAAC;YACJ,CAAC;YACD,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;QAED,mBAAmB;QACnB,MAAM,WAAW,GAAmB;YAClC,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,QAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;YACpF,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,QAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS;SACrF,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAEhF,uFAAuF;QACvF,MAAM,UAAU,GAAuB;YACrC,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa;SACrC,CAAC;QAEF,IAAI,MAAM,CAAC,KAAK,KAAK,OAAO,EAAE,CAAC;YAC7B,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,SAAS,CAAC;QAC/C,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YACrC,UAAU,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,SAAS,CAAC;YACnD,UAAU,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,SAAS,CAAC;QAC/C,CAAC;QAED,kEAAkE;QAClE,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACpD,UAAU,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;QAC5C,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,2CAA2C;IAC3C,SAAS,gBAAgB,CAAC,QAAgB;QACxC,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC7D,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEhE,oCAAoC;YACpC,IAAI,iBAAiB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEnE,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;YACxC,OAAO,CAAC,eAAe,EAAE,CAAC;YAE1B,IAAI,OAAO,CAAC,eAAe,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;gBACnE,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,+CAA+C;IAC/C,SAAS,cAAc,CAAC,QAAgB;QACtC,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC7D,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEhE,oCAAoC;YACpC,IAAI,iBAAiB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEnE,mBAAmB;YACnB,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACvB,OAAO,EAAE,CAAC;YACV,OAAO,CAAC,IAAI,CAAC;gBACX,IAAI,EAAE,OAAO;gBACb,MAAM,EAAE,KAAK;gBACb,KAAK,EAAE,SAAS;gBAChB,QAAQ,EAAE,CAAC;aACZ,CAAC,CAAC;YACH,OAAO,CAAC,cAAc,EAAE,CAAC;gBACvB,IAAI,EAAE,OAAO;gBACb,MAAM,EAAE,KAAK;gBACb,KAAK,EAAE,SAAS;gBAChB,QAAQ,EAAE,CAAC;aACZ,CAAC,CAAC;YAEH,cAAc,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEzD,KAAK,UAAU,YAAY;QACzB,OAAO,IAAI,EAAE,CAAC;YACZ,sBAAsB;YACtB,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1D,MAAM;YACR,CAAC;YAED,qEAAqE;YACrE,OAAO,CAAC,UAAU,IAAI,CAAC,YAAY,EAAE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,eAAe,CAAC,IAAI,GAAG,WAAW,EAAE,CAAC;gBACrG,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;gBAErC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBAElE,+DAA+D;gBAC/D,MAAM,gBAAgB,GAAG,MAAM,eAAe,CAAC,QAAQ,CAAC,CAAC;gBACzD,IAAI,gBAAgB,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;oBAChD,oDAAoD;oBACpD,mEAAmE;oBACnE,gEAAgE;oBAChE,+BAA+B;oBAC/B,MAAM,oBAAoB,CAAC,YAAY,CAAC,GAAG,EAAE;wBAC3C,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACxB,MAAM,EAAE,CAAC;wBACT,MAAM,MAAM,GAAwB;4BAClC,IAAI,EAAE,QAAQ;4BACd,MAAM,EAAE,IAAI;4BACZ,KAAK,EAAE,SAAS;4BAChB,QAAQ,EAAE,CAAC;yBACZ,CAAC;wBACF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;wBACrB,OAAO,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC;wBACjC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;oBAC7B,CAAC,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBAED,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAEzB,MAAM,OAAO,GAAG,CAAC,KAAK,IAAI,EAAE;oBAC1B,IAAI,CAAC;wBACH,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,QAAQ,CAAC,CAAC;wBAE3C,wEAAwE;wBACxE,yEAAyE;wBACzE,8EAA8E;wBAC9E,MAAM,oBAAoB,CAAC,YAAY,CAAC,KAAK,IAAI,EAAE;4BACjD,wDAAwD;4BACxD,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gCACpD,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gCACtC,MAAM,yBAAyB,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;4BACpF,CAAC;4BAED,2DAA2D;4BAC3D,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;4BAC5B,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;4BACxB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;4BACrB,OAAO,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC;4BAEjC,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gCAC/B,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;oCAClB,MAAM,EAAE,CAAC;gCACX,CAAC;qCAAM,CAAC;oCACN,QAAQ,EAAE,CAAC;gCACb,CAAC;gCACD,gBAAgB,CAAC,QAAQ,CAAC,CAAC;4BAC7B,CAAC;iCAAM,CAAC;gCACN,MAAM,EAAE,CAAC;gCACT,UAAU,GAAG,IAAI,CAAC;gCAClB,cAAc,CAAC,QAAQ,CAAC,CAAC;4BAC3B,CAAC;wBACH,CAAC,CAAC,CAAC;oBACL,CAAC;4BAAS,CAAC;wBACT,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;oBACnC,CAAC;gBACH,CAAC,CAAC,EAAE,CAAC;gBAEL,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACzC,CAAC;YAED,iEAAiE;YACjE,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;YAC/C,CAAC;iBAAM,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACnC,gFAAgF;gBAChF,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,YAAY,EAAE,CAAC;IAErB,+BAA+B;IAC/B,IAAI,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,iCAAiC;IACjC,YAAY,EAAE,CAAC;IAEf,yCAAyC;IACzC,IAAI,OAAO,EAAE,CAAC;QACZ,MAAM,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IAED,OAAO;QACL,OAAO,EAAE,CAAC,UAAU;QACpB,QAAQ;QACR,MAAM;QACN,MAAM;QACN,OAAO;QACP,KAAK,EAAE,OAAO;QACd,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;KACjC,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAgB,EAChB,EAAU;IAUV,IAAI,SAAgC,CAAC;IACrC,IAAI,YAAiC,CAAC;IAEtC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,oBAAoB,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACvD,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;QAC5B,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IACpC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,OAAO;YAAE,MAAM,GAAG,CAAC;QACtC,MAAM,IAAI,aAAa,CAAC,qCAAqC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3G,CAAC;IAED,MAAM,KAAK,GAMN,EAAE,CAAC;IAER,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACzC,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,YAAY,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;YAC7C,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YACpD,IAAI,YAAY,EAAE,CAAC;gBACjB,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC;YACzC,MAAM,EAAE,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;YACrC,SAAS;SACV,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,CAAC;AACnB,CAAC"}