flatsignals 0.1.0 → 0.2.1

package/README.md

@@ -1,81 +1,102 @@
 # FlatSignals
 
-FlatSignals is an extremely fast reactivity library (~0.7kb).
+**FlatSignals** is an ultra-fast reactivity library (~0.5 KB) optimized for **high-frequency, few-to-many updates**.
 
-- Lightning-fast batch updates.
-- No graph traversals.
-- Dynamic dependencies managed in O(1) time.
-- Automatic disposals.
-- Computeds are lazy by default.
+## 🚀 Why it’s fast:
+
+- No graph traversals
+- O(1) dynamic dependency management
+- Lazy computations by default
 
 ## Benchmarks
 
-You can execute the [benchmarks](https://github.com/kevintakeda/flatsignals/tree/main/benchmarks) by running `pnpm bench`.
-
-```console
-flatsignals - benchmarks/signals.bench.ts > one to many sparse (32x)
-  1.60x faster than @preact/signals
-  1.70x faster than @reactively/core
-  1.95x faster than alien-signals
-  2.27x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > wide propagation (32x)
-  1.72x faster than @preact/signals
-  1.74x faster than alien-signals
-  2.22x faster than @reactively/core
-  2.94x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > deep propagation (32x)
-  1.02x faster than alien-signals
-  1.29x faster than @preact/signals
-  1.55x faster than @reactively/core
-  1.97x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > dynamic
-  2.82x faster than @preact/signals
-  2.98x faster than @reactively/core
-  3.54x faster than @maverick-js/signals
-  4.56x faster than alien-signals
-
-flatsignals - benchmarks/signals.bench.ts > batch 25%
-  1.26x faster than @preact/signals
-  1.56x faster than alien-signals
-  1.66x faster than @reactively/core
-  1.97x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > batch 50%
-  1.48x faster than @preact/signals
-  1.62x faster than alien-signals
-  1.72x faster than @reactively/core
-  2.09x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > packed 30%
-  1.49x faster than @reactively/core
-  1.77x faster than alien-signals
-  1.77x faster than @preact/signals
-  1.99x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > dense batch ~1/3 (2x layers)
-  1.72x faster than @preact/signals
-  2.17x faster than @reactively/core
-  2.25x faster than alien-signals
-  2.86x faster than @maverick-js/signals
-
-flatsignals - benchmarks/signals.bench.ts > dense batch ~1/3 (4x layers)
-  1.98x faster than @preact/signals
-  2.11x faster than @reactively/core
-  2.75x faster than alien-signals
-  3.05x faster than @maverick-js/signals
-
-alien-signals - benchmarks/signals.bench.ts > one to one to one (32x)
-  1.00x faster than @preact/signals
-  1.05x faster than flatsignals
-  1.16x faster than @maverick-js/signals
-  1.94x faster than @reactively/core
+> **Note:** Benchmarks were run in a controlled environment. Results may vary based on hardware and JavaScript engine. You can reproduce these benchmarks by cloning the repo and running `pnpm bench`.
+
+### 1-to-64 fanout
+
+| Library              | Operations/sec ⚡ | vs flatsignals |
+| -------------------- | ----------------- | -------------- |
+| **flatsignals** 🏆   | **449,848**       | **baseline**   |
+| alien-signals        | 261,082           | 1.72x slower   |
+| @preact/signals      | 230,899           | 1.95x slower   |
+| @reactively/core     | 182,403           | 2.47x slower   |
+| @vue/reactivity      | 152,709           | 2.95x slower   |
+| @maverick-js/signals | 137,712           | 3.27x slower   |
+| Angular Signals      | 98,597            | 4.56x slower   |
+| @solidjs/signals     | 78,849            | 5.71x slower   |
+
+### High-frequency updates
+
+| Library              | Operations/sec ⚡ | vs flatsignals |
+| -------------------- | ----------------- | -------------- |
+| **flatsignals** 🏆   | **976,139**       | **baseline**   |
+| alien-signals        | 502,513           | 1.94x slower   |
+| @preact/signals      | 492,543           | 1.98x slower   |
+| @reactively/core     | 438,882           | 2.22x slower   |
+| @maverick-js/signals | 343,368           | 2.84x slower   |
+| Angular Signals      | 241,189           | 4.05x slower   |
+| @vue/reactivity      | 221,537           | 4.41x slower   |
+| @solidjs/signals     | 202,492           | 4.82x slower   |
+
+### Diamond
+
+| Library              | Operations/sec ⚡ | vs flatsignals |
+| -------------------- | ----------------- | -------------- |
+| **flatsignals** 🏆   | **4,556,987**     | **baseline**   |
+| alien-signals        | 3,028,320         | 1.50x slower   |
+| @preact/signals      | 2,531,788         | 1.80x slower   |
+| @reactively/core     | 1,688,053         | 2.70x slower   |
+| Angular Signals      | 1,614,432         | 2.82x slower   |
+| @vue/reactivity      | 1,563,865         | 2.91x slower   |
+| @maverick-js/signals | 1,407,975         | 3.24x slower   |
+| @solidjs/signals     | 870,080           | 5.24x slower   |
+
+## Installation
+
+```bash
+# npm
+npm install flatsignals
+
+# pnpm
+pnpm add flatsignals
+
+# yarn
+yarn add flatsignals
+```
+
+## Usage
+
+```ts
+import { signal, computed, effect } from "flatsignals";
+
+const counter = signal(0);
+const double = computed(() => counter.val * 2);
+const log = effect(() => console.log(double.val));
+```
+
+## With React
+
+```tsx
+import { useFlatSignal, useFlatReader } from "flatsignals/react";
+import { counter, double } from "./signals";
+
+function MyCounter() {
+  const [val, setVal] = useFlatSignal(counter);
+  return <button onClick={() => setVal(val + 1)}>Count: {val}</button>;
+}
+
+function ReadDouble() {
+  const val = useFlatReader(double);
+  return <div>{val}</div>;
+}
 ```
 
-## Tradeoffs
+## Use Case
+
+> **Best suited for:** Scenarios with a small number of reactive signals driving many dependent computations.
+
+**Limitations:**
 
-1. Supports only 32 signals per root.
-2. Set operations have 𝑂(𝑁) complexity, where 𝑁 is the number of computations. However, multiple updates can be batched into a single operation.
-3. When data sources change, all dependent nodes are marked dirty, even if intermediate values stay the same.
+- **Signal limit**: Maximum of 32 signals per root. Beyond this limit, effects may trigger even when their tracked signals haven't changed.
+- **Set complexity**: O(N) time proportional to dependent computations (amortized through batching)
+- **Eager propagation**: All downstream nodes marked dirty immediately, even when intermediate values unchanged

package/dist/index-BUz21f61.d.ts

@@ -0,0 +1,32 @@
+//#region src/index.d.ts
+declare class FlatRoot {
+  #private;
+  dispose(): void;
+}
+declare class FlatSignal<T = any> {
+  #private;
+  equals: typeof defaultEquality;
+  constructor(val?: T);
+  get val(): T;
+  get peek(): T;
+  get root(): FlatRoot;
+  set val(val: T);
+}
+declare class FlatCompute<T = unknown> {
+  #private;
+  constructor(compute?: () => T, val?: T, effect?: boolean);
+  get val(): T;
+  get peek(): T;
+  get root(): FlatRoot;
+  dispose(): void;
+}
+declare function defaultEquality(a: unknown, b: unknown): boolean;
+declare function batch(fn: () => void): void;
+declare function scoped<T>(fn: () => T, scope?: FlatRoot): T;
+declare function signal<T>(value: T): FlatSignal<T>;
+declare function signal<T = undefined>(): FlatSignal<T | undefined>;
+declare function computed<T>(val: () => T): FlatCompute<T>;
+declare function effect<T = unknown>(fn: () => T): () => void;
+//#endregion
+export { computed as a, signal as c, batch as i, FlatRoot as n, effect as o, FlatSignal as r, scoped as s, FlatCompute as t };
+//# sourceMappingURL=index-BUz21f61.d.ts.map

package/dist/index.d.ts

@@ -1,32 +1,2 @@
-declare class Scope {
-    constructor();
-}
-declare class Root extends Scope {
-    #private;
-}
-declare class DataSignal<T = any> {
-    #private;
-    equals: typeof defaultEquality;
-    constructor(val?: T);
-    get val(): T;
-    set val(val: T);
-}
-declare class Computation<T = unknown> extends Scope {
-    #private;
-    constructor(compute?: () => T, val?: T, effect?: boolean);
-    get val(): T;
-    get peek(): T;
-    getRoot(): Root;
-}
-declare function defaultEquality(a: unknown, b: unknown): boolean;
-declare function getScope(): Scope | null;
-declare function withScope(scope: Scope, fn: () => void): void;
-declare function onDispose(fn: () => void): void;
-declare function batch(fn: () => void): void;
-declare function root<T>(fn: (dispose: () => void) => T, existingRoot?: Root): T;
-declare function signal<T>(value: T): DataSignal<T>;
-declare function signal<T = undefined>(): DataSignal<T | undefined>;
-declare function computed<T>(val: () => T): Computation<T>;
-declare function effect<T = unknown>(fn: () => T): () => void;
-
-export { Computation, DataSignal, Root, Scope, batch, computed, effect, getScope, onDispose, root, signal, withScope };
+import { a as computed, c as signal, i as batch, n as FlatRoot, o as effect, r as FlatSignal, s as scoped, t as FlatCompute } from "./index-BUz21f61.js";
+export { FlatCompute, FlatRoot, FlatSignal, batch, computed, effect, scoped, signal };

package/dist/index.js

@@ -1,209 +1,3 @@
-// src/index.ts
-var ROOT = null;
-var COMPUTED = null;
-var BATCHING = false;
-var ROOT_QUEUE = [];
-var Scope = class {
-  /* @internal */
-  _disposing = false;
-  /* @internal */
-  _disposals = null;
-  constructor() {
-    getScope()?._onDispose(this._dispose.bind(this));
-  }
-  /* @internal */
-  _dispose() {
-    if (this._disposing) return;
-    this._disposing = true;
-    this._disposals?.forEach((fn) => fn());
-    this._disposing = false;
-  }
-  /* @internal */
-  _onDispose(fn) {
-    if (!this._disposals) this._disposals = [];
-    this._disposals.push(fn);
-  }
-};
-var Root = class extends Scope {
-  /* @internal computeds */
-  _c = [];
-  /* @internal disposed computeds */
-  _x = [];
-  /* @internal id generator */
-  _i = 0;
-  /* @internal batch mask */
-  #batch = 0;
-  /* @internal */
-  _dispose() {
-    super._dispose();
-    this._c = [];
-    this._x = [];
-    this._i = 0;
-  }
-  /* @internal Add source */
-  _as() {
-    return this._i++ % 32;
-  }
-  /* @internal Add computed */
-  _ac(c) {
-    if (this._x.length) {
-      const u = this._x.pop();
-      this._c[u] = c;
-      return u;
-    } else {
-      return this._c.push(c) - 1;
-    }
-  }
-  /* @internal Destroy computed */
-  _dc(idx) {
-    this._x.push(idx);
-  }
-  /* @internal */
-  _queue(mask) {
-    if (!this.#batch) {
-      ROOT_QUEUE.push(this);
-    }
-    this.#batch |= mask;
-    if (!BATCHING) this._flush(true);
-  }
-  /* @internal */
-  _flush(force = false) {
-    if (!this.#batch || !force) return;
-    for (const item of this._c) {
-      if (!item._dirty && (item._sources & this.#batch) !== 0) {
-        item._dirty = true;
-        if (item._effect) item.val;
-      }
-    }
-    this.#batch = 0;
-  }
-};
-var DataSignal = class {
-  #root;
-  #val;
-  #id = 0;
-  equals = defaultEquality;
-  constructor(val) {
-    if (!ROOT) ROOT = new Root();
-    this.#root = ROOT;
-    this.#val = val;
-    this.#id |= 1 << this.#root._as();
-  }
-  get val() {
-    if (COMPUTED) {
-      COMPUTED._sources |= this.#id;
-    }
-    return this.#val;
-  }
-  set val(val) {
-    if (this.equals(val, this.#val)) return;
-    this.#val = val;
-    this.#root._queue(this.#id);
-  }
-};
-var Computation = class extends Scope {
-  #root;
-  #id;
-  #val;
-  #fn;
-  /* @internal */
-  _effect = false;
-  /* @internal */
-  _sources = 0;
-  /* @internal */
-  _dirty = true;
-  /* @internal destroyed */
-  _d = false;
-  constructor(compute, val, effect2) {
-    if (!ROOT) ROOT = new Root();
-    super();
-    this.#root = ROOT;
-    this.#fn = compute;
-    this.#val = val;
-    this.#id = this.#root._ac(this);
-    if (effect2) {
-      this._effect = effect2;
-      this.val;
-    }
-  }
-  get val() {
-    this.#root._flush();
-    const prevCurrent = COMPUTED;
-    if (this._dirty) {
-      super._dispose();
-      COMPUTED = this;
-      this._sources = 0;
-      this.#val = this.#fn();
-      this._dirty = false;
-      COMPUTED = prevCurrent;
-    }
-    if (prevCurrent) {
-      prevCurrent._sources |= this._sources;
-    }
-    return this.#val;
-  }
-  get peek() {
-    return this.#val;
-  }
-  getRoot() {
-    return this.#root;
-  }
-  /* @internal */
-  _dispose() {
-    if (this._d) return;
-    super._dispose();
-    this._sources = 0;
-    this._dirty = false;
-    this._d = true;
-    this.#root._dc(this.#id);
-  }
-};
-function defaultEquality(a, b) {
-  return a === b;
-}
-function getScope() {
-  return COMPUTED || ROOT;
-}
-function withScope(scope, fn) {
-  const prevComputed = COMPUTED, prevRoot = ROOT;
-  if (scope instanceof Computation) COMPUTED = scope;
-  ROOT = COMPUTED?.getRoot() ?? ROOT;
-  const result = fn();
-  COMPUTED = prevComputed;
-  ROOT = prevRoot;
-  return result;
-}
-function onDispose(fn) {
-  getScope()?._onDispose(fn);
-}
-function batch(fn) {
-  if (BATCHING) return fn();
-  BATCHING = true;
-  fn();
-  if (ROOT_QUEUE.length) {
-    for (const el of ROOT_QUEUE) el._flush(true);
-    ROOT_QUEUE = [];
-  }
-  BATCHING = false;
-}
-function root(fn, existingRoot) {
-  const prevRoot = ROOT;
-  const prevScope = getScope();
-  ROOT = existingRoot ?? new Root();
-  prevScope?._onDispose(ROOT._dispose.bind(ROOT));
-  const result = fn(ROOT._dispose.bind(ROOT));
-  ROOT = prevRoot;
-  return result;
-}
-function signal(value) {
-  return new DataSignal(value);
-}
-function computed(val) {
-  return new Computation(val);
-}
-function effect(fn) {
-  const sig = new Computation(fn, void 0, true);
-  return sig._dispose.bind(sig);
-}
+import { a as computed, c as signal, i as batch, n as FlatRoot, o as effect, r as FlatSignal, s as scoped, t as FlatCompute } from "./src-CJj34M6F.js";
 
-export { Computation, DataSignal, Root, Scope, batch, computed, effect, getScope, onDispose, root, signal, withScope };
+export { FlatCompute, FlatRoot, FlatSignal, batch, computed, effect, scoped, signal };

package/dist/react.d.ts

@@ -0,0 +1,11 @@
+import { n as FlatRoot, r as FlatSignal, t as FlatCompute } from "./index-BUz21f61.js";
+
+//#region src/react/index.d.ts
+declare function useFlatReader<T>(signal: FlatSignal<T> | FlatCompute<T>, isEqual?: (a: T, b: T) => boolean): T;
+declare function useFlatWriter<T>(signal: FlatSignal<T>): (val: T | ((oldVal: T) => T)) => void;
+declare function useFlatSignal<T>(signal: FlatSignal<T>): readonly [T, (val: T | ((oldVal: T) => T)) => void];
+declare function useFlatEffect(fn: () => undefined | (() => void)): void;
+declare function useFlatScope<T>(callback: () => T, scope?: FlatRoot): T;
+//#endregion
+export { useFlatEffect, useFlatReader, useFlatScope, useFlatSignal, useFlatWriter };
+//# sourceMappingURL=react.d.ts.map

package/dist/react.js

@@ -0,0 +1,43 @@
+import { o as effect, s as scoped } from "./src-CJj34M6F.js";
+import { useCallback, useEffect, useMemo, useRef, useSyncExternalStore } from "react";
+
+//#region src/react/index.ts
+function useFlatReader(signal, isEqual = Object.is) {
+	const lastValueRef = useRef(signal.peek);
+	return useSyncExternalStore(useCallback((onStoreChange) => scoped(() => effect(() => {
+		const newValue = signal.val;
+		if (!isEqual(lastValueRef.current, newValue)) {
+			lastValueRef.current = newValue;
+			onStoreChange();
+		}
+	}), signal.root), [signal, isEqual]), () => signal.val, () => signal.peek);
+}
+function useFlatWriter(signal) {
+	return useCallback((val) => {
+		if (typeof val === "function") signal.val = val(signal.peek);
+		else signal.val = val;
+	}, [signal]);
+}
+function useFlatSignal(signal) {
+	return [useFlatReader(signal), useFlatWriter(signal)];
+}
+function useFlatEffect(fn) {
+	useEffect(() => {
+		let cleanup;
+		const stop = effect(() => {
+			if (cleanup) cleanup();
+			cleanup = fn();
+		});
+		return () => {
+			if (cleanup) cleanup();
+			stop();
+		};
+	}, [fn]);
+}
+function useFlatScope(callback, scope) {
+	return useMemo(() => scoped(callback, scope), [callback, scope]);
+}
+
+//#endregion
+export { useFlatEffect, useFlatReader, useFlatScope, useFlatSignal, useFlatWriter };
+//# sourceMappingURL=react.js.map

package/dist/react.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"react.js","names":["cleanup: undefined | (() => void)"],"sources":["../src/react/index.ts"],"sourcesContent":["import {\n  useCallback,\n  useEffect,\n  useMemo,\n  useRef,\n  useSyncExternalStore,\n} from \"react\";\nimport {\n  effect,\n  type FlatCompute,\n  type FlatRoot,\n  type FlatSignal,\n  scoped,\n} from \"../index.js\";\n\nexport function useFlatReader<T>(\n  signal: FlatSignal<T> | FlatCompute<T>,\n  isEqual: (a: T, b: T) => boolean = Object.is\n): T {\n  const lastValueRef = useRef<T>(signal.peek);\n\n  return useSyncExternalStore(\n    useCallback(\n      (onStoreChange) =>\n        scoped(\n          () =>\n            effect(() => {\n              const newValue = signal.val;\n              if (!isEqual(lastValueRef.current, newValue)) {\n                lastValueRef.current = newValue;\n                onStoreChange();\n              }\n            }),\n          signal.root\n        ),\n      [signal, isEqual]\n    ),\n    () => signal.val,\n    () => signal.peek\n  );\n}\n\nexport function useFlatWriter<T>(\n  signal: FlatSignal<T>\n): (val: T | ((oldVal: T) => T)) => void {\n  return useCallback(\n    (val) => {\n      if (typeof val === \"function\") {\n        signal.val = (val as (oldVal: T) => T)(signal.peek);\n      } else {\n        signal.val = val;\n      }\n    },\n    [signal]\n  );\n}\n\nexport function useFlatSignal<T>(signal: FlatSignal<T>) {\n  const reader = useFlatReader(signal);\n  const writer = useFlatWriter(signal);\n  return [reader, writer] as const;\n}\n\nexport function useFlatEffect(fn: () => undefined | (() => void)): void {\n  useEffect(() => {\n    let cleanup: undefined | (() => void);\n    const stop = effect(() => {\n      if (cleanup) cleanup();\n      cleanup = fn();\n    });\n\n    return () => {\n      if (cleanup) cleanup();\n      stop();\n    };\n  }, [fn]);\n}\n\nexport function useFlatScope<T>(callback: () => T, scope?: FlatRoot): T {\n  return useMemo(() => scoped(callback, scope), [callback, scope]);\n}\n"],"mappings":";;;;AAeA,SAAgB,cACd,QACA,UAAmC,OAAO,IACvC;CACH,MAAM,eAAe,OAAU,OAAO,KAAK;AAE3C,QAAO,qBACL,aACG,kBACC,aAEI,aAAa;EACX,MAAM,WAAW,OAAO;AACxB,MAAI,CAAC,QAAQ,aAAa,SAAS,SAAS,EAAE;AAC5C,gBAAa,UAAU;AACvB,kBAAe;;GAEjB,EACJ,OAAO,KACR,EACH,CAAC,QAAQ,QAAQ,CAClB,QACK,OAAO,WACP,OAAO,KACd;;AAGH,SAAgB,cACd,QACuC;AACvC,QAAO,aACJ,QAAQ;AACP,MAAI,OAAO,QAAQ,WACjB,QAAO,MAAO,IAAyB,OAAO,KAAK;MAEnD,QAAO,MAAM;IAGjB,CAAC,OAAO,CACT;;AAGH,SAAgB,cAAiB,QAAuB;AAGtD,QAAO,CAFQ,cAAc,OAAO,EACrB,cAAc,OAAO,CACb;;AAGzB,SAAgB,cAAc,IAA0C;AACtE,iBAAgB;EACd,IAAIA;EACJ,MAAM,OAAO,aAAa;AACxB,OAAI,QAAS,UAAS;AACtB,aAAU,IAAI;IACd;AAEF,eAAa;AACX,OAAI,QAAS,UAAS;AACtB,SAAM;;IAEP,CAAC,GAAG,CAAC;;AAGV,SAAgB,aAAgB,UAAmB,OAAqB;AACtE,QAAO,cAAc,OAAO,UAAU,MAAM,EAAE,CAAC,UAAU,MAAM,CAAC"}

package/dist/src-CJj34M6F.js

@@ -0,0 +1,145 @@
+//#region src/index.ts
+let ROOT = null, COMPUTED = null, BATCHING = false, ROOT_QUEUE = null;
+var FlatRoot = class {
+	_c = [];
+	_x = [];
+	_i = 0;
+	#batch = 0;
+	dispose() {
+		this._c = [];
+		this._x = [];
+		this._i = 0;
+	}
+	_as() {
+		return this._i++ % 32;
+	}
+	_ac(c) {
+		if (this._x.length) {
+			const u = this._x.pop();
+			this._c[u] = c;
+			return u;
+		} else return this._c.push(c) - 1;
+	}
+	_dc(idx) {
+		this._x.push(idx);
+	}
+	_queue(mask) {
+		if (!this.#batch) ROOT_QUEUE ??= this;
+		this.#batch |= mask;
+		if (!BATCHING) this._flush(true);
+	}
+	_flush(force = false) {
+		if (!this.#batch || !force) return;
+		for (const item of this._c) if (!item._dirty && (item._sources & this.#batch) !== 0) {
+			item._dirty = true;
+			if (item._effect) item.val;
+		}
+		this.#batch = 0;
+	}
+};
+var FlatSignal = class {
+	#root;
+	#val;
+	#id = 0;
+	equals = defaultEquality;
+	constructor(val) {
+		if (!ROOT) ROOT = new FlatRoot();
+		this.#root = ROOT;
+		this.#val = val;
+		this.#id |= 1 << this.#root._as();
+	}
+	get val() {
+		if (COMPUTED) COMPUTED._sources |= this.#id;
+		return this.#val;
+	}
+	get peek() {
+		return this.#val;
+	}
+	get root() {
+		return this.#root;
+	}
+	set val(val) {
+		if (this.equals(val, this.#val)) return;
+		this.#val = val;
+		this.#root._queue(this.#id);
+	}
+};
+var FlatCompute = class {
+	#root;
+	#id;
+	#val;
+	#fn;
+	_effect = false;
+	_sources = 0;
+	_dirty = true;
+	_d = false;
+	constructor(compute, val, effect$1) {
+		if (!ROOT) ROOT = new FlatRoot();
+		this.#root = ROOT;
+		this.#fn = compute;
+		this.#val = val;
+		this.#id = this.#root._ac(this);
+		if (effect$1) {
+			this._effect = effect$1;
+			this.val;
+		}
+	}
+	get val() {
+		this.#root._flush();
+		const prevCurrent = COMPUTED;
+		if (this._dirty) {
+			COMPUTED = this;
+			this._sources = 0;
+			this.#val = this.#fn();
+			this._dirty = false;
+			COMPUTED = prevCurrent;
+		}
+		if (prevCurrent) prevCurrent._sources |= this._sources;
+		return this.#val;
+	}
+	get peek() {
+		return this.#val;
+	}
+	get root() {
+		return this.#root;
+	}
+	dispose() {
+		if (this._d) return;
+		this._sources = 0;
+		this._dirty = false;
+		this._d = true;
+		this.#root._dc(this.#id);
+	}
+};
+function defaultEquality(a, b) {
+	return a === b;
+}
+function batch(fn) {
+	if (BATCHING) return fn();
+	BATCHING = true;
+	fn();
+	ROOT_QUEUE?._flush(true);
+	ROOT_QUEUE = null;
+	BATCHING = false;
+}
+function scoped(fn, scope) {
+	const prevRoot = ROOT;
+	ROOT = scope ?? new FlatRoot();
+	const result = fn();
+	ROOT = prevRoot;
+	return result;
+}
+function signal(value) {
+	return new FlatSignal(value);
+}
+function computed(val) {
+	return new FlatCompute(val);
+}
+function effect(fn) {
+	const sig = new FlatCompute(fn, void 0, true);
+	return sig.dispose.bind(sig);
+}
+
+//#endregion
+export { computed as a, signal as c, batch as i, FlatRoot as n, effect as o, FlatSignal as r, scoped as s, FlatCompute as t };
+//# sourceMappingURL=src-CJj34M6F.js.map

package/dist/src-CJj34M6F.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"src-CJj34M6F.js","names":["ROOT: FlatRoot | null","COMPUTED: FlatCompute | null","ROOT_QUEUE: FlatRoot | null","#batch","#root","#val","#id","#fn","effect"],"sources":["../src/index.ts"],"sourcesContent":["let ROOT: FlatRoot | null = null,\n\tCOMPUTED: FlatCompute | null = null,\n\tBATCHING = false,\n\tROOT_QUEUE: FlatRoot | null = null;\n\nexport class FlatRoot {\n\t/* @internal computeds */\n\t_c: Array<FlatCompute> = [];\n\t/* @internal disposed computeds */\n\t_x: Array<number> = [];\n\t/* @internal id generator */\n\t_i = 0;\n\t/* @internal batch mask */\n\t#batch: number = 0;\n\n\tdispose() {\n\t\tthis._c = [];\n\t\tthis._x = [];\n\t\tthis._i = 0;\n\t}\n\n\t/* @internal Add source */\n\t_as() {\n\t\treturn this._i++ % 32;\n\t}\n\n\t/* @internal Add computed */\n\t_ac(c: FlatCompute) {\n\t\tif (this._x.length) {\n\t\t\tconst u = this._x.pop()!;\n\t\t\tthis._c[u] = c;\n\t\t\treturn u;\n\t\t} else {\n\t\t\treturn this._c.push(c) - 1;\n\t\t}\n\t}\n\n\t/* @internal Destroy computed */\n\t_dc(idx: number) {\n\t\tthis._x.push(idx);\n\t}\n\n\t/* @internal */\n\t_queue(mask: number) {\n\t\tif (!this.#batch) {\n\t\t\tROOT_QUEUE ??= this;\n\t\t}\n\t\tthis.#batch |= mask;\n\t\tif (!BATCHING) this._flush(true);\n\t}\n\n\t/* @internal */\n\t_flush(force: boolean = false) {\n\t\tif (!this.#batch || !force) return;\n\t\tfor (const item of this._c) {\n\t\t\tif (!item._dirty && (item._sources & this.#batch) !== 0) {\n\t\t\t\titem._dirty = true;\n\t\t\t\tif (item._effect) item.val;\n\t\t\t}\n\t\t}\n\t\tthis.#batch = 0;\n\t}\n}\n\nexport class FlatSignal<T = any> {\n\t#root: FlatRoot;\n\t#val: T;\n\t#id = 0;\n\tequals = defaultEquality;\n\n\tconstructor(val?: T) {\n\t\tif (!ROOT) ROOT = new FlatRoot();\n\t\tthis.#root = ROOT;\n\t\tthis.#val = val as T;\n\t\tthis.#id |= 1 << this.#root._as();\n\t}\n\n\tget val(): T {\n\t\tif (COMPUTED) {\n\t\t\tCOMPUTED._sources |= this.#id;\n\t\t}\n\t\treturn this.#val as T;\n\t}\n\n\tget peek() {\n\t\treturn this.#val;\n\t}\n\n\tget root() {\n\t\treturn this.#root;\n\t}\n\n\tset val(val: T) {\n\t\tif (this.equals(val, this.#val)) return;\n\t\tthis.#val = val as T;\n\t\tthis.#root._queue(this.#id);\n\t}\n}\n\nexport class FlatCompute<T = unknown> {\n\t#root: FlatRoot;\n\t#id: number;\n\t#val: T;\n\t#fn: (() => T) | undefined;\n\t/* @internal */\n\t_effect: boolean = false;\n\t/* @internal */\n\t_sources: number = 0;\n\t/* @internal */\n\t_dirty = true;\n\t/* @internal destroyed */\n\t_d = false;\n\n\tconstructor(compute?: () => T, val?: T, effect?: boolean) {\n\t\tif (!ROOT) ROOT = new FlatRoot();\n\t\tthis.#root = ROOT;\n\t\tthis.#fn = compute;\n\t\tthis.#val = val!;\n\t\tthis.#id = this.#root._ac(this as FlatCompute<unknown>);\n\t\tif (effect) {\n\t\t\tthis._effect = effect;\n\t\t\tthis.val;\n\t\t}\n\t}\n\n\tget val(): T {\n\t\tthis.#root._flush();\n\t\tconst prevCurrent = COMPUTED;\n\t\tif (this._dirty) {\n\t\t\tCOMPUTED = this as FlatCompute<unknown>;\n\t\t\tthis._sources = 0;\n\t\t\tthis.#val = this.#fn!();\n\t\t\tthis._dirty = false;\n\t\t\tCOMPUTED = prevCurrent;\n\t\t}\n\t\tif (prevCurrent) {\n\t\t\tprevCurrent._sources |= this._sources;\n\t\t}\n\t\treturn this.#val!;\n\t}\n\n\tget peek() {\n\t\treturn this.#val;\n\t}\n\n\tget root() {\n\t\treturn this.#root;\n\t}\n\n\tdispose() {\n\t\tif (this._d) return;\n\t\tthis._sources = 0;\n\t\tthis._dirty = false;\n\t\tthis._d = true;\n\t\tthis.#root._dc(this.#id);\n\t}\n}\n\nfunction defaultEquality(a: unknown, b: unknown) {\n\treturn a === b;\n}\n\nexport function batch(fn: () => void) {\n\tif (BATCHING) return fn();\n\tBATCHING = true;\n\tfn();\n\tROOT_QUEUE?._flush(true);\n\tROOT_QUEUE = null;\n\tBATCHING = false;\n}\n\nexport function scoped<T>(fn: () => T, scope?: FlatRoot): T {\n\tconst prevRoot = ROOT;\n\tROOT = scope ?? new FlatRoot();\n\tconst result = fn();\n\tROOT = prevRoot;\n\treturn result;\n}\n\nexport function signal<T>(value: T): FlatSignal<T>;\nexport function signal<T = undefined>(): FlatSignal<T | undefined>;\nexport function signal<T>(value?: T): FlatSignal<T> {\n\treturn new FlatSignal(value);\n}\n\nexport function computed<T>(val: () => T): FlatCompute<T> {\n\treturn new FlatCompute(val);\n}\n\nexport function effect<T = unknown>(fn: () => T) {\n\tconst sig = new FlatCompute(fn, undefined, true);\n\treturn sig.dispose.bind(sig);\n}\n"],"mappings":";AAAA,IAAIA,OAAwB,MAC3BC,WAA+B,MAC/B,WAAW,OACXC,aAA8B;AAE/B,IAAa,WAAb,MAAsB;CAErB,KAAyB,EAAE;CAE3B,KAAoB,EAAE;CAEtB,KAAK;CAEL,SAAiB;CAEjB,UAAU;AACT,OAAK,KAAK,EAAE;AACZ,OAAK,KAAK,EAAE;AACZ,OAAK,KAAK;;CAIX,MAAM;AACL,SAAO,KAAK,OAAO;;CAIpB,IAAI,GAAgB;AACnB,MAAI,KAAK,GAAG,QAAQ;GACnB,MAAM,IAAI,KAAK,GAAG,KAAK;AACvB,QAAK,GAAG,KAAK;AACb,UAAO;QAEP,QAAO,KAAK,GAAG,KAAK,EAAE,GAAG;;CAK3B,IAAI,KAAa;AAChB,OAAK,GAAG,KAAK,IAAI;;CAIlB,OAAO,MAAc;AACpB,MAAI,CAAC,MAAKC,MACT,gBAAe;AAEhB,QAAKA,SAAU;AACf,MAAI,CAAC,SAAU,MAAK,OAAO,KAAK;;CAIjC,OAAO,QAAiB,OAAO;AAC9B,MAAI,CAAC,MAAKA,SAAU,CAAC,MAAO;AAC5B,OAAK,MAAM,QAAQ,KAAK,GACvB,KAAI,CAAC,KAAK,WAAW,KAAK,WAAW,MAAKA,WAAY,GAAG;AACxD,QAAK,SAAS;AACd,OAAI,KAAK,QAAS,MAAK;;AAGzB,QAAKA,QAAS;;;AAIhB,IAAa,aAAb,MAAiC;CAChC;CACA;CACA,MAAM;CACN,SAAS;CAET,YAAY,KAAS;AACpB,MAAI,CAAC,KAAM,QAAO,IAAI,UAAU;AAChC,QAAKC,OAAQ;AACb,QAAKC,MAAO;AACZ,QAAKC,MAAO,KAAK,MAAKF,KAAM,KAAK;;CAGlC,IAAI,MAAS;AACZ,MAAI,SACH,UAAS,YAAY,MAAKE;AAE3B,SAAO,MAAKD;;CAGb,IAAI,OAAO;AACV,SAAO,MAAKA;;CAGb,IAAI,OAAO;AACV,SAAO,MAAKD;;CAGb,IAAI,IAAI,KAAQ;AACf,MAAI,KAAK,OAAO,KAAK,MAAKC,IAAK,CAAE;AACjC,QAAKA,MAAO;AACZ,QAAKD,KAAM,OAAO,MAAKE,GAAI;;;AAI7B,IAAa,cAAb,MAAsC;CACrC;CACA;CACA;CACA;CAEA,UAAmB;CAEnB,WAAmB;CAEnB,SAAS;CAET,KAAK;CAEL,YAAY,SAAmB,KAAS,UAAkB;AACzD,MAAI,CAAC,KAAM,QAAO,IAAI,UAAU;AAChC,QAAKF,OAAQ;AACb,QAAKG,KAAM;AACX,QAAKF,MAAO;AACZ,QAAKC,KAAM,MAAKF,KAAM,IAAI,KAA6B;AACvD,MAAII,UAAQ;AACX,QAAK,UAAUA;AACf,QAAK;;;CAIP,IAAI,MAAS;AACZ,QAAKJ,KAAM,QAAQ;EACnB,MAAM,cAAc;AACpB,MAAI,KAAK,QAAQ;AAChB,cAAW;AACX,QAAK,WAAW;AAChB,SAAKC,MAAO,MAAKE,IAAM;AACvB,QAAK,SAAS;AACd,cAAW;;AAEZ,MAAI,YACH,aAAY,YAAY,KAAK;AAE9B,SAAO,MAAKF;;CAGb,IAAI,OAAO;AACV,SAAO,MAAKA;;CAGb,IAAI,OAAO;AACV,SAAO,MAAKD;;CAGb,UAAU;AACT,MAAI,KAAK,GAAI;AACb,OAAK,WAAW;AAChB,OAAK,SAAS;AACd,OAAK,KAAK;AACV,QAAKA,KAAM,IAAI,MAAKE,GAAI;;;AAI1B,SAAS,gBAAgB,GAAY,GAAY;AAChD,QAAO,MAAM;;AAGd,SAAgB,MAAM,IAAgB;AACrC,KAAI,SAAU,QAAO,IAAI;AACzB,YAAW;AACX,KAAI;AACJ,aAAY,OAAO,KAAK;AACxB,cAAa;AACb,YAAW;;AAGZ,SAAgB,OAAU,IAAa,OAAqB;CAC3D,MAAM,WAAW;AACjB,QAAO,SAAS,IAAI,UAAU;CAC9B,MAAM,SAAS,IAAI;AACnB,QAAO;AACP,QAAO;;AAKR,SAAgB,OAAU,OAA0B;AACnD,QAAO,IAAI,WAAW,MAAM;;AAG7B,SAAgB,SAAY,KAA8B;AACzD,QAAO,IAAI,YAAY,IAAI;;AAG5B,SAAgB,OAAoB,IAAa;CAChD,MAAM,MAAM,IAAI,YAAY,IAAI,QAAW,KAAK;AAChD,QAAO,IAAI,QAAQ,KAAK,IAAI"}

package/package.json

@@ -1,39 +1,64 @@
 {
-  "name": "flatsignals",
-  "version": "0.1.0",
-  "description": "FlatSignals is an extremely fast reactivity library (~0.7kb)",
-  "main": "dist/index.cjs",
-  "module": "dist/index.js",
-  "types": "dist/index.d.ts",
-  "files": [
-    "dist"
-  ],
-  "type": "module",
-  "scripts": {
-    "build": "tsup",
-    "dev": "tsup --watch",
-    "test": "vitest run",
-    "bench": "vitest bench",
-    "test:watch": "vitest",
-    "size": "size-limit"
-  },
-  "license": "MIT",
-  "devDependencies": {
-    "@maverick-js/signals": "^6.0.0",
-    "@preact/signals-core": "^1.12.1",
-    "@reactively/core": "^0.0.8",
-    "@size-limit/preset-small-lib": "^11.2.0",
-    "@types/node": "^22.18.11",
-    "alien-signals": "^3.0.1",
-    "size-limit": "^11.2.0",
-    "tsup": "^8.5.0",
-    "typescript": "^5.9.3",
-    "vitest": "^2.1.9"
-  },
-  "size-limit": [
-    {
-      "path": "dist/index.js",
-      "limit": "1 kB"
-    }
-  ]
+	"name": "flatsignals",
+	"version": "0.2.1",
+	"description": "FlatSignals is an extremely fast reactivity library (~0.7kb)",
+	"main": "dist/index.cjs",
+	"module": "dist/index.js",
+	"types": "dist/index.d.ts",
+	"files": [
+		"dist"
+	],
+	"exports": {
+		".": {
+			"import": "./dist/index.js",
+			"types": "./dist/index.d.ts"
+		},
+		"./react": {
+			"import": "./dist/react.js",
+			"types": "./dist/react.d.ts"
+		}
+	},
+	"type": "module",
+	"scripts": {
+		"build": "tsdown",
+		"dev": "tsdown --watch",
+		"test": "vitest run",
+		"bench": "vitest bench",
+		"test:watch": "vitest",
+		"size": "size-limit"
+	},
+	"license": "MIT",
+	"devDependencies": {
+		"@angular/core": "^20.3.7",
+		"@biomejs/biome": "2.2.6",
+		"@maverick-js/signals": "^6.0.0",
+		"@preact/signals-core": "^1.12.1",
+		"@reactively/core": "^0.0.8",
+		"@size-limit/preset-small-lib": "^11.2.0",
+		"@solidjs/signals": "^0.7.5",
+		"@types/node": "^22.18.12",
+		"@types/react": "^19.2.2",
+		"@vue/reactivity": "^3.5.22",
+		"alien-signals": "^3.0.3",
+		"react": "^19.2.0",
+		"size-limit": "^11.2.0",
+		"solid-js": "^1.9.9",
+		"tsdown": "^0.15.9",
+		"typescript": "^5.9.3",
+		"vitest": "^2.1.9"
+	},
+	"peerDependencies": {
+		"react": "*"
+	},
+	"peerDependenciesMeta": {
+		"react": {
+			"optional": true
+		}
+	},
+	"size-limit": [
+		{
+			"path": "dist/index.js",
+			"limit": "1 kB"
+		}
+	]
 }

package/dist/index.cjs

@@ -1,222 +0,0 @@
-'use strict';
-
-// src/index.ts
-var ROOT = null;
-var COMPUTED = null;
-var BATCHING = false;
-var ROOT_QUEUE = [];
-var Scope = class {
-  /* @internal */
-  _disposing = false;
-  /* @internal */
-  _disposals = null;
-  constructor() {
-    getScope()?._onDispose(this._dispose.bind(this));
-  }
-  /* @internal */
-  _dispose() {
-    if (this._disposing) return;
-    this._disposing = true;
-    this._disposals?.forEach((fn) => fn());
-    this._disposing = false;
-  }
-  /* @internal */
-  _onDispose(fn) {
-    if (!this._disposals) this._disposals = [];
-    this._disposals.push(fn);
-  }
-};
-var Root = class extends Scope {
-  /* @internal computeds */
-  _c = [];
-  /* @internal disposed computeds */
-  _x = [];
-  /* @internal id generator */
-  _i = 0;
-  /* @internal batch mask */
-  #batch = 0;
-  /* @internal */
-  _dispose() {
-    super._dispose();
-    this._c = [];
-    this._x = [];
-    this._i = 0;
-  }
-  /* @internal Add source */
-  _as() {
-    return this._i++ % 32;
-  }
-  /* @internal Add computed */
-  _ac(c) {
-    if (this._x.length) {
-      const u = this._x.pop();
-      this._c[u] = c;
-      return u;
-    } else {
-      return this._c.push(c) - 1;
-    }
-  }
-  /* @internal Destroy computed */
-  _dc(idx) {
-    this._x.push(idx);
-  }
-  /* @internal */
-  _queue(mask) {
-    if (!this.#batch) {
-      ROOT_QUEUE.push(this);
-    }
-    this.#batch |= mask;
-    if (!BATCHING) this._flush(true);
-  }
-  /* @internal */
-  _flush(force = false) {
-    if (!this.#batch || !force) return;
-    for (const item of this._c) {
-      if (!item._dirty && (item._sources & this.#batch) !== 0) {
-        item._dirty = true;
-        if (item._effect) item.val;
-      }
-    }
-    this.#batch = 0;
-  }
-};
-var DataSignal = class {
-  #root;
-  #val;
-  #id = 0;
-  equals = defaultEquality;
-  constructor(val) {
-    if (!ROOT) ROOT = new Root();
-    this.#root = ROOT;
-    this.#val = val;
-    this.#id |= 1 << this.#root._as();
-  }
-  get val() {
-    if (COMPUTED) {
-      COMPUTED._sources |= this.#id;
-    }
-    return this.#val;
-  }
-  set val(val) {
-    if (this.equals(val, this.#val)) return;
-    this.#val = val;
-    this.#root._queue(this.#id);
-  }
-};
-var Computation = class extends Scope {
-  #root;
-  #id;
-  #val;
-  #fn;
-  /* @internal */
-  _effect = false;
-  /* @internal */
-  _sources = 0;
-  /* @internal */
-  _dirty = true;
-  /* @internal destroyed */
-  _d = false;
-  constructor(compute, val, effect2) {
-    if (!ROOT) ROOT = new Root();
-    super();
-    this.#root = ROOT;
-    this.#fn = compute;
-    this.#val = val;
-    this.#id = this.#root._ac(this);
-    if (effect2) {
-      this._effect = effect2;
-      this.val;
-    }
-  }
-  get val() {
-    this.#root._flush();
-    const prevCurrent = COMPUTED;
-    if (this._dirty) {
-      super._dispose();
-      COMPUTED = this;
-      this._sources = 0;
-      this.#val = this.#fn();
-      this._dirty = false;
-      COMPUTED = prevCurrent;
-    }
-    if (prevCurrent) {
-      prevCurrent._sources |= this._sources;
-    }
-    return this.#val;
-  }
-  get peek() {
-    return this.#val;
-  }
-  getRoot() {
-    return this.#root;
-  }
-  /* @internal */
-  _dispose() {
-    if (this._d) return;
-    super._dispose();
-    this._sources = 0;
-    this._dirty = false;
-    this._d = true;
-    this.#root._dc(this.#id);
-  }
-};
-function defaultEquality(a, b) {
-  return a === b;
-}
-function getScope() {
-  return COMPUTED || ROOT;
-}
-function withScope(scope, fn) {
-  const prevComputed = COMPUTED, prevRoot = ROOT;
-  if (scope instanceof Computation) COMPUTED = scope;
-  ROOT = COMPUTED?.getRoot() ?? ROOT;
-  const result = fn();
-  COMPUTED = prevComputed;
-  ROOT = prevRoot;
-  return result;
-}
-function onDispose(fn) {
-  getScope()?._onDispose(fn);
-}
-function batch(fn) {
-  if (BATCHING) return fn();
-  BATCHING = true;
-  fn();
-  if (ROOT_QUEUE.length) {
-    for (const el of ROOT_QUEUE) el._flush(true);
-    ROOT_QUEUE = [];
-  }
-  BATCHING = false;
-}
-function root(fn, existingRoot) {
-  const prevRoot = ROOT;
-  const prevScope = getScope();
-  ROOT = existingRoot ?? new Root();
-  prevScope?._onDispose(ROOT._dispose.bind(ROOT));
-  const result = fn(ROOT._dispose.bind(ROOT));
-  ROOT = prevRoot;
-  return result;
-}
-function signal(value) {
-  return new DataSignal(value);
-}
-function computed(val) {
-  return new Computation(val);
-}
-function effect(fn) {
-  const sig = new Computation(fn, void 0, true);
-  return sig._dispose.bind(sig);
-}
-
-exports.Computation = Computation;
-exports.DataSignal = DataSignal;
-exports.Root = Root;
-exports.Scope = Scope;
-exports.batch = batch;
-exports.computed = computed;
-exports.effect = effect;
-exports.getScope = getScope;
-exports.onDispose = onDispose;
-exports.root = root;
-exports.signal = signal;
-exports.withScope = withScope;

package/dist/index.d.cts

@@ -1,32 +0,0 @@
-declare class Scope {
-    constructor();
-}
-declare class Root extends Scope {
-    #private;
-}
-declare class DataSignal<T = any> {
-    #private;
-    equals: typeof defaultEquality;
-    constructor(val?: T);
-    get val(): T;
-    set val(val: T);
-}
-declare class Computation<T = unknown> extends Scope {
-    #private;
-    constructor(compute?: () => T, val?: T, effect?: boolean);
-    get val(): T;
-    get peek(): T;
-    getRoot(): Root;
-}
-declare function defaultEquality(a: unknown, b: unknown): boolean;
-declare function getScope(): Scope | null;
-declare function withScope(scope: Scope, fn: () => void): void;
-declare function onDispose(fn: () => void): void;
-declare function batch(fn: () => void): void;
-declare function root<T>(fn: (dispose: () => void) => T, existingRoot?: Root): T;
-declare function signal<T>(value: T): DataSignal<T>;
-declare function signal<T = undefined>(): DataSignal<T | undefined>;
-declare function computed<T>(val: () => T): Computation<T>;
-declare function effect<T = unknown>(fn: () => T): () => void;
-
-export { Computation, DataSignal, Root, Scope, batch, computed, effect, getScope, onDispose, root, signal, withScope };