@graphrefly/graphrefly 0.23.0 → 0.24.0

package/dist/{meta-3QjzotRv.d.ts → meta-CnkLA_43.d.ts}

@@ -1,4 +1,4 @@
-import { v as NodeDescribeKind, N as Node, A as Actor } from './node-C7PD3sn9.js';
+import { v as NodeDescribeKind, N as Node, A as Actor } from './node-B-f-Lu-k.js';
 
 /**
  * JSON-shaped slice of a node for `Graph.describe()`

package/dist/{meta-B-Lbs4-O.d.cts → meta-DWbkoq1s.d.cts}

@@ -1,4 +1,4 @@
-import { v as NodeDescribeKind, N as Node, A as Actor } from './node-C7PD3sn9.cjs';
+import { v as NodeDescribeKind, N as Node, A as Actor } from './node-B-f-Lu-k.cjs';
 
 /**
  * JSON-shaped slice of a node for `Graph.describe()`

package/dist/{node-C7PD3sn9.d.cts → node-B-f-Lu-k.d.cts}

@@ -559,7 +559,11 @@ declare function accessHintForGuard(guard: NodeGuard): string;
  * contract. See SESSION-foundation-redesign.md §§1–10 for design history.
  */
 
-/** Lifecycle status of a node (GRAPHREFLY-SPEC §2.2). */
+/**
+ * Lifecycle status of a node.
+ *
+ * @see GRAPHREFLY-SPEC.md §2.2
+ */
 type NodeStatus = "sentinel" | "pending" | "dirty" | "settled" | "resolved" | "completed" | "errored";
 /** Callback that receives downstream message batches. */
 type NodeSink = (messages: Messages) => void;
@@ -1083,37 +1087,35 @@ declare class NodeImpl<T = unknown> implements Node<T> {
     private _frameBatch;
     /**
      * @internal The unified dispatch waist — one call = one wave.
+     * See `GRAPHREFLY-SPEC.md` §1.3.1 for protocol context — the stages
+     * below are the implementation order.
      *
      * Pipeline stages, in order:
      *
-     *   1. Early-return on empty batch.
-     *   2. Terminal filter — post-COMPLETE/ERROR only TEARDOWN/INVALIDATE
+     *   1. Terminal filter — post-COMPLETE/ERROR only TEARDOWN/INVALIDATE
      *      still propagate so graph teardown and cache-clear still work.
-     *   3. Tier sort (stable) — the batch can be in any order when it
+     *   2. Tier sort (stable) — the batch can be in any order when it
      *      arrives; the walker downstream (`downWithBatch`) assumes
      *      ascending tier monotone, and so does `_updateState`'s tier-3
      *      slice walk. This is the single source of truth for ordering.
-     *   4. Synthetic DIRTY prefix — if a tier-3 payload is present, no
+     *   3. Synthetic DIRTY prefix — if a tier-3 payload is present, no
      *      DIRTY is already in the batch, and the node isn't already in
      *      `"dirty"` status, prepend `[DIRTY]` after any tier-0 START
      *      entries. Guarantees spec §1.3.1 (DIRTY precedes DATA within
      *      the same batch) uniformly across every entry point.
-     *   5. PAUSE/RESUME lock bookkeeping (C0) — update `_pauseLocks`,
+     *   4. PAUSE/RESUME lock bookkeeping (C0) — update `_pauseLocks`,
      *      derive `_paused`, filter unknown-lockId RESUME, replay
      *      bufferAll buffer on final lock release.
-     *   6. Meta TEARDOWN fan-out — notify meta children before
+     *   5. Meta TEARDOWN fan-out — notify meta children before
      *      `_updateState`'s TEARDOWN branch calls `_deactivate`. Hoisted
      *      out of the walk to keep `_updateState` re-entrance-free.
-     *   7. `_updateState` — walk the batch in tier order, advancing
+     *   6. `_updateState` — walk the batch in tier order, advancing
      *      `_cached` / `_status` / `_versioning` and running equals
      *      substitution on tier-3 DATA (§3.5.1). Returns
      *      `{finalMessages, equalsError?}`.
-     *   8. `downWithBatch` dispatch (or bufferAll capture if paused with
+     *   7. `downWithBatch` dispatch (or bufferAll capture if paused with
      *      `pausable: "resumeAll"`).
-     *   9. Recursive ERROR emission if equals threw mid-walk.
-     *
-     * `node.down` / `node.emit` / `actions.down` / `actions.emit` all
-     * converge here — the unified `_emit` waist (spec §1.3.1).
+     *   8. Recursive ERROR emission if equals threw mid-walk.
      */
     _emit(messages: Messages): void;
     /**

package/dist/{node-C7PD3sn9.d.ts → node-B-f-Lu-k.d.ts}

@@ -559,7 +559,11 @@ declare function accessHintForGuard(guard: NodeGuard): string;
  * contract. See SESSION-foundation-redesign.md §§1–10 for design history.
  */
 
-/** Lifecycle status of a node (GRAPHREFLY-SPEC §2.2). */
+/**
+ * Lifecycle status of a node.
+ *
+ * @see GRAPHREFLY-SPEC.md §2.2
+ */
 type NodeStatus = "sentinel" | "pending" | "dirty" | "settled" | "resolved" | "completed" | "errored";
 /** Callback that receives downstream message batches. */
 type NodeSink = (messages: Messages) => void;
@@ -1083,37 +1087,35 @@ declare class NodeImpl<T = unknown> implements Node<T> {
     private _frameBatch;
     /**
      * @internal The unified dispatch waist — one call = one wave.
+     * See `GRAPHREFLY-SPEC.md` §1.3.1 for protocol context — the stages
+     * below are the implementation order.
      *
      * Pipeline stages, in order:
      *
-     *   1. Early-return on empty batch.
-     *   2. Terminal filter — post-COMPLETE/ERROR only TEARDOWN/INVALIDATE
+     *   1. Terminal filter — post-COMPLETE/ERROR only TEARDOWN/INVALIDATE
      *      still propagate so graph teardown and cache-clear still work.
-     *   3. Tier sort (stable) — the batch can be in any order when it
+     *   2. Tier sort (stable) — the batch can be in any order when it
      *      arrives; the walker downstream (`downWithBatch`) assumes
      *      ascending tier monotone, and so does `_updateState`'s tier-3
      *      slice walk. This is the single source of truth for ordering.
-     *   4. Synthetic DIRTY prefix — if a tier-3 payload is present, no
+     *   3. Synthetic DIRTY prefix — if a tier-3 payload is present, no
      *      DIRTY is already in the batch, and the node isn't already in
      *      `"dirty"` status, prepend `[DIRTY]` after any tier-0 START
      *      entries. Guarantees spec §1.3.1 (DIRTY precedes DATA within
      *      the same batch) uniformly across every entry point.
-     *   5. PAUSE/RESUME lock bookkeeping (C0) — update `_pauseLocks`,
+     *   4. PAUSE/RESUME lock bookkeeping (C0) — update `_pauseLocks`,
      *      derive `_paused`, filter unknown-lockId RESUME, replay
      *      bufferAll buffer on final lock release.
-     *   6. Meta TEARDOWN fan-out — notify meta children before
+     *   5. Meta TEARDOWN fan-out — notify meta children before
      *      `_updateState`'s TEARDOWN branch calls `_deactivate`. Hoisted
      *      out of the walk to keep `_updateState` re-entrance-free.
-     *   7. `_updateState` — walk the batch in tier order, advancing
+     *   6. `_updateState` — walk the batch in tier order, advancing
      *      `_cached` / `_status` / `_versioning` and running equals
      *      substitution on tier-3 DATA (§3.5.1). Returns
      *      `{finalMessages, equalsError?}`.
-     *   8. `downWithBatch` dispatch (or bufferAll capture if paused with
+     *   7. `downWithBatch` dispatch (or bufferAll capture if paused with
      *      `pausable: "resumeAll"`).
-     *   9. Recursive ERROR emission if equals threw mid-walk.
-     *
-     * `node.down` / `node.emit` / `actions.down` / `actions.emit` all
-     * converge here — the unified `_emit` waist (spec §1.3.1).
+     *   8. Recursive ERROR emission if equals threw mid-walk.
      */
     _emit(messages: Messages): void;
     /**

package/dist/{observable-axpzv1K2.d.cts → observable-DBnrwcar.d.cts}

@@ -1,5 +1,5 @@
 import { Observable } from 'rxjs';
-import { N as Node, t as Messages } from './node-C7PD3sn9.cjs';
+import { N as Node, t as Messages } from './node-B-f-Lu-k.cjs';
 
 /** Options for {@link toObservable}. */
 type ToObservableOptions = {

package/dist/{observable-EyO-moQY.d.ts → observable-uP-wy_uK.d.ts}

@@ -1,5 +1,5 @@
 import { Observable } from 'rxjs';
-import { N as Node, t as Messages } from './node-C7PD3sn9.js';
+import { N as Node, t as Messages } from './node-B-f-Lu-k.js';
 
 /** Options for {@link toObservable}. */
 type ToObservableOptions = {

package/dist/patterns/reactive-layout/index.cjs

@@ -1954,37 +1954,35 @@ var NodeImpl = class _NodeImpl {
   // --- Emit pipeline ---
   /**
    * @internal The unified dispatch waist — one call = one wave.
+   * See `GRAPHREFLY-SPEC.md` §1.3.1 for protocol context — the stages
+   * below are the implementation order.
    *
    * Pipeline stages, in order:
    *
-   *   1. Early-return on empty batch.
-   *   2. Terminal filter — post-COMPLETE/ERROR only TEARDOWN/INVALIDATE
+   *   1. Terminal filter — post-COMPLETE/ERROR only TEARDOWN/INVALIDATE
    *      still propagate so graph teardown and cache-clear still work.
-   *   3. Tier sort (stable) — the batch can be in any order when it
+   *   2. Tier sort (stable) — the batch can be in any order when it
    *      arrives; the walker downstream (`downWithBatch`) assumes
    *      ascending tier monotone, and so does `_updateState`'s tier-3
    *      slice walk. This is the single source of truth for ordering.
-   *   4. Synthetic DIRTY prefix — if a tier-3 payload is present, no
+   *   3. Synthetic DIRTY prefix — if a tier-3 payload is present, no
    *      DIRTY is already in the batch, and the node isn't already in
    *      `"dirty"` status, prepend `[DIRTY]` after any tier-0 START
    *      entries. Guarantees spec §1.3.1 (DIRTY precedes DATA within
    *      the same batch) uniformly across every entry point.
-   *   5. PAUSE/RESUME lock bookkeeping (C0) — update `_pauseLocks`,
+   *   4. PAUSE/RESUME lock bookkeeping (C0) — update `_pauseLocks`,
    *      derive `_paused`, filter unknown-lockId RESUME, replay
    *      bufferAll buffer on final lock release.
-   *   6. Meta TEARDOWN fan-out — notify meta children before
+   *   5. Meta TEARDOWN fan-out — notify meta children before
    *      `_updateState`'s TEARDOWN branch calls `_deactivate`. Hoisted
    *      out of the walk to keep `_updateState` re-entrance-free.
-   *   7. `_updateState` — walk the batch in tier order, advancing
+   *   6. `_updateState` — walk the batch in tier order, advancing
    *      `_cached` / `_status` / `_versioning` and running equals
    *      substitution on tier-3 DATA (§3.5.1). Returns
    *      `{finalMessages, equalsError?}`.
-   *   8. `downWithBatch` dispatch (or bufferAll capture if paused with
+   *   7. `downWithBatch` dispatch (or bufferAll capture if paused with
    *      `pausable: "resumeAll"`).
-   *   9. Recursive ERROR emission if equals threw mid-walk.
-   *
-   * `node.down` / `node.emit` / `actions.down` / `actions.emit` all
-   * converge here — the unified `_emit` waist (spec §1.3.1).
+   *   8. Recursive ERROR emission if equals threw mid-walk.
    */
   _emit(messages) {
     if (messages.length === 0) return;