@qntx/nostr 0.12.1 → 0.13.0

package/dist/memory-index-Bhwe0ZdG.mjs

@@ -1,374 +0,0 @@
-import { S as parseEventAddress, _ as eventAddress, f as sortEvents, o as itemCompare, t as compareEventsDesc, y as formatEventAddress } from "./event-B3ua2_oL.mjs";
-import { a as matchFilter } from "./filter-B16P33dz.mjs";
-import { i as trimOldest, n as removeFromSetMap, t as addToSetMap } from "./collections-DtwMc1NU.mjs";
-import { i as DeletionState, n as decidePut, r as outboxBoundKey, t as applyPutMemory } from "./put-DRmV1wHD.mjs";
-//#region src/storage/memory-index.ts
-/**
-* Synchronous in-memory event index with NIP-01 replaceable / addressable / ephemeral handling and
-* NIP-09 deletion (kind 5) application. Shared by {@link MemoryEventStore} (async facade) and
-* `ReactiveEventStore`.
-*/
-var MemoryIndex = class {
-	#byId = /* @__PURE__ */ new Map();
-	#byPubkey = /* @__PURE__ */ new Map();
-	#byKind = /* @__PURE__ */ new Map();
-	#byKindPubkey = /* @__PURE__ */ new Map();
-	#byEpTag = /* @__PURE__ */ new Map();
-	#replaceable = /* @__PURE__ */ new Map();
-	#watermarks = /* @__PURE__ */ new Map();
-	#watermarkIds = /* @__PURE__ */ new Map();
-	#deletion = new DeletionState();
-	#outboxBounds = /* @__PURE__ */ new Map();
-	#maxTombstones;
-	#maxWatermarks;
-	#onInsert;
-	#onRemove;
-	constructor(opts) {
-		this.#maxTombstones = opts?.maxTombstones;
-		this.#maxWatermarks = opts?.maxWatermarks ?? 0;
-		this.#onInsert = opts?.onInsert;
-		this.#onRemove = opts?.onRemove;
-	}
-	put(raw) {
-		const lookup = {
-			deletion: this.#deletion,
-			getById: (id) => this.#byId.get(id),
-			getReplaceable: (addr) => {
-				const id = this.#replaceable.get(addr);
-				const ev = id === void 0 ? void 0 : this.#byId.get(id);
-				if (ev) return {
-					id: ev.id,
-					created_at: ev.created_at
-				};
-				const watermark = this.#watermarks.get(addr);
-				return watermark === void 0 ? void 0 : {
-					...watermark,
-					evicted: true
-				};
-			}
-		};
-		const decision = decidePut(raw, lookup);
-		if (decision.action === "delete") {
-			for (const p of decision.plan.pendingIds) this.#dropWatermarkId(p.id);
-			for (const c of decision.plan.coordinates) this.#dropWatermark(c.key);
-		}
-		const result = applyPutMemory({
-			deletion: this.#deletion,
-			indexInsert: (e) => this.#indexInsert(e),
-			indexRemove: (id) => this.#indexRemove(id)
-		}, decision);
-		this.#trimTombstones();
-		return result;
-	}
-	/** Sequential `put` in input order. */
-	putMany(events) {
-		const results = [];
-		for (const event of events) results.push(this.put(event));
-		return results;
-	}
-	get(id) {
-		const key = id.toLowerCase();
-		if (this.#deletion.ids.has(key)) return;
-		return this.#byId.get(key);
-	}
-	/** Current event at a `kind:pubkey:d` coordinate (replaceable or addressable). */
-	getByAddress(address) {
-		const coord = parseEventAddress(address);
-		if (!coord) return;
-		const id = this.#replaceable.get(formatEventAddress(coord.kind, coord.pubkey, coord.identifier));
-		if (id === void 0) return;
-		if (this.#deletion.ids.has(id)) return;
-		return this.#byId.get(id);
-	}
-	query(filters) {
-		const seen = /* @__PURE__ */ new Set();
-		const events = [];
-		for (const filter of filters) for (const event of this.#matchedEvents(filter)) {
-			if (seen.has(event.id)) continue;
-			seen.add(event.id);
-			events.push(event);
-		}
-		sortEvents(events);
-		return events;
-	}
-	count(filters) {
-		const seen = /* @__PURE__ */ new Set();
-		for (const filter of filters) for (const event of this.#matchedEvents(filter)) seen.add(event.id);
-		return seen.size;
-	}
-	negentropyItems(filter) {
-		if (filter.limit === 0) return [];
-		const items = [];
-		this.#eachCandidate(filter, (event) => {
-			if (this.#deletion.covers(event)) return;
-			if (!matchFilter(filter, event)) return;
-			items.push({
-				id: event.id,
-				created_at: event.created_at
-			});
-		});
-		if (filter.limit !== void 0) {
-			items.sort(compareEventsDesc);
-			if (items.length > filter.limit) items.length = filter.limit;
-		}
-		items.sort(itemCompare);
-		return items;
-	}
-	/** Remove by id and tombstone (like a local NIP-09). Returns removed count. */
-	remove(ids) {
-		let n = 0;
-		for (const raw of ids) {
-			const id = raw.toLowerCase();
-			if (this.#indexRemove(id)) n += 1;
-			this.#deletion.ids.add(id);
-			this.#deletion.pending.delete(id);
-		}
-		this.#trimTombstones();
-		return n;
-	}
-	/**
-	* Remove by id without writing a tombstone (LRU eviction). When the evicted event is the current
-	* winner of a replaceable/addressable address, a `{ id, created_at }` watermark is recorded so
-	* stale versions stay rejected while the body is gone; the watermarks are FIFO-bounded by
-	* `maxWatermarks`.
-	*/
-	evict(ids) {
-		let n = 0;
-		for (const raw of ids) {
-			const id = raw.toLowerCase();
-			const event = this.#byId.get(id);
-			if (event === void 0) continue;
-			const addr = eventAddress(event);
-			const winner = addr !== void 0 && this.#replaceable.get(addr) === id;
-			if (this.#indexRemove(id)) n += 1;
-			if (winner) this.#setWatermark(addr, {
-				id,
-				created_at: event.created_at
-			});
-		}
-		return n;
-	}
-	/**
-	* True when the id is tombstoned, or the coordinate has a deletion marker that still covers the
-	* current event at that address: a replacement published after the marker's `until` clears the
-	* deletion. Coordinates are matched on the canonical lowercase pubkey.
-	*/
-	isDeleted(idOrAddress) {
-		if (this.#deletion.ids.has(idOrAddress.toLowerCase())) return true;
-		const coord = parseEventAddress(idOrAddress);
-		if (!coord) return false;
-		const address = formatEventAddress(coord.kind, coord.pubkey, coord.identifier);
-		const until = this.#deletion.coordinates.get(address);
-		if (until === void 0) return false;
-		const id = this.#replaceable.get(address);
-		if (id === void 0) return true;
-		const event = this.#byId.get(id);
-		return event === void 0 || event.created_at <= until;
-	}
-	getOutboxBound(pubkey, kind) {
-		const persisted = this.#outboxBounds.get(outboxBoundKey(pubkey, kind));
-		if (persisted) return {
-			oldest: persisted.oldest,
-			newest: persisted.newest
-		};
-		return this.#deriveOutboxBound(pubkey, kind);
-	}
-	setOutboxBound(pubkey, kind, bound) {
-		this.#outboxBounds.set(outboxBoundKey(pubkey, kind), {
-			oldest: bound.oldest,
-			newest: bound.newest
-		});
-	}
-	clear() {
-		if (this.#onRemove) for (const event of this.#byId.values()) this.#onRemove(event);
-		this.#byId.clear();
-		this.#byPubkey.clear();
-		this.#byKind.clear();
-		this.#byKindPubkey.clear();
-		this.#byEpTag.clear();
-		this.#replaceable.clear();
-		this.#watermarks.clear();
-		this.#watermarkIds.clear();
-		this.#deletion.clear();
-		this.#outboxBounds.clear();
-	}
-	get size() {
-		return this.#byId.size;
-	}
-	#indexInsert(event) {
-		this.#byId.set(event.id, event);
-		const { pubkey } = event;
-		addToSetMap(this.#byPubkey, pubkey, event.id);
-		addToSetMap(this.#byKind, event.kind, event.id);
-		addToSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, event.id);
-		for (const tag of event.tags) {
-			if (tag[0] !== "e" && tag[0] !== "p" || tag[1] === void 0) continue;
-			addToSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, event.id);
-		}
-		const addr = eventAddress(event);
-		if (addr !== void 0) {
-			this.#replaceable.set(addr, event.id);
-			this.#dropWatermark(addr);
-		}
-		this.#onInsert?.(event);
-	}
-	#indexRemove(id) {
-		this.#dropWatermarkId(id);
-		const event = this.#byId.get(id);
-		if (!event) return false;
-		this.#byId.delete(id);
-		const { pubkey } = event;
-		removeFromSetMap(this.#byPubkey, pubkey, id);
-		removeFromSetMap(this.#byKind, event.kind, id);
-		removeFromSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, id);
-		for (const tag of event.tags) {
-			if (tag[0] !== "e" && tag[0] !== "p" || tag[1] === void 0) continue;
-			removeFromSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, id);
-		}
-		const addr = eventAddress(event);
-		if (addr !== void 0 && this.#replaceable.get(addr) === id) this.#replaceable.delete(addr);
-		this.#onRemove?.(event);
-		return true;
-	}
-	#matchedEvents(filter) {
-		if (filter.limit === 0) return [];
-		const matched = [];
-		this.#eachCandidate(filter, (event) => {
-			if (this.#deletion.covers(event)) return;
-			if (!matchFilter(filter, event)) return;
-			matched.push(event);
-		});
-		sortEvents(matched);
-		return filter.limit === void 0 ? matched : matched.slice(0, filter.limit);
-	}
-	#deriveOutboxBound(pubkey, kind) {
-		const byPk = this.#byPubkey.get(pubkey.toLowerCase());
-		const byKind = this.#byKind.get(kind);
-		if (!byPk || !byKind) return;
-		let oldest;
-		let newest;
-		for (const id of byPk) {
-			if (!byKind.has(id) || this.#deletion.ids.has(id)) continue;
-			const event = this.#byId.get(id);
-			if (!event || this.#deletion.covers(event)) continue;
-			if (oldest === void 0 || event.created_at < oldest) oldest = event.created_at;
-			if (newest === void 0 || event.created_at > newest) newest = event.created_at;
-		}
-		if (oldest === void 0 || newest === void 0) return;
-		return {
-			oldest,
-			newest
-		};
-	}
-	#eachCandidate(filter, visit) {
-		if (filter.ids) {
-			const seen = /* @__PURE__ */ new Set();
-			for (const raw of filter.ids) {
-				const event = this.#byId.get(raw.toLowerCase());
-				if (!event || seen.has(event.id)) continue;
-				seen.add(event.id);
-				visit(event);
-			}
-			return;
-		}
-		if (filter.authors && filter.kinds) {
-			const seen = /* @__PURE__ */ new Set();
-			for (const pk of filter.authors) {
-				const pubkey = pk.toLowerCase();
-				for (const kind of filter.kinds) {
-					const ids = this.#byKindPubkey.get(`${kind}:${pubkey}`);
-					if (!ids) continue;
-					for (const id of ids) {
-						if (seen.has(id)) continue;
-						seen.add(id);
-						const event = this.#byId.get(id);
-						if (event) visit(event);
-					}
-				}
-			}
-			return;
-		}
-		if (filter.authors) {
-			const seen = /* @__PURE__ */ new Set();
-			for (const pk of filter.authors) {
-				const byPk = this.#byPubkey.get(pk.toLowerCase());
-				if (!byPk) continue;
-				for (const id of byPk) {
-					if (seen.has(id)) continue;
-					seen.add(id);
-					const event = this.#byId.get(id);
-					if (event) visit(event);
-				}
-			}
-			return;
-		}
-		if (filter.kinds) {
-			const seen = /* @__PURE__ */ new Set();
-			for (const kind of filter.kinds) {
-				const byKind = this.#byKind.get(kind);
-				if (!byKind) continue;
-				for (const id of byKind) {
-					if (seen.has(id)) continue;
-					seen.add(id);
-					const event = this.#byId.get(id);
-					if (event) visit(event);
-				}
-			}
-			return;
-		}
-		const eTags = filter["#e"];
-		const pTags = filter["#p"];
-		if (eTags !== void 0 || pTags !== void 0) {
-			const seen = /* @__PURE__ */ new Set();
-			visitEpTagIds(this.#byEpTag, this.#byId, "e", eTags, seen, visit);
-			visitEpTagIds(this.#byEpTag, this.#byId, "p", pTags, seen, visit);
-			return;
-		}
-		for (const event of this.#byId.values()) visit(event);
-	}
-	#setWatermark(addr, watermark) {
-		if (this.#maxWatermarks === 0) return;
-		this.#dropWatermark(addr);
-		this.#watermarks.set(addr, watermark);
-		this.#watermarkIds.set(watermark.id, addr);
-		trimOldest(this.#watermarks, this.#maxWatermarks, (a) => this.#dropWatermark(a));
-	}
-	#dropWatermark(addr) {
-		const watermark = this.#watermarks.get(addr);
-		if (watermark === void 0) return;
-		this.#watermarks.delete(addr);
-		this.#watermarkIds.delete(watermark.id);
-	}
-	#dropWatermarkId(id) {
-		const addr = this.#watermarkIds.get(id);
-		if (addr === void 0) return;
-		this.#watermarkIds.delete(id);
-		this.#watermarks.delete(addr);
-	}
-	#trimTombstones() {
-		const cap = this.#maxTombstones;
-		if (cap === void 0) return;
-		trimOldest(this.#deletion.ids, cap, (id) => {
-			this.#deletion.pending.delete(id);
-		});
-		trimOldest(this.#deletion.pending, cap);
-		trimOldest(this.#deletion.coordinates, cap);
-	}
-};
-function visitEpTagIds(byEpTag, byId, name, values, seen, visit) {
-	if (values === void 0) return;
-	for (const value of values) {
-		const ids = byEpTag.get(`${name}:${value.toLowerCase()}`);
-		if (!ids) continue;
-		for (const id of ids) {
-			if (seen.has(id)) continue;
-			seen.add(id);
-			const event = byId.get(id);
-			if (event) visit(event);
-		}
-	}
-}
-//#endregion
-export { MemoryIndex as t };
-
-//# sourceMappingURL=memory-index-Bhwe0ZdG.mjs.map

package/dist/memory-index-Bhwe0ZdG.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-index-Bhwe0ZdG.mjs","names":[],"sources":["../src/storage/memory-index.ts"],"sourcesContent":["import { addToSetMap, removeFromSetMap, trimOldest } from \"../core/collections.ts\";\nimport type { Event } from \"../core/event.ts\";\nimport { compareEventsDesc, itemCompare, sortEvents } from \"../core/event.ts\";\nimport type { Filter } from \"../core/filter.ts\";\nimport { matchFilter } from \"../core/filter.ts\";\nimport { eventAddress, formatEventAddress, parseEventAddress } from \"../core/tag.ts\";\nimport { DeletionState } from \"./deletion.ts\";\nimport { applyPutMemory, decidePut, outboxBoundKey } from \"./put.ts\";\nimport type { PutLookup } from \"./put.ts\";\nimport type { NegentropyItem, OutboxBound, PutResult } from \"./types.ts\";\n\nexport type MemoryIndexOptions = {\n  /**\n   * FIFO cap applied independently to each deletion-state collection: tombstoned event ids, pending\n   * e-tag ids, and coordinate tombstones. Default unbounded. Trade-off: once an entry is trimmed, a\n   * re-arriving old deleted event or replaceable version can be accepted again.\n   */\n  maxTombstones?: number | undefined;\n  /**\n   * FIFO cap on replaceable/addressable winner watermarks recorded by {@link evict}. A watermark\n   * keeps only `{ id, created_at }` per address so stale versions stay rejected after the winner's\n   * body is evicted, and a re-put of the watermarked id re-inserts it. Default 0 (no watermark\n   * retention); callers that evict should pass a bound. Once a watermark is trimmed, an older\n   * evicted version can be accepted again — the same trade-off as deletion tombstones.\n   */\n  maxWatermarks?: number | undefined;\n  /** Fires after every physical index insert (accept, replace, deletion event). */\n  onInsert?: ((event: Event) => void) | undefined;\n  /** Fires after every physical index remove (replace, delete, evict, remove, clear). */\n  onRemove?: ((event: Event) => void) | undefined;\n};\n\n/**\n * Synchronous in-memory event index with NIP-01 replaceable / addressable / ephemeral handling and\n * NIP-09 deletion (kind 5) application. Shared by {@link MemoryEventStore} (async facade) and\n * `ReactiveEventStore`.\n */\nexport class MemoryIndex {\n  readonly #byId = new Map<string, Event>();\n  readonly #byPubkey = new Map<string, Set<string>>();\n  readonly #byKind = new Map<number, Set<string>>();\n  readonly #byKindPubkey = new Map<string, Set<string>>(); // `${kind}:${pubkey}` → ids\n  readonly #byEpTag = new Map<string, Set<string>>(); // `${\"e\"|\"p\"}:${value.toLowerCase()}` → ids\n  readonly #replaceable = new Map<string, string>(); // address -> event id\n  // address -> last evicted winner; insertion order is the FIFO trim order\n  readonly #watermarks = new Map<string, { id: string; created_at: number }>();\n  // winner id -> address reverse index for O(1) watermark drops on deletion\n  readonly #watermarkIds = new Map<string, string>();\n  readonly #deletion = new DeletionState();\n  readonly #outboxBounds = new Map<string, OutboxBound>();\n  readonly #maxTombstones: number | undefined;\n  readonly #maxWatermarks: number;\n  readonly #onInsert: ((event: Event) => void) | undefined;\n  readonly #onRemove: ((event: Event) => void) | undefined;\n\n  constructor(opts?: MemoryIndexOptions) {\n    this.#maxTombstones = opts?.maxTombstones;\n    this.#maxWatermarks = opts?.maxWatermarks ?? 0;\n    this.#onInsert = opts?.onInsert;\n    this.#onRemove = opts?.onRemove;\n  }\n\n  put(raw: Event): PutResult {\n    const lookup: PutLookup = {\n      deletion: this.#deletion,\n      getById: (id) => this.#byId.get(id),\n      getReplaceable: (addr) => {\n        const id = this.#replaceable.get(addr);\n        const ev = id === undefined ? undefined : this.#byId.get(id);\n        if (ev) {\n          return { id: ev.id, created_at: ev.created_at };\n        }\n        const watermark = this.#watermarks.get(addr);\n        return watermark === undefined ? undefined : { ...watermark, evicted: true };\n      },\n    };\n    const decision = decidePut(raw, lookup);\n    if (decision.action === \"delete\") {\n      // Pending e-tag targets and coordinate tombstones never reach\n      // indexRemove — drop their watermarks here.\n      for (const p of decision.plan.pendingIds) {\n        this.#dropWatermarkId(p.id);\n      }\n      for (const c of decision.plan.coordinates) {\n        this.#dropWatermark(c.key);\n      }\n    }\n    const result = applyPutMemory(\n      {\n        deletion: this.#deletion,\n        indexInsert: (e) => this.#indexInsert(e),\n        indexRemove: (id) => this.#indexRemove(id),\n      },\n      decision,\n    );\n    this.#trimTombstones();\n    return result;\n  }\n\n  /** Sequential `put` in input order. */\n  putMany(events: ReadonlyArray<Event>): PutResult[] {\n    const results: PutResult[] = [];\n    for (const event of events) {\n      results.push(this.put(event));\n    }\n    return results;\n  }\n\n  get(id: string): Event | undefined {\n    const key = id.toLowerCase();\n    if (this.#deletion.ids.has(key)) {\n      return undefined;\n    }\n    return this.#byId.get(key);\n  }\n\n  /** Current event at a `kind:pubkey:d` coordinate (replaceable or addressable). */\n  getByAddress(address: string): Event | undefined {\n    const coord = parseEventAddress(address);\n    if (!coord) {\n      return undefined;\n    }\n    const id = this.#replaceable.get(\n      formatEventAddress(coord.kind, coord.pubkey, coord.identifier),\n    );\n    if (id === undefined) {\n      return undefined;\n    }\n    if (this.#deletion.ids.has(id)) {\n      return undefined;\n    }\n    return this.#byId.get(id);\n  }\n\n  query(filters: ReadonlyArray<Filter>): Event[] {\n    const seen = new Set<string>();\n    const events: Event[] = [];\n    for (const filter of filters) {\n      for (const event of this.#matchedEvents(filter)) {\n        if (seen.has(event.id)) {\n          continue;\n        }\n        seen.add(event.id);\n        events.push(event);\n      }\n    }\n    sortEvents(events);\n    return events;\n  }\n\n  count(filters: ReadonlyArray<Filter>): number {\n    const seen = new Set<string>();\n    for (const filter of filters) {\n      for (const event of this.#matchedEvents(filter)) {\n        seen.add(event.id);\n      }\n    }\n    return seen.size;\n  }\n\n  negentropyItems(filter: Filter): NegentropyItem[] {\n    if (filter.limit === 0) {\n      return [];\n    }\n    const items: NegentropyItem[] = [];\n    this.#eachCandidate(filter, (event) => {\n      if (this.#deletion.covers(event)) {\n        return;\n      }\n      if (!matchFilter(filter, event)) {\n        return;\n      }\n      items.push({ id: event.id, created_at: event.created_at });\n    });\n    if (filter.limit !== undefined) {\n      items.sort(compareEventsDesc);\n      if (items.length > filter.limit) {\n        items.length = filter.limit;\n      }\n    }\n    items.sort(itemCompare);\n    return items;\n  }\n\n  /** Remove by id and tombstone (like a local NIP-09). Returns removed count. */\n  remove(ids: ReadonlyArray<string>): number {\n    let n = 0;\n    for (const raw of ids) {\n      const id = raw.toLowerCase();\n      if (this.#indexRemove(id)) {\n        n += 1;\n      }\n      this.#deletion.ids.add(id);\n      this.#deletion.pending.delete(id);\n    }\n    this.#trimTombstones();\n    return n;\n  }\n\n  /**\n   * Remove by id without writing a tombstone (LRU eviction). When the evicted event is the current\n   * winner of a replaceable/addressable address, a `{ id, created_at }` watermark is recorded so\n   * stale versions stay rejected while the body is gone; the watermarks are FIFO-bounded by\n   * `maxWatermarks`.\n   */\n  evict(ids: ReadonlyArray<string>): number {\n    let n = 0;\n    for (const raw of ids) {\n      const id = raw.toLowerCase();\n      const event = this.#byId.get(id);\n      if (event === undefined) {\n        continue;\n      }\n      const addr = eventAddress(event);\n      const winner = addr !== undefined && this.#replaceable.get(addr) === id;\n      if (this.#indexRemove(id)) {\n        n += 1;\n      }\n      if (winner) {\n        this.#setWatermark(addr, { id, created_at: event.created_at });\n      }\n    }\n    return n;\n  }\n\n  /**\n   * True when the id is tombstoned, or the coordinate has a deletion marker that still covers the\n   * current event at that address: a replacement published after the marker's `until` clears the\n   * deletion. Coordinates are matched on the canonical lowercase pubkey.\n   */\n  isDeleted(idOrAddress: string): boolean {\n    if (this.#deletion.ids.has(idOrAddress.toLowerCase())) {\n      return true;\n    }\n    const coord = parseEventAddress(idOrAddress);\n    if (!coord) {\n      return false;\n    }\n    const address = formatEventAddress(coord.kind, coord.pubkey, coord.identifier);\n    const until = this.#deletion.coordinates.get(address);\n    if (until === undefined) {\n      return false;\n    }\n    const id = this.#replaceable.get(address);\n    if (id === undefined) {\n      return true;\n    }\n    const event = this.#byId.get(id);\n    return event === undefined || event.created_at <= until;\n  }\n\n  getOutboxBound(pubkey: string, kind: number): OutboxBound | undefined {\n    const persisted = this.#outboxBounds.get(outboxBoundKey(pubkey, kind));\n    if (persisted) {\n      return { oldest: persisted.oldest, newest: persisted.newest };\n    }\n    return this.#deriveOutboxBound(pubkey, kind);\n  }\n\n  setOutboxBound(pubkey: string, kind: number, bound: OutboxBound): void {\n    this.#outboxBounds.set(outboxBoundKey(pubkey, kind), {\n      oldest: bound.oldest,\n      newest: bound.newest,\n    });\n  }\n\n  clear(): void {\n    if (this.#onRemove) {\n      for (const event of this.#byId.values()) {\n        this.#onRemove(event);\n      }\n    }\n    this.#byId.clear();\n    this.#byPubkey.clear();\n    this.#byKind.clear();\n    this.#byKindPubkey.clear();\n    this.#byEpTag.clear();\n    this.#replaceable.clear();\n    this.#watermarks.clear();\n    this.#watermarkIds.clear();\n    this.#deletion.clear();\n    this.#outboxBounds.clear();\n  }\n\n  get size(): number {\n    return this.#byId.size;\n  }\n\n  #indexInsert(event: Event): void {\n    this.#byId.set(event.id, event);\n    const { pubkey } = event;\n    addToSetMap(this.#byPubkey, pubkey, event.id);\n    addToSetMap(this.#byKind, event.kind, event.id);\n    addToSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, event.id);\n    for (const tag of event.tags) {\n      if ((tag[0] !== \"e\" && tag[0] !== \"p\") || tag[1] === undefined) {\n        continue;\n      }\n      addToSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, event.id);\n    }\n    const addr = eventAddress(event);\n    if (addr !== undefined) {\n      this.#replaceable.set(addr, event.id);\n      this.#dropWatermark(addr);\n    }\n    this.#onInsert?.(event);\n  }\n\n  #indexRemove(id: string): boolean {\n    // A removed/deleted id must not keep a stale watermark alive; eviction\n    // re-records its winner watermark right after this call.\n    this.#dropWatermarkId(id);\n    const event = this.#byId.get(id);\n    if (!event) {\n      return false;\n    }\n    this.#byId.delete(id);\n    const { pubkey } = event;\n    removeFromSetMap(this.#byPubkey, pubkey, id);\n    removeFromSetMap(this.#byKind, event.kind, id);\n    removeFromSetMap(this.#byKindPubkey, `${event.kind}:${pubkey}`, id);\n    for (const tag of event.tags) {\n      if ((tag[0] !== \"e\" && tag[0] !== \"p\") || tag[1] === undefined) {\n        continue;\n      }\n      removeFromSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, id);\n    }\n    const addr = eventAddress(event);\n    if (addr !== undefined && this.#replaceable.get(addr) === id) {\n      this.#replaceable.delete(addr);\n    }\n    this.#onRemove?.(event);\n    return true;\n  }\n\n  #matchedEvents(filter: Filter): Event[] {\n    if (filter.limit === 0) {\n      return [];\n    }\n    const matched: Event[] = [];\n    this.#eachCandidate(filter, (event) => {\n      if (this.#deletion.covers(event)) {\n        return;\n      }\n      if (!matchFilter(filter, event)) {\n        return;\n      }\n      matched.push(event);\n    });\n    sortEvents(matched);\n    return filter.limit === undefined ? matched : matched.slice(0, filter.limit);\n  }\n\n  #deriveOutboxBound(pubkey: string, kind: number): OutboxBound | undefined {\n    const byPk = this.#byPubkey.get(pubkey.toLowerCase());\n    const byKind = this.#byKind.get(kind);\n    if (!byPk || !byKind) {\n      return undefined;\n    }\n    let oldest: number | undefined;\n    let newest: number | undefined;\n    for (const id of byPk) {\n      if (!byKind.has(id) || this.#deletion.ids.has(id)) {\n        continue;\n      }\n      const event = this.#byId.get(id);\n      if (!event || this.#deletion.covers(event)) {\n        continue;\n      }\n      if (oldest === undefined || event.created_at < oldest) {\n        oldest = event.created_at;\n      }\n      if (newest === undefined || event.created_at > newest) {\n        newest = event.created_at;\n      }\n    }\n    if (oldest === undefined || newest === undefined) {\n      return undefined;\n    }\n    return { oldest, newest };\n  }\n\n  #eachCandidate(filter: Filter, visit: (event: Event) => void): void {\n    if (filter.ids) {\n      const seen = new Set<string>();\n      for (const raw of filter.ids) {\n        const event = this.#byId.get(raw.toLowerCase());\n        if (!event || seen.has(event.id)) {\n          continue;\n        }\n        seen.add(event.id);\n        visit(event);\n      }\n      return;\n    }\n\n    if (filter.authors && filter.kinds) {\n      const seen = new Set<string>();\n      for (const pk of filter.authors) {\n        const pubkey = pk.toLowerCase();\n        for (const kind of filter.kinds) {\n          const ids = this.#byKindPubkey.get(`${kind}:${pubkey}`);\n          if (!ids) {\n            continue;\n          }\n          for (const id of ids) {\n            if (seen.has(id)) {\n              continue;\n            }\n            seen.add(id);\n            const event = this.#byId.get(id);\n            if (event) {\n              visit(event);\n            }\n          }\n        }\n      }\n      return;\n    }\n\n    if (filter.authors) {\n      const seen = new Set<string>();\n      for (const pk of filter.authors) {\n        const byPk = this.#byPubkey.get(pk.toLowerCase());\n        if (!byPk) {\n          continue;\n        }\n        for (const id of byPk) {\n          if (seen.has(id)) {\n            continue;\n          }\n          seen.add(id);\n          const event = this.#byId.get(id);\n          if (event) {\n            visit(event);\n          }\n        }\n      }\n      return;\n    }\n\n    if (filter.kinds) {\n      const seen = new Set<string>();\n      for (const kind of filter.kinds) {\n        const byKind = this.#byKind.get(kind);\n        if (!byKind) {\n          continue;\n        }\n        for (const id of byKind) {\n          if (seen.has(id)) {\n            continue;\n          }\n          seen.add(id);\n          const event = this.#byId.get(id);\n          if (event) {\n            visit(event);\n          }\n        }\n      }\n      return;\n    }\n\n    const eTags = filter[\"#e\"];\n    const pTags = filter[\"#p\"];\n    if (eTags !== undefined || pTags !== undefined) {\n      const seen = new Set<string>();\n      visitEpTagIds(this.#byEpTag, this.#byId, \"e\", eTags, seen, visit);\n      visitEpTagIds(this.#byEpTag, this.#byId, \"p\", pTags, seen, visit);\n      return;\n    }\n\n    // #t/#d and other non-e/p tags are not indexed (e/p only). A generic tag\n    // store is extra put/remove amp; hashtag-only queries scan #byId.\n    for (const event of this.#byId.values()) {\n      visit(event);\n    }\n  }\n\n  #setWatermark(addr: string, watermark: { id: string; created_at: number }): void {\n    if (this.#maxWatermarks === 0) {\n      return;\n    }\n    this.#dropWatermark(addr);\n    this.#watermarks.set(addr, watermark);\n    this.#watermarkIds.set(watermark.id, addr);\n    trimOldest(this.#watermarks, this.#maxWatermarks, (a) => this.#dropWatermark(a));\n  }\n\n  #dropWatermark(addr: string): void {\n    const watermark = this.#watermarks.get(addr);\n    if (watermark === undefined) {\n      return;\n    }\n    this.#watermarks.delete(addr);\n    this.#watermarkIds.delete(watermark.id);\n  }\n\n  #dropWatermarkId(id: string): void {\n    const addr = this.#watermarkIds.get(id);\n    if (addr === undefined) {\n      return;\n    }\n    this.#watermarkIds.delete(id);\n    this.#watermarks.delete(addr);\n  }\n\n  #trimTombstones(): void {\n    const cap = this.#maxTombstones;\n    if (cap === undefined) {\n      return;\n    }\n    trimOldest(this.#deletion.ids, cap, (id) => {\n      this.#deletion.pending.delete(id);\n    });\n    trimOldest(this.#deletion.pending, cap);\n    trimOldest(this.#deletion.coordinates, cap);\n  }\n}\n\nfunction visitEpTagIds(\n  byEpTag: Map<string, Set<string>>,\n  byId: Map<string, Event>,\n  name: \"e\" | \"p\",\n  values: ReadonlyArray<string> | undefined,\n  seen: Set<string>,\n  visit: (event: Event) => void,\n): void {\n  if (values === undefined) {\n    return;\n  }\n  for (const value of values) {\n    const ids = byEpTag.get(`${name}:${value.toLowerCase()}`);\n    if (!ids) {\n      continue;\n    }\n    for (const id of ids) {\n      if (seen.has(id)) {\n        continue;\n      }\n      seen.add(id);\n      const event = byId.get(id);\n      if (event) {\n        visit(event);\n      }\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;AAqCA,IAAa,cAAb,MAAyB;CACvB,wBAAiB,IAAI,IAAmB;CACxC,4BAAqB,IAAI,IAAyB;CAClD,0BAAmB,IAAI,IAAyB;CAChD,gCAAyB,IAAI,IAAyB;CACtD,2BAAoB,IAAI,IAAyB;CACjD,+BAAwB,IAAI,IAAoB;CAEhD,8BAAuB,IAAI,IAAgD;CAE3E,gCAAyB,IAAI,IAAoB;CACjD,YAAqB,IAAI,cAAc;CACvC,gCAAyB,IAAI,IAAyB;CACtD;CACA;CACA;CACA;CAEA,YAAY,MAA2B;EACrC,KAAK,iBAAiB,MAAM;EAC5B,KAAK,iBAAiB,MAAM,iBAAiB;EAC7C,KAAK,YAAY,MAAM;EACvB,KAAK,YAAY,MAAM;CACzB;CAEA,IAAI,KAAuB;EACzB,MAAM,SAAoB;GACxB,UAAU,KAAK;GACf,UAAU,OAAO,KAAK,MAAM,IAAI,EAAE;GAClC,iBAAiB,SAAS;IACxB,MAAM,KAAK,KAAK,aAAa,IAAI,IAAI;IACrC,MAAM,KAAK,OAAO,KAAA,IAAY,KAAA,IAAY,KAAK,MAAM,IAAI,EAAE;IAC3D,IAAI,IACF,OAAO;KAAE,IAAI,GAAG;KAAI,YAAY,GAAG;IAAW;IAEhD,MAAM,YAAY,KAAK,YAAY,IAAI,IAAI;IAC3C,OAAO,cAAc,KAAA,IAAY,KAAA,IAAY;KAAE,GAAG;KAAW,SAAS;IAAK;GAC7E;EACF;EACA,MAAM,WAAW,UAAU,KAAK,MAAM;EACtC,IAAI,SAAS,WAAW,UAAU;GAGhC,KAAK,MAAM,KAAK,SAAS,KAAK,YAC5B,KAAK,iBAAiB,EAAE,EAAE;GAE5B,KAAK,MAAM,KAAK,SAAS,KAAK,aAC5B,KAAK,eAAe,EAAE,GAAG;EAE7B;EACA,MAAM,SAAS,eACb;GACE,UAAU,KAAK;GACf,cAAc,MAAM,KAAK,aAAa,CAAC;GACvC,cAAc,OAAO,KAAK,aAAa,EAAE;EAC3C,GACA,QACF;EACA,KAAK,gBAAgB;EACrB,OAAO;CACT;;CAGA,QAAQ,QAA2C;EACjD,MAAM,UAAuB,CAAC;EAC9B,KAAK,MAAM,SAAS,QAClB,QAAQ,KAAK,KAAK,IAAI,KAAK,CAAC;EAE9B,OAAO;CACT;CAEA,IAAI,IAA+B;EACjC,MAAM,MAAM,GAAG,YAAY;EAC3B,IAAI,KAAK,UAAU,IAAI,IAAI,GAAG,GAC5B;EAEF,OAAO,KAAK,MAAM,IAAI,GAAG;CAC3B;;CAGA,aAAa,SAAoC;EAC/C,MAAM,QAAQ,kBAAkB,OAAO;EACvC,IAAI,CAAC,OACH;EAEF,MAAM,KAAK,KAAK,aAAa,IAC3B,mBAAmB,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU,CAC/D;EACA,IAAI,OAAO,KAAA,GACT;EAEF,IAAI,KAAK,UAAU,IAAI,IAAI,EAAE,GAC3B;EAEF,OAAO,KAAK,MAAM,IAAI,EAAE;CAC1B;CAEA,MAAM,SAAyC;EAC7C,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,SAAkB,CAAC;EACzB,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,SAAS,KAAK,eAAe,MAAM,GAAG;GAC/C,IAAI,KAAK,IAAI,MAAM,EAAE,GACnB;GAEF,KAAK,IAAI,MAAM,EAAE;GACjB,OAAO,KAAK,KAAK;EACnB;EAEF,WAAW,MAAM;EACjB,OAAO;CACT;CAEA,MAAM,SAAwC;EAC5C,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,SAAS,KAAK,eAAe,MAAM,GAC5C,KAAK,IAAI,MAAM,EAAE;EAGrB,OAAO,KAAK;CACd;CAEA,gBAAgB,QAAkC;EAChD,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC;EAEV,MAAM,QAA0B,CAAC;EACjC,KAAK,eAAe,SAAS,UAAU;GACrC,IAAI,KAAK,UAAU,OAAO,KAAK,GAC7B;GAEF,IAAI,CAAC,YAAY,QAAQ,KAAK,GAC5B;GAEF,MAAM,KAAK;IAAE,IAAI,MAAM;IAAI,YAAY,MAAM;GAAW,CAAC;EAC3D,CAAC;EACD,IAAI,OAAO,UAAU,KAAA,GAAW;GAC9B,MAAM,KAAK,iBAAiB;GAC5B,IAAI,MAAM,SAAS,OAAO,OACxB,MAAM,SAAS,OAAO;EAE1B;EACA,MAAM,KAAK,WAAW;EACtB,OAAO;CACT;;CAGA,OAAO,KAAoC;EACzC,IAAI,IAAI;EACR,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,KAAK,IAAI,YAAY;GAC3B,IAAI,KAAK,aAAa,EAAE,GACtB,KAAK;GAEP,KAAK,UAAU,IAAI,IAAI,EAAE;GACzB,KAAK,UAAU,QAAQ,OAAO,EAAE;EAClC;EACA,KAAK,gBAAgB;EACrB,OAAO;CACT;;;;;;;CAQA,MAAM,KAAoC;EACxC,IAAI,IAAI;EACR,KAAK,MAAM,OAAO,KAAK;GACrB,MAAM,KAAK,IAAI,YAAY;GAC3B,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;GAC/B,IAAI,UAAU,KAAA,GACZ;GAEF,MAAM,OAAO,aAAa,KAAK;GAC/B,MAAM,SAAS,SAAS,KAAA,KAAa,KAAK,aAAa,IAAI,IAAI,MAAM;GACrE,IAAI,KAAK,aAAa,EAAE,GACtB,KAAK;GAEP,IAAI,QACF,KAAK,cAAc,MAAM;IAAE;IAAI,YAAY,MAAM;GAAW,CAAC;EAEjE;EACA,OAAO;CACT;;;;;;CAOA,UAAU,aAA8B;EACtC,IAAI,KAAK,UAAU,IAAI,IAAI,YAAY,YAAY,CAAC,GAClD,OAAO;EAET,MAAM,QAAQ,kBAAkB,WAAW;EAC3C,IAAI,CAAC,OACH,OAAO;EAET,MAAM,UAAU,mBAAmB,MAAM,MAAM,MAAM,QAAQ,MAAM,UAAU;EAC7E,MAAM,QAAQ,KAAK,UAAU,YAAY,IAAI,OAAO;EACpD,IAAI,UAAU,KAAA,GACZ,OAAO;EAET,MAAM,KAAK,KAAK,aAAa,IAAI,OAAO;EACxC,IAAI,OAAO,KAAA,GACT,OAAO;EAET,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;EAC/B,OAAO,UAAU,KAAA,KAAa,MAAM,cAAc;CACpD;CAEA,eAAe,QAAgB,MAAuC;EACpE,MAAM,YAAY,KAAK,cAAc,IAAI,eAAe,QAAQ,IAAI,CAAC;EACrE,IAAI,WACF,OAAO;GAAE,QAAQ,UAAU;GAAQ,QAAQ,UAAU;EAAO;EAE9D,OAAO,KAAK,mBAAmB,QAAQ,IAAI;CAC7C;CAEA,eAAe,QAAgB,MAAc,OAA0B;EACrE,KAAK,cAAc,IAAI,eAAe,QAAQ,IAAI,GAAG;GACnD,QAAQ,MAAM;GACd,QAAQ,MAAM;EAChB,CAAC;CACH;CAEA,QAAc;EACZ,IAAI,KAAK,WACP,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,GACpC,KAAK,UAAU,KAAK;EAGxB,KAAK,MAAM,MAAM;EACjB,KAAK,UAAU,MAAM;EACrB,KAAK,QAAQ,MAAM;EACnB,KAAK,cAAc,MAAM;EACzB,KAAK,SAAS,MAAM;EACpB,KAAK,aAAa,MAAM;EACxB,KAAK,YAAY,MAAM;EACvB,KAAK,cAAc,MAAM;EACzB,KAAK,UAAU,MAAM;EACrB,KAAK,cAAc,MAAM;CAC3B;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;CAEA,aAAa,OAAoB;EAC/B,KAAK,MAAM,IAAI,MAAM,IAAI,KAAK;EAC9B,MAAM,EAAE,WAAW;EACnB,YAAY,KAAK,WAAW,QAAQ,MAAM,EAAE;EAC5C,YAAY,KAAK,SAAS,MAAM,MAAM,MAAM,EAAE;EAC9C,YAAY,KAAK,eAAe,GAAG,MAAM,KAAK,GAAG,UAAU,MAAM,EAAE;EACnE,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAK,IAAI,OAAO,OAAO,IAAI,OAAO,OAAQ,IAAI,OAAO,KAAA,GACnD;GAEF,YAAY,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,YAAY,KAAK,MAAM,EAAE;EAC1E;EACA,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,GAAW;GACtB,KAAK,aAAa,IAAI,MAAM,MAAM,EAAE;GACpC,KAAK,eAAe,IAAI;EAC1B;EACA,KAAK,YAAY,KAAK;CACxB;CAEA,aAAa,IAAqB;EAGhC,KAAK,iBAAiB,EAAE;EACxB,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;EAC/B,IAAI,CAAC,OACH,OAAO;EAET,KAAK,MAAM,OAAO,EAAE;EACpB,MAAM,EAAE,WAAW;EACnB,iBAAiB,KAAK,WAAW,QAAQ,EAAE;EAC3C,iBAAiB,KAAK,SAAS,MAAM,MAAM,EAAE;EAC7C,iBAAiB,KAAK,eAAe,GAAG,MAAM,KAAK,GAAG,UAAU,EAAE;EAClE,KAAK,MAAM,OAAO,MAAM,MAAM;GAC5B,IAAK,IAAI,OAAO,OAAO,IAAI,OAAO,OAAQ,IAAI,OAAO,KAAA,GACnD;GAEF,iBAAiB,KAAK,UAAU,GAAG,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC,YAAY,KAAK,EAAE;EACzE;EACA,MAAM,OAAO,aAAa,KAAK;EAC/B,IAAI,SAAS,KAAA,KAAa,KAAK,aAAa,IAAI,IAAI,MAAM,IACxD,KAAK,aAAa,OAAO,IAAI;EAE/B,KAAK,YAAY,KAAK;EACtB,OAAO;CACT;CAEA,eAAe,QAAyB;EACtC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC;EAEV,MAAM,UAAmB,CAAC;EAC1B,KAAK,eAAe,SAAS,UAAU;GACrC,IAAI,KAAK,UAAU,OAAO,KAAK,GAC7B;GAEF,IAAI,CAAC,YAAY,QAAQ,KAAK,GAC5B;GAEF,QAAQ,KAAK,KAAK;EACpB,CAAC;EACD,WAAW,OAAO;EAClB,OAAO,OAAO,UAAU,KAAA,IAAY,UAAU,QAAQ,MAAM,GAAG,OAAO,KAAK;CAC7E;CAEA,mBAAmB,QAAgB,MAAuC;EACxE,MAAM,OAAO,KAAK,UAAU,IAAI,OAAO,YAAY,CAAC;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;EACpC,IAAI,CAAC,QAAQ,CAAC,QACZ;EAEF,IAAI;EACJ,IAAI;EACJ,KAAK,MAAM,MAAM,MAAM;GACrB,IAAI,CAAC,OAAO,IAAI,EAAE,KAAK,KAAK,UAAU,IAAI,IAAI,EAAE,GAC9C;GAEF,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;GAC/B,IAAI,CAAC,SAAS,KAAK,UAAU,OAAO,KAAK,GACvC;GAEF,IAAI,WAAW,KAAA,KAAa,MAAM,aAAa,QAC7C,SAAS,MAAM;GAEjB,IAAI,WAAW,KAAA,KAAa,MAAM,aAAa,QAC7C,SAAS,MAAM;EAEnB;EACA,IAAI,WAAW,KAAA,KAAa,WAAW,KAAA,GACrC;EAEF,OAAO;GAAE;GAAQ;EAAO;CAC1B;CAEA,eAAe,QAAgB,OAAqC;EAClE,IAAI,OAAO,KAAK;GACd,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,OAAO,OAAO,KAAK;IAC5B,MAAM,QAAQ,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC;IAC9C,IAAI,CAAC,SAAS,KAAK,IAAI,MAAM,EAAE,GAC7B;IAEF,KAAK,IAAI,MAAM,EAAE;IACjB,MAAM,KAAK;GACb;GACA;EACF;EAEA,IAAI,OAAO,WAAW,OAAO,OAAO;GAClC,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,OAAO,SAAS;IAC/B,MAAM,SAAS,GAAG,YAAY;IAC9B,KAAK,MAAM,QAAQ,OAAO,OAAO;KAC/B,MAAM,MAAM,KAAK,cAAc,IAAI,GAAG,KAAK,GAAG,QAAQ;KACtD,IAAI,CAAC,KACH;KAEF,KAAK,MAAM,MAAM,KAAK;MACpB,IAAI,KAAK,IAAI,EAAE,GACb;MAEF,KAAK,IAAI,EAAE;MACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;MAC/B,IAAI,OACF,MAAM,KAAK;KAEf;IACF;GACF;GACA;EACF;EAEA,IAAI,OAAO,SAAS;GAClB,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,OAAO,SAAS;IAC/B,MAAM,OAAO,KAAK,UAAU,IAAI,GAAG,YAAY,CAAC;IAChD,IAAI,CAAC,MACH;IAEF,KAAK,MAAM,MAAM,MAAM;KACrB,IAAI,KAAK,IAAI,EAAE,GACb;KAEF,KAAK,IAAI,EAAE;KACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OACF,MAAM,KAAK;IAEf;GACF;GACA;EACF;EAEA,IAAI,OAAO,OAAO;GAChB,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,QAAQ,OAAO,OAAO;IAC/B,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;IACpC,IAAI,CAAC,QACH;IAEF,KAAK,MAAM,MAAM,QAAQ;KACvB,IAAI,KAAK,IAAI,EAAE,GACb;KAEF,KAAK,IAAI,EAAE;KACX,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OACF,MAAM,KAAK;IAEf;GACF;GACA;EACF;EAEA,MAAM,QAAQ,OAAO;EACrB,MAAM,QAAQ,OAAO;EACrB,IAAI,UAAU,KAAA,KAAa,UAAU,KAAA,GAAW;GAC9C,MAAM,uBAAO,IAAI,IAAY;GAC7B,cAAc,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK;GAChE,cAAc,KAAK,UAAU,KAAK,OAAO,KAAK,OAAO,MAAM,KAAK;GAChE;EACF;EAIA,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,GACpC,MAAM,KAAK;CAEf;CAEA,cAAc,MAAc,WAAqD;EAC/E,IAAI,KAAK,mBAAmB,GAC1B;EAEF,KAAK,eAAe,IAAI;EACxB,KAAK,YAAY,IAAI,MAAM,SAAS;EACpC,KAAK,cAAc,IAAI,UAAU,IAAI,IAAI;EACzC,WAAW,KAAK,aAAa,KAAK,iBAAiB,MAAM,KAAK,eAAe,CAAC,CAAC;CACjF;CAEA,eAAe,MAAoB;EACjC,MAAM,YAAY,KAAK,YAAY,IAAI,IAAI;EAC3C,IAAI,cAAc,KAAA,GAChB;EAEF,KAAK,YAAY,OAAO,IAAI;EAC5B,KAAK,cAAc,OAAO,UAAU,EAAE;CACxC;CAEA,iBAAiB,IAAkB;EACjC,MAAM,OAAO,KAAK,cAAc,IAAI,EAAE;EACtC,IAAI,SAAS,KAAA,GACX;EAEF,KAAK,cAAc,OAAO,EAAE;EAC5B,KAAK,YAAY,OAAO,IAAI;CAC9B;CAEA,kBAAwB;EACtB,MAAM,MAAM,KAAK;EACjB,IAAI,QAAQ,KAAA,GACV;EAEF,WAAW,KAAK,UAAU,KAAK,MAAM,OAAO;GAC1C,KAAK,UAAU,QAAQ,OAAO,EAAE;EAClC,CAAC;EACD,WAAW,KAAK,UAAU,SAAS,GAAG;EACtC,WAAW,KAAK,UAAU,aAAa,GAAG;CAC5C;AACF;AAEA,SAAS,cACP,SACA,MACA,MACA,QACA,MACA,OACM;CACN,IAAI,WAAW,KAAA,GACb;CAEF,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,MAAM,QAAQ,IAAI,GAAG,KAAK,GAAG,MAAM,YAAY,GAAG;EACxD,IAAI,CAAC,KACH;EAEF,KAAK,MAAM,MAAM,KAAK;GACpB,IAAI,KAAK,IAAI,EAAE,GACb;GAEF,KAAK,IAAI,EAAE;GACX,MAAM,QAAQ,KAAK,IAAI,EAAE;GACzB,IAAI,OACF,MAAM,KAAK;EAEf;CACF;AACF"}

package/dist/message-pYfVKxPn.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"message-pYfVKxPn.mjs","names":[],"sources":["../src/core/message.ts"],"sourcesContent":["import { MessageError } from \"./error.ts\";\nimport type { Event } from \"./event.ts\";\nimport { validateSignedEvent } from \"./event.ts\";\nimport { canonicalizeFilter, canonicalizeFilters } from \"./filter.ts\";\nimport type { Filter } from \"./filter.ts\";\nimport { SUBSCRIPTION_ID_MAX_CHARS } from \"./limits.ts\";\nimport type { Mutable } from \"./util.ts\";\nimport { bytesToHex, hexToBytes, isRecord } from \"./util.ts\";\n\n/** NIP-01 subscription id: 1..64 chars. */\nexport type SubscriptionId = string;\n\n/** Validate a subscription id; throws {@link MessageError} unless 1..64 Unicode scalar values. */\nexport function assertSubscriptionId(id: string): SubscriptionId {\n  // Iterating a string yields code points, so astral chars count once (NIP-01's \"chars\").\n  let length = 0;\n  for (const _ of id) {\n    length += 1;\n  }\n  if (length === 0 || length > SUBSCRIPTION_ID_MAX_CHARS) {\n    throw new MessageError(`subscription id length must be 1..${SUBSCRIPTION_ID_MAX_CHARS}`);\n  }\n  return id;\n}\n\n/** Validate the given id, or mint a random 16-hex-char subscription id. */\nexport function createSubscriptionId(id?: string): SubscriptionId {\n  if (id !== undefined) {\n    return assertSubscriptionId(id);\n  }\n  const bytes = new Uint8Array(8);\n  crypto.getRandomValues(bytes);\n  return bytesToHex(bytes);\n}\n\n/** Client → relay messages (NIP-01 + NIP-42 AUTH + NIP-45 COUNT + NIP-77). */\nexport type ClientMessage =\n  | [\"EVENT\", Event]\n  | [\"REQ\", SubscriptionId, ...Filter[]]\n  | [\"CLOSE\", SubscriptionId]\n  | [\"AUTH\", Event]\n  | [\"COUNT\", SubscriptionId, ...Filter[]]\n  | [\"NEG-OPEN\", SubscriptionId, Filter, string]\n  | [\"NEG-MSG\", SubscriptionId, string]\n  | [\"NEG-CLOSE\", SubscriptionId];\n\n/** Relay → client messages. */\nexport type RelayMessage =\n  | [\"EVENT\", SubscriptionId, Event]\n  | [\"OK\", string, boolean, string]\n  | [\"EOSE\", SubscriptionId]\n  | [\"CLOSED\", SubscriptionId, string]\n  | [\"NOTICE\", string]\n  | [\"AUTH\", string]\n  | [\"COUNT\", SubscriptionId, CountResult]\n  | [\"NEG-MSG\", SubscriptionId, string]\n  | [\"NEG-ERR\", SubscriptionId, string];\n\n/** NIP-45 COUNT reply payload. */\nexport type CountResult = {\n  readonly count: number;\n  readonly approximate?: boolean | undefined;\n  /**\n   * Optional 512-char hex HyperLogLog sketch (256 registers). Merge sketches with `mergeCountHll`.\n   * Estimation is unspecified by NIP-45 and not provided.\n   */\n  readonly hll?: string | undefined;\n};\n\nconst HLL_BYTES = 256; // 512 hex chars (NIP-45; hex only, not base64)\nconst HLL_HEX_LEN = HLL_BYTES * 2;\nconst HEX_RE = /^[0-9a-fA-F]+$/;\n\n/**\n * Register-wise max of NIP-45 HyperLogLog sketches. Output is always lowercase 512 hex. Empty input\n * is the zero sketch (identity).\n */\nexport function mergeCountHll(hexes: ReadonlyArray<string>): string {\n  const merged = new Uint8Array(HLL_BYTES);\n  for (const hex of hexes) {\n    if (hex.length !== HLL_HEX_LEN || !HEX_RE.test(hex)) {\n      throw new MessageError(\"invalid NIP-45 HLL sketch: expected 512-char hex\");\n    }\n    const bytes = hexToBytes(hex);\n    for (const [i, b] of bytes.entries()) {\n      const m = merged[i];\n      if (m !== undefined && b > m) {\n        merged[i] = b;\n      }\n    }\n  }\n  return bytesToHex(merged);\n}\n\n/** Serialize a client->relay message to its NIP-01 JSON wire form. */\nexport function encodeClientMessage(message: ClientMessage): string {\n  // REQ/COUNT/NEG-OPEN filters are canonicalized so the wire form matches nk-core.\n  switch (message[0]) {\n    case \"REQ\":\n    case \"COUNT\": {\n      const [type, id, ...filters] = message;\n      return JSON.stringify([type, id, ...canonicalizeFilters(filters)]);\n    }\n    case \"NEG-OPEN\":\n      return JSON.stringify([\"NEG-OPEN\", message[1], canonicalizeFilter(message[2]), message[3]]);\n    default:\n      return JSON.stringify(message);\n  }\n}\n\n/** Serialize a relay->client message to its NIP-01 JSON wire form. */\nexport function encodeRelayMessage(message: RelayMessage): string {\n  return JSON.stringify(message);\n}\n\n/** Parse a client->relay JSON message; throws {@link MessageError} on malformed input. */\nexport function parseClientMessage(raw: string): ClientMessage {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch {\n    throw new MessageError(\"client message is not valid JSON\");\n  }\n  if (!Array.isArray(parsed) || parsed.length === 0 || typeof parsed[0] !== \"string\") {\n    throw new MessageError(\"client message must be a non-empty JSON array\");\n  }\n  const items: unknown[] = parsed;\n  const [type] = items;\n  switch (type) {\n    case \"EVENT\":\n      if (items.length !== 2 || !validateSignedEvent(items[1])) {\n        throw new MessageError(\"invalid EVENT client message\");\n      }\n      return [\"EVENT\", items[1]];\n\n    case \"REQ\":\n      if (items.length < 3 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid REQ client message\");\n      }\n      return [\"REQ\", assertSubscriptionId(items[1]), ...parseWireFilters(items.slice(2), \"REQ\")];\n\n    case \"CLOSE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid CLOSE client message\");\n      }\n      return [\"CLOSE\", assertSubscriptionId(items[1])];\n\n    case \"AUTH\":\n      if (items.length !== 2 || !validateSignedEvent(items[1])) {\n        throw new MessageError(\"invalid AUTH client message\");\n      }\n      return [\"AUTH\", items[1]];\n\n    case \"COUNT\":\n      if (items.length < 3 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid COUNT client message\");\n      }\n      return [\n        \"COUNT\",\n        assertSubscriptionId(items[1]),\n        ...parseWireFilters(items.slice(2), \"COUNT\"),\n      ];\n\n    case \"NEG-OPEN\":\n      if (items.length === 5) {\n        throw new MessageError(\"obsolete 5-element NEG-OPEN; expected [NEG-OPEN, id, filter, hex]\");\n      }\n      if (\n        items.length !== 4 ||\n        typeof items[1] !== \"string\" ||\n        !isRecord(items[2]) ||\n        !isNegHex(items[3])\n      ) {\n        throw new MessageError(\"invalid NEG-OPEN client message\");\n      }\n      return [\n        \"NEG-OPEN\",\n        assertSubscriptionId(items[1]),\n        parseWireFilter(items[2], \"NEG-OPEN\"),\n        items[3].toLowerCase(),\n      ];\n\n    case \"NEG-MSG\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || !isNegHex(items[2])) {\n        throw new MessageError(\"invalid NEG-MSG client message\");\n      }\n      return [\"NEG-MSG\", assertSubscriptionId(items[1]), items[2].toLowerCase()];\n\n    case \"NEG-CLOSE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid NEG-CLOSE client message\");\n      }\n      return [\"NEG-CLOSE\", assertSubscriptionId(items[1])];\n\n    default:\n      throw new MessageError(`unknown client message type: ${String(type)}`);\n  }\n}\n\n/** Parse a relay->client JSON message; throws {@link MessageError} on malformed input. */\nexport function parseRelayMessage(raw: string): RelayMessage {\n  let parsed: unknown;\n  try {\n    parsed = JSON.parse(raw);\n  } catch {\n    throw new MessageError(\"relay message is not valid JSON\");\n  }\n  if (!Array.isArray(parsed) || parsed.length === 0 || typeof parsed[0] !== \"string\") {\n    throw new MessageError(\"relay message must be a non-empty JSON array\");\n  }\n  const items: unknown[] = parsed;\n  const [type] = items;\n  switch (type) {\n    case \"EVENT\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || !validateSignedEvent(items[2])) {\n        throw new MessageError(\"invalid EVENT relay message\");\n      }\n      return [\"EVENT\", assertSubscriptionId(items[1]), items[2]];\n\n    case \"OK\":\n      if (\n        items.length !== 4 ||\n        typeof items[1] !== \"string\" ||\n        !HEX64_LOWER_RE.test(items[1]) ||\n        typeof items[2] !== \"boolean\" ||\n        typeof items[3] !== \"string\"\n      ) {\n        throw new MessageError(\"invalid OK relay message\");\n      }\n      return [\"OK\", items[1], items[2], items[3]];\n\n    case \"EOSE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid EOSE relay message\");\n      }\n      return [\"EOSE\", assertSubscriptionId(items[1])];\n\n    case \"CLOSED\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || typeof items[2] !== \"string\") {\n        throw new MessageError(\"invalid CLOSED relay message\");\n      }\n      return [\"CLOSED\", assertSubscriptionId(items[1]), items[2]];\n\n    case \"NOTICE\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid NOTICE relay message\");\n      }\n      return [\"NOTICE\", items[1]];\n\n    case \"AUTH\":\n      if (items.length !== 2 || typeof items[1] !== \"string\") {\n        throw new MessageError(\"invalid AUTH relay message\");\n      }\n      return [\"AUTH\", items[1]];\n\n    case \"COUNT\": {\n      const payload = items.at(2);\n      const count = isRecord(payload) ? payload[\"count\"] : undefined;\n      if (\n        items.length !== 3 ||\n        typeof items[1] !== \"string\" ||\n        !isRecord(payload) ||\n        typeof count !== \"number\" ||\n        !Number.isSafeInteger(count) ||\n        count < 0\n      ) {\n        throw new MessageError(\"invalid COUNT relay message\");\n      }\n      const result: Mutable<CountResult> = { count };\n      if (typeof payload[\"approximate\"] === \"boolean\") {\n        result.approximate = payload[\"approximate\"];\n      }\n      const hll = parseCountHll(payload[\"hll\"]);\n      if (hll !== undefined) {\n        result.hll = hll;\n      }\n      return [\"COUNT\", assertSubscriptionId(items[1]), result];\n    }\n    case \"NEG-MSG\":\n      if (items.length !== 3 || typeof items[1] !== \"string\" || !isNegHex(items[2])) {\n        throw new MessageError(\"invalid NEG-MSG relay message\");\n      }\n      return [\"NEG-MSG\", assertSubscriptionId(items[1]), items[2].toLowerCase()];\n\n    case \"NEG-ERR\":\n      if (\n        (items.length !== 3 && items.length !== 4) ||\n        typeof items[1] !== \"string\" ||\n        typeof items[2] !== \"string\"\n      ) {\n        throw new MessageError(\"invalid NEG-ERR relay message\");\n      }\n      return [\"NEG-ERR\", assertSubscriptionId(items[1]), items[2]];\n\n    default:\n      throw new MessageError(`unknown relay message type: ${String(type)}`);\n  }\n}\n\nfunction parseCountHll(value: unknown): string | undefined {\n  if (typeof value !== \"string\" || value.length !== HLL_HEX_LEN || !HEX_RE.test(value)) {\n    return undefined;\n  }\n  return value.toLowerCase();\n}\n\nconst HEX64_RE = /^[0-9a-fA-F]{64}$/;\nconst HEX64_LOWER_RE = /^[0-9a-f]{64}$/;\n\n/**\n * Validates a wire filter per NIP-01: `ids`/`authors` are 64-hex arrays (normalized lowercase),\n * `kinds` are integers in 0..=65535, `since`/`until`/`limit` non-negative integers, `search` a\n * string, and `#<single letter>` arrays of strings (`#e`/`#p` lowercased). Multi-letter `#` keys\n * and unknown non-`#` keys are dropped; wrong types throw {@link MessageError}. Duplicate keys and\n * integer spellings (`1e3`, `1.0`, `-0`) need no handling: `JSON.parse` already applied last-wins\n * and normalized the numbers before this runs (nk-core's map visitors mirror that, NK-ADR-012).\n */\nfunction parseWireFilter(value: unknown, kind: string): Filter {\n  if (!isRecord(value)) {\n    throw new MessageError(`invalid ${kind} filter`);\n  }\n  const fail = (): MessageError => new MessageError(`invalid ${kind} filter`);\n  const out: Mutable<Filter> = {};\n  for (const [key, v] of Object.entries(value)) {\n    if (key.startsWith(\"#\")) {\n      if (!/^#[a-zA-Z]$/.test(key)) {\n        continue;\n      }\n      if (!Array.isArray(v) || !v.every((x): x is string => typeof x === \"string\")) {\n        throw fail();\n      }\n      out[`#${key.slice(1)}`] = key === \"#e\" || key === \"#p\" ? v.map((x) => x.toLowerCase()) : v;\n    } else if (key === \"ids\" || key === \"authors\") {\n      if (\n        !Array.isArray(v) ||\n        !v.every((x): x is string => typeof x === \"string\" && HEX64_RE.test(x))\n      ) {\n        throw fail();\n      }\n      out[key] = v.map((x) => x.toLowerCase());\n    } else if (key === \"kinds\") {\n      if (\n        !Array.isArray(v) ||\n        !v.every(\n          (x): x is number =>\n            typeof x === \"number\" && Number.isSafeInteger(x) && x >= 0 && x <= 65535,\n        )\n      ) {\n        throw fail();\n      }\n      out.kinds = v;\n    } else if (key === \"since\" || key === \"until\" || key === \"limit\") {\n      if (typeof v !== \"number\" || !Number.isSafeInteger(v) || v < 0) {\n        throw fail();\n      }\n      out[key] = v;\n    } else if (key === \"search\") {\n      if (typeof v !== \"string\") {\n        throw fail();\n      }\n      out.search = v;\n    }\n  }\n  return out;\n}\n\nfunction parseWireFilters(items: unknown[], kind: string): Filter[] {\n  return items.map((item) => parseWireFilter(item, kind));\n}\n\nfunction isNegHex(value: unknown): value is string {\n  return (\n    typeof value === \"string\" && value.length > 0 && value.length % 2 === 0 && HEX_RE.test(value)\n  );\n}\n"],"mappings":";;;;;AAaA,SAAgB,qBAAqB,IAA4B;CAE/D,IAAI,SAAS;CACb,KAAK,MAAM,KAAK,IACd,UAAU;CAEZ,IAAI,WAAW,KAAK,SAAA,IAClB,MAAM,IAAI,aAAa,sCAAgE;CAEzF,OAAO;AACT;;AAGA,SAAgB,qBAAqB,IAA6B;CAChE,IAAI,OAAO,KAAA,GACT,OAAO,qBAAqB,EAAE;CAEhC,MAAM,wBAAQ,IAAI,WAAW,CAAC;CAC9B,OAAO,gBAAgB,KAAK;CAC5B,OAAO,WAAW,KAAK;AACzB;AAoCA,MAAM,YAAY;AAClB,MAAM,cAAc,YAAY;AAChC,MAAM,SAAS;;;;;AAMf,SAAgB,cAAc,OAAsC;CAClE,MAAM,SAAS,IAAI,WAAW,SAAS;CACvC,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,IAAI,WAAW,eAAe,CAAC,OAAO,KAAK,GAAG,GAChD,MAAM,IAAI,aAAa,kDAAkD;EAE3E,MAAM,QAAQ,WAAW,GAAG;EAC5B,KAAK,MAAM,CAAC,GAAG,MAAM,MAAM,QAAQ,GAAG;GACpC,MAAM,IAAI,OAAO;GACjB,IAAI,MAAM,KAAA,KAAa,IAAI,GACzB,OAAO,KAAK;EAEhB;CACF;CACA,OAAO,WAAW,MAAM;AAC1B;;AAGA,SAAgB,oBAAoB,SAAgC;CAElE,QAAQ,QAAQ,IAAhB;EACE,KAAK;EACL,KAAK,SAAS;GACZ,MAAM,CAAC,MAAM,IAAI,GAAG,WAAW;GAC/B,OAAO,KAAK,UAAU;IAAC;IAAM;IAAI,GAAG,oBAAoB,OAAO;GAAC,CAAC;EACnE;EACA,KAAK,YACH,OAAO,KAAK,UAAU;GAAC;GAAY,QAAQ;GAAI,mBAAmB,QAAQ,EAAE;GAAG,QAAQ;EAAE,CAAC;EAC5F,SACE,OAAO,KAAK,UAAU,OAAO;CACjC;AACF;;AAGA,SAAgB,mBAAmB,SAA+B;CAChE,OAAO,KAAK,UAAU,OAAO;AAC/B;;AAGA,SAAgB,mBAAmB,KAA4B;CAC7D,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,QAAQ;EACN,MAAM,IAAI,aAAa,kCAAkC;CAC3D;CACA,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,KAAK,OAAO,OAAO,OAAO,UACxE,MAAM,IAAI,aAAa,+CAA+C;CAExE,MAAM,QAAmB;CACzB,MAAM,CAAC,QAAQ;CACf,QAAQ,MAAR;EACE,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,CAAC,oBAAoB,MAAM,EAAE,GACrD,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,SAAS,MAAM,EAAE;EAE3B,KAAK;GACH,IAAI,MAAM,SAAS,KAAK,OAAO,MAAM,OAAO,UAC1C,MAAM,IAAI,aAAa,4BAA4B;GAErD,OAAO;IAAC;IAAO,qBAAqB,MAAM,EAAE;IAAG,GAAG,iBAAiB,MAAM,MAAM,CAAC,GAAG,KAAK;GAAC;EAE3F,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,SAAS,qBAAqB,MAAM,EAAE,CAAC;EAEjD,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,CAAC,oBAAoB,MAAM,EAAE,GACrD,MAAM,IAAI,aAAa,6BAA6B;GAEtD,OAAO,CAAC,QAAQ,MAAM,EAAE;EAE1B,KAAK;GACH,IAAI,MAAM,SAAS,KAAK,OAAO,MAAM,OAAO,UAC1C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO;IACL;IACA,qBAAqB,MAAM,EAAE;IAC7B,GAAG,iBAAiB,MAAM,MAAM,CAAC,GAAG,OAAO;GAC7C;EAEF,KAAK;GACH,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,aAAa,mEAAmE;GAE5F,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,SAAS,MAAM,EAAE,KAClB,CAAC,SAAS,MAAM,EAAE,GAElB,MAAM,IAAI,aAAa,iCAAiC;GAE1D,OAAO;IACL;IACA,qBAAqB,MAAM,EAAE;IAC7B,gBAAgB,MAAM,IAAI,UAAU;IACpC,MAAM,EAAE,CAAC,YAAY;GACvB;EAEF,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,SAAS,MAAM,EAAE,GAC1E,MAAM,IAAI,aAAa,gCAAgC;GAEzD,OAAO;IAAC;IAAW,qBAAqB,MAAM,EAAE;IAAG,MAAM,EAAE,CAAC,YAAY;GAAC;EAE3E,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,kCAAkC;GAE3D,OAAO,CAAC,aAAa,qBAAqB,MAAM,EAAE,CAAC;EAErD,SACE,MAAM,IAAI,aAAa,gCAAgC,OAAO,IAAI,GAAG;CACzE;AACF;;AAGA,SAAgB,kBAAkB,KAA2B;CAC3D,IAAI;CACJ,IAAI;EACF,SAAS,KAAK,MAAM,GAAG;CACzB,QAAQ;EACN,MAAM,IAAI,aAAa,iCAAiC;CAC1D;CACA,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,OAAO,WAAW,KAAK,OAAO,OAAO,OAAO,UACxE,MAAM,IAAI,aAAa,8CAA8C;CAEvE,MAAM,QAAmB;CACzB,MAAM,CAAC,QAAQ;CACf,QAAQ,MAAR;EACE,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,oBAAoB,MAAM,EAAE,GACrF,MAAM,IAAI,aAAa,6BAA6B;GAEtD,OAAO;IAAC;IAAS,qBAAqB,MAAM,EAAE;IAAG,MAAM;GAAE;EAE3D,KAAK;GACH,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,eAAe,KAAK,MAAM,EAAE,KAC7B,OAAO,MAAM,OAAO,aACpB,OAAO,MAAM,OAAO,UAEpB,MAAM,IAAI,aAAa,0BAA0B;GAEnD,OAAO;IAAC;IAAM,MAAM;IAAI,MAAM;IAAI,MAAM;GAAE;EAE5C,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,4BAA4B;GAErD,OAAO,CAAC,QAAQ,qBAAqB,MAAM,EAAE,CAAC;EAEhD,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,OAAO,MAAM,OAAO,UAC5E,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO;IAAC;IAAU,qBAAqB,MAAM,EAAE;IAAG,MAAM;GAAE;EAE5D,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,UAAU,MAAM,EAAE;EAE5B,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,4BAA4B;GAErD,OAAO,CAAC,QAAQ,MAAM,EAAE;EAE1B,KAAK,SAAS;GACZ,MAAM,UAAU,MAAM,GAAG,CAAC;GAC1B,MAAM,QAAQ,SAAS,OAAO,IAAI,QAAQ,WAAW,KAAA;GACrD,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,SAAS,OAAO,KACjB,OAAO,UAAU,YACjB,CAAC,OAAO,cAAc,KAAK,KAC3B,QAAQ,GAER,MAAM,IAAI,aAAa,6BAA6B;GAEtD,MAAM,SAA+B,EAAE,MAAM;GAC7C,IAAI,OAAO,QAAQ,mBAAmB,WACpC,OAAO,cAAc,QAAQ;GAE/B,MAAM,MAAM,cAAc,QAAQ,MAAM;GACxC,IAAI,QAAQ,KAAA,GACV,OAAO,MAAM;GAEf,OAAO;IAAC;IAAS,qBAAqB,MAAM,EAAE;IAAG;GAAM;EACzD;EACA,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,SAAS,MAAM,EAAE,GAC1E,MAAM,IAAI,aAAa,+BAA+B;GAExD,OAAO;IAAC;IAAW,qBAAqB,MAAM,EAAE;IAAG,MAAM,EAAE,CAAC,YAAY;GAAC;EAE3E,KAAK;GACH,IACG,MAAM,WAAW,KAAK,MAAM,WAAW,KACxC,OAAO,MAAM,OAAO,YACpB,OAAO,MAAM,OAAO,UAEpB,MAAM,IAAI,aAAa,+BAA+B;GAExD,OAAO;IAAC;IAAW,qBAAqB,MAAM,EAAE;IAAG,MAAM;GAAE;EAE7D,SACE,MAAM,IAAI,aAAa,+BAA+B,OAAO,IAAI,GAAG;CACxE;AACF;AAEA,SAAS,cAAc,OAAoC;CACzD,IAAI,OAAO,UAAU,YAAY,MAAM,WAAW,eAAe,CAAC,OAAO,KAAK,KAAK,GACjF;CAEF,OAAO,MAAM,YAAY;AAC3B;AAEA,MAAM,WAAW;AACjB,MAAM,iBAAiB;;;;;;;;;AAUvB,SAAS,gBAAgB,OAAgB,MAAsB;CAC7D,IAAI,CAAC,SAAS,KAAK,GACjB,MAAM,IAAI,aAAa,WAAW,KAAK,QAAQ;CAEjD,MAAM,aAA2B,IAAI,aAAa,WAAW,KAAK,QAAQ;CAC1E,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,CAAC,KAAK,MAAM,OAAO,QAAQ,KAAK,GACzC,IAAI,IAAI,WAAW,GAAG,GAAG;EACvB,IAAI,CAAC,cAAc,KAAK,GAAG,GACzB;EAEF,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,MAAmB,OAAO,MAAM,QAAQ,GACzE,MAAM,KAAK;EAEb,IAAI,IAAI,IAAI,MAAM,CAAC,OAAO,QAAQ,QAAQ,QAAQ,OAAO,EAAE,KAAK,MAAM,EAAE,YAAY,CAAC,IAAI;CAC3F,OAAO,IAAI,QAAQ,SAAS,QAAQ,WAAW;EAC7C,IACE,CAAC,MAAM,QAAQ,CAAC,KAChB,CAAC,EAAE,OAAO,MAAmB,OAAO,MAAM,YAAY,SAAS,KAAK,CAAC,CAAC,GAEtE,MAAM,KAAK;EAEb,IAAI,OAAO,EAAE,KAAK,MAAM,EAAE,YAAY,CAAC;CACzC,OAAO,IAAI,QAAQ,SAAS;EAC1B,IACE,CAAC,MAAM,QAAQ,CAAC,KAChB,CAAC,EAAE,OACA,MACC,OAAO,MAAM,YAAY,OAAO,cAAc,CAAC,KAAK,KAAK,KAAK,KAAK,KACvE,GAEA,MAAM,KAAK;EAEb,IAAI,QAAQ;CACd,OAAO,IAAI,QAAQ,WAAW,QAAQ,WAAW,QAAQ,SAAS;EAChE,IAAI,OAAO,MAAM,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,IAAI,GAC3D,MAAM,KAAK;EAEb,IAAI,OAAO;CACb,OAAO,IAAI,QAAQ,UAAU;EAC3B,IAAI,OAAO,MAAM,UACf,MAAM,KAAK;EAEb,IAAI,SAAS;CACf;CAEF,OAAO;AACT;AAEA,SAAS,iBAAiB,OAAkB,MAAwB;CAClE,OAAO,MAAM,KAAK,SAAS,gBAAgB,MAAM,IAAI,CAAC;AACxD;AAEA,SAAS,SAAS,OAAiC;CACjD,OACE,OAAO,UAAU,YAAY,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,KAAK;AAEhG"}

package/dist/pool-THuuOW4S.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"pool-THuuOW4S.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 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  /** Close reason of the last attached subscription that ended; drives the aggregate reason. */\n  let lastReason: string | undefined;\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  /**\n   * Single completion rule for both endings: `pending` reaches zero when every URL entry either\n   * failed to attach or its subscription ended — at that point no attached closer can still be\n   * live. The reason is the last subscription's close reason, or \"all relays failed\" when no relay\n   * ever attached.\n   */\n  const finish = (): void => {\n    if (pending <= 0 && !closed) {\n      settleClose();\n      invokeSafely(() => opts.onclose?.(lastReason ?? \"all relays failed\"));\n    }\n  };\n\n  const failUrl = (jobIndex: number, key: string): void => {\n    settleEose(jobIndex, key, false);\n    pending -= 1;\n    finish();\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        lastReason = reason;\n        pending -= 1;\n        finish();\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 {\n          // Any attach failure retires this URL: RelayClosedError is the expected\n          // dropped-between-connect-and-subscribe race; anything else must not escape the\n          // `void` wrapper as an unhandled rejection, so it fails the URL as well.\n          failUrl(jobIndex, key);\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). Guard on\n      // identity: a stale relay's delayed close must not delete a newer relay's entry.\n      created.on(\"close\", () => {\n        if (this.#relays.get(norm) === created) {\n          this.#relays.delete(norm);\n          this.#lastActivity.delete(norm);\n        }\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;;;;;;;ACRA,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,IAAI;CAEJ,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;;;;;;;CAQnE,MAAM,eAAqB;EACzB,IAAI,WAAW,KAAK,CAAC,QAAQ;GAC3B,YAAY;GACZ,mBAAmB,KAAK,UAAU,cAAc,mBAAmB,CAAC;EACtE;CACF;CAEA,MAAM,WAAW,UAAkB,QAAsB;EACvD,WAAW,UAAU,KAAK,KAAK;EAC/B,WAAW;EACX,OAAO;CACT;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,aAAa;IACb,WAAW;IACX,OAAO;GACT;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,QAAQ;IAIN,QAAQ,UAAU,GAAG;GACvB;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;;;ACpLA,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;GAG7E,QAAQ,GAAG,eAAe;IACxB,IAAI,KAAK,QAAQ,IAAI,IAAI,MAAM,SAAS;KACtC,KAAK,QAAQ,OAAO,IAAI;KACxB,KAAK,cAAc,OAAO,IAAI;IAChC;GACF,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"}