orpc-fn 0.1.0

package/dist/live/pub-sub.js

@@ -0,0 +1,529 @@
+import { ORPCError } from '@orpc/server';
+import { errorMessageOf } from '../otel.js';
+import { decodePayload, encodePayload } from './codec.js';
+// ═══════════════════════════════════════════════════════════════════════════
+// Bounded queue
+// ═══════════════════════════════════════════════════════════════════════════
+/**
+ * Bounded drop-oldest FIFO with "one overflow marker per overflow episode"
+ * semantics.
+ *
+ * On the FIRST overflow of an episode the oldest message is dropped and the
+ * marker from `createOverflowMarker` is enqueued INSTEAD of the new event - the
+ * subscriber's resync-from-cursor recovers the loss. While that marker is still
+ * queued, further overflows drop the oldest NON-marker message (the marker
+ * itself is never displaced) and enqueue the new event WITHOUT a second marker:
+ * the pending marker's resync already covers every drop that happens before it
+ * is delivered. Without this dedupe a sustained overflow converges the whole
+ * queue to markers - one full snapshot re-run per queued slot. Dequeuing the
+ * marker ends the episode; the next overflow starts a fresh one.
+ *
+ * `createOverflowMarker` absent (or returning null) falls back to plain
+ * drop-oldest with the new event enqueued.
+ */
+export function createBoundedEventQueue(opts) {
+    const items = [];
+    // The queued marker while an overflow episode is open. Created once per
+    // episode, so identity is the exact "is this the pending marker?" test.
+    let pendingOverflowMarker = null;
+    return {
+        get length() {
+            return items.length;
+        },
+        enqueue(data) {
+            if (items.length >= opts.maxSize) {
+                if (pendingOverflowMarker !== null) {
+                    // Episode already signalled: drop the oldest non-marker message
+                    // and enqueue WITHOUT a second marker.
+                    const dropIndex = items[0] === pendingOverflowMarker ? 1 : 0;
+                    if (dropIndex >= items.length) {
+                        // Degenerate maxSize: the queue is just the pending marker, so
+                        // the new event is the drop - the marker's resync covers it.
+                        opts.onDrop?.();
+                        return;
+                    }
+                    items.splice(dropIndex, 1);
+                    opts.onDrop?.();
+                    items.push(data);
+                    return;
+                }
+                items.shift();
+                opts.onDrop?.();
+                const marker = opts.createOverflowMarker?.() ?? null;
+                if (marker !== null) {
+                    pendingOverflowMarker = marker;
+                    items.push(marker);
+                    return;
+                }
+            }
+            items.push(data);
+        },
+        dequeue() {
+            const next = items.shift();
+            if (next !== undefined && next === pendingOverflowMarker) {
+                pendingOverflowMarker = null;
+            }
+            return next;
+        }
+    };
+}
+/**
+ * One subscriber's ordered, bounded delivery. Events wait in a bounded
+ * drop-oldest queue (see {@link createBoundedEventQueue}) BEFORE the
+ * subscriber's filter runs; the filter runs in order as the consumer reads,
+ * so a slow async filter neither reorders events nor lets pending work grow
+ * past `maxSize`. Overflow markers skip the filter.
+ */
+export function createSubscriberDelivery(options) {
+    const queue = createBoundedEventQueue({
+        maxSize: options.maxSize,
+        createOverflowMarker: () => {
+            const marker = options.overflowMarker?.() ?? null;
+            return marker === null ? null : { data: marker, marker: true };
+        },
+        onDrop: options.onDrop
+    });
+    let closed = false;
+    let wake = null;
+    const notify = () => {
+        wake?.();
+        wake = null;
+    };
+    async function* events() {
+        while (!closed) {
+            const item = queue.dequeue();
+            if (!item) {
+                await new Promise((resolve) => {
+                    wake = resolve;
+                });
+                continue;
+            }
+            if (!item.marker && options.accept) {
+                try {
+                    if (!(await options.accept(item.data)))
+                        continue;
+                }
+                catch (error) {
+                    options.onFilterError(error);
+                    continue;
+                }
+                if (closed)
+                    break;
+            }
+            yield item.data;
+        }
+    }
+    return {
+        push(data) {
+            if (closed)
+                return;
+            queue.enqueue({ data, marker: false });
+            notify();
+        },
+        events: events(),
+        /** Stop delivering; a parked read ends at once. */
+        close() {
+            closed = true;
+            notify();
+        }
+    };
+}
+// ═══════════════════════════════════════════════════════════════════════════
+// Runtime (internal: the typed surface is what `createFn` returns)
+// ═══════════════════════════════════════════════════════════════════════════
+const DEFAULT_MAX_QUEUE_SIZE = 1000;
+// Exponential resubscribe backoff with jitter so reconnecting subscribers don't stampede the broker.
+const RESUBSCRIBE_BASE_DELAY_MS = 1000;
+const RESUBSCRIBE_MAX_DELAY_MS = 30_000;
+const RESUBSCRIBE_MAX_JITTER_MS = 250;
+function getResubscribeDelayMs(attempt) {
+    const base = Math.min(RESUBSCRIBE_BASE_DELAY_MS * 2 ** attempt, RESUBSCRIBE_MAX_DELAY_MS);
+    return base + Math.floor(Math.random() * RESUBSCRIBE_MAX_JITTER_MS);
+}
+const resolveChannel = (channel, params, context) => (typeof channel === 'string' ? channel : channel(params, context));
+/** @internal */
+export function createLiveRuntime(options) {
+    const { tracing, createLogger } = options;
+    const logger = createLogger('pubsub', undefined);
+    // Deploy drain: every open subscription registers its close here. On
+    // SIGTERM the app ends them deliberately instead of letting the socket die
+    // with the process: the generator returns, oRPC closes the SSE response and
+    // the client's backoff reconnects to the new deployment.
+    const activeSubscriberCleanups = new Set();
+    const requireTransport = () => {
+        if (!options.pubsub) {
+            throw new Error('orpc-fn: live routes need a transport, pass createFn({ pubsub: { transport } })');
+        }
+        return options.pubsub.transport;
+    };
+    /**
+     * Shared publish pipeline: validate the raw event, resolve the channel from
+     * the parsed event, then publish the raw event (atomically maintaining the
+     * backlog when enabled) inside a producer span.
+     */
+    function createChannelPublisher(config) {
+        const { name, eventSchema, getChannelName, mirrorChannel } = config;
+        const backlog = config.useBacklog
+            ? { size: config.backlogSize ?? 50, ttlSeconds: config.backlogTtl ?? 30 }
+            : undefined;
+        const toMessages = async (items) => {
+            const messages = [];
+            for (const item of items) {
+                const data = (await eventSchema.parseAsync(item));
+                const channel = getChannelName(data);
+                const payload = encodePayload(item);
+                messages.push({ channel, payload });
+                if (mirrorChannel && mirrorChannel !== channel) {
+                    messages.push({ channel: mirrorChannel, payload });
+                }
+            }
+            return messages;
+        };
+        const send = (operation, items) => tracing.inSpan(`${name}:${operation}`, 'PRODUCER', async (span) => {
+            const startTime = performance.now();
+            try {
+                span?.setAttribute('pubsub.operation', operation);
+                span?.setAttribute('pubsub.name', name);
+                span?.setAttribute('pubsub.batch_size', items.length);
+                const messages = await toMessages(items);
+                const first = messages[0];
+                if (first) {
+                    span?.setAttribute('pubsub.channel', first.channel);
+                    span?.setAttribute('pubsub.payload_size', first.payload.length);
+                }
+                await requireTransport().publish(messages, backlog);
+            }
+            finally {
+                span?.setAttribute('pubsub.duration_ms', performance.now() - startTime);
+            }
+        });
+        return {
+            publish: (data) => send('publish', [data]),
+            publishMany: async (items) => {
+                if (items.length > 0)
+                    await send('publishMany', items);
+            }
+        };
+    }
+    /**
+     * Hubs for one pub/sub definition, keyed by channel. Many subscribers can
+     * share a channel (an org with many open tabs); one hub decodes and parses
+     * each payload once and fans the event out to every local subscriber,
+     * applying each subscriber's own filter. The hub also owns the broker
+     * subscription and its resubscribe backoff.
+     */
+    function createChannelHubs(config) {
+        const { eventSchema } = config;
+        const hubs = new Map();
+        const createHub = (channel) => {
+            const subscribers = new Set();
+            let closed = false;
+            let unsubscribe = null;
+            let attempt = 0;
+            let timer = null;
+            let markReady = () => { };
+            const ready = new Promise((resolve) => {
+                markReady = resolve;
+            });
+            // Parse in arrival order even when the schema is async.
+            // ponytail: unbounded while an async schema lags behind the broker;
+            // bound it if a channel can outpace its schema.
+            let parsing = Promise.resolve();
+            const deliver = async (raw) => {
+                let parsed;
+                try {
+                    parsed = await eventSchema.parseAsync(decodePayload(raw));
+                }
+                catch (error) {
+                    // Malformed payloads are dropped once for the whole channel.
+                    logger.warn(`Dropped malformed message on ${channel}`, {
+                        error: errorMessageOf(error)
+                    });
+                    return;
+                }
+                // Parsed once; each subscriber filters in its own delivery.
+                for (const sub of [...subscribers]) {
+                    if (sub.isActive())
+                        sub.push(parsed);
+                }
+            };
+            const release = (stale) => {
+                stale?.().catch((error) => {
+                    logger.warn(`Failed to unsubscribe from ${channel}`, {
+                        error: errorMessageOf(error)
+                    });
+                });
+            };
+            const scheduleResubscribe = (reason) => {
+                if (closed || timer)
+                    return;
+                const delayMs = getResubscribeDelayMs(attempt);
+                attempt++;
+                logger.warn(`Scheduling resubscribe for ${channel}`, {
+                    reason,
+                    attempt,
+                    delayMs
+                });
+                timer = setTimeout(() => {
+                    timer = null;
+                    if (closed)
+                        return;
+                    release(unsubscribe);
+                    unsubscribe = null;
+                    void connect();
+                }, delayMs);
+            };
+            const connect = async () => {
+                try {
+                    const next = await requireTransport().subscribe(channel, (raw) => {
+                        parsing = parsing.then(() => deliver(raw));
+                    }, (error) => {
+                        logger.error(`Subscription to ${channel} lost`, {
+                            error: error.message
+                        });
+                        scheduleResubscribe('lost');
+                    });
+                    if (closed)
+                        return release(next);
+                    unsubscribe = next;
+                    attempt = 0;
+                    logger.info(`Subscribed to ${channel}`);
+                }
+                catch (error) {
+                    logger.error(`Failed to subscribe to ${channel}`, {
+                        error: errorMessageOf(error)
+                    });
+                    scheduleResubscribe('subscribe-failed');
+                }
+                finally {
+                    // A failed first attempt must not hold subscribers forever; the
+                    // backoff keeps retrying in the background.
+                    markReady();
+                }
+            };
+            void connect();
+            return {
+                subscribers,
+                ready,
+                close: () => {
+                    closed = true;
+                    if (timer)
+                        clearTimeout(timer);
+                    timer = null;
+                    markReady();
+                    release(unsubscribe);
+                    unsubscribe = null;
+                }
+            };
+        };
+        return function addLocalSubscriber(channel, subscriber) {
+            let hub = hubs.get(channel);
+            if (!hub) {
+                hub = createHub(channel);
+                hubs.set(channel, hub);
+            }
+            hub.subscribers.add(subscriber);
+            const current = hub;
+            return {
+                ready: current.ready,
+                remove: () => {
+                    current.subscribers.delete(subscriber);
+                    if (current.subscribers.size === 0 && hubs.get(channel) === current) {
+                        current.close();
+                        hubs.delete(channel);
+                    }
+                }
+            };
+        };
+    }
+    /** Publish and open subscriptions on one channel definition. */
+    function createChannel(channelOptions) {
+        const { name, channel, eventSchema, filterFn, authFn, overflowMarker, useBacklog = false } = channelOptions;
+        const getChannelName = (params, context) => resolveChannel(channel, params, context);
+        const addLocalSubscriber = createChannelHubs({ eventSchema });
+        const open = async ({ input, context, signal }) => {
+            const transport = requireTransport();
+            const channelName = getChannelName(input, context);
+            const startTime = performance.now();
+            const span = tracing.startSpan(`${name}:subscribe`, 'SERVER', {
+                'pubsub.channel': channelName,
+                'pubsub.operation': 'subscribe',
+                'pubsub.name': name
+            });
+            const subscriberLogger = createLogger('pubsub', span);
+            try {
+                if (authFn !== undefined &&
+                    authFn !== true &&
+                    !(await authFn({ input, ctx: context }))) {
+                    throw new ORPCError('FORBIDDEN', {
+                        message: 'You do not have access to this subscription'
+                    });
+                }
+            }
+            catch (error) {
+                tracing.end(span, error);
+                throw error;
+            }
+            subscriberLogger.info(`Subscribing to ${channelName}`);
+            let messageCount = 0;
+            let droppedCount = 0;
+            const delivery = createSubscriberDelivery({
+                maxSize: options.pubsub?.maxQueueSize ?? DEFAULT_MAX_QUEUE_SIZE,
+                accept: filterFn && ((data) => filterFn({ input, data })),
+                overflowMarker: overflowMarker && (() => overflowMarker(input)),
+                onFilterError: (error) => subscriberLogger.error('Error processing message', {
+                    error: errorMessageOf(error)
+                }),
+                onDrop: () => {
+                    droppedCount++;
+                    options.pubsub?.onDrop?.(1, { name, channel: channelName });
+                }
+            });
+            // Live events wait here while the backlog replays, so replay comes first.
+            // ponytail: unbounded for the length of one backlog read.
+            let replaying = useBacklog ? [] : null;
+            const push = (data) => {
+                messageCount++;
+                if (replaying)
+                    replaying.push(data);
+                else
+                    delivery.push(data);
+            };
+            // The one way a subscription ends, whatever ends it: abort, drain, the
+            // stream finishing, or `close()`. Releases everything at once, even
+            // while the stream is parked or not yet read.
+            let closed = false;
+            const close = (...error) => {
+                if (closed)
+                    return;
+                closed = true;
+                delivery.close();
+                activeSubscriberCleanups.delete(stop);
+                signal?.removeEventListener('abort', stop);
+                local.remove();
+                const durationMs = performance.now() - startTime;
+                span?.setAttribute('pubsub.duration_ms', durationMs);
+                span?.setAttribute('pubsub.message_count', messageCount);
+                span?.setAttribute('pubsub.dropped_count', droppedCount);
+                tracing.end(span, ...error);
+                subscriberLogger.info(`Unsubscribed from ${channelName}`, {
+                    messageCount,
+                    droppedCount,
+                    durationMs: Math.round(durationMs)
+                });
+            };
+            const stop = () => close();
+            const local = addLocalSubscriber(channelName, {
+                isActive: () => !closed,
+                push
+            });
+            activeSubscriberCleanups.add(stop);
+            signal?.addEventListener('abort', stop);
+            if (signal?.aborted)
+                close();
+            // Subscribed before returning, so nothing published after `open`
+            // resolves is missed.
+            // ponytail: a failed first attempt also settles `ready` (the hub keeps
+            // retrying); events published before a retry succeeds are lost.
+            await local.ready;
+            if (replaying && !closed) {
+                try {
+                    const items = await transport.readBacklog(channelName);
+                    span?.setAttribute('pubsub.backlog_count', items.length);
+                    for (const raw of items) {
+                        if (closed)
+                            break;
+                        try {
+                            messageCount++;
+                            delivery.push(await eventSchema.parseAsync(decodePayload(raw)));
+                        }
+                        catch {
+                            // Ignore malformed backlog entries
+                        }
+                    }
+                }
+                catch (error) {
+                    // Live events still flow; only the backlog replay is lost.
+                    subscriberLogger.warn(`Failed to replay backlog for ${channelName}`, {
+                        error: errorMessageOf(error)
+                    });
+                }
+            }
+            // ponytail: an event both in the backlog and arriving live is delivered
+            // twice; events carry no id to dedupe on.
+            for (const data of replaying ?? [])
+                delivery.push(data);
+            replaying = null;
+            async function* events() {
+                try {
+                    yield* delivery.events;
+                }
+                finally {
+                    close();
+                }
+            }
+            return { events: events(), close: () => close() };
+        };
+        const { publish, publishMany } = createChannelPublisher({
+            ...channelOptions,
+            getChannelName
+        });
+        return { open, publish, publishMany, getChannelName };
+    }
+    function createPubSub(pubsubOptions) {
+        const { name } = pubsubOptions;
+        const channel = createChannel(pubsubOptions);
+        const subscribe = options.buildProcedure({
+            name,
+            procedure: pubsubOptions.procedure,
+            meta: {},
+            route: {
+                method: 'GET',
+                tags: pubsubOptions.tags,
+                summary: pubsubOptions.summary ?? `Subscribe to ${name}`,
+                description: pubsubOptions.description
+            },
+            input: pubsubOptions.inputSchema,
+            handler: async function* ({ input, context, signal }) {
+                // The generator from `events()` releases everything when it ends.
+                yield* (await channel.open({ input: input, context, signal }))
+                    .events;
+            }
+        });
+        const { publish, publishMany, getChannelName } = channel;
+        return { subscribe, publish, publishMany, getChannelName };
+    }
+    function createPublisher(publisherOptions) {
+        const getChannelName = (params) => resolveChannel(publisherOptions.channel, params);
+        const { publish, publishMany } = createChannelPublisher({
+            ...publisherOptions,
+            getChannelName
+        });
+        return { publish, publishMany, getChannelName };
+    }
+    return {
+        createChannel,
+        createPubSub,
+        createPublisher,
+        /** Open subscriptions of this instance (drain progress, gauges). */
+        activePubSubSubscriberCount: () => activeSubscriberCleanups.size,
+        /** End every open subscription; returns how many were closed. */
+        drainPubSubSubscribers: () => {
+            const cleanups = [...activeSubscriberCleanups];
+            activeSubscriberCleanups.clear();
+            for (const cleanup of cleanups) {
+                try {
+                    cleanup();
+                }
+                catch (error) {
+                    // A failed cleanup must not stop the drain.
+                    logger.warn('Subscriber cleanup failed during drain', {
+                        error: errorMessageOf(error)
+                    });
+                }
+            }
+            return cleanups.length;
+        }
+    };
+}
+//# sourceMappingURL=pub-sub.js.map

package/dist/live/pub-sub.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pub-sub.js","sourceRoot":"","sources":["../../src/live/pub-sub.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAA;AAGxC,OAAO,EAAE,cAAc,EAA+B,MAAM,YAAY,CAAA;AAUxE,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA;AAwKzD,8EAA8E;AAC9E,gBAAgB;AAChB,8EAA8E;AAE9E;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,uBAAuB,CAAI,IAK1C;IACA,MAAM,KAAK,GAAQ,EAAE,CAAA;IACrB,wEAAwE;IACxE,wEAAwE;IACxE,IAAI,qBAAqB,GAAa,IAAI,CAAA;IAE1C,OAAO;QACN,IAAI,MAAM;YACT,OAAO,KAAK,CAAC,MAAM,CAAA;QACpB,CAAC;QACD,OAAO,CAAC,IAAO;YACd,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClC,IAAI,qBAAqB,KAAK,IAAI,EAAE,CAAC;oBACpC,gEAAgE;oBAChE,uCAAuC;oBACvC,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;oBAC5D,IAAI,SAAS,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;wBAC/B,+DAA+D;wBAC/D,6DAA6D;wBAC7D,IAAI,CAAC,MAAM,EAAE,EAAE,CAAA;wBACf,OAAM;oBACP,CAAC;oBACD,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;oBAC1B,IAAI,CAAC,MAAM,EAAE,EAAE,CAAA;oBACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBAChB,OAAM;gBACP,CAAC;gBACD,KAAK,CAAC,KAAK,EAAE,CAAA;gBACb,IAAI,CAAC,MAAM,EAAE,EAAE,CAAA;gBACf,MAAM,MAAM,GAAG,IAAI,CAAC,oBAAoB,EAAE,EAAE,IAAI,IAAI,CAAA;gBACpD,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;oBACrB,qBAAqB,GAAG,MAAM,CAAA;oBAC9B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;oBAClB,OAAM;gBACP,CAAC;YACF,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjB,CAAC;QACD,OAAO;YACN,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAA;YAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,qBAAqB,EAAE,CAAC;gBAC1D,qBAAqB,GAAG,IAAI,CAAA;YAC7B,CAAC;YACD,OAAO,IAAI,CAAA;QACZ,CAAC;KACD,CAAA;AACF,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CAAI,OAM3C;IAEA,MAAM,KAAK,GAAG,uBAAuB,CAAO;QAC3C,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,oBAAoB,EAAE,GAAG,EAAE;YAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,EAAE,IAAI,IAAI,CAAA;YACjD,OAAO,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;QAC/D,CAAC;QACD,MAAM,EAAE,OAAO,CAAC,MAAM;KACtB,CAAC,CAAA;IACF,IAAI,MAAM,GAAG,KAAK,CAAA;IAClB,IAAI,IAAI,GAAwB,IAAI,CAAA;IACpC,MAAM,MAAM,GAAG,GAAG,EAAE;QACnB,IAAI,EAAE,EAAE,CAAA;QACR,IAAI,GAAG,IAAI,CAAA;IACZ,CAAC,CAAA;IAED,KAAK,SAAS,CAAC,CAAC,MAAM;QACrB,OAAO,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,EAAE,CAAA;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACX,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;oBACnC,IAAI,GAAG,OAAO,CAAA;gBACf,CAAC,CAAC,CAAA;gBACF,SAAQ;YACT,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACpC,IAAI,CAAC;oBACJ,IAAI,CAAC,CAAC,MAAM,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBAAE,SAAQ;gBACjD,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBAChB,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAA;oBAC5B,SAAQ;gBACT,CAAC;gBACD,IAAI,MAAM;oBAAE,MAAK;YAClB,CAAC;YACD,MAAM,IAAI,CAAC,IAAI,CAAA;QAChB,CAAC;IACF,CAAC;IAED,OAAO;QACN,IAAI,CAAC,IAAO;YACX,IAAI,MAAM;gBAAE,OAAM;YAClB,KAAK,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAA;YACtC,MAAM,EAAE,CAAA;QACT,CAAC;QACD,MAAM,EAAE,MAAM,EAAE;QAChB,mDAAmD;QACnD,KAAK;YACJ,MAAM,GAAG,IAAI,CAAA;YACb,MAAM,EAAE,CAAA;QACT,CAAC;KACD,CAAA;AACF,CAAC;AAED,8EAA8E;AAC9E,mEAAmE;AACnE,8EAA8E;AAE9E,MAAM,sBAAsB,GAAG,IAAI,CAAA;AAEnC,qGAAqG;AACrG,MAAM,yBAAyB,GAAG,IAAI,CAAA;AACtC,MAAM,wBAAwB,GAAG,MAAM,CAAA;AACvC,MAAM,yBAAyB,GAAG,GAAG,CAAA;AAErC,SAAS,qBAAqB,CAAC,OAAe;IAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CACpB,yBAAyB,GAAG,CAAC,IAAI,OAAO,EACxC,wBAAwB,CACxB,CAAA;IACD,OAAO,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,yBAAyB,CAAC,CAAA;AACpE,CAAC;AA8CD,MAAM,cAAc,GAAG,CACtB,OAAgE,EAChE,MAAa,EACb,OAAiB,EAChB,EAAE,CAAC,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;AAEvE,gBAAgB;AAChB,MAAM,UAAU,iBAAiB,CAAC,OAA2B;IAC5D,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,OAAO,CAAA;IACzC,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;IAChD,qEAAqE;IACrE,2EAA2E;IAC3E,4EAA4E;IAC5E,yDAAyD;IACzD,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAc,CAAA;IAEtD,MAAM,gBAAgB,GAAG,GAAG,EAAE;QAC7B,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CACd,iFAAiF,CACjF,CAAA;QACF,CAAC;QACD,OAAO,OAAO,CAAC,MAAM,CAAC,SAAS,CAAA;IAChC,CAAC,CAAA;IAED;;;;OAIG;IACH,SAAS,sBAAsB,CAC9B,MAGC;QAED,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,cAAc,EAAE,aAAa,EAAE,GAAG,MAAM,CAAA;QACnE,MAAM,OAAO,GAA+B,MAAM,CAAC,UAAU;YAC5D,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,WAAW,IAAI,EAAE,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,EAAE,EAAE;YACzE,CAAC,CAAC,SAAS,CAAA;QAEZ,MAAM,UAAU,GAAG,KAAK,EAAE,KAAyB,EAAE,EAAE;YACtD,MAAM,QAAQ,GAAoB,EAAE,CAAA;YACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,CAAC,MAAM,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,CAAU,CAAA;gBAC1D,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;gBACpC,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,CAAA;gBACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;gBACnC,IAAI,aAAa,IAAI,aAAa,KAAK,OAAO,EAAE,CAAC;oBAChD,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,CAAA;gBACnD,CAAC;YACF,CAAC;YACD,OAAO,QAAQ,CAAA;QAChB,CAAC,CAAA;QAED,MAAM,IAAI,GAAG,CACZ,SAAoC,EACpC,KAAyB,EACxB,EAAE,CACH,OAAO,CAAC,MAAM,CAAC,GAAG,IAAI,IAAI,SAAS,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE;YACjE,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;YACnC,IAAI,CAAC;gBACJ,IAAI,EAAE,YAAY,CAAC,kBAAkB,EAAE,SAAS,CAAC,CAAA;gBACjD,IAAI,EAAE,YAAY,CAAC,aAAa,EAAE,IAAI,CAAC,CAAA;gBACvC,IAAI,EAAE,YAAY,CAAC,mBAAmB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;gBACrD,MAAM,QAAQ,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,CAAA;gBACxC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAA;gBACzB,IAAI,KAAK,EAAE,CAAC;oBACX,IAAI,EAAE,YAAY,CAAC,gBAAgB,EAAE,KAAK,CAAC,OAAO,CAAC,CAAA;oBACnD,IAAI,EAAE,YAAY,CAAC,qBAAqB,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;gBAChE,CAAC;gBACD,MAAM,gBAAgB,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;YACpD,CAAC;oBAAS,CAAC;gBACV,IAAI,EAAE,YAAY,CACjB,oBAAoB,EACpB,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAC7B,CAAA;YACF,CAAC;QACF,CAAC,CAAC,CAAA;QAEH,OAAO;YACN,OAAO,EAAE,CAAC,IAAa,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC;YACnD,WAAW,EAAE,KAAK,EAAE,KAAyB,EAAE,EAAE;gBAChD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,CAAA;YACvD,CAAC;SACD,CAAA;IACF,CAAC;IAED;;;;;;OAMG;IACH,SAAS,iBAAiB,CAAC,MAAgC;QAC1D,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,CAAA;QAC9B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAe,CAAA;QAEnC,MAAM,SAAS,GAAG,CAAC,OAAe,EAAO,EAAE;YAC1C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAmB,CAAA;YAC9C,IAAI,MAAM,GAAG,KAAK,CAAA;YAClB,IAAI,WAAW,GAAiC,IAAI,CAAA;YACpD,IAAI,OAAO,GAAG,CAAC,CAAA;YACf,IAAI,KAAK,GAAyC,IAAI,CAAA;YACtD,IAAI,SAAS,GAAG,GAAG,EAAE,GAAE,CAAC,CAAA;YACxB,MAAM,KAAK,GAAG,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;gBAC3C,SAAS,GAAG,OAAO,CAAA;YACpB,CAAC,CAAC,CAAA;YACF,wDAAwD;YACxD,oEAAoE;YACpE,gDAAgD;YAChD,IAAI,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;YAE/B,MAAM,OAAO,GAAG,KAAK,EAAE,GAAW,EAAE,EAAE;gBACrC,IAAI,MAAe,CAAA;gBACnB,IAAI,CAAC;oBACJ,MAAM,GAAG,MAAM,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAA;gBAC1D,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBAChB,6DAA6D;oBAC7D,MAAM,CAAC,IAAI,CAAC,gCAAgC,OAAO,EAAE,EAAE;wBACtD,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;qBAC5B,CAAC,CAAA;oBACF,OAAM;gBACP,CAAC;gBACD,4DAA4D;gBAC5D,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC;oBACpC,IAAI,GAAG,CAAC,QAAQ,EAAE;wBAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACrC,CAAC;YACF,CAAC,CAAA;YAED,MAAM,OAAO,GAAG,CAAC,KAAmC,EAAE,EAAE;gBACvD,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;oBACzB,MAAM,CAAC,IAAI,CAAC,8BAA8B,OAAO,EAAE,EAAE;wBACpD,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;qBAC5B,CAAC,CAAA;gBACH,CAAC,CAAC,CAAA;YACH,CAAC,CAAA;YAED,MAAM,mBAAmB,GAAG,CAAC,MAAc,EAAE,EAAE;gBAC9C,IAAI,MAAM,IAAI,KAAK;oBAAE,OAAM;gBAC3B,MAAM,OAAO,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAA;gBAC9C,OAAO,EAAE,CAAA;gBACT,MAAM,CAAC,IAAI,CAAC,8BAA8B,OAAO,EAAE,EAAE;oBACpD,MAAM;oBACN,OAAO;oBACP,OAAO;iBACP,CAAC,CAAA;gBACF,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;oBACvB,KAAK,GAAG,IAAI,CAAA;oBACZ,IAAI,MAAM;wBAAE,OAAM;oBAClB,OAAO,CAAC,WAAW,CAAC,CAAA;oBACpB,WAAW,GAAG,IAAI,CAAA;oBAClB,KAAK,OAAO,EAAE,CAAA;gBACf,CAAC,EAAE,OAAO,CAAC,CAAA;YACZ,CAAC,CAAA;YAED,MAAM,OAAO,GAAG,KAAK,IAAI,EAAE;gBAC1B,IAAI,CAAC;oBACJ,MAAM,IAAI,GAAG,MAAM,gBAAgB,EAAE,CAAC,SAAS,CAC9C,OAAO,EACP,CAAC,GAAG,EAAE,EAAE;wBACP,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAA;oBAC3C,CAAC,EACD,CAAC,KAAK,EAAE,EAAE;wBACT,MAAM,CAAC,KAAK,CAAC,mBAAmB,OAAO,OAAO,EAAE;4BAC/C,KAAK,EAAE,KAAK,CAAC,OAAO;yBACpB,CAAC,CAAA;wBACF,mBAAmB,CAAC,MAAM,CAAC,CAAA;oBAC5B,CAAC,CACD,CAAA;oBACD,IAAI,MAAM;wBAAE,OAAO,OAAO,CAAC,IAAI,CAAC,CAAA;oBAChC,WAAW,GAAG,IAAI,CAAA;oBAClB,OAAO,GAAG,CAAC,CAAA;oBACX,MAAM,CAAC,IAAI,CAAC,iBAAiB,OAAO,EAAE,CAAC,CAAA;gBACxC,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBAChB,MAAM,CAAC,KAAK,CAAC,0BAA0B,OAAO,EAAE,EAAE;wBACjD,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;qBAC5B,CAAC,CAAA;oBACF,mBAAmB,CAAC,kBAAkB,CAAC,CAAA;gBACxC,CAAC;wBAAS,CAAC;oBACV,gEAAgE;oBAChE,4CAA4C;oBAC5C,SAAS,EAAE,CAAA;gBACZ,CAAC;YACF,CAAC,CAAA;YAED,KAAK,OAAO,EAAE,CAAA;YAEd,OAAO;gBACN,WAAW;gBACX,KAAK;gBACL,KAAK,EAAE,GAAG,EAAE;oBACX,MAAM,GAAG,IAAI,CAAA;oBACb,IAAI,KAAK;wBAAE,YAAY,CAAC,KAAK,CAAC,CAAA;oBAC9B,KAAK,GAAG,IAAI,CAAA;oBACZ,SAAS,EAAE,CAAA;oBACX,OAAO,CAAC,WAAW,CAAC,CAAA;oBACpB,WAAW,GAAG,IAAI,CAAA;gBACnB,CAAC;aACD,CAAA;QACF,CAAC,CAAA;QAED,OAAO,SAAS,kBAAkB,CACjC,OAAe,EACf,UAA2B;YAE3B,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;gBACV,GAAG,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;gBACxB,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;YACvB,CAAC;YACD,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YAC/B,MAAM,OAAO,GAAG,GAAG,CAAA;YACnB,OAAO;gBACN,KAAK,EAAE,OAAO,CAAC,KAAK;gBACpB,MAAM,EAAE,GAAG,EAAE;oBACZ,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;oBACtC,IAAI,OAAO,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,OAAO,EAAE,CAAC;wBACrE,OAAO,CAAC,KAAK,EAAE,CAAA;wBACf,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;oBACrB,CAAC;gBACF,CAAC;aACD,CAAA;QACF,CAAC,CAAA;IACF,CAAC;IAED,gEAAgE;IAChE,SAAS,aAAa,CAAC,cAA8B;QACpD,MAAM,EACL,IAAI,EACJ,OAAO,EACP,WAAW,EACX,QAAQ,EACR,MAAM,EACN,cAAc,EACd,UAAU,GAAG,KAAK,EAClB,GAAG,cAAc,CAAA;QAElB,MAAM,cAAc,GAAG,CAAC,MAAa,EAAE,OAAiB,EAAE,EAAE,CAC3D,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;QACzC,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,EAAE,WAAW,EAAE,CAAC,CAAA;QAE7D,MAAM,IAAI,GAAoB,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE;YAClE,MAAM,SAAS,GAAG,gBAAgB,EAAE,CAAA;YACpC,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;YAClD,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;YACnC,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,IAAI,YAAY,EAAE,QAAQ,EAAE;gBAC7D,gBAAgB,EAAE,WAAW;gBAC7B,kBAAkB,EAAE,WAAW;gBAC/B,aAAa,EAAE,IAAI;aACnB,CAAC,CAAA;YACF,MAAM,gBAAgB,GAAG,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;YAErD,IAAI,CAAC;gBACJ,IACC,MAAM,KAAK,SAAS;oBACpB,MAAM,KAAK,IAAI;oBACf,CAAC,CAAC,MAAM,MAAM,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC,EACvC,CAAC;oBACF,MAAM,IAAI,SAAS,CAAC,WAAW,EAAE;wBAChC,OAAO,EAAE,6CAA6C;qBACtD,CAAC,CAAA;gBACH,CAAC;YACF,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBAChB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACxB,MAAM,KAAK,CAAA;YACZ,CAAC;YAED,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,WAAW,EAAE,CAAC,CAAA;YAEtD,IAAI,YAAY,GAAG,CAAC,CAAA;YACpB,IAAI,YAAY,GAAG,CAAC,CAAA;YACpB,MAAM,QAAQ,GAAG,wBAAwB,CAAU;gBAClD,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,YAAY,IAAI,sBAAsB;gBAC/D,MAAM,EAAE,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;gBACzD,cAAc,EAAE,cAAc,IAAI,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;gBAC/D,aAAa,EAAE,CAAC,KAAK,EAAE,EAAE,CACxB,gBAAgB,CAAC,KAAK,CAAC,0BAA0B,EAAE;oBAClD,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;iBAC5B,CAAC;gBACH,MAAM,EAAE,GAAG,EAAE;oBACZ,YAAY,EAAE,CAAA;oBACd,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;gBAC5D,CAAC;aACD,CAAC,CAAA;YACF,0EAA0E;YAC1E,0DAA0D;YAC1D,IAAI,SAAS,GAAqB,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAA;YACxD,MAAM,IAAI,GAAG,CAAC,IAAa,EAAE,EAAE;gBAC9B,YAAY,EAAE,CAAA;gBACd,IAAI,SAAS;oBAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;oBAC9B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACzB,CAAC,CAAA;YAED,uEAAuE;YACvE,oEAAoE;YACpE,8CAA8C;YAC9C,IAAI,MAAM,GAAG,KAAK,CAAA;YAClB,MAAM,KAAK,GAAG,CAAC,GAAG,KAAqB,EAAE,EAAE;gBAC1C,IAAI,MAAM;oBAAE,OAAM;gBAClB,MAAM,GAAG,IAAI,CAAA;gBACb,QAAQ,CAAC,KAAK,EAAE,CAAA;gBAChB,wBAAwB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBACrC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;gBAC1C,KAAK,CAAC,MAAM,EAAE,CAAA;gBACd,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAA;gBAChD,IAAI,EAAE,YAAY,CAAC,oBAAoB,EAAE,UAAU,CAAC,CAAA;gBACpD,IAAI,EAAE,YAAY,CAAC,sBAAsB,EAAE,YAAY,CAAC,CAAA;gBACxD,IAAI,EAAE,YAAY,CAAC,sBAAsB,EAAE,YAAY,CAAC,CAAA;gBACxD,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC3B,gBAAgB,CAAC,IAAI,CAAC,qBAAqB,WAAW,EAAE,EAAE;oBACzD,YAAY;oBACZ,YAAY;oBACZ,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC;iBAClC,CAAC,CAAA;YACH,CAAC,CAAA;YACD,MAAM,IAAI,GAAG,GAAG,EAAE,CAAC,KAAK,EAAE,CAAA;YAC1B,MAAM,KAAK,GAAG,kBAAkB,CAAC,WAAW,EAAE;gBAC7C,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM;gBACvB,IAAI;aACJ,CAAC,CAAA;YACF,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAClC,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;YACvC,IAAI,MAAM,EAAE,OAAO;gBAAE,KAAK,EAAE,CAAA;YAE5B,iEAAiE;YACjE,sBAAsB;YACtB,uEAAuE;YACvE,gEAAgE;YAChE,MAAM,KAAK,CAAC,KAAK,CAAA;YACjB,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC;oBACJ,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,WAAW,CAAC,WAAW,CAAC,CAAA;oBACtD,IAAI,EAAE,YAAY,CAAC,sBAAsB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;oBACxD,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;wBACzB,IAAI,MAAM;4BAAE,MAAK;wBACjB,IAAI,CAAC;4BACJ,YAAY,EAAE,CAAA;4BACd,QAAQ,CAAC,IAAI,CAAC,MAAM,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;wBAChE,CAAC;wBAAC,MAAM,CAAC;4BACR,mCAAmC;wBACpC,CAAC;oBACF,CAAC;gBACF,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBAChB,2DAA2D;oBAC3D,gBAAgB,CAAC,IAAI,CAAC,gCAAgC,WAAW,EAAE,EAAE;wBACpE,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;qBAC5B,CAAC,CAAA;gBACH,CAAC;YACF,CAAC;YACD,wEAAwE;YACxE,0CAA0C;YAC1C,KAAK,MAAM,IAAI,IAAI,SAAS,IAAI,EAAE;gBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvD,SAAS,GAAG,IAAI,CAAA;YAEhB,KAAK,SAAS,CAAC,CAAC,MAAM;gBACrB,IAAI,CAAC;oBACJ,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAA;gBACvB,CAAC;wBAAS,CAAC;oBACV,KAAK,EAAE,CAAA;gBACR,CAAC;YACF,CAAC;YAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE,CAAA;QAClD,CAAC,CAAA;QAED,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,sBAAsB,CAAC;YACvD,GAAG,cAAc;YACjB,cAAc;SACd,CAAC,CAAA;QAEF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,CAAA;IACtD,CAAC;IAED,SAAS,YAAY,CACpB,aAMC;QAED,MAAM,EAAE,IAAI,EAAE,GAAG,aAAa,CAAA;QAC9B,MAAM,OAAO,GAAG,aAAa,CAAC,aAAa,CAAC,CAAA;QAC5C,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,CAAC;YACxC,IAAI;YACJ,SAAS,EAAE,aAAa,CAAC,SAAS;YAClC,IAAI,EAAE,EAAE;YACR,KAAK,EAAE;gBACN,MAAM,EAAE,KAAK;gBACb,IAAI,EAAE,aAAa,CAAC,IAAI;gBACxB,OAAO,EAAE,aAAa,CAAC,OAAO,IAAI,gBAAgB,IAAI,EAAE;gBACxD,WAAW,EAAE,aAAa,CAAC,WAAW;aACtC;YACD,KAAK,EAAE,aAAa,CAAC,WAAW;YAChC,OAAO,EAAE,KAAK,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE;gBACnD,kEAAkE;gBAClE,KAAK,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAc,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;qBACrE,MAAM,CAAA;YACT,CAAC;SACD,CAAC,CAAA;QAEF,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,GAAG,OAAO,CAAA;QACxD,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,CAAA;IAC3D,CAAC;IAED,SAAS,eAAe,CAAC,gBAA2C;QACnE,MAAM,cAAc,GAAG,CAAC,MAAa,EAAE,EAAE,CACxC,cAAc,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAA;QACjD,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,sBAAsB,CAAC;YACvD,GAAG,gBAAgB;YACnB,cAAc;SACd,CAAC,CAAA;QACF,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,CAAA;IAChD,CAAC;IAED,OAAO;QACN,aAAa;QACb,YAAY;QACZ,eAAe;QACf,oEAAoE;QACpE,2BAA2B,EAAE,GAAG,EAAE,CAAC,wBAAwB,CAAC,IAAI;QAChE,iEAAiE;QACjE,sBAAsB,EAAE,GAAG,EAAE;YAC5B,MAAM,QAAQ,GAAG,CAAC,GAAG,wBAAwB,CAAC,CAAA;YAC9C,wBAAwB,CAAC,KAAK,EAAE,CAAA;YAChC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAChC,IAAI,CAAC;oBACJ,OAAO,EAAE,CAAA;gBACV,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBAChB,4CAA4C;oBAC5C,MAAM,CAAC,IAAI,CAAC,wCAAwC,EAAE;wBACrD,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC;qBAC5B,CAAC,CAAA;gBACH,CAAC;YACF,CAAC;YACD,OAAO,QAAQ,CAAC,MAAM,CAAA;QACvB,CAAC;KACD,CAAA;AACF,CAAC","sourcesContent":["import type { Schema } from '@orpc/contract'\nimport { ORPCError } from '@orpc/server'\nimport type { ZodObject, ZodRawShape, ZodType, z } from 'zod'\nimport type { FnLogger } from '../logger.js'\nimport { errorMessageOf, type SpanLike, type Tracing } from '../otel.js'\nimport type {\n\tBuildProcedure,\n\tFnContext,\n\tFnDefinition,\n\tFnProcedure,\n\tMaybePromise,\n\tProcedureKey,\n\tProcedureOption\n} from '../types.js'\nimport { decodePayload, encodePayload } from './codec.js'\nimport type {\n\tBacklogOptions,\n\tPubSubMessage,\n\tPubSubTransport\n} from './transport.js'\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Types\n//\n// Publishers pass an event schema's INPUT (`z.input`); subscribers, filters\n// and channel resolvers see its OUTPUT (`z.output`). The raw input travels on\n// the wire and every receiver parses it once.\n// ═══════════════════════════════════════════════════════════════════════════\n\n/** Any Zod object schema, including `.strict()`, `.passthrough()` and `.catchall()`. */\nexport type ObjectSchema = ZodObject<ZodRawShape, z.core.$ZodObjectConfig>\n\n/**\n * A static channel name, or one derived from (partial) subscriber input or\n * event data.\n */\nexport type ChannelDefinition<TInput, TEventData, TContext = unknown> =\n\t| string\n\t| ((\n\t\t\tparams: Partial<TInput> | Partial<TEventData>,\n\t\t\tcontext?: TContext\n\t  ) => string)\n\n/** Decides whether one event reaches one subscriber. */\nexport type FilterFn<TInput, TEventData> = (params: {\n\tinput: TInput\n\tdata: TEventData\n}) => MaybePromise<boolean>\n\n/**\n * Checked when a subscription opens, before anything is sent. `true` allows\n * everyone; a function returns false (or throws) to refuse with FORBIDDEN.\n */\nexport type AuthFn<TInput, TContext> =\n\t| ((params: { input: TInput; ctx: TContext }) => MaybePromise<boolean>)\n\t| true\n\nexport type PublisherConfig = {\n\t/** Required name for tracing (e.g. 'chat.messages'). */\n\tname: string\n\t/**\n\t * Store recent events in a backlog list; new subscribers receive it before\n\t * live events. Default: false\n\t */\n\tuseBacklog?: boolean\n\t/** Maximum backlog items to keep (default: 50). */\n\tbacklogSize?: number\n\t/** Backlog TTL in seconds (default: 30). */\n\tbacklogTtl?: number\n\t/**\n\t * Also publish every payload to this channel (with its own backlog when\n\t * `useBacklog`). Subscribers still use `channel`. Equal to the primary\n\t * channel means no duplicate work.\n\t */\n\tmirrorChannel?: string\n}\n\nexport type PubSubOptions<\n\tTDef extends FnDefinition,\n\tTInputSchema extends ObjectSchema,\n\tTEventSchema extends ZodType,\n\tTKey extends ProcedureKey<TDef>\n> = PublisherConfig & {\n\tchannel: ChannelDefinition<\n\t\tz.output<TInputSchema>,\n\t\tz.output<TEventSchema>,\n\t\tFnContext<TDef, TKey>\n\t>\n\t/** What the subscriber provides. */\n\tinputSchema: TInputSchema\n\t/** What gets published. */\n\teventSchema: TEventSchema\n\tfilterFn?: FilterFn<z.output<TInputSchema>, z.output<TEventSchema>>\n\tauthFn?: AuthFn<z.output<TInputSchema>, FnContext<TDef, TKey>>\n\t/**\n\t * When a slow subscriber's queue overflows (drop-oldest), enqueue this\n\t * marker INSTEAD of the new event so the subscriber resyncs from its\n\t * cursor. A wholly dropped item leaves no per-item gap a consumer could\n\t * detect, so the marker is the only reliable live signal of loss. Return\n\t * null to skip.\n\t */\n\toverflowMarker?: (\n\t\tinput: z.output<TInputSchema>\n\t) => z.output<TEventSchema> | null\n\ttags?: TDef['tag'][]\n\tsummary?: string\n\tdescription?: string\n}\n\nexport type PubSub<\n\tTDef extends FnDefinition,\n\tTInputSchema extends ObjectSchema,\n\tTEventSchema extends ZodType,\n\tTKey extends ProcedureKey<TDef>\n> = {\n\tsubscribe: FnProcedure<\n\t\tTDef,\n\t\tTKey,\n\t\tTInputSchema,\n\t\tSchema<\n\t\t\tAsyncGenerator<z.output<TEventSchema>, void, unknown>,\n\t\t\tAsyncGenerator<z.output<TEventSchema>, void, unknown>\n\t\t>\n\t>\n\tpublish: (data: z.input<TEventSchema>) => Promise<void>\n\t/** Publish a batch in one atomic round-trip; items may target different channels. */\n\tpublishMany: (items: readonly z.input<TEventSchema>[]) => Promise<void>\n\tgetChannelName: (\n\t\tparams: Partial<z.output<TInputSchema>> | Partial<z.output<TEventSchema>>,\n\t\tcontext?: FnContext<TDef, TKey>\n\t) => string\n}\n\nexport type CreatePubSub<TDef extends FnDefinition> = <\n\tTInputSchema extends ObjectSchema,\n\tTEventSchema extends ZodType,\n\tTKey extends ProcedureKey<TDef> = TDef['default']\n>(\n\toptions: PubSubOptions<TDef, TInputSchema, TEventSchema, NoInfer<TKey>> &\n\t\t/** Which `procedures` builder the subscribe route uses. */\n\t\tProcedureOption<TDef, TKey>\n) => PubSub<TDef, TInputSchema, TEventSchema, TKey>\n\nexport type PublisherOptions<TEventSchema extends ZodType> = PublisherConfig & {\n\t/** Static channel name, or a resolver over (partial) parsed event data. */\n\tchannel: string | ((params: Partial<z.output<TEventSchema>>) => string)\n\teventSchema: TEventSchema\n}\n\nexport type Publisher<TEventSchema extends ZodType> = {\n\tpublish: (data: z.input<TEventSchema>) => Promise<void>\n\tpublishMany: (items: readonly z.input<TEventSchema>[]) => Promise<void>\n\tgetChannelName: (params: Partial<z.output<TEventSchema>>) => string\n}\n\n/**\n * Publish-only counterpart to `createPubSub`, for buses whose subscribe side\n * lives elsewhere (e.g. an `fnLive` route sharing the channel and schema).\n */\nexport type CreatePublisher = <TEventSchema extends ZodType>(\n\toptions: PublisherOptions<TEventSchema>\n) => Publisher<TEventSchema>\n\nexport type PubSubRuntimeOptions = {\n\ttransport: PubSubTransport\n\t/**\n\t * Called once per event dropped from a slow subscriber's queue. Events wait\n\t * there before the subscriber's filter runs, so drops count unfiltered events.\n\t */\n\tonDrop?: (count: number, info: { name: string; channel: string }) => void\n\t/** Per-subscriber queue bound before drop-oldest (default: 1000). */\n\tmaxQueueSize?: number\n}\n\n/** @internal */\nexport type LiveRuntimeOptions = {\n\tbuildProcedure: BuildProcedure\n\ttracing: Tracing\n\tcreateLogger: (scope: string, span: SpanLike | undefined) => FnLogger\n\tpubsub?: PubSubRuntimeOptions | undefined\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Bounded queue\n// ═══════════════════════════════════════════════════════════════════════════\n\n/**\n * Bounded drop-oldest FIFO with \"one overflow marker per overflow episode\"\n * semantics.\n *\n * On the FIRST overflow of an episode the oldest message is dropped and the\n * marker from `createOverflowMarker` is enqueued INSTEAD of the new event - the\n * subscriber's resync-from-cursor recovers the loss. While that marker is still\n * queued, further overflows drop the oldest NON-marker message (the marker\n * itself is never displaced) and enqueue the new event WITHOUT a second marker:\n * the pending marker's resync already covers every drop that happens before it\n * is delivered. Without this dedupe a sustained overflow converges the whole\n * queue to markers - one full snapshot re-run per queued slot. Dequeuing the\n * marker ends the episode; the next overflow starts a fresh one.\n *\n * `createOverflowMarker` absent (or returning null) falls back to plain\n * drop-oldest with the new event enqueued.\n */\nexport function createBoundedEventQueue<T>(opts: {\n\tmaxSize: number\n\tcreateOverflowMarker?: () => T | null\n\t/** Called once per dropped message (metrics/counters). */\n\tonDrop?: () => void\n}) {\n\tconst items: T[] = []\n\t// The queued marker while an overflow episode is open. Created once per\n\t// episode, so identity is the exact \"is this the pending marker?\" test.\n\tlet pendingOverflowMarker: T | null = null\n\n\treturn {\n\t\tget length() {\n\t\t\treturn items.length\n\t\t},\n\t\tenqueue(data: T): void {\n\t\t\tif (items.length >= opts.maxSize) {\n\t\t\t\tif (pendingOverflowMarker !== null) {\n\t\t\t\t\t// Episode already signalled: drop the oldest non-marker message\n\t\t\t\t\t// and enqueue WITHOUT a second marker.\n\t\t\t\t\tconst dropIndex = items[0] === pendingOverflowMarker ? 1 : 0\n\t\t\t\t\tif (dropIndex >= items.length) {\n\t\t\t\t\t\t// Degenerate maxSize: the queue is just the pending marker, so\n\t\t\t\t\t\t// the new event is the drop - the marker's resync covers it.\n\t\t\t\t\t\topts.onDrop?.()\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\titems.splice(dropIndex, 1)\n\t\t\t\t\topts.onDrop?.()\n\t\t\t\t\titems.push(data)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\titems.shift()\n\t\t\t\topts.onDrop?.()\n\t\t\t\tconst marker = opts.createOverflowMarker?.() ?? null\n\t\t\t\tif (marker !== null) {\n\t\t\t\t\tpendingOverflowMarker = marker\n\t\t\t\t\titems.push(marker)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\t\titems.push(data)\n\t\t},\n\t\tdequeue(): T | undefined {\n\t\t\tconst next = items.shift()\n\t\t\tif (next !== undefined && next === pendingOverflowMarker) {\n\t\t\t\tpendingOverflowMarker = null\n\t\t\t}\n\t\t\treturn next\n\t\t}\n\t}\n}\n\n/**\n * One subscriber's ordered, bounded delivery. Events wait in a bounded\n * drop-oldest queue (see {@link createBoundedEventQueue}) BEFORE the\n * subscriber's filter runs; the filter runs in order as the consumer reads,\n * so a slow async filter neither reorders events nor lets pending work grow\n * past `maxSize`. Overflow markers skip the filter.\n */\nexport function createSubscriberDelivery<T>(options: {\n\tmaxSize: number\n\taccept?: ((data: T) => MaybePromise<boolean>) | undefined\n\toverflowMarker?: (() => T | null) | undefined\n\tonFilterError: (error: unknown) => void\n\tonDrop: () => void\n}) {\n\ttype Item = { data: T; marker: boolean }\n\tconst queue = createBoundedEventQueue<Item>({\n\t\tmaxSize: options.maxSize,\n\t\tcreateOverflowMarker: () => {\n\t\t\tconst marker = options.overflowMarker?.() ?? null\n\t\t\treturn marker === null ? null : { data: marker, marker: true }\n\t\t},\n\t\tonDrop: options.onDrop\n\t})\n\tlet closed = false\n\tlet wake: (() => void) | null = null\n\tconst notify = () => {\n\t\twake?.()\n\t\twake = null\n\t}\n\n\tasync function* events(): AsyncGenerator<T, void, unknown> {\n\t\twhile (!closed) {\n\t\t\tconst item = queue.dequeue()\n\t\t\tif (!item) {\n\t\t\t\tawait new Promise<void>((resolve) => {\n\t\t\t\t\twake = resolve\n\t\t\t\t})\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif (!item.marker && options.accept) {\n\t\t\t\ttry {\n\t\t\t\t\tif (!(await options.accept(item.data))) continue\n\t\t\t\t} catch (error) {\n\t\t\t\t\toptions.onFilterError(error)\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif (closed) break\n\t\t\t}\n\t\t\tyield item.data\n\t\t}\n\t}\n\n\treturn {\n\t\tpush(data: T) {\n\t\t\tif (closed) return\n\t\t\tqueue.enqueue({ data, marker: false })\n\t\t\tnotify()\n\t\t},\n\t\tevents: events(),\n\t\t/** Stop delivering; a parked read ends at once. */\n\t\tclose() {\n\t\t\tclosed = true\n\t\t\tnotify()\n\t\t}\n\t}\n}\n\n// ═══════════════════════════════════════════════════════════════════════════\n// Runtime (internal: the typed surface is what `createFn` returns)\n// ═══════════════════════════════════════════════════════════════════════════\n\nconst DEFAULT_MAX_QUEUE_SIZE = 1000\n\n// Exponential resubscribe backoff with jitter so reconnecting subscribers don't stampede the broker.\nconst RESUBSCRIBE_BASE_DELAY_MS = 1000\nconst RESUBSCRIBE_MAX_DELAY_MS = 30_000\nconst RESUBSCRIBE_MAX_JITTER_MS = 250\n\nfunction getResubscribeDelayMs(attempt: number): number {\n\tconst base = Math.min(\n\t\tRESUBSCRIBE_BASE_DELAY_MS * 2 ** attempt,\n\t\tRESUBSCRIBE_MAX_DELAY_MS\n\t)\n\treturn base + Math.floor(Math.random() * RESUBSCRIBE_MAX_JITTER_MS)\n}\n\ntype Input = Record<string, unknown>\n\ntype LocalSubscriber = {\n\tisActive: () => boolean\n\tpush: (data: unknown) => void\n}\n\ntype Hub = {\n\tsubscribers: Set<LocalSubscriber>\n\t/** Settles after the first subscribe attempt (or when the hub closes). */\n\tready: Promise<void>\n\tclose: () => void\n}\n\n/** An open subscription: registered, authorized and subscribed. */\nexport type LiveSubscription = {\n\t/** Live events, after the backlog replay. Ends when closed or aborted. */\n\tevents: AsyncGenerator<unknown, void, unknown>\n\t/** Release everything; safe to call more than once, and before `events` runs. */\n\tclose: () => void\n}\n\n/** @internal Untyped options; `PubSubOptions` is the typed surface. */\nexport type ChannelOptions = PublisherConfig & {\n\tchannel: ChannelDefinition<Input, unknown>\n\teventSchema: ZodType\n\tfilterFn?: FilterFn<Input, unknown>\n\tauthFn?: AuthFn<Input, unknown>\n\toverflowMarker?: (input: Input) => unknown\n}\n\n/** @internal */\nexport type Channel = {\n\t/** Authorize and subscribe; resolves once events can be delivered. */\n\topen: (options: {\n\t\tinput: Input\n\t\tcontext: unknown\n\t\tsignal: AbortSignal | undefined\n\t}) => Promise<LiveSubscription>\n\tpublish: (data: unknown) => Promise<void>\n\tpublishMany: (items: readonly unknown[]) => Promise<void>\n\tgetChannelName: (params: Input, context?: unknown) => string\n}\n\nconst resolveChannel = (\n\tchannel: string | ((params: Input, context?: unknown) => string),\n\tparams: Input,\n\tcontext?: unknown\n) => (typeof channel === 'string' ? channel : channel(params, context))\n\n/** @internal */\nexport function createLiveRuntime(options: LiveRuntimeOptions) {\n\tconst { tracing, createLogger } = options\n\tconst logger = createLogger('pubsub', undefined)\n\t// Deploy drain: every open subscription registers its close here. On\n\t// SIGTERM the app ends them deliberately instead of letting the socket die\n\t// with the process: the generator returns, oRPC closes the SSE response and\n\t// the client's backoff reconnects to the new deployment.\n\tconst activeSubscriberCleanups = new Set<() => void>()\n\n\tconst requireTransport = () => {\n\t\tif (!options.pubsub) {\n\t\t\tthrow new Error(\n\t\t\t\t'orpc-fn: live routes need a transport, pass createFn({ pubsub: { transport } })'\n\t\t\t)\n\t\t}\n\t\treturn options.pubsub.transport\n\t}\n\n\t/**\n\t * Shared publish pipeline: validate the raw event, resolve the channel from\n\t * the parsed event, then publish the raw event (atomically maintaining the\n\t * backlog when enabled) inside a producer span.\n\t */\n\tfunction createChannelPublisher(\n\t\tconfig: PublisherConfig & {\n\t\t\teventSchema: ZodType\n\t\t\tgetChannelName: (data: Input) => string\n\t\t}\n\t) {\n\t\tconst { name, eventSchema, getChannelName, mirrorChannel } = config\n\t\tconst backlog: BacklogOptions | undefined = config.useBacklog\n\t\t\t? { size: config.backlogSize ?? 50, ttlSeconds: config.backlogTtl ?? 30 }\n\t\t\t: undefined\n\n\t\tconst toMessages = async (items: readonly unknown[]) => {\n\t\t\tconst messages: PubSubMessage[] = []\n\t\t\tfor (const item of items) {\n\t\t\t\tconst data = (await eventSchema.parseAsync(item)) as Input\n\t\t\t\tconst channel = getChannelName(data)\n\t\t\t\tconst payload = encodePayload(item)\n\t\t\t\tmessages.push({ channel, payload })\n\t\t\t\tif (mirrorChannel && mirrorChannel !== channel) {\n\t\t\t\t\tmessages.push({ channel: mirrorChannel, payload })\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn messages\n\t\t}\n\n\t\tconst send = (\n\t\t\toperation: 'publish' | 'publishMany',\n\t\t\titems: readonly unknown[]\n\t\t) =>\n\t\t\ttracing.inSpan(`${name}:${operation}`, 'PRODUCER', async (span) => {\n\t\t\t\tconst startTime = performance.now()\n\t\t\t\ttry {\n\t\t\t\t\tspan?.setAttribute('pubsub.operation', operation)\n\t\t\t\t\tspan?.setAttribute('pubsub.name', name)\n\t\t\t\t\tspan?.setAttribute('pubsub.batch_size', items.length)\n\t\t\t\t\tconst messages = await toMessages(items)\n\t\t\t\t\tconst first = messages[0]\n\t\t\t\t\tif (first) {\n\t\t\t\t\t\tspan?.setAttribute('pubsub.channel', first.channel)\n\t\t\t\t\t\tspan?.setAttribute('pubsub.payload_size', first.payload.length)\n\t\t\t\t\t}\n\t\t\t\t\tawait requireTransport().publish(messages, backlog)\n\t\t\t\t} finally {\n\t\t\t\t\tspan?.setAttribute(\n\t\t\t\t\t\t'pubsub.duration_ms',\n\t\t\t\t\t\tperformance.now() - startTime\n\t\t\t\t\t)\n\t\t\t\t}\n\t\t\t})\n\n\t\treturn {\n\t\t\tpublish: (data: unknown) => send('publish', [data]),\n\t\t\tpublishMany: async (items: readonly unknown[]) => {\n\t\t\t\tif (items.length > 0) await send('publishMany', items)\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Hubs for one pub/sub definition, keyed by channel. Many subscribers can\n\t * share a channel (an org with many open tabs); one hub decodes and parses\n\t * each payload once and fans the event out to every local subscriber,\n\t * applying each subscriber's own filter. The hub also owns the broker\n\t * subscription and its resubscribe backoff.\n\t */\n\tfunction createChannelHubs(config: { eventSchema: ZodType }) {\n\t\tconst { eventSchema } = config\n\t\tconst hubs = new Map<string, Hub>()\n\n\t\tconst createHub = (channel: string): Hub => {\n\t\t\tconst subscribers = new Set<LocalSubscriber>()\n\t\t\tlet closed = false\n\t\t\tlet unsubscribe: (() => Promise<void>) | null = null\n\t\t\tlet attempt = 0\n\t\t\tlet timer: ReturnType<typeof setTimeout> | null = null\n\t\t\tlet markReady = () => {}\n\t\t\tconst ready = new Promise<void>((resolve) => {\n\t\t\t\tmarkReady = resolve\n\t\t\t})\n\t\t\t// Parse in arrival order even when the schema is async.\n\t\t\t// ponytail: unbounded while an async schema lags behind the broker;\n\t\t\t// bound it if a channel can outpace its schema.\n\t\t\tlet parsing = Promise.resolve()\n\n\t\t\tconst deliver = async (raw: string) => {\n\t\t\t\tlet parsed: unknown\n\t\t\t\ttry {\n\t\t\t\t\tparsed = await eventSchema.parseAsync(decodePayload(raw))\n\t\t\t\t} catch (error) {\n\t\t\t\t\t// Malformed payloads are dropped once for the whole channel.\n\t\t\t\t\tlogger.warn(`Dropped malformed message on ${channel}`, {\n\t\t\t\t\t\terror: errorMessageOf(error)\n\t\t\t\t\t})\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\t// Parsed once; each subscriber filters in its own delivery.\n\t\t\t\tfor (const sub of [...subscribers]) {\n\t\t\t\t\tif (sub.isActive()) sub.push(parsed)\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tconst release = (stale: (() => Promise<void>) | null) => {\n\t\t\t\tstale?.().catch((error) => {\n\t\t\t\t\tlogger.warn(`Failed to unsubscribe from ${channel}`, {\n\t\t\t\t\t\terror: errorMessageOf(error)\n\t\t\t\t\t})\n\t\t\t\t})\n\t\t\t}\n\n\t\t\tconst scheduleResubscribe = (reason: string) => {\n\t\t\t\tif (closed || timer) return\n\t\t\t\tconst delayMs = getResubscribeDelayMs(attempt)\n\t\t\t\tattempt++\n\t\t\t\tlogger.warn(`Scheduling resubscribe for ${channel}`, {\n\t\t\t\t\treason,\n\t\t\t\t\tattempt,\n\t\t\t\t\tdelayMs\n\t\t\t\t})\n\t\t\t\ttimer = setTimeout(() => {\n\t\t\t\t\ttimer = null\n\t\t\t\t\tif (closed) return\n\t\t\t\t\trelease(unsubscribe)\n\t\t\t\t\tunsubscribe = null\n\t\t\t\t\tvoid connect()\n\t\t\t\t}, delayMs)\n\t\t\t}\n\n\t\t\tconst connect = async () => {\n\t\t\t\ttry {\n\t\t\t\t\tconst next = await requireTransport().subscribe(\n\t\t\t\t\t\tchannel,\n\t\t\t\t\t\t(raw) => {\n\t\t\t\t\t\t\tparsing = parsing.then(() => deliver(raw))\n\t\t\t\t\t\t},\n\t\t\t\t\t\t(error) => {\n\t\t\t\t\t\t\tlogger.error(`Subscription to ${channel} lost`, {\n\t\t\t\t\t\t\t\terror: error.message\n\t\t\t\t\t\t\t})\n\t\t\t\t\t\t\tscheduleResubscribe('lost')\n\t\t\t\t\t\t}\n\t\t\t\t\t)\n\t\t\t\t\tif (closed) return release(next)\n\t\t\t\t\tunsubscribe = next\n\t\t\t\t\tattempt = 0\n\t\t\t\t\tlogger.info(`Subscribed to ${channel}`)\n\t\t\t\t} catch (error) {\n\t\t\t\t\tlogger.error(`Failed to subscribe to ${channel}`, {\n\t\t\t\t\t\terror: errorMessageOf(error)\n\t\t\t\t\t})\n\t\t\t\t\tscheduleResubscribe('subscribe-failed')\n\t\t\t\t} finally {\n\t\t\t\t\t// A failed first attempt must not hold subscribers forever; the\n\t\t\t\t\t// backoff keeps retrying in the background.\n\t\t\t\t\tmarkReady()\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvoid connect()\n\n\t\t\treturn {\n\t\t\t\tsubscribers,\n\t\t\t\tready,\n\t\t\t\tclose: () => {\n\t\t\t\t\tclosed = true\n\t\t\t\t\tif (timer) clearTimeout(timer)\n\t\t\t\t\ttimer = null\n\t\t\t\t\tmarkReady()\n\t\t\t\t\trelease(unsubscribe)\n\t\t\t\t\tunsubscribe = null\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn function addLocalSubscriber(\n\t\t\tchannel: string,\n\t\t\tsubscriber: LocalSubscriber\n\t\t) {\n\t\t\tlet hub = hubs.get(channel)\n\t\t\tif (!hub) {\n\t\t\t\thub = createHub(channel)\n\t\t\t\thubs.set(channel, hub)\n\t\t\t}\n\t\t\thub.subscribers.add(subscriber)\n\t\t\tconst current = hub\n\t\t\treturn {\n\t\t\t\tready: current.ready,\n\t\t\t\tremove: () => {\n\t\t\t\t\tcurrent.subscribers.delete(subscriber)\n\t\t\t\t\tif (current.subscribers.size === 0 && hubs.get(channel) === current) {\n\t\t\t\t\t\tcurrent.close()\n\t\t\t\t\t\thubs.delete(channel)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/** Publish and open subscriptions on one channel definition. */\n\tfunction createChannel(channelOptions: ChannelOptions): Channel {\n\t\tconst {\n\t\t\tname,\n\t\t\tchannel,\n\t\t\teventSchema,\n\t\t\tfilterFn,\n\t\t\tauthFn,\n\t\t\toverflowMarker,\n\t\t\tuseBacklog = false\n\t\t} = channelOptions\n\n\t\tconst getChannelName = (params: Input, context?: unknown) =>\n\t\t\tresolveChannel(channel, params, context)\n\t\tconst addLocalSubscriber = createChannelHubs({ eventSchema })\n\n\t\tconst open: Channel['open'] = async ({ input, context, signal }) => {\n\t\t\tconst transport = requireTransport()\n\t\t\tconst channelName = getChannelName(input, context)\n\t\t\tconst startTime = performance.now()\n\t\t\tconst span = tracing.startSpan(`${name}:subscribe`, 'SERVER', {\n\t\t\t\t'pubsub.channel': channelName,\n\t\t\t\t'pubsub.operation': 'subscribe',\n\t\t\t\t'pubsub.name': name\n\t\t\t})\n\t\t\tconst subscriberLogger = createLogger('pubsub', span)\n\n\t\t\ttry {\n\t\t\t\tif (\n\t\t\t\t\tauthFn !== undefined &&\n\t\t\t\t\tauthFn !== true &&\n\t\t\t\t\t!(await authFn({ input, ctx: context }))\n\t\t\t\t) {\n\t\t\t\t\tthrow new ORPCError('FORBIDDEN', {\n\t\t\t\t\t\tmessage: 'You do not have access to this subscription'\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t} catch (error) {\n\t\t\t\ttracing.end(span, error)\n\t\t\t\tthrow error\n\t\t\t}\n\n\t\t\tsubscriberLogger.info(`Subscribing to ${channelName}`)\n\n\t\t\tlet messageCount = 0\n\t\t\tlet droppedCount = 0\n\t\t\tconst delivery = createSubscriberDelivery<unknown>({\n\t\t\t\tmaxSize: options.pubsub?.maxQueueSize ?? DEFAULT_MAX_QUEUE_SIZE,\n\t\t\t\taccept: filterFn && ((data) => filterFn({ input, data })),\n\t\t\t\toverflowMarker: overflowMarker && (() => overflowMarker(input)),\n\t\t\t\tonFilterError: (error) =>\n\t\t\t\t\tsubscriberLogger.error('Error processing message', {\n\t\t\t\t\t\terror: errorMessageOf(error)\n\t\t\t\t\t}),\n\t\t\t\tonDrop: () => {\n\t\t\t\t\tdroppedCount++\n\t\t\t\t\toptions.pubsub?.onDrop?.(1, { name, channel: channelName })\n\t\t\t\t}\n\t\t\t})\n\t\t\t// Live events wait here while the backlog replays, so replay comes first.\n\t\t\t// ponytail: unbounded for the length of one backlog read.\n\t\t\tlet replaying: unknown[] | null = useBacklog ? [] : null\n\t\t\tconst push = (data: unknown) => {\n\t\t\t\tmessageCount++\n\t\t\t\tif (replaying) replaying.push(data)\n\t\t\t\telse delivery.push(data)\n\t\t\t}\n\n\t\t\t// The one way a subscription ends, whatever ends it: abort, drain, the\n\t\t\t// stream finishing, or `close()`. Releases everything at once, even\n\t\t\t// while the stream is parked or not yet read.\n\t\t\tlet closed = false\n\t\t\tconst close = (...error: [] | [unknown]) => {\n\t\t\t\tif (closed) return\n\t\t\t\tclosed = true\n\t\t\t\tdelivery.close()\n\t\t\t\tactiveSubscriberCleanups.delete(stop)\n\t\t\t\tsignal?.removeEventListener('abort', stop)\n\t\t\t\tlocal.remove()\n\t\t\t\tconst durationMs = performance.now() - startTime\n\t\t\t\tspan?.setAttribute('pubsub.duration_ms', durationMs)\n\t\t\t\tspan?.setAttribute('pubsub.message_count', messageCount)\n\t\t\t\tspan?.setAttribute('pubsub.dropped_count', droppedCount)\n\t\t\t\ttracing.end(span, ...error)\n\t\t\t\tsubscriberLogger.info(`Unsubscribed from ${channelName}`, {\n\t\t\t\t\tmessageCount,\n\t\t\t\t\tdroppedCount,\n\t\t\t\t\tdurationMs: Math.round(durationMs)\n\t\t\t\t})\n\t\t\t}\n\t\t\tconst stop = () => close()\n\t\t\tconst local = addLocalSubscriber(channelName, {\n\t\t\t\tisActive: () => !closed,\n\t\t\t\tpush\n\t\t\t})\n\t\t\tactiveSubscriberCleanups.add(stop)\n\t\t\tsignal?.addEventListener('abort', stop)\n\t\t\tif (signal?.aborted) close()\n\n\t\t\t// Subscribed before returning, so nothing published after `open`\n\t\t\t// resolves is missed.\n\t\t\t// ponytail: a failed first attempt also settles `ready` (the hub keeps\n\t\t\t// retrying); events published before a retry succeeds are lost.\n\t\t\tawait local.ready\n\t\t\tif (replaying && !closed) {\n\t\t\t\ttry {\n\t\t\t\t\tconst items = await transport.readBacklog(channelName)\n\t\t\t\t\tspan?.setAttribute('pubsub.backlog_count', items.length)\n\t\t\t\t\tfor (const raw of items) {\n\t\t\t\t\t\tif (closed) break\n\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\tmessageCount++\n\t\t\t\t\t\t\tdelivery.push(await eventSchema.parseAsync(decodePayload(raw)))\n\t\t\t\t\t\t} catch {\n\t\t\t\t\t\t\t// Ignore malformed backlog entries\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} catch (error) {\n\t\t\t\t\t// Live events still flow; only the backlog replay is lost.\n\t\t\t\t\tsubscriberLogger.warn(`Failed to replay backlog for ${channelName}`, {\n\t\t\t\t\t\terror: errorMessageOf(error)\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t\t// ponytail: an event both in the backlog and arriving live is delivered\n\t\t\t// twice; events carry no id to dedupe on.\n\t\t\tfor (const data of replaying ?? []) delivery.push(data)\n\t\t\treplaying = null\n\n\t\t\tasync function* events() {\n\t\t\t\ttry {\n\t\t\t\t\tyield* delivery.events\n\t\t\t\t} finally {\n\t\t\t\t\tclose()\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn { events: events(), close: () => close() }\n\t\t}\n\n\t\tconst { publish, publishMany } = createChannelPublisher({\n\t\t\t...channelOptions,\n\t\t\tgetChannelName\n\t\t})\n\n\t\treturn { open, publish, publishMany, getChannelName }\n\t}\n\n\tfunction createPubSub(\n\t\tpubsubOptions: ChannelOptions & {\n\t\t\tinputSchema: ZodType\n\t\t\tprocedure?: string\n\t\t\ttags?: string[]\n\t\t\tsummary?: string\n\t\t\tdescription?: string\n\t\t}\n\t) {\n\t\tconst { name } = pubsubOptions\n\t\tconst channel = createChannel(pubsubOptions)\n\t\tconst subscribe = options.buildProcedure({\n\t\t\tname,\n\t\t\tprocedure: pubsubOptions.procedure,\n\t\t\tmeta: {},\n\t\t\troute: {\n\t\t\t\tmethod: 'GET',\n\t\t\t\ttags: pubsubOptions.tags,\n\t\t\t\tsummary: pubsubOptions.summary ?? `Subscribe to ${name}`,\n\t\t\t\tdescription: pubsubOptions.description\n\t\t\t},\n\t\t\tinput: pubsubOptions.inputSchema,\n\t\t\thandler: async function* ({ input, context, signal }) {\n\t\t\t\t// The generator from `events()` releases everything when it ends.\n\t\t\t\tyield* (await channel.open({ input: input as Input, context, signal }))\n\t\t\t\t\t.events\n\t\t\t}\n\t\t})\n\n\t\tconst { publish, publishMany, getChannelName } = channel\n\t\treturn { subscribe, publish, publishMany, getChannelName }\n\t}\n\n\tfunction createPublisher(publisherOptions: PublisherOptions<ZodType>) {\n\t\tconst getChannelName = (params: Input) =>\n\t\t\tresolveChannel(publisherOptions.channel, params)\n\t\tconst { publish, publishMany } = createChannelPublisher({\n\t\t\t...publisherOptions,\n\t\t\tgetChannelName\n\t\t})\n\t\treturn { publish, publishMany, getChannelName }\n\t}\n\n\treturn {\n\t\tcreateChannel,\n\t\tcreatePubSub,\n\t\tcreatePublisher,\n\t\t/** Open subscriptions of this instance (drain progress, gauges). */\n\t\tactivePubSubSubscriberCount: () => activeSubscriberCleanups.size,\n\t\t/** End every open subscription; returns how many were closed. */\n\t\tdrainPubSubSubscribers: () => {\n\t\t\tconst cleanups = [...activeSubscriberCleanups]\n\t\t\tactiveSubscriberCleanups.clear()\n\t\t\tfor (const cleanup of cleanups) {\n\t\t\t\ttry {\n\t\t\t\t\tcleanup()\n\t\t\t\t} catch (error) {\n\t\t\t\t\t// A failed cleanup must not stop the drain.\n\t\t\t\t\tlogger.warn('Subscriber cleanup failed during drain', {\n\t\t\t\t\t\terror: errorMessageOf(error)\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn cleanups.length\n\t\t}\n\t}\n}\n"]}

package/dist/live/redis-bun.d.ts

@@ -0,0 +1,26 @@
+type Listener = (message: string, channel: string) => void;
+/** The part of Bun's `RedisClient` this transport uses. */
+export interface BunRedisClientLike {
+    send(command: string, args: string[]): Promise<unknown>;
+    subscribe(channel: string, listener: Listener): Promise<unknown>;
+    unsubscribe(channel: string, listener?: Listener): Promise<unknown>;
+    duplicate(): Promise<BunRedisClientLike>;
+    close(): void;
+    onconnect: ((this: never) => void) | null;
+    onclose: ((this: never, error: Error) => void) | null;
+}
+/**
+ * `PubSubTransport` for Bun's built-in `RedisClient`. Subscriptions use a
+ * dedicated connection (`client.duplicate()` unless `subscriber` is given)
+ * that re-subscribes its channels after every reconnect; configure retries on
+ * the client (`maxRetries`) since the duplicate copies its options.
+ *
+ * Call `close()` on shutdown to close the subscriber connection it created.
+ */
+export declare function bunRedisTransport(client: BunRedisClientLike, options?: {
+    subscriber?: BunRedisClientLike;
+}): import("./transport.js").PubSubTransport & {
+    close(): void;
+};
+export {};
+//# sourceMappingURL=redis-bun.d.ts.map

package/dist/live/redis-bun.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"redis-bun.d.ts","sourceRoot":"","sources":["../../src/live/redis-bun.ts"],"names":[],"mappings":"AAEA,KAAK,QAAQ,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,CAAA;AAE1D,2DAA2D;AAC3D,MAAM,WAAW,kBAAkB;IAClC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;IACvD,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;IAChE,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;IACnE,SAAS,IAAI,OAAO,CAAC,kBAAkB,CAAC,CAAA;IACxC,KAAK,IAAI,IAAI,CAAA;IACb,SAAS,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,CAAA;IACzC,OAAO,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,GAAG,IAAI,CAAA;CACrD;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAChC,MAAM,EAAE,kBAAkB,EAC1B,OAAO,GAAE;IAAE,UAAU,CAAC,EAAE,kBAAkB,CAAA;CAAO;;EAkDjD"}