@trigger.dev/core 0.0.0-buffer-fix-20231206151546 → 0.0.0-bun-prerelease-20260909132648

package/dist/commonjs/v3/runEngineWorker/supervisor/queueConsumer.d.ts

@@ -0,0 +1,43 @@
+import type { SupervisorHttpClient } from "./http.js";
+import type { WorkerApiDequeueResponseBody, WorkerQueueClass } from "./schemas.js";
+import type { PreDequeueFn, PreSkipFn } from "./types.js";
+import type { ConsumerPoolMetrics } from "./consumerPoolMetrics.js";
+export interface QueueConsumer {
+    start(): void;
+    stop(): void;
+}
+export type RunQueueConsumerOptions = {
+    client: SupervisorHttpClient;
+    intervalMs: number;
+    idleIntervalMs: number;
+    preDequeue?: PreDequeueFn;
+    preSkip?: PreSkipFn;
+    maxRunCount?: number;
+    /** Which worker-queue class this consumer pulls from. Defaults to the worker's region queue. */
+    queueClass?: WorkerQueueClass;
+    onDequeue: (messages: WorkerApiDequeueResponseBody, timing?: {
+        dequeueResponseMs: number;
+        pollingIntervalMs: number;
+    }) => Promise<void>;
+    /** Optional shared pool metrics. When provided, dequeue API latency is recorded as a histogram. */
+    metrics?: ConsumerPoolMetrics;
+};
+export declare class RunQueueConsumer implements QueueConsumer {
+    private readonly client;
+    private readonly preDequeue?;
+    private readonly preSkip?;
+    private readonly maxRunCount?;
+    private readonly queueClass?;
+    private readonly onDequeue;
+    private readonly metrics?;
+    private readonly logger;
+    private intervalMs;
+    private idleIntervalMs;
+    private isEnabled;
+    private lastScheduledIntervalMs;
+    constructor(opts: RunQueueConsumerOptions);
+    start(): void;
+    stop(): void;
+    private dequeue;
+    private scheduleNextDequeue;
+}

package/dist/commonjs/v3/runEngineWorker/supervisor/queueConsumer.js

@@ -0,0 +1,132 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RunQueueConsumer = void 0;
+const structuredLogger_js_1 = require("../../utils/structuredLogger.js");
+class RunQueueConsumer {
+    client;
+    preDequeue;
+    preSkip;
+    maxRunCount;
+    queueClass;
+    onDequeue;
+    metrics;
+    logger = new structuredLogger_js_1.SimpleStructuredLogger("queue-consumer");
+    intervalMs;
+    idleIntervalMs;
+    isEnabled;
+    lastScheduledIntervalMs;
+    constructor(opts) {
+        this.isEnabled = false;
+        this.intervalMs = opts.intervalMs;
+        this.idleIntervalMs = opts.idleIntervalMs;
+        this.preDequeue = opts.preDequeue;
+        this.preSkip = opts.preSkip;
+        this.maxRunCount = opts.maxRunCount;
+        this.queueClass = opts.queueClass;
+        this.lastScheduledIntervalMs = opts.idleIntervalMs;
+        this.onDequeue = opts.onDequeue;
+        this.client = opts.client;
+        this.metrics = opts.metrics;
+    }
+    start() {
+        if (this.isEnabled) {
+            return;
+        }
+        this.isEnabled = true;
+        this.dequeue();
+    }
+    stop() {
+        if (!this.isEnabled) {
+            return;
+        }
+        this.isEnabled = false;
+    }
+    async dequeue() {
+        this.logger.verbose("dequeue()", {
+            enabled: this.isEnabled,
+            intervalMs: this.intervalMs,
+            idleIntervalMs: this.idleIntervalMs,
+            maxRunCount: this.maxRunCount,
+            preDequeue: !!this.preDequeue,
+            preSkip: !!this.preSkip,
+        });
+        if (!this.isEnabled) {
+            this.logger.warn("dequeue() - not enabled");
+            return;
+        }
+        let preDequeueResult;
+        if (this.preDequeue) {
+            this.logger.verbose("preDequeue()");
+            try {
+                preDequeueResult = await this.preDequeue();
+            }
+            catch (preDequeueError) {
+                this.logger.error("preDequeue error", { error: preDequeueError });
+            }
+        }
+        this.logger.verbose("preDequeueResult", { preDequeueResult });
+        if (preDequeueResult?.skipDequeue ||
+            preDequeueResult?.maxResources?.cpu === 0 ||
+            preDequeueResult?.maxResources?.memory === 0) {
+            this.logger.debug("skipping dequeue", { preDequeueResult });
+            if (this.preSkip) {
+                this.logger.debug("preSkip()");
+                try {
+                    await this.preSkip();
+                }
+                catch (preSkipError) {
+                    this.logger.error("preSkip error", { error: preSkipError });
+                }
+            }
+            this.scheduleNextDequeue(this.idleIntervalMs);
+            return;
+        }
+        let nextIntervalMs = this.idleIntervalMs;
+        const dequeueStart = performance.now();
+        try {
+            const response = await this.client.dequeue({
+                maxResources: preDequeueResult?.maxResources,
+                maxRunCount: this.maxRunCount,
+                queueClass: this.queueClass,
+            });
+            const dequeueDurationSeconds = (performance.now() - dequeueStart) / 1000;
+            const dequeueResponseMs = Math.round(dequeueDurationSeconds * 1000);
+            if (!response.success) {
+                this.metrics?.observeDequeueLatency(dequeueDurationSeconds, "error");
+                this.logger.error("Failed to dequeue", { error: response.error });
+            }
+            else {
+                this.metrics?.observeDequeueLatency(dequeueDurationSeconds, response.data.length > 0 ? "success" : "empty");
+                try {
+                    await this.onDequeue(response.data, {
+                        dequeueResponseMs,
+                        pollingIntervalMs: this.lastScheduledIntervalMs,
+                    });
+                    if (response.data.length > 0) {
+                        nextIntervalMs = this.intervalMs;
+                    }
+                }
+                catch (handlerError) {
+                    this.logger.error("onDequeue error", { error: handlerError });
+                }
+            }
+        }
+        catch (clientError) {
+            // wrapZodFetch traps all errors into { success: false }, so this branch is
+            // unreachable with the real client today. Record defensively so a future
+            // client that throws can't silently lose error samples.
+            this.metrics?.observeDequeueLatency((performance.now() - dequeueStart) / 1000, "error");
+            this.logger.error("client.dequeue error", { error: clientError });
+        }
+        this.scheduleNextDequeue(nextIntervalMs);
+    }
+    scheduleNextDequeue(delayMs) {
+        if (delayMs === this.idleIntervalMs && this.idleIntervalMs !== this.intervalMs) {
+            this.logger.verbose("scheduled dequeue with idle interval", { delayMs });
+        }
+        this.lastScheduledIntervalMs = delayMs;
+        setTimeout(this.dequeue.bind(this), delayMs);
+    }
+}
+exports.RunQueueConsumer = RunQueueConsumer;
+//# sourceMappingURL=queueConsumer.js.map

package/dist/commonjs/v3/runEngineWorker/supervisor/queueConsumer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queueConsumer.js","sourceRoot":"","sources":["../../../../../src/v3/runEngineWorker/supervisor/queueConsumer.ts"],"names":[],"mappings":";;;AAAA,yEAAyE;AA4BzE;IACmB,MAAM,CAAuB;IAC7B,UAAU,CAAgB;IAC1B,OAAO,CAAa;IACpB,WAAW,CAAU;IACrB,UAAU,CAAoB;IAC9B,SAAS,CAGP;IACF,OAAO,CAAuB;IAE9B,MAAM,GAAG,IAAI,4CAAsB,CAAC,gBAAgB,CAAC,CAAC;IAE/D,UAAU,CAAS;IACnB,cAAc,CAAS;IACvB,SAAS,CAAU;IACnB,uBAAuB,CAAS;IAExC,YAAY,IAA6B;QACvC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,cAAc,CAAC;QACnD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;IAC9B,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED,IAAI;QACF,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAEO,KAAK,CAAC,OAAO;QACnB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE;YAC/B,OAAO,EAAE,IAAI,CAAC,SAAS;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,cAAc,EAAE,IAAI,CAAC,cAAc;YACnC,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU;YAC7B,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO;SACxB,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;YAC5C,OAAO;QACT,CAAC;QAED,IAAI,gBAA+D,CAAC;QACpE,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YAEpC,IAAI,CAAC;gBACH,gBAAgB,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7C,CAAC;YAAC,OAAO,eAAe,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAAE,KAAK,EAAE,eAAe,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;QAE9D,IACE,gBAAgB,EAAE,WAAW;YAC7B,gBAAgB,EAAE,YAAY,EAAE,GAAG,KAAK,CAAC;YACzC,gBAAgB,EAAE,YAAY,EAAE,MAAM,KAAK,CAAC,EAC5C,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;YAE5D,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBAE/B,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;gBACvB,CAAC;gBAAC,OAAO,YAAY,EAAE,CAAC;oBACtB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,eAAe,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;YAED,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC9C,OAAO;QACT,CAAC;QAED,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;QAEzC,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEvC,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;gBACzC,YAAY,EAAE,gBAAgB,EAAE,YAAY;gBAC5C,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,UAAU,EAAE,IAAI,CAAC,UAAU;aAC5B,CAAC,CAAC;YACH,MAAM,sBAAsB,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC,GAAG,IAAI,CAAC;YACzE,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,sBAAsB,GAAG,IAAI,CAAC,CAAC;YAEpE,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACtB,IAAI,CAAC,OAAO,EAAE,qBAAqB,CAAC,sBAAsB,EAAE,OAAO,CAAC,CAAC;gBACrE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mBAAmB,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,OAAO,EAAE,qBAAqB,CACjC,sBAAsB,EACtB,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAC/C,CAAC;gBAEF,IAAI,CAAC;oBACH,MAAM,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE;wBAClC,iBAAiB;wBACjB,iBAAiB,EAAE,IAAI,CAAC,uBAAuB;qBAChD,CAAC,CAAC;oBAEH,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBAC7B,cAAc,GAAG,IAAI,CAAC,UAAU,CAAC;oBACnC,CAAC;gBACH,CAAC;gBAAC,OAAO,YAAY,EAAE,CAAC;oBACtB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC;gBAChE,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,WAAW,EAAE,CAAC;YACrB,2EAA2E;YAC3E,yEAAyE;YACzE,wDAAwD;YACxD,IAAI,CAAC,OAAO,EAAE,qBAAqB,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC;YACxF,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,sBAAsB,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;QACpE,CAAC;QAED,IAAI,CAAC,mBAAmB,CAAC,cAAc,CAAC,CAAC;IAC3C,CAAC;IAEO,mBAAmB,CAAC,OAAe;QACzC,IAAI,OAAO,KAAK,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/E,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,sCAAsC,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,CAAC,uBAAuB,GAAG,OAAO,CAAC;QACvC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;CACF"}

package/dist/commonjs/v3/runEngineWorker/supervisor/queueMetricsProcessor.d.ts

@@ -0,0 +1,76 @@
+export interface QueueMetricsProcessorOptions {
+    /**
+     * EWMA smoothing factor (0-1)
+     * Lower values = more smoothing, less reactive
+     * Higher values = more responsive to recent changes
+     */
+    ewmaAlpha: number;
+    /**
+     * Batch window duration in milliseconds
+     * Samples within this window are collected and processed together
+     */
+    batchWindowMs: number;
+}
+export interface BatchProcessingResult {
+    /** Median of samples in the batch */
+    median: number;
+    /** EWMA-smoothed value after processing this batch */
+    smoothedValue: number;
+    /** Number of samples processed in this batch */
+    sampleCount: number;
+    /** Raw samples that were processed */
+    samples: readonly number[];
+}
+/**
+ * Processes queue length samples using exponential weighted moving average (EWMA)
+ * for smoothing and median filtering for outlier resistance.
+ *
+ * Collects samples within a batch window, calculates median to filter outliers,
+ * then applies EWMA smoothing for stable trend tracking.
+ */
+export declare class QueueMetricsProcessor {
+    private readonly ewmaAlpha;
+    private readonly batchWindowMs;
+    private readonly logger;
+    private samples;
+    private smoothedValue;
+    private lastBatchTime;
+    private isInitialized;
+    constructor(options: QueueMetricsProcessorOptions);
+    /**
+     * Adds a sample to the current batch
+     */
+    addSample(value: number, timestamp?: number): void;
+    /**
+     * Checks if enough time has passed to process the current batch
+     */
+    shouldProcessBatch(currentTime?: number): boolean;
+    private calculateMedian;
+    /**
+     * Processes the current batch of samples and returns the result.
+     * Clears the samples array and updates the smoothed value.
+     *
+     * Returns null if there are no samples to process.
+     */
+    processBatch(currentTime?: number): BatchProcessingResult | null;
+    /**
+     * Gets the current smoothed value without processing a batch
+     */
+    getSmoothedValue(): number;
+    /**
+     * Gets the number of samples in the current batch
+     */
+    getCurrentSampleCount(): number;
+    /**
+     * Gets the current samples (for testing/debugging)
+     */
+    getCurrentSamples(): readonly number[];
+    /**
+     * Resets the processor state
+     */
+    reset(): void;
+    /**
+     * Gets processor configuration
+     */
+    getConfig(): Readonly<QueueMetricsProcessorOptions>;
+}

package/dist/commonjs/v3/runEngineWorker/supervisor/queueMetricsProcessor.js

@@ -0,0 +1,161 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueueMetricsProcessor = void 0;
+const structuredLogger_js_1 = require("../../utils/structuredLogger.js");
+/**
+ * Processes queue length samples using exponential weighted moving average (EWMA)
+ * for smoothing and median filtering for outlier resistance.
+ *
+ * Collects samples within a batch window, calculates median to filter outliers,
+ * then applies EWMA smoothing for stable trend tracking.
+ */
+class QueueMetricsProcessor {
+    ewmaAlpha;
+    batchWindowMs;
+    logger = new structuredLogger_js_1.SimpleStructuredLogger("queue-metrics-processor");
+    samples = [];
+    smoothedValue = 0;
+    lastBatchTime = 0;
+    isInitialized = false;
+    constructor(options) {
+        if (options.ewmaAlpha < 0 || options.ewmaAlpha > 1) {
+            throw new Error("ewmaAlpha must be between 0 and 1");
+        }
+        if (options.batchWindowMs <= 0) {
+            throw new Error("batchWindowMs must be positive");
+        }
+        this.ewmaAlpha = options.ewmaAlpha;
+        this.batchWindowMs = options.batchWindowMs;
+    }
+    /**
+     * Adds a sample to the current batch
+     */
+    addSample(value, timestamp = Date.now()) {
+        if (value < 0) {
+            throw new Error("Queue length cannot be negative");
+        }
+        this.samples.push(value);
+        // Update last batch time on first sample
+        if (this.samples.length === 1) {
+            this.lastBatchTime = timestamp;
+        }
+    }
+    /**
+     * Checks if enough time has passed to process the current batch
+     */
+    shouldProcessBatch(currentTime = Date.now()) {
+        if (this.samples.length === 0) {
+            return false;
+        }
+        return currentTime - this.lastBatchTime >= this.batchWindowMs;
+    }
+    calculateMedian(samples) {
+        const sortedSamples = [...samples].sort((a, b) => a - b);
+        const mid = Math.floor(sortedSamples.length / 2);
+        if (sortedSamples.length % 2 === 1) {
+            // Odd length: use middle value
+            const median = sortedSamples[mid];
+            if (median === undefined) {
+                this.logger.error("Invalid median calculated from odd samples", {
+                    sortedSamples,
+                    mid,
+                    median,
+                });
+                return null;
+            }
+            return median;
+        }
+        else {
+            // Even length: average two middle values
+            const lowMid = sortedSamples[mid - 1];
+            const highMid = sortedSamples[mid];
+            if (lowMid === undefined || highMid === undefined) {
+                this.logger.error("Invalid median calculated from even samples", {
+                    sortedSamples,
+                    mid,
+                    lowMid,
+                    highMid,
+                });
+                return null;
+            }
+            const median = (lowMid + highMid) / 2;
+            return median;
+        }
+    }
+    /**
+     * Processes the current batch of samples and returns the result.
+     * Clears the samples array and updates the smoothed value.
+     *
+     * Returns null if there are no samples to process.
+     */
+    processBatch(currentTime = Date.now()) {
+        if (this.samples.length === 0) {
+            // No samples to process
+            return null;
+        }
+        // Calculate median of samples to filter outliers
+        const median = this.calculateMedian(this.samples);
+        if (median === null) {
+            // We already logged a more specific error message
+            return null;
+        }
+        // Update EWMA smoothed value
+        if (!this.isInitialized) {
+            // First value - initialize with median
+            this.smoothedValue = median;
+            this.isInitialized = true;
+        }
+        else {
+            // Apply EWMA: s_t = α * x_t + (1 - α) * s_(t-1)
+            this.smoothedValue = this.ewmaAlpha * median + (1 - this.ewmaAlpha) * this.smoothedValue;
+        }
+        const result = {
+            median,
+            smoothedValue: this.smoothedValue,
+            sampleCount: this.samples.length,
+            samples: Object.freeze([...this.samples]),
+        };
+        // Clear samples for next batch
+        this.samples = [];
+        this.lastBatchTime = currentTime;
+        return result;
+    }
+    /**
+     * Gets the current smoothed value without processing a batch
+     */
+    getSmoothedValue() {
+        return this.smoothedValue;
+    }
+    /**
+     * Gets the number of samples in the current batch
+     */
+    getCurrentSampleCount() {
+        return this.samples.length;
+    }
+    /**
+     * Gets the current samples (for testing/debugging)
+     */
+    getCurrentSamples() {
+        return Object.freeze([...this.samples]);
+    }
+    /**
+     * Resets the processor state
+     */
+    reset() {
+        this.samples = [];
+        this.smoothedValue = 0;
+        this.lastBatchTime = 0;
+        this.isInitialized = false;
+    }
+    /**
+     * Gets processor configuration
+     */
+    getConfig() {
+        return {
+            ewmaAlpha: this.ewmaAlpha,
+            batchWindowMs: this.batchWindowMs,
+        };
+    }
+}
+exports.QueueMetricsProcessor = QueueMetricsProcessor;
+//# sourceMappingURL=queueMetricsProcessor.js.map

package/dist/commonjs/v3/runEngineWorker/supervisor/queueMetricsProcessor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queueMetricsProcessor.js","sourceRoot":"","sources":["../../../../../src/v3/runEngineWorker/supervisor/queueMetricsProcessor.ts"],"names":[],"mappings":";;;AAAA,yEAAyE;AA+BzE;;;;;;GAMG;AACH;IACmB,SAAS,CAAS;IAClB,aAAa,CAAS;IACtB,MAAM,GAAG,IAAI,4CAAsB,CAAC,yBAAyB,CAAC,CAAC;IAExE,OAAO,GAAa,EAAE,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAC1B,aAAa,GAAW,CAAC,CAAC;IAC1B,aAAa,GAAY,KAAK,CAAC;IAEvC,YAAY,OAAqC;QAC/C,IAAI,OAAO,CAAC,SAAS,GAAG,CAAC,IAAI,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACnD,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,OAAO,CAAC,aAAa,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,KAAa,EAAE,SAAS,GAAW,IAAI,CAAC,GAAG,EAAE;QACrD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEzB,yCAAyC;QACzC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;QACjC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,WAAW,GAAW,IAAI,CAAC,GAAG,EAAE;QACjD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,WAAW,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;IAChE,CAAC;IAEO,eAAe,CAAC,OAAiB;QACvC,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEjD,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACnC,+BAA+B;YAC/B,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YAElC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,4CAA4C,EAAE;oBAC9D,aAAa;oBACb,GAAG;oBACH,MAAM;iBACP,CAAC,CAAC;gBACH,OAAO,IAAI,CAAC;YACd,CAAC;YAED,OAAO,MAAM,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,yCAAyC;YACzC,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACtC,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YAEnC,IAAI,MAAM,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAClD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,6CAA6C,EAAE;oBAC/D,aAAa;oBACb,GAAG;oBACH,MAAM;oBACN,OAAO;iBACR,CAAC,CAAC;gBACH,OAAO,IAAI,CAAC;YACd,CAAC;YAED,MAAM,MAAM,GAAG,CAAC,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YACtC,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,YAAY,CAAC,WAAW,GAAW,IAAI,CAAC,GAAG,EAAE;QAC3C,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,wBAAwB;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,iDAAiD;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,kDAAkD;YAClD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,6BAA6B;QAC7B,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YACxB,uCAAuC;YACvC,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC5B,CAAC;aAAM,CAAC;YACN,gDAAgD;YAChD,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,SAAS,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3F,CAAC;QAED,MAAM,MAAM,GAA0B;YACpC,MAAM;YACN,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM;YAChC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;SAC1C,CAAC;QAEF,+BAA+B;QAC/B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC;QAEjC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,qBAAqB;QACnB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO;YACL,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,aAAa,EAAE,IAAI,CAAC,aAAa;SAClC,CAAC;IACJ,CAAC;CACF"}

package/dist/commonjs/v3/runEngineWorker/supervisor/scalingStrategies.d.ts

@@ -0,0 +1,67 @@
+import type { QueueMetricsProcessor } from "./queueMetricsProcessor.js";
+export type ScalingStrategyKind = "none" | "smooth" | "aggressive";
+export interface ScalingStrategyOptions {
+    metricsProcessor?: QueueMetricsProcessor;
+    dampingFactor?: number;
+    minConsumerCount: number;
+    maxConsumerCount: number;
+    targetRatio: number;
+}
+export declare abstract class ScalingStrategy {
+    abstract readonly name: string;
+    private readonly minConsumerCount;
+    private readonly maxConsumerCount;
+    protected readonly targetRatio: number;
+    constructor(options?: ScalingStrategyOptions);
+    /**
+     * Calculates the target consumer count with clamping to min/max bounds
+     * Uses template method pattern to ensure consistent clamping across all strategies
+     */
+    calculateTargetCount(currentCount: number): number;
+    /**
+     * Internal method for subclasses to implement their specific scaling logic
+     * Should return the unclamped target count
+     */
+    protected abstract calculateTargetCountInternal(currentCount: number): number;
+    /**
+     * Creates a scaling strategy by name
+     */
+    static create(strategy: ScalingStrategyKind, options?: ScalingStrategyOptions): ScalingStrategy;
+}
+/**
+ * Static scaling strategy - maintains a fixed number of consumers
+ */
+export declare class NoneScalingStrategy extends ScalingStrategy {
+    readonly name = "none";
+    constructor(options?: ScalingStrategyOptions);
+    protected calculateTargetCountInternal(currentCount: number): number;
+}
+/**
+ * Smooth scaling strategy with EWMA smoothing and damping
+ * Uses exponentially weighted moving average for queue length smoothing
+ * and applies damping to prevent rapid oscillations.
+ */
+export declare class SmoothScalingStrategy extends ScalingStrategy {
+    readonly name = "smooth";
+    private readonly dampingFactor;
+    private readonly metricsProcessor;
+    constructor(options?: ScalingStrategyOptions);
+    protected calculateTargetCountInternal(currentCount: number): number;
+}
+/**
+ * Aggressive scaling strategy with threshold-based zones
+ * Uses threshold-based zones for different scaling behaviors.
+ * Scales up quickly when load increases but scales down cautiously.
+ */
+export declare class AggressiveScalingStrategy extends ScalingStrategy {
+    readonly name = "aggressive";
+    private readonly metricsProcessor;
+    constructor(options?: ScalingStrategyOptions);
+    protected calculateTargetCountInternal(currentCount: number): number;
+    getThresholds(targetRatio: number): {
+        scaleDownThreshold: number;
+        scaleUpThreshold: number;
+        criticalThreshold: number;
+        highThreshold: number;
+    };
+}

package/dist/commonjs/v3/runEngineWorker/supervisor/scalingStrategies.js

@@ -0,0 +1,153 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AggressiveScalingStrategy = exports.SmoothScalingStrategy = exports.NoneScalingStrategy = exports.ScalingStrategy = void 0;
+class ScalingStrategy {
+    minConsumerCount;
+    maxConsumerCount;
+    targetRatio;
+    constructor(options) {
+        this.minConsumerCount = options?.minConsumerCount ?? 1;
+        this.maxConsumerCount = options?.maxConsumerCount ?? 10;
+        this.targetRatio = options?.targetRatio ?? 1;
+    }
+    /**
+     * Calculates the target consumer count with clamping to min/max bounds
+     * Uses template method pattern to ensure consistent clamping across all strategies
+     */
+    calculateTargetCount(currentCount) {
+        const targetCount = this.calculateTargetCountInternal(currentCount);
+        // Apply consistent clamping to all strategies
+        return Math.min(Math.max(targetCount, this.minConsumerCount), this.maxConsumerCount);
+    }
+    /**
+     * Creates a scaling strategy by name
+     */
+    static create(strategy, options) {
+        switch (strategy) {
+            case "none":
+                return new NoneScalingStrategy(options);
+            case "smooth":
+                return new SmoothScalingStrategy(options);
+            case "aggressive":
+                return new AggressiveScalingStrategy(options);
+            default:
+                throw new Error(`Unknown scaling strategy: ${strategy}`);
+        }
+    }
+}
+exports.ScalingStrategy = ScalingStrategy;
+/**
+ * Static scaling strategy - maintains a fixed number of consumers
+ */
+class NoneScalingStrategy extends ScalingStrategy {
+    name = "none";
+    constructor(options) {
+        super(options);
+    }
+    calculateTargetCountInternal(currentCount) {
+        return currentCount;
+    }
+}
+exports.NoneScalingStrategy = NoneScalingStrategy;
+/**
+ * Smooth scaling strategy with EWMA smoothing and damping
+ * Uses exponentially weighted moving average for queue length smoothing
+ * and applies damping to prevent rapid oscillations.
+ */
+class SmoothScalingStrategy extends ScalingStrategy {
+    name = "smooth";
+    dampingFactor;
+    metricsProcessor;
+    constructor(options) {
+        super(options);
+        const dampingFactor = options?.dampingFactor ?? 0.7;
+        if (dampingFactor < 0 || dampingFactor > 1) {
+            throw new Error("dampingFactor must be between 0 and 1");
+        }
+        if (!options?.metricsProcessor) {
+            throw new Error("metricsProcessor is required for smooth scaling strategy");
+        }
+        this.dampingFactor = dampingFactor;
+        this.metricsProcessor = options.metricsProcessor;
+    }
+    calculateTargetCountInternal(currentCount) {
+        const smoothedQueueLength = this.metricsProcessor.getSmoothedValue();
+        // Calculate target consumers based on the configured ratio
+        const targetConsumers = Math.ceil(smoothedQueueLength / this.targetRatio);
+        // Apply damping factor to smooth out changes
+        // This prevents oscillation by only moving toward the target gradually
+        const dampedTarget = currentCount + (targetConsumers - currentCount) * this.dampingFactor;
+        // Return rounded value without clamping (handled by base class)
+        return Math.round(dampedTarget);
+    }
+}
+exports.SmoothScalingStrategy = SmoothScalingStrategy;
+/**
+ * Aggressive scaling strategy with threshold-based zones
+ * Uses threshold-based zones for different scaling behaviors.
+ * Scales up quickly when load increases but scales down cautiously.
+ */
+class AggressiveScalingStrategy extends ScalingStrategy {
+    name = "aggressive";
+    metricsProcessor;
+    constructor(options) {
+        super(options);
+        if (!options?.metricsProcessor) {
+            throw new Error("metricsProcessor is required for aggressive scaling strategy");
+        }
+        this.metricsProcessor = options.metricsProcessor;
+    }
+    calculateTargetCountInternal(currentCount) {
+        const smoothedQueueLength = this.metricsProcessor.getSmoothedValue();
+        // Calculate queue items per consumer,
+        const queuePerConsumer = smoothedQueueLength / (currentCount || 1);
+        // Define zones based on targetRatio
+        // Optimal zone: 0.5x to 2x the target ratio
+        const scaleDownThreshold = this.targetRatio * 0.5;
+        const scaleUpThreshold = this.targetRatio * 2.0;
+        if (queuePerConsumer < scaleDownThreshold) {
+            // Zone 1: Under-utilized (< 0.5x target ratio)
+            // Scale down gradually to avoid removing too many consumers
+            const reductionFactor = Math.max(0.9, 1 - (scaleDownThreshold - queuePerConsumer) * 0.1);
+            // Return without min clamping (handled by base class)
+            return Math.floor(currentCount * reductionFactor);
+        }
+        else if (queuePerConsumer > scaleUpThreshold) {
+            // Zone 3: Over-utilized (> 2x target ratio)
+            // Scale up aggressively based on queue pressure
+            let scaleFactor;
+            if (queuePerConsumer >= this.targetRatio * 5) {
+                // Critical: Queue is 5x target ratio or higher
+                scaleFactor = 1.5; // 50% increase
+            }
+            else if (queuePerConsumer >= this.targetRatio * 3) {
+                // High: Queue is 3x target ratio
+                scaleFactor = 1.3; // 30% increase
+            }
+            else {
+                // Moderate: Queue is 2x target ratio
+                scaleFactor = 1.1; // 10% increase
+            }
+            const targetCount = Math.ceil(currentCount * scaleFactor);
+            // Cap increase at 50% to prevent overshooting
+            const maxIncrement = Math.ceil(currentCount * 0.5);
+            // Return without max clamping (handled by base class)
+            return Math.min(currentCount + maxIncrement, targetCount);
+        }
+        else {
+            // Zone 2: Optimal (0.5x - 2x target ratio)
+            // Maintain current consumer count
+            return currentCount;
+        }
+    }
+    getThresholds(targetRatio) {
+        return {
+            scaleDownThreshold: targetRatio * 0.5,
+            scaleUpThreshold: targetRatio * 2.0,
+            criticalThreshold: targetRatio * 5.0,
+            highThreshold: targetRatio * 3.0,
+        };
+    }
+}
+exports.AggressiveScalingStrategy = AggressiveScalingStrategy;
+//# sourceMappingURL=scalingStrategies.js.map

package/dist/commonjs/v3/runEngineWorker/supervisor/scalingStrategies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalingStrategies.js","sourceRoot":"","sources":["../../../../../src/v3/runEngineWorker/supervisor/scalingStrategies.ts"],"names":[],"mappings":";;;AAYA;IAGmB,gBAAgB,CAAS;IACzB,gBAAgB,CAAS;IAEvB,WAAW,CAAS;IAEvC,YAAY,OAAgC;QAC1C,IAAI,CAAC,gBAAgB,GAAG,OAAO,EAAE,gBAAgB,IAAI,CAAC,CAAC;QACvD,IAAI,CAAC,gBAAgB,GAAG,OAAO,EAAE,gBAAgB,IAAI,EAAE,CAAC;QACxD,IAAI,CAAC,WAAW,GAAG,OAAO,EAAE,WAAW,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAAC,YAAoB;QACvC,MAAM,WAAW,GAAG,IAAI,CAAC,4BAA4B,CAAC,YAAY,CAAC,CAAC;QAEpE,8CAA8C;QAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,gBAAgB,CAAC,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;IACvF,CAAC;IAQD;;OAEG;IACH,MAAM,CAAC,MAAM,CAAC,QAA6B,EAAE,OAAgC;QAC3E,QAAQ,QAAQ,EAAE,CAAC;YACjB,KAAK,MAAM;gBACT,OAAO,IAAI,mBAAmB,CAAC,OAAO,CAAC,CAAC;YAE1C,KAAK,QAAQ;gBACX,OAAO,IAAI,qBAAqB,CAAC,OAAO,CAAC,CAAC;YAE5C,KAAK,YAAY;gBACf,OAAO,IAAI,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAEhD;gBACE,MAAM,IAAI,KAAK,CAAC,6BAA6B,QAAQ,EAAE,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;CACF;;AAED;;GAEG;AACH,yBAAiC,SAAQ,eAAe;IAC7C,IAAI,GAAG,MAAM,CAAC;IAEvB,YAAY,OAAgC;QAC1C,KAAK,CAAC,OAAO,CAAC,CAAC;IACjB,CAAC;IAES,4BAA4B,CAAC,YAAoB;QACzD,OAAO,YAAY,CAAC;IACtB,CAAC;CACF;;AAED;;;;GAIG;AACH,2BAAmC,SAAQ,eAAe;IAC/C,IAAI,GAAG,QAAQ,CAAC;IACR,aAAa,CAAS;IACtB,gBAAgB,CAAwB;IAEzD,YAAY,OAAgC;QAC1C,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,MAAM,aAAa,GAAG,OAAO,EAAE,aAAa,IAAI,GAAG,CAAC;QACpD,IAAI,aAAa,GAAG,CAAC,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,gBAAgB,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,0DAA0D,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;QACnC,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IACnD,CAAC;IAES,4BAA4B,CAAC,YAAoB;QACzD,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,CAAC;QAErE,2DAA2D;QAC3D,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAE1E,6CAA6C;QAC7C,uEAAuE;QACvE,MAAM,YAAY,GAAG,YAAY,GAAG,CAAC,eAAe,GAAG,YAAY,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAE1F,gEAAgE;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAClC,CAAC;CACF;;AAED;;;;GAIG;AACH,+BAAuC,SAAQ,eAAe;IACnD,IAAI,GAAG,YAAY,CAAC;IACZ,gBAAgB,CAAwB;IAEzD,YAAY,OAAgC;QAC1C,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,OAAO,EAAE,gBAAgB,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;IACnD,CAAC;IAES,4BAA4B,CAAC,YAAoB;QACzD,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,CAAC;QAErE,sCAAsC;QACtC,MAAM,gBAAgB,GAAG,mBAAmB,GAAG,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;QAEnE,oCAAoC;QACpC,4CAA4C;QAC5C,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QAClD,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QAEhD,IAAI,gBAAgB,GAAG,kBAAkB,EAAE,CAAC;YAC1C,+CAA+C;YAC/C,4DAA4D;YAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,kBAAkB,GAAG,gBAAgB,CAAC,GAAG,GAAG,CAAC,CAAC;YACzF,sDAAsD;YACtD,OAAO,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,eAAe,CAAC,CAAC;QACpD,CAAC;aAAM,IAAI,gBAAgB,GAAG,gBAAgB,EAAE,CAAC;YAC/C,4CAA4C;YAC5C,gDAAgD;YAChD,IAAI,WAAmB,CAAC;YACxB,IAAI,gBAAgB,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBAC7C,+CAA+C;gBAC/C,WAAW,GAAG,GAAG,CAAC,CAAC,eAAe;YACpC,CAAC;iBAAM,IAAI,gBAAgB,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;gBACpD,iCAAiC;gBACjC,WAAW,GAAG,GAAG,CAAC,CAAC,eAAe;YACpC,CAAC;iBAAM,CAAC;gBACN,qCAAqC;gBACrC,WAAW,GAAG,GAAG,CAAC,CAAC,eAAe;YACpC,CAAC;YAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC,CAAC;YAC1D,8CAA8C;YAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,GAAG,CAAC,CAAC;YACnD,sDAAsD;YACtD,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,GAAG,YAAY,EAAE,WAAW,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACN,2CAA2C;YAC3C,kCAAkC;YAClC,OAAO,YAAY,CAAC;QACtB,CAAC;IACH,CAAC;IAED,aAAa,CAAC,WAAmB;QAC/B,OAAO;YACL,kBAAkB,EAAE,WAAW,GAAG,GAAG;YACrC,gBAAgB,EAAE,WAAW,GAAG,GAAG;YACnC,iBAAiB,EAAE,WAAW,GAAG,GAAG;YACpC,aAAa,EAAE,WAAW,GAAG,GAAG;SACjC,CAAC;IACJ,CAAC;CACF"}