@graphrefly/ts 0.0.2 → 0.0.3

package/dist/graph/index.d.cts

@@ -1,17 +1,17 @@
 export { DescribeChangeset, DescribeEvent, PipeOperator, Stratified, StratifyOptions, StratifyRule, pipe, stratify, stratifyBranch, topologyDiff } from '../composition/index.cjs';
-export { I as IndexChange, a as IndexRow, L as ListChange, c as LogChange, M as MapChange, j as ReactiveIndex, k as ReactiveIndexCapacityOrder, l as ReactiveIndexCapacityPolicy, m as ReactiveIndexOpt, n as ReactiveIndexOptions, s as ReactiveView, E as reactiveIndex } from '../reactive-collection-B9R0Bl1P.cjs';
-export { R as ReactiveList, a as ReactiveListOpt, b as ReactiveListOptions, c as ReactiveLog, d as ReactiveLogOptions, e as ReactiveMap, f as ReactiveMapOpt, g as ReactiveMapOptions, h as ReactiveMapRetentionEntry, i as ReactiveMapRetentionPolicy, m as mergeReactiveLogs, r as reactiveList, j as reactiveLog, k as reactiveMap, s as scanLog } from '../reactive-map-C_8sOfdS.cjs';
-export { C as CapacityPolicy, O as OrderedCapacityPolicy, R as ReactiveOpt, a as RetentionPolicy, V as ViewCachePolicy } from '../types-XDoqxYO9.cjs';
+export { I as IndexChange, a as IndexRow, L as ListChange, c as LogChange, M as MapChange, j as ReactiveIndex, k as ReactiveIndexCapacityOrder, l as ReactiveIndexCapacityPolicy, m as ReactiveIndexOpt, n as ReactiveIndexOptions, s as ReactiveView, E as reactiveIndex } from '../reactive-collection-BYlWvtnp.cjs';
+export { R as ReactiveList, a as ReactiveListOpt, b as ReactiveListOptions, c as ReactiveLog, d as ReactiveLogOptions, e as ReactiveMap, f as ReactiveMapOpt, g as ReactiveMapOptions, h as ReactiveMapRetentionEntry, i as ReactiveMapRetentionPolicy, m as mergeReactiveLogs, r as reactiveList, j as reactiveLog, k as reactiveMap, s as scanLog } from '../reactive-map-BHacbIqz.cjs';
+export { C as CapacityPolicy, O as OrderedCapacityPolicy, R as ReactiveOpt, a as RetentionPolicy, V as ViewCachePolicy } from '../types-BUbbbh4f.cjs';
 export { restoreReactiveIndex, restoreReactiveList, restoreReactiveLog, restoreReactiveMap } from '../data-structures/index.cjs';
 export { DescribeToAsciiOptions, DescribeToD2Options, DescribeToJsonOptions, DescribeToMermaidOptions, DescribeToMermaidUrlOptions, DescribeToPrettyOptions, DiagramDirection, MermaidLiveTheme, MermaidLiveUrlOptions, describeToAscii, describeToD2, describeToJson, describeToMermaid, describeToMermaidUrl, describeToPretty, mermaidLiveUrl } from '../render/index.cjs';
-import { d as Graph } from '../graph-CWK3HLPB.cjs';
-export { b as DerivedFn, E as EffectFn, G as GRAPH_BLUEPRINT_VERSION, c as GRAPH_CHECKPOINT_VERSION, e as GraphBlueprint, f as GraphBlueprintDiagnosticCode, g as GraphBlueprintDiagnosticIssue, h as GraphBlueprintDiagnostics, i as GraphBlueprintHash, j as GraphBlueprintHashInput, k as GraphBlueprintHashOptions, l as GraphBlueprintJson, m as GraphBlueprintOptions, n as GraphBlueprintProvenance, o as GraphCheckpoint, p as GraphCheckpointEdge, q as GraphCheckpointFactory, r as GraphCheckpointJson, s as GraphCheckpointMount, t as GraphCheckpointNode, u as GraphCheckpointTerminal, v as GraphCheckpointValue, w as GraphCheckpointVersion, x as GraphOptions, z as GraphRestoreDescriptor, A as GraphRestoreDescriptorContext, C as GraphRestoreRegistry, N as NodeProfile, F as NormalizedGraphTopologyNode, H as NormalizedGraphTopologySnapshot, O as ObserveEvent, I as ObserveEventEquals, J as ObservePredicate, K as ObserveStream, P as Profile, R as RestoreGraphOptions, Q as StateNode, T as SugarOpts, V as TopologyEvent, W as TopologyEventKind, X as TopologyGroup, Y as TopologyGroupOptions, Z as TopologyGroupReleaseOptions, _ as TopologyStream, a0 as canonicalTopologyBytes, a1 as canonicalTopologyJson, a3 as coalesceObserve, a4 as defaultRestoreRegistry, a9 as filterObserve, ac as graph, ad as graphBlueprintDiagnostics, aj as normalizeTopology, ao as restoreGraph, at as stateRestoreDescriptor, av as takeRestoreDescriptor, az as timerRestoreDescriptor, aB as withBlueprintHash, aC as withBlueprintProvenance } from '../graph-CWK3HLPB.cjs';
-import { N as Node, C as Ctx } from '../types-BS6CyR-x.cjs';
-export { b as DriverCancel, c as DriverResult, E as EnvironmentDrivers, d as EnvironmentDriversInit, F as FetchLike, e as FetchResponseLike, g as HttpRequest, h as HttpResponse, L as LocalHttpDriver, i as LocalProcessDriver, j as LocalSseDriver, k as LocalWebSocketDriver, l as LocalWebhookDriver, w as ProcessCommand, x as ProcessResult, y as SseDriverEvent, z as SseEvent, A as SseRequest, G as WebSocketConstructorLike, I as WebSocketDriverEvent, J as WebSocketEvent, K as WebSocketLike, M as WebSocketRequest, O as WebSocketSend, Q as WebSocketSendResult, U as WebSocketSessionHandle, V as WebhookDriverEvent, X as WebhookEvent, Y as WebhookRegistration, a4 as domWebSocketDriver, a6 as fetchHttpDriver } from '../types-BS6CyR-x.cjs';
+import { d as Graph } from '../graph-C1C-wb0L.cjs';
+export { b as DerivedFn, E as EffectFn, G as GRAPH_BLUEPRINT_VERSION, c as GRAPH_CHECKPOINT_VERSION, e as GraphBlueprint, f as GraphBlueprintDiagnosticCode, g as GraphBlueprintDiagnosticIssue, h as GraphBlueprintDiagnostics, i as GraphBlueprintHash, j as GraphBlueprintHashInput, k as GraphBlueprintHashOptions, l as GraphBlueprintJson, m as GraphBlueprintOptions, n as GraphBlueprintProvenance, o as GraphCheckpoint, p as GraphCheckpointEdge, q as GraphCheckpointFactory, r as GraphCheckpointJson, s as GraphCheckpointMount, t as GraphCheckpointNode, u as GraphCheckpointTerminal, v as GraphCheckpointValue, w as GraphCheckpointVersion, x as GraphOptions, z as GraphRestoreDescriptor, A as GraphRestoreDescriptorContext, C as GraphRestoreRegistry, N as NodeProfile, F as NormalizedGraphTopologyNode, H as NormalizedGraphTopologySnapshot, O as ObserveEvent, I as ObserveEventEquals, J as ObservePredicate, K as ObserveStream, P as Profile, R as RestoreGraphOptions, Q as StateNode, T as SugarOpts, V as TopologyEvent, W as TopologyEventKind, X as TopologyGroup, Y as TopologyGroupOptions, Z as TopologyGroupReleaseOptions, _ as TopologyStream, a0 as canonicalTopologyBytes, a1 as canonicalTopologyJson, a3 as coalesceObserve, a4 as defaultRestoreRegistry, a9 as filterObserve, ac as graph, ad as graphBlueprintDiagnostics, aj as normalizeTopology, ao as restoreGraph, at as stateRestoreDescriptor, av as takeRestoreDescriptor, az as timerRestoreDescriptor, aB as withBlueprintHash, aC as withBlueprintProvenance } from '../graph-C1C-wb0L.cjs';
+import { N as Node, C as Ctx } from '../types-CTN3XoMl.cjs';
+export { b as DriverCancel, c as DriverResult, E as EnvironmentDrivers, d as EnvironmentDriversInit, F as FetchLike, e as FetchResponseLike, g as HttpRequest, h as HttpResponse, L as LocalHttpDriver, i as LocalProcessDriver, j as LocalSseDriver, k as LocalWebSocketDriver, l as LocalWebhookDriver, w as ProcessCommand, x as ProcessResult, y as SseDriverEvent, z as SseEvent, A as SseRequest, G as WebSocketConstructorLike, I as WebSocketDriverEvent, J as WebSocketEvent, K as WebSocketLike, M as WebSocketRequest, O as WebSocketSend, Q as WebSocketSendResult, U as WebSocketSessionHandle, V as WebhookDriverEvent, X as WebhookEvent, Y as WebhookRegistration, a4 as domWebSocketDriver, a6 as fetchHttpDriver } from '../types-CTN3XoMl.cjs';
 import { f as KvStorageTier } from '../append-log-DisvEReb.cjs';
 import { b as ReadThroughLookupTier } from '../read-through-B1CYPfq_.cjs';
-import { a as DescribeNode, c as DescribeSnapshot } from '../describe-CQRrkv-Q.cjs';
-export { D as DescribeEdge, b as DescribeOpts, G as GraphTopologyEdge, d as GraphTopologyNode, e as GraphTopologySnapshot } from '../describe-CQRrkv-Q.cjs';
+import { a as DescribeNode, c as DescribeSnapshot } from '../describe-BumQ-3_0.cjs';
+export { D as DescribeEdge, b as DescribeOpts, G as GraphTopologyEdge, d as GraphTopologyNode, e as GraphTopologySnapshot } from '../describe-BumQ-3_0.cjs';
 export { B as BackoffPolicy, R as RetryPolicy, a as RetryState, b as RetryStatus, c as backoffDelayMs, n as nextRetryDelayMs, d as noBackoff, r as retryPolicy, s as shouldRetry } from '../resilience-Dig3Q7n0.cjs';
 import '../messages-CAzUPPJM.cjs';
 import '../core/index.cjs';

package/dist/graph/index.d.ts

@@ -1,17 +1,17 @@
 export { DescribeChangeset, DescribeEvent, PipeOperator, Stratified, StratifyOptions, StratifyRule, pipe, stratify, stratifyBranch, topologyDiff } from '../composition/index.js';
-export { I as IndexChange, a as IndexRow, L as ListChange, c as LogChange, M as MapChange, j as ReactiveIndex, k as ReactiveIndexCapacityOrder, l as ReactiveIndexCapacityPolicy, m as ReactiveIndexOpt, n as ReactiveIndexOptions, s as ReactiveView, E as reactiveIndex } from '../reactive-collection-BXFrH0U2.js';
-export { R as ReactiveList, a as ReactiveListOpt, b as ReactiveListOptions, c as ReactiveLog, d as ReactiveLogOptions, e as ReactiveMap, f as ReactiveMapOpt, g as ReactiveMapOptions, h as ReactiveMapRetentionEntry, i as ReactiveMapRetentionPolicy, m as mergeReactiveLogs, r as reactiveList, j as reactiveLog, k as reactiveMap, s as scanLog } from '../reactive-map-jle5dnok.js';
-export { C as CapacityPolicy, O as OrderedCapacityPolicy, R as ReactiveOpt, a as RetentionPolicy, V as ViewCachePolicy } from '../types-DL_05n2M.js';
+export { I as IndexChange, a as IndexRow, L as ListChange, c as LogChange, M as MapChange, j as ReactiveIndex, k as ReactiveIndexCapacityOrder, l as ReactiveIndexCapacityPolicy, m as ReactiveIndexOpt, n as ReactiveIndexOptions, s as ReactiveView, E as reactiveIndex } from '../reactive-collection-efOEdGFN.js';
+export { R as ReactiveList, a as ReactiveListOpt, b as ReactiveListOptions, c as ReactiveLog, d as ReactiveLogOptions, e as ReactiveMap, f as ReactiveMapOpt, g as ReactiveMapOptions, h as ReactiveMapRetentionEntry, i as ReactiveMapRetentionPolicy, m as mergeReactiveLogs, r as reactiveList, j as reactiveLog, k as reactiveMap, s as scanLog } from '../reactive-map-DN4Jyqnf.js';
+export { C as CapacityPolicy, O as OrderedCapacityPolicy, R as ReactiveOpt, a as RetentionPolicy, V as ViewCachePolicy } from '../types-DeID_FRl.js';
 export { restoreReactiveIndex, restoreReactiveList, restoreReactiveLog, restoreReactiveMap } from '../data-structures/index.js';
 export { DescribeToAsciiOptions, DescribeToD2Options, DescribeToJsonOptions, DescribeToMermaidOptions, DescribeToMermaidUrlOptions, DescribeToPrettyOptions, DiagramDirection, MermaidLiveTheme, MermaidLiveUrlOptions, describeToAscii, describeToD2, describeToJson, describeToMermaid, describeToMermaidUrl, describeToPretty, mermaidLiveUrl } from '../render/index.js';
-import { d as Graph } from '../graph-ho5sotHP.js';
-export { b as DerivedFn, E as EffectFn, G as GRAPH_BLUEPRINT_VERSION, c as GRAPH_CHECKPOINT_VERSION, e as GraphBlueprint, f as GraphBlueprintDiagnosticCode, g as GraphBlueprintDiagnosticIssue, h as GraphBlueprintDiagnostics, i as GraphBlueprintHash, j as GraphBlueprintHashInput, k as GraphBlueprintHashOptions, l as GraphBlueprintJson, m as GraphBlueprintOptions, n as GraphBlueprintProvenance, o as GraphCheckpoint, p as GraphCheckpointEdge, q as GraphCheckpointFactory, r as GraphCheckpointJson, s as GraphCheckpointMount, t as GraphCheckpointNode, u as GraphCheckpointTerminal, v as GraphCheckpointValue, w as GraphCheckpointVersion, x as GraphOptions, z as GraphRestoreDescriptor, A as GraphRestoreDescriptorContext, C as GraphRestoreRegistry, N as NodeProfile, F as NormalizedGraphTopologyNode, H as NormalizedGraphTopologySnapshot, O as ObserveEvent, I as ObserveEventEquals, J as ObservePredicate, K as ObserveStream, P as Profile, R as RestoreGraphOptions, Q as StateNode, T as SugarOpts, V as TopologyEvent, W as TopologyEventKind, X as TopologyGroup, Y as TopologyGroupOptions, Z as TopologyGroupReleaseOptions, _ as TopologyStream, a0 as canonicalTopologyBytes, a1 as canonicalTopologyJson, a3 as coalesceObserve, a4 as defaultRestoreRegistry, a9 as filterObserve, ac as graph, ad as graphBlueprintDiagnostics, aj as normalizeTopology, ao as restoreGraph, at as stateRestoreDescriptor, av as takeRestoreDescriptor, az as timerRestoreDescriptor, aB as withBlueprintHash, aC as withBlueprintProvenance } from '../graph-ho5sotHP.js';
-import { N as Node, C as Ctx } from '../types-C9NOgNJw.js';
-export { b as DriverCancel, c as DriverResult, E as EnvironmentDrivers, d as EnvironmentDriversInit, F as FetchLike, e as FetchResponseLike, g as HttpRequest, h as HttpResponse, L as LocalHttpDriver, i as LocalProcessDriver, j as LocalSseDriver, k as LocalWebSocketDriver, l as LocalWebhookDriver, w as ProcessCommand, x as ProcessResult, y as SseDriverEvent, z as SseEvent, A as SseRequest, G as WebSocketConstructorLike, I as WebSocketDriverEvent, J as WebSocketEvent, K as WebSocketLike, M as WebSocketRequest, O as WebSocketSend, Q as WebSocketSendResult, U as WebSocketSessionHandle, V as WebhookDriverEvent, X as WebhookEvent, Y as WebhookRegistration, a4 as domWebSocketDriver, a6 as fetchHttpDriver } from '../types-C9NOgNJw.js';
+import { d as Graph } from '../graph-CS0b4V9B.js';
+export { b as DerivedFn, E as EffectFn, G as GRAPH_BLUEPRINT_VERSION, c as GRAPH_CHECKPOINT_VERSION, e as GraphBlueprint, f as GraphBlueprintDiagnosticCode, g as GraphBlueprintDiagnosticIssue, h as GraphBlueprintDiagnostics, i as GraphBlueprintHash, j as GraphBlueprintHashInput, k as GraphBlueprintHashOptions, l as GraphBlueprintJson, m as GraphBlueprintOptions, n as GraphBlueprintProvenance, o as GraphCheckpoint, p as GraphCheckpointEdge, q as GraphCheckpointFactory, r as GraphCheckpointJson, s as GraphCheckpointMount, t as GraphCheckpointNode, u as GraphCheckpointTerminal, v as GraphCheckpointValue, w as GraphCheckpointVersion, x as GraphOptions, z as GraphRestoreDescriptor, A as GraphRestoreDescriptorContext, C as GraphRestoreRegistry, N as NodeProfile, F as NormalizedGraphTopologyNode, H as NormalizedGraphTopologySnapshot, O as ObserveEvent, I as ObserveEventEquals, J as ObservePredicate, K as ObserveStream, P as Profile, R as RestoreGraphOptions, Q as StateNode, T as SugarOpts, V as TopologyEvent, W as TopologyEventKind, X as TopologyGroup, Y as TopologyGroupOptions, Z as TopologyGroupReleaseOptions, _ as TopologyStream, a0 as canonicalTopologyBytes, a1 as canonicalTopologyJson, a3 as coalesceObserve, a4 as defaultRestoreRegistry, a9 as filterObserve, ac as graph, ad as graphBlueprintDiagnostics, aj as normalizeTopology, ao as restoreGraph, at as stateRestoreDescriptor, av as takeRestoreDescriptor, az as timerRestoreDescriptor, aB as withBlueprintHash, aC as withBlueprintProvenance } from '../graph-CS0b4V9B.js';
+import { N as Node, C as Ctx } from '../types-DChxk1vK.js';
+export { b as DriverCancel, c as DriverResult, E as EnvironmentDrivers, d as EnvironmentDriversInit, F as FetchLike, e as FetchResponseLike, g as HttpRequest, h as HttpResponse, L as LocalHttpDriver, i as LocalProcessDriver, j as LocalSseDriver, k as LocalWebSocketDriver, l as LocalWebhookDriver, w as ProcessCommand, x as ProcessResult, y as SseDriverEvent, z as SseEvent, A as SseRequest, G as WebSocketConstructorLike, I as WebSocketDriverEvent, J as WebSocketEvent, K as WebSocketLike, M as WebSocketRequest, O as WebSocketSend, Q as WebSocketSendResult, U as WebSocketSessionHandle, V as WebhookDriverEvent, X as WebhookEvent, Y as WebhookRegistration, a4 as domWebSocketDriver, a6 as fetchHttpDriver } from '../types-DChxk1vK.js';
 import { f as KvStorageTier } from '../append-log-DzKMmjxx.js';
 import { b as ReadThroughLookupTier } from '../read-through-DwyJhGs1.js';
-import { a as DescribeNode, c as DescribeSnapshot } from '../describe-B_A5fbXH.js';
-export { D as DescribeEdge, b as DescribeOpts, G as GraphTopologyEdge, d as GraphTopologyNode, e as GraphTopologySnapshot } from '../describe-B_A5fbXH.js';
+import { a as DescribeNode, c as DescribeSnapshot } from '../describe-cYr_Z5zm.js';
+export { D as DescribeEdge, b as DescribeOpts, G as GraphTopologyEdge, d as GraphTopologyNode, e as GraphTopologySnapshot } from '../describe-cYr_Z5zm.js';
 export { B as BackoffPolicy, R as RetryPolicy, a as RetryState, b as RetryStatus, c as backoffDelayMs, n as nextRetryDelayMs, d as noBackoff, r as retryPolicy, s as shouldRetry } from '../resilience-Dig3Q7n0.js';
 import '../messages-CAzUPPJM.js';
 import '../core/index.js';

package/dist/graph/index.js

@@ -13,7 +13,7 @@ import {
   timerRestoreDescriptor,
   validateNoIslands,
   workerDerived
-} from "../chunk-SIDJO2T4.js";
+} from "../chunk-3J7UPZL5.js";
 import {
   describeToAscii,
   describeToD2,
@@ -28,7 +28,7 @@ import {
   stratify,
   stratifyBranch,
   topologyDiff
-} from "../chunk-7HZRJMN6.js";
+} from "../chunk-UEMN5URK.js";
 import {
   GRAPH_BLUEPRINT_VERSION,
   Graph,
@@ -40,7 +40,7 @@ import {
   normalizeTopology,
   withBlueprintHash,
   withBlueprintProvenance
-} from "../chunk-EOKT4QFF.js";
+} from "../chunk-NNDIFUKX.js";
 import "../chunk-4Q77MMJY.js";
 import {
   mergeReactiveLogs,
@@ -53,7 +53,7 @@ import {
   restoreReactiveLog,
   restoreReactiveMap,
   scanLog
-} from "../chunk-ECURQ3HD.js";
+} from "../chunk-3LYI6ADX.js";
 import "../chunk-6E76H4OU.js";
 import {
   backoffDelayMs,
@@ -62,15 +62,15 @@ import {
   retryPolicy,
   shouldRetry
 } from "../chunk-OOEN33FB.js";
-import "../chunk-CX6B6PO2.js";
+import "../chunk-DKFWDTVY.js";
 import {
   GRAPH_CHECKPOINT_VERSION
-} from "../chunk-CJIFGJQG.js";
+} from "../chunk-54WPEODM.js";
 import {
   EnvironmentDrivers,
   domWebSocketDriver,
   fetchHttpDriver
-} from "../chunk-SHZDP2MQ.js";
+} from "../chunk-GXU6WFEJ.js";
 import "../chunk-WQIA3GFB.js";
 import "../chunk-S6HXABGL.js";
 import "../chunk-JKAYLDQV.js";

package/dist/{graph-CWK3HLPB.d.cts → graph-C1C-wb0L.d.cts}

@@ -1,7 +1,7 @@
 import { BatchCtx } from './core/index.cjs';
-import { q as NodeVersionJson, D as Dispatcher, u as NodeVersioningPolicy, E as EnvironmentDrivers, n as NodeOptions, N as Node, m as NodeFn, C as Ctx, B as Status } from './types-BS6CyR-x.cjs';
+import { q as NodeVersionJson, D as Dispatcher, u as NodeVersioningPolicy, E as EnvironmentDrivers, n as NodeOptions, N as Node, m as NodeFn, C as Ctx, B as Status } from './types-CTN3XoMl.cjs';
 import { S as StrictJsonObject, b as StrictJsonValue } from './codec-BB7p8fJc.cjs';
-import { G as GraphTopologyEdge, e as GraphTopologySnapshot, b as DescribeOpts, c as DescribeSnapshot } from './describe-CQRrkv-Q.cjs';
+import { G as GraphTopologyEdge, e as GraphTopologySnapshot, b as DescribeOpts, c as DescribeSnapshot } from './describe-BumQ-3_0.cjs';
 import { M as Message } from './messages-CAzUPPJM.cjs';
 
 /**
@@ -300,19 +300,96 @@ declare function define<S, T>(ref: string, fn: (v: S) => T, opts?: DefineOpts):
  * any graph's index.
  */
 declare function initNode<TIn, TOut>(op: Operator<TIn, TOut>, deps: readonly Node<unknown>[], opts?: NodeOptions<TOut>): Node<TOut>;
-/** map: emit fn(value). A named {@link define} makes the map restorable via the map descriptor (D101). */
+/**
+ * Transform each upstream DATA value with a synchronous mapping function.
+ *
+ * @param fn - Mapping function, or a named `define()` definition for checkpoint restoration.
+ * @returns An operator that emits `fn(value)` for each upstream value.
+ * @example
+ * ```ts
+ * import { graph, map } from "@graphrefly/ts";
+ *
+ * const g = graph();
+ * const count = g.state(1);
+ * const doubled = g.initNode(map((value: number) => value * 2), [count]);
+ * ```
+ * @remarks **Restorable maps:** Passing a named `define()` registers semantic restore metadata.
+ * @category operators
+ */
 declare function map<S, T>(fn: ((v: S) => T) | Definition<S, T>): Operator<S, T>;
-/** filter: emit value only when pred(value) (else skip the wave). */
+/**
+ * Pass through upstream values that satisfy a predicate.
+ *
+ * @param pred - Predicate evaluated for each upstream DATA value.
+ * @returns An operator that emits matching values and stays quiet for non-matches.
+ * @example
+ * ```ts
+ * import { filter, graph } from "@graphrefly/ts";
+ *
+ * const g = graph();
+ * const count = g.state(0);
+ * const even = g.initNode(filter((value: number) => value % 2 === 0), [count]);
+ * ```
+ * @category operators
+ */
 declare function filter<S>(pred: (v: S) => boolean): Operator<S, S>;
-/** scan: stateful accumulator over the upstream (acc seeded once, kept in ctx.state). */
+/**
+ * Accumulate upstream values and emit each intermediate accumulator.
+ *
+ * @param reducer - Reducer called with the previous accumulator and each upstream value.
+ * @param seed - Initial accumulator value.
+ * @returns An operator that emits the accumulator after every input value.
+ * @example
+ * ```ts
+ * import { graph, scan } from "@graphrefly/ts";
+ *
+ * const g = graph();
+ * const values = g.state(1);
+ * const total = g.initNode(scan((sum: number, value: number) => sum + value, 0), [values]);
+ * ```
+ * @category operators
+ */
 declare function scan<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T>;
-/** take: emit the first n values, then COMPLETE (terminal-is-forever). */
+/**
+ * Emit the first `n` upstream values, then complete.
+ *
+ * @param n - Number of DATA values to pass before completion.
+ * @returns An operator that forwards at most `n` values and then emits COMPLETE.
+ * @example
+ * ```ts
+ * import { graph, take } from "@graphrefly/ts";
+ *
+ * const firstThree = graph().initNode(take<number>(3), [source]);
+ * ```
+ * @category operators
+ */
 declare function take<S>(n: number): Operator<S, S>;
-/** distinctUntilChanged: emit only when the value differs from the previous emit. */
+/**
+ * Suppress consecutive duplicate values.
+ *
+ * @param eq - Equality predicate; defaults to `Object.is`.
+ * @returns An operator that emits only when the next value differs from the previous emitted value.
+ * @example
+ * ```ts
+ * import { distinctUntilChanged, graph } from "@graphrefly/ts";
+ *
+ * const stable = graph().initNode(distinctUntilChanged<number>(), [source]);
+ * ```
+ * @category operators
+ */
 declare function distinctUntilChanged<S>(eq?: (a: S, b: S) => boolean): Operator<S, S>;
 /**
  * merge: interleave several sources — emit each DATA from whichever dep fired. `partial:true`
  * (combine-family): fires on any single dep, not gated on all deps settling.
+ *
+ * @returns An operator that forwards DATA from any dependency.
+ * @example
+ * ```ts
+ * import { graph, merge } from "@graphrefly/ts";
+ *
+ * const merged = graph().initNode(merge<number>(), [left, right]);
+ * ```
+ * @category operators
  */
 declare function merge<T>(): Operator<T, T>;
 /**
@@ -321,6 +398,17 @@ declare function merge<T>(): Operator<T, T>;
  * source terminates. `completeWhenDepsComplete:false + terminalAsRealInput:true`: the fn fires on
  * the source COMPLETE (reading `terminal===true`) and emits the accumulator + COMPLETE. An empty
  * source emits the seed (RxJS parity). A source ERROR auto-forwards (errorWhenDepsError default).
+ *
+ * @param reducer - Reducer called with the accumulator and each upstream DATA value.
+ * @param seed - Initial accumulator value emitted if the source completes empty.
+ * @returns An operator that emits one accumulated value when the source completes.
+ * @example
+ * ```ts
+ * import { graph, reduce } from "@graphrefly/ts";
+ *
+ * const total = graph().initNode(reduce((sum: number, value: number) => sum + value, 0), [source]);
+ * ```
+ * @category operators
  */
 declare function reduce<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T>;
 /**
@@ -550,10 +638,34 @@ interface Profile {
 /**
  * A state node (L4-Q1): a manual source whose `.set(v)` is `node.down([[DATA, v]])` sugar.
  * Extends the substrate Node so it is usable as a dep AND carries the graph-layer `.set`.
+ *
+ * @example
+ * ```ts
+ * import { graph } from "@graphrefly/ts";
+ *
+ * const count = graph().state(0);
+ * count.set(1);
+ * ```
+ * @category graph
  */
 declare class StateNode<T> extends Node<T> {
     set(v: T): void;
 }
+/**
+ * Own a single graph-local topology, lifecycle, inspection index, and dispatcher boundary.
+ *
+ * @example
+ * ```ts
+ * import { graph } from "@graphrefly/ts";
+ *
+ * const g = graph({ name: "counter" });
+ * const count = g.state(0, { name: "count" });
+ * const doubled = g.derived([count], ([value]) => value * 2, { name: "doubled" });
+ * ```
+ * @remarks **Graph-local:** Cross-graph dependencies require a wire bridge; direct deps stay inside
+ *   one graph ownership domain.
+ * @category graph
+ */
 declare class Graph {
     readonly name?: string;
     private readonly _dispatcher;
@@ -662,7 +774,22 @@ declare class Graph {
     private _checkpoint;
     private _checkpointNode;
 }
-/** Construct a Graph (default global dispatcher; L4-Q4). */
+/**
+ * Construct a graph with graph-local topology, lifecycle, and inspection ownership.
+ *
+ * @param opts - Optional graph name, dispatcher, versioning policy, environment drivers, and
+ *   profiling switch.
+ * @returns A `Graph` instance whose sugar methods create graph-registered nodes.
+ * @example
+ * ```ts
+ * import { graph } from "@graphrefly/ts";
+ *
+ * const g = graph({ name: "counter" });
+ * const count = g.state(0, { name: "count" });
+ * const doubled = g.derived([count], ([value]) => value * 2);
+ * ```
+ * @category graph
+ */
 declare function graph(opts?: GraphOptions): Graph;
 
 export { type ValveOpts as $, type GraphRestoreDescriptorContext as A, type GraphRestoreEntry as B, type GraphRestoreRegistry as C, type DefineOpts as D, type EffectFn as E, type NormalizedGraphTopologyNode as F, GRAPH_BLUEPRINT_VERSION as G, type NormalizedGraphTopologySnapshot as H, type ObserveEventEquals as I, type ObservePredicate as J, type ObserveStream as K, type Operator as L, type RestoreRegistryEntry as M, type NodeProfile as N, type ObserveEvent as O, type Profile as P, StateNode as Q, type RestoreGraphOptions as R, type SettleOpts as S, type SugarOpts as T, type TapObserver as U, type TopologyEvent as V, type TopologyEventKind as W, type TopologyGroup as X, type TopologyGroupOptions as Y, type TopologyGroupReleaseOptions as Z, type TopologyStream as _, type Definition as a, canonicalTopologyBytes as a0, canonicalTopologyJson as a1, catchError as a2, coalesceObserve as a3, defaultRestoreRegistry as a4, define as a5, distinctUntilChanged as a6, elementAt as a7, filter as a8, filterObserve as a9, valve as aA, withBlueprintHash as aB, withBlueprintProvenance as aC, find as aa, first as ab, graph as ac, graphBlueprintDiagnostics as ad, initNode as ae, last as af, map as ag, mapRestoreDescriptor as ah, merge as ai, normalizeTopology as aj, onFirstData as ak, pairwise as al, reduce as am, rescue as an, restoreGraph as ao, restoreRegistry as ap, scan as aq, settle as ar, skip as as, stateRestoreDescriptor as at, take as au, takeRestoreDescriptor as av, takeWhile as aw, tap as ax, tapFirst as ay, timerRestoreDescriptor as az, type DerivedFn as b, GRAPH_CHECKPOINT_VERSION as c, Graph as d, type GraphBlueprint as e, type GraphBlueprintDiagnosticCode as f, type GraphBlueprintDiagnosticIssue as g, type GraphBlueprintDiagnostics as h, type GraphBlueprintHash as i, type GraphBlueprintHashInput as j, type GraphBlueprintHashOptions as k, type GraphBlueprintJson as l, type GraphBlueprintOptions as m, type GraphBlueprintProvenance as n, type GraphCheckpoint as o, type GraphCheckpointEdge as p, type GraphCheckpointFactory as q, type GraphCheckpointJson as r, type GraphCheckpointMount as s, type GraphCheckpointNode as t, type GraphCheckpointTerminal as u, type GraphCheckpointValue as v, type GraphCheckpointVersion as w, type GraphOptions as x, type GraphRestoreDefinition as y, type GraphRestoreDescriptor as z };

package/dist/{graph-ho5sotHP.d.ts → graph-CS0b4V9B.d.ts}

@@ -1,7 +1,7 @@
 import { BatchCtx } from './core/index.js';
-import { q as NodeVersionJson, D as Dispatcher, u as NodeVersioningPolicy, E as EnvironmentDrivers, n as NodeOptions, N as Node, m as NodeFn, C as Ctx, B as Status } from './types-C9NOgNJw.js';
+import { q as NodeVersionJson, D as Dispatcher, u as NodeVersioningPolicy, E as EnvironmentDrivers, n as NodeOptions, N as Node, m as NodeFn, C as Ctx, B as Status } from './types-DChxk1vK.js';
 import { S as StrictJsonObject, b as StrictJsonValue } from './codec-BB7p8fJc.js';
-import { G as GraphTopologyEdge, e as GraphTopologySnapshot, b as DescribeOpts, c as DescribeSnapshot } from './describe-B_A5fbXH.js';
+import { G as GraphTopologyEdge, e as GraphTopologySnapshot, b as DescribeOpts, c as DescribeSnapshot } from './describe-cYr_Z5zm.js';
 import { M as Message } from './messages-CAzUPPJM.js';
 
 /**
@@ -300,19 +300,96 @@ declare function define<S, T>(ref: string, fn: (v: S) => T, opts?: DefineOpts):
  * any graph's index.
  */
 declare function initNode<TIn, TOut>(op: Operator<TIn, TOut>, deps: readonly Node<unknown>[], opts?: NodeOptions<TOut>): Node<TOut>;
-/** map: emit fn(value). A named {@link define} makes the map restorable via the map descriptor (D101). */
+/**
+ * Transform each upstream DATA value with a synchronous mapping function.
+ *
+ * @param fn - Mapping function, or a named `define()` definition for checkpoint restoration.
+ * @returns An operator that emits `fn(value)` for each upstream value.
+ * @example
+ * ```ts
+ * import { graph, map } from "@graphrefly/ts";
+ *
+ * const g = graph();
+ * const count = g.state(1);
+ * const doubled = g.initNode(map((value: number) => value * 2), [count]);
+ * ```
+ * @remarks **Restorable maps:** Passing a named `define()` registers semantic restore metadata.
+ * @category operators
+ */
 declare function map<S, T>(fn: ((v: S) => T) | Definition<S, T>): Operator<S, T>;
-/** filter: emit value only when pred(value) (else skip the wave). */
+/**
+ * Pass through upstream values that satisfy a predicate.
+ *
+ * @param pred - Predicate evaluated for each upstream DATA value.
+ * @returns An operator that emits matching values and stays quiet for non-matches.
+ * @example
+ * ```ts
+ * import { filter, graph } from "@graphrefly/ts";
+ *
+ * const g = graph();
+ * const count = g.state(0);
+ * const even = g.initNode(filter((value: number) => value % 2 === 0), [count]);
+ * ```
+ * @category operators
+ */
 declare function filter<S>(pred: (v: S) => boolean): Operator<S, S>;
-/** scan: stateful accumulator over the upstream (acc seeded once, kept in ctx.state). */
+/**
+ * Accumulate upstream values and emit each intermediate accumulator.
+ *
+ * @param reducer - Reducer called with the previous accumulator and each upstream value.
+ * @param seed - Initial accumulator value.
+ * @returns An operator that emits the accumulator after every input value.
+ * @example
+ * ```ts
+ * import { graph, scan } from "@graphrefly/ts";
+ *
+ * const g = graph();
+ * const values = g.state(1);
+ * const total = g.initNode(scan((sum: number, value: number) => sum + value, 0), [values]);
+ * ```
+ * @category operators
+ */
 declare function scan<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T>;
-/** take: emit the first n values, then COMPLETE (terminal-is-forever). */
+/**
+ * Emit the first `n` upstream values, then complete.
+ *
+ * @param n - Number of DATA values to pass before completion.
+ * @returns An operator that forwards at most `n` values and then emits COMPLETE.
+ * @example
+ * ```ts
+ * import { graph, take } from "@graphrefly/ts";
+ *
+ * const firstThree = graph().initNode(take<number>(3), [source]);
+ * ```
+ * @category operators
+ */
 declare function take<S>(n: number): Operator<S, S>;
-/** distinctUntilChanged: emit only when the value differs from the previous emit. */
+/**
+ * Suppress consecutive duplicate values.
+ *
+ * @param eq - Equality predicate; defaults to `Object.is`.
+ * @returns An operator that emits only when the next value differs from the previous emitted value.
+ * @example
+ * ```ts
+ * import { distinctUntilChanged, graph } from "@graphrefly/ts";
+ *
+ * const stable = graph().initNode(distinctUntilChanged<number>(), [source]);
+ * ```
+ * @category operators
+ */
 declare function distinctUntilChanged<S>(eq?: (a: S, b: S) => boolean): Operator<S, S>;
 /**
  * merge: interleave several sources — emit each DATA from whichever dep fired. `partial:true`
  * (combine-family): fires on any single dep, not gated on all deps settling.
+ *
+ * @returns An operator that forwards DATA from any dependency.
+ * @example
+ * ```ts
+ * import { graph, merge } from "@graphrefly/ts";
+ *
+ * const merged = graph().initNode(merge<number>(), [left, right]);
+ * ```
+ * @category operators
  */
 declare function merge<T>(): Operator<T, T>;
 /**
@@ -321,6 +398,17 @@ declare function merge<T>(): Operator<T, T>;
  * source terminates. `completeWhenDepsComplete:false + terminalAsRealInput:true`: the fn fires on
  * the source COMPLETE (reading `terminal===true`) and emits the accumulator + COMPLETE. An empty
  * source emits the seed (RxJS parity). A source ERROR auto-forwards (errorWhenDepsError default).
+ *
+ * @param reducer - Reducer called with the accumulator and each upstream DATA value.
+ * @param seed - Initial accumulator value emitted if the source completes empty.
+ * @returns An operator that emits one accumulated value when the source completes.
+ * @example
+ * ```ts
+ * import { graph, reduce } from "@graphrefly/ts";
+ *
+ * const total = graph().initNode(reduce((sum: number, value: number) => sum + value, 0), [source]);
+ * ```
+ * @category operators
  */
 declare function reduce<S, T>(reducer: (acc: T, v: S) => T, seed: T): Operator<S, T>;
 /**
@@ -550,10 +638,34 @@ interface Profile {
 /**
  * A state node (L4-Q1): a manual source whose `.set(v)` is `node.down([[DATA, v]])` sugar.
  * Extends the substrate Node so it is usable as a dep AND carries the graph-layer `.set`.
+ *
+ * @example
+ * ```ts
+ * import { graph } from "@graphrefly/ts";
+ *
+ * const count = graph().state(0);
+ * count.set(1);
+ * ```
+ * @category graph
  */
 declare class StateNode<T> extends Node<T> {
     set(v: T): void;
 }
+/**
+ * Own a single graph-local topology, lifecycle, inspection index, and dispatcher boundary.
+ *
+ * @example
+ * ```ts
+ * import { graph } from "@graphrefly/ts";
+ *
+ * const g = graph({ name: "counter" });
+ * const count = g.state(0, { name: "count" });
+ * const doubled = g.derived([count], ([value]) => value * 2, { name: "doubled" });
+ * ```
+ * @remarks **Graph-local:** Cross-graph dependencies require a wire bridge; direct deps stay inside
+ *   one graph ownership domain.
+ * @category graph
+ */
 declare class Graph {
     readonly name?: string;
     private readonly _dispatcher;
@@ -662,7 +774,22 @@ declare class Graph {
     private _checkpoint;
     private _checkpointNode;
 }
-/** Construct a Graph (default global dispatcher; L4-Q4). */
+/**
+ * Construct a graph with graph-local topology, lifecycle, and inspection ownership.
+ *
+ * @param opts - Optional graph name, dispatcher, versioning policy, environment drivers, and
+ *   profiling switch.
+ * @returns A `Graph` instance whose sugar methods create graph-registered nodes.
+ * @example
+ * ```ts
+ * import { graph } from "@graphrefly/ts";
+ *
+ * const g = graph({ name: "counter" });
+ * const count = g.state(0, { name: "count" });
+ * const doubled = g.derived([count], ([value]) => value * 2);
+ * ```
+ * @category graph
+ */
 declare function graph(opts?: GraphOptions): Graph;
 
 export { type ValveOpts as $, type GraphRestoreDescriptorContext as A, type GraphRestoreEntry as B, type GraphRestoreRegistry as C, type DefineOpts as D, type EffectFn as E, type NormalizedGraphTopologyNode as F, GRAPH_BLUEPRINT_VERSION as G, type NormalizedGraphTopologySnapshot as H, type ObserveEventEquals as I, type ObservePredicate as J, type ObserveStream as K, type Operator as L, type RestoreRegistryEntry as M, type NodeProfile as N, type ObserveEvent as O, type Profile as P, StateNode as Q, type RestoreGraphOptions as R, type SettleOpts as S, type SugarOpts as T, type TapObserver as U, type TopologyEvent as V, type TopologyEventKind as W, type TopologyGroup as X, type TopologyGroupOptions as Y, type TopologyGroupReleaseOptions as Z, type TopologyStream as _, type Definition as a, canonicalTopologyBytes as a0, canonicalTopologyJson as a1, catchError as a2, coalesceObserve as a3, defaultRestoreRegistry as a4, define as a5, distinctUntilChanged as a6, elementAt as a7, filter as a8, filterObserve as a9, valve as aA, withBlueprintHash as aB, withBlueprintProvenance as aC, find as aa, first as ab, graph as ac, graphBlueprintDiagnostics as ad, initNode as ae, last as af, map as ag, mapRestoreDescriptor as ah, merge as ai, normalizeTopology as aj, onFirstData as ak, pairwise as al, reduce as am, rescue as an, restoreGraph as ao, restoreRegistry as ap, scan as aq, settle as ar, skip as as, stateRestoreDescriptor as at, take as au, takeRestoreDescriptor as av, takeWhile as aw, tap as ax, tapFirst as ay, timerRestoreDescriptor as az, type DerivedFn as b, GRAPH_CHECKPOINT_VERSION as c, Graph as d, type GraphBlueprint as e, type GraphBlueprintDiagnosticCode as f, type GraphBlueprintDiagnosticIssue as g, type GraphBlueprintDiagnostics as h, type GraphBlueprintHash as i, type GraphBlueprintHashInput as j, type GraphBlueprintHashOptions as k, type GraphBlueprintJson as l, type GraphBlueprintOptions as m, type GraphBlueprintProvenance as n, type GraphCheckpoint as o, type GraphCheckpointEdge as p, type GraphCheckpointFactory as q, type GraphCheckpointJson as r, type GraphCheckpointMount as s, type GraphCheckpointNode as t, type GraphCheckpointTerminal as u, type GraphCheckpointValue as v, type GraphCheckpointVersion as w, type GraphOptions as x, type GraphRestoreDefinition as y, type GraphRestoreDescriptor as z };