@graphrefly/graphrefly 0.34.0 → 0.36.0

package/dist/index-2URa-V4S.d.cts

@@ -0,0 +1,461 @@
+import { a as Node } from './node-fSc-hCv8.cjs';
+import { R as ReactiveLogBundle } from './reactive-log-ScpWyqny.cjs';
+import { AppendLogStorageTier } from './extra/storage-tiers.cjs';
+import { a as GraphOptions, G as Graph } from './graph-kTltt95s.cjs';
+import { B as BaseAuditRecord } from './imperative-audit-ahAE65a9.cjs';
+
+/**
+ * CQRS patterns (roadmap §4.5).
+ *
+ * Composition layer over reactiveLog (3.2), pipeline/sagas (4.1), event bus (4.2),
+ * projections (4.3). Guards (1.5) enforce command/query boundary.
+ *
+ * - `cqrs(name, opts?)` → `CqrsGraph` — top-level factory
+ * - `CqrsGraph.command(name, handler)` — write-only node; guard rejects `observe`
+ * - `CqrsGraph.event(name)` — backed by `reactiveLog`; append-only
+ * - `CqrsGraph.projection(name, events, reducer, initial)` — read-only derived; guard rejects `write`
+ * - `CqrsGraph.saga(name, events, handler)` — event-driven side effects
+ */
+
+/**
+ * Immutable envelope for events emitted by command handlers.
+ *
+ * **Wave C.1 Unit 17 (locked 2026-04-24):** Extended ES standard fields —
+ * `aggregateId` / `aggregateVersion` for per-aggregate streams; correlation /
+ * causation IDs for distributed tracing; `metadata` for free-form context.
+ * Optional `handlerVersion` (Audit 5) traces which handler version produced
+ * the event.
+ *
+ * `seq` is a per-graph monotonic counter that provides stable ordering when
+ * multiple events share the same `timestampNs` (same wall-clock tick).
+ */
+type CqrsEvent<T = unknown> = {
+    type: string;
+    payload: T;
+    /** Wall-clock nanoseconds (via `wallClockNs()`). */
+    timestampNs: number;
+    /** Monotonic sequence within this CqrsGraph instance. */
+    seq: number;
+    /** Aggregate identifier (per-aggregate streams). */
+    aggregateId?: string;
+    /** Per-aggregate monotonic version (set when `aggregateId` is provided). */
+    aggregateVersion?: number;
+    /** Distributed-trace correlation id. */
+    correlationId?: string;
+    /** Causation chain id (this event was caused by event `causationId`). */
+    causationId?: string;
+    /** Free-form metadata frozen at append. */
+    metadata?: Readonly<Record<string, unknown>>;
+    /** V0 identity of the event log node at append time (§6.0b). */
+    v0?: {
+        id: string;
+        version: number;
+    };
+    /** Handler version stamped on emit (Audit 5). */
+    handlerVersion?: {
+        id: string;
+        version: string | number;
+    };
+};
+/** Compile-time event-map registry: `{ "orderPlaced": OrderPayload, ... }`. */
+type CqrsEventMap = Record<string, unknown>;
+/** Recommended `keyOf` for CQRS event-store storage tiers (Audit 4). */
+declare const cqrsEventKeyOf: (e: CqrsEvent) => string;
+interface DispatchRecord<T = unknown> extends BaseAuditRecord {
+    readonly commandName: string;
+    readonly payload: T;
+    readonly status: "success" | "failed";
+    readonly error?: unknown;
+    readonly errorType?: string;
+    /**
+     * Event names emitted by the handler.
+     * - `status: "success"`: events that persisted in the event log.
+     * - `status: "failed"`: events the handler ATTEMPTED to emit before throwing;
+     *   they were rolled back and did NOT persist. Documents the failed attempt's
+     *   intentions for debugging handler logic. The actual event log shows only
+     *   what's durable.
+     */
+    readonly emittedEvents?: readonly string[];
+}
+declare const dispatchKeyOf: <T>(r: DispatchRecord<T>) => string;
+interface SagaInvocation<T = unknown> extends BaseAuditRecord {
+    readonly eventType: string;
+    readonly status: "success" | "failed";
+    readonly error?: unknown;
+    readonly errorType?: string;
+    readonly aggregateId?: string;
+    readonly event?: CqrsEvent<T>;
+}
+declare const sagaInvocationKeyOf: <T>(i: SagaInvocation<T>) => string;
+/**
+ * Saga registration result (M10) — a typed bundle replacing the prior
+ * `Node<unknown>` return that side-attached `_saga` via an unsafe cast.
+ *
+ * `node` is the saga's effect node (subscribe to observe processing
+ * activity). `invocations` is the per-event-type audit log; `audit` aliases
+ * `invocations` (Audit 2 `.audit` duplication). `cursors` exposes the
+ * per-event-type cursor state nodes for monitoring / testing.
+ *
+ * @category patterns
+ */
+interface SagaController<T = unknown> {
+    readonly node: Node<unknown>;
+    readonly invocations: ReactiveLogBundle<SagaInvocation<T>>;
+    readonly audit: ReactiveLogBundle<SagaInvocation<T>>;
+    readonly cursors: {
+        readonly [eventName: string]: Node<number>;
+    };
+}
+type CommandActions = {
+    /** Append an event to a named event log (bypasses event guard). */
+    emit: (eventName: string, payload: unknown) => void;
+};
+/**
+ * Command handler receives the dispatch payload and actions to emit events.
+ *
+ * **Purity:** Handlers should not mutate the payload. Event emission via
+ * `actions.emit()` is the only sanctioned side effect.
+ */
+type CommandHandler<T = unknown> = (payload: T, actions: CommandActions) => void;
+/**
+ * Projection reducer folds events into a read model.
+ *
+ * **Purity contract:** Reducers MUST be pure — return a new state value
+ * without mutating `state` or any event.
+ *
+ * - In **`"replay"`** mode the `state` parameter is always the original
+ *   `initial` value (full event-sourcing replay on every recompute).
+ * - In **`"scan"`** mode the `state` parameter is the _previous_ output
+ *   (incremental fold); `events` contains only the events appended since
+ *   the last computation.
+ */
+type ProjectionReducer<TState = unknown, TEvent = unknown> = (state: TState, events: readonly CqrsEvent<TEvent>[]) => TState;
+/**
+ * Snapshot integration for {@link ProjectionOptions}.
+ *
+ * `load` is called once at projection construction and the returned value
+ * seeds the initial state. `save` (optional) is called after each reducer
+ * run, debounced by `saveDebounceMs` (default 1000 ms) and capped by
+ * `saveEvery` (default 1000 events).
+ */
+type ProjectionSnapshotOpts<TState> = {
+    /** Load a previously-saved state. `undefined` → start from `initial`. */
+    load: () => TState | undefined | Promise<TState | undefined>;
+    /** Persist the current state. Called after reducer; may be async. */
+    save?: (state: TState) => void | Promise<void>;
+    /**
+     * Debounce window (ms) before `save` fires after the last event. Default 1000.
+     */
+    saveDebounceMs?: number;
+    /**
+     * Force a save after every Nth state change regardless of debounce.
+     * Default 1000. Both knobs compose: save fires at whichever condition is
+     * met first.
+     */
+    saveEvery?: number;
+};
+/**
+ * Options for {@link CqrsGraph.projection}.
+ *
+ * **Wave C.3 Unit 21 (locked 2026-04-24):**
+ * - `mode: "scan"` (default) — incremental fold; `"replay"` — full replay
+ *   each wave.
+ * - `snapshot` — load/save integration for cold-start + auto-checkpoint.
+ * - `freezeInputs` (default `true`) — freeze event arrays before passing
+ *   to reducer (purity enforcement).
+ * - `rebuild()` / `reset()` on the returned {@link ProjectionController}.
+ *
+ * @category patterns
+ */
+type ProjectionOptions<TState> = {
+    name: string;
+    events: readonly string[];
+    reducer: ProjectionReducer<TState>;
+    initial: TState;
+    /**
+     * Fold strategy. Default `"scan"` (incremental). `"replay"` = full replay.
+     *
+     * **Scan-mode ordering caveat:** scan-mode assumes monotonic per-stream
+     * arrival order. When multiple event streams are merged for a projection,
+     * events arriving with a `timestampNs` earlier than the current sort cursor
+     * are skipped from the incremental sweep. This is an acceptable trade-off
+     * for incremental fold; use `mode: "replay"` for strict cross-stream
+     * ordering.
+     */
+    mode?: "replay" | "scan";
+    /** Snapshot integration for rebuild + auto-checkpoint. */
+    snapshot?: ProjectionSnapshotOpts<TState>;
+    /**
+     * Freeze event arrays before passing to reducer (default `true`).
+     * Set to `false` only if your reducer intentionally mutates the input
+     * (strongly discouraged — prefer immutable reducers).
+     */
+    freezeInputs?: boolean;
+};
+/**
+ * Controller returned by {@link CqrsGraph.projection}.
+ *
+ * `node` is the reactive read model. `rebuild()` performs a paginated
+ * cold-storage replay (requires `attachEventStorage` tiers). `reset()`
+ * reloads from `snapshot.load()` and re-folds the live event log on top.
+ *
+ * @category patterns
+ */
+interface ProjectionController<TState> {
+    readonly node: Node<TState>;
+    /**
+     * Async paginated rebuild from attached storage tiers. Throws
+     * {@link RebuildError} on adapter / decode / reducer failure.
+     *
+     * @param opts.fromTier - Storage tier to read from (default: first attached).
+     * @param opts.pageSize - Entries per page (default 1000).
+     */
+    rebuild(opts?: {
+        fromTier?: AppendLogStorageTier<CqrsEvent>;
+        pageSize?: number;
+    }): Promise<TState>;
+    /**
+     * Reload from `snapshot.load()` (if configured) and re-fold the live
+     * in-memory event log on top. Returns the rebuilt state. No-op on the
+     * reactive node if the state is unchanged.
+     */
+    reset(): Promise<TState>;
+}
+type SagaHandler<T = unknown> = (event: CqrsEvent<T>) => void;
+type CqrsOptions = {
+    graph?: GraphOptions;
+    /** Bounded retention for event streams; default 1024 (cross-cutting). */
+    retainedLimit?: number;
+    /** Freeze command payloads on dispatch (default `true`). */
+    freezeCommandPayload?: boolean;
+    /** Freeze event payloads on emit (default `true`). */
+    freezeEventPayload?: boolean;
+    /** LRU eviction threshold for per-aggregate streams (default 10_000). */
+    maxAggregates?: number;
+};
+type CommandRegistration<TPayload = unknown> = {
+    handler: CommandHandler<TPayload>;
+    emits?: readonly string[];
+    handlerVersion?: {
+        id: string;
+        version: string | number;
+    };
+};
+type DispatchOptions = {
+    correlationId?: string;
+    causationId?: string;
+    metadata?: Record<string, unknown>;
+    /**
+     * Optimistic-concurrency check: if set, dispatch verifies the aggregate
+     * (identified by `aggregateId`) is at this version. On mismatch, dispatch
+     * throws {@link OptimisticConcurrencyError} BEFORE the handler runs.
+     *
+     * Requires `aggregateId` to be set. Without it the check is a no-op.
+     */
+    expectedAggregateVersion?: number;
+    /**
+     * Aggregate this dispatch targets. Events emitted by the handler that
+     * also carry this `aggregateId` participate in per-aggregate versioning
+     * and LRU eviction (see {@link CqrsOptions.maxAggregates}). Events whose
+     * handler-supplied `aggregateId` differs from the dispatch's `aggregateId`
+     * are emitted untouched (their own `aggregateVersion` is computed from
+     * their own aggregate's stream).
+     */
+    aggregateId?: string;
+};
+type SagaOptions = {
+    aggregateId?: string;
+    errorPolicy?: "advance" | "hold";
+    handlerVersion?: {
+        id: string;
+        version: string | number;
+    };
+};
+/**
+ * Eviction record emitted on `aggregateEvictions` when an aggregate's
+ * per-aggregate stream is removed under `maxAggregates` LRU pressure. The
+ * eviction does NOT delete events from the fan-in stream — only the
+ * per-aggregate dedicated stream and its version counter.
+ */
+interface AggregateEvictionRecord {
+    readonly aggregateId: string;
+    readonly type: string;
+    readonly t_ns: number;
+    /** The version count the aggregate reached before eviction (for diagnostics). */
+    readonly lastVersion: number;
+}
+declare class CqrsGraph<EM extends CqrsEventMap = Record<string, unknown>> extends Graph {
+    /** Fan-in event streams (one per type, all aggregates merged). */
+    private readonly _eventLogs;
+    /**
+     * Per-aggregate event streams: type → aggregateId → entry. Used for
+     * `event(type, aggregateId)` dual-form access and per-aggregate version
+     * tracking. Only populated when an event with `aggregateId` is emitted.
+     */
+    private readonly _eventLogsByAggregate;
+    /** Per-aggregate version counters: `${type}::${aggregateId}` → current version. */
+    private readonly _aggregateVersions;
+    /**
+     * LRU access order for `${type}::${aggregateId}`. Map insertion order
+     * tracks recency — `delete` + `set` on access moves to the end.
+     */
+    private readonly _aggregateLru;
+    private readonly _commandRegs;
+    private readonly _projections;
+    private readonly _sagas;
+    private readonly _keepaliveDisposers;
+    private _seq;
+    private readonly _retainedLimit;
+    private readonly _freezeCommandPayload;
+    private readonly _freezeEventPayload;
+    private readonly _maxAggregates;
+    private readonly _dispatchSeqCursor;
+    /** Audit log of every command dispatch (Audit 2). */
+    readonly dispatches: ReactiveLogBundle<DispatchRecord>;
+    /** Alias for {@link CqrsGraph.dispatches} (Audit 2 `.audit` duplication). */
+    readonly audit: ReactiveLogBundle<DispatchRecord>;
+    /** Per-aggregate LRU eviction observability; secondary log to `dispatches`. */
+    readonly aggregateEvictions: ReactiveLogBundle<AggregateEvictionRecord>;
+    constructor(name: string, opts?: CqrsOptions);
+    /**
+     * Read the current per-aggregate version (last emitted `aggregateVersion`
+     * for that `(type, aggregateId)` pair). Returns `0` if no events have been
+     * emitted yet for this aggregate. Useful for callers preparing
+     * {@link DispatchOptions.expectedAggregateVersion}.
+     */
+    aggregateVersion(type: string, aggregateId: string): number;
+    /** LRU touch — moves the key to the end of the access order. */
+    private _touchAggregate;
+    /**
+     * Evict the oldest aggregate streams (least-recently-touched) until the
+     * aggregate count is back within `_maxAggregates`. Emits one
+     * `AggregateEvictionRecord` per eviction. The fan-in stream is NOT touched
+     * — events stay in the type-level log; only the per-aggregate stream and
+     * version counter are removed.
+     */
+    private _enforceAggregateLru;
+    destroy(): void;
+    /** Tiers attached via {@link attachEventStorage}; auto-wired into future event streams. */
+    private readonly _attachedEventTiers;
+    private readonly _attachedTierDisposers;
+    /**
+     * Wire append-log storage tiers for ALL CQRS event streams — both currently
+     * registered AND any future streams created via `event(name)` /
+     * `event(name, aggregateId)` / handler emit. (M4 fix.)
+     *
+     * Returns a disposer that releases all storage subscriptions wired by this
+     * call (including those for streams that were created after the call).
+     */
+    attachEventStorage(tiers: readonly AppendLogStorageTier<CqrsEvent>[]): () => void;
+    /** Wire newly-created event stream into all currently-attached tier sets. */
+    private _autoWireStreamStorage;
+    private _bumpDispatchSeq;
+    /**
+     * Register a named event stream backed by `reactiveLog`.
+     * Guard denies external `write` — only commands append internally.
+     */
+    event(name: string): Node<readonly CqrsEvent[]>;
+    event(name: string, aggregateId: string): Node<readonly CqrsEvent[]>;
+    /**
+     * Get-or-create the per-aggregate event stream for `(type, aggregateId)`.
+     * Mounts the stream as a sibling node named `<type>_<aggregateId>` so it
+     * appears in `describe()`. LRU access is touched on every call.
+     */
+    private _ensureAggregateStream;
+    /** Try `resolve(path)`; return `undefined` instead of throwing on missing. */
+    private resolveOptional;
+    /** Internal: append to an event log, auto-registering if needed. */
+    private _appendEvent;
+    /**
+     * Register a command with its handler. Guard denies `observe` (write-only).
+     * Use `dispatch(name, payload)` to execute.
+     *
+     * The command node carries dynamic `meta.error` — a reactive companion
+     * that holds the last handler error (or `null` on success).
+     */
+    command<T = unknown>(name: string, handlerOrReg: CommandHandler<T> | CommandRegistration<T>): Node<T>;
+    /**
+     * Execute a registered command. Wraps the entire dispatch in `batch()` so
+     * the command node DATA and all emitted events settle atomically.
+     *
+     * If the handler throws, `meta.error` on the command node is set to the
+     * error and the exception is re-thrown.
+     */
+    dispatch<T = unknown>(commandName: string, payload: T, opts?: DispatchOptions): void;
+    /**
+     * Register a read-only projection derived from event streams.
+     * Guard denies `write` — value is computed from events only.
+     *
+     * **Wave C.3 Unit 21 (locked 2026-04-24):**
+     * - Object-bag signature replaces the positional `(name, events, reducer, initial)` form.
+     * - `mode: "scan"` (default) — incremental fold; `"replay"` — full replay each wave.
+     * - `snapshot` integration for cold-start load + auto-checkpoint save.
+     * - `freezeInputs` (default `true`) — freeze the event array before passing to reducer.
+     * - Returns `ProjectionController<TState>` with `.node`, `.rebuild()`, `.reset()`.
+     *
+     * Fan-in across `events` is implemented by depending on all event-type fan-in
+     * nodes directly, which preserves `describe()` edges (e.g. `orderPlaced →
+     * orderCount`). Events are sorted by `(timestampNs, seq, aggregateId)` before
+     * passing to the reducer (Option-3 cross-aggregate ordering, C.3).
+     */
+    projection<TState>(opts: ProjectionOptions<TState>): ProjectionController<TState>;
+    /**
+     * Register an event-driven side effect. Runs handler for each **new** event
+     * from the specified streams (tracks last-processed entry count per stream).
+     *
+     * The saga node carries dynamic `meta.error` — a reactive companion that
+     * holds the last handler error (or `null` on success). Handler errors do
+     * not propagate out of the saga run (the event cursor still advances so
+     * the same entry is not delivered twice).
+     */
+    saga<T = unknown>(name: string, eventNames: readonly string[], handler: SagaHandler<T>, opts?: SagaOptions): SagaController<T>;
+}
+/**
+ * Create a CQRS graph container.
+ *
+ * @example
+ * ```ts
+ * const app = cqrs("orders");
+ * app.event("orderPlaced");
+ * app.command("placeOrder", (payload, { emit }) => {
+ *   emit("orderPlaced", { orderId: payload.id, amount: payload.amount });
+ * });
+ * const { node: orderCount } = app.projection({
+ *   name: "orderCount",
+ *   events: ["orderPlaced"],
+ *   reducer: (_s, events) => events.length,
+ *   initial: 0,
+ * });
+ * app.dispatch("placeOrder", { id: "1", amount: 100 });
+ * ```
+ */
+declare function cqrs<EM extends CqrsEventMap = Record<string, unknown>>(name: string, opts?: CqrsOptions): CqrsGraph<EM>;
+
+type index_AggregateEvictionRecord = AggregateEvictionRecord;
+type index_CommandActions = CommandActions;
+type index_CommandHandler<T = unknown> = CommandHandler<T>;
+type index_CommandRegistration<TPayload = unknown> = CommandRegistration<TPayload>;
+type index_CqrsEvent<T = unknown> = CqrsEvent<T>;
+type index_CqrsEventMap = CqrsEventMap;
+type index_CqrsGraph<EM extends CqrsEventMap = Record<string, unknown>> = CqrsGraph<EM>;
+declare const index_CqrsGraph: typeof CqrsGraph;
+type index_CqrsOptions = CqrsOptions;
+type index_DispatchOptions = DispatchOptions;
+type index_DispatchRecord<T = unknown> = DispatchRecord<T>;
+type index_ProjectionController<TState> = ProjectionController<TState>;
+type index_ProjectionOptions<TState> = ProjectionOptions<TState>;
+type index_ProjectionReducer<TState = unknown, TEvent = unknown> = ProjectionReducer<TState, TEvent>;
+type index_ProjectionSnapshotOpts<TState> = ProjectionSnapshotOpts<TState>;
+type index_SagaController<T = unknown> = SagaController<T>;
+type index_SagaHandler<T = unknown> = SagaHandler<T>;
+type index_SagaInvocation<T = unknown> = SagaInvocation<T>;
+type index_SagaOptions = SagaOptions;
+declare const index_cqrs: typeof cqrs;
+declare const index_cqrsEventKeyOf: typeof cqrsEventKeyOf;
+declare const index_dispatchKeyOf: typeof dispatchKeyOf;
+declare const index_sagaInvocationKeyOf: typeof sagaInvocationKeyOf;
+declare namespace index {
+  export { type index_AggregateEvictionRecord as AggregateEvictionRecord, type index_CommandActions as CommandActions, type index_CommandHandler as CommandHandler, type index_CommandRegistration as CommandRegistration, type index_CqrsEvent as CqrsEvent, type index_CqrsEventMap as CqrsEventMap, index_CqrsGraph as CqrsGraph, type index_CqrsOptions as CqrsOptions, type index_DispatchOptions as DispatchOptions, type index_DispatchRecord as DispatchRecord, type index_ProjectionController as ProjectionController, type index_ProjectionOptions as ProjectionOptions, type index_ProjectionReducer as ProjectionReducer, type index_ProjectionSnapshotOpts as ProjectionSnapshotOpts, type index_SagaController as SagaController, type index_SagaHandler as SagaHandler, type index_SagaInvocation as SagaInvocation, type index_SagaOptions as SagaOptions, index_cqrs as cqrs, index_cqrsEventKeyOf as cqrsEventKeyOf, index_dispatchKeyOf as dispatchKeyOf, index_sagaInvocationKeyOf as sagaInvocationKeyOf };
+}
+
+export { type AggregateEvictionRecord as A, type CqrsEventMap as C, type DispatchOptions as D, type ProjectionController as P, type SagaController as S, type CqrsEvent as a, CqrsGraph as b, type CqrsOptions as c, type CommandActions as d, type CommandHandler as e, type CommandRegistration as f, type DispatchRecord as g, type ProjectionOptions as h, index as i, type ProjectionReducer as j, type ProjectionSnapshotOpts as k, type SagaHandler as l, type SagaInvocation as m, type SagaOptions as n, cqrs as o, cqrsEventKeyOf as p, dispatchKeyOf as q, sagaInvocationKeyOf as s };

package/dist/{index-Ccv_61jG.d.cts → index-33mF4XyU.d.cts}

@@ -1,22 +1,11 @@
-import { a as Node } from './node-8qx0kgYt.cjs';
-import { G as Graph, a as GraphOptions } from './graph-DaoydJ_u.cjs';
-
-/**
- * Messaging patterns (roadmap §4.2).
- *
- * Pulsar-inspired messaging primitives modeled as graph factories:
- * - `topic()` for append-only topic streams with a retained window.
- * - `subscription()` for cursor-based consumers.
- * - `topicBridge()` for autonomous topic-to-topic relay.
- * - `messagingHub()` for a lazy topic registry.
- *
- * Job queue / job flow primitives live in `patterns/job-queue` — they are a
- * distinct domain that happens to share reactive-log / reactive-map
- * infrastructure with topics.
- */
+import { a as Node } from './node-fSc-hCv8.cjs';
+import { G as Graph, a as GraphOptions } from './graph-kTltt95s.cjs';
+import { R as ReactiveLogBundle } from './reactive-log-ScpWyqny.cjs';
+import { AppendLogStorageTier } from './extra/storage-tiers.cjs';
 
 type TopicOptions = {
     graph?: GraphOptions;
+    /** Bounded retention; default 1024 per cross-cutting policy (Audit 2/4). */
     retainedLimit?: number;
 };
 declare class TopicGraph<T> extends Graph {
@@ -42,14 +31,48 @@ declare class TopicGraph<T> extends Graph {
     readonly hasLatest: Node<boolean>;
     constructor(name: string, opts?: TopicOptions);
     publish(value: T): void;
+    /**
+     * Wire one or more append-log storage tiers (Audit 4). Each tier receives
+     * appended events per wave; rollback honors the wave-as-transaction model.
+     *
+     * Named `attachEventStorage` (not `attachStorage`) to avoid colliding with
+     * the inherited {@link Graph.attachSnapshotStorage} which takes the
+     * snapshot-based `StorageTier[]` shape.
+     *
+     * @returns Disposer.
+     */
+    attachEventStorage(tiers: readonly AppendLogStorageTier<T>[]): () => void;
     retained(): readonly T[];
+    /** Internal log bundle — used by TopicBridgeGraph for `attach`. */
+    get _logBundle(): ReactiveLogBundle<T>;
 }
 type SubscriptionOptions = {
     graph?: GraphOptions;
+    /**
+     * Starting cursor position.
+     * @deprecated Use `from` instead.
+     */
     cursor?: number;
+    /**
+     * Starting position for the subscription.
+     * - `"retained"` (default) — cursor starts at 0; consumer sees all retained history.
+     * - `"now"` — cursor starts at current topic length; consumer ignores history.
+     * - `number` — explicit cursor position.
+     */
+    from?: "now" | "retained" | number;
+    /**
+     * When this signal node emits DATA, the subscription auto-advances cursor
+     * to current `available.length`. Useful for "ack everything when X happens"
+     * patterns. The reactive edge `advanceOn → cursor` is visible in `explain()`.
+     */
+    advanceOn?: Node<unknown>;
+};
+/** Result of {@link SubscriptionGraph.pullAndAck}. */
+type PullAndAckResult<T> = {
+    items: readonly T[];
+    cursor: number;
 };
 declare class SubscriptionGraph<T> extends Graph {
-    readonly source: Node<readonly T[]>;
     readonly cursor: Node<number>;
     readonly available: Node<readonly T[]>;
     /**
@@ -61,24 +84,74 @@ declare class SubscriptionGraph<T> extends Graph {
      * still wires the data dependency across graph boundaries. D1(e).
      */
     readonly topic: TopicGraph<T>;
+    private _disposed;
     constructor(name: string, topicGraph: TopicGraph<T>, opts?: SubscriptionOptions);
     ack(count?: number): number;
-    pull(limit?: number, opts?: {
-        ack?: boolean;
-    }): readonly T[];
+    pull(limit?: number): readonly T[];
+    /**
+     * Atomic pull-and-acknowledge. Returns `{ items, cursor }` where `cursor`
+     * is the new cursor position after advancing. Under single-threaded JS the
+     * snapshot and advance are atomic; PY callers use a per-subscription Lock.
+     *
+     * Replaces `pull(limit, { ack: true })`.
+     */
+    pullAndAck(limit?: number): PullAndAckResult<T>;
+    /**
+     * Release internal subscriptions and mark the subscription torn-down.
+     * Subsequent `pull`, `pullAndAck`, `ack` return empty / current cursor.
+     * Emits COMPLETE on `cursor` so derived consumers (e.g. `available`) see
+     * the termination signal. Also drains `addDisposer` callbacks (including
+     * the `keepalive(advancePump)` subscription) so no keepalive leak occurs.
+     */
+    dispose(): void;
 }
 type TopicBridgeOptions<TIn, TOut> = {
     graph?: GraphOptions;
     cursor?: number;
     maxPerPump?: number;
+    /**
+     * Optional transform/filter applied to each item before republishing.
+     *
+     * **At-most-once with silent drop:** when `map` returns `undefined`, the
+     * input is consumed from the source cursor but NOT republished. Filtered
+     * items are not retained for retry. If you need filter-with-retry
+     * semantics, do the filtering in a downstream subscription on the bridged
+     * output rather than in the `map` function.
+     */
     map?: (value: TIn) => TOut | undefined;
 };
 declare class TopicBridgeGraph<TIn, TOut = TIn> extends Graph {
     private readonly _sourceSub;
-    private readonly _target;
     readonly bridgedCount: Node<number>;
+    /**
+     * Emits each mapped batch as DATA — gives downstream observers a reactive
+     * stream of bridged values. Also the link target for `target._log.attach`.
+     */
+    readonly output: Node<readonly TOut[]>;
     constructor(name: string, sourceTopic: TopicGraph<TIn>, targetTopic: TopicGraph<TOut>, opts?: TopicBridgeOptions<TIn, TOut>);
 }
+/**
+ * Private pure data structure managing a named set of {@link TopicGraph}
+ * instances. Extracted from {@link MessagingHubGraph} for separation of
+ * concerns (B.2 Unit 14 lock: D — split into TopicRegistry + facade).
+ *
+ * Reusable if other domain consumers (e.g. cqrs.eventLogs) want a shared
+ * topic registry later.
+ *
+ * @internal
+ */
+declare class TopicRegistry {
+    private readonly _map;
+    /** Reactive monotonic version counter. Advances on topic create/remove. */
+    readonly version: Node<number>;
+    constructor(versionNode: Node<number>);
+    get size(): number;
+    has(name: string): boolean;
+    get<T>(name: string): TopicGraph<T> | undefined;
+    set<T>(name: string, t: TopicGraph<T>): void;
+    delete(name: string): boolean;
+    keys(): IterableIterator<string>;
+}
 type MessagingHubOptions = {
     graph?: GraphOptions;
     /**
@@ -93,6 +166,9 @@ type MessagingHubOptions = {
  * instances with retention + cursor semantics. Topics are created on first
  * access; `removeTopic(name)` unmounts and tears down via {@link Graph.remove}.
  *
+ * Internally delegates to {@link TopicRegistry} for topic map management
+ * (B.2 Unit 14 lock: D facade split).
+ *
  * **Relationship to `pubsub()` in `src/extra/pubsub.ts`:** `pubsub` is a
  * lightweight last-value state hub (no retention, no cursors). `MessagingHubGraph`
  * is the full messaging hub — retained message logs, cursor-based subscriptions,
@@ -101,12 +177,11 @@ type MessagingHubOptions = {
  * @category patterns
  */
 declare class MessagingHubGraph extends Graph {
-    private readonly _topics;
-    private _version;
+    private readonly _registry;
+    /** Reactive monotonic version counter — advances on topic create/remove. */
+    readonly version: Node<number>;
     private readonly _defaultTopicOptions;
     constructor(name: string, opts?: MessagingHubOptions);
-    /** Monotonic counter advancing on topic create/remove. */
-    get version(): number;
     /** Number of topics currently in the hub. */
     get size(): number;
     /** Checks topic existence without creating. */
@@ -181,12 +256,18 @@ declare function messagingHub(name: string, opts?: MessagingHubOptions): Messagi
 declare function subscription<T>(name: string, topicGraph: TopicGraph<T>, opts?: SubscriptionOptions): SubscriptionGraph<T>;
 /**
  * Creates an autonomous cursor-based topic relay graph.
+ *
+ * When `opts.map` is provided, items where `map` returns `undefined` are
+ * consumed from the source cursor but NOT republished (at-most-once with
+ * silent drop). For filter-with-retry semantics, apply the filter in a
+ * downstream subscription on the bridge's `output` node instead.
  */
 declare function topicBridge<TIn, TOut = TIn>(name: string, sourceTopic: TopicGraph<TIn>, targetTopic: TopicGraph<TOut>, opts?: TopicBridgeOptions<TIn, TOut>): TopicBridgeGraph<TIn, TOut>;
 
 type index_MessagingHubGraph = MessagingHubGraph;
 declare const index_MessagingHubGraph: typeof MessagingHubGraph;
 type index_MessagingHubOptions = MessagingHubOptions;
+type index_PullAndAckResult<T> = PullAndAckResult<T>;
 type index_SubscriptionGraph<T> = SubscriptionGraph<T>;
 declare const index_SubscriptionGraph: typeof SubscriptionGraph;
 type index_SubscriptionOptions = SubscriptionOptions;
@@ -196,12 +277,14 @@ type index_TopicBridgeOptions<TIn, TOut> = TopicBridgeOptions<TIn, TOut>;
 type index_TopicGraph<T> = TopicGraph<T>;
 declare const index_TopicGraph: typeof TopicGraph;
 type index_TopicOptions = TopicOptions;
+type index_TopicRegistry = TopicRegistry;
+declare const index_TopicRegistry: typeof TopicRegistry;
 declare const index_messagingHub: typeof messagingHub;
 declare const index_subscription: typeof subscription;
 declare const index_topic: typeof topic;
 declare const index_topicBridge: typeof topicBridge;
 declare namespace index {
-  export { index_MessagingHubGraph as MessagingHubGraph, type index_MessagingHubOptions as MessagingHubOptions, index_SubscriptionGraph as SubscriptionGraph, type index_SubscriptionOptions as SubscriptionOptions, index_TopicBridgeGraph as TopicBridgeGraph, type index_TopicBridgeOptions as TopicBridgeOptions, index_TopicGraph as TopicGraph, type index_TopicOptions as TopicOptions, index_messagingHub as messagingHub, index_subscription as subscription, index_topic as topic, index_topicBridge as topicBridge };
+  export { index_MessagingHubGraph as MessagingHubGraph, type index_MessagingHubOptions as MessagingHubOptions, type index_PullAndAckResult as PullAndAckResult, index_SubscriptionGraph as SubscriptionGraph, type index_SubscriptionOptions as SubscriptionOptions, index_TopicBridgeGraph as TopicBridgeGraph, type index_TopicBridgeOptions as TopicBridgeOptions, index_TopicGraph as TopicGraph, type index_TopicOptions as TopicOptions, index_TopicRegistry as TopicRegistry, index_messagingHub as messagingHub, index_subscription as subscription, index_topic as topic, index_topicBridge as topicBridge };
 }
 
-export { MessagingHubGraph as M, SubscriptionGraph as S, TopicGraph as T, type MessagingHubOptions as a, type SubscriptionOptions as b, TopicBridgeGraph as c, type TopicBridgeOptions as d, type TopicOptions as e, topicBridge as f, index as i, messagingHub as m, subscription as s, topic as t };
+export { MessagingHubGraph as M, type PullAndAckResult as P, SubscriptionGraph as S, TopicGraph as T, type MessagingHubOptions as a, type SubscriptionOptions as b, TopicBridgeGraph as c, type TopicBridgeOptions as d, type TopicOptions as e, TopicRegistry as f, topicBridge as g, index as i, messagingHub as m, subscription as s, topic as t };