@zeix/cause-effect 1.0.2 → 1.1.1

package/{skills → .claude/skills}/cause-effect/references/api-facts.md

@@ -139,22 +139,38 @@ const results = createTask(async (prev, signal) => {
 ```
 
 **`Slot` is a property descriptor**
-- Has `get`, `set`, `configurable`, `enumerable` fields
-- Can be passed directly to `Object.defineProperty()`:
+- Has `get`, `set`, `configurable`, `enumerable` fields — pass directly to `Object.defineProperty()`
+- Delegates reads and writes to a swappable backing signal; use `replace(nextSignal)` to swap
+- Is a forwarding layer, not a value owner — has no `update()` method
 
 ```typescript
-const nameSlot = createSlot(store, 'name')
+const nameState = createState('Alice')
+const nameSlot = createSlot(nameState)
 Object.defineProperty(element, 'name', nameSlot)
 ```
 </callback_patterns>
 
 <match_helper>
-`match` reads one or more Sensor/Task signals and routes to `ok` or `nil` based on whether
-all signals have a value. Use it to safely handle the unset state without try/catch:
+`match` reads one or more Sensor/Task signals and routes to `ok`, `nil`, or `err` based on
+whether all signals have a value. Use it to safely handle the unset state without try/catch.
+
+**Single-signal form** — `ok` receives the value directly, `err` receives a single `Error`:
 
 ```typescript
 import { match } from '@zeix/cause-effect'
 
+createEffect(() => {
+  match(task, {
+    ok:  data  => render(data),
+    nil: ()    => showSpinner(),
+    err: error => showError(error),
+  })
+})
+```
+
+**Tuple form** — for two or more signals; `ok` receives a typed tuple, `err` an `Error[]`:
+
+```typescript
 createEffect(() => {
   match([task, sensor], {
     ok:  ([taskResult, sensorValue]) => render(taskResult, sensorValue),
@@ -163,8 +179,8 @@ createEffect(() => {
 })
 ```
 
-Read signals you care about eagerly inside `match`'s array — not inside individual branches.
-See `non-obvious-behaviors.md → conditional-reads-delay-watched` for why.
+Read all signals you care about eagerly in the signals argument — not inside individual
+branches. See `non-obvious-behaviors.md → conditional-reads-delay-watched` for why.
 </match_helper>
 
 <lifecycle_summary>

package/{skills → .claude/skills}/cause-effect/references/non-obvious-behaviors.md

@@ -70,8 +70,8 @@ fires on the first effect run:
 // Bad — `derived` is only read after `task` resolves to `ok`
 // `derived.watched` does not fire until the task has a value
 createEffect(() => {
-  match([task], {
-    ok: ([result]) => render(derived.get(), result),
+  match(task, {
+    ok: result => render(derived.get(), result),
     nil: () => showSpinner(),
   })
 })
@@ -179,8 +179,8 @@ createEffect(() => {
 
 // Correct — match handles the nil (unset) case explicitly
 createEffect(() => {
-  match([tick], {
-    ok:  ([timestamp]) => console.log('tick:', timestamp),
+  match(tick, {
+    ok:  timestamp => console.log('tick:', timestamp),
     nil: () => console.log('waiting for first tick…'),
   })
 })

package/{skills → .claude/skills}/cause-effect/references/signal-types.md

@@ -115,12 +115,13 @@ const dispose = createScope(() => {
 - You want property access (`element.name`) to participate in the reactive graph
 
 **Key facts:**
-- Has `get`, `set`, `configurable`, and `enumerable` fields
-- Can be passed directly to `Object.defineProperty`
-- Backed by a `State` internally
+- Has `get`, `set`, `configurable`, and `enumerable` fields — pass directly to `Object.defineProperty`
+- Delegates to a swappable backing signal (any signal type); use `replace(nextSignal)` to swap
+- Forwarding layer only — has no `update()` method
 
 ```typescript
-const nameSlot = createSlot(store, 'name')
+const nameState = createState('Alice')
+const nameSlot = createSlot(nameState)
 Object.defineProperty(element, 'name', nameSlot)
 ```
 </Slot>
@@ -241,9 +242,20 @@ Sensor and Task start unset. Use `match` to handle all states in one expression:
 
 ```typescript
 createEffect(() => {
-  match([task], {
-    ok: ([data]) => renderData(data),
-    err: ([error]) => renderError(error),
+  match(task, {
+    ok:  data  => renderData(data),
+    err: error => renderError(error),
+    nil: ()    => renderSpinner(),
+  })
+})
+```
+
+For two or more signals, use the tuple form — `ok` receives a typed tuple:
+
+```typescript
+createEffect(() => {
+  match([task, sensor], {
+    ok:  ([data, pos]) => render(data, pos),
     nil: () => renderSpinner(),
   })
 })

package/{skills → .claude/skills}/cause-effect-dev/references/api-facts.md

@@ -72,11 +72,13 @@ const doubled = createMemo((prev) => {
 ```
 
 **`Slot` is a property descriptor**
-- Has `get`, `set`, `configurable`, `enumerable` fields
-- Can be passed directly to `Object.defineProperty()`:
+- Has `get`, `set`, `configurable`, `enumerable` fields — pass directly to `Object.defineProperty()`
+- Delegates reads and writes to a swappable backing signal; use `replace(nextSignal)` to swap
+- Is a forwarding layer, not a value owner — has no `update()` method
 
 ```typescript
-const slot = createSlot(store, 'name')
+const nameState = createState('Alice')
+const slot = createSlot(nameState)
 Object.defineProperty(element, 'name', slot)
 ```
 

package/{skills → .claude/skills}/cause-effect-dev/references/non-obvious-behaviors.md

@@ -55,8 +55,8 @@ Read all signals you care about eagerly — before any conditional logic — to
 // Bad — `derived` is only read after `task` resolves to `ok`
 // `derived.watched` does not fire until the task has a value
 createEffect(() => {
-  match([task], {
-    ok: ([result]) => render(derived.get(), result),
+  match(task, {
+    ok: result => render(derived.get(), result),
     nil: () => showSpinner(),
   })
 })
@@ -149,8 +149,8 @@ createEffect(() => {
 
 // Correct — match handles the nil (unset) case explicitly
 createEffect(() => {
-  match([sensor], {
-    ok: ([timestamp]) => console.log(timestamp),
+  match(sensor, {
+    ok: timestamp => console.log(timestamp),
     nil: () => console.log('waiting for first value…'),
   })
 })

package/CHANGELOG.md

@@ -1,5 +1,22 @@
 # Changelog
 
+## 1.1.1
+
+### Fixed
+
+- **`Slot.set()` now forwards through Slot-to-Slot chains**: Previously, writing to a Slot whose backing signal was itself a Slot threw `ReadonlySignalError` because `isMutableSignal` does not include `Slot` (by design — a Slot wrapping a read-only signal is not mutable). `set()` now recursively delegates to the next Slot in the chain, allowing the terminal backing signal to determine write permissions. Chains of arbitrary depth are resolved correctly.
+
+## 1.1.0
+
+### Added
+
+- **Single-signal overload for `match()`**: `match(signal, handlers)` now accepts a bare signal (not wrapped in an array). The `ok` handler receives the resolved value directly as `(value: T)`, and `err` receives a single `Error` rather than `readonly Error[]`. The existing tuple form is unchanged. This eliminates the boilerplate of wrapping a single source in `[source]`, destructuring `values[0]` in `ok`, and unwrapping `errors[0]!` in `err`.
+- **`SingleMatchHandlers<T>` type**: New exported type that describes the handler object for the single-signal overload. Counterpart to the existing `MatchHandlers<T>` for tuple usage.
+
+### Changed
+
+- **Async handler documentation**: Added `@remarks` to the `match()` JSDoc and an expanded section in `README.md` clarifying that async `ok`/`err` handlers are intended for external side effects only (logging, DOM writes, analytics). Any async work that needs to drive reactive state should use a `Task` node, which receives an `AbortSignal` and is auto-cancelled on re-run. Documents the known limitation that rejected async handlers from stale (superseded) runs still call `err`, since the library cannot cancel operations it did not initiate.
+
 ## 1.0.2
 
 ### Added

package/GUIDE.md

@@ -184,10 +184,10 @@ Use `match()` inside effects to handle all states declaratively:
 
 ```ts
 createEffect(() => {
-  match([user], {
-    ok: ([data]) => console.log('User:', data),
+  match(user, {
+    ok: data => console.log('User:', data),
     nil: () => console.log('Loading...'),
-    err: (errors) => console.error(errors[0])
+    err: error => console.error(error)
   })
 })
 ```

package/README.md

@@ -1,6 +1,6 @@
 # Cause & Effect
 
-Version 1.0.2
+Version 1.1.1
 
 **Cause & Effect** is a reactive state management primitives library for TypeScript. It provides the foundational building blocks for managing complex, dynamic, composite, and asynchronous state — correctly and performantly — in a unified signal graph.
 
@@ -392,14 +392,40 @@ const userData = createTask(async (_, abort) => {
 })
 
 createEffect(() => {
-  match([userData], {
-    ok: ([user]) => console.log('User:', user),
+  match(userData, {
+    ok: user => console.log('User:', user),
     nil: () => console.log('Loading...'),
-    err: errors => console.error(errors[0])
+    err: error => console.error(error)
   })
 })
 ```
 
+**When to make a handler async.** The `ok` (and `err`) handler may return a `Promise`. Use this for *external* side effects whose result does not need to drive reactive state — sending analytics, writing to IndexedDB, triggering a toast notification, or any fire-and-forget call. A cleanup function returned by the resolved Promise is registered and called synchronously before the next re-run.
+
+**Do not set signal state inside an async handler.** If the async result needs to update the graph, model it as a `Task` instead. `Task` receives an `AbortSignal`, is auto-cancelled when its dependencies change, and exposes its pending / resolved / error states as first-class reactive values that compose naturally with `nil` and `err`.
+
+```js
+// ✗ Don't: async handler that writes back into the graph
+createEffect(() => match(trigger, {
+  ok: async () => {
+    const data = await fetch('/api/data').then(r => r.json())
+    result.set(data) // ← side-channel write, not tracked, no cancellation
+  }
+}))
+
+// ✓ Do: derive the async value as a Task, read it in match()
+const result = createTask(async (_, signal) =>
+  fetch('/api/data', { signal }).then(r => r.json()))
+
+createEffect(() => match(result, {
+  ok: data => render(data),
+  nil: () => showSpinner(),
+  err: e => showError(e)
+}))
+```
+
+**Stale-run rejections still reach `err`.** When a signal changes and the effect re-runs, the in-flight async handler from the previous run cannot be cancelled (the library did not initiate the underlying operation). If that stale operation eventually rejects, `err` will be called even though a newer run is already active. This is another reason to keep async handlers free of state writes — routing errors to `err` is safe when `err` is a pure side effect (logging, displaying a notification), but it becomes incorrect if `err` calls `.set()` on a signal that run 2 has already updated.
+
 ### Utilities
 
 Polymorphic factories and type predicates for generic and library-author code.

package/index.dev.js

@@ -1229,10 +1229,14 @@ function createEffect(fn) {
   runEffect(node);
   return dispose;
 }
-function match(signals, handlers) {
+function match(signalOrSignals, handlers) {
   if (!activeOwner)
     throw new RequiredOwnerError("match");
-  const { ok, err = console.error, nil } = handlers;
+  const isSingle = !Array.isArray(signalOrSignals);
+  const signals = isSingle ? [signalOrSignals] : signalOrSignals;
+  const { nil } = handlers;
+  const ok = isSingle ? (values2) => handlers.ok(values2[0]) : (values2) => handlers.ok(values2);
+  const err = isSingle && handlers.err ? (errors2) => handlers.err(errors2[0]) : handlers.err ?? console.error;
   let errors;
   let pending = false;
   const values = new Array(signals.length);
@@ -1603,6 +1607,8 @@ function createSlot(initialSignal, options) {
     return node.value;
   };
   const set = (next) => {
+    if (isSlot(delegated))
+      return delegated.set(next);
     if (!isMutableSignal(delegated))
       throw new ReadonlySignalError(TYPE_SLOT);
     validateSignalValue(TYPE_SLOT, next, guard);

package/index.js

@@ -1 +1 @@
-function g($){return typeof $==="function"}function o($){return g($)&&$.constructor.name==="AsyncFunction"}function X$($){return g($)&&$.constructor.name!=="AsyncFunction"}function f($,J){return Object.prototype.toString.call($)===`[object ${J}]`}function E($){return f($,"Object")}function f$($,J=(z)=>z!=null){return Array.isArray($)&&$.every(J)}function D$($){return typeof $==="string"?`"${$}"`:!!$&&typeof $==="object"?JSON.stringify($):String($)}class Z$ extends Error{constructor($){super(`[${$}] Circular dependency detected`);this.name="CircularDependencyError"}}class A$ extends TypeError{constructor($){super(`[${$}] Signal value cannot be null or undefined`);this.name="NullishSignalValueError"}}class i extends Error{constructor($){super(`[${$}] Signal value is unset`);this.name="UnsetSignalValueError"}}class W$ extends TypeError{constructor($,J){super(`[${$}] Signal value ${D$(J)} is invalid`);this.name="InvalidSignalValueError"}}class b$ extends TypeError{constructor($,J){super(`[${$}] Callback ${D$(J)} is invalid`);this.name="InvalidCallbackError"}}class P$ extends Error{constructor($){super(`[${$}] Signal is read-only`);this.name="ReadonlySignalError"}}class G$ extends Error{constructor($){super(`[${$}] Active owner is required`);this.name="RequiredOwnerError"}}class e extends Error{constructor($,J,z){super(`[${$}] Could not add key "${J}"${z?` with value ${JSON.stringify(z)}`:""} because it already exists`);this.name="DuplicateKeyError"}}function K($,J,z){if(J==null)throw new A$($);if(z&&!z(J))throw new W$($,J)}function j$($,J){if(J==null)throw new i($)}function S($,J,z=g){if(!z(J))throw new b$($,J)}var c="State",u="Memo",d="Task",s="Sensor",L="List",t="Collection",l="Store",r="Slot",p=0,$$=1,P=2,U$=4,b=8,m=null,_=null,C$=[],R=0,_$=!1,k=($,J)=>$===J,L$=($,J)=>!1;function g$($,J){let z=J.sourcesTail;if(z){let X=J.sources;while(X){if(X===$)return!0;if(X===z)break;X=X.nextSource}}return!1}function F($,J){let z=J.sourcesTail;if(z?.source===$)return;let X=null,j=J.flags&U$;if(j){if(X=z?z.nextSource:J.sources,X?.source===$){J.sourcesTail=X;return}}let B=$.sinksTail;if(B?.sink===J&&(!j||g$(B,J)))return;let D={source:$,sink:J,nextSource:X,prevSink:B,nextSink:null};if(J.sourcesTail=$.sinksTail=D,z)z.nextSource=D;else J.sources=D;if(B)B.nextSink=D;else $.sinks=D}function k$($){let{source:J,nextSource:z,nextSink:X,prevSink:j}=$;if(X)X.prevSink=j;else J.sinksTail=j;if(j)j.nextSink=X;else J.sinks=X;if(!J.sinks){if(J.stop)J.stop(),J.stop=void 0;if("sources"in J&&J.sources){let B=J;B.sourcesTail=null,H$(B)}}return z}function H$($){let J=$.sourcesTail,z=J?J.nextSource:$.sources;while(z)z=k$(z);if(J)J.nextSource=null;else $.sources=null}function x($,J=P){let z=$.flags;if("sinks"in $){if((z&(P|$$))>=J)return;if($.flags=z|J,"controller"in $&&$.controller)$.controller.abort(),$.controller=void 0;for(let X=$.sinks;X;X=X.nextSink)x(X.sink,$$)}else{if((z&(P|$$))>=J)return;let X=z&(P|$$);if($.flags=J,!X)C$.push($)}}function N$($,J){if($.equals($.value,J))return;$.value=J;for(let z=$.sinks;z;z=z.nextSink)x(z.sink);if(R===0)I()}function J$($,J){if(!$.cleanup)$.cleanup=J;else if(Array.isArray($.cleanup))$.cleanup.push(J);else $.cleanup=[$.cleanup,J]}function K$($){if(!$.cleanup)return;if(Array.isArray($.cleanup))for(let J=0;J<$.cleanup.length;J++)$.cleanup[J]();else $.cleanup();$.cleanup=null}function v$($){let J=m;m=$,$.sourcesTail=null,$.flags=U$;let z=!1;try{let X=$.fn($.value);if($.error||!$.equals(X,$.value))$.value=X,$.error=void 0,z=!0}catch(X){z=!0,$.error=X instanceof Error?X:Error(String(X))}finally{m=J,H$($)}if(z){for(let X=$.sinks;X;X=X.nextSink)if(X.sink.flags&$$)X.sink.flags|=P}$.flags=p}function c$($){$.controller?.abort();let J=new AbortController;$.controller=J,$.error=void 0;let z=m;m=$,$.sourcesTail=null,$.flags=U$;let X;try{X=$.fn($.value,J.signal)}catch(j){$.controller=void 0,$.error=j instanceof Error?j:Error(String(j));return}finally{m=z,H$($)}X.then((j)=>{if(J.signal.aborted)return;if($.controller=void 0,$.error||!$.equals(j,$.value)){$.value=j,$.error=void 0;for(let B=$.sinks;B;B=B.nextSink)x(B.sink);if(R===0)I()}},(j)=>{if(J.signal.aborted)return;$.controller=void 0;let B=j instanceof Error?j:Error(String(j));if(!$.error||B.name!==$.error.name||B.message!==$.error.message){$.error=B;for(let D=$.sinks;D;D=D.nextSink)x(D.sink);if(R===0)I()}}),$.flags=p}function T$($){K$($);let J=m,z=_;m=_=$,$.sourcesTail=null,$.flags=U$;try{let X=$.fn();if(typeof X==="function")J$($,X)}finally{m=J,_=z,H$($)}$.flags=p}function w($){if($.flags&$$)for(let J=$.sources;J;J=J.nextSource){if("fn"in J.source)w(J.source);if($.flags&P)break}if($.flags&U$)throw new Z$("controller"in $?d:("value"in $)?u:"Effect");if($.flags&P)if("controller"in $)c$($);else if("value"in $)v$($);else T$($);else $.flags=p}function I(){if(_$)return;_$=!0;try{for(let $=0;$<C$.length;$++){let J=C$[$];if(J.flags&(P|$$))w(J)}C$.length=0}finally{_$=!1}}function z$($){R++;try{$()}finally{if(R--,R===0)I()}}function v($){let J=m;m=null;try{return $()}finally{m=J}}function u$($){let J=_,z={cleanup:null};_=z;try{let X=$();if(typeof X==="function")J$(z,X);let j=()=>K$(z);if(J)J$(J,j);return j}finally{_=J}}function d$($){let J=_;_=null;try{return $()}finally{_=J}}function y($,J){K(c,$,J?.guard);let z={value:$,sinks:null,sinksTail:null,equals:J?.equals??k,guard:J?.guard};return{[Symbol.toStringTag]:c,get(){if(m)F(z,m);return z.value},set(X){K(c,X,z.guard),N$(z,X)},update(X){S(c,X);let j=X(z.value);K(c,j,z.guard),N$(z,j)}}}function V$($){return f($,c)}function n($,J,z){if(Object.is($,J))return!0;if(typeof $!==typeof J)return!1;if($==null||typeof $!=="object"||J==null||typeof J!=="object")return!1;if(!z)z=new WeakSet;if(z.has($)||z.has(J))throw new Z$("isEqual");z.add($),z.add(J);try{let X=Array.isArray($);if(X!==Array.isArray(J))return!1;if(X){let j=$,B=J;if(j.length!==B.length)return!1;for(let D=0;D<j.length;D++)if(!n(j[D],B[D],z))return!1;return!0}if(E($)&&E(J)){let j=Object.keys($),B=Object.keys(J);if(j.length!==B.length)return!1;for(let D of j){if(!(D in J))return!1;if(!n($[D],J[D],z))return!1}return!0}return!1}finally{z.delete($),z.delete(J)}}function O$($,J){if($.length!==J.length)return!1;for(let z=0;z<$.length;z++)if($[z]!==J[z])return!1;return!0}function E$($){let J=0,z=typeof $==="function";return[typeof $==="string"?()=>`${$}${J++}`:z?(X)=>$(X)||String(J++):()=>String(J++),z]}function s$($,J,z,X,j){let B=new WeakSet,D={},M={},C={},N=[],Q=!1,W=new Map;for(let q=0;q<$.length;q++){let Z=z[q],H=$[q];if(Z&&H!==void 0)W.set(Z,H)}let G=new Set;for(let q=0;q<J.length;q++){let Z=J[q];if(Z===void 0)continue;let H=j?X(Z):z[q]??X(Z);if(G.has(H))throw new e(L,H,Z);if(N.push(H),G.add(H),!W.has(H))D[H]=Z,Q=!0;else if(!n(W.get(H),Z,B))M[H]=Z,Q=!0}for(let[q]of W)if(!G.has(q))C[q]=null,Q=!0;if(!Q&&!O$(z,N))Q=!0;return{add:D,change:M,remove:C,newKeys:N,changed:Q}}function Q$($,J){K(L,$,Array.isArray);let z=new Map,X=[],[j,B]=E$(J?.keyConfig),D=()=>X.map((Z)=>z.get(Z)?.get()).filter((Z)=>Z!==void 0),M={fn:D,value:$,flags:P,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:n,error:void 0},C=(Z)=>{let H={};for(let U=0;U<Z.length;U++){let V=Z[U];if(V===void 0)continue;let O=X[U];if(!O)O=j(V),X[U]=O;H[O]=V}return H},N=(Z)=>{let H=!1;for(let U in Z.add){let V=Z.add[U];K(`${L} item for key "${U}"`,V),z.set(U,y(V)),H=!0}if(Object.keys(Z.change).length)z$(()=>{for(let U in Z.change){let V=Z.change[U];K(`${L} item for key "${U}"`,V);let O=z.get(U);if(O)O.set(V)}});for(let U in Z.remove){z.delete(U);let V=X.indexOf(U);if(V!==-1)X.splice(V,1);H=!0}if(H)M.flags|=b;return Z.changed},Q=J?.watched,W=Q?()=>{if(m){if(!M.sinks)M.stop=Q();F(M,m)}}:()=>{if(m)F(M,m)},G=C($);for(let Z in G){let H=G[Z];K(`${L} item for key "${Z}"`,H),z.set(Z,y(H))}M.value=$,M.flags=0;let q={[Symbol.toStringTag]:L,[Symbol.isConcatSpreadable]:!0,*[Symbol.iterator](){for(let Z of X){let H=z.get(Z);if(H)yield H}},get length(){return W(),X.length},get(){if(W(),M.sources){if(M.flags){let Z=M.flags&b;if(M.value=v(D),Z){if(M.flags=P,w(M),M.error)throw M.error}else M.flags=p}}else if(w(M),M.error)throw M.error;return M.value},set(Z){let H=M.flags&P?D():M.value,U=s$(H,Z,X,j,B);if(U.changed){X=U.newKeys,N(U),M.flags|=P;for(let V=M.sinks;V;V=V.nextSink)x(V.sink);if(R===0)I()}},update(Z){q.set(Z(q.get()))},at(Z){let H=X[Z];return H!==void 0?z.get(H):void 0},keys(){return W(),X.values()},byKey(Z){return z.get(Z)},keyAt(Z){return X[Z]},indexOfKey(Z){return X.indexOf(Z)},add(Z){let H=j(Z);if(z.has(H))throw new e(L,H,Z);if(!X.includes(H))X.push(H);K(`${L} item for key "${H}"`,Z),z.set(H,y(Z)),M.flags|=P|b;for(let U=M.sinks;U;U=U.nextSink)x(U.sink);if(R===0)I();return H},remove(Z){let H=typeof Z==="number"?X[Z]:Z;if(H===void 0)return;if(z.delete(H)){let V=typeof Z==="number"?Z:X.indexOf(H);if(V>=0)X.splice(V,1);M.flags|=P|b;for(let O=M.sinks;O;O=O.nextSink)x(O.sink);if(R===0)I()}},replace(Z,H){let U=z.get(Z);if(!U)return;if(K(`${L} item for key "${Z}"`,H),U.get()===H)return;U.set(H),M.flags|=P;for(let V=M.sinks;V;V=V.nextSink)x(V.sink);if(R===0)I()},sort(Z){let U=X.map((V)=>[V,z.get(V)?.get()]).sort(g(Z)?(V,O)=>Z(V[1],O[1]):(V,O)=>String(V[1]).localeCompare(String(O[1]))).map(([V])=>V);if(!O$(X,U)){X=U,M.flags|=P;for(let V=M.sinks;V;V=V.nextSink)x(V.sink);if(R===0)I()}},splice(Z,H,...U){let V=X.length,O=Z<0?Math.max(0,V+Z):Math.min(Z,V),Y=Math.max(0,Math.min(H??Math.max(0,V-Math.max(0,O)),V-O)),A={},T={};for(let h=0;h<Y;h++){let a=O+h,Y$=X[a];if(Y$){let y$=z.get(Y$);if(y$)T[Y$]=y$.get()}}let w$=X.slice(0,O);for(let h of U){let a=j(h);if(z.has(a)&&!(a in T))throw new e(L,a,h);w$.push(a),A[a]=h}w$.push(...X.slice(O+Y));let h$=!!(Object.keys(A).length||Object.keys(T).length);if(h$){N({add:A,change:{},remove:T,changed:h$}),X=w$,M.flags|=P;for(let h=M.sinks;h;h=h.nextSink)x(h.sink);if(R===0)I()}return Object.values(T)},deriveCollection(Z){return x$(q,Z)}};return q}function R$($){return f($,L)}function B$($,J){if(S(u,$,X$),J?.value!==void 0)K(u,J.value,J?.guard);let z={fn:$,value:J?.value,flags:P,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:J?.equals??k,error:void 0,stop:void 0},X=J?.watched,j=X?()=>{if(m){if(!z.sinks)z.stop=X(()=>{if(x(z),R===0)I()});F(z,m)}}:()=>{if(m)F(z,m)};return{[Symbol.toStringTag]:u,get(){if(j(),w(z),z.error)throw z.error;return j$(u,z.value),z.value}}}function S$($){return f($,u)}function q$($,J){if(S(d,$,o),J?.value!==void 0)K(d,J.value,J?.guard);let z={fn:$,value:J?.value,sources:null,sourcesTail:null,sinks:null,sinksTail:null,flags:P,equals:J?.equals??k,controller:void 0,error:void 0,stop:void 0},X=J?.watched,j=X?()=>{if(m){if(!z.sinks)z.stop=X(()=>{if(x(z),R===0)I()});F(z,m)}}:()=>{if(m)F(z,m)};return{[Symbol.toStringTag]:d,get(){if(j(),w(z),z.error)throw z.error;return j$(d,z.value),z.value},isPending(){return!!z.controller},abort(){z.controller?.abort(),z.controller=void 0}}}function p$($){return f($,d)}function x$($,J){S(t,J);let z=o(J),X=new Map,j=[],B=(q)=>{let Z=z?q$(async(H,U)=>{let V=$.byKey(q)?.get();if(V==null)return H;return J(V,U)}):B$(()=>{let H=$.byKey(q)?.get();if(H==null)return;return J(H)});X.set(q,Z)};function D(q){if(!O$(j,q)){let Z=new Set(j),H=new Set(q);for(let U of j)if(!H.has(U))X.delete(U);for(let U of q)if(!Z.has(U))B(U);j=q,N.flags|=b}}function M(){D(Array.from($.keys()));let q=[];for(let Z of j)try{let H=X.get(Z)?.get();if(H!=null)q.push(H)}catch(H){if(!(H instanceof i))throw H}return q}let N={fn:M,value:[],flags:P,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:(q,Z)=>{if(q.length!==Z.length)return!1;for(let H=0;H<q.length;H++)if(q[H]!==Z[H])return!1;return!0},error:void 0};function Q(){if(N.sources){if(N.flags)if(N.value=v(M),N.flags&b){if(N.flags=P,w(N),N.error)throw N.error}else N.flags=p}else if(N.sinks){if(w(N),N.error)throw N.error}else N.value=v(M)}let W=Array.from(v(()=>$.keys()));for(let q of W)B(q);j=W;let G={[Symbol.toStringTag]:t,[Symbol.isConcatSpreadable]:!0,*[Symbol.iterator](){for(let q of j){let Z=X.get(q);if(Z)yield Z}},get length(){if(m)F(N,m);return Q(),j.length},keys(){if(m)F(N,m);return Q(),j.values()},get(){if(m)F(N,m);return Q(),N.value},at(q){let Z=j[q];return Z!==void 0?X.get(Z):void 0},byKey(q){return X.get(q)},keyAt(q){return j[q]},indexOfKey(q){return j.indexOf(q)},deriveCollection(q){return x$(G,q)}};return G}function t$($,J){let z=J?.value??[];if(z.length)K(t,z,Array.isArray);S(t,$,X$);let X=new Map,j=[],B=new Map,[D,M]=E$(J?.keyConfig),C=(Z)=>B.get(Z)??(M?D(Z):void 0),N=J?.createItem??y;function Q(){let Z=[];for(let H of j)try{let U=X.get(H)?.get();if(U!=null)Z.push(U)}catch(U){if(!(U instanceof i))throw U}return Z}let W={fn:Q,value:z,flags:P,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:L$,error:void 0};for(let Z of z){let H=D(Z);X.set(H,N(Z)),B.set(Z,H),j.push(H)}W.value=z,W.flags=P;function G(){if(m){if(!W.sinks)W.stop=$((Z)=>{let{add:H,change:U,remove:V}=Z;if(!H?.length&&!U?.length&&!V?.length)return;let O=!1;z$(()=>{if(H)for(let Y of H){let A=D(Y);if(X.set(A,N(Y)),B.set(Y,A),!j.includes(A))j.push(A);O=!0}if(U)for(let Y of U){let A=C(Y);if(!A)continue;let T=X.get(A);if(T&&V$(T))B.delete(T.get()),T.set(Y),B.set(Y,A)}if(V)for(let Y of V){let A=C(Y);if(!A)continue;B.delete(Y),X.delete(A);let T=j.indexOf(A);if(T!==-1)j.splice(T,1);O=!0}W.flags=P|(O?b:0);for(let Y=W.sinks;Y;Y=Y.nextSink)x(Y.sink)})});F(W,m)}}let q={[Symbol.toStringTag]:t,[Symbol.isConcatSpreadable]:!0,*[Symbol.iterator](){for(let Z of j){let H=X.get(Z);if(H)yield H}},get length(){return G(),j.length},keys(){return G(),j.values()},get(){if(G(),W.sources){if(W.flags){let Z=W.flags&b;if(W.value=v(Q),Z){if(W.flags=P,w(W),W.error)throw W.error}else W.flags=p}}else if(w(W),W.error)throw W.error;return W.value},at(Z){let H=j[Z];return H!==void 0?X.get(H):void 0},byKey(Z){return X.get(Z)},keyAt(Z){return j[Z]},indexOfKey(Z){return j.indexOf(Z)},deriveCollection(Z){return x$(q,Z)}};return q}function l$($){return f($,t)}function r$($){S("Effect",$);let J={fn:$,flags:P,sources:null,sourcesTail:null,cleanup:null},z=()=>{K$(J),J.fn=void 0,J.flags=p,J.sourcesTail=null,H$(J)};if(_)J$(_,z);return T$(J),z}function o$($,J){if(!_)throw new G$("match");let{ok:z,err:X=console.error,nil:j}=J,B,D=!1,M=Array($.length);for(let N=0;N<$.length;N++)try{M[N]=$[N].get()}catch(Q){if(Q instanceof i){D=!0;continue}if(!B)B=[];B.push(Q instanceof Error?Q:Error(String(Q)))}let C;try{if(D)C=j?.();else if(B)C=X(B);else C=z(M)}catch(N){X([N instanceof Error?N:Error(String(N))])}if(typeof C==="function")return C;if(C instanceof Promise){let N=_,Q=new AbortController;J$(N,()=>Q.abort()),C.then((W)=>{if(!Q.signal.aborted&&typeof W==="function")J$(N,W)}).catch((W)=>{X([W instanceof Error?W:Error(String(W))])})}}function i$($,J){if(S(s,$,X$),J?.value!==void 0)K(s,J.value,J?.guard);let z={value:J?.value,sinks:null,sinksTail:null,equals:J?.equals??k,guard:J?.guard,stop:void 0};return{[Symbol.toStringTag]:s,get(){if(m){if(!z.sinks)z.stop=$((X)=>{K(s,X,z.guard),N$(z,X)});F(z,m)}return j$(s,z.value),z.value}}}function n$($){return f($,s)}function a$($,J){let z=E($)||Array.isArray($),X=E(J)||Array.isArray(J);if(!z||!X){let W=!Object.is($,J);return{changed:W,add:W&&X?J:{},change:{},remove:W&&z?$:{}}}let j=new WeakSet,B={},D={},M={},C=!1,N=Object.keys($),Q=Object.keys(J);for(let W of Q)if(W in $){if(!n($[W],J[W],j))D[W]=J[W],C=!0}else B[W]=J[W],C=!0;for(let W of N)if(!(W in J))M[W]=void 0,C=!0;return{add:B,change:D,remove:M,changed:C}}function m$($,J){K(l,$,E);let z=new Map,X=(Q,W)=>{if(K(`${l} for key "${Q}"`,W),Array.isArray(W))z.set(Q,Q$(W));else if(E(W))z.set(Q,m$(W));else z.set(Q,y(W))},j=()=>{let Q={};return z.forEach((W,G)=>{Q[G]=W.get()}),Q},B={fn:j,value:$,flags:P,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:n,error:void 0},D=(Q)=>{let W=!1;for(let G in Q.add)X(G,Q.add[G]),W=!0;if(Object.keys(Q.change).length)z$(()=>{for(let G in Q.change){let q=Q.change[G];K(`${l} for key "${G}"`,q);let Z=z.get(G);if(Z)if(E(q)!==F$(Z))X(G,q),W=!0;else Z.set(q)}});for(let G in Q.remove)z.delete(G),W=!0;if(W)B.flags|=b;return Q.changed},M=J?.watched,C=M?()=>{if(m){if(!B.sinks)B.stop=M();F(B,m)}}:()=>{if(m)F(B,m)};for(let Q of Object.keys($))X(Q,$[Q]);let N={[Symbol.toStringTag]:l,[Symbol.isConcatSpreadable]:!1,*[Symbol.iterator](){for(let Q of Array.from(z.keys())){let W=z.get(Q);if(W)yield[Q,W]}},keys(){return C(),z.keys()},byKey(Q){return z.get(Q)},get(){if(C(),B.sources){if(B.flags){let Q=B.flags&b;if(B.value=v(j),Q){if(B.flags=P,w(B),B.error)throw B.error}else B.flags=p}}else if(w(B),B.error)throw B.error;return B.value},set(Q){let W=B.flags&P?j():B.value,G=a$(W,Q);if(D(G)){B.flags|=P;for(let q=B.sinks;q;q=q.nextSink)x(q.sink);if(R===0)I()}},update(Q){N.set(Q(N.get()))},add(Q,W){if(z.has(Q))throw new e(l,Q,W);X(Q,W),B.flags|=P|b;for(let G=B.sinks;G;G=G.nextSink)x(G.sink);if(R===0)I();return Q},remove(Q){if(z.delete(Q)){B.flags|=P|b;for(let G=B.sinks;G;G=G.nextSink)x(G.sink);if(R===0)I()}}};return new Proxy(N,{get(Q,W){if(W in Q)return Reflect.get(Q,W);if(typeof W!=="symbol")return Q.byKey(W)},has(Q,W){if(W in Q)return!0;return Q.byKey(String(W))!==void 0},ownKeys(Q){return Array.from(Q.keys())},getOwnPropertyDescriptor(Q,W){if(W in Q)return Reflect.getOwnPropertyDescriptor(Q,W);if(typeof W==="symbol")return;let G=Q.byKey(String(W));return G?{enumerable:!0,configurable:!0,writable:!0,value:G}:void 0}})}function F$($){return f($,l)}function e$($,J){return o($)?q$($,J):B$($,J)}function $J($){if(M$($))return $;if($==null)throw new W$("createSignal",$);if(o($))return q$($);if(g($))return B$($);if(f$($))return Q$($);if(E($))return m$($);return y($)}function JJ($){if(I$($))return $;if($==null||g($)||M$($))throw new W$("createMutableSignal",$);if(f$($))return Q$($);if(E($))return m$($);return y($)}function zJ($){return S$($)||p$($)}function M$($){let J=[c,u,d,s,r,L,t,l],z=Object.prototype.toString.call($).slice(8,-1);return J.includes(z)}function I$($){return V$($)||F$($)||R$($)}function XJ($,J){K(r,$,M$);let z=$,X=J?.guard,j={fn:()=>z.get(),value:void 0,flags:P,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:J?.equals??k,error:void 0},B=()=>{if(m)F(j,m);if(w(j),j.error)throw j.error;return j.value},D=(C)=>{if(!I$(z))throw new P$(r);K(r,C,X),z.set(C)},M=(C)=>{K(r,C,M$),z=C,j.flags|=P;for(let N=j.sinks;N;N=N.nextSink)x(N.sink);if(R===0)I()};return{[Symbol.toStringTag]:r,configurable:!0,enumerable:!0,get:B,set:D,replace:M,current:()=>z}}function ZJ($){return f($,r)}export{D$ as valueString,v as untrack,d$ as unown,o$ as match,p$ as isTask,F$ as isStore,V$ as isState,ZJ as isSlot,M$ as isSignal,n$ as isSensor,E as isRecord,f as isObjectOfType,I$ as isMutableSignal,S$ as isMemo,R$ as isList,g as isFunction,n as isEqual,zJ as isComputed,l$ as isCollection,o as isAsyncFunction,q$ as createTask,m$ as createStore,y as createState,XJ as createSlot,$J as createSignal,i$ as createSensor,u$ as createScope,JJ as createMutableSignal,B$ as createMemo,Q$ as createList,r$ as createEffect,e$ as createComputed,t$ as createCollection,z$ as batch,i as UnsetSignalValueError,L$ as SKIP_EQUALITY,G$ as RequiredOwnerError,P$ as ReadonlySignalError,A$ as NullishSignalValueError,W$ as InvalidSignalValueError,b$ as InvalidCallbackError,Z$ as CircularDependencyError};
+function g($){return typeof $==="function"}function l($){return g($)&&$.constructor.name==="AsyncFunction"}function X$($){return g($)&&$.constructor.name!=="AsyncFunction"}function Y($,J){return Object.prototype.toString.call($)===`[object ${J}]`}function E($){return Y($,"Object")}function Y$($,J=(z)=>z!=null){return Array.isArray($)&&$.every(J)}function D$($){return typeof $==="string"?`"${$}"`:!!$&&typeof $==="object"?JSON.stringify($):String($)}class Z$ extends Error{constructor($){super(`[${$}] Circular dependency detected`);this.name="CircularDependencyError"}}class A$ extends TypeError{constructor($){super(`[${$}] Signal value cannot be null or undefined`);this.name="NullishSignalValueError"}}class i extends Error{constructor($){super(`[${$}] Signal value is unset`);this.name="UnsetSignalValueError"}}class j$ extends TypeError{constructor($,J){super(`[${$}] Signal value ${D$(J)} is invalid`);this.name="InvalidSignalValueError"}}class b$ extends TypeError{constructor($,J){super(`[${$}] Callback ${D$(J)} is invalid`);this.name="InvalidCallbackError"}}class P$ extends Error{constructor($){super(`[${$}] Signal is read-only`);this.name="ReadonlySignalError"}}class G$ extends Error{constructor($){super(`[${$}] Active owner is required`);this.name="RequiredOwnerError"}}class e extends Error{constructor($,J,z){super(`[${$}] Could not add key "${J}"${z?` with value ${JSON.stringify(z)}`:""} because it already exists`);this.name="DuplicateKeyError"}}function C($,J,z){if(J==null)throw new A$($);if(z&&!z(J))throw new j$($,J)}function W$($,J){if(J==null)throw new i($)}function S($,J,z=g){if(!z(J))throw new b$($,J)}var c="State",u="Memo",d="Task",t="Sensor",L="List",s="Collection",r="Store",o="Slot",p=0,$$=1,G=2,U$=4,b=8,V=null,_=null,C$=[],O=0,_$=!1,k=($,J)=>$===J,L$=($,J)=>!1;function k$($,J){let z=J.sourcesTail;if(z){let X=J.sources;while(X){if(X===$)return!0;if(X===z)break;X=X.nextSource}}return!1}function x($,J){let z=J.sourcesTail;if(z?.source===$)return;let X=null,W=J.flags&U$;if(W){if(X=z?z.nextSource:J.sources,X?.source===$){J.sourcesTail=X;return}}let B=$.sinksTail;if(B?.sink===J&&(!W||k$(B,J)))return;let D={source:$,sink:J,nextSource:X,prevSink:B,nextSink:null};if(J.sourcesTail=$.sinksTail=D,z)z.nextSource=D;else J.sources=D;if(B)B.nextSink=D;else $.sinks=D}function v$($){let{source:J,nextSource:z,nextSink:X,prevSink:W}=$;if(X)X.prevSink=W;else J.sinksTail=W;if(W)W.nextSink=X;else J.sinks=X;if(!J.sinks){if(J.stop)J.stop(),J.stop=void 0;if("sources"in J&&J.sources){let B=J;B.sourcesTail=null,H$(B)}}return z}function H$($){let J=$.sourcesTail,z=J?J.nextSource:$.sources;while(z)z=v$(z);if(J)J.nextSource=null;else $.sources=null}function F($,J=G){let z=$.flags;if("sinks"in $){if((z&(G|$$))>=J)return;if($.flags=z|J,"controller"in $&&$.controller)$.controller.abort(),$.controller=void 0;for(let X=$.sinks;X;X=X.nextSink)F(X.sink,$$)}else{if((z&(G|$$))>=J)return;let X=z&(G|$$);if($.flags=J,!X)C$.push($)}}function N$($,J){if($.equals($.value,J))return;$.value=J;for(let z=$.sinks;z;z=z.nextSink)F(z.sink);if(O===0)w()}function J$($,J){if(!$.cleanup)$.cleanup=J;else if(Array.isArray($.cleanup))$.cleanup.push(J);else $.cleanup=[$.cleanup,J]}function K$($){if(!$.cleanup)return;if(Array.isArray($.cleanup))for(let J=0;J<$.cleanup.length;J++)$.cleanup[J]();else $.cleanup();$.cleanup=null}function c$($){let J=V;V=$,$.sourcesTail=null,$.flags=U$;let z=!1;try{let X=$.fn($.value);if($.error||!$.equals(X,$.value))$.value=X,$.error=void 0,z=!0}catch(X){z=!0,$.error=X instanceof Error?X:Error(String(X))}finally{V=J,H$($)}if(z){for(let X=$.sinks;X;X=X.nextSink)if(X.sink.flags&$$)X.sink.flags|=G}$.flags=p}function u$($){$.controller?.abort();let J=new AbortController;$.controller=J,$.error=void 0;let z=V;V=$,$.sourcesTail=null,$.flags=U$;let X;try{X=$.fn($.value,J.signal)}catch(W){$.controller=void 0,$.error=W instanceof Error?W:Error(String(W));return}finally{V=z,H$($)}X.then((W)=>{if(J.signal.aborted)return;if($.controller=void 0,$.error||!$.equals(W,$.value)){$.value=W,$.error=void 0;for(let B=$.sinks;B;B=B.nextSink)F(B.sink);if(O===0)w()}},(W)=>{if(J.signal.aborted)return;$.controller=void 0;let B=W instanceof Error?W:Error(String(W));if(!$.error||B.name!==$.error.name||B.message!==$.error.message){$.error=B;for(let D=$.sinks;D;D=D.nextSink)F(D.sink);if(O===0)w()}}),$.flags=p}function T$($){K$($);let J=V,z=_;V=_=$,$.sourcesTail=null,$.flags=U$;try{let X=$.fn();if(typeof X==="function")J$($,X)}finally{V=J,_=z,H$($)}$.flags=p}function I($){if($.flags&$$)for(let J=$.sources;J;J=J.nextSource){if("fn"in J.source)I(J.source);if($.flags&G)break}if($.flags&U$)throw new Z$("controller"in $?d:("value"in $)?u:"Effect");if($.flags&G)if("controller"in $)u$($);else if("value"in $)c$($);else T$($);else $.flags=p}function w(){if(_$)return;_$=!0;try{for(let $=0;$<C$.length;$++){let J=C$[$];if(J.flags&(G|$$))I(J)}C$.length=0}finally{_$=!1}}function z$($){O++;try{$()}finally{if(O--,O===0)w()}}function v($){let J=V;V=null;try{return $()}finally{V=J}}function d$($){let J=_,z={cleanup:null};_=z;try{let X=$();if(typeof X==="function")J$(z,X);let W=()=>K$(z);if(J)J$(J,W);return W}finally{_=J}}function t$($){let J=_;_=null;try{return $()}finally{_=J}}function y($,J){C(c,$,J?.guard);let z={value:$,sinks:null,sinksTail:null,equals:J?.equals??k,guard:J?.guard};return{[Symbol.toStringTag]:c,get(){if(V)x(z,V);return z.value},set(X){C(c,X,z.guard),N$(z,X)},update(X){S(c,X);let W=X(z.value);C(c,W,z.guard),N$(z,W)}}}function V$($){return Y($,c)}function n($,J,z){if(Object.is($,J))return!0;if(typeof $!==typeof J)return!1;if($==null||typeof $!=="object"||J==null||typeof J!=="object")return!1;if(!z)z=new WeakSet;if(z.has($)||z.has(J))throw new Z$("isEqual");z.add($),z.add(J);try{let X=Array.isArray($);if(X!==Array.isArray(J))return!1;if(X){let W=$,B=J;if(W.length!==B.length)return!1;for(let D=0;D<W.length;D++)if(!n(W[D],B[D],z))return!1;return!0}if(E($)&&E(J)){let W=Object.keys($),B=Object.keys(J);if(W.length!==B.length)return!1;for(let D of W){if(!(D in J))return!1;if(!n($[D],J[D],z))return!1}return!0}return!1}finally{z.delete($),z.delete(J)}}function R$($,J){if($.length!==J.length)return!1;for(let z=0;z<$.length;z++)if($[z]!==J[z])return!1;return!0}function E$($){let J=0,z=typeof $==="function";return[typeof $==="string"?()=>`${$}${J++}`:z?(X)=>$(X)||String(J++):()=>String(J++),z]}function s$($,J,z,X,W){let B=new WeakSet,D={},M={},K={},P=[],Q=!1,j=new Map;for(let q=0;q<$.length;q++){let Z=z[q],H=$[q];if(Z&&H!==void 0)j.set(Z,H)}let m=new Set;for(let q=0;q<J.length;q++){let Z=J[q];if(Z===void 0)continue;let H=W?X(Z):z[q]??X(Z);if(m.has(H))throw new e(L,H,Z);if(P.push(H),m.add(H),!j.has(H))D[H]=Z,Q=!0;else if(!n(j.get(H),Z,B))M[H]=Z,Q=!0}for(let[q]of j)if(!m.has(q))K[q]=null,Q=!0;if(!Q&&!R$(z,P))Q=!0;return{add:D,change:M,remove:K,newKeys:P,changed:Q}}function Q$($,J){C(L,$,Array.isArray);let z=new Map,X=[],[W,B]=E$(J?.keyConfig),D=()=>X.map((Z)=>z.get(Z)?.get()).filter((Z)=>Z!==void 0),M={fn:D,value:$,flags:G,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:n,error:void 0},K=(Z)=>{let H={};for(let U=0;U<Z.length;U++){let N=Z[U];if(N===void 0)continue;let R=X[U];if(!R)R=W(N),X[U]=R;H[R]=N}return H},P=(Z)=>{let H=!1;for(let U in Z.add){let N=Z.add[U];C(`${L} item for key "${U}"`,N),z.set(U,y(N)),H=!0}if(Object.keys(Z.change).length)z$(()=>{for(let U in Z.change){let N=Z.change[U];C(`${L} item for key "${U}"`,N);let R=z.get(U);if(R)R.set(N)}});for(let U in Z.remove){z.delete(U);let N=X.indexOf(U);if(N!==-1)X.splice(N,1);H=!0}if(H)M.flags|=b;return Z.changed},Q=J?.watched,j=Q?()=>{if(V){if(!M.sinks)M.stop=Q();x(M,V)}}:()=>{if(V)x(M,V)},m=K($);for(let Z in m){let H=m[Z];C(`${L} item for key "${Z}"`,H),z.set(Z,y(H))}M.value=$,M.flags=0;let q={[Symbol.toStringTag]:L,[Symbol.isConcatSpreadable]:!0,*[Symbol.iterator](){for(let Z of X){let H=z.get(Z);if(H)yield H}},get length(){return j(),X.length},get(){if(j(),M.sources){if(M.flags){let Z=M.flags&b;if(M.value=v(D),Z){if(M.flags=G,I(M),M.error)throw M.error}else M.flags=p}}else if(I(M),M.error)throw M.error;return M.value},set(Z){let H=M.flags&G?D():M.value,U=s$(H,Z,X,W,B);if(U.changed){X=U.newKeys,P(U),M.flags|=G;for(let N=M.sinks;N;N=N.nextSink)F(N.sink);if(O===0)w()}},update(Z){q.set(Z(q.get()))},at(Z){let H=X[Z];return H!==void 0?z.get(H):void 0},keys(){return j(),X.values()},byKey(Z){return z.get(Z)},keyAt(Z){return X[Z]},indexOfKey(Z){return X.indexOf(Z)},add(Z){let H=W(Z);if(z.has(H))throw new e(L,H,Z);if(!X.includes(H))X.push(H);C(`${L} item for key "${H}"`,Z),z.set(H,y(Z)),M.flags|=G|b;for(let U=M.sinks;U;U=U.nextSink)F(U.sink);if(O===0)w();return H},remove(Z){let H=typeof Z==="number"?X[Z]:Z;if(H===void 0)return;if(z.delete(H)){let N=typeof Z==="number"?Z:X.indexOf(H);if(N>=0)X.splice(N,1);M.flags|=G|b;for(let R=M.sinks;R;R=R.nextSink)F(R.sink);if(O===0)w()}},replace(Z,H){let U=z.get(Z);if(!U)return;if(C(`${L} item for key "${Z}"`,H),U.get()===H)return;U.set(H),M.flags|=G;for(let N=M.sinks;N;N=N.nextSink)F(N.sink);if(O===0)w()},sort(Z){let U=X.map((N)=>[N,z.get(N)?.get()]).sort(g(Z)?(N,R)=>Z(N[1],R[1]):(N,R)=>String(N[1]).localeCompare(String(R[1]))).map(([N])=>N);if(!R$(X,U)){X=U,M.flags|=G;for(let N=M.sinks;N;N=N.nextSink)F(N.sink);if(O===0)w()}},splice(Z,H,...U){let N=X.length,R=Z<0?Math.max(0,N+Z):Math.min(Z,N),f=Math.max(0,Math.min(H??Math.max(0,N-Math.max(0,R)),N-R)),A={},T={};for(let h=0;h<f;h++){let a=R+h,f$=X[a];if(f$){let y$=z.get(f$);if(y$)T[f$]=y$.get()}}let I$=X.slice(0,R);for(let h of U){let a=W(h);if(z.has(a)&&!(a in T))throw new e(L,a,h);I$.push(a),A[a]=h}I$.push(...X.slice(R+f));let h$=!!(Object.keys(A).length||Object.keys(T).length);if(h$){P({add:A,change:{},remove:T,changed:h$}),X=I$,M.flags|=G;for(let h=M.sinks;h;h=h.nextSink)F(h.sink);if(O===0)w()}return Object.values(T)},deriveCollection(Z){return F$(q,Z)}};return q}function O$($){return Y($,L)}function B$($,J){if(S(u,$,X$),J?.value!==void 0)C(u,J.value,J?.guard);let z={fn:$,value:J?.value,flags:G,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:J?.equals??k,error:void 0,stop:void 0},X=J?.watched,W=X?()=>{if(V){if(!z.sinks)z.stop=X(()=>{if(F(z),O===0)w()});x(z,V)}}:()=>{if(V)x(z,V)};return{[Symbol.toStringTag]:u,get(){if(W(),I(z),z.error)throw z.error;return W$(u,z.value),z.value}}}function S$($){return Y($,u)}function q$($,J){if(S(d,$,l),J?.value!==void 0)C(d,J.value,J?.guard);let z={fn:$,value:J?.value,sources:null,sourcesTail:null,sinks:null,sinksTail:null,flags:G,equals:J?.equals??k,controller:void 0,error:void 0,stop:void 0},X=J?.watched,W=X?()=>{if(V){if(!z.sinks)z.stop=X(()=>{if(F(z),O===0)w()});x(z,V)}}:()=>{if(V)x(z,V)};return{[Symbol.toStringTag]:d,get(){if(W(),I(z),z.error)throw z.error;return W$(d,z.value),z.value},isPending(){return!!z.controller},abort(){z.controller?.abort(),z.controller=void 0}}}function p$($){return Y($,d)}function F$($,J){S(s,J);let z=l(J),X=new Map,W=[],B=(q)=>{let Z=z?q$(async(H,U)=>{let N=$.byKey(q)?.get();if(N==null)return H;return J(N,U)}):B$(()=>{let H=$.byKey(q)?.get();if(H==null)return;return J(H)});X.set(q,Z)};function D(q){if(!R$(W,q)){let Z=new Set(W),H=new Set(q);for(let U of W)if(!H.has(U))X.delete(U);for(let U of q)if(!Z.has(U))B(U);W=q,P.flags|=b}}function M(){D(Array.from($.keys()));let q=[];for(let Z of W)try{let H=X.get(Z)?.get();if(H!=null)q.push(H)}catch(H){if(!(H instanceof i))throw H}return q}let P={fn:M,value:[],flags:G,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:(q,Z)=>{if(q.length!==Z.length)return!1;for(let H=0;H<q.length;H++)if(q[H]!==Z[H])return!1;return!0},error:void 0};function Q(){if(P.sources){if(P.flags)if(P.value=v(M),P.flags&b){if(P.flags=G,I(P),P.error)throw P.error}else P.flags=p}else if(P.sinks){if(I(P),P.error)throw P.error}else P.value=v(M)}let j=Array.from(v(()=>$.keys()));for(let q of j)B(q);W=j;let m={[Symbol.toStringTag]:s,[Symbol.isConcatSpreadable]:!0,*[Symbol.iterator](){for(let q of W){let Z=X.get(q);if(Z)yield Z}},get length(){if(V)x(P,V);return Q(),W.length},keys(){if(V)x(P,V);return Q(),W.values()},get(){if(V)x(P,V);return Q(),P.value},at(q){let Z=W[q];return Z!==void 0?X.get(Z):void 0},byKey(q){return X.get(q)},keyAt(q){return W[q]},indexOfKey(q){return W.indexOf(q)},deriveCollection(q){return F$(m,q)}};return m}function r$($,J){let z=J?.value??[];if(z.length)C(s,z,Array.isArray);S(s,$,X$);let X=new Map,W=[],B=new Map,[D,M]=E$(J?.keyConfig),K=(Z)=>B.get(Z)??(M?D(Z):void 0),P=J?.createItem??y;function Q(){let Z=[];for(let H of W)try{let U=X.get(H)?.get();if(U!=null)Z.push(U)}catch(U){if(!(U instanceof i))throw U}return Z}let j={fn:Q,value:z,flags:G,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:L$,error:void 0};for(let Z of z){let H=D(Z);X.set(H,P(Z)),B.set(Z,H),W.push(H)}j.value=z,j.flags=G;function m(){if(V){if(!j.sinks)j.stop=$((Z)=>{let{add:H,change:U,remove:N}=Z;if(!H?.length&&!U?.length&&!N?.length)return;let R=!1;z$(()=>{if(H)for(let f of H){let A=D(f);if(X.set(A,P(f)),B.set(f,A),!W.includes(A))W.push(A);R=!0}if(U)for(let f of U){let A=K(f);if(!A)continue;let T=X.get(A);if(T&&V$(T))B.delete(T.get()),T.set(f),B.set(f,A)}if(N)for(let f of N){let A=K(f);if(!A)continue;B.delete(f),X.delete(A);let T=W.indexOf(A);if(T!==-1)W.splice(T,1);R=!0}j.flags=G|(R?b:0);for(let f=j.sinks;f;f=f.nextSink)F(f.sink)})});x(j,V)}}let q={[Symbol.toStringTag]:s,[Symbol.isConcatSpreadable]:!0,*[Symbol.iterator](){for(let Z of W){let H=X.get(Z);if(H)yield H}},get length(){return m(),W.length},keys(){return m(),W.values()},get(){if(m(),j.sources){if(j.flags){let Z=j.flags&b;if(j.value=v(Q),Z){if(j.flags=G,I(j),j.error)throw j.error}else j.flags=p}}else if(I(j),j.error)throw j.error;return j.value},at(Z){let H=W[Z];return H!==void 0?X.get(H):void 0},byKey(Z){return X.get(Z)},keyAt(Z){return W[Z]},indexOfKey(Z){return W.indexOf(Z)},deriveCollection(Z){return F$(q,Z)}};return q}function o$($){return Y($,s)}function l$($){S("Effect",$);let J={fn:$,flags:G,sources:null,sourcesTail:null,cleanup:null},z=()=>{K$(J),J.fn=void 0,J.flags=p,J.sourcesTail=null,H$(J)};if(_)J$(_,z);return T$(J),z}function i$($,J){if(!_)throw new G$("match");let z=!Array.isArray($),X=z?[$]:$,{nil:W}=J,B=z?(j)=>J.ok(j[0]):(j)=>J.ok(j),D=z&&J.err?(j)=>J.err(j[0]):J.err??console.error,M,K=!1,P=Array(X.length);for(let j=0;j<X.length;j++)try{P[j]=X[j].get()}catch(m){if(m instanceof i){K=!0;continue}if(!M)M=[];M.push(m instanceof Error?m:Error(String(m)))}let Q;try{if(K)Q=W?.();else if(M)Q=D(M);else Q=B(P)}catch(j){D([j instanceof Error?j:Error(String(j))])}if(typeof Q==="function")return Q;if(Q instanceof Promise){let j=_,m=new AbortController;J$(j,()=>m.abort()),Q.then((q)=>{if(!m.signal.aborted&&typeof q==="function")J$(j,q)}).catch((q)=>{D([q instanceof Error?q:Error(String(q))])})}}function n$($,J){if(S(t,$,X$),J?.value!==void 0)C(t,J.value,J?.guard);let z={value:J?.value,sinks:null,sinksTail:null,equals:J?.equals??k,guard:J?.guard,stop:void 0};return{[Symbol.toStringTag]:t,get(){if(V){if(!z.sinks)z.stop=$((X)=>{C(t,X,z.guard),N$(z,X)});x(z,V)}return W$(t,z.value),z.value}}}function a$($){return Y($,t)}function e$($,J){let z=E($)||Array.isArray($),X=E(J)||Array.isArray(J);if(!z||!X){let j=!Object.is($,J);return{changed:j,add:j&&X?J:{},change:{},remove:j&&z?$:{}}}let W=new WeakSet,B={},D={},M={},K=!1,P=Object.keys($),Q=Object.keys(J);for(let j of Q)if(j in $){if(!n($[j],J[j],W))D[j]=J[j],K=!0}else B[j]=J[j],K=!0;for(let j of P)if(!(j in J))M[j]=void 0,K=!0;return{add:B,change:D,remove:M,changed:K}}function m$($,J){C(r,$,E);let z=new Map,X=(Q,j)=>{if(C(`${r} for key "${Q}"`,j),Array.isArray(j))z.set(Q,Q$(j));else if(E(j))z.set(Q,m$(j));else z.set(Q,y(j))},W=()=>{let Q={};return z.forEach((j,m)=>{Q[m]=j.get()}),Q},B={fn:W,value:$,flags:G,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:n,error:void 0},D=(Q)=>{let j=!1;for(let m in Q.add)X(m,Q.add[m]),j=!0;if(Object.keys(Q.change).length)z$(()=>{for(let m in Q.change){let q=Q.change[m];C(`${r} for key "${m}"`,q);let Z=z.get(m);if(Z)if(E(q)!==x$(Z))X(m,q),j=!0;else Z.set(q)}});for(let m in Q.remove)z.delete(m),j=!0;if(j)B.flags|=b;return Q.changed},M=J?.watched,K=M?()=>{if(V){if(!B.sinks)B.stop=M();x(B,V)}}:()=>{if(V)x(B,V)};for(let Q of Object.keys($))X(Q,$[Q]);let P={[Symbol.toStringTag]:r,[Symbol.isConcatSpreadable]:!1,*[Symbol.iterator](){for(let Q of Array.from(z.keys())){let j=z.get(Q);if(j)yield[Q,j]}},keys(){return K(),z.keys()},byKey(Q){return z.get(Q)},get(){if(K(),B.sources){if(B.flags){let Q=B.flags&b;if(B.value=v(W),Q){if(B.flags=G,I(B),B.error)throw B.error}else B.flags=p}}else if(I(B),B.error)throw B.error;return B.value},set(Q){let j=B.flags&G?W():B.value,m=e$(j,Q);if(D(m)){B.flags|=G;for(let q=B.sinks;q;q=q.nextSink)F(q.sink);if(O===0)w()}},update(Q){P.set(Q(P.get()))},add(Q,j){if(z.has(Q))throw new e(r,Q,j);X(Q,j),B.flags|=G|b;for(let m=B.sinks;m;m=m.nextSink)F(m.sink);if(O===0)w();return Q},remove(Q){if(z.delete(Q)){B.flags|=G|b;for(let m=B.sinks;m;m=m.nextSink)F(m.sink);if(O===0)w()}}};return new Proxy(P,{get(Q,j){if(j in Q)return Reflect.get(Q,j);if(typeof j!=="symbol")return Q.byKey(j)},has(Q,j){if(j in Q)return!0;return Q.byKey(String(j))!==void 0},ownKeys(Q){return Array.from(Q.keys())},getOwnPropertyDescriptor(Q,j){if(j in Q)return Reflect.getOwnPropertyDescriptor(Q,j);if(typeof j==="symbol")return;let m=Q.byKey(String(j));return m?{enumerable:!0,configurable:!0,writable:!0,value:m}:void 0}})}function x$($){return Y($,r)}function $J($,J){return l($)?q$($,J):B$($,J)}function JJ($){if(M$($))return $;if($==null)throw new j$("createSignal",$);if(l($))return q$($);if(g($))return B$($);if(Y$($))return Q$($);if(E($))return m$($);return y($)}function zJ($){if(w$($))return $;if($==null||g($)||M$($))throw new j$("createMutableSignal",$);if(Y$($))return Q$($);if(E($))return m$($);return y($)}function XJ($){return S$($)||p$($)}function M$($){let J=[c,u,d,t,o,L,s,r],z=Object.prototype.toString.call($).slice(8,-1);return J.includes(z)}function w$($){return V$($)||x$($)||O$($)}function ZJ($,J){C(o,$,M$);let z=$,X=J?.guard,W={fn:()=>z.get(),value:void 0,flags:G,sources:null,sourcesTail:null,sinks:null,sinksTail:null,equals:J?.equals??k,error:void 0},B=()=>{if(V)x(W,V);if(I(W),W.error)throw W.error;return W.value},D=(K)=>{if(g$(z))return z.set(K);if(!w$(z))throw new P$(o);C(o,K,X),z.set(K)},M=(K)=>{C(o,K,M$),z=K,W.flags|=G;for(let P=W.sinks;P;P=P.nextSink)F(P.sink);if(O===0)w()};return{[Symbol.toStringTag]:o,configurable:!0,enumerable:!0,get:B,set:D,replace:M,current:()=>z}}function g$($){return Y($,o)}export{D$ as valueString,v as untrack,t$ as unown,i$ as match,p$ as isTask,x$ as isStore,V$ as isState,g$ as isSlot,M$ as isSignal,a$ as isSensor,E as isRecord,Y as isObjectOfType,w$ as isMutableSignal,S$ as isMemo,O$ as isList,g as isFunction,n as isEqual,XJ as isComputed,o$ as isCollection,l as isAsyncFunction,q$ as createTask,m$ as createStore,y as createState,ZJ as createSlot,JJ as createSignal,n$ as createSensor,d$ as createScope,zJ as createMutableSignal,B$ as createMemo,Q$ as createList,l$ as createEffect,$J as createComputed,r$ as createCollection,z$ as batch,i as UnsetSignalValueError,L$ as SKIP_EQUALITY,G$ as RequiredOwnerError,P$ as ReadonlySignalError,A$ as NullishSignalValueError,j$ as InvalidSignalValueError,b$ as InvalidCallbackError,Z$ as CircularDependencyError};

package/index.ts

@@ -1,6 +1,6 @@
 /**
  * @name Cause & Effect
- * @version 1.0.2
+ * @version 1.1.1
  * @author Esther Brunner
  */
 
@@ -41,6 +41,7 @@ export {
 export {
 	createEffect,
 	type MatchHandlers,
+	type SingleMatchHandlers,
 	type MaybePromise,
 	match,
 } from './src/nodes/effect'

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@zeix/cause-effect",
-	"version": "1.0.2",
+	"version": "1.1.1",
 	"author": "Esther Brunner",
 	"type": "module",
 	"main": "index.js",
@@ -8,10 +8,10 @@
 	"types": "types/index.d.ts",
 	"devDependencies": {
 		"@biomejs/biome": "2.4.6",
-		"bun-types": "latest",
+		"@types/bun": "latest",
 		"mitata": "^1.0.34",
 		"random": "^5.4.1",
-		"typescript": "latest"
+		"typescript": "^6.0.2"
 	},
 	"peerDependencies": {
 		"typescript": ">=5.8.0"

package/src/nodes/effect.ts

@@ -39,6 +39,20 @@ type MatchHandlers<T extends readonly Signal<unknown & {}>[]> = {
 	nil?: () => MaybePromise<MaybeCleanup>
 }
 
+/**
+ * Handlers for a single signal passed to `match()`.
+ *
+ * @template T - The value type of the signal being matched
+ */
+type SingleMatchHandlers<T extends {}> = {
+	/** Called when the signal has a value. Receives the resolved value directly. */
+	ok: (value: T) => MaybePromise<MaybeCleanup>
+	/** Called when the signal holds an error. Receives the error directly. Defaults to `console.error`. */
+	err?: (error: Error) => MaybePromise<MaybeCleanup>
+	/** Called when the signal is unset (pending). */
+	nil?: () => MaybePromise<MaybeCleanup>
+}
+
 /* === Exported Functions === */
 
 /**
@@ -96,6 +110,20 @@ function createEffect(fn: EffectCallback): Cleanup {
 	return dispose
 }
 
+/**
+ * Reads one or more signals and dispatches to the appropriate handler based on their state.
+ * Must be called within an active owner (effect or scope) so async cleanup can be registered.
+ *
+ * @since 1.1
+ * @param signal - A single signal to read.
+ * @param handlers - Object with an `ok` branch (receives the value directly) and optional `err` and `nil` branches.
+ * @returns An optional cleanup function if the active handler returns one.
+ * @throws RequiredOwnerError If called without an active owner.
+ */
+function match<T extends {}>(
+	signal: Signal<T>,
+	handlers: SingleMatchHandlers<T>,
+): MaybeCleanup
 /**
  * Reads one or more signals and dispatches to the appropriate handler based on their state.
  * Must be called within an active owner (effect or scope) so async cleanup can be registered.
@@ -105,13 +133,41 @@ function createEffect(fn: EffectCallback): Cleanup {
  * @param handlers - Object with an `ok` branch and optional `err` and `nil` branches.
  * @returns An optional cleanup function if the active handler returns one.
  * @throws RequiredOwnerError If called without an active owner.
+ *
+ * @remarks
+ * **Async handlers are for external side effects only** — DOM mutations, analytics, logging,
+ * or any fire-and-forget API call whose result does not need to drive reactive state.
+ * Do not call `.set()` on a signal inside an async handler: use a `Task` node instead,
+ * which receives an `AbortSignal`, is auto-cancelled on re-run, and integrates cleanly
+ * with `nil` and `err` branches.
+ *
+ * Rejections from async handlers are always routed to `err`, including rejections from
+ * stale runs that were already superseded by a newer signal value. The library cannot
+ * cancel external operations it did not start.
  */
 function match<T extends readonly Signal<unknown & {}>[]>(
 	signals: readonly [...T],
 	handlers: MatchHandlers<T>,
+): MaybeCleanup
+function match(
+	signalOrSignals: Signal<unknown & {}> | readonly Signal<unknown & {}>[],
+	// biome-ignore lint/suspicious/noExplicitAny: implementation overload, not part of the public API
+	handlers: any,
 ): MaybeCleanup {
 	if (!activeOwner) throw new RequiredOwnerError('match')
-	const { ok, err = console.error, nil } = handlers
+
+	const isSingle = !Array.isArray(signalOrSignals)
+	const signals = isSingle ? [signalOrSignals] : signalOrSignals
+
+	const { nil } = handlers
+	const ok = isSingle
+		? (values: unknown[]) => handlers.ok(values[0])
+		: (values: unknown[]) => handlers.ok(values)
+	const err: (errors: readonly Error[]) => MaybePromise<MaybeCleanup> =
+		isSingle && handlers.err
+			? (errors: readonly Error[]) => handlers.err(errors[0])
+			: (handlers.err ?? console.error)
+
 	let errors: Error[] | undefined
 	let pending = false
 	const values = new Array(signals.length)
@@ -133,12 +189,7 @@ function match<T extends readonly Signal<unknown & {}>[]>(
 	try {
 		if (pending) out = nil?.()
 		else if (errors) out = err(errors)
-		else
-			out = ok(
-				values as {
-					[K in keyof T]: T[K] extends Signal<infer V> ? V : never
-				},
-			)
+		else out = ok(values)
 	} catch (e) {
 		err([e instanceof Error ? e : new Error(String(e))])
 	}
@@ -158,4 +209,10 @@ function match<T extends readonly Signal<unknown & {}>[]>(
 	}
 }
 
-export { type MaybePromise, type MatchHandlers, createEffect, match }
+export {
+	type MaybePromise,
+	type MatchHandlers,
+	type SingleMatchHandlers,
+	createEffect,
+	match,
+}

package/src/nodes/slot.ts

@@ -28,6 +28,9 @@ import { isObjectOfType } from '../util'
  * `get`, `set`, `configurable`, and `enumerable` are used by the property definition;
  * `replace()` and `current()` are kept on the slot object for integration-layer control.
  *
+ * Slots are not `MutableSignal`s: they are forwarding layers, not value owners.
+ * `set()` delegates to the backing signal; `update()` is intentionally absent.
+ *
  * @template T - The type of value held by the delegated signal.
  */
 type Slot<T extends {}> = {
@@ -51,10 +54,11 @@ type Slot<T extends {}> = {
 /**
  * Creates a slot signal that delegates its value to a swappable backing signal.
  *
- * A slot acts as a stable reactive source that can be used as a property descriptor
- * via `Object.defineProperty(target, key, slot)`. Subscribers link to the slot itself,
+ * A slot acts as a stable reactive source usable as a property descriptor via
+ * `Object.defineProperty(target, key, slot)`. Subscribers link to the slot itself,
  * so replacing the backing signal with `replace()` invalidates them without breaking
- * existing edges. Setter calls forward to the current backing signal when it is writable.
+ * existing edges. `set()` forwards to the current backing signal if it is writable;
+ * `update()` is absent — a slot is a forwarding layer, not a value owner.
  *
  * @since 0.18.3
  * @template T - The type of value held by the delegated signal.
@@ -93,10 +97,10 @@ function createSlot<T extends {}>(
 	}
 
 	const set = (next: T): void => {
+		if (isSlot(delegated)) return delegated.set(next)
 		if (!isMutableSignal(delegated))
 			throw new ReadonlySignalError(TYPE_SLOT)
 		validateSignalValue(TYPE_SLOT, next, guard)
-
 		delegated.set(next)
 	}
 

package/test/effect.test.ts

@@ -475,6 +475,94 @@ describe('match', () => {
 		expect(() => match([], { ok: () => {} })).toThrow(RequiredOwnerError)
 	})
 
+	describe('Single-signal overload', () => {
+		test('should call ok with unwrapped value', () => {
+			const s = createState(42)
+			let result = 0
+			createEffect(() =>
+				match(s, {
+					ok: value => {
+						result = value
+					},
+				}),
+			)
+			expect(result).toBe(42)
+			s.set(99)
+			expect(result).toBe(99)
+		})
+
+		test('should call nil handler when signal is unset', async () => {
+			const task = createTask(async () => {
+				await wait(50)
+				return 42
+			})
+			let okCount = 0
+			let nilCount = 0
+			createEffect(() =>
+				match(task, {
+					ok: value => {
+						okCount++
+						expect(value).toBe(42)
+					},
+					nil: () => {
+						nilCount++
+					},
+				}),
+			)
+			expect(okCount).toBe(0)
+			expect(nilCount).toBe(1)
+			await wait(60)
+			expect(okCount).toBeGreaterThan(0)
+			expect(nilCount).toBe(1)
+		})
+
+		test('should call err with unwrapped Error', () => {
+			const a = createState(1)
+			const b = createMemo(() => {
+				if (a.get() > 5) throw new Error('Too high')
+				return a.get() * 2
+			})
+			let okCount = 0
+			let errCount = 0
+			createEffect(() =>
+				match(b, {
+					ok: () => {
+						okCount++
+					},
+					err: error => {
+						errCount++
+						expect(error.message).toBe('Too high')
+					},
+				}),
+			)
+			expect(okCount).toBe(1)
+			a.set(6)
+			expect(errCount).toBe(1)
+			a.set(3)
+			expect(okCount).toBe(2)
+			expect(errCount).toBe(1)
+		})
+
+		test('should fall back to console.error for single signal without err handler', () => {
+			const originalConsoleError = console.error
+			const mockConsoleError = mock(() => {})
+			console.error = mockConsoleError
+
+			try {
+				const a = createState(1)
+				const b = createMemo(() => {
+					if (a.get() > 5) throw new Error('Too high')
+					return a.get() * 2
+				})
+				createEffect(() => match(b, { ok: () => {} }))
+				a.set(6)
+				expect(mockConsoleError).toHaveBeenCalled()
+			} finally {
+				console.error = originalConsoleError
+			}
+		})
+	})
+
 	test('should resolve multiple async tasks without waterfalls', async () => {
 		const a = createTask(async () => {
 			await wait(20)

package/test/slot.test.ts

@@ -103,6 +103,25 @@ describe('Slot', () => {
 		expect(runs).toBe(2)
 	})
 
+	test('should forward set through a Slot-to-Slot chain', () => {
+		const source = createState(1)
+		const inner = createSlot(source)
+		const outer = createSlot(inner)
+
+		outer.set(42)
+		expect(source.get()).toBe(42)
+		expect(outer.get()).toBe(42)
+	})
+
+	test('should throw ReadonlySignalError when chain terminates in a read-only signal', () => {
+		const source = createState(2)
+		const readonly = createMemo(() => source.get() * 2)
+		const inner = createSlot(readonly)
+		const outer = createSlot(inner)
+
+		expect(() => outer.set(99)).toThrow('[Slot] Signal is read-only')
+	})
+
 	test('should validate initial signal and replacement signal', () => {
 		expect(() => {
 			// @ts-expect-error: deliberate error test

package/types/index.d.ts

@@ -1,12 +1,12 @@
 /**
  * @name Cause & Effect
- * @version 1.0.2
+ * @version 1.1.1
  * @author Esther Brunner
  */
 export { CircularDependencyError, type Guard, InvalidCallbackError, InvalidSignalValueError, NullishSignalValueError, ReadonlySignalError, RequiredOwnerError, UnsetSignalValueError, } from './src/errors';
 export { batch, type Cleanup, type ComputedOptions, createScope, type EffectCallback, type MaybeCleanup, type MemoCallback, type Signal, type SignalOptions, SKIP_EQUALITY, type TaskCallback, unown, untrack, } from './src/graph';
 export { type Collection, type CollectionCallback, type CollectionChanges, type CollectionOptions, createCollection, type DeriveCollectionCallback, isCollection, } from './src/nodes/collection';
-export { createEffect, type MatchHandlers, type MaybePromise, match, } from './src/nodes/effect';
+export { createEffect, type MatchHandlers, type SingleMatchHandlers, type MaybePromise, match, } from './src/nodes/effect';
 export { createList, isEqual, isList, type KeyConfig, type List, type ListOptions, } from './src/nodes/list';
 export { createMemo, isMemo, type Memo } from './src/nodes/memo';
 export { createSensor, isSensor, type Sensor, type SensorCallback, type SensorOptions, } from './src/nodes/sensor';

package/types/src/nodes/effect.d.ts

@@ -16,6 +16,19 @@ type MatchHandlers<T extends readonly Signal<unknown & {}>[]> = {
     /** Called when one or more signals are unset (pending). */
     nil?: () => MaybePromise<MaybeCleanup>;
 };
+/**
+ * Handlers for a single signal passed to `match()`.
+ *
+ * @template T - The value type of the signal being matched
+ */
+type SingleMatchHandlers<T extends {}> = {
+    /** Called when the signal has a value. Receives the resolved value directly. */
+    ok: (value: T) => MaybePromise<MaybeCleanup>;
+    /** Called when the signal holds an error. Receives the error directly. Defaults to `console.error`. */
+    err?: (error: Error) => MaybePromise<MaybeCleanup>;
+    /** Called when the signal is unset (pending). */
+    nil?: () => MaybePromise<MaybeCleanup>;
+};
 /**
  * Creates a reactive effect that automatically runs when its dependencies change.
  * Effects run immediately upon creation and re-run when any tracked signal changes.
@@ -46,6 +59,17 @@ type MatchHandlers<T extends readonly Signal<unknown & {}>[]> = {
  * ```
  */
 declare function createEffect(fn: EffectCallback): Cleanup;
+/**
+ * Reads one or more signals and dispatches to the appropriate handler based on their state.
+ * Must be called within an active owner (effect or scope) so async cleanup can be registered.
+ *
+ * @since 1.1
+ * @param signal - A single signal to read.
+ * @param handlers - Object with an `ok` branch (receives the value directly) and optional `err` and `nil` branches.
+ * @returns An optional cleanup function if the active handler returns one.
+ * @throws RequiredOwnerError If called without an active owner.
+ */
+declare function match<T extends {}>(signal: Signal<T>, handlers: SingleMatchHandlers<T>): MaybeCleanup;
 /**
  * Reads one or more signals and dispatches to the appropriate handler based on their state.
  * Must be called within an active owner (effect or scope) so async cleanup can be registered.
@@ -55,6 +79,17 @@ declare function createEffect(fn: EffectCallback): Cleanup;
  * @param handlers - Object with an `ok` branch and optional `err` and `nil` branches.
  * @returns An optional cleanup function if the active handler returns one.
  * @throws RequiredOwnerError If called without an active owner.
+ *
+ * @remarks
+ * **Async handlers are for external side effects only** — DOM mutations, analytics, logging,
+ * or any fire-and-forget API call whose result does not need to drive reactive state.
+ * Do not call `.set()` on a signal inside an async handler: use a `Task` node instead,
+ * which receives an `AbortSignal`, is auto-cancelled on re-run, and integrates cleanly
+ * with `nil` and `err` branches.
+ *
+ * Rejections from async handlers are always routed to `err`, including rejections from
+ * stale runs that were already superseded by a newer signal value. The library cannot
+ * cancel external operations it did not start.
  */
 declare function match<T extends readonly Signal<unknown & {}>[]>(signals: readonly [...T], handlers: MatchHandlers<T>): MaybeCleanup;
-export { type MaybePromise, type MatchHandlers, createEffect, match };
+export { type MaybePromise, type MatchHandlers, type SingleMatchHandlers, createEffect, match, };

package/types/src/nodes/slot.d.ts

@@ -8,6 +8,9 @@ import { type Signal, type SignalOptions } from '../graph';
  * `get`, `set`, `configurable`, and `enumerable` are used by the property definition;
  * `replace()` and `current()` are kept on the slot object for integration-layer control.
  *
+ * Slots are not `MutableSignal`s: they are forwarding layers, not value owners.
+ * `set()` delegates to the backing signal; `update()` is intentionally absent.
+ *
  * @template T - The type of value held by the delegated signal.
  */
 type Slot<T extends {}> = {
@@ -28,10 +31,11 @@ type Slot<T extends {}> = {
 /**
  * Creates a slot signal that delegates its value to a swappable backing signal.
  *
- * A slot acts as a stable reactive source that can be used as a property descriptor
- * via `Object.defineProperty(target, key, slot)`. Subscribers link to the slot itself,
+ * A slot acts as a stable reactive source usable as a property descriptor via
+ * `Object.defineProperty(target, key, slot)`. Subscribers link to the slot itself,
  * so replacing the backing signal with `replace()` invalidates them without breaking
- * existing edges. Setter calls forward to the current backing signal when it is writable.
+ * existing edges. `set()` forwards to the current backing signal if it is writable;
+ * `update()` is absent — a slot is a forwarding layer, not a value owner.
  *
  * @since 0.18.3
  * @template T - The type of value held by the delegated signal.