network-ai 4.14.0 → 4.15.1

package/dist/lib/goal-decomposer.js

@@ -0,0 +1,553 @@
+"use strict";
+/**
+ * Goal Decomposer — LLM-powered goal → task DAG → parallel execution
+ *
+ * Provides the `runTeam()` one-liner: describe a goal in plain English,
+ * specify which agents to use, and let an LLM plan the task graph.
+ * Execution respects all Network-AI guardrails (budgets, permissions, audit).
+ *
+ * Zero external dependencies — LLM calls go through the adapter system.
+ *
+ * @module GoalDecomposer
+ * @version 1.0.0
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TeamRunner = exports.GoalDecomposer = void 0;
+exports.validateDAG = validateDAG;
+exports.topologicalLayers = topologicalLayers;
+exports.createLLMPlanner = createLLMPlanner;
+exports.parsePlanJSON = parsePlanJSON;
+exports.runTeam = runTeam;
+const events_1 = require("events");
+// ============================================================================
+// DAG UTILITIES
+// ============================================================================
+/**
+ * Validate that a set of planned tasks forms a valid DAG (no cycles, valid refs).
+ * @throws Error if the graph contains cycles or invalid dependency references
+ */
+function validateDAG(tasks) {
+    const ids = new Set(tasks.map((t) => t.id));
+    // Check for duplicate IDs
+    if (ids.size !== tasks.length) {
+        throw new Error('Duplicate task IDs in plan');
+    }
+    // Check all dependency references are valid
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            if (!ids.has(dep)) {
+                throw new Error(`Task "${task.id}" depends on unknown task "${dep}"`);
+            }
+            if (dep === task.id) {
+                throw new Error(`Task "${task.id}" depends on itself`);
+            }
+        }
+    }
+    // Cycle detection via topological sort (Kahn's algorithm)
+    const inDegree = new Map();
+    const adj = new Map();
+    for (const task of tasks) {
+        inDegree.set(task.id, 0);
+        adj.set(task.id, []);
+    }
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            adj.get(dep).push(task.id);
+            inDegree.set(task.id, (inDegree.get(task.id) ?? 0) + 1);
+        }
+    }
+    const queue = [];
+    for (const [id, deg] of inDegree) {
+        if (deg === 0)
+            queue.push(id);
+    }
+    let visited = 0;
+    while (queue.length > 0) {
+        const node = queue.shift();
+        visited++;
+        for (const neighbor of adj.get(node) ?? []) {
+            const newDeg = (inDegree.get(neighbor) ?? 1) - 1;
+            inDegree.set(neighbor, newDeg);
+            if (newDeg === 0)
+                queue.push(neighbor);
+        }
+    }
+    if (visited !== tasks.length) {
+        throw new Error('Task graph contains a cycle');
+    }
+}
+/**
+ * Compute topological layers — tasks in the same layer can execute in parallel.
+ * Returns arrays of task IDs grouped by execution layer.
+ */
+function topologicalLayers(tasks) {
+    const inDegree = new Map();
+    const adj = new Map();
+    for (const task of tasks) {
+        inDegree.set(task.id, 0);
+        adj.set(task.id, []);
+    }
+    for (const task of tasks) {
+        for (const dep of task.dependencies) {
+            adj.get(dep).push(task.id);
+            inDegree.set(task.id, (inDegree.get(task.id) ?? 0) + 1);
+        }
+    }
+    const layers = [];
+    let remaining = new Set(tasks.map((t) => t.id));
+    while (remaining.size > 0) {
+        const layer = [];
+        for (const id of remaining) {
+            if ((inDegree.get(id) ?? 0) === 0) {
+                layer.push(id);
+            }
+        }
+        if (layer.length === 0) {
+            throw new Error('Cycle detected during layer computation');
+        }
+        layers.push(layer);
+        for (const id of layer) {
+            remaining.delete(id);
+            for (const neighbor of adj.get(id) ?? []) {
+                inDegree.set(neighbor, (inDegree.get(neighbor) ?? 1) - 1);
+            }
+        }
+    }
+    return layers;
+}
+// ============================================================================
+// BUILT-IN PLANNER — Structured prompt → LLM → JSON parse
+// ============================================================================
+/**
+ * Create a planner function that uses an LLM (via executor) to decompose goals.
+ *
+ * The planner sends a structured prompt to the specified agent and parses
+ * the JSON response into PlannedTask[]. Falls back gracefully on parse errors.
+ *
+ * @param executor - Function to call the LLM agent
+ * @param plannerAgent - Agent ID for the LLM that does planning
+ * @param plannerAdapter - Adapter name (optional, defaults to agent's adapter)
+ */
+function createLLMPlanner(executor, plannerAgent) {
+    return async (goal, agents, context) => {
+        const agentDescriptions = agents
+            .map((a) => `- ${a.id}: ${a.role}${a.defaultAction ? ` (action: ${a.defaultAction})` : ''}`)
+            .join('\n');
+        const prompt = [
+            'You are a task planning agent. Decompose the following goal into a set of tasks.',
+            'Each task must be assigned to one of the available agents.',
+            'Tasks can depend on other tasks (they will wait for dependencies to complete).',
+            'Tasks without dependencies will run in parallel.',
+            '',
+            `GOAL: ${goal}`,
+            '',
+            'AVAILABLE AGENTS:',
+            agentDescriptions,
+            '',
+            context ? `CONTEXT: ${JSON.stringify(context)}` : '',
+            '',
+            'Respond with ONLY a JSON array of task objects. Each object must have:',
+            '- "id": unique string identifier (e.g. "task-1")',
+            '- "description": what this task does',
+            '- "agent": agent ID from the list above',
+            '- "action": the action to perform',
+            '- "params": object with parameters',
+            '- "dependencies": array of task IDs this depends on (empty array if none)',
+            '- "priority": number (higher = more urgent, default 1)',
+            '',
+            'Example:',
+            '[{"id":"task-1","description":"Research the topic","agent":"researcher","action":"research","params":{"query":"..."},"dependencies":[],"priority":2},',
+            ' {"id":"task-2","description":"Write summary","agent":"writer","action":"write","params":{"input":"from task-1"},"dependencies":["task-1"],"priority":1}]',
+        ].filter(Boolean).join('\n');
+        const payload = {
+            action: 'plan',
+            params: { prompt, goal, agents: agents.map((a) => ({ id: a.id, role: a.role })) },
+        };
+        const result = await executor(plannerAgent, payload, {
+            agentId: plannerAgent,
+            taskId: `plan-${Date.now()}`,
+            metadata: { type: 'goal-decomposition', ...(context ?? {}) },
+        });
+        if (!result.success || !result.data) {
+            throw new Error(`Planner agent failed: ${result.error?.message ?? 'no data returned'}`);
+        }
+        // Parse the LLM response — handle both string and pre-parsed responses
+        let tasks;
+        if (Array.isArray(result.data)) {
+            tasks = result.data;
+        }
+        else if (typeof result.data === 'string') {
+            tasks = parsePlanJSON(result.data);
+        }
+        else if (typeof result.data === 'object' && result.data !== null) {
+            const dataObj = result.data;
+            if (Array.isArray(dataObj.tasks)) {
+                tasks = dataObj.tasks;
+            }
+            else if (typeof dataObj.text === 'string') {
+                tasks = parsePlanJSON(dataObj.text);
+            }
+            else if (typeof dataObj.content === 'string') {
+                tasks = parsePlanJSON(dataObj.content);
+            }
+            else {
+                throw new Error('Planner returned unrecognized data shape');
+            }
+        }
+        else {
+            throw new Error('Planner returned unrecognized data type');
+        }
+        // Validate required fields
+        for (const task of tasks) {
+            if (!task.id || typeof task.id !== 'string')
+                throw new Error('Task missing "id"');
+            if (!task.description || typeof task.description !== 'string')
+                throw new Error(`Task "${task.id}" missing "description"`);
+            if (!task.agent || typeof task.agent !== 'string')
+                throw new Error(`Task "${task.id}" missing "agent"`);
+            if (!task.action || typeof task.action !== 'string')
+                throw new Error(`Task "${task.id}" missing "action"`);
+            if (!task.params || typeof task.params !== 'object')
+                task.params = {};
+            if (!Array.isArray(task.dependencies))
+                task.dependencies = [];
+            if (typeof task.priority !== 'number')
+                task.priority = 1;
+        }
+        return tasks;
+    };
+}
+/**
+ * Parse JSON from an LLM response string, handling markdown fences and preamble.
+ */
+function parsePlanJSON(text) {
+    // Strip markdown code fences (indexOf-based to avoid ReDoS — CodeQL #105)
+    let cleaned = text.trim();
+    const fenceOpen = cleaned.indexOf('```');
+    if (fenceOpen !== -1) {
+        const afterOpen = cleaned.indexOf('\n', fenceOpen);
+        const fenceClose = cleaned.indexOf('```', afterOpen !== -1 ? afterOpen : fenceOpen + 3);
+        if (afterOpen !== -1 && fenceClose > afterOpen) {
+            cleaned = cleaned.substring(afterOpen + 1, fenceClose).trim();
+        }
+    }
+    // Find the JSON array in the text
+    const arrayStart = cleaned.indexOf('[');
+    const arrayEnd = cleaned.lastIndexOf(']');
+    if (arrayStart !== -1 && arrayEnd > arrayStart) {
+        cleaned = cleaned.substring(arrayStart, arrayEnd + 1);
+    }
+    try {
+        const parsed = JSON.parse(cleaned);
+        if (!Array.isArray(parsed)) {
+            throw new Error('Expected JSON array of tasks');
+        }
+        return parsed;
+    }
+    catch (err) {
+        throw new Error(`Failed to parse planner response as JSON: ${err.message}`);
+    }
+}
+// ============================================================================
+// GOAL DECOMPOSER
+// ============================================================================
+/**
+ * LLM-powered goal decomposition engine.
+ *
+ * Takes a natural language goal, creates a task DAG via an LLM planner,
+ * validates the graph, and returns a ready-to-execute TaskDAG.
+ */
+class GoalDecomposer {
+    planner;
+    constructor(planner) {
+        this.planner = planner;
+    }
+    /**
+     * Decompose a goal into a validated TaskDAG.
+     * @param goal - Natural language description of the goal
+     * @param agents - Available team agents
+     * @param context - Optional context to feed to the planner
+     * @param retries - Number of retries on planning failure (default: 1)
+     */
+    async decompose(goal, agents, context, retries = 1) {
+        if (!goal || typeof goal !== 'string' || goal.trim().length === 0) {
+            throw new Error('Goal must be a non-empty string');
+        }
+        if (!agents || agents.length === 0) {
+            throw new Error('At least one agent is required');
+        }
+        // Validate agent IDs are unique
+        const agentIds = new Set(agents.map((a) => a.id));
+        if (agentIds.size !== agents.length) {
+            throw new Error('Duplicate agent IDs');
+        }
+        let lastError;
+        for (let attempt = 0; attempt <= retries; attempt++) {
+            try {
+                const planned = await this.planner(goal, agents, context);
+                validateDAG(planned);
+                // Validate that all assigned agents exist in the team
+                for (const task of planned) {
+                    if (!agentIds.has(task.agent)) {
+                        throw new Error(`Task "${task.id}" assigned to unknown agent "${task.agent}"`);
+                    }
+                }
+                // Build the TaskDAG
+                const nodes = planned.map((t) => ({
+                    id: t.id,
+                    description: t.description,
+                    agent: t.agent,
+                    action: t.action,
+                    params: t.params,
+                    dependencies: t.dependencies,
+                    priority: t.priority ?? 1,
+                    status: 'pending',
+                }));
+                const edges = new Map();
+                for (const task of planned) {
+                    edges.set(task.id, []);
+                }
+                for (const task of planned) {
+                    for (const dep of task.dependencies) {
+                        edges.get(dep).push(task.id);
+                    }
+                }
+                return { goal, nodes, edges, createdAt: Date.now() };
+            }
+            catch (err) {
+                lastError = err;
+                if (attempt < retries)
+                    continue;
+            }
+        }
+        throw lastError ?? new Error('Planning failed');
+    }
+}
+exports.GoalDecomposer = GoalDecomposer;
+// ============================================================================
+// TEAM RUNNER — The one-liner execution engine
+// ============================================================================
+/**
+ * Executes a TaskDAG by running tasks in parallel layers, respecting
+ * dependencies, concurrency limits, and timeouts.
+ *
+ * @example
+ * ```typescript
+ * const runner = new TeamRunner(executor);
+ * const result = await runner.run(dag, { concurrency: 3 });
+ * console.log(result.summary);
+ * ```
+ */
+class TeamRunner extends events_1.EventEmitter {
+    executor;
+    constructor(executor) {
+        super();
+        this.executor = executor;
+    }
+    /**
+     * Execute a TaskDAG with parallel scheduling.
+     */
+    async run(dag, options = {}) {
+        const { concurrency = 5, taskTimeout = 30_000, totalTimeout = 300_000, continueOnFailure = false, sessionId, metadata, } = options;
+        const start = Date.now();
+        const deadline = start + totalTimeout;
+        const results = new Map();
+        const nodeMap = new Map();
+        for (const node of dag.nodes) {
+            nodeMap.set(node.id, node);
+        }
+        this.emit('dag:created', dag);
+        // Compute layers for parallel execution
+        const planned = dag.nodes.map((n) => ({
+            id: n.id,
+            description: n.description,
+            agent: n.agent,
+            action: n.action,
+            params: n.params,
+            dependencies: n.dependencies,
+            priority: n.priority,
+        }));
+        const layers = topologicalLayers(planned);
+        let aborted = false;
+        for (const layer of layers) {
+            if (aborted)
+                break;
+            // Check total timeout
+            if (Date.now() >= deadline) {
+                for (const taskId of layer) {
+                    const node = nodeMap.get(taskId);
+                    node.status = 'skipped';
+                    node.error = 'Total timeout exceeded';
+                    this.emit('task:skip', node, 'Total timeout exceeded');
+                }
+                aborted = true;
+                break;
+            }
+            // Sort by priority within the layer (higher first)
+            const sorted = [...layer].sort((a, b) => {
+                const na = nodeMap.get(a);
+                const nb = nodeMap.get(b);
+                return nb.priority - na.priority;
+            });
+            // Execute in batches respecting concurrency
+            for (let i = 0; i < sorted.length; i += concurrency) {
+                if (aborted)
+                    break;
+                const batch = sorted.slice(i, i + concurrency);
+                const batchPromises = batch.map(async (taskId) => {
+                    const node = nodeMap.get(taskId);
+                    // Skip if a dependency failed and we're not continuing on failure
+                    if (!continueOnFailure) {
+                        for (const depId of node.dependencies) {
+                            const dep = nodeMap.get(depId);
+                            if (dep && dep.status === 'failed') {
+                                node.status = 'skipped';
+                                node.error = `Dependency "${depId}" failed`;
+                                this.emit('task:skip', node, node.error);
+                                return;
+                            }
+                        }
+                    }
+                    node.status = 'running';
+                    node.startedAt = Date.now();
+                    this.emit('task:start', node);
+                    // Build payload with dependency results injected
+                    const depResults = {};
+                    for (const depId of node.dependencies) {
+                        const depResult = results.get(depId);
+                        if (depResult)
+                            depResults[depId] = depResult.data;
+                    }
+                    const payload = {
+                        action: node.action,
+                        params: { ...node.params, _dependencyResults: depResults },
+                    };
+                    const context = {
+                        agentId: node.agent,
+                        taskId: node.id,
+                        sessionId,
+                        metadata: { ...metadata, goal: dag.goal, layer: layers.indexOf(layer) },
+                    };
+                    try {
+                        const result = await withTimeout(this.executor(node.agent, payload, context), taskTimeout, `Task "${taskId}" timed out after ${taskTimeout}ms`);
+                        results.set(taskId, result);
+                        if (result.success) {
+                            node.status = 'completed';
+                            node.result = result;
+                            node.completedAt = Date.now();
+                            this.emit('task:complete', node, result);
+                        }
+                        else {
+                            node.status = 'failed';
+                            node.error = result.error?.message ?? 'Agent returned failure';
+                            node.result = result;
+                            node.completedAt = Date.now();
+                            this.emit('task:fail', node, node.error);
+                            if (!continueOnFailure)
+                                aborted = true;
+                        }
+                    }
+                    catch (err) {
+                        const errMsg = err.message ?? String(err);
+                        node.status = 'failed';
+                        node.error = errMsg;
+                        node.completedAt = Date.now();
+                        this.emit('task:fail', node, errMsg);
+                        results.set(taskId, {
+                            success: false,
+                            error: { code: 'EXECUTION_ERROR', message: errMsg, recoverable: false },
+                        });
+                        if (!continueOnFailure)
+                            aborted = true;
+                    }
+                });
+                await Promise.all(batchPromises);
+            }
+        }
+        // Skip remaining unexecuted nodes
+        for (const node of dag.nodes) {
+            if (node.status === 'pending') {
+                node.status = 'skipped';
+                node.error = aborted ? 'Aborted due to prior failure' : 'Not reached';
+                this.emit('task:skip', node, node.error);
+            }
+        }
+        const stats = {
+            total: dag.nodes.length,
+            completed: dag.nodes.filter((n) => n.status === 'completed').length,
+            failed: dag.nodes.filter((n) => n.status === 'failed').length,
+            skipped: dag.nodes.filter((n) => n.status === 'skipped').length,
+        };
+        const success = stats.failed === 0 && stats.skipped === 0;
+        const durationMs = Date.now() - start;
+        const summary = `Goal: "${dag.goal}" — ${stats.completed}/${stats.total} tasks completed${stats.failed ? `, ${stats.failed} failed` : ''}${stats.skipped ? `, ${stats.skipped} skipped` : ''} in ${durationMs}ms`;
+        const teamResult = { success, dag, results, summary, durationMs, stats };
+        this.emit('run:complete', teamResult);
+        return teamResult;
+    }
+}
+exports.TeamRunner = TeamRunner;
+// ============================================================================
+// runTeam() — THE ONE-LINER
+// ============================================================================
+/**
+ * Decompose a goal into tasks and execute them with a team of agents.
+ *
+ * This is the main entry point — one line to go from goal to results:
+ *
+ * ```typescript
+ * const result = await runTeam(
+ *   "Build a REST API for user management",
+ *   [
+ *     { id: "architect", role: "System design and API specification" },
+ *     { id: "coder", role: "Write TypeScript code" },
+ *     { id: "reviewer", role: "Code review and quality checks" },
+ *   ],
+ *   { planner, executor }
+ * );
+ * ```
+ *
+ * @param goal - Natural language description of what to achieve
+ * @param agents - Team of agents available for task execution
+ * @param config - Planner (LLM decomposition) and executor (agent invocation) functions
+ * @param options - Optional concurrency, timeout, and failure handling settings
+ * @returns Full result with DAG, individual results, and stats
+ */
+async function runTeam(goal, agents, config, options = {}) {
+    const decomposer = new GoalDecomposer(config.planner);
+    const runner = new TeamRunner(config.executor);
+    const dag = await decomposer.decompose(goal, agents, options.metadata, options.plannerRetries ?? 1);
+    // Optional approval gate
+    if (options.approvalCallback) {
+        const approved = await options.approvalCallback(dag);
+        if (!approved) {
+            // Mark all tasks as skipped
+            for (const node of dag.nodes) {
+                node.status = 'skipped';
+                node.error = 'Execution not approved';
+            }
+            return {
+                success: false,
+                dag,
+                results: new Map(),
+                summary: `Goal: "${goal}" — execution not approved`,
+                durationMs: 0,
+                stats: { total: dag.nodes.length, completed: 0, failed: 0, skipped: dag.nodes.length },
+            };
+        }
+    }
+    return runner.run(dag, options);
+}
+// ============================================================================
+// HELPERS
+// ============================================================================
+/** Promise wrapper that rejects after a timeout */
+function withTimeout(promise, ms, message) {
+    if (ms <= 0 || ms === Infinity)
+        return promise;
+    return new Promise((resolve, reject) => {
+        const timer = setTimeout(() => reject(new Error(message)), ms);
+        promise.then((val) => { clearTimeout(timer); resolve(val); }, (err) => { clearTimeout(timer); reject(err); });
+    });
+}
+//# sourceMappingURL=goal-decomposer.js.map

package/dist/lib/goal-decomposer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-decomposer.js","sourceRoot":"","sources":["../../lib/goal-decomposer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;GAWG;;;AAkJH,kCAqDC;AAMD,8CAqCC;AAgBD,4CAqFC;AAKD,sCA4BC;AAqTD,0BAqCC;AAhtBD,mCAAsC;AAwItC,+EAA+E;AAC/E,gBAAgB;AAChB,+EAA+E;AAE/E;;;GAGG;AACH,SAAgB,WAAW,CAAC,KAAoB;IAC9C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE5C,0BAA0B;IAC1B,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;IAChD,CAAC;IAED,4CAA4C;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,8BAA8B,GAAG,GAAG,CAAC,CAAC;YACxE,CAAC;YACD,IAAI,GAAG,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,qBAAqB,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACvB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC5B,OAAO,EAAE,CAAC;QACV,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC/B,IAAI,MAAM,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACjD,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAgB,iBAAiB,CAAC,KAAoB;IACpD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACvB,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACpC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhD,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBACzC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,0DAA0D;AAC1D,+EAA+E;AAE/E;;;;;;;;;GASG;AACH,SAAgB,gBAAgB,CAC9B,QAA0B,EAC1B,YAAoB;IAEpB,OAAO,KAAK,EAAE,IAAY,EAAE,MAAmB,EAAE,OAAiC,EAA0B,EAAE;QAC5G,MAAM,iBAAiB,GAAG,MAAM;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;aAC3F,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,MAAM,MAAM,GAAG;YACb,kFAAkF;YAClF,4DAA4D;YAC5D,gFAAgF;YAChF,kDAAkD;YAClD,EAAE;YACF,SAAS,IAAI,EAAE;YACf,EAAE;YACF,mBAAmB;YACnB,iBAAiB;YACjB,EAAE;YACF,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACpD,EAAE;YACF,wEAAwE;YACxE,kDAAkD;YAClD,sCAAsC;YACtC,yCAAyC;YACzC,mCAAmC;YACnC,oCAAoC;YACpC,2EAA2E;YAC3E,wDAAwD;YACxD,EAAE;YACF,UAAU;YACV,uJAAuJ;YACvJ,2JAA2J;SAC5J,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE7B,MAAM,OAAO,GAAiB;YAC5B,MAAM,EAAE,MAAM;YACd,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE;SAClF,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,YAAY,EAAE,OAAO,EAAE;YACnD,OAAO,EAAE,YAAY;YACrB,MAAM,EAAE,QAAQ,IAAI,CAAC,GAAG,EAAE,EAAE;YAC5B,QAAQ,EAAE,EAAE,IAAI,EAAE,oBAAoB,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE;SAC7D,CAAC,CAAC;QAEH,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,yBAAyB,MAAM,CAAC,KAAK,EAAE,OAAO,IAAI,kBAAkB,EAAE,CAAC,CAAC;QAC1F,CAAC;QAED,uEAAuE;QACvE,IAAI,KAAoB,CAAC;QACzB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,GAAG,MAAM,CAAC,IAAqB,CAAC;QACvC,CAAC;aAAM,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3C,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACnE,MAAM,OAAO,GAAG,MAAM,CAAC,IAA+B,CAAC;YACvD,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjC,KAAK,GAAG,OAAO,CAAC,KAAsB,CAAC;YACzC,CAAC;iBAAM,IAAI,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC5C,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACtC,CAAC;iBAAM,IAAI,OAAO,OAAO,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;gBAC/C,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACzC,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QAED,2BAA2B;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,CAAC,CAAC;YAClF,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,yBAAyB,CAAC,CAAC;YAC1H,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;YACxG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;YAC3G,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ;gBAAE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;YACtE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC;gBAAE,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;YAC9D,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBAAE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,IAAY;IACxC,0EAA0E;IAC1E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,SAAS,KAAK,CAAC,CAAC,EAAE,CAAC;QACrB,MAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QACxF,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC/C,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,SAAS,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC;QAChE,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC1C,IAAI,UAAU,KAAK,CAAC,CAAC,IAAI,QAAQ,GAAG,UAAU,EAAE,CAAC;QAC/C,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,IAAI,KAAK,CAAC,6CAA8C,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;IACzF,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,kBAAkB;AAClB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAa,cAAc;IACjB,OAAO,CAAkB;IAEjC,YAAY,OAAwB;QAClC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,SAAS,CACb,IAAY,EACZ,MAAmB,EACnB,OAAiC,EACjC,OAAO,GAAG,CAAC;QAEX,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QACD,gCAAgC;QAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;QACzC,CAAC;QAED,IAAI,SAA4B,CAAC;QACjC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBAC1D,WAAW,CAAC,OAAO,CAAC,CAAC;gBAErB,sDAAsD;gBACtD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;oBAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC9B,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,EAAE,gCAAgC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;oBACjF,CAAC;gBACH,CAAC;gBAED,oBAAoB;gBACpB,MAAM,KAAK,GAAe,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC5C,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,WAAW,EAAE,CAAC,CAAC,WAAW;oBAC1B,KAAK,EAAE,CAAC,CAAC,KAAK;oBACd,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,YAAY,EAAE,CAAC,CAAC,YAAY;oBAC5B,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,CAAC;oBACzB,MAAM,EAAE,SAAkB;iBAC3B,CAAC,CAAC,CAAC;gBAEJ,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;gBAC1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;oBAC3B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACzB,CAAC;gBACD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;oBAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;wBACpC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAChC,CAAC;gBACH,CAAC;gBAED,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YACvD,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,SAAS,GAAG,GAAY,CAAC;gBACzB,IAAI,OAAO,GAAG,OAAO;oBAAE,SAAS;YAClC,CAAC;QACH,CAAC;QAED,MAAM,SAAS,IAAI,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAClD,CAAC;CACF;AA5ED,wCA4EC;AAED,+EAA+E;AAC/E,+CAA+C;AAC/C,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAa,UAAW,SAAQ,qBAAY;IAClC,QAAQ,CAAmB;IAEnC,YAAY,QAA0B;QACpC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,GAAY,EAAE,UAA0B,EAAE;QAClD,MAAM,EACJ,WAAW,GAAG,CAAC,EACf,WAAW,GAAG,MAAM,EACpB,YAAY,GAAG,OAAO,EACtB,iBAAiB,GAAG,KAAK,EACzB,SAAS,EACT,QAAQ,GACT,GAAG,OAAO,CAAC;QAEZ,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,KAAK,GAAG,YAAY,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QAE9B,wCAAwC;QACxC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpC,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,QAAQ,EAAE,CAAC,CAAC,QAAQ;SACrB,CAAC,CAAC,CAAC;QACJ,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAE1C,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,OAAO;gBAAE,MAAM;YAEnB,sBAAsB;YACtB,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC3B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBAClC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;oBACxB,IAAI,CAAC,KAAK,GAAG,wBAAwB,CAAC;oBACtC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,wBAAwB,CAAC,CAAC;gBACzD,CAAC;gBACD,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;YAED,mDAAmD;YACnD,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAC3B,OAAO,EAAE,CAAC,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC;YACnC,CAAC,CAAC,CAAC;YAEH,4CAA4C;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;gBACpD,IAAI,OAAO;oBAAE,MAAM;gBACnB,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC;gBAE/C,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;oBAC/C,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBAElC,kEAAkE;oBAClE,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACvB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;4BACtC,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;4BAC/B,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gCACnC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gCACxB,IAAI,CAAC,KAAK,GAAG,eAAe,KAAK,UAAU,CAAC;gCAC5C,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gCACzC,OAAO;4BACT,CAAC;wBACH,CAAC;oBACH,CAAC;oBAED,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;oBACxB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;oBAC5B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAE9B,iDAAiD;oBACjD,MAAM,UAAU,GAA4B,EAAE,CAAC;oBAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;wBACtC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;wBACrC,IAAI,SAAS;4BAAE,UAAU,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC;oBACpD,CAAC;oBAED,MAAM,OAAO,GAAiB;wBAC5B,MAAM,EAAE,IAAI,CAAC,MAAM;wBACnB,MAAM,EAAE,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,kBAAkB,EAAE,UAAU,EAAE;qBAC3D,CAAC;oBAEF,MAAM,OAAO,GAAiB;wBAC5B,OAAO,EAAE,IAAI,CAAC,KAAK;wBACnB,MAAM,EAAE,IAAI,CAAC,EAAE;wBACf,SAAS;wBACT,QAAQ,EAAE,EAAE,GAAG,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;qBACxE,CAAC;oBAEF,IAAI,CAAC;wBACH,MAAM,MAAM,GAAG,MAAM,WAAW,CAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,EAC3C,WAAW,EACX,SAAS,MAAM,qBAAqB,WAAW,IAAI,CACpD,CAAC;wBAEF,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wBAE5B,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;4BACnB,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;4BAC1B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;4BACrB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;4BAC9B,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;wBAC3C,CAAC;6BAAM,CAAC;4BACN,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;4BACvB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,OAAO,IAAI,wBAAwB,CAAC;4BAC/D,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;4BACrB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;4BAC9B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;4BACzC,IAAI,CAAC,iBAAiB;gCAAE,OAAO,GAAG,IAAI,CAAC;wBACzC,CAAC;oBACH,CAAC;oBAAC,OAAO,GAAG,EAAE,CAAC;wBACb,MAAM,MAAM,GAAI,GAAa,CAAC,OAAO,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;wBACrD,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;wBACvB,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;wBACpB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;wBAC9B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;wBACrC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE;4BAClB,OAAO,EAAE,KAAK;4BACd,KAAK,EAAE,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE;yBACxE,CAAC,CAAC;wBACH,IAAI,CAAC,iBAAiB;4BAAE,OAAO,GAAG,IAAI,CAAC;oBACzC,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,8BAA8B,CAAC,CAAC,CAAC,aAAa,CAAC;gBACtE,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,KAAM,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG;YACZ,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM;YACvB,SAAS,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,MAAM;YACnE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,MAAM;YAC7D,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM;SAChE,CAAC;QAEF,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,KAAK,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;QACtC,MAAM,OAAO,GAAG,UAAU,GAAG,CAAC,IAAI,OAAO,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,KAAK,mBAAmB,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,MAAM,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,OAAO,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,UAAU,IAAI,CAAC;QAElN,MAAM,UAAU,GAAe,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;QACrF,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;QACtC,OAAO,UAAU,CAAC;IACpB,CAAC;CACF;AA/KD,gCA+KC;AAED,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACI,KAAK,UAAU,OAAO,CAC3B,IAAY,EACZ,MAAmB,EACnB,MAAgE,EAChE,UAA0B,EAAE;IAE5B,MAAM,UAAU,GAAG,IAAI,cAAc,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAE/C,MAAM,GAAG,GAAG,MAAM,UAAU,CAAC,SAAS,CACpC,IAAI,EACJ,MAAM,EACN,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,cAAc,IAAI,CAAC,CAC5B,CAAC;IAEF,yBAAyB;IACzB,IAAI,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,4BAA4B;YAC5B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,KAAK,GAAG,wBAAwB,CAAC;YACxC,CAAC;YACD,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,GAAG;gBACH,OAAO,EAAE,IAAI,GAAG,EAAE;gBAClB,OAAO,EAAE,UAAU,IAAI,4BAA4B;gBACnD,UAAU,EAAE,CAAC;gBACb,KAAK,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;aACvF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;AAClC,CAAC;AAED,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E,mDAAmD;AACnD,SAAS,WAAW,CAAI,OAAmB,EAAE,EAAU,EAAE,OAAe;IACtE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,QAAQ;QAAE,OAAO,OAAO,CAAC;IAC/C,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACxC,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/D,OAAO,CAAC,IAAI,CACV,CAAC,GAAG,EAAE,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAC/C,CAAC,GAAG,EAAE,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAC/C,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/security.js

@@ -143,7 +143,7 @@ class InputSanitizer {
     // Dangerous patterns that could indicate injection attempts
     static DANGEROUS_PATTERNS = [
         /\$\{.*\}/g, // Template injection
-        /<script[\s\S]*?>[\s\S]*?<\/script>/gi, // XSS
+        /<script\b[^>]*>[\s\S]*?<\/script>/gi, // XSS (non-backtracking open-tag)
         /javascript:/gi, // JavaScript protocol
         /on\w+\s*=/gi, // Event handlers
         /\.\.\//g, // Path traversal