@jokerized/getresearchdone 0.4.1

package/dist/lib/deps.js

@@ -0,0 +1,630 @@
+'use strict';
+Object.defineProperty(exports, "__esModule", { value: true });
+const fs = require('fs');
+const path = require('path');
+const { output, error: _depsError, findPhaseInternal } = require('./utils');
+const { analyzeRoadmap } = require('./roadmap');
+// ─── parseDependsOn ──────────────────────────────────────────────────────────
+/**
+ * Parse a raw depends_on string from ROADMAP.md into an array of phase number strings.
+ * @param dependsOnStr - Raw depends_on string (e.g., "Phase 27, Phase 29", "Nothing", null)
+ * @returns Array of phase number strings (e.g., ['27', '29']), or [] if no dependencies
+ */
+function parseDependsOn(dependsOnStr) {
+    if (!dependsOnStr || typeof dependsOnStr !== 'string' || dependsOnStr.trim() === '') {
+        return [];
+    }
+    // "Nothing" (case-insensitive) means no dependencies
+    if (/nothing/i.test(dependsOnStr)) {
+        return [];
+    }
+    // Extract all "Phase N" or "Phase N.M" references
+    const matches = [];
+    const regex = /Phase\s+(\d+(?:\.\d+)?)/gi;
+    let m;
+    while ((m = regex.exec(dependsOnStr)) !== null) {
+        matches.push(m[1]);
+    }
+    return matches;
+}
+// ─── buildDependencyGraph ────────────────────────────────────────────────────
+/**
+ * Build a dependency graph from an array of phase objects.
+ * @param phases - Phase objects from roadmap analysis
+ * @returns Dependency graph with typed nodes and edges
+ */
+function buildDependencyGraph(phases) {
+    const nodeIds = new Set(phases.map((p) => p.number));
+    const nodes = phases.map((p) => ({
+        id: p.number,
+        name: p.name,
+    }));
+    const edges = [];
+    for (const phase of phases) {
+        const deps = parseDependsOn(phase.depends_on);
+        for (const dep of deps) {
+            // Only include edges where the dependency exists in the node set
+            if (nodeIds.has(dep)) {
+                edges.push({ from: dep, to: phase.number });
+            }
+        }
+    }
+    return { nodes, edges };
+}
+// ─── computeParallelGroups ───────────────────────────────────────────────────
+/**
+ * Compute parallel execution groups via Kahn's algorithm (topological sort by levels).
+ * Each group contains phases that can run concurrently because all their
+ * dependencies have been satisfied in previous groups.
+ * @param graph - Dependency graph
+ * @returns Array of arrays, each inner array is a set of phase IDs that can run together
+ */
+function computeParallelGroups(graph) {
+    if (graph.nodes.length === 0) {
+        return [];
+    }
+    // Build adjacency list and in-degree map
+    const adjacency = new Map(); // from -> [to]
+    const inDegree = new Map();
+    for (const node of graph.nodes) {
+        adjacency.set(node.id, []);
+        inDegree.set(node.id, 0);
+    }
+    for (const edge of graph.edges) {
+        adjacency.get(edge.from).push(edge.to);
+        inDegree.set(edge.to, (inDegree.get(edge.to) || 0) + 1);
+    }
+    const groups = [];
+    const remaining = new Set(graph.nodes.map((n) => n.id));
+    while (remaining.size > 0) {
+        // Collect nodes with in-degree 0 among remaining nodes
+        const group = [];
+        for (const nodeId of remaining) {
+            if (inDegree.get(nodeId) === 0) {
+                group.push(nodeId);
+            }
+        }
+        if (group.length === 0) {
+            // All remaining nodes have dependencies -- cycle exists
+            // Return what we have (caller should use detectCycle separately)
+            break;
+        }
+        // Sort component-wise to avoid parseFloat('1.10') === parseFloat('1.1') collision
+        group.sort((a, b) => {
+            const pa = a.split('.').map(Number);
+            const pb = b.split('.').map(Number);
+            for (let i = 0; i < Math.max(pa.length, pb.length); i++) {
+                const d = (pa[i] ?? 0) - (pb[i] ?? 0);
+                if (d !== 0)
+                    return d;
+            }
+            return 0;
+        });
+        groups.push(group);
+        // Remove current group's nodes and decrement in-degrees
+        for (const nodeId of group) {
+            remaining.delete(nodeId);
+            for (const dependent of adjacency.get(nodeId)) {
+                if (remaining.has(dependent)) {
+                    inDegree.set(dependent, inDegree.get(dependent) - 1);
+                }
+            }
+        }
+    }
+    return groups;
+}
+// ─── detectCycle ─────────────────────────────────────────────────────────────
+/**
+ * Detect cycles in a dependency graph using DFS.
+ * @param graph - Dependency graph
+ * @returns Cycle path array if cycle found (e.g., ['27', '28', '27']), or null if acyclic
+ */
+function detectCycle(graph) {
+    // Build adjacency list (forward edges: from -> [to])
+    const adjacency = new Map();
+    for (const node of graph.nodes) {
+        adjacency.set(node.id, []);
+    }
+    for (const edge of graph.edges) {
+        adjacency.get(edge.from).push(edge.to);
+    }
+    // Node states: 0 = unvisited, 1 = visiting (in current DFS path), 2 = visited
+    const state = new Map();
+    for (const node of graph.nodes) {
+        state.set(node.id, 0);
+    }
+    // Track the DFS path for cycle reconstruction
+    const pathStack = [];
+    function dfs(nodeId) {
+        state.set(nodeId, 1); // visiting
+        pathStack.push(nodeId);
+        for (const neighbor of adjacency.get(nodeId)) {
+            if (state.get(neighbor) === 1) {
+                // Found a back-edge -- reconstruct cycle
+                const cycleStart = pathStack.indexOf(neighbor);
+                const cyclePath = pathStack.slice(cycleStart);
+                cyclePath.push(neighbor); // close the cycle
+                return cyclePath;
+            }
+            if (state.get(neighbor) === 0) {
+                const result = dfs(neighbor);
+                if (result)
+                    return result;
+            }
+        }
+        pathStack.pop();
+        state.set(nodeId, 2); // visited
+        return null;
+    }
+    for (const node of graph.nodes) {
+        if (state.get(node.id) === 0) {
+            const cycle = dfs(node.id);
+            if (cycle)
+                return cycle;
+        }
+    }
+    return null;
+}
+// ─── cmdPhaseAnalyzeDeps ─────────────────────────────────────────────────────
+/**
+ * CLI command: Analyze phase dependencies from ROADMAP.md, build graph, compute parallel groups.
+ * Calls analyzeRoadmap(cwd) internally to reuse roadmap parsing (including depends_on extraction).
+ * @param cwd - Project working directory
+ * @param raw - Output raw text instead of JSON
+ * @returns void — outputs JSON or raw text to stdout via the output helper
+ */
+function cmdPhaseAnalyzeDeps(cwd, raw) {
+    const roadmapResult = analyzeRoadmap(cwd);
+    // Handle missing roadmap or error
+    if (roadmapResult.error || !roadmapResult.phases || roadmapResult.phases.length === 0) {
+        output({ error: roadmapResult.error || 'ROADMAP.md not found or empty' }, raw);
+        return;
+    }
+    const phases = roadmapResult.phases;
+    const graph = buildDependencyGraph(phases);
+    const cycle = detectCycle(graph);
+    if (cycle) {
+        const result = {
+            error: 'Circular dependency detected',
+            cycle_path: cycle,
+            has_cycle: true,
+            nodes: graph.nodes,
+            edges: graph.edges,
+        };
+        output(result, raw, `Circular dependency detected: ${cycle.join(' → ')}`);
+        return;
+    }
+    const parallelGroups = computeParallelGroups(graph);
+    const result = {
+        nodes: graph.nodes,
+        edges: graph.edges,
+        parallel_groups: parallelGroups,
+        has_cycle: false,
+        phase_count: graph.nodes.length,
+        group_count: parallelGroups.length,
+    };
+    output(result, raw, `${graph.nodes.length} phases, ${parallelGroups.length} parallel groups`);
+}
+// ─── buildArtifactDAG ────────────────────────────────────────────────────────
+/**
+ * Build a directed artifact dependency graph from an array of plan artifacts.
+ *
+ * 1. Constructs a providers map: artifact_name → plan_id (first declaration wins).
+ * 2. Builds ArtifactDAGNode[] from each plan's provides/requires/integration_points.
+ * 3. Builds ArtifactDAGEdge[]: for each requires/integration_points entry, look up
+ *    the provider and create a directed edge (consumer → producer).
+ *    Integration edges are only created when a matching provider exists.
+ * 4. Runs Kahn's algorithm to produce a topologically sorted execution order.
+ *
+ * @param plans - Array of plan artifacts parsed from PLAN.md frontmatter
+ * @returns ArtifactDAG with nodes, edges, sorted_plans, and providers map
+ */
+function buildArtifactDAG(plans) {
+    // Step 1: Build providers map — first declaration wins
+    const providers = {};
+    for (const plan of plans) {
+        const planId = `${plan.phase}-${String(plan.plan).padStart(2, '0')}`;
+        for (const artifact of plan.provides) {
+            if (!(artifact in providers)) {
+                providers[artifact] = planId;
+            }
+        }
+    }
+    // Step 2: Build nodes
+    const nodes = plans.map((plan) => ({
+        id: `${plan.phase}-${String(plan.plan).padStart(2, '0')}`,
+        plan_number: plan.plan,
+        provides: plan.provides,
+        requires: plan.requires,
+        integration_points: plan.integration_points,
+    }));
+    // Step 3: Build edges
+    const edges = [];
+    const missing_requires = [];
+    for (const node of nodes) {
+        // Hard dependency edges from requires
+        for (const artifact of node.requires) {
+            const providerPlanId = providers[artifact];
+            if (providerPlanId === undefined) {
+                missing_requires.push(artifact);
+            }
+            else if (providerPlanId !== node.id) {
+                edges.push({
+                    from_plan: node.id,
+                    to_plan: providerPlanId,
+                    artifact,
+                    type: 'requires',
+                });
+            }
+        }
+        // Soft dependency edges from integration_points (only when provider exists)
+        for (const artifact of node.integration_points) {
+            const providerPlanId = providers[artifact];
+            if (providerPlanId !== undefined && providerPlanId !== node.id) {
+                edges.push({
+                    from_plan: node.id,
+                    to_plan: providerPlanId,
+                    artifact,
+                    type: 'integration',
+                });
+            }
+        }
+    }
+    // Step 4: Kahn's topological sort
+    // adjacency: producer → [consumers] (edge from_plan depends on to_plan,
+    // so to_plan must come before from_plan; in Kahn's terms: to_plan → from_plan)
+    const adjacency = new Map();
+    const inDegree = new Map();
+    for (const node of nodes) {
+        adjacency.set(node.id, []);
+        inDegree.set(node.id, 0);
+    }
+    for (const edge of edges) {
+        // to_plan must execute before from_plan → edge in sort graph: to_plan → from_plan
+        const producers = adjacency.get(edge.to_plan);
+        if (producers !== undefined) {
+            producers.push(edge.from_plan);
+        }
+        inDegree.set(edge.from_plan, (inDegree.get(edge.from_plan) ?? 0) + 1);
+    }
+    const sorted_plans = [];
+    const remaining = new Set(nodes.map((n) => n.id));
+    while (remaining.size > 0) {
+        const batch = [];
+        for (const nodeId of remaining) {
+            if ((inDegree.get(nodeId) ?? 0) === 0) {
+                batch.push(nodeId);
+            }
+        }
+        if (batch.length === 0) {
+            // Cycle prevents full sort — return partial (validateArtifactDAG will catch this)
+            break;
+        }
+        // Sort lexicographically for deterministic output (plan IDs are string slugs, not numeric)
+        batch.sort();
+        for (const nodeId of batch) {
+            sorted_plans.push(nodeId);
+            remaining.delete(nodeId);
+            for (const dependent of adjacency.get(nodeId)) {
+                if (remaining.has(dependent)) {
+                    inDegree.set(dependent, inDegree.get(dependent) - 1);
+                }
+            }
+        }
+    }
+    return { nodes, edges, sorted_plans, providers, missing_requires };
+}
+// ─── validateArtifactDAG ─────────────────────────────────────────────────────
+/**
+ * Validate an ArtifactDAG for cycles, missing dependencies, unused provides, and duplicates.
+ *
+ * 1. Cycle detection via DFS: walks the requires/integration dependency graph, collecting
+ *    all distinct cycles found (not just the first).
+ * 2. Missing dependency detection: for each plan's requires, checks if dag.providers has
+ *    a matching entry.
+ * 3. Unused provides warning: for each artifact in providers, checks if any plan requires
+ *    or integrates it.
+ * 4. Duplicate provides warning: when multiple plans declare the same provides entry.
+ *
+ * @param dag - The artifact DAG to validate
+ * @param plans - Original plan artifacts (for duplicate provides detection)
+ * @returns ArtifactDAGValidation with valid flag, cycles, missing_deps, and warnings
+ */
+function validateArtifactDAG(dag, plans) {
+    const cycles = [];
+    const missing_deps = [];
+    const warnings = [];
+    // Step 1: Cycle detection via DFS on the dependency graph
+    // Build adjacency: from_plan → [to_plan] (consumer → producer)
+    const cycleAdj = new Map();
+    for (const node of dag.nodes) {
+        cycleAdj.set(node.id, []);
+    }
+    for (const edge of dag.edges) {
+        const neighbors = cycleAdj.get(edge.from_plan);
+        if (neighbors !== undefined) {
+            neighbors.push(edge.to_plan);
+        }
+    }
+    // DFS state: 0 = unvisited, 1 = visiting, 2 = visited
+    const state = new Map();
+    for (const node of dag.nodes) {
+        state.set(node.id, 0);
+    }
+    const pathStack = [];
+    const seenCycles = new Set();
+    function dfsCollect(nodeId) {
+        state.set(nodeId, 1);
+        pathStack.push(nodeId);
+        for (const neighbor of (cycleAdj.get(nodeId) ?? [])) {
+            if (state.get(neighbor) === 1) {
+                // Found a back-edge — reconstruct and deduplicate the cycle
+                const cycleStart = pathStack.indexOf(neighbor);
+                const cyclePath = [...pathStack.slice(cycleStart), neighbor];
+                // Canonical form: rotate so lexicographically smallest node is first
+                const minIdx = cyclePath.slice(0, -1).reduce((best, id, idx) => (id < cyclePath[best] ? idx : best), 0);
+                const canonical = [
+                    ...cyclePath.slice(minIdx, -1),
+                    ...cyclePath.slice(0, minIdx),
+                    cyclePath[minIdx],
+                ];
+                const key = canonical.join(',');
+                if (!seenCycles.has(key)) {
+                    seenCycles.add(key);
+                    cycles.push(canonical);
+                }
+            }
+            else if (state.get(neighbor) === 0) {
+                dfsCollect(neighbor);
+            }
+        }
+        pathStack.pop();
+        state.set(nodeId, 2);
+    }
+    for (const node of dag.nodes) {
+        if (state.get(node.id) === 0) {
+            dfsCollect(node.id);
+        }
+    }
+    // Step 2: Missing dependency detection
+    for (const node of dag.nodes) {
+        for (const artifact of node.requires) {
+            if (!(artifact in dag.providers)) {
+                missing_deps.push({ plan: node.id, artifact });
+            }
+        }
+    }
+    // Step 3: Unused provides warning
+    // Collect all referenced artifacts across all plans
+    const referencedArtifacts = new Set();
+    for (const node of dag.nodes) {
+        for (const a of node.requires) {
+            referencedArtifacts.add(a);
+        }
+        for (const a of node.integration_points) {
+            referencedArtifacts.add(a);
+        }
+    }
+    for (const artifact of Object.keys(dag.providers)) {
+        if (!referencedArtifacts.has(artifact)) {
+            warnings.push(`Unused provides: "${artifact}" (provided by ${dag.providers[artifact]}, not required by any plan)`);
+        }
+    }
+    // Step 4: Duplicate provides warning
+    const providerCount = new Map(); // artifact → [plan_ids]
+    for (const plan of plans) {
+        const planId = `${plan.phase}-${String(plan.plan).padStart(2, '0')}`;
+        for (const artifact of plan.provides) {
+            const existing = providerCount.get(artifact);
+            if (existing !== undefined) {
+                existing.push(planId);
+            }
+            else {
+                providerCount.set(artifact, [planId]);
+            }
+        }
+    }
+    for (const [artifact, planIds] of providerCount) {
+        if (planIds.length > 1) {
+            warnings.push(`Duplicate provides: "${artifact}" declared by ${planIds.join(', ')} (first provider wins)`);
+        }
+    }
+    return {
+        valid: cycles.length === 0 && missing_deps.length === 0,
+        cycles,
+        missing_deps,
+        warnings,
+    };
+}
+// ─── cmdPhaseDepsVisualize ───────────────────────────────────────────────────
+/**
+ * Render a phase dependency graph as a Mermaid flowchart or ASCII tree.
+ *
+ * Reads ROADMAP.md for the project, builds the dependency graph using the same
+ * Kahn's algorithm as cmdPhaseAnalyzeDeps, then formats for human consumption.
+ *
+ * Mermaid format: valid `flowchart LR` block (paste into any Mermaid renderer).
+ * ASCII format: indented tree showing parallel groups.
+ *
+ * @param cwd - Project working directory
+ * @param opts - Options: milestone (override), format ('mermaid' | 'ascii')
+ * @param raw - Output raw text instead of JSON
+ */
+function cmdPhaseDepsVisualize(cwd, opts, raw) {
+    const roadmapResult = analyzeRoadmap(cwd);
+    if (roadmapResult.error || !roadmapResult.phases || roadmapResult.phases.length === 0) {
+        output({ error: roadmapResult.error || 'ROADMAP.md not found or empty' }, raw);
+        return;
+    }
+    let phases = roadmapResult.phases;
+    // Apply milestone filter if specified (match phase names containing milestone string)
+    const milestoneFilter = opts.milestone;
+    if (milestoneFilter) {
+        phases = phases.filter((p) => p.name.toLowerCase().includes(milestoneFilter.toLowerCase()) ||
+            String(p.number).startsWith(milestoneFilter));
+        if (phases.length === 0) {
+            output({ error: `No phases found matching milestone "${milestoneFilter}"` }, raw);
+            return;
+        }
+    }
+    const graph = buildDependencyGraph(phases);
+    const cycle = detectCycle(graph);
+    const parallelGroups = computeParallelGroups(graph);
+    const format = opts.format || 'mermaid';
+    let diagram;
+    if (format === 'ascii') {
+        const lines = [`Phase Dependency Graph (${graph.nodes.length} phases, ${parallelGroups.length} groups)`];
+        lines.push('');
+        parallelGroups.forEach((group, i) => {
+            lines.push(`Group ${i + 1} [parallel]:`);
+            for (const id of group) {
+                const node = graph.nodes.find((n) => n.id === id);
+                const deps = graph.edges.filter((e) => e.to === id).map((e) => e.from);
+                const depStr = deps.length > 0 ? ` ← depends on: ${deps.join(', ')}` : '';
+                lines.push(`  Phase ${id}: ${node?.name || ''}${depStr}`);
+            }
+        });
+        if (cycle) {
+            lines.push('');
+            lines.push(`⚠ Cycle detected: ${cycle.join(' → ')}`);
+        }
+        diagram = lines.join('\n');
+    }
+    else {
+        // Mermaid flowchart LR
+        const lines = ['flowchart LR'];
+        for (const node of graph.nodes) {
+            const label = `Phase ${node.id}: ${node.name.replace(/"/g, "'")}`;
+            lines.push(`  ${_mermaidId(node.id)}["${label}"]`);
+        }
+        for (const edge of graph.edges) {
+            lines.push(`  ${_mermaidId(edge.from)} --> ${_mermaidId(edge.to)}`);
+        }
+        if (cycle) {
+            lines.push(`  %% WARNING: cycle detected ${cycle.join(' -> ')}`);
+        }
+        diagram = lines.join('\n');
+    }
+    output({
+        format,
+        phase_count: graph.nodes.length,
+        group_count: parallelGroups.length,
+        has_cycle: Boolean(cycle),
+        cycle_path: cycle ?? null,
+        diagram,
+    }, raw, diagram);
+}
+/** Sanitize a phase ID for use as a Mermaid node identifier. */
+function _mermaidId(id) {
+    return `ph${id.replace(/\./g, '_')}`;
+}
+/**
+ * Read all *-PLAN.md files in phaseDir and group them by their `wave` frontmatter field.
+ * Returns an array of wave groups sorted by wave number, each group containing the plan entries.
+ * Plans without a wave field are assigned to wave 1.
+ *
+ * @param phaseDir - Path to the phase directory containing PLAN.md files
+ * @returns Array of wave groups: [{wave, plans: PlanWaveEntry[]}]
+ */
+function buildWaves(phaseDir) {
+    let files;
+    try {
+        files = fs.readdirSync(phaseDir).filter((f) => f.endsWith('-PLAN.md') || f === 'PLAN.md').sort();
+    }
+    catch {
+        return [];
+    }
+    const waveMap = new Map();
+    for (const file of files) {
+        const content = (() => {
+            try {
+                return fs.readFileSync(path.join(phaseDir, file), 'utf-8');
+            }
+            catch {
+                return null;
+            }
+        })();
+        if (!content)
+            continue;
+        const fmMatch = content.match(/^---\n([\s\S]*?)\n---/);
+        const fm = fmMatch ? fmMatch[1] : '';
+        const waveMatch = fm.match(/^wave:\s*(\d+)/m);
+        const waveNum = waveMatch ? parseInt(waveMatch[1], 10) : 1;
+        const agentMatch = fm.match(/^agent_type:\s*(.+)$/m);
+        const agentType = agentMatch ? agentMatch[1].trim() : 'grd-executor';
+        const filesMatch = fm.match(/^files_modified:\s*\[([^\]]*)\]/m);
+        const targetFiles = filesMatch
+            ? filesMatch[1].split(',').map((f) => f.trim()).filter(Boolean)
+            : [];
+        const entry = { plan_file: file, wave: waveNum, agent_type: agentType, target_files: targetFiles };
+        const bucket = waveMap.get(waveNum) ?? [];
+        bucket.push(entry);
+        waveMap.set(waveNum, bucket);
+    }
+    return Array.from(waveMap.entries())
+        .sort(([a], [b]) => a - b)
+        .map(([wave, plans]) => ({ wave, plans }));
+}
+// Effort-to-token band map for the dry-run preview.
+const EFFORT_TOKEN_BANDS = {
+    high: '~200K tokens',
+    medium: '~80K tokens',
+    low: '~30K tokens',
+};
+/**
+ * CLI command: Dry-run preview of gd execute-phase <N>.
+ * Reads plan files, groups by wave, and prints a wave table without spawning agents.
+ *
+ * @param cwd - Project working directory
+ * @param phase - Phase number/name
+ * @param raw - Output raw text instead of JSON
+ */
+function cmdExecutePhaseDryRun(cwd, phase, raw) {
+    const phaseInfo = findPhaseInternal(cwd, phase);
+    if (!phaseInfo || !phaseInfo.found) {
+        _depsError(`Phase ${phase} not found`);
+    }
+    const waves = buildWaves(path.join(cwd, phaseInfo.directory));
+    if (waves.length === 0) {
+        output({ dry_run: true, wave_count: 0, waves: [] }, raw, 'No plan files found in phase directory');
+        return;
+    }
+    const rows = waves.map(({ wave, plans }) => ({
+        wave,
+        agent_count: plans.length,
+        agents: plans.map((p) => ({
+            plan_file: p.plan_file,
+            agent_type: p.agent_type,
+            estimated_tokens: EFFORT_TOKEN_BANDS['medium'],
+            target_files: p.target_files,
+        })),
+    }));
+    if (raw) {
+        const lines = [`Dry-run: Phase ${phase} — ${waves.length} wave(s), ${waves.reduce((s, w) => s + w.plans.length, 0)} plan(s)\n`];
+        for (const row of rows) {
+            lines.push(`Wave ${row.wave} (${row.agent_count} agent${row.agent_count !== 1 ? 's' : ''}):`);
+            for (const a of row.agents) {
+                const files = a.target_files.length > 0 ? ` → ${a.target_files.join(', ')}` : '';
+                lines.push(`  ${a.plan_file} [${a.agent_type}] ${a.estimated_tokens}${files}`);
+            }
+        }
+        output({ dry_run: true, wave_count: waves.length, waves: rows }, raw, lines.join('\n'));
+    }
+    else {
+        output({ dry_run: true, phase, wave_count: waves.length, waves: rows }, raw, `${waves.length} waves, ${waves.reduce((s, w) => s + w.plans.length, 0)} plans`);
+    }
+}
+// ─── Exports ─────────────────────────────────────────────────────────────────
+module.exports = {
+    parseDependsOn,
+    buildDependencyGraph,
+    computeParallelGroups,
+    detectCycle,
+    cmdPhaseAnalyzeDeps,
+    cmdPhaseDepsVisualize,
+    buildArtifactDAG,
+    validateArtifactDAG,
+    buildWaves,
+    cmdExecutePhaseDryRun,
+};
+//# sourceMappingURL=deps.js.map

package/dist/lib/deps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deps.js","sourceRoot":"","sources":["../../lib/deps.ts"],"names":[],"mappings":"AAAA,YAAY,CAAC;;AAcb,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAwB,CAAC;AAChD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAA0B,CAAC;AACtD,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,iBAAiB,EAAE,GAAG,OAAO,CAAC,SAAS,CAIzE,CAAC;AACF,MAAM,EAAE,cAAc,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;AA4BhD,gFAAgF;AAEhF;;;;GAIG;AACH,SAAS,cAAc,CAAC,YAAuC;IAC7D,IAAI,CAAC,YAAY,IAAI,OAAO,YAAY,KAAK,QAAQ,IAAI,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACpF,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,qDAAqD;IACrD,IAAI,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;QAClC,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,kDAAkD;IAClD,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,2BAA2B,CAAC;IAC1C,IAAI,CAAyB,CAAC;IAC9B,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC/C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,gFAAgF;AAEhF;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,MAAoB;IAChD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAE7D,MAAM,KAAK,GAAqB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,EAAE,EAAE,CAAC,CAAC,MAAM;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;KACb,CAAC,CAAC,CAAC;IAEJ,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,iEAAiE;YACjE,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,qBAAqB,CAAC,KAAsB;IACnD,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,yCAAyC;IACzC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,eAAe;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhE,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,uDAAuD;QACvD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;YAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,wDAAwD;YACxD,iEAAiE;YACjE,MAAM;QACR,CAAC;QAED,kFAAkF;QAClF,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAClB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC;oBAAE,OAAO,CAAC,CAAC;YACxB,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEnB,wDAAwD;QACxD,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzB,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAa,EAAE,CAAC;gBAC1D,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC7B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAY,GAAG,CAAC,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAEhF;;;;GAIG;AACH,SAAS,WAAW,CAAC,KAAsB;IACzC,qDAAqD;IACrD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAc,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,8EAA8E;IAC9E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,8CAA8C;IAC9C,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,SAAS,GAAG,CAAC,MAAc;QACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW;QACjC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEvB,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAa,EAAE,CAAC;YACzD,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,yCAAyC;gBACzC,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBAC9C,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAAkB;gBAC5C,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC7B,IAAI,MAAM;oBAAE,OAAO,MAAM,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,SAAS,CAAC,GAAG,EAAE,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,mBAAmB,CAAC,GAAW,EAAE,GAAY;IACpD,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAGvC,CAAC;IAEF,kCAAkC;IAClC,IAAI,aAAa,CAAC,KAAK,IAAI,CAAC,aAAa,CAAC,MAAM,IAAI,aAAa,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtF,MAAM,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,IAAI,+BAA+B,EAAE,EAAE,GAAG,CAAC,CAAC;QAC/E,OAAO;IACT,CAAC;IAED,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;IACpC,MAAM,KAAK,GAAoB,oBAAoB,CAAC,MAAM,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IAEjC,IAAI,KAAK,EAAE,CAAC;QACV,MAAM,MAAM,GAAuB;YACjC,KAAK,EAAE,8BAA8B;YACrC,UAAU,EAAE,KAAK;YACjB,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,KAAK,EAAE,KAAK,CAAC,KAAK;SACnB,CAAC;QACF,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,iCAAiC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1E,OAAO;IACT,CAAC;IAED,MAAM,cAAc,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAEpD,MAAM,MAAM,GAAuB;QACjC,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,eAAe,EAAE,cAAc;QAC/B,SAAS,EAAE,KAAK;QAChB,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;QAC/B,WAAW,EAAE,cAAc,CAAC,MAAM;KACnC,CAAC;IACF,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,YAAY,cAAc,CAAC,MAAM,kBAAkB,CAAC,CAAC;AAChG,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;;;;GAYG;AACH,SAAS,gBAAgB,CAAC,KAAqB;IAC7C,uDAAuD;IACvD,MAAM,SAAS,GAA2B,EAAE,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACrE,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,CAAC,CAAC,QAAQ,IAAI,SAAS,CAAC,EAAE,CAAC;gBAC7B,SAAS,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,MAAM,KAAK,GAAsB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACpD,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;QACzD,WAAW,EAAE,IAAI,CAAC,IAAI;QACtB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;KAC5C,CAAC,CAAC,CAAC;IAEJ,sBAAsB;IACtB,MAAM,KAAK,GAAsB,EAAE,CAAC;IACpC,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sCAAsC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;gBACjC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,cAAc,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBACtC,KAAK,CAAC,IAAI,CAAC;oBACT,SAAS,EAAE,IAAI,CAAC,EAAE;oBAClB,OAAO,EAAE,cAAc;oBACvB,QAAQ;oBACR,IAAI,EAAE,UAAU;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,4EAA4E;QAC5E,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC/C,MAAM,cAAc,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;YAC3C,IAAI,cAAc,KAAK,SAAS,IAAI,cAAc,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;gBAC/D,KAAK,CAAC,IAAI,CAAC;oBACT,SAAS,EAAE,IAAI,CAAC,EAAE;oBAClB,OAAO,EAAE,cAAc;oBACvB,QAAQ;oBACR,IAAI,EAAE,aAAa;iBACpB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,wEAAwE;IACxE,+EAA+E;IAC/E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,kFAAkF;QAClF,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjC,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1D,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBACtC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,kFAAkF;YAClF,MAAM;QACR,CAAC;QAED,2FAA2F;QAC3F,KAAK,CAAC,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;YAC3B,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1B,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACzB,KAAK,MAAM,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAa,EAAE,CAAC;gBAC1D,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC7B,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAY,GAAG,CAAC,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC;AACrE,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;;;;;;GAcG;AACH,SAAS,mBAAmB,CAAC,GAAgB,EAAE,KAAqB;IAClE,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,YAAY,GAA8C,EAAE,CAAC;IACnE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,0DAA0D;IAC1D,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,SAAS,UAAU,CAAC,MAAc;QAChC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEvB,KAAK,MAAM,QAAQ,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YACpD,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,4DAA4D;gBAC5D,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;gBAC7D,qEAAqE;gBACrE,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAC1C,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EACtD,CAAC,CACF,CAAC;gBACF,MAAM,SAAS,GAAG;oBAChB,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAC9B,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC;oBAC7B,SAAS,CAAC,MAAM,CAAC;iBAClB,CAAC;gBACF,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAChC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACpB,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,SAAS,CAAC,GAAG,EAAE,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,IAAI,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,oDAAoD;IACpD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,QAAQ,kBAAkB,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,6BAA6B,CAAC,CAAC;QACrH,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC,CAAC,wBAAwB;IAC3E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACrE,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC7C,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,aAAa,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE,CAAC;QAChD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,QAAQ,CAAC,IAAI,CAAC,wBAAwB,QAAQ,iBAAiB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QACvD,MAAM;QACN,YAAY;QACZ,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,gFAAgF;AAEhF;;;;;;;;;;;;GAYG;AACH,SAAS,qBAAqB,CAC5B,GAAW,EACX,IAA2D,EAC3D,GAAY;IAEZ,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAGvC,CAAC;IAEF,IAAI,aAAa,CAAC,KAAK,IAAI,CAAC,aAAa,CAAC,MAAM,IAAI,aAAa,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtF,MAAM,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,IAAI,+BAA+B,EAAE,EAAE,GAAG,CAAC,CAAC;QAC/E,OAAO;IACT,CAAC;IAED,IAAI,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;IAElC,sFAAsF;IACtF,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC;IACvC,IAAI,eAAe,EAAE,CAAC;QACpB,MAAM,GAAG,MAAM,CAAC,MAAM,CACpB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,eAAe,CAAC,WAAW,EAAE,CAAC;YAC5D,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CACpD,CAAC;QACF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,EAAE,KAAK,EAAE,uCAAuC,eAAe,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;YAClF,OAAO;QACT,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAoB,oBAAoB,CAAC,MAAM,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,MAAM,cAAc,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,SAAS,CAAC;IAExC,IAAI,OAAe,CAAC;IAEpB,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;QACvB,MAAM,KAAK,GAAa,CAAC,2BAA2B,KAAK,CAAC,KAAK,CAAC,MAAM,YAAY,cAAc,CAAC,MAAM,UAAU,CAAC,CAAC;QACnH,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,cAAc,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAClC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;YACzC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;gBAClD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACvE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,IAAI,EAAE,IAAI,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC,CAAC,CAAC;QACH,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,qBAAqB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;SAAM,CAAC;QACN,uBAAuB;QACvB,MAAM,KAAK,GAAa,CAAC,cAAc,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,SAAS,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAClE,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,KAAK,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,gCAAgC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,CACJ;QACE,MAAM;QACN,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;QAC/B,WAAW,EAAE,cAAc,CAAC,MAAM;QAClC,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC;QACzB,UAAU,EAAE,KAAK,IAAI,IAAI;QACzB,OAAO;KACR,EACD,GAAG,EACH,OAAO,CACR,CAAC;AACJ,CAAC;AAED,gEAAgE;AAChE,SAAS,UAAU,CAAC,EAAU;IAC5B,OAAO,KAAK,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;AACvC,CAAC;AAWD;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,QAAgB;IAClC,IAAI,KAAe,CAAC;IACpB,IAAI,CAAC;QACH,KAAK,GAAI,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAc,CAAC,MAAM,CACnD,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,SAAS,CACzD,CAAC,IAAI,EAAE,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;IAEnD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,CAAC,GAAG,EAAE;YACpB,IAAI,CAAC;gBAAC,OAAO,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,OAAO,CAAW,CAAC;YAAC,CAAC;YAAC,MAAM,CAAC;gBAAC,OAAO,IAAI,CAAC;YAAC,CAAC;QACtG,CAAC,CAAC,EAAE,CAAC;QACL,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAC;QACvD,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAErC,MAAM,SAAS,GAAG,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3D,MAAM,UAAU,GAAG,EAAE,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QAErE,MAAM,UAAU,GAAG,EAAE,CAAC,KAAK,CAAC,kCAAkC,CAAC,CAAC;QAChE,MAAM,WAAW,GAAG,UAAU;YAC5B,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC;YACvE,CAAC,CAAC,EAAE,CAAC;QAEP,MAAM,KAAK,GAAkB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,CAAC;QAClH,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;SACjC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC;AAED,oDAAoD;AACpD,MAAM,kBAAkB,GAA2B;IACjD,IAAI,EAAE,cAAc;IACpB,MAAM,EAAE,aAAa;IACrB,GAAG,EAAE,aAAa;CACnB,CAAC;AAEF;;;;;;;GAOG;AACH,SAAS,qBAAqB,CAAC,GAAW,EAAE,KAAa,EAAE,GAAY;IACrE,MAAM,SAAS,GAAG,iBAAiB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAChD,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,UAAU,CAAC,SAAS,KAAK,YAAY,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,SAAyC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC/F,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,wCAAwC,CAAC,CAAC;QACnG,OAAO;IACT,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAI;QACJ,WAAW,EAAE,KAAK,CAAC,MAAM;QACzB,MAAM,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACxB,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,gBAAgB,EAAE,kBAAkB,CAAC,QAAQ,CAAC;YAC9C,YAAY,EAAE,CAAC,CAAC,YAAY;SAC7B,CAAC,CAAC;KACJ,CAAC,CAAC,CAAC;IAEJ,IAAI,GAAG,EAAE,CAAC;QACR,MAAM,KAAK,GAAa,CAAC,kBAAkB,KAAK,MAAM,KAAK,CAAC,MAAM,aAAa,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;QAC1I,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,WAAW,SAAS,GAAG,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC9F,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjF,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,gBAAgB,GAAG,KAAK,EAAE,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QACD,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1F,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC,MAAM,WAAW,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChK,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,MAAM,CAAC,OAAO,GAAG;IACf,cAAc;IACd,oBAAoB;IACpB,qBAAqB;IACrB,WAAW;IACX,mBAAmB;IACnB,qBAAqB;IACrB,gBAAgB;IAChB,mBAAmB;IACnB,UAAU;IACV,qBAAqB;CACtB,CAAC"}

package/dist/lib/discussion.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=discussion.d.ts.map

package/dist/lib/discussion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"discussion.d.ts","sourceRoot":"","sources":["../../lib/discussion.ts"],"names":[],"mappings":""}