@graphrefly/graphrefly 0.15.0 → 0.17.0

package/dist/chunk-ZHTHUX5D.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/graph/index.ts","../src/graph/codec.ts"],"sourcesContent":["/**\n * Graph container: registry, wiring, introspection (Phase 1).\n */\n\nexport {\n\tcreateDagCborCodec,\n\tcreateDagCborZstdCodec,\n\ttype DeltaCheckpoint,\n\ttype EvictedSubgraphInfo,\n\ttype EvictionPolicy,\n\ttype GraphCodec,\n\tJsonCodec,\n\ttype LazyGraphCodec,\n\tnegotiateCodec,\n\treplayWAL,\n\ttype WALEntry,\n} from \"./codec.js\";\nexport {\n\ttype AutoCheckpointAdapter,\n\ttype DescribeFilter,\n\tGRAPH_META_SEGMENT,\n\tGraph,\n\ttype GraphActorOptions,\n\ttype GraphAutoCheckpointHandle,\n\ttype GraphAutoCheckpointOptions,\n\ttype GraphCheckpointRecord,\n\ttype GraphDescribeOptions,\n\ttype GraphDescribeOutput,\n\ttype GraphDiagramDirection,\n\ttype GraphDiagramOptions,\n\ttype GraphDiffChange,\n\ttype GraphDiffResult,\n\ttype GraphDumpOptions,\n\ttype GraphFactoryContext,\n\ttype GraphNodeFactory,\n\ttype GraphObserveAll,\n\ttype GraphObserveOne,\n\ttype GraphOptions,\n\ttype GraphPersistSnapshot,\n\ttype GraphSpyHandle,\n\ttype GraphSpyOptions,\n\ttype GraphSpyTheme,\n\ttype GraphSpyThemeName,\n\ttype ObserveDetail,\n\ttype ObserveEvent,\n\ttype ObserveOptions,\n\ttype ObserveResult,\n\ttype ReachableDirection,\n\ttype ReachableOptions,\n\treachable,\n\ttype TraceEntry,\n} from \"./graph.js\";\n","/**\n * GraphCodec — pluggable serialization for graph snapshots (Phase 8.6).\n *\n * Design reference: `archive/docs/SESSION-serialization-memory-footprint.md`\n *\n * The codec interface decouples snapshot format from graph internals.\n * Default is JSON (current behavior). DAG-CBOR and compressed variants\n * ship as optional codecs. FlatBuffers/Arrow for advanced tiers.\n *\n * Tiered representation:\n *   HOT  — JS objects (live propagation, no codec involved)\n *   WARM — DAG-CBOR in-memory buffer (lazy hydration, delta checkpoints)\n *   COLD — Arrow/Parquet (bulk storage, ML pipelines, archival)\n *   PEEK — FlatBuffers (zero-copy read from dormant graph)\n */\n\nimport type { GraphPersistSnapshot } from \"./graph.js\";\n\n// ---------------------------------------------------------------------------\n// Core codec interface\n// ---------------------------------------------------------------------------\n\n/**\n * Encode/decode graph snapshots to/from binary.\n *\n * Implementations must be deterministic: `encode(x)` always produces the\n * same bytes for the same input. This is critical for CID computation (V1)\n * and snapshot hash-comparison.\n */\nexport interface GraphCodec {\n\t/** MIME-like content type identifier (e.g. \"application/dag-cbor+zstd\"). */\n\treadonly contentType: string;\n\n\t/** Human-readable name for diagnostics. */\n\treadonly name: string;\n\n\t/** Encode a snapshot to binary. */\n\tencode(snapshot: GraphPersistSnapshot): Uint8Array;\n\n\t/**\n\t * Decode binary back to a snapshot.\n\t *\n\t * For lazy codecs, this may return a proxy that decodes nodes on access\n\t * (see {@link LazyGraphCodec}).\n\t */\n\tdecode(buffer: Uint8Array): GraphPersistSnapshot;\n}\n\n/**\n * Extended codec that supports lazy (on-demand) node decoding.\n *\n * `decodeLazy` returns a snapshot where `nodes` is a Proxy — individual\n * nodes are decoded only when accessed. This enables near-zero cold-start\n * for large graphs (decode envelope + topology, skip node values until read).\n */\nexport interface LazyGraphCodec extends GraphCodec {\n\t/** Decode envelope and topology; defer node value decoding to access time. */\n\tdecodeLazy(buffer: Uint8Array): GraphPersistSnapshot;\n}\n\n// ---------------------------------------------------------------------------\n// Delta checkpoint types (requires V0 — Phase 6.0)\n// ---------------------------------------------------------------------------\n\n/**\n * A delta checkpoint: only the nodes that changed since last checkpoint.\n *\n * Append-only: each delta is identified by `seq` (monotonic). A full\n * snapshot is taken every `compactEvery` deltas for WAL compaction.\n */\nexport interface DeltaCheckpoint {\n\t/** Monotonic sequence number. */\n\tseq: number;\n\t/** Graph name. */\n\tname: string;\n\t/** Base snapshot seq this delta applies to (0 = initial full snapshot). */\n\tbaseSec: number;\n\t/** Only nodes with version > lastCheckpoint. Keyed by node name. */\n\tnodes: Record<\n\t\tstring,\n\t\t{\n\t\t\t/** V0 version at time of checkpoint. */\n\t\t\tversion: number;\n\t\t\t/** Serialized node value (codec-dependent). */\n\t\t\tvalue: unknown;\n\t\t\t/** Meta snapshot (only if materialized). */\n\t\t\tmeta?: Record<string, unknown>;\n\t\t}\n\t>;\n\t/** Nodes removed since last checkpoint. */\n\tremoved: string[];\n\t/** Edges added since last checkpoint. */\n\tedgesAdded: ReadonlyArray<{ from: string; to: string }>;\n\t/** Edges removed since last checkpoint. */\n\tedgesRemoved: ReadonlyArray<{ from: string; to: string }>;\n\t/** Timestamp (wall-clock ns) of this checkpoint. */\n\ttimestampNs: bigint;\n}\n\n/**\n * WAL entry: either a full snapshot or a delta.\n */\nexport type WALEntry =\n\t| { type: \"full\"; snapshot: GraphPersistSnapshot; seq: number }\n\t| { type: \"delta\"; delta: DeltaCheckpoint };\n\n// ---------------------------------------------------------------------------\n// Eviction policy (dormant subgraph management)\n// ---------------------------------------------------------------------------\n\n/**\n * Policy for evicting dormant subgraphs to reduce memory.\n *\n * When a subgraph hasn't propagated for `idleTimeoutMs`, it is serialized\n * using the graph's codec and JS objects are released. Re-hydrated on next\n * access (read, propagation, describe).\n */\nexport interface EvictionPolicy {\n\t/** Milliseconds of inactivity before eviction. */\n\tidleTimeoutMs: number;\n\t/** Codec to use for serializing evicted subgraphs (default: graph's codec). */\n\tcodec?: GraphCodec;\n}\n\n/** Metadata about an evicted subgraph, exposed via describe(). */\nexport interface EvictedSubgraphInfo {\n\t/** True if currently evicted (serialized, JS objects released). */\n\tevicted: true;\n\t/** Wall-clock ns of last propagation before eviction. */\n\tlastActiveNs: bigint;\n\t/** Size of serialized buffer in bytes. */\n\tserializedBytes: number;\n\t/** Codec used for serialization. */\n\tcodecName: string;\n}\n\n// ---------------------------------------------------------------------------\n// JSON codec (default — wraps current behavior)\n// ---------------------------------------------------------------------------\n\n/**\n * Default JSON codec. Wraps `JSON.stringify`/`JSON.parse` with deterministic\n * key ordering (matching current `snapshot()` behavior).\n */\nexport const JsonCodec: GraphCodec = {\n\tcontentType: \"application/json\",\n\tname: \"json\",\n\n\tencode(snapshot: GraphPersistSnapshot): Uint8Array {\n\t\t// Deterministic: snapshot() already sorts keys.\n\t\tconst json = JSON.stringify(snapshot);\n\t\treturn new TextEncoder().encode(json);\n\t},\n\n\tdecode(buffer: Uint8Array): GraphPersistSnapshot {\n\t\tconst json = new TextDecoder().decode(buffer);\n\t\treturn JSON.parse(json) as GraphPersistSnapshot;\n\t},\n};\n\n// ---------------------------------------------------------------------------\n// DAG-CBOR codec (stub — requires @ipld/dag-cbor)\n// ---------------------------------------------------------------------------\n\n/**\n * Create a DAG-CBOR codec.\n *\n * Requires `@ipld/dag-cbor` as a peer dependency. ~40-50% smaller than JSON,\n * deterministic encoding (required for V1 CID), CID links as native type.\n *\n * @example\n * ```ts\n * import * as dagCbor from \"@ipld/dag-cbor\";\n * const codec = createDagCborCodec(dagCbor);\n * const bytes = codec.encode(graph.snapshot());\n * ```\n */\nexport function createDagCborCodec(dagCbor: {\n\tencode: (value: unknown) => Uint8Array;\n\tdecode: (bytes: Uint8Array) => unknown;\n}): GraphCodec {\n\treturn {\n\t\tcontentType: \"application/dag-cbor\",\n\t\tname: \"dag-cbor\",\n\t\tencode: (snapshot) => dagCbor.encode(snapshot),\n\t\tdecode: (buffer) => dagCbor.decode(buffer) as GraphPersistSnapshot,\n\t};\n}\n\n/**\n * Create a DAG-CBOR + zstd codec. ~80-90% smaller than JSON.\n *\n * Requires `@ipld/dag-cbor` and a zstd implementation (e.g. `fzstd` for\n * browser, `node:zlib` for Node.js).\n *\n * @example\n * ```ts\n * import * as dagCbor from \"@ipld/dag-cbor\";\n * import { compressSync, decompressSync } from \"fzstd\";\n * const codec = createDagCborZstdCodec(dagCbor, { compressSync, decompressSync });\n * ```\n */\nexport function createDagCborZstdCodec(\n\tdagCbor: {\n\t\tencode: (value: unknown) => Uint8Array;\n\t\tdecode: (bytes: Uint8Array) => unknown;\n\t},\n\tzstd: {\n\t\tcompressSync: (data: Uint8Array) => Uint8Array;\n\t\tdecompressSync: (data: Uint8Array) => Uint8Array;\n\t},\n): GraphCodec {\n\treturn {\n\t\tcontentType: \"application/dag-cbor+zstd\",\n\t\tname: \"dag-cbor-zstd\",\n\t\tencode: (snapshot) => zstd.compressSync(dagCbor.encode(snapshot)),\n\t\tdecode: (buffer) => dagCbor.decode(zstd.decompressSync(buffer)) as GraphPersistSnapshot,\n\t};\n}\n\n// ---------------------------------------------------------------------------\n// Codec negotiation (for peerGraph)\n// ---------------------------------------------------------------------------\n\n/**\n * Negotiate a common codec between two peers.\n *\n * Each peer advertises its supported codecs (ordered by preference).\n * Returns the first codec supported by both, or null if none.\n */\nexport function negotiateCodec(\n\tlocalPreference: readonly GraphCodec[],\n\tremoteContentTypes: readonly string[],\n): GraphCodec | null {\n\tconst remoteSet = new Set(remoteContentTypes);\n\tfor (const codec of localPreference) {\n\t\tif (remoteSet.has(codec.contentType)) return codec;\n\t}\n\treturn null;\n}\n\n// ---------------------------------------------------------------------------\n// WAL helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Reconstruct a snapshot from a WAL (full snapshot + sequence of deltas).\n *\n * Applies deltas in order on top of the base snapshot. Validates that\n * delta `baseSec` chains correctly.\n */\nexport function replayWAL(entries: readonly WALEntry[]): GraphPersistSnapshot {\n\tif (entries.length === 0) {\n\t\tthrow new Error(\"WAL is empty — need at least one full snapshot\");\n\t}\n\n\tconst first = entries[0]!;\n\tif (first.type !== \"full\") {\n\t\tthrow new Error(\"WAL must start with a full snapshot\");\n\t}\n\n\t// Deep clone the base snapshot so we can mutate it.\n\tconst result: GraphPersistSnapshot = JSON.parse(JSON.stringify(first.snapshot));\n\n\tfor (let i = 1; i < entries.length; i++) {\n\t\tconst entry = entries[i]!;\n\t\tif (entry.type === \"full\") {\n\t\t\t// A compaction point — replace the entire result.\n\t\t\tObject.assign(result, JSON.parse(JSON.stringify(entry.snapshot)));\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst delta = entry.delta;\n\n\t\t// Apply node changes.\n\t\tfor (const [name, patch] of Object.entries(delta.nodes)) {\n\t\t\tif (result.nodes[name]) {\n\t\t\t\tresult.nodes[name]!.value = patch.value;\n\t\t\t\tif (patch.meta) {\n\t\t\t\t\tresult.nodes[name]!.meta = patch.meta;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Apply removals.\n\t\tfor (const name of delta.removed) {\n\t\t\tdelete result.nodes[name];\n\t\t}\n\n\t\t// Apply edge changes.\n\t\tconst edges = [...result.edges];\n\t\tfor (const edge of delta.edgesRemoved) {\n\t\t\tconst idx = edges.findIndex((e) => e.from === edge.from && e.to === edge.to);\n\t\t\tif (idx !== -1) edges.splice(idx, 1);\n\t\t}\n\t\tfor (const edge of delta.edgesAdded) {\n\t\t\tedges.push(edge);\n\t\t}\n\t\t(result as unknown as { edges: typeof edges }).edges = edges;\n\t}\n\n\treturn result;\n}\n"],"mappings":";;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACgJO,IAAM,YAAwB;AAAA,EACpC,aAAa;AAAA,EACb,MAAM;AAAA,EAEN,OAAO,UAA4C;AAElD,UAAM,OAAO,KAAK,UAAU,QAAQ;AACpC,WAAO,IAAI,YAAY,EAAE,OAAO,IAAI;AAAA,EACrC;AAAA,EAEA,OAAO,QAA0C;AAChD,UAAM,OAAO,IAAI,YAAY,EAAE,OAAO,MAAM;AAC5C,WAAO,KAAK,MAAM,IAAI;AAAA,EACvB;AACD;AAmBO,SAAS,mBAAmB,SAGpB;AACd,SAAO;AAAA,IACN,aAAa;AAAA,IACb,MAAM;AAAA,IACN,QAAQ,CAAC,aAAa,QAAQ,OAAO,QAAQ;AAAA,IAC7C,QAAQ,CAAC,WAAW,QAAQ,OAAO,MAAM;AAAA,EAC1C;AACD;AAeO,SAAS,uBACf,SAIA,MAIa;AACb,SAAO;AAAA,IACN,aAAa;AAAA,IACb,MAAM;AAAA,IACN,QAAQ,CAAC,aAAa,KAAK,aAAa,QAAQ,OAAO,QAAQ,CAAC;AAAA,IAChE,QAAQ,CAAC,WAAW,QAAQ,OAAO,KAAK,eAAe,MAAM,CAAC;AAAA,EAC/D;AACD;AAYO,SAAS,eACf,iBACA,oBACoB;AACpB,QAAM,YAAY,IAAI,IAAI,kBAAkB;AAC5C,aAAW,SAAS,iBAAiB;AACpC,QAAI,UAAU,IAAI,MAAM,WAAW,EAAG,QAAO;AAAA,EAC9C;AACA,SAAO;AACR;AAYO,SAAS,UAAU,SAAoD;AAC7E,MAAI,QAAQ,WAAW,GAAG;AACzB,UAAM,IAAI,MAAM,qDAAgD;AAAA,EACjE;AAEA,QAAM,QAAQ,QAAQ,CAAC;AACvB,MAAI,MAAM,SAAS,QAAQ;AAC1B,UAAM,IAAI,MAAM,qCAAqC;AAAA,EACtD;AAGA,QAAM,SAA+B,KAAK,MAAM,KAAK,UAAU,MAAM,QAAQ,CAAC;AAE9E,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACxC,UAAM,QAAQ,QAAQ,CAAC;AACvB,QAAI,MAAM,SAAS,QAAQ;AAE1B,aAAO,OAAO,QAAQ,KAAK,MAAM,KAAK,UAAU,MAAM,QAAQ,CAAC,CAAC;AAChE;AAAA,IACD;AAEA,UAAM,QAAQ,MAAM;AAGpB,eAAW,CAAC,MAAM,KAAK,KAAK,OAAO,QAAQ,MAAM,KAAK,GAAG;AACxD,UAAI,OAAO,MAAM,IAAI,GAAG;AACvB,eAAO,MAAM,IAAI,EAAG,QAAQ,MAAM;AAClC,YAAI,MAAM,MAAM;AACf,iBAAO,MAAM,IAAI,EAAG,OAAO,MAAM;AAAA,QAClC;AAAA,MACD;AAAA,IACD;AAGA,eAAW,QAAQ,MAAM,SAAS;AACjC,aAAO,OAAO,MAAM,IAAI;AAAA,IACzB;AAGA,UAAM,QAAQ,CAAC,GAAG,OAAO,KAAK;AAC9B,eAAW,QAAQ,MAAM,cAAc;AACtC,YAAM,MAAM,MAAM,UAAU,CAAC,MAAM,EAAE,SAAS,KAAK,QAAQ,EAAE,OAAO,KAAK,EAAE;AAC3E,UAAI,QAAQ,GAAI,OAAM,OAAO,KAAK,CAAC;AAAA,IACpC;AACA,eAAW,QAAQ,MAAM,YAAY;AACpC,YAAM,KAAK,IAAI;AAAA,IAChB;AACA,IAAC,OAA8C,QAAQ;AAAA,EACxD;AAEA,SAAO;AACR;","names":[]}

package/dist/reactive-log-ChbpUrY2.d.cts

@@ -1,137 +0,0 @@
-import { Observable } from 'rxjs';
-import { m as Messages, N as Node } from './meta-CrZUQAJ6.cjs';
-import { G as Graph, x as ObserveOptions } from './graph-BhADtuFU.cjs';
-
-/**
- * Bridge a `Node<T>` to an RxJS `Observable<T>`.
- *
- * Emits the node's value on each `DATA` message. Maps `ERROR` to
- * `subscriber.error()` and `COMPLETE` to `subscriber.complete()`.
- * Protocol-internal signals (DIRTY, RESOLVED, PAUSE, etc.) are skipped.
- *
- * Unsubscribing the Observable unsubscribes the node.
- */
-declare function toObservable<T>(node: Node<T>): Observable<T>;
-/**
- * Bridge a `Node<T>` to an `Observable<Messages>` — raw message batches.
- *
- * Each emission is a full `[[Type, Data?], ...]` batch. The Observable
- * terminates on ERROR or COMPLETE (the terminal batch is still emitted
- * as the final `next()` before the Observable signal).
- */
-declare function toMessages$<T>(node: Node<T>): Observable<Messages>;
-/**
- * Observe a single node in a `Graph` as an `Observable<T>`.
- *
- * Equivalent to `toObservable(graph.resolve(path))` but routes through
- * `graph.observe()` so actor guards are respected when provided.
- */
-declare function observeNode$<T>(graph: Graph, path: string, options?: ObserveOptions): Observable<T>;
-/**
- * Observe all nodes in a `Graph` as an `Observable<{ path, messages }>`.
- *
- * Each emission carries the qualified node path and the raw message batch.
- * The Observable never self-completes (graphs are long-lived); dispose by
- * unsubscribing.
- */
-declare function observeGraph$(graph: Graph, options?: ObserveOptions): Observable<{
-    path: string;
-    messages: Messages;
-}>;
-
-/**
- * Shared internals for roadmap §3.2 data structures (option B — versioned snapshots).
- *
- * @remarks
- * Not re-exported from the package barrel; consumers use concrete factories
- * (`reactiveMap`, …). Keeps `equals` / snapshot wiring consistent across
- * collections without exposing a second public protocol.
- *
- * @packageDocumentation
- * @internal
- */
-/**
- * Immutable value paired with a monotonic version for {@link NodeOptions.equals}.
- * Downstream nodes can treat unchanged versions as `RESOLVED`-eligible via `equals`.
- *
- * When the backing node has V0 versioning (GRAPHREFLY-SPEC §7), `v0` carries
- * the node's identity (`id`) and version counter for diff-friendly observation
- * and cross-snapshot dedup (roadmap §6.0b).
- */
-type Versioned<T> = {
-    readonly version: number;
-    readonly value: T;
-    /** V0 identity from the backing node, when versioning is enabled. */
-    readonly v0?: {
-        readonly id: string;
-        readonly version: number;
-    };
-};
-
-type ReactiveLogSnapshot<T> = Versioned<{
-    entries: readonly T[];
-}>;
-type ReactiveLogOptions = {
-    name?: string;
-    maxSize?: number;
-};
-type ReactiveLogBundle<T> = {
-    /** Emits {@link ReactiveLogSnapshot} on each append/clear (two-phase). */
-    readonly entries: Node<ReactiveLogSnapshot<T>>;
-    append: (value: T) => void;
-    /** Push all values, trim once, emit one snapshot. */
-    appendMany: (values: readonly T[]) => void;
-    clear: () => void;
-    /** Remove the first `n` entries; emits snapshot. */
-    trimHead: (n: number) => void;
-    /** Last `n` entries (or fewer); updates when the log changes. */
-    tail: (n: number) => Node<readonly T[]>;
-};
-/**
- * Creates an append-only reactive log with versioned tuple snapshots.
- *
- * @param initial - Optional seed entries (copied).
- * @param options - Optional `name` for `describe()` / debugging.
- * @returns Bundle with `entries` (state node), `append`, `clear`, and {@link ReactiveLogBundle.tail}.
- *
- * @remarks
- * **Derived views:** {@link tail} and {@link logSlice} install an internal noop subscription so
- * `get()` stays wired without an external sink; creating very many disposable derived nodes can
- * retain subscriptions until the log bundle is unreachable.
- *
- * @example
- * ```ts
- * import { reactiveLog } from "@graphrefly/graphrefly-ts";
- *
- * const lg = reactiveLog<number>([1, 2], { name: "audit" });
- * lg.append(3);
- * lg.entries.subscribe((msgs) => console.log(msgs));
- * ```
- *
- * @category extra
- */
-declare function reactiveLog<T>(initial?: readonly T[], options?: ReactiveLogOptions): ReactiveLogBundle<T>;
-/**
- * Builds a derived node for `entries.slice(start, stop)` (same semantics as `Array.prototype.slice`; `stop` exclusive).
- *
- * @param log - Log from {@link reactiveLog}.
- * @param start - Start index (must be `>= 0`).
- * @param stop - End index (exclusive); omit to slice to the end.
- * @returns Derived node emitting the sliced readonly array.
- *
- * @example
- * ```ts
- * import { reactiveLog, logSlice } from "@graphrefly/graphrefly-ts";
- *
- * const lg = reactiveLog<number>([10, 20, 30, 40, 50]);
- * const slice$ = logSlice(lg, 1, 4); // reactive view of [20, 30, 40]
- * slice$.subscribe((msgs) => console.log(msgs));
- *
- * lg.append(60); // slice$ now reflects [20, 30, 40] (indices 1–3 of updated log)
- * ```
- *
- * @category extra
- */
-declare function logSlice<T>(log: ReactiveLogBundle<T>, start: number, stop?: number): Node<readonly T[]>;
-
-export { type ReactiveLogSnapshot as R, type Versioned as V, type ReactiveLogBundle as a, type ReactiveLogOptions as b, observeNode$ as c, toObservable as d, logSlice as l, observeGraph$ as o, reactiveLog as r, toMessages$ as t };

package/dist/reactive-log-DV--7BWd.d.ts

@@ -1,137 +0,0 @@
-import { Observable } from 'rxjs';
-import { m as Messages, N as Node } from './meta-CrZUQAJ6.js';
-import { G as Graph, x as ObserveOptions } from './graph-BXIK5Dq5.js';
-
-/**
- * Bridge a `Node<T>` to an RxJS `Observable<T>`.
- *
- * Emits the node's value on each `DATA` message. Maps `ERROR` to
- * `subscriber.error()` and `COMPLETE` to `subscriber.complete()`.
- * Protocol-internal signals (DIRTY, RESOLVED, PAUSE, etc.) are skipped.
- *
- * Unsubscribing the Observable unsubscribes the node.
- */
-declare function toObservable<T>(node: Node<T>): Observable<T>;
-/**
- * Bridge a `Node<T>` to an `Observable<Messages>` — raw message batches.
- *
- * Each emission is a full `[[Type, Data?], ...]` batch. The Observable
- * terminates on ERROR or COMPLETE (the terminal batch is still emitted
- * as the final `next()` before the Observable signal).
- */
-declare function toMessages$<T>(node: Node<T>): Observable<Messages>;
-/**
- * Observe a single node in a `Graph` as an `Observable<T>`.
- *
- * Equivalent to `toObservable(graph.resolve(path))` but routes through
- * `graph.observe()` so actor guards are respected when provided.
- */
-declare function observeNode$<T>(graph: Graph, path: string, options?: ObserveOptions): Observable<T>;
-/**
- * Observe all nodes in a `Graph` as an `Observable<{ path, messages }>`.
- *
- * Each emission carries the qualified node path and the raw message batch.
- * The Observable never self-completes (graphs are long-lived); dispose by
- * unsubscribing.
- */
-declare function observeGraph$(graph: Graph, options?: ObserveOptions): Observable<{
-    path: string;
-    messages: Messages;
-}>;
-
-/**
- * Shared internals for roadmap §3.2 data structures (option B — versioned snapshots).
- *
- * @remarks
- * Not re-exported from the package barrel; consumers use concrete factories
- * (`reactiveMap`, …). Keeps `equals` / snapshot wiring consistent across
- * collections without exposing a second public protocol.
- *
- * @packageDocumentation
- * @internal
- */
-/**
- * Immutable value paired with a monotonic version for {@link NodeOptions.equals}.
- * Downstream nodes can treat unchanged versions as `RESOLVED`-eligible via `equals`.
- *
- * When the backing node has V0 versioning (GRAPHREFLY-SPEC §7), `v0` carries
- * the node's identity (`id`) and version counter for diff-friendly observation
- * and cross-snapshot dedup (roadmap §6.0b).
- */
-type Versioned<T> = {
-    readonly version: number;
-    readonly value: T;
-    /** V0 identity from the backing node, when versioning is enabled. */
-    readonly v0?: {
-        readonly id: string;
-        readonly version: number;
-    };
-};
-
-type ReactiveLogSnapshot<T> = Versioned<{
-    entries: readonly T[];
-}>;
-type ReactiveLogOptions = {
-    name?: string;
-    maxSize?: number;
-};
-type ReactiveLogBundle<T> = {
-    /** Emits {@link ReactiveLogSnapshot} on each append/clear (two-phase). */
-    readonly entries: Node<ReactiveLogSnapshot<T>>;
-    append: (value: T) => void;
-    /** Push all values, trim once, emit one snapshot. */
-    appendMany: (values: readonly T[]) => void;
-    clear: () => void;
-    /** Remove the first `n` entries; emits snapshot. */
-    trimHead: (n: number) => void;
-    /** Last `n` entries (or fewer); updates when the log changes. */
-    tail: (n: number) => Node<readonly T[]>;
-};
-/**
- * Creates an append-only reactive log with versioned tuple snapshots.
- *
- * @param initial - Optional seed entries (copied).
- * @param options - Optional `name` for `describe()` / debugging.
- * @returns Bundle with `entries` (state node), `append`, `clear`, and {@link ReactiveLogBundle.tail}.
- *
- * @remarks
- * **Derived views:** {@link tail} and {@link logSlice} install an internal noop subscription so
- * `get()` stays wired without an external sink; creating very many disposable derived nodes can
- * retain subscriptions until the log bundle is unreachable.
- *
- * @example
- * ```ts
- * import { reactiveLog } from "@graphrefly/graphrefly-ts";
- *
- * const lg = reactiveLog<number>([1, 2], { name: "audit" });
- * lg.append(3);
- * lg.entries.subscribe((msgs) => console.log(msgs));
- * ```
- *
- * @category extra
- */
-declare function reactiveLog<T>(initial?: readonly T[], options?: ReactiveLogOptions): ReactiveLogBundle<T>;
-/**
- * Builds a derived node for `entries.slice(start, stop)` (same semantics as `Array.prototype.slice`; `stop` exclusive).
- *
- * @param log - Log from {@link reactiveLog}.
- * @param start - Start index (must be `>= 0`).
- * @param stop - End index (exclusive); omit to slice to the end.
- * @returns Derived node emitting the sliced readonly array.
- *
- * @example
- * ```ts
- * import { reactiveLog, logSlice } from "@graphrefly/graphrefly-ts";
- *
- * const lg = reactiveLog<number>([10, 20, 30, 40, 50]);
- * const slice$ = logSlice(lg, 1, 4); // reactive view of [20, 30, 40]
- * slice$.subscribe((msgs) => console.log(msgs));
- *
- * lg.append(60); // slice$ now reflects [20, 30, 40] (indices 1–3 of updated log)
- * ```
- *
- * @category extra
- */
-declare function logSlice<T>(log: ReactiveLogBundle<T>, start: number, stop?: number): Node<readonly T[]>;
-
-export { type ReactiveLogSnapshot as R, type Versioned as V, type ReactiveLogBundle as a, type ReactiveLogOptions as b, observeNode$ as c, toObservable as d, logSlice as l, observeGraph$ as o, reactiveLog as r, toMessages$ as t };