@graphrefly/graphrefly 0.44.0 → 0.45.0

package/dist/index-C5ri2Axc.d.cts

@@ -1,301 +0,0 @@
-import { N as Node } from './node-kK3CvTrR.cjs';
-import { G as Graph, a as GraphOptions } from './graph-CWvEUQAq.cjs';
-import { a as ReactiveLogBundle } from './reactive-log-DIGdYqQ6.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 {
-    private readonly _log;
-    private readonly _publishImpl;
-    readonly events: Node<readonly T[]>;
-    /**
-     * Most recently published value, or `null` when the topic has no entries
-     * yet. Spec §5.12 reserves `undefined` as the protocol-internal "never
-     * sent DATA" sentinel — `null` is the idiomatic "empty / no value" signal
-     * for domain nodes. F7.
-     *
-     * **Caveat when `T` itself includes `null`** (e.g., `topic<number | null>`):
-     * `latest === null` is ambiguous — it could mean "no publish yet" OR "a
-     * `null` value was published". Use {@link hasLatest} to disambiguate, or
-     * observe {@link events} directly and track length yourself.
-     */
-    readonly latest: Node<T | null>;
-    /**
-     * Reactive `true` once the topic has at least one published entry.
-     * Disambiguates "`null` never published" from "`null` was published" when
-     * `T` includes `null`.
-     */
-    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 cursor: Node<number>;
-    readonly available: Node<readonly T[]>;
-    /**
-     * Reference to the upstream topic graph. Intentionally NOT mounted
-     * under this subscription: a subscription is a VIEW over an
-     * externally-owned topic. Double-mounting (e.g. hub-owned topic +
-     * sub-mount here) would make either-side teardown leave the other
-     * holding a dead reference. Node-level `derived([topicEvents], …)`
-     * still wires the data dependency across graph boundaries. D1(e).
-     */
-    readonly topic: TopicGraph<T>;
-    private _disposed;
-    private readonly _ackImpl;
-    private readonly _pullAndAckImpl;
-    constructor(name: string, topicGraph: TopicGraph<T>, opts?: SubscriptionOptions);
-    ack(count?: number): number;
-    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;
-    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;
-    /**
-     * Default `TopicOptions` applied to every topic created via `topic(name)`
-     * without explicit options. Per-call opts override. Default: `{}`
-     * (unbounded retention per topic unless `retainedLimit` is set per call).
-     */
-    defaultTopicOptions?: TopicOptions;
-};
-/**
- * Lazy Pulsar-inspired topic registry. Manages a named set of {@link TopicGraph}
- * 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,
- * and pattern-layer lifecycle management.
- *
- * @category patterns
- */
-declare class MessagingHubGraph extends Graph {
-    private readonly _registry;
-    /** Reactive monotonic version counter — advances on topic create/remove. */
-    readonly version: Node<number>;
-    private readonly _defaultTopicOptions;
-    private readonly _removeTopicImpl;
-    constructor(name: string, opts?: MessagingHubOptions);
-    /** Number of topics currently in the hub. */
-    get size(): number;
-    /** Checks topic existence without creating. */
-    has(name: string): boolean;
-    /** Iterator over topic names. */
-    topicNames(): IterableIterator<string>;
-    /**
-     * Returns the {@link TopicGraph} for `name`, creating lazily on first call.
-     * Subsequent calls with the same name return the same instance (options on
-     * repeat calls are ignored — the topic is already configured).
-     */
-    topic<T = unknown>(name: string, opts?: TopicOptions): TopicGraph<T>;
-    /**
-     * Publishes a value to the topic, lazily creating it on first publish.
-     *
-     * **Late-subscriber caveat:** the topic is created lazily, so subscribers
-     * that attach AFTER a publish only see the retained window (governed by
-     * `retainedLimit` on `TopicOptions` / `defaultTopicOptions`). If
-     * `retainedLimit === 0` is set explicitly, early publishes are
-     * effectively dropped — prefer an unset `retainedLimit` (unbounded
-     * retention) or subscribe before publishing when late-subscribers matter.
-     */
-    publish<T = unknown>(name: string, value: T): void;
-    /**
-     * Bulk publish — issues all publishes inside one outer batch. New topics
-     * are created on demand. No-op if `entries` yields nothing.
-     *
-     * **Iterable consumption (F6):** `entries` is consumed once (single-pass)
-     * INSIDE the batch frame. If the iterator throws mid-way, the batch is
-     * discarded and NO publishes are visible to subscribers (all-or-nothing).
-     * Pass an array or `Set` for multi-shot callers.
-     */
-    publishMany(entries: Iterable<[string, unknown]>): void;
-    /**
-     * Creates a {@link SubscriptionGraph} over a named topic. The topic is
-     * lazily created if missing. Subscription lifecycle is owned by the caller —
-     * the hub does NOT mount the subscription.
-     *
-     * @param subName - Local name for the subscription graph.
-     * @param topicName - Hub topic to subscribe to.
-     * @param opts - `SubscriptionOptions` (initial cursor, etc.).
-     */
-    subscribe<T = unknown>(subName: string, topicName: string, opts?: SubscriptionOptions): SubscriptionGraph<T>;
-    /**
-     * Unmounts and tears down the topic's graph. Returns `true` if the topic
-     * existed. Subscribers receive `TEARDOWN` via {@link Graph.remove}.
-     *
-     * **Closure-state caveat:** the registry mutation (`_registry.delete`) and
-     * version bump happen in a `try/finally`, so registry/version converge to
-     * a consistent state even when {@link Graph.remove} throws. `lightMutation`
-     * does not roll back this mutation on throw — `Map.delete` on closure
-     * state is invisible to any batch frame. The pre-existing try/finally is
-     * load-bearing for that invariant.
-     */
-    removeTopic(name: string): boolean;
-}
-/**
- * Creates a Pulsar-inspired topic graph (append-only retained stream + latest value).
- */
-declare function topic<T>(name: string, opts?: TopicOptions): TopicGraph<T>;
-/**
- * Creates a lazy Pulsar-inspired messaging hub. Topics are created on first access
- * via `hub.topic(name)`; `hub.publish(name, value)` shortcuts through the registry.
- *
- * @example
- * ```ts
- * import { messagingHub } from "@graphrefly/graphrefly/patterns/messaging";
- *
- * const hub = messagingHub("main", { defaultTopicOptions: { retainedLimit: 256 } });
- * hub.publish("orders", { id: 1 });
- * hub.publishMany([["shipments", { id: 1 }], ["orders", { id: 2 }]]);
- * const sub = hub.subscribe("orders-worker", "orders", { cursor: 0 });
- * ```
- */
-declare function messagingHub(name: string, opts?: MessagingHubOptions): MessagingHubGraph;
-/**
- * Creates a cursor-based subscription graph over a topic.
- */
-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;
-type index_TopicBridgeGraph<TIn, TOut = TIn> = TopicBridgeGraph<TIn, TOut>;
-declare const index_TopicBridgeGraph: typeof TopicBridgeGraph;
-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, 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, 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 };

package/dist/index-C5stwKcw.d.cts

@@ -1,44 +0,0 @@
-import { N as Node } from './node-kK3CvTrR.cjs';
-
-/**
- * Subscribe to a read-only `Node<T>` as a React value. Re-renders on node value settlement.
- * Subscription lifecycle is tied to React mount/unmount (not node terminal messages).
- *
- * @param node - Any `Node<T>`.
- * @returns `T | undefined` — the current node value, kept in sync via `useSyncExternalStore`.
- */
-declare function useSubscribe<T>(node: Node<T>): T | undefined | null;
-/**
- * Bind a writable `Node<T>` as a React `[value, setter]` tuple.
- * Setting the value always pushes `[[DIRTY], [DATA, value]]`, including `value === undefined`.
- * Subscription lifecycle is tied to React mount/unmount (not node terminal messages).
- *
- * @param node - A `Node<T>` (e.g. state node).
- * @returns `[T | undefined, (value: T) => void]` — current value and setter function.
- */
-declare function useStore<T>(node: Node<T>): [T | undefined | null, (value: T) => void];
-/** Maps a key to an object of nodes. Used by `useSubscribeRecord`. */
-type NodeFactory<K, R extends Record<string, any>> = (key: K) => {
-    [P in keyof R]: Node<R[P]>;
-};
-/**
- * Subscribe to a dynamic set of keyed node records.
- * Re-subscribes all per-key fields whenever `keysNode` changes.
- * Key re-sync is gated to settled batches (`messageTier >= 3`) to avoid DIRTY-phase churn.
- * Guaranteed to clean up strictly with React hook lifecycle, utilizing no global mappings.
- *
- * @param keysNode - Node of current keys (e.g. node IDs)
- * @param factory - Function returning `{ [field]: Node<V> }` for each key.
- * @returns `Record<K, R>` — snapshot of resolved values for all keys.
- */
-declare function useSubscribeRecord<K extends string, R extends Record<string, any>>(keysNode: Node<K[]>, factory: NodeFactory<K, R>): Record<K, R>;
-
-type index_NodeFactory<K, R extends Record<string, any>> = NodeFactory<K, R>;
-declare const index_useStore: typeof useStore;
-declare const index_useSubscribe: typeof useSubscribe;
-declare const index_useSubscribeRecord: typeof useSubscribeRecord;
-declare namespace index {
-  export { type index_NodeFactory as NodeFactory, index_useStore as useStore, index_useSubscribe as useSubscribe, index_useSubscribeRecord as useSubscribeRecord };
-}
-
-export { type NodeFactory as N, useSubscribe as a, useSubscribeRecord as b, index as i, useStore as u };

package/dist/index-C9l6OEBL.d.ts

@@ -1,26 +0,0 @@
-import { C as CatchOptions, a as ClassifyResult, D as Decision, b as DecisionAction, G as GateController, c as GateOptions, P as PipelineGraph, S as StepRef, T as TerminalCause, d as decisionKeyOf, p as pipelineGraph } from './pipeline-graph-Sgj0gCwn.js';
-
-/**
- * Orchestration patterns (roadmap §4.1).
- *
- * Domain-layer helpers that build workflow shapes on top of core + extra primitives.
- * Exported under the `patterns.orchestration` namespace to avoid collisions with
- * Phase 2 operator names (for example `gate`, `forEach`).
- */
-
-declare const index_CatchOptions: typeof CatchOptions;
-declare const index_ClassifyResult: typeof ClassifyResult;
-declare const index_Decision: typeof Decision;
-declare const index_DecisionAction: typeof DecisionAction;
-declare const index_GateController: typeof GateController;
-declare const index_GateOptions: typeof GateOptions;
-declare const index_PipelineGraph: typeof PipelineGraph;
-declare const index_StepRef: typeof StepRef;
-declare const index_TerminalCause: typeof TerminalCause;
-declare const index_decisionKeyOf: typeof decisionKeyOf;
-declare const index_pipelineGraph: typeof pipelineGraph;
-declare namespace index {
-  export { index_CatchOptions as CatchOptions, index_ClassifyResult as ClassifyResult, index_Decision as Decision, index_DecisionAction as DecisionAction, index_GateController as GateController, index_GateOptions as GateOptions, index_PipelineGraph as PipelineGraph, index_StepRef as StepRef, index_TerminalCause as TerminalCause, index_decisionKeyOf as decisionKeyOf, index_pipelineGraph as pipelineGraph };
-}
-
-export { index as i };

package/dist/index-CBBLl_rc.d.ts

@@ -1,127 +0,0 @@
-import { N as Node } from './node-kK3CvTrR.js';
-
-/**
- * A Nanostores-compatible atom.
- *
- * @category compat
- */
-interface NanoAtom<T> {
-    /** Get current value. */
-    get(): T;
-    /** Set a new value (writable atoms only). */
-    set(value: T): void;
-    /** Subscribe to value changes. Callback receives the new value.
-     * Returns unsubscribe function. Called immediately with current value. */
-    subscribe(cb: (value: T) => void): () => void;
-    /** Listen to value changes (no immediate call). Returns unsubscribe. */
-    listen(cb: (value: T) => void): () => void;
-    /** The underlying GraphReFly node. */
-    readonly _node: Node<T>;
-}
-/**
- * A Nanostores-compatible computed store.
- *
- * @category compat
- */
-interface NanoComputed<T> {
-    /** Get current value. */
-    get(): T;
-    /** Subscribe to value changes. Called immediately with current value.
-     * Returns unsubscribe function. */
-    subscribe(cb: (value: T) => void): () => void;
-    /** Listen to value changes (no immediate call). Returns unsubscribe. */
-    listen(cb: (value: T) => void): () => void;
-    /** The underlying GraphReFly node. */
-    readonly _node: Node<T>;
-}
-/**
- * A Nanostores-compatible map.
- *
- * @category compat
- */
-interface NanoMap<T extends Record<string, unknown>> extends NanoAtom<T> {
-    /** Set a single key. */
-    setKey<K extends keyof T>(key: K, value: T[K]): void;
-}
-/**
- * Creates a nanostores-compatible atom.
- *
- * @param initial - Initial value.
- * @returns `NanoAtom<T>`
- *
- * @category compat
- */
-declare function atom<T>(initial: T): NanoAtom<T>;
-/**
- * Creates a nanostores-compatible computed store.
- *
- * @param stores - One or more atoms/computed stores.
- * @param fn - Compute function.
- * @returns `NanoComputed<T>`
- *
- * @category compat
- */
-declare function computed<T, A>(storeA: NanoAtom<A> | NanoComputed<A>, fn: (a: A) => T): NanoComputed<T>;
-declare function computed<T, A, B>(stores: [NanoAtom<A> | NanoComputed<A>, NanoAtom<B> | NanoComputed<B>], fn: (a: A, b: B) => T): NanoComputed<T>;
-declare function computed<T, A, B, C>(stores: [
-    NanoAtom<A> | NanoComputed<A>,
-    NanoAtom<B> | NanoComputed<B>,
-    NanoAtom<C> | NanoComputed<C>
-], fn: (a: A, b: B, c: C) => T): NanoComputed<T>;
-/**
- * Creates a nanostores-compatible map.
- *
- * @param initial - Initial object value.
- * @returns `NanoMap<T>`
- *
- * @category compat
- */
-declare function map<T extends Record<string, unknown>>(initial: T): NanoMap<T>;
-/**
- * Returns the current value of the store.
- *
- * @category compat
- */
-declare function getValue<T>(store: NanoAtom<T> | NanoComputed<T>): T;
-/**
- * Adds a listener for the store start (first listener connected).
- *
- * @category compat
- */
-declare function onStart(store: NanoAtom<any> | NanoComputed<any>, cb: () => void): void;
-/**
- * Adds a listener for the store stop (last listener disconnected).
- *
- * @category compat
- */
-declare function onStop(store: NanoAtom<any> | NanoComputed<any>, cb: () => void): void;
-/**
- * Adds a listener for the store mount (first listener connected).
- *
- * @returns A cleanup function called when the last listener is removed.
- * @category compat
- */
-declare function onMount(store: NanoAtom<any> | NanoComputed<any>, cb: () => (() => void) | undefined): void;
-/**
- * Batches multiple store updates.
- *
- * @category compat
- */
-declare function action<Args extends any[], Return>(_store: NanoAtom<any> | NanoComputed<any>, _name: string, fn: (...args: Args) => Return): (...args: Args) => Return;
-
-type index_NanoAtom<T> = NanoAtom<T>;
-type index_NanoComputed<T> = NanoComputed<T>;
-type index_NanoMap<T extends Record<string, unknown>> = NanoMap<T>;
-declare const index_action: typeof action;
-declare const index_atom: typeof atom;
-declare const index_computed: typeof computed;
-declare const index_getValue: typeof getValue;
-declare const index_map: typeof map;
-declare const index_onMount: typeof onMount;
-declare const index_onStart: typeof onStart;
-declare const index_onStop: typeof onStop;
-declare namespace index {
-  export { type index_NanoAtom as NanoAtom, type index_NanoComputed as NanoComputed, type index_NanoMap as NanoMap, index_action as action, index_atom as atom, index_computed as computed, index_getValue as getValue, index_map as map, index_onMount as onMount, index_onStart as onStart, index_onStop as onStop };
-}
-
-export { type NanoAtom as N, type NanoComputed as a, type NanoMap as b, action as c, atom as d, computed as e, onStart as f, getValue as g, onStop as h, index as i, map as m, onMount as o };