@skillsmith/core 0.5.4 → 0.5.6

package/dist/webhooks/WebhookQueue.js

@@ -0,0 +1,340 @@
+/**
+ * SMI-645: WebhookQueue - Queue webhook events for processing
+ *
+ * Provides:
+ * - Priority queue for webhook events
+ * - Debouncing for rapid updates to the same repository
+ * - Retry mechanism for failed processing
+ * - Processing with configurable concurrency
+ */
+import { PRIORITY_VALUES, generateDebounceKey, calculateRetryDelay } from './WebhookQueue.utils.js';
+/**
+ * Webhook event queue with priority, debouncing, and retry support
+ */
+export class WebhookQueue {
+    items = new Map();
+    processing = new Set();
+    debounceTimers = new Map();
+    isProcessing = false;
+    processingPromise = null;
+    concurrency;
+    debounceMs;
+    maxRetries;
+    retryDelayMs;
+    maxSize;
+    processor;
+    onProcessed;
+    log;
+    deadLetterSink;
+    constructor(options = {}) {
+        this.concurrency = options.concurrency ?? 2;
+        this.debounceMs = options.debounceMs ?? 5000; // 5 seconds default
+        this.maxRetries = options.maxRetries ?? 3;
+        this.retryDelayMs = options.retryDelayMs ?? 1000;
+        this.maxSize = options.maxSize ?? 1000;
+        this.processor = options.processor;
+        this.onProcessed = options.onProcessed;
+        this.log = options.onLog ?? (() => { });
+        this.deadLetterSink = options.deadLetterSink;
+    }
+    /**
+     * Add an item to the queue
+     * Returns true if added, false if debounced or queue full
+     */
+    async add(item) {
+        // Check queue size
+        if (this.items.size >= this.maxSize) {
+            this.log('warn', 'Queue full, dropping item', { id: item.id });
+            return false;
+        }
+        // Create debounce key (repo + file path)
+        const debounceKey = generateDebounceKey(item.repoFullName, item.filePath);
+        // Check if we have a pending debounce for this key
+        const existingTimer = this.debounceTimers.get(debounceKey);
+        if (existingTimer) {
+            // Cancel existing timer and update item
+            clearTimeout(existingTimer);
+            this.debounceTimers.delete(debounceKey);
+            this.log('info', 'Debouncing update', { key: debounceKey });
+        }
+        // Check if item already exists with same or newer commit
+        const existingItem = this.items.get(item.id);
+        if (existingItem && existingItem.timestamp >= item.timestamp) {
+            this.log('info', 'Item already in queue with same or newer commit', {
+                id: item.id,
+            });
+            return false;
+        }
+        // Set debounce timer
+        const timer = setTimeout(() => {
+            this.debounceTimers.delete(debounceKey);
+            this.items.set(item.id, item);
+            this.log('info', 'Item added to queue after debounce', {
+                id: item.id,
+                priority: item.priority,
+            });
+            this.triggerProcessing();
+        }, this.debounceMs);
+        this.debounceTimers.set(debounceKey, timer);
+        return true;
+    }
+    /**
+     * Add an item immediately without debouncing
+     */
+    addImmediate(item) {
+        if (this.items.size >= this.maxSize) {
+            this.log('warn', 'Queue full, dropping item', { id: item.id });
+            return false;
+        }
+        // Cancel any pending debounce
+        const debounceKey = generateDebounceKey(item.repoFullName, item.filePath);
+        const existingTimer = this.debounceTimers.get(debounceKey);
+        if (existingTimer) {
+            clearTimeout(existingTimer);
+            this.debounceTimers.delete(debounceKey);
+        }
+        this.items.set(item.id, item);
+        this.log('info', 'Item added to queue immediately', {
+            id: item.id,
+            priority: item.priority,
+        });
+        this.triggerProcessing();
+        return true;
+    }
+    /**
+     * Remove an item from the queue
+     */
+    remove(id) {
+        return this.items.delete(id);
+    }
+    /**
+     * Get the next item to process based on priority
+     */
+    getNextItem() {
+        const now = Date.now();
+        let bestItem = null;
+        let bestScore = -1;
+        for (const item of this.items.values()) {
+            // Skip if already being processed
+            if (this.processing.has(item.id)) {
+                continue;
+            }
+            // Skip if waiting for retry
+            if (item.nextRetryAt && item.nextRetryAt > now) {
+                continue;
+            }
+            // Calculate priority score
+            const priorityScore = PRIORITY_VALUES[item.priority];
+            // Prefer older items with same priority
+            const ageBonus = (now - item.timestamp) / (1000 * 60); // Minutes old
+            const score = priorityScore * 1000 + ageBonus;
+            if (score > bestScore) {
+                bestScore = score;
+                bestItem = item;
+            }
+        }
+        return bestItem;
+    }
+    /**
+     * Trigger processing if not already running
+     */
+    triggerProcessing() {
+        if (!this.processor) {
+            return;
+        }
+        if (this.isProcessing) {
+            return;
+        }
+        this.isProcessing = true;
+        this.processingPromise = this.processQueue().finally(() => {
+            this.isProcessing = false;
+            this.processingPromise = null;
+        });
+    }
+    /**
+     * Process items in the queue
+     */
+    async processQueue() {
+        while (true) {
+            // Wait for available processing slots
+            while (this.processing.size >= this.concurrency) {
+                await new Promise((resolve) => setTimeout(resolve, 100));
+            }
+            const item = this.getNextItem();
+            if (!item) {
+                // Check if there are items waiting for retry
+                const hasRetrying = Array.from(this.items.values()).some((i) => i.nextRetryAt && i.nextRetryAt > Date.now());
+                if (hasRetrying) {
+                    // Wait a bit and try again
+                    await new Promise((resolve) => setTimeout(resolve, 1000));
+                    continue;
+                }
+                // No more items to process
+                break;
+            }
+            // Process item concurrently
+            this.processing.add(item.id);
+            this.processItem(item).catch((error) => {
+                this.log('error', 'Error processing item', {
+                    id: item.id,
+                    error: error instanceof Error ? error.message : String(error),
+                });
+            });
+        }
+    }
+    /**
+     * Process a single item
+     */
+    async processItem(item) {
+        const startTime = Date.now();
+        try {
+            if (this.processor) {
+                await this.processor(item);
+            }
+            // Success - remove from queue
+            this.items.delete(item.id);
+            this.processing.delete(item.id);
+            const result = {
+                item,
+                success: true,
+                durationMs: Date.now() - startTime,
+            };
+            this.log('info', 'Item processed successfully', {
+                id: item.id,
+                durationMs: result.durationMs,
+            });
+            if (this.onProcessed) {
+                this.onProcessed(result);
+            }
+        }
+        catch (error) {
+            this.processing.delete(item.id);
+            const errorMessage = error instanceof Error ? error.message : String(error);
+            // Update retry info
+            item.retries++;
+            item.lastError = errorMessage;
+            if (item.retries >= this.maxRetries) {
+                // Max retries exceeded - remove from queue
+                this.items.delete(item.id);
+                // SMI-4291: dead-letter sink (plan-review finding C3).
+                // Catch + console.error; never rethrow. Local queue state is already
+                // cleared, so a sink failure must not cascade or re-queue the item.
+                if (this.deadLetterSink) {
+                    try {
+                        await this.deadLetterSink(item, errorMessage);
+                    }
+                    catch (sinkError) {
+                        const sinkMessage = sinkError instanceof Error ? sinkError.message : String(sinkError);
+                        // Operator-visibility fallback: finding C3 requires no rethrow.
+                        console.error('[webhook-dlq] Sink failed; event dropped locally', {
+                            event_id: item.id,
+                            reason: errorMessage,
+                            sink_error: sinkMessage,
+                        });
+                    }
+                }
+                const result = {
+                    item,
+                    success: false,
+                    error: `Max retries exceeded: ${errorMessage}`,
+                    durationMs: Date.now() - startTime,
+                };
+                this.log('error', 'Item failed after max retries', {
+                    id: item.id,
+                    retries: item.retries,
+                    error: errorMessage,
+                });
+                if (this.onProcessed) {
+                    this.onProcessed(result);
+                }
+            }
+            else {
+                // Schedule retry with exponential backoff
+                const delay = calculateRetryDelay(this.retryDelayMs, item.retries);
+                item.nextRetryAt = Date.now() + delay;
+                this.log('warn', 'Item processing failed, scheduling retry', {
+                    id: item.id,
+                    retries: item.retries,
+                    nextRetryIn: delay,
+                    error: errorMessage,
+                });
+            }
+        }
+    }
+    /**
+     * Get queue statistics
+     */
+    getStats() {
+        const stats = {
+            total: this.items.size,
+            byPriority: { high: 0, medium: 0, low: 0 },
+            byType: { index: 0, remove: 0, remove_all: 0, archive: 0, reactivate: 0 },
+            processing: this.processing.size,
+            pendingRetry: 0,
+        };
+        const now = Date.now();
+        for (const item of this.items.values()) {
+            stats.byPriority[item.priority]++;
+            stats.byType[item.type]++;
+            if (item.nextRetryAt && item.nextRetryAt > now) {
+                stats.pendingRetry++;
+            }
+        }
+        return stats;
+    }
+    /**
+     * Get all items in the queue
+     */
+    getItems() {
+        return Array.from(this.items.values());
+    }
+    /**
+     * Clear all items from the queue
+     */
+    clear() {
+        // Clear debounce timers
+        for (const timer of this.debounceTimers.values()) {
+            clearTimeout(timer);
+        }
+        this.debounceTimers.clear();
+        // Clear items (except those being processed)
+        for (const id of this.items.keys()) {
+            if (!this.processing.has(id)) {
+                this.items.delete(id);
+            }
+        }
+        this.log('info', 'Queue cleared');
+    }
+    /**
+     * Wait for all current processing to complete
+     */
+    async waitForProcessing() {
+        if (this.processingPromise) {
+            await this.processingPromise;
+        }
+        // Wait for any remaining items being processed
+        while (this.processing.size > 0) {
+            await new Promise((resolve) => setTimeout(resolve, 100));
+        }
+    }
+    /**
+     * Set the processor function
+     */
+    setProcessor(processor) {
+        this.processor = processor;
+    }
+    /**
+     * Check if queue has pending items
+     */
+    hasPendingItems() {
+        return this.items.size > 0 || this.debounceTimers.size > 0;
+    }
+    /**
+     * Get count of items being processed
+     */
+    getProcessingCount() {
+        return this.processing.size;
+    }
+}
+export default WebhookQueue;
+//# sourceMappingURL=WebhookQueue.js.map

package/dist/webhooks/WebhookQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebhookQueue.js","sourceRoot":"","sources":["../../src/webhooks/WebhookQueue.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAoBH,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAA;AAEnG;;GAEG;AACH,MAAM,OAAO,YAAY;IACf,KAAK,GAAkC,IAAI,GAAG,EAAE,CAAA;IAChD,UAAU,GAAgB,IAAI,GAAG,EAAE,CAAA;IACnC,cAAc,GAAgC,IAAI,GAAG,EAAE,CAAA;IACvD,YAAY,GAAG,KAAK,CAAA;IACpB,iBAAiB,GAAyB,IAAI,CAAA;IAE9C,WAAW,CAAQ;IACnB,UAAU,CAAQ;IAClB,UAAU,CAAQ;IAClB,YAAY,CAAQ;IACpB,OAAO,CAAQ;IACf,SAAS,CAA4C;IACrD,WAAW,CAAuC;IAClD,GAAG,CAA6E;IAChF,cAAc,CAA4D;IAElF,YAAY,UAA+B,EAAE;QAC3C,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,CAAC,CAAA;QAC3C,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,IAAI,CAAA,CAAC,oBAAoB;QACjE,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAA;QACzC,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,IAAI,CAAA;QAChD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,IAAI,CAAA;QACtC,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAA;QAClC,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACtC,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,CAAA;IAC9C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,CAAC,IAAsB;QAC9B,mBAAmB;QACnB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,2BAA2B,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;YAC9D,OAAO,KAAK,CAAA;QACd,CAAC;QAED,yCAAyC;QACzC,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QAEzE,mDAAmD;QACnD,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAC1D,IAAI,aAAa,EAAE,CAAC;YAClB,wCAAwC;YACxC,YAAY,CAAC,aAAa,CAAC,CAAA;YAC3B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;YACvC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,mBAAmB,EAAE,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAA;QAC7D,CAAC;QAED,yDAAyD;QACzD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC5C,IAAI,YAAY,IAAI,YAAY,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7D,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,iDAAiD,EAAE;gBAClE,EAAE,EAAE,IAAI,CAAC,EAAE;aACZ,CAAC,CAAA;YACF,OAAO,KAAK,CAAA;QACd,CAAC;QAED,qBAAqB;QACrB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YAC5B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;YACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;YAC7B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,oCAAoC,EAAE;gBACrD,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,QAAQ,EAAE,IAAI,CAAC,QAAQ;aACxB,CAAC,CAAA;YACF,IAAI,CAAC,iBAAiB,EAAE,CAAA;QAC1B,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAA;QAEnB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAA;QAC3C,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,IAAsB;QACjC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,2BAA2B,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;YAC9D,OAAO,KAAK,CAAA;QACd,CAAC;QAED,8BAA8B;QAC9B,MAAM,WAAW,GAAG,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QACzE,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAC1D,IAAI,aAAa,EAAE,CAAC;YAClB,YAAY,CAAC,aAAa,CAAC,CAAA;YAC3B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;QACzC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,iCAAiC,EAAE;YAClD,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CAAA;QACF,IAAI,CAAC,iBAAiB,EAAE,CAAA;QACxB,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IAC9B,CAAC;IAED;;OAEG;IACK,WAAW;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QACtB,IAAI,QAAQ,GAA4B,IAAI,CAAA;QAC5C,IAAI,SAAS,GAAG,CAAC,CAAC,CAAA;QAElB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,kCAAkC;YAClC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjC,SAAQ;YACV,CAAC;YAED,4BAA4B;YAC5B,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;gBAC/C,SAAQ;YACV,CAAC;YAED,2BAA2B;YAC3B,MAAM,aAAa,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAEpD,wCAAwC;YACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,CAAA,CAAC,cAAc;YAEpE,MAAM,KAAK,GAAG,aAAa,GAAG,IAAI,GAAG,QAAQ,CAAA;YAE7C,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACtB,SAAS,GAAG,KAAK,CAAA;gBACjB,QAAQ,GAAG,IAAI,CAAA;YACjB,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAM;QACR,CAAC;QAED,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,OAAM;QACR,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,CAAA;QACxB,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;YACxD,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;YACzB,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;QAC/B,CAAC,CAAC,CAAA;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY;QACxB,OAAO,IAAI,EAAE,CAAC;YACZ,sCAAsC;YACtC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAChD,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAA;YAC1D,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;YAC/B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,6CAA6C;gBAC7C,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACtD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CACnD,CAAA;gBAED,IAAI,WAAW,EAAE,CAAC;oBAChB,2BAA2B;oBAC3B,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAA;oBACzD,SAAQ;gBACV,CAAC;gBAED,2BAA2B;gBAC3B,MAAK;YACP,CAAC;YAED,4BAA4B;YAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBACrC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,uBAAuB,EAAE;oBACzC,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;iBAC9D,CAAC,CAAA;YACJ,CAAC,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW,CAAC,IAAsB;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAE5B,IAAI,CAAC;YACH,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;YAC5B,CAAC;YAED,8BAA8B;YAC9B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC1B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAE/B,MAAM,MAAM,GAAuB;gBACjC,IAAI;gBACJ,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;aACnC,CAAA;YAED,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,6BAA6B,EAAE;gBAC9C,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,UAAU,EAAE,MAAM,CAAC,UAAU;aAC9B,CAAC,CAAA;YAEF,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC/B,MAAM,YAAY,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YAE3E,oBAAoB;YACpB,IAAI,CAAC,OAAO,EAAE,CAAA;YACd,IAAI,CAAC,SAAS,GAAG,YAAY,CAAA;YAE7B,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;gBACpC,2CAA2C;gBAC3C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAE1B,uDAAuD;gBACvD,qEAAqE;gBACrE,oEAAoE;gBACpE,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;oBACxB,IAAI,CAAC;wBACH,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;oBAC/C,CAAC;oBAAC,OAAO,SAAS,EAAE,CAAC;wBACnB,MAAM,WAAW,GAAG,SAAS,YAAY,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;wBACtF,gEAAgE;wBAChE,OAAO,CAAC,KAAK,CAAC,kDAAkD,EAAE;4BAChE,QAAQ,EAAE,IAAI,CAAC,EAAE;4BACjB,MAAM,EAAE,YAAY;4BACpB,UAAU,EAAE,WAAW;yBACxB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;gBAED,MAAM,MAAM,GAAuB;oBACjC,IAAI;oBACJ,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,yBAAyB,YAAY,EAAE;oBAC9C,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;iBACnC,CAAA;gBAED,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,+BAA+B,EAAE;oBACjD,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,OAAO,EAAE,IAAI,CAAC,OAAO;oBACrB,KAAK,EAAE,YAAY;iBACpB,CAAC,CAAA;gBAEF,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;oBACrB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,0CAA0C;gBAC1C,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,CAAA;gBAClE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAA;gBAErC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,0CAA0C,EAAE;oBAC3D,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,OAAO,EAAE,IAAI,CAAC,OAAO;oBACrB,WAAW,EAAE,KAAK;oBAClB,KAAK,EAAE,YAAY;iBACpB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,KAAK,GAAe;YACxB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACtB,UAAU,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;YAC1C,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE;YACzE,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;YAChC,YAAY,EAAE,CAAC;SAChB,CAAA;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAEtB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAA;YACjC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAA;YAEzB,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE,CAAC;gBAC/C,KAAK,CAAC,YAAY,EAAE,CAAA;YACtB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACxC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,wBAAwB;QACxB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,YAAY,CAAC,KAAK,CAAC,CAAA;QACrB,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAA;QAE3B,6CAA6C;QAC7C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;YACvB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAA;IACnC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB;QACrB,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,iBAAiB,CAAA;QAC9B,CAAC;QAED,+CAA+C;QAC/C,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAA;QAC1D,CAAC;IACH,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,SAAoD;QAC/D,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC5B,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAA;IAC5D,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAA;IAC7B,CAAC;CACF;AAED,eAAe,YAAY,CAAA"}

package/dist/webhooks/WebhookQueue.types.d.ts

@@ -0,0 +1,160 @@
+/**
+ * SMI-645: WebhookQueue Types
+ *
+ * Type definitions for the webhook event queue system:
+ * - Queue item types and priorities
+ * - Processing results and statistics
+ * - Queue configuration options
+ */
+/**
+ * Types of queue items
+ */
+export type QueueItemType = 'index' | 'remove' | 'remove_all' | 'archive' | 'reactivate';
+/**
+ * Priority levels for queue items
+ */
+export type QueuePriority = 'high' | 'medium' | 'low';
+/**
+ * A single item in the webhook queue
+ */
+export interface WebhookQueueItem {
+    /**
+     * Unique identifier for this queue item
+     */
+    id: string;
+    /**
+     * Type of operation to perform
+     */
+    type: QueueItemType;
+    /**
+     * Repository URL
+     */
+    repoUrl: string;
+    /**
+     * Repository full name (owner/repo)
+     */
+    repoFullName: string;
+    /**
+     * Path to the file (or '*' for repo-wide operations)
+     */
+    filePath: string;
+    /**
+     * Commit SHA that triggered this item
+     */
+    commitSha: string;
+    /**
+     * Timestamp when this item was created
+     */
+    timestamp: number;
+    /**
+     * Priority level
+     */
+    priority: QueuePriority;
+    /**
+     * Number of retry attempts
+     */
+    retries: number;
+    /**
+     * Error from last attempt (if any)
+     */
+    lastError?: string;
+    /**
+     * Next retry time (if scheduled)
+     */
+    nextRetryAt?: number;
+}
+/**
+ * Queue processing result
+ */
+export interface QueueProcessResult {
+    /**
+     * Item that was processed
+     */
+    item: WebhookQueueItem;
+    /**
+     * Whether processing succeeded
+     */
+    success: boolean;
+    /**
+     * Error message if failed
+     */
+    error?: string;
+    /**
+     * Duration of processing in ms
+     */
+    durationMs: number;
+}
+/**
+ * Queue statistics
+ */
+export interface QueueStats {
+    /**
+     * Total items in queue
+     */
+    total: number;
+    /**
+     * Items by priority
+     */
+    byPriority: Record<QueuePriority, number>;
+    /**
+     * Items by type
+     */
+    byType: Record<QueueItemType, number>;
+    /**
+     * Items currently being processed
+     */
+    processing: number;
+    /**
+     * Items waiting for retry
+     */
+    pendingRetry: number;
+}
+/**
+ * Queue options
+ */
+export interface WebhookQueueOptions {
+    /**
+     * Maximum number of concurrent processors
+     */
+    concurrency?: number;
+    /**
+     * Debounce time in ms for same-repo updates
+     */
+    debounceMs?: number;
+    /**
+     * Maximum retry attempts
+     */
+    maxRetries?: number;
+    /**
+     * Base retry delay in ms (exponential backoff)
+     */
+    retryDelayMs?: number;
+    /**
+     * Maximum queue size
+     */
+    maxSize?: number;
+    /**
+     * Processor function to handle queue items
+     */
+    processor?: (item: WebhookQueueItem) => Promise<void>;
+    /**
+     * Callback when processing completes
+     */
+    onProcessed?: (result: QueueProcessResult) => void;
+    /**
+     * Callback for logging
+     */
+    onLog?: (level: 'info' | 'warn' | 'error', message: string, data?: unknown) => void;
+    /**
+     * SMI-4291: Dead-letter sink invoked when an item exhausts maxRetries.
+     *
+     * Contract (plan-review finding C3):
+     *  - `WebhookQueue` wraps the call in try/catch and logs sink errors via
+     *    `console.error`. Sink implementations therefore MUST NOT rely on the
+     *    queue re-throwing — local in-memory state has already been cleared.
+     *  - The sink should be idempotent: a failure during persistence will not
+     *    cause the queue to retry the write.
+     */
+    deadLetterSink?: (item: WebhookQueueItem, reason: string) => Promise<void>;
+}
+//# sourceMappingURL=WebhookQueue.types.d.ts.map

package/dist/webhooks/WebhookQueue.types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebhookQueue.types.d.ts","sourceRoot":"","sources":["../../src/webhooks/WebhookQueue.types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,OAAO,GAAG,QAAQ,GAAG,YAAY,GAAG,SAAS,GAAG,YAAY,CAAA;AAExF;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAA;AAErD;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;OAEG;IACH,EAAE,EAAE,MAAM,CAAA;IAEV;;OAEG;IACH,IAAI,EAAE,aAAa,CAAA;IAEnB;;OAEG;IACH,OAAO,EAAE,MAAM,CAAA;IAEf;;OAEG;IACH,YAAY,EAAE,MAAM,CAAA;IAEpB;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAA;IAEhB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,QAAQ,EAAE,aAAa,CAAA;IAEvB;;OAEG;IACH,OAAO,EAAE,MAAM,CAAA;IAEf;;OAEG;IACH,SAAS,CAAC,EAAE,MAAM,CAAA;IAElB;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC;;OAEG;IACH,IAAI,EAAE,gBAAgB,CAAA;IAEtB;;OAEG;IACH,OAAO,EAAE,OAAO,CAAA;IAEhB;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAA;IAEd;;OAEG;IACH,UAAU,EAAE,MAAM,CAAA;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAA;IAEb;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAA;IAEzC;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,CAAA;IAErC;;OAEG;IACH,UAAU,EAAE,MAAM,CAAA;IAElB;;OAEG;IACH,YAAY,EAAE,MAAM,CAAA;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC;;OAEG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;IAEpB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;IAEnB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAA;IAEnB;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,CAAA;IAErB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;IAEhB;;OAEG;IACH,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,gBAAgB,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;IAErD;;OAEG;IACH,WAAW,CAAC,EAAE,CAAC,MAAM,EAAE,kBAAkB,KAAK,IAAI,CAAA;IAElD;;OAEG;IACH,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,KAAK,IAAI,CAAA;IAEnF;;;;;;;;;OASG;IACH,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAA;CAC3E"}

package/dist/webhooks/WebhookQueue.types.js

@@ -0,0 +1,10 @@
+/**
+ * SMI-645: WebhookQueue Types
+ *
+ * Type definitions for the webhook event queue system:
+ * - Queue item types and priorities
+ * - Processing results and statistics
+ * - Queue configuration options
+ */
+export {};
+//# sourceMappingURL=WebhookQueue.types.js.map

package/dist/webhooks/WebhookQueue.types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebhookQueue.types.js","sourceRoot":"","sources":["../../src/webhooks/WebhookQueue.types.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/webhooks/WebhookQueue.utils.d.ts

@@ -0,0 +1,44 @@
+/**
+ * SMI-645: WebhookQueue Utilities
+ *
+ * Utility constants and functions for the webhook queue system.
+ */
+import type { QueuePriority } from './WebhookQueue.types.js';
+/**
+ * Priority values for sorting
+ * Higher values = higher priority
+ */
+export declare const PRIORITY_VALUES: Record<QueuePriority, number>;
+/**
+ * Compare two queue items by priority
+ * Returns negative if a has higher priority, positive if b has higher priority
+ */
+export declare function comparePriority(a: QueuePriority, b: QueuePriority): number;
+/**
+ * Calculate priority score for an item
+ * Takes into account priority level and age
+ *
+ * @param priority - The priority level
+ * @param timestamp - The item's creation timestamp
+ * @param now - Current timestamp (default: Date.now())
+ * @returns Combined priority score
+ */
+export declare function calculatePriorityScore(priority: QueuePriority, timestamp: number, now?: number): number;
+/**
+ * Calculate exponential backoff delay
+ *
+ * @param baseDelayMs - Base delay in milliseconds
+ * @param retryCount - Current retry attempt (1-based)
+ * @returns Delay in milliseconds
+ */
+export declare function calculateRetryDelay(baseDelayMs: number, retryCount: number): number;
+/**
+ * Generate a debounce key for a queue item
+ * Used to deduplicate rapid updates to the same file
+ *
+ * @param repoFullName - Repository full name (owner/repo)
+ * @param filePath - Path to the file
+ * @returns Debounce key string
+ */
+export declare function generateDebounceKey(repoFullName: string, filePath: string): string;
+//# sourceMappingURL=WebhookQueue.utils.d.ts.map

package/dist/webhooks/WebhookQueue.utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebhookQueue.utils.d.ts","sourceRoot":"","sources":["../../src/webhooks/WebhookQueue.utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAA;AAE5D;;;GAGG;AACH,eAAO,MAAM,eAAe,EAAE,MAAM,CAAC,aAAa,EAAE,MAAM,CAIzD,CAAA;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,aAAa,GAAG,MAAM,CAE1E;AAED;;;;;;;;GAQG;AACH,wBAAgB,sBAAsB,CACpC,QAAQ,EAAE,aAAa,EACvB,SAAS,EAAE,MAAM,EACjB,GAAG,GAAE,MAAmB,GACvB,MAAM,CAKR;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,CAEnF;AAED;;;;;;;GAOG;AACH,wBAAgB,mBAAmB,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAElF"}

package/dist/webhooks/WebhookQueue.utils.js

@@ -0,0 +1,58 @@
+/**
+ * SMI-645: WebhookQueue Utilities
+ *
+ * Utility constants and functions for the webhook queue system.
+ */
+/**
+ * Priority values for sorting
+ * Higher values = higher priority
+ */
+export const PRIORITY_VALUES = {
+    high: 3,
+    medium: 2,
+    low: 1,
+};
+/**
+ * Compare two queue items by priority
+ * Returns negative if a has higher priority, positive if b has higher priority
+ */
+export function comparePriority(a, b) {
+    return PRIORITY_VALUES[b] - PRIORITY_VALUES[a];
+}
+/**
+ * Calculate priority score for an item
+ * Takes into account priority level and age
+ *
+ * @param priority - The priority level
+ * @param timestamp - The item's creation timestamp
+ * @param now - Current timestamp (default: Date.now())
+ * @returns Combined priority score
+ */
+export function calculatePriorityScore(priority, timestamp, now = Date.now()) {
+    const priorityScore = PRIORITY_VALUES[priority];
+    // Prefer older items with same priority (age bonus in minutes)
+    const ageBonus = (now - timestamp) / (1000 * 60);
+    return priorityScore * 1000 + ageBonus;
+}
+/**
+ * Calculate exponential backoff delay
+ *
+ * @param baseDelayMs - Base delay in milliseconds
+ * @param retryCount - Current retry attempt (1-based)
+ * @returns Delay in milliseconds
+ */
+export function calculateRetryDelay(baseDelayMs, retryCount) {
+    return baseDelayMs * Math.pow(2, retryCount - 1);
+}
+/**
+ * Generate a debounce key for a queue item
+ * Used to deduplicate rapid updates to the same file
+ *
+ * @param repoFullName - Repository full name (owner/repo)
+ * @param filePath - Path to the file
+ * @returns Debounce key string
+ */
+export function generateDebounceKey(repoFullName, filePath) {
+    return `${repoFullName}:${filePath}`;
+}
+//# sourceMappingURL=WebhookQueue.utils.js.map

package/dist/webhooks/WebhookQueue.utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WebhookQueue.utils.js","sourceRoot":"","sources":["../../src/webhooks/WebhookQueue.utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAkC;IAC5D,IAAI,EAAE,CAAC;IACP,MAAM,EAAE,CAAC;IACT,GAAG,EAAE,CAAC;CACP,CAAA;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,CAAgB,EAAE,CAAgB;IAChE,OAAO,eAAe,CAAC,CAAC,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;AAChD,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,sBAAsB,CACpC,QAAuB,EACvB,SAAiB,EACjB,MAAc,IAAI,CAAC,GAAG,EAAE;IAExB,MAAM,aAAa,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;IAC/C,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,CAAC,CAAA;IAChD,OAAO,aAAa,GAAG,IAAI,GAAG,QAAQ,CAAA;AACxC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,WAAmB,EAAE,UAAkB;IACzE,OAAO,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAA;AAClD,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CAAC,YAAoB,EAAE,QAAgB;IACxE,OAAO,GAAG,YAAY,IAAI,QAAQ,EAAE,CAAA;AACtC,CAAC"}

package/dist/webhooks/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * SMI-645: Webhooks module - GitHub webhook handling for real-time index updates
+ *
+ * Provides:
+ * - WebhookPayload: Type definitions and parsing for GitHub webhook events
+ * - WebhookHandler: Process and verify incoming webhook events
+ * - WebhookQueue: Priority queue with debouncing and retry support
+ */
+export { type WebhookEventType, type RepositoryAction, type GitUser, type PushCommit, type RepositoryOwner, type WebhookRepository, type WebhookSender, type PushEventPayload, type RepositoryEventPayload, type PingEventPayload, type WebhookPayload, type ParsedWebhookEvent, type SignatureVerificationResult, type SkillFileChange, isSkillFile, extractSkillChanges, parseWebhookPayload, } from './WebhookPayload.js';
+export { WebhookHandler, type WebhookHandlerOptions, type WebhookHandleResult, type DeliveryStats, } from './WebhookHandler.js';
+export { WebhookQueue, type QueueItemType, type QueuePriority, type WebhookQueueItem, type QueueProcessResult, type QueueStats, type WebhookQueueOptions, } from './WebhookQueue.js';
+export { WebhookDeadLetterRepository, type DeadLetterRow, type InsertDeadLetterInput, type SupabaseLikeClient, } from './WebhookDeadLetterRepository.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/webhooks/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/webhooks/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EACL,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,OAAO,EACZ,KAAK,UAAU,EACf,KAAK,eAAe,EACpB,KAAK,iBAAiB,EACtB,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,KAAK,sBAAsB,EAC3B,KAAK,gBAAgB,EACrB,KAAK,cAAc,EACnB,KAAK,kBAAkB,EACvB,KAAK,2BAA2B,EAChC,KAAK,eAAe,EACpB,WAAW,EACX,mBAAmB,EACnB,mBAAmB,GACpB,MAAM,qBAAqB,CAAA;AAG5B,OAAO,EACL,cAAc,EACd,KAAK,qBAAqB,EAC1B,KAAK,mBAAmB,EACxB,KAAK,aAAa,GACnB,MAAM,qBAAqB,CAAA;AAG5B,OAAO,EACL,YAAY,EACZ,KAAK,aAAa,EAClB,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,KAAK,kBAAkB,EACvB,KAAK,UAAU,EACf,KAAK,mBAAmB,GACzB,MAAM,mBAAmB,CAAA;AAG1B,OAAO,EACL,2BAA2B,EAC3B,KAAK,aAAa,EAClB,KAAK,qBAAqB,EAC1B,KAAK,kBAAkB,GACxB,MAAM,kCAAkC,CAAA"}