@lumenflow/core 3.1.1 → 3.1.3

package/dist/dependency-graph.js

@@ -1,612 +0,0 @@
-// Copyright (c) 2026 Hellmai Ltd
-// SPDX-License-Identifier: AGPL-3.0-only
-import { existsSync, readdirSync, promises as fs } from 'node:fs';
-import path from 'node:path';
-import { readWU, readWUAsync } from './wu-yaml.js';
-import { WU_PATHS } from './wu-paths.js';
-import { STRING_LITERALS, WU_STATUS } from './wu-constants.js';
-import { detectCycles } from './cycle-detector.js';
-const GRAPH_STATUS_MAP = {
-    done: WU_STATUS.DONE,
-    in_progress: WU_STATUS.IN_PROGRESS,
-    ready: WU_STATUS.READY,
-    blocked: WU_STATUS.BLOCKED,
-};
-function toStringArray(value) {
-    if (!Array.isArray(value)) {
-        return [];
-    }
-    return value.filter((entry) => typeof entry === 'string');
-}
-function toDependencyNode(id, doc) {
-    return {
-        id,
-        title: typeof doc.title === 'string' ? doc.title : id,
-        status: typeof doc.status === 'string' ? doc.status : 'unknown',
-        blocks: toStringArray(doc.blocks),
-        blockedBy: toStringArray(doc.blocked_by),
-    };
-}
-function isGraphStatus(status) {
-    return (status === GRAPH_STATUS_MAP.done ||
-        status === GRAPH_STATUS_MAP.in_progress ||
-        status === GRAPH_STATUS_MAP.ready ||
-        status === GRAPH_STATUS_MAP.blocked);
-}
-function toCycleDetectorGraph(graph) {
-    const normalized = new Map();
-    for (const [id, node] of graph.entries()) {
-        normalized.set(id, {
-            id: node.id,
-            blocks: node.blocks,
-            blocked_by: node.blockedBy,
-        });
-    }
-    return normalized;
-}
-/**
- * Dependency Graph Module (WU-1247, WU-1568)
- *
- * Provides graph building, visualization, and analysis for WU dependencies.
- * Supports ASCII tree and Mermaid diagram output formats.
- * Includes graph algorithms for operational insights: topological sort,
- * critical path, impact scoring, and bottleneck detection.
- *
- * @example
- * import { buildDependencyGraph, renderASCII, renderMermaid, topologicalSort, criticalPath, bottlenecks } from './lib/dependency-graph.js';
- *
- * const graph = buildDependencyGraph();
- * console.log(renderASCII(graph, 'WU-1247'));
- * console.log(renderMermaid(graph, { direction: 'TD' }));
- *
- * // Graph analysis (WU-1568)
- * const sorted = topologicalSort(graph);
- * const critical = criticalPath(graph);
- * const topBottlenecks = bottlenecks(graph, 10);
- */
-/**
- * Build a dependency graph from all WU YAML files.
- *
- * @returns {Map<string, {id: string, title: string, status: string, blocks: string[], blockedBy: string[]}>}
- */
-export function buildDependencyGraph() {
-    const wuDir = path.dirname(WU_PATHS.WU('dummy'));
-    const graph = new Map();
-    if (!existsSync(wuDir)) {
-        return graph;
-    }
-    const files = readdirSync(wuDir).filter((f) => f.endsWith('.yaml') && f.startsWith('WU-'));
-    for (const f of files) {
-        const filePath = path.join(wuDir, f);
-        const id = f.replace('.yaml', '');
-        try {
-            const doc = readWU(filePath, id);
-            graph.set(id, toDependencyNode(id, doc));
-        }
-        catch {
-            // Skip invalid files
-        }
-    }
-    return graph;
-}
-/**
- * Build a dependency graph from all WU YAML files asynchronously.
- *
- * @returns {Promise<Map<string, {id: string, title: string, status: string, blocks: string[], blockedBy: string[]}>>}
- */
-export async function buildDependencyGraphAsync() {
-    const wuDir = path.dirname(WU_PATHS.WU('dummy'));
-    const graph = new Map();
-    try {
-        const files = await fs.readdir(wuDir);
-        const yamlFiles = files.filter((f) => f.endsWith('.yaml') && f.startsWith('WU-'));
-        const promises = yamlFiles.map(async (f) => {
-            const filePath = path.join(wuDir, f);
-            const id = f.replace('.yaml', '');
-            try {
-                const doc = (await readWUAsync(filePath, id));
-                return toDependencyNode(id, doc);
-            }
-            catch {
-                // Skip invalid files
-                return null;
-            }
-        });
-        const results = await Promise.all(promises);
-        for (const result of results) {
-            if (result) {
-                graph.set(result.id, result);
-            }
-        }
-    }
-    catch {
-        // Return empty graph if dir doesn't exist or other error
-    }
-    return graph;
-}
-/**
- * Get all dependencies (upstream: blocked_by) for a WU.
- *
- * @param {Map} graph - Dependency graph
- * @param {string} wuId - WU ID to get dependencies for
- * @param {number} [maxDepth=10] - Maximum traversal depth
- * @returns {Array<{id: string, depth: number, path: string[]}>}
- */
-export function getUpstreamDependencies(graph, wuId, maxDepth = 10) {
-    const visited = new Set();
-    const result = [];
-    function traverse(id, depth, pathSoFar) {
-        if (depth > maxDepth || visited.has(id))
-            return;
-        visited.add(id);
-        const node = graph.get(id);
-        if (!node)
-            return;
-        for (const dep of node.blockedBy) {
-            if (!visited.has(dep)) {
-                result.push({ id: dep, depth, path: [...pathSoFar, dep] });
-                traverse(dep, depth + 1, [...pathSoFar, dep]);
-            }
-        }
-    }
-    traverse(wuId, 1, [wuId]);
-    return result;
-}
-/**
- * Get all dependents (downstream: blocks) for a WU.
- *
- * @param {Map} graph - Dependency graph
- * @param {string} wuId - WU ID to get dependents for
- * @param {number} [maxDepth=10] - Maximum traversal depth
- * @returns {Array<{id: string, depth: number, path: string[]}>}
- */
-export function getDownstreamDependents(graph, wuId, maxDepth = 10) {
-    const visited = new Set();
-    const result = [];
-    function traverse(id, depth, pathSoFar) {
-        if (depth > maxDepth || visited.has(id))
-            return;
-        visited.add(id);
-        const node = graph.get(id);
-        if (!node)
-            return;
-        for (const dep of node.blocks) {
-            if (!visited.has(dep)) {
-                result.push({ id: dep, depth, path: [...pathSoFar, dep] });
-                traverse(dep, depth + 1, [...pathSoFar, dep]);
-            }
-        }
-    }
-    traverse(wuId, 1, [wuId]);
-    return result;
-}
-/**
- * Render dependency graph as ASCII tree.
- *
- * @param {Map} graph - Dependency graph
- * @param {string} rootId - Root WU ID
- * @param {RenderASCIIOptions} [options] - Render options
- * @returns {string} ASCII tree representation
- */
-export function renderASCII(graph, rootId, options = {}) {
-    const { direction = 'both', depth: maxDepth = 3 } = options;
-    const lines = [];
-    const root = graph.get(rootId);
-    if (!root) {
-        return `WU not found: ${rootId}`;
-    }
-    // Header
-    lines.push(`${rootId}: ${truncate(root.title, 50)}`);
-    lines.push('');
-    // Upstream (blocked_by)
-    if (direction === 'up' || direction === 'both') {
-        const upstream = getUpstreamDependencies(graph, rootId, maxDepth);
-        if (upstream.length > 0) {
-            lines.push('Dependencies (blocked by):');
-            for (const dep of upstream) {
-                const node = graph.get(dep.id);
-                const status = node ? `[${node.status}]` : '[unknown]';
-                const title = node ? truncate(node.title, 40) : '';
-                const indent = '  '.repeat(dep.depth);
-                lines.push(`${indent}+-- ${dep.id}: ${title} ${status}`);
-            }
-            lines.push('');
-        }
-    }
-    // Downstream (blocks)
-    if (direction === 'down' || direction === 'both') {
-        const downstream = getDownstreamDependents(graph, rootId, maxDepth);
-        if (downstream.length > 0) {
-            lines.push('Dependents (blocks):');
-            for (const dep of downstream) {
-                const node = graph.get(dep.id);
-                const status = node ? `[${node.status}]` : '[unknown]';
-                const title = node ? truncate(node.title, 40) : '';
-                const indent = '  '.repeat(dep.depth);
-                lines.push(`${indent}+-- ${dep.id}: ${title} ${status}`);
-            }
-            lines.push('');
-        }
-    }
-    // Check for cycles
-    const cycleResult = detectCycles(toCycleDetectorGraph(graph));
-    if (cycleResult.hasCycle) {
-        lines.push('⚠️  Circular dependencies detected:');
-        for (const cycle of cycleResult.cycles) {
-            lines.push(`  ${cycle.join(' → ')}`);
-        }
-        lines.push('');
-    }
-    return lines.join(STRING_LITERALS.NEWLINE);
-}
-/**
- * Render dependency graph as Mermaid diagram.
- *
- * @param {Map} graph - Dependency graph
- * @param {RenderMermaidOptions} [options] - Render options
- * @returns {string} Mermaid diagram syntax
- */
-export function renderMermaid(graph, options = {}) {
-    const { rootId, direction = 'TD', depth: maxDepth = 3 } = options;
-    const lines = [];
-    const nodes = new Set();
-    const edges = [];
-    // Collect nodes and edges
-    if (rootId) {
-        // Focus on specific WU
-        const upstream = getUpstreamDependencies(graph, rootId, maxDepth);
-        const downstream = getDownstreamDependents(graph, rootId, maxDepth);
-        nodes.add(rootId);
-        for (const dep of upstream) {
-            nodes.add(dep.id);
-        }
-        for (const dep of downstream) {
-            nodes.add(dep.id);
-        }
-        // Build edges for focused view
-        for (const nodeId of nodes) {
-            const node = graph.get(nodeId);
-            if (!node)
-                continue;
-            for (const blockedBy of node.blockedBy) {
-                if (nodes.has(blockedBy)) {
-                    edges.push({ from: blockedBy, to: nodeId });
-                }
-            }
-        }
-    }
-    else {
-        // Full graph
-        for (const [nodeId, node] of graph.entries()) {
-            nodes.add(nodeId);
-            for (const blockedBy of node.blockedBy) {
-                if (graph.has(blockedBy)) {
-                    edges.push({ from: blockedBy, to: nodeId });
-                }
-            }
-        }
-    }
-    // Generate Mermaid
-    lines.push(`flowchart ${direction}`);
-    // Node definitions with labels
-    for (const nodeId of nodes) {
-        const node = graph.get(nodeId);
-        if (node) {
-            const shortTitle = truncate(node.title, 30);
-            lines.push(`    ${nodeId}["${nodeId}: ${shortTitle}<br/>${node.status}"]`);
-        }
-    }
-    lines.push('');
-    // Edges
-    for (const { from, to } of edges) {
-        lines.push(`    ${from} --> ${to}`);
-    }
-    lines.push('');
-    // Status styling
-    lines.push('    classDef done fill:#86efac,stroke:#22c55e');
-    lines.push('    classDef in_progress fill:#93c5fd,stroke:#3b82f6');
-    lines.push('    classDef ready fill:#fde68a,stroke:#f59e0b');
-    lines.push('    classDef blocked fill:#fca5a5,stroke:#ef4444');
-    // Apply classes
-    const statusGroups = {
-        done: [],
-        in_progress: [],
-        ready: [],
-        blocked: [],
-    };
-    for (const nodeId of nodes) {
-        const node = graph.get(nodeId);
-        if (node && isGraphStatus(node.status)) {
-            statusGroups[node.status].push(nodeId);
-        }
-    }
-    for (const [status, nodeIds] of Object.entries(statusGroups)) {
-        if (nodeIds.length > 0) {
-            lines.push(`    class ${nodeIds.join(',')} ${status}`);
-        }
-    }
-    return lines.join(STRING_LITERALS.NEWLINE);
-}
-/**
- * Validate dependency graph for cycles and orphans.
- *
- * @param {Map} graph - Dependency graph
- * @returns {{hasCycle: boolean, cycles: string[][], orphans: Array<{wuId: string, ref: string}>}}
- */
-export function validateGraph(graph) {
-    const allIds = new Set(graph.keys());
-    const orphans = [];
-    // Check for orphan references
-    for (const [wuId, node] of graph.entries()) {
-        for (const ref of [...node.blocks, ...node.blockedBy]) {
-            if (!allIds.has(ref)) {
-                orphans.push({ wuId, ref });
-            }
-        }
-    }
-    // Transform graph to snake_case for detectCycles compatibility
-    // (dependency-graph uses camelCase internally, initiative-validator uses snake_case)
-    const cycleResult = detectCycles(toCycleDetectorGraph(graph));
-    return {
-        hasCycle: cycleResult.hasCycle,
-        cycles: cycleResult.cycles,
-        orphans,
-    };
-}
-// =============================================================================
-// Graph Analysis Functions (WU-1568)
-// =============================================================================
-/**
- * Filter graph to active (non-done) WUs only.
- *
- * @param {Map} graph - Full dependency graph
- * @returns {Map} Graph containing only non-done WUs
- */
-function filterActiveGraph(graph) {
-    const activeGraph = new Map();
-    for (const [id, node] of graph.entries()) {
-        if (node.status !== WU_STATUS.DONE) {
-            activeGraph.set(id, node);
-        }
-    }
-    return activeGraph;
-}
-/**
- * Check if a WU's dependencies are satisfied (done or not in active graph).
- *
- * @param {Map} activeGraph - Active subgraph
- * @param {Map} fullGraph - Full graph (includes done WUs)
- * @param {object} node - Node to check
- * @returns {boolean} True if all dependencies are satisfied
- */
-function _areDependenciesSatisfied(activeGraph, fullGraph, node) {
-    for (const depId of node.blockedBy) {
-        // Dependency is satisfied if:
-        // 1. It doesn't exist in the graph (orphan reference, treat as satisfied)
-        // 2. It's done
-        // 3. It's not in the active graph (already filtered out)
-        const depNode = fullGraph.get(depId);
-        if (depNode && depNode.status !== WU_STATUS.DONE && activeGraph.has(depId)) {
-            return false;
-        }
-    }
-    return true;
-}
-/**
- * Perform topological sort on non-done WUs using Kahn's algorithm.
- * Returns valid execution ordering where dependencies come before dependents.
- * Handles cycles gracefully by returning partial ordering with warning.
- *
- * @param {Map} graph - Dependency graph
- * @returns {string[]|{order: string[], warning: string, cycleNodes: string[]}} Sorted WU IDs or warning object
- */
-export function topologicalSort(graph) {
-    const activeGraph = filterActiveGraph(graph);
-    if (activeGraph.size === 0) {
-        return [];
-    }
-    // Build in-degree map (count of unsatisfied dependencies)
-    const inDegree = new Map();
-    for (const [id, node] of activeGraph.entries()) {
-        // Count only dependencies that are in the active graph
-        let count = 0;
-        for (const depId of node.blockedBy) {
-            if (activeGraph.has(depId)) {
-                count++;
-            }
-        }
-        inDegree.set(id, count);
-    }
-    // Start with nodes that have no active dependencies
-    const queue = [];
-    for (const [id, degree] of inDegree.entries()) {
-        if (degree === 0) {
-            queue.push(id);
-        }
-    }
-    const sorted = [];
-    while (queue.length > 0) {
-        const current = queue.shift();
-        if (!current) {
-            continue;
-        }
-        sorted.push(current);
-        const node = activeGraph.get(current);
-        if (!node)
-            continue;
-        // Decrease in-degree of dependents
-        for (const depId of node.blocks) {
-            if (!activeGraph.has(depId))
-                continue;
-            const newDegree = (inDegree.get(depId) ?? 0) - 1;
-            inDegree.set(depId, newDegree);
-            if (newDegree === 0) {
-                queue.push(depId);
-            }
-        }
-    }
-    // Check for cycles (not all nodes processed)
-    if (sorted.length < activeGraph.size) {
-        const cycleNodes = [];
-        for (const [id, degree] of inDegree.entries()) {
-            if (degree > 0) {
-                cycleNodes.push(id);
-            }
-        }
-        return {
-            order: sorted,
-            warning: 'Cycle detected: some WUs have circular dependencies',
-            cycleNodes,
-        };
-    }
-    return sorted;
-}
-/**
- * Find the critical path (longest dependency chain) in the graph.
- * Uses dynamic programming on the DAG to find the longest path.
- * Excludes done WUs from the path.
- *
- * @param {Map} graph - Dependency graph
- * @returns {{path: string[], length: number, warning?: string}} Critical path info
- */
-export function criticalPath(graph) {
-    const activeGraph = filterActiveGraph(graph);
-    if (activeGraph.size === 0) {
-        return { path: [], length: 0 };
-    }
-    // First, get topological order
-    const topoResult = topologicalSort(graph);
-    // Handle cycle case
-    if (!Array.isArray(topoResult)) {
-        return {
-            path: [],
-            length: 0,
-            warning: topoResult.warning,
-        };
-    }
-    // Distance and predecessor maps for longest path
-    const distance = new Map();
-    const predecessor = new Map();
-    // Initialise distances
-    for (const id of topoResult) {
-        distance.set(id, 1); // Each node has length 1
-        predecessor.set(id, null);
-    }
-    // Process in topological order
-    for (const current of topoResult) {
-        const node = activeGraph.get(current);
-        if (!node)
-            continue;
-        // Update distances for dependents
-        for (const depId of node.blocks) {
-            if (!activeGraph.has(depId))
-                continue;
-            const newDistance = (distance.get(current) ?? 0) + 1;
-            if (newDistance > (distance.get(depId) ?? 0)) {
-                distance.set(depId, newDistance);
-                predecessor.set(depId, current);
-            }
-        }
-    }
-    // Find the node with maximum distance
-    let maxDistance = 0;
-    let endNode = null;
-    for (const [id, dist] of distance.entries()) {
-        if (dist > maxDistance) {
-            maxDistance = dist;
-            endNode = id;
-        }
-    }
-    // Reconstruct path
-    const path = [];
-    let current = endNode;
-    while (current !== null) {
-        path.unshift(current);
-        current = predecessor.get(current) ?? null;
-    }
-    return {
-        path,
-        length: path.length,
-    };
-}
-/**
- * Calculate the impact score for a WU.
- * Impact score is the count of all downstream dependents (recursive).
- * Excludes done WUs from the count.
- *
- * @param {Map} graph - Dependency graph
- * @param {string} wuId - WU ID to score
- * @returns {number} Count of downstream dependents
- */
-export function impactScore(graph, wuId) {
-    const activeGraph = filterActiveGraph(graph);
-    if (!activeGraph.has(wuId)) {
-        return 0;
-    }
-    // BFS to count all downstream dependents
-    const visited = new Set();
-    const queue = [wuId];
-    visited.add(wuId);
-    while (queue.length > 0) {
-        const current = queue.shift();
-        if (!current) {
-            continue;
-        }
-        const node = activeGraph.get(current);
-        if (!node)
-            continue;
-        for (const depId of node.blocks) {
-            if (!visited.has(depId) && activeGraph.has(depId)) {
-                visited.add(depId);
-                queue.push(depId);
-            }
-        }
-    }
-    // Score is count minus 1 (exclude the starting node)
-    return visited.size - 1;
-}
-/**
- * Find the top N bottleneck WUs by impact score.
- * A bottleneck is a WU that blocks many other WUs.
- * Excludes done WUs from results.
- *
- * @param {Map} graph - Dependency graph
- * @param {number} limit - Maximum number of bottlenecks to return
- * @returns {Array<{id: string, score: number, title?: string}>} Bottlenecks sorted by score descending
- */
-export function bottlenecks(graph, limit) {
-    const activeGraph = filterActiveGraph(graph);
-    if (activeGraph.size === 0) {
-        return [];
-    }
-    // Calculate impact score for each active WU
-    const scores = [];
-    for (const [id, node] of activeGraph.entries()) {
-        const score = impactScore(graph, id);
-        scores.push({
-            id,
-            score,
-            title: node.title,
-        });
-    }
-    // Sort by score descending
-    scores.sort((a, b) => b.score - a.score);
-    // Return top N
-    return scores.slice(0, limit);
-}
-// =============================================================================
-// Helper Functions
-// =============================================================================
-/**
- * Truncate string with ellipsis.
- *
- * @param {string} str - String to truncate
- * @param {number} maxLen - Maximum length
- * @returns {string} Truncated string
- */
-function truncate(str, maxLen) {
-    if (!str)
-        return '';
-    return str.length > maxLen ? `${str.substring(0, maxLen - 3)}...` : str;
-}
-//# sourceMappingURL=dependency-graph.js.map

package/dist/dependency-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dependency-graph.js","sourceRoot":"","sources":["../src/dependency-graph.ts"],"names":[],"mappings":"AAAA,iCAAiC;AACjC,yCAAyC;AAEzC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AAClE,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC/D,OAAO,EAAE,YAAY,EAAiB,MAAM,qBAAqB,CAAC;AA8BlE,MAAM,gBAAgB,GAAG;IACvB,IAAI,EAAE,SAAS,CAAC,IAAI;IACpB,WAAW,EAAE,SAAS,CAAC,WAAW;IAClC,KAAK,EAAE,SAAS,CAAC,KAAK;IACtB,OAAO,EAAE,SAAS,CAAC,OAAO;CAClB,CAAC;AAsBX,SAAS,aAAa,CAAC,KAAc;IACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC;AAC7E,CAAC;AAED,SAAS,gBAAgB,CAAC,EAAU,EAAE,GAAU;IAC9C,OAAO;QACL,EAAE;QACF,KAAK,EAAE,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;QACrD,MAAM,EAAE,OAAO,GAAG,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;QAC/D,MAAM,EAAE,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;QACjC,SAAS,EAAE,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC;KACzC,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,MAAc;IACnC,OAAO,CACL,MAAM,KAAK,gBAAgB,CAAC,IAAI;QAChC,MAAM,KAAK,gBAAgB,CAAC,WAAW;QACvC,MAAM,KAAK,gBAAgB,CAAC,KAAK;QACjC,MAAM,KAAK,gBAAgB,CAAC,OAAO,CACpC,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAsB;IAClD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE;YACjB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI,CAAC,SAAS;SAC3B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AAEH;;;;GAIG;AACH,MAAM,UAAU,oBAAoB;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAoB,IAAI,GAAG,EAAE,CAAC;IAEzC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,MAAM,CACrC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAC1D,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAElC,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAU,CAAC;YAC1C,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,qBAAqB;QACvB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB;IAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAoB,IAAI,GAAG,EAAE,CAAC;IAEzC,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;QAE1F,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,CAAS,EAAkC,EAAE;YACjF,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACrC,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAElC,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,CAAC,MAAM,WAAW,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAU,CAAC;gBACvD,OAAO,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACnC,CAAC;YAAC,MAAM,CAAC;gBACP,qBAAqB;gBACrB,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,MAAM,EAAE,CAAC;gBACX,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,yDAAyD;IAC3D,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAsB,EACtB,IAAY,EACZ,QAAQ,GAAG,EAAE;IAEb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAA+B,EAAE,CAAC;IAE9C,SAAS,QAAQ,CAAC,EAAU,EAAE,KAAa,EAAE,SAAmB;QAC9D,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QAChD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEhB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3D,QAAQ,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1B,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAsB,EACtB,IAAY,EACZ,QAAQ,GAAG,EAAE;IAEb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAA+B,EAAE,CAAC;IAE9C,SAAS,QAAQ,CAAC,EAAU,EAAE,KAAa,EAAE,SAAmB;QAC9D,IAAI,KAAK,GAAG,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QAChD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEhB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3D,QAAQ,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,QAAQ,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1B,OAAO,MAAM,CAAC;AAChB,CAAC;AAYD;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CACzB,KAAsB,EACtB,MAAc,EACd,UAA8B,EAAE;IAEhC,MAAM,EAAE,SAAS,GAAG,MAAM,EAAE,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;IAC5D,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAE/B,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,iBAAiB,MAAM,EAAE,CAAC;IACnC,CAAC;IAED,SAAS;IACT,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,KAAK,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IACrD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,wBAAwB;IACxB,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QAC/C,MAAM,QAAQ,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAClE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;YACzC,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;gBACvD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACtC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,OAAO,GAAG,CAAC,EAAE,KAAK,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC;YAC3D,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACjD,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACpE,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACnC,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;gBACvD,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACtC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,OAAO,GAAG,CAAC,EAAE,KAAK,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC;YAC3D,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,WAAW,GAAG,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9D,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;QAClD,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;AAC7C,CAAC;AAcD;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAsB,EAAE,UAAgC,EAAE;IACtF,MAAM,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;IAClE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,KAAK,GAAkB,EAAE,CAAC;IAEhC,0BAA0B;IAC1B,IAAI,MAAM,EAAE,CAAC;QACX,uBAAuB;QACvB,MAAM,QAAQ,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAClE,MAAM,UAAU,GAAG,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEpE,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACvC,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,aAAa;QACb,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7C,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAClB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACvC,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,KAAK,CAAC,IAAI,CAAC,aAAa,SAAS,EAAE,CAAC,CAAC;IAErC,+BAA+B;IAC/B,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC5C,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,KAAK,MAAM,KAAK,UAAU,QAAQ,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,QAAQ;IACR,KAAK,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,KAAK,EAAE,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,OAAO,IAAI,QAAQ,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,iBAAiB;IACjB,KAAK,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;IAC5D,KAAK,CAAC,IAAI,CAAC,sDAAsD,CAAC,CAAC;IACnE,KAAK,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;IAC7D,KAAK,CAAC,IAAI,CAAC,kDAAkD,CAAC,CAAC;IAE/D,gBAAgB;IAChB,MAAM,YAAY,GAAkC;QAClD,IAAI,EAAE,EAAE;QACR,WAAW,EAAE,EAAE;QACf,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;KACZ,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,IAAI,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;QAC7D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,aAAa,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,KAAsB;IAKlD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACrC,MAAM,OAAO,GAAyC,EAAE,CAAC;IAEzD,8BAA8B;IAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,qFAAqF;IACrF,MAAM,WAAW,GAAG,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC;IAE9D,OAAO;QACL,QAAQ,EAAE,WAAW,CAAC,QAAQ;QAC9B,MAAM,EAAE,WAAW,CAAC,MAAM;QAC1B,OAAO;KACR,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,qCAAqC;AACrC,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,iBAAiB,CAAC,KAAsB;IAC/C,MAAM,WAAW,GAAoB,IAAI,GAAG,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACzC,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE,CAAC;YACnC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,yBAAyB,CAChC,WAA4B,EAC5B,SAA0B,EAC1B,IAAoB;IAEpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,8BAA8B;QAC9B,0EAA0E;QAC1E,eAAe;QACf,yDAAyD;QACzD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACrC,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,IAAI,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3E,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE7C,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,0DAA0D;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,uDAAuD;QACvD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,oDAAoD;IACpD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,SAAS;QACX,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAErB,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,mCAAmC;QACnC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEtC,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAE/B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,6CAA6C;IAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC;QACrC,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9C,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO;YACL,KAAK,EAAE,MAAM;YACb,OAAO,EAAE,qDAAqD;YAC9D,UAAU;SACX,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAAC,KAAsB;IACjD,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE7C,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACjC,CAAC;IAED,+BAA+B;IAC/B,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAE1C,oBAAoB;IACpB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/B,OAAO;YACL,IAAI,EAAE,EAAE;YACR,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,UAAU,CAAC,OAAO;SAC5B,CAAC;IACJ,CAAC;IAED,iDAAiD;IACjD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAyB,CAAC;IAErD,uBAAuB;IACvB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,yBAAyB;QAC9C,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,kCAAkC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAEtC,MAAM,WAAW,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACrD,IAAI,WAAW,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAC7C,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;gBACjC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,OAAO,GAAkB,IAAI,CAAC;IAClC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,IAAI,IAAI,GAAG,WAAW,EAAE,CAAC;YACvB,WAAW,GAAG,IAAI,CAAC;YACnB,OAAO,GAAG,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAG,OAAO,CAAC;IACtB,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IAC7C,CAAC;IAED,OAAO;QACL,IAAI;QACJ,MAAM,EAAE,IAAI,CAAC,MAAM;KACpB,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,KAAsB,EAAE,IAAY;IAC9D,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE7C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,yCAAyC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,CAAC;IAC/B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAElB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,KAAsB,EAAE,KAAa;IAC/D,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAE7C,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,4CAA4C;IAC5C,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,IAAI,CAAC;YACV,EAAE;YACF,KAAK;YACL,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC,CAAC;IACL,CAAC;IAED,2BAA2B;IAC3B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEzC,eAAe;IACf,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,QAAQ,CAAC,GAAuB,EAAE,MAAc;IACvD,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IACpB,OAAO,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;AAC1E,CAAC"}

package/dist/dependency-guard.d.ts

@@ -1,41 +0,0 @@
-/**
- * pnpm subcommands that mutate dependencies.
- *
- * These commands modify package.json, pnpm-lock.yaml, and/or node_modules.
- * Running them on main checkout violates worktree isolation.
- *
- * Includes both full names and shorthand aliases:
- * - add: Add packages to dependencies
- * - install/i: Install packages from lockfile
- * - remove/rm/uninstall: Remove packages from dependencies
- * - update/up: Update packages to latest
- */
-export declare const DEPENDENCY_MUTATING_COMMANDS: string[];
-/**
- * Check if a command is a dependency-mutating pnpm command.
- *
- * @param {string|null|undefined} command - Command string to check
- * @returns {boolean} True if the command mutates dependencies
- *
- * @example
- * isDependencyMutatingCommand('pnpm add react'); // true
- * isDependencyMutatingCommand('pnpm run test'); // false
- * isDependencyMutatingCommand('npm install'); // false (not pnpm)
- */
-export declare function isDependencyMutatingCommand(command: UnsafeAny): boolean;
-/**
- * Build a blocking message for dependency-mutating commands on main.
- *
- * @param {string} command - The blocked command
- * @returns {string} Formatted error message with guidance
- *
- * @example
- * const message = buildDependencyBlockMessage('pnpm add react');
- * // Returns multi-line message with guidance
- */
-export declare function buildDependencyBlockMessage(command: UnsafeAny): string;
-/**
- * Log prefix for dependency guard output
- */
-export declare const DEPS_LOG_PREFIX = "[deps-guard]";
-//# sourceMappingURL=dependency-guard.d.ts.map

package/dist/dependency-guard.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"dependency-guard.d.ts","sourceRoot":"","sources":["../src/dependency-guard.ts"],"names":[],"mappings":"AAoBA;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,4BAA4B,UASxC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAAE,SAAS,WA2C7D;AAED;;;;;;;;;GASG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAAE,SAAS,UA6C7D;AAED;;GAEG;AACH,eAAO,MAAM,eAAe,iBAAiB,CAAC"}