@vielzeug/stateit 2.0.0 → 2.1.0

package/dist/stateit.js

@@ -1,270 +1,214 @@
-//#region src/runtime.ts
-var e = Symbol("stateit.uninitialized"), t = {
-	cleanups: null,
-	deps: null,
-	effect: null
-}, n = {
-	depth: 0,
-	pending: /* @__PURE__ */ new Set()
-}, r = 100, i = (e) => {
-	e.maxEffectIterations !== void 0 && (r = e.maxEffectIterations);
-}, a = () => {
-	n.depth = 0, t.deps = null, t.effect = null, t.cleanups = null, n.pending.clear();
-}, o = class {
-	#e = /* @__PURE__ */ new Set();
-	_track() {
-		if (t.deps !== null && t.effect !== null) {
-			let e = t.effect;
-			this.#e.add(e), t.deps.add(() => this.#e.delete(e));
-		}
-	}
-	_notify() {
-		if (this.#e.size === 0) return;
-		if (n.depth > 0) {
-			for (let e of this.#e) n.pending.add(e);
-			return;
-		}
-		let e = [];
-		for (let t of [...this.#e]) try {
-			t();
-		} catch (t) {
-			e.push(t);
-		}
-		if (e.length) throw e.length === 1 ? e[0] : AggregateError(e, "[stateit] multiple subscriber errors");
-	}
-}, s = (e, n, r, i) => {
-	let a = t.effect, o = t.deps, s = t.cleanups;
-	t.effect = e, t.deps = n, t.cleanups = r;
-	try {
-		return i();
-	} finally {
-		t.effect = a, t.deps = o, t.cleanups = s;
+//#region src/stateit.ts
+var e = Symbol("stateit.uninitialized"), t = 100, n = (e) => Object.assign(e, {
+	dispose: e,
+	[Symbol.dispose]: e
+}), r = (e, t) => {
+	if (typeof e != "object" || !e || Array.isArray(e)) throw TypeError(t);
+}, i = (e) => structuredClone(e), a = (e, t) => {
+	let n = [];
+	for (let t of e) try {
+		t();
+	} catch (e) {
+		n.push(e);
 	}
-}, c = () => {
-	let e = [...n.pending];
-	n.pending.clear();
+	if (n.length === 1) throw n[0];
+	if (n.length > 1) throw AggregateError(n, `[stateit] ${t}`);
+}, o = (e) => {
 	let t = [];
-	for (let n of e) try {
+	for (let n of [...e]) try {
 		n();
 	} catch (e) {
 		t.push(e);
 	}
-	if (t.length) throw t.length === 1 ? t[0] : AggregateError(t, "[stateit] batch errors");
-}, l = (e) => {
-	n.depth++;
-	try {
-		let t = e();
-		return --n.depth === 0 && c(), t;
-	} catch (e) {
-		if (--n.depth === 0) try {
-			c();
-		} catch {}
-		throw e;
-	}
-}, u = Symbol("stateit.signal"), d = Symbol("stateit.store"), f = class extends o {
-	[u] = !0;
-	#e;
-	#t = e;
-	#n = !0;
-	#r = !1;
-	#i;
-	#a = /* @__PURE__ */ new Set();
-	#o = () => {
-		this.#n || (this.#n = !0, this._notify());
+	if (t.length === 1) throw t[0];
+	if (t.length > 1) throw AggregateError(t, "[stateit] subscriber errors");
+}, s = {
+	cleanups: null,
+	deps: null,
+	effect: null
+}, c = (e, t, n, r) => {
+	let i = s;
+	s = {
+		cleanups: n,
+		deps: t,
+		effect: e
 	};
-	constructor(e, t) {
-		super(), this.#e = e, this.#i = t?.equals ?? Object.is, t?.lazy || this.#s();
-	}
-	#s() {
-		for (let e of this.#a) e();
-		this.#a.clear();
-		let t = s(this.#o, this.#a, null, this.#e);
-		this.#n = !1, (this.#t === e || !this.#i(this.#t, t)) && (this.#t = t);
-	}
-	get value() {
-		return this.#r ? this.#t : (this.#n && this.#s(), this._track(), this.#t);
-	}
-	peek() {
-		if (this.#t === e) {
-			if (this.#r) return;
-			this.#s();
-		}
-		return this.#t;
-	}
-	get stale() {
-		return this.#n || this.#r;
-	}
-	dispose() {
-		if (!this.#r) {
-			this.#r = !0;
-			for (let e of this.#a) e();
-			this.#a.clear();
+	try {
+		return r();
+	} finally {
+		s = i;
+	}
+}, l = 0, u = /* @__PURE__ */ new Set(), d = () => {
+	for (; u.size > 0;) {
+		let e = [...u];
+		u.clear(), o(new Set(e));
+	}
+}, f = class {
+	subscribers = /* @__PURE__ */ new Set();
+	track() {
+		!s.effect || !s.deps || (this.subscribers.add(s.effect), s.deps.add(() => this.subscribers.delete(s.effect)));
+	}
+	hasSubscribers() {
+		return this.subscribers.size > 0;
+	}
+	notify() {
+		if (this.subscribers.size !== 0) {
+			if (l > 0) {
+				for (let e of this.subscribers) u.add(e);
+				return;
+			}
+			o(this.subscribers);
 		}
 	}
-	[Symbol.dispose]() {
-		this.dispose();
-	}
-}, p = (e, t) => new f(e, t), m = class extends f {
-	#e;
-	constructor(e, t, n) {
-		super(e, n), this.#e = t;
-	}
-	get value() {
-		return super.value;
-	}
-	set value(e) {
-		this.#e(e);
-	}
-	update(e) {
-		this.#e(e(this.peek()));
-	}
-}, h = (e, t, n) => new m(e, t, n), g = (e, t, n) => p(() => t(...e.map((e) => e.value)), n), _ = (e, t) => {
-	let n, i = /* @__PURE__ */ new Set(), a = !1, o = !1, c = !1, l = t?.maxIterations ?? r, u = () => {
-		n?.(), n = void 0;
-		for (let e of i) e();
-		i.clear();
-	}, d = () => {
-		o = !1, u();
-		let r = [], a, l = !1;
-		try {
-			s(f, i, r, () => {
-				let t = e();
-				typeof t == "function" && r.push(t);
-			});
-		} catch (e) {
-			if (t?.onError) l = !0, a = e;
-			else throw e;
-		}
-		return n = r.length > 0 ? () => {
-			for (let e of r) e();
-		} : void 0, l && (u(), t.onError(a), c = !0), l;
-	}, f = () => {
-		if (c || a) {
-			a && (o = !0);
-			return;
-		}
-		a = !0;
-		try {
-			let e = 0;
-			do {
-				if (++e > l) throw Error(`[stateit] effect: possible infinite reactive loop (> ${l} iterations)`);
-				if (d()) break;
-			} while (o);
-		} finally {
-			a = !1;
-		}
-	};
-	f();
-	let p = () => {
-		c || (c = !0, u());
-	};
-	return Object.assign(p, {
-		dispose: p,
-		[Symbol.dispose]: p
-	});
-}, v = (e) => s(null, null, null, e), y = (e) => {
-	t.cleanups?.push(e);
-}, b = class extends o {
-	[u] = !0;
-	#e;
-	#t;
+}, p = class extends f {
+	value_;
+	equals_;
 	constructor(e, t) {
-		super(), this.#e = e, this.#t = t?.equals ?? Object.is;
+		super(), this.value_ = e, this.equals_ = t ?? Object.is;
 	}
 	get value() {
-		return this._track(), this.#e;
+		return this.track(), this.value_;
 	}
 	set value(e) {
-		this.#t(this.#e, e) || (this.#e = e, this._notify());
+		this.equals_(this.value_, e) || (this.value_ = e, this.notify());
 	}
 	update(e) {
-		this.value = e(this.#e);
-	}
-	peek() {
-		return this.#e;
-	}
-}, x = (e, t) => new b(e, t), S = /* @__PURE__ */ new WeakMap(), C = (e) => {
-	let t = S.get(e);
-	if (t) return t;
-	let n = {
-		get [u]() {
-			return !0;
-		},
-		peek: () => e.peek(),
-		get value() {
-			return e.value;
+		this.value = e(this.value_);
+	}
+}, m = class extends f {
+	value_ = e;
+	dirty_ = !0;
+	disposed_ = !1;
+	deps_ = /* @__PURE__ */ new Set();
+	compute_;
+	equals_;
+	onDepChange = () => {
+		if (!this.disposed_) {
+			if (this.subscribers.size === 0) {
+				this.dirty_ = !0;
+				return;
+			}
+			this.recompute() && this.notify();
 		}
 	};
-	return S.set(e, n), n;
-}, w = (e) => typeof e == "object" && !!e && u in e, T = (e) => w(e) ? e.value : e, E = (e) => w(e) ? e.peek() : e, D = (e, t) => {
-	if (e === t) return !0;
-	if (e == null || t == null) return e === t;
-	if (typeof e != "object" || typeof t != "object") return !1;
-	let n = Object.keys(e), r = Object.keys(t);
-	if (n.length !== r.length) return !1;
-	for (let r of n) if (!Object.is(e[r], t[r])) return !1;
-	return !0;
-}, O = class extends b {
-	[d] = !0;
-	#e;
-	#t = !1;
 	constructor(e, t) {
-		super(e, { equals: t?.equals ?? D }), this.#e = { ...e };
+		super(), this.compute_ = e, this.equals_ = t ?? Object.is, this.recompute();
 	}
-	get frozen() {
-		return this.#t;
+	recompute() {
+		for (let e of this.deps_) e();
+		this.deps_.clear();
+		let t = c(this.onDepChange, this.deps_, null, this.compute_);
+		return this.dirty_ = !1, this.value_ === e || !this.equals_(this.value_, t) ? (this.value_ = t, !0) : !1;
 	}
 	get value() {
-		return super.value;
-	}
-	set value(e) {
-		this.#t || (super.value = e);
+		if (this.disposed_) throw Error("[stateit] Cannot read disposed computed signal");
+		return this.dirty_ && this.recompute(), this.track(), this.value_;
 	}
-	patch(e) {
-		this.value = {
-			...this.peek(),
-			...e
-		};
-	}
-	update(e) {
-		this.value = e({ ...this.peek() });
+	get stale() {
+		return this.dirty_;
 	}
-	reset() {
-		this.value = { ...this.#e };
+	dispose() {
+		if (!this.disposed_) {
+			this.disposed_ = !0, this.dirty_ = !0;
+			for (let e of this.deps_) e();
+			this.deps_.clear();
+		}
 	}
-	select(e, t) {
-		return p(() => e(this.value), t);
+	[Symbol.dispose]() {
+		this.dispose();
 	}
-	freeze() {
-		this.#t = !0;
+}, h = (e, t) => new p(e, t?.equals), g = (e, t) => {
+	let n = new m(e, t?.equals);
+	return s.effect !== null && s.cleanups !== null && b(() => n.dispose()), n;
+}, _ = (e) => {
+	l++;
+	try {
+		let t = e();
+		return --l === 0 && d(), t;
+	} catch (e) {
+		throw --l === 0 && d(), e;
 	}
-}, k = (e, t) => new O(e, t), A = (e) => typeof e == "object" && !!e && d in e, j = (e, t, n) => {
-	let r = n?.equals ?? Object.is, i = e.peek();
+}, v = (e, r) => {
+	let i, o = /* @__PURE__ */ new Set(), s = !1, l = !1, u = !1, d = r?.maxIterations ?? t, f = () => {
+		let e = [];
+		i && e.push(i), i = void 0;
+		for (let t of o) e.push(t);
+		o.clear(), a(e, "effect teardown errors");
+	}, p = () => {
+		if (!u) {
+			if (s) {
+				l = !0;
+				return;
+			}
+			s = !0;
+			try {
+				let t = 0;
+				do {
+					if (++t > d) throw Error(`[stateit] infinite effect loop (> ${d} iterations)`);
+					l = !1, f();
+					let n = [], r = c(p, o, n, e);
+					r && n.push(r), n.length > 0 && (i = () => {
+						a(n, "effect cleanup errors");
+					});
+				} while (l && !u);
+			} finally {
+				s = !1;
+			}
+		}
+	};
+	return p(), n(() => {
+		u || (u = !0, f());
+	});
+}, y = (e) => c(null, null, null, e), b = (e) => {
+	if (s.cleanups === null) throw Error("[stateit] onCleanup() must be called from inside an active effect.");
+	s.cleanups.push(e);
+}, x = (e, t, n) => {
+	let r = n?.equals ?? Object.is, i = y(() => e.value);
 	n?.immediate && t(i, i);
-	let a;
-	return a = _(() => {
+	let a = v(() => {
 		let o = e.value;
-		if (!r(i, o)) {
-			let e = i;
-			i = o, t(o, e), n?.once && a();
+		if (r(i, o)) return;
+		let s = i;
+		i = o, t(o, s), n?.once && a();
+	});
+	return a;
+};
+function S(e, t, r, i) {
+	if (typeof r == "function") {
+		let a = t, o = r, s = g(() => a(e.value)), c = x(s, o, i);
+		return n(() => {
+			c(), s.dispose();
+		});
+	}
+	return x(e, t, r);
+}
+var C = (e, t) => {
+	r(e, "[stateit] store() requires a plain object initial state.");
+	let n = i(e), a = h(i(e), t);
+	return {
+		patch(e) {
+			if (typeof e != "object" || !e || Array.isArray(e)) throw TypeError("[stateit] store.patch() requires a plain object partial.");
+			a.value = {
+				...a.value,
+				...e
+			};
+		},
+		reset() {
+			a.value = i(n);
+		},
+		update(e) {
+			let t = e(a.value);
+			r(t, "[stateit] store.update() must return a plain object."), a.value = t;
+		},
+		get value() {
+			return a.value;
+		},
+		set value(e) {
+			r(e, "[stateit] Store value must always be a plain object."), a.value = e;
 		}
-	}), a;
-}, M = (e, t, n) => new Promise((r, i) => {
-	let a = n?.signal;
-	try {
-		a?.throwIfAborted();
-	} catch (e) {
-		i(e);
-		return;
-	}
-	let o = j(e, (e) => {
-		(!t || t(e)) && (o(), a?.removeEventListener("abort", s), r(e));
-	}), s = () => {
-		o(), i(a.reason);
 	};
-	a?.addEventListener("abort", s, { once: !0 });
-});
+}, w = (e) => e, T = (e) => e, E = (e) => typeof e != "object" || !e ? !1 : "value" in e, D = (e) => E(e) ? e.value : e, O = (e) => E(e) ? e.value : typeof e == "function" ? e() : e;
 //#endregion
-export { f as ComputedNode, b as SignalImpl, m as WritableNode, u as _SIGNAL_BRAND, d as _STORE_BRAND, c as _flushPending, a as _resetContextForTesting, l as batch, p as computed, i as configureStateit, g as derived, _ as effect, w as isSignal, A as isStore, M as nextValue, y as onCleanup, E as peekValue, C as readonly, D as shallowEqual, x as signal, k as store, T as toValue, v as untrack, j as watch, h as writable };
+export { _ as batch, g as computed, v as effect, E as isSignal, b as onCleanup, D as peekValue, w as readonly, h as signal, C as store, O as toValue, y as untrack, S as watch, T as writable };
 
 //# sourceMappingURL=stateit.js.map

package/dist/stateit.js.map

@@ -1 +1 @@
-{"version":3,"file":"stateit.js","names":["#subscribers","#onDepChange","#dirty","#compute","#equals","#recompute","#deps","#value","#disposed","#set","#value","#equals","#initial","#frozen"],"sources":["../src/runtime.ts","../src/batch.ts","../src/types.ts","../src/computed.ts","../src/effect.ts","../src/signal.ts","../src/store.ts","../src/watch.ts"],"sourcesContent":["import type { CleanupFn, EffectCallback } from './types';\n\n/** @internal True outside of production builds; gates dev-only warnings. */\nexport const _DEV = import.meta.env.DEV;\n\nexport const _UNINITIALIZED = Symbol('stateit.uninitialized');\n\n/** @internal Active reactive tracking scope — null outside any effect/computed. */\nexport const scope = {\n  cleanups: null as CleanupFn[] | null,\n  deps: null as Set<CleanupFn> | null,\n  effect: null as EffectCallback | null,\n};\n\n/** @internal Deferred notification queue — active only during batch(). */\nexport const queue = {\n  depth: 0,\n  pending: new Set<EffectCallback>(),\n};\n\nexport let _maxEffectIterations = 100;\n\n/**\n * Configures global stateit behaviour.\n * @example configureStateit({ maxEffectIterations: 200 });\n */\nexport const configureStateit = (opts: { maxEffectIterations?: number }): void => {\n  if (opts.maxEffectIterations !== undefined) _maxEffectIterations = opts.maxEffectIterations;\n};\n\n/**\n * Resets the shared reactive context. Use in test setup/teardown to prevent state\n * leaks between tests when a batch or effect throws without being fully cleaned up.\n */\nexport const _resetContextForTesting = (): void => {\n  queue.depth = 0;\n  scope.deps = null;\n  scope.effect = null;\n  scope.cleanups = null;\n  queue.pending.clear();\n};\n\n/** @internal Base reactive node: manages a subscriber set and batch-aware notification. */\nexport class ReactiveNode {\n  #subscribers = new Set<EffectCallback>();\n\n  /** Register the current tracking scope as a subscriber and store an unsubscribe\n   *  function in scope.deps for automatic cleanup when the effect re-runs. */\n  protected _track(): void {\n    if (scope.deps !== null && scope.effect !== null) {\n      const fn = scope.effect;\n\n      this.#subscribers.add(fn);\n      scope.deps.add(() => this.#subscribers.delete(fn));\n    }\n  }\n\n  /** Notify all subscribers. Respects batch queue depth. */\n  protected _notify(): void {\n    if (this.#subscribers.size === 0) return;\n\n    if (queue.depth > 0) {\n      for (const fn of this.#subscribers) queue.pending.add(fn);\n\n      return;\n    }\n\n    const errors: unknown[] = [];\n\n    for (const fn of [...this.#subscribers]) {\n      try {\n        fn();\n      } catch (e) {\n        errors.push(e);\n      }\n    }\n\n    if (errors.length) {\n      throw errors.length === 1 ? errors[0] : new AggregateError(errors, '[stateit] multiple subscriber errors');\n    }\n  }\n}\n\n/** @internal Save scope fields, swap to new tracking context, call fn, restore. */\nexport const _withCtx = <T>(\n  eff: EffectCallback | null,\n  deps: Set<CleanupFn> | null,\n  cleanups: CleanupFn[] | null,\n  fn: () => T,\n): T => {\n  const pe = scope.effect;\n  const pd = scope.deps;\n  const pc = scope.cleanups;\n\n  scope.effect = eff;\n  scope.deps = deps;\n  scope.cleanups = cleanups;\n\n  try {\n    return fn();\n  } finally {\n    scope.effect = pe;\n    scope.deps = pd;\n    scope.cleanups = pc;\n  }\n};\n","import { _DEV, queue } from './runtime';\n\n/** @internal Drain and run all pending effects from the batch queue, collecting errors. */\nexport const _flushPending = (): void => {\n  const toFlush = [...queue.pending];\n\n  queue.pending.clear();\n\n  const errors: unknown[] = [];\n\n  for (const f of toFlush) {\n    try {\n      f();\n    } catch (e) {\n      errors.push(e);\n    }\n  }\n\n  if (errors.length) throw errors.length === 1 ? errors[0] : new AggregateError(errors, '[stateit] batch errors');\n};\n\n/** Runs fn and defers all Signal notifications until fn returns, then flushes once. */\nexport const batch = <T>(fn: () => T): T => {\n  queue.depth++;\n\n  try {\n    const result = fn();\n\n    if (--queue.depth === 0) _flushPending();\n\n    return result;\n  } catch (e) {\n    if (--queue.depth === 0) {\n      try {\n        _flushPending();\n      } catch (flushErr) {\n        if (_DEV)\n          console.error(\n            '[stateit] batch: a secondary flush error was suppressed (callback error takes precedence)',\n            flushErr,\n          );\n      }\n    }\n\n    throw e;\n  }\n};\n","/** A function that tears down a subscription or effect. */\nexport type CleanupFn = () => void;\n\n/** The shape of a function passed to `effect()`. Can return an optional cleanup. */\nexport type EffectCallback = () => CleanupFn | void;\n\nexport type EqualityFn<T> = (a: T, b: T) => boolean;\n\n/** Options accepted by signal(), computed(), writable(), and store(). */\nexport type ReactiveOptions<T> = { equals?: EqualityFn<T> };\n\n/** Shared interface for disposable reactive values (computed, writable). Supports the TC39 `using` declaration. */\nexport interface Disposable {\n  dispose(): void;\n  [Symbol.dispose](): void;\n}\n\n/**\n * A callable subscription handle returned by `effect()` and `watch()`.\n * Can be called directly or via `.dispose()` to stop the subscription.\n * Supports the TC39 `using` declaration via `[Symbol.dispose]`.\n */\nexport interface Subscription {\n  (): void;\n  dispose(): void;\n  [Symbol.dispose](): void;\n}\n\nexport const _SIGNAL_BRAND = Symbol('stateit.signal');\nexport const _STORE_BRAND = Symbol('stateit.store');\n\n/** Public read-only signal interface. */\nexport interface ReadonlySignal<T> {\n  readonly [_SIGNAL_BRAND]: true;\n  readonly value: T;\n  peek(): T;\n}\n\n/** Public read/write signal interface. */\nexport interface Signal<T> extends ReadonlySignal<T> {\n  value: T;\n  /** Update the value by applying a function to the current value. */\n  update(fn: (current: T) => T): void;\n}\n","import { ReactiveNode, _DEV, _UNINITIALIZED, _withCtx } from './runtime';\nimport {\n  type CleanupFn,\n  type Disposable,\n  type EffectCallback,\n  type EqualityFn,\n  type ReactiveOptions,\n  type ReadonlySignal,\n  type Signal,\n  _SIGNAL_BRAND,\n} from './types';\n\n/** A derived read-only signal with an explicit dispose method. */\nexport interface ComputedSignal<T> extends ReadonlySignal<T>, Disposable {\n  /** True when the computed value is stale (deps changed but not yet re-read) or disposed. */\n  readonly stale: boolean;\n}\n\n/** @internal\n * Lazy computed node. Seeded once at construction so .peek() is immediately valid\n * (unless { lazy: true } is passed, in which case first compute defers to first read).\n *  - On dep change: marks dirty, notifies downstream (no recompute yet).\n *  - On .value read: recomputes if dirty, re-tracks fresh deps.\n *  - After dispose: _track() is skipped to prevent leaking outer effects.\n */\nexport class ComputedNode<T> extends ReactiveNode implements ComputedSignal<T> {\n  readonly [_SIGNAL_BRAND] = true as const;\n  #compute: () => T;\n  #value: T | typeof _UNINITIALIZED = _UNINITIALIZED;\n  #dirty = true;\n  #disposed = false;\n  #equals: EqualityFn<T>;\n  #deps = new Set<CleanupFn>();\n\n  readonly #onDepChange: EffectCallback = () => {\n    if (!this.#dirty) {\n      this.#dirty = true;\n      this._notify();\n    }\n  };\n\n  constructor(compute: () => T, options?: ReactiveOptions<T> & { lazy?: boolean }) {\n    super();\n    this.#compute = compute;\n    this.#equals = options?.equals ?? Object.is;\n\n    if (!options?.lazy) this.#recompute(); // seed: ensures peek() is valid immediately\n  }\n\n  #recompute(): void {\n    for (const unsub of this.#deps) unsub();\n    this.#deps.clear();\n\n    const result = _withCtx(this.#onDepChange, this.#deps, null, this.#compute);\n\n    this.#dirty = false;\n\n    if (this.#value === _UNINITIALIZED || !this.#equals(this.#value as T, result)) {\n      this.#value = result;\n    }\n  }\n\n  get value(): T {\n    if (this.#disposed) {\n      if (_DEV) console.warn('[stateit] Reading a disposed ComputedSignal returns a stale value.');\n\n      return this.#value as T;\n    }\n\n    if (this.#dirty) this.#recompute();\n\n    this._track();\n\n    return this.#value as T;\n  }\n\n  peek(): T {\n    if (this.#value === _UNINITIALIZED) {\n      if (this.#disposed) {\n        if (_DEV)\n          console.warn(\n            '[stateit] peek() called on a disposed lazy ComputedSignal that was never read — returning undefined.',\n          );\n\n        return undefined as unknown as T;\n      }\n\n      this.#recompute();\n    }\n\n    return this.#value as T;\n  }\n\n  get stale(): boolean {\n    return this.#dirty || this.#disposed;\n  }\n\n  dispose(): void {\n    if (this.#disposed) return;\n\n    this.#disposed = true;\n    for (const unsub of this.#deps) unsub();\n    this.#deps.clear();\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n}\n\n/** Creates a derived read-only Signal whose value is recomputed lazily on `.value` read\n * when dependencies have changed. Call `.dispose()` to stop tracking and free dependencies.\n * Pass `{ lazy: true }` to defer the initial computation until the first `.value` read. */\nexport const computed = <T>(compute: () => T, options?: ReactiveOptions<T> & { lazy?: boolean }): ComputedSignal<T> =>\n  new ComputedNode(compute, options);\n\n/** A bidirectional computed Signal with an explicit dispose method. */\nexport interface WritableSignal<T> extends Signal<T>, Disposable {\n  /** True when the backing computed value is stale (deps changed but not yet re-read) or disposed. */\n  readonly stale: boolean;\n}\n\n/** @internal */\nexport class WritableNode<T> extends ComputedNode<T> implements WritableSignal<T> {\n  readonly #set: (v: T) => void;\n\n  constructor(get: () => T, set: (v: T) => void, options?: ReactiveOptions<T>) {\n    super(get, options);\n    this.#set = set;\n  }\n\n  override get value(): T {\n    return super.value;\n  }\n\n  set value(v: T) {\n    this.#set(v);\n  }\n\n  update(fn: (current: T) => T): void {\n    this.#set(fn(this.peek()));\n  }\n}\n\n/** Creates a bidirectional computed Signal. Reads track the getter reactively;\n * writes are forwarded to `set`. Call `.dispose()` to stop tracking and free dependencies. */\nexport const writable = <T>(get: () => T, set: (value: T) => void, options?: ReactiveOptions<T>): WritableSignal<T> =>\n  new WritableNode(get, set, options);\n\n/**\n * Creates a derived ComputedSignal by combining multiple source signals through a projector\n * function. Each source is passed as a positional argument to `fn`; the projector is\n * re-evaluated whenever any source changes.\n *\n * @example\n * const total = derived([price, quantity, discount], (p, q, d) => p * q * (1 - d));\n */\nexport const derived = <const Srcs extends ReadonlyArray<ReadonlySignal<unknown>>, R>(\n  sources: Srcs,\n  fn: (...values: { [K in keyof Srcs]: Srcs[K] extends ReadonlySignal<infer V> ? V : never }) => R,\n  options?: ReactiveOptions<R>,\n): ComputedSignal<R> => computed(() => (fn as (...args: any[]) => R)(...sources.map((s) => s.value)), options);\n","import { _DEV, _maxEffectIterations, _withCtx, scope } from './runtime';\nimport { type CleanupFn, type EffectCallback, type Subscription } from './types';\n\n/** Options for the `effect()` primitive. */\nexport type EffectOptions = {\n  /**\n   * Maximum re-entrant iterations before throwing to prevent infinite loops.\n   * Overrides the global value set via `configureStateit` for this specific effect.\n   */\n  maxIterations?: number;\n  /**\n   * Called when the effect function throws. When provided, the effect is automatically\n   * disposed after the first error — it won't re-run on subsequent dependency changes.\n   */\n  onError?: (error: unknown) => void;\n};\n\n/** Runs fn immediately and re-runs it whenever any Signal read inside it changes. Returns a dispose handle. */\nexport const effect = (fn: EffectCallback, options?: EffectOptions): Subscription => {\n  let cleanup: CleanupFn | undefined;\n  const deps = new Set<CleanupFn>();\n  let running = false;\n  let dirty = false;\n  let disposed = false;\n  const maxIter = options?.maxIterations ?? _maxEffectIterations;\n\n  /** Tears down the current run: calls cleanup and unsubscribes all deps. */\n  const teardown = (): void => {\n    cleanup?.();\n    cleanup = undefined;\n    for (const unsub of deps) unsub();\n    deps.clear();\n  };\n\n  /** Runs a single iteration: tears down previous deps/cleanup, re-executes fn, registers fresh deps.\n   *  Returns true if onError handled a throw (caller should break the loop). */\n  const runIteration = (): boolean => {\n    dirty = false;\n    teardown();\n\n    const cleanups: CleanupFn[] = [];\n    let thrownError: unknown;\n    let threw = false;\n\n    try {\n      _withCtx(runner, deps, cleanups, () => {\n        const result = fn();\n\n        if (typeof result === 'function') cleanups.push(result);\n      });\n    } catch (e) {\n      if (options?.onError) {\n        threw = true;\n        thrownError = e;\n      } else throw e;\n    }\n\n    cleanup =\n      cleanups.length > 0\n        ? () => {\n            for (const c of cleanups) c();\n          }\n        : undefined;\n\n    if (threw) {\n      teardown(); // flush onCleanup registrations from the throwing run\n      options!.onError!(thrownError);\n      disposed = true;\n    }\n\n    return threw;\n  };\n\n  const runner: EffectCallback = () => {\n    if (disposed || running) {\n      if (running) dirty = true;\n\n      return;\n    }\n\n    running = true;\n\n    try {\n      let iterations = 0;\n\n      do {\n        if (++iterations > maxIter)\n          throw new Error(`[stateit] effect: possible infinite reactive loop (> ${maxIter} iterations)`);\n\n        if (runIteration()) break;\n      } while (dirty);\n    } finally {\n      running = false;\n    }\n  };\n\n  runner();\n\n  const dispose = (): void => {\n    if (disposed) return;\n\n    disposed = true;\n    teardown();\n  };\n\n  return Object.assign(dispose, { dispose, [Symbol.dispose]: dispose }) as Subscription;\n};\n\n/** Runs fn without registering any reactive dependencies. */\nexport const untrack = <T>(fn: () => T): T => _withCtx(null, null, null, fn);\n\n/**\n * Registers a cleanup function within the currently running effect.\n * Called before the effect re-runs and on final dispose.\n * Allows nested helpers to register teardown without needing the effect's return value.\n *\n * @example\n * effect(() => {\n *   const id = setInterval(() => { ... }, 1000);\n *   onCleanup(() => clearInterval(id));\n * });\n */\nexport const onCleanup = (fn: CleanupFn): void => {\n  if (_DEV && scope.cleanups === null) {\n    console.warn('[stateit] onCleanup() called outside of an active effect — the cleanup will never run.');\n  }\n\n  scope.cleanups?.push(fn);\n};\n","import { ReactiveNode } from './runtime';\nimport { type EqualityFn, type ReactiveOptions, type ReadonlySignal, type Signal, _SIGNAL_BRAND } from './types';\n\n/** @internal */\nexport class SignalImpl<T> extends ReactiveNode implements Signal<T> {\n  readonly [_SIGNAL_BRAND] = true as const;\n  #value: T;\n  #equals: EqualityFn<T>;\n\n  constructor(initial: T, options?: ReactiveOptions<T>) {\n    super();\n    this.#value = initial;\n    this.#equals = options?.equals ?? Object.is;\n  }\n\n  get value(): T {\n    this._track();\n\n    return this.#value;\n  }\n\n  set value(next: T) {\n    if (this.#equals(this.#value, next)) return;\n\n    this.#value = next;\n    this._notify();\n  }\n\n  update(fn: (current: T) => T): void {\n    this.value = fn(this.#value);\n  }\n\n  peek(): T {\n    return this.#value;\n  }\n}\n\n/** Creates a reactive signal holding a single value. */\nexport const signal = <T>(initial: T, options?: ReactiveOptions<T>): Signal<T> => new SignalImpl(initial, options);\n\nconst _readonlyCache = new WeakMap<object, ReadonlySignal<unknown>>();\n\n/**\n * Returns a stable read-only view of a signal. Hides the setter at both type and runtime\n * level. The wrapper is cached — repeated calls with the same signal return the same reference.\n */\nexport const readonly = <T>(sig: ReadonlySignal<T>): ReadonlySignal<T> => {\n  const cached = _readonlyCache.get(sig as object);\n\n  if (cached) return cached as ReadonlySignal<T>;\n\n  const wrapper: ReadonlySignal<T> = {\n    get [_SIGNAL_BRAND]() {\n      return true as const;\n    },\n    peek: () => sig.peek(),\n    get value() {\n      return sig.value;\n    },\n  };\n\n  _readonlyCache.set(sig as object, wrapper as ReadonlySignal<unknown>);\n\n  return wrapper;\n};\n\n/** Type guard -- identifies Signal instances (works through composition and subclasses). */\nexport const isSignal = <T = unknown>(value: unknown): value is ReadonlySignal<T> =>\n  typeof value === 'object' && value !== null && _SIGNAL_BRAND in (value as object);\n\n/** Unwraps a plain value or Signal to its current value. Reads are tracked if called inside an effect. */\nexport const toValue = <T>(v: T | ReadonlySignal<T>): T => (isSignal<T>(v) ? v.value : v);\n\n/** Unwraps a plain value or Signal to its current value without registering a reactive subscription. */\nexport const peekValue = <T>(v: T | ReadonlySignal<T>): T => (isSignal<T>(v) ? v.peek() : v);\n","import { type ComputedSignal, computed } from './computed';\nimport { _DEV } from './runtime';\nimport { SignalImpl } from './signal';\nimport { type EqualityFn, type ReactiveOptions, type Signal, _STORE_BRAND } from './types';\n\n/**\n * Shallow structural equality — compares own enumerable keys by reference.\n * This is the default equality function used by `store()`. Export it to avoid\n * reimplementation when composing custom `StoreOptions.equals`.\n */\nexport const shallowEqual: EqualityFn<unknown> = (a, b) => {\n  if (a === b) return true;\n\n  if (a == null || b == null) return a === b;\n\n  if (typeof a !== 'object' || typeof b !== 'object') return false;\n\n  const keysA = Object.keys(a as object);\n  const keysB = Object.keys(b as object);\n\n  if (keysA.length !== keysB.length) return false;\n\n  for (const key of keysA) {\n    if (!Object.is((a as Record<string, unknown>)[key], (b as Record<string, unknown>)[key])) return false;\n  }\n\n  return true;\n};\n\nexport type StoreOptions<T extends object> = {\n  /** Custom equality for top-level change detection. Default: shallowEqual */\n  equals?: EqualityFn<T>;\n};\n\n/** Reactive store for object state. Implements Signal<T> so all signal primitives work natively. */\nexport interface Store<T extends object> extends Signal<T> {\n  readonly frozen: boolean;\n  /** Shallow-merge a partial object into the current state. */\n  patch(partial: Partial<T>): void;\n  /** Derive the next state from the current state via an updater function.\n   *  Receives a shallow copy of the current state — mutations in the updater are safe. */\n  update(fn: (s: T) => T): void;\n  /** Reset to the original initial state. */\n  reset(): void;\n  /** Create a lazily recomputed derived signal from a slice of this store's state. */\n  select<U>(selector: (s: T) => U, options?: ReactiveOptions<U>): ComputedSignal<U>;\n  /** Freeze the store. Further writes via patch/update/reset are silently ignored. */\n  freeze(): void;\n}\n\n/** @internal */\nclass StoreImpl<T extends object> extends SignalImpl<T> implements Store<T> {\n  readonly [_STORE_BRAND] = true as const;\n\n  readonly #initial: T;\n  #frozen = false;\n\n  constructor(initial: T, options?: StoreOptions<T>) {\n    super(initial, { equals: options?.equals ?? (shallowEqual as EqualityFn<T>) });\n    this.#initial = { ...initial }; // defensive copy — external mutation cannot corrupt reset()\n  }\n\n  get frozen(): boolean {\n    return this.#frozen;\n  }\n\n  override get value(): T {\n    return super.value;\n  }\n\n  override set value(next: T) {\n    if (this.#frozen) {\n      if (_DEV) console.warn('[stateit] store is frozen — write ignored.');\n\n      return;\n    }\n\n    super.value = next;\n  }\n\n  patch(partial: Partial<T>): void {\n    this.value = { ...this.peek(), ...partial };\n  }\n\n  update(fn: (s: T) => T): void {\n    this.value = fn({ ...this.peek() });\n  }\n\n  reset(): void {\n    this.value = { ...this.#initial };\n  }\n\n  select<U>(selector: (s: T) => U, options?: ReactiveOptions<U>): ComputedSignal<U> {\n    return computed(() => selector(this.value), options);\n  }\n\n  freeze(): void {\n    this.#frozen = true;\n  }\n}\n\n/** Creates a reactive store for the object state. */\nexport const store = <T extends object>(initial: T, options?: StoreOptions<T>): Store<T> =>\n  new StoreImpl(initial, options);\n\n/** Type guard -- identifies Store instances. */\nexport const isStore = <T extends object = Record<string, unknown>>(value: unknown): value is Store<T> =>\n  typeof value === 'object' && value !== null && _STORE_BRAND in value;\n","import { effect } from './effect';\nimport { type EqualityFn, type ReadonlySignal, type Subscription } from './types';\n\nexport type WatchOptions<T> = {\n  /** Custom equality; suppresses the callback when old and new values are equal. Default: Object.is */\n  equals?: EqualityFn<T>;\n  /** Fire the callback immediately with the current value on subscribe. */\n  immediate?: boolean;\n  /**\n   * Auto-unsubscribe after the first *change* invocation.\n   * When combined with `immediate`, the immediate call does not count against this quota —\n   * the callback may fire up to twice total.\n   */\n  once?: boolean;\n};\n\n/**\n * Watches a Signal and calls cb when its value changes. Returns a dispose handle.\n * Does not fire on initial subscription unless `{ immediate: true }` is passed.\n * To watch a derived slice, compose with `store.select()` or `computed()`:\n *\n * @example\n * const stop = watch(count, (next, prev) => console.log(prev, '->', next));\n * const stop = watch(userStore.select(s => s.name), (name) => ...);\n */\nexport const watch = <T>(\n  source: ReadonlySignal<T>,\n  cb: (value: T, prev: T) => void,\n  options?: WatchOptions<T>,\n): Subscription => {\n  const eq: EqualityFn<T> = options?.equals ?? Object.is;\n  let prev = source.peek();\n\n  if (options?.immediate) cb(prev, prev);\n\n  // Use `let` so the stop reference is readable inside the callback without TDZ risk.\n  let stop: Subscription;\n\n  // eslint-disable-next-line prefer-const\n  stop = effect(() => {\n    const next = source.value;\n\n    if (!eq(prev, next)) {\n      const old = prev;\n\n      prev = next;\n      cb(next, old);\n\n      if (options?.once) stop();\n    }\n  });\n\n  return stop;\n};\n\n/**\n * Returns a Promise that resolves with the next value of `source` that satisfies the optional predicate.\n * Disposes automatically after one emission — no cleanup needed.\n * Pass `{ signal: AbortSignal }` to cancel early; the promise rejects with the abort reason.\n *\n * @example\n * const name = await nextValue(userStore.select(s => s.name));\n * const nonZero = await nextValue(count, v => v > 0, { signal: AbortSignal.timeout(5000) });\n */\nexport const nextValue = <T>(\n  source: ReadonlySignal<T>,\n  predicate?: (v: T) => boolean,\n  options?: { signal?: AbortSignal },\n): Promise<T> =>\n  new Promise<T>((resolve, reject) => {\n    const signal = options?.signal;\n\n    try {\n      signal?.throwIfAborted();\n    } catch (err) {\n      reject(err);\n\n      return;\n    }\n\n    const stop = watch(source, (v) => {\n      if (!predicate || predicate(v)) {\n        stop();\n        signal?.removeEventListener('abort', onAbort);\n        resolve(v);\n      }\n    });\n\n    const onAbort = () => {\n      stop();\n      reject(signal!.reason);\n    };\n\n    signal?.addEventListener('abort', onAbort, { once: true });\n  });\n"],"mappings":";AAKA,IAAa,IAAiB,OAAO,wBAAwB,EAGhD,IAAQ;CACnB,UAAU;CACV,MAAM;CACN,QAAQ;CACT,EAGY,IAAQ;CACnB,OAAO;CACP,yBAAS,IAAI,KAAqB;CACnC,EAEU,IAAuB,KAMrB,KAAoB,MAAiD;AAChF,CAAI,EAAK,wBAAwB,KAAA,MAAW,IAAuB,EAAK;GAO7D,UAAsC;AAKjD,CAJA,EAAM,QAAQ,GACd,EAAM,OAAO,MACb,EAAM,SAAS,MACf,EAAM,WAAW,MACjB,EAAM,QAAQ,OAAO;GAIV,IAAb,MAA0B;CACxB,qBAAe,IAAI,KAAqB;CAIxC,SAAyB;AACvB,MAAI,EAAM,SAAS,QAAQ,EAAM,WAAW,MAAM;GAChD,IAAM,IAAK,EAAM;AAGjB,GADA,MAAA,EAAkB,IAAI,EAAG,EACzB,EAAM,KAAK,UAAU,MAAA,EAAkB,OAAO,EAAG,CAAC;;;CAKtD,UAA0B;AACxB,MAAI,MAAA,EAAkB,SAAS,EAAG;AAElC,MAAI,EAAM,QAAQ,GAAG;AACnB,QAAK,IAAM,KAAM,MAAA,EAAmB,GAAM,QAAQ,IAAI,EAAG;AAEzD;;EAGF,IAAM,IAAoB,EAAE;AAE5B,OAAK,IAAM,KAAM,CAAC,GAAG,MAAA,EAAkB,CACrC,KAAI;AACF,MAAI;WACG,GAAG;AACV,KAAO,KAAK,EAAE;;AAIlB,MAAI,EAAO,OACT,OAAM,EAAO,WAAW,IAAI,EAAO,KAAS,eAAe,GAAQ,uCAAuC;;GAMnG,KACX,GACA,GACA,GACA,MACM;CACN,IAAM,IAAK,EAAM,QACX,IAAK,EAAM,MACX,IAAK,EAAM;AAIjB,CAFA,EAAM,SAAS,GACf,EAAM,OAAO,GACb,EAAM,WAAW;AAEjB,KAAI;AACF,SAAO,GAAI;WACH;AAGR,EAFA,EAAM,SAAS,GACf,EAAM,OAAO,GACb,EAAM,WAAW;;GCpGR,UAA4B;CACvC,IAAM,IAAU,CAAC,GAAG,EAAM,QAAQ;AAElC,GAAM,QAAQ,OAAO;CAErB,IAAM,IAAoB,EAAE;AAE5B,MAAK,IAAM,KAAK,EACd,KAAI;AACF,KAAG;UACI,GAAG;AACV,IAAO,KAAK,EAAE;;AAIlB,KAAI,EAAO,OAAQ,OAAM,EAAO,WAAW,IAAI,EAAO,KAAS,eAAe,GAAQ,yBAAyB;GAIpG,KAAY,MAAmB;AAC1C,GAAM;AAEN,KAAI;EACF,IAAM,IAAS,GAAI;AAInB,SAFI,EAAE,EAAM,UAAU,KAAG,GAAe,EAEjC;UACA,GAAG;AACV,MAAI,EAAE,EAAM,UAAU,EACpB,KAAI;AACF,MAAe;UACE;AASrB,QAAM;;GChBG,IAAgB,OAAO,iBAAiB,EACxC,IAAe,OAAO,gBAAgB,ECJtC,IAAb,cAAqC,EAA0C;CAC7E,CAAU,KAAiB;CAC3B;CACA,KAAoC;CACpC,KAAS;CACT,KAAY;CACZ;CACA,qBAAQ,IAAI,KAAgB;CAE5B,WAA8C;AAC5C,EAAK,MAAA,MACH,MAAA,IAAc,IACd,KAAK,SAAS;;CAIlB,YAAY,GAAkB,GAAmD;AAK/E,EAJA,OAAO,EACP,MAAA,IAAgB,GAChB,MAAA,IAAe,GAAS,UAAU,OAAO,IAEpC,GAAS,QAAM,MAAA,GAAiB;;CAGvC,KAAmB;AACjB,OAAK,IAAM,KAAS,MAAA,EAAY,IAAO;AACvC,QAAA,EAAW,OAAO;EAElB,IAAM,IAAS,EAAS,MAAA,GAAmB,MAAA,GAAY,MAAM,MAAA,EAAc;AAI3E,EAFA,MAAA,IAAc,KAEV,MAAA,MAAgB,KAAkB,CAAC,MAAA,EAAa,MAAA,GAAkB,EAAO,MAC3E,MAAA,IAAc;;CAIlB,IAAI,QAAW;AAWb,SAVI,MAAA,IAGK,MAAA,KAGL,MAAA,KAAa,MAAA,GAAiB,EAElC,KAAK,QAAQ,EAEN,MAAA;;CAGT,OAAU;AACR,MAAI,MAAA,MAAgB,GAAgB;AAClC,OAAI,MAAA,EAMF;AAGF,SAAA,GAAiB;;AAGnB,SAAO,MAAA;;CAGT,IAAI,QAAiB;AACnB,SAAO,MAAA,KAAe,MAAA;;CAGxB,UAAgB;AACV,aAAA,GAEJ;SAAA,IAAiB;AACjB,QAAK,IAAM,KAAS,MAAA,EAAY,IAAO;AACvC,SAAA,EAAW,OAAO;;;CAGpB,CAAC,OAAO,WAAiB;AACvB,OAAK,SAAS;;GAOL,KAAe,GAAkB,MAC5C,IAAI,EAAa,GAAS,EAAQ,EASvB,IAAb,cAAqC,EAA6C;CAChF;CAEA,YAAY,GAAc,GAAqB,GAA8B;AAE3E,EADA,MAAM,GAAK,EAAQ,EACnB,MAAA,IAAY;;CAGd,IAAa,QAAW;AACtB,SAAO,MAAM;;CAGf,IAAI,MAAM,GAAM;AACd,QAAA,EAAU,EAAE;;CAGd,OAAO,GAA6B;AAClC,QAAA,EAAU,EAAG,KAAK,MAAM,CAAC,CAAC;;GAMjB,KAAe,GAAc,GAAyB,MACjE,IAAI,EAAa,GAAK,GAAK,EAAQ,EAUxB,KACX,GACA,GACA,MACsB,QAAgB,EAA6B,GAAG,EAAQ,KAAK,MAAM,EAAE,MAAM,CAAC,EAAE,EAAQ,EC/IjG,KAAU,GAAoB,MAA0C;CACnF,IAAI,GACE,oBAAO,IAAI,KAAgB,EAC7B,IAAU,IACV,IAAQ,IACR,IAAW,IACT,IAAU,GAAS,iBAAiB,GAGpC,UAAuB;AAE3B,EADA,KAAW,EACX,IAAU,KAAA;AACV,OAAK,IAAM,KAAS,EAAM,IAAO;AACjC,IAAK,OAAO;IAKR,UAA8B;AAElC,EADA,IAAQ,IACR,GAAU;EAEV,IAAM,IAAwB,EAAE,EAC5B,GACA,IAAQ;AAEZ,MAAI;AACF,KAAS,GAAQ,GAAM,SAAgB;IACrC,IAAM,IAAS,GAAI;AAEnB,IAAI,OAAO,KAAW,cAAY,EAAS,KAAK,EAAO;KACvD;WACK,GAAG;AACV,OAAI,GAAS,QAEX,CADA,IAAQ,IACR,IAAc;OACT,OAAM;;AAgBf,SAbA,IACE,EAAS,SAAS,UACR;AACJ,QAAK,IAAM,KAAK,EAAU,IAAG;MAE/B,KAAA,GAEF,MACF,GAAU,EACV,EAAS,QAAS,EAAY,EAC9B,IAAW,KAGN;IAGH,UAA+B;AACnC,MAAI,KAAY,GAAS;AACvB,GAAI,MAAS,IAAQ;AAErB;;AAGF,MAAU;AAEV,MAAI;GACF,IAAI,IAAa;AAEjB,MAAG;AACD,QAAI,EAAE,IAAa,EACjB,OAAU,MAAM,wDAAwD,EAAQ,cAAc;AAEhG,QAAI,GAAc,CAAE;YACb;YACD;AACR,OAAU;;;AAId,IAAQ;CAER,IAAM,UAAsB;AACtB,QAEJ,IAAW,IACX,GAAU;;AAGZ,QAAO,OAAO,OAAO,GAAS;EAAE;GAAU,OAAO,UAAU;EAAS,CAAC;GAI1D,KAAc,MAAmB,EAAS,MAAM,MAAM,MAAM,EAAG,EAa/D,KAAa,MAAwB;AAKhD,GAAM,UAAU,KAAK,EAAG;GC3Hb,IAAb,cAAmC,EAAkC;CACnE,CAAU,KAAiB;CAC3B;CACA;CAEA,YAAY,GAAY,GAA8B;AAGpD,EAFA,OAAO,EACP,MAAA,IAAc,GACd,MAAA,IAAe,GAAS,UAAU,OAAO;;CAG3C,IAAI,QAAW;AAGb,SAFA,KAAK,QAAQ,EAEN,MAAA;;CAGT,IAAI,MAAM,GAAS;AACb,QAAA,EAAa,MAAA,GAAa,EAAK,KAEnC,MAAA,IAAc,GACd,KAAK,SAAS;;CAGhB,OAAO,GAA6B;AAClC,OAAK,QAAQ,EAAG,MAAA,EAAY;;CAG9B,OAAU;AACR,SAAO,MAAA;;GAKE,KAAa,GAAY,MAA4C,IAAI,EAAW,GAAS,EAAQ,EAE5G,oBAAiB,IAAI,SAA0C,EAMxD,KAAe,MAA8C;CACxE,IAAM,IAAS,EAAe,IAAI,EAAc;AAEhD,KAAI,EAAQ,QAAO;CAEnB,IAAM,IAA6B;EACjC,KAAK,KAAiB;AACpB,UAAO;;EAET,YAAY,EAAI,MAAM;EACtB,IAAI,QAAQ;AACV,UAAO,EAAI;;EAEd;AAID,QAFA,EAAe,IAAI,GAAe,EAAmC,EAE9D;GAII,KAAyB,MACpC,OAAO,KAAU,cAAY,KAAkB,KAAkB,GAGtD,KAAc,MAAiC,EAAY,EAAE,GAAG,EAAE,QAAQ,GAG1E,KAAgB,MAAiC,EAAY,EAAE,GAAG,EAAE,MAAM,GAAG,GChE7E,KAAqC,GAAG,MAAM;AACzD,KAAI,MAAM,EAAG,QAAO;AAEpB,KAAI,KAAK,QAAQ,KAAK,KAAM,QAAO,MAAM;AAEzC,KAAI,OAAO,KAAM,YAAY,OAAO,KAAM,SAAU,QAAO;CAE3D,IAAM,IAAQ,OAAO,KAAK,EAAY,EAChC,IAAQ,OAAO,KAAK,EAAY;AAEtC,KAAI,EAAM,WAAW,EAAM,OAAQ,QAAO;AAE1C,MAAK,IAAM,KAAO,EAChB,KAAI,CAAC,OAAO,GAAI,EAA8B,IAAO,EAA8B,GAAK,CAAE,QAAO;AAGnG,QAAO;GAyBH,IAAN,cAA0C,EAAkC;CAC1E,CAAU,KAAgB;CAE1B;CACA,KAAU;CAEV,YAAY,GAAY,GAA2B;AAEjD,EADA,MAAM,GAAS,EAAE,QAAQ,GAAS,UAAW,GAAgC,CAAC,EAC9E,MAAA,IAAgB,EAAE,GAAG,GAAS;;CAGhC,IAAI,SAAkB;AACpB,SAAO,MAAA;;CAGT,IAAa,QAAW;AACtB,SAAO,MAAM;;CAGf,IAAa,MAAM,GAAS;AACtB,QAAA,MAMJ,MAAM,QAAQ;;CAGhB,MAAM,GAA2B;AAC/B,OAAK,QAAQ;GAAE,GAAG,KAAK,MAAM;GAAE,GAAG;GAAS;;CAG7C,OAAO,GAAuB;AAC5B,OAAK,QAAQ,EAAG,EAAE,GAAG,KAAK,MAAM,EAAE,CAAC;;CAGrC,QAAc;AACZ,OAAK,QAAQ,EAAE,GAAG,MAAA,GAAe;;CAGnC,OAAU,GAAuB,GAAiD;AAChF,SAAO,QAAe,EAAS,KAAK,MAAM,EAAE,EAAQ;;CAGtD,SAAe;AACb,QAAA,IAAe;;GAKN,KAA2B,GAAY,MAClD,IAAI,EAAU,GAAS,EAAQ,EAGpB,KAAuD,MAClE,OAAO,KAAU,cAAY,KAAkB,KAAgB,GClFpD,KACX,GACA,GACA,MACiB;CACjB,IAAM,IAAoB,GAAS,UAAU,OAAO,IAChD,IAAO,EAAO,MAAM;AAExB,CAAI,GAAS,aAAW,EAAG,GAAM,EAAK;CAGtC,IAAI;AAgBJ,QAbA,IAAO,QAAa;EAClB,IAAM,IAAO,EAAO;AAEpB,MAAI,CAAC,EAAG,GAAM,EAAK,EAAE;GACnB,IAAM,IAAM;AAKZ,GAHA,IAAO,GACP,EAAG,GAAM,EAAI,EAET,GAAS,QAAM,GAAM;;GAE3B,EAEK;GAYI,KACX,GACA,GACA,MAEA,IAAI,SAAY,GAAS,MAAW;CAClC,IAAM,IAAS,GAAS;AAExB,KAAI;AACF,KAAQ,gBAAgB;UACjB,GAAK;AACZ,IAAO,EAAI;AAEX;;CAGF,IAAM,IAAO,EAAM,IAAS,MAAM;AAChC,GAAI,CAAC,KAAa,EAAU,EAAE,MAC5B,GAAM,EACN,GAAQ,oBAAoB,SAAS,EAAQ,EAC7C,EAAQ,EAAE;GAEZ,EAEI,UAAgB;AAEpB,EADA,GAAM,EACN,EAAO,EAAQ,OAAO;;AAGxB,IAAQ,iBAAiB,SAAS,GAAS,EAAE,MAAM,IAAM,CAAC;EAC1D"}
+{"version":3,"file":"stateit.js","names":[],"sources":["../src/stateit.ts"],"sourcesContent":["import type {\n  CleanupFn,\n  ComputedSignal,\n  EffectCallback,\n  EffectOptions,\n  EqualityFn,\n  ReactiveOptions,\n  ReadonlySignal,\n  Signal,\n  Store,\n  Subscription,\n  WatchOptions,\n} from './types';\n\n// === CONSTANTS ===\nconst UNINITIALIZED = Symbol('stateit.uninitialized');\nconst DEFAULT_MAX_ITERATIONS = 100;\n\n// === HELPERS ===\nconst toSubscription = (dispose: () => void): Subscription =>\n  Object.assign(dispose, { dispose, [Symbol.dispose]: dispose }) as Subscription;\n\nconst ensureObject = (value: unknown, message: string): void => {\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new TypeError(message);\n  }\n};\n\nconst clone = <T>(value: T): T => structuredClone(value);\n\n// === UNIFIED ERROR HANDLING ===\nconst runCallbacks = (callbacks: CleanupFn[], context: string): void => {\n  const errors: unknown[] = [];\n\n  for (const callback of callbacks) {\n    try {\n      callback();\n    } catch (e) {\n      errors.push(e);\n    }\n  }\n\n  if (errors.length === 1) throw errors[0];\n\n  if (errors.length > 1) {\n    throw new AggregateError(errors, `[stateit] ${context}`);\n  }\n};\n\nconst runSubscribers = (subscribers: Set<EffectCallback>): void => {\n  const errors: unknown[] = [];\n\n  for (const fn of [...subscribers]) {\n    try {\n      fn();\n    } catch (e) {\n      errors.push(e);\n    }\n  }\n\n  if (errors.length === 1) throw errors[0];\n\n  if (errors.length > 1) {\n    throw new AggregateError(errors, '[stateit] subscriber errors');\n  }\n};\n\n// === GLOBAL REACTIVE GRAPH ===\ninterface EffectScope {\n  effect: EffectCallback | null;\n  deps: Set<CleanupFn> | null;\n  cleanups: CleanupFn[] | null;\n}\n\nlet currentScope: EffectScope = {\n  cleanups: null,\n  deps: null,\n  effect: null,\n};\n\nconst withScope = <T>(\n  effect: EffectCallback | null,\n  deps: Set<CleanupFn> | null,\n  cleanups: CleanupFn[] | null,\n  fn: () => T,\n): T => {\n  const prev = currentScope;\n\n  currentScope = { cleanups, deps, effect };\n\n  try {\n    return fn();\n  } finally {\n    currentScope = prev;\n  }\n};\n\n// === BATCH QUEUE ===\nlet batchDepth = 0;\nconst batchQueue = new Set<EffectCallback>();\n\nconst flushBatch = (): void => {\n  while (batchQueue.size > 0) {\n    const pending = [...batchQueue];\n\n    batchQueue.clear();\n\n    runSubscribers(new Set(pending));\n  }\n};\n\n// === BASE REACTIVE NODE ===\nclass ReactiveNode {\n  protected subscribers = new Set<EffectCallback>();\n\n  protected track(): void {\n    if (!currentScope.effect || !currentScope.deps) return;\n\n    this.subscribers.add(currentScope.effect);\n    currentScope.deps.add(() => this.subscribers.delete(currentScope.effect!));\n  }\n\n  protected hasSubscribers(): boolean {\n    return this.subscribers.size > 0;\n  }\n\n  protected notify(): void {\n    if (this.subscribers.size === 0) return;\n\n    if (batchDepth > 0) {\n      for (const fn of this.subscribers) batchQueue.add(fn);\n\n      return;\n    }\n\n    runSubscribers(this.subscribers);\n  }\n}\n\n// === SIGNAL IMPLEMENTATION ===\nclass SignalImpl<T> extends ReactiveNode implements Signal<T> {\n  private value_: T;\n  private equals_: EqualityFn<T>;\n\n  constructor(initial: T, equals?: EqualityFn<T>) {\n    super();\n    this.value_ = initial;\n    this.equals_ = equals ?? Object.is;\n  }\n\n  get value(): T {\n    this.track();\n\n    return this.value_;\n  }\n\n  set value(next: T) {\n    if (this.equals_(this.value_, next)) return;\n\n    this.value_ = next;\n    this.notify();\n  }\n\n  update(fn: (current: T) => T): void {\n    this.value = fn(this.value_);\n  }\n}\n\n// === COMPUTED IMPLEMENTATION ===\nclass ComputedImpl<T> extends ReactiveNode implements ComputedSignal<T> {\n  private value_: T | typeof UNINITIALIZED = UNINITIALIZED;\n  private dirty_ = true;\n  private disposed_ = false;\n  private deps_ = new Set<CleanupFn>();\n  private compute_: () => T;\n  private equals_: EqualityFn<T>;\n\n  private readonly onDepChange: EffectCallback = () => {\n    if (this.disposed_) return;\n\n    if (this.subscribers.size === 0) {\n      this.dirty_ = true;\n\n      return;\n    }\n\n    if (this.recompute()) this.notify();\n  };\n\n  constructor(compute: () => T, equals?: EqualityFn<T>) {\n    super();\n    this.compute_ = compute;\n    this.equals_ = equals ?? Object.is;\n    this.recompute();\n  }\n\n  private recompute(): boolean {\n    for (const unsub of this.deps_) unsub();\n    this.deps_.clear();\n\n    const next = withScope(this.onDepChange, this.deps_, null, this.compute_);\n\n    this.dirty_ = false;\n\n    if (this.value_ === UNINITIALIZED || !this.equals_(this.value_ as T, next)) {\n      this.value_ = next;\n\n      return true;\n    }\n\n    return false;\n  }\n\n  get value(): T {\n    if (this.disposed_) {\n      throw new Error('[stateit] Cannot read disposed computed signal');\n    }\n\n    if (this.dirty_) this.recompute();\n\n    this.track();\n\n    return this.value_ as T;\n  }\n\n  get stale(): boolean {\n    return this.dirty_;\n  }\n\n  dispose(): void {\n    if (this.disposed_) return;\n\n    this.disposed_ = true;\n    this.dirty_ = true;\n    for (const unsub of this.deps_) unsub();\n    this.deps_.clear();\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n}\n\n// === CORE API ===\n\nexport const signal = <T>(initial: T, options?: ReactiveOptions<T>): Signal<T> =>\n  new SignalImpl(initial, options?.equals);\n\nexport const computed = <T>(compute: () => T, options?: ReactiveOptions<T>): ComputedSignal<T> => {\n  const comp = new ComputedImpl(compute, options?.equals);\n\n  // Auto-dispose when created inside effect\n  if (currentScope.effect !== null && currentScope.cleanups !== null) {\n    onCleanup(() => comp.dispose());\n  }\n\n  return comp;\n};\n\nexport const batch = <T>(fn: () => T): T => {\n  batchDepth++;\n\n  try {\n    const result = fn();\n\n    if (--batchDepth === 0) flushBatch();\n\n    return result;\n  } catch (e) {\n    if (--batchDepth === 0) flushBatch();\n\n    throw e;\n  }\n};\n\nexport const effect = (fn: EffectCallback, options?: EffectOptions): Subscription => {\n  let cleanup: CleanupFn | undefined;\n  const deps = new Set<CleanupFn>();\n  let isRunning = false;\n  let isDirty = false;\n  let isDisposed = false;\n  const maxIterations = options?.maxIterations ?? DEFAULT_MAX_ITERATIONS;\n\n  const teardown = (): void => {\n    const callbacks: CleanupFn[] = [];\n\n    if (cleanup) callbacks.push(cleanup);\n\n    cleanup = undefined;\n\n    for (const unsub of deps) callbacks.push(unsub);\n    deps.clear();\n\n    runCallbacks(callbacks, 'effect teardown errors');\n  };\n\n  const run = (): void => {\n    if (isDisposed) return;\n\n    if (isRunning) {\n      isDirty = true;\n\n      return;\n    }\n\n    isRunning = true;\n\n    try {\n      let iterations = 0;\n\n      do {\n        if (++iterations > maxIterations) {\n          throw new Error(`[stateit] infinite effect loop (> ${maxIterations} iterations)`);\n        }\n\n        isDirty = false;\n        teardown();\n\n        const localCleanups: CleanupFn[] = [];\n        const returnedCleanup = withScope(run, deps, localCleanups, fn);\n\n        if (returnedCleanup) localCleanups.push(returnedCleanup);\n\n        if (localCleanups.length > 0) {\n          cleanup = () => {\n            runCallbacks(localCleanups, 'effect cleanup errors');\n          };\n        }\n      } while (isDirty && !isDisposed);\n    } finally {\n      isRunning = false;\n    }\n  };\n\n  run();\n\n  return toSubscription(() => {\n    if (isDisposed) return;\n\n    isDisposed = true;\n    teardown();\n  });\n};\n\nexport const untrack = <T>(fn: () => T): T => {\n  return withScope(null, null, null, fn);\n};\n\nexport const onCleanup = (fn: CleanupFn): void => {\n  if (currentScope.cleanups === null) {\n    throw new Error('[stateit] onCleanup() must be called from inside an active effect.');\n  }\n\n  currentScope.cleanups.push(fn);\n};\n\nconst watchBase = <T>(\n  source: ReadonlySignal<T>,\n  cb: (value: T, prev: T) => void,\n  watchOptions?: WatchOptions<T>,\n): Subscription => {\n  const equals = watchOptions?.equals ?? Object.is;\n  let prev = untrack(() => source.value);\n\n  if (watchOptions?.immediate) cb(prev, prev);\n\n  const stop = effect(() => {\n    const next = source.value;\n\n    if (equals(prev, next)) return;\n\n    const old = prev;\n\n    prev = next;\n    cb(next, old);\n\n    if (watchOptions?.once) stop();\n  });\n\n  return stop;\n};\n\nfunction watch<T>(\n  source: ReadonlySignal<T>,\n  cb: (value: T, prev: T) => void,\n  watchOptions?: WatchOptions<T>,\n): Subscription;\nfunction watch<S, T>(\n  source: ReadonlySignal<S>,\n  selector: (value: S) => T,\n  cb: (value: T, prev: T) => void,\n  watchOptions?: WatchOptions<T>,\n): Subscription;\nfunction watch<S, T>(\n  source: ReadonlySignal<S>,\n  selectorOrCb: ((value: S) => T) | ((value: S, prev: S) => void),\n  maybeCb?: ((value: T, prev: T) => void) | WatchOptions<S>,\n  maybeOptions?: WatchOptions<T>,\n): Subscription {\n  if (typeof maybeCb === 'function') {\n    const selector = selectorOrCb as (value: S) => T;\n    const cb = maybeCb as (value: T, prev: T) => void;\n    const selected = computed(() => selector(source.value));\n    const stop = watchBase(selected, cb, maybeOptions);\n\n    return toSubscription(() => {\n      stop();\n      selected.dispose();\n    });\n  }\n\n  const cb = selectorOrCb as (value: S, prev: S) => void;\n\n  return watchBase(source, cb, maybeCb as WatchOptions<S> | undefined);\n}\n\nexport { watch };\n\nexport const store = <T extends object>(initial: T, storeOptions?: ReactiveOptions<T>): Store<T> => {\n  ensureObject(initial, '[stateit] store() requires a plain object initial state.');\n\n  const initialSnapshot = clone(initial);\n  const state = signal(clone(initial), storeOptions);\n\n  return {\n    patch(partial: Partial<T>): void {\n      if (typeof partial !== 'object' || partial === null || Array.isArray(partial)) {\n        throw new TypeError('[stateit] store.patch() requires a plain object partial.');\n      }\n\n      state.value = { ...state.value, ...partial };\n    },\n    reset(): void {\n      state.value = clone(initialSnapshot);\n    },\n    update(fn: (current: T) => T): void {\n      const next = fn(state.value);\n\n      ensureObject(next, '[stateit] store.update() must return a plain object.');\n      state.value = next;\n    },\n    get value(): T {\n      return state.value;\n    },\n    set value(next: T) {\n      ensureObject(next, '[stateit] Store value must always be a plain object.');\n      state.value = next;\n    },\n  };\n};\n\n// === TYPE HELPERS ===\n\nexport const readonly = <T>(input: ReadonlySignal<T>): ReadonlySignal<T> => input;\n\nexport const writable = <T>(input: Signal<T>): Signal<T> => input;\n\nexport const isSignal = <T = unknown>(value: unknown): value is ReadonlySignal<T> => {\n  if (typeof value !== 'object' || value === null) return false;\n\n  const candidate = value as Partial<ReadonlySignal<T>>;\n\n  return 'value' in candidate;\n};\n\nexport const peekValue = <T>(input: T | ReadonlySignal<T>): T => (isSignal<T>(input) ? input.value : input);\n\nexport const toValue = <T>(input: T | ReadonlySignal<T> | (() => T)): T => {\n  if (isSignal<T>(input)) return input.value;\n\n  if (typeof input === 'function') return (input as () => T)();\n\n  return input;\n};\n"],"mappings":";AAeA,IAAM,IAAgB,OAAO,wBAAwB,EAC/C,IAAyB,KAGzB,KAAkB,MACtB,OAAO,OAAO,GAAS;CAAE;EAAU,OAAO,UAAU;CAAS,CAAC,EAE1D,KAAgB,GAAgB,MAA0B;AAC9D,KAAI,OAAO,KAAU,aAAY,KAAkB,MAAM,QAAQ,EAAM,CACrE,OAAU,UAAU,EAAQ;GAI1B,KAAY,MAAgB,gBAAgB,EAAM,EAGlD,KAAgB,GAAwB,MAA0B;CACtE,IAAM,IAAoB,EAAE;AAE5B,MAAK,IAAM,KAAY,EACrB,KAAI;AACF,KAAU;UACH,GAAG;AACV,IAAO,KAAK,EAAE;;AAIlB,KAAI,EAAO,WAAW,EAAG,OAAM,EAAO;AAEtC,KAAI,EAAO,SAAS,EAClB,OAAU,eAAe,GAAQ,aAAa,IAAU;GAItD,KAAkB,MAA2C;CACjE,IAAM,IAAoB,EAAE;AAE5B,MAAK,IAAM,KAAM,CAAC,GAAG,EAAY,CAC/B,KAAI;AACF,KAAI;UACG,GAAG;AACV,IAAO,KAAK,EAAE;;AAIlB,KAAI,EAAO,WAAW,EAAG,OAAM,EAAO;AAEtC,KAAI,EAAO,SAAS,EAClB,OAAU,eAAe,GAAQ,8BAA8B;GAW/D,IAA4B;CAC9B,UAAU;CACV,MAAM;CACN,QAAQ;CACT,EAEK,KACJ,GACA,GACA,GACA,MACM;CACN,IAAM,IAAO;AAEb,KAAe;EAAE;EAAU;EAAM;EAAQ;AAEzC,KAAI;AACF,SAAO,GAAI;WACH;AACR,MAAe;;GAKf,IAAa,GACX,oBAAa,IAAI,KAAqB,EAEtC,UAAyB;AAC7B,QAAO,EAAW,OAAO,IAAG;EAC1B,IAAM,IAAU,CAAC,GAAG,EAAW;AAI/B,EAFA,EAAW,OAAO,EAElB,EAAe,IAAI,IAAI,EAAQ,CAAC;;GAK9B,IAAN,MAAmB;CACjB,8BAAwB,IAAI,KAAqB;CAEjD,QAAwB;AAClB,GAAC,EAAa,UAAU,CAAC,EAAa,SAE1C,KAAK,YAAY,IAAI,EAAa,OAAO,EACzC,EAAa,KAAK,UAAU,KAAK,YAAY,OAAO,EAAa,OAAQ,CAAC;;CAG5E,iBAAoC;AAClC,SAAO,KAAK,YAAY,OAAO;;CAGjC,SAAyB;AACnB,WAAK,YAAY,SAAS,GAE9B;OAAI,IAAa,GAAG;AAClB,SAAK,IAAM,KAAM,KAAK,YAAa,GAAW,IAAI,EAAG;AAErD;;AAGF,KAAe,KAAK,YAAY;;;GAK9B,IAAN,cAA4B,EAAkC;CAC5D;CACA;CAEA,YAAY,GAAY,GAAwB;AAG9C,EAFA,OAAO,EACP,KAAK,SAAS,GACd,KAAK,UAAU,KAAU,OAAO;;CAGlC,IAAI,QAAW;AAGb,SAFA,KAAK,OAAO,EAEL,KAAK;;CAGd,IAAI,MAAM,GAAS;AACb,OAAK,QAAQ,KAAK,QAAQ,EAAK,KAEnC,KAAK,SAAS,GACd,KAAK,QAAQ;;CAGf,OAAO,GAA6B;AAClC,OAAK,QAAQ,EAAG,KAAK,OAAO;;GAK1B,IAAN,cAA8B,EAA0C;CACtE,SAA2C;CAC3C,SAAiB;CACjB,YAAoB;CACpB,wBAAgB,IAAI,KAAgB;CACpC;CACA;CAEA,oBAAqD;AAC/C,YAAK,WAET;OAAI,KAAK,YAAY,SAAS,GAAG;AAC/B,SAAK,SAAS;AAEd;;AAGF,GAAI,KAAK,WAAW,IAAE,KAAK,QAAQ;;;CAGrC,YAAY,GAAkB,GAAwB;AAIpD,EAHA,OAAO,EACP,KAAK,WAAW,GAChB,KAAK,UAAU,KAAU,OAAO,IAChC,KAAK,WAAW;;CAGlB,YAA6B;AAC3B,OAAK,IAAM,KAAS,KAAK,MAAO,IAAO;AACvC,OAAK,MAAM,OAAO;EAElB,IAAM,IAAO,EAAU,KAAK,aAAa,KAAK,OAAO,MAAM,KAAK,SAAS;AAUzE,SARA,KAAK,SAAS,IAEV,KAAK,WAAW,KAAiB,CAAC,KAAK,QAAQ,KAAK,QAAa,EAAK,IACxE,KAAK,SAAS,GAEP,MAGF;;CAGT,IAAI,QAAW;AACb,MAAI,KAAK,UACP,OAAU,MAAM,iDAAiD;AAOnE,SAJI,KAAK,UAAQ,KAAK,WAAW,EAEjC,KAAK,OAAO,EAEL,KAAK;;CAGd,IAAI,QAAiB;AACnB,SAAO,KAAK;;CAGd,UAAgB;AACV,YAAK,WAGT;GADA,KAAK,YAAY,IACjB,KAAK,SAAS;AACd,QAAK,IAAM,KAAS,KAAK,MAAO,IAAO;AACvC,QAAK,MAAM,OAAO;;;CAGpB,CAAC,OAAO,WAAiB;AACvB,OAAK,SAAS;;GAML,KAAa,GAAY,MACpC,IAAI,EAAW,GAAS,GAAS,OAAO,EAE7B,KAAe,GAAkB,MAAoD;CAChG,IAAM,IAAO,IAAI,EAAa,GAAS,GAAS,OAAO;AAOvD,QAJI,EAAa,WAAW,QAAQ,EAAa,aAAa,QAC5D,QAAgB,EAAK,SAAS,CAAC,EAG1B;GAGI,KAAY,MAAmB;AAC1C;AAEA,KAAI;EACF,IAAM,IAAS,GAAI;AAInB,SAFI,EAAE,MAAe,KAAG,GAAY,EAE7B;UACA,GAAG;AAGV,QAFI,EAAE,MAAe,KAAG,GAAY,EAE9B;;GAIG,KAAU,GAAoB,MAA0C;CACnF,IAAI,GACE,oBAAO,IAAI,KAAgB,EAC7B,IAAY,IACZ,IAAU,IACV,IAAa,IACX,IAAgB,GAAS,iBAAiB,GAE1C,UAAuB;EAC3B,IAAM,IAAyB,EAAE;AAIjC,EAFI,KAAS,EAAU,KAAK,EAAQ,EAEpC,IAAU,KAAA;AAEV,OAAK,IAAM,KAAS,EAAM,GAAU,KAAK,EAAM;AAG/C,EAFA,EAAK,OAAO,EAEZ,EAAa,GAAW,yBAAyB;IAG7C,UAAkB;AAClB,UAEJ;OAAI,GAAW;AACb,QAAU;AAEV;;AAGF,OAAY;AAEZ,OAAI;IACF,IAAI,IAAa;AAEjB,OAAG;AACD,SAAI,EAAE,IAAa,EACjB,OAAU,MAAM,qCAAqC,EAAc,cAAc;AAInF,KADA,IAAU,IACV,GAAU;KAEV,IAAM,IAA6B,EAAE,EAC/B,IAAkB,EAAU,GAAK,GAAM,GAAe,EAAG;AAI/D,KAFI,KAAiB,EAAc,KAAK,EAAgB,EAEpD,EAAc,SAAS,MACzB,UAAgB;AACd,QAAa,GAAe,wBAAwB;;aAGjD,KAAW,CAAC;aACb;AACR,QAAY;;;;AAMhB,QAFA,GAAK,EAEE,QAAqB;AACtB,QAEJ,IAAa,IACb,GAAU;GACV;GAGS,KAAc,MAClB,EAAU,MAAM,MAAM,MAAM,EAAG,EAG3B,KAAa,MAAwB;AAChD,KAAI,EAAa,aAAa,KAC5B,OAAU,MAAM,qEAAqE;AAGvF,GAAa,SAAS,KAAK,EAAG;GAG1B,KACJ,GACA,GACA,MACiB;CACjB,IAAM,IAAS,GAAc,UAAU,OAAO,IAC1C,IAAO,QAAc,EAAO,MAAM;AAEtC,CAAI,GAAc,aAAW,EAAG,GAAM,EAAK;CAE3C,IAAM,IAAO,QAAa;EACxB,IAAM,IAAO,EAAO;AAEpB,MAAI,EAAO,GAAM,EAAK,CAAE;EAExB,IAAM,IAAM;AAKZ,EAHA,IAAO,GACP,EAAG,GAAM,EAAI,EAET,GAAc,QAAM,GAAM;GAC9B;AAEF,QAAO;;AAcT,SAAS,EACP,GACA,GACA,GACA,GACc;AACd,KAAI,OAAO,KAAY,YAAY;EACjC,IAAM,IAAW,GACX,IAAK,GACL,IAAW,QAAe,EAAS,EAAO,MAAM,CAAC,EACjD,IAAO,EAAU,GAAU,GAAI,EAAa;AAElD,SAAO,QAAqB;AAE1B,GADA,GAAM,EACN,EAAS,SAAS;IAClB;;AAKJ,QAAO,EAAU,GAFN,GAEkB,EAAuC;;AAKtE,IAAa,KAA2B,GAAY,MAAgD;AAClG,GAAa,GAAS,2DAA2D;CAEjF,IAAM,IAAkB,EAAM,EAAQ,EAChC,IAAQ,EAAO,EAAM,EAAQ,EAAE,EAAa;AAElD,QAAO;EACL,MAAM,GAA2B;AAC/B,OAAI,OAAO,KAAY,aAAY,KAAoB,MAAM,QAAQ,EAAQ,CAC3E,OAAU,UAAU,2DAA2D;AAGjF,KAAM,QAAQ;IAAE,GAAG,EAAM;IAAO,GAAG;IAAS;;EAE9C,QAAc;AACZ,KAAM,QAAQ,EAAM,EAAgB;;EAEtC,OAAO,GAA6B;GAClC,IAAM,IAAO,EAAG,EAAM,MAAM;AAG5B,GADA,EAAa,GAAM,uDAAuD,EAC1E,EAAM,QAAQ;;EAEhB,IAAI,QAAW;AACb,UAAO,EAAM;;EAEf,IAAI,MAAM,GAAS;AAEjB,GADA,EAAa,GAAM,uDAAuD,EAC1E,EAAM,QAAQ;;EAEjB;GAKU,KAAe,MAAgD,GAE/D,KAAe,MAAgC,GAE/C,KAAyB,MAChC,OAAO,KAAU,aAAY,IAAuB,KAIjD,WAFW,GAKP,KAAgB,MAAqC,EAAY,EAAM,GAAG,EAAM,QAAQ,GAExF,KAAc,MACrB,EAAY,EAAM,GAAS,EAAM,QAEjC,OAAO,KAAU,aAAoB,GAAmB,GAErD"}

package/dist/types.d.ts

@@ -1,39 +1,38 @@
-/** A function that tears down a subscription or effect. */
 export type CleanupFn = () => void;
-/** The shape of a function passed to `effect()`. Can return an optional cleanup. */
 export type EffectCallback = () => CleanupFn | void;
 export type EqualityFn<T> = (a: T, b: T) => boolean;
-/** Options accepted by signal(), computed(), writable(), and store(). */
 export type ReactiveOptions<T> = {
     equals?: EqualityFn<T>;
 };
-/** Shared interface for disposable reactive values (computed, writable). Supports the TC39 `using` declaration. */
-export interface Disposable {
-    dispose(): void;
-    [Symbol.dispose](): void;
-}
-/**
- * A callable subscription handle returned by `effect()` and `watch()`.
- * Can be called directly or via `.dispose()` to stop the subscription.
- * Supports the TC39 `using` declaration via `[Symbol.dispose]`.
- */
 export interface Subscription {
     (): void;
     dispose(): void;
     [Symbol.dispose](): void;
 }
-export declare const _SIGNAL_BRAND: unique symbol;
-export declare const _STORE_BRAND: unique symbol;
-/** Public read-only signal interface. */
 export interface ReadonlySignal<T> {
-    readonly [_SIGNAL_BRAND]: true;
     readonly value: T;
-    peek(): T;
 }
-/** Public read/write signal interface. */
 export interface Signal<T> extends ReadonlySignal<T> {
     value: T;
-    /** Update the value by applying a function to the current value. */
     update(fn: (current: T) => T): void;
 }
+export interface ComputedSignal<T> extends ReadonlySignal<T> {
+    readonly stale: boolean;
+    dispose(): void;
+    [Symbol.dispose](): void;
+}
+export type EffectOptions = {
+    maxIterations?: number;
+};
+export type WatchOptions<T> = {
+    equals?: EqualityFn<T>;
+    immediate?: boolean;
+    once?: boolean;
+};
+export interface Store<T extends object> {
+    readonly value: T;
+    patch(partial: Partial<T>): void;
+    update(fn: (state: T) => T): void;
+    reset(): void;
+}
 //# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,2DAA2D;AAC3D,MAAM,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC;AAEnC,oFAAoF;AACpF,MAAM,MAAM,cAAc,GAAG,MAAM,SAAS,GAAG,IAAI,CAAC;AAEpD,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAEpD,yEAAyE;AACzE,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI;IAAE,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAA;CAAE,CAAC;AAE5D,mHAAmH;AACnH,MAAM,WAAW,UAAU;IACzB,OAAO,IAAI,IAAI,CAAC;IAChB,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;CAC1B;AAED;;;;GAIG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,IAAI,CAAC;IACT,OAAO,IAAI,IAAI,CAAC;IAChB,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;CAC1B;AAED,eAAO,MAAM,aAAa,eAA2B,CAAC;AACtD,eAAO,MAAM,YAAY,eAA0B,CAAC;AAEpD,yCAAyC;AACzC,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B,QAAQ,CAAC,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,IAAI,IAAI,CAAC,CAAC;CACX;AAED,0CAA0C;AAC1C,MAAM,WAAW,MAAM,CAAC,CAAC,CAAE,SAAQ,cAAc,CAAC,CAAC,CAAC;IAClD,KAAK,EAAE,CAAC,CAAC;IACT,oEAAoE;IACpE,MAAM,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;CACrC"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC;AAEnC,MAAM,MAAM,cAAc,GAAG,MAAM,SAAS,GAAG,IAAI,CAAC;AAEpD,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAEpD,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI;IAAE,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAA;CAAE,CAAC;AAE5D,MAAM,WAAW,YAAY;IAC3B,IAAI,IAAI,CAAC;IACT,OAAO,IAAI,IAAI,CAAC;IAChB,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;CAC1B;AAED,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;CACnB;AAED,MAAM,WAAW,MAAM,CAAC,CAAC,CAAE,SAAQ,cAAc,CAAC,CAAC,CAAC;IAClD,KAAK,EAAE,CAAC,CAAC;IACT,MAAM,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;CACrC;AAED,MAAM,WAAW,cAAc,CAAC,CAAC,CAAE,SAAQ,cAAc,CAAC,CAAC,CAAC;IAC1D,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,OAAO,IAAI,IAAI,CAAC;IAChB,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;CAC1B;AAED,MAAM,MAAM,aAAa,GAAG;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI;IAC5B,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,CAAC,EAAE,OAAO,CAAC;CAChB,CAAC;AAEF,MAAM,WAAW,KAAK,CAAC,CAAC,SAAS,MAAM;IACrC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACjC,MAAM,CAAC,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;IAClC,KAAK,IAAI,IAAI,CAAC;CACf"}

package/package.json

@@ -1,10 +1,11 @@
 {
   "name": "@vielzeug/stateit",
-  "version": "2.0.0",
+  "version": "2.1.0",
   "type": "module",
   "files": [
     "dist"
   ],
+  "description": "Tiny reactive state with direct singleton primitives",
   "main": "./dist/index.cjs",
   "module": "./dist/index.js",
   "types": "dist/index.d.ts",
@@ -33,7 +34,7 @@
   "devDependencies": {
     "@types/node": "^25.5.0",
     "typescript": "~6.0.2",
-    "vite": "^8.0.2",
-    "vitest": "^4.1.1"
+    "vite": "^8.0.3",
+    "vitest": "^4.1.2"
   }
 }

package/dist/batch.cjs

@@ -1,2 +0,0 @@
-const e=require(`./runtime.cjs`);var t=()=>{let t=[...e.queue.pending];e.queue.pending.clear();let n=[];for(let e of t)try{e()}catch(e){n.push(e)}if(n.length)throw n.length===1?n[0]:AggregateError(n,`[stateit] batch errors`)},n=n=>{e.queue.depth++;try{let r=n();return--e.queue.depth===0&&t(),r}catch(n){if(--e.queue.depth===0)try{t()}catch{}throw n}};exports._flushPending=t,exports.batch=n;
-//# sourceMappingURL=batch.cjs.map