@opengeni/react 1.4.4 → 1.4.5-canary.37485542607001

package/dist/chunk-RI42H5IU.js

@@ -0,0 +1,326 @@
+"use client";
+
+// src/components/queue-item-content.ts
+var QUEUE_ITEM_CONTENT_UNAVAILABLE = "Content unavailable";
+function queueItemContent(text, annotationCount) {
+  if (text.length > 0) return "text";
+  return annotationCount > 0 ? "annotations" : "unavailable";
+}
+
+// src/queue-presentation-model.ts
+var QUEUE_ROW_PREVIEW_CHARACTERS = 360;
+var QUEUE_COLLAPSED_PREVIEW_CHARACTERS = 180;
+var QUEUE_PREVIEW_GRAPHEME_CONTEXT_CHARACTERS = 32;
+var QUEUE_PREVIEW_REFERENCE_SAMPLE_CHARACTERS = 32;
+var QUEUE_VISIBLE_END_IDENTITY_CHARACTERS = 18;
+var QUEUE_PREVIEW_SEPARATOR = " \u2026 ";
+var queuePreviewSegmenterCache;
+function queuePreviewSegments(sample) {
+  if (queuePreviewSegmenterCache === void 0) {
+    queuePreviewSegmenterCache = typeof Intl !== "undefined" && typeof Intl.Segmenter === "function" ? new Intl.Segmenter(void 0, { granularity: "grapheme" }) : null;
+  }
+  if (!queuePreviewSegmenterCache) return Array.from(sample);
+  return Array.from(queuePreviewSegmenterCache.segment(sample), (part) => part.segment);
+}
+var queuePromptNonRenderingCodePoint = /[\p{White_Space}\p{Control}\p{Default_Ignorable_Code_Point}]/u;
+function labelQueuePreview(summary) {
+  return {
+    summary,
+    collapsedVisual: summary,
+    visibleStart: summary,
+    visibleIdentity: null,
+    visibleIdentityLabel: null,
+    isFallback: false
+  };
+}
+function queueTurnPreview(turn, maxCharacters) {
+  if (!turn) return queuePromptPreview("", maxCharacters);
+  return queueContentPreview(turn.prompt, turn.annotations?.length ?? 0, maxCharacters);
+}
+function queueContentPreview(prompt, annotationCount, maxCharacters) {
+  switch (queueItemContent(prompt, annotationCount)) {
+    case "text":
+      return queuePromptPreview(prompt, maxCharacters);
+    case "annotations":
+      return labelQueuePreview(
+        `${annotationCount} timeline ${annotationCount === 1 ? "annotation" : "annotations"}`
+      );
+    case "unavailable":
+      return labelQueuePreview(QUEUE_ITEM_CONTENT_UNAVAILABLE);
+  }
+}
+function queuePromptPreview(prompt, maxCharacters) {
+  const wholePromptProbe = samplePromptStart(prompt, maxCharacters + 1);
+  if (!wholePromptProbe.truncated && wholePromptProbe.characters <= maxCharacters) {
+    const summary2 = replaceLoneSurrogates(wholePromptProbe.value);
+    return hasVisiblePromptContent(summary2) ? {
+      summary: summary2,
+      collapsedVisual: summary2,
+      visibleStart: summary2,
+      visibleIdentity: null,
+      visibleIdentityLabel: null,
+      isFallback: false
+    } : fallbackPromptPreview(prompt.length, wholePromptProbe.value, wholePromptProbe.value);
+  }
+  const suffixCharacters = Math.min(Math.floor(maxCharacters / 3), 120);
+  const prefixCharacters = maxCharacters - codePointLength(QUEUE_PREVIEW_SEPARATOR) - suffixCharacters;
+  const prefixSample = samplePromptStart(
+    prompt,
+    prefixCharacters + QUEUE_PREVIEW_GRAPHEME_CONTEXT_CHARACTERS
+  );
+  const suffixSample = samplePromptEnd(
+    prompt,
+    suffixCharacters + QUEUE_PREVIEW_GRAPHEME_CONTEXT_CHARACTERS
+  );
+  const prefixSegments = segmentPromptSample(prefixSample.value);
+  const suffixSegments = segmentPromptSample(suffixSample.value);
+  if (prefixSample.truncated) prefixSegments.pop();
+  if (suffixSample.truncated) {
+    let ambiguousSegment = suffixSegments.shift();
+    while (ambiguousSegment?.endsWith("\u200D") && suffixSegments.length > 0) {
+      ambiguousSegment = suffixSegments.shift();
+    }
+    while (suffixSegments[0] && startsWithRegionalIndicator(suffixSegments[0])) {
+      suffixSegments.shift();
+    }
+  }
+  const prefix = takeWholeGraphemesFromStart(prefixSegments, prefixCharacters);
+  const suffix = takeWholeGraphemesFromEnd(suffixSegments, suffixCharacters);
+  const reference = boundedPromptSampleReference(
+    prompt.length,
+    prefixSample.value,
+    suffixSample.value
+  );
+  if (!hasVisiblePromptContent(prefix) && !hasVisiblePromptContent(suffix)) {
+    return fallbackPromptPreview(prompt.length, prefixSample.value, suffixSample.value);
+  }
+  const safeSuffix = hasVisiblePromptContent(suffix) ? suffix : promptPreviewFallbackLabel(reference);
+  const summary = `${prefix}${QUEUE_PREVIEW_SEPARATOR}${safeSuffix}`;
+  if (!hasVisiblePromptContent(prefix)) {
+    return {
+      summary,
+      collapsedVisual: summary,
+      visibleStart: safeSuffix,
+      visibleIdentity: null,
+      visibleIdentityLabel: null,
+      isFallback: false
+    };
+  }
+  const endIdentity = takeWholeGraphemesFromEnd(
+    suffixSegments,
+    QUEUE_VISIBLE_END_IDENTITY_CHARACTERS
+  );
+  return {
+    summary,
+    collapsedVisual: summary,
+    visibleStart: prefix,
+    visibleIdentity: hasVisiblePromptContent(endIdentity) ? endIdentity : `ref ${reference}`,
+    visibleIdentityLabel: hasVisiblePromptContent(endIdentity) ? "End" : "Safe boundary",
+    isFallback: false
+  };
+}
+function fallbackPromptPreview(promptLength, startSample, endSample) {
+  const reference = boundedPromptSampleReference(promptLength, startSample, endSample);
+  const summary = promptPreviewFallbackLabel(reference);
+  return {
+    summary,
+    collapsedVisual: `Omitted \xB7 ${reference}`,
+    // The complete fallback remains the canonical accessible summary. Narrow
+    // collapsed/row layouts paint the bounded reference in a compact truthful
+    // form so ellipsis cannot hide the only identifying portion.
+    visibleStart: `Omitted \xB7 ${reference}`,
+    visibleIdentity: null,
+    visibleIdentityLabel: null,
+    isFallback: true
+  };
+}
+function promptPreviewFallbackLabel(reference) {
+  return `Content omitted at safe boundary \xB7 ref ${reference}`;
+}
+function boundedPromptSampleReference(promptLength, startSample, endSample) {
+  const head = samplePromptStart(startSample, QUEUE_PREVIEW_REFERENCE_SAMPLE_CHARACTERS).value;
+  const tail = samplePromptEnd(endSample, QUEUE_PREVIEW_REFERENCE_SAMPLE_CHARACTERS).value;
+  let hash = 2166136261;
+  for (const value of [String(promptLength), head, tail]) {
+    for (let index = 0; index < value.length; index += 1) {
+      hash ^= value.charCodeAt(index);
+      hash = Math.imul(hash, 16777619);
+    }
+    hash ^= 65535;
+    hash = Math.imul(hash, 16777619);
+  }
+  return (hash >>> 0).toString(16).padStart(8, "0").toUpperCase();
+}
+function hasVisiblePromptContent(value) {
+  for (const character of value) {
+    if (!queuePromptNonRenderingCodePoint.test(character)) return true;
+  }
+  return false;
+}
+function samplePromptStart(prompt, maxCharacters) {
+  let end = 0;
+  let characters = 0;
+  while (end < prompt.length && characters < maxCharacters) {
+    const first = prompt.charCodeAt(end);
+    end += isHighSurrogate(first) && end + 1 < prompt.length && isLowSurrogate(prompt.charCodeAt(end + 1)) ? 2 : 1;
+    characters += 1;
+  }
+  return { value: prompt.slice(0, end), characters, truncated: end < prompt.length };
+}
+function samplePromptEnd(prompt, maxCharacters) {
+  let start = prompt.length;
+  let characters = 0;
+  while (start > 0 && characters < maxCharacters) {
+    start -= 1;
+    if (isLowSurrogate(prompt.charCodeAt(start)) && start > 0 && isHighSurrogate(prompt.charCodeAt(start - 1))) {
+      start -= 1;
+    }
+    characters += 1;
+  }
+  return { value: prompt.slice(start), characters, truncated: start > 0 };
+}
+function segmentPromptSample(sample) {
+  return queuePreviewSegments(replaceLoneSurrogates(sample));
+}
+function replaceLoneSurrogates(value) {
+  let sanitized = "";
+  for (let index = 0; index < value.length; index += 1) {
+    const current = value.charCodeAt(index);
+    if (isHighSurrogate(current) && index + 1 < value.length && isLowSurrogate(value.charCodeAt(index + 1))) {
+      sanitized += value.slice(index, index + 2);
+      index += 1;
+    } else if (isHighSurrogate(current) || isLowSurrogate(current)) {
+      sanitized += "\uFFFD";
+    } else {
+      sanitized += value[index];
+    }
+  }
+  return sanitized;
+}
+function takeWholeGraphemesFromStart(segments, maxCharacters) {
+  const selected = [];
+  let characters = 0;
+  for (const segment of segments) {
+    const segmentCharacters = codePointLength(segment);
+    if (characters + segmentCharacters > maxCharacters) break;
+    selected.push(segment);
+    characters += segmentCharacters;
+  }
+  while (selected.at(-1)?.trim().length === 0) selected.pop();
+  return selected.join("");
+}
+function takeWholeGraphemesFromEnd(segments, maxCharacters) {
+  const selected = [];
+  let characters = 0;
+  for (let index = segments.length - 1; index >= 0; index -= 1) {
+    const segment = segments[index];
+    if (!segment) continue;
+    const segmentCharacters = codePointLength(segment);
+    if (characters + segmentCharacters > maxCharacters) break;
+    selected.unshift(segment);
+    characters += segmentCharacters;
+  }
+  while (selected[0]?.trim().length === 0) selected.shift();
+  while (selected.at(-1)?.trim().length === 0) selected.pop();
+  return selected.join("");
+}
+function codePointLength(value) {
+  let characters = 0;
+  for (const _character of value) characters += 1;
+  return characters;
+}
+function startsWithRegionalIndicator(value) {
+  const codePoint = value.codePointAt(0);
+  return codePoint !== void 0 && codePoint >= 127462 && codePoint <= 127487;
+}
+function isHighSurrogate(codeUnit) {
+  return codeUnit >= 55296 && codeUnit <= 56319;
+}
+function isLowSurrogate(codeUnit) {
+  return codeUnit >= 56320 && codeUnit <= 57343;
+}
+function moveQueueItem(items, from, to) {
+  const next = items.slice();
+  const [item] = next.splice(from, 1);
+  if (item === void 0) return next;
+  next.splice(to < 0 ? next.length + to : to, 0, item);
+  return next;
+}
+function queueMovePlan(queue, turnId, nextIndex) {
+  const oldIndex = queue.findIndex((turn) => turn.id === turnId);
+  if (oldIndex < 0) return null;
+  const index = Math.max(0, Math.min(nextIndex, queue.length - 1));
+  if (oldIndex === index) return null;
+  const ordered = moveQueueItem(queue, oldIndex, index);
+  return {
+    turnIds: ordered.map((turn) => turn.id),
+    beforeTurnId: ordered[index + 1]?.id ?? null,
+    index
+  };
+}
+function projectPendingQueueMove(queue, pendingMove, snapshot) {
+  if (!pendingMove || pendingMove.baseVersion === null || snapshot?.version !== pendingMove.baseVersion) {
+    return queue;
+  }
+  const byId = new Map(queue.map((turn) => [turn.id, turn]));
+  const projected = pendingMove.turnIds.map((turnId) => byId.get(turnId));
+  if (projected.some((turn) => !turn) || projected.length !== queue.length) {
+    return queue;
+  }
+  return projected;
+}
+var QUEUE_REPLACE_DRAFT_COPY = {
+  title: "Your composer already has a draft. Replace it with this queued prompt?",
+  detail: "The current draft will be permanently discarded; this queued prompt is preserved until you confirm.",
+  keep: "Keep current draft",
+  replace: "Replace and edit"
+};
+function objectValue(value) {
+  return value !== null && typeof value === "object" && !Array.isArray(value) ? value : null;
+}
+function queuedTurnPresentation(turn) {
+  const realtimeDelegation = objectValue(turn.metadata.realtimeDelegation);
+  const inputTranscript = realtimeDelegation?.inputTranscript;
+  if (typeof inputTranscript === "string" && inputTranscript.trim()) {
+    return { kind: "realtime_voice", text: inputTranscript.trim() };
+  }
+  if (objectValue(turn.metadata.realtimeTailFlush)) {
+    return { kind: "realtime_voice_handoff", text: "Remaining voice context" };
+  }
+  return { kind: "prompt", text: turn.prompt };
+}
+function isSteeringTurn(turn) {
+  return turn.metadata.delivery === "steer";
+}
+function isAuthoritativeQueuedTurn(turn, mutationFor) {
+  return !isSteeringTurn(turn) && mutationFor(turn.id) !== "steer";
+}
+function countAuthoritativeQueuedTurns(turns, mutationFor) {
+  return turns.filter((turn) => isAuthoritativeQueuedTurn(turn, mutationFor)).length;
+}
+function queueNeighborAnchors(turns, index) {
+  return {
+    beforeUp: index > 0 ? turns[index - 1]?.id ?? null : null,
+    beforeDown: index < turns.length - 1 ? turns[index + 2]?.id ?? null : null
+  };
+}
+
+export {
+  QUEUE_ITEM_CONTENT_UNAVAILABLE,
+  queueItemContent,
+  QUEUE_ROW_PREVIEW_CHARACTERS,
+  QUEUE_COLLAPSED_PREVIEW_CHARACTERS,
+  queueTurnPreview,
+  queueContentPreview,
+  queuePromptPreview,
+  moveQueueItem,
+  queueMovePlan,
+  projectPendingQueueMove,
+  QUEUE_REPLACE_DRAFT_COPY,
+  queuedTurnPresentation,
+  isSteeringTurn,
+  isAuthoritativeQueuedTurn,
+  countAuthoritativeQueuedTurns,
+  queueNeighborAnchors
+};
+//# sourceMappingURL=chunk-RI42H5IU.js.map

package/dist/chunk-RI42H5IU.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/components/queue-item-content.ts","../src/queue-presentation-model.ts"],"sourcesContent":["/**\n * One presentation rule for a queued item, shared by the full queue and the\n * compact session-chrome dock so the two cannot drift. A turn with an empty\n * prompt and timeline annotations is valid content; an item with neither is a\n * malformed or legacy object that gets an explicit fallback, never a blank row.\n */\nexport type QueueItemContent = \"text\" | \"annotations\" | \"unavailable\";\n\nexport const QUEUE_ITEM_CONTENT_UNAVAILABLE = \"Content unavailable\";\n\nexport function queueItemContent(text: string, annotationCount: number): QueueItemContent {\n  if (text.length > 0) return \"text\";\n  return annotationCount > 0 ? \"annotations\" : \"unavailable\";\n}\n","/**\n * Queue presentation shared by the web queue surface and native docks: the\n * bounded head/tail previews of queued prompts, and the reorder plan and its\n * optimistic projection. No DOM, no React.\n */\nimport type { SessionQueueSnapshot, SessionTurn } from \"@opengeni/sdk\";\nimport { QUEUE_ITEM_CONTENT_UNAVAILABLE, queueItemContent } from \"./components/queue-item-content\";\n\nexport { QUEUE_ITEM_CONTENT_UNAVAILABLE, queueItemContent };\n\nexport const QUEUE_ROW_PREVIEW_CHARACTERS = 360;\nexport const QUEUE_COLLAPSED_PREVIEW_CHARACTERS = 180;\nconst QUEUE_PREVIEW_GRAPHEME_CONTEXT_CHARACTERS = 32;\nconst QUEUE_PREVIEW_REFERENCE_SAMPLE_CHARACTERS = 32;\nconst QUEUE_VISIBLE_END_IDENTITY_CHARACTERS = 18;\nconst QUEUE_PREVIEW_SEPARATOR = \" … \";\n// Hermes (React Native) has no Intl.Segmenter; there, previews fall back to\n// code points, which keeps every boundary rule except grapheme joining.\nlet queuePreviewSegmenterCache: Intl.Segmenter | null | undefined;\nfunction queuePreviewSegments(sample: string): string[] {\n  if (queuePreviewSegmenterCache === undefined) {\n    queuePreviewSegmenterCache =\n      typeof Intl !== \"undefined\" && typeof Intl.Segmenter === \"function\"\n        ? new Intl.Segmenter(undefined, { granularity: \"grapheme\" })\n        : null;\n  }\n  if (!queuePreviewSegmenterCache) return Array.from(sample);\n  return Array.from(queuePreviewSegmenterCache.segment(sample), (part) => part.segment);\n}\nconst queuePromptNonRenderingCodePoint =\n  /[\\p{White_Space}\\p{Control}\\p{Default_Ignorable_Code_Point}]/u;\n\ntype BoundedPromptSample = {\n  value: string;\n  characters: number;\n  truncated: boolean;\n};\n\nexport type QueuePromptPreview = {\n  summary: string;\n  collapsedVisual: string;\n  visibleStart: string;\n  visibleIdentity: string | null;\n  visibleIdentityLabel: \"End\" | \"Safe boundary\" | null;\n  isFallback: boolean;\n};\n\nfunction labelQueuePreview(summary: string): QueuePromptPreview {\n  return {\n    summary,\n    collapsedVisual: summary,\n    visibleStart: summary,\n    visibleIdentity: null,\n    visibleIdentityLabel: null,\n    isFallback: false,\n  };\n}\n\nexport function queueTurnPreview(\n  turn: SessionTurn | undefined,\n  maxCharacters: number,\n): QueuePromptPreview {\n  if (!turn) return queuePromptPreview(\"\", maxCharacters);\n  return queueContentPreview(turn.prompt, turn.annotations?.length ?? 0, maxCharacters);\n}\n\nexport function queueContentPreview(\n  prompt: string,\n  annotationCount: number,\n  maxCharacters: number,\n): QueuePromptPreview {\n  switch (queueItemContent(prompt, annotationCount)) {\n    case \"text\":\n      return queuePromptPreview(prompt, maxCharacters);\n    case \"annotations\":\n      return labelQueuePreview(\n        `${annotationCount} timeline ${annotationCount === 1 ? \"annotation\" : \"annotations\"}`,\n      );\n    case \"unavailable\":\n      return labelQueuePreview(QUEUE_ITEM_CONTENT_UNAVAILABLE);\n  }\n}\n\n/**\n * Build a bounded head/tail summary of an arbitrary queued prompt. Sampling\n * both ends distinguishes prompts with equal long prefixes. Each sampled edge\n * has a small amount of grapheme context so ordinary emoji/combining sequences\n * can be retained whole. A cluster that exceeds that context is omitted rather\n * than fragmented, and malformed UTF-16 is replaced only in the summary. The\n * durable prompt remains exact and no operation scans or copies it in full.\n */\nexport function queuePromptPreview(prompt: string, maxCharacters: number): QueuePromptPreview {\n  const wholePromptProbe = samplePromptStart(prompt, maxCharacters + 1);\n  if (!wholePromptProbe.truncated && wholePromptProbe.characters <= maxCharacters) {\n    const summary = replaceLoneSurrogates(wholePromptProbe.value);\n    return hasVisiblePromptContent(summary)\n      ? {\n          summary,\n          collapsedVisual: summary,\n          visibleStart: summary,\n          visibleIdentity: null,\n          visibleIdentityLabel: null,\n          isFallback: false,\n        }\n      : fallbackPromptPreview(prompt.length, wholePromptProbe.value, wholePromptProbe.value);\n  }\n\n  const suffixCharacters = Math.min(Math.floor(maxCharacters / 3), 120);\n  const prefixCharacters =\n    maxCharacters - codePointLength(QUEUE_PREVIEW_SEPARATOR) - suffixCharacters;\n  const prefixSample = samplePromptStart(\n    prompt,\n    prefixCharacters + QUEUE_PREVIEW_GRAPHEME_CONTEXT_CHARACTERS,\n  );\n  const suffixSample = samplePromptEnd(\n    prompt,\n    suffixCharacters + QUEUE_PREVIEW_GRAPHEME_CONTEXT_CHARACTERS,\n  );\n  const prefixSegments = segmentPromptSample(prefixSample.value);\n  const suffixSegments = segmentPromptSample(suffixSample.value);\n\n  // A cluster at a truncated sampling edge may continue outside the sample.\n  // Prefix sampling starts at the true source start, so only its last segment\n  // is ambiguous. Suffix sampling ends at the true source end, so its first is.\n  if (prefixSample.truncated) prefixSegments.pop();\n  if (suffixSample.truncated) {\n    let ambiguousSegment = suffixSegments.shift();\n    // A locally segmented leading fragment ending in ZWJ can join the next\n    // pictographic segment when omitted left context supplies its base. Keep\n    // backing off until that uncertainty no longer propagates to the right.\n    while (ambiguousSegment?.endsWith(\"\\u200d\") && suffixSegments.length > 0) {\n      ambiguousSegment = suffixSegments.shift();\n    }\n    // Regional Indicator pairing depends on the parity of the preceding run.\n    // If that run reaches the unknown sample boundary, omit all of its visible\n    // leading segments rather than potentially recombining halves of flags.\n    while (suffixSegments[0] && startsWithRegionalIndicator(suffixSegments[0])) {\n      suffixSegments.shift();\n    }\n  }\n\n  const prefix = takeWholeGraphemesFromStart(prefixSegments, prefixCharacters);\n  const suffix = takeWholeGraphemesFromEnd(suffixSegments, suffixCharacters);\n  const reference = boundedPromptSampleReference(\n    prompt.length,\n    prefixSample.value,\n    suffixSample.value,\n  );\n\n  if (!hasVisiblePromptContent(prefix) && !hasVisiblePromptContent(suffix)) {\n    return fallbackPromptPreview(prompt.length, prefixSample.value, suffixSample.value);\n  }\n\n  const safeSuffix = hasVisiblePromptContent(suffix)\n    ? suffix\n    : promptPreviewFallbackLabel(reference);\n  const summary = `${prefix}${QUEUE_PREVIEW_SEPARATOR}${safeSuffix}`;\n  if (!hasVisiblePromptContent(prefix)) {\n    return {\n      summary,\n      collapsedVisual: summary,\n      visibleStart: safeSuffix,\n      visibleIdentity: null,\n      visibleIdentityLabel: null,\n      isFallback: false,\n    };\n  }\n\n  const endIdentity = takeWholeGraphemesFromEnd(\n    suffixSegments,\n    QUEUE_VISIBLE_END_IDENTITY_CHARACTERS,\n  );\n  return {\n    summary,\n    collapsedVisual: summary,\n    visibleStart: prefix,\n    visibleIdentity: hasVisiblePromptContent(endIdentity) ? endIdentity : `ref ${reference}`,\n    visibleIdentityLabel: hasVisiblePromptContent(endIdentity) ? \"End\" : \"Safe boundary\",\n    isFallback: false,\n  };\n}\n\nfunction fallbackPromptPreview(\n  promptLength: number,\n  startSample: string,\n  endSample: string,\n): QueuePromptPreview {\n  const reference = boundedPromptSampleReference(promptLength, startSample, endSample);\n  const summary = promptPreviewFallbackLabel(reference);\n  return {\n    summary,\n    collapsedVisual: `Omitted · ${reference}`,\n    // The complete fallback remains the canonical accessible summary. Narrow\n    // collapsed/row layouts paint the bounded reference in a compact truthful\n    // form so ellipsis cannot hide the only identifying portion.\n    visibleStart: `Omitted · ${reference}`,\n    visibleIdentity: null,\n    visibleIdentityLabel: null,\n    isFallback: true,\n  };\n}\n\nfunction promptPreviewFallbackLabel(reference: string): string {\n  return `Content omitted at safe boundary · ref ${reference}`;\n}\n\nfunction boundedPromptSampleReference(\n  promptLength: number,\n  startSample: string,\n  endSample: string,\n): string {\n  const head = samplePromptStart(startSample, QUEUE_PREVIEW_REFERENCE_SAMPLE_CHARACTERS).value;\n  const tail = samplePromptEnd(endSample, QUEUE_PREVIEW_REFERENCE_SAMPLE_CHARACTERS).value;\n  let hash = 0x811c9dc5;\n  for (const value of [String(promptLength), head, tail]) {\n    for (let index = 0; index < value.length; index += 1) {\n      hash ^= value.charCodeAt(index);\n      hash = Math.imul(hash, 0x01000193);\n    }\n    hash ^= 0xffff;\n    hash = Math.imul(hash, 0x01000193);\n  }\n  return (hash >>> 0).toString(16).padStart(8, \"0\").toUpperCase();\n}\n\nfunction hasVisiblePromptContent(value: string): boolean {\n  // Callers pass only the already-bounded whole/head/tail preview samples.\n  // Default-ignorables and controls can survive trim() while painting no row\n  // identity at all (for example ZWJ, VS16, bidi controls, and tag characters).\n  for (const character of value) {\n    if (!queuePromptNonRenderingCodePoint.test(character)) return true;\n  }\n  return false;\n}\n\nfunction samplePromptStart(prompt: string, maxCharacters: number): BoundedPromptSample {\n  let end = 0;\n  let characters = 0;\n  while (end < prompt.length && characters < maxCharacters) {\n    const first = prompt.charCodeAt(end);\n    end +=\n      isHighSurrogate(first) &&\n      end + 1 < prompt.length &&\n      isLowSurrogate(prompt.charCodeAt(end + 1))\n        ? 2\n        : 1;\n    characters += 1;\n  }\n  return { value: prompt.slice(0, end), characters, truncated: end < prompt.length };\n}\n\nfunction samplePromptEnd(prompt: string, maxCharacters: number): BoundedPromptSample {\n  let start = prompt.length;\n  let characters = 0;\n  while (start > 0 && characters < maxCharacters) {\n    start -= 1;\n    if (\n      isLowSurrogate(prompt.charCodeAt(start)) &&\n      start > 0 &&\n      isHighSurrogate(prompt.charCodeAt(start - 1))\n    ) {\n      start -= 1;\n    }\n    characters += 1;\n  }\n  return { value: prompt.slice(start), characters, truncated: start > 0 };\n}\n\nfunction segmentPromptSample(sample: string): string[] {\n  return queuePreviewSegments(replaceLoneSurrogates(sample));\n}\n\nfunction replaceLoneSurrogates(value: string): string {\n  let sanitized = \"\";\n  for (let index = 0; index < value.length; index += 1) {\n    const current = value.charCodeAt(index);\n    if (\n      isHighSurrogate(current) &&\n      index + 1 < value.length &&\n      isLowSurrogate(value.charCodeAt(index + 1))\n    ) {\n      sanitized += value.slice(index, index + 2);\n      index += 1;\n    } else if (isHighSurrogate(current) || isLowSurrogate(current)) {\n      sanitized += \"�\";\n    } else {\n      sanitized += value[index];\n    }\n  }\n  return sanitized;\n}\n\nfunction takeWholeGraphemesFromStart(segments: string[], maxCharacters: number): string {\n  const selected: string[] = [];\n  let characters = 0;\n  for (const segment of segments) {\n    const segmentCharacters = codePointLength(segment);\n    if (characters + segmentCharacters > maxCharacters) break;\n    selected.push(segment);\n    characters += segmentCharacters;\n  }\n  while (selected.at(-1)?.trim().length === 0) selected.pop();\n  return selected.join(\"\");\n}\n\nfunction takeWholeGraphemesFromEnd(segments: string[], maxCharacters: number): string {\n  const selected: string[] = [];\n  let characters = 0;\n  for (let index = segments.length - 1; index >= 0; index -= 1) {\n    const segment = segments[index];\n    if (!segment) continue;\n    const segmentCharacters = codePointLength(segment);\n    if (characters + segmentCharacters > maxCharacters) break;\n    selected.unshift(segment);\n    characters += segmentCharacters;\n  }\n  while (selected[0]?.trim().length === 0) selected.shift();\n  while (selected.at(-1)?.trim().length === 0) selected.pop();\n  return selected.join(\"\");\n}\n\nfunction codePointLength(value: string): number {\n  let characters = 0;\n  for (const _character of value) characters += 1;\n  return characters;\n}\n\nfunction startsWithRegionalIndicator(value: string): boolean {\n  const codePoint = value.codePointAt(0);\n  return codePoint !== undefined && codePoint >= 0x1f1e6 && codePoint <= 0x1f1ff;\n}\n\nfunction isHighSurrogate(codeUnit: number): boolean {\n  return codeUnit >= 0xd800 && codeUnit <= 0xdbff;\n}\n\nfunction isLowSurrogate(codeUnit: number): boolean {\n  return codeUnit >= 0xdc00 && codeUnit <= 0xdfff;\n}\n\n/** Move one item, as dnd-kit's arrayMove does. */\nexport function moveQueueItem<T>(items: readonly T[], from: number, to: number): T[] {\n  const next = items.slice();\n  const [item] = next.splice(from, 1);\n  if (item === undefined) return next;\n  next.splice(to < 0 ? next.length + to : to, 0, item);\n  return next;\n}\n\nexport type QueueMovePlan = {\n  /** The turn ids in their new order. */\n  turnIds: string[];\n  /** The server anchor: the turn the moved one now precedes, null for last. */\n  beforeTurnId: string | null;\n  /** The bounded destination index. */\n  index: number;\n};\n\n/** The reorder request for moving a queued turn to an index, or null for a no-op. */\nexport function queueMovePlan(\n  queue: readonly SessionTurn[],\n  turnId: string,\n  nextIndex: number,\n): QueueMovePlan | null {\n  const oldIndex = queue.findIndex((turn) => turn.id === turnId);\n  if (oldIndex < 0) return null;\n  const index = Math.max(0, Math.min(nextIndex, queue.length - 1));\n  if (oldIndex === index) return null;\n  const ordered = moveQueueItem(queue, oldIndex, index);\n  return {\n    turnIds: ordered.map((turn) => turn.id),\n    beforeTurnId: ordered[index + 1]?.id ?? null,\n    index,\n  };\n}\n\nexport type PendingQueueMove = { baseVersion: number | null; turnIds: string[] };\n\n/**\n * The queue as shown while a move is in flight: the optimistic order, unless\n * any authoritative change arrived. A projection never omits or invents a row.\n */\nexport function projectPendingQueueMove(\n  queue: SessionTurn[],\n  pendingMove: PendingQueueMove | null,\n  snapshot: Pick<SessionQueueSnapshot, \"version\"> | null,\n): SessionTurn[] {\n  if (\n    !pendingMove ||\n    pendingMove.baseVersion === null ||\n    snapshot?.version !== pendingMove.baseVersion\n  ) {\n    return queue;\n  }\n  const byId = new Map(queue.map((turn) => [turn.id, turn]));\n  const projected = pendingMove.turnIds.map((turnId) => byId.get(turnId));\n  if (projected.some((turn) => !turn) || projected.length !== queue.length) {\n    return queue;\n  }\n  return projected as SessionTurn[];\n}\n\n/** Copy for the \"replace your draft with this queued prompt\" confirmation. */\nexport const QUEUE_REPLACE_DRAFT_COPY = {\n  title: \"Your composer already has a draft. Replace it with this queued prompt?\",\n  detail:\n    \"The current draft will be permanently discarded; this queued prompt is preserved until you confirm.\",\n  keep: \"Keep current draft\",\n  replace: \"Replace and edit\",\n} as const;\n\nexport type QueuedTurnPresentation = {\n  kind: \"prompt\" | \"realtime_voice\" | \"realtime_voice_handoff\";\n  text: string;\n};\n\nfunction objectValue(value: unknown): Record<string, unknown> | null {\n  return value !== null && typeof value === \"object\" && !Array.isArray(value)\n    ? (value as Record<string, unknown>)\n    : null;\n}\n\n/** What a queued row shows: the prompt, or the transcript of a voice request. */\nexport function queuedTurnPresentation(turn: SessionTurn): QueuedTurnPresentation {\n  const realtimeDelegation = objectValue(turn.metadata.realtimeDelegation);\n  const inputTranscript = realtimeDelegation?.inputTranscript;\n  if (typeof inputTranscript === \"string\" && inputTranscript.trim()) {\n    return { kind: \"realtime_voice\", text: inputTranscript.trim() };\n  }\n  if (objectValue(turn.metadata.realtimeTailFlush)) {\n    return { kind: \"realtime_voice_handoff\", text: \"Remaining voice context\" };\n  }\n  return { kind: \"prompt\", text: turn.prompt };\n}\n\nexport function isSteeringTurn(turn: SessionTurn): boolean {\n  return turn.metadata.delivery === \"steer\";\n}\n\n/** A queued turn that is really waiting: not already a steer in flight. */\nexport function isAuthoritativeQueuedTurn(\n  turn: SessionTurn,\n  mutationFor: (turnId: string) => string | null,\n): boolean {\n  return !isSteeringTurn(turn) && mutationFor(turn.id) !== \"steer\";\n}\n\nexport function countAuthoritativeQueuedTurns(\n  turns: readonly SessionTurn[],\n  mutationFor: (turnId: string) => string | null,\n): number {\n  return turns.filter((turn) => isAuthoritativeQueuedTurn(turn, mutationFor)).length;\n}\n\n/** The move anchors for one row's Move up / Move down. */\nexport function queueNeighborAnchors(\n  turns: readonly SessionTurn[],\n  index: number,\n): { beforeUp: string | null; beforeDown: string | null } {\n  return {\n    beforeUp: index > 0 ? (turns[index - 1]?.id ?? null) : null,\n    beforeDown: index < turns.length - 1 ? (turns[index + 2]?.id ?? null) : null,\n  };\n}\n"],"mappings":";;;AAQO,IAAM,iCAAiC;AAEvC,SAAS,iBAAiB,MAAc,iBAA2C;AACxF,MAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,SAAO,kBAAkB,IAAI,gBAAgB;AAC/C;;;ACHO,IAAM,+BAA+B;AACrC,IAAM,qCAAqC;AAClD,IAAM,4CAA4C;AAClD,IAAM,4CAA4C;AAClD,IAAM,wCAAwC;AAC9C,IAAM,0BAA0B;AAGhC,IAAI;AACJ,SAAS,qBAAqB,QAA0B;AACtD,MAAI,+BAA+B,QAAW;AAC5C,iCACE,OAAO,SAAS,eAAe,OAAO,KAAK,cAAc,aACrD,IAAI,KAAK,UAAU,QAAW,EAAE,aAAa,WAAW,CAAC,IACzD;AAAA,EACR;AACA,MAAI,CAAC,2BAA4B,QAAO,MAAM,KAAK,MAAM;AACzD,SAAO,MAAM,KAAK,2BAA2B,QAAQ,MAAM,GAAG,CAAC,SAAS,KAAK,OAAO;AACtF;AACA,IAAM,mCACJ;AAiBF,SAAS,kBAAkB,SAAqC;AAC9D,SAAO;AAAA,IACL;AAAA,IACA,iBAAiB;AAAA,IACjB,cAAc;AAAA,IACd,iBAAiB;AAAA,IACjB,sBAAsB;AAAA,IACtB,YAAY;AAAA,EACd;AACF;AAEO,SAAS,iBACd,MACA,eACoB;AACpB,MAAI,CAAC,KAAM,QAAO,mBAAmB,IAAI,aAAa;AACtD,SAAO,oBAAoB,KAAK,QAAQ,KAAK,aAAa,UAAU,GAAG,aAAa;AACtF;AAEO,SAAS,oBACd,QACA,iBACA,eACoB;AACpB,UAAQ,iBAAiB,QAAQ,eAAe,GAAG;AAAA,IACjD,KAAK;AACH,aAAO,mBAAmB,QAAQ,aAAa;AAAA,IACjD,KAAK;AACH,aAAO;AAAA,QACL,GAAG,eAAe,aAAa,oBAAoB,IAAI,eAAe,aAAa;AAAA,MACrF;AAAA,IACF,KAAK;AACH,aAAO,kBAAkB,8BAA8B;AAAA,EAC3D;AACF;AAUO,SAAS,mBAAmB,QAAgB,eAA2C;AAC5F,QAAM,mBAAmB,kBAAkB,QAAQ,gBAAgB,CAAC;AACpE,MAAI,CAAC,iBAAiB,aAAa,iBAAiB,cAAc,eAAe;AAC/E,UAAMA,WAAU,sBAAsB,iBAAiB,KAAK;AAC5D,WAAO,wBAAwBA,QAAO,IAClC;AAAA,MACE,SAAAA;AAAA,MACA,iBAAiBA;AAAA,MACjB,cAAcA;AAAA,MACd,iBAAiB;AAAA,MACjB,sBAAsB;AAAA,MACtB,YAAY;AAAA,IACd,IACA,sBAAsB,OAAO,QAAQ,iBAAiB,OAAO,iBAAiB,KAAK;AAAA,EACzF;AAEA,QAAM,mBAAmB,KAAK,IAAI,KAAK,MAAM,gBAAgB,CAAC,GAAG,GAAG;AACpE,QAAM,mBACJ,gBAAgB,gBAAgB,uBAAuB,IAAI;AAC7D,QAAM,eAAe;AAAA,IACnB;AAAA,IACA,mBAAmB;AAAA,EACrB;AACA,QAAM,eAAe;AAAA,IACnB;AAAA,IACA,mBAAmB;AAAA,EACrB;AACA,QAAM,iBAAiB,oBAAoB,aAAa,KAAK;AAC7D,QAAM,iBAAiB,oBAAoB,aAAa,KAAK;AAK7D,MAAI,aAAa,UAAW,gBAAe,IAAI;AAC/C,MAAI,aAAa,WAAW;AAC1B,QAAI,mBAAmB,eAAe,MAAM;AAI5C,WAAO,kBAAkB,SAAS,QAAQ,KAAK,eAAe,SAAS,GAAG;AACxE,yBAAmB,eAAe,MAAM;AAAA,IAC1C;AAIA,WAAO,eAAe,CAAC,KAAK,4BAA4B,eAAe,CAAC,CAAC,GAAG;AAC1E,qBAAe,MAAM;AAAA,IACvB;AAAA,EACF;AAEA,QAAM,SAAS,4BAA4B,gBAAgB,gBAAgB;AAC3E,QAAM,SAAS,0BAA0B,gBAAgB,gBAAgB;AACzE,QAAM,YAAY;AAAA,IAChB,OAAO;AAAA,IACP,aAAa;AAAA,IACb,aAAa;AAAA,EACf;AAEA,MAAI,CAAC,wBAAwB,MAAM,KAAK,CAAC,wBAAwB,MAAM,GAAG;AACxE,WAAO,sBAAsB,OAAO,QAAQ,aAAa,OAAO,aAAa,KAAK;AAAA,EACpF;AAEA,QAAM,aAAa,wBAAwB,MAAM,IAC7C,SACA,2BAA2B,SAAS;AACxC,QAAM,UAAU,GAAG,MAAM,GAAG,uBAAuB,GAAG,UAAU;AAChE,MAAI,CAAC,wBAAwB,MAAM,GAAG;AACpC,WAAO;AAAA,MACL;AAAA,MACA,iBAAiB;AAAA,MACjB,cAAc;AAAA,MACd,iBAAiB;AAAA,MACjB,sBAAsB;AAAA,MACtB,YAAY;AAAA,IACd;AAAA,EACF;AAEA,QAAM,cAAc;AAAA,IAClB;AAAA,IACA;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,iBAAiB;AAAA,IACjB,cAAc;AAAA,IACd,iBAAiB,wBAAwB,WAAW,IAAI,cAAc,OAAO,SAAS;AAAA,IACtF,sBAAsB,wBAAwB,WAAW,IAAI,QAAQ;AAAA,IACrE,YAAY;AAAA,EACd;AACF;AAEA,SAAS,sBACP,cACA,aACA,WACoB;AACpB,QAAM,YAAY,6BAA6B,cAAc,aAAa,SAAS;AACnF,QAAM,UAAU,2BAA2B,SAAS;AACpD,SAAO;AAAA,IACL;AAAA,IACA,iBAAiB,gBAAa,SAAS;AAAA;AAAA;AAAA;AAAA,IAIvC,cAAc,gBAAa,SAAS;AAAA,IACpC,iBAAiB;AAAA,IACjB,sBAAsB;AAAA,IACtB,YAAY;AAAA,EACd;AACF;AAEA,SAAS,2BAA2B,WAA2B;AAC7D,SAAO,6CAA0C,SAAS;AAC5D;AAEA,SAAS,6BACP,cACA,aACA,WACQ;AACR,QAAM,OAAO,kBAAkB,aAAa,yCAAyC,EAAE;AACvF,QAAM,OAAO,gBAAgB,WAAW,yCAAyC,EAAE;AACnF,MAAI,OAAO;AACX,aAAW,SAAS,CAAC,OAAO,YAAY,GAAG,MAAM,IAAI,GAAG;AACtD,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,cAAQ,MAAM,WAAW,KAAK;AAC9B,aAAO,KAAK,KAAK,MAAM,QAAU;AAAA,IACnC;AACA,YAAQ;AACR,WAAO,KAAK,KAAK,MAAM,QAAU;AAAA,EACnC;AACA,UAAQ,SAAS,GAAG,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,EAAE,YAAY;AAChE;AAEA,SAAS,wBAAwB,OAAwB;AAIvD,aAAW,aAAa,OAAO;AAC7B,QAAI,CAAC,iCAAiC,KAAK,SAAS,EAAG,QAAO;AAAA,EAChE;AACA,SAAO;AACT;AAEA,SAAS,kBAAkB,QAAgB,eAA4C;AACrF,MAAI,MAAM;AACV,MAAI,aAAa;AACjB,SAAO,MAAM,OAAO,UAAU,aAAa,eAAe;AACxD,UAAM,QAAQ,OAAO,WAAW,GAAG;AACnC,WACE,gBAAgB,KAAK,KACrB,MAAM,IAAI,OAAO,UACjB,eAAe,OAAO,WAAW,MAAM,CAAC,CAAC,IACrC,IACA;AACN,kBAAc;AAAA,EAChB;AACA,SAAO,EAAE,OAAO,OAAO,MAAM,GAAG,GAAG,GAAG,YAAY,WAAW,MAAM,OAAO,OAAO;AACnF;AAEA,SAAS,gBAAgB,QAAgB,eAA4C;AACnF,MAAI,QAAQ,OAAO;AACnB,MAAI,aAAa;AACjB,SAAO,QAAQ,KAAK,aAAa,eAAe;AAC9C,aAAS;AACT,QACE,eAAe,OAAO,WAAW,KAAK,CAAC,KACvC,QAAQ,KACR,gBAAgB,OAAO,WAAW,QAAQ,CAAC,CAAC,GAC5C;AACA,eAAS;AAAA,IACX;AACA,kBAAc;AAAA,EAChB;AACA,SAAO,EAAE,OAAO,OAAO,MAAM,KAAK,GAAG,YAAY,WAAW,QAAQ,EAAE;AACxE;AAEA,SAAS,oBAAoB,QAA0B;AACrD,SAAO,qBAAqB,sBAAsB,MAAM,CAAC;AAC3D;AAEA,SAAS,sBAAsB,OAAuB;AACpD,MAAI,YAAY;AAChB,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,UAAM,UAAU,MAAM,WAAW,KAAK;AACtC,QACE,gBAAgB,OAAO,KACvB,QAAQ,IAAI,MAAM,UAClB,eAAe,MAAM,WAAW,QAAQ,CAAC,CAAC,GAC1C;AACA,mBAAa,MAAM,MAAM,OAAO,QAAQ,CAAC;AACzC,eAAS;AAAA,IACX,WAAW,gBAAgB,OAAO,KAAK,eAAe,OAAO,GAAG;AAC9D,mBAAa;AAAA,IACf,OAAO;AACL,mBAAa,MAAM,KAAK;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,4BAA4B,UAAoB,eAA+B;AACtF,QAAM,WAAqB,CAAC;AAC5B,MAAI,aAAa;AACjB,aAAW,WAAW,UAAU;AAC9B,UAAM,oBAAoB,gBAAgB,OAAO;AACjD,QAAI,aAAa,oBAAoB,cAAe;AACpD,aAAS,KAAK,OAAO;AACrB,kBAAc;AAAA,EAChB;AACA,SAAO,SAAS,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAG,UAAS,IAAI;AAC1D,SAAO,SAAS,KAAK,EAAE;AACzB;AAEA,SAAS,0BAA0B,UAAoB,eAA+B;AACpF,QAAM,WAAqB,CAAC;AAC5B,MAAI,aAAa;AACjB,WAAS,QAAQ,SAAS,SAAS,GAAG,SAAS,GAAG,SAAS,GAAG;AAC5D,UAAM,UAAU,SAAS,KAAK;AAC9B,QAAI,CAAC,QAAS;AACd,UAAM,oBAAoB,gBAAgB,OAAO;AACjD,QAAI,aAAa,oBAAoB,cAAe;AACpD,aAAS,QAAQ,OAAO;AACxB,kBAAc;AAAA,EAChB;AACA,SAAO,SAAS,CAAC,GAAG,KAAK,EAAE,WAAW,EAAG,UAAS,MAAM;AACxD,SAAO,SAAS,GAAG,EAAE,GAAG,KAAK,EAAE,WAAW,EAAG,UAAS,IAAI;AAC1D,SAAO,SAAS,KAAK,EAAE;AACzB;AAEA,SAAS,gBAAgB,OAAuB;AAC9C,MAAI,aAAa;AACjB,aAAW,cAAc,MAAO,eAAc;AAC9C,SAAO;AACT;AAEA,SAAS,4BAA4B,OAAwB;AAC3D,QAAM,YAAY,MAAM,YAAY,CAAC;AACrC,SAAO,cAAc,UAAa,aAAa,UAAW,aAAa;AACzE;AAEA,SAAS,gBAAgB,UAA2B;AAClD,SAAO,YAAY,SAAU,YAAY;AAC3C;AAEA,SAAS,eAAe,UAA2B;AACjD,SAAO,YAAY,SAAU,YAAY;AAC3C;AAGO,SAAS,cAAiB,OAAqB,MAAc,IAAiB;AACnF,QAAM,OAAO,MAAM,MAAM;AACzB,QAAM,CAAC,IAAI,IAAI,KAAK,OAAO,MAAM,CAAC;AAClC,MAAI,SAAS,OAAW,QAAO;AAC/B,OAAK,OAAO,KAAK,IAAI,KAAK,SAAS,KAAK,IAAI,GAAG,IAAI;AACnD,SAAO;AACT;AAYO,SAAS,cACd,OACA,QACA,WACsB;AACtB,QAAM,WAAW,MAAM,UAAU,CAAC,SAAS,KAAK,OAAO,MAAM;AAC7D,MAAI,WAAW,EAAG,QAAO;AACzB,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,WAAW,MAAM,SAAS,CAAC,CAAC;AAC/D,MAAI,aAAa,MAAO,QAAO;AAC/B,QAAM,UAAU,cAAc,OAAO,UAAU,KAAK;AACpD,SAAO;AAAA,IACL,SAAS,QAAQ,IAAI,CAAC,SAAS,KAAK,EAAE;AAAA,IACtC,cAAc,QAAQ,QAAQ,CAAC,GAAG,MAAM;AAAA,IACxC;AAAA,EACF;AACF;AAQO,SAAS,wBACd,OACA,aACA,UACe;AACf,MACE,CAAC,eACD,YAAY,gBAAgB,QAC5B,UAAU,YAAY,YAAY,aAClC;AACA,WAAO;AAAA,EACT;AACA,QAAM,OAAO,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AACzD,QAAM,YAAY,YAAY,QAAQ,IAAI,CAAC,WAAW,KAAK,IAAI,MAAM,CAAC;AACtE,MAAI,UAAU,KAAK,CAAC,SAAS,CAAC,IAAI,KAAK,UAAU,WAAW,MAAM,QAAQ;AACxE,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGO,IAAM,2BAA2B;AAAA,EACtC,OAAO;AAAA,EACP,QACE;AAAA,EACF,MAAM;AAAA,EACN,SAAS;AACX;AAOA,SAAS,YAAY,OAAgD;AACnE,SAAO,UAAU,QAAQ,OAAO,UAAU,YAAY,CAAC,MAAM,QAAQ,KAAK,IACrE,QACD;AACN;AAGO,SAAS,uBAAuB,MAA2C;AAChF,QAAM,qBAAqB,YAAY,KAAK,SAAS,kBAAkB;AACvE,QAAM,kBAAkB,oBAAoB;AAC5C,MAAI,OAAO,oBAAoB,YAAY,gBAAgB,KAAK,GAAG;AACjE,WAAO,EAAE,MAAM,kBAAkB,MAAM,gBAAgB,KAAK,EAAE;AAAA,EAChE;AACA,MAAI,YAAY,KAAK,SAAS,iBAAiB,GAAG;AAChD,WAAO,EAAE,MAAM,0BAA0B,MAAM,0BAA0B;AAAA,EAC3E;AACA,SAAO,EAAE,MAAM,UAAU,MAAM,KAAK,OAAO;AAC7C;AAEO,SAAS,eAAe,MAA4B;AACzD,SAAO,KAAK,SAAS,aAAa;AACpC;AAGO,SAAS,0BACd,MACA,aACS;AACT,SAAO,CAAC,eAAe,IAAI,KAAK,YAAY,KAAK,EAAE,MAAM;AAC3D;AAEO,SAAS,8BACd,OACA,aACQ;AACR,SAAO,MAAM,OAAO,CAAC,SAAS,0BAA0B,MAAM,WAAW,CAAC,EAAE;AAC9E;AAGO,SAAS,qBACd,OACA,OACwD;AACxD,SAAO;AAAA,IACL,UAAU,QAAQ,IAAK,MAAM,QAAQ,CAAC,GAAG,MAAM,OAAQ;AAAA,IACvD,YAAY,QAAQ,MAAM,SAAS,IAAK,MAAM,QAAQ,CAAC,GAAG,MAAM,OAAQ;AAAA,EAC1E;AACF;","names":["summary"]}