@librechat/agents 3.4.7 → 3.5.1

package/dist/esm/llm/stream/smoother.mjs

@@ -11,20 +11,7 @@ const STREAM_BOUNDARIES = new Set([
 	":"
 ]);
 const STREAM_ABORT_MESSAGE = "AbortError: User aborted the request.";
-/**
-* How long generator teardown waits for the background producer to observe a
-* consumer close before abandoning it. Well-behaved streams settle in
-* microseconds (the next enqueue throws); a stalled provider that ignores
-* aborts otherwise blocks teardown — and abort propagation — indefinitely.
-* An abandoned producer still self-terminates on its next enqueue attempt.
-*/
 const PRODUCER_CLOSE_GRACE_MS = 1e3;
-/**
-* Resolves a configured stream delay to its effective value (default 25ms;
-* 0 disables smoothing). Non-finite inputs (NaN from a malformed config
-* value, ±Infinity) normalize to the default rather than poisoning piece
-* arithmetic downstream.
-*/
 function resolveStreamDelay(delay) {
 	if (delay == null || !Number.isFinite(delay)) return 25;
 	return Math.max(0, delay);
@@ -38,27 +25,15 @@ function findStreamChunkBoundary(text, minSize) {
 	for (let position = minSize; position < scanEnd; position++) if (STREAM_BOUNDARIES.has(text[position])) return position + 1;
 	return scanEnd;
 }
-/**
-* Backlog-proportional piece sizing: emit enough per tick that the current
-* backlog drains in ~`targetLatencyMs`, so render lag stays pinned near the
-* target regardless of how fast the provider streams. Token-sized arrivals
-* never exceed the minimum piece, matching the legacy fixed-size splitter.
-*/
 function computeAdaptivePieceSize(bufferedTextLength, tickMs, targetLatencyMs = 250) {
 	if (bufferedTextLength <= 0) return 4;
 	if (tickMs <= 0 || targetLatencyMs <= 0) return bufferedTextLength;
 	return Math.max(4, Math.ceil(bufferedTextLength * tickMs / targetLatencyMs));
 }
-/**
-* A cadence, not an additive sleep: time the consumer already spent since the
-* last visible emission counts against the target delay, so slow downstream
-* handlers never compound latency.
-*/
 function getCadencedStreamDelay({ targetDelay, lastVisibleTextAt, now }) {
 	if (targetDelay <= 0 || lastVisibleTextAt == null) return 0;
 	return Math.max(0, targetDelay - (now - lastVisibleTextAt));
 }
-/** Abort-aware sleep that resolves (never rejects) on abort; callers re-check the signal. */
 async function waitForStreamDelay(delay, signal) {
 	if (delay <= 0 || isSignalAborted(signal)) return;
 	await new Promise((resolve) => {
@@ -76,23 +51,8 @@ async function waitForStreamDelay(delay, signal) {
 		if (isSignalAborted(signal)) onAbort();
 	});
 }
-/**
-* Bounded producer/consumer smoothing engine.
-*
-* The producer drains `source` eagerly into a bounded queue (the buffer is the
-* backlog measurement adaptive sizing needs); at capacity it parks, applying
-* backpressure to the underlying stream. The consumer emits paced pieces,
-* decrementing the text budget and waking the producer *before* each cadenced
-* sleep so the provider stream keeps being read during pacing.
-*
-* `delayMs <= 0` disables smoothing entirely: every item passes through FIFO,
-* unsplit and undelayed.
-*/
 async function* smoothStream({ source, delayMs, signal, abortUpstream }) {
 	if (!(delayMs > 0)) {
-		/** Disabled smoothing preserves fully lazy streaming: no background
-		* producer, no read-ahead — each provider chunk is pulled only when the
-		* consumer asks, exactly like the pre-engine pass-through paths. */
 		for await (const item of source) {
 			if (isSignalAborted(signal)) {
 				abortUpstream?.();
@@ -127,9 +87,6 @@ async function* smoothStream({ source, delayMs, signal, abortUpstream }) {
 	const hasQueuedItems = () => queuedItemIndex < queuedItems.length;
 	const getQueuedItemCount = () => queuedItems.length - queuedItemIndex;
 	const isQueueAtCapacity = () => getQueuedItemCount() >= 256 || bufferedTextLength >= 8192;
-	/** Abort-aware: a consumer parked on an empty queue must wake when the
-	* signal fires even if the provider stream never honors the abort — the
-	* loop's top-of-iteration check then throws the canonical error. */
 	const waitForNextItem = async () => {
 		if (hasQueuedItems() || producerState.done || producerState.failed || isSignalAborted(signal)) return;
 		await new Promise((resolve) => {
@@ -185,14 +142,6 @@ async function* smoothStream({ source, delayMs, signal, abortUpstream }) {
 		bufferedTextLength += textLength;
 		notifyConsumerForItem();
 	};
-	/**
-	* Oversized splittable items are segmented at admission so a single giant
-	* provider chunk cannot blow past the text budget: each segment re-checks
-	* capacity, so the producer parks mid-chunk once the buffer fills — the
-	* same bound the legacy split-before-enqueue queues enforced. The wrapped
-	* emit maps segment-local pieces back to chunk-global isFirst/isLast so
-	* provider clone contracts are unaffected.
-	*/
 	const enqueueSegmented = async (item) => {
 		if (!item.smooth || item.atomic === true || item.text.length <= 4096) {
 			await enqueue(item);
@@ -272,9 +221,6 @@ async function* smoothStream({ source, delayMs, signal, abortUpstream }) {
 				current = void 0;
 				continue;
 			}
-			/** Once the producer is done the backlog is final: drain it linearly
-			* across the remaining target window instead of letting the
-			* proportional formula decay geometrically and stretch the tail. */
 			if (producerState.done && drainTicksRemaining == null) drainTicksRemaining = Math.max(1, Math.floor(250 / delayMs));
 			const tickBudget = drainTicksRemaining != null ? Math.max(4, Math.ceil(bufferedTextLength / drainTicksRemaining)) : computeAdaptivePieceSize(bufferedTextLength, delayMs);
 			if (drainTicksRemaining != null && drainTicksRemaining > 1) drainTicksRemaining -= 1;
@@ -297,10 +243,6 @@ async function* smoothStream({ source, delayMs, signal, abortUpstream }) {
 				});
 				continue;
 			}
-			/** One cadence tick drains up to the adaptive budget ACROSS queued
-			* items, so token-sized provider deltas coalesce instead of costing a
-			* full tick each; passthrough items flush free mid-batch (FIFO), and
-			* atomic items end the batch to take their own tick. */
 			let consumed = 0;
 			while (consumed < tickBudget) {
 				if (isSignalAborted(signal)) throwAborted();

package/dist/esm/llm/stream/smoother.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"smoother.mjs","names":["iterator"],"sources":["../../../../src/llm/stream/smoother.ts"],"sourcesContent":["export const DEFAULT_STREAM_DELAY = 25;\nexport const SMOOTH_TARGET_LATENCY_MS = 250;\nexport const MAX_STREAM_QUEUE_CHUNKS = 256;\nexport const MAX_STREAM_QUEUE_TEXT_CHARS = 8192;\nexport const MAX_SMOOTH_ITEM_SEGMENT_CHARS = 4096;\nexport const STREAM_CHUNK_MIN_SIZE = 4;\nexport const STREAM_BOUNDARIES: ReadonlySet<string> = new Set([\n  ' ',\n  '.',\n  ',',\n  '!',\n  '?',\n  ';',\n  ':',\n]);\n\nexport const STREAM_ABORT_MESSAGE = 'AbortError: User aborted the request.';\nexport const STREAM_PRODUCER_FAILURE = 'Stream producer failed.';\n\n/**\n * How long generator teardown waits for the background producer to observe a\n * consumer close before abandoning it. Well-behaved streams settle in\n * microseconds (the next enqueue throws); a stalled provider that ignores\n * aborts otherwise blocks teardown — and abort propagation — indefinitely.\n * An abandoned producer still self-terminates on its next enqueue attempt.\n */\nexport const PRODUCER_CLOSE_GRACE_MS = 1000;\n\n/**\n * Resolves a configured stream delay to its effective value (default 25ms;\n * 0 disables smoothing). Non-finite inputs (NaN from a malformed config\n * value, ±Infinity) normalize to the default rather than poisoning piece\n * arithmetic downstream.\n */\nexport function resolveStreamDelay(delay?: number): number {\n  if (delay == null || !Number.isFinite(delay)) {\n    return DEFAULT_STREAM_DELAY;\n  }\n  return Math.max(0, delay);\n}\n\nexport function isSignalAborted(signal?: AbortSignal): boolean {\n  return signal?.aborted === true;\n}\n\n/**\n * How far past the target size the word-boundary search may extend before\n * hard-cutting. Natural language hits a boundary within a few characters;\n * boundary-free runs (base64, minified data, long identifiers) must not\n * stretch a piece — or an admission segment — arbitrarily far past its\n * budget.\n */\nexport const STREAM_BOUNDARY_LOOKAHEAD_CHARS = 64;\n\nexport function findStreamChunkBoundary(\n  text: string,\n  minSize: number\n): number {\n  if (minSize >= text.length) {\n    return text.length;\n  }\n\n  const scanEnd = Math.min(\n    text.length,\n    minSize + STREAM_BOUNDARY_LOOKAHEAD_CHARS\n  );\n  for (let position = minSize; position < scanEnd; position++) {\n    if (STREAM_BOUNDARIES.has(text[position])) {\n      return position + 1;\n    }\n  }\n\n  return scanEnd;\n}\n\n/**\n * Backlog-proportional piece sizing: emit enough per tick that the current\n * backlog drains in ~`targetLatencyMs`, so render lag stays pinned near the\n * target regardless of how fast the provider streams. Token-sized arrivals\n * never exceed the minimum piece, matching the legacy fixed-size splitter.\n */\nexport function computeAdaptivePieceSize(\n  bufferedTextLength: number,\n  tickMs: number,\n  targetLatencyMs: number = SMOOTH_TARGET_LATENCY_MS\n): number {\n  if (bufferedTextLength <= 0) {\n    return STREAM_CHUNK_MIN_SIZE;\n  }\n  if (tickMs <= 0 || targetLatencyMs <= 0) {\n    return bufferedTextLength;\n  }\n  return Math.max(\n    STREAM_CHUNK_MIN_SIZE,\n    Math.ceil((bufferedTextLength * tickMs) / targetLatencyMs)\n  );\n}\n\n/**\n * A cadence, not an additive sleep: time the consumer already spent since the\n * last visible emission counts against the target delay, so slow downstream\n * handlers never compound latency.\n */\nexport function getCadencedStreamDelay({\n  targetDelay,\n  lastVisibleTextAt,\n  now,\n}: {\n  targetDelay: number;\n  lastVisibleTextAt?: number;\n  now: number;\n}): number {\n  if (targetDelay <= 0 || lastVisibleTextAt == null) {\n    return 0;\n  }\n  return Math.max(0, targetDelay - (now - lastVisibleTextAt));\n}\n\n/** Abort-aware sleep that resolves (never rejects) on abort; callers re-check the signal. */\nexport async function waitForStreamDelay(\n  delay: number,\n  signal?: AbortSignal\n): Promise<void> {\n  if (delay <= 0 || isSignalAborted(signal)) {\n    return;\n  }\n  await new Promise<void>((resolve) => {\n    const timeoutRef: { current?: ReturnType<typeof setTimeout> } = {};\n    const onAbort = (): void => {\n      if (timeoutRef.current) {\n        clearTimeout(timeoutRef.current);\n      }\n      signal?.removeEventListener('abort', onAbort);\n      resolve();\n    };\n    timeoutRef.current = setTimeout(() => {\n      signal?.removeEventListener('abort', onAbort);\n      resolve();\n    }, delay);\n    signal?.addEventListener('abort', onAbort, { once: true });\n    if (isSignalAborted(signal)) {\n      onAbort();\n    }\n  });\n}\n\nexport type SmoothPiece = {\n  text: string;\n  isFirst: boolean;\n  isLast: boolean;\n};\n\n/**\n * One classified unit of provider stream output.\n *\n * - `smooth: true` — visible text, paced at the configured cadence and (unless\n *   `atomic`) sliced adaptively at dequeue time.\n * - `atomic: true` — paced as a single piece, never split (text-bearing chunks\n *   whose metadata cannot survive slicing, e.g. logprobs / finish_reason).\n * - `smooth: false` — passthrough: tool-call deltas, usage-only, id-only and\n *   seal chunks. Zero delay, strict FIFO with the text around them.\n *\n * `emit` builds the provider-specific output for one piece; `isFirst` lets\n * providers keep usage_metadata on only the first piece of a split.\n */\nexport type SmoothItem<TEmit> = {\n  text: string;\n  smooth: boolean;\n  atomic?: boolean;\n  emit: (piece: SmoothPiece) => TEmit;\n};\n\ntype ProducerState = {\n  done: boolean;\n  failed: boolean;\n  error?: unknown;\n};\n\ntype QueuedSmoothItem<TEmit> = {\n  item: SmoothItem<TEmit>;\n  textLength: number;\n};\n\n/**\n * Bounded producer/consumer smoothing engine.\n *\n * The producer drains `source` eagerly into a bounded queue (the buffer is the\n * backlog measurement adaptive sizing needs); at capacity it parks, applying\n * backpressure to the underlying stream. The consumer emits paced pieces,\n * decrementing the text budget and waking the producer *before* each cadenced\n * sleep so the provider stream keeps being read during pacing.\n *\n * `delayMs <= 0` disables smoothing entirely: every item passes through FIFO,\n * unsplit and undelayed.\n */\nexport async function* smoothStream<TEmit>({\n  source,\n  delayMs,\n  signal,\n  abortUpstream,\n}: {\n  source: AsyncIterable<SmoothItem<TEmit>>;\n  delayMs: number;\n  signal?: AbortSignal;\n  abortUpstream?: () => void;\n}): AsyncGenerator<TEmit> {\n  if (!(delayMs > 0)) {\n    /** Disabled smoothing preserves fully lazy streaming: no background\n     * producer, no read-ahead — each provider chunk is pulled only when the\n     * consumer asks, exactly like the pre-engine pass-through paths. */\n    for await (const item of source) {\n      if (isSignalAborted(signal)) {\n        abortUpstream?.();\n        throw new Error(STREAM_ABORT_MESSAGE);\n      }\n      yield item.emit({ text: item.text, isFirst: true, isLast: true });\n    }\n    return;\n  }\n\n  const queuedItems: QueuedSmoothItem<TEmit>[] = [];\n  const producerState: ProducerState = { done: false, failed: false };\n  let queuedItemIndex = 0;\n  let bufferedTextLength = 0;\n  let consumerClosed = false;\n  let notifyConsumer: (() => void) | undefined;\n  let notifyProducer: (() => void) | undefined;\n\n  const notifyConsumerForItem = (): void => {\n    notifyConsumer?.();\n    notifyConsumer = undefined;\n  };\n\n  const notifyProducerForSpace = (): void => {\n    notifyProducer?.();\n    notifyProducer = undefined;\n  };\n\n  const hasQueuedItems = (): boolean => queuedItemIndex < queuedItems.length;\n\n  const getQueuedItemCount = (): number =>\n    queuedItems.length - queuedItemIndex;\n\n  const isQueueAtCapacity = (): boolean =>\n    getQueuedItemCount() >= MAX_STREAM_QUEUE_CHUNKS ||\n    bufferedTextLength >= MAX_STREAM_QUEUE_TEXT_CHARS;\n\n  /** Abort-aware: a consumer parked on an empty queue must wake when the\n   * signal fires even if the provider stream never honors the abort — the\n   * loop's top-of-iteration check then throws the canonical error. */\n  const waitForNextItem = async (): Promise<void> => {\n    if (\n      hasQueuedItems() ||\n      producerState.done ||\n      producerState.failed ||\n      isSignalAborted(signal)\n    ) {\n      return;\n    }\n    await new Promise<void>((resolve) => {\n      const onAbort = (): void => {\n        signal?.removeEventListener('abort', onAbort);\n        resolve();\n      };\n      notifyConsumer = (): void => {\n        signal?.removeEventListener('abort', onAbort);\n        resolve();\n      };\n      signal?.addEventListener('abort', onAbort, { once: true });\n      if (isSignalAborted(signal)) {\n        onAbort();\n      }\n    });\n  };\n\n  const waitForQueueSpace = async (): Promise<void> => {\n    while (\n      isQueueAtCapacity() &&\n      !consumerClosed &&\n      !isSignalAborted(signal)\n    ) {\n      await new Promise<void>((resolve) => {\n        const onAbort = (): void => {\n          signal?.removeEventListener('abort', onAbort);\n          resolve();\n        };\n        const onSpace = (): void => {\n          signal?.removeEventListener('abort', onAbort);\n          resolve();\n        };\n        notifyProducer = onSpace;\n        signal?.addEventListener('abort', onAbort, { once: true });\n        if (isSignalAborted(signal)) {\n          onAbort();\n        }\n      });\n    }\n  };\n\n  const dequeue = (): QueuedSmoothItem<TEmit> | undefined => {\n    if (!hasQueuedItems()) {\n      return undefined;\n    }\n    const queuedItem = queuedItems[queuedItemIndex];\n    queuedItemIndex++;\n    if (queuedItemIndex > 128 && queuedItemIndex * 2 >= queuedItems.length) {\n      queuedItems.splice(0, queuedItemIndex);\n      queuedItemIndex = 0;\n    }\n    return queuedItem;\n  };\n\n  const throwAborted = (): never => {\n    abortUpstream?.();\n    throw new Error(STREAM_ABORT_MESSAGE);\n  };\n\n  const enqueue = async (item: SmoothItem<TEmit>): Promise<void> => {\n    await waitForQueueSpace();\n    if (consumerClosed || isSignalAborted(signal)) {\n      throwAborted();\n    }\n    const textLength = item.smooth ? item.text.length : 0;\n    queuedItems.push({ item, textLength });\n    bufferedTextLength += textLength;\n    notifyConsumerForItem();\n  };\n\n  /**\n   * Oversized splittable items are segmented at admission so a single giant\n   * provider chunk cannot blow past the text budget: each segment re-checks\n   * capacity, so the producer parks mid-chunk once the buffer fills — the\n   * same bound the legacy split-before-enqueue queues enforced. The wrapped\n   * emit maps segment-local pieces back to chunk-global isFirst/isLast so\n   * provider clone contracts are unaffected.\n   */\n  const enqueueSegmented = async (item: SmoothItem<TEmit>): Promise<void> => {\n    if (\n      !item.smooth ||\n      item.atomic === true ||\n      item.text.length <= MAX_SMOOTH_ITEM_SEGMENT_CHARS\n    ) {\n      await enqueue(item);\n      return;\n    }\n\n    const segments: { start: number; end: number }[] = [];\n    let offset = 0;\n    while (offset < item.text.length) {\n      const end =\n        offset +\n        findStreamChunkBoundary(\n          item.text.slice(offset),\n          MAX_SMOOTH_ITEM_SEGMENT_CHARS\n        );\n      segments.push({ start: offset, end });\n      offset = end;\n    }\n\n    for (let i = 0; i < segments.length; i++) {\n      const isFirstSegment = i === 0;\n      const isLastSegment = i === segments.length - 1;\n      await enqueue({\n        text: item.text.slice(segments[i].start, segments[i].end),\n        smooth: true,\n        emit: (piece) =>\n          item.emit({\n            text: piece.text,\n            isFirst: isFirstSegment && piece.isFirst,\n            isLast: isLastSegment && piece.isLast,\n          }),\n      });\n    }\n  };\n\n  const producer = (async (): Promise<void> => {\n    try {\n      for await (const item of source) {\n        if (isSignalAborted(signal)) {\n          throwAborted();\n        }\n        await enqueueSegmented(item);\n      }\n    } catch (error) {\n      producerState.failed = true;\n      producerState.error = error;\n    } finally {\n      producerState.done = true;\n      notifyConsumerForItem();\n    }\n  })();\n\n  let hasEmittedText = false;\n  let lastVisibleTextAt: number | undefined;\n  let drainTicksRemaining: number | undefined;\n  let current: QueuedSmoothItem<TEmit> | undefined;\n  let headOffset = 0;\n  let keepStreaming = true;\n  try {\n    while (keepStreaming) {\n      if (isSignalAborted(signal)) {\n        throwAborted();\n      }\n\n      if (current == null) {\n        await waitForNextItem();\n        current = dequeue();\n        headOffset = 0;\n      }\n\n      if (current == null) {\n        if (producerState.failed) {\n          throw producerState.error ?? new Error(STREAM_PRODUCER_FAILURE);\n        }\n        if (producerState.done) {\n          keepStreaming = false;\n        }\n        continue;\n      }\n\n      const { item } = current;\n\n      if (!item.smooth) {\n        notifyProducerForSpace();\n        current = undefined;\n        yield item.emit({ text: item.text, isFirst: true, isLast: true });\n        continue;\n      }\n\n      if (item.text === '') {\n        bufferedTextLength = Math.max(\n          0,\n          bufferedTextLength - current.textLength\n        );\n        notifyProducerForSpace();\n        current = undefined;\n        continue;\n      }\n\n      /** Once the producer is done the backlog is final: drain it linearly\n       * across the remaining target window instead of letting the\n       * proportional formula decay geometrically and stretch the tail. */\n      if (producerState.done && drainTicksRemaining == null) {\n        drainTicksRemaining = Math.max(\n          1,\n          Math.floor(SMOOTH_TARGET_LATENCY_MS / delayMs)\n        );\n      }\n      const tickBudget =\n        drainTicksRemaining != null\n          ? Math.max(\n            STREAM_CHUNK_MIN_SIZE,\n            Math.ceil(bufferedTextLength / drainTicksRemaining)\n          )\n          : computeAdaptivePieceSize(bufferedTextLength, delayMs);\n      if (drainTicksRemaining != null && drainTicksRemaining > 1) {\n        drainTicksRemaining -= 1;\n      }\n\n      await waitForStreamDelay(\n        getCadencedStreamDelay({\n          targetDelay: hasEmittedText ? delayMs : 0,\n          lastVisibleTextAt,\n          now: Date.now(),\n        }),\n        signal\n      );\n      if (isSignalAborted(signal)) {\n        throwAborted();\n      }\n      hasEmittedText = true;\n      lastVisibleTextAt = Date.now();\n\n      if (item.atomic === true) {\n        bufferedTextLength = Math.max(\n          0,\n          bufferedTextLength - current.textLength\n        );\n        notifyProducerForSpace();\n        current = undefined;\n        yield item.emit({ text: item.text, isFirst: true, isLast: true });\n        continue;\n      }\n\n      /** One cadence tick drains up to the adaptive budget ACROSS queued\n       * items, so token-sized provider deltas coalesce instead of costing a\n       * full tick each; passthrough items flush free mid-batch (FIFO), and\n       * atomic items end the batch to take their own tick. */\n      let consumed = 0;\n      while (consumed < tickBudget) {\n        if (isSignalAborted(signal)) {\n          throwAborted();\n        }\n        if (current == null) {\n          if (!hasQueuedItems()) {\n            break;\n          }\n          current = dequeue();\n          headOffset = 0;\n          if (current == null) {\n            break;\n          }\n        }\n\n        const batchItem = current.item;\n        if (!batchItem.smooth) {\n          notifyProducerForSpace();\n          current = undefined;\n          yield batchItem.emit({\n            text: batchItem.text,\n            isFirst: true,\n            isLast: true,\n          });\n          continue;\n        }\n        if (batchItem.text === '') {\n          bufferedTextLength = Math.max(\n            0,\n            bufferedTextLength - current.textLength\n          );\n          notifyProducerForSpace();\n          current = undefined;\n          continue;\n        }\n        if (batchItem.atomic === true) {\n          break;\n        }\n\n        const remainingText = batchItem.text.slice(headOffset);\n        const pieceLength = findStreamChunkBoundary(\n          remainingText,\n          tickBudget - consumed\n        );\n        const pieceEnd = headOffset + pieceLength;\n        const piece = batchItem.text.slice(headOffset, pieceEnd);\n        const isFirst = headOffset === 0;\n        const isLast = pieceEnd === batchItem.text.length;\n\n        bufferedTextLength = Math.max(0, bufferedTextLength - piece.length);\n        notifyProducerForSpace();\n        if (isLast) {\n          current = undefined;\n        } else {\n          headOffset = pieceEnd;\n        }\n        consumed += piece.length;\n        yield batchItem.emit({ text: piece, isFirst, isLast });\n      }\n    }\n  } finally {\n    consumerClosed = true;\n    if (producerState.done) {\n      await producer;\n    } else {\n      abortUpstream?.();\n      notifyProducerForSpace();\n      const iterator = source as Partial<AsyncGenerator<SmoothItem<TEmit>>>;\n      const closing = iterator.return?.call(source, undefined as never);\n      if (closing != null) {\n        void closing.then(\n          () => undefined,\n          () => undefined\n        );\n      }\n      await Promise.race([\n        producer,\n        new Promise<void>((resolve) => {\n          const timeout = setTimeout(resolve, PRODUCER_CLOSE_GRACE_MS);\n          timeout.unref();\n        }),\n      ]);\n    }\n  }\n}\n"],"mappings":";AAAA,MAAa,uBAAuB;AAIpC,MAAa,gCAAgC;AAE7C,MAAa,oBAAyC,IAAI,IAAI;CAC5D;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAa,uBAAuB;;;;;;;;AAUpC,MAAa,0BAA0B;;;;;;;AAQvC,SAAgB,mBAAmB,OAAwB;CACzD,IAAI,SAAS,QAAQ,CAAC,OAAO,SAAS,KAAK,GACzC,OAAA;CAEF,OAAO,KAAK,IAAI,GAAG,KAAK;AAC1B;AAEA,SAAgB,gBAAgB,QAA+B;CAC7D,OAAO,QAAQ,YAAY;AAC7B;AAWA,SAAgB,wBACd,MACA,SACQ;CACR,IAAI,WAAW,KAAK,QAClB,OAAO,KAAK;CAGd,MAAM,UAAU,KAAK,IACnB,KAAK,QACL,UAAA,EACF;CACA,KAAK,IAAI,WAAW,SAAS,WAAW,SAAS,YAC/C,IAAI,kBAAkB,IAAI,KAAK,SAAS,GACtC,OAAO,WAAW;CAItB,OAAO;AACT;;;;;;;AAQA,SAAgB,yBACd,oBACA,QACA,kBAAA,KACQ;CACR,IAAI,sBAAsB,GACxB,OAAA;CAEF,IAAI,UAAU,KAAK,mBAAmB,GACpC,OAAO;CAET,OAAO,KAAK,IAAA,GAEV,KAAK,KAAM,qBAAqB,SAAU,eAAe,CAC3D;AACF;;;;;;AAOA,SAAgB,uBAAuB,EACrC,aACA,mBACA,OAKS;CACT,IAAI,eAAe,KAAK,qBAAqB,MAC3C,OAAO;CAET,OAAO,KAAK,IAAI,GAAG,eAAe,MAAM,kBAAkB;AAC5D;;AAGA,eAAsB,mBACpB,OACA,QACe;CACf,IAAI,SAAS,KAAK,gBAAgB,MAAM,GACtC;CAEF,MAAM,IAAI,SAAe,YAAY;EACnC,MAAM,aAA0D,CAAC;EACjE,MAAM,gBAAsB;GAC1B,IAAI,WAAW,SACb,aAAa,WAAW,OAAO;GAEjC,QAAQ,oBAAoB,SAAS,OAAO;GAC5C,QAAQ;EACV;EACA,WAAW,UAAU,iBAAiB;GACpC,QAAQ,oBAAoB,SAAS,OAAO;GAC5C,QAAQ;EACV,GAAG,KAAK;EACR,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EACzD,IAAI,gBAAgB,MAAM,GACxB,QAAQ;CAEZ,CAAC;AACH;;;;;;;;;;;;;AAmDA,gBAAuB,aAAoB,EACzC,QACA,SACA,QACA,iBAMwB;CACxB,IAAI,EAAE,UAAU,IAAI;;;;EAIlB,WAAW,MAAM,QAAQ,QAAQ;GAC/B,IAAI,gBAAgB,MAAM,GAAG;IAC3B,gBAAgB;IAChB,MAAM,IAAI,MAAM,oBAAoB;GACtC;GACA,MAAM,KAAK,KAAK;IAAE,MAAM,KAAK;IAAM,SAAS;IAAM,QAAQ;GAAK,CAAC;EAClE;EACA;CACF;CAEA,MAAM,cAAyC,CAAC;CAChD,MAAM,gBAA+B;EAAE,MAAM;EAAO,QAAQ;CAAM;CAClE,IAAI,kBAAkB;CACtB,IAAI,qBAAqB;CACzB,IAAI,iBAAiB;CACrB,IAAI;CACJ,IAAI;CAEJ,MAAM,8BAAoC;EACxC,iBAAiB;EACjB,iBAAiB,KAAA;CACnB;CAEA,MAAM,+BAAqC;EACzC,iBAAiB;EACjB,iBAAiB,KAAA;CACnB;CAEA,MAAM,uBAAgC,kBAAkB,YAAY;CAEpE,MAAM,2BACJ,YAAY,SAAS;CAEvB,MAAM,0BACJ,mBAAmB,KAAA,OACnB,sBAAA;;;;CAKF,MAAM,kBAAkB,YAA2B;EACjD,IACE,eAAe,KACf,cAAc,QACd,cAAc,UACd,gBAAgB,MAAM,GAEtB;EAEF,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,gBAAsB;IAC1B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,uBAA6B;IAC3B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;GACzD,IAAI,gBAAgB,MAAM,GACxB,QAAQ;EAEZ,CAAC;CACH;CAEA,MAAM,oBAAoB,YAA2B;EACnD,OACE,kBAAkB,KAClB,CAAC,kBACD,CAAC,gBAAgB,MAAM,GAEvB,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,gBAAsB;IAC1B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,MAAM,gBAAsB;IAC1B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,iBAAiB;GACjB,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;GACzD,IAAI,gBAAgB,MAAM,GACxB,QAAQ;EAEZ,CAAC;CAEL;CAEA,MAAM,gBAAqD;EACzD,IAAI,CAAC,eAAe,GAClB;EAEF,MAAM,aAAa,YAAY;EAC/B;EACA,IAAI,kBAAkB,OAAO,kBAAkB,KAAK,YAAY,QAAQ;GACtE,YAAY,OAAO,GAAG,eAAe;GACrC,kBAAkB;EACpB;EACA,OAAO;CACT;CAEA,MAAM,qBAA4B;EAChC,gBAAgB;EAChB,MAAM,IAAI,MAAM,oBAAoB;CACtC;CAEA,MAAM,UAAU,OAAO,SAA2C;EAChE,MAAM,kBAAkB;EACxB,IAAI,kBAAkB,gBAAgB,MAAM,GAC1C,aAAa;EAEf,MAAM,aAAa,KAAK,SAAS,KAAK,KAAK,SAAS;EACpD,YAAY,KAAK;GAAE;GAAM;EAAW,CAAC;EACrC,sBAAsB;EACtB,sBAAsB;CACxB;;;;;;;;;CAUA,MAAM,mBAAmB,OAAO,SAA2C;EACzE,IACE,CAAC,KAAK,UACN,KAAK,WAAW,QAChB,KAAK,KAAK,UAAA,MACV;GACA,MAAM,QAAQ,IAAI;GAClB;EACF;EAEA,MAAM,WAA6C,CAAC;EACpD,IAAI,SAAS;EACb,OAAO,SAAS,KAAK,KAAK,QAAQ;GAChC,MAAM,MACJ,SACA,wBACE,KAAK,KAAK,MAAM,MAAM,GACtB,6BACF;GACF,SAAS,KAAK;IAAE,OAAO;IAAQ;GAAI,CAAC;GACpC,SAAS;EACX;EAEA,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACxC,MAAM,iBAAiB,MAAM;GAC7B,MAAM,gBAAgB,MAAM,SAAS,SAAS;GAC9C,MAAM,QAAQ;IACZ,MAAM,KAAK,KAAK,MAAM,SAAS,EAAE,CAAC,OAAO,SAAS,EAAE,CAAC,GAAG;IACxD,QAAQ;IACR,OAAO,UACL,KAAK,KAAK;KACR,MAAM,MAAM;KACZ,SAAS,kBAAkB,MAAM;KACjC,QAAQ,iBAAiB,MAAM;IACjC,CAAC;GACL,CAAC;EACH;CACF;CAEA,MAAM,YAAY,YAA2B;EAC3C,IAAI;GACF,WAAW,MAAM,QAAQ,QAAQ;IAC/B,IAAI,gBAAgB,MAAM,GACxB,aAAa;IAEf,MAAM,iBAAiB,IAAI;GAC7B;EACF,SAAS,OAAO;GACd,cAAc,SAAS;GACvB,cAAc,QAAQ;EACxB,UAAU;GACR,cAAc,OAAO;GACrB,sBAAsB;EACxB;CACF,EAAA,CAAG;CAEH,IAAI,iBAAiB;CACrB,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,aAAa;CACjB,IAAI,gBAAgB;CACpB,IAAI;EACF,OAAO,eAAe;GACpB,IAAI,gBAAgB,MAAM,GACxB,aAAa;GAGf,IAAI,WAAW,MAAM;IACnB,MAAM,gBAAgB;IACtB,UAAU,QAAQ;IAClB,aAAa;GACf;GAEA,IAAI,WAAW,MAAM;IACnB,IAAI,cAAc,QAChB,MAAM,cAAc,yBAAS,IAAI,MAAA,yBAA6B;IAEhE,IAAI,cAAc,MAChB,gBAAgB;IAElB;GACF;GAEA,MAAM,EAAE,SAAS;GAEjB,IAAI,CAAC,KAAK,QAAQ;IAChB,uBAAuB;IACvB,UAAU,KAAA;IACV,MAAM,KAAK,KAAK;KAAE,MAAM,KAAK;KAAM,SAAS;KAAM,QAAQ;IAAK,CAAC;IAChE;GACF;GAEA,IAAI,KAAK,SAAS,IAAI;IACpB,qBAAqB,KAAK,IACxB,GACA,qBAAqB,QAAQ,UAC/B;IACA,uBAAuB;IACvB,UAAU,KAAA;IACV;GACF;;;;GAKA,IAAI,cAAc,QAAQ,uBAAuB,MAC/C,sBAAsB,KAAK,IACzB,GACA,KAAK,MAAA,MAAiC,OAAO,CAC/C;GAEF,MAAM,aACJ,uBAAuB,OACnB,KAAK,IAAA,GAEL,KAAK,KAAK,qBAAqB,mBAAmB,CACpD,IACE,yBAAyB,oBAAoB,OAAO;GAC1D,IAAI,uBAAuB,QAAQ,sBAAsB,GACvD,uBAAuB;GAGzB,MAAM,mBACJ,uBAAuB;IACrB,aAAa,iBAAiB,UAAU;IACxC;IACA,KAAK,KAAK,IAAI;GAChB,CAAC,GACD,MACF;GACA,IAAI,gBAAgB,MAAM,GACxB,aAAa;GAEf,iBAAiB;GACjB,oBAAoB,KAAK,IAAI;GAE7B,IAAI,KAAK,WAAW,MAAM;IACxB,qBAAqB,KAAK,IACxB,GACA,qBAAqB,QAAQ,UAC/B;IACA,uBAAuB;IACvB,UAAU,KAAA;IACV,MAAM,KAAK,KAAK;KAAE,MAAM,KAAK;KAAM,SAAS;KAAM,QAAQ;IAAK,CAAC;IAChE;GACF;;;;;GAMA,IAAI,WAAW;GACf,OAAO,WAAW,YAAY;IAC5B,IAAI,gBAAgB,MAAM,GACxB,aAAa;IAEf,IAAI,WAAW,MAAM;KACnB,IAAI,CAAC,eAAe,GAClB;KAEF,UAAU,QAAQ;KAClB,aAAa;KACb,IAAI,WAAW,MACb;IAEJ;IAEA,MAAM,YAAY,QAAQ;IAC1B,IAAI,CAAC,UAAU,QAAQ;KACrB,uBAAuB;KACvB,UAAU,KAAA;KACV,MAAM,UAAU,KAAK;MACnB,MAAM,UAAU;MAChB,SAAS;MACT,QAAQ;KACV,CAAC;KACD;IACF;IACA,IAAI,UAAU,SAAS,IAAI;KACzB,qBAAqB,KAAK,IACxB,GACA,qBAAqB,QAAQ,UAC/B;KACA,uBAAuB;KACvB,UAAU,KAAA;KACV;IACF;IACA,IAAI,UAAU,WAAW,MACvB;IAIF,MAAM,cAAc,wBADE,UAAU,KAAK,MAAM,UAE7B,GACZ,aAAa,QACf;IACA,MAAM,WAAW,aAAa;IAC9B,MAAM,QAAQ,UAAU,KAAK,MAAM,YAAY,QAAQ;IACvD,MAAM,UAAU,eAAe;IAC/B,MAAM,SAAS,aAAa,UAAU,KAAK;IAE3C,qBAAqB,KAAK,IAAI,GAAG,qBAAqB,MAAM,MAAM;IAClE,uBAAuB;IACvB,IAAI,QACF,UAAU,KAAA;SAEV,aAAa;IAEf,YAAY,MAAM;IAClB,MAAM,UAAU,KAAK;KAAE,MAAM;KAAO;KAAS;IAAO,CAAC;GACvD;EACF;CACF,UAAU;EACR,iBAAiB;EACjB,IAAI,cAAc,MAChB,MAAM;OACD;GACL,gBAAgB;GAChB,uBAAuB;GAEvB,MAAM,UAAUA,OAAS,QAAQ,KAAK,QAAQ,KAAA,CAAkB;GAChE,IAAI,WAAW,MACb,QAAa,WACL,KAAA,SACA,KAAA,CACR;GAEF,MAAM,QAAQ,KAAK,CACjB,UACA,IAAI,SAAe,YAAY;IAE7B,WAD2B,SAAS,uBAC9B,CAAC,CAAC,MAAM;GAChB,CAAC,CACH,CAAC;EACH;CACF;AACF"}
+{"version":3,"file":"smoother.mjs","names":["iterator"],"sources":["../../../../src/llm/stream/smoother.ts"],"mappings":";AAAA,MAAa,uBAAuB;AAIpC,MAAa,gCAAgC;AAE7C,MAAa,oBAAyC,IAAI,IAAI;CAC5D;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,MAAa,uBAAuB;AAUpC,MAAa,0BAA0B;AAQvC,SAAgB,mBAAmB,OAAwB;CACzD,IAAI,SAAS,QAAQ,CAAC,OAAO,SAAS,KAAK,GACzC,OAAA;CAEF,OAAO,KAAK,IAAI,GAAG,KAAK;AAC1B;AAEA,SAAgB,gBAAgB,QAA+B;CAC7D,OAAO,QAAQ,YAAY;AAC7B;AAWA,SAAgB,wBACd,MACA,SACQ;CACR,IAAI,WAAW,KAAK,QAClB,OAAO,KAAK;CAGd,MAAM,UAAU,KAAK,IACnB,KAAK,QACL,UAAA,EACF;CACA,KAAK,IAAI,WAAW,SAAS,WAAW,SAAS,YAC/C,IAAI,kBAAkB,IAAI,KAAK,SAAS,GACtC,OAAO,WAAW;CAItB,OAAO;AACT;AAQA,SAAgB,yBACd,oBACA,QACA,kBAAA,KACQ;CACR,IAAI,sBAAsB,GACxB,OAAA;CAEF,IAAI,UAAU,KAAK,mBAAmB,GACpC,OAAO;CAET,OAAO,KAAK,IAAA,GAEV,KAAK,KAAM,qBAAqB,SAAU,eAAe,CAC3D;AACF;AAOA,SAAgB,uBAAuB,EACrC,aACA,mBACA,OAKS;CACT,IAAI,eAAe,KAAK,qBAAqB,MAC3C,OAAO;CAET,OAAO,KAAK,IAAI,GAAG,eAAe,MAAM,kBAAkB;AAC5D;AAGA,eAAsB,mBACpB,OACA,QACe;CACf,IAAI,SAAS,KAAK,gBAAgB,MAAM,GACtC;CAEF,MAAM,IAAI,SAAe,YAAY;EACnC,MAAM,aAA0D,CAAC;EACjE,MAAM,gBAAsB;GAC1B,IAAI,WAAW,SACb,aAAa,WAAW,OAAO;GAEjC,QAAQ,oBAAoB,SAAS,OAAO;GAC5C,QAAQ;EACV;EACA,WAAW,UAAU,iBAAiB;GACpC,QAAQ,oBAAoB,SAAS,OAAO;GAC5C,QAAQ;EACV,GAAG,KAAK;EACR,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EACzD,IAAI,gBAAgB,MAAM,GACxB,QAAQ;CAEZ,CAAC;AACH;AAmDA,gBAAuB,aAAoB,EACzC,QACA,SACA,QACA,iBAMwB;CACxB,IAAI,EAAE,UAAU,IAAI;EAIlB,WAAW,MAAM,QAAQ,QAAQ;GAC/B,IAAI,gBAAgB,MAAM,GAAG;IAC3B,gBAAgB;IAChB,MAAM,IAAI,MAAM,oBAAoB;GACtC;GACA,MAAM,KAAK,KAAK;IAAE,MAAM,KAAK;IAAM,SAAS;IAAM,QAAQ;GAAK,CAAC;EAClE;EACA;CACF;CAEA,MAAM,cAAyC,CAAC;CAChD,MAAM,gBAA+B;EAAE,MAAM;EAAO,QAAQ;CAAM;CAClE,IAAI,kBAAkB;CACtB,IAAI,qBAAqB;CACzB,IAAI,iBAAiB;CACrB,IAAI;CACJ,IAAI;CAEJ,MAAM,8BAAoC;EACxC,iBAAiB;EACjB,iBAAiB,KAAA;CACnB;CAEA,MAAM,+BAAqC;EACzC,iBAAiB;EACjB,iBAAiB,KAAA;CACnB;CAEA,MAAM,uBAAgC,kBAAkB,YAAY;CAEpE,MAAM,2BACJ,YAAY,SAAS;CAEvB,MAAM,0BACJ,mBAAmB,KAAA,OACnB,sBAAA;CAKF,MAAM,kBAAkB,YAA2B;EACjD,IACE,eAAe,KACf,cAAc,QACd,cAAc,UACd,gBAAgB,MAAM,GAEtB;EAEF,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,gBAAsB;IAC1B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,uBAA6B;IAC3B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;GACzD,IAAI,gBAAgB,MAAM,GACxB,QAAQ;EAEZ,CAAC;CACH;CAEA,MAAM,oBAAoB,YAA2B;EACnD,OACE,kBAAkB,KAClB,CAAC,kBACD,CAAC,gBAAgB,MAAM,GAEvB,MAAM,IAAI,SAAe,YAAY;GACnC,MAAM,gBAAsB;IAC1B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,MAAM,gBAAsB;IAC1B,QAAQ,oBAAoB,SAAS,OAAO;IAC5C,QAAQ;GACV;GACA,iBAAiB;GACjB,QAAQ,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;GACzD,IAAI,gBAAgB,MAAM,GACxB,QAAQ;EAEZ,CAAC;CAEL;CAEA,MAAM,gBAAqD;EACzD,IAAI,CAAC,eAAe,GAClB;EAEF,MAAM,aAAa,YAAY;EAC/B;EACA,IAAI,kBAAkB,OAAO,kBAAkB,KAAK,YAAY,QAAQ;GACtE,YAAY,OAAO,GAAG,eAAe;GACrC,kBAAkB;EACpB;EACA,OAAO;CACT;CAEA,MAAM,qBAA4B;EAChC,gBAAgB;EAChB,MAAM,IAAI,MAAM,oBAAoB;CACtC;CAEA,MAAM,UAAU,OAAO,SAA2C;EAChE,MAAM,kBAAkB;EACxB,IAAI,kBAAkB,gBAAgB,MAAM,GAC1C,aAAa;EAEf,MAAM,aAAa,KAAK,SAAS,KAAK,KAAK,SAAS;EACpD,YAAY,KAAK;GAAE;GAAM;EAAW,CAAC;EACrC,sBAAsB;EACtB,sBAAsB;CACxB;CAUA,MAAM,mBAAmB,OAAO,SAA2C;EACzE,IACE,CAAC,KAAK,UACN,KAAK,WAAW,QAChB,KAAK,KAAK,UAAA,MACV;GACA,MAAM,QAAQ,IAAI;GAClB;EACF;EAEA,MAAM,WAA6C,CAAC;EACpD,IAAI,SAAS;EACb,OAAO,SAAS,KAAK,KAAK,QAAQ;GAChC,MAAM,MACJ,SACA,wBACE,KAAK,KAAK,MAAM,MAAM,GACtB,6BACF;GACF,SAAS,KAAK;IAAE,OAAO;IAAQ;GAAI,CAAC;GACpC,SAAS;EACX;EAEA,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GACxC,MAAM,iBAAiB,MAAM;GAC7B,MAAM,gBAAgB,MAAM,SAAS,SAAS;GAC9C,MAAM,QAAQ;IACZ,MAAM,KAAK,KAAK,MAAM,SAAS,EAAE,CAAC,OAAO,SAAS,EAAE,CAAC,GAAG;IACxD,QAAQ;IACR,OAAO,UACL,KAAK,KAAK;KACR,MAAM,MAAM;KACZ,SAAS,kBAAkB,MAAM;KACjC,QAAQ,iBAAiB,MAAM;IACjC,CAAC;GACL,CAAC;EACH;CACF;CAEA,MAAM,YAAY,YAA2B;EAC3C,IAAI;GACF,WAAW,MAAM,QAAQ,QAAQ;IAC/B,IAAI,gBAAgB,MAAM,GACxB,aAAa;IAEf,MAAM,iBAAiB,IAAI;GAC7B;EACF,SAAS,OAAO;GACd,cAAc,SAAS;GACvB,cAAc,QAAQ;EACxB,UAAU;GACR,cAAc,OAAO;GACrB,sBAAsB;EACxB;CACF,EAAA,CAAG;CAEH,IAAI,iBAAiB;CACrB,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI,aAAa;CACjB,IAAI,gBAAgB;CACpB,IAAI;EACF,OAAO,eAAe;GACpB,IAAI,gBAAgB,MAAM,GACxB,aAAa;GAGf,IAAI,WAAW,MAAM;IACnB,MAAM,gBAAgB;IACtB,UAAU,QAAQ;IAClB,aAAa;GACf;GAEA,IAAI,WAAW,MAAM;IACnB,IAAI,cAAc,QAChB,MAAM,cAAc,yBAAS,IAAI,MAAA,yBAA6B;IAEhE,IAAI,cAAc,MAChB,gBAAgB;IAElB;GACF;GAEA,MAAM,EAAE,SAAS;GAEjB,IAAI,CAAC,KAAK,QAAQ;IAChB,uBAAuB;IACvB,UAAU,KAAA;IACV,MAAM,KAAK,KAAK;KAAE,MAAM,KAAK;KAAM,SAAS;KAAM,QAAQ;IAAK,CAAC;IAChE;GACF;GAEA,IAAI,KAAK,SAAS,IAAI;IACpB,qBAAqB,KAAK,IACxB,GACA,qBAAqB,QAAQ,UAC/B;IACA,uBAAuB;IACvB,UAAU,KAAA;IACV;GACF;GAKA,IAAI,cAAc,QAAQ,uBAAuB,MAC/C,sBAAsB,KAAK,IACzB,GACA,KAAK,MAAA,MAAiC,OAAO,CAC/C;GAEF,MAAM,aACJ,uBAAuB,OACnB,KAAK,IAAA,GAEL,KAAK,KAAK,qBAAqB,mBAAmB,CACpD,IACE,yBAAyB,oBAAoB,OAAO;GAC1D,IAAI,uBAAuB,QAAQ,sBAAsB,GACvD,uBAAuB;GAGzB,MAAM,mBACJ,uBAAuB;IACrB,aAAa,iBAAiB,UAAU;IACxC;IACA,KAAK,KAAK,IAAI;GAChB,CAAC,GACD,MACF;GACA,IAAI,gBAAgB,MAAM,GACxB,aAAa;GAEf,iBAAiB;GACjB,oBAAoB,KAAK,IAAI;GAE7B,IAAI,KAAK,WAAW,MAAM;IACxB,qBAAqB,KAAK,IACxB,GACA,qBAAqB,QAAQ,UAC/B;IACA,uBAAuB;IACvB,UAAU,KAAA;IACV,MAAM,KAAK,KAAK;KAAE,MAAM,KAAK;KAAM,SAAS;KAAM,QAAQ;IAAK,CAAC;IAChE;GACF;GAMA,IAAI,WAAW;GACf,OAAO,WAAW,YAAY;IAC5B,IAAI,gBAAgB,MAAM,GACxB,aAAa;IAEf,IAAI,WAAW,MAAM;KACnB,IAAI,CAAC,eAAe,GAClB;KAEF,UAAU,QAAQ;KAClB,aAAa;KACb,IAAI,WAAW,MACb;IAEJ;IAEA,MAAM,YAAY,QAAQ;IAC1B,IAAI,CAAC,UAAU,QAAQ;KACrB,uBAAuB;KACvB,UAAU,KAAA;KACV,MAAM,UAAU,KAAK;MACnB,MAAM,UAAU;MAChB,SAAS;MACT,QAAQ;KACV,CAAC;KACD;IACF;IACA,IAAI,UAAU,SAAS,IAAI;KACzB,qBAAqB,KAAK,IACxB,GACA,qBAAqB,QAAQ,UAC/B;KACA,uBAAuB;KACvB,UAAU,KAAA;KACV;IACF;IACA,IAAI,UAAU,WAAW,MACvB;IAIF,MAAM,cAAc,wBADE,UAAU,KAAK,MAAM,UAE7B,GACZ,aAAa,QACf;IACA,MAAM,WAAW,aAAa;IAC9B,MAAM,QAAQ,UAAU,KAAK,MAAM,YAAY,QAAQ;IACvD,MAAM,UAAU,eAAe;IAC/B,MAAM,SAAS,aAAa,UAAU,KAAK;IAE3C,qBAAqB,KAAK,IAAI,GAAG,qBAAqB,MAAM,MAAM;IAClE,uBAAuB;IACvB,IAAI,QACF,UAAU,KAAA;SAEV,aAAa;IAEf,YAAY,MAAM;IAClB,MAAM,UAAU,KAAK;KAAE,MAAM;KAAO;KAAS;IAAO,CAAC;GACvD;EACF;CACF,UAAU;EACR,iBAAiB;EACjB,IAAI,cAAc,MAChB,MAAM;OACD;GACL,gBAAgB;GAChB,uBAAuB;GAEvB,MAAM,UAAUA,OAAS,QAAQ,KAAK,QAAQ,KAAA,CAAkB;GAChE,IAAI,WAAW,MACb,QAAa,WACL,KAAA,SACA,KAAA,CACR;GAEF,MAAM,QAAQ,KAAK,CACjB,UACA,IAAI,SAAe,YAAY;IAE7B,WAD2B,SAAS,uBAC9B,CAAC,CAAC,MAAM;GAChB,CAAC,CACH,CAAC;EACH;CACF;AACF"}