@qntx/nostr 0.6.0 → 0.8.0

package/dist/pool-vlw74C4t.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool-vlw74C4t.mjs","names":[],"sources":["../src/relay/url.ts","../src/relay/fan-in.ts","../src/relay/pool.ts"],"sourcesContent":["import { normalizeURL } from \"../core/util.ts\";\n\n/**\n * {@link normalizeURL}, or the raw string when it is not a valid relay URL (ensureRelay then fails\n * it like a dead relay).\n */\nexport function relayUrlKey(url: string): string {\n  try {\n    return normalizeURL(url);\n  } catch {\n    return url;\n  }\n}\n\n/** Unique relay keys in first-seen order. */\nexport function uniqueRelayUrls(urls: Iterable<string>): string[] {\n  const seen = new Set<string>();\n  const unique: string[] = [];\n  for (const url of urls) {\n    const key = relayUrlKey(url);\n    if (seen.has(key)) {\n      continue;\n    }\n    seen.add(key);\n    unique.push(key);\n  }\n  return unique;\n}\n\n/**\n * True for `ws:` / `http:` URLs that are not `.onion`. Local-network `ws://` is still insecure;\n * allow those via a trusted set.\n */\nexport function isInsecureRelayUrl(url: string): boolean {\n  try {\n    const parsed = new URL(url);\n    if (parsed.hostname.endsWith(\".onion\")) {\n      return false;\n    }\n    return parsed.protocol === \"ws:\" || parsed.protocol === \"http:\";\n  } catch {\n    return false;\n  }\n}\n","import { abortReason, onAbort, throwIfAborted } from \"../core/abort.ts\";\nimport type { Event } from \"../core/event.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { invokeSafely } from \"../core/report.ts\";\nimport { RelayClosedError } from \"./error.ts\";\nimport type { Pool } from \"./pool.ts\";\nimport type { Relay } from \"./relay.ts\";\nimport type { Closer } from \"./subscription.ts\";\nimport { uniqueRelayUrls } from \"./url.ts\";\n\nexport type RoutedJob = {\n  urls: ReadonlyArray<string>;\n  filters: ReadonlyArray<Filter>;\n  id?: string | undefined;\n};\n\nexport type FanInOptions = {\n  /** First receipt only (deduped across jobs). `relayUrl` is the normalized relay URL. */\n  onevent?: ((event: Event, relayUrl: string) => void) | undefined;\n  oneose?: (() => void) | undefined;\n  onclose?: ((reason: string) => void) | undefined;\n  signal?: AbortSignal | undefined;\n  /** Armed at fan-in only. Never forwarded to relay.subscribe. */\n  eoseTimeoutMs?: number | undefined;\n  alreadyHaveEvent?: ((id: string) => boolean) | undefined;\n  /** Every receipt from every relay, including skipped duplicates. */\n  receivedEvent?: ((id: string, relayUrl: string) => void) | undefined;\n  closeOnEose?: boolean | undefined;\n  /** Optional. ensureRelay uses Pool.#opts.connectTimeoutMs when omitted. */\n  connectTimeoutMs?: number | undefined;\n};\n\n/**\n * Aggregate EOSE/close across routed jobs. One `seen` set. `pending` counts URL list entries\n * (duplicates included). `pendingEose` counts unique `jobIndex:url` keys.\n */\nexport function fanIn(pool: Pool, jobs: ReadonlyArray<RoutedJob>, opts: FanInOptions = {}): Closer {\n  const seen = new Set<string>();\n  const closers: Closer[] = [];\n  let closed = false;\n  let eoseFired = false;\n  let sawEose = false;\n  let eoseTimer: ReturnType<typeof setTimeout> | undefined;\n  const eoseDone = new Set<string>();\n  const eoseAttempted = new Set<string>();\n  let pendingEose = 0;\n  let pending = 0;\n\n  const fireEose = () => {\n    if (closed || eoseFired) {\n      return;\n    }\n    eoseFired = true;\n    if (eoseTimer !== undefined) {\n      clearTimeout(eoseTimer);\n      eoseTimer = undefined;\n    }\n    invokeSafely(() => opts.oneose?.());\n  };\n\n  /**\n   * Remove one relay from the pending-EOSE set. `eosed` credits a real EOSE; a CLOSED or a connect\n   * failure only drops the wait — the aggregate `oneose` fires once every remaining relay ended AND\n   * at least one actually EOSE'd.\n   */\n  const settleEose = (jobIndex: number, url: string, eosed: boolean) => {\n    const key = `${jobIndex}:${url}`;\n    if (eoseDone.has(key)) {\n      return;\n    }\n    eoseDone.add(key);\n    if (eosed) {\n      sawEose = true;\n    }\n    pendingEose -= 1;\n    if (pendingEose === 0 && sawEose) {\n      fireEose();\n    }\n  };\n\n  const settleClose = () => {\n    closed = true;\n    disposeAbort();\n    if (eoseTimer !== undefined) {\n      clearTimeout(eoseTimer);\n      eoseTimer = undefined;\n    }\n  };\n\n  const closeAll = (reason?: string) => {\n    if (closed) {\n      return;\n    }\n    settleClose();\n    for (const c of closers) {\n      c.close(reason);\n    }\n    invokeSafely(() => opts.onclose?.(reason ?? \"closed by client\"));\n  };\n\n  if (opts.signal?.aborted === true) {\n    closed = true;\n    invokeSafely(() => opts.onclose?.(\"aborted\"));\n    return { close: closeAll };\n  }\n\n  const disposeAbort = onAbort(opts.signal, () => closeAll(\"aborted\"));\n\n  const failUrl = (jobIndex: number, key: string): void => {\n    settleEose(jobIndex, key, false);\n    pending -= 1;\n    if (pending <= 0 && closers.length === 0 && !closed) {\n      settleClose();\n      invokeSafely(() => opts.onclose?.(\"all relays failed\"));\n    }\n  };\n\n  const attach = (relay: Relay, job: RoutedJob, jobIndex: number): void => {\n    if (closed) {\n      return;\n    }\n    const received = opts.receivedEvent;\n    const sub = relay.subscribe([...job.filters], {\n      id: jobs.length === 1 ? job.id : undefined,\n      closeOnEose: opts.closeOnEose,\n      alreadyHaveEvent: (id) => {\n        let have = seen.has(id);\n        invokeSafely(() => {\n          have = have || Boolean(opts.alreadyHaveEvent?.(id));\n        });\n        return have;\n      },\n      receivedEvent:\n        received === undefined ? undefined : (id) => invokeSafely(() => received(id, relay.url)),\n      onevent: (event) => {\n        seen.add(event.id);\n        invokeSafely(() => opts.onevent?.(event, relay.url));\n      },\n      oneose: () => settleEose(jobIndex, relay.url, true),\n      onclose: (reason) => {\n        settleEose(jobIndex, relay.url, false);\n        pending -= 1;\n        if (pending <= 0 && !closed) {\n          settleClose();\n          invokeSafely(() => opts.onclose?.(reason));\n        }\n      },\n    });\n    closers.push(sub);\n  };\n\n  for (const [jobIndex, job] of jobs.entries()) {\n    // Equivalent spellings of one relay URL attach exactly once per job.\n    for (const key of uniqueRelayUrls(job.urls)) {\n      pending += 1;\n      const eoseKey = `${jobIndex}:${key}`;\n      if (!eoseAttempted.has(eoseKey)) {\n        eoseAttempted.add(eoseKey);\n        pendingEose += 1;\n      }\n\n      const tryAttach = (relay: Relay): void => {\n        try {\n          attach(relay, job, jobIndex);\n        } catch (error) {\n          if (error instanceof RelayClosedError) {\n            failUrl(jobIndex, key);\n            return;\n          }\n          throw error;\n        }\n      };\n\n      void (async (): Promise<void> => {\n        let relay: Relay;\n        try {\n          relay = await pool.ensureRelay(key, {\n            signal: opts.signal,\n            timeoutMs: opts.connectTimeoutMs,\n          });\n        } catch {\n          // ensureRelay rejected only — not tryAttach throws (those must not look like connect failure).\n          const existing = pool.getRelay(key);\n          if (existing !== undefined) {\n            tryAttach(existing);\n            return;\n          }\n          failUrl(jobIndex, key);\n          return;\n        }\n        tryAttach(relay);\n      })();\n    }\n  }\n\n  if (opts.eoseTimeoutMs !== undefined && pending > 0) {\n    eoseTimer = setTimeout(() => {\n      eoseTimer = undefined;\n      fireEose();\n    }, opts.eoseTimeoutMs);\n  }\n\n  if (pending === 0) {\n    queueMicrotask(() => {\n      if (closed) {\n        return;\n      }\n      settleClose();\n      invokeSafely(() => opts.onclose?.(\"no relays\"));\n    });\n  }\n\n  return { close: closeAll };\n}\n\nexport async function fetchRouted(\n  pool: Pool,\n  jobs: ReadonlyArray<RoutedJob>,\n  opts: {\n    timeoutMs?: number | undefined;\n    signal?: AbortSignal | undefined;\n    connectTimeoutMs?: number | undefined;\n    /** Every event of every relay batch, including cross-relay duplicates. */\n    onevent?: ((event: Event, relayUrl: string) => void) | undefined;\n  } = {},\n): Promise<Event[]> {\n  throwIfAborted(opts.signal);\n  const byId = new Map<string, Event>();\n  await Promise.all(\n    jobs.flatMap((job) => {\n      return uniqueRelayUrls(job.urls).map(async (url) => {\n        let batch: ReadonlyArray<Event>;\n        let relayUrl: string;\n        try {\n          const relay = await pool.ensureRelay(url, {\n            signal: opts.signal,\n            timeoutMs: opts.connectTimeoutMs,\n          });\n          relayUrl = relay.url;\n          const result = await relay.fetch([...job.filters], {\n            timeoutMs: opts.timeoutMs,\n            signal: opts.signal,\n          });\n          batch = result.events;\n        } catch {\n          // An abort rejects the whole call; per-relay failures are skipped.\n          if (opts.signal?.aborted === true) {\n            throw abortReason(opts.signal);\n          }\n          return;\n        }\n        // The whole batch lands before callbacks so a throwing onevent cannot\n        // drop events; listener errors are reported, never propagated.\n        for (const event of batch) {\n          if (!byId.has(event.id)) {\n            byId.set(event.id, event);\n          }\n        }\n        for (const event of batch) {\n          invokeSafely(() => opts.onevent?.(event, relayUrl));\n        }\n      });\n    }),\n  );\n  return [...byId.values()];\n}\n","import { abortReason, throwIfAborted } from \"../core/abort.ts\";\nimport { Emitter } from \"../core/emitter.ts\";\nimport { MessageError, toError } from \"../core/error.ts\";\nimport type { Event, EventTemplate } from \"../core/event.ts\";\nimport { canonicalizeFilters } from \"../core/filter.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { assertSubscriptionId } from \"../core/message.ts\";\nimport type { CountResult } from \"../core/message.ts\";\nimport { normalizeURL } from \"../core/util.ts\";\nimport { RelayConnectionError, RelayPublishError, RelaySuspendedError } from \"./error.ts\";\nimport { fanIn, fetchRouted } from \"./fan-in.ts\";\nimport { Relay, RelayStatus } from \"./relay.ts\";\nimport type { RelayFetchEnd, RelayOptions, SubscribeOptions } from \"./relay.ts\";\nimport type { Closer } from \"./subscription.ts\";\nimport { isInsecureRelayUrl, uniqueRelayUrls } from \"./url.ts\";\n\n/** Per-relay tolerance for events that fail id/signature verification. */\nexport type InvalidEventPolicy = {\n  /** Invalid events tolerated within `windowMs`; exceeding it suspends the relay. */\n  limit: number;\n  windowMs: number;\n  /** How long a suspended relay stays closed before it may reconnect. */\n  cooldownMs: number;\n};\n\n/** Pool-wide options applied to every managed relay. */\nexport type PoolOptions = Omit<RelayOptions, \"authSigner\"> & {\n  /**\n   * When set, automatically answer NIP-42 AUTH challenges for relays that send them. Return\n   * undefined to skip a given relay URL.\n   */\n  automaticallyAuth?:\n    | ((relayURL: string) => ((event: EventTemplate) => Promise<Event>) | undefined)\n    | undefined;\n  /** When false (default), ensureRelay rejects isInsecureRelayUrl unless trusted. */\n  allowInsecure?: boolean | undefined;\n  trustedInsecureUrls?: ReadonlyArray<string> | undefined;\n  /** Close unused relays. Unset/0 = disabled. */\n  idleTimeoutMs?: number | undefined;\n  idleCleanupIntervalMs?: number | undefined;\n  /**\n   * Soft cap on connected non-pinned relays. When `ensureRelay` would create a new non-pinned relay\n   * at the cap, the least-recently-used idle one is closed first (idle = no subscriptions and no\n   * in-flight requests). If none is idle the connect proceeds anyway — the cap never fails a\n   * request.\n   */\n  maxRelays?: number | undefined;\n  /** Normalized URLs never closed by idle cleanup or `maxRelays` eviction. */\n  pinnedUrls?: ReadonlyArray<string> | undefined;\n  /**\n   * When set, a relay whose `limit`-th-plus-one EVENT fails id/signature verification inside a\n   * `windowMs` sliding window is disconnected and suspended for `cooldownMs`. During suspension\n   * `ensureRelay` rejects with {@link RelaySuspendedError}; once it lifts, live subscriptions resume\n   * through the normal reconnect path. Unset = events are dropped without counting, as before.\n   */\n  invalidEventPolicy?: InvalidEventPolicy | undefined;\n};\n\n/** Typed event payloads for {@link Pool.on}. */\nexport type PoolEventMap = {\n  /** Normalized URLs closed by an idle-cleanup pass. */\n  idle: ReadonlyArray<string>;\n  /**\n   * A relay suspended for exceeding `invalidEventPolicy`: `url` is the normalized relay URL and\n   * `until` the epoch-ms time the suspension lifts.\n   */\n  suspend: { readonly url: string; readonly until: number };\n};\n\n/** Per-relay publish outcome: the relay's OK verdict or a transport-level failure. */\nexport type PoolPublishResult =\n  | { readonly url: string; readonly status: \"ok\"; readonly message: string }\n  | { readonly url: string; readonly status: \"rejected\"; readonly message: string }\n  | { readonly url: string; readonly status: \"failed\"; readonly error: Error };\n\n/** Multi-relay subscribe options: callbacks also receive the normalized relay URL. */\nexport type PoolSubscribeOptions = Omit<SubscribeOptions, \"onevent\" | \"receivedEvent\"> & {\n  onevent?: ((event: Event, relayUrl: string) => void) | undefined;\n  receivedEvent?: ((id: string, relayUrl: string) => void) | undefined;\n};\n\n/** Per-relay one-shot fetch outcome: collected events plus how its REQ ended. */\nexport type PoolFetchResult = {\n  readonly url: string;\n  readonly events: ReadonlyArray<Event>;\n  readonly end: RelayFetchEnd | { readonly type: \"failed\"; readonly error: Error };\n};\n\n/** Per-relay NIP-45 COUNT result (or a transport-level failure). */\nexport type PoolCountResult =\n  | ({ readonly url: string; readonly status: \"ok\" } & CountResult)\n  | { readonly url: string; readonly status: \"failed\"; readonly error: Error };\n\nconst countOk = (url: string, payload: CountResult): PoolCountResult => ({\n  url,\n  status: \"ok\",\n  ...payload,\n});\n\nfunction isIdle(relay: Relay): boolean {\n  return (\n    relay.status !== RelayStatus.Connecting &&\n    relay.subscriptionCount === 0 &&\n    relay.inFlightCount === 0\n  );\n}\n\n/** Multi-relay coordinator: connection reuse, cross-relay event dedup, fan-out publish. */\nexport class Pool {\n  readonly #relays = new Map<string, Relay>();\n  readonly #relayOptions: Omit<RelayOptions, \"authSigner\">;\n  readonly #automaticallyAuth: PoolOptions[\"automaticallyAuth\"];\n  readonly #maxRelays: number | undefined;\n  readonly #invalidEventPolicy: InvalidEventPolicy | undefined;\n  readonly #events = new Emitter<PoolEventMap>();\n  readonly #lastActivity = new Map<string, number>();\n  readonly #idleTimeoutMs: number;\n  #idleTimer: ReturnType<typeof setInterval> | undefined;\n  #allowInsecure: boolean;\n  #trustedInsecure: Set<string>;\n  #pinned: Set<string>;\n  /** Per-relay timestamps of verification failures inside the sliding window. */\n  readonly #invalidEvents = new Map<string, number[]>();\n  /** Normalized URL → epoch ms when its suspension lifts. */\n  readonly #suspendedUntil = new Map<string, number>();\n  readonly #resumeTimers = new Map<string, ReturnType<typeof setTimeout>>();\n\n  constructor(opts: PoolOptions = {}) {\n    const {\n      automaticallyAuth,\n      allowInsecure,\n      trustedInsecureUrls,\n      idleTimeoutMs,\n      idleCleanupIntervalMs,\n      maxRelays,\n      pinnedUrls,\n      invalidEventPolicy,\n      ...relayOptions\n    } = opts;\n    this.#relayOptions = relayOptions;\n    this.#automaticallyAuth = automaticallyAuth;\n    this.#maxRelays = maxRelays;\n    this.#invalidEventPolicy = invalidEventPolicy;\n    this.#allowInsecure = allowInsecure ?? false;\n    this.#trustedInsecure = new Set((trustedInsecureUrls ?? []).map(normalizeURL));\n    this.#pinned = new Set((pinnedUrls ?? []).map(normalizeURL));\n    this.#idleTimeoutMs = idleTimeoutMs ?? 0;\n    if (this.#idleTimeoutMs > 0) {\n      this.#idleTimer = setInterval(() => this.cleanIdleRelays(), idleCleanupIntervalMs ?? 30_000);\n    }\n  }\n\n  /**\n   * Listen for a pool event. Multiple listeners per type are allowed and fire in registration\n   * order; a throwing listener is reported and does not break the dispatch. Returns an unsubscribe\n   * function.\n   */\n  on<K extends keyof PoolEventMap>(\n    type: K,\n    listener: (payload: PoolEventMap[K]) => void,\n  ): () => void {\n    return this.#events.on(type, listener);\n  }\n\n  setAllowInsecure(allow: boolean): void {\n    this.#allowInsecure = allow;\n  }\n\n  setTrustedInsecureUrls(urls: ReadonlyArray<string>): void {\n    this.#trustedInsecure = new Set(urls.map(normalizeURL));\n  }\n\n  setPinnedUrls(urls: ReadonlyArray<string>): void {\n    this.#pinned = new Set(urls.map(normalizeURL));\n  }\n\n  /**\n   * Drop cached AUTH rejections and re-fire pending challenges on every pooled relay, so a later\n   * `setSigner` takes effect without reconnect.\n   */\n  resetAuth(): void {\n    for (const relay of this.#relays.values()) {\n      relay.resetAuth();\n    }\n  }\n\n  cleanIdleRelays(): void {\n    if (this.#idleTimeoutMs <= 0) {\n      return;\n    }\n    const now = Date.now();\n    const idle: string[] = [];\n    for (const [url, relay] of this.#relays) {\n      if (this.#pinned.has(url) || !isIdle(relay)) {\n        continue;\n      }\n      const last = this.#lastActivity.get(url) ?? 0;\n      if (!relay.connected || now - last >= this.#idleTimeoutMs) {\n        idle.push(url);\n      }\n    }\n    for (const url of this.#lastActivity.keys()) {\n      if (!this.#relays.has(url)) {\n        this.#lastActivity.delete(url);\n      }\n    }\n    if (idle.length === 0) {\n      return;\n    }\n    this.closeRelays(idle);\n    this.#events.emit(\"idle\", idle);\n  }\n\n  #touch(url: string): void {\n    this.#lastActivity.set(url, Date.now());\n  }\n\n  /**\n   * Count one verification failure for `norm`; on the `limit + 1`-th inside `windowMs` suspend the\n   * relay: drop its connection (subscriptions kept), record `until`, and emit `suspend`.\n   */\n  #noteInvalidEvent(norm: string): void {\n    const policy = this.#invalidEventPolicy;\n    if (policy === undefined) {\n      return;\n    }\n    const now = Date.now();\n    const window = (this.#invalidEvents.get(norm) ?? []).filter((at) => now - at < policy.windowMs);\n    window.push(now);\n    if (window.length <= policy.limit) {\n      this.#invalidEvents.set(norm, window);\n      return;\n    }\n    this.#invalidEvents.delete(norm);\n    if (this.#suspendedUntil.has(norm)) {\n      return;\n    }\n    const until = now + policy.cooldownMs;\n    this.#suspendedUntil.set(norm, until);\n    this.#relays.get(norm)?.disconnect();\n    const resume = setTimeout(() => {\n      this.#resumeTimers.delete(norm);\n      this.#suspendedUntil.delete(norm);\n      const relay = this.#relays.get(norm);\n      if (relay === undefined || relay.connected || relay.subscriptionCount === 0) {\n        return;\n      }\n      void (async (): Promise<void> => {\n        try {\n          await relay.connect();\n        } catch {\n          // With enableReconnect the relay's own backoff retries; otherwise the\n          // next ensureRelay attempt reconnects on demand.\n        }\n      })();\n    }, policy.cooldownMs);\n    this.#resumeTimers.set(norm, resume);\n    this.#events.emit(\"suspend\", { url: norm, until });\n  }\n\n  #rejectInsecure(url: string, norm: string): void {\n    if (this.#allowInsecure) {\n      return;\n    }\n    if (!isInsecureRelayUrl(url)) {\n      return;\n    }\n    if (this.#trustedInsecure.has(norm)) {\n      return;\n    }\n    throw new RelayConnectionError(\"insecure relay connection blocked\", norm);\n  }\n\n  #stopIdleCleanup(): void {\n    if (this.#idleTimer === undefined) {\n      return;\n    }\n    clearInterval(this.#idleTimer);\n    this.#idleTimer = undefined;\n  }\n\n  /**\n   * Soft cap: closing the least-recently-used idle non-pinned relay when a new non-pinned relay\n   * would push the count past `maxRelays`. Busy relays are never evicted; with none idle the cap is\n   * exceeded rather than failing.\n   */\n  #enforceMaxRelays(incoming: string): void {\n    const cap = this.#maxRelays;\n    if (cap === undefined || this.#pinned.has(incoming)) {\n      return;\n    }\n    let count = 0;\n    let oldestUrl: string | undefined;\n    let oldestAt = Number.POSITIVE_INFINITY;\n    for (const [url, relay] of this.#relays) {\n      if (this.#pinned.has(url)) {\n        continue;\n      }\n      count += 1;\n      if (!isIdle(relay)) {\n        continue;\n      }\n      const at = this.#lastActivity.get(url) ?? 0;\n      if (at < oldestAt) {\n        oldestAt = at;\n        oldestUrl = url;\n      }\n    }\n    if (count >= cap && oldestUrl !== undefined) {\n      this.closeRelays([oldestUrl]);\n    }\n  }\n\n  async ensureRelay(\n    url: string,\n    opts?: { signal?: AbortSignal | undefined; timeoutMs?: number | undefined },\n  ): Promise<Relay> {\n    const norm = normalizeURL(url);\n    this.#rejectInsecure(url, norm);\n    const suspendedUntil = this.#suspendedUntil.get(norm);\n    if (suspendedUntil !== undefined) {\n      if (Date.now() < suspendedUntil) {\n        throw new RelaySuspendedError(norm, suspendedUntil);\n      }\n      this.#suspendedUntil.delete(norm);\n    }\n    let relay = this.#relays.get(norm);\n    if (!relay) {\n      this.#enforceMaxRelays(norm);\n      const signFn = this.#automaticallyAuth?.(norm) ?? undefined;\n      const created = new Relay(norm, { ...this.#relayOptions, authSigner: signFn });\n      // Only drop from the pool on terminal close (reconnect keeps the entry).\n      created.on(\"close\", () => {\n        this.#relays.delete(norm);\n        this.#lastActivity.delete(norm);\n      });\n      created.on(\"invalidevent\", () => {\n        this.#noteInvalidEvent(norm);\n      });\n      if (signFn) {\n        created.on(\"auth\", () => {\n          void (async (): Promise<void> => {\n            try {\n              await created.auth(signFn);\n            } catch {\n              // auth failure surfaces on subsequent CLOSED/OK; avoid unhandled rejection\n            }\n          })();\n        });\n      }\n      this.#relays.set(norm, created);\n      relay = created;\n    }\n    this.#touch(norm);\n    if (!relay.connected) {\n      try {\n        await relay.connect({\n          signal: opts?.signal,\n          timeoutMs: opts?.timeoutMs ?? this.#relayOptions.connectTimeoutMs,\n        });\n      } catch (error) {\n        // Keep the entry when reconnect is enabled so open subscriptions can recover.\n        if (this.#relayOptions.enableReconnect !== true) {\n          this.#relays.delete(norm);\n          this.#lastActivity.delete(norm);\n        }\n        throw error;\n      }\n    }\n    return relay;\n  }\n\n  /** Close every pooled relay and clear all pool state. */\n  close(): void {\n    this.#stopIdleCleanup();\n    for (const timer of this.#resumeTimers.values()) {\n      clearTimeout(timer);\n    }\n    this.#resumeTimers.clear();\n    this.#suspendedUntil.clear();\n    this.#invalidEvents.clear();\n    for (const relay of this.#relays.values()) {\n      relay.close();\n    }\n    this.#relays.clear();\n    this.#lastActivity.clear();\n  }\n\n  /** Close and forget the listed relays; other pooled relays are untouched. */\n  closeRelays(urls: ReadonlyArray<string>): void {\n    for (const url of urls) {\n      const norm = normalizeURL(url);\n      const timer = this.#resumeTimers.get(norm);\n      if (timer !== undefined) {\n        clearTimeout(timer);\n        this.#resumeTimers.delete(norm);\n      }\n      this.#relays.get(norm)?.close();\n      this.#relays.delete(norm);\n      this.#lastActivity.delete(norm);\n    }\n  }\n\n  /**\n   * Subscribe across relays. Deduplicates by event id. Returns a closer; callbacks receive every\n   * new event once.\n   */\n  subscribe(\n    relays: ReadonlyArray<string>,\n    filters: ReadonlyArray<Filter>,\n    opts: PoolSubscribeOptions = {},\n  ): Closer {\n    if (filters.length === 0) {\n      throw new MessageError(\"REQ requires at least one filter\");\n    }\n    if (opts.id !== undefined) {\n      assertSubscriptionId(opts.id);\n    }\n    const canonical = canonicalizeFilters(filters);\n    return fanIn(this, [{ urls: relays, filters: canonical, id: opts.id }], {\n      onevent: opts.onevent,\n      oneose: opts.oneose,\n      onclose: opts.onclose,\n      signal: opts.signal,\n      eoseTimeoutMs: opts.eoseTimeoutMs,\n      alreadyHaveEvent: opts.alreadyHaveEvent,\n      receivedEvent: opts.receivedEvent,\n      closeOnEose: opts.closeOnEose,\n      connectTimeoutMs: this.#relayOptions.connectTimeoutMs,\n    });\n  }\n\n  /**\n   * One-shot fetch per relay: each entry reports its own events and end reason (`eose`, `closed`,\n   * `timeout`), or `failed` when the connect or REQ itself errored. An abort rejects the whole\n   * call. Events are not deduped across relays — use {@link fetch} for that.\n   */\n  async fetchEach(\n    relays: ReadonlyArray<string>,\n    filters: ReadonlyArray<Filter>,\n    opts?: { timeoutMs?: number | undefined; signal?: AbortSignal | undefined },\n  ): Promise<PoolFetchResult[]> {\n    if (filters.length === 0) {\n      throw new MessageError(\"REQ requires at least one filter\");\n    }\n    throwIfAborted(opts?.signal);\n    const canonical = canonicalizeFilters(filters);\n    return Promise.all(\n      uniqueRelayUrls(relays).map(async (url): Promise<PoolFetchResult> => {\n        try {\n          const relay = await this.ensureRelay(url, {\n            signal: opts?.signal,\n            timeoutMs: this.#relayOptions.connectTimeoutMs,\n          });\n          this.#touch(relay.url);\n          const result = await relay.fetch([...canonical], {\n            timeoutMs: opts?.timeoutMs,\n            signal: opts?.signal,\n          });\n          return { url, events: result.events, end: result.end };\n        } catch (error) {\n          // An abort rejects the whole call; per-relay failures are reported.\n          if (opts?.signal?.aborted === true) {\n            throw abortReason(opts.signal);\n          }\n          return {\n            url,\n            events: [],\n            end: { type: \"failed\", error: toError(error) },\n          };\n        }\n      }),\n    );\n  }\n\n  /** Fetch events until each connected relay EOSE or timeout; dedupe by id. */\n  async fetch(\n    relays: ReadonlyArray<string>,\n    filters: ReadonlyArray<Filter>,\n    opts?: {\n      timeoutMs?: number | undefined;\n      signal?: AbortSignal | undefined;\n      /** Every event of every relay batch, including cross-relay duplicates. */\n      onevent?: ((event: Event, relayUrl: string) => void) | undefined;\n    },\n  ): Promise<Event[]> {\n    if (filters.length === 0) {\n      throw new MessageError(\"REQ requires at least one filter\");\n    }\n    return fetchRouted(this, [{ urls: relays, filters: canonicalizeFilters(filters) }], {\n      timeoutMs: opts?.timeoutMs,\n      signal: opts?.signal,\n      connectTimeoutMs: this.#relayOptions.connectTimeoutMs,\n      onevent: opts?.onevent,\n    });\n  }\n\n  /** Publish to all listed relays; returns per-relay outcomes. */\n  async publish(\n    relays: ReadonlyArray<string>,\n    event: Event,\n    opts?: { timeoutMs?: number | undefined },\n  ): Promise<PoolPublishResult[]> {\n    return Promise.all(\n      uniqueRelayUrls(relays).map(async (url): Promise<PoolPublishResult> => {\n        try {\n          const relay = await this.ensureRelay(url, {\n            timeoutMs: this.#relayOptions.connectTimeoutMs,\n          });\n          this.#touch(relay.url);\n          const result = await relay.publish(event, { timeoutMs: opts?.timeoutMs });\n          return result.ok\n            ? { url, status: \"ok\", message: result.message }\n            : { url, status: \"rejected\", message: result.message };\n        } catch (error) {\n          return { url, status: \"failed\", error: toError(error) };\n        }\n      }),\n    );\n  }\n\n  /** First successful publish (Promise.any semantics). */\n  async publishAny(\n    relays: ReadonlyArray<string>,\n    event: Event,\n    opts?: { timeoutMs?: number | undefined },\n  ): Promise<Extract<PoolPublishResult, { status: \"ok\" }>> {\n    return Promise.any(\n      uniqueRelayUrls(relays).map(async (url) => {\n        const relay = await this.ensureRelay(url, {\n          timeoutMs: this.#relayOptions.connectTimeoutMs,\n        });\n        this.#touch(relay.url);\n        const result = await relay.publish(event, { timeoutMs: opts?.timeoutMs });\n        if (!result.ok) {\n          throw new RelayPublishError(result.message || \"rejected\", relay.url);\n        }\n        return { url, status: \"ok\" as const, message: result.message };\n      }),\n    );\n  }\n\n  /**\n   * NIP-45 COUNT across relays. Per-relay outcomes; failures do not throw. Counts are not summed —\n   * each relay reports independently (may overlap).\n   */\n  async count(\n    relays: ReadonlyArray<string>,\n    filters: ReadonlyArray<Filter>,\n    opts?: { timeoutMs?: number | undefined; signal?: AbortSignal | undefined },\n  ): Promise<PoolCountResult[]> {\n    throwIfAborted(opts?.signal);\n    const canonical = canonicalizeFilters(filters);\n    return Promise.all(\n      uniqueRelayUrls(relays).map(async (url): Promise<PoolCountResult> => {\n        try {\n          const relay = await this.ensureRelay(url, {\n            signal: opts?.signal,\n            timeoutMs: this.#relayOptions.connectTimeoutMs,\n          });\n          this.#touch(relay.url);\n          const payload: CountResult = await relay.count(canonical, {\n            timeoutMs: opts?.timeoutMs,\n            signal: opts?.signal,\n          });\n          return countOk(url, payload);\n        } catch (error) {\n          // An abort rejects the whole call; per-relay failures are reported.\n          if (opts?.signal?.aborted === true) {\n            throw abortReason(opts.signal);\n          }\n          return { url, status: \"failed\", error: toError(error) };\n        }\n      }),\n    );\n  }\n\n  listRelays(): string[] {\n    return [...this.#relays.keys()];\n  }\n\n  /** Lookup a pooled relay, including disconnected reconnecting entries. */\n  getRelay(url: string): Relay | undefined {\n    try {\n      return this.#relays.get(normalizeURL(url));\n    } catch {\n      return this.#relays.get(url);\n    }\n  }\n\n  /** Currently connected URLs. Unlike listRelays(), excludes reconnecting/disconnected entries. */\n  connectedUrls(): string[] {\n    const urls: string[] = [];\n    for (const [url, relay] of this.#relays) {\n      if (relay.connected) {\n        urls.push(url);\n      }\n    }\n    return urls;\n  }\n}\n"],"mappings":";;;;;;;;;;;;AAMA,SAAgB,YAAY,KAAqB;CAC/C,IAAI;EACF,OAAO,aAAa,GAAG;CACzB,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,SAAgB,gBAAgB,MAAkC;CAChE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAmB,CAAC;CAC1B,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,MAAM,YAAY,GAAG;EAC3B,IAAI,KAAK,IAAI,GAAG,GACd;EAEF,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK,GAAG;CACjB;CACA,OAAO;AACT;;;;;AAMA,SAAgB,mBAAmB,KAAsB;CACvD,IAAI;EACF,MAAM,SAAS,IAAI,IAAI,GAAG;EAC1B,IAAI,OAAO,SAAS,SAAS,QAAQ,GACnC,OAAO;EAET,OAAO,OAAO,aAAa,SAAS,OAAO,aAAa;CAC1D,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;ACPA,SAAgB,MAAM,MAAY,MAAgC,OAAqB,CAAC,GAAW;CACjG,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,UAAoB,CAAC;CAC3B,IAAI,SAAS;CACb,IAAI,YAAY;CAChB,IAAI,UAAU;CACd,IAAI;CACJ,MAAM,2BAAW,IAAI,IAAY;CACjC,MAAM,gCAAgB,IAAI,IAAY;CACtC,IAAI,cAAc;CAClB,IAAI,UAAU;CAEd,MAAM,iBAAiB;EACrB,IAAI,UAAU,WACZ;EAEF,YAAY;EACZ,IAAI,cAAc,KAAA,GAAW;GAC3B,aAAa,SAAS;GACtB,YAAY,KAAA;EACd;EACA,mBAAmB,KAAK,SAAS,CAAC;CACpC;;;;;;CAOA,MAAM,cAAc,UAAkB,KAAa,UAAmB;EACpE,MAAM,MAAM,GAAG,SAAS,GAAG;EAC3B,IAAI,SAAS,IAAI,GAAG,GAClB;EAEF,SAAS,IAAI,GAAG;EAChB,IAAI,OACF,UAAU;EAEZ,eAAe;EACf,IAAI,gBAAgB,KAAK,SACvB,SAAS;CAEb;CAEA,MAAM,oBAAoB;EACxB,SAAS;EACT,aAAa;EACb,IAAI,cAAc,KAAA,GAAW;GAC3B,aAAa,SAAS;GACtB,YAAY,KAAA;EACd;CACF;CAEA,MAAM,YAAY,WAAoB;EACpC,IAAI,QACF;EAEF,YAAY;EACZ,KAAK,MAAM,KAAK,SACd,EAAE,MAAM,MAAM;EAEhB,mBAAmB,KAAK,UAAU,UAAU,kBAAkB,CAAC;CACjE;CAEA,IAAI,KAAK,QAAQ,YAAY,MAAM;EACjC,SAAS;EACT,mBAAmB,KAAK,UAAU,SAAS,CAAC;EAC5C,OAAO,EAAE,OAAO,SAAS;CAC3B;CAEA,MAAM,eAAe,QAAQ,KAAK,cAAc,SAAS,SAAS,CAAC;CAEnE,MAAM,WAAW,UAAkB,QAAsB;EACvD,WAAW,UAAU,KAAK,KAAK;EAC/B,WAAW;EACX,IAAI,WAAW,KAAK,QAAQ,WAAW,KAAK,CAAC,QAAQ;GACnD,YAAY;GACZ,mBAAmB,KAAK,UAAU,mBAAmB,CAAC;EACxD;CACF;CAEA,MAAM,UAAU,OAAc,KAAgB,aAA2B;EACvE,IAAI,QACF;EAEF,MAAM,WAAW,KAAK;EACtB,MAAM,MAAM,MAAM,UAAU,CAAC,GAAG,IAAI,OAAO,GAAG;GAC5C,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,KAAA;GACjC,aAAa,KAAK;GAClB,mBAAmB,OAAO;IACxB,IAAI,OAAO,KAAK,IAAI,EAAE;IACtB,mBAAmB;KACjB,OAAO,QAAQ,QAAQ,KAAK,mBAAmB,EAAE,CAAC;IACpD,CAAC;IACD,OAAO;GACT;GACA,eACE,aAAa,KAAA,IAAY,KAAA,KAAa,OAAO,mBAAmB,SAAS,IAAI,MAAM,GAAG,CAAC;GACzF,UAAU,UAAU;IAClB,KAAK,IAAI,MAAM,EAAE;IACjB,mBAAmB,KAAK,UAAU,OAAO,MAAM,GAAG,CAAC;GACrD;GACA,cAAc,WAAW,UAAU,MAAM,KAAK,IAAI;GAClD,UAAU,WAAW;IACnB,WAAW,UAAU,MAAM,KAAK,KAAK;IACrC,WAAW;IACX,IAAI,WAAW,KAAK,CAAC,QAAQ;KAC3B,YAAY;KACZ,mBAAmB,KAAK,UAAU,MAAM,CAAC;IAC3C;GACF;EACF,CAAC;EACD,QAAQ,KAAK,GAAG;CAClB;CAEA,KAAK,MAAM,CAAC,UAAU,QAAQ,KAAK,QAAQ,GAEzC,KAAK,MAAM,OAAO,gBAAgB,IAAI,IAAI,GAAG;EAC3C,WAAW;EACX,MAAM,UAAU,GAAG,SAAS,GAAG;EAC/B,IAAI,CAAC,cAAc,IAAI,OAAO,GAAG;GAC/B,cAAc,IAAI,OAAO;GACzB,eAAe;EACjB;EAEA,MAAM,aAAa,UAAuB;GACxC,IAAI;IACF,OAAO,OAAO,KAAK,QAAQ;GAC7B,SAAS,OAAO;IACd,IAAI,iBAAiB,kBAAkB;KACrC,QAAQ,UAAU,GAAG;KACrB;IACF;IACA,MAAM;GACR;EACF;EAEA,CAAM,YAA2B;GAC/B,IAAI;GACJ,IAAI;IACF,QAAQ,MAAM,KAAK,YAAY,KAAK;KAClC,QAAQ,KAAK;KACb,WAAW,KAAK;IAClB,CAAC;GACH,QAAQ;IAEN,MAAM,WAAW,KAAK,SAAS,GAAG;IAClC,IAAI,aAAa,KAAA,GAAW;KAC1B,UAAU,QAAQ;KAClB;IACF;IACA,QAAQ,UAAU,GAAG;IACrB;GACF;GACA,UAAU,KAAK;EACjB,EAAA,CAAG;CACL;CAGF,IAAI,KAAK,kBAAkB,KAAA,KAAa,UAAU,GAChD,YAAY,iBAAiB;EAC3B,YAAY,KAAA;EACZ,SAAS;CACX,GAAG,KAAK,aAAa;CAGvB,IAAI,YAAY,GACd,qBAAqB;EACnB,IAAI,QACF;EAEF,YAAY;EACZ,mBAAmB,KAAK,UAAU,WAAW,CAAC;CAChD,CAAC;CAGH,OAAO,EAAE,OAAO,SAAS;AAC3B;AAEA,eAAsB,YACpB,MACA,MACA,OAMI,CAAC,GACa;CAClB,eAAe,KAAK,MAAM;CAC1B,MAAM,uBAAO,IAAI,IAAmB;CACpC,MAAM,QAAQ,IACZ,KAAK,SAAS,QAAQ;EACpB,OAAO,gBAAgB,IAAI,IAAI,CAAC,CAAC,IAAI,OAAO,QAAQ;GAClD,IAAI;GACJ,IAAI;GACJ,IAAI;IACF,MAAM,QAAQ,MAAM,KAAK,YAAY,KAAK;KACxC,QAAQ,KAAK;KACb,WAAW,KAAK;IAClB,CAAC;IACD,WAAW,MAAM;IAKjB,SAAQ,MAJa,MAAM,MAAM,CAAC,GAAG,IAAI,OAAO,GAAG;KACjD,WAAW,KAAK;KAChB,QAAQ,KAAK;IACf,CAAC,EAAA,CACc;GACjB,QAAQ;IAEN,IAAI,KAAK,QAAQ,YAAY,MAC3B,MAAM,YAAY,KAAK,MAAM;IAE/B;GACF;GAGA,KAAK,MAAM,SAAS,OAClB,IAAI,CAAC,KAAK,IAAI,MAAM,EAAE,GACpB,KAAK,IAAI,MAAM,IAAI,KAAK;GAG5B,KAAK,MAAM,SAAS,OAClB,mBAAmB,KAAK,UAAU,OAAO,QAAQ,CAAC;EAEtD,CAAC;CACH,CAAC,CACH;CACA,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAC1B;;;AC5KA,MAAM,WAAW,KAAa,aAA2C;CACvE;CACA,QAAQ;CACR,GAAG;AACL;AAEA,SAAS,OAAO,OAAuB;CACrC,OACE,MAAM,WAAW,YAAY,cAC7B,MAAM,sBAAsB,KAC5B,MAAM,kBAAkB;AAE5B;;AAGA,IAAa,OAAb,MAAkB;CAChB,0BAAmB,IAAI,IAAmB;CAC1C;CACA;CACA;CACA;CACA,UAAmB,IAAI,QAAsB;CAC7C,gCAAyB,IAAI,IAAoB;CACjD;CACA;CACA;CACA;CACA;;CAEA,iCAA0B,IAAI,IAAsB;;CAEpD,kCAA2B,IAAI,IAAoB;CACnD,gCAAyB,IAAI,IAA2C;CAExE,YAAY,OAAoB,CAAC,GAAG;EAClC,MAAM,EACJ,mBACA,eACA,qBACA,eACA,uBACA,WACA,YACA,oBACA,GAAG,iBACD;EACJ,KAAK,gBAAgB;EACrB,KAAK,qBAAqB;EAC1B,KAAK,aAAa;EAClB,KAAK,sBAAsB;EAC3B,KAAK,iBAAiB,iBAAiB;EACvC,KAAK,mBAAmB,IAAI,KAAK,uBAAuB,CAAC,EAAA,CAAG,IAAI,YAAY,CAAC;EAC7E,KAAK,UAAU,IAAI,KAAK,cAAc,CAAC,EAAA,CAAG,IAAI,YAAY,CAAC;EAC3D,KAAK,iBAAiB,iBAAiB;EACvC,IAAI,KAAK,iBAAiB,GACxB,KAAK,aAAa,kBAAkB,KAAK,gBAAgB,GAAG,yBAAyB,GAAM;CAE/F;;;;;;CAOA,GACE,MACA,UACY;EACZ,OAAO,KAAK,QAAQ,GAAG,MAAM,QAAQ;CACvC;CAEA,iBAAiB,OAAsB;EACrC,KAAK,iBAAiB;CACxB;CAEA,uBAAuB,MAAmC;EACxD,KAAK,mBAAmB,IAAI,IAAI,KAAK,IAAI,YAAY,CAAC;CACxD;CAEA,cAAc,MAAmC;EAC/C,KAAK,UAAU,IAAI,IAAI,KAAK,IAAI,YAAY,CAAC;CAC/C;;;;;CAMA,YAAkB;EAChB,KAAK,MAAM,SAAS,KAAK,QAAQ,OAAO,GACtC,MAAM,UAAU;CAEpB;CAEA,kBAAwB;EACtB,IAAI,KAAK,kBAAkB,GACzB;EAEF,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,OAAiB,CAAC;EACxB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,SAAS;GACvC,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK,CAAC,OAAO,KAAK,GACxC;GAEF,MAAM,OAAO,KAAK,cAAc,IAAI,GAAG,KAAK;GAC5C,IAAI,CAAC,MAAM,aAAa,MAAM,QAAQ,KAAK,gBACzC,KAAK,KAAK,GAAG;EAEjB;EACA,KAAK,MAAM,OAAO,KAAK,cAAc,KAAK,GACxC,IAAI,CAAC,KAAK,QAAQ,IAAI,GAAG,GACvB,KAAK,cAAc,OAAO,GAAG;EAGjC,IAAI,KAAK,WAAW,GAClB;EAEF,KAAK,YAAY,IAAI;EACrB,KAAK,QAAQ,KAAK,QAAQ,IAAI;CAChC;CAEA,OAAO,KAAmB;EACxB,KAAK,cAAc,IAAI,KAAK,KAAK,IAAI,CAAC;CACxC;;;;;CAMA,kBAAkB,MAAoB;EACpC,MAAM,SAAS,KAAK;EACpB,IAAI,WAAW,KAAA,GACb;EAEF,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,UAAU,KAAK,eAAe,IAAI,IAAI,KAAK,CAAC,EAAA,CAAG,QAAQ,OAAO,MAAM,KAAK,OAAO,QAAQ;EAC9F,OAAO,KAAK,GAAG;EACf,IAAI,OAAO,UAAU,OAAO,OAAO;GACjC,KAAK,eAAe,IAAI,MAAM,MAAM;GACpC;EACF;EACA,KAAK,eAAe,OAAO,IAAI;EAC/B,IAAI,KAAK,gBAAgB,IAAI,IAAI,GAC/B;EAEF,MAAM,QAAQ,MAAM,OAAO;EAC3B,KAAK,gBAAgB,IAAI,MAAM,KAAK;EACpC,KAAK,QAAQ,IAAI,IAAI,CAAC,EAAE,WAAW;EACnC,MAAM,SAAS,iBAAiB;GAC9B,KAAK,cAAc,OAAO,IAAI;GAC9B,KAAK,gBAAgB,OAAO,IAAI;GAChC,MAAM,QAAQ,KAAK,QAAQ,IAAI,IAAI;GACnC,IAAI,UAAU,KAAA,KAAa,MAAM,aAAa,MAAM,sBAAsB,GACxE;GAEF,CAAM,YAA2B;IAC/B,IAAI;KACF,MAAM,MAAM,QAAQ;IACtB,QAAQ,CAGR;GACF,EAAA,CAAG;EACL,GAAG,OAAO,UAAU;EACpB,KAAK,cAAc,IAAI,MAAM,MAAM;EACnC,KAAK,QAAQ,KAAK,WAAW;GAAE,KAAK;GAAM;EAAM,CAAC;CACnD;CAEA,gBAAgB,KAAa,MAAoB;EAC/C,IAAI,KAAK,gBACP;EAEF,IAAI,CAAC,mBAAmB,GAAG,GACzB;EAEF,IAAI,KAAK,iBAAiB,IAAI,IAAI,GAChC;EAEF,MAAM,IAAI,qBAAqB,qCAAqC,IAAI;CAC1E;CAEA,mBAAyB;EACvB,IAAI,KAAK,eAAe,KAAA,GACtB;EAEF,cAAc,KAAK,UAAU;EAC7B,KAAK,aAAa,KAAA;CACpB;;;;;;CAOA,kBAAkB,UAAwB;EACxC,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,KAAa,KAAK,QAAQ,IAAI,QAAQ,GAChD;EAEF,IAAI,QAAQ;EACZ,IAAI;EACJ,IAAI,WAAW,OAAO;EACtB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,SAAS;GACvC,IAAI,KAAK,QAAQ,IAAI,GAAG,GACtB;GAEF,SAAS;GACT,IAAI,CAAC,OAAO,KAAK,GACf;GAEF,MAAM,KAAK,KAAK,cAAc,IAAI,GAAG,KAAK;GAC1C,IAAI,KAAK,UAAU;IACjB,WAAW;IACX,YAAY;GACd;EACF;EACA,IAAI,SAAS,OAAO,cAAc,KAAA,GAChC,KAAK,YAAY,CAAC,SAAS,CAAC;CAEhC;CAEA,MAAM,YACJ,KACA,MACgB;EAChB,MAAM,OAAO,aAAa,GAAG;EAC7B,KAAK,gBAAgB,KAAK,IAAI;EAC9B,MAAM,iBAAiB,KAAK,gBAAgB,IAAI,IAAI;EACpD,IAAI,mBAAmB,KAAA,GAAW;GAChC,IAAI,KAAK,IAAI,IAAI,gBACf,MAAM,IAAI,oBAAoB,MAAM,cAAc;GAEpD,KAAK,gBAAgB,OAAO,IAAI;EAClC;EACA,IAAI,QAAQ,KAAK,QAAQ,IAAI,IAAI;EACjC,IAAI,CAAC,OAAO;GACV,KAAK,kBAAkB,IAAI;GAC3B,MAAM,SAAS,KAAK,qBAAqB,IAAI,KAAK,KAAA;GAClD,MAAM,UAAU,IAAI,MAAM,MAAM;IAAE,GAAG,KAAK;IAAe,YAAY;GAAO,CAAC;GAE7E,QAAQ,GAAG,eAAe;IACxB,KAAK,QAAQ,OAAO,IAAI;IACxB,KAAK,cAAc,OAAO,IAAI;GAChC,CAAC;GACD,QAAQ,GAAG,sBAAsB;IAC/B,KAAK,kBAAkB,IAAI;GAC7B,CAAC;GACD,IAAI,QACF,QAAQ,GAAG,cAAc;IACvB,CAAM,YAA2B;KAC/B,IAAI;MACF,MAAM,QAAQ,KAAK,MAAM;KAC3B,QAAQ,CAER;IACF,EAAA,CAAG;GACL,CAAC;GAEH,KAAK,QAAQ,IAAI,MAAM,OAAO;GAC9B,QAAQ;EACV;EACA,KAAK,OAAO,IAAI;EAChB,IAAI,CAAC,MAAM,WACT,IAAI;GACF,MAAM,MAAM,QAAQ;IAClB,QAAQ,MAAM;IACd,WAAW,MAAM,aAAa,KAAK,cAAc;GACnD,CAAC;EACH,SAAS,OAAO;GAEd,IAAI,KAAK,cAAc,oBAAoB,MAAM;IAC/C,KAAK,QAAQ,OAAO,IAAI;IACxB,KAAK,cAAc,OAAO,IAAI;GAChC;GACA,MAAM;EACR;EAEF,OAAO;CACT;;CAGA,QAAc;EACZ,KAAK,iBAAiB;EACtB,KAAK,MAAM,SAAS,KAAK,cAAc,OAAO,GAC5C,aAAa,KAAK;EAEpB,KAAK,cAAc,MAAM;EACzB,KAAK,gBAAgB,MAAM;EAC3B,KAAK,eAAe,MAAM;EAC1B,KAAK,MAAM,SAAS,KAAK,QAAQ,OAAO,GACtC,MAAM,MAAM;EAEd,KAAK,QAAQ,MAAM;EACnB,KAAK,cAAc,MAAM;CAC3B;;CAGA,YAAY,MAAmC;EAC7C,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,OAAO,aAAa,GAAG;GAC7B,MAAM,QAAQ,KAAK,cAAc,IAAI,IAAI;GACzC,IAAI,UAAU,KAAA,GAAW;IACvB,aAAa,KAAK;IAClB,KAAK,cAAc,OAAO,IAAI;GAChC;GACA,KAAK,QAAQ,IAAI,IAAI,CAAC,EAAE,MAAM;GAC9B,KAAK,QAAQ,OAAO,IAAI;GACxB,KAAK,cAAc,OAAO,IAAI;EAChC;CACF;;;;;CAMA,UACE,QACA,SACA,OAA6B,CAAC,GACtB;EACR,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,aAAa,kCAAkC;EAE3D,IAAI,KAAK,OAAO,KAAA,GACd,qBAAqB,KAAK,EAAE;EAE9B,MAAM,YAAY,oBAAoB,OAAO;EAC7C,OAAO,MAAM,MAAM,CAAC;GAAE,MAAM;GAAQ,SAAS;GAAW,IAAI,KAAK;EAAG,CAAC,GAAG;GACtE,SAAS,KAAK;GACd,QAAQ,KAAK;GACb,SAAS,KAAK;GACd,QAAQ,KAAK;GACb,eAAe,KAAK;GACpB,kBAAkB,KAAK;GACvB,eAAe,KAAK;GACpB,aAAa,KAAK;GAClB,kBAAkB,KAAK,cAAc;EACvC,CAAC;CACH;;;;;;CAOA,MAAM,UACJ,QACA,SACA,MAC4B;EAC5B,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,aAAa,kCAAkC;EAE3D,eAAe,MAAM,MAAM;EAC3B,MAAM,YAAY,oBAAoB,OAAO;EAC7C,OAAO,QAAQ,IACb,gBAAgB,MAAM,CAAC,CAAC,IAAI,OAAO,QAAkC;GACnE,IAAI;IACF,MAAM,QAAQ,MAAM,KAAK,YAAY,KAAK;KACxC,QAAQ,MAAM;KACd,WAAW,KAAK,cAAc;IAChC,CAAC;IACD,KAAK,OAAO,MAAM,GAAG;IACrB,MAAM,SAAS,MAAM,MAAM,MAAM,CAAC,GAAG,SAAS,GAAG;KAC/C,WAAW,MAAM;KACjB,QAAQ,MAAM;IAChB,CAAC;IACD,OAAO;KAAE;KAAK,QAAQ,OAAO;KAAQ,KAAK,OAAO;IAAI;GACvD,SAAS,OAAO;IAEd,IAAI,MAAM,QAAQ,YAAY,MAC5B,MAAM,YAAY,KAAK,MAAM;IAE/B,OAAO;KACL;KACA,QAAQ,CAAC;KACT,KAAK;MAAE,MAAM;MAAU,OAAO,QAAQ,KAAK;KAAE;IAC/C;GACF;EACF,CAAC,CACH;CACF;;CAGA,MAAM,MACJ,QACA,SACA,MAMkB;EAClB,IAAI,QAAQ,WAAW,GACrB,MAAM,IAAI,aAAa,kCAAkC;EAE3D,OAAO,YAAY,MAAM,CAAC;GAAE,MAAM;GAAQ,SAAS,oBAAoB,OAAO;EAAE,CAAC,GAAG;GAClF,WAAW,MAAM;GACjB,QAAQ,MAAM;GACd,kBAAkB,KAAK,cAAc;GACrC,SAAS,MAAM;EACjB,CAAC;CACH;;CAGA,MAAM,QACJ,QACA,OACA,MAC8B;EAC9B,OAAO,QAAQ,IACb,gBAAgB,MAAM,CAAC,CAAC,IAAI,OAAO,QAAoC;GACrE,IAAI;IACF,MAAM,QAAQ,MAAM,KAAK,YAAY,KAAK,EACxC,WAAW,KAAK,cAAc,iBAChC,CAAC;IACD,KAAK,OAAO,MAAM,GAAG;IACrB,MAAM,SAAS,MAAM,MAAM,QAAQ,OAAO,EAAE,WAAW,MAAM,UAAU,CAAC;IACxE,OAAO,OAAO,KACV;KAAE;KAAK,QAAQ;KAAM,SAAS,OAAO;IAAQ,IAC7C;KAAE;KAAK,QAAQ;KAAY,SAAS,OAAO;IAAQ;GACzD,SAAS,OAAO;IACd,OAAO;KAAE;KAAK,QAAQ;KAAU,OAAO,QAAQ,KAAK;IAAE;GACxD;EACF,CAAC,CACH;CACF;;CAGA,MAAM,WACJ,QACA,OACA,MACuD;EACvD,OAAO,QAAQ,IACb,gBAAgB,MAAM,CAAC,CAAC,IAAI,OAAO,QAAQ;GACzC,MAAM,QAAQ,MAAM,KAAK,YAAY,KAAK,EACxC,WAAW,KAAK,cAAc,iBAChC,CAAC;GACD,KAAK,OAAO,MAAM,GAAG;GACrB,MAAM,SAAS,MAAM,MAAM,QAAQ,OAAO,EAAE,WAAW,MAAM,UAAU,CAAC;GACxE,IAAI,CAAC,OAAO,IACV,MAAM,IAAI,kBAAkB,OAAO,WAAW,YAAY,MAAM,GAAG;GAErE,OAAO;IAAE;IAAK,QAAQ;IAAe,SAAS,OAAO;GAAQ;EAC/D,CAAC,CACH;CACF;;;;;CAMA,MAAM,MACJ,QACA,SACA,MAC4B;EAC5B,eAAe,MAAM,MAAM;EAC3B,MAAM,YAAY,oBAAoB,OAAO;EAC7C,OAAO,QAAQ,IACb,gBAAgB,MAAM,CAAC,CAAC,IAAI,OAAO,QAAkC;GACnE,IAAI;IACF,MAAM,QAAQ,MAAM,KAAK,YAAY,KAAK;KACxC,QAAQ,MAAM;KACd,WAAW,KAAK,cAAc;IAChC,CAAC;IACD,KAAK,OAAO,MAAM,GAAG;IACrB,MAAM,UAAuB,MAAM,MAAM,MAAM,WAAW;KACxD,WAAW,MAAM;KACjB,QAAQ,MAAM;IAChB,CAAC;IACD,OAAO,QAAQ,KAAK,OAAO;GAC7B,SAAS,OAAO;IAEd,IAAI,MAAM,QAAQ,YAAY,MAC5B,MAAM,YAAY,KAAK,MAAM;IAE/B,OAAO;KAAE;KAAK,QAAQ;KAAU,OAAO,QAAQ,KAAK;IAAE;GACxD;EACF,CAAC,CACH;CACF;CAEA,aAAuB;EACrB,OAAO,CAAC,GAAG,KAAK,QAAQ,KAAK,CAAC;CAChC;;CAGA,SAAS,KAAgC;EACvC,IAAI;GACF,OAAO,KAAK,QAAQ,IAAI,aAAa,GAAG,CAAC;EAC3C,QAAQ;GACN,OAAO,KAAK,QAAQ,IAAI,GAAG;EAC7B;CACF;;CAGA,gBAA0B;EACxB,MAAM,OAAiB,CAAC;EACxB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,SAC9B,IAAI,MAAM,WACR,KAAK,KAAK,GAAG;EAGjB,OAAO;CACT;AACF"}

package/dist/put-w13ci3sC.mjs

@@ -0,0 +1,187 @@
+import { o as isHex32 } from "./util-DMF9AIO0.mjs";
+import { i as isEphemeralKind, t as Kind } from "./kind-Cxwhhkx8.mjs";
+import { a as isReplaceableWinner, g as eventAddress, m as validateSignedEvent, x as parseEventAddress } from "./event-CHf47dPM.mjs";
+//#region src/storage/deletion.ts
+/**
+* NIP-09 application plan for a kind 5 event.
+*
+* - `e` tags: delete only when the target exists, is not itself kind 5, and shares pubkey.
+* - Unknown `e` ids are pending until the event arrives (client MUST validate pubkey).
+* - `a` tags: tombstone that coordinate up to this deletion's `created_at` when pubkey matches.
+* - Deleting a deletion request is a no-op.
+*/
+function planDeletion(deletion, getById) {
+	const { pubkey } = deletion;
+	const removeIds = [];
+	const pendingIds = [];
+	const coordinates = [];
+	const seenIds = /* @__PURE__ */ new Set();
+	const seenCoords = /* @__PURE__ */ new Set();
+	for (const tag of deletion.tags) {
+		if (tag[0] === "e" && tag[1] !== void 0 && isHex32(tag[1].toLowerCase())) {
+			const id = tag[1].toLowerCase();
+			if (seenIds.has(id)) continue;
+			seenIds.add(id);
+			const existing = getById(id);
+			if (!existing) {
+				pendingIds.push({
+					id,
+					pubkey
+				});
+				continue;
+			}
+			if (existing.kind === Kind.EventDeletion) continue;
+			if (existing.pubkey !== pubkey) continue;
+			removeIds.push(id);
+			continue;
+		}
+		if (tag[0] === "a" && tag[1] !== void 0) {
+			const coord = parseEventAddress(tag[1]);
+			if (!coord || coord.pubkey !== pubkey) continue;
+			const key = `${coord.kind}:${coord.pubkey}:${coord.identifier}`;
+			if (seenCoords.has(key)) continue;
+			seenCoords.add(key);
+			coordinates.push({
+				key,
+				until: deletion.created_at
+			});
+		}
+	}
+	return {
+		removeIds,
+		pendingIds,
+		coordinates
+	};
+}
+/** In-memory NIP-09 tombstones shared by MemoryEventStore and IndexedDbEventStore. */
+var DeletionState = class {
+	ids = /* @__PURE__ */ new Set();
+	pending = /* @__PURE__ */ new Map();
+	coordinates = /* @__PURE__ */ new Map();
+	clear() {
+		this.ids.clear();
+		this.pending.clear();
+		this.coordinates.clear();
+	}
+	covers(event) {
+		if (this.ids.has(event.id)) return true;
+		if (event.kind === Kind.EventDeletion) return false;
+		const pendingPk = this.pending.get(event.id);
+		if (pendingPk !== void 0 && event.pubkey === pendingPk) return true;
+		const addr = eventAddress(event);
+		if (addr === void 0) return false;
+		const until = this.coordinates.get(addr);
+		return until !== void 0 && event.created_at <= until;
+	}
+	absorb(plan) {
+		for (const id of plan.removeIds) {
+			this.ids.add(id);
+			this.pending.delete(id);
+		}
+		for (const p of plan.pendingIds) if (!this.ids.has(p.id)) this.pending.set(p.id, p.pubkey);
+		for (const c of plan.coordinates) {
+			const prev = this.coordinates.get(c.key) ?? Number.NEGATIVE_INFINITY;
+			this.coordinates.delete(c.key);
+			this.coordinates.set(c.key, Math.max(prev, c.until));
+		}
+	}
+};
+function coordinateRemovals(coordinates, getCurrent) {
+	const ids = [];
+	for (const c of coordinates) {
+		const current = getCurrent(c.key);
+		if (current && current.created_at <= c.until) ids.push(current.id);
+	}
+	return ids;
+}
+//#endregion
+//#region src/storage/put.ts
+function outboxBoundKey(pubkey, kind) {
+	return `${pubkey.toLowerCase()}:${kind}`;
+}
+function decidePut(raw, lookup) {
+	if (!validateSignedEvent(raw)) return {
+		action: "skip",
+		result: "invalid",
+		event: raw
+	};
+	const event = raw;
+	if (lookup.deletion.ids.has(event.id) || lookup.getById(event.id)) return {
+		action: "skip",
+		result: "duplicate",
+		event
+	};
+	if (event.kind === Kind.EventDeletion) {
+		const plan = planDeletion(event, lookup.getById);
+		return {
+			action: "delete",
+			result: "deleted",
+			event,
+			plan,
+			coordIds: coordinateRemovals(plan.coordinates, lookup.getReplaceable)
+		};
+	}
+	if (lookup.deletion.covers(event)) return {
+		action: "tombstone",
+		result: "duplicate",
+		event
+	};
+	if (isEphemeralKind(event.kind)) return {
+		action: "skip",
+		result: "ephemeral",
+		event
+	};
+	const address = eventAddress(event);
+	if (address !== void 0) {
+		const prev = lookup.getReplaceable(address);
+		if (prev && prev.id !== event.id && !isReplaceableWinner(event, prev)) return {
+			action: "skip",
+			result: "rejected",
+			event
+		};
+		if (prev !== void 0 && prev.evicted !== true) return {
+			action: "insert",
+			result: "replaced",
+			event,
+			address,
+			replaceId: prev.id
+		};
+		return {
+			action: "insert",
+			result: "accepted",
+			event,
+			address
+		};
+	}
+	return {
+		action: "insert",
+		result: "accepted",
+		event
+	};
+}
+function applyPutMemory(s, d) {
+	if (d.action === "skip") return d.result;
+	if (d.action === "tombstone") {
+		s.deletion.ids.add(d.event.id);
+		s.deletion.pending.delete(d.event.id);
+		return "duplicate";
+	}
+	if (d.action === "delete") {
+		s.deletion.pending.delete(d.event.id);
+		s.deletion.absorb(d.plan);
+		for (const id of d.plan.removeIds) s.indexRemove(id);
+		for (const id of d.coordIds) {
+			s.deletion.ids.add(id);
+			s.indexRemove(id);
+		}
+		s.indexInsert(d.event);
+		return "deleted";
+	}
+	if (d.replaceId !== void 0) s.indexRemove(d.replaceId);
+	s.indexInsert(d.event);
+	return d.result;
+}
+//#endregion
+export { planDeletion as a, DeletionState as i, decidePut as n, outboxBoundKey as r, applyPutMemory as t };
+
+//# sourceMappingURL=put-w13ci3sC.mjs.map

package/dist/put-w13ci3sC.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"put-w13ci3sC.mjs","names":[],"sources":["../src/storage/deletion.ts","../src/storage/put.ts"],"sourcesContent":["import type { Event } from \"../core/event.ts\";\nimport { Kind } from \"../core/kind.ts\";\nimport { eventAddress, parseEventAddress } from \"../core/tag.ts\";\nimport { isHex32 } from \"../core/util.ts\";\n\nexport type DeletionPlan = {\n  /** Stored events validated as same-pubkey (not kind 5) and to be removed now. */\n  readonly removeIds: ReadonlyArray<string>;\n  /** Referenced ids not in the store; remember deletion pubkey until the event arrives. */\n  readonly pendingIds: ReadonlyArray<{ readonly id: string; readonly pubkey: string }>;\n  /** Replaceable/addressable coordinates tombstoned up to `until` (deletion created_at). */\n  readonly coordinates: ReadonlyArray<{ readonly key: string; readonly until: number }>;\n};\n\n/**\n * NIP-09 application plan for a kind 5 event.\n *\n * - `e` tags: delete only when the target exists, is not itself kind 5, and shares pubkey.\n * - Unknown `e` ids are pending until the event arrives (client MUST validate pubkey).\n * - `a` tags: tombstone that coordinate up to this deletion's `created_at` when pubkey matches.\n * - Deleting a deletion request is a no-op.\n */\nexport function planDeletion(\n  deletion: Pick<Event, \"pubkey\" | \"created_at\" | \"tags\">,\n  getById: (id: string) => Pick<Event, \"id\" | \"pubkey\" | \"kind\"> | undefined,\n): DeletionPlan {\n  const { pubkey } = deletion;\n  const removeIds: string[] = [];\n  const pendingIds: Array<{ id: string; pubkey: string }> = [];\n  const coordinates: Array<{ key: string; until: number }> = [];\n  const seenIds = new Set<string>();\n  const seenCoords = new Set<string>();\n\n  for (const tag of deletion.tags) {\n    if (tag[0] === \"e\" && tag[1] !== undefined && isHex32(tag[1].toLowerCase())) {\n      const id = tag[1].toLowerCase();\n      if (seenIds.has(id)) {\n        continue;\n      }\n      seenIds.add(id);\n      const existing = getById(id);\n      if (!existing) {\n        pendingIds.push({ id, pubkey });\n        continue;\n      }\n      if (existing.kind === Kind.EventDeletion) {\n        continue;\n      }\n      if (existing.pubkey !== pubkey) {\n        continue;\n      }\n      removeIds.push(id);\n      continue;\n    }\n\n    if (tag[0] === \"a\" && tag[1] !== undefined) {\n      const coord = parseEventAddress(tag[1]);\n      if (!coord || coord.pubkey !== pubkey) {\n        continue;\n      }\n      const key = `${coord.kind}:${coord.pubkey}:${coord.identifier}`;\n      if (seenCoords.has(key)) {\n        continue;\n      }\n      seenCoords.add(key);\n      coordinates.push({ key, until: deletion.created_at });\n    }\n  }\n\n  return { removeIds, pendingIds, coordinates };\n}\n\n/** In-memory NIP-09 tombstones shared by MemoryEventStore and IndexedDbEventStore. */\nexport class DeletionState {\n  readonly ids: Set<string> = new Set<string>();\n  readonly pending: Map<string, string> = new Map<string, string>();\n  readonly coordinates: Map<string, number> = new Map<string, number>();\n\n  clear(): void {\n    this.ids.clear();\n    this.pending.clear();\n    this.coordinates.clear();\n  }\n\n  covers(event: Pick<Event, \"id\" | \"pubkey\" | \"kind\" | \"created_at\" | \"tags\">): boolean {\n    if (this.ids.has(event.id)) {\n      return true;\n    }\n    if (event.kind === Kind.EventDeletion) {\n      return false;\n    }\n    const pendingPk = this.pending.get(event.id);\n    if (pendingPk !== undefined && event.pubkey === pendingPk) {\n      return true;\n    }\n    const addr = eventAddress(event);\n    if (addr === undefined) {\n      return false;\n    }\n    const until = this.coordinates.get(addr);\n    return until !== undefined && event.created_at <= until;\n  }\n\n  absorb(plan: DeletionPlan): void {\n    for (const id of plan.removeIds) {\n      this.ids.add(id);\n      this.pending.delete(id);\n    }\n    for (const p of plan.pendingIds) {\n      if (!this.ids.has(p.id)) {\n        this.pending.set(p.id, p.pubkey);\n      }\n    }\n    for (const c of plan.coordinates) {\n      const prev = this.coordinates.get(c.key) ?? Number.NEGATIVE_INFINITY;\n      // Re-absorbing a coordinate moves it to the newest end so FIFO\n      // tombstone caps evict the oldest marker, not the freshest.\n      this.coordinates.delete(c.key);\n      this.coordinates.set(c.key, Math.max(prev, c.until));\n    }\n  }\n}\n\nexport function coordinateRemovals(\n  coordinates: ReadonlyArray<{ key: string; until: number }>,\n  getCurrent: (key: string) => Pick<Event, \"id\" | \"created_at\"> | undefined,\n): string[] {\n  const ids: string[] = [];\n  for (const c of coordinates) {\n    const current = getCurrent(c.key);\n    if (current && current.created_at <= c.until) {\n      ids.push(current.id);\n    }\n  }\n  return ids;\n}\n","import type { Event } from \"../core/event.ts\";\nimport { isReplaceableWinner, validateSignedEvent } from \"../core/event.ts\";\nimport { isEphemeralKind, Kind } from \"../core/kind.ts\";\nimport { eventAddress } from \"../core/tag.ts\";\nimport { coordinateRemovals, planDeletion } from \"./deletion.ts\";\nimport type { DeletionPlan, DeletionState } from \"./deletion.ts\";\nimport type { PutResult } from \"./types.ts\";\n\nexport function outboxBoundKey(pubkey: string, kind: number): string {\n  return `${pubkey.toLowerCase()}:${kind}`;\n}\n\nexport type PutDecision =\n  | {\n      readonly action: \"skip\";\n      readonly result: \"duplicate\" | \"ephemeral\" | \"rejected\" | \"invalid\";\n      readonly event: Event;\n    }\n  | { readonly action: \"tombstone\"; readonly result: \"duplicate\"; readonly event: Event }\n  | {\n      readonly action: \"delete\";\n      readonly result: \"deleted\";\n      readonly event: Event;\n      readonly plan: DeletionPlan;\n      readonly coordIds: ReadonlyArray<string>;\n    }\n  | {\n      readonly action: \"insert\";\n      readonly result: \"accepted\" | \"replaced\";\n      readonly event: Event;\n      readonly address?: string | undefined;\n      readonly replaceId?: string | undefined;\n    };\n\nexport type PutLookup = {\n  deletion: DeletionState;\n  getById: (\n    id: string,\n  ) => Pick<Event, \"id\" | \"pubkey\" | \"kind\" | \"created_at\" | \"tags\"> | undefined;\n  /**\n   * Current replaceable winner for an address. `evicted: true` marks an eviction watermark: the\n   * winning event body was dropped, but its id/created_at still reject older versions, and a re-put\n   * of the watermarked id re-inserts it.\n   */\n  getReplaceable: (\n    address: string,\n  ) => (Pick<Event, \"id\" | \"created_at\"> & { evicted?: boolean }) | undefined;\n};\n\nexport function decidePut(raw: Event, lookup: PutLookup): PutDecision {\n  // Canonical-input precondition: non-canonical events are never indexed.\n  if (!validateSignedEvent(raw)) {\n    return { action: \"skip\", result: \"invalid\", event: raw };\n  }\n  const event = raw;\n  if (lookup.deletion.ids.has(event.id) || lookup.getById(event.id)) {\n    return { action: \"skip\", result: \"duplicate\", event };\n  }\n  if (event.kind === Kind.EventDeletion) {\n    const plan = planDeletion(event, lookup.getById);\n    const coordIds = coordinateRemovals(plan.coordinates, lookup.getReplaceable);\n    return { action: \"delete\", result: \"deleted\", event, plan, coordIds };\n  }\n  if (lookup.deletion.covers(event)) {\n    return { action: \"tombstone\", result: \"duplicate\", event };\n  }\n  if (isEphemeralKind(event.kind)) {\n    return { action: \"skip\", result: \"ephemeral\", event };\n  }\n  const address = eventAddress(event);\n  if (address !== undefined) {\n    const prev = lookup.getReplaceable(address);\n    // A stored incumbent rejects stale versions; an eviction watermark does\n    // the same, except a re-put of the watermarked id re-inserts it.\n    if (prev && prev.id !== event.id && !isReplaceableWinner(event, prev)) {\n      return { action: \"skip\", result: \"rejected\", event };\n    }\n    if (prev !== undefined && prev.evicted !== true) {\n      return { action: \"insert\", result: \"replaced\", event, address, replaceId: prev.id };\n    }\n    return { action: \"insert\", result: \"accepted\", event, address };\n  }\n  return { action: \"insert\", result: \"accepted\", event };\n}\n\nexport function applyPutMemory(\n  s: {\n    deletion: DeletionState;\n    indexInsert: (event: Event) => void;\n    indexRemove: (id: string) => boolean;\n  },\n  d: PutDecision,\n): PutResult {\n  if (d.action === \"skip\") {\n    return d.result;\n  }\n  if (d.action === \"tombstone\") {\n    s.deletion.ids.add(d.event.id);\n    s.deletion.pending.delete(d.event.id);\n    return \"duplicate\";\n  }\n  if (d.action === \"delete\") {\n    s.deletion.pending.delete(d.event.id);\n    s.deletion.absorb(d.plan);\n    for (const id of d.plan.removeIds) {\n      s.indexRemove(id);\n    }\n    for (const id of d.coordIds) {\n      s.deletion.ids.add(id);\n      s.indexRemove(id);\n    }\n    s.indexInsert(d.event);\n    return \"deleted\";\n  }\n  if (d.replaceId !== undefined) {\n    s.indexRemove(d.replaceId);\n  }\n  s.indexInsert(d.event);\n  return d.result;\n}\n"],"mappings":";;;;;;;;;;;;AAsBA,SAAgB,aACd,UACA,SACc;CACd,MAAM,EAAE,WAAW;CACnB,MAAM,YAAsB,CAAC;CAC7B,MAAM,aAAoD,CAAC;CAC3D,MAAM,cAAqD,CAAC;CAC5D,MAAM,0BAAU,IAAI,IAAY;CAChC,MAAM,6BAAa,IAAI,IAAY;CAEnC,KAAK,MAAM,OAAO,SAAS,MAAM;EAC/B,IAAI,IAAI,OAAO,OAAO,IAAI,OAAO,KAAA,KAAa,QAAQ,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG;GAC3E,MAAM,KAAK,IAAI,EAAE,CAAC,YAAY;GAC9B,IAAI,QAAQ,IAAI,EAAE,GAChB;GAEF,QAAQ,IAAI,EAAE;GACd,MAAM,WAAW,QAAQ,EAAE;GAC3B,IAAI,CAAC,UAAU;IACb,WAAW,KAAK;KAAE;KAAI;IAAO,CAAC;IAC9B;GACF;GACA,IAAI,SAAS,SAAS,KAAK,eACzB;GAEF,IAAI,SAAS,WAAW,QACtB;GAEF,UAAU,KAAK,EAAE;GACjB;EACF;EAEA,IAAI,IAAI,OAAO,OAAO,IAAI,OAAO,KAAA,GAAW;GAC1C,MAAM,QAAQ,kBAAkB,IAAI,EAAE;GACtC,IAAI,CAAC,SAAS,MAAM,WAAW,QAC7B;GAEF,MAAM,MAAM,GAAG,MAAM,KAAK,GAAG,MAAM,OAAO,GAAG,MAAM;GACnD,IAAI,WAAW,IAAI,GAAG,GACpB;GAEF,WAAW,IAAI,GAAG;GAClB,YAAY,KAAK;IAAE;IAAK,OAAO,SAAS;GAAW,CAAC;EACtD;CACF;CAEA,OAAO;EAAE;EAAW;EAAY;CAAY;AAC9C;;AAGA,IAAa,gBAAb,MAA2B;CACzB,sBAA4B,IAAI,IAAY;CAC5C,0BAAwC,IAAI,IAAoB;CAChE,8BAA4C,IAAI,IAAoB;CAEpE,QAAc;EACZ,KAAK,IAAI,MAAM;EACf,KAAK,QAAQ,MAAM;EACnB,KAAK,YAAY,MAAM;CACzB;CAEA,OAAO,OAA+E;EACpF,IAAI,KAAK,IAAI,IAAI,MAAM,EAAE,GACvB,OAAO;EAET,IAAI,MAAM,SAAS,KAAK,eACtB,OAAO;EAET,MAAM,YAAY,KAAK,QAAQ,IAAI,MAAM,EAAE;EAC3C,IAAI,cAAc,KAAA,KAAa,MAAM,WAAW,WAC9C,OAAO;EAET,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,GACX,OAAO;EAET,MAAM,QAAQ,KAAK,YAAY,IAAI,IAAI;EACvC,OAAO,UAAU,KAAA,KAAa,MAAM,cAAc;CACpD;CAEA,OAAO,MAA0B;EAC/B,KAAK,MAAM,MAAM,KAAK,WAAW;GAC/B,KAAK,IAAI,IAAI,EAAE;GACf,KAAK,QAAQ,OAAO,EAAE;EACxB;EACA,KAAK,MAAM,KAAK,KAAK,YACnB,IAAI,CAAC,KAAK,IAAI,IAAI,EAAE,EAAE,GACpB,KAAK,QAAQ,IAAI,EAAE,IAAI,EAAE,MAAM;EAGnC,KAAK,MAAM,KAAK,KAAK,aAAa;GAChC,MAAM,OAAO,KAAK,YAAY,IAAI,EAAE,GAAG,KAAK,OAAO;GAGnD,KAAK,YAAY,OAAO,EAAE,GAAG;GAC7B,KAAK,YAAY,IAAI,EAAE,KAAK,KAAK,IAAI,MAAM,EAAE,KAAK,CAAC;EACrD;CACF;AACF;AAEA,SAAgB,mBACd,aACA,YACU;CACV,MAAM,MAAgB,CAAC;CACvB,KAAK,MAAM,KAAK,aAAa;EAC3B,MAAM,UAAU,WAAW,EAAE,GAAG;EAChC,IAAI,WAAW,QAAQ,cAAc,EAAE,OACrC,IAAI,KAAK,QAAQ,EAAE;CAEvB;CACA,OAAO;AACT;;;AC/HA,SAAgB,eAAe,QAAgB,MAAsB;CACnE,OAAO,GAAG,OAAO,YAAY,EAAE,GAAG;AACpC;AAuCA,SAAgB,UAAU,KAAY,QAAgC;CAEpE,IAAI,CAAC,oBAAoB,GAAG,GAC1B,OAAO;EAAE,QAAQ;EAAQ,QAAQ;EAAW,OAAO;CAAI;CAEzD,MAAM,QAAQ;CACd,IAAI,OAAO,SAAS,IAAI,IAAI,MAAM,EAAE,KAAK,OAAO,QAAQ,MAAM,EAAE,GAC9D,OAAO;EAAE,QAAQ;EAAQ,QAAQ;EAAa;CAAM;CAEtD,IAAI,MAAM,SAAS,KAAK,eAAe;EACrC,MAAM,OAAO,aAAa,OAAO,OAAO,OAAO;EAE/C,OAAO;GAAE,QAAQ;GAAU,QAAQ;GAAW;GAAO;GAAM,UAD1C,mBAAmB,KAAK,aAAa,OAAO,cACK;EAAE;CACtE;CACA,IAAI,OAAO,SAAS,OAAO,KAAK,GAC9B,OAAO;EAAE,QAAQ;EAAa,QAAQ;EAAa;CAAM;CAE3D,IAAI,gBAAgB,MAAM,IAAI,GAC5B,OAAO;EAAE,QAAQ;EAAQ,QAAQ;EAAa;CAAM;CAEtD,MAAM,UAAU,aAAa,KAAK;CAClC,IAAI,YAAY,KAAA,GAAW;EACzB,MAAM,OAAO,OAAO,eAAe,OAAO;EAG1C,IAAI,QAAQ,KAAK,OAAO,MAAM,MAAM,CAAC,oBAAoB,OAAO,IAAI,GAClE,OAAO;GAAE,QAAQ;GAAQ,QAAQ;GAAY;EAAM;EAErD,IAAI,SAAS,KAAA,KAAa,KAAK,YAAY,MACzC,OAAO;GAAE,QAAQ;GAAU,QAAQ;GAAY;GAAO;GAAS,WAAW,KAAK;EAAG;EAEpF,OAAO;GAAE,QAAQ;GAAU,QAAQ;GAAY;GAAO;EAAQ;CAChE;CACA,OAAO;EAAE,QAAQ;EAAU,QAAQ;EAAY;CAAM;AACvD;AAEA,SAAgB,eACd,GAKA,GACW;CACX,IAAI,EAAE,WAAW,QACf,OAAO,EAAE;CAEX,IAAI,EAAE,WAAW,aAAa;EAC5B,EAAE,SAAS,IAAI,IAAI,EAAE,MAAM,EAAE;EAC7B,EAAE,SAAS,QAAQ,OAAO,EAAE,MAAM,EAAE;EACpC,OAAO;CACT;CACA,IAAI,EAAE,WAAW,UAAU;EACzB,EAAE,SAAS,QAAQ,OAAO,EAAE,MAAM,EAAE;EACpC,EAAE,SAAS,OAAO,EAAE,IAAI;EACxB,KAAK,MAAM,MAAM,EAAE,KAAK,WACtB,EAAE,YAAY,EAAE;EAElB,KAAK,MAAM,MAAM,EAAE,UAAU;GAC3B,EAAE,SAAS,IAAI,IAAI,EAAE;GACrB,EAAE,YAAY,EAAE;EAClB;EACA,EAAE,YAAY,EAAE,KAAK;EACrB,OAAO;CACT;CACA,IAAI,EAAE,cAAc,KAAA,GAClB,EAAE,YAAY,EAAE,SAAS;CAE3B,EAAE,YAAY,EAAE,KAAK;CACrB,OAAO,EAAE;AACX"}