balises 0.2.1 → 0.3.0

package/README.md

@@ -226,7 +226,7 @@ state.items.push(4);
 // ✅ Triggers reactivity
 state.items = [...state.items, 4];
 
-// ✅ Using update() for functional updates (works with both signal and store)
+// Alternative: Use signal for arrays if you want .update() method
 const items = signal([1, 2, 3]);
 items.update((arr) => [...arr, 4]);
 items.update((arr) => arr.filter((n) => n !== 2));
@@ -248,6 +248,28 @@ batch(() => {
 }); // Subscribers notified once after both updates
 ```
 
+### `scope(fn)`
+
+Create a disposal scope that automatically collects all computeds and effects created within, allowing cleanup with a single `dispose()` call.
+
+```ts
+import { scope, signal, computed, effect } from "balises";
+
+const [state, dispose] = scope(() => {
+  const count = signal(0);
+  const doubled = computed(() => count.value * 2);
+  effect(() => console.log(doubled.value));
+  return { count, doubled };
+});
+
+// Use state.count, state.doubled...
+
+// Later: clean up everything at once
+dispose();
+```
+
+Useful for components, temporary reactive contexts, or any scenario where you want automatic cleanup of multiple reactive primitives.
+
 ### `isSignal(value)`
 
 Type guard to check if a value is reactive (`Signal` or `Computed`).
@@ -290,14 +312,14 @@ The library supports granular imports for optimal bundle size:
 import { html, signal, computed, effect } from "balises";
 
 // Signals only
-import { signal, computed, effect, store, batch } from "balises/signals";
+import { signal, computed, effect, store, batch, scope } from "balises/signals";
 
 // Individual modules
 import { signal } from "balises/signals/signal";
 import { computed } from "balises/signals/computed";
 import { effect } from "balises/signals/effect";
 import { store } from "balises/signals/store";
-import { batch } from "balises/signals/context";
+import { batch, scope } from "balises/signals/context";
 ```
 
 ## Full Example
@@ -368,6 +390,89 @@ class Counter extends HTMLElement {
 }
 ```
 
+<!-- BENCHMARK_RESULTS_START -->
+
+## Benchmarks
+
+Performance comparison of Balises against other popular reactive libraries. Benchmarks run in isolated processes to prevent V8 JIT contamination.
+
+**Test Environment:**
+
+- Node.js with V8 engine
+- Each test runs in a separate process (isolated mode)
+- **10 warmup runs** to stabilize JIT
+- **100 iterations per test**, keeping middle 20 (discarding 40 best + 40 worst to reduce outliers)
+- Tests measure pure reactive propagation (not DOM rendering)
+
+**Scoring Methodology:**
+
+- Overall ranking uses a combined score (50% average rank + 50% normalized average time)
+- This ensures both consistency across scenarios (rank) and absolute performance (time) are valued equally
+- "vs Fastest" compares average time to the fastest library
+
+### Overall Performance
+
+```
+┌───────┬───────────────────┬──────────┬───────────────┬──────────────────┐
+│ Rank  │ Library           │ Avg Rank │ Avg Time (μs) │ vs Fastest       │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #1 🏆 │ balises@0.2.1     │ 1.5      │ 69.76         │ 1.00x (baseline) │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #2    │ preact@1.12.1     │ 1.7      │ 51.59         │ 0.74x            │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #3    │ vue@3.5.26        │ 3.0      │ 72.79         │ 1.04x            │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #4    │ maverick@6.0.0    │ 3.8      │ 91.40         │ 1.31x            │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #5    │ solid@1.9.10      │ 5.3      │ 225.26        │ 3.23x            │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #6    │ mobx@6.15.0       │ 5.8      │ 719.17        │ 10.31x           │
+├───────┼───────────────────┼──────────┼───────────────┼──────────────────┤
+│ #7    │ hyperactiv@0.11.3 │ 6.8      │ 833.03        │ 11.94x           │
+└───────┴───────────────────┴──────────┴───────────────┴──────────────────┘
+```
+
+### Performance by Scenario
+
+```
+┌───────────────────┬───────────────┬─────────────┬────────────────┬────────────────────┬─────────────┬──────────────┬──────────┐
+│ Library           │ S1: 1: Layers │ S2: 2: Wide │ S3: 3: Diamond │ S4: 4: Conditional │ S5: 5: List │ S6: 6: Batch │ Avg Rank │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ balises@0.2.1     │ #3            │ #1 🏆       │ #1 🏆          │ #2                 │ #1 🏆       │ #1 🏆        │ 1.5      │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ preact@1.12.1     │ #1 🏆         │ #2          │ #2             │ #1 🏆              │ #2          │ #2           │ 1.7      │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ vue@3.5.26        │ #2            │ #3          │ #3             │ #3                 │ #3          │ #4           │ 3.0      │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ maverick@6.0.0    │ #4            │ #4          │ #4             │ #4                 │ #4          │ #3           │ 3.8      │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ solid@1.9.10      │ #5            │ #6          │ #5             │ #5                 │ #6          │ #5           │ 5.3      │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ mobx@6.15.0       │ #7            │ #5          │ #6             │ #6                 │ #5          │ #6           │ 5.8      │
+├───────────────────┼───────────────┼─────────────┼────────────────┼────────────────────┼─────────────┼──────────────┼──────────┤
+│ hyperactiv@0.11.3 │ #6            │ #7          │ #7             │ #7                 │ #7          │ #7           │ 6.8      │
+└───────────────────┴───────────────┴─────────────┴────────────────┴────────────────────┴─────────────┴──────────────┴──────────┘
+```
+
+**Scenarios:**
+
+- **S1: Layers** - Deep dependency chains (A→B→C→D...)
+- **S2: Wide** - Many independent signals updating in parallel
+- **S3: Diamond** - Multiple paths to same computed (diamond dependencies)
+- **S4: Conditional** - Dynamic subscriptions (like v-if logic)
+- **S5: List** - List operations with filtering (like v-for patterns)
+- **S6: Batch** - Batched/transactional updates
+
+**Interpretation:**
+
+- Balises excels at diamond dependencies, list operations, and batching while maintaining competitive performance across all scenarios
+- Results show pure reactivity performance - real-world apps should consider framework ecosystem, DX, and specific use cases
+- Lower rank = better performance
+
+_Last updated: 2025-12-30_
+
+<!-- BENCHMARK_RESULTS_END -->
+
 ## Scripts
 
 ```bash

package/dist/balises.esm.js

@@ -37,6 +37,46 @@ function enqueueBatch(sub) {
 function enqueueBatchAll(subs) {
 	for (let i = 0; i < subs.length; i++) batchQueue.add(subs[i]);
 }
+/** Scope disposal: collect all disposers in a scope */
+let disposalStack = null;
+/**
+* Create a disposal scope that collects all subscriptions and computeds created within.
+* Returns the result of the function and a dispose function that cleans up all resources.
+*
+* @example
+* ```ts
+* const [result, dispose] = scope(() => {
+*   const count = signal(0);
+*   const doubled = computed(() => count.value * 2);
+*   effect(() => console.log(doubled.value));
+*   return { count, doubled };
+* });
+*
+* // Later: clean up all subscriptions and computeds
+* dispose();
+* ```
+*/
+function scope(fn) {
+	const disposers = [];
+	if (!disposalStack) disposalStack = [];
+	disposalStack.push(disposers);
+	try {
+		return [fn(), () => {
+			for (let i = disposers.length - 1; i >= 0; i--) disposers[i]();
+			disposers.length = 0;
+		}];
+	} finally {
+		disposalStack.pop();
+		if (disposalStack.length === 0) disposalStack = null;
+	}
+}
+/**
+* Register a disposer in the current scope (if any).
+* This is called internally by computed/effect when they create cleanup functions.
+*/
+function registerDisposer(dispose) {
+	if (disposalStack && disposalStack.length > 0) disposalStack[disposalStack.length - 1].push(dispose);
+}
 
 //#endregion
 //#region src/signals/signal.ts
@@ -126,6 +166,7 @@ var Computed = class {
 	constructor(fn) {
 		this.#fn = fn;
 		this.#recompute();
+		registerDisposer(() => this.dispose());
 	}
 	get value() {
 		if (this.#dirty) this.#recompute();
@@ -267,10 +308,12 @@ function effect(fn) {
 		fn();
 	});
 	const unsub = c.subscribe(() => {});
-	return () => {
+	const dispose = () => {
 		unsub();
 		c.dispose();
 	};
+	registerDisposer(dispose);
+	return dispose;
 }
 
 //#endregion
@@ -717,5 +760,5 @@ function each(list, keyFnOrRenderFn, renderFn) {
 }
 
 //#endregion
-export { Computed, Signal, Template, batch, computed, each, effect, html, isSignal, signal, store };
+export { Computed, Signal, Template, batch, computed, each, effect, html, isSignal, scope, signal, store };
 //# sourceMappingURL=balises.esm.js.map

package/dist/balises.esm.js.map

@@ -1 +1 @@
-{"version":3,"file":"balises.esm.js","names":["context: Computed<unknown> | null","batchQueue: Set<Subscriber> | null","#value","#targets","#subs","#fn","#recompute","#dirty","#value","#subs","#sources","#sourceIndex","source","queue: Computed<unknown>[]","#targets","#computing","strings: TemplateStringsArray","values: unknown[]","disposers: (() => void)[]","stack: (Element | DocumentFragment)[]","nodes: Node[]","childDisposers: (() => void)[]","newNodes: Node[]","prevNode: Node","unsub"],"sources":["../src/signals/context.ts","../src/signals/signal.ts","../src/signals/computed.ts","../src/signals/effect.ts","../src/signals/store.ts","../src/signals/index.ts","../src/parser.ts","../src/template.ts"],"sourcesContent":["/**\n * Global state and batching for the reactive system.\n */\n\nimport type { Computed } from \"./computed.js\";\n\n/** Callback function for subscribers */\nexport type Subscriber = () => void;\n\n/** The currently executing computed (for dependency tracking) */\nexport let context: Computed<unknown> | null = null;\n\n/** Set the current execution context */\nexport function setContext(c: Computed<unknown> | null): void {\n  context = c;\n}\n\n/** Batching: defer subscriber notifications until batch completes */\nlet batchDepth = 0;\nlet batchQueue: Set<Subscriber> | null = null;\n\n/**\n * Batch multiple signal updates into a single notification pass.\n * Subscribers are only notified after the batch function completes.\n */\nexport function batch<T>(fn: () => T): T {\n  batchDepth++;\n  if (batchDepth === 1) batchQueue = new Set();\n  try {\n    return fn();\n  } finally {\n    if (--batchDepth === 0) {\n      const q = batchQueue!;\n      batchQueue = null;\n      for (const sub of q) sub();\n    }\n  }\n}\n\n/** Check if currently batching */\nexport function isBatching(): boolean {\n  return batchDepth > 0;\n}\n\n/** Add a subscriber to the batch queue */\nexport function enqueueBatch(sub: Subscriber): void {\n  batchQueue!.add(sub);\n}\n\n/** Add multiple subscribers to the batch queue */\nexport function enqueueBatchAll(subs: Subscriber[]): void {\n  for (let i = 0; i < subs.length; i++) {\n    batchQueue!.add(subs[i]!);\n  }\n}\n","/**\n * Signal - A reactive value container.\n */\n\nimport type { Computed } from \"./computed.js\";\nimport {\n  context,\n  isBatching,\n  enqueueBatchAll,\n  type Subscriber,\n} from \"./context.js\";\n\n/**\n * Remove an item from an array using swap-and-pop (O(1) removal).\n */\nexport function removeFromArray<T>(array: T[], item: T): void {\n  const i = array.indexOf(item);\n  if (i >= 0) {\n    array[i] = array[array.length - 1]!;\n    array.pop();\n  }\n}\n\n/**\n * A reactive value container. When the value changes, all dependent\n * computeds are marked dirty and subscribers are notified.\n *\n * Uses Object.is() for equality checks to correctly handle NaN values.\n */\nexport class Signal<T> {\n  #value: T;\n  #subs: Subscriber[] = [];\n  #targets: Computed<unknown>[] = [];\n\n  constructor(value: T) {\n    this.#value = value;\n  }\n\n  get value(): T {\n    if (context) context.trackSource(this);\n    return this.#value;\n  }\n\n  set value(v: T) {\n    if (Object.is(this.#value, v)) return;\n    this.#value = v;\n\n    // Mark all dependent computeds as dirty\n    const targets = this.#targets;\n    for (let i = 0; i < targets.length; i++) {\n      targets[i]!.markDirty();\n    }\n\n    // Notify subscribers\n    if (this.#subs.length) {\n      if (isBatching()) {\n        enqueueBatchAll(this.#subs);\n      } else {\n        for (let i = 0; i < this.#subs.length; i++) this.#subs[i]!();\n      }\n    }\n  }\n\n  subscribe(fn: Subscriber): () => void {\n    this.#subs.push(fn);\n    return () => removeFromArray(this.#subs, fn);\n  }\n\n  /**\n   * Update the signal value using an updater function.\n   *\n   * @param fn - Function that receives current value and returns new value\n   *\n   * @example\n   * const count = signal(0);\n   * count.update(n => n + 1); // increment\n   */\n  update(fn: (current: T) => T): void {\n    this.value = fn(this.#value);\n  }\n\n  /** @internal */\n  get targets(): Computed<unknown>[] {\n    return this.#targets;\n  }\n\n  /** @internal */\n  deleteTarget(target: Computed<unknown>): void {\n    removeFromArray(this.#targets, target);\n  }\n}\n\n/** Create a new signal with the given initial value. */\nexport const signal = <T>(value: T) => new Signal(value);\n","/**\n * Computed - A derived reactive value.\n */\n\nimport { Signal, removeFromArray } from \"./signal.js\";\nimport {\n  context,\n  setContext,\n  isBatching,\n  enqueueBatch,\n  type Subscriber,\n} from \"./context.js\";\n\n/**\n * A derived reactive value. Automatically tracks dependencies and\n * recomputes when any dependency changes.\n *\n * Uses Object.is() for equality checks to correctly handle NaN values.\n */\nexport class Computed<T> {\n  #fn: (() => T) | undefined;\n  #value: T | undefined;\n  #dirty = true;\n  #computing = false;\n  #subs: Subscriber[] = [];\n  #targets: Computed<unknown>[] = [];\n  #sources: (Signal<unknown> | Computed<unknown>)[] = [];\n  #sourceIndex = 0;\n\n  constructor(fn: () => T) {\n    this.#fn = fn;\n    this.#recompute();\n  }\n\n  get value(): T {\n    if (this.#dirty) this.#recompute();\n    if (context && context !== this) context.trackSource(this);\n    return this.#value as T;\n  }\n\n  subscribe(fn: Subscriber): () => void {\n    this.#subs.push(fn);\n    return () => removeFromArray(this.#subs, fn);\n  }\n\n  dispose(): void {\n    this.#fn = undefined;\n    const sources = this.#sources;\n    for (let i = 0; i < sources.length; i++) {\n      const source = sources[i];\n      if (source) source.deleteTarget(this);\n    }\n    this.#sources = [];\n    this.#subs.length = 0;\n  }\n\n  /**\n   * Called by sources when accessed during recompute.\n   * @internal\n   */\n  trackSource(source: Signal<unknown> | Computed<unknown>): void {\n    const sources = this.#sources;\n    const idx = this.#sourceIndex++;\n\n    if (idx < sources.length) {\n      if (sources[idx] === source) {\n        // Same source at same position - nothing to do\n        return;\n      }\n      // Different source - unlink old ones from this position\n      for (let i = idx; i < sources.length; i++) {\n        const source = sources[i];\n        if (source) source.deleteTarget(this);\n      }\n      sources.length = idx;\n    }\n    // Add new source\n    sources.push(source);\n    source.targets.push(this);\n  }\n\n  /**\n   * Mark this computed and all its dependents as dirty.\n   * @internal\n   */\n  markDirty(): void {\n    if (this.#dirty) return;\n\n    const queue: Computed<unknown>[] = [this];\n    for (let i = 0; i < queue.length; i++) {\n      const c = queue[i]!;\n      if (c.#dirty) continue;\n      c.#dirty = true;\n\n      const targets = c.#targets;\n\n      // Short-circuit optimization: if this computed has both subscribers AND downstream dependents,\n      // eagerly recompute to check if the value actually changed before propagating.\n      // Only do this outside of batching to avoid intermediate/inconsistent state.\n      if (c.#subs.length > 0 && targets.length > 0 && c.#fn && !isBatching()) {\n        const old = c.#value;\n        c.#recompute();\n        const valueChanged = !Object.is(c.#value, old);\n\n        // Only propagate dirty flag to targets if value actually changed\n        if (valueChanged) {\n          for (let j = 0; j < targets.length; j++) {\n            const target = targets[j]!;\n            if (!target.#dirty) queue.push(target);\n          }\n\n          // Notify subscribers since value changed (we're not batching here)\n          for (let j = 0; j < c.#subs.length; j++) c.#subs[j]!();\n        }\n        // If value didn't change, don't propagate or notify\n      } else {\n        // No short-circuiting needed - use original behavior\n        for (let j = 0; j < targets.length; j++) {\n          const target = targets[j]!;\n          if (!target.#dirty) queue.push(target);\n        }\n\n        if (c.#subs.length) {\n          const old = c.#value;\n          const notify = () => {\n            if (c.#fn) {\n              c.#recompute();\n              if (!Object.is(c.#value, old)) {\n                for (let j = 0; j < c.#subs.length; j++) c.#subs[j]!();\n              }\n            }\n          };\n          if (isBatching()) {\n            enqueueBatch(notify);\n          } else {\n            notify();\n          }\n        }\n      }\n    }\n  }\n\n  /** @internal */\n  get targets(): Computed<unknown>[] {\n    return this.#targets;\n  }\n\n  /** @internal */\n  deleteTarget(target: Computed<unknown>): void {\n    removeFromArray(this.#targets, target);\n  }\n\n  #recompute(): void {\n    if (this.#computing || !this.#fn) return;\n    this.#computing = true;\n\n    this.#sourceIndex = 0;\n    const prevLen = this.#sources.length;\n\n    const prev = context;\n    setContext(this);\n    try {\n      this.#value = this.#fn();\n    } finally {\n      setContext(prev);\n\n      // Unlink removed sources\n      const newLen = this.#sourceIndex;\n      if (newLen < prevLen) {\n        const sources = this.#sources;\n        for (let i = newLen; i < prevLen; i++) {\n          const source = sources[i];\n          if (source) source.deleteTarget(this);\n        }\n        sources.length = newLen;\n      }\n\n      this.#dirty = false;\n      this.#computing = false;\n    }\n  }\n}\n\n/** Create a new computed from the given function. */\nexport const computed = <T>(fn: () => T) => new Computed(fn);\n","/**\n * Effect - Run side effects reactively.\n */\n\nimport { computed } from \"./computed.js\";\n\n/**\n * Create a reactive effect that automatically tracks dependencies\n * and re-runs when they change.\n *\n * @param fn - The effect function to run\n * @returns A dispose function to stop the effect\n *\n * @example\n * const count = signal(0);\n * const dispose = effect(() => {\n *   console.log(\"Count is:\", count.value);\n * });\n *\n * count.value = 1; // logs: \"Count is: 1\"\n * dispose(); // stop the effect\n */\nexport function effect(fn: () => void): () => void {\n  const c = computed(() => {\n    fn();\n    return undefined;\n  });\n\n  // Subscribe to make it reactive (rerun on dependency changes)\n  const unsub = c.subscribe(() => {});\n\n  return () => {\n    unsub();\n    c.dispose();\n  };\n}\n","/**\n * Store - Reactive wrapper for plain objects.\n */\n\nimport { Signal } from \"./signal.js\";\n\nconst STORE = Symbol();\n\nconst isPlainObject = (value: unknown): value is Record<string, unknown> =>\n  value !== null &&\n  typeof value === \"object\" &&\n  Object.getPrototypeOf(value) === Object.prototype;\n\n/**\n * Create a reactive store from a plain object.\n * Each property becomes a signal, and nested objects are recursively wrapped.\n */\nexport function store<T extends object>(obj: T): T {\n  const signals = new Map<string | symbol, Signal<unknown>>();\n\n  /** Recursively wrap nested objects and arrays */\n  const wrap = (value: unknown): unknown => {\n    if (value !== null && typeof value === \"object\" && STORE in value) {\n      return value; // Already a store\n    }\n    if (isPlainObject(value)) {\n      return store(value);\n    }\n    if (Array.isArray(value)) {\n      return value.map(wrap);\n    }\n    return value;\n  };\n\n  /** Get or create a signal for a property */\n  const getSignal = (key: string | symbol, initialValue: unknown) => {\n    let sig = signals.get(key);\n    if (!sig) {\n      sig = new Signal(wrap(initialValue));\n      signals.set(key, sig);\n    }\n    return sig;\n  };\n\n  return new Proxy(obj, {\n    get(target, key) {\n      // Allow symbol access (for STORE check and other internal symbols)\n      if (typeof key === \"symbol\") {\n        return target[key as keyof T];\n      }\n      return getSignal(key, target[key as keyof T]).value;\n    },\n\n    set(target, key, value) {\n      if (typeof key === \"symbol\") {\n        target[key as keyof T] = value;\n        return true;\n      }\n      const wrapped = wrap(value);\n      getSignal(key, target[key as keyof T]).value = wrapped;\n      target[key as keyof T] = wrapped as T[keyof T];\n      return true;\n    },\n\n    has(target, key) {\n      return key === STORE || key in target;\n    },\n  });\n}\n","/**\n * Reactive signals with automatic dependency tracking.\n *\n * Uses index-based tracking: computed functions are assumed to access\n * their dependencies in the same order on each run. This enables O(1)\n * dependency checks without complex linked-list structures.\n */\n\nexport { Signal, signal } from \"./signal.js\";\nexport { Computed, computed } from \"./computed.js\";\nexport { effect } from \"./effect.js\";\nexport { store } from \"./store.js\";\nexport { batch, type Subscriber } from \"./context.js\";\n\nimport { Signal } from \"./signal.js\";\nimport { Computed } from \"./computed.js\";\n\n/** Common interface for reactive values (Signal or Computed). */\nexport interface Reactive<T> {\n  readonly value: T;\n  subscribe(fn: () => void): () => void;\n}\n\n/** Check if a value is a reactive signal or computed. */\nexport const isSignal = (value: unknown): value is Reactive<unknown> =>\n  value instanceof Signal || value instanceof Computed;\n","/**\n * Streaming HTML parser for template literals.\n * State machine: Text=0, TagOpen=1, TagName=2, InTag=3, AttrName=4, AttrEq=5, AttrVal=6, CloseTag=7, Comment=8\n */\n\nexport type AttrPart = string | { index: number };\n\nexport interface ParseCallbacks {\n  onText: (text: string) => void;\n  onElement: (el: Element, selfClosing: boolean) => void;\n  onClose: () => void;\n  onAttribute: (el: Element, name: string, parts: AttrPart[]) => void;\n  onSlot: (index: number) => void;\n}\n\nexport class HTMLParser {\n  private s = 0; // state\n  private el: Element | null = null;\n  private tag = \"\";\n  private attr = \"\";\n  private parts: AttrPart[] = [];\n  private text = \"\";\n  private q = \"\";\n\n  parseTemplate(strings: TemplateStringsArray, cb: ParseCallbacks) {\n    for (let i = 0; i < strings.length; i++) {\n      this.parse(strings[i]!, cb);\n      if (i < strings.length - 1) this.slot(i, cb);\n    }\n    if (this.text) {\n      cb.onText(this.text);\n      this.text = \"\";\n    }\n  }\n\n  private parse(str: string, cb: ParseCallbacks) {\n    for (let i = 0; i < str.length; i++) {\n      const ch = str[i]!,\n        nx = str[i + 1],\n        n2 = str[i + 2];\n\n      if (this.s === 0) {\n        // Text\n        if (ch === \"<\") {\n          if (this.text) {\n            cb.onText(this.text);\n            this.text = \"\";\n          }\n          this.s = 1;\n        } else this.text += ch;\n      } else if (this.s === 1) {\n        // TagOpen\n        if (ch === \"/\") this.s = 7;\n        else if (ch === \"!\" && nx === \"-\" && n2 === \"-\") {\n          i += 2;\n          this.s = 8;\n        } else if (ch === \"!\" || ch === \"?\") {\n          while (i < str.length && str[i] !== \">\") i++;\n          this.s = 0;\n        } else if (this.isA(ch)) {\n          this.tag = ch;\n          this.s = 2;\n        } else {\n          this.text += \"<\" + ch;\n          this.s = 0;\n        }\n      } else if (this.s === 2) {\n        // TagName\n        if (this.isT(ch)) this.tag += ch;\n        else if (this.isW(ch)) {\n          this.el = document.createElement(this.tag);\n          this.tag = \"\";\n          this.s = 3;\n        } else if (ch === \">\") {\n          this.el = document.createElement(this.tag);\n          this.tag = \"\";\n          this.emit(cb, false);\n        } else if (ch === \"/\" && nx === \">\") {\n          this.el = document.createElement(this.tag);\n          this.tag = \"\";\n          i++;\n          this.emit(cb, true);\n        }\n      } else if (this.s === 3) {\n        // InTag\n        if (this.isW(ch)) continue;\n        if (ch === \">\") this.emit(cb, false);\n        else if (ch === \"/\" && nx === \">\") {\n          i++;\n          this.emit(cb, true);\n        } else {\n          this.attr = ch;\n          this.parts = [];\n          this.s = 4;\n        }\n      } else if (this.s === 4) {\n        // AttrName\n        if (this.isT(ch) || ch === \"_\") this.attr += ch;\n        else if (ch === \"=\") this.s = 5;\n        else if (this.isW(ch)) {\n          this.emitAttr(cb);\n          this.s = 3;\n        } else if (ch === \">\") {\n          this.emitAttr(cb);\n          this.emit(cb, false);\n        } else if (ch === \"/\" && nx === \">\") {\n          this.emitAttr(cb);\n          i++;\n          this.emit(cb, true);\n        }\n      } else if (this.s === 5) {\n        // AttrEq\n        if (ch === '\"' || ch === \"'\") {\n          this.q = ch;\n          this.s = 6;\n        } else if (!this.isW(ch)) {\n          this.q = \"\";\n          this.parts.push(ch);\n          this.s = 6;\n        }\n      } else if (this.s === 6) {\n        // AttrVal\n        const end = this.q\n          ? ch === this.q\n          : this.isW(ch) || ch === \">\" || ch === \"/\";\n        if (end) {\n          this.emitAttr(cb);\n          this.q = \"\";\n          this.s = 3;\n          if (ch === \">\") this.emit(cb, false);\n          else if (ch === \"/\" && nx === \">\") {\n            i++;\n            this.emit(cb, true);\n          }\n        } else {\n          const last = this.parts[this.parts.length - 1];\n          if (typeof last === \"string\")\n            this.parts[this.parts.length - 1] = last + ch;\n          else this.parts.push(ch);\n        }\n      } else if (this.s === 7) {\n        // CloseTag\n        if (ch === \">\") {\n          cb.onClose();\n          this.s = 0;\n        }\n      } else if (this.s === 8) {\n        // Comment\n        if (ch === \"-\" && nx === \"-\" && n2 === \">\") {\n          i += 2;\n          this.s = 0;\n        }\n      }\n    }\n  }\n\n  private slot(index: number, cb: ParseCallbacks) {\n    if (this.s === 5 || this.s === 6) {\n      this.parts.push({ index });\n      if (this.s === 5) this.s = 6;\n    } else {\n      if (this.text) {\n        cb.onText(this.text);\n        this.text = \"\";\n      }\n      cb.onSlot(index);\n    }\n  }\n\n  private emit(cb: ParseCallbacks, self: boolean) {\n    cb.onElement(this.el!, self);\n    this.el = null;\n    this.s = 0;\n  }\n\n  private emitAttr(cb: ParseCallbacks) {\n    if (this.el && this.attr) cb.onAttribute(this.el, this.attr, this.parts);\n    this.attr = \"\";\n    this.parts = [];\n  }\n\n  private isA(c: string) {\n    return (c >= \"a\" && c <= \"z\") || (c >= \"A\" && c <= \"Z\");\n  }\n  private isT(c: string) {\n    return this.isA(c) || (c >= \"0\" && c <= \"9\") || c === \"-\" || c === \":\";\n  }\n  private isW(c: string) {\n    return c === \" \" || c === \"\\t\" || c === \"\\n\" || c === \"\\r\";\n  }\n}\n","/**\n * HTML template rendering with reactive bindings.\n *\n * Uses tagged template literals to create reactive DOM:\n * - Text interpolation: ${value} or ${signal}\n * - Attribute binding: class=\"${signal}\" (reactive)\n * - Event binding: @click=${handler}\n * - Property binding: .value=${signal} (sets DOM property, not attribute)\n * - Nested templates: ${html`<span>...</span>`}\n * - Arrays: ${items.map(i => html`<li>${i}</li>`)}\n */\n\nimport { computed, isSignal, signal, type Reactive } from \"./signals/index.js\";\nimport { HTMLParser } from \"./parser.js\";\n\n/**\n * Bind a value to an update function.\n * If reactive, subscribes and returns unsubscribe. Otherwise returns null.\n */\nfunction bind(\n  value: unknown,\n  update: (v: unknown) => void,\n): (() => void) | null {\n  if (isSignal(value)) {\n    update(value.value);\n    return value.subscribe(() => update((value as Reactive<unknown>).value));\n  }\n  update(value);\n  return null;\n}\n\n/** A parsed HTML template. Call render() to create live DOM. */\nexport class Template {\n  constructor(\n    private strings: TemplateStringsArray,\n    private values: unknown[],\n  ) {}\n\n  /**\n   * Parse template and create live DOM.\n   * Returns the fragment and a dispose function to clean up subscriptions.\n   */\n  render(): { fragment: DocumentFragment; dispose: () => void } {\n    const fragment = document.createDocumentFragment();\n    const disposers: (() => void)[] = [];\n    const stack: (Element | DocumentFragment)[] = [fragment];\n    const parser = new HTMLParser();\n    const values = this.values;\n\n    parser.parseTemplate(this.strings, {\n      onText: (text) => {\n        stack.at(-1)!.appendChild(document.createTextNode(text));\n      },\n\n      onElement: (el, selfClosing) => {\n        stack.at(-1)!.appendChild(el);\n        if (!selfClosing) stack.push(el);\n      },\n\n      onClose: () => {\n        if (stack.length > 1) stack.pop();\n      },\n\n      onAttribute: (el, name, parts) => {\n        const prefix = name[0];\n\n        // Event binding: @click=${handler}\n        if (prefix === \"@\") {\n          const event = name.slice(1);\n          const part = parts[0];\n          if (part && typeof part !== \"string\") {\n            const handler = values[part.index] as EventListener;\n            el.addEventListener(event, handler);\n            disposers.push(() => el.removeEventListener(event, handler));\n          }\n          return;\n        }\n\n        // Property binding: .value=${data} - sets DOM property directly\n        if (prefix === \".\") {\n          const prop = name.slice(1);\n          const part = parts[0];\n          if (part && typeof part !== \"string\") {\n            const unsub = bind(values[part.index], (v) => {\n              (el as unknown as Record<string, unknown>)[prop] = v;\n            });\n            if (unsub) disposers.push(unsub);\n          }\n          return;\n        }\n\n        // Static attribute (all parts are strings)\n        if (parts.every((p) => typeof p === \"string\")) {\n          const value = parts.join(\"\");\n          if (value || parts.length === 0) {\n            el.setAttribute(name, value);\n          }\n          return;\n        }\n\n        // Dynamic attribute - has at least one interpolated value\n        const dynamicParts = parts.filter(\n          (p): p is { index: number } => typeof p !== \"string\",\n        );\n        const signals = dynamicParts\n          .map((p) => values[p.index])\n          .filter(isSignal) as Reactive<unknown>[];\n\n        // Single dynamic with no static parts: handle null/false as removal\n        const isSingleDynamic =\n          parts.length === 1 && typeof parts[0] !== \"string\";\n\n        const update = () => {\n          if (isSingleDynamic) {\n            // Boolean/null handling: false/null removes, true sets empty string\n            const v = values[dynamicParts[0]!.index];\n            const val = isSignal(v) ? (v as Reactive<unknown>).value : v;\n            if (val == null || val === false) el.removeAttribute(name);\n            else el.setAttribute(name, val === true ? \"\" : String(val));\n          } else {\n            // Multi-part: concatenate all parts\n            const resolved = parts\n              .map((p) => {\n                if (typeof p === \"string\") return p;\n                const v = values[p.index];\n                const val = isSignal(v) ? (v as Reactive<unknown>).value : v;\n                return val == null ? \"\" : String(val);\n              })\n              .join(\"\");\n            el.setAttribute(name, resolved);\n          }\n        };\n\n        update();\n        signals.forEach((s) => disposers.push(s.subscribe(update)));\n      },\n\n      onSlot: (index) => {\n        // Marker comment anchors dynamic content\n        const marker = document.createComment(\"\");\n        stack.at(-1)!.appendChild(marker);\n        disposers.push(bindContent(marker, values[index]));\n      },\n    });\n\n    return { fragment, dispose: () => disposers.forEach((d) => d()) };\n  }\n}\n\n/** Cached entry for a keyed list item */\ninterface EachEntry {\n  item: unknown;\n  nodes: Node[];\n  dispose: () => void;\n}\n\n/**\n * Bind dynamic content at a marker position.\n * Handles primitives (as text), Templates (rendered), Each (keyed lists), and arrays.\n * null/undefined/boolean render nothing (enables conditional: ${cond && html`...`})\n */\nfunction bindContent(marker: Comment, value: unknown): () => void {\n  let nodes: Node[] = [];\n  let childDisposers: (() => void)[] = [];\n\n  const clear = () => {\n    childDisposers.forEach((d) => d());\n    childDisposers = [];\n    nodes.forEach((n) => n.parentNode?.removeChild(n));\n    nodes = [];\n  };\n\n  // Handle each() - keyed list for efficient list rendering\n  if (isEach(value)) {\n    const cache = new Map<unknown, EachEntry>();\n    const { list, keyFn, renderFn } = value;\n    let warnedDuplicate = false;\n\n    const updateList = () => {\n      const parent = marker.parentNode!;\n      const items = list.value;\n      const newKeys = new Set<unknown>();\n      const newNodes: Node[] = [];\n\n      for (let i = 0; i < items.length; i++) {\n        const item = items[i]!;\n        const key = keyFn(item, i);\n\n        if (newKeys.has(key)) {\n          if (!warnedDuplicate) {\n            warnedDuplicate = true;\n            console.warn(\n              `[balises] Duplicate key in each(): ${String(key)}. ` +\n                `Each item should have a unique key. Consider providing a keyFn.`,\n            );\n          }\n          continue; // Skip duplicate\n        }\n        newKeys.add(key);\n\n        let entry = cache.get(key);\n        if (!entry || entry.item !== item) {\n          // First time seeing this key, or item at this key changed → render template\n          if (entry) {\n            // Dispose old entry for this key\n            entry.nodes.forEach((n) => n.parentNode?.removeChild(n));\n            entry.dispose();\n          }\n          const { fragment, dispose } = renderFn(item).render();\n          entry = { item, nodes: [...fragment.childNodes], dispose };\n          cache.set(key, entry);\n        }\n        newNodes.push(...entry.nodes);\n      }\n\n      // Remove nodes for deleted keys\n      for (const [key, entry] of cache) {\n        if (!newKeys.has(key)) {\n          entry.nodes.forEach((n) => n.parentNode?.removeChild(n));\n          entry.dispose();\n          cache.delete(key);\n        }\n      }\n\n      // Reorder/insert nodes in correct order\n      let prevNode: Node = marker;\n      for (let i = newNodes.length - 1; i >= 0; i--) {\n        const node = newNodes[i]!;\n        if (node.nextSibling !== prevNode) {\n          parent.insertBefore(node, prevNode);\n        }\n        prevNode = node;\n      }\n\n      nodes = newNodes;\n    };\n\n    updateList();\n    const unsub = list.subscribe(updateList);\n\n    return () => {\n      unsub();\n      for (const entry of cache.values()) {\n        entry.dispose();\n      }\n      cache.clear();\n      nodes.forEach((n) => n.parentNode?.removeChild(n));\n    };\n  }\n\n  const update = (v: unknown) => {\n    clear();\n    const parent = marker.parentNode!;\n\n    for (const item of Array.isArray(v) ? v : [v]) {\n      if (item instanceof Template) {\n        const { fragment, dispose } = item.render();\n        childDisposers.push(dispose);\n        nodes.push(...fragment.childNodes);\n        parent.insertBefore(fragment, marker);\n      } else if (item != null && typeof item !== \"boolean\") {\n        const node = document.createTextNode(String(item));\n        nodes.push(node);\n        parent.insertBefore(node, marker);\n      }\n    }\n  };\n\n  const unsub = bind(value, update);\n  return () => {\n    unsub?.();\n    clear();\n  };\n}\n\n/** Tagged template literal for creating reactive HTML templates */\nexport const html = (strings: TemplateStringsArray, ...values: unknown[]) =>\n  new Template(strings, values);\n\n/** Marker symbol for keyed list objects */\nconst EACH = Symbol();\n\n/** Keyed list descriptor */\ninterface EachDescriptor<T> {\n  [EACH]: true;\n  list: Reactive<T[]>;\n  keyFn: (item: T, index: number) => unknown;\n  renderFn: (item: T) => Template;\n}\n\n/** Type guard for Each descriptor */\nconst isEach = (v: unknown): v is EachDescriptor<unknown> =>\n  v != null && typeof v === \"object\" && EACH in v;\n\n/** List input type - accepts arrays, reactive arrays, or getter functions */\ntype ListInput<T> = T[] | Reactive<T[]> | (() => T[]);\n\n/** Normalize list input to a reactive signal */\nfunction toReactiveList<T>(list: ListInput<T>): Reactive<T[]> {\n  if (Array.isArray(list)) return signal(list);\n  if (typeof list === \"function\") return computed(list);\n  return list;\n}\n\n/**\n * Efficient keyed list rendering.\n *\n * Caches templates by key, only re-rendering when items are added/removed.\n * For content updates within items, use nested signals:\n *\n * ```ts\n * const items = signal([\n *   { id: 1, name: signal(\"Alice\") },\n *   { id: 2, name: signal(\"Bob\") },\n * ]);\n *\n * // With explicit key (recommended when items may have same reference after re-fetch)\n * html`<ul>${each(items, i => i.id, i => html`<li>${i.name}</li>`)}</ul>`\n *\n * // Without key (uses object reference for objects, index for primitives)\n * html`<ul>${each(items, i => html`<li>${i.name}</li>`)}</ul>`\n *\n * // With getter function (useful with stores)\n * html`<ul>${each(() => state.items, i => html`<li>${i.name}</li>`)}</ul>`\n *\n * // With plain array (static, won't react to changes)\n * html`<ul>${each([\"a\", \"b\", \"c\"], i => html`<li>${i}</li>`)}</ul>`\n * ```\n */\nexport function each<T>(\n  list: ListInput<T>,\n  renderFn: (item: T) => Template,\n): EachDescriptor<T>;\nexport function each<T>(\n  list: ListInput<T>,\n  keyFn: (item: T, index: number) => unknown,\n  renderFn: (item: T) => Template,\n): EachDescriptor<T>;\nexport function each<T>(\n  list: ListInput<T>,\n  keyFnOrRenderFn:\n    | ((item: T, index: number) => unknown)\n    | ((item: T) => Template),\n  renderFn?: (item: T) => Template,\n): EachDescriptor<T> {\n  const reactiveList = toReactiveList(list);\n\n  if (renderFn === undefined) {\n    // Two-arg form: each(list, renderFn)\n    // Use object reference for objects, index for primitives\n    return {\n      [EACH]: true,\n      list: reactiveList,\n      keyFn: (item, index) =>\n        item !== null &&\n        (typeof item === \"object\" || typeof item === \"function\")\n          ? item\n          : index,\n      renderFn: keyFnOrRenderFn as (item: T) => Template,\n    };\n  }\n  // Three-arg form: each(list, keyFn, renderFn)\n  return {\n    [EACH]: true,\n    list: reactiveList,\n    keyFn: keyFnOrRenderFn as (item: T, index: number) => unknown,\n    renderFn,\n  };\n}\n"],"mappings":";;AAUA,IAAWA,UAAoC;;AAG/C,SAAgB,WAAW,GAAmC;AAC5D,WAAU;;;AAIZ,IAAI,aAAa;AACjB,IAAIC,aAAqC;;;;;AAMzC,SAAgB,MAAS,IAAgB;AACvC;AACA,KAAI,eAAe,EAAG,8BAAa,IAAI,KAAK;AAC5C,KAAI;AACF,SAAO,IAAI;WACH;AACR,MAAI,EAAE,eAAe,GAAG;GACtB,MAAM,IAAI;AACV,gBAAa;AACb,QAAK,MAAM,OAAO,EAAG,MAAK;;;;;AAMhC,SAAgB,aAAsB;AACpC,QAAO,aAAa;;;AAItB,SAAgB,aAAa,KAAuB;AAClD,YAAY,IAAI,IAAI;;;AAItB,SAAgB,gBAAgB,MAA0B;AACxD,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,YAAY,IAAI,KAAK,GAAI;;;;;;;;ACrC7B,SAAgB,gBAAmB,OAAY,MAAe;CAC5D,MAAM,IAAI,MAAM,QAAQ,KAAK;AAC7B,KAAI,KAAK,GAAG;AACV,QAAM,KAAK,MAAM,MAAM,SAAS;AAChC,QAAM,KAAK;;;;;;;;;AAUf,IAAa,SAAb,MAAuB;CACrB;CACA,QAAsB,EAAE;CACxB,WAAgC,EAAE;CAElC,YAAY,OAAU;AACpB,QAAKC,QAAS;;CAGhB,IAAI,QAAW;AACb,MAAI,QAAS,SAAQ,YAAY,KAAK;AACtC,SAAO,MAAKA;;CAGd,IAAI,MAAM,GAAM;AACd,MAAI,OAAO,GAAG,MAAKA,OAAQ,EAAE,CAAE;AAC/B,QAAKA,QAAS;EAGd,MAAM,UAAU,MAAKC;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAClC,SAAQ,GAAI,WAAW;AAIzB,MAAI,MAAKC,KAAM,OACb,KAAI,YAAY,CACd,iBAAgB,MAAKA,KAAM;MAE3B,MAAK,IAAI,IAAI,GAAG,IAAI,MAAKA,KAAM,QAAQ,IAAK,OAAKA,KAAM,IAAK;;CAKlE,UAAU,IAA4B;AACpC,QAAKA,KAAM,KAAK,GAAG;AACnB,eAAa,gBAAgB,MAAKA,MAAO,GAAG;;;;;;;;;;;CAY9C,OAAO,IAA6B;AAClC,OAAK,QAAQ,GAAG,MAAKF,MAAO;;;CAI9B,IAAI,UAA+B;AACjC,SAAO,MAAKC;;;CAId,aAAa,QAAiC;AAC5C,kBAAgB,MAAKA,SAAU,OAAO;;;;AAK1C,MAAa,UAAa,UAAa,IAAI,OAAO,MAAM;;;;;;;;;;;;;AC1ExD,IAAa,WAAb,MAAyB;CACvB;CACA;CACA,SAAS;CACT,aAAa;CACb,QAAsB,EAAE;CACxB,WAAgC,EAAE;CAClC,WAAoD,EAAE;CACtD,eAAe;CAEf,YAAY,IAAa;AACvB,QAAKE,KAAM;AACX,QAAKC,WAAY;;CAGnB,IAAI,QAAW;AACb,MAAI,MAAKC,MAAQ,OAAKD,WAAY;AAClC,MAAI,WAAW,YAAY,KAAM,SAAQ,YAAY,KAAK;AAC1D,SAAO,MAAKE;;CAGd,UAAU,IAA4B;AACpC,QAAKC,KAAM,KAAK,GAAG;AACnB,eAAa,gBAAgB,MAAKA,MAAO,GAAG;;CAG9C,UAAgB;AACd,QAAKJ,KAAM;EACX,MAAM,UAAU,MAAKK;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;AACvB,OAAI,OAAQ,QAAO,aAAa,KAAK;;AAEvC,QAAKA,UAAW,EAAE;AAClB,QAAKD,KAAM,SAAS;;;;;;CAOtB,YAAY,QAAmD;EAC7D,MAAM,UAAU,MAAKC;EACrB,MAAM,MAAM,MAAKC;AAEjB,MAAI,MAAM,QAAQ,QAAQ;AACxB,OAAI,QAAQ,SAAS,OAEnB;AAGF,QAAK,IAAI,IAAI,KAAK,IAAI,QAAQ,QAAQ,KAAK;IACzC,MAAMC,WAAS,QAAQ;AACvB,QAAIA,SAAQ,UAAO,aAAa,KAAK;;AAEvC,WAAQ,SAAS;;AAGnB,UAAQ,KAAK,OAAO;AACpB,SAAO,QAAQ,KAAK,KAAK;;;;;;CAO3B,YAAkB;AAChB,MAAI,MAAKL,MAAQ;EAEjB,MAAMM,QAA6B,CAAC,KAAK;AACzC,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,IAAI,MAAM;AAChB,OAAI,GAAEN,MAAQ;AACd,MAAEA,QAAS;GAEX,MAAM,UAAU,GAAEO;AAKlB,OAAI,GAAEL,KAAM,SAAS,KAAK,QAAQ,SAAS,KAAK,GAAEJ,MAAO,CAAC,YAAY,EAAE;IACtE,MAAM,MAAM,GAAEG;AACd,OAAEF,WAAY;AAId,QAHqB,CAAC,OAAO,GAAG,GAAEE,OAAQ,IAAI,EAG5B;AAChB,UAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;MACvC,MAAM,SAAS,QAAQ;AACvB,UAAI,CAAC,QAAOD,MAAQ,OAAM,KAAK,OAAO;;AAIxC,UAAK,IAAI,IAAI,GAAG,IAAI,GAAEE,KAAM,QAAQ,IAAK,IAAEA,KAAM,IAAK;;UAGnD;AAEL,SAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;KACvC,MAAM,SAAS,QAAQ;AACvB,SAAI,CAAC,QAAOF,MAAQ,OAAM,KAAK,OAAO;;AAGxC,QAAI,GAAEE,KAAM,QAAQ;KAClB,MAAM,MAAM,GAAED;KACd,MAAM,eAAe;AACnB,UAAI,GAAEH,IAAK;AACT,UAAEC,WAAY;AACd,WAAI,CAAC,OAAO,GAAG,GAAEE,OAAQ,IAAI,CAC3B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAEC,KAAM,QAAQ,IAAK,IAAEA,KAAM,IAAK;;;AAI5D,SAAI,YAAY,CACd,cAAa,OAAO;SAEpB,SAAQ;;;;;;CAQlB,IAAI,UAA+B;AACjC,SAAO,MAAKK;;;CAId,aAAa,QAAiC;AAC5C,kBAAgB,MAAKA,SAAU,OAAO;;CAGxC,aAAmB;AACjB,MAAI,MAAKC,aAAc,CAAC,MAAKV,GAAK;AAClC,QAAKU,YAAa;AAElB,QAAKJ,cAAe;EACpB,MAAM,UAAU,MAAKD,QAAS;EAE9B,MAAM,OAAO;AACb,aAAW,KAAK;AAChB,MAAI;AACF,SAAKF,QAAS,MAAKH,IAAK;YAChB;AACR,cAAW,KAAK;GAGhB,MAAM,SAAS,MAAKM;AACpB,OAAI,SAAS,SAAS;IACpB,MAAM,UAAU,MAAKD;AACrB,SAAK,IAAI,IAAI,QAAQ,IAAI,SAAS,KAAK;KACrC,MAAM,SAAS,QAAQ;AACvB,SAAI,OAAQ,QAAO,aAAa,KAAK;;AAEvC,YAAQ,SAAS;;AAGnB,SAAKH,QAAS;AACd,SAAKQ,YAAa;;;;;AAMxB,MAAa,YAAe,OAAgB,IAAI,SAAS,GAAG;;;;;;;;;;;;;;;;;;;;;;;AClK5D,SAAgB,OAAO,IAA4B;CACjD,MAAM,IAAI,eAAe;AACvB,MAAI;GAEJ;CAGF,MAAM,QAAQ,EAAE,gBAAgB,GAAG;AAEnC,cAAa;AACX,SAAO;AACP,IAAE,SAAS;;;;;;;;;AC3Bf,MAAM,QAAQ,QAAQ;AAEtB,MAAM,iBAAiB,UACrB,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,eAAe,MAAM,KAAK,OAAO;;;;;AAM1C,SAAgB,MAAwB,KAAW;CACjD,MAAM,0BAAU,IAAI,KAAuC;;CAG3D,MAAM,QAAQ,UAA4B;AACxC,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,SAAS,MAC1D,QAAO;AAET,MAAI,cAAc,MAAM,CACtB,QAAO,MAAM,MAAM;AAErB,MAAI,MAAM,QAAQ,MAAM,CACtB,QAAO,MAAM,IAAI,KAAK;AAExB,SAAO;;;CAIT,MAAM,aAAa,KAAsB,iBAA0B;EACjE,IAAI,MAAM,QAAQ,IAAI,IAAI;AAC1B,MAAI,CAAC,KAAK;AACR,SAAM,IAAI,OAAO,KAAK,aAAa,CAAC;AACpC,WAAQ,IAAI,KAAK,IAAI;;AAEvB,SAAO;;AAGT,QAAO,IAAI,MAAM,KAAK;EACpB,IAAI,QAAQ,KAAK;AAEf,OAAI,OAAO,QAAQ,SACjB,QAAO,OAAO;AAEhB,UAAO,UAAU,KAAK,OAAO,KAAgB,CAAC;;EAGhD,IAAI,QAAQ,KAAK,OAAO;AACtB,OAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,OAAkB;AACzB,WAAO;;GAET,MAAM,UAAU,KAAK,MAAM;AAC3B,aAAU,KAAK,OAAO,KAAgB,CAAC,QAAQ;AAC/C,UAAO,OAAkB;AACzB,UAAO;;EAGT,IAAI,QAAQ,KAAK;AACf,UAAO,QAAQ,SAAS,OAAO;;EAElC,CAAC;;;;;;AC3CJ,MAAa,YAAY,UACvB,iBAAiB,UAAU,iBAAiB;;;;ACV9C,IAAa,aAAb,MAAwB;CACtB,AAAQ,IAAI;CACZ,AAAQ,KAAqB;CAC7B,AAAQ,MAAM;CACd,AAAQ,OAAO;CACf,AAAQ,QAAoB,EAAE;CAC9B,AAAQ,OAAO;CACf,AAAQ,IAAI;CAEZ,cAAc,SAA+B,IAAoB;AAC/D,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,QAAK,MAAM,QAAQ,IAAK,GAAG;AAC3B,OAAI,IAAI,QAAQ,SAAS,EAAG,MAAK,KAAK,GAAG,GAAG;;AAE9C,MAAI,KAAK,MAAM;AACb,MAAG,OAAO,KAAK,KAAK;AACpB,QAAK,OAAO;;;CAIhB,AAAQ,MAAM,KAAa,IAAoB;AAC7C,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACnC,MAAM,KAAK,IAAI,IACb,KAAK,IAAI,IAAI,IACb,KAAK,IAAI,IAAI;AAEf,OAAI,KAAK,MAAM,EAEb,KAAI,OAAO,KAAK;AACd,QAAI,KAAK,MAAM;AACb,QAAG,OAAO,KAAK,KAAK;AACpB,UAAK,OAAO;;AAEd,SAAK,IAAI;SACJ,MAAK,QAAQ;YACX,KAAK,MAAM,EAEpB,KAAI,OAAO,IAAK,MAAK,IAAI;YAChB,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC/C,SAAK;AACL,SAAK,IAAI;cACA,OAAO,OAAO,OAAO,KAAK;AACnC,WAAO,IAAI,IAAI,UAAU,IAAI,OAAO,IAAK;AACzC,SAAK,IAAI;cACA,KAAK,IAAI,GAAG,EAAE;AACvB,SAAK,MAAM;AACX,SAAK,IAAI;UACJ;AACL,SAAK,QAAQ,MAAM;AACnB,SAAK,IAAI;;YAEF,KAAK,MAAM,GAEpB;QAAI,KAAK,IAAI,GAAG,CAAE,MAAK,OAAO;aACrB,KAAK,IAAI,GAAG,EAAE;AACrB,UAAK,KAAK,SAAS,cAAc,KAAK,IAAI;AAC1C,UAAK,MAAM;AACX,UAAK,IAAI;eACA,OAAO,KAAK;AACrB,UAAK,KAAK,SAAS,cAAc,KAAK,IAAI;AAC1C,UAAK,MAAM;AACX,UAAK,KAAK,IAAI,MAAM;eACX,OAAO,OAAO,OAAO,KAAK;AACnC,UAAK,KAAK,SAAS,cAAc,KAAK,IAAI;AAC1C,UAAK,MAAM;AACX;AACA,UAAK,KAAK,IAAI,KAAK;;cAEZ,KAAK,MAAM,GAAG;AAEvB,QAAI,KAAK,IAAI,GAAG,CAAE;AAClB,QAAI,OAAO,IAAK,MAAK,KAAK,IAAI,MAAM;aAC3B,OAAO,OAAO,OAAO,KAAK;AACjC;AACA,UAAK,KAAK,IAAI,KAAK;WACd;AACL,UAAK,OAAO;AACZ,UAAK,QAAQ,EAAE;AACf,UAAK,IAAI;;cAEF,KAAK,MAAM,GAEpB;QAAI,KAAK,IAAI,GAAG,IAAI,OAAO,IAAK,MAAK,QAAQ;aACpC,OAAO,IAAK,MAAK,IAAI;aACrB,KAAK,IAAI,GAAG,EAAE;AACrB,UAAK,SAAS,GAAG;AACjB,UAAK,IAAI;eACA,OAAO,KAAK;AACrB,UAAK,SAAS,GAAG;AACjB,UAAK,KAAK,IAAI,MAAM;eACX,OAAO,OAAO,OAAO,KAAK;AACnC,UAAK,SAAS,GAAG;AACjB;AACA,UAAK,KAAK,IAAI,KAAK;;cAEZ,KAAK,MAAM,GAEpB;QAAI,OAAO,QAAO,OAAO,KAAK;AAC5B,UAAK,IAAI;AACT,UAAK,IAAI;eACA,CAAC,KAAK,IAAI,GAAG,EAAE;AACxB,UAAK,IAAI;AACT,UAAK,MAAM,KAAK,GAAG;AACnB,UAAK,IAAI;;cAEF,KAAK,MAAM,EAKpB,KAHY,KAAK,IACb,OAAO,KAAK,IACZ,KAAK,IAAI,GAAG,IAAI,OAAO,OAAO,OAAO,KAChC;AACP,SAAK,SAAS,GAAG;AACjB,SAAK,IAAI;AACT,SAAK,IAAI;AACT,QAAI,OAAO,IAAK,MAAK,KAAK,IAAI,MAAM;aAC3B,OAAO,OAAO,OAAO,KAAK;AACjC;AACA,UAAK,KAAK,IAAI,KAAK;;UAEhB;IACL,MAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS;AAC5C,QAAI,OAAO,SAAS,SAClB,MAAK,MAAM,KAAK,MAAM,SAAS,KAAK,OAAO;QACxC,MAAK,MAAM,KAAK,GAAG;;YAEjB,KAAK,MAAM,GAEpB;QAAI,OAAO,KAAK;AACd,QAAG,SAAS;AACZ,UAAK,IAAI;;cAEF,KAAK,MAAM,GAEpB;QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC1C,UAAK;AACL,UAAK,IAAI;;;;;CAMjB,AAAQ,KAAK,OAAe,IAAoB;AAC9C,MAAI,KAAK,MAAM,KAAK,KAAK,MAAM,GAAG;AAChC,QAAK,MAAM,KAAK,EAAE,OAAO,CAAC;AAC1B,OAAI,KAAK,MAAM,EAAG,MAAK,IAAI;SACtB;AACL,OAAI,KAAK,MAAM;AACb,OAAG,OAAO,KAAK,KAAK;AACpB,SAAK,OAAO;;AAEd,MAAG,OAAO,MAAM;;;CAIpB,AAAQ,KAAK,IAAoB,MAAe;AAC9C,KAAG,UAAU,KAAK,IAAK,KAAK;AAC5B,OAAK,KAAK;AACV,OAAK,IAAI;;CAGX,AAAQ,SAAS,IAAoB;AACnC,MAAI,KAAK,MAAM,KAAK,KAAM,IAAG,YAAY,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM;AACxE,OAAK,OAAO;AACZ,OAAK,QAAQ,EAAE;;CAGjB,AAAQ,IAAI,GAAW;AACrB,SAAQ,KAAK,OAAO,KAAK,OAAS,KAAK,OAAO,KAAK;;CAErD,AAAQ,IAAI,GAAW;AACrB,SAAO,KAAK,IAAI,EAAE,IAAK,KAAK,OAAO,KAAK,OAAQ,MAAM,OAAO,MAAM;;CAErE,AAAQ,IAAI,GAAW;AACrB,SAAO,MAAM,OAAO,MAAM,OAAQ,MAAM,QAAQ,MAAM;;;;;;;;;;;;;;;;;;;;;ACzK1D,SAAS,KACP,OACA,QACqB;AACrB,KAAI,SAAS,MAAM,EAAE;AACnB,SAAO,MAAM,MAAM;AACnB,SAAO,MAAM,gBAAgB,OAAQ,MAA4B,MAAM,CAAC;;AAE1E,QAAO,MAAM;AACb,QAAO;;;AAIT,IAAa,WAAb,MAAsB;CACpB,YACE,AAAQC,SACR,AAAQC,QACR;EAFQ;EACA;;;;;;CAOV,SAA8D;EAC5D,MAAM,WAAW,SAAS,wBAAwB;EAClD,MAAMC,YAA4B,EAAE;EACpC,MAAMC,QAAwC,CAAC,SAAS;EACxD,MAAM,SAAS,IAAI,YAAY;EAC/B,MAAM,SAAS,KAAK;AAEpB,SAAO,cAAc,KAAK,SAAS;GACjC,SAAS,SAAS;AAChB,UAAM,GAAG,GAAG,CAAE,YAAY,SAAS,eAAe,KAAK,CAAC;;GAG1D,YAAY,IAAI,gBAAgB;AAC9B,UAAM,GAAG,GAAG,CAAE,YAAY,GAAG;AAC7B,QAAI,CAAC,YAAa,OAAM,KAAK,GAAG;;GAGlC,eAAe;AACb,QAAI,MAAM,SAAS,EAAG,OAAM,KAAK;;GAGnC,cAAc,IAAI,MAAM,UAAU;IAChC,MAAM,SAAS,KAAK;AAGpB,QAAI,WAAW,KAAK;KAClB,MAAM,QAAQ,KAAK,MAAM,EAAE;KAC3B,MAAM,OAAO,MAAM;AACnB,SAAI,QAAQ,OAAO,SAAS,UAAU;MACpC,MAAM,UAAU,OAAO,KAAK;AAC5B,SAAG,iBAAiB,OAAO,QAAQ;AACnC,gBAAU,WAAW,GAAG,oBAAoB,OAAO,QAAQ,CAAC;;AAE9D;;AAIF,QAAI,WAAW,KAAK;KAClB,MAAM,OAAO,KAAK,MAAM,EAAE;KAC1B,MAAM,OAAO,MAAM;AACnB,SAAI,QAAQ,OAAO,SAAS,UAAU;MACpC,MAAM,QAAQ,KAAK,OAAO,KAAK,SAAS,MAAM;AAC5C,OAAC,GAA0C,QAAQ;QACnD;AACF,UAAI,MAAO,WAAU,KAAK,MAAM;;AAElC;;AAIF,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,SAAS,EAAE;KAC7C,MAAM,QAAQ,MAAM,KAAK,GAAG;AAC5B,SAAI,SAAS,MAAM,WAAW,EAC5B,IAAG,aAAa,MAAM,MAAM;AAE9B;;IAIF,MAAM,eAAe,MAAM,QACxB,MAA8B,OAAO,MAAM,SAC7C;IACD,MAAM,UAAU,aACb,KAAK,MAAM,OAAO,EAAE,OAAO,CAC3B,OAAO,SAAS;IAGnB,MAAM,kBACJ,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO;IAE5C,MAAM,eAAe;AACnB,SAAI,iBAAiB;MAEnB,MAAM,IAAI,OAAO,aAAa,GAAI;MAClC,MAAM,MAAM,SAAS,EAAE,GAAI,EAAwB,QAAQ;AAC3D,UAAI,OAAO,QAAQ,QAAQ,MAAO,IAAG,gBAAgB,KAAK;UACrD,IAAG,aAAa,MAAM,QAAQ,OAAO,KAAK,OAAO,IAAI,CAAC;YACtD;MAEL,MAAM,WAAW,MACd,KAAK,MAAM;AACV,WAAI,OAAO,MAAM,SAAU,QAAO;OAClC,MAAM,IAAI,OAAO,EAAE;OACnB,MAAM,MAAM,SAAS,EAAE,GAAI,EAAwB,QAAQ;AAC3D,cAAO,OAAO,OAAO,KAAK,OAAO,IAAI;QACrC,CACD,KAAK,GAAG;AACX,SAAG,aAAa,MAAM,SAAS;;;AAInC,YAAQ;AACR,YAAQ,SAAS,MAAM,UAAU,KAAK,EAAE,UAAU,OAAO,CAAC,CAAC;;GAG7D,SAAS,UAAU;IAEjB,MAAM,SAAS,SAAS,cAAc,GAAG;AACzC,UAAM,GAAG,GAAG,CAAE,YAAY,OAAO;AACjC,cAAU,KAAK,YAAY,QAAQ,OAAO,OAAO,CAAC;;GAErD,CAAC;AAEF,SAAO;GAAE;GAAU,eAAe,UAAU,SAAS,MAAM,GAAG,CAAC;GAAE;;;;;;;;AAgBrE,SAAS,YAAY,QAAiB,OAA4B;CAChE,IAAIC,QAAgB,EAAE;CACtB,IAAIC,iBAAiC,EAAE;CAEvC,MAAM,cAAc;AAClB,iBAAe,SAAS,MAAM,GAAG,CAAC;AAClC,mBAAiB,EAAE;AACnB,QAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;AAClD,UAAQ,EAAE;;AAIZ,KAAI,OAAO,MAAM,EAAE;EACjB,MAAM,wBAAQ,IAAI,KAAyB;EAC3C,MAAM,EAAE,MAAM,OAAO,aAAa;EAClC,IAAI,kBAAkB;EAEtB,MAAM,mBAAmB;GACvB,MAAM,SAAS,OAAO;GACtB,MAAM,QAAQ,KAAK;GACnB,MAAM,0BAAU,IAAI,KAAc;GAClC,MAAMC,WAAmB,EAAE;AAE3B,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IACnB,MAAM,MAAM,MAAM,MAAM,EAAE;AAE1B,QAAI,QAAQ,IAAI,IAAI,EAAE;AACpB,SAAI,CAAC,iBAAiB;AACpB,wBAAkB;AAClB,cAAQ,KACN,sCAAsC,OAAO,IAAI,CAAC,mEAEnD;;AAEH;;AAEF,YAAQ,IAAI,IAAI;IAEhB,IAAI,QAAQ,MAAM,IAAI,IAAI;AAC1B,QAAI,CAAC,SAAS,MAAM,SAAS,MAAM;AAEjC,SAAI,OAAO;AAET,YAAM,MAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;AACxD,YAAM,SAAS;;KAEjB,MAAM,EAAE,UAAU,YAAY,SAAS,KAAK,CAAC,QAAQ;AACrD,aAAQ;MAAE;MAAM,OAAO,CAAC,GAAG,SAAS,WAAW;MAAE;MAAS;AAC1D,WAAM,IAAI,KAAK,MAAM;;AAEvB,aAAS,KAAK,GAAG,MAAM,MAAM;;AAI/B,QAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,CAAC,QAAQ,IAAI,IAAI,EAAE;AACrB,UAAM,MAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;AACxD,UAAM,SAAS;AACf,UAAM,OAAO,IAAI;;GAKrB,IAAIC,WAAiB;AACrB,QAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;IAC7C,MAAM,OAAO,SAAS;AACtB,QAAI,KAAK,gBAAgB,SACvB,QAAO,aAAa,MAAM,SAAS;AAErC,eAAW;;AAGb,WAAQ;;AAGV,cAAY;EACZ,MAAMC,UAAQ,KAAK,UAAU,WAAW;AAExC,eAAa;AACX,YAAO;AACP,QAAK,MAAM,SAAS,MAAM,QAAQ,CAChC,OAAM,SAAS;AAEjB,SAAM,OAAO;AACb,SAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;;;CAItD,MAAM,UAAU,MAAe;AAC7B,SAAO;EACP,MAAM,SAAS,OAAO;AAEtB,OAAK,MAAM,QAAQ,MAAM,QAAQ,EAAE,GAAG,IAAI,CAAC,EAAE,CAC3C,KAAI,gBAAgB,UAAU;GAC5B,MAAM,EAAE,UAAU,YAAY,KAAK,QAAQ;AAC3C,kBAAe,KAAK,QAAQ;AAC5B,SAAM,KAAK,GAAG,SAAS,WAAW;AAClC,UAAO,aAAa,UAAU,OAAO;aAC5B,QAAQ,QAAQ,OAAO,SAAS,WAAW;GACpD,MAAM,OAAO,SAAS,eAAe,OAAO,KAAK,CAAC;AAClD,SAAM,KAAK,KAAK;AAChB,UAAO,aAAa,MAAM,OAAO;;;CAKvC,MAAM,QAAQ,KAAK,OAAO,OAAO;AACjC,cAAa;AACX,WAAS;AACT,SAAO;;;;AAKX,MAAa,QAAQ,SAA+B,GAAG,WACrD,IAAI,SAAS,SAAS,OAAO;;AAG/B,MAAM,OAAO,QAAQ;;AAWrB,MAAM,UAAU,MACd,KAAK,QAAQ,OAAO,MAAM,YAAY,QAAQ;;AAMhD,SAAS,eAAkB,MAAmC;AAC5D,KAAI,MAAM,QAAQ,KAAK,CAAE,QAAO,OAAO,KAAK;AAC5C,KAAI,OAAO,SAAS,WAAY,QAAO,SAAS,KAAK;AACrD,QAAO;;AAqCT,SAAgB,KACd,MACA,iBAGA,UACmB;CACnB,MAAM,eAAe,eAAe,KAAK;AAEzC,KAAI,aAAa,OAGf,QAAO;GACJ,OAAO;EACR,MAAM;EACN,QAAQ,MAAM,UACZ,SAAS,SACR,OAAO,SAAS,YAAY,OAAO,SAAS,cACzC,OACA;EACN,UAAU;EACX;AAGH,QAAO;GACJ,OAAO;EACR,MAAM;EACN,OAAO;EACP;EACD"}
+{"version":3,"file":"balises.esm.js","names":["context: Computed<unknown> | null","batchQueue: Set<Subscriber> | null","disposalStack: Array<Array<() => void>> | null","disposers: Array<() => void>","#value","#targets","#subs","#fn","#recompute","#dirty","#value","#subs","#sources","#sourceIndex","source","queue: Computed<unknown>[]","#targets","#computing","strings: TemplateStringsArray","values: unknown[]","disposers: (() => void)[]","stack: (Element | DocumentFragment)[]","nodes: Node[]","childDisposers: (() => void)[]","newNodes: Node[]","prevNode: Node","unsub"],"sources":["../src/signals/context.ts","../src/signals/signal.ts","../src/signals/computed.ts","../src/signals/effect.ts","../src/signals/store.ts","../src/signals/index.ts","../src/parser.ts","../src/template.ts"],"sourcesContent":["/**\n * Global state and batching for the reactive system.\n */\n\nimport type { Computed } from \"./computed.js\";\n\n/** Callback function for subscribers */\nexport type Subscriber = () => void;\n\n/** The currently executing computed (for dependency tracking) */\nexport let context: Computed<unknown> | null = null;\n\n/** Set the current execution context */\nexport function setContext(c: Computed<unknown> | null): void {\n  context = c;\n}\n\n/** Batching: defer subscriber notifications until batch completes */\nlet batchDepth = 0;\nlet batchQueue: Set<Subscriber> | null = null;\n\n/**\n * Batch multiple signal updates into a single notification pass.\n * Subscribers are only notified after the batch function completes.\n */\nexport function batch<T>(fn: () => T): T {\n  batchDepth++;\n  if (batchDepth === 1) batchQueue = new Set();\n  try {\n    return fn();\n  } finally {\n    if (--batchDepth === 0) {\n      const q = batchQueue!;\n      batchQueue = null;\n      for (const sub of q) sub();\n    }\n  }\n}\n\n/** Check if currently batching */\nexport function isBatching(): boolean {\n  return batchDepth > 0;\n}\n\n/** Add a subscriber to the batch queue */\nexport function enqueueBatch(sub: Subscriber): void {\n  batchQueue!.add(sub);\n}\n\n/** Add multiple subscribers to the batch queue */\nexport function enqueueBatchAll(subs: Subscriber[]): void {\n  for (let i = 0; i < subs.length; i++) {\n    batchQueue!.add(subs[i]!);\n  }\n}\n\n/** Scope disposal: collect all disposers in a scope */\nlet disposalStack: Array<Array<() => void>> | null = null;\n\n/**\n * Create a disposal scope that collects all subscriptions and computeds created within.\n * Returns the result of the function and a dispose function that cleans up all resources.\n *\n * @example\n * ```ts\n * const [result, dispose] = scope(() => {\n *   const count = signal(0);\n *   const doubled = computed(() => count.value * 2);\n *   effect(() => console.log(doubled.value));\n *   return { count, doubled };\n * });\n *\n * // Later: clean up all subscriptions and computeds\n * dispose();\n * ```\n */\nexport function scope<T>(fn: () => T): [result: T, dispose: () => void] {\n  const disposers: Array<() => void> = [];\n\n  // Push new disposal context\n  if (!disposalStack) disposalStack = [];\n  disposalStack.push(disposers);\n\n  try {\n    const result = fn();\n    return [\n      result,\n      () => {\n        for (let i = disposers.length - 1; i >= 0; i--) {\n          disposers[i]!();\n        }\n        disposers.length = 0;\n      },\n    ];\n  } finally {\n    // Pop disposal context\n    disposalStack.pop();\n    if (disposalStack.length === 0) disposalStack = null;\n  }\n}\n\n/**\n * Register a disposer in the current scope (if any).\n * This is called internally by computed/effect when they create cleanup functions.\n */\nexport function registerDisposer(dispose: () => void): void {\n  if (disposalStack && disposalStack.length > 0) {\n    disposalStack[disposalStack.length - 1]!.push(dispose);\n  }\n}\n","/**\n * Signal - A reactive value container.\n */\n\nimport type { Computed } from \"./computed.js\";\nimport {\n  context,\n  isBatching,\n  enqueueBatchAll,\n  type Subscriber,\n} from \"./context.js\";\n\n/**\n * Remove an item from an array using swap-and-pop (O(1) removal).\n */\nexport function removeFromArray<T>(array: T[], item: T): void {\n  const i = array.indexOf(item);\n  if (i >= 0) {\n    array[i] = array[array.length - 1]!;\n    array.pop();\n  }\n}\n\n/**\n * A reactive value container. When the value changes, all dependent\n * computeds are marked dirty and subscribers are notified.\n *\n * Uses Object.is() for equality checks to correctly handle NaN values.\n */\nexport class Signal<T> {\n  #value: T;\n  #subs: Subscriber[] = [];\n  #targets: Computed<unknown>[] = [];\n\n  constructor(value: T) {\n    this.#value = value;\n  }\n\n  get value(): T {\n    if (context) context.trackSource(this);\n    return this.#value;\n  }\n\n  set value(v: T) {\n    if (Object.is(this.#value, v)) return;\n    this.#value = v;\n\n    // Mark all dependent computeds as dirty\n    const targets = this.#targets;\n    for (let i = 0; i < targets.length; i++) {\n      targets[i]!.markDirty();\n    }\n\n    // Notify subscribers\n    if (this.#subs.length) {\n      if (isBatching()) {\n        enqueueBatchAll(this.#subs);\n      } else {\n        for (let i = 0; i < this.#subs.length; i++) this.#subs[i]!();\n      }\n    }\n  }\n\n  subscribe(fn: Subscriber): () => void {\n    this.#subs.push(fn);\n    return () => removeFromArray(this.#subs, fn);\n  }\n\n  /**\n   * Update the signal value using an updater function.\n   *\n   * @param fn - Function that receives current value and returns new value\n   *\n   * @example\n   * const count = signal(0);\n   * count.update(n => n + 1); // increment\n   */\n  update(fn: (current: T) => T): void {\n    this.value = fn(this.#value);\n  }\n\n  /** @internal */\n  get targets(): Computed<unknown>[] {\n    return this.#targets;\n  }\n\n  /** @internal */\n  deleteTarget(target: Computed<unknown>): void {\n    removeFromArray(this.#targets, target);\n  }\n}\n\n/** Create a new signal with the given initial value. */\nexport const signal = <T>(value: T) => new Signal(value);\n","/**\n * Computed - A derived reactive value.\n */\n\nimport { Signal, removeFromArray } from \"./signal.js\";\nimport {\n  context,\n  setContext,\n  isBatching,\n  enqueueBatch,\n  registerDisposer,\n  type Subscriber,\n} from \"./context.js\";\n\n/**\n * A derived reactive value. Automatically tracks dependencies and\n * recomputes when any dependency changes.\n *\n * Uses Object.is() for equality checks to correctly handle NaN values.\n */\nexport class Computed<T> {\n  #fn: (() => T) | undefined;\n  #value: T | undefined;\n  #dirty = true;\n  #computing = false;\n  #subs: Subscriber[] = [];\n  #targets: Computed<unknown>[] = [];\n  #sources: (Signal<unknown> | Computed<unknown>)[] = [];\n  #sourceIndex = 0;\n\n  constructor(fn: () => T) {\n    this.#fn = fn;\n    this.#recompute();\n\n    // Auto-register disposal in current root scope\n    registerDisposer(() => this.dispose());\n  }\n\n  get value(): T {\n    if (this.#dirty) this.#recompute();\n    if (context && context !== this) context.trackSource(this);\n    return this.#value as T;\n  }\n\n  subscribe(fn: Subscriber): () => void {\n    this.#subs.push(fn);\n    return () => removeFromArray(this.#subs, fn);\n  }\n\n  dispose(): void {\n    this.#fn = undefined;\n    const sources = this.#sources;\n    for (let i = 0; i < sources.length; i++) {\n      const source = sources[i];\n      if (source) source.deleteTarget(this);\n    }\n    this.#sources = [];\n    this.#subs.length = 0;\n  }\n\n  /**\n   * Called by sources when accessed during recompute.\n   * @internal\n   */\n  trackSource(source: Signal<unknown> | Computed<unknown>): void {\n    const sources = this.#sources;\n    const idx = this.#sourceIndex++;\n\n    if (idx < sources.length) {\n      if (sources[idx] === source) {\n        // Same source at same position - nothing to do\n        return;\n      }\n      // Different source - unlink old ones from this position\n      for (let i = idx; i < sources.length; i++) {\n        const source = sources[i];\n        if (source) source.deleteTarget(this);\n      }\n      sources.length = idx;\n    }\n    // Add new source\n    sources.push(source);\n    source.targets.push(this);\n  }\n\n  /**\n   * Mark this computed and all its dependents as dirty.\n   * @internal\n   */\n  markDirty(): void {\n    if (this.#dirty) return;\n\n    const queue: Computed<unknown>[] = [this];\n    for (let i = 0; i < queue.length; i++) {\n      const c = queue[i]!;\n      if (c.#dirty) continue;\n      c.#dirty = true;\n\n      const targets = c.#targets;\n\n      // Short-circuit optimization: if this computed has both subscribers AND downstream dependents,\n      // eagerly recompute to check if the value actually changed before propagating.\n      // Only do this outside of batching to avoid intermediate/inconsistent state.\n      if (c.#subs.length > 0 && targets.length > 0 && c.#fn && !isBatching()) {\n        const old = c.#value;\n        c.#recompute();\n        const valueChanged = !Object.is(c.#value, old);\n\n        // Only propagate dirty flag to targets if value actually changed\n        if (valueChanged) {\n          for (let j = 0; j < targets.length; j++) {\n            const target = targets[j]!;\n            if (!target.#dirty) queue.push(target);\n          }\n\n          // Notify subscribers since value changed (we're not batching here)\n          for (let j = 0; j < c.#subs.length; j++) c.#subs[j]!();\n        }\n        // If value didn't change, don't propagate or notify\n      } else {\n        // No short-circuiting needed - use original behavior\n        for (let j = 0; j < targets.length; j++) {\n          const target = targets[j]!;\n          if (!target.#dirty) queue.push(target);\n        }\n\n        if (c.#subs.length) {\n          const old = c.#value;\n          const notify = () => {\n            if (c.#fn) {\n              c.#recompute();\n              if (!Object.is(c.#value, old)) {\n                for (let j = 0; j < c.#subs.length; j++) c.#subs[j]!();\n              }\n            }\n          };\n          if (isBatching()) {\n            enqueueBatch(notify);\n          } else {\n            notify();\n          }\n        }\n      }\n    }\n  }\n\n  /** @internal */\n  get targets(): Computed<unknown>[] {\n    return this.#targets;\n  }\n\n  /** @internal */\n  deleteTarget(target: Computed<unknown>): void {\n    removeFromArray(this.#targets, target);\n  }\n\n  #recompute(): void {\n    if (this.#computing || !this.#fn) return;\n    this.#computing = true;\n\n    this.#sourceIndex = 0;\n    const prevLen = this.#sources.length;\n\n    const prev = context;\n    setContext(this);\n    try {\n      this.#value = this.#fn();\n    } finally {\n      setContext(prev);\n\n      // Unlink removed sources\n      const newLen = this.#sourceIndex;\n      if (newLen < prevLen) {\n        const sources = this.#sources;\n        for (let i = newLen; i < prevLen; i++) {\n          const source = sources[i];\n          if (source) source.deleteTarget(this);\n        }\n        sources.length = newLen;\n      }\n\n      this.#dirty = false;\n      this.#computing = false;\n    }\n  }\n}\n\n/** Create a new computed from the given function. */\nexport const computed = <T>(fn: () => T) => new Computed(fn);\n","/**\n * Effect - Run side effects reactively.\n */\n\nimport { computed } from \"./computed.js\";\nimport { registerDisposer } from \"./context.js\";\n\n/**\n * Create a reactive effect that automatically tracks dependencies\n * and re-runs when they change.\n *\n * @param fn - The effect function to run\n * @returns A dispose function to stop the effect\n *\n * @example\n * const count = signal(0);\n * const dispose = effect(() => {\n *   console.log(\"Count is:\", count.value);\n * });\n *\n * count.value = 1; // logs: \"Count is: 1\"\n * dispose(); // stop the effect\n */\nexport function effect(fn: () => void): () => void {\n  const c = computed(() => {\n    fn();\n    return undefined;\n  });\n\n  // Subscribe to make it reactive (rerun on dependency changes)\n  const unsub = c.subscribe(() => {});\n\n  const dispose = () => {\n    unsub();\n    c.dispose();\n  };\n\n  // Auto-register disposal in current root scope\n  // Note: This doesn't prevent returning the dispose function since the\n  // user might want to dispose early, while the root dispose cleans up any\n  // effects that weren't manually disposed.\n  registerDisposer(dispose);\n\n  return dispose;\n}\n","/**\n * Store - Reactive wrapper for plain objects.\n */\n\nimport { Signal } from \"./signal.js\";\n\nconst STORE = Symbol();\n\nconst isPlainObject = (value: unknown): value is Record<string, unknown> =>\n  value !== null &&\n  typeof value === \"object\" &&\n  Object.getPrototypeOf(value) === Object.prototype;\n\n/**\n * Create a reactive store from a plain object.\n * Each property becomes a signal, and nested objects are recursively wrapped.\n */\nexport function store<T extends object>(obj: T): T {\n  const signals = new Map<string | symbol, Signal<unknown>>();\n\n  /** Recursively wrap nested objects and arrays */\n  const wrap = (value: unknown): unknown => {\n    if (value !== null && typeof value === \"object\" && STORE in value) {\n      return value; // Already a store\n    }\n    if (isPlainObject(value)) {\n      return store(value);\n    }\n    if (Array.isArray(value)) {\n      return value.map(wrap);\n    }\n    return value;\n  };\n\n  /** Get or create a signal for a property */\n  const getSignal = (key: string | symbol, initialValue: unknown) => {\n    let sig = signals.get(key);\n    if (!sig) {\n      sig = new Signal(wrap(initialValue));\n      signals.set(key, sig);\n    }\n    return sig;\n  };\n\n  return new Proxy(obj, {\n    get(target, key) {\n      // Allow symbol access (for STORE check and other internal symbols)\n      if (typeof key === \"symbol\") {\n        return target[key as keyof T];\n      }\n      return getSignal(key, target[key as keyof T]).value;\n    },\n\n    set(target, key, value) {\n      if (typeof key === \"symbol\") {\n        target[key as keyof T] = value;\n        return true;\n      }\n      const wrapped = wrap(value);\n      getSignal(key, target[key as keyof T]).value = wrapped;\n      target[key as keyof T] = wrapped as T[keyof T];\n      return true;\n    },\n\n    has(target, key) {\n      return key === STORE || key in target;\n    },\n  });\n}\n","/**\n * Reactive signals with automatic dependency tracking.\n *\n * Uses index-based tracking: computed functions are assumed to access\n * their dependencies in the same order on each run. This enables O(1)\n * dependency checks without complex linked-list structures.\n */\n\nexport { Signal, signal } from \"./signal.js\";\nexport { Computed, computed } from \"./computed.js\";\nexport { effect } from \"./effect.js\";\nexport { store } from \"./store.js\";\nexport { batch, scope, type Subscriber } from \"./context.js\";\n\nimport { Signal } from \"./signal.js\";\nimport { Computed } from \"./computed.js\";\n\n/** Common interface for reactive values (Signal or Computed). */\nexport interface Reactive<T> {\n  readonly value: T;\n  subscribe(fn: () => void): () => void;\n}\n\n/** Check if a value is a reactive signal or computed. */\nexport const isSignal = (value: unknown): value is Reactive<unknown> =>\n  value instanceof Signal || value instanceof Computed;\n","/**\n * Streaming HTML parser for template literals.\n * State machine: Text=0, TagOpen=1, TagName=2, InTag=3, AttrName=4, AttrEq=5, AttrVal=6, CloseTag=7, Comment=8\n */\n\nexport type AttrPart = string | { index: number };\n\nexport interface ParseCallbacks {\n  onText: (text: string) => void;\n  onElement: (el: Element, selfClosing: boolean) => void;\n  onClose: () => void;\n  onAttribute: (el: Element, name: string, parts: AttrPart[]) => void;\n  onSlot: (index: number) => void;\n}\n\nexport class HTMLParser {\n  private s = 0; // state\n  private el: Element | null = null;\n  private tag = \"\";\n  private attr = \"\";\n  private parts: AttrPart[] = [];\n  private text = \"\";\n  private q = \"\";\n\n  parseTemplate(strings: TemplateStringsArray, cb: ParseCallbacks) {\n    for (let i = 0; i < strings.length; i++) {\n      this.parse(strings[i]!, cb);\n      if (i < strings.length - 1) this.slot(i, cb);\n    }\n    if (this.text) {\n      cb.onText(this.text);\n      this.text = \"\";\n    }\n  }\n\n  private parse(str: string, cb: ParseCallbacks) {\n    for (let i = 0; i < str.length; i++) {\n      const ch = str[i]!,\n        nx = str[i + 1],\n        n2 = str[i + 2];\n\n      if (this.s === 0) {\n        // Text\n        if (ch === \"<\") {\n          if (this.text) {\n            cb.onText(this.text);\n            this.text = \"\";\n          }\n          this.s = 1;\n        } else this.text += ch;\n      } else if (this.s === 1) {\n        // TagOpen\n        if (ch === \"/\") this.s = 7;\n        else if (ch === \"!\" && nx === \"-\" && n2 === \"-\") {\n          i += 2;\n          this.s = 8;\n        } else if (ch === \"!\" || ch === \"?\") {\n          while (i < str.length && str[i] !== \">\") i++;\n          this.s = 0;\n        } else if (this.isA(ch)) {\n          this.tag = ch;\n          this.s = 2;\n        } else {\n          this.text += \"<\" + ch;\n          this.s = 0;\n        }\n      } else if (this.s === 2) {\n        // TagName\n        if (this.isT(ch)) this.tag += ch;\n        else if (this.isW(ch)) {\n          this.el = document.createElement(this.tag);\n          this.tag = \"\";\n          this.s = 3;\n        } else if (ch === \">\") {\n          this.el = document.createElement(this.tag);\n          this.tag = \"\";\n          this.emit(cb, false);\n        } else if (ch === \"/\" && nx === \">\") {\n          this.el = document.createElement(this.tag);\n          this.tag = \"\";\n          i++;\n          this.emit(cb, true);\n        }\n      } else if (this.s === 3) {\n        // InTag\n        if (this.isW(ch)) continue;\n        if (ch === \">\") this.emit(cb, false);\n        else if (ch === \"/\" && nx === \">\") {\n          i++;\n          this.emit(cb, true);\n        } else {\n          this.attr = ch;\n          this.parts = [];\n          this.s = 4;\n        }\n      } else if (this.s === 4) {\n        // AttrName\n        if (this.isT(ch) || ch === \"_\") this.attr += ch;\n        else if (ch === \"=\") this.s = 5;\n        else if (this.isW(ch)) {\n          this.emitAttr(cb);\n          this.s = 3;\n        } else if (ch === \">\") {\n          this.emitAttr(cb);\n          this.emit(cb, false);\n        } else if (ch === \"/\" && nx === \">\") {\n          this.emitAttr(cb);\n          i++;\n          this.emit(cb, true);\n        }\n      } else if (this.s === 5) {\n        // AttrEq\n        if (ch === '\"' || ch === \"'\") {\n          this.q = ch;\n          this.s = 6;\n        } else if (!this.isW(ch)) {\n          this.q = \"\";\n          this.parts.push(ch);\n          this.s = 6;\n        }\n      } else if (this.s === 6) {\n        // AttrVal\n        const end = this.q\n          ? ch === this.q\n          : this.isW(ch) || ch === \">\" || ch === \"/\";\n        if (end) {\n          this.emitAttr(cb);\n          this.q = \"\";\n          this.s = 3;\n          if (ch === \">\") this.emit(cb, false);\n          else if (ch === \"/\" && nx === \">\") {\n            i++;\n            this.emit(cb, true);\n          }\n        } else {\n          const last = this.parts[this.parts.length - 1];\n          if (typeof last === \"string\")\n            this.parts[this.parts.length - 1] = last + ch;\n          else this.parts.push(ch);\n        }\n      } else if (this.s === 7) {\n        // CloseTag\n        if (ch === \">\") {\n          cb.onClose();\n          this.s = 0;\n        }\n      } else if (this.s === 8) {\n        // Comment\n        if (ch === \"-\" && nx === \"-\" && n2 === \">\") {\n          i += 2;\n          this.s = 0;\n        }\n      }\n    }\n  }\n\n  private slot(index: number, cb: ParseCallbacks) {\n    if (this.s === 5 || this.s === 6) {\n      this.parts.push({ index });\n      if (this.s === 5) this.s = 6;\n    } else {\n      if (this.text) {\n        cb.onText(this.text);\n        this.text = \"\";\n      }\n      cb.onSlot(index);\n    }\n  }\n\n  private emit(cb: ParseCallbacks, self: boolean) {\n    cb.onElement(this.el!, self);\n    this.el = null;\n    this.s = 0;\n  }\n\n  private emitAttr(cb: ParseCallbacks) {\n    if (this.el && this.attr) cb.onAttribute(this.el, this.attr, this.parts);\n    this.attr = \"\";\n    this.parts = [];\n  }\n\n  private isA(c: string) {\n    return (c >= \"a\" && c <= \"z\") || (c >= \"A\" && c <= \"Z\");\n  }\n  private isT(c: string) {\n    return this.isA(c) || (c >= \"0\" && c <= \"9\") || c === \"-\" || c === \":\";\n  }\n  private isW(c: string) {\n    return c === \" \" || c === \"\\t\" || c === \"\\n\" || c === \"\\r\";\n  }\n}\n","/**\n * HTML template rendering with reactive bindings.\n *\n * Uses tagged template literals to create reactive DOM:\n * - Text interpolation: ${value} or ${signal}\n * - Attribute binding: class=\"${signal}\" (reactive)\n * - Event binding: @click=${handler}\n * - Property binding: .value=${signal} (sets DOM property, not attribute)\n * - Nested templates: ${html`<span>...</span>`}\n * - Arrays: ${items.map(i => html`<li>${i}</li>`)}\n */\n\nimport { computed, isSignal, signal, type Reactive } from \"./signals/index.js\";\nimport { HTMLParser } from \"./parser.js\";\n\n/**\n * Bind a value to an update function.\n * If reactive, subscribes and returns unsubscribe. Otherwise returns null.\n */\nfunction bind(\n  value: unknown,\n  update: (v: unknown) => void,\n): (() => void) | null {\n  if (isSignal(value)) {\n    update(value.value);\n    return value.subscribe(() => update((value as Reactive<unknown>).value));\n  }\n  update(value);\n  return null;\n}\n\n/** A parsed HTML template. Call render() to create live DOM. */\nexport class Template {\n  constructor(\n    private strings: TemplateStringsArray,\n    private values: unknown[],\n  ) {}\n\n  /**\n   * Parse template and create live DOM.\n   * Returns the fragment and a dispose function to clean up subscriptions.\n   */\n  render(): { fragment: DocumentFragment; dispose: () => void } {\n    const fragment = document.createDocumentFragment();\n    const disposers: (() => void)[] = [];\n    const stack: (Element | DocumentFragment)[] = [fragment];\n    const parser = new HTMLParser();\n    const values = this.values;\n\n    parser.parseTemplate(this.strings, {\n      onText: (text) => {\n        stack.at(-1)!.appendChild(document.createTextNode(text));\n      },\n\n      onElement: (el, selfClosing) => {\n        stack.at(-1)!.appendChild(el);\n        if (!selfClosing) stack.push(el);\n      },\n\n      onClose: () => {\n        if (stack.length > 1) stack.pop();\n      },\n\n      onAttribute: (el, name, parts) => {\n        const prefix = name[0];\n\n        // Event binding: @click=${handler}\n        if (prefix === \"@\") {\n          const event = name.slice(1);\n          const part = parts[0];\n          if (part && typeof part !== \"string\") {\n            const handler = values[part.index] as EventListener;\n            el.addEventListener(event, handler);\n            disposers.push(() => el.removeEventListener(event, handler));\n          }\n          return;\n        }\n\n        // Property binding: .value=${data} - sets DOM property directly\n        if (prefix === \".\") {\n          const prop = name.slice(1);\n          const part = parts[0];\n          if (part && typeof part !== \"string\") {\n            const unsub = bind(values[part.index], (v) => {\n              (el as unknown as Record<string, unknown>)[prop] = v;\n            });\n            if (unsub) disposers.push(unsub);\n          }\n          return;\n        }\n\n        // Static attribute (all parts are strings)\n        if (parts.every((p) => typeof p === \"string\")) {\n          const value = parts.join(\"\");\n          if (value || parts.length === 0) {\n            el.setAttribute(name, value);\n          }\n          return;\n        }\n\n        // Dynamic attribute - has at least one interpolated value\n        const dynamicParts = parts.filter(\n          (p): p is { index: number } => typeof p !== \"string\",\n        );\n        const signals = dynamicParts\n          .map((p) => values[p.index])\n          .filter(isSignal) as Reactive<unknown>[];\n\n        // Single dynamic with no static parts: handle null/false as removal\n        const isSingleDynamic =\n          parts.length === 1 && typeof parts[0] !== \"string\";\n\n        const update = () => {\n          if (isSingleDynamic) {\n            // Boolean/null handling: false/null removes, true sets empty string\n            const v = values[dynamicParts[0]!.index];\n            const val = isSignal(v) ? (v as Reactive<unknown>).value : v;\n            if (val == null || val === false) el.removeAttribute(name);\n            else el.setAttribute(name, val === true ? \"\" : String(val));\n          } else {\n            // Multi-part: concatenate all parts\n            const resolved = parts\n              .map((p) => {\n                if (typeof p === \"string\") return p;\n                const v = values[p.index];\n                const val = isSignal(v) ? (v as Reactive<unknown>).value : v;\n                return val == null ? \"\" : String(val);\n              })\n              .join(\"\");\n            el.setAttribute(name, resolved);\n          }\n        };\n\n        update();\n        signals.forEach((s) => disposers.push(s.subscribe(update)));\n      },\n\n      onSlot: (index) => {\n        // Marker comment anchors dynamic content\n        const marker = document.createComment(\"\");\n        stack.at(-1)!.appendChild(marker);\n        disposers.push(bindContent(marker, values[index]));\n      },\n    });\n\n    return { fragment, dispose: () => disposers.forEach((d) => d()) };\n  }\n}\n\n/** Cached entry for a keyed list item */\ninterface EachEntry {\n  item: unknown;\n  nodes: Node[];\n  dispose: () => void;\n}\n\n/**\n * Bind dynamic content at a marker position.\n * Handles primitives (as text), Templates (rendered), Each (keyed lists), and arrays.\n * null/undefined/boolean render nothing (enables conditional: ${cond && html`...`})\n */\nfunction bindContent(marker: Comment, value: unknown): () => void {\n  let nodes: Node[] = [];\n  let childDisposers: (() => void)[] = [];\n\n  const clear = () => {\n    childDisposers.forEach((d) => d());\n    childDisposers = [];\n    nodes.forEach((n) => n.parentNode?.removeChild(n));\n    nodes = [];\n  };\n\n  // Handle each() - keyed list for efficient list rendering\n  if (isEach(value)) {\n    const cache = new Map<unknown, EachEntry>();\n    const { list, keyFn, renderFn } = value;\n    let warnedDuplicate = false;\n\n    const updateList = () => {\n      const parent = marker.parentNode!;\n      const items = list.value;\n      const newKeys = new Set<unknown>();\n      const newNodes: Node[] = [];\n\n      for (let i = 0; i < items.length; i++) {\n        const item = items[i]!;\n        const key = keyFn(item, i);\n\n        if (newKeys.has(key)) {\n          if (!warnedDuplicate) {\n            warnedDuplicate = true;\n            console.warn(\n              `[balises] Duplicate key in each(): ${String(key)}. ` +\n                `Each item should have a unique key. Consider providing a keyFn.`,\n            );\n          }\n          continue; // Skip duplicate\n        }\n        newKeys.add(key);\n\n        let entry = cache.get(key);\n        if (!entry || entry.item !== item) {\n          // First time seeing this key, or item at this key changed → render template\n          if (entry) {\n            // Dispose old entry for this key\n            entry.nodes.forEach((n) => n.parentNode?.removeChild(n));\n            entry.dispose();\n          }\n          const { fragment, dispose } = renderFn(item).render();\n          entry = { item, nodes: [...fragment.childNodes], dispose };\n          cache.set(key, entry);\n        }\n        newNodes.push(...entry.nodes);\n      }\n\n      // Remove nodes for deleted keys\n      for (const [key, entry] of cache) {\n        if (!newKeys.has(key)) {\n          entry.nodes.forEach((n) => n.parentNode?.removeChild(n));\n          entry.dispose();\n          cache.delete(key);\n        }\n      }\n\n      // Reorder/insert nodes in correct order\n      let prevNode: Node = marker;\n      for (let i = newNodes.length - 1; i >= 0; i--) {\n        const node = newNodes[i]!;\n        if (node.nextSibling !== prevNode) {\n          parent.insertBefore(node, prevNode);\n        }\n        prevNode = node;\n      }\n\n      nodes = newNodes;\n    };\n\n    updateList();\n    const unsub = list.subscribe(updateList);\n\n    return () => {\n      unsub();\n      for (const entry of cache.values()) {\n        entry.dispose();\n      }\n      cache.clear();\n      nodes.forEach((n) => n.parentNode?.removeChild(n));\n    };\n  }\n\n  const update = (v: unknown) => {\n    clear();\n    const parent = marker.parentNode!;\n\n    for (const item of Array.isArray(v) ? v : [v]) {\n      if (item instanceof Template) {\n        const { fragment, dispose } = item.render();\n        childDisposers.push(dispose);\n        nodes.push(...fragment.childNodes);\n        parent.insertBefore(fragment, marker);\n      } else if (item != null && typeof item !== \"boolean\") {\n        const node = document.createTextNode(String(item));\n        nodes.push(node);\n        parent.insertBefore(node, marker);\n      }\n    }\n  };\n\n  const unsub = bind(value, update);\n  return () => {\n    unsub?.();\n    clear();\n  };\n}\n\n/** Tagged template literal for creating reactive HTML templates */\nexport const html = (strings: TemplateStringsArray, ...values: unknown[]) =>\n  new Template(strings, values);\n\n/** Marker symbol for keyed list objects */\nconst EACH = Symbol();\n\n/** Keyed list descriptor */\ninterface EachDescriptor<T> {\n  [EACH]: true;\n  list: Reactive<T[]>;\n  keyFn: (item: T, index: number) => unknown;\n  renderFn: (item: T) => Template;\n}\n\n/** Type guard for Each descriptor */\nconst isEach = (v: unknown): v is EachDescriptor<unknown> =>\n  v != null && typeof v === \"object\" && EACH in v;\n\n/** List input type - accepts arrays, reactive arrays, or getter functions */\ntype ListInput<T> = T[] | Reactive<T[]> | (() => T[]);\n\n/** Normalize list input to a reactive signal */\nfunction toReactiveList<T>(list: ListInput<T>): Reactive<T[]> {\n  if (Array.isArray(list)) return signal(list);\n  if (typeof list === \"function\") return computed(list);\n  return list;\n}\n\n/**\n * Efficient keyed list rendering.\n *\n * Caches templates by key, only re-rendering when items are added/removed.\n * For content updates within items, use nested signals:\n *\n * ```ts\n * const items = signal([\n *   { id: 1, name: signal(\"Alice\") },\n *   { id: 2, name: signal(\"Bob\") },\n * ]);\n *\n * // With explicit key (recommended when items may have same reference after re-fetch)\n * html`<ul>${each(items, i => i.id, i => html`<li>${i.name}</li>`)}</ul>`\n *\n * // Without key (uses object reference for objects, index for primitives)\n * html`<ul>${each(items, i => html`<li>${i.name}</li>`)}</ul>`\n *\n * // With getter function (useful with stores)\n * html`<ul>${each(() => state.items, i => html`<li>${i.name}</li>`)}</ul>`\n *\n * // With plain array (static, won't react to changes)\n * html`<ul>${each([\"a\", \"b\", \"c\"], i => html`<li>${i}</li>`)}</ul>`\n * ```\n */\nexport function each<T>(\n  list: ListInput<T>,\n  renderFn: (item: T) => Template,\n): EachDescriptor<T>;\nexport function each<T>(\n  list: ListInput<T>,\n  keyFn: (item: T, index: number) => unknown,\n  renderFn: (item: T) => Template,\n): EachDescriptor<T>;\nexport function each<T>(\n  list: ListInput<T>,\n  keyFnOrRenderFn:\n    | ((item: T, index: number) => unknown)\n    | ((item: T) => Template),\n  renderFn?: (item: T) => Template,\n): EachDescriptor<T> {\n  const reactiveList = toReactiveList(list);\n\n  if (renderFn === undefined) {\n    // Two-arg form: each(list, renderFn)\n    // Use object reference for objects, index for primitives\n    return {\n      [EACH]: true,\n      list: reactiveList,\n      keyFn: (item, index) =>\n        item !== null &&\n        (typeof item === \"object\" || typeof item === \"function\")\n          ? item\n          : index,\n      renderFn: keyFnOrRenderFn as (item: T) => Template,\n    };\n  }\n  // Three-arg form: each(list, keyFn, renderFn)\n  return {\n    [EACH]: true,\n    list: reactiveList,\n    keyFn: keyFnOrRenderFn as (item: T, index: number) => unknown,\n    renderFn,\n  };\n}\n"],"mappings":";;AAUA,IAAWA,UAAoC;;AAG/C,SAAgB,WAAW,GAAmC;AAC5D,WAAU;;;AAIZ,IAAI,aAAa;AACjB,IAAIC,aAAqC;;;;;AAMzC,SAAgB,MAAS,IAAgB;AACvC;AACA,KAAI,eAAe,EAAG,8BAAa,IAAI,KAAK;AAC5C,KAAI;AACF,SAAO,IAAI;WACH;AACR,MAAI,EAAE,eAAe,GAAG;GACtB,MAAM,IAAI;AACV,gBAAa;AACb,QAAK,MAAM,OAAO,EAAG,MAAK;;;;;AAMhC,SAAgB,aAAsB;AACpC,QAAO,aAAa;;;AAItB,SAAgB,aAAa,KAAuB;AAClD,YAAY,IAAI,IAAI;;;AAItB,SAAgB,gBAAgB,MAA0B;AACxD,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC/B,YAAY,IAAI,KAAK,GAAI;;;AAK7B,IAAIC,gBAAiD;;;;;;;;;;;;;;;;;;AAmBrD,SAAgB,MAAS,IAA+C;CACtE,MAAMC,YAA+B,EAAE;AAGvC,KAAI,CAAC,cAAe,iBAAgB,EAAE;AACtC,eAAc,KAAK,UAAU;AAE7B,KAAI;AAEF,SAAO,CADQ,IAAI,QAGX;AACJ,QAAK,IAAI,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,IACzC,WAAU,IAAK;AAEjB,aAAU,SAAS;IAEtB;WACO;AAER,gBAAc,KAAK;AACnB,MAAI,cAAc,WAAW,EAAG,iBAAgB;;;;;;;AAQpD,SAAgB,iBAAiB,SAA2B;AAC1D,KAAI,iBAAiB,cAAc,SAAS,EAC1C,eAAc,cAAc,SAAS,GAAI,KAAK,QAAQ;;;;;;;;AC5F1D,SAAgB,gBAAmB,OAAY,MAAe;CAC5D,MAAM,IAAI,MAAM,QAAQ,KAAK;AAC7B,KAAI,KAAK,GAAG;AACV,QAAM,KAAK,MAAM,MAAM,SAAS;AAChC,QAAM,KAAK;;;;;;;;;AAUf,IAAa,SAAb,MAAuB;CACrB;CACA,QAAsB,EAAE;CACxB,WAAgC,EAAE;CAElC,YAAY,OAAU;AACpB,QAAKC,QAAS;;CAGhB,IAAI,QAAW;AACb,MAAI,QAAS,SAAQ,YAAY,KAAK;AACtC,SAAO,MAAKA;;CAGd,IAAI,MAAM,GAAM;AACd,MAAI,OAAO,GAAG,MAAKA,OAAQ,EAAE,CAAE;AAC/B,QAAKA,QAAS;EAGd,MAAM,UAAU,MAAKC;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAClC,SAAQ,GAAI,WAAW;AAIzB,MAAI,MAAKC,KAAM,OACb,KAAI,YAAY,CACd,iBAAgB,MAAKA,KAAM;MAE3B,MAAK,IAAI,IAAI,GAAG,IAAI,MAAKA,KAAM,QAAQ,IAAK,OAAKA,KAAM,IAAK;;CAKlE,UAAU,IAA4B;AACpC,QAAKA,KAAM,KAAK,GAAG;AACnB,eAAa,gBAAgB,MAAKA,MAAO,GAAG;;;;;;;;;;;CAY9C,OAAO,IAA6B;AAClC,OAAK,QAAQ,GAAG,MAAKF,MAAO;;;CAI9B,IAAI,UAA+B;AACjC,SAAO,MAAKC;;;CAId,aAAa,QAAiC;AAC5C,kBAAgB,MAAKA,SAAU,OAAO;;;;AAK1C,MAAa,UAAa,UAAa,IAAI,OAAO,MAAM;;;;;;;;;;;;;ACzExD,IAAa,WAAb,MAAyB;CACvB;CACA;CACA,SAAS;CACT,aAAa;CACb,QAAsB,EAAE;CACxB,WAAgC,EAAE;CAClC,WAAoD,EAAE;CACtD,eAAe;CAEf,YAAY,IAAa;AACvB,QAAKE,KAAM;AACX,QAAKC,WAAY;AAGjB,yBAAuB,KAAK,SAAS,CAAC;;CAGxC,IAAI,QAAW;AACb,MAAI,MAAKC,MAAQ,OAAKD,WAAY;AAClC,MAAI,WAAW,YAAY,KAAM,SAAQ,YAAY,KAAK;AAC1D,SAAO,MAAKE;;CAGd,UAAU,IAA4B;AACpC,QAAKC,KAAM,KAAK,GAAG;AACnB,eAAa,gBAAgB,MAAKA,MAAO,GAAG;;CAG9C,UAAgB;AACd,QAAKJ,KAAM;EACX,MAAM,UAAU,MAAKK;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,SAAS,QAAQ;AACvB,OAAI,OAAQ,QAAO,aAAa,KAAK;;AAEvC,QAAKA,UAAW,EAAE;AAClB,QAAKD,KAAM,SAAS;;;;;;CAOtB,YAAY,QAAmD;EAC7D,MAAM,UAAU,MAAKC;EACrB,MAAM,MAAM,MAAKC;AAEjB,MAAI,MAAM,QAAQ,QAAQ;AACxB,OAAI,QAAQ,SAAS,OAEnB;AAGF,QAAK,IAAI,IAAI,KAAK,IAAI,QAAQ,QAAQ,KAAK;IACzC,MAAMC,WAAS,QAAQ;AACvB,QAAIA,SAAQ,UAAO,aAAa,KAAK;;AAEvC,WAAQ,SAAS;;AAGnB,UAAQ,KAAK,OAAO;AACpB,SAAO,QAAQ,KAAK,KAAK;;;;;;CAO3B,YAAkB;AAChB,MAAI,MAAKL,MAAQ;EAEjB,MAAMM,QAA6B,CAAC,KAAK;AACzC,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,IAAI,MAAM;AAChB,OAAI,GAAEN,MAAQ;AACd,MAAEA,QAAS;GAEX,MAAM,UAAU,GAAEO;AAKlB,OAAI,GAAEL,KAAM,SAAS,KAAK,QAAQ,SAAS,KAAK,GAAEJ,MAAO,CAAC,YAAY,EAAE;IACtE,MAAM,MAAM,GAAEG;AACd,OAAEF,WAAY;AAId,QAHqB,CAAC,OAAO,GAAG,GAAEE,OAAQ,IAAI,EAG5B;AAChB,UAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;MACvC,MAAM,SAAS,QAAQ;AACvB,UAAI,CAAC,QAAOD,MAAQ,OAAM,KAAK,OAAO;;AAIxC,UAAK,IAAI,IAAI,GAAG,IAAI,GAAEE,KAAM,QAAQ,IAAK,IAAEA,KAAM,IAAK;;UAGnD;AAEL,SAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;KACvC,MAAM,SAAS,QAAQ;AACvB,SAAI,CAAC,QAAOF,MAAQ,OAAM,KAAK,OAAO;;AAGxC,QAAI,GAAEE,KAAM,QAAQ;KAClB,MAAM,MAAM,GAAED;KACd,MAAM,eAAe;AACnB,UAAI,GAAEH,IAAK;AACT,UAAEC,WAAY;AACd,WAAI,CAAC,OAAO,GAAG,GAAEE,OAAQ,IAAI,CAC3B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAEC,KAAM,QAAQ,IAAK,IAAEA,KAAM,IAAK;;;AAI5D,SAAI,YAAY,CACd,cAAa,OAAO;SAEpB,SAAQ;;;;;;CAQlB,IAAI,UAA+B;AACjC,SAAO,MAAKK;;;CAId,aAAa,QAAiC;AAC5C,kBAAgB,MAAKA,SAAU,OAAO;;CAGxC,aAAmB;AACjB,MAAI,MAAKC,aAAc,CAAC,MAAKV,GAAK;AAClC,QAAKU,YAAa;AAElB,QAAKJ,cAAe;EACpB,MAAM,UAAU,MAAKD,QAAS;EAE9B,MAAM,OAAO;AACb,aAAW,KAAK;AAChB,MAAI;AACF,SAAKF,QAAS,MAAKH,IAAK;YAChB;AACR,cAAW,KAAK;GAGhB,MAAM,SAAS,MAAKM;AACpB,OAAI,SAAS,SAAS;IACpB,MAAM,UAAU,MAAKD;AACrB,SAAK,IAAI,IAAI,QAAQ,IAAI,SAAS,KAAK;KACrC,MAAM,SAAS,QAAQ;AACvB,SAAI,OAAQ,QAAO,aAAa,KAAK;;AAEvC,YAAQ,SAAS;;AAGnB,SAAKH,QAAS;AACd,SAAKQ,YAAa;;;;;AAMxB,MAAa,YAAe,OAAgB,IAAI,SAAS,GAAG;;;;;;;;;;;;;;;;;;;;;;;ACrK5D,SAAgB,OAAO,IAA4B;CACjD,MAAM,IAAI,eAAe;AACvB,MAAI;GAEJ;CAGF,MAAM,QAAQ,EAAE,gBAAgB,GAAG;CAEnC,MAAM,gBAAgB;AACpB,SAAO;AACP,IAAE,SAAS;;AAOb,kBAAiB,QAAQ;AAEzB,QAAO;;;;;;;;ACrCT,MAAM,QAAQ,QAAQ;AAEtB,MAAM,iBAAiB,UACrB,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,eAAe,MAAM,KAAK,OAAO;;;;;AAM1C,SAAgB,MAAwB,KAAW;CACjD,MAAM,0BAAU,IAAI,KAAuC;;CAG3D,MAAM,QAAQ,UAA4B;AACxC,MAAI,UAAU,QAAQ,OAAO,UAAU,YAAY,SAAS,MAC1D,QAAO;AAET,MAAI,cAAc,MAAM,CACtB,QAAO,MAAM,MAAM;AAErB,MAAI,MAAM,QAAQ,MAAM,CACtB,QAAO,MAAM,IAAI,KAAK;AAExB,SAAO;;;CAIT,MAAM,aAAa,KAAsB,iBAA0B;EACjE,IAAI,MAAM,QAAQ,IAAI,IAAI;AAC1B,MAAI,CAAC,KAAK;AACR,SAAM,IAAI,OAAO,KAAK,aAAa,CAAC;AACpC,WAAQ,IAAI,KAAK,IAAI;;AAEvB,SAAO;;AAGT,QAAO,IAAI,MAAM,KAAK;EACpB,IAAI,QAAQ,KAAK;AAEf,OAAI,OAAO,QAAQ,SACjB,QAAO,OAAO;AAEhB,UAAO,UAAU,KAAK,OAAO,KAAgB,CAAC;;EAGhD,IAAI,QAAQ,KAAK,OAAO;AACtB,OAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,OAAkB;AACzB,WAAO;;GAET,MAAM,UAAU,KAAK,MAAM;AAC3B,aAAU,KAAK,OAAO,KAAgB,CAAC,QAAQ;AAC/C,UAAO,OAAkB;AACzB,UAAO;;EAGT,IAAI,QAAQ,KAAK;AACf,UAAO,QAAQ,SAAS,OAAO;;EAElC,CAAC;;;;;;AC3CJ,MAAa,YAAY,UACvB,iBAAiB,UAAU,iBAAiB;;;;ACV9C,IAAa,aAAb,MAAwB;CACtB,AAAQ,IAAI;CACZ,AAAQ,KAAqB;CAC7B,AAAQ,MAAM;CACd,AAAQ,OAAO;CACf,AAAQ,QAAoB,EAAE;CAC9B,AAAQ,OAAO;CACf,AAAQ,IAAI;CAEZ,cAAc,SAA+B,IAAoB;AAC/D,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,QAAK,MAAM,QAAQ,IAAK,GAAG;AAC3B,OAAI,IAAI,QAAQ,SAAS,EAAG,MAAK,KAAK,GAAG,GAAG;;AAE9C,MAAI,KAAK,MAAM;AACb,MAAG,OAAO,KAAK,KAAK;AACpB,QAAK,OAAO;;;CAIhB,AAAQ,MAAM,KAAa,IAAoB;AAC7C,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;GACnC,MAAM,KAAK,IAAI,IACb,KAAK,IAAI,IAAI,IACb,KAAK,IAAI,IAAI;AAEf,OAAI,KAAK,MAAM,EAEb,KAAI,OAAO,KAAK;AACd,QAAI,KAAK,MAAM;AACb,QAAG,OAAO,KAAK,KAAK;AACpB,UAAK,OAAO;;AAEd,SAAK,IAAI;SACJ,MAAK,QAAQ;YACX,KAAK,MAAM,EAEpB,KAAI,OAAO,IAAK,MAAK,IAAI;YAChB,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC/C,SAAK;AACL,SAAK,IAAI;cACA,OAAO,OAAO,OAAO,KAAK;AACnC,WAAO,IAAI,IAAI,UAAU,IAAI,OAAO,IAAK;AACzC,SAAK,IAAI;cACA,KAAK,IAAI,GAAG,EAAE;AACvB,SAAK,MAAM;AACX,SAAK,IAAI;UACJ;AACL,SAAK,QAAQ,MAAM;AACnB,SAAK,IAAI;;YAEF,KAAK,MAAM,GAEpB;QAAI,KAAK,IAAI,GAAG,CAAE,MAAK,OAAO;aACrB,KAAK,IAAI,GAAG,EAAE;AACrB,UAAK,KAAK,SAAS,cAAc,KAAK,IAAI;AAC1C,UAAK,MAAM;AACX,UAAK,IAAI;eACA,OAAO,KAAK;AACrB,UAAK,KAAK,SAAS,cAAc,KAAK,IAAI;AAC1C,UAAK,MAAM;AACX,UAAK,KAAK,IAAI,MAAM;eACX,OAAO,OAAO,OAAO,KAAK;AACnC,UAAK,KAAK,SAAS,cAAc,KAAK,IAAI;AAC1C,UAAK,MAAM;AACX;AACA,UAAK,KAAK,IAAI,KAAK;;cAEZ,KAAK,MAAM,GAAG;AAEvB,QAAI,KAAK,IAAI,GAAG,CAAE;AAClB,QAAI,OAAO,IAAK,MAAK,KAAK,IAAI,MAAM;aAC3B,OAAO,OAAO,OAAO,KAAK;AACjC;AACA,UAAK,KAAK,IAAI,KAAK;WACd;AACL,UAAK,OAAO;AACZ,UAAK,QAAQ,EAAE;AACf,UAAK,IAAI;;cAEF,KAAK,MAAM,GAEpB;QAAI,KAAK,IAAI,GAAG,IAAI,OAAO,IAAK,MAAK,QAAQ;aACpC,OAAO,IAAK,MAAK,IAAI;aACrB,KAAK,IAAI,GAAG,EAAE;AACrB,UAAK,SAAS,GAAG;AACjB,UAAK,IAAI;eACA,OAAO,KAAK;AACrB,UAAK,SAAS,GAAG;AACjB,UAAK,KAAK,IAAI,MAAM;eACX,OAAO,OAAO,OAAO,KAAK;AACnC,UAAK,SAAS,GAAG;AACjB;AACA,UAAK,KAAK,IAAI,KAAK;;cAEZ,KAAK,MAAM,GAEpB;QAAI,OAAO,QAAO,OAAO,KAAK;AAC5B,UAAK,IAAI;AACT,UAAK,IAAI;eACA,CAAC,KAAK,IAAI,GAAG,EAAE;AACxB,UAAK,IAAI;AACT,UAAK,MAAM,KAAK,GAAG;AACnB,UAAK,IAAI;;cAEF,KAAK,MAAM,EAKpB,KAHY,KAAK,IACb,OAAO,KAAK,IACZ,KAAK,IAAI,GAAG,IAAI,OAAO,OAAO,OAAO,KAChC;AACP,SAAK,SAAS,GAAG;AACjB,SAAK,IAAI;AACT,SAAK,IAAI;AACT,QAAI,OAAO,IAAK,MAAK,KAAK,IAAI,MAAM;aAC3B,OAAO,OAAO,OAAO,KAAK;AACjC;AACA,UAAK,KAAK,IAAI,KAAK;;UAEhB;IACL,MAAM,OAAO,KAAK,MAAM,KAAK,MAAM,SAAS;AAC5C,QAAI,OAAO,SAAS,SAClB,MAAK,MAAM,KAAK,MAAM,SAAS,KAAK,OAAO;QACxC,MAAK,MAAM,KAAK,GAAG;;YAEjB,KAAK,MAAM,GAEpB;QAAI,OAAO,KAAK;AACd,QAAG,SAAS;AACZ,UAAK,IAAI;;cAEF,KAAK,MAAM,GAEpB;QAAI,OAAO,OAAO,OAAO,OAAO,OAAO,KAAK;AAC1C,UAAK;AACL,UAAK,IAAI;;;;;CAMjB,AAAQ,KAAK,OAAe,IAAoB;AAC9C,MAAI,KAAK,MAAM,KAAK,KAAK,MAAM,GAAG;AAChC,QAAK,MAAM,KAAK,EAAE,OAAO,CAAC;AAC1B,OAAI,KAAK,MAAM,EAAG,MAAK,IAAI;SACtB;AACL,OAAI,KAAK,MAAM;AACb,OAAG,OAAO,KAAK,KAAK;AACpB,SAAK,OAAO;;AAEd,MAAG,OAAO,MAAM;;;CAIpB,AAAQ,KAAK,IAAoB,MAAe;AAC9C,KAAG,UAAU,KAAK,IAAK,KAAK;AAC5B,OAAK,KAAK;AACV,OAAK,IAAI;;CAGX,AAAQ,SAAS,IAAoB;AACnC,MAAI,KAAK,MAAM,KAAK,KAAM,IAAG,YAAY,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM;AACxE,OAAK,OAAO;AACZ,OAAK,QAAQ,EAAE;;CAGjB,AAAQ,IAAI,GAAW;AACrB,SAAQ,KAAK,OAAO,KAAK,OAAS,KAAK,OAAO,KAAK;;CAErD,AAAQ,IAAI,GAAW;AACrB,SAAO,KAAK,IAAI,EAAE,IAAK,KAAK,OAAO,KAAK,OAAQ,MAAM,OAAO,MAAM;;CAErE,AAAQ,IAAI,GAAW;AACrB,SAAO,MAAM,OAAO,MAAM,OAAQ,MAAM,QAAQ,MAAM;;;;;;;;;;;;;;;;;;;;;ACzK1D,SAAS,KACP,OACA,QACqB;AACrB,KAAI,SAAS,MAAM,EAAE;AACnB,SAAO,MAAM,MAAM;AACnB,SAAO,MAAM,gBAAgB,OAAQ,MAA4B,MAAM,CAAC;;AAE1E,QAAO,MAAM;AACb,QAAO;;;AAIT,IAAa,WAAb,MAAsB;CACpB,YACE,AAAQC,SACR,AAAQC,QACR;EAFQ;EACA;;;;;;CAOV,SAA8D;EAC5D,MAAM,WAAW,SAAS,wBAAwB;EAClD,MAAMC,YAA4B,EAAE;EACpC,MAAMC,QAAwC,CAAC,SAAS;EACxD,MAAM,SAAS,IAAI,YAAY;EAC/B,MAAM,SAAS,KAAK;AAEpB,SAAO,cAAc,KAAK,SAAS;GACjC,SAAS,SAAS;AAChB,UAAM,GAAG,GAAG,CAAE,YAAY,SAAS,eAAe,KAAK,CAAC;;GAG1D,YAAY,IAAI,gBAAgB;AAC9B,UAAM,GAAG,GAAG,CAAE,YAAY,GAAG;AAC7B,QAAI,CAAC,YAAa,OAAM,KAAK,GAAG;;GAGlC,eAAe;AACb,QAAI,MAAM,SAAS,EAAG,OAAM,KAAK;;GAGnC,cAAc,IAAI,MAAM,UAAU;IAChC,MAAM,SAAS,KAAK;AAGpB,QAAI,WAAW,KAAK;KAClB,MAAM,QAAQ,KAAK,MAAM,EAAE;KAC3B,MAAM,OAAO,MAAM;AACnB,SAAI,QAAQ,OAAO,SAAS,UAAU;MACpC,MAAM,UAAU,OAAO,KAAK;AAC5B,SAAG,iBAAiB,OAAO,QAAQ;AACnC,gBAAU,WAAW,GAAG,oBAAoB,OAAO,QAAQ,CAAC;;AAE9D;;AAIF,QAAI,WAAW,KAAK;KAClB,MAAM,OAAO,KAAK,MAAM,EAAE;KAC1B,MAAM,OAAO,MAAM;AACnB,SAAI,QAAQ,OAAO,SAAS,UAAU;MACpC,MAAM,QAAQ,KAAK,OAAO,KAAK,SAAS,MAAM;AAC5C,OAAC,GAA0C,QAAQ;QACnD;AACF,UAAI,MAAO,WAAU,KAAK,MAAM;;AAElC;;AAIF,QAAI,MAAM,OAAO,MAAM,OAAO,MAAM,SAAS,EAAE;KAC7C,MAAM,QAAQ,MAAM,KAAK,GAAG;AAC5B,SAAI,SAAS,MAAM,WAAW,EAC5B,IAAG,aAAa,MAAM,MAAM;AAE9B;;IAIF,MAAM,eAAe,MAAM,QACxB,MAA8B,OAAO,MAAM,SAC7C;IACD,MAAM,UAAU,aACb,KAAK,MAAM,OAAO,EAAE,OAAO,CAC3B,OAAO,SAAS;IAGnB,MAAM,kBACJ,MAAM,WAAW,KAAK,OAAO,MAAM,OAAO;IAE5C,MAAM,eAAe;AACnB,SAAI,iBAAiB;MAEnB,MAAM,IAAI,OAAO,aAAa,GAAI;MAClC,MAAM,MAAM,SAAS,EAAE,GAAI,EAAwB,QAAQ;AAC3D,UAAI,OAAO,QAAQ,QAAQ,MAAO,IAAG,gBAAgB,KAAK;UACrD,IAAG,aAAa,MAAM,QAAQ,OAAO,KAAK,OAAO,IAAI,CAAC;YACtD;MAEL,MAAM,WAAW,MACd,KAAK,MAAM;AACV,WAAI,OAAO,MAAM,SAAU,QAAO;OAClC,MAAM,IAAI,OAAO,EAAE;OACnB,MAAM,MAAM,SAAS,EAAE,GAAI,EAAwB,QAAQ;AAC3D,cAAO,OAAO,OAAO,KAAK,OAAO,IAAI;QACrC,CACD,KAAK,GAAG;AACX,SAAG,aAAa,MAAM,SAAS;;;AAInC,YAAQ;AACR,YAAQ,SAAS,MAAM,UAAU,KAAK,EAAE,UAAU,OAAO,CAAC,CAAC;;GAG7D,SAAS,UAAU;IAEjB,MAAM,SAAS,SAAS,cAAc,GAAG;AACzC,UAAM,GAAG,GAAG,CAAE,YAAY,OAAO;AACjC,cAAU,KAAK,YAAY,QAAQ,OAAO,OAAO,CAAC;;GAErD,CAAC;AAEF,SAAO;GAAE;GAAU,eAAe,UAAU,SAAS,MAAM,GAAG,CAAC;GAAE;;;;;;;;AAgBrE,SAAS,YAAY,QAAiB,OAA4B;CAChE,IAAIC,QAAgB,EAAE;CACtB,IAAIC,iBAAiC,EAAE;CAEvC,MAAM,cAAc;AAClB,iBAAe,SAAS,MAAM,GAAG,CAAC;AAClC,mBAAiB,EAAE;AACnB,QAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;AAClD,UAAQ,EAAE;;AAIZ,KAAI,OAAO,MAAM,EAAE;EACjB,MAAM,wBAAQ,IAAI,KAAyB;EAC3C,MAAM,EAAE,MAAM,OAAO,aAAa;EAClC,IAAI,kBAAkB;EAEtB,MAAM,mBAAmB;GACvB,MAAM,SAAS,OAAO;GACtB,MAAM,QAAQ,KAAK;GACnB,MAAM,0BAAU,IAAI,KAAc;GAClC,MAAMC,WAAmB,EAAE;AAE3B,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACrC,MAAM,OAAO,MAAM;IACnB,MAAM,MAAM,MAAM,MAAM,EAAE;AAE1B,QAAI,QAAQ,IAAI,IAAI,EAAE;AACpB,SAAI,CAAC,iBAAiB;AACpB,wBAAkB;AAClB,cAAQ,KACN,sCAAsC,OAAO,IAAI,CAAC,mEAEnD;;AAEH;;AAEF,YAAQ,IAAI,IAAI;IAEhB,IAAI,QAAQ,MAAM,IAAI,IAAI;AAC1B,QAAI,CAAC,SAAS,MAAM,SAAS,MAAM;AAEjC,SAAI,OAAO;AAET,YAAM,MAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;AACxD,YAAM,SAAS;;KAEjB,MAAM,EAAE,UAAU,YAAY,SAAS,KAAK,CAAC,QAAQ;AACrD,aAAQ;MAAE;MAAM,OAAO,CAAC,GAAG,SAAS,WAAW;MAAE;MAAS;AAC1D,WAAM,IAAI,KAAK,MAAM;;AAEvB,aAAS,KAAK,GAAG,MAAM,MAAM;;AAI/B,QAAK,MAAM,CAAC,KAAK,UAAU,MACzB,KAAI,CAAC,QAAQ,IAAI,IAAI,EAAE;AACrB,UAAM,MAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;AACxD,UAAM,SAAS;AACf,UAAM,OAAO,IAAI;;GAKrB,IAAIC,WAAiB;AACrB,QAAK,IAAI,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK;IAC7C,MAAM,OAAO,SAAS;AACtB,QAAI,KAAK,gBAAgB,SACvB,QAAO,aAAa,MAAM,SAAS;AAErC,eAAW;;AAGb,WAAQ;;AAGV,cAAY;EACZ,MAAMC,UAAQ,KAAK,UAAU,WAAW;AAExC,eAAa;AACX,YAAO;AACP,QAAK,MAAM,SAAS,MAAM,QAAQ,CAChC,OAAM,SAAS;AAEjB,SAAM,OAAO;AACb,SAAM,SAAS,MAAM,EAAE,YAAY,YAAY,EAAE,CAAC;;;CAItD,MAAM,UAAU,MAAe;AAC7B,SAAO;EACP,MAAM,SAAS,OAAO;AAEtB,OAAK,MAAM,QAAQ,MAAM,QAAQ,EAAE,GAAG,IAAI,CAAC,EAAE,CAC3C,KAAI,gBAAgB,UAAU;GAC5B,MAAM,EAAE,UAAU,YAAY,KAAK,QAAQ;AAC3C,kBAAe,KAAK,QAAQ;AAC5B,SAAM,KAAK,GAAG,SAAS,WAAW;AAClC,UAAO,aAAa,UAAU,OAAO;aAC5B,QAAQ,QAAQ,OAAO,SAAS,WAAW;GACpD,MAAM,OAAO,SAAS,eAAe,OAAO,KAAK,CAAC;AAClD,SAAM,KAAK,KAAK;AAChB,UAAO,aAAa,MAAM,OAAO;;;CAKvC,MAAM,QAAQ,KAAK,OAAO,OAAO;AACjC,cAAa;AACX,WAAS;AACT,SAAO;;;;AAKX,MAAa,QAAQ,SAA+B,GAAG,WACrD,IAAI,SAAS,SAAS,OAAO;;AAG/B,MAAM,OAAO,QAAQ;;AAWrB,MAAM,UAAU,MACd,KAAK,QAAQ,OAAO,MAAM,YAAY,QAAQ;;AAMhD,SAAS,eAAkB,MAAmC;AAC5D,KAAI,MAAM,QAAQ,KAAK,CAAE,QAAO,OAAO,KAAK;AAC5C,KAAI,OAAO,SAAS,WAAY,QAAO,SAAS,KAAK;AACrD,QAAO;;AAqCT,SAAgB,KACd,MACA,iBAGA,UACmB;CACnB,MAAM,eAAe,eAAe,KAAK;AAEzC,KAAI,aAAa,OAGf,QAAO;GACJ,OAAO;EACR,MAAM;EACN,QAAQ,MAAM,UACZ,SAAS,SACR,OAAO,SAAS,YAAY,OAAO,SAAS,cACzC,OACA;EACN,UAAU;EACX;AAGH,QAAO;GACJ,OAAO;EACR,MAAM;EACN,OAAO;EACP;EACD"}

package/dist/balises.iife.js

@@ -40,6 +40,46 @@ var Balises = (function(exports) {
 	function enqueueBatchAll(subs) {
 		for (let i = 0; i < subs.length; i++) batchQueue.add(subs[i]);
 	}
+	/** Scope disposal: collect all disposers in a scope */
+	let disposalStack = null;
+	/**
+	* Create a disposal scope that collects all subscriptions and computeds created within.
+	* Returns the result of the function and a dispose function that cleans up all resources.
+	*
+	* @example
+	* ```ts
+	* const [result, dispose] = scope(() => {
+	*   const count = signal(0);
+	*   const doubled = computed(() => count.value * 2);
+	*   effect(() => console.log(doubled.value));
+	*   return { count, doubled };
+	* });
+	*
+	* // Later: clean up all subscriptions and computeds
+	* dispose();
+	* ```
+	*/
+	function scope(fn) {
+		const disposers = [];
+		if (!disposalStack) disposalStack = [];
+		disposalStack.push(disposers);
+		try {
+			return [fn(), () => {
+				for (let i = disposers.length - 1; i >= 0; i--) disposers[i]();
+				disposers.length = 0;
+			}];
+		} finally {
+			disposalStack.pop();
+			if (disposalStack.length === 0) disposalStack = null;
+		}
+	}
+	/**
+	* Register a disposer in the current scope (if any).
+	* This is called internally by computed/effect when they create cleanup functions.
+	*/
+	function registerDisposer(dispose) {
+		if (disposalStack && disposalStack.length > 0) disposalStack[disposalStack.length - 1].push(dispose);
+	}
 
 //#endregion
 //#region src/signals/signal.ts
@@ -129,6 +169,7 @@ var Balises = (function(exports) {
 		constructor(fn) {
 			this.#fn = fn;
 			this.#recompute();
+			registerDisposer(() => this.dispose());
 		}
 		get value() {
 			if (this.#dirty) this.#recompute();
@@ -270,10 +311,12 @@ var Balises = (function(exports) {
 			fn();
 		});
 		const unsub = c.subscribe(() => {});
-		return () => {
+		const dispose = () => {
 			unsub();
 			c.dispose();
 		};
+		registerDisposer(dispose);
+		return dispose;
 	}
 
 //#endregion
@@ -729,6 +772,7 @@ exports.each = each;
 exports.effect = effect;
 exports.html = html;
 exports.isSignal = isSignal;
+exports.scope = scope;
 exports.signal = signal;
 exports.store = store;
 return exports;