@remnic/core 10.0.12 → 10.0.14

package/src/storage/content-hash-index.ts

@@ -72,6 +72,16 @@ export interface ContentHashIndexLockOptions {
   readonly retryBaseMs?: number;
   /** Max deferred-save retries before falling back to the corpus-rebuild safety net (default 5). */
   readonly retryMaxAttempts?: number;
+  /**
+   * Tombstone-blocked capture write-lock backoff (COS-392). These do not
+   * change the fact-hash index lock. Omitted fields use the 50ms / 2s / 60s
+   * defaults. Converge copies its config here before replicating a file.
+   */
+  readonly captureWriteLockInitialDelayMs?: number;
+  readonly captureWriteLockMaxDelayMs?: number;
+  readonly captureWriteLockDeadlineMs?: number;
+  /** Apply abort signal. Checked before each probe, during backoff, and before the write. */
+  readonly captureWriteLockSignal?: AbortSignal;
 }
 
 /**

package/src/storage/tombstone-blocked-capture-index.ts

@@ -4,6 +4,7 @@ import { mkdir, readFile, readdir, rename, stat, unlink, writeFile } from "node:
 import path from "node:path";
 import { promisify } from "node:util";
 import { log } from "../logger.js";
+import type { CaptureWriteLockLimitSource } from "../capture-write-lock-backoff.js";
 import type { MemoryFile, MemoryFrontmatter } from "../types.js";
 import { RECALL_FALLBACK_DIRS } from "../utils/category-dir.js";
 import { isErrnoCode } from "../utils/errno.js";
@@ -54,6 +55,8 @@ export type TombstoneBlockedCaptureIndexOptions = {
   readonly secureStoreKeyProvider: () => Buffer | null;
   readonly secureStoreWriteKeyProvider: () => Buffer | null;
   readonly lockOptions: () => ContentHashIndexLockOptions;
+  /** Capture-write-lock limit source; undefined until converge installs limits. */
+  readonly captureLockLimitSource?: () => CaptureWriteLockLimitSource | undefined;
   readonly readAllMemories: () => Promise<MemoryFile[]>;
   readonly readAllColdMemories: () => Promise<MemoryFile[]>;
   readonly parseMemory?: OfflineSyncMemoryParser;
@@ -77,7 +80,11 @@ export class TombstoneBlockedCaptureIndex {
 
   constructor(options: TombstoneBlockedCaptureIndexOptions) {
     this.options = options;
-    this.captureWriteLock = new TombstoneBlockedCaptureWriteLock(options);
+    this.captureWriteLock = new TombstoneBlockedCaptureWriteLock({
+      stateDir: options.stateDir,
+      withHeldFileLock: options.withHeldFileLock,
+      lockOptions: options.captureLockLimitSource,
+    });
   }
 
   private createIndex(): ContentHashIndex {

package/src/storage/tombstone-blocked-capture-mutation.ts

@@ -2,17 +2,30 @@ import { AsyncLocalStorage } from "node:async_hooks";
 import { createHash } from "node:crypto";
 import { mkdir } from "node:fs/promises";
 import path from "node:path";
-import { withHeldFileLock } from "../utils/serialize-mutations.js";
+import { raceAbort, throwIfAborted } from "../abort-error.js";
+import {
+  CAPTURE_WRITE_LOCK_BUSY_MESSAGE,
+  type CaptureWriteLockLimitSource,
+  captureWriteLockDelayMs,
+  resolveCaptureWriteLockBackoffLimits,
+} from "../capture-write-lock-backoff.js";
+import { log } from "../logger.js";
 import type { MemoryFile, MemoryFrontmatter } from "../types.js";
+import { withHeldFileLock } from "../utils/serialize-mutations.js";
+import { sleepAbortable } from "../utils/sleep.js";
 import type { CasRevisionTransaction } from "./cas-revision-store.js";
-const TOMBSTONE_CAPTURE_WRITE_LOCK_STALE_MS = 60_000;
-const CAPTURE_WRITE_LOCK_MAX_ATTEMPTS = 3;
-const CAPTURE_WRITE_LOCK_RETRY_BASE_MS = 25;
-const CAPTURE_WRITE_LOCK_BUSY_MESSAGE = "tombstone-blocked capture write lock remained busy";
 
-export function isTombstoneBlockedCaptureWriteLockBusy(error: unknown): boolean {
-  return error instanceof Error && error.message === CAPTURE_WRITE_LOCK_BUSY_MESSAGE;
-}
+export { isTombstoneBlockedCaptureWriteLockBusy } from "../capture-write-lock-backoff.js";
+
+const TOMBSTONE_CAPTURE_WRITE_LOCK_STALE_MS = 60_000;
+/**
+ * One exclusive-create probe. The bounded wait lives in the outer backoff,
+ * which runs only after every lock from this attempt has been released.
+ * A multi-second poll here would hold an already-acquired sibling lock.
+ */
+const CAPTURE_WRITE_LOCK_PROBE_MS = 1;
+const CAPTURE_WRITE_LOCK_RETRY = Symbol("capture-write-lock-retry");
+const CAPTURE_WRITE_LOCK_PERMANENT = Symbol("capture-write-lock-permanent-failure");
 
 export function normalizeExplicitCaptureContent(value: string): string {
   return value.toLowerCase().replace(/\s+/g, " ").trim();
@@ -46,6 +59,15 @@ export function captureIdentityHash(memory: MemoryFile): string {
 export type TombstoneBlockedCaptureWriteLockOptions = {
   readonly stateDir: string;
   readonly withHeldFileLock?: typeof withHeldFileLock;
+  /** Read when an acquire starts, after the caller has installed converge config. */
+  readonly lockOptions?: () => CaptureWriteLockLimitSource | undefined;
+  readonly now?: () => number;
+  readonly random?: () => number;
+  readonly sleep?: (ms: number, signal?: AbortSignal) => Promise<void>;
+  readonly logDebug?: (message: string) => void;
+  readonly logWarn?: (message: string) => void;
+  /** Direct seam. Converge passes the same signal through `lockOptions` instead. */
+  readonly signal?: AbortSignal;
 };
 
 export class TombstoneBlockedCaptureWriteLock {
@@ -59,45 +81,107 @@ export class TombstoneBlockedCaptureWriteLock {
     return path.join(this.options.stateDir, "tombstone-blocked-capture", filename);
   }
 
-  private async withSingleCaptureWriteLock<T>(lockPath: string, task: () => Promise<T>): Promise<T> {
+  private now(): number {
+    return this.options.now?.() ?? Date.now();
+  }
+
+  private debug(message: string): void {
+    if (this.options.logDebug) {
+      this.options.logDebug(message);
+      return;
+    }
+    log.debug(message);
+  }
+
+  private warn(message: string): void {
+    if (this.options.logWarn) {
+      this.options.logWarn(message);
+      return;
+    }
+    log.warn(message);
+  }
+
+  /** Prefer the constructor seam; converge installs the signal on lock options at acquire time. */
+  private captureAbortSignal(): AbortSignal | undefined {
+    return this.options.signal ?? this.options.lockOptions?.()?.captureWriteLockSignal;
+  }
+
+  /**
+   * One probe of a single lock file. Returns the retry symbol when the lock
+   * is busy and the permanent symbol on a filesystem error. Does not sleep:
+   * the caller backs off only after the whole chain has unwound.
+   */
+  private async withSingleCaptureWriteLockOnce<T>(
+    lockPath: string,
+    task: () => Promise<T | typeof CAPTURE_WRITE_LOCK_RETRY>
+  ): Promise<T | typeof CAPTURE_WRITE_LOCK_RETRY | typeof CAPTURE_WRITE_LOCK_PERMANENT> {
     await mkdir(path.dirname(lockPath), { recursive: true });
-    const retry = Symbol("retry");
-    const permanentFailure = Symbol("permanent-failure");
     const runWithHeldFileLock = this.options.withHeldFileLock ?? withHeldFileLock;
-    for (let attempt = 0; attempt < CAPTURE_WRITE_LOCK_MAX_ATTEMPTS; attempt += 1) {
-      const result = await runWithHeldFileLock<T | typeof retry | typeof permanentFailure>(
-        lockPath,
-        {
-          staleMs: TOMBSTONE_CAPTURE_WRITE_LOCK_STALE_MS,
-          maxWaitMs: 1_000,
-          pollMs: 25,
-        },
-        async (acquired, controller) => {
-          if (acquired) return await task();
-          return controller.failure === "error" ? permanentFailure : retry;
-        }
-      );
-      if (result === permanentFailure) {
-        throw new Error("tombstone-blocked capture write lock acquisition failed");
+    return await runWithHeldFileLock(
+      lockPath,
+      {
+        staleMs: TOMBSTONE_CAPTURE_WRITE_LOCK_STALE_MS,
+        maxWaitMs: CAPTURE_WRITE_LOCK_PROBE_MS,
+        pollMs: CAPTURE_WRITE_LOCK_PROBE_MS,
+      },
+      async (acquired, controller) => {
+        if (acquired) return await task();
+        return controller.failure === "error" ? CAPTURE_WRITE_LOCK_PERMANENT : CAPTURE_WRITE_LOCK_RETRY;
       }
-      if (result !== retry) return result;
-      if (attempt === CAPTURE_WRITE_LOCK_MAX_ATTEMPTS - 1) break;
-      const delayState = Promise.withResolvers<void>();
-      setTimeout(delayState.resolve, CAPTURE_WRITE_LOCK_RETRY_BASE_MS * 2 ** attempt);
-      await delayState.promise;
-    }
-    throw new Error(CAPTURE_WRITE_LOCK_BUSY_MESSAGE);
+    );
   }
+
   private async withPhysicalCaptureWriteLocks<T>(
     task: () => Promise<T>,
     identityHashes: readonly string[]
   ): Promise<T> {
+    const signal = this.captureAbortSignal();
     const lockPaths = [...new Set(identityHashes.map((hash) => this.captureWriteLockPathForHash(hash)))];
-    const acquire = async (index: number): Promise<T> => {
-      if (index === lockPaths.length) return await task();
-      return await this.withSingleCaptureWriteLock(lockPaths[index], () => acquire(index + 1));
+    const limits = resolveCaptureWriteLockBackoffLimits(this.options.lockOptions?.());
+    const deadline = this.now() + limits.deadlineMs;
+    const giveUp = (): never => {
+      throwIfAborted(signal);
+      this.warn(
+        `tombstone-blocked capture write lock remained busy after ${limits.deadlineMs}ms; failing this write so the rest of the cycle can continue`
+      );
+      throw new Error(CAPTURE_WRITE_LOCK_BUSY_MESSAGE);
     };
-    return await acquire(0);
+    const acquire = async (
+      index: number
+    ): Promise<T | typeof CAPTURE_WRITE_LOCK_RETRY | typeof CAPTURE_WRITE_LOCK_PERMANENT> => {
+      throwIfAborted(signal);
+      // The deadline gates each probe: a chain that started before the
+      // deadline must not keep probing locks (or run the write) after it.
+      const runTask = async (): Promise<T> => {
+        if (this.now() >= deadline) giveUp();
+        return await task();
+      };
+      if (index === lockPaths.length) return await runTask();
+      const lockPath = lockPaths[index];
+      if (lockPath === undefined) return await runTask();
+      if (this.now() >= deadline) giveUp();
+      return await this.withSingleCaptureWriteLockOnce(lockPath, () => acquire(index + 1));
+    };
+    for (let attempt = 0; ; attempt += 1) {
+      throwIfAborted(signal);
+      const outcome = await acquire(0);
+      if (outcome === CAPTURE_WRITE_LOCK_PERMANENT) {
+        throw new Error("tombstone-blocked capture write lock acquisition failed");
+      }
+      if (outcome !== CAPTURE_WRITE_LOCK_RETRY) return outcome;
+      throwIfAborted(signal);
+      const now = this.now();
+      if (now >= deadline) giveUp();
+      const delay = Math.min(
+        captureWriteLockDelayMs(attempt, limits, this.options.random ?? Math.random),
+        deadline - now
+      );
+      if (delay <= 0) giveUp();
+      this.debug(`tombstone-blocked capture write lock busy; backing off ${delay}ms before retry ${attempt + 1}`);
+      // raceAbort covers seam sleeps that ignore the signal; the default
+      // sleepAbortable also clears its timer so abort holds no Timeout.
+      await raceAbort((this.options.sleep ?? sleepAbortable)(delay, signal), signal);
+    }
   }
 
   async withCaptureWriteLock<T>(task: () => Promise<T>, identity?: string | readonly string[]): Promise<T> {
@@ -125,6 +209,7 @@ export class TombstoneBlockedCaptureWriteLock {
     identities: readonly string[],
     identityHashes: readonly string[]
   ): Promise<T> {
+    throwIfAborted(this.captureAbortSignal());
     const current = this.context.getStore();
     const hashToken = (key: string): string =>
       `\u0000${key.length === 0 ? "" : createHash("sha256").update(key).digest("hex")}`;
@@ -179,7 +264,10 @@ export class TombstoneBlockedCaptureWriteLock {
       next.add(hashToken(key));
     }
     for (const hash of hashes) next.add(`\u0000${hash}`);
-    const run = () => this.context.run(next, task);
+    const run = () => {
+      throwIfAborted(this.captureAbortSignal());
+      return this.context.run(next, task);
+    };
     if (physicalMissing.length === 0) return await run();
     return await this.withPhysicalCaptureWriteLocks(run, physicalMissing);
   }
@@ -197,7 +285,10 @@ export type TombstoneBlockedMutationHost = {
   writeStorageSecureFile: (pathname: string, fileContent: string) => Promise<void>;
   withCaptureWriteLock: (task: () => Promise<void>, identity: string | readonly string[]) => Promise<void>;
   logWarning: (message: string) => void;
-  beginDurableMemoryRevision?: (pathname: string, expectedContent?: string | Buffer | null) => Promise<CasRevisionTransaction | undefined>;
+  beginDurableMemoryRevision?: (
+    pathname: string,
+    expectedContent?: string | Buffer | null
+  ) => Promise<CasRevisionTransaction | undefined>;
 };
 
 export type TombstoneBlockedMutation = {
@@ -263,7 +354,7 @@ export async function runTombstoneBlockedMutation(
             await transaction.abort();
           } catch (abortError) {
             host.logWarning(
-              `storage.tombstoneBlocked failed to abort the reserved receipt (pending marker preserved): ${abortError}`,
+              `storage.tombstoneBlocked failed to abort the reserved receipt (pending marker preserved): ${abortError}`
             );
           }
         }
@@ -280,7 +371,7 @@ export async function runTombstoneBlockedMutation(
           await transaction.writeLanded();
         } catch (evidenceError) {
           host.logWarning(
-            `storage.tombstoneBlocked failed to record receipt crash evidence (pending marker preserved): ${evidenceError}`,
+            `storage.tombstoneBlocked failed to record receipt crash evidence (pending marker preserved): ${evidenceError}`
           );
         }
         try {
@@ -292,7 +383,7 @@ export async function runTombstoneBlockedMutation(
           // and promotion/rollback refuse until recovery reconciles. The
           // reservation must NOT be aborted: the write is on disk.
           host.logWarning(
-            `storage.tombstoneBlocked receipt publication failed after the memory write (pending marker preserved for recovery): ${err}`,
+            `storage.tombstoneBlocked receipt publication failed after the memory write (pending marker preserved for recovery): ${err}`
           );
           await discardRebuildMarker();
           throw err;
@@ -318,7 +409,6 @@ export async function runTombstoneBlockedMutation(
   }
 }
 
-
 export function tombstoneBlocked(frontmatter: MemoryFrontmatter): boolean {
   return frontmatter.status === "pending_review" && Boolean(frontmatter.blockedBy);
 }

package/src/storage.ts

@@ -3219,6 +3219,7 @@ export class StorageManager extends TombstoneBlockedCaptureIndexHost {
       secureStoreKeyProvider: () => this._secureStoreKey,
       secureStoreWriteKeyProvider: () => this.resolveWriteKey(),
       lockOptions: () => this.factHashIndexLockOptions,
+      captureLockLimitSource: () => this.captureLockLimitSource(),
       parseMemory: (filePath, content) =>
         parseTombstoneBlockedOfflineSyncMemory(
           filePath,
@@ -3232,6 +3233,18 @@ export class StorageManager extends TombstoneBlockedCaptureIndexHost {
       readAllColdMemories: () => this.readAllColdMemories(),
     };
   }
+
+  /**
+   * Lock-limit source for tombstone-blocked captures. Undefined until the
+   * converge path installs capture-lock limits, so an ordinary capture
+   * resolves to the legacy short bounds instead of the converge deadline.
+   */
+  private captureLockLimitSource(): ContentHashIndexLockOptions | undefined {
+    const options = this.factHashIndexLockOptions;
+    const keys = ["captureWriteLockInitialDelayMs", "captureWriteLockMaxDelayMs", "captureWriteLockDeadlineMs", "captureWriteLockSignal"] as const;
+    return keys.some((key) => options[key] !== undefined) ? options : undefined;
+  }
+
   private async getFactHashIndex(): Promise<ContentHashIndex> {
     if (this.factHashIndex) {
       return this.factHashIndex;

package/src/types.ts

@@ -41,6 +41,15 @@ export interface ConvergeConfig {
   conflictPolicy: ConvergeConflictPolicy;
   /** Per-request peer HTTP timeout in ms (plan/apply/watch). Default 30000; clamped to <= 3600000. */
   peerRequestTimeoutMs?: number;
+  /**
+   * Tombstone-blocked capture write-lock backoff for converge apply/watch.
+   * Defaults: 50ms initial (jittered to 25–50), 2000ms cap per wait, 60000ms
+   * deadline. Positive integers, clamped to <= 3600000. An inverted schedule
+   * (initial > max, or max > deadline) is rejected.
+   */
+  captureWriteLockInitialDelayMs?: number;
+  captureWriteLockMaxDelayMs?: number;
+  captureWriteLockDeadlineMs?: number;
 }
 export type SignalLevel = "none" | "low" | "medium" | "high";
 export type MemoryCategory =

package/src/utils/sleep.ts

@@ -3,3 +3,31 @@ export function sleep(ms: number): Promise<void> {
   // Constructor form keeps this reachable utility compatible with ES2022 adapter type graphs.
   return new Promise((resolve) => setTimeout(resolve, ms));
 }
+
+import { abortError } from "../abort-error.js";
+
+/**
+ * Wait until `ms` elapses, or reject with `AbortError` when `signal` fires.
+ * The timer is cleared on abort so a cancelled wait holds no Timeout handle.
+ * Executor form: this module targets ES2022 type graphs (no withResolvers).
+ */
+export function sleepAbortable(ms: number, signal?: AbortSignal): Promise<void> {
+  return new Promise((resolve, reject) => {
+    if (signal?.aborted) {
+      reject(abortError("operation aborted"));
+      return;
+    }
+    const timer = setTimeout(() => {
+      if (signal && onAbort) signal.removeEventListener("abort", onAbort);
+      resolve();
+    }, ms);
+    let onAbort: (() => void) | null = null;
+    if (signal) {
+      onAbort = () => {
+        clearTimeout(timer);
+        reject(abortError("operation aborted"));
+      };
+      signal.addEventListener("abort", onAbort, { once: true });
+    }
+  });
+}

package/dist/chunk-375ARKRS.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extraction-source-grounding-rules.ts"],"sourcesContent":["import type { ExtractionResult } from \"./types.js\";\nimport { anchorTemporalExpressions } from \"./delinearize.js\";\nimport {\n  GROUNDING_AUXILIARY_TOKENS,\n  GROUNDING_COPULAR_FORMS,\n  GROUNDING_ENTITY_TYPE_PREFIXES,\n  GROUNDING_MIN_COVERAGE,\n  GROUNDING_MIN_SHARED_TOKENS,\n  GROUNDING_STOPWORDS,\n  areGroundingTokensCompatible,\n  containsContiguousGroundingTokens,\n  containsExactTokenSequence,\n  groundingLexemes,\n  groundingTokenSequence,\n  hasContradictoryPolarity,\n  hasExplicitRoleSubjectToken,\n  isInterrogativeSourceSentence,\n  normalizeForExactMatch,\n  normalizedGroundingAlignmentTokenSequence,\n  normalizedGroundingTokenSequence,\n  sourceSentences,\n  spacelessScriptGroundedTokenScore,\n  splitGroundingClauses,\n  stemToken,\n  tokenize,\n  tokenSequence,\n} from \"./extraction-source-grounding-helpers.js\";\n\nexport interface ExtractionSourceGroundingOptions {\n  sourceGrounding: boolean;\n  anchorTemporalExpressions: boolean;\n  spanMode?: \"off\" | \"shadow\" | \"on\";\n}\n\nexport function applyExtractionSourceGrounding(\n  result: ExtractionResult,\n  sourceText: string,\n  assertionSourceText: string = sourceText,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n  messageTimestamp: Date | undefined,\n  options: ExtractionSourceGroundingOptions,\n): ExtractionResult {\n  if (!options.sourceGrounding) return result;\n  const anchorSource = (source: string): string =>\n    options.anchorTemporalExpressions\n      ? anchorTemporalExpressions(source, messageTimestamp ?? new Date())\n      : source;\n  const anchoredRoleSources = roleAssertionSources === undefined\n    ? undefined\n    : {\n      profile: roleAssertionSources.profile === undefined\n        ? undefined\n        : anchorSource(roleAssertionSources.profile),\n      identity: roleAssertionSources.identity === undefined\n        ? undefined\n        : anchorSource(roleAssertionSources.identity),\n    };\n  return filterExtractionResultBySource(\n    result,\n    anchorSource(sourceText),\n    anchorSource(assertionSourceText),\n    anchoredRoleSources,\n    options.anchorTemporalExpressions ? anchorSource : undefined,\n    options.spanMode ?? \"off\",\n  );\n}\n\nexport interface ExtractionGroundingRoleSources {\n  profile?: string;\n  identity?: string;\n}\n\n\n\ninterface GroundingCopularClaim {\n  subject: string;\n  predicate: string;\n}\n\nfunction groundingCopularClaim(text: string): GroundingCopularClaim | undefined {\n  const lexemes = groundingLexemes(text);\n  const copulaIndex = lexemes.findIndex(({ token }) => GROUNDING_COPULAR_FORMS.has(token));\n  if (copulaIndex <= 0) return undefined;\n\n  let subjectIndex = copulaIndex - 1;\n  while (\n    subjectIndex >= 0\n    && GROUNDING_AUXILIARY_TOKENS.has(lexemes[subjectIndex]!.token)\n  ) {\n    subjectIndex -= 1;\n  }\n  const subjectLexeme = lexemes[subjectIndex];\n  const predicateLexeme = lexemes\n    .slice(copulaIndex + 1)\n    .find(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n  if (subjectLexeme === undefined || predicateLexeme === undefined) return undefined;\n\n  return {\n    subject: stemToken(subjectLexeme.token, subjectLexeme.preserveTerminalS, true),\n    predicate: stemToken(predicateLexeme.token, predicateLexeme.preserveTerminalS, true),\n  };\n}\n\nfunction hasCopularPredicateEvidence(candidate: string, source: string): boolean {\n  const candidateClaim = groundingCopularClaim(candidate);\n  if (candidateClaim === undefined) return true;\n  const sourceClaim = groundingCopularClaim(source);\n  return sourceClaim !== undefined\n    && areGroundingTokensCompatible(candidateClaim.subject, sourceClaim.subject)\n    && areGroundingTokensCompatible(candidateClaim.predicate, sourceClaim.predicate);\n}\nconst GROUNDING_ALIGNMENT_MODIFIERS = new Set([\n  \"actively\",\n  \"again\",\n  \"already\",\n  \"currently\",\n  \"eventually\",\n  \"finally\",\n  \"generally\",\n  \"mainly\",\n  \"newly\",\n  \"now\",\n  \"often\",\n  \"previously\",\n  \"primarily\",\n  \"quickly\",\n  \"recently\",\n  \"repeatedly\",\n  \"simply\",\n  \"slowly\",\n  \"sometimes\",\n  \"still\",\n  \"successfully\",\n  \"typically\",\n  \"usually\",\n]);\n\nfunction isGroundingAlignmentModifier(token: string): boolean {\n  return GROUNDING_ALIGNMENT_MODIFIERS.has(token);\n}\n\nfunction groundingSubjectTokenSequence(text: string): string[] {\n  const lexemes = groundingLexemes(text)\n    .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true);\n  const predicateIndex = lexemes.findIndex(({ isPredicate }) => isPredicate);\n  if (predicateIndex < 1) return [];\n  return lexemes\n    .slice(0, predicateIndex)\n    .filter(({ token }) => !isGroundingAlignmentModifier(token) && !token.endsWith(\"ly\"))\n    .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS, true));\n}\n\n\nfunction hasAlignedSubjectPredicateOverlap(candidate: string, source: string): boolean {\n  const candidateTokens = normalizedGroundingAlignmentTokenSequence(candidate);\n  const sourceTokens = normalizedGroundingAlignmentTokenSequence(source);\n  const candidateSubjectTokens = groundingSubjectTokenSequence(candidate);\n  const sourceSubjectTokens = groundingSubjectTokenSequence(source);\n  const hasCorrectionReordering = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate)\n    && /\\b(?:not|rather\\s+than|instead\\s+of)\\b/iu.test(source);\n  if (\n    candidateSubjectTokens.length > 0\n    && sourceSubjectTokens.length > 0\n    && !hasCorrectionReordering\n    && (\n      candidateSubjectTokens.length !== sourceSubjectTokens.length\n      || candidateSubjectTokens.some(\n        (token, index) => !areGroundingTokensCompatible(token, sourceSubjectTokens[index]!),\n      )\n    )\n  ) {\n    return false;\n  }\n  if (candidateTokens.length < 3 || sourceTokens.length < 3) {\n    return hasCopularPredicateEvidence(candidate, source);\n  }\n\n  const candidateSubject = candidateTokens[0];\n  if (candidateSubject === undefined) return false;\n  for (let sourceSubjectIndex = 0; sourceSubjectIndex < sourceTokens.length; sourceSubjectIndex += 1) {\n    if (!areGroundingTokensCompatible(candidateSubject, sourceTokens[sourceSubjectIndex]!)) continue;\n    let sourceCursor = sourceSubjectIndex + 1;\n    let foundAlignedToken = false;\n    let aligned = true;\n    for (let candidateIndex = 1; candidateIndex < candidateTokens.length; candidateIndex += 1) {\n      const candidateToken = candidateTokens[candidateIndex]!;\n      const sourceIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceCursor && areGroundingTokensCompatible(candidateToken, sourceToken),\n      );\n      if (sourceIndex === -1) {\n        if (hasCorrectionReordering) continue;\n        aligned = false;\n        break;\n      }\n      foundAlignedToken = true;\n      const candidateNext = candidateTokens[candidateIndex + 1];\n      const sourceNext = sourceTokens[sourceIndex + 1];\n      if (\n        candidateNext !== undefined\n        && sourceNext !== undefined\n        && !hasCorrectionReordering\n        && !areGroundingTokensCompatible(candidateNext, sourceNext)\n        && !isGroundingAlignmentModifier(sourceNext)\n      ) {\n        aligned = false;\n        break;\n      }\n      sourceCursor = sourceIndex + 1;\n    }\n    if (aligned && foundAlignedToken) return true;\n  }\n  return false;\n}\n\nfunction omitsSourceDisjunction(candidate: string, source: string): boolean {\n  if (!/\\bor\\b/iu.test(source) || /\\bor\\b/iu.test(candidate)) return false;\n  const candidateTokens = normalizedGroundingTokenSequence(candidate);\n  return splitGroundingClauses([source], true).some((sourceSpan) => {\n    const sourceSpanTokens = normalizedGroundingTokenSequence(sourceSpan);\n    return candidateTokens.length === sourceSpanTokens.length\n      && candidateTokens.every(\n        (token, index) => areGroundingTokensCompatible(token, sourceSpanTokens[index]!),\n      );\n  });\n}\n\nfunction groundedTokenScore(\n  candidate: string,\n  source: string,\n  requireAlignedArguments = true,\n  requireAllCandidateTokensGrounded = true,\n): number {\n  const scriptAwareScore = spacelessScriptGroundedTokenScore(candidate, source);\n  if (scriptAwareScore !== null) return scriptAwareScore;\n  const candidateTokens = tokenize(candidate);\n  if (candidateTokens.size === 0) return 0;\n  const sourceTokens = tokenize(source);\n  const allowCorrectionReordering = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate);\n  let sharedTokens = 0;\n  let allCandidateTokensGrounded = true;\n  for (const token of candidateTokens) {\n    if ([...sourceTokens].some((sourceToken) => areGroundingTokensCompatible(token, sourceToken))) {\n      sharedTokens += 1;\n    } else if (!allowCorrectionReordering && token !== \"rather\" && token !== \"instead\") {\n      allCandidateTokensGrounded = false;\n    }\n  }\n  if (\n    (requireAllCandidateTokensGrounded && !allCandidateTokensGrounded)\n    || sharedTokens < GROUNDING_MIN_SHARED_TOKENS\n    || sharedTokens / candidateTokens.size < GROUNDING_MIN_COVERAGE\n  ) {\n    return 0;\n  }\n  if (requireAlignedArguments && !hasAlignedSubjectPredicateOverlap(candidate, source)) return 0;\n  return sharedTokens / candidateTokens.size;\n}\n\nfunction candidateClauses(candidate: string): string[] {\n  return sourceSentences(candidate).flatMap((sentence) =>\n    /\\bor\\b/iu.test(sentence) ? [sentence] : splitGroundingClauses([sentence]));\n}\n\nfunction isSourceGroundedClause(\n  candidate: string,\n  source: string,\n  includeInterrogativeSource = false,\n): boolean {\n  let bestSupportedScore = 0;\n  let bestContradictedScore = 0;\n  const sentences = sourceSentences(source);\n  for (let index = 0; index < sentences.length; index += 1) {\n    const sentence = sentences[index];\n    if (isYesNoAnswer(sentence)) {\n      const precedingSentence = sentences[index - 1];\n      const answerToken = tokenSequence(sentence)[0];\n      const contradictoryPolarity = precedingSentence !== undefined\n        ? hasContradictoryPolarity(candidate, precedingSentence)\n        : false;\n      if (\n        precedingSentence !== undefined\n        && isInterrogativeSourceSentence(precedingSentence)\n        && !omitsSourceDisjunction(candidate, precedingSentence)\n        && groundedTokenScore(candidate, precedingSentence) === 1\n        && (\n          (answerToken === \"yes\" && !contradictoryPolarity)\n          || (answerToken === \"no\" && contradictoryPolarity)\n        )\n      ) {\n        return true;\n      }\n      continue;\n    }\n    const sentenceText = normalizeForExactMatch(sentence);\n    const isExplanatoryLabel = sentenceText.startsWith(`${normalizeForExactMatch(candidate)}:`)\n      && !sentence.trim().endsWith(\"?\");\n    if (!includeInterrogativeSource && isInterrogativeSourceSentence(sentence) && !isExplanatoryLabel) {\n      continue;\n    }\n    if (omitsSourceDisjunction(candidate, sentence)) continue;\n    const sourceSpans = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate)\n      ? [sentence]\n      : splitGroundingClauses([sentence], true);\n    for (const sourceSpan of sourceSpans) {\n      const sourceSpanText = normalizeForExactMatch(sourceSpan);\n      if (containsExactTokenSequence(candidate, sourceSpanText)) {\n        if (!hasContradictoryPolarity(candidate, sourceSpan)) return true;\n        bestContradictedScore = Math.max(bestContradictedScore, 1);\n        continue;\n      }\n      const score = groundedTokenScore(\n        candidate,\n        sourceSpan,\n        !includeInterrogativeSource,\n        !includeInterrogativeSource,\n      );\n      if (score === 0) continue;\n      if (hasContradictoryPolarity(candidate, sourceSpan)) {\n        bestContradictedScore = Math.max(bestContradictedScore, score);\n      } else {\n        bestSupportedScore = Math.max(bestSupportedScore, score);\n      }\n    }\n  }\n  return bestSupportedScore > bestContradictedScore;\n}\nfunction isSourceGrounded(\n  candidate: string,\n  source: string,\n  includeInterrogativeSource = false,\n): boolean {\n  const candidateText = normalizeForExactMatch(candidate);\n  const sourceText = source.normalize(\"NFKC\").trim();\n  if (candidateText.length === 0 || sourceText.length === 0) return false;\n  const hasSupportedExactMatch = sourceSentences(sourceText).some((sentence) => {\n    const sentenceText = normalizeForExactMatch(sentence);\n    const isExplanatoryLabel = sentenceText.startsWith(`${candidateText}:`)\n      && !sentence.trim().endsWith(\"?\");\n    if (!includeInterrogativeSource && isInterrogativeSourceSentence(sentence) && !isExplanatoryLabel) return false;\n    if (omitsSourceDisjunction(candidateText, sentenceText)) return false;\n    return containsExactTokenSequence(candidateText, sentenceText)\n      && !hasContradictoryPolarity(candidateText, sentenceText);\n  });\n  if (hasSupportedExactMatch) return true;\n\n  const clauses = candidateClauses(candidate);\n  if (clauses.length > 1) {\n    return clauses.every((clause) =>\n      isSourceGroundedClause(clause, sourceText, includeInterrogativeSource));\n  }\n  return isSourceGroundedClause(candidate, sourceText, includeInterrogativeSource);\n}\n\nfunction normalizedEntityIdentifierTokens(name: string): string[] {\n  const identifier = normalizeForExactMatch(name).replace(/[-_]+/gu, \" \");\n  const tokens = groundingLexemes(identifier)\n    .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true)\n    .map(({ token }) => stemToken(token, true));\n  return tokens.length > 1 && GROUNDING_ENTITY_TYPE_PREFIXES.has(tokens[0] ?? \"\")\n    ? tokens.slice(1)\n    : tokens;\n}\n\nfunction isGroundedEntityName(name: string, source: string): boolean {\n  const nameTokens = normalizedEntityIdentifierTokens(name);\n  return nameTokens.length > 0 && sourceSentences(source).some((sentence) => {\n    const sentenceTokens = groundingLexemes(sentence)\n      .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true)\n      .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS));\n    return containsContiguousGroundingTokens(nameTokens, sentenceTokens);\n  });\n}\nfunction buildEntitySupportSource(name: string, source: string): string {\n  const nameTokens = normalizedEntityIdentifierTokens(name);\n  if (nameTokens.length === 0) return \"\";\n  return sourceSentences(source)\n    .filter((sentence) => {\n      const sentenceTokens = groundingLexemes(sentence)\n        .filter(({ token }) => GROUNDING_STOPWORDS[token] !== true)\n        .map(({ token, preserveTerminalS }) => stemToken(token, preserveTerminalS));\n      return containsContiguousGroundingTokens(nameTokens, sentenceTokens);\n    })\n    .join(\" \");\n}\n\nfunction hasGroundedPredicateAnchor(candidate: string, sentence: string): boolean {\n  const candidateTokens = normalizedGroundingTokenSequence(candidate);\n  const sourceTokens = normalizedGroundingTokenSequence(sentence);\n  const comparableCandidateTokens = GROUNDING_ROLE_SUBJECT_TOKENS.has(\n    (candidateTokens[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n  )\n    ? candidateTokens.slice(1)\n    : candidateTokens;\n  if (comparableCandidateTokens.length < 2) return false;\n  const subjectToken = comparableCandidateTokens[0];\n  if (\n    subjectToken === undefined\n    || !sourceTokens.some((sourceToken) => areGroundingTokensCompatible(subjectToken, sourceToken))\n  ) {\n    return false;\n  }\n  const candidatePredicateTokens = comparableCandidateTokens.slice(1);\n  const sharedPredicateTokens = candidatePredicateTokens.filter((token) =>\n    sourceTokens.some((sourceToken) => areGroundingTokensCompatible(token, sourceToken)));\n  const requiredSharedTokens = Math.min(2, candidatePredicateTokens.length);\n  return sharedPredicateTokens.length >= requiredSharedTokens;\n}\nfunction hasGroundingAnchor(\n  candidate: string,\n  assertionSource: string,\n  includeInterrogativeSource = false,\n  requirePredicateSupport = false,\n): boolean {\n  return sourceSentences(assertionSource).some((sentence) => {\n    if (!includeInterrogativeSource && isInterrogativeSourceSentence(sentence)) return false;\n    if (omitsSourceDisjunction(candidate, sentence)) return false;\n    const sourceSpans = /\\b(?:rather\\s+than|instead\\s+of)\\b/iu.test(candidate)\n      ? [sentence]\n      : splitGroundingClauses([sentence], true);\n    return sourceSpans.some((sourceSpan) => {\n      const exactMatch = containsExactTokenSequence(candidate, sourceSpan)\n        && !hasContradictoryPolarity(candidate, sourceSpan);\n      if (exactMatch) return true;\n      if (requirePredicateSupport && !hasGroundedPredicateAnchor(candidate, sourceSpan)) return false;\n      return groundedTokenScore(candidate, sourceSpan) > 0\n        || hasRoleNormalizedGrounding(candidate, sourceSpan);\n    });\n  });\n}\n\nfunction hasAnswerSupport(\n  candidate: string,\n  source: string,\n  assertionSource: string,\n): boolean {\n  const assertedAnswerSentences = new Set(\n    sourceSentences(assertionSource)\n      .filter((sentence) => {\n        const answerToken = tokenSequence(sentence)[0];\n        return answerToken === \"yes\" || answerToken === \"no\";\n      })\n      .map((sentence) => normalizeForExactMatch(sentence)),\n  );\n  if (assertedAnswerSentences.size === 0) return false;\n  const sentences = sourceSentences(source);\n  return sentences.some((sentence, index) => {\n    const answerToken = tokenSequence(sentence)[0];\n    if (answerToken !== \"yes\" && answerToken !== \"no\") return false;\n    if (!assertedAnswerSentences.has(normalizeForExactMatch(sentence))) return false;\n    const precedingSentence = sentences[index - 1];\n    if (\n      precedingSentence === undefined\n      || !isInterrogativeSourceSentence(precedingSentence)\n      || omitsSourceDisjunction(candidate, precedingSentence)\n      || groundedTokenScore(candidate, precedingSentence) !== 1\n    ) {\n      return false;\n    }\n    const contradictoryPolarity = hasContradictoryPolarity(candidate, precedingSentence);\n    return answerToken === \"yes\" ? !contradictoryPolarity : contradictoryPolarity;\n  });\n}\n\nconst GROUNDING_ROLE_SUBJECT_TOKENS = new Set([\"assistant\", \"user\"]);\n\nfunction hasRoleNormalizedGrounding(candidate: string, source: string): boolean {\n  const candidateTokens = groundingTokenSequence(candidate);\n  if (!GROUNDING_ROLE_SUBJECT_TOKENS.has(\n    (candidateTokens[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n  )) return false;\n  const claimTokens = candidateTokens.slice(1);\n  if (claimTokens.length === 0) return false;\n\n  return sourceSentences(source).some((sentence) => {\n    if (isInterrogativeSourceSentence(sentence)) return false;\n    const sourceTokens = groundingTokenSequence(sentence);\n    const requiredSharedTokens = Math.min(GROUNDING_MIN_SHARED_TOKENS, claimTokens.length);\n    let sourceIndex = 0;\n    let sharedTokens = 0;\n    for (const claimToken of claimTokens) {\n      const matchingIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceIndex && areGroundingTokensCompatible(claimToken, sourceToken),\n      );\n      if (matchingIndex === -1) continue;\n      sharedTokens += 1;\n      sourceIndex = matchingIndex + 1;\n    }\n    return sharedTokens >= requiredSharedTokens\n      && !hasContradictoryPolarity(candidate, sentence);\n  });\n}\n\ninterface GroundingContext {\n  source: string;\n  assertionSource: string | undefined;\n  allowRoleNormalization: boolean;\n  fallbackSource?: string;\n  fallbackAssertionSource?: string;\n}\n\nfunction resolveGroundingContext(\n  candidate: string,\n  source: string,\n  assertionSource: string | undefined,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n): GroundingContext {\n  const candidateRole = (groundingTokenSequence(candidate)[0] ?? \"\")\n    .replace(/^[\\u0000\\u0001]/u, \"\");\n  if (!GROUNDING_ROLE_SUBJECT_TOKENS.has(candidateRole)) {\n    return { source, assertionSource, allowRoleNormalization: false };\n  }\n  if (roleAssertionSources === undefined) {\n    return { source, assertionSource, allowRoleNormalization: true };\n  }\n  const roleSource = candidateRole === \"user\"\n    ? roleAssertionSources.profile\n    : roleAssertionSources.identity;\n  if (roleSource === undefined) {\n    return { source, assertionSource, allowRoleNormalization: true };\n  }\n  return {\n    source: roleSource,\n    assertionSource: roleSource,\n    allowRoleNormalization: true,\n    fallbackSource: source,\n    fallbackAssertionSource: assertionSource,\n  };\n}\n\nfunction selectGroundingContext(candidate: string, context: GroundingContext): GroundingContext {\n  if (isGroundedCandidate(\n    candidate,\n    context.source,\n    context.assertionSource,\n    false,\n    context.allowRoleNormalization,\n  )) {\n    return context;\n  }\n  if (\n    context.fallbackSource === undefined\n    || !hasExplicitRoleSubjectToken(\n      (groundingTokenSequence(candidate)[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n      sourceSentences(context.fallbackSource).map((sentence) => groundingTokenSequence(sentence)),\n    )\n  ) return context;\n  const fallbackContext: GroundingContext = {\n    source: context.fallbackSource,\n    assertionSource: context.fallbackAssertionSource,\n    allowRoleNormalization: false,\n  };\n  return isGroundedCandidate(\n    candidate,\n    fallbackContext.source,\n    fallbackContext.assertionSource,\n    false,\n    fallbackContext.allowRoleNormalization,\n  )\n    ? fallbackContext\n    : context;\n}\n\nfunction isGroundedCandidate(\n  candidate: string,\n  source: string,\n  assertionSource: string | undefined,\n  includeInterrogativeSource = false,\n  allowRoleNormalization = false,\n): boolean {\n  const allowInterrogativeSource = includeInterrogativeSource\n    || (\n      assertionSource !== undefined\n      && normalizeForExactMatch(assertionSource) !== normalizeForExactMatch(source)\n    );\n  const sourceGrounded = isSourceGrounded(candidate, source, allowInterrogativeSource);\n  const roleGrounded = allowRoleNormalization && hasRoleNormalizedGrounding(candidate, source);\n  const candidateTokens = groundingTokenSequence(candidate);\n  const roleNormalizedCandidate = allowRoleNormalization\n    && GROUNDING_ROLE_SUBJECT_TOKENS.has(\n      (candidateTokens[0] ?? \"\").replace(/^[\\u0000\\u0001]/u, \"\"),\n    );\n  if (roleNormalizedCandidate && !roleGrounded) return false;\n  if (!sourceGrounded && !roleGrounded) return false;\n  if (assertionSource === undefined) return true;\n  const clauses = candidateClauses(candidate);\n  const requirePredicateSupport = !includeInterrogativeSource\n    && assertionSource !== undefined\n    && normalizeForExactMatch(assertionSource) !== normalizeForExactMatch(source);\n  return clauses.length > 0\n    && (\n      clauses.every((clause) =>\n        hasGroundingAnchor(clause, assertionSource, includeInterrogativeSource, requirePredicateSupport))\n      || hasAnswerSupport(candidate, source, assertionSource)\n    );\n}\n\nfunction buildFactSupportSource(\n  source: string,\n  supportingSentences: ReadonlyArray<string>,\n): string {\n  const sentences = sourceSentences(source);\n  const selectedIndices = new Set<number>();\n  for (const supportingSentence of supportingSentences) {\n    const supportIndex = sentences.indexOf(supportingSentence);\n    if (supportIndex < 0) continue;\n    let endIndex = supportIndex;\n    while (\n      endIndex < sentences.length - 1\n      && sentences[endIndex]!.trimEnd().endsWith(\";\")\n      && /^(?:its|their|this|that|these|those)\\b/iu.test(\n        sentences[endIndex + 1]!.trimStart(),\n      )\n    ) {\n      endIndex += 1;\n    }\n    for (let index = supportIndex; index <= endIndex; index += 1) {\n      selectedIndices.add(index);\n    }\n  }\n  return [...selectedIndices]\n    .sort((left, right) => left - right)\n    .map((index) => sentences[index]!)\n    .join(\" \");\n}\nfunction buildProcedureSupportSource(\n  fact: ExtractionResult[\"facts\"][number],\n  source: string,\n  factSupportSource: string,\n): string {\n  if (fact.category !== \"procedure\" || fact.procedureSteps === undefined) return factSupportSource;\n  const parentSupportSentences = new Set(\n    sourceSentences(factSupportSource).map((sentence) => normalizeForExactMatch(sentence)),\n  );\n  const parentGroundedSteps = fact.procedureSteps.filter((step) =>\n    isGroundedCandidate(step.intent, factSupportSource, undefined, false),\n  );\n  if (parentGroundedSteps.length === 0) return factSupportSource;\n  return sourceSentences(source)\n    .filter((sentence) => {\n      if (parentSupportSentences.has(normalizeForExactMatch(sentence))) return true;\n      const sentenceTokens = tokenize(sentence);\n      return parentGroundedSteps.some((step) =>\n        [...tokenize(step.intent)].some((token) =>\n          [...sentenceTokens].some((sourceToken) => areGroundingTokensCompatible(token, sourceToken)),\n        ),\n      );\n    })\n    .join(\" \");\n}\nfunction filterGroundedFact(\n  fact: ExtractionResult[\"facts\"][number],\n  source: string,\n  assertionSource: string | undefined,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n  eventTimeNormalizer: ((eventTime: string) => string) | undefined,\n  spanMode: \"off\" | \"shadow\" | \"on\" = \"off\",\n): ExtractionResult[\"facts\"][number] | undefined {\n  // Span-materialized content (issue #2333) is \"frame: verbatim slice\". The\n  // frame is generated deixis, so full-content gating would drop a verbatim\n  // fact. Only on-mode facts whose content is that materialized shape may\n  // fall back to the slice. Shadow stays zero-diff with off.\n  const quote = typeof fact.quote === \"string\" ? fact.quote : \"\";\n  const materializedPrefix = quote.length > 0 && fact.content.endsWith(quote) && fact.content !== quote\n    ? fact.content.slice(0, fact.content.length - quote.length)\n    : \"\";\n  const embeddedQuote =\n    spanMode === \"on\"\n    && quote.trim().length > 0\n    && (materializedPrefix.endsWith(\": \") || /[:—-]\\s$/.test(materializedPrefix))\n      ? quote\n      : undefined;\n  const contentContext = selectGroundingContext(\n    fact.content,\n    resolveGroundingContext(fact.content, source, assertionSource, roleAssertionSources),\n  );\n  let gateContent = fact.content;\n  let factContext = contentContext;\n  if (\n    !isGroundedCandidate(\n      fact.content,\n      contentContext.source,\n      contentContext.assertionSource,\n      false,\n      contentContext.allowRoleNormalization,\n    )\n  ) {\n    if (embeddedQuote === undefined) return undefined;\n    gateContent = embeddedQuote;\n    factContext = selectGroundingContext(\n      gateContent,\n      resolveGroundingContext(gateContent, source, assertionSource, roleAssertionSources),\n    );\n    if (!isGroundedCandidate(\n      gateContent,\n      factContext.source,\n      factContext.assertionSource,\n      false,\n      factContext.allowRoleNormalization,\n    )) return undefined;\n  }\n  const factEventTime = fact.eventTime;\n  const groundedFactEventTime = factEventTime === undefined\n    ? undefined\n    : eventTimeNormalizer?.(factEventTime) ?? factEventTime;\n  const factSupportingSentences = sourceSentences(factContext.assertionSource ?? factContext.source).filter(\n    (sentence) =>\n    isGroundedCandidate(\n      gateContent,\n      sentence,\n      undefined,\n      false,\n      factContext.allowRoleNormalization,\n    ),\n  );\n  const factSupportingSource = factEventTime === undefined\n    ? factSupportingSentences[0]\n    : factSupportingSentences.find((sentence) =>\n      isGroundedCandidate(\n        groundedFactEventTime ?? factEventTime,\n        sentence,\n        undefined,\n        false,\n        factContext.allowRoleNormalization,\n      ),\n    ) ?? factSupportingSentences[0];\n  const eventTimeSource = factSupportingSource ?? factContext.source;\n  const eventTimeAssertionSource = factSupportingSource === undefined\n    ? factContext.assertionSource\n    : undefined;\n\n  const factSupportSource = buildFactSupportSource(\n    factContext.assertionSource ?? factContext.source,\n    factSupportingSentences,\n  );\n  const groundedAttributes = fact.structuredAttributes\n    ? Object.fromEntries(\n      Object.entries(fact.structuredAttributes)\n        .filter(([key, value]) =>\n          isGroundedCandidate(\n            `${key}: ${value}`,\n            factSupportSource,\n            undefined,\n            false,\n            factContext.allowRoleNormalization,\n          ),\n        ),\n    )\n    : undefined;\n  const procedureGroundingSource = buildProcedureSupportSource(\n    fact,\n    factContext.assertionSource ?? factContext.source,\n    factSupportSource,\n  );\n  const groundedProcedureSteps = fact.procedureSteps\n    ? fact.procedureSteps.flatMap((step) => {\n      if (!isGroundedCandidate(step.intent, procedureGroundingSource, undefined, false)) return [];\n      const expectedOutcome = step.expectedOutcome\n        && isGroundedCandidate(step.expectedOutcome, procedureGroundingSource, undefined, false)\n        ? step.expectedOutcome\n        : undefined;\n      const toolCall = step.toolCall\n        && isGroundedCandidate(step.toolCall.signature, procedureGroundingSource, undefined, false)\n        ? step.toolCall\n        : undefined;\n      const {\n        expectedOutcome: _expectedOutcome,\n        toolCall: _toolCall,\n        ...stepWithoutOptionalFields\n      } = step;\n      return [{\n        ...stepWithoutOptionalFields,\n        ...(expectedOutcome !== undefined ? { expectedOutcome } : {}),\n        ...(toolCall !== undefined ? { toolCall } : {}),\n      }];\n    })\n    : undefined;\n  const groundedReasoningTrace = fact.reasoningTrace\n    && fact.reasoningTrace.steps.length > 0\n    && isGroundedCandidate(\n      fact.reasoningTrace.finalAnswer,\n      factContext.source,\n      factContext.assertionSource,\n      false,\n      factContext.allowRoleNormalization,\n    )\n    && fact.reasoningTrace.steps.every((step) =>\n      isGroundedCandidate(\n        step.description,\n        factContext.source,\n        factContext.assertionSource,\n        false,\n        factContext.allowRoleNormalization,\n      ),\n    )\n    ? {\n      steps: fact.reasoningTrace.steps,\n      finalAnswer: fact.reasoningTrace.finalAnswer,\n      ...(fact.reasoningTrace.observedOutcome\n        && isGroundedCandidate(\n          fact.reasoningTrace.observedOutcome,\n          factContext.source,\n          factContext.assertionSource,\n          false,\n          factContext.allowRoleNormalization,\n        )\n        ? { observedOutcome: fact.reasoningTrace.observedOutcome }\n        : {}),\n    }\n    : undefined;\n  const groundedEventTime = groundedFactEventTime\n    && isGroundedCandidate(groundedFactEventTime, eventTimeSource, eventTimeAssertionSource)\n    ? factEventTime\n    : undefined;\n  const groundedEntityRef = fact.entityRef !== undefined\n    && isGroundedEntityName(fact.entityRef, factSupportSource)\n    ? fact.entityRef\n    : undefined;\n  const {\n    entityRef: _entityRef,\n    structuredAttributes: _structuredAttributes,\n    procedureSteps: _procedureSteps,\n    reasoningTrace: _reasoningTrace,\n    eventTime: _eventTime,\n    ...factWithoutGroundingFields\n  } = fact;\n  return {\n    ...factWithoutGroundingFields,\n    ...(groundedEntityRef !== undefined ? { entityRef: groundedEntityRef } : {}),\n    ...(groundedAttributes && Object.keys(groundedAttributes).length > 0\n      ? { structuredAttributes: groundedAttributes }\n      : {}),\n    ...(groundedProcedureSteps && groundedProcedureSteps.length > 0\n      ? { procedureSteps: groundedProcedureSteps }\n      : {}),\n    ...(groundedReasoningTrace !== undefined ? { reasoningTrace: groundedReasoningTrace } : {}),\n    ...(groundedEventTime !== undefined ? { eventTime: groundedEventTime } : {}),\n  };\n}\n\nfunction filterGroundedEntity(\n  entity: ExtractionResult[\"entities\"][number],\n  source: string,\n  assertionSource: string | undefined,\n): ExtractionResult[\"entities\"][number] | undefined {\n  if (!isGroundedEntityName(entity.name, source)) return undefined;\n  const entitySource = buildEntitySupportSource(entity.name, source);\n  const entityAssertionSource = assertionSource === undefined\n    ? undefined\n    : buildEntitySupportSource(entity.name, assertionSource);\n  const facts = entity.facts.filter((fact) =>\n    isGroundedCandidate(fact, entitySource, entityAssertionSource),\n  );\n  const structuredSections = entity.structuredSections\n    ?.flatMap((section) => {\n      const groundedFacts = section.facts.filter((fact) =>\n        isGroundedCandidate(fact, entitySource, entityAssertionSource),\n      );\n      return groundedFacts.length > 0\n        ? [{ ...section, facts: groundedFacts }]\n        : [];\n    });\n  if (facts.length === 0 && (structuredSections === undefined || structuredSections.length === 0)) {\n    return undefined;\n  }\n  const { structuredSections: _structuredSections, ...entityWithoutSections } = entity;\n  return {\n    ...entityWithoutSections,\n    facts,\n    ...(structuredSections && structuredSections.length > 0 ? { structuredSections } : {}),\n  };\n}\n\nfunction normalizedEntitySourceText(name: string): string {\n  return normalizedEntityIdentifierTokens(name).join(\" \");\n}\n\nfunction isGroundedRelationship(\n  relationship: NonNullable<ExtractionResult[\"relationships\"]>[number],\n  source: string,\n  assertionSource: string | undefined,\n): boolean {\n  const sourceName = normalizedEntitySourceText(relationship.source);\n  const targetName = normalizedEntitySourceText(relationship.target);\n  const labelTokens = tokenize(relationship.label);\n  if (sourceName.length === 0 || targetName.length === 0 || labelTokens.size === 0) return false;\n  const relationText = `${sourceName} ${relationship.label} ${targetName}`;\n  const hasCoherentSourceSpan = sourceSentences(source).some((sentence) => {\n    if (isInterrogativeSourceSentence(sentence)) return false;\n    return groundedTokenScore(relationText, sentence) === 1\n      && !hasContradictoryPolarity(relationText, sentence);\n  });\n  return hasCoherentSourceSpan\n    && isGroundedCandidate(relationText, source, assertionSource);\n}\nconst GROUNDING_TEMPORAL_WORDS = new Set([\n  \"today\",\n  \"yesterday\",\n  \"tomorrow\",\n  \"now\",\n  \"recently\",\n  \"earlier\",\n  \"later\",\n  \"soon\",\n  \"morning\",\n  \"afternoon\",\n  \"evening\",\n  \"tonight\",\n  \"night\",\n  \"noon\",\n  \"midnight\",\n  \"monday\",\n  \"tuesday\",\n  \"wednesday\",\n  \"thursday\",\n  \"friday\",\n  \"saturday\",\n  \"sunday\",\n  \"january\",\n  \"february\",\n  \"march\",\n  \"april\",\n  \"may\",\n  \"june\",\n  \"july\",\n  \"august\",\n  \"september\",\n  \"october\",\n  \"november\",\n  \"december\",\n  \"q1\",\n  \"q2\",\n  \"q3\",\n  \"q4\",\n]);\nconst GROUNDING_TEMPORAL_CLOCK_PATTERN = /\\b\\d{1,2}:\\d{2}(?:\\s*[ap]\\.?m\\.?)?\\b/iu;\nconst GROUNDING_TEMPORAL_DURATION_PATTERN = new RegExp(\n  \"\\\\b(?:\\\\d+|one|two|three|four|five|six|seven|eight|nine|ten)\\\\s+\"\n    + \"(?:seconds?|minutes?|hours?|days?|weeks?|months?|quarters?|years?)\\\\b\",\n  \"iu\",\n);\n\nfunction isWhenQuestion(question: string): boolean {\n  return /^(?:when|what\\s+(?:time|date)|which\\s+day)\\b/iu.test(question.trim());\n}\nfunction isWhyQuestion(question: string): boolean {\n  return /^why\\b/iu.test(question.trim());\n}\n\nfunction hasCausalAnswerEvidence(question: string, sentence: string): boolean {\n  if (!isWhyQuestion(question)) return true;\n  return /\\b(?:because|since|due\\s+to|owing\\s+to|thanks\\s+to|therefore|thus|hence|so)\\b/iu.test(\n    sentence,\n  );\n}\n\nfunction hasTemporalAnswerEvidence(question: string, sentence: string): boolean {\n  if (!isWhenQuestion(question)) return true;\n  return groundingLexemes(sentence).some(({ token }) =>\n    GROUNDING_TEMPORAL_WORDS.has(token) || /^(?:19|20)\\d{2}$/u.test(token),\n  )\n    || GROUNDING_TEMPORAL_CLOCK_PATTERN.test(sentence)\n    || GROUNDING_TEMPORAL_DURATION_PATTERN.test(sentence);\n}\n\n\nfunction isUnknownAnswerSentence(sentence: string): boolean {\n  return /\\b(?:unknown|unclear|unsure|unresolved|unanswered|not\\s+(?:known|sure|available)|don't\\s+know|do\\s+not\\s+know|no\\s+idea|pending)\\b/iu\n    .test(sentence);\n}\n\nfunction isYesNoAnswer(sentence: string): boolean {\n  return /^(?:yes|no)(?:[.!?]|,\\s*(?:absolutely|definitely|indeed|exactly|correct|of\\s+course|use\\s+that|do\\s+that)[.!?]?)?$/iu\n    .test(sentence.trim());\n}\n\nconst GROUNDING_WH_OBJECT_QUESTION_PATTERN = new RegExp(\n  \"^(?:(?:what|which)(?:\\\\s+.+?)?|who|whom)\\\\s+\"\n    + \"(?:is|are|was|were|do|does|did|can|could|will|would|should|has|have|had)\\\\s+\"\n    + \"(.+?)\\\\??$\",\n  \"iu\",\n);\n\nfunction hasWhAnswerRoleAlignment(question: string, sentence: string): boolean {\n  const normalizedQuestion = question.trim();\n  const objectQuestionMatch = GROUNDING_WH_OBJECT_QUESTION_PATTERN.exec(normalizedQuestion);\n  const sourceTokens = normalizedGroundingTokenSequence(sentence);\n  if (objectQuestionMatch !== null) {\n    const questionBodyLexemes = groundingLexemes(objectQuestionMatch[1] ?? \"\");\n    const predicateIndex = questionBodyLexemes.findIndex(({ isPredicate }) => isPredicate);\n    if (predicateIndex < 1) return false;\n    const subjectTokens = groundingTokenSequence(\n      questionBodyLexemes.slice(0, predicateIndex).map(({ surface }) => surface).join(\" \"),\n    );\n    const predicateTokens = groundingTokenSequence(\n      questionBodyLexemes.slice(predicateIndex).map(({ surface }) => surface).join(\" \"),\n    );\n    if (subjectTokens.length === 0 || predicateTokens.length === 0) return false;\n    let sourceIndex = 0;\n    for (const token of [...subjectTokens, ...predicateTokens]) {\n      const matchedIndex = sourceTokens.findIndex(\n        (sourceToken, index) =>\n          index >= sourceIndex && areGroundingTokensCompatible(token, sourceToken),\n      );\n      if (matchedIndex === -1) return false;\n      sourceIndex = matchedIndex + 1;\n    }\n    return true;\n  }\n\n  const subjectQuestionMatch = /^(?:who|what)\\s+([^\\s?]+)\\s+(.+?)\\??$/iu.exec(normalizedQuestion);\n  if (subjectQuestionMatch === null) return true;\n  const predicateTokens = groundingTokenSequence(subjectQuestionMatch[1] ?? \"\");\n  const objectTokens = groundingTokenSequence(subjectQuestionMatch[2] ?? \"\");\n  if (predicateTokens.length === 0 || objectTokens.length === 0) return true;\n  const predicateStart = sourceTokens.findIndex((sourceToken) =>\n    areGroundingTokensCompatible(predicateTokens[0]!, sourceToken));\n  if (predicateStart === -1) return false;\n  let sourceIndex = predicateStart + predicateTokens.length;\n  for (const objectToken of objectTokens) {\n    const objectIndex = sourceTokens.findIndex(\n      (sourceToken, index) =>\n        index >= sourceIndex && areGroundingTokensCompatible(objectToken, sourceToken),\n    );\n    if (objectIndex === -1) return false;\n    sourceIndex = objectIndex + 1;\n  }\n  return true;\n}\n\nfunction isQuestionAnsweredBySource(\n  question: string,\n  source: string,\n  assertionSource: string | undefined,\n): boolean {\n  const questionTokens = tokenize(question);\n  if (questionTokens.size === 0) return false;\n  const isYesNoQuestion = /^(?:is|are|am|was|were|do|does|did|can|could|will|would|should|has|have|had)\\b/iu\n    .test(question.trim());\n  const assertedSentences = new Set(sourceSentences(assertionSource ?? source).map((sentence) => normalizeForExactMatch(sentence)));\n  const sentences = sourceSentences(source);\n  return sentences.some((sentence, index) => {\n    if (!assertedSentences.has(normalizeForExactMatch(sentence))) return false;\n    if (isInterrogativeSourceSentence(sentence)) return false;\n    if (isYesNoAnswer(sentence)) {\n      const precedingSentence = sentences[index - 1];\n      return precedingSentence !== undefined\n        && isInterrogativeSourceSentence(precedingSentence)\n        && groundedTokenScore(question, precedingSentence) === 1;\n    }\n    if (isUnknownAnswerSentence(sentence)) return false;\n    const score = groundedTokenScore(question, sentence, false);\n    if (score !== 1) return false;\n    const sentenceTokens = tokenize(sentence);\n    const hasAnswerToken = [...sentenceTokens].some((token) => !questionTokens.has(token));\n    return (isYesNoQuestion || hasAnswerToken)\n      && hasTemporalAnswerEvidence(question, sentence)\n      && hasCausalAnswerEvidence(question, sentence)\n      && hasWhAnswerRoleAlignment(question, sentence);\n  });\n}\n\nfunction groundQuestion(\n  question: ExtractionResult[\"questions\"][number],\n  source: string,\n  assertionSource: string | undefined,\n): ExtractionResult[\"questions\"][number] | undefined {\n  if (isQuestionAnsweredBySource(question.question, source, assertionSource)) return undefined;\n  if (!isGroundedCandidate(question.question, source, assertionSource, true)) return undefined;\n  const normalizedContext = question.context.trim();\n  if (\n    normalizedContext.length > 0\n    && !isGroundedCandidate(normalizedContext, assertionSource ?? source, undefined, false)\n  ) {\n    return { ...question, context: \"\" };\n  }\n  return question;\n}\n\nfunction isRoleGroundedCandidate(\n  candidate: string,\n  source: string,\n  assertionSource: string | undefined,\n  roleAssertionSources: ExtractionGroundingRoleSources | undefined,\n): boolean {\n  const context = selectGroundingContext(\n    candidate,\n    resolveGroundingContext(candidate, source, assertionSource, roleAssertionSources),\n  );\n  return isGroundedCandidate(\n    candidate,\n    context.source,\n    context.assertionSource,\n    false,\n    context.allowRoleNormalization,\n  );\n}\n\nexport function filterExtractionResultBySource(\n  result: ExtractionResult,\n  source: string,\n  assertionSource?: string,\n  roleAssertionSources?: ExtractionGroundingRoleSources,\n  eventTimeNormalizer?: (eventTime: string) => string,\n  spanMode: \"off\" | \"shadow\" | \"on\" = \"off\",\n): ExtractionResult {\n  if (source.trim().length === 0) {\n    return {\n      ...result,\n      facts: [],\n      profileUpdates: [],\n      entities: [],\n      questions: [],\n      ...(result.relationships !== undefined ? { relationships: [] } : {}),\n      identityReflection: undefined,\n    };\n  }\n\n  const facts = result.facts.flatMap((fact) => {\n    const grounded = filterGroundedFact(\n      fact,\n      source,\n      assertionSource,\n      roleAssertionSources,\n      eventTimeNormalizer,\n      spanMode,\n    );\n    return grounded === undefined ? [] : [grounded];\n  });\n  const profileUpdates = result.profileUpdates.filter((update) =>\n    isRoleGroundedCandidate(update, source, assertionSource, roleAssertionSources),\n  );\n  const entities = result.entities.flatMap((entity) => {\n    const grounded = filterGroundedEntity(entity, source, assertionSource);\n    return grounded === undefined ? [] : [grounded];\n  });\n  const questions = result.questions.flatMap((question) => {\n    const grounded = groundQuestion(question, source, assertionSource);\n    return grounded === undefined ? [] : [grounded];\n  });\n  const relationships = result.relationships?.filter((relationship) =>\n    isGroundedRelationship(relationship, source, assertionSource),\n  );\n  const identityReflection = result.identityReflection\n    && isRoleGroundedCandidate(\n      result.identityReflection,\n      source,\n      assertionSource,\n      roleAssertionSources,\n    )\n    ? result.identityReflection\n    : undefined;\n\n  return {\n    ...result,\n    facts,\n    profileUpdates,\n    entities,\n    questions,\n    ...(result.relationships !== undefined ? { relationships } : {}),\n    ...(identityReflection !== undefined ? { identityReflection } : { identityReflection: undefined }),\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCO,SAAS,+BACd,QACA,YACA,sBAA8B,YAC9B,sBACA,kBACA,SACkB;AAClB,MAAI,CAAC,QAAQ,gBAAiB,QAAO;AACrC,QAAM,eAAe,CAAC,WACpB,QAAQ,4BACJ,0BAA0B,QAAQ,oBAAoB,oBAAI,KAAK,CAAC,IAChE;AACN,QAAM,sBAAsB,yBAAyB,SACjD,SACA;AAAA,IACA,SAAS,qBAAqB,YAAY,SACtC,SACA,aAAa,qBAAqB,OAAO;AAAA,IAC7C,UAAU,qBAAqB,aAAa,SACxC,SACA,aAAa,qBAAqB,QAAQ;AAAA,EAChD;AACF,SAAO;AAAA,IACL;AAAA,IACA,aAAa,UAAU;AAAA,IACvB,aAAa,mBAAmB;AAAA,IAChC;AAAA,IACA,QAAQ,4BAA4B,eAAe;AAAA,IACnD,QAAQ,YAAY;AAAA,EACtB;AACF;AAcA,SAAS,sBAAsB,MAAiD;AAC9E,QAAM,UAAU,iBAAiB,IAAI;AACrC,QAAM,cAAc,QAAQ,UAAU,CAAC,EAAE,MAAM,MAAM,wBAAwB,IAAI,KAAK,CAAC;AACvF,MAAI,eAAe,EAAG,QAAO;AAE7B,MAAI,eAAe,cAAc;AACjC,SACE,gBAAgB,KACb,2BAA2B,IAAI,QAAQ,YAAY,EAAG,KAAK,GAC9D;AACA,oBAAgB;AAAA,EAClB;AACA,QAAM,gBAAgB,QAAQ,YAAY;AAC1C,QAAM,kBAAkB,QACrB,MAAM,cAAc,CAAC,EACrB,KAAK,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC1D,MAAI,kBAAkB,UAAa,oBAAoB,OAAW,QAAO;AAEzE,SAAO;AAAA,IACL,SAAS,UAAU,cAAc,OAAO,cAAc,mBAAmB,IAAI;AAAA,IAC7E,WAAW,UAAU,gBAAgB,OAAO,gBAAgB,mBAAmB,IAAI;AAAA,EACrF;AACF;AAEA,SAAS,4BAA4B,WAAmB,QAAyB;AAC/E,QAAM,iBAAiB,sBAAsB,SAAS;AACtD,MAAI,mBAAmB,OAAW,QAAO;AACzC,QAAM,cAAc,sBAAsB,MAAM;AAChD,SAAO,gBAAgB,UAClB,6BAA6B,eAAe,SAAS,YAAY,OAAO,KACxE,6BAA6B,eAAe,WAAW,YAAY,SAAS;AACnF;AACA,IAAM,gCAAgC,oBAAI,IAAI;AAAA,EAC5C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,SAAS,6BAA6B,OAAwB;AAC5D,SAAO,8BAA8B,IAAI,KAAK;AAChD;AAEA,SAAS,8BAA8B,MAAwB;AAC7D,QAAM,UAAU,iBAAiB,IAAI,EAClC,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI;AAC5D,QAAM,iBAAiB,QAAQ,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACzE,MAAI,iBAAiB,EAAG,QAAO,CAAC;AAChC,SAAO,QACJ,MAAM,GAAG,cAAc,EACvB,OAAO,CAAC,EAAE,MAAM,MAAM,CAAC,6BAA6B,KAAK,KAAK,CAAC,MAAM,SAAS,IAAI,CAAC,EACnF,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,mBAAmB,IAAI,CAAC;AACpF;AAGA,SAAS,kCAAkC,WAAmB,QAAyB;AACrF,QAAM,kBAAkB,0CAA0C,SAAS;AAC3E,QAAM,eAAe,0CAA0C,MAAM;AACrE,QAAM,yBAAyB,8BAA8B,SAAS;AACtE,QAAM,sBAAsB,8BAA8B,MAAM;AAChE,QAAM,0BAA0B,uCAAuC,KAAK,SAAS,KAChF,2CAA2C,KAAK,MAAM;AAC3D,MACE,uBAAuB,SAAS,KAC7B,oBAAoB,SAAS,KAC7B,CAAC,4BAEF,uBAAuB,WAAW,oBAAoB,UACnD,uBAAuB;AAAA,IACxB,CAAC,OAAO,UAAU,CAAC,6BAA6B,OAAO,oBAAoB,KAAK,CAAE;AAAA,EACpF,IAEF;AACA,WAAO;AAAA,EACT;AACA,MAAI,gBAAgB,SAAS,KAAK,aAAa,SAAS,GAAG;AACzD,WAAO,4BAA4B,WAAW,MAAM;AAAA,EACtD;AAEA,QAAM,mBAAmB,gBAAgB,CAAC;AAC1C,MAAI,qBAAqB,OAAW,QAAO;AAC3C,WAAS,qBAAqB,GAAG,qBAAqB,aAAa,QAAQ,sBAAsB,GAAG;AAClG,QAAI,CAAC,6BAA6B,kBAAkB,aAAa,kBAAkB,CAAE,EAAG;AACxF,QAAI,eAAe,qBAAqB;AACxC,QAAI,oBAAoB;AACxB,QAAI,UAAU;AACd,aAAS,iBAAiB,GAAG,iBAAiB,gBAAgB,QAAQ,kBAAkB,GAAG;AACzF,YAAM,iBAAiB,gBAAgB,cAAc;AACrD,YAAM,cAAc,aAAa;AAAA,QAC/B,CAAC,aAAa,UACZ,SAAS,gBAAgB,6BAA6B,gBAAgB,WAAW;AAAA,MACrF;AACA,UAAI,gBAAgB,IAAI;AACtB,YAAI,wBAAyB;AAC7B,kBAAU;AACV;AAAA,MACF;AACA,0BAAoB;AACpB,YAAM,gBAAgB,gBAAgB,iBAAiB,CAAC;AACxD,YAAM,aAAa,aAAa,cAAc,CAAC;AAC/C,UACE,kBAAkB,UACf,eAAe,UACf,CAAC,2BACD,CAAC,6BAA6B,eAAe,UAAU,KACvD,CAAC,6BAA6B,UAAU,GAC3C;AACA,kBAAU;AACV;AAAA,MACF;AACA,qBAAe,cAAc;AAAA,IAC/B;AACA,QAAI,WAAW,kBAAmB,QAAO;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,uBAAuB,WAAmB,QAAyB;AAC1E,MAAI,CAAC,WAAW,KAAK,MAAM,KAAK,WAAW,KAAK,SAAS,EAAG,QAAO;AACnE,QAAM,kBAAkB,iCAAiC,SAAS;AAClE,SAAO,sBAAsB,CAAC,MAAM,GAAG,IAAI,EAAE,KAAK,CAAC,eAAe;AAChE,UAAM,mBAAmB,iCAAiC,UAAU;AACpE,WAAO,gBAAgB,WAAW,iBAAiB,UAC9C,gBAAgB;AAAA,MACjB,CAAC,OAAO,UAAU,6BAA6B,OAAO,iBAAiB,KAAK,CAAE;AAAA,IAChF;AAAA,EACJ,CAAC;AACH;AAEA,SAAS,mBACP,WACA,QACA,0BAA0B,MAC1B,oCAAoC,MAC5B;AACR,QAAM,mBAAmB,kCAAkC,WAAW,MAAM;AAC5E,MAAI,qBAAqB,KAAM,QAAO;AACtC,QAAM,kBAAkB,SAAS,SAAS;AAC1C,MAAI,gBAAgB,SAAS,EAAG,QAAO;AACvC,QAAM,eAAe,SAAS,MAAM;AACpC,QAAM,4BAA4B,uCAAuC,KAAK,SAAS;AACvF,MAAI,eAAe;AACnB,MAAI,6BAA6B;AACjC,aAAW,SAAS,iBAAiB;AACnC,QAAI,CAAC,GAAG,YAAY,EAAE,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC,GAAG;AAC7F,sBAAgB;AAAA,IAClB,WAAW,CAAC,6BAA6B,UAAU,YAAY,UAAU,WAAW;AAClF,mCAA6B;AAAA,IAC/B;AAAA,EACF;AACA,MACG,qCAAqC,CAAC,8BACpC,eAAe,+BACf,eAAe,gBAAgB,OAAO,wBACzC;AACA,WAAO;AAAA,EACT;AACA,MAAI,2BAA2B,CAAC,kCAAkC,WAAW,MAAM,EAAG,QAAO;AAC7F,SAAO,eAAe,gBAAgB;AACxC;AAEA,SAAS,iBAAiB,WAA6B;AACrD,SAAO,gBAAgB,SAAS,EAAE,QAAQ,CAAC,aACzC,WAAW,KAAK,QAAQ,IAAI,CAAC,QAAQ,IAAI,sBAAsB,CAAC,QAAQ,CAAC,CAAC;AAC9E;AAEA,SAAS,uBACP,WACA,QACA,6BAA6B,OACpB;AACT,MAAI,qBAAqB;AACzB,MAAI,wBAAwB;AAC5B,QAAM,YAAY,gBAAgB,MAAM;AACxC,WAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS,GAAG;AACxD,UAAM,WAAW,UAAU,KAAK;AAChC,QAAI,cAAc,QAAQ,GAAG;AAC3B,YAAM,oBAAoB,UAAU,QAAQ,CAAC;AAC7C,YAAM,cAAc,cAAc,QAAQ,EAAE,CAAC;AAC7C,YAAM,wBAAwB,sBAAsB,SAChD,yBAAyB,WAAW,iBAAiB,IACrD;AACJ,UACE,sBAAsB,UACnB,8BAA8B,iBAAiB,KAC/C,CAAC,uBAAuB,WAAW,iBAAiB,KACpD,mBAAmB,WAAW,iBAAiB,MAAM,MAErD,gBAAgB,SAAS,CAAC,yBACvB,gBAAgB,QAAQ,wBAE9B;AACA,eAAO;AAAA,MACT;AACA;AAAA,IACF;AACA,UAAM,eAAe,uBAAuB,QAAQ;AACpD,UAAM,qBAAqB,aAAa,WAAW,GAAG,uBAAuB,SAAS,CAAC,GAAG,KACrF,CAAC,SAAS,KAAK,EAAE,SAAS,GAAG;AAClC,QAAI,CAAC,8BAA8B,8BAA8B,QAAQ,KAAK,CAAC,oBAAoB;AACjG;AAAA,IACF;AACA,QAAI,uBAAuB,WAAW,QAAQ,EAAG;AACjD,UAAM,cAAc,uCAAuC,KAAK,SAAS,IACrE,CAAC,QAAQ,IACT,sBAAsB,CAAC,QAAQ,GAAG,IAAI;AAC1C,eAAW,cAAc,aAAa;AACpC,YAAM,iBAAiB,uBAAuB,UAAU;AACxD,UAAI,2BAA2B,WAAW,cAAc,GAAG;AACzD,YAAI,CAAC,yBAAyB,WAAW,UAAU,EAAG,QAAO;AAC7D,gCAAwB,KAAK,IAAI,uBAAuB,CAAC;AACzD;AAAA,MACF;AACA,YAAM,QAAQ;AAAA,QACZ;AAAA,QACA;AAAA,QACA,CAAC;AAAA,QACD,CAAC;AAAA,MACH;AACA,UAAI,UAAU,EAAG;AACjB,UAAI,yBAAyB,WAAW,UAAU,GAAG;AACnD,gCAAwB,KAAK,IAAI,uBAAuB,KAAK;AAAA,MAC/D,OAAO;AACL,6BAAqB,KAAK,IAAI,oBAAoB,KAAK;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AACA,SAAO,qBAAqB;AAC9B;AACA,SAAS,iBACP,WACA,QACA,6BAA6B,OACpB;AACT,QAAM,gBAAgB,uBAAuB,SAAS;AACtD,QAAM,aAAa,OAAO,UAAU,MAAM,EAAE,KAAK;AACjD,MAAI,cAAc,WAAW,KAAK,WAAW,WAAW,EAAG,QAAO;AAClE,QAAM,yBAAyB,gBAAgB,UAAU,EAAE,KAAK,CAAC,aAAa;AAC5E,UAAM,eAAe,uBAAuB,QAAQ;AACpD,UAAM,qBAAqB,aAAa,WAAW,GAAG,aAAa,GAAG,KACjE,CAAC,SAAS,KAAK,EAAE,SAAS,GAAG;AAClC,QAAI,CAAC,8BAA8B,8BAA8B,QAAQ,KAAK,CAAC,mBAAoB,QAAO;AAC1G,QAAI,uBAAuB,eAAe,YAAY,EAAG,QAAO;AAChE,WAAO,2BAA2B,eAAe,YAAY,KACxD,CAAC,yBAAyB,eAAe,YAAY;AAAA,EAC5D,CAAC;AACD,MAAI,uBAAwB,QAAO;AAEnC,QAAM,UAAU,iBAAiB,SAAS;AAC1C,MAAI,QAAQ,SAAS,GAAG;AACtB,WAAO,QAAQ,MAAM,CAAC,WACpB,uBAAuB,QAAQ,YAAY,0BAA0B,CAAC;AAAA,EAC1E;AACA,SAAO,uBAAuB,WAAW,YAAY,0BAA0B;AACjF;AAEA,SAAS,iCAAiC,MAAwB;AAChE,QAAM,aAAa,uBAAuB,IAAI,EAAE,QAAQ,WAAW,GAAG;AACtE,QAAM,SAAS,iBAAiB,UAAU,EACvC,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI,EACzD,IAAI,CAAC,EAAE,MAAM,MAAM,UAAU,OAAO,IAAI,CAAC;AAC5C,SAAO,OAAO,SAAS,KAAK,+BAA+B,IAAI,OAAO,CAAC,KAAK,EAAE,IAC1E,OAAO,MAAM,CAAC,IACd;AACN;AAEA,SAAS,qBAAqB,MAAc,QAAyB;AACnE,QAAM,aAAa,iCAAiC,IAAI;AACxD,SAAO,WAAW,SAAS,KAAK,gBAAgB,MAAM,EAAE,KAAK,CAAC,aAAa;AACzE,UAAM,iBAAiB,iBAAiB,QAAQ,EAC7C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI,EACzD,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,iBAAiB,CAAC;AAC5E,WAAO,kCAAkC,YAAY,cAAc;AAAA,EACrE,CAAC;AACH;AACA,SAAS,yBAAyB,MAAc,QAAwB;AACtE,QAAM,aAAa,iCAAiC,IAAI;AACxD,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO,gBAAgB,MAAM,EAC1B,OAAO,CAAC,aAAa;AACpB,UAAM,iBAAiB,iBAAiB,QAAQ,EAC7C,OAAO,CAAC,EAAE,MAAM,MAAM,oBAAoB,KAAK,MAAM,IAAI,EACzD,IAAI,CAAC,EAAE,OAAO,kBAAkB,MAAM,UAAU,OAAO,iBAAiB,CAAC;AAC5E,WAAO,kCAAkC,YAAY,cAAc;AAAA,EACrE,CAAC,EACA,KAAK,GAAG;AACb;AAEA,SAAS,2BAA2B,WAAmB,UAA2B;AAChF,QAAM,kBAAkB,iCAAiC,SAAS;AAClE,QAAM,eAAe,iCAAiC,QAAQ;AAC9D,QAAM,4BAA4B,8BAA8B;AAAA,KAC7D,gBAAgB,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,EAC3D,IACI,gBAAgB,MAAM,CAAC,IACvB;AACJ,MAAI,0BAA0B,SAAS,EAAG,QAAO;AACjD,QAAM,eAAe,0BAA0B,CAAC;AAChD,MACE,iBAAiB,UACd,CAAC,aAAa,KAAK,CAAC,gBAAgB,6BAA6B,cAAc,WAAW,CAAC,GAC9F;AACA,WAAO;AAAA,EACT;AACA,QAAM,2BAA2B,0BAA0B,MAAM,CAAC;AAClE,QAAM,wBAAwB,yBAAyB,OAAO,CAAC,UAC7D,aAAa,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC,CAAC;AACtF,QAAM,uBAAuB,KAAK,IAAI,GAAG,yBAAyB,MAAM;AACxE,SAAO,sBAAsB,UAAU;AACzC;AACA,SAAS,mBACP,WACA,iBACA,6BAA6B,OAC7B,0BAA0B,OACjB;AACT,SAAO,gBAAgB,eAAe,EAAE,KAAK,CAAC,aAAa;AACzD,QAAI,CAAC,8BAA8B,8BAA8B,QAAQ,EAAG,QAAO;AACnF,QAAI,uBAAuB,WAAW,QAAQ,EAAG,QAAO;AACxD,UAAM,cAAc,uCAAuC,KAAK,SAAS,IACrE,CAAC,QAAQ,IACT,sBAAsB,CAAC,QAAQ,GAAG,IAAI;AAC1C,WAAO,YAAY,KAAK,CAAC,eAAe;AACtC,YAAM,aAAa,2BAA2B,WAAW,UAAU,KAC9D,CAAC,yBAAyB,WAAW,UAAU;AACpD,UAAI,WAAY,QAAO;AACvB,UAAI,2BAA2B,CAAC,2BAA2B,WAAW,UAAU,EAAG,QAAO;AAC1F,aAAO,mBAAmB,WAAW,UAAU,IAAI,KAC9C,2BAA2B,WAAW,UAAU;AAAA,IACvD,CAAC;AAAA,EACH,CAAC;AACH;AAEA,SAAS,iBACP,WACA,QACA,iBACS;AACT,QAAM,0BAA0B,IAAI;AAAA,IAClC,gBAAgB,eAAe,EAC5B,OAAO,CAAC,aAAa;AACpB,YAAM,cAAc,cAAc,QAAQ,EAAE,CAAC;AAC7C,aAAO,gBAAgB,SAAS,gBAAgB;AAAA,IAClD,CAAC,EACA,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC;AAAA,EACvD;AACA,MAAI,wBAAwB,SAAS,EAAG,QAAO;AAC/C,QAAM,YAAY,gBAAgB,MAAM;AACxC,SAAO,UAAU,KAAK,CAAC,UAAU,UAAU;AACzC,UAAM,cAAc,cAAc,QAAQ,EAAE,CAAC;AAC7C,QAAI,gBAAgB,SAAS,gBAAgB,KAAM,QAAO;AAC1D,QAAI,CAAC,wBAAwB,IAAI,uBAAuB,QAAQ,CAAC,EAAG,QAAO;AAC3E,UAAM,oBAAoB,UAAU,QAAQ,CAAC;AAC7C,QACE,sBAAsB,UACnB,CAAC,8BAA8B,iBAAiB,KAChD,uBAAuB,WAAW,iBAAiB,KACnD,mBAAmB,WAAW,iBAAiB,MAAM,GACxD;AACA,aAAO;AAAA,IACT;AACA,UAAM,wBAAwB,yBAAyB,WAAW,iBAAiB;AACnF,WAAO,gBAAgB,QAAQ,CAAC,wBAAwB;AAAA,EAC1D,CAAC;AACH;AAEA,IAAM,gCAAgC,oBAAI,IAAI,CAAC,aAAa,MAAM,CAAC;AAEnE,SAAS,2BAA2B,WAAmB,QAAyB;AAC9E,QAAM,kBAAkB,uBAAuB,SAAS;AACxD,MAAI,CAAC,8BAA8B;AAAA,KAChC,gBAAgB,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,EAC3D,EAAG,QAAO;AACV,QAAM,cAAc,gBAAgB,MAAM,CAAC;AAC3C,MAAI,YAAY,WAAW,EAAG,QAAO;AAErC,SAAO,gBAAgB,MAAM,EAAE,KAAK,CAAC,aAAa;AAChD,QAAI,8BAA8B,QAAQ,EAAG,QAAO;AACpD,UAAM,eAAe,uBAAuB,QAAQ;AACpD,UAAM,uBAAuB,KAAK,IAAI,6BAA6B,YAAY,MAAM;AACrF,QAAI,cAAc;AAClB,QAAI,eAAe;AACnB,eAAW,cAAc,aAAa;AACpC,YAAM,gBAAgB,aAAa;AAAA,QACjC,CAAC,aAAa,UACZ,SAAS,eAAe,6BAA6B,YAAY,WAAW;AAAA,MAChF;AACA,UAAI,kBAAkB,GAAI;AAC1B,sBAAgB;AAChB,oBAAc,gBAAgB;AAAA,IAChC;AACA,WAAO,gBAAgB,wBAClB,CAAC,yBAAyB,WAAW,QAAQ;AAAA,EACpD,CAAC;AACH;AAUA,SAAS,wBACP,WACA,QACA,iBACA,sBACkB;AAClB,QAAM,iBAAiB,uBAAuB,SAAS,EAAE,CAAC,KAAK,IAC5D,QAAQ,oBAAoB,EAAE;AACjC,MAAI,CAAC,8BAA8B,IAAI,aAAa,GAAG;AACrD,WAAO,EAAE,QAAQ,iBAAiB,wBAAwB,MAAM;AAAA,EAClE;AACA,MAAI,yBAAyB,QAAW;AACtC,WAAO,EAAE,QAAQ,iBAAiB,wBAAwB,KAAK;AAAA,EACjE;AACA,QAAM,aAAa,kBAAkB,SACjC,qBAAqB,UACrB,qBAAqB;AACzB,MAAI,eAAe,QAAW;AAC5B,WAAO,EAAE,QAAQ,iBAAiB,wBAAwB,KAAK;AAAA,EACjE;AACA,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,iBAAiB;AAAA,IACjB,wBAAwB;AAAA,IACxB,gBAAgB;AAAA,IAChB,yBAAyB;AAAA,EAC3B;AACF;AAEA,SAAS,uBAAuB,WAAmB,SAA6C;AAC9F,MAAI;AAAA,IACF;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR;AAAA,IACA,QAAQ;AAAA,EACV,GAAG;AACD,WAAO;AAAA,EACT;AACA,MACE,QAAQ,mBAAmB,UACxB,CAAC;AAAA,KACD,uBAAuB,SAAS,EAAE,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,IAC3E,gBAAgB,QAAQ,cAAc,EAAE,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC;AAAA,EAC5F,EACA,QAAO;AACT,QAAM,kBAAoC;AAAA,IACxC,QAAQ,QAAQ;AAAA,IAChB,iBAAiB,QAAQ;AAAA,IACzB,wBAAwB;AAAA,EAC1B;AACA,SAAO;AAAA,IACL;AAAA,IACA,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB;AAAA,IACA,gBAAgB;AAAA,EAClB,IACI,kBACA;AACN;AAEA,SAAS,oBACP,WACA,QACA,iBACA,6BAA6B,OAC7B,yBAAyB,OAChB;AACT,QAAM,2BAA2B,8BAE7B,oBAAoB,UACjB,uBAAuB,eAAe,MAAM,uBAAuB,MAAM;AAEhF,QAAM,iBAAiB,iBAAiB,WAAW,QAAQ,wBAAwB;AACnF,QAAM,eAAe,0BAA0B,2BAA2B,WAAW,MAAM;AAC3F,QAAM,kBAAkB,uBAAuB,SAAS;AACxD,QAAM,0BAA0B,0BAC3B,8BAA8B;AAAA,KAC9B,gBAAgB,CAAC,KAAK,IAAI,QAAQ,oBAAoB,EAAE;AAAA,EAC3D;AACF,MAAI,2BAA2B,CAAC,aAAc,QAAO;AACrD,MAAI,CAAC,kBAAkB,CAAC,aAAc,QAAO;AAC7C,MAAI,oBAAoB,OAAW,QAAO;AAC1C,QAAM,UAAU,iBAAiB,SAAS;AAC1C,QAAM,0BAA0B,CAAC,8BAC5B,oBAAoB,UACpB,uBAAuB,eAAe,MAAM,uBAAuB,MAAM;AAC9E,SAAO,QAAQ,SAAS,MAEpB,QAAQ,MAAM,CAAC,WACb,mBAAmB,QAAQ,iBAAiB,4BAA4B,uBAAuB,CAAC,KAC/F,iBAAiB,WAAW,QAAQ,eAAe;AAE5D;AAEA,SAAS,uBACP,QACA,qBACQ;AACR,QAAM,YAAY,gBAAgB,MAAM;AACxC,QAAM,kBAAkB,oBAAI,IAAY;AACxC,aAAW,sBAAsB,qBAAqB;AACpD,UAAM,eAAe,UAAU,QAAQ,kBAAkB;AACzD,QAAI,eAAe,EAAG;AACtB,QAAI,WAAW;AACf,WACE,WAAW,UAAU,SAAS,KAC3B,UAAU,QAAQ,EAAG,QAAQ,EAAE,SAAS,GAAG,KAC3C,2CAA2C;AAAA,MAC5C,UAAU,WAAW,CAAC,EAAG,UAAU;AAAA,IACrC,GACA;AACA,kBAAY;AAAA,IACd;AACA,aAAS,QAAQ,cAAc,SAAS,UAAU,SAAS,GAAG;AAC5D,sBAAgB,IAAI,KAAK;AAAA,IAC3B;AAAA,EACF;AACA,SAAO,CAAC,GAAG,eAAe,EACvB,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK,EAClC,IAAI,CAAC,UAAU,UAAU,KAAK,CAAE,EAChC,KAAK,GAAG;AACb;AACA,SAAS,4BACP,MACA,QACA,mBACQ;AACR,MAAI,KAAK,aAAa,eAAe,KAAK,mBAAmB,OAAW,QAAO;AAC/E,QAAM,yBAAyB,IAAI;AAAA,IACjC,gBAAgB,iBAAiB,EAAE,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC;AAAA,EACvF;AACA,QAAM,sBAAsB,KAAK,eAAe;AAAA,IAAO,CAAC,SACtD,oBAAoB,KAAK,QAAQ,mBAAmB,QAAW,KAAK;AAAA,EACtE;AACA,MAAI,oBAAoB,WAAW,EAAG,QAAO;AAC7C,SAAO,gBAAgB,MAAM,EAC1B,OAAO,CAAC,aAAa;AACpB,QAAI,uBAAuB,IAAI,uBAAuB,QAAQ,CAAC,EAAG,QAAO;AACzE,UAAM,iBAAiB,SAAS,QAAQ;AACxC,WAAO,oBAAoB;AAAA,MAAK,CAAC,SAC/B,CAAC,GAAG,SAAS,KAAK,MAAM,CAAC,EAAE;AAAA,QAAK,CAAC,UAC/B,CAAC,GAAG,cAAc,EAAE,KAAK,CAAC,gBAAgB,6BAA6B,OAAO,WAAW,CAAC;AAAA,MAC5F;AAAA,IACF;AAAA,EACF,CAAC,EACA,KAAK,GAAG;AACb;AACA,SAAS,mBACP,MACA,QACA,iBACA,sBACA,qBACA,WAAoC,OACW;AAK/C,QAAM,QAAQ,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ;AAC5D,QAAM,qBAAqB,MAAM,SAAS,KAAK,KAAK,QAAQ,SAAS,KAAK,KAAK,KAAK,YAAY,QAC5F,KAAK,QAAQ,MAAM,GAAG,KAAK,QAAQ,SAAS,MAAM,MAAM,IACxD;AACJ,QAAM,gBACJ,aAAa,QACV,MAAM,KAAK,EAAE,SAAS,MACrB,mBAAmB,SAAS,IAAI,KAAK,WAAW,KAAK,kBAAkB,KACvE,QACA;AACN,QAAM,iBAAiB;AAAA,IACrB,KAAK;AAAA,IACL,wBAAwB,KAAK,SAAS,QAAQ,iBAAiB,oBAAoB;AAAA,EACrF;AACA,MAAI,cAAc,KAAK;AACvB,MAAI,cAAc;AAClB,MACE,CAAC;AAAA,IACC,KAAK;AAAA,IACL,eAAe;AAAA,IACf,eAAe;AAAA,IACf;AAAA,IACA,eAAe;AAAA,EACjB,GACA;AACA,QAAI,kBAAkB,OAAW,QAAO;AACxC,kBAAc;AACd,kBAAc;AAAA,MACZ;AAAA,MACA,wBAAwB,aAAa,QAAQ,iBAAiB,oBAAoB;AAAA,IACpF;AACA,QAAI,CAAC;AAAA,MACH;AAAA,MACA,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ;AAAA,MACA,YAAY;AAAA,IACd,EAAG,QAAO;AAAA,EACZ;AACA,QAAM,gBAAgB,KAAK;AAC3B,QAAM,wBAAwB,kBAAkB,SAC5C,SACA,sBAAsB,aAAa,KAAK;AAC5C,QAAM,0BAA0B,gBAAgB,YAAY,mBAAmB,YAAY,MAAM,EAAE;AAAA,IACjG,CAAC,aACD;AAAA,MACE;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,IACd;AAAA,EACF;AACA,QAAM,uBAAuB,kBAAkB,SAC3C,wBAAwB,CAAC,IACzB,wBAAwB;AAAA,IAAK,CAAC,aAC9B;AAAA,MACE,yBAAyB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,IACd;AAAA,EACF,KAAK,wBAAwB,CAAC;AAChC,QAAM,kBAAkB,wBAAwB,YAAY;AAC5D,QAAM,2BAA2B,yBAAyB,SACtD,YAAY,kBACZ;AAEJ,QAAM,oBAAoB;AAAA,IACxB,YAAY,mBAAmB,YAAY;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,qBAAqB,KAAK,uBAC5B,OAAO;AAAA,IACP,OAAO,QAAQ,KAAK,oBAAoB,EACrC;AAAA,MAAO,CAAC,CAAC,KAAK,KAAK,MAClB;AAAA,QACE,GAAG,GAAG,KAAK,KAAK;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF;AAAA,EACJ,IACE;AACJ,QAAM,2BAA2B;AAAA,IAC/B;AAAA,IACA,YAAY,mBAAmB,YAAY;AAAA,IAC3C;AAAA,EACF;AACA,QAAM,yBAAyB,KAAK,iBAChC,KAAK,eAAe,QAAQ,CAAC,SAAS;AACtC,QAAI,CAAC,oBAAoB,KAAK,QAAQ,0BAA0B,QAAW,KAAK,EAAG,QAAO,CAAC;AAC3F,UAAM,kBAAkB,KAAK,mBACxB,oBAAoB,KAAK,iBAAiB,0BAA0B,QAAW,KAAK,IACrF,KAAK,kBACL;AACJ,UAAM,WAAW,KAAK,YACjB,oBAAoB,KAAK,SAAS,WAAW,0BAA0B,QAAW,KAAK,IACxF,KAAK,WACL;AACJ,UAAM;AAAA,MACJ,iBAAiB;AAAA,MACjB,UAAU;AAAA,MACV,GAAG;AAAA,IACL,IAAI;AACJ,WAAO,CAAC;AAAA,MACN,GAAG;AAAA,MACH,GAAI,oBAAoB,SAAY,EAAE,gBAAgB,IAAI,CAAC;AAAA,MAC3D,GAAI,aAAa,SAAY,EAAE,SAAS,IAAI,CAAC;AAAA,IAC/C,CAAC;AAAA,EACH,CAAC,IACC;AACJ,QAAM,yBAAyB,KAAK,kBAC/B,KAAK,eAAe,MAAM,SAAS,KACnC;AAAA,IACD,KAAK,eAAe;AAAA,IACpB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ;AAAA,IACA,YAAY;AAAA,EACd,KACG,KAAK,eAAe,MAAM;AAAA,IAAM,CAAC,SAClC;AAAA,MACE,KAAK;AAAA,MACL,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ;AAAA,MACA,YAAY;AAAA,IACd;AAAA,EACF,IACE;AAAA,IACA,OAAO,KAAK,eAAe;AAAA,IAC3B,aAAa,KAAK,eAAe;AAAA,IACjC,GAAI,KAAK,eAAe,mBACnB;AAAA,MACD,KAAK,eAAe;AAAA,MACpB,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ;AAAA,MACA,YAAY;AAAA,IACd,IACE,EAAE,iBAAiB,KAAK,eAAe,gBAAgB,IACvD,CAAC;AAAA,EACP,IACE;AACJ,QAAM,oBAAoB,yBACrB,oBAAoB,uBAAuB,iBAAiB,wBAAwB,IACrF,gBACA;AACJ,QAAM,oBAAoB,KAAK,cAAc,UACxC,qBAAqB,KAAK,WAAW,iBAAiB,IACvD,KAAK,YACL;AACJ,QAAM;AAAA,IACJ,WAAW;AAAA,IACX,sBAAsB;AAAA,IACtB,gBAAgB;AAAA,IAChB,gBAAgB;AAAA,IAChB,WAAW;AAAA,IACX,GAAG;AAAA,EACL,IAAI;AACJ,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAI,sBAAsB,SAAY,EAAE,WAAW,kBAAkB,IAAI,CAAC;AAAA,IAC1E,GAAI,sBAAsB,OAAO,KAAK,kBAAkB,EAAE,SAAS,IAC/D,EAAE,sBAAsB,mBAAmB,IAC3C,CAAC;AAAA,IACL,GAAI,0BAA0B,uBAAuB,SAAS,IAC1D,EAAE,gBAAgB,uBAAuB,IACzC,CAAC;AAAA,IACL,GAAI,2BAA2B,SAAY,EAAE,gBAAgB,uBAAuB,IAAI,CAAC;AAAA,IACzF,GAAI,sBAAsB,SAAY,EAAE,WAAW,kBAAkB,IAAI,CAAC;AAAA,EAC5E;AACF;AAEA,SAAS,qBACP,QACA,QACA,iBACkD;AAClD,MAAI,CAAC,qBAAqB,OAAO,MAAM,MAAM,EAAG,QAAO;AACvD,QAAM,eAAe,yBAAyB,OAAO,MAAM,MAAM;AACjE,QAAM,wBAAwB,oBAAoB,SAC9C,SACA,yBAAyB,OAAO,MAAM,eAAe;AACzD,QAAM,QAAQ,OAAO,MAAM;AAAA,IAAO,CAAC,SACjC,oBAAoB,MAAM,cAAc,qBAAqB;AAAA,EAC/D;AACA,QAAM,qBAAqB,OAAO,oBAC9B,QAAQ,CAAC,YAAY;AACrB,UAAM,gBAAgB,QAAQ,MAAM;AAAA,MAAO,CAAC,SAC1C,oBAAoB,MAAM,cAAc,qBAAqB;AAAA,IAC/D;AACA,WAAO,cAAc,SAAS,IAC1B,CAAC,EAAE,GAAG,SAAS,OAAO,cAAc,CAAC,IACrC,CAAC;AAAA,EACP,CAAC;AACH,MAAI,MAAM,WAAW,MAAM,uBAAuB,UAAa,mBAAmB,WAAW,IAAI;AAC/F,WAAO;AAAA,EACT;AACA,QAAM,EAAE,oBAAoB,qBAAqB,GAAG,sBAAsB,IAAI;AAC9E,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA,GAAI,sBAAsB,mBAAmB,SAAS,IAAI,EAAE,mBAAmB,IAAI,CAAC;AAAA,EACtF;AACF;AAEA,SAAS,2BAA2B,MAAsB;AACxD,SAAO,iCAAiC,IAAI,EAAE,KAAK,GAAG;AACxD;AAEA,SAAS,uBACP,cACA,QACA,iBACS;AACT,QAAM,aAAa,2BAA2B,aAAa,MAAM;AACjE,QAAM,aAAa,2BAA2B,aAAa,MAAM;AACjE,QAAM,cAAc,SAAS,aAAa,KAAK;AAC/C,MAAI,WAAW,WAAW,KAAK,WAAW,WAAW,KAAK,YAAY,SAAS,EAAG,QAAO;AACzF,QAAM,eAAe,GAAG,UAAU,IAAI,aAAa,KAAK,IAAI,UAAU;AACtE,QAAM,wBAAwB,gBAAgB,MAAM,EAAE,KAAK,CAAC,aAAa;AACvE,QAAI,8BAA8B,QAAQ,EAAG,QAAO;AACpD,WAAO,mBAAmB,cAAc,QAAQ,MAAM,KACjD,CAAC,yBAAyB,cAAc,QAAQ;AAAA,EACvD,CAAC;AACD,SAAO,yBACF,oBAAoB,cAAc,QAAQ,eAAe;AAChE;AACA,IAAM,2BAA2B,oBAAI,IAAI;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AACD,IAAM,mCAAmC;AACzC,IAAM,sCAAsC,IAAI;AAAA,EAC9C;AAAA,EAEA;AACF;AAEA,SAAS,eAAe,UAA2B;AACjD,SAAO,iDAAiD,KAAK,SAAS,KAAK,CAAC;AAC9E;AACA,SAAS,cAAc,UAA2B;AAChD,SAAO,WAAW,KAAK,SAAS,KAAK,CAAC;AACxC;AAEA,SAAS,wBAAwB,UAAkB,UAA2B;AAC5E,MAAI,CAAC,cAAc,QAAQ,EAAG,QAAO;AACrC,SAAO,kFAAkF;AAAA,IACvF;AAAA,EACF;AACF;AAEA,SAAS,0BAA0B,UAAkB,UAA2B;AAC9E,MAAI,CAAC,eAAe,QAAQ,EAAG,QAAO;AACtC,SAAO,iBAAiB,QAAQ,EAAE;AAAA,IAAK,CAAC,EAAE,MAAM,MAC9C,yBAAyB,IAAI,KAAK,KAAK,oBAAoB,KAAK,KAAK;AAAA,EACvE,KACK,iCAAiC,KAAK,QAAQ,KAC9C,oCAAoC,KAAK,QAAQ;AACxD;AAGA,SAAS,wBAAwB,UAA2B;AAC1D,SAAO,uIACJ,KAAK,QAAQ;AAClB;AAEA,SAAS,cAAc,UAA2B;AAChD,SAAO,uHACJ,KAAK,SAAS,KAAK,CAAC;AACzB;AAEA,IAAM,uCAAuC,IAAI;AAAA,EAC/C;AAAA,EAGA;AACF;AAEA,SAAS,yBAAyB,UAAkB,UAA2B;AAC7E,QAAM,qBAAqB,SAAS,KAAK;AACzC,QAAM,sBAAsB,qCAAqC,KAAK,kBAAkB;AACxF,QAAM,eAAe,iCAAiC,QAAQ;AAC9D,MAAI,wBAAwB,MAAM;AAChC,UAAM,sBAAsB,iBAAiB,oBAAoB,CAAC,KAAK,EAAE;AACzE,UAAM,iBAAiB,oBAAoB,UAAU,CAAC,EAAE,YAAY,MAAM,WAAW;AACrF,QAAI,iBAAiB,EAAG,QAAO;AAC/B,UAAM,gBAAgB;AAAA,MACpB,oBAAoB,MAAM,GAAG,cAAc,EAAE,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AAAA,IACrF;AACA,UAAMA,mBAAkB;AAAA,MACtB,oBAAoB,MAAM,cAAc,EAAE,IAAI,CAAC,EAAE,QAAQ,MAAM,OAAO,EAAE,KAAK,GAAG;AAAA,IAClF;AACA,QAAI,cAAc,WAAW,KAAKA,iBAAgB,WAAW,EAAG,QAAO;AACvE,QAAIC,eAAc;AAClB,eAAW,SAAS,CAAC,GAAG,eAAe,GAAGD,gBAAe,GAAG;AAC1D,YAAM,eAAe,aAAa;AAAA,QAChC,CAAC,aAAa,UACZ,SAASC,gBAAe,6BAA6B,OAAO,WAAW;AAAA,MAC3E;AACA,UAAI,iBAAiB,GAAI,QAAO;AAChC,MAAAA,eAAc,eAAe;AAAA,IAC/B;AACA,WAAO;AAAA,EACT;AAEA,QAAM,uBAAuB,0CAA0C,KAAK,kBAAkB;AAC9F,MAAI,yBAAyB,KAAM,QAAO;AAC1C,QAAM,kBAAkB,uBAAuB,qBAAqB,CAAC,KAAK,EAAE;AAC5E,QAAM,eAAe,uBAAuB,qBAAqB,CAAC,KAAK,EAAE;AACzE,MAAI,gBAAgB,WAAW,KAAK,aAAa,WAAW,EAAG,QAAO;AACtE,QAAM,iBAAiB,aAAa,UAAU,CAAC,gBAC7C,6BAA6B,gBAAgB,CAAC,GAAI,WAAW,CAAC;AAChE,MAAI,mBAAmB,GAAI,QAAO;AAClC,MAAI,cAAc,iBAAiB,gBAAgB;AACnD,aAAW,eAAe,cAAc;AACtC,UAAM,cAAc,aAAa;AAAA,MAC/B,CAAC,aAAa,UACZ,SAAS,eAAe,6BAA6B,aAAa,WAAW;AAAA,IACjF;AACA,QAAI,gBAAgB,GAAI,QAAO;AAC/B,kBAAc,cAAc;AAAA,EAC9B;AACA,SAAO;AACT;AAEA,SAAS,2BACP,UACA,QACA,iBACS;AACT,QAAM,iBAAiB,SAAS,QAAQ;AACxC,MAAI,eAAe,SAAS,EAAG,QAAO;AACtC,QAAM,kBAAkB,mFACrB,KAAK,SAAS,KAAK,CAAC;AACvB,QAAM,oBAAoB,IAAI,IAAI,gBAAgB,mBAAmB,MAAM,EAAE,IAAI,CAAC,aAAa,uBAAuB,QAAQ,CAAC,CAAC;AAChI,QAAM,YAAY,gBAAgB,MAAM;AACxC,SAAO,UAAU,KAAK,CAAC,UAAU,UAAU;AACzC,QAAI,CAAC,kBAAkB,IAAI,uBAAuB,QAAQ,CAAC,EAAG,QAAO;AACrE,QAAI,8BAA8B,QAAQ,EAAG,QAAO;AACpD,QAAI,cAAc,QAAQ,GAAG;AAC3B,YAAM,oBAAoB,UAAU,QAAQ,CAAC;AAC7C,aAAO,sBAAsB,UACxB,8BAA8B,iBAAiB,KAC/C,mBAAmB,UAAU,iBAAiB,MAAM;AAAA,IAC3D;AACA,QAAI,wBAAwB,QAAQ,EAAG,QAAO;AAC9C,UAAM,QAAQ,mBAAmB,UAAU,UAAU,KAAK;AAC1D,QAAI,UAAU,EAAG,QAAO;AACxB,UAAM,iBAAiB,SAAS,QAAQ;AACxC,UAAM,iBAAiB,CAAC,GAAG,cAAc,EAAE,KAAK,CAAC,UAAU,CAAC,eAAe,IAAI,KAAK,CAAC;AACrF,YAAQ,mBAAmB,mBACtB,0BAA0B,UAAU,QAAQ,KAC5C,wBAAwB,UAAU,QAAQ,KAC1C,yBAAyB,UAAU,QAAQ;AAAA,EAClD,CAAC;AACH;AAEA,SAAS,eACP,UACA,QACA,iBACmD;AACnD,MAAI,2BAA2B,SAAS,UAAU,QAAQ,eAAe,EAAG,QAAO;AACnF,MAAI,CAAC,oBAAoB,SAAS,UAAU,QAAQ,iBAAiB,IAAI,EAAG,QAAO;AACnF,QAAM,oBAAoB,SAAS,QAAQ,KAAK;AAChD,MACE,kBAAkB,SAAS,KACxB,CAAC,oBAAoB,mBAAmB,mBAAmB,QAAQ,QAAW,KAAK,GACtF;AACA,WAAO,EAAE,GAAG,UAAU,SAAS,GAAG;AAAA,EACpC;AACA,SAAO;AACT;AAEA,SAAS,wBACP,WACA,QACA,iBACA,sBACS;AACT,QAAM,UAAU;AAAA,IACd;AAAA,IACA,wBAAwB,WAAW,QAAQ,iBAAiB,oBAAoB;AAAA,EAClF;AACA,SAAO;AAAA,IACL;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR;AAAA,IACA,QAAQ;AAAA,EACV;AACF;AAEO,SAAS,+BACd,QACA,QACA,iBACA,sBACA,qBACA,WAAoC,OAClB;AAClB,MAAI,OAAO,KAAK,EAAE,WAAW,GAAG;AAC9B,WAAO;AAAA,MACL,GAAG;AAAA,MACH,OAAO,CAAC;AAAA,MACR,gBAAgB,CAAC;AAAA,MACjB,UAAU,CAAC;AAAA,MACX,WAAW,CAAC;AAAA,MACZ,GAAI,OAAO,kBAAkB,SAAY,EAAE,eAAe,CAAC,EAAE,IAAI,CAAC;AAAA,MAClE,oBAAoB;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,QAAQ,OAAO,MAAM,QAAQ,CAAC,SAAS;AAC3C,UAAM,WAAW;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO,aAAa,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,EAChD,CAAC;AACD,QAAM,iBAAiB,OAAO,eAAe;AAAA,IAAO,CAAC,WACnD,wBAAwB,QAAQ,QAAQ,iBAAiB,oBAAoB;AAAA,EAC/E;AACA,QAAM,WAAW,OAAO,SAAS,QAAQ,CAAC,WAAW;AACnD,UAAM,WAAW,qBAAqB,QAAQ,QAAQ,eAAe;AACrE,WAAO,aAAa,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,EAChD,CAAC;AACD,QAAM,YAAY,OAAO,UAAU,QAAQ,CAAC,aAAa;AACvD,UAAM,WAAW,eAAe,UAAU,QAAQ,eAAe;AACjE,WAAO,aAAa,SAAY,CAAC,IAAI,CAAC,QAAQ;AAAA,EAChD,CAAC;AACD,QAAM,gBAAgB,OAAO,eAAe;AAAA,IAAO,CAAC,iBAClD,uBAAuB,cAAc,QAAQ,eAAe;AAAA,EAC9D;AACA,QAAM,qBAAqB,OAAO,sBAC7B;AAAA,IACD,OAAO;AAAA,IACP;AAAA,IACA;AAAA,IACA;AAAA,EACF,IACE,OAAO,qBACP;AAEJ,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,GAAI,OAAO,kBAAkB,SAAY,EAAE,cAAc,IAAI,CAAC;AAAA,IAC9D,GAAI,uBAAuB,SAAY,EAAE,mBAAmB,IAAI,EAAE,oBAAoB,OAAU;AAAA,EAClG;AACF;","names":["predicateTokens","sourceIndex"]}

package/dist/chunk-6MINUTGJ.js

@@ -1,64 +0,0 @@
-// src/converge-config.ts
-var CONVERGE_CONFLICT_POLICIES = [
-  "newest-wins",
-  "manual"
-];
-var DEFAULT_CONVERGE_CONFLICT_POLICY = "newest-wins";
-var DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS = 3e4;
-var MAX_CONVERGE_PEER_REQUEST_TIMEOUT_MS = 36e5;
-function normalizeConvergePeerRequestTimeoutMs(value, label) {
-  if (typeof value !== "number" || !Number.isInteger(value) || value <= 0) {
-    throw new Error(`${label} must be a positive integer number of milliseconds; got ${JSON.stringify(value)}`);
-  }
-  return Math.min(value, MAX_CONVERGE_PEER_REQUEST_TIMEOUT_MS);
-}
-function envConvergePeerRequestTimeoutMs() {
-  const raw = process.env.REMNIC_CONVERGE_PEER_TIMEOUT_MS;
-  if (raw === void 0 || raw.trim() === "") return DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS;
-  return normalizeConvergePeerRequestTimeoutMs(Number(raw), "REMNIC_CONVERGE_PEER_TIMEOUT_MS");
-}
-function parsePeerRequestTimeoutMs(value, label) {
-  if (value === void 0) return DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS;
-  return normalizeConvergePeerRequestTimeoutMs(value, label);
-}
-function parseConvergeConfig(block) {
-  if (block === void 0) {
-    return { conflictPolicy: DEFAULT_CONVERGE_CONFLICT_POLICY };
-  }
-  if (block === null || typeof block !== "object" || Array.isArray(block)) {
-    throw new Error("converge must be a plain object");
-  }
-  const prototype = Object.getPrototypeOf(block);
-  if (prototype !== Object.prototype && prototype !== null) {
-    throw new Error("converge must be a plain object");
-  }
-  const { conflictPolicy: rawConflictPolicy, peerRequestTimeoutMs, ...unknown } = block;
-  let conflictPolicy = rawConflictPolicy;
-  const unknownKey = Object.keys(unknown)[0];
-  if (unknownKey !== void 0) {
-    throw new Error(`converge contains unknown key ${JSON.stringify(unknownKey)}`);
-  }
-  if (conflictPolicy === void 0) {
-    conflictPolicy = DEFAULT_CONVERGE_CONFLICT_POLICY;
-  }
-  if (typeof conflictPolicy === "string" && CONVERGE_CONFLICT_POLICIES.includes(conflictPolicy)) {
-    return {
-      conflictPolicy,
-      ...peerRequestTimeoutMs !== void 0 ? { peerRequestTimeoutMs: parsePeerRequestTimeoutMs(peerRequestTimeoutMs, "converge.peerRequestTimeoutMs") } : {}
-    };
-  }
-  throw new Error(
-    `converge.conflictPolicy must be one of ${CONVERGE_CONFLICT_POLICIES.join(", ")}; got ${JSON.stringify(conflictPolicy)}`
-  );
-}
-
-export {
-  CONVERGE_CONFLICT_POLICIES,
-  DEFAULT_CONVERGE_CONFLICT_POLICY,
-  DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS,
-  MAX_CONVERGE_PEER_REQUEST_TIMEOUT_MS,
-  normalizeConvergePeerRequestTimeoutMs,
-  envConvergePeerRequestTimeoutMs,
-  parseConvergeConfig
-};
-//# sourceMappingURL=chunk-6MINUTGJ.js.map

package/dist/chunk-6MINUTGJ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/converge-config.ts"],"sourcesContent":["import type { ConvergeConfig, ConvergeConflictPolicy } from \"./types.js\";\n\nexport const CONVERGE_CONFLICT_POLICIES = [\n  \"newest-wins\",\n  \"manual\",\n] as const satisfies readonly ConvergeConflictPolicy[];\n\nexport const DEFAULT_CONVERGE_CONFLICT_POLICY: ConvergeConflictPolicy = \"newest-wins\";\n\n/** Default per-request peer HTTP timeout. Boot-scale corpora (100k+ files in one\n *  namespace) can take well over 30s to serve a manifest snapshot. */\nexport const DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS = 30_000;\n/** Ceiling for the configured timeout — a peer that has not answered in an hour\n *  is unreachable, not slow. */\nexport const MAX_CONVERGE_PEER_REQUEST_TIMEOUT_MS = 3_600_000;\n/**\n * ONE normalization policy for every override source (config JSON, env, CLI\n * flag, programmatic options): malformed values are rejected, valid values\n * clamped to the one-hour ceiling. Returns the clamped ms value.\n */\nexport function normalizeConvergePeerRequestTimeoutMs(value: unknown, label: string): number {\n  if (typeof value !== \"number\" || !Number.isInteger(value) || value <= 0) {\n    throw new Error(`${label} must be a positive integer number of milliseconds; got ${JSON.stringify(value)}`);\n  }\n  return Math.min(value, MAX_CONVERGE_PEER_REQUEST_TIMEOUT_MS);\n}\n\n/** Env override, evaluated lazily so tests control time. Junk is rejected. */\nexport function envConvergePeerRequestTimeoutMs(): number {\n  const raw = process.env.REMNIC_CONVERGE_PEER_TIMEOUT_MS;\n  if (raw === undefined || raw.trim() === \"\") return DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS;\n  return normalizeConvergePeerRequestTimeoutMs(Number(raw), \"REMNIC_CONVERGE_PEER_TIMEOUT_MS\");\n}\n\n/** Config-block value: absent -> default, present -> normalized. */\nfunction parsePeerRequestTimeoutMs(value: unknown, label: string): number {\n  if (value === undefined) return DEFAULT_CONVERGE_PEER_REQUEST_TIMEOUT_MS;\n  return normalizeConvergePeerRequestTimeoutMs(value, label);\n}\n\nexport function parseConvergeConfig(block: unknown): ConvergeConfig {\n  if (block === undefined) {\n    return { conflictPolicy: DEFAULT_CONVERGE_CONFLICT_POLICY };\n  }\n  if (block === null || typeof block !== \"object\" || Array.isArray(block)) {\n    throw new Error(\"converge must be a plain object\");\n  }\n  const prototype = Object.getPrototypeOf(block);\n  if (prototype !== Object.prototype && prototype !== null) {\n    throw new Error(\"converge must be a plain object\");\n  }\n  const { conflictPolicy: rawConflictPolicy, peerRequestTimeoutMs, ...unknown } = block as Record<string, unknown>;\n  let conflictPolicy: unknown = rawConflictPolicy;\n  const unknownKey = Object.keys(unknown)[0];\n  if (unknownKey !== undefined) {\n    throw new Error(`converge contains unknown key ${JSON.stringify(unknownKey)}`);\n  }\n  if (conflictPolicy === undefined) {\n    conflictPolicy = DEFAULT_CONVERGE_CONFLICT_POLICY;\n  }\n  if (\n    typeof conflictPolicy === \"string\" &&\n    CONVERGE_CONFLICT_POLICIES.includes(conflictPolicy as ConvergeConflictPolicy)\n  ) {\n    return {\n      conflictPolicy: conflictPolicy as ConvergeConflictPolicy,\n      ...(peerRequestTimeoutMs !== undefined\n        ? { peerRequestTimeoutMs: parsePeerRequestTimeoutMs(peerRequestTimeoutMs, \"converge.peerRequestTimeoutMs\") }\n        : {}),\n    };\n  }\n\n  throw new Error(\n    `converge.conflictPolicy must be one of ${CONVERGE_CONFLICT_POLICIES.join(\", \")}; got ${JSON.stringify(conflictPolicy)}`\n  );\n}\n"],"mappings":";AAEO,IAAM,6BAA6B;AAAA,EACxC;AAAA,EACA;AACF;AAEO,IAAM,mCAA2D;AAIjE,IAAM,2CAA2C;AAGjD,IAAM,uCAAuC;AAM7C,SAAS,sCAAsC,OAAgB,OAAuB;AAC3F,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,UAAU,KAAK,KAAK,SAAS,GAAG;AACvE,UAAM,IAAI,MAAM,GAAG,KAAK,2DAA2D,KAAK,UAAU,KAAK,CAAC,EAAE;AAAA,EAC5G;AACA,SAAO,KAAK,IAAI,OAAO,oCAAoC;AAC7D;AAGO,SAAS,kCAA0C;AACxD,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,QAAQ,UAAa,IAAI,KAAK,MAAM,GAAI,QAAO;AACnD,SAAO,sCAAsC,OAAO,GAAG,GAAG,iCAAiC;AAC7F;AAGA,SAAS,0BAA0B,OAAgB,OAAuB;AACxE,MAAI,UAAU,OAAW,QAAO;AAChC,SAAO,sCAAsC,OAAO,KAAK;AAC3D;AAEO,SAAS,oBAAoB,OAAgC;AAClE,MAAI,UAAU,QAAW;AACvB,WAAO,EAAE,gBAAgB,iCAAiC;AAAA,EAC5D;AACA,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI,MAAM,iCAAiC;AAAA,EACnD;AACA,QAAM,YAAY,OAAO,eAAe,KAAK;AAC7C,MAAI,cAAc,OAAO,aAAa,cAAc,MAAM;AACxD,UAAM,IAAI,MAAM,iCAAiC;AAAA,EACnD;AACA,QAAM,EAAE,gBAAgB,mBAAmB,sBAAsB,GAAG,QAAQ,IAAI;AAChF,MAAI,iBAA0B;AAC9B,QAAM,aAAa,OAAO,KAAK,OAAO,EAAE,CAAC;AACzC,MAAI,eAAe,QAAW;AAC5B,UAAM,IAAI,MAAM,iCAAiC,KAAK,UAAU,UAAU,CAAC,EAAE;AAAA,EAC/E;AACA,MAAI,mBAAmB,QAAW;AAChC,qBAAiB;AAAA,EACnB;AACA,MACE,OAAO,mBAAmB,YAC1B,2BAA2B,SAAS,cAAwC,GAC5E;AACA,WAAO;AAAA,MACL;AAAA,MACA,GAAI,yBAAyB,SACzB,EAAE,sBAAsB,0BAA0B,sBAAsB,+BAA+B,EAAE,IACzG,CAAC;AAAA,IACP;AAAA,EACF;AAEA,QAAM,IAAI;AAAA,IACR,0CAA0C,2BAA2B,KAAK,IAAI,CAAC,SAAS,KAAK,UAAU,cAAc,CAAC;AAAA,EACxH;AACF;","names":[]}

package/dist/chunk-7LEQREP2.js

@@ -1,9 +0,0 @@
-// src/utils/sleep.ts
-function sleep(ms) {
-  return new Promise((resolve) => setTimeout(resolve, ms));
-}
-
-export {
-  sleep
-};
-//# sourceMappingURL=chunk-7LEQREP2.js.map

package/dist/chunk-7LEQREP2.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/utils/sleep.ts"],"sourcesContent":["/** Wait without cancellation; keep the timer referenced so awaited polling can finish. */\nexport function sleep(ms: number): Promise<void> {\n  // Constructor form keeps this reachable utility compatible with ES2022 adapter type graphs.\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n"],"mappings":";AACO,SAAS,MAAM,IAA2B;AAE/C,SAAO,IAAI,QAAQ,CAAC,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;","names":[]}