@qntx/nostr 0.5.0 → 0.7.0

package/dist/{memory-index-Do1mz0WF.mjs → memory-index-C6rujtoc.mjs}

@@ -1,188 +1,7 @@
-import { o as isHex32 } from "./util-LfQirgDk.mjs";
-import { i as isEphemeralKind, t as Kind } from "./kind-Cxwhhkx8.mjs";
-import { _ as formatEventAddress, a as isReplaceableWinner, b as parseEventAddress, d as sortEvents, g as eventAddress, m as validateSignedEvent, o as itemCompare, t as compareEventsDesc } from "./event-D8Nfoh4K.mjs";
+import { d as sortEvents, g as eventAddress, o as itemCompare, t as compareEventsDesc, v as formatEventAddress, x as parseEventAddress } from "./event-DinQMmJ1.mjs";
 import { a as matchFilter } from "./filter-BQl3GlHt.mjs";
-//#region src/storage/deletion.ts
-/**
-* NIP-09 application plan for a kind 5 event.
-*
-* - `e` tags: delete only when the target exists, is not itself kind 5, and shares pubkey.
-* - Unknown `e` ids are pending until the event arrives (client MUST validate pubkey).
-* - `a` tags: tombstone that coordinate up to this deletion's `created_at` when pubkey matches.
-* - Deleting a deletion request is a no-op.
-*/
-function planDeletion(deletion, getById) {
-	const { pubkey } = deletion;
-	const removeIds = [];
-	const pendingIds = [];
-	const coordinates = [];
-	const seenIds = /* @__PURE__ */ new Set();
-	const seenCoords = /* @__PURE__ */ new Set();
-	for (const tag of deletion.tags) {
-		if (tag[0] === "e" && tag[1] !== void 0 && isHex32(tag[1].toLowerCase())) {
-			const id = tag[1].toLowerCase();
-			if (seenIds.has(id)) continue;
-			seenIds.add(id);
-			const existing = getById(id);
-			if (!existing) {
-				pendingIds.push({
-					id,
-					pubkey
-				});
-				continue;
-			}
-			if (existing.kind === Kind.EventDeletion) continue;
-			if (existing.pubkey !== pubkey) continue;
-			removeIds.push(id);
-			continue;
-		}
-		if (tag[0] === "a" && tag[1] !== void 0) {
-			const coord = parseEventAddress(tag[1]);
-			if (!coord || coord.pubkey !== pubkey) continue;
-			const key = `${coord.kind}:${coord.pubkey}:${coord.identifier}`;
-			if (seenCoords.has(key)) continue;
-			seenCoords.add(key);
-			coordinates.push({
-				key,
-				until: deletion.created_at
-			});
-		}
-	}
-	return {
-		removeIds,
-		pendingIds,
-		coordinates
-	};
-}
-/** In-memory NIP-09 tombstones shared by MemoryEventStore and IndexedDbEventStore. */
-var DeletionState = class {
-	ids = /* @__PURE__ */ new Set();
-	pending = /* @__PURE__ */ new Map();
-	coordinates = /* @__PURE__ */ new Map();
-	clear() {
-		this.ids.clear();
-		this.pending.clear();
-		this.coordinates.clear();
-	}
-	covers(event) {
-		if (this.ids.has(event.id)) return true;
-		if (event.kind === Kind.EventDeletion) return false;
-		const pendingPk = this.pending.get(event.id);
-		if (pendingPk !== void 0 && event.pubkey === pendingPk) return true;
-		const addr = eventAddress(event);
-		if (addr === void 0) return false;
-		const until = this.coordinates.get(addr);
-		return until !== void 0 && event.created_at <= until;
-	}
-	absorb(plan) {
-		for (const id of plan.removeIds) {
-			this.ids.add(id);
-			this.pending.delete(id);
-		}
-		for (const p of plan.pendingIds) if (!this.ids.has(p.id)) this.pending.set(p.id, p.pubkey);
-		for (const c of plan.coordinates) {
-			const prev = this.coordinates.get(c.key) ?? Number.NEGATIVE_INFINITY;
-			this.coordinates.delete(c.key);
-			this.coordinates.set(c.key, Math.max(prev, c.until));
-		}
-	}
-};
-function coordinateRemovals(coordinates, getCurrent) {
-	const ids = [];
-	for (const c of coordinates) {
-		const current = getCurrent(c.key);
-		if (current && current.created_at <= c.until) ids.push(current.id);
-	}
-	return ids;
-}
-//#endregion
-//#region src/storage/put.ts
-function outboxBoundKey(pubkey, kind) {
-	return `${pubkey.toLowerCase()}:${kind}`;
-}
-function decidePut(raw, lookup) {
-	if (!validateSignedEvent(raw)) return {
-		action: "skip",
-		result: "invalid",
-		event: raw
-	};
-	const event = raw;
-	if (lookup.deletion.ids.has(event.id) || lookup.getById(event.id)) return {
-		action: "skip",
-		result: "duplicate",
-		event
-	};
-	if (event.kind === Kind.EventDeletion) {
-		const plan = planDeletion(event, lookup.getById);
-		return {
-			action: "delete",
-			result: "deleted",
-			event,
-			plan,
-			coordIds: coordinateRemovals(plan.coordinates, lookup.getReplaceable)
-		};
-	}
-	if (lookup.deletion.covers(event)) return {
-		action: "tombstone",
-		result: "duplicate",
-		event
-	};
-	if (isEphemeralKind(event.kind)) return {
-		action: "skip",
-		result: "ephemeral",
-		event
-	};
-	const address = eventAddress(event);
-	if (address !== void 0) {
-		const prev = lookup.getReplaceable(address);
-		if (prev && prev.id !== event.id && !isReplaceableWinner(event, prev)) return {
-			action: "skip",
-			result: "rejected",
-			event
-		};
-		if (prev !== void 0 && prev.evicted !== true) return {
-			action: "insert",
-			result: "replaced",
-			event,
-			address,
-			replaceId: prev.id
-		};
-		return {
-			action: "insert",
-			result: "accepted",
-			event,
-			address
-		};
-	}
-	return {
-		action: "insert",
-		result: "accepted",
-		event
-	};
-}
-function applyPutMemory(s, d) {
-	if (d.action === "skip") return d.result;
-	if (d.action === "tombstone") {
-		s.deletion.ids.add(d.event.id);
-		s.deletion.pending.delete(d.event.id);
-		return "duplicate";
-	}
-	if (d.action === "delete") {
-		s.deletion.pending.delete(d.event.id);
-		s.deletion.absorb(d.plan);
-		for (const id of d.plan.removeIds) s.indexRemove(id);
-		for (const id of d.coordIds) {
-			s.deletion.ids.add(id);
-			s.indexRemove(id);
-		}
-		s.indexInsert(d.event);
-		return "deleted";
-	}
-	if (d.replaceId !== void 0) s.indexRemove(d.replaceId);
-	s.indexInsert(d.event);
-	return d.result;
-}
-//#endregion
+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-DS0yzVJx.mjs";
 //#region src/storage/memory-index.ts
 /**
 * Synchronous in-memory event index with NIP-01 replaceable / addressable / ephemeral handling and
@@ -207,11 +26,11 @@ var MemoryIndex = class {
 	constructor(opts) {
 		this.#maxTombstones = opts?.maxTombstones;
 		this.#maxWatermarks = opts?.maxWatermarks ?? 0;
-		this.#onInsert = opts?.onInsert === void 0 ? void 0 : (event) => opts.onInsert?.(event);
-		this.#onRemove = opts?.onRemove === void 0 ? void 0 : (event) => opts.onRemove?.(event);
+		this.#onInsert = opts?.onInsert;
+		this.#onRemove = opts?.onRemove;
 	}
 	put(raw) {
-		const decision = decidePut(raw, {
+		const lookup = {
 			deletion: this.#deletion,
 			getById: (id) => this.#byId.get(id),
 			getReplaceable: (addr) => {
@@ -227,7 +46,8 @@ var MemoryIndex = class {
 					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);
@@ -257,9 +77,8 @@ var MemoryIndex = class {
 		if (!coord) return;
 		const id = this.#replaceable.get(formatEventAddress(coord.kind, coord.pubkey, coord.identifier));
 		if (id === void 0) return;
-		const key = id.toLowerCase();
-		if (this.#deletion.ids.has(key)) return;
-		return this.#byId.get(key);
+		if (this.#deletion.ids.has(id)) return;
+		return this.#byId.get(id);
 	}
 	query(filters) {
 		const seen = /* @__PURE__ */ new Set();
@@ -289,7 +108,7 @@ var MemoryIndex = class {
 			});
 		});
 		if (filter.limit !== void 0) {
-			items.sort(queryItemOrder);
+			items.sort(compareEventsDesc);
 			if (items.length > filter.limit) items.length = filter.limit;
 		}
 		items.sort(itemCompare);
@@ -379,12 +198,12 @@ var MemoryIndex = class {
 	#indexInsert(event) {
 		this.#byId.set(event.id, event);
 		const { pubkey } = event;
-		addToSet(this.#byPubkey, pubkey, event.id);
-		addToSet(this.#byKind, event.kind, event.id);
-		addToSet(this.#byKindPubkey, `${event.kind}:${pubkey}`, event.id);
+		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;
-			addToSet(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, event.id);
+			addToSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, event.id);
 		}
 		const addr = eventAddress(event);
 		if (addr !== void 0) {
@@ -394,21 +213,20 @@ var MemoryIndex = class {
 		this.#onInsert?.(event);
 	}
 	#indexRemove(id) {
-		const key = id;
-		this.#dropWatermarkId(key);
-		const event = this.#byId.get(key);
+		this.#dropWatermarkId(id);
+		const event = this.#byId.get(id);
 		if (!event) return false;
-		this.#byId.delete(key);
+		this.#byId.delete(id);
 		const { pubkey } = event;
-		removeFromSet(this.#byPubkey, pubkey, key);
-		removeFromSet(this.#byKind, event.kind, key);
-		removeFromSet(this.#byKindPubkey, `${event.kind}:${pubkey}`, key);
+		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;
-			removeFromSet(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, key);
+			removeFromSetMap(this.#byEpTag, `${tag[0]}:${tag[1].toLowerCase()}`, id);
 		}
 		const addr = eventAddress(event);
-		if (addr !== void 0 && this.#replaceable.get(addr) === key) this.#replaceable.delete(addr);
+		if (addr !== void 0 && this.#replaceable.get(addr) === id) this.#replaceable.delete(addr);
 		this.#onRemove?.(event);
 		return true;
 	}
@@ -513,11 +331,7 @@ var MemoryIndex = class {
 		this.#dropWatermark(addr);
 		this.#watermarks.set(addr, watermark);
 		this.#watermarkIds.set(watermark.id, addr);
-		while (this.#watermarks.size > this.#maxWatermarks) {
-			const oldest = this.#watermarks.keys().next().value;
-			if (oldest === void 0) break;
-			this.#dropWatermark(oldest);
-		}
+		trimOldest(this.#watermarks, this.#maxWatermarks, (a) => this.#dropWatermark(a));
 	}
 	#dropWatermark(addr) {
 		const watermark = this.#watermarks.get(addr);
@@ -534,25 +348,11 @@ var MemoryIndex = class {
 	#trimTombstones() {
 		const cap = this.#maxTombstones;
 		if (cap === void 0) return;
-		let excess = this.#deletion.ids.size - cap;
-		for (const id of this.#deletion.ids) {
-			if (excess <= 0) break;
-			this.#deletion.ids.delete(id);
+		trimOldest(this.#deletion.ids, cap, (id) => {
 			this.#deletion.pending.delete(id);
-			excess--;
-		}
-		excess = this.#deletion.pending.size - cap;
-		for (const id of this.#deletion.pending.keys()) {
-			if (excess <= 0) break;
-			this.#deletion.pending.delete(id);
-			excess--;
-		}
-		excess = this.#deletion.coordinates.size - cap;
-		for (const key of this.#deletion.coordinates.keys()) {
-			if (excess <= 0) break;
-			this.#deletion.coordinates.delete(key);
-			excess--;
-		}
+		});
+		trimOldest(this.#deletion.pending, cap);
+		trimOldest(this.#deletion.coordinates, cap);
 	}
 };
 function visitEpTagIds(byEpTag, byId, name, values, seen, visit) {
@@ -568,24 +368,7 @@ function visitEpTagIds(byEpTag, byId, name, values, seen, visit) {
 		}
 	}
 }
-function addToSet(map, key, id) {
-	let set = map.get(key);
-	if (!set) {
-		set = /* @__PURE__ */ new Set();
-		map.set(key, set);
-	}
-	set.add(id);
-}
-function removeFromSet(map, key, id) {
-	const set = map.get(key);
-	if (!set) return;
-	set.delete(id);
-	if (set.size === 0) map.delete(key);
-}
-function queryItemOrder(a, b) {
-	return compareEventsDesc(a, b);
-}
 //#endregion
-export { planDeletion as a, DeletionState as i, decidePut as n, outboxBoundKey as r, MemoryIndex as t };
+export { MemoryIndex as t };
 
-//# sourceMappingURL=memory-index-Do1mz0WF.mjs.map
+//# sourceMappingURL=memory-index-C6rujtoc.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-index-C6rujtoc.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-CWLcFTQ1.mjs

@@ -0,0 +1,194 @@
+import { _ as MessageError, a as hexToBytes, c as isRecord, i as bytesToHex } from "./util-yFYzlbrm.mjs";
+import { m as validateSignedEvent } from "./event-DinQMmJ1.mjs";
+//#region src/core/message.ts
+/** Validate a subscription id; throws {@link MessageError} unless 1..64 chars. */
+function assertSubscriptionId(id) {
+	if (id.length === 0 || id.length > 64) throw new MessageError(`subscription id length must be 1..64`);
+	return id;
+}
+/** Validate the given id, or mint a random 16-hex-char subscription id. */
+function createSubscriptionId(id) {
+	if (id !== void 0) return assertSubscriptionId(id);
+	const bytes = /* @__PURE__ */ new Uint8Array(8);
+	crypto.getRandomValues(bytes);
+	return bytesToHex(bytes);
+}
+const HLL_BYTES = 256;
+const HLL_HEX_LEN = HLL_BYTES * 2;
+const HEX_RE = /^[0-9a-fA-F]+$/;
+/**
+* Register-wise max of NIP-45 HyperLogLog sketches. Output is always lowercase 512 hex. Empty input
+* is the zero sketch (identity).
+*/
+function mergeCountHll(hexes) {
+	const merged = new Uint8Array(HLL_BYTES);
+	for (const hex of hexes) {
+		if (hex.length !== HLL_HEX_LEN || !HEX_RE.test(hex)) throw new MessageError("invalid NIP-45 HLL sketch: expected 512-char hex");
+		const bytes = hexToBytes(hex);
+		for (const [i, b] of bytes.entries()) {
+			const m = merged[i];
+			if (m !== void 0 && b > m) merged[i] = b;
+		}
+	}
+	return bytesToHex(merged);
+}
+/** Serialize a client->relay message to its NIP-01 JSON wire form. */
+function encodeClientMessage(message) {
+	return JSON.stringify(message);
+}
+/** Serialize a relay->client message to its NIP-01 JSON wire form. */
+function encodeRelayMessage(message) {
+	return JSON.stringify(message);
+}
+/** Parse a client->relay JSON message; throws {@link MessageError} on malformed input. */
+function parseClientMessage(raw) {
+	let parsed;
+	try {
+		parsed = JSON.parse(raw);
+	} catch {
+		throw new MessageError("client message is not valid JSON");
+	}
+	if (!Array.isArray(parsed) || parsed.length === 0 || typeof parsed[0] !== "string") throw new MessageError("client message must be a non-empty JSON array");
+	const items = parsed;
+	const [type] = items;
+	switch (type) {
+		case "EVENT":
+			if (items.length !== 2 || !validateSignedEvent(items[1])) throw new MessageError("invalid EVENT client message");
+			return ["EVENT", items[1]];
+		case "REQ":
+			if (items.length < 3 || typeof items[1] !== "string") throw new MessageError("invalid REQ client message");
+			return [
+				"REQ",
+				items[1],
+				...parseWireFilters(items.slice(2), "REQ")
+			];
+		case "CLOSE":
+			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid CLOSE client message");
+			return ["CLOSE", items[1]];
+		case "AUTH":
+			if (items.length !== 2 || !validateSignedEvent(items[1])) throw new MessageError("invalid AUTH client message");
+			return ["AUTH", items[1]];
+		case "COUNT":
+			if (items.length < 3 || typeof items[1] !== "string") throw new MessageError("invalid COUNT client message");
+			return [
+				"COUNT",
+				items[1],
+				...parseWireFilters(items.slice(2), "COUNT")
+			];
+		case "NEG-OPEN":
+			if (items.length === 5) throw new MessageError("obsolete 5-element NEG-OPEN; expected [NEG-OPEN, id, filter, hex]");
+			if (items.length !== 4 || typeof items[1] !== "string" || !isWireFilter(items[2]) || !isNegHex(items[3])) throw new MessageError("invalid NEG-OPEN client message");
+			return [
+				"NEG-OPEN",
+				items[1],
+				items[2],
+				items[3].toLowerCase()
+			];
+		case "NEG-MSG":
+			if (items.length !== 3 || typeof items[1] !== "string" || !isNegHex(items[2])) throw new MessageError("invalid NEG-MSG client message");
+			return [
+				"NEG-MSG",
+				items[1],
+				items[2].toLowerCase()
+			];
+		case "NEG-CLOSE":
+			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid NEG-CLOSE client message");
+			return ["NEG-CLOSE", items[1]];
+		default: throw new MessageError(`unknown client message type: ${String(type)}`);
+	}
+}
+/** Parse a relay->client JSON message; throws {@link MessageError} on malformed input. */
+function parseRelayMessage(raw) {
+	let parsed;
+	try {
+		parsed = JSON.parse(raw);
+	} catch {
+		throw new MessageError("relay message is not valid JSON");
+	}
+	if (!Array.isArray(parsed) || parsed.length === 0 || typeof parsed[0] !== "string") throw new MessageError("relay message must be a non-empty JSON array");
+	const items = parsed;
+	const [type] = items;
+	switch (type) {
+		case "EVENT":
+			if (items.length !== 3 || typeof items[1] !== "string" || !validateSignedEvent(items[2])) throw new MessageError("invalid EVENT relay message");
+			return [
+				"EVENT",
+				items[1],
+				items[2]
+			];
+		case "OK":
+			if (items.length !== 4 || typeof items[1] !== "string" || typeof items[2] !== "boolean" || typeof items[3] !== "string") throw new MessageError("invalid OK relay message");
+			return [
+				"OK",
+				items[1],
+				items[2],
+				items[3]
+			];
+		case "EOSE":
+			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid EOSE relay message");
+			return ["EOSE", items[1]];
+		case "CLOSED":
+			if (items.length !== 3 || typeof items[1] !== "string" || typeof items[2] !== "string") throw new MessageError("invalid CLOSED relay message");
+			return [
+				"CLOSED",
+				items[1],
+				items[2]
+			];
+		case "NOTICE":
+			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid NOTICE relay message");
+			return ["NOTICE", items[1]];
+		case "AUTH":
+			if (items.length !== 2 || typeof items[1] !== "string") throw new MessageError("invalid AUTH relay message");
+			return ["AUTH", items[1]];
+		case "COUNT": {
+			const payload = items.at(2);
+			if (items.length !== 3 || typeof items[1] !== "string" || !isRecord(payload) || typeof payload["count"] !== "number") throw new MessageError("invalid COUNT relay message");
+			const result = { count: payload["count"] };
+			if (typeof payload["approximate"] === "boolean") result.approximate = payload["approximate"];
+			const hll = parseCountHll(payload["hll"]);
+			if (hll !== void 0) result.hll = hll;
+			return [
+				"COUNT",
+				items[1],
+				result
+			];
+		}
+		case "NEG-MSG":
+			if (items.length !== 3 || typeof items[1] !== "string" || !isNegHex(items[2])) throw new MessageError("invalid NEG-MSG relay message");
+			return [
+				"NEG-MSG",
+				items[1],
+				items[2].toLowerCase()
+			];
+		case "NEG-ERR":
+			if (items.length !== 3 && items.length !== 4 || typeof items[1] !== "string" || typeof items[2] !== "string") throw new MessageError("invalid NEG-ERR relay message");
+			return [
+				"NEG-ERR",
+				items[1],
+				items[2]
+			];
+		default: throw new MessageError(`unknown relay message type: ${String(type)}`);
+	}
+}
+function parseCountHll(value) {
+	if (typeof value !== "string" || value.length !== HLL_HEX_LEN || !HEX_RE.test(value)) return;
+	return value.toLowerCase();
+}
+function isWireFilter(value) {
+	return isRecord(value);
+}
+function parseWireFilters(items, kind) {
+	const filters = [];
+	for (const item of items) {
+		if (!isWireFilter(item)) throw new MessageError(`invalid ${kind} filter`);
+		filters.push(item);
+	}
+	return filters;
+}
+function isNegHex(value) {
+	return typeof value === "string" && value.length > 0 && value.length % 2 === 0 && HEX_RE.test(value);
+}
+//#endregion
+export { mergeCountHll as a, encodeRelayMessage as i, createSubscriptionId as n, parseClientMessage as o, encodeClientMessage as r, parseRelayMessage as s, assertSubscriptionId as t };
+
+//# sourceMappingURL=message-CWLcFTQ1.mjs.map

package/dist/message-CWLcFTQ1.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"message-CWLcFTQ1.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 type { Filter } from \"./filter.ts\";\nimport { SUBSCRIPTION_ID_MAX_CHARS } from \"./limits.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 chars. */\nexport function assertSubscriptionId(id: string): SubscriptionId {\n  if (id.length === 0 || id.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  count: number;\n  approximate?: boolean;\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  hll?: string;\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  return JSON.stringify(message);\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\", 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\", 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 [\"COUNT\", items[1], ...parseWireFilters(items.slice(2), \"COUNT\")];\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        !isWireFilter(items[2]) ||\n        !isNegHex(items[3])\n      ) {\n        throw new MessageError(\"invalid NEG-OPEN client message\");\n      }\n      return [\"NEG-OPEN\", items[1], items[2], items[3].toLowerCase()];\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\", 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\", 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\", items[1], items[2]];\n\n    case \"OK\":\n      if (\n        items.length !== 4 ||\n        typeof items[1] !== \"string\" ||\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\", 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\", 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      if (\n        items.length !== 3 ||\n        typeof items[1] !== \"string\" ||\n        !isRecord(payload) ||\n        typeof payload[\"count\"] !== \"number\"\n      ) {\n        throw new MessageError(\"invalid COUNT relay message\");\n      }\n      const result: CountResult = { count: payload[\"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\", 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\", 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\", 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\nfunction isWireFilter(value: unknown): value is Filter {\n  return isRecord(value);\n}\n\nfunction parseWireFilters(items: unknown[], kind: string): Filter[] {\n  const filters: Filter[] = [];\n  for (const item of items) {\n    if (!isWireFilter(item)) {\n      throw new MessageError(`invalid ${kind} filter`);\n    }\n    filters.push(item);\n  }\n  return filters;\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":";;;;AAWA,SAAgB,qBAAqB,IAA4B;CAC/D,IAAI,GAAG,WAAW,KAAK,GAAG,SAAA,IACxB,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;CAClE,OAAO,KAAK,UAAU,OAAO;AAC/B;;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,MAAM;IAAI,GAAG,iBAAiB,MAAM,MAAM,CAAC,GAAG,KAAK;GAAC;EAErE,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO,CAAC,SAAS,MAAM,EAAE;EAE3B,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;IAAC;IAAS,MAAM;IAAI,GAAG,iBAAiB,MAAM,MAAM,CAAC,GAAG,OAAO;GAAC;EAEzE,KAAK;GACH,IAAI,MAAM,WAAW,GACnB,MAAM,IAAI,aAAa,mEAAmE;GAE5F,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,aAAa,MAAM,EAAE,KACtB,CAAC,SAAS,MAAM,EAAE,GAElB,MAAM,IAAI,aAAa,iCAAiC;GAE1D,OAAO;IAAC;IAAY,MAAM;IAAI,MAAM;IAAI,MAAM,EAAE,CAAC,YAAY;GAAC;EAEhE,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,CAAC,SAAS,MAAM,EAAE,GAC1E,MAAM,IAAI,aAAa,gCAAgC;GAEzD,OAAO;IAAC;IAAW,MAAM;IAAI,MAAM,EAAE,CAAC,YAAY;GAAC;EAErD,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,UAC5C,MAAM,IAAI,aAAa,kCAAkC;GAE3D,OAAO,CAAC,aAAa,MAAM,EAAE;EAE/B,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,MAAM;IAAI,MAAM;GAAE;EAErC,KAAK;GACH,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,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,MAAM,EAAE;EAE1B,KAAK;GACH,IAAI,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO,YAAY,OAAO,MAAM,OAAO,UAC5E,MAAM,IAAI,aAAa,8BAA8B;GAEvD,OAAO;IAAC;IAAU,MAAM;IAAI,MAAM;GAAE;EAEtC,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,IACE,MAAM,WAAW,KACjB,OAAO,MAAM,OAAO,YACpB,CAAC,SAAS,OAAO,KACjB,OAAO,QAAQ,aAAa,UAE5B,MAAM,IAAI,aAAa,6BAA6B;GAEtD,MAAM,SAAsB,EAAE,OAAO,QAAQ,SAAS;GACtD,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,MAAM;IAAI;GAAM;EACnC;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,MAAM;IAAI,MAAM,EAAE,CAAC,YAAY;GAAC;EAErD,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,MAAM;IAAI,MAAM;GAAE;EAEvC,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,SAAS,aAAa,OAAiC;CACrD,OAAO,SAAS,KAAK;AACvB;AAEA,SAAS,iBAAiB,OAAkB,MAAwB;CAClE,MAAM,UAAoB,CAAC;CAC3B,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,CAAC,aAAa,IAAI,GACpB,MAAM,IAAI,aAAa,WAAW,KAAK,QAAQ;EAEjD,QAAQ,KAAK,IAAI;CACnB;CACA,OAAO;AACT;AAEA,SAAS,SAAS,OAAiC;CACjD,OACE,OAAO,UAAU,YAAY,MAAM,SAAS,KAAK,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,KAAK;AAEhG"}

package/dist/{message-iGPIqnn0.d.mts → message-CbBZOhq3.d.mts}

@@ -1,5 +1,5 @@
-import { t as Event } from "./event-fU3Y01PR.mjs";
-import { t as Filter } from "./filter-C0IMByE3.mjs";
+import { t as Event } from "./event-DJeb_DIL.mjs";
+import { t as Filter } from "./filter-jI_9htF7.mjs";
 //#region src/core/message.d.ts
 /** NIP-01 subscription id: 1..64 chars. */
 type SubscriptionId = string;
@@ -36,4 +36,4 @@ declare function parseClientMessage(raw: string): ClientMessage;
 declare function parseRelayMessage(raw: string): RelayMessage;
 //#endregion
 export { assertSubscriptionId as a, encodeRelayMessage as c, parseRelayMessage as d, SubscriptionId as i, mergeCountHll as l, CountResult as n, createSubscriptionId as o, RelayMessage as r, encodeClientMessage as s, ClientMessage as t, parseClientMessage as u };
-//# sourceMappingURL=message-iGPIqnn0.d.mts.map
+//# sourceMappingURL=message-CbBZOhq3.d.mts.map