@gitgov/core 1.0.1 → 1.0.2

package/dist/src/diagram_generator/relationship_analyzer.js

@@ -1,381 +0,0 @@
-import { GraphValidator } from './graph_validator';
-export class CircularDependencyError extends Error {
-    constructor(message) {
-        super(message);
-        this.name = 'CircularDependencyError';
-    }
-}
-export class RelationshipAnalyzer {
-    /**
-     * Analyzes relationships between cycles and tasks to build a complete graph
-     */
-    analyzeRelationships(cycles, tasks) {
-        // Validate record integrity using specialized validator
-        GraphValidator.validateRecordIntegrity(cycles, tasks);
-        const rawGraph = this.buildRawGraph(cycles, tasks);
-        const cleanGraph = this.processAndValidateGraph(rawGraph);
-        return this.createRelationshipGraph(rawGraph, cleanGraph);
-    }
-    /**
-     * Builds the initial graph with potential duplicates
-     */
-    buildRawGraph(cycles, tasks) {
-        const rawNodes = this.buildNodes(cycles, tasks);
-        const rawEdges = this.buildEdges(cycles, tasks, rawNodes);
-        return { nodes: rawNodes, edges: rawEdges };
-    }
-    /**
-     * Processes raw graph to remove duplicates and validate structure
-     */
-    processAndValidateGraph(rawGraph) {
-        // Detect and report duplicates as warnings
-        this.reportDuplicateWarnings(rawGraph.nodes, rawGraph.edges);
-        // Deduplicate nodes and edges
-        const nodes = this.deduplicateNodes(rawGraph.nodes);
-        const edges = this.deduplicateEdges(rawGraph.edges);
-        // Detect circular dependencies
-        this.detectCircularDependencies(edges);
-        return { nodes, edges };
-    }
-    /**
-     * Creates the final RelationshipGraph with metadata
-     */
-    createRelationshipGraph(rawGraph, cleanGraph) {
-        return {
-            nodes: cleanGraph.nodes,
-            edges: cleanGraph.edges,
-            metadata: {
-                nodeCount: cleanGraph.nodes.length,
-                edgeCount: cleanGraph.edges.length,
-                generatedAt: new Date().toISOString(),
-                duplicatesRemoved: {
-                    nodes: rawGraph.nodes.length - cleanGraph.nodes.length,
-                    edges: rawGraph.edges.length - cleanGraph.edges.length,
-                },
-            },
-        };
-    }
-    /**
-     * Generates clean node ID for Mermaid syntax (removes timestamp, converts hyphens)
-     */
-    generateNodeId(record) {
-        return record.id
-            .replace(/^\d+-/, '') // Remove timestamp prefix
-            .replace(/-/g, '_'); // Convert hyphens to underscores
-    }
-    /**
-     * Builds all nodes from cycles and tasks
-     */
-    buildNodes(cycles, tasks) {
-        const nodes = [];
-        // Add cycle nodes
-        for (const cycle of cycles) {
-            nodes.push({
-                id: this.generateNodeId(cycle),
-                type: 'cycle',
-                title: cycle.title,
-                status: cycle.status,
-                tags: cycle.tags || [],
-                originalId: cycle.id,
-            });
-        }
-        // Add task nodes (both epic and regular)
-        for (const task of tasks) {
-            const isEpic = this.isEpicTask(task);
-            // Use title field for task display
-            const title = task.title || 'Untitled Task';
-            nodes.push({
-                id: this.generateNodeId(task),
-                type: isEpic ? 'epic-task' : 'task',
-                title,
-                status: task.status,
-                tags: task.tags,
-                originalId: task.id,
-            });
-        }
-        return nodes;
-    }
-    /**
-     * Builds all hierarchical edges from protocol relationships
-     */
-    buildEdges(cycles, _tasks, nodes) {
-        const edges = [];
-        const nodeMap = new Map(nodes.map(n => [n.originalId, n.id]));
-        // Build cycle -> child cycle relationships
-        for (const cycle of cycles) {
-            if (cycle.childCycleIds) {
-                for (const childId of cycle.childCycleIds) {
-                    const fromId = nodeMap.get(cycle.id);
-                    const toId = nodeMap.get(childId);
-                    if (fromId && toId) {
-                        edges.push({
-                            from: fromId,
-                            to: toId,
-                            type: 'hierarchy',
-                        });
-                    }
-                }
-            }
-            // Build cycle -> task relationships  
-            if (cycle.taskIds) {
-                for (const taskId of cycle.taskIds) {
-                    const fromId = nodeMap.get(cycle.id);
-                    const toId = nodeMap.get(taskId);
-                    if (fromId && toId) {
-                        edges.push({
-                            from: fromId,
-                            to: toId,
-                            type: 'hierarchy',
-                        });
-                    }
-                }
-            }
-        }
-        return edges;
-    }
-    /**
-     * Checks if a task is an epic based on tags
-     */
-    isEpicTask(task) {
-        return task.tags?.some(tag => tag.startsWith('epic:')) ?? false;
-    }
-    /**
-     * Detects circular dependencies in the graph
-     */
-    detectCircularDependencies(edges) {
-        const graph = new Map();
-        // Build adjacency list
-        for (const edge of edges) {
-            if (!graph.has(edge.from)) {
-                graph.set(edge.from, []);
-            }
-            graph.get(edge.from).push(edge.to);
-        }
-        // DFS to detect cycles with path tracking
-        const visited = new Set();
-        const recursionStack = new Set();
-        const path = [];
-        for (const node of graph.keys()) {
-            if (!visited.has(node)) {
-                const cyclePath = this.findCycleDFS(node, graph, visited, recursionStack, path);
-                if (cyclePath.length > 0) {
-                    const cycleDescription = this.formatCycleError(cyclePath);
-                    throw new CircularDependencyError(cycleDescription);
-                }
-            }
-        }
-    }
-    /**
-     * DFS helper for circular dependency detection with path tracking
-     */
-    findCycleDFS(node, graph, visited, recursionStack, path) {
-        visited.add(node);
-        recursionStack.add(node);
-        path.push(node);
-        const neighbors = graph.get(node) || [];
-        for (const neighbor of neighbors) {
-            if (!visited.has(neighbor)) {
-                const cyclePath = this.findCycleDFS(neighbor, graph, visited, recursionStack, path);
-                if (cyclePath.length > 0) {
-                    return cyclePath;
-                }
-            }
-            else if (recursionStack.has(neighbor)) {
-                // Found a cycle - extract the cycle path
-                const cycleStartIndex = path.indexOf(neighbor);
-                return path.slice(cycleStartIndex).concat([neighbor]);
-            }
-        }
-        recursionStack.delete(node);
-        path.pop();
-        return [];
-    }
-    /**
-     * Formats a circular dependency error with helpful context
-     */
-    formatCycleError(cyclePath) {
-        const cycleNodes = cyclePath.slice(0, -1); // Remove duplicate at end
-        const nodeNames = cycleNodes.map(nodeId => {
-            // Try to extract readable name from node ID
-            const cleanId = nodeId.replace(/^(cycle_|task_)/, '').replace(/_/g, '-');
-            return cleanId;
-        });
-        let message = `Circular dependency detected in GitGovernance entities:\n\n`;
-        message += `🔄 Dependency Cycle:\n`;
-        for (let i = 0; i < cycleNodes.length; i++) {
-            const current = nodeNames[i];
-            const next = nodeNames[(i + 1) % nodeNames.length];
-            message += `   ${current} → ${next}\n`;
-        }
-        message += `\n💡 To fix this issue:\n`;
-        message += `   1. Review the childCycleIds in these cycle files:\n`;
-        cycleNodes.forEach(nodeId => {
-            const cleanId = nodeId.replace(/^cycle_/, '').replace(/_/g, '-');
-            message += `      - .gitgov/cycles/${cleanId}.json\n`;
-        });
-        message += `   2. Remove one of the circular references to break the cycle\n`;
-        message += `   3. Consider if the dependency relationship is actually needed\n`;
-        return message;
-    }
-    /**
-     * Reports duplicate nodes and edges as console warnings
-     */
-    reportDuplicateWarnings(nodes, edges) {
-        // Analyze node duplicates
-        const nodeCount = new Map();
-        for (const node of nodes) {
-            const current = nodeCount.get(node.id) || { count: 0, sources: [] };
-            current.count++;
-            current.sources.push(node.originalId);
-            nodeCount.set(node.id, current);
-        }
-        const duplicateNodes = Array.from(nodeCount.entries())
-            .filter(([_, data]) => data.count > 1);
-        // Analyze edge duplicates
-        const edgeCount = new Map();
-        for (const edge of edges) {
-            const edgeKey = `${edge.from}->${edge.to}`;
-            edgeCount.set(edgeKey, (edgeCount.get(edgeKey) || 0) + 1);
-        }
-        const duplicateEdges = Array.from(edgeCount.entries())
-            .filter(([_, count]) => count > 1);
-        // Report warnings if duplicates found
-        if (duplicateNodes.length > 0 || duplicateEdges.length > 0) {
-            console.warn('\n⚠️  GitGovernance Data Quality Warnings:');
-            if (duplicateNodes.length > 0) {
-                console.warn('\n📦 Duplicate Nodes Detected:');
-                duplicateNodes.forEach(([id, data]) => {
-                    const cleanSources = [...new Set(data.sources)]; // Remove duplicate sources
-                    console.warn(`   • ${id} (appears ${data.count} times)`);
-                    if (cleanSources.length > 1) {
-                        console.warn(`     Sources: ${cleanSources.join(', ')}`);
-                        console.warn(`     💡 Fix: Check for duplicate cycle/task IDs in .gitgov/ files`);
-                    }
-                    else {
-                        console.warn(`     Source: ${cleanSources[0]} (same ID referenced multiple times)`);
-                        console.warn(`     💡 Fix: Check for duplicate childCycleIds/taskIds references`);
-                    }
-                });
-            }
-            if (duplicateEdges.length > 0) {
-                console.warn('\n🔗 Duplicate Edges Detected:');
-                duplicateEdges.forEach(([edge, count]) => {
-                    console.warn(`   • ${edge} (appears ${count} times)`);
-                });
-                console.warn('     💡 Fix: Check for duplicate references in childCycleIds/taskIds arrays');
-            }
-            console.warn('\n✂️  Auto-deduplication: Duplicates will be removed from the generated diagram');
-            console.warn('📋 Recommendation: Run `gitgov lint` to identify and fix data quality issues\n');
-        }
-    }
-    /**
-     * Removes duplicate nodes based on their ID (O(n) performance)
-     */
-    deduplicateNodes(nodes) {
-        const nodeMap = new Map();
-        // Use Map to automatically handle deduplication while preserving first occurrence
-        for (const node of nodes) {
-            if (!nodeMap.has(node.id)) {
-                nodeMap.set(node.id, node);
-            }
-        }
-        return Array.from(nodeMap.values());
-    }
-    /**
-     * Removes duplicate edges based on from-to combination (O(n) performance)
-     */
-    deduplicateEdges(edges) {
-        const edgeMap = new Map();
-        for (const edge of edges) {
-            const edgeKey = `${edge.from}->${edge.to}`;
-            if (!edgeMap.has(edgeKey)) {
-                edgeMap.set(edgeKey, edge);
-            }
-        }
-        return Array.from(edgeMap.values());
-    }
-    /**
-     * Detects and reports duplicate nodes/edges for diagnostic purposes
-     * Useful for testing and debugging data quality issues
-     */
-    detectDuplicates(cycles, tasks) {
-        const rawNodes = this.buildNodes(cycles, tasks);
-        const rawEdges = this.buildEdges(cycles, tasks, rawNodes);
-        // Analyze node duplicates
-        const nodeCount = new Map();
-        for (const node of rawNodes) {
-            const current = nodeCount.get(node.id) || { count: 0, sources: [] };
-            current.count++;
-            current.sources.push(node.originalId);
-            nodeCount.set(node.id, current);
-        }
-        const duplicateNodes = Array.from(nodeCount.entries())
-            .filter(([_, data]) => data.count > 1)
-            .map(([id, data]) => ({ id, count: data.count, sources: data.sources }));
-        // Analyze edge duplicates
-        const edgeCount = new Map();
-        for (const edge of rawEdges) {
-            const edgeKey = `${edge.from}->${edge.to}`;
-            edgeCount.set(edgeKey, (edgeCount.get(edgeKey) || 0) + 1);
-        }
-        const duplicateEdges = Array.from(edgeCount.entries())
-            .filter(([_, count]) => count > 1)
-            .map(([edge, count]) => ({ edge, count }));
-        return { duplicateNodes, duplicateEdges };
-    }
-    /**
-     * Filters cycles and tasks based on specified criteria
-     */
-    filterEntities(cycles, tasks, filters) {
-        let filteredCycles = [...cycles];
-        let filteredTasks = [...tasks];
-        // Filter by specific cycle ID
-        if (filters.cycleId) {
-            const targetCycle = cycles.find(c => c.id === filters.cycleId);
-            if (targetCycle) {
-                // Include the target cycle and its related entities
-                const relatedCycleIds = new Set([filters.cycleId]);
-                const relatedTaskIds = new Set();
-                // Recursively add all descendant cycles
-                const addDescendantCycles = (cycleId) => {
-                    const cycle = cycles.find(c => c.id === cycleId);
-                    if (cycle?.childCycleIds) {
-                        cycle.childCycleIds.forEach(childId => {
-                            if (!relatedCycleIds.has(childId)) {
-                                relatedCycleIds.add(childId);
-                                addDescendantCycles(childId); // Recursive call
-                            }
-                        });
-                    }
-                };
-                // Start recursive traversal from target cycle
-                addDescendantCycles(filters.cycleId);
-                // Add tasks from all related cycles
-                cycles.forEach(cycle => {
-                    if (relatedCycleIds.has(cycle.id) && cycle.taskIds) {
-                        cycle.taskIds.forEach(taskId => relatedTaskIds.add(taskId));
-                    }
-                });
-                filteredCycles = cycles.filter(c => relatedCycleIds.has(c.id));
-                filteredTasks = tasks.filter(t => relatedTaskIds.has(t.id));
-            }
-        }
-        // Filter by specific task ID
-        if (filters.taskId) {
-            const targetTask = tasks.find(t => t.id === filters.taskId);
-            if (targetTask) {
-                filteredTasks = [targetTask];
-                // Find cycles that contain this task
-                filteredCycles = cycles.filter(c => c.taskIds && c.taskIds.includes(filters.taskId));
-            }
-        }
-        // Filter by package name (using tags)
-        if (filters.packageName) {
-            const packageTag = `package:${filters.packageName}`;
-            filteredCycles = filteredCycles.filter(c => c.tags && c.tags.includes(packageTag));
-            filteredTasks = filteredTasks.filter(t => t.tags && t.tags.includes(packageTag));
-        }
-        return { filteredCycles, filteredTasks };
-    }
-}
-//# sourceMappingURL=relationship_analyzer.js.map

package/dist/src/diagram_generator/relationship_analyzer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"relationship_analyzer.js","sourceRoot":"","sources":["../../../src/diagram_generator/relationship_analyzer.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AA+BnD,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChD,YAAY,OAAe;QACzB,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,yBAAyB,CAAC;IACxC,CAAC;CACF;AAED,MAAM,OAAO,oBAAoB;IAE/B;;OAEG;IACH,oBAAoB,CAAC,MAAqB,EAAE,KAAmB;QAC7D,wDAAwD;QACxD,cAAc,CAAC,uBAAuB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAE1D,OAAO,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,MAAqB,EAAE,KAAmB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1D,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,QAAwD;QACtF,2CAA2C;QAC3C,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QAE7D,8BAA8B;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAEpD,+BAA+B;QAC/B,IAAI,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACK,uBAAuB,CAC7B,QAAwD,EACxD,UAA0D;QAE1D,OAAO;YACL,KAAK,EAAE,UAAU,CAAC,KAAK;YACvB,KAAK,EAAE,UAAU,CAAC,KAAK;YACvB,QAAQ,EAAE;gBACR,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC,MAAM;gBAClC,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC,MAAM;gBAClC,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACrC,iBAAiB,EAAE;oBACjB,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM;oBACtD,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM;iBACvD;aACF;SACF,CAAC;IACJ,CAAC;IAID;;OAEG;IACH,cAAc,CAAC,MAAgC;QAC7C,OAAO,MAAM,CAAC,EAAE;aACb,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,0BAA0B;aAC/C,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAG,iCAAiC;IAC5D,CAAC;IAID;;OAEG;IACK,UAAU,CAAC,MAAqB,EAAE,KAAmB;QAC3D,MAAM,KAAK,GAAkB,EAAE,CAAC;QAEhC,kBAAkB;QAClB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;gBAC9B,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;gBACtB,UAAU,EAAE,KAAK,CAAC,EAAE;aACrB,CAAC,CAAC;QACL,CAAC;QAED,yCAAyC;QACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAErC,mCAAmC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,eAAe,CAAC;YAE5C,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBAC7B,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM;gBACnC,KAAK;gBACL,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,UAAU,EAAE,IAAI,CAAC,EAAE;aACpB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,MAAqB,EAAE,MAAoB,EAAE,KAAoB;QAClF,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE9D,2CAA2C;QAC3C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;gBACxB,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;oBAC1C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBACrC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBAElC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;wBACnB,KAAK,CAAC,IAAI,CAAC;4BACT,IAAI,EAAE,MAAM;4BACZ,EAAE,EAAE,IAAI;4BACR,IAAI,EAAE,WAAW;yBAClB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;YAED,sCAAsC;YACtC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;oBACnC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBACrC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAEjC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;wBACnB,KAAK,CAAC,IAAI,CAAC;4BACT,IAAI,EAAE,MAAM;4BACZ,EAAE,EAAE,IAAI;4BACR,IAAI,EAAE,WAAW;yBAClB,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,IAAgB;QACjC,OAAO,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC;IAClE,CAAC;IAED;;OAEG;IACK,0BAA0B,CAAC,KAAoB;QACrD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;QAE1C,uBAAuB;QACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC3B,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtC,CAAC;QAED,0CAA0C;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;gBAChF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;oBAC1D,MAAM,IAAI,uBAAuB,CAAC,gBAAgB,CAAC,CAAC;gBACtD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,IAAY,EACZ,KAA4B,EAC5B,OAAoB,EACpB,cAA2B,EAC3B,IAAc;QAEd,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;gBACpF,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,OAAO,SAAS,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,yCAAyC;gBACzC,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QAED,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,SAAmB;QAC1C,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,0BAA0B;QACrE,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YACxC,4CAA4C;YAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACzE,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,CAAC;QAEH,IAAI,OAAO,GAAG,6DAA6D,CAAC;QAC5E,OAAO,IAAI,wBAAwB,CAAC;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;YACnD,OAAO,IAAI,MAAM,OAAO,MAAM,IAAI,IAAI,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,2BAA2B,CAAC;QACvC,OAAO,IAAI,wDAAwD,CAAC;QACpE,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACjE,OAAO,IAAI,0BAA0B,OAAO,SAAS,CAAC;QACxD,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,kEAAkE,CAAC;QAC9E,OAAO,IAAI,oEAAoE,CAAC;QAEhF,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,uBAAuB,CAAC,KAAoB,EAAE,KAAoB;QACxE,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgD,CAAC;QAC1E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YACpE,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACnD,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAEzC,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC3C,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACnD,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAErC,sCAAsC;QACtC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3D,OAAO,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;YAE3D,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC/C,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE;oBACpC,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,2BAA2B;oBAC5E,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,aAAa,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC;oBACzD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC5B,OAAO,CAAC,IAAI,CAAC,iBAAiB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACzD,OAAO,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;oBACpF,CAAC;yBAAM,CAAC;wBACN,OAAO,CAAC,IAAI,CAAC,gBAAgB,YAAY,CAAC,CAAC,CAAC,sCAAsC,CAAC,CAAC;wBACpF,OAAO,CAAC,IAAI,CAAC,mEAAmE,CAAC,CAAC;oBACpF,CAAC;gBACH,CAAC,CAAC,CAAC;YACL,CAAC;YAED,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC/C,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE;oBACvC,OAAO,CAAC,IAAI,CAAC,QAAQ,IAAI,aAAa,KAAK,SAAS,CAAC,CAAC;gBACxD,CAAC,CAAC,CAAC;gBACH,OAAO,CAAC,IAAI,CAAC,6EAA6E,CAAC,CAAC;YAC9F,CAAC;YAED,OAAO,CAAC,IAAI,CAAC,iFAAiF,CAAC,CAAC;YAChG,OAAO,CAAC,IAAI,CAAC,gFAAgF,CAAC,CAAC;QACjG,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAoB;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE/C,kFAAkF;QAClF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAoB;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAE/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,MAAqB,EAAE,KAAmB;QAIzD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAE1D,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAgD,CAAC;QAC1E,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YACpE,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAClC,CAAC;QAED,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACnD,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;aACrC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAE3E,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;YAC3C,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACnD,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;aACjC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAE7C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,cAAc,CACZ,MAAqB,EACrB,KAAmB,EACnB,OAIC;QAED,IAAI,cAAc,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QACjC,IAAI,aAAa,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAE/B,8BAA8B;QAC9B,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;YAC/D,IAAI,WAAW,EAAE,CAAC;gBAChB,oDAAoD;gBACpD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;gBACnD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;gBAEzC,wCAAwC;gBACxC,MAAM,mBAAmB,GAAG,CAAC,OAAe,EAAE,EAAE;oBAC9C,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC;oBACjD,IAAI,KAAK,EAAE,aAAa,EAAE,CAAC;wBACzB,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;4BACpC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gCAClC,eAAe,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gCAC7B,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB;4BACjD,CAAC;wBACH,CAAC,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC,CAAC;gBAEF,8CAA8C;gBAC9C,mBAAmB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAErC,oCAAoC;gBACpC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;oBACrB,IAAI,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;wBACnD,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;oBAC9D,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/D,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5D,IAAI,UAAU,EAAE,CAAC;gBACf,aAAa,GAAG,CAAC,UAAU,CAAC,CAAC;gBAE7B,qCAAqC;gBACrC,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACjC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAO,CAAC,CACjD,CAAC;YACJ,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,MAAM,UAAU,GAAG,WAAW,OAAO,CAAC,WAAW,EAAE,CAAC;YAEpD,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACzC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CACtC,CAAC;YAEF,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACvC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CACtC,CAAC;QACJ,CAAC;QAED,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,CAAC;IAC3C,CAAC;CACF"}

package/dist/src/event_bus/event_bus.d.ts

@@ -1,110 +0,0 @@
-import type { BaseEvent, GitGovEvent, EventHandler, EventSubscription } from './types';
-/**
- * Event Stream interface - Contract for both Local and Global bus implementations
- */
-export interface IEventStream {
-    /**
-     * Publish an event to the bus
-     */
-    publish(event: BaseEvent): void;
-    /**
-     * Subscribe to events of a specific type
-     */
-    subscribe<T extends BaseEvent = BaseEvent>(eventType: string, handler: EventHandler<T>): EventSubscription;
-    /**
-     * Unsubscribe from events
-     */
-    unsubscribe(subscriptionId: string): boolean;
-    /**
-     * Get all active subscriptions
-     */
-    getSubscriptions(): EventSubscription[];
-    /**
-     * Clear all subscriptions (for testing/cleanup)
-     */
-    clearSubscriptions(): void;
-}
-/**
- * Local EventBus implementation using Node.js EventEmitter
- *
- * This is the "Free Tier" implementation that operates in-memory
- * and provides synchronous event delivery for local-first usage.
- *
- * Design Principles:
- * - Decoupled Producers: Adapters emit events without knowing consumers
- * - Pluggable Consumers: Event handlers can be added/removed dynamically
- * - Type Safety: Full TypeScript support for all event types
- * - Performance: In-memory delivery with minimal overhead
- */
-export declare class EventBus implements IEventStream {
-    private emitter;
-    private subscriptions;
-    constructor();
-    /**
-     * Publish an event to all subscribers
-     *
-     * @param event - The event to publish
-     */
-    publish(event: BaseEvent): void;
-    /**
-     * Subscribe to events of a specific type
-     *
-     * @param eventType - The event type to subscribe to
-     * @param handler - The handler function to call when event is received
-     * @returns EventSubscription object with subscription details
-     */
-    subscribe<T extends BaseEvent = BaseEvent>(eventType: string, handler: EventHandler<T>): EventSubscription;
-    /**
-     * Unsubscribe from events
-     *
-     * @param subscriptionId - The subscription ID to remove
-     * @returns true if subscription was found and removed, false otherwise
-     */
-    unsubscribe(subscriptionId: string): boolean;
-    /**
-     * Get all active subscriptions
-     *
-     * @returns Array of all active subscriptions
-     */
-    getSubscriptions(): EventSubscription[];
-    /**
-     * Clear all subscriptions (for testing/cleanup)
-     */
-    clearSubscriptions(): void;
-    /**
-     * Get subscription count for a specific event type
-     *
-     * @param eventType - The event type to count subscribers for
-     * @returns Number of active subscriptions for the event type
-     */
-    getSubscriptionCount(eventType: string): number;
-    /**
-     * Get all event types that have active subscriptions
-     *
-     * @returns Array of event types with active subscriptions
-     */
-    getActiveEventTypes(): string[];
-    /**
-     * Subscribe to all events (wildcard subscription)
-     * Useful for debugging, monitoring, or logging
-     *
-     * @param handler - Handler that will receive all events
-     * @returns EventSubscription object
-     */
-    subscribeToAll(handler: EventHandler<BaseEvent>): EventSubscription;
-}
-/**
- * Singleton instance for application-wide event bus usage
- */
-export declare const eventBus: EventBus;
-/**
- * Type-safe event publisher helper
- * Ensures events conform to GitGovEvent union type
- */
-export declare function publishEvent(event: GitGovEvent): void;
-/**
- * Type-safe event subscriber helper
- * Provides better TypeScript inference for specific event types
- */
-export declare function subscribeToEvent<T extends GitGovEvent>(eventType: T['type'], handler: EventHandler<T>): EventSubscription;
-//# sourceMappingURL=event_bus.d.ts.map

package/dist/src/event_bus/event_bus.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"event_bus.d.ts","sourceRoot":"","sources":["../../../src/event_bus/event_bus.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,SAAS,EACT,WAAW,EACX,YAAY,EACZ,iBAAiB,EAClB,MAAM,SAAS,CAAC;AAOjB;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAAC;IAEhC;;OAEG;IACH,SAAS,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS,EACvC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GACvB,iBAAiB,CAAC;IAErB;;OAEG;IACH,WAAW,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO,CAAC;IAE7C;;OAEG;IACH,gBAAgB,IAAI,iBAAiB,EAAE,CAAC;IAExC;;OAEG;IACH,kBAAkB,IAAI,IAAI,CAAC;CAC5B;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,QAAS,YAAW,YAAY;IAC3C,OAAO,CAAC,OAAO,CAAe;IAC9B,OAAO,CAAC,aAAa,CAAiC;;IAUtD;;;;OAIG;IACH,OAAO,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI;IAqB/B;;;;;;OAMG;IACH,SAAS,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS,EACvC,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GACvB,iBAAiB;IAiCpB;;;;;OAKG;IACH,WAAW,CAAC,cAAc,EAAE,MAAM,GAAG,OAAO;IAe5C;;;;OAIG;IACH,gBAAgB,IAAI,iBAAiB,EAAE;IAIvC;;OAEG;IACH,kBAAkB,IAAI,IAAI;IAK1B;;;;;OAKG;IACH,oBAAoB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAI/C;;;;OAIG;IACH,mBAAmB,IAAI,MAAM,EAAE;IAI/B;;;;;;OAMG;IACH,cAAc,CAAC,OAAO,EAAE,YAAY,CAAC,SAAS,CAAC,GAAG,iBAAiB;CAGpE;AAED;;GAEG;AACH,eAAO,MAAM,QAAQ,UAAiB,CAAC;AAEvC;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI,CAErD;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,WAAW,EACpD,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,EACpB,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GACvB,iBAAiB,CAEnB"}

package/dist/src/event_bus/event_bus.js

@@ -1,161 +0,0 @@
-import { EventEmitter } from 'events';
-// Generate unique subscription IDs
-function generateSubscriptionId() {
-    return `subscription:${Date.now()}-${Math.random().toString(36).substr(2, 9)}`;
-}
-/**
- * Local EventBus implementation using Node.js EventEmitter
- *
- * This is the "Free Tier" implementation that operates in-memory
- * and provides synchronous event delivery for local-first usage.
- *
- * Design Principles:
- * - Decoupled Producers: Adapters emit events without knowing consumers
- * - Pluggable Consumers: Event handlers can be added/removed dynamically
- * - Type Safety: Full TypeScript support for all event types
- * - Performance: In-memory delivery with minimal overhead
- */
-export class EventBus {
-    emitter;
-    subscriptions;
-    constructor() {
-        this.emitter = new EventEmitter();
-        this.subscriptions = new Map();
-        // Increase max listeners for high-throughput scenarios
-        this.emitter.setMaxListeners(100);
-    }
-    /**
-     * Publish an event to all subscribers
-     *
-     * @param event - The event to publish
-     */
-    publish(event) {
-        // Validate event structure
-        if (!event.type || typeof event.type !== 'string') {
-            throw new Error('Event must have a valid type string');
-        }
-        if (!event.timestamp || typeof event.timestamp !== 'number') {
-            throw new Error('Event must have a valid timestamp number');
-        }
-        if (!event.source || typeof event.source !== 'string') {
-            throw new Error('Event must have a valid source string');
-        }
-        // Emit the event
-        this.emitter.emit(event.type, event);
-        // Also emit on wildcard for debugging/monitoring
-        this.emitter.emit('*', event);
-    }
-    /**
-     * Subscribe to events of a specific type
-     *
-     * @param eventType - The event type to subscribe to
-     * @param handler - The handler function to call when event is received
-     * @returns EventSubscription object with subscription details
-     */
-    subscribe(eventType, handler) {
-        // Generate unique subscription ID
-        const subscriptionId = generateSubscriptionId();
-        // Wrap handler to catch errors and provide context
-        const wrappedHandler = async (event) => {
-            try {
-                await handler(event);
-            }
-            catch (error) {
-                console.error(`Error in event handler for ${eventType}:`, error);
-                // In production, this could emit an error event or log to monitoring
-            }
-        };
-        // Create subscription object (store wrapped handler for unsubscribing)
-        const subscription = {
-            id: subscriptionId,
-            eventType,
-            handler: wrappedHandler, // Store wrapped handler
-            metadata: {
-                createdAt: Date.now()
-            }
-        };
-        // Register with EventEmitter
-        this.emitter.on(eventType, wrappedHandler);
-        // Store subscription for management
-        this.subscriptions.set(subscriptionId, subscription);
-        return subscription;
-    }
-    /**
-     * Unsubscribe from events
-     *
-     * @param subscriptionId - The subscription ID to remove
-     * @returns true if subscription was found and removed, false otherwise
-     */
-    unsubscribe(subscriptionId) {
-        const subscription = this.subscriptions.get(subscriptionId);
-        if (!subscription) {
-            return false;
-        }
-        // Remove from EventEmitter
-        this.emitter.removeListener(subscription.eventType, subscription.handler);
-        // Remove from our tracking
-        this.subscriptions.delete(subscriptionId);
-        return true;
-    }
-    /**
-     * Get all active subscriptions
-     *
-     * @returns Array of all active subscriptions
-     */
-    getSubscriptions() {
-        return Array.from(this.subscriptions.values());
-    }
-    /**
-     * Clear all subscriptions (for testing/cleanup)
-     */
-    clearSubscriptions() {
-        this.emitter.removeAllListeners();
-        this.subscriptions.clear();
-    }
-    /**
-     * Get subscription count for a specific event type
-     *
-     * @param eventType - The event type to count subscribers for
-     * @returns Number of active subscriptions for the event type
-     */
-    getSubscriptionCount(eventType) {
-        return this.emitter.listenerCount(eventType);
-    }
-    /**
-     * Get all event types that have active subscriptions
-     *
-     * @returns Array of event types with active subscriptions
-     */
-    getActiveEventTypes() {
-        return this.emitter.eventNames();
-    }
-    /**
-     * Subscribe to all events (wildcard subscription)
-     * Useful for debugging, monitoring, or logging
-     *
-     * @param handler - Handler that will receive all events
-     * @returns EventSubscription object
-     */
-    subscribeToAll(handler) {
-        return this.subscribe('*', handler);
-    }
-}
-/**
- * Singleton instance for application-wide event bus usage
- */
-export const eventBus = new EventBus();
-/**
- * Type-safe event publisher helper
- * Ensures events conform to GitGovEvent union type
- */
-export function publishEvent(event) {
-    eventBus.publish(event);
-}
-/**
- * Type-safe event subscriber helper
- * Provides better TypeScript inference for specific event types
- */
-export function subscribeToEvent(eventType, handler) {
-    return eventBus.subscribe(eventType, handler);
-}
-//# sourceMappingURL=event_bus.js.map