@zeix/cause-effect 0.13.0 → 0.13.1

package/README.md

@@ -1,6 +1,6 @@
 # Cause & Effect
 
-Version 0.13.0
+Version 0.13.1
 
 **Cause & Effect** is a lightweight, reactive state management library for JavaScript applications. It uses the concept of signals to create a predictable and efficient data flow in your app.
 

package/index.d.ts

@@ -1,10 +1,10 @@
 /**
  * @name Cause & Effect
- * @version 0.13.0
+ * @version 0.13.1
  * @author Esther Brunner
  */
 export { CircularDependencyError } from './lib/util';
-export { type Signal, type MaybeSignal, UNSET, isSignal, isComputedCallback, toSignal } from './lib/signal';
+export { type Signal, type MaybeSignal, type ComputedCallback, UNSET, isSignal, isComputedCallback, toSignal } from './lib/signal';
 export { type State, state, isState } from './lib/state';
 export { type Computed, type ComputedMatcher, computed, isComputed } from './lib/computed';
 export { type EffectMatcher, type TapMatcher, effect } from './lib/effect';

package/index.js

@@ -1 +1 @@
-var X=(x)=>typeof x==="function",d=(x)=>X(x)&&x.constructor.name==="AsyncFunction",P=(x,y)=>Object.prototype.toString.call(x)===`[object ${y}]`,c=(x)=>x instanceof Error,I=(x)=>x instanceof DOMException&&x.name==="AbortError",m=(x)=>x instanceof Promise,j=(x)=>c(x)?x:Error(String(x));class V extends Error{constructor(x){super(`Circular dependency in ${x} detected`);return this}}var A,R=new Set,U=0,_=new Map,D,v=()=>{D=void 0;let x=Array.from(_.values());_.clear();for(let y of x)y()},t=()=>{if(D)cancelAnimationFrame(D);D=requestAnimationFrame(v)};queueMicrotask(v);var N=(x)=>{if(A&&!x.has(A)){let y=A;x.add(y),A.cleanups.add(()=>{x.delete(y)})}},F=(x)=>{for(let y of x)if(U)R.add(y);else y()},k=()=>{while(R.size){let x=Array.from(R);R.clear();for(let y of x)y()}},a=(x)=>{U++;try{x()}finally{k(),U--}},M=(x,y)=>{let z=A;A=y;try{x()}finally{A=z}},r=(x,y)=>new Promise((z,J)=>{let B=()=>{try{z(x())}catch(K){J(K)}};if(y)_.set(y,B);t()});function Y(x){let{signals:y,ok:z,err:J=console.error,nil:B=()=>{}}=X(x)?{signals:[],ok:x}:x,K=!1,L=()=>M(()=>{if(K)throw new V("effect");K=!0;let G=void 0;try{G=S({signals:y,ok:z,err:J,nil:B})}catch(Q){J(j(Q))}if(X(G))L.cleanups.add(G);K=!1},L);return L.cleanups=new Set,L(),()=>{L.cleanups.forEach((G)=>G()),L.cleanups.clear()}}var o="Computed",e=(x,y)=>{if(!y)return!1;return x.name===y.name&&x.message===y.message},O=(x)=>{let y=new Set,z=X(x)?void 0:{nil:()=>Z,err:(...$)=>{if($.length>1)throw new AggregateError($);else throw $[0]},...x},J=z?z.ok:x,B=Z,K,L=!0,G=!1,Q=!1,H,W=($)=>{if(!Object.is($,B))B=$,L=!1,K=void 0,G=!0},g=()=>{G=Z!==B,B=Z,K=void 0},f=($)=>{let C=j($);G=!e(C,K),B=Z,K=C},n=($)=>{if(Q=!1,H=void 0,W($),G)F(y)},u=($)=>{if(Q=!1,H=void 0,f($),G)F(y)},l=()=>{Q=!1,H=void 0,p()},q=()=>{if(L=!0,H?.abort("Aborted because source signal changed"),y.size){if(G)F(y)}else q.cleanups.forEach(($)=>$()),q.cleanups.clear()};q.cleanups=new Set;let p=()=>M(()=>{if(Q)throw new V("computed");if(G=!1,d(J)){if(H)return B;if(H=new AbortController,z)z.abort=z.abort instanceof AbortSignal?AbortSignal.any([z.abort,H.signal]):H.signal;H.signal.addEventListener("abort",l,{once:!0})}let $;Q=!0;try{$=z&&z.signals.length?S(z):J(H?.signal)}catch(C){I(C)?g():f(C),Q=!1;return}if(m($))$.then(n,u);else if($==null||Z===$)g();else W($);Q=!1},q),T={[Symbol.toStringTag]:o,get:()=>{if(N(y),k(),L)p();if(K)throw K;return B},map:($)=>O({signals:[T],ok:$}),tap:($)=>Y({signals:[T],...X($)?{ok:$}:$})};return T},b=(x)=>P(x,o);var i="State",E=(x)=>{let y=new Set,z=x,J={[Symbol.toStringTag]:i,get:()=>{return N(y),z},set:(B)=>{if(Object.is(z,B))return;if(z=B,F(y),Z===z)y.clear()},update:(B)=>{J.set(B(z))},map:(B)=>O({signals:[J],ok:B}),tap:(B)=>Y({signals:[J],...X(B)?{ok:B}:B})};return J},w=(x)=>P(x,i);var Z=Symbol(),h=(x)=>w(x)||b(x),s=(x)=>X(x)&&x.length<2,xx=(x)=>h(x)?x:s(x)?O(x):E(x),S=(x)=>{let{signals:y,abort:z,ok:J,err:B,nil:K}=x,L=[],G=!1,Q=y.map((H)=>{try{let W=H.get();if(W===Z)G=!0;return W}catch(W){if(I(W))throw W;L.push(j(W))}});try{return G?K(z):L.length?B(...L):J(...Q)}catch(H){if(I(H))throw H;let W=j(H);return B(W)}};export{M as watch,xx as toSignal,E as state,w as isState,h as isSignal,s as isComputedCallback,b as isComputed,r as enqueue,Y as effect,O as computed,a as batch,Z as UNSET,V as CircularDependencyError};
+var X=(x)=>typeof x==="function",d=(x)=>X(x)&&x.constructor.name==="AsyncFunction",P=(x,y)=>Object.prototype.toString.call(x)===`[object ${y}]`,c=(x)=>x instanceof Error,I=(x)=>x instanceof DOMException&&x.name==="AbortError",m=(x)=>x instanceof Promise,j=(x)=>c(x)?x:Error(String(x));class C extends Error{constructor(x){super(`Circular dependency in ${x} detected`);return this}}var A,R=new Set,U=0,_=new Map,D,v=()=>{D=void 0;let x=Array.from(_.values());_.clear();for(let y of x)y()},t=()=>{if(D)cancelAnimationFrame(D);D=requestAnimationFrame(v)};queueMicrotask(v);var N=(x)=>{if(A&&!x.has(A)){let y=A;x.add(y),A.cleanups.add(()=>{x.delete(y)})}},V=(x)=>{for(let y of x)if(U)R.add(y);else y()},k=()=>{while(R.size){let x=Array.from(R);R.clear();for(let y of x)y()}},a=(x)=>{U++;try{x()}finally{k(),U--}},M=(x,y)=>{let z=A;A=y;try{x()}finally{A=z}},r=(x,y)=>new Promise((z,J)=>{let B=()=>{try{z(x())}catch(K){J(K)}};if(y)_.set(y,B);t()});function Y(x){let{signals:y,ok:z,err:J=console.error,nil:B=()=>{}}=X(x)?{signals:[],ok:x}:x,K=!1,L=()=>M(()=>{if(K)throw new C("effect");K=!0;let G=void 0;try{G=S({signals:y,ok:z,err:J,nil:B})}catch(Q){J(j(Q))}if(X(G))L.cleanups.add(G);K=!1},L);return L.cleanups=new Set,L(),()=>{L.cleanups.forEach((G)=>G()),L.cleanups.clear()}}var o="Computed",e=(x,y)=>{if(!y)return!1;return x.name===y.name&&x.message===y.message},F=(x)=>{let y=new Set,z=X(x)?void 0:{nil:()=>Z,err:(...$)=>{if($.length>1)throw new AggregateError($);else throw $[0]},...x},J=z?z.ok:x,B=Z,K,L=!0,G=!1,Q=!1,H,W=($)=>{if(!Object.is($,B))B=$,L=!1,K=void 0,G=!0},g=()=>{G=Z!==B,B=Z,K=void 0},p=($)=>{let O=j($);G=!e(O,K),B=Z,K=O},n=($)=>{if(Q=!1,H=void 0,W($),G)V(y)},u=($)=>{if(Q=!1,H=void 0,p($),G)V(y)},l=()=>{Q=!1,H=void 0,f()},q=()=>{if(L=!0,H?.abort("Aborted because source signal changed"),y.size){if(G)V(y)}else q.cleanups.forEach(($)=>$()),q.cleanups.clear()};q.cleanups=new Set;let f=()=>M(()=>{if(Q)throw new C("computed");if(G=!1,d(J)){if(H)return B;if(H=new AbortController,z)z.abort=z.abort instanceof AbortSignal?AbortSignal.any([z.abort,H.signal]):H.signal;H.signal.addEventListener("abort",l,{once:!0})}let $;Q=!0;try{$=z&&z.signals.length?S(z):J(H?.signal)}catch(O){I(O)?g():p(O),Q=!1;return}if(m($))$.then(n,u);else if($==null||Z===$)g();else W($);Q=!1},q),T={[Symbol.toStringTag]:o,get:()=>{if(N(y),k(),L)f();if(K)throw K;return B},map:($)=>F({signals:[T],ok:$}),tap:($)=>Y({signals:[T],...X($)?{ok:$}:$})};return T},b=(x)=>P(x,o);var i="State",E=(x)=>{let y=new Set,z=x,J={[Symbol.toStringTag]:i,get:()=>{return N(y),z},set:(B)=>{if(Object.is(z,B))return;if(z=B,V(y),Z===z)y.clear()},update:(B)=>{J.set(B(z))},map:(B)=>F({signals:[J],ok:B}),tap:(B)=>Y({signals:[J],...X(B)?{ok:B}:B})};return J},w=(x)=>P(x,i);var Z=Symbol(),h=(x)=>w(x)||b(x),s=(x)=>X(x)&&x.length<2,xx=(x)=>h(x)?x:s(x)?F(x):E(x),S=(x)=>{let{signals:y,abort:z,ok:J,err:B,nil:K}=x,L=[],G=!1,Q=y.map((H)=>{try{let W=H.get();if(W===Z)G=!0;return W}catch(W){if(I(W))throw W;L.push(j(W))}});try{return G?K(z):L.length?B(...L):J(...Q)}catch(H){if(I(H))throw H;let W=j(H);return B(W)}};export{M as watch,xx as toSignal,E as state,w as isState,h as isSignal,s as isComputedCallback,b as isComputed,r as enqueue,Y as effect,F as computed,a as batch,Z as UNSET,C as CircularDependencyError};

package/index.ts

@@ -1,11 +1,11 @@
 /**
  * @name Cause & Effect
- * @version 0.13.0
+ * @version 0.13.1
  * @author Esther Brunner
  */
 export { CircularDependencyError } from './lib/util'
 export {
-	type Signal, type MaybeSignal,
+	type Signal, type MaybeSignal, type ComputedCallback,
 	UNSET, isSignal, isComputedCallback, toSignal
 } from './lib/signal'
 

package/lib/computed.d.ts

@@ -1,4 +1,4 @@
-import { type Signal } from './signal';
+import { type Signal, type ComputedCallback } from './signal';
 import { type TapMatcher } from './effect';
 export type ComputedMatcher<S extends Signal<{}>[], R extends {}> = {
     signals: S;
@@ -19,10 +19,10 @@ export type Computed<T extends {}> = {
  * Create a derived signal from existing signals
  *
  * @since 0.9.0
- * @param {ComputedMatcher<S, T> | ((abort?: AbortSignal) => T | Promise<T>)} matcher - computed matcher or callback
+ * @param {ComputedMatcher<S, T> | ComputedCallback<T>} matcher - computed matcher or callback
  * @returns {Computed<T>} - Computed signal
  */
-export declare const computed: <T extends {}, S extends Signal<{}>[] = []>(matcher: ComputedMatcher<S, T> | ((abort?: AbortSignal) => T | Promise<T>)) => Computed<T>;
+export declare const computed: <T extends {}, S extends Signal<{}>[] = []>(matcher: ComputedMatcher<S, T> | ComputedCallback<T>) => Computed<T>;
 /**
  * Check if a value is a computed state
  *

package/lib/computed.ts

@@ -1,4 +1,4 @@
-import { type Signal, match, UNSET } from './signal'
+import { type Signal, type ComputedCallback, match, UNSET } from './signal'
 import { CircularDependencyError, isAbortError, isAsyncFunction, isFunction, isObjectOfType, isPromise, toError } from './util'
 import { type Watcher, flush, notify, subscribe, watch } from './scheduler'
 import { type TapMatcher, type EffectMatcher, effect } from './effect'
@@ -42,11 +42,11 @@ const isEquivalentError = /*#__PURE__*/ (
  * Create a derived signal from existing signals
  * 
  * @since 0.9.0
- * @param {ComputedMatcher<S, T> | ((abort?: AbortSignal) => T | Promise<T>)} matcher - computed matcher or callback
+ * @param {ComputedMatcher<S, T> | ComputedCallback<T>} matcher - computed matcher or callback
  * @returns {Computed<T>} - Computed signal
  */
 export const computed = <T extends {}, S extends Signal<{}>[] = []>(
-	matcher: ComputedMatcher<S, T> | ((abort?: AbortSignal) => T | Promise<T>)
+	matcher: ComputedMatcher<S, T> | ComputedCallback<T>,
 ): Computed<T> => {
 	const watchers: Set<Watcher> = new Set()
 	const m = isFunction(matcher) ? undefined : {
@@ -57,7 +57,7 @@ export const computed = <T extends {}, S extends Signal<{}>[] = []>(
 			},
 			...matcher,
 		} as Required<ComputedMatcher<S, T>>
-	const fn = (m ? m.ok : matcher) as (abort?: AbortSignal) => T | Promise<T>
+	const fn = (m ? m.ok : matcher) as ComputedCallback<T>
 
 	// Internal state
 	let value: T = UNSET

package/lib/signal.d.ts

@@ -1,7 +1,8 @@
 import { type State } from "./state";
 import { type Computed } from "./computed";
 type Signal<T extends {}> = State<T> | Computed<T>;
-type MaybeSignal<T extends {}> = Signal<T> | T | (() => T) | ((abort: AbortSignal) => Promise<T>);
+type ComputedCallback<T extends {}> = (abort?: AbortSignal) => T | Promise<T>;
+type MaybeSignal<T extends {}> = Signal<T> | T | ComputedCallback<T>;
 declare const UNSET: any;
 /**
  * Check whether a value is a Signal or not
@@ -18,7 +19,7 @@ declare const isSignal: <T extends {}>(value: any) => value is Signal<T>;
  * @param {unknown} value - value to check
  * @returns {boolean} - true if value is a callback or callbacks object, false otherwise
  */
-declare const isComputedCallback: <T extends {}>(value: unknown) => value is (abort?: AbortSignal) => T | Promise<T>;
+declare const isComputedCallback: <T extends {}>(value: unknown) => value is ComputedCallback<T>;
 /**
  * Convert a value to a Signal if it's not already a Signal
  *
@@ -41,4 +42,4 @@ declare const match: <S extends Signal<{}>[], R>(matcher: {
     err: ((...errors: Error[]) => R | Promise<R>);
     nil: (abort?: AbortSignal) => R | Promise<R>;
 }) => R | Promise<R>;
-export { type Signal, type MaybeSignal, UNSET, isSignal, isComputedCallback, toSignal, match, };
+export { type Signal, type MaybeSignal, type ComputedCallback, UNSET, isSignal, isComputedCallback, toSignal, match, };

package/lib/signal.ts

@@ -5,7 +5,8 @@ import { isAbortError, isFunction, toError } from "./util"
 /* === Types === */
 
 type Signal<T extends {}> = State<T> | Computed<T>
-type MaybeSignal<T extends {}> = Signal<T> | T | (() => T) | ((abort: AbortSignal) => Promise<T>)
+type ComputedCallback<T extends {}> = (abort?: AbortSignal) => T | Promise<T>
+type MaybeSignal<T extends {}> = Signal<T> | T | ComputedCallback<T>
 
 /* === Constants === */
 
@@ -32,7 +33,7 @@ const isSignal = /*#__PURE__*/ <T extends {}>(value: any): value is Signal<T> =>
  */
 const isComputedCallback = /*#__PURE__*/ <T extends {}>(
 	value: unknown
-): value is (abort?: AbortSignal) => T | Promise<T> =>
+): value is ComputedCallback<T> =>
 	isFunction(value) && value.length < 2
 
 /**
@@ -96,6 +97,6 @@ const match = <S extends Signal<{}>[], R>(
 }
 
 export {
-	type Signal, type MaybeSignal,
+	type Signal, type MaybeSignal, type ComputedCallback,
     UNSET, isSignal, isComputedCallback, toSignal, match,
 }

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@zeix/cause-effect",
-  "version": "0.13.0",
+  "version": "0.13.1",
   "author": "Esther Brunner",
   "main": "index.js",
   "module": "index.ts",
   "devDependencies": {
     "@types/bun": "latest",
-	"random": "^5.3.0"
+    "random": "^5.3.0"
   },
   "peerDependencies": {
     "typescript": "^5.6.3"