sigula 1.0.1 → 1.0.3

package/README.md

@@ -11,7 +11,7 @@ A minimal, signal-based web framework with fine-grained reactivity. No virtual D
 - No virtual DOM — no diffing, no VNodes. Direct real DOM operations with minimal runtime overhead
 - Minimal HTML templates — based on native string templates. No custom compiler, no DSL — just JavaScript strings
 - Batched, coalesced updates — writes are queued in a microtask, so a signal touched many times before the flush runs its bindings once, with the final value
-- Ultra small — under ~4KB minified + gzipped
+- Ultra small — ~4.1KB minified + gzipped
 - TypeScript friendly — full type inference for signals and template bindings
 - Simple but performant — tiny API surface, low mental overhead, no compromise on performance
 
@@ -231,7 +231,7 @@ const App: View = html`
 
 ### Ultra small
 
-minified + gzipped: ~3.8KB
+minified + gzipped: ~4.1KB
 
 ## 📖 Reference
 
@@ -279,11 +279,12 @@ The core reactive value.
 
 #### `DerivedSig<T>`
 
-A `Sig` produced by `compute`. Extends `Sig` and additionally tracks the source bindings that feed it.
+A `Sig` produced by `compute`. Extends `Sig` and additionally tracks the source bindings that feed it. When it loses its last consumer it detaches from its sources; when a consumer is added again, it re-links to the (possibly moved) source signals and recomputes once.
 
 | Member | Signature | Description |
 | --- | --- | --- |
 | `addFromBind` | `<S, C>(bind: Bind<S, C>): void` | Registers a source binding. |
+| `addBind` | `<C>(bind: Bind<T, C>): void` | Registers a consumer; re-links to sources and recomputes once if the derived signal was detached. |
 | `cleanup` | `(): void` | Removes every source binding when the derived signal has no consumers. |
 
 #### `compute`
@@ -316,11 +317,6 @@ interface SigRecord {
 type ValRecord<K extends SigRecord> = {
   [P in keyof K]: K[P] extends Sig<infer U> ? U : never;
 };
-
-interface ComputeContext<S, T> extends CmdContext {
-  target: Sig<T>;
-  fn: (s: S) => T;
-}
 ```
 
 `ValRecord` maps a record of signals to the record of their values, which is what `compute`'s record overload passes to `fn`.
@@ -331,7 +327,7 @@ interface ComputeContext<S, T> extends CmdContext {
 const isEqual: <T>(a: T, b: T) => boolean;
 ```
 
-Deep structural equality. Compares primitives, arrays, `Date`, `RegExp`, `Map`, `Set`, and plain objects, and defers to `a.equals(b)` when `a` implements `Equatable`. This is the default comparator for `Sig.update` and `repeat`.
+Deep structural equality. Compares primitives, arrays, `Date`, `RegExp`, `Map`, `Set`, and plain objects, and defers to `a.equals(b)` when `a` implements `Equatable`. This is the default comparator for `Sig.update` and `repeat`. Two objects with different prototypes are never equal, so instances of different classes and objects from different realms (iframes, workers) always compare unequal.
 
 #### `Equatable`
 
@@ -351,14 +347,6 @@ type UnknownRecord = Record<string, unknown>;
 
 Convenience alias for an arbitrary string-keyed object, used by the equality and signal-record helpers.
 
-#### `toValRecord`
-
-```ts
-const toValRecord: <S extends SigRecord>(source: S) => ValRecord<S>;
-```
-
-Reads the current value of every signal in a record into a plain record of values. Mostly used internally by `compute`'s record overload.
-
 #### `createBind` / `removeBind`
 
 ```ts
@@ -406,7 +394,7 @@ html`<p>${text(label)}</p>`;
 html`<button ${patch(on('click', handler))}>Go</button>`;
 ```
 
-Templates are cached per call site, so repeated renders skip parsing. Using `patch(...)` in a content position throws `html: unmatched interpolation; patch() must be in attribute position`.
+Templates are cached per call site, so repeated renders skip parsing. Using `patch(...)` in a content position throws `html: unmatched interpolation; patch() must be in attribute position`. An interpolation count that does not match the number of slots throws `html: expected N interpolation(s), got M`; a mismatch means the cached template for that call site was built from a different mix of interpolations.
 
 #### `text`
 
@@ -420,28 +408,21 @@ Creates a text-node view. With a `Sig`, the text updates whenever the signal cha
 html`<span>${text(count)}</span>`;
 ```
 
-#### `MARK`
-
-```ts
-const MARK: string;
-```
-
-The randomly generated marker attribute/comment name used internally to locate interpolation slots. Exported for advanced tooling; not needed in application code.
-
 #### `View<T, C>` / `AnyView`
 
 ```ts
-interface View<T = unknown, C extends CmdContext = CmdContext> {
+interface View<T = unknown, C extends CmdContext = any> {
   type: 'view';
   node: Node;
   bind?: Bind<T, C> | undefined;
   childCommits?: Commit<unknown, CmdContext>[];
+  live?: () => Boundary | undefined;
 }
 
 type AnyView = View<any, any>;
 ```
 
-`View` is the unit returned by `html`, `text`, `view`, and `repeat`. Its `node` is a DOM node or `DocumentFragment`.
+`View` is the unit returned by `html`, `text`, `view`, and `repeat`. Its `node` is a DOM node or `DocumentFragment`. `live` returns the boundary the view currently occupies; `render` calls it at disposal time so a view that swaps its own contents (`view`, `repeat`) is torn down from its current nodes.
 
 #### `extractBoundary` / `replaceWithView`
 
@@ -603,7 +584,7 @@ interface Patch {
 const view: <T>(
   sig: Sig<T>,
   viewFn: (val: T) => AnyView,
-) => View<T, ViewContext<T>>;
+) => View<T>;
 ```
 
 Conditionally renders one view or another. Whenever `sig` changes, `viewFn` is called with the new value, the previous view is torn down, and a new one is mounted in its place.
@@ -612,27 +593,16 @@ Conditionally renders one view or another. Whenever `sig` changes, `viewFn` is c
 html`<div>${view(isEmpty, (v) => (v ? text('empty') : list))}</div>`;
 ```
 
-The context carried by a `view` binding:
-
-```ts
-interface ViewContext<T> extends CmdContext {
-  boundary: Boundary;
-  bind?: AnyBind | undefined;
-  childCommits?: Commit<unknown, CmdContext>[] | undefined;
-  viewFn: (val: T) => View;
-}
-```
-
 #### `repeat`
 
 ```ts
-interface RepeatProp<T> {
+type RepeatProp<T> = {
   key: (item: T) => string;
   view: (item: T) => AnyView;
   compare?: (a: T, b: T) => boolean;
-}
+};
 
-const repeat: <T>(sig: Sig<T[]>, prop: RepeatProp<T>) => View<T[], RepeatContext<T>>;
+const repeat: <T>(sig: Sig<T[]>, prop: RepeatProp<T>) => View<T[]>;
 ```
 
 Keyed list rendering. On each change Sigula matches items by `key`, then reuses, moves, creates, or removes as few DOM nodes as possible. `compare` defaults to `isEqual`; when an item is deeply equal to the track it already occupies, the track is reused without rebuilding its view. An empty array renders `<!--empty-list-->`.
@@ -646,49 +616,27 @@ html`<ul>${repeat(todos, {
 
 `key` must be unique and stable for a given item. `compare` is useful when item identity is structural but you want to force or skip updates.
 
-#### `repeat` types
-
-```ts
-interface Container {
-  parent: ParentNode;
-  startFence: Node;
-  endFence: Node;
-}
-
-interface Track<T> {
-  boundary: Boundary;
-  bind?: AnyBind | undefined;
-  item: T;
-  key: string;
-  childCommits?: Commit<unknown, CmdContext>[] | undefined;
-  checked?: boolean;
-  cleaned?: boolean;
-}
-
-interface RepeatContext<T> extends CmdContext {
-  prop: RepeatProp<T>;
-  boundary: Boundary;
-  tracks: Track<T>[];
-}
-```
-
-These describe the internal bookkeeping of a `repeat`. Exposed for advanced integrations; application code should not need them.
-
 ### Rendering
 
 #### `render`
 
 ```ts
-const render: (viewArg: AnyView | (() => AnyView), node: Node) => void;
+const render: (
+  viewArg: AnyView | (() => AnyView),
+  node: Node,
+) => () => void;
 ```
 
-Mounts a view into `node` by appending `view.node`. Accepts a `View` directly or a factory function that returns one.
+Mounts a view into `node` by appending `view.node`. Accepts a `View` directly or a factory function that returns one. Returns a disposer that detaches every bind in the tree and removes the nodes from `node`, so a mounted tree can be torn down completely. Calling the disposer twice is a no-op.
 
 ```ts
-render(App(), document.querySelector('#app')!);
+const dispose = render(App(), document.querySelector('#app')!);
 render(() => html`<p>lazy</p>`, document.body);
+dispose();
 ```
 
+A view that swaps its own contents — one built with `view()` or `repeat()` at the root — disposes the nodes currently in `node`, not the ones originally appended. An empty template such as html`` renders nothing and its disposer is a no-op.
+
 ### Low-level API
 
 These utilities power the framework and are exported for extension and testing.

package/dist/sigula.d.ts

@@ -46,7 +46,9 @@ export declare class Sig<T> implements Equatable {
 }
 export declare class DerivedSig<T> extends Sig<T> {
   private _fromBinds;
+  private _linked;
   addFromBind<S, C extends CmdContext>(bind: Bind<S, C>): void;
+  addBind<C extends CmdContext>(bind: Bind<T, C>): void;
   cleanup(): void;
 }
 export declare const sig: <T>(v: T) => Sig<T>;
@@ -54,9 +56,9 @@ export declare const removeBind: (bind: Bind<unknown, CmdContext>) => void;
 export declare const createBind: <T, C extends CmdContext>(sig: Sig<T>, context: C, cmd: Cmd<T, C>) => Bind<T, C>;
 //#endregion
 //#region src/commit.d.ts
-export interface Commit<T, C extends CmdContext> {
+export interface Commit<T, C extends CmdContext = any> {
   binds: Bind<T, C> | Bind<T, C>[] | undefined;
-  children?: Commit<unknown, CmdContext>[] | undefined;
+  children?: Commit<unknown, any>[] | undefined;
 }
 export declare const cleanCommit: (commit: Commit<unknown, CmdContext>) => void;
 //#endregion
@@ -65,11 +67,6 @@ export interface SigRecord {
   [key: string]: Sig<any>;
 }
 export type ValRecord<K extends SigRecord> = { [P in keyof K]: K[P] extends Sig<infer U> ? U : never; };
-export declare const toValRecord: <S extends SigRecord>(source: S) => ValRecord<S>;
-export interface ComputeContext<S, T> extends CmdContext {
-  target: Sig<T>;
-  fn: (s: S) => T;
-}
 export declare function compute<S, T>(source: Sig<S>, fn: (v: S) => T): DerivedSig<T>;
 export declare function compute<S extends SigRecord, T>(source: S, fn: (v: ValRecord<S>) => T): DerivedSig<T>;
 //#endregion
@@ -105,11 +102,12 @@ type _Listener<K extends keyof HTMLElementEventMap> = (this: HTMLElement, ev: HT
 export declare const on: <K extends keyof HTMLElementEventMap>(type: K, listener: _Listener<K>, options?: boolean | AddEventListenerOptions) => ToPatchItem<_Listener<K>>;
 //#endregion
 //#region src/view.d.ts
-export interface View<T = unknown, C extends CmdContext = CmdContext> {
+export interface View<T = unknown, C extends CmdContext = any> {
   type: 'view';
   node: Node;
   bind?: Bind<T, C> | undefined;
   childCommits?: Commit<unknown, CmdContext>[];
+  live?: () => Boundary | undefined;
 }
 export type AnyView = View<any, any>;
 export interface ViewContext<T> extends CmdContext {
@@ -123,11 +121,10 @@ export declare const extractBoundary: (view: View) => Boundary;
 export declare const replaceWithView: (old: Boundary, view: View) => Boundary;
 //#endregion
 //#region src/html.d.ts
-export declare const MARK: string;
 export declare const html: (strs: TemplateStringsArray, ...items: (Patch | AnyView)[]) => View;
 //#endregion
 //#region src/render.d.ts
-export declare const render: (viewArg: AnyView | (() => AnyView), node: Node) => void;
+export declare const render: (viewArg: AnyView | (() => AnyView), node: Node) => (() => void);
 //#endregion
 //#region src/repeat.d.ts
 export type RepeatProp<T> = {
@@ -135,12 +132,7 @@ export type RepeatProp<T> = {
   view: (item: T) => AnyView;
   compare?: (a: T, b: T) => boolean;
 };
-export interface Container {
-  parent: ParentNode;
-  startFence: Node;
-  endFence: Node;
-}
-export interface Track<T> {
+interface Track<T> {
   boundary: Boundary;
   bind?: AnyBind | undefined;
   item: T;

package/dist/sigula.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sigula.d.ts","names":[],"sources":["../src/boundary.ts","../src/cmd.ts","../src/eq.ts","../src/sig.bind.ts","../src/commit.ts","../src/compute.ts","../src/patch.ts","../src/view.ts","../src/html.ts","../src/render.ts","../src/repeat.ts","../src/text.ts"],"mappings":";iBAAiB;EACf,OAAO;EACP,KAAK;;qBAGM,iBAAc,GAAO;qBA0BrB,aAAU,MAAU,SAAO;qBAS3B,kBAAe,KAAS,UAAQ,MAAQ,SAAI;;;iBCxCxC;GACd;;YAES,IAAI,GAAG,UAAU,eAAe,KAAK,GAAG,SAAS;YACjD,SAAS;;;iBCJJ;EACf,OAAO;;YASG,gBAAgB;qBAKf,UAAW,GAAC,GAAK,GAAC,GAAK;;;iBCZnB,KAAK,GAAG,UAAU;EACjC,KAAK,IAAI;EACT,SAAS;EACT,KAAK,IAAI,GAAG;EACZ;EACA;;YAIU,UAAU;qBAgET,IAAI,cAAc;UACrB;UACA;EAER,YAAY,KAAK;EAIjB,OAAO;EAKP,OAAO;EAIP,YAAY,GAAG;EAKf,OAAO,GAAG;EAKV,MAAM,KAAK,GAAG,MAAM;EAIpB,QAAQ,UAAU,YAAY,MAAM,KAAK,GAAG;EAI5C,WAAW,MAAM,KAAK,GAAG;EAQzB,YAAY,KAAK,GAAG;EAIpB;;qBAKW,WAAW,WAAW,IAAI;UAC7B;EAER,YAAY,GAAG,UAAU,YAAY,MAAM,KAAK,GAAG;EAI1C;;qBASE,MAAO,GAAC,GAAK,MAAC,IAAA;qBAEd,aAAU,MAAU,cAAc;qBAKlC,aAAc,GAAG,UAAU,YAAU,KAC3C,IAAI,IAAE,SACF,GAAC,KACL,IAAI,GAAG,OACX,KAAK,GAAG;;;iBCxJM,OAAO,GAAG,UAAU;EACnC,OAAO,KAAK,GAAG,KAAK,KAAK,GAAG;EAC5B,WAAW,gBAAgB;;qBAGhB,cAAW,QAAY,gBAAgB;;;iBCLnC;GAEd,cAAc;;YAGL,UAAU,UAAU,gBAC7B,WAAW,IAAI,EAAE,WAAW,UAAU,KAAK;qBAGjC,cAAe,UAAU,WAAS,QAAU,MAAI,UAAU;iBAYtD,eAAe,GAAG,WAAW;EAE5C,QAAQ,IAAI;EACZ,KAAK,GAAG,MAAM;;wBAsDA,QAAQ,GAAG,GAAG,QAAQ,IAAI,IAAI,KAAK,GAAG,MAAM,IAAI,WAAW;wBAC3D,QAAQ,UAAU,WAAW,GAC3C,QAAQ,GACR,KAAK,GAAG,UAAU,OAAO,IACxB,WAAW;;;iBClFG,qBAAqB;EAEpC,MAAM;EACN;;iBAGe,UAAU;EACzB,QAAQ,IAAI,IAAI;EAChB,SAAS;EACT,KAAK,IAAI,GAAG;;YAEF,YAAY,MAAM,IAAI,YAAY,UAAU;YAG5C,eAAe;YACf,kBAAkB,IAAI,YAAY;iBAE7B;EACf;EACA,cAAc;;qBAGH,WAAK,cAAqB,qBAAmB;qBA8B7C,KAAM,GAAC,QAAU,IAAI,IAAI,OAAK,YAAY;qBAO1C,MAAO,GAAC,QAAU,IAAI,IAAI,OAAK,YAAY;qBAO3C,OAAQ,GAAC,QAAU,IAAI,IAAI,IAAE,gBAAgB,YAAY;YAG1D,sBACT,WAAW,sBAAsB,oBAAoB,oBAClD,mBAEE;qBAMK,QAAS,GAAC,QACb,IAAI,IAAI,IAAE,KACb,qBACJ,YAAY;qBAMF,gBAAiB,GAAC,QACrB,IAAI,IAAI,IAAE,gBAEjB,YAAY;qBAMF,cAAe,GAAC,QACnB,IAAI,IAAI,IAAE,kBAEjB,YAAY;qBAQF,gBAAiB,GAAC,QACrB,IAAI,IAAI,OAAE,qBAEjB,YAAY;YAEH,MAAM,MAAM,MAAM,MAAM,MAAM;qBAQ7B,MAAO,GAAC,QAAU,IAAI,IAAI,IAAE,IAAM,MAAM,OAAK,YAAY;KAGjE,UAAU,gBAAgB,wBAC7B,MAAM,aACN,IAAI,oBAAoB;qBAiBb,KAAM,gBAAgB,qBAAmB,MAC9C,GAAC,UACG,UAAU,IAAE,oBACF,4BACnB,YAAY,UAAU;;;iBC3IR,KAAK,aAAa,UAAU,aAAa;EACxD;EACA,MAAM;EACN,OAAO,KAAK,GAAG;EACf,eAAe,gBAAgB;;YAIrB,UAAU;iBAEL,YAAY,WAAW;EACtC,UAAU;EACV,OAAO;EACP,eAAe,gBAAgB;EAC/B,SAAS,KAAK,MAAM;;qBAeT,OAAQ,GAAC,KACf,IAAI,IAAE,SACF,KAAK,MAAM,YACnB,KAAK,GAAG,YAAY;qBAoBV,kBAAe,MAAU,SAAO;qBAEhC,kBAAe,KAAS,UAAQ,MAAQ,SAAO;;;qBC1D/C;qBAqFA,OAAI,MACT,yBAAoB,QACf,QAAQ,eAClB;;;qBC7FU,SAAM,SAAa,iBAAiB,UAAQ,MAAQ;;;YCgBrD,WAAW;EACrB,MAAM,MAAM;EACZ,OAAO,MAAM,MAAM;EACnB,WAAW,GAAG,GAAG,GAAG;;iBAGL;EACf,QAAQ;EACR,YAAY;EACZ,UAAU;;iBAGK,MAAM;EACrB,UAAU;EACV,OAAO;EACP,MAAM;EACN;EACA,eAAe,gBAAgB;EAC/B;EACA;;iBAGe,cAAc,WAAW;EACxC,MAAM,WAAW;EACjB,UAAU;EACV,QAAQ,MAAM;;qBA2VH,SAAU,GAAC,KACjB,IAAI,MAAI,MACP,WAAW,OAChB,KAAK,KAAK,cAAc;;;qBCjYd,OAAQ,GAAC,QAAU,IAAI,IAAI,OAAK,KAAK,GAAG"}
+{"version":3,"file":"sigula.d.ts","names":[],"sources":["../src/boundary.ts","../src/cmd.ts","../src/eq.ts","../src/sig.bind.ts","../src/commit.ts","../src/compute.ts","../src/patch.ts","../src/view.ts","../src/html.ts","../src/render.ts","../src/repeat.ts","../src/text.ts"],"mappings":";iBAAiB;EACf,OAAO;EACP,KAAK;;qBAGM,iBAAc,GAAO;qBAmBrB,aAAU,MAAU,SAAO;qBAS3B,kBAAe,KAAS,UAAQ,MAAQ,SAAI;;;iBCjCxC;GACd;;YAES,IAAI,GAAG,UAAU,eAAe,KAAK,GAAG,SAAS;YAGjD,SAAS;;;iBCNJ;EACf,OAAO;;YASG,gBAAgB;qBAEf,UAAW,GAAC,GAAK,GAAC,GAAK;;;iBCTnB,KAAK,GAAG,UAAU;EACjC,KAAK,IAAI;EACT,SAAS;EACT,KAAK,IAAI,GAAG;EACZ;EACA;;YAIU,UAAU;qBA8DT,IAAI,cAAc;UACrB;UACA;EAER,YAAY,KAAK;EAIjB,OAAO;EAKP,OAAO;EAIP,YAAY,GAAG;EAKf,OAAO,GAAG;EAKV,MAAM,KAAK,GAAG,MAAM;EAIpB,QAAQ,UAAU,YAAY,MAAM,KAAK,GAAG;EAI5C,WAAW,MAAM,KAAK,GAAG;EAQzB,YAAY,KAAK,GAAG;EAMpB;;qBAGW,WAAW,WAAW,IAAI;UAC7B;UACA;EAER,YAAY,GAAG,UAAU,YAAY,MAAM,KAAK,GAAG;EAa1C,QAAQ,UAAU,YAAY,MAAM,KAAK,GAAG;EAc5C;;qBAOE,MAAO,GAAC,GAAK,MAAC,IAAA;qBAEd,aAAU,MAAU,cAAc;qBAKlC,aAAc,GAAG,UAAU,YAAU,KAC3C,IAAI,IAAE,SACF,GAAC,KACL,IAAI,GAAG,OACX,KAAK,GAAG;;;iBC3KM,OAAO,GAAG,UAAU;EACnC,OAAO,KAAK,GAAG,KAAK,KAAK,GAAG;EAE5B,WAAW;;qBAGA,cAAW,QAAY,gBAAgB;;;iBCPnC;GAEd,cAAc;;YAGL,UAAU,UAAU,gBAC7B,WAAW,IAAI,EAAE,WAAW,UAAU,KAAK;wBA2D9B,QAAQ,GAAG,GAAG,QAAQ,IAAI,IAAI,KAAK,GAAG,MAAM,IAAI,WAAW;wBAC3D,QAAQ,UAAU,WAAW,GAC3C,QAAQ,GACR,KAAK,GAAG,UAAU,OAAO,IACxB,WAAW;;;iBCrEG,qBAAqB;EAEpC,MAAM;EACN;;iBAGe,UAAU;EACzB,QAAQ,IAAI,IAAI;EAChB,SAAS;EACT,KAAK,IAAI,GAAG;;YAEF,YAAY,MAAM,IAAI,YAAY,UAAU;YAG5C,eAAe;YACf,kBAAkB,IAAI,YAAY;iBAE7B;EACf;EACA,cAAc;;qBAGH,WAAK,cAAqB,qBAAmB;qBA8B7C,KAAM,GAAC,QAAU,IAAI,IAAI,OAAK,YAAY;qBAO1C,MAAO,GAAC,QAAU,IAAI,IAAI,OAAK,YAAY;qBAO3C,OAAQ,GAAC,QAAU,IAAI,IAAI,IAAE,gBAAgB,YAAY;YAG1D,sBACT,WAAW,sBAAsB,oBAAoB,oBAClD,mBAEE;qBAMK,QAAS,GAAC,QACb,IAAI,IAAI,IAAE,KACb,qBACJ,YAAY;qBAMF,gBAAiB,GAAC,QACrB,IAAI,IAAI,IAAE,gBAEjB,YAAY;qBAMF,cAAe,GAAC,QACnB,IAAI,IAAI,IAAE,kBAEjB,YAAY;qBAQF,gBAAiB,GAAC,QACrB,IAAI,IAAI,OAAE,qBAEjB,YAAY;YAEH,MAAM,MAAM,MAAM,MAAM,MAAM;qBAQ7B,MAAO,GAAC,QAAU,IAAI,IAAI,IAAE,IAAM,MAAM,OAAK,YAAY;KAGjE,UAAU,gBAAgB,wBAC7B,MAAM,aACN,IAAI,oBAAoB;qBAiBb,KAAM,gBAAgB,qBAAmB,MAC9C,GAAC,UACG,UAAU,IAAE,oBACF,4BACnB,YAAY,UAAU;;;iBC1IR,KAAK,aAAa,UAAU;EAC3C;EACA,MAAM;EACN,OAAO,KAAK,GAAG;EACf,eAAe,gBAAgB;EAC/B,aAAa;;YAIH,UAAU;iBAEL,YAAY,WAAW;EACtC,UAAU;EACV,OAAO;EACP,eAAe,gBAAgB;EAC/B,SAAS,KAAK,MAAM;;qBAeT,OAAQ,GAAC,KACf,IAAI,IAAE,SACF,KAAK,MAAM,YACnB,KAAK,GAAG,YAAY;qBAqBV,kBAAe,MAAU,SAAO;qBAEhC,kBAAe,KAAS,UAAQ,MAAQ,SAAO;;;qBC0D/C,OAAI,MACT,yBAAoB,QACf,QAAQ,eAClB;;;qBC3HU,SAAM,SACR,iBAAiB,UAAQ,MAC5B;;;YCUI,WAAW;EACrB,MAAM,MAAM;EACZ,OAAO,MAAM,MAAM;EACnB,WAAW,GAAG,GAAG,GAAG;;UASZ,MAAM;EACd,UAAU;EACV,OAAO;EACP,MAAM;EACN;EACA,eAAe,gBAAgB;EAC/B;EACA;;iBAGe,cAAc,WAAW;EACxC,MAAM,WAAW;EACjB,UAAU;EACV,QAAQ,MAAM;;qBA2VH,SAAU,GAAC,KACjB,IAAI,MAAI,MACP,WAAW,OAChB,KAAK,KAAK,cAAc;;;qBCjYd,OAAQ,GAAC,QAAU,IAAI,IAAI,OAAK,KAAK,GAAG"}

package/dist/sigula.js

@@ -1,2 +1,2 @@
-const e=e=>{let t=e.start.parentNode;if(t){if(e.start===e.end)t.removeChild(e.start);else{let n=e.start;for(;n;){let r=n.nextSibling;if(t.removeChild(n),n===e.end)break;n=r}}}},t=e=>{let t=e.nodeType===Node.DOCUMENT_FRAGMENT_NODE?{start:e.firstChild,end:e.lastChild}:{start:e,end:e};if(!t.start||!t.end)throw Error(`toBoundary: empty fragment`);return t},n=(e,n)=>{let r=t(n),i=e.start.parentNode;if(!i)throw Error(`replaceWithNode: old boundary has no parentNode`);if(e.start===e.end)i.replaceChild(n,e.start);else{let t=e.start.nextSibling;for(i.replaceChild(n,e.start);t;){let n=t.nextSibling;if(i.removeChild(t),t===e.end)break;t=n}}return r},r=e=>typeof e==`object`&&!!e&&`equals`in e&&typeof e.equals==`function`,i=e=>typeof e==`object`&&!!e,a=(e,t)=>{if(e===t)return!0;if(typeof e!=typeof t||e===null||t===null||typeof e!=`object`)return!1;if(r(e))return e.equals(t);if(Array.isArray(e)&&Array.isArray(t)){if(e.length!==t.length)return!1;for(let n=0;n<e.length;n++)if(!a(e[n],t[n]))return!1;return!0}if(e instanceof Date&&t instanceof Date)return e.getTime()===t.getTime();if(e instanceof RegExp&&t instanceof RegExp)return e.toString()===t.toString();if(e instanceof Map&&t instanceof Map){if(e.size!==t.size)return!1;for(let[n,r]of e)if(!t.has(n)||!a(r,t.get(n)))return!1;return!0}if(e instanceof Set&&t instanceof Set){if(e.size!==t.size)return!1;let n=Array.from(e),r=Array.from(t);return a(n,r)}if(Object.is(e,t))return!0;if(!i(e)||!i(t))return!1;let n=Object.keys(e),o=Object.keys(t);if(n.length!==o.length)return!1;for(let r of n)if(!Object.hasOwn(t,r)||!a(e[r],t[r]))return!1;return!0},o=new class{_binds=[];head=0;running=!1;scheduled=!1;addAll(e){for(let t of e)t.queued||(t.queued=!0,this._binds.push(t));return this._binds.length>this.head&&this.kick(),this}kick(){this.running||this.scheduled||(this.scheduled=!0,queueMicrotask(()=>{this.running=!0,this.scheduled=!1,this.flush()}))}flush(){this.running=!0;try{for(;this.head<this._binds.length;){let e=this._binds[this.head++];if(e)try{let{removed:t,sig:n,context:r,cmd:i}=e;t||i(n.get(),r)}catch(t){console.error(`[Queue] task failed:`,t,e)}finally{e.queued=!1}}}finally{this.running=!1,this.head<this._binds.length?(this._binds=this._binds.slice(this.head),this.head=0,this.kick()):(this._binds.length=0,this.head=0)}}};var s=class e{_val;_binds=[];constructor(e){this._val=e}equals(t){return t instanceof e&&a(this.get(),t.get())}get(){return this._val}forceUpdate(e){this._val=e,o.addAll(this._binds)}update(e){a(e,this._val)||this.forceUpdate(e)}trans(e){this.update(e(this._val))}addBind(e){this._binds.push(e)}removeBind(e){let t=this._binds.indexOf(e);t>=0&&this._binds.splice(t,1),this._binds.length===0&&this.cleanup()}getBinds(){return this._binds}cleanup(){}},c=class extends s{_fromBinds=[];addFromBind(e){this._fromBinds.push(e)}cleanup(){this._fromBinds.forEach(e=>{u(e)})}};const l=e=>new s(e),u=e=>{e.removed=!0,e.sig.removeBind(e)},d=(e,t,n)=>{let r={sig:e,context:t,cmd:n,removed:!1,queued:!1};return e.addBind(r),r},f=e=>{e.binds&&(Array.isArray(e.binds)?e.binds.forEach(e=>{u(e)}):u(e.binds)),e.children?.forEach(e=>{f(e)})},p=e=>{let t=Object.keys(e),n={};for(let r=0;r<t.length;r++){let i=t[r];i&&e[i]&&(n[i]=e[i].get())}return n},m=(e,t)=>{let n=t.fn(e);t.target.update(n)},h=(e,t)=>{let n=p(t.source),r=t.fn(n);t.target.update(r)},g=(e,t)=>{let n=new c(t(e.get())),r=d(e,{target:n,fn:t},m);return n.addFromBind(r),n},_=(e,t)=>{let n=new c(t(p(e))),r={source:e,target:n,fn:t},i=Object.keys(e);for(let t=0;t<i.length;t++){let a=i[t];if(a&&e[a]){let t=d(e[a],r,h);n.addFromBind(t)}}return n};function v(e,t){return e instanceof s?g(e,t):_(e,t)}const y=(e,t)=>{let n=e[t];if(n===void 0)throw RangeError(`index ${t} out of range`);return n},b=`@sig_${Math.random().toFixed(9).slice(2)}`,x=/* @__PURE__ */ new WeakMap,S=document.createTreeWalker(document,NodeFilter.SHOW_ELEMENT|NodeFilter.SHOW_COMMENT),C=e=>e.type===`patch`?b:`<!--${b}-->`,ee=e=>e.hasAttribute(b),te=e=>e.removeAttribute(b),ne=e=>e.data.trim()===b,re=(e,t)=>(t.replaceWith(e.node),{binds:e.bind,children:e.childCommits}),ie=(e,t)=>{let n=[];return e.toPatchItems.forEach(e=>{let r=e(t);r.source instanceof s?(r.cmd(r.source.get(),r.context),n.push(d(r.source,r.context,r.cmd))):r.cmd(r.source,r.context)}),{binds:n}},w=(e,t,n,r,i)=>{S.currentNode=e;let a=S.nextNode(),o=0,s=0;for(;a!==null&&s<t.length;)r(a,o,s)&&(n.push({item:y(t,s),node:a}),i&&i.push(o),s++,a.nodeType===Node.ELEMENT_NODE&&te(a)),a=S.nextNode(),o++;S.currentNode=document},ae=(e,...t)=>{let n,r=[],i=x.get(e);if(i)n=document.importNode(i.el.content,!0),t&&t.length>0&&w(n,t,r,(e,t,n)=>t===i.indexes[n]);else{let i=document.createElement(`template`);i.innerHTML=oe(e,...t);let a={el:i,indexes:[]};n=document.importNode(i.content,!0),t&&t.length>0&&w(n,t,r,e=>e.nodeType===Node.ELEMENT_NODE?ee(e):e.nodeType===Node.COMMENT_NODE&&ne(e),a.indexes),x.set(e,a)}if(r.length!==t.length)throw Error(`html: unmatched interpolation; patch() must be in attribute position`);let a=[];return r.forEach(({item:e,node:t})=>{e.type===`patch`?a.push(ie(e,t)):e.type===`view`&&a.push(re(e,t))}),{type:`view`,node:n,childCommits:a}},oe=(e,...t)=>{let n=e[0]??``;for(let r=0;r<t.length;r++)n+=C(y(t,r))+(e[r+1]??``);return n},T=(...e)=>({type:`patch`,toPatchItems:e}),E=(e,t,n)=>r=>({source:e,context:t?{node:r,extra:t}:{node:r},cmd:n}),D=e=>{let t=e.extra?.[0];if(!t)throw Error(`patch: empty key`);return t},se=(e,t)=>{t.node.id=String(e)},ce=e=>E(e,void 0,se),le=(e,t)=>{t.node.value=String(e)},O=e=>E(e,void 0,le),k=(e,t)=>{t.node.setAttribute(D(t),String(e))},A=(e,t)=>E(e,[t],k),j=(e,t)=>{t.node.style[D(t)]=String(e)},M=(e,t)=>E(e,[t],j),N=(e,t)=>{t.node.style.setProperty(D(t),String(e))},P=(e,t)=>E(e,[t],N),F=(e,t)=>{t.node.classList.toggle(D(t),!!e)},I=(e,t)=>E(e,[t],F),L=(e,t)=>{t.extra?.forEach(n=>{t.node.classList.toggle(n,!!e)})},R=(e,...t)=>E(e,t,L),z=(e,t)=>{let n=t.extra?.[0];if(!n)throw Error(`patch: no function`);n(t.node,e)},B=(e,t)=>E(e,[t],z),V=(e,t)=>{let n=t.extra?.[0],r=t.extra?.[1];if(!n)throw Error(`patch: no event type`);t.node.addEventListener(n,e,r)},H=(e,t,n)=>E(t,[e,n],V),ue=(e,t)=>{let n=typeof e==`function`?e():e;t.appendChild(n.node)},U=(e,t)=>{let n=t.viewFn(e),r=G(t.boundary,n);t.bind&&u(t.bind),t.childCommits?.forEach(e=>{f(e)}),t.boundary=r,t.bind=n.bind,t.childCommits=n.childCommits},de=(e,t)=>{let n=t(e.get()),r={boundary:W(n),bind:n.bind,viewFn:t,childCommits:n.childCommits},i=d(e,r,U);return{...n,bind:i}},W=e=>t(e.node),G=(e,t)=>n(e,t.node),K=t=>{e(t.boundary),t.bind&&u(t.bind),t.childCommits?.forEach(e=>{f(e)}),t.cleaned=!0},fe=(e,t)=>{if(!Array.isArray(e)||e.length===0){let e=document.createDocumentFragment();e.appendChild(document.createComment(`empty-list`)),t.boundary=n(t.boundary,e),t.tracks.forEach(K),t.tracks=[];return}let r=[];if(!Array.isArray(t.tracks)||t.tracks.length===0){let i=$(e,t.prop,r);t.boundary=n(t.boundary,i),t.tracks=r;return}let i=t.boundary.start,o=t.boundary.end,s=i.parentNode;if(!s)throw Error(`no parent node`);let c=t.prop.compare??a,l=e.map(e=>t.prop.key(e)),u=t.tracks;if(u.length===e.length&&u.every((t,n)=>{let r=e[n];return t.key===l[n]&&c(t.item,r)}))return;let d=document.createComment(`repeat-start-fence`),f=document.createComment(`repeat-end-fence`);s.insertBefore(d,i),s.insertBefore(f,o.nextSibling);let p={parent:s,startFence:d,endFence:f},m=u.map(e=>e.key),h,g,_=0,v=t.tracks.length-1,b=0,x=e.length-1;for(;_<=v&&b<=x;)if(t.tracks[_]?.checked)_++;else if(t.tracks[v]?.checked)v--;else if(t.tracks[_]?.key===l[b])r[b]=Q(y(t.tracks,_),y(e,b),t.prop,c),_++,b++;else if(t.tracks[v]?.key===l[x])r[x]=Q(y(t.tracks,v),y(e,x),t.prop,c),v--,x--;else if(t.tracks[_]?.key===l[x])r[x]=Q(y(t.tracks,_),y(e,x),t.prop,c),X(p,y(r,x),pe(p,r[x+1])),_++,x--;else if(t.tracks[v]?.key===l[b])r[b]=Q(y(t.tracks,v),y(e,b),t.prop,c),X(p,y(r,b),J(p,r[b-1])),v--,b++;else if((h===void 0||g===void 0)&&(h=q(l,b,x),g=q(m,_,v)),!h.has(m[_]))K(y(t.tracks,_)),_++;else if(!h.has(m[v]))K(y(t.tracks,v)),v--;else{let n=g.get(l[b]),i=n===void 0?null:t.tracks[n];i?(r[b]=Q(i,y(e,b),t.prop,c),X(p,y(r,b),J(p,r[b-1])),i.checked=!0):r[b]=Z(p,y(e,b),t.prop,J(p,r[b-1])),b++}for(;b<=x;)r[b]=Z(p,y(e,b),t.prop,J(p,r[b-1])),b++;for(;_<=v;)!t.tracks[_]?.cleaned&&!t.tracks[_]?.checked&&K(y(t.tracks,_)),_++;if(!p.startFence.nextSibling||!p.endFence.previousSibling)throw Error(`error container fences`);t.boundary={start:p.startFence.nextSibling,end:p.endFence.previousSibling},p.parent.removeChild(p.startFence),p.parent.removeChild(p.endFence),t.tracks=r},q=(e,t,n)=>{let r=/* @__PURE__ */ new Map;for(let i=t;i<=n;i++)r.set(e[i],i);return r},pe=(e,t)=>t?t.boundary.start:e.endFence,J=(e,t)=>{let n=t?t.boundary.end:e.startFence;if(!n.nextSibling)throw Error(`no after fence`);return n.nextSibling},Y=(e,t,n)=>{e.moveBefore?e.moveBefore(t,n):e.insertBefore(t,n)},X=(e,t,n)=>{let r=e.parent;if(t.boundary.start===t.boundary.end)Y(r,t.boundary.start,n);else{let e=t.boundary.start;for(;e;){let i=e.nextSibling;if(Y(r,e,n),e===t.boundary.end)break;e=i}}},Z=(e,t,n,r)=>{let i=n.view(t),a=W(i);return e.parent.insertBefore(i.node,r),{key:n.key(t),boundary:a,bind:i.bind,childCommits:i.childCommits,item:t}},Q=(e,t,n,r)=>{if(r(e.item,t))return{...e,checked:!1,cleaned:!1};let i=n.view(t),a=G(e.boundary,i);return K(e),{key:n.key(t),boundary:a,bind:i.bind,childCommits:i.childCommits,item:t}},$=(e,t,n)=>{let r=document.createDocumentFragment();return e.forEach(e=>{let i=t.view(e),a=t.key(e),o=W(i);n.push({key:a,boundary:o,bind:i.bind,item:e,childCommits:i.childCommits}),r.appendChild(i.node)}),r.childNodes.length===0&&r.appendChild(document.createComment(`empty-list`)),r},me=(e,n)=>{let r=[],i=$(e.get(),n,r),a={prop:n,tracks:r,boundary:t(i)};return{type:`view`,node:i,bind:d(e,a,fe)}},he=(e,t)=>{t.node.textContent=String(e)},ge=e=>{let t=document.createTextNode(e instanceof s?String(e.get()):String(e)),n={node:t};return{type:`view`,node:t,bind:e instanceof s?d(e,n,he):void 0}};export{c as DerivedSig,b as MARK,s as Sig,B as act,A as attr,f as cleanCommit,v as compute,d as createBind,W as extractBoundary,ae as html,ce as id,a as isEqual,H as on,T as patch,u as removeBind,e as removeBoundary,ue as render,me as repeat,n as replaceWithNode,G as replaceWithView,l as sig,M as style,P as styleProperty,ge as text,t as toBoundary,p as toValRecord,I as toggleClass,R as toggleClasses,O as val,de as view};
+const e=e=>{let t=e.start.parentNode;if(t){if(e.start===e.end)t.removeChild(e.start);else{let n=e.start;for(;n;){let r=n.nextSibling;if(t.removeChild(n),n===e.end)break;n=r}}}},t=e=>{let t=e.nodeType===Node.DOCUMENT_FRAGMENT_NODE?{start:e.firstChild,end:e.lastChild}:{start:e,end:e};if(!t.start||!t.end)throw Error(`toBoundary: empty fragment`);return t},n=(e,n)=>{let r=t(n),i=e.start.parentNode;if(!i)throw Error(`replaceWithNode: old boundary has no parentNode`);if(e.start===e.end)i.replaceChild(n,e.start);else{let t=e.start.nextSibling;for(i.replaceChild(n,e.start);t;){let n=t.nextSibling;if(i.removeChild(t),t===e.end)break;t=n}}return r},r=e=>typeof e==`object`&&!!e&&`equals`in e&&typeof e.equals==`function`,i=(e,t)=>{if(e===t)return!0;if(typeof e!=typeof t||e===null||t===null||typeof e!=`object`)return!1;if(r(e))return e.equals(t);if(Array.isArray(e)&&Array.isArray(t)){if(e.length!==t.length)return!1;for(let n=0;n<e.length;n++)if(!i(e[n],t[n]))return!1;return!0}if(e instanceof Date&&t instanceof Date)return e.getTime()===t.getTime();if(e instanceof RegExp&&t instanceof RegExp)return e.toString()===t.toString();if(e instanceof Map&&t instanceof Map){if(e.size!==t.size)return!1;for(let[n,r]of e)if(!t.has(n)||!i(r,t.get(n)))return!1;return!0}if(e instanceof Set&&t instanceof Set){if(e.size!==t.size)return!1;let n=Array.from(e),r=Array.from(t);return i(n,r)}if(Object.getPrototypeOf(e)!==Object.getPrototypeOf(t))return!1;let n=e,a=t,o=Object.keys(n),s=Object.keys(a);if(o.length!==s.length)return!1;for(let e=0;e<o.length;e++){let t=o[e];if(!Object.hasOwn(a,t)||!i(n[t],a[t]))return!1}return!0},a=new class{_binds=[];head=0;running=!1;scheduled=!1;addAll(e){for(let t of e)t.queued||(t.queued=!0,this._binds.push(t));return this._binds.length>this.head&&this.kick(),this}kick(){this.running||this.scheduled||(this.scheduled=!0,queueMicrotask(()=>{this.running=!0,this.scheduled=!1,this.flush()}))}flush(){this.running=!0;try{for(;this.head<this._binds.length;){let e=this._binds[this.head++];try{let{removed:t,sig:n,context:r,cmd:i}=e;t||i(n.get(),r)}catch(t){console.error(`[Queue] task failed:`,t,e)}finally{e.queued=!1}}}finally{this.running=!1,this.head<this._binds.length?(this._binds=this._binds.slice(this.head),this.head=0,this.kick()):(this._binds.length=0,this.head=0)}}};var o=class e{_val;_binds=[];constructor(e){this._val=e}equals(t){return t instanceof e&&i(this.get(),t.get())}get(){return this._val}forceUpdate(e){this._val=e,a.addAll(this._binds)}update(e){i(e,this._val)||this.forceUpdate(e)}trans(e){this.update(e(this._val))}addBind(e){this._binds.push(e)}removeBind(e){let t=this._binds.indexOf(e);t>=0&&this._binds.splice(t,1),this._binds.length===0&&this.cleanup()}getBinds(){return this._binds}cleanup(){}},s=class extends o{_fromBinds=[];_linked=!0;addFromBind(e){this._fromBinds.push(e)}addBind(e){if(super.addBind(e),this._linked)return;this._linked=!0;for(let e=0;e<this._fromBinds.length;e++){let t=this._fromBinds[e];this._fromBinds[e]=u(t.sig,t.context,t.cmd)}let t=this._fromBinds[0];t&&t.cmd(t.sig.get(),t.context)}cleanup(){if(this._linked){this._linked=!1;for(let e of this._fromBinds)l(e)}}};const c=e=>new o(e),l=e=>{e.removed=!0,e.sig.removeBind(e)},u=(e,t,n)=>{let r={sig:e,context:t,cmd:n,removed:!1,queued:!1};return e.addBind(r),r},d=e=>{e.binds&&(Array.isArray(e.binds)?e.binds.forEach(e=>{l(e)}):l(e.binds)),e.children?.forEach(e=>{d(e)})},f=(e,t)=>{t.target.update(t.fn(e))},p=(e,t)=>{let n={};for(let[e,r]of t.entries)n[e]=r.get();t.target.update(t.fn(n))},m=(e,t)=>{let n=new s(t(e.get())),r={target:n,fn:t};return n.addFromBind(u(e,r,f)),n},h=(e,t)=>{let n=[],r={};for(let[t,i]of Object.entries(e))t&&i&&(n.push([t,i]),r[t]=i.get());let i=new s(t(r)),a={target:i,fn:t,entries:n};for(let e of n)i.addFromBind(u(e[1],a,p));return i};function g(e,t){return e instanceof o?m(e,t):h(e,t)}const _=(e,t)=>{let n=e[t];if(n===void 0)throw RangeError(`index ${t} out of range`);return n},v=`@sig_${Math.random().toFixed(9).slice(2)}`,y=/* @__PURE__ */ new WeakMap;let b;const x=()=>(b??=document.createTreeWalker(document,NodeFilter.SHOW_ELEMENT|NodeFilter.SHOW_COMMENT),b),ee=e=>e.type===`patch`?v:`<!--${v}-->`,te=e=>{if(e.length>31){let t=``;for(let n of e)t+=n.type===`patch`?`p`:`v`;return t}let t=0;for(let n=0;n<e.length;n++)e[n]?.type===`patch`&&(t|=1<<n);return t},ne=e=>e.hasAttribute(v),re=e=>e.removeAttribute(v),ie=e=>e.data.trim()===v,ae=(e,t)=>(t.replaceWith(e.node),{binds:e.bind,children:e.childCommits}),oe=(e,t)=>{let n=[];return e.toPatchItems.forEach(e=>{let r=e(t);r.source instanceof o?(r.cmd(r.source.get(),r.context),n.push(u(r.source,r.context,r.cmd))):r.cmd(r.source,r.context)}),{binds:n}},S=(e,t,n,r,i)=>{let a=x();a.currentNode=e;let o=a.nextNode(),s=0,c=0;for(;o!==null&&c<t.length;)r(o,s,c)&&(n.push({item:_(t,c),node:o}),i&&i.push(s),c++,o.nodeType===Node.ELEMENT_NODE&&re(o)),o=a.nextNode(),s++;a.currentNode=document},se=(e,...n)=>{let r=e.length-1;if(n.length!==r)throw Error(`html: expected ${r} interpolation${r===1?``:`s`}, got ${n.length}`);let i,a=[],o=te(n),s=y.get(e);if(s?.shape===o)i=document.importNode(s.el.content,!0),n&&n.length>0&&S(i,n,a,(e,t,n)=>t===s.indexes[n]);else{let t=document.createElement(`template`);t.innerHTML=C(e,...n);let r={el:t,indexes:[],shape:o};i=document.importNode(t.content,!0),n&&n.length>0&&S(i,n,a,e=>e.nodeType===Node.ELEMENT_NODE?ne(e):e.nodeType===Node.COMMENT_NODE&&ie(e),r.indexes),y.set(e,r)}if(a.length!==n.length)throw Error(`html: unmatched interpolation; patch() must be in attribute position`);let c=[];a.forEach(({item:e,node:t})=>{e.type===`patch`?c.push(oe(e,t)):e.type===`view`&&c.push(ae(e,t))});let l=i.firstChild?t(i):void 0;return{type:`view`,node:i,childCommits:c,live:()=>l}},C=(e,...t)=>{let n=e[0]??``;for(let r=0;r<t.length;r++)n+=ee(_(t,r))+(e[r+1]??``);return n},w=(...e)=>({type:`patch`,toPatchItems:e}),T=(e,t,n)=>r=>({source:e,context:t?{node:r,extra:t}:{node:r},cmd:n}),E=e=>{let t=e.extra?.[0];if(!t)throw Error(`patch: empty key`);return t},ce=(e,t)=>{t.node.id=String(e)},le=e=>T(e,void 0,ce),D=(e,t)=>{t.node.value=String(e)},O=e=>T(e,void 0,D),k=(e,t)=>{t.node.setAttribute(E(t),String(e))},A=(e,t)=>T(e,[t],k),j=(e,t)=>{t.node.style[E(t)]=String(e)},M=(e,t)=>T(e,[t],j),N=(e,t)=>{t.node.style.setProperty(E(t),String(e))},P=(e,t)=>T(e,[t],N),F=(e,t)=>{t.node.classList.toggle(E(t),!!e)},I=(e,t)=>T(e,[t],F),L=(e,t)=>{t.extra?.forEach(n=>{t.node.classList.toggle(n,!!e)})},R=(e,...t)=>T(e,t,L),z=(e,t)=>{let n=t.extra?.[0];if(!n)throw Error(`patch: no function`);n(t.node,e)},B=(e,t)=>T(e,[t],z),V=(e,t)=>{let n=t.extra?.[0],r=t.extra?.[1];if(!n)throw Error(`patch: no event type`);t.node.addEventListener(n,e,r)},ue=(e,t,n)=>T(t,[e,n],V),H=(t,n)=>{let r=typeof t==`function`?t():t;n.appendChild(r.node);let i={binds:r.bind,children:r.childCommits};return()=>{d(i);let t=r.live?.();t&&e(t)}},U=(e,t)=>{let n=t.viewFn(e),r=G(t.boundary,n);t.bind&&l(t.bind),t.childCommits?.forEach(e=>{d(e)}),t.boundary=r,t.bind=n.bind,t.childCommits=n.childCommits},de=(e,t)=>{let n=t(e.get()),r={boundary:W(n),bind:n.bind,viewFn:t,childCommits:n.childCommits},i=u(e,r,U);return{...n,bind:i,live:()=>r.boundary}},W=e=>t(e.node),G=(e,t)=>n(e,t.node),K=t=>{e(t.boundary),t.bind&&l(t.bind),t.childCommits?.forEach(e=>{d(e)}),t.cleaned=!0},fe=(e,t)=>{if(!Array.isArray(e)||e.length===0){let e=document.createDocumentFragment();e.appendChild(document.createComment(`empty-list`)),t.boundary=n(t.boundary,e),t.tracks.forEach(K),t.tracks=[];return}let r=[];if(!Array.isArray(t.tracks)||t.tracks.length===0){let i=$(e,t.prop,r);t.boundary=n(t.boundary,i),t.tracks=r;return}let a=t.boundary.start,o=t.boundary.end,s=a.parentNode;if(!s)throw Error(`no parent node`);let c=t.prop.compare??i,l=e.map(e=>t.prop.key(e)),u=t.tracks;if(u.length===e.length&&u.every((t,n)=>{let r=e[n];return t.key===l[n]&&c(t.item,r)}))return;let d=document.createComment(`repeat-start-fence`),f=document.createComment(`repeat-end-fence`);s.insertBefore(d,a),s.insertBefore(f,o.nextSibling);let p={parent:s,startFence:d,endFence:f},m=u.map(e=>e.key),h,g,v=0,y=t.tracks.length-1,b=0,x=e.length-1;for(;v<=y&&b<=x;)if(t.tracks[v]?.checked)v++;else if(t.tracks[y]?.checked)y--;else if(t.tracks[v]?.key===l[b])r[b]=Q(_(t.tracks,v),_(e,b),t.prop,c),v++,b++;else if(t.tracks[y]?.key===l[x])r[x]=Q(_(t.tracks,y),_(e,x),t.prop,c),y--,x--;else if(t.tracks[v]?.key===l[x])r[x]=Q(_(t.tracks,v),_(e,x),t.prop,c),X(p,_(r,x),pe(p,r[x+1])),v++,x--;else if(t.tracks[y]?.key===l[b])r[b]=Q(_(t.tracks,y),_(e,b),t.prop,c),X(p,_(r,b),J(p,r[b-1])),y--,b++;else if((h===void 0||g===void 0)&&(h=q(l,b,x),g=q(m,v,y)),!h.has(m[v]))K(_(t.tracks,v)),v++;else if(!h.has(m[y]))K(_(t.tracks,y)),y--;else{let n=g.get(l[b]),i=n===void 0?null:t.tracks[n];i?(r[b]=Q(i,_(e,b),t.prop,c),X(p,_(r,b),J(p,r[b-1])),i.checked=!0):r[b]=Z(p,_(e,b),t.prop,J(p,r[b-1])),b++}for(;b<=x;)r[b]=Z(p,_(e,b),t.prop,J(p,r[b-1])),b++;for(;v<=y;)!t.tracks[v]?.cleaned&&!t.tracks[v]?.checked&&K(_(t.tracks,v)),v++;if(!p.startFence.nextSibling||!p.endFence.previousSibling)throw Error(`error container fences`);t.boundary={start:p.startFence.nextSibling,end:p.endFence.previousSibling},p.parent.removeChild(p.startFence),p.parent.removeChild(p.endFence),t.tracks=r},q=(e,t,n)=>{let r=/* @__PURE__ */ new Map;for(let i=t;i<=n;i++)r.set(e[i],i);return r},pe=(e,t)=>t?t.boundary.start:e.endFence,J=(e,t)=>{let n=t?t.boundary.end:e.startFence;if(!n.nextSibling)throw Error(`no after fence`);return n.nextSibling},Y=(e,t,n)=>{e.moveBefore?e.moveBefore(t,n):e.insertBefore(t,n)},X=(e,t,n)=>{let r=e.parent;if(t.boundary.start===t.boundary.end)Y(r,t.boundary.start,n);else{let e=t.boundary.start;for(;e;){let i=e.nextSibling;if(Y(r,e,n),e===t.boundary.end)break;e=i}}},Z=(e,t,n,r)=>{let i=n.view(t),a=W(i);return e.parent.insertBefore(i.node,r),{key:n.key(t),boundary:a,bind:i.bind,childCommits:i.childCommits,item:t}},Q=(e,t,n,r)=>{if(r(e.item,t))return{...e,checked:!1,cleaned:!1};let i=n.view(t),a=G(e.boundary,i);return K(e),{key:n.key(t),boundary:a,bind:i.bind,childCommits:i.childCommits,item:t}},$=(e,t,n)=>{let r=document.createDocumentFragment();return e.forEach(e=>{let i=t.view(e),a=t.key(e),o=W(i);n.push({key:a,boundary:o,bind:i.bind,item:e,childCommits:i.childCommits}),r.appendChild(i.node)}),r.childNodes.length===0&&r.appendChild(document.createComment(`empty-list`)),r},me=(e,n)=>{let r=[],i=$(e.get(),n,r),a={prop:n,tracks:r,boundary:t(i)};return{type:`view`,node:i,bind:u(e,a,fe),live:()=>a.boundary}},he=(e,t)=>{t.node.textContent=String(e)},ge=e=>{let t=document.createTextNode(e instanceof o?String(e.get()):String(e)),n={node:t};return{type:`view`,node:t,bind:e instanceof o?u(e,n,he):void 0}};export{s as DerivedSig,o as Sig,B as act,A as attr,d as cleanCommit,g as compute,u as createBind,W as extractBoundary,se as html,le as id,i as isEqual,ue as on,w as patch,l as removeBind,e as removeBoundary,H as render,me as repeat,n as replaceWithNode,G as replaceWithView,c as sig,M as style,P as styleProperty,ge as text,t as toBoundary,I as toggleClass,R as toggleClasses,O as val,de as view};
 //# sourceMappingURL=sigula.js.map

package/dist/sigula.js.map

@@ -1 +1 @@
-{"version":3,"file":"sigula.js","names":["removeBoundary","parent","b","next","toBoundary","node","replaceWithNode","newBoundary","old","n","isEquatable","value","isRecord","v","isEqual","a","i","key","val","arrA","arrB","aKeys","bKeys","QUEUE","bind","binds","removed","cmd","sig","context","err","Sig","fn","index","DerivedSig","removeBind","createBind","cleanCommit","commit","child","toValRecord","keys","source","vals","k","computeCmd","res","ctx","s","computeRecordCmd","_compute","target","_computeRecord","compute","at","arr","MARK","tplCache","walker","_toMark","item","_hasMark","el","_rmMark","_isView","commitView","view","commitPatch","patch","toPatchItem","_scan","frag","nodeIndex","itemIndex","items","hit","wraps","indexes","html","exist","strs","template","_text","tpl","commits","parts","text","toPatchItems","_toPatchItem","extra","elem","_key","idCmd","id","valCmd","attrCmd","attr","styleCmd","style","stylePropertyCmd","styleProperty","toggleClassCmd","toggleClass","token","toggleClassesCmd","toggleClasses","tokens","actCmd","act","onCmd","type","options","listener","on","render","viewArg","viewCmd","replaceWithView","viewFn","extractBoundary","_cleanTrack","track","repeatCmd","newFrag","newTracks","_init","start","end","compare","newKeys","tracks","startFence","endFence","container","oldKeys","newKeyToIndexMap","oldKeyToIndexMap","oldHead","oldTail","newHead","newTail","_setTrack","_moveTrack","_beforeFence","_afterFence","_generateMap","oldIndex","oldTrack","_insertNewTrack","map","list","_mvNodeBefore","fence","prop","boundary","repeat","textCmd"],"sources":["../src/boundary.ts","../src/eq.ts","../src/sig.bind.ts","../src/commit.ts","../src/compute.ts","../src/utils.ts","../src/html.ts","../src/patch.ts","../src/render.ts","../src/view.ts","../src/repeat.ts","../src/text.ts"],"sourcesContent":["export interface Boundary {\n  start: Node;\n  end: Node;\n}\n\nexport const removeBoundary = (b: Boundary) => {\n  const parent = b.start.parentNode;\n  if (!parent) {\n    // console.warn('boundary has no parent');\n    return;\n  }\n\n  // if (b.start === b.end) b.start.parentNode?.removeChild(b.start);\n  if (b.start === b.end) parent.removeChild(b.start);\n  else {\n    // const range = document.createRange();\n    // range.setStartBefore(b.start);\n    // range.setEndAfter(b.end);\n    // range.deleteContents();\n    //\n    // faster without range\n    let n: Node | null = b.start;\n    while (n) {\n      const next: Node | null = n.nextSibling;\n      parent.removeChild(n);\n      if (n === b.end) break;\n      n = next;\n    }\n  }\n};\n\nexport const toBoundary = (node: Node): Boundary => {\n  const b =\n    node.nodeType === Node.DOCUMENT_FRAGMENT_NODE\n      ? {start: node.firstChild, end: node.lastChild}\n      : {start: node, end: node};\n  if (!b.start || !b.end) throw new Error('toBoundary: empty fragment');\n  return b as Boundary;\n};\n\nexport const replaceWithNode = (old: Boundary, node: Node) => {\n  const newBoundary = toBoundary(node);\n  const parent = old.start.parentNode;\n  if (!parent)\n    throw new Error('replaceWithNode: old boundary has no parentNode');\n\n  if (old.start === old.end) {\n    parent.replaceChild(node, old.start);\n  } else {\n    let n = old.start.nextSibling;\n    parent.replaceChild(node, old.start);\n    while (n) {\n      const next = n.nextSibling;\n      parent.removeChild(n);\n      if (n === old.end) break;\n      n = next;\n    }\n  }\n\n  // if (old.start === old.end) {\n  //   parent.replaceChild(node, old.start);\n  // } else {\n  //   console.log('-----------------------> replace with ndoe + range');\n  //   const doc = old.start.ownerDocument ?? document;\n  //   const range = doc.createRange();\n  //   range.setStartBefore(old.start);\n  //   range.setEndAfter(old.end);\n  //   range.deleteContents();\n  //   range.insertNode(node);\n  // }\n  return newBoundary;\n};\n","export interface Equatable {\n  equals(other: unknown): boolean;\n}\n\nconst isEquatable = (value: unknown): value is Equatable =>\n  typeof value === 'object' &&\n  value !== null &&\n  'equals' in value &&\n  typeof value.equals === 'function';\n\nexport type UnknownRecord = Record<string, unknown>;\n\nconst isRecord = (v: unknown): v is UnknownRecord =>\n  typeof v === 'object' && v !== null;\n\nexport const isEqual = <T>(a: T, b: T): boolean => {\n  if (a === b) return true;\n  if (typeof a !== typeof b) return false;\n\n  if (a === null || b === null || typeof a !== 'object') return false;\n\n  if (isEquatable(a)) return a.equals(b);\n\n  // may let Array always return false\n  // if (Array.isArray(a) || Array.isArray(b)) return false;\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (!isEqual(a[i], b[i])) return false;\n    }\n    return true;\n  }\n\n  // Date\n  if (a instanceof Date && b instanceof Date)\n    return a.getTime() === b.getTime();\n\n  // RegExp\n  if (a instanceof RegExp && b instanceof RegExp) {\n    return a.toString() === b.toString();\n  }\n\n  // Map\n  if (a instanceof Map && b instanceof Map) {\n    if (a.size !== b.size) return false;\n    for (const [key, val] of a) {\n      if (!b.has(key) || !isEqual(val, b.get(key))) return false;\n    }\n    return true;\n  }\n\n  // Set\n  if (a instanceof Set && b instanceof Set) {\n    if (a.size !== b.size) return false;\n    const arrA = Array.from(a);\n    const arrB = Array.from(b);\n    return isEqual(arrA, arrB);\n  }\n\n  // Object & Record\n  if (Object.is(a, b)) return true;\n  if (!isRecord(a) || !isRecord(b)) return false;\n\n  const aKeys = Object.keys(a);\n  const bKeys = Object.keys(b);\n  if (aKeys.length !== bKeys.length) return false;\n\n  for (const key of aKeys) {\n    if (!Object.hasOwn(b, key)) return false;\n    if (!isEqual(a[key], b[key])) return false;\n  }\n\n  return true;\n};\n","import type {Cmd, CmdContext} from './cmd';\nimport {type Equatable, isEqual} from './eq';\n\nexport interface Bind<T, C extends CmdContext> {\n  sig: Sig<T>;\n  context: C;\n  cmd: Cmd<T, C>;\n  removed: boolean;\n  queued?: boolean;\n}\n\n// biome-ignore lint/suspicious/noExplicitAny: any bind\nexport type AnyBind = Bind<any, any>;\n\nclass Queue {\n  private _binds: AnyBind[] = [];\n  private head = 0;\n  private running = false;\n  private scheduled = false;\n\n  addAll(binds: readonly AnyBind[]): this {\n    for (const bind of binds) {\n      if (bind.queued) continue;\n      bind.queued = true;\n      this._binds.push(bind);\n    }\n    if (this._binds.length > this.head) this.kick();\n    return this;\n  }\n\n  private kick(): void {\n    if (this.running || this.scheduled) return;\n    this.scheduled = true;\n    queueMicrotask(() => {\n      this.running = true;\n      this.scheduled = false;\n      this.flush();\n    });\n  }\n\n  private flush(): void {\n    this.running = true;\n    try {\n      while (this.head < this._binds.length) {\n        const bind = this._binds[this.head++];\n        if (bind) {\n          try {\n            const {removed, sig, context, cmd} = bind;\n            if (!removed) cmd(sig.get(), context);\n          } catch (err) {\n            console.error('[Queue] task failed:', err, bind);\n          } finally {\n            // re-arm after running: cmd reads sig.get() at call time, so a bind\n            // that runs after a write already sees the newest value and must\n            // not re-run, while one that ran before it has to be queued again\n            bind.queued = false;\n          }\n        }\n      }\n    } finally {\n      this.running = false;\n      if (this.head < this._binds.length) {\n        // almost impossible in js/ts\n        this._binds = this._binds.slice(this.head);\n        this.head = 0;\n        this.kick();\n      } else {\n        this._binds.length = 0;\n        this.head = 0;\n      }\n    }\n  }\n}\n\nconst QUEUE = new Queue();\n\nexport class Sig<T> implements Equatable {\n  private _val: T;\n  private _binds: Bind<T, CmdContext>[] = [];\n\n  constructor(val: T) {\n    this._val = val;\n  }\n\n  equals(b: unknown) {\n    if (b instanceof Sig) return isEqual(this.get(), b.get());\n    return false;\n  }\n\n  get(): T {\n    return this._val;\n  }\n\n  forceUpdate(v: T) {\n    this._val = v;\n    QUEUE.addAll(this._binds);\n  }\n\n  update(v: T) {\n    if (isEqual(v, this._val)) return;\n    this.forceUpdate(v);\n  }\n\n  trans(fn: (v: T) => T) {\n    this.update(fn(this._val));\n  }\n\n  addBind<C extends CmdContext>(bind: Bind<T, C>) {\n    this._binds.push(bind as unknown as Bind<T, CmdContext>);\n  }\n\n  removeBind(bind: Bind<T, CmdContext>) {\n    const index = this._binds.indexOf(bind);\n    if (index >= 0) this._binds.splice(index, 1);\n    if (this._binds.length === 0) {\n      this.cleanup();\n    }\n  }\n\n  getBinds(): Bind<T, CmdContext>[] {\n    return this._binds;\n  }\n\n  cleanup() {\n    // console.log('Sig.cleanup', this);\n  }\n}\n\nexport class DerivedSig<T> extends Sig<T> {\n  private _fromBinds: Bind<unknown, CmdContext>[] = [];\n\n  addFromBind<S, C extends CmdContext>(bind: Bind<S, C>) {\n    this._fromBinds.push(bind as unknown as Bind<unknown, CmdContext>);\n  }\n\n  override cleanup() {\n    this._fromBinds.forEach((bind) => {\n      removeBind(bind);\n    });\n\n    // console.log('DerivedSig.cleanup', this);\n  }\n}\n\nexport const sig = <T>(v: T) => new Sig(v);\n\nexport const removeBind = (bind: Bind<unknown, CmdContext>) => {\n  bind.removed = true;\n  bind.sig.removeBind(bind);\n};\n\nexport const createBind = <T, C extends CmdContext>(\n  sig: Sig<T>,\n  context: C,\n  cmd: Cmd<T, C>,\n): Bind<T, C> => {\n  const bind: Bind<T, C> = {sig, context, cmd, removed: false, queued: false};\n  sig.addBind(bind);\n  return bind;\n};\n","import type {CmdContext} from './cmd';\nimport {type Bind, removeBind} from './sig.bind';\n\nexport interface Commit<T, C extends CmdContext> {\n  binds: Bind<T, C> | Bind<T, C>[] | undefined;\n  children?: Commit<unknown, CmdContext>[] | undefined;\n}\n\nexport const cleanCommit = (commit: Commit<unknown, CmdContext>) => {\n  if (commit.binds) {\n    if (Array.isArray(commit.binds)) {\n      commit.binds.forEach((bind) => {\n        removeBind(bind);\n      });\n    } else {\n      removeBind(commit.binds);\n    }\n  }\n  commit.children?.forEach((child) => {\n    cleanCommit(child);\n  });\n};\n","import type {CmdContext} from './cmd';\nimport {createBind, DerivedSig, Sig} from './sig.bind';\n\nexport interface SigRecord {\n  // biome-ignore lint/suspicious/noExplicitAny: any sig val\n  [key: string]: Sig<any>;\n}\n\nexport type ValRecord<K extends SigRecord> = {\n  [P in keyof K]: K[P] extends Sig<infer U> ? U : never;\n};\n\nexport const toValRecord = <S extends SigRecord>(source: S): ValRecord<S> => {\n  const keys = Object.keys(source);\n  const vals: Record<string, unknown> = {};\n  for (let i = 0; i < keys.length; i++) {\n    const k = keys[i];\n    if (k && source[k]) {\n      vals[k] = source[k].get();\n    }\n  }\n  return vals as ValRecord<S>;\n};\n\nexport interface ComputeContext<S, T> extends CmdContext {\n  // source: Sig<S>;\n  target: Sig<T>;\n  fn: (s: S) => T;\n}\n\ninterface ComputeRecordContext<S extends SigRecord, T> extends CmdContext {\n  source: S;\n  target: Sig<T>;\n  fn: (v: ValRecord<S>) => T;\n}\n\nconst computeCmd = <S, T>(s: S, ctx: ComputeContext<S, T>) => {\n  const res = ctx.fn(s);\n  ctx.target.update(res);\n};\n\nconst computeRecordCmd = <S extends SigRecord, T>(\n  _s: unknown,\n  ctx: ComputeRecordContext<S, T>,\n) => {\n  const vals = toValRecord(ctx.source);\n  const res = ctx.fn(vals);\n  ctx.target.update(res);\n};\n\nconst _compute = <S, T>(source: Sig<S>, fn: (v: S) => T): DerivedSig<T> => {\n  const output = fn(source.get());\n  const target = new DerivedSig(output);\n  const ctx: ComputeContext<S, T> = {target, fn};\n  const bind = createBind(source, ctx, computeCmd);\n  target.addFromBind(bind);\n  return target;\n};\n\nconst _computeRecord = <S extends SigRecord, T>(\n  source: S,\n  fn: (v: ValRecord<S>) => T,\n): DerivedSig<T> => {\n  const vals = toValRecord(source);\n  const res = fn(vals);\n  const target = new DerivedSig(res);\n\n  const ctx: ComputeRecordContext<S, T> = {source, target, fn};\n\n  const keys = Object.keys(source);\n  for (let i = 0; i < keys.length; i++) {\n    const k = keys[i];\n    if (k && source[k]) {\n      const bind = createBind(source[k], ctx, computeRecordCmd);\n      target.addFromBind(bind);\n    }\n  }\n\n  return target;\n};\n\nexport function compute<S, T>(source: Sig<S>, fn: (v: S) => T): DerivedSig<T>;\nexport function compute<S extends SigRecord, T>(\n  source: S,\n  fn: (v: ValRecord<S>) => T,\n): DerivedSig<T>;\n// biome-ignore lint/suspicious/noExplicitAny: any source\nexport function compute(source: any, fn: (v: any) => any): DerivedSig<any> {\n  return source instanceof Sig\n    ? _compute(source, fn)\n    : _computeRecord(source, fn);\n}\n","export const at = <T>(arr: T[], index: number): T => {\n  const v = arr[index];\n  if (v === undefined) throw new RangeError(`index ${index} out of range`);\n  return v;\n};\n","import type {CmdContext} from './cmd';\nimport type {Commit} from './commit';\nimport type {Patch, PatchContext} from './patch';\nimport {type Bind, createBind, Sig} from './sig.bind';\nimport {at} from './utils';\nimport type {AnyView, View} from './view';\n\nexport const MARK = `@sig_${Math.random().toFixed(9).slice(2)}`;\n\ninterface Tpl {\n  el: HTMLTemplateElement;\n  indexes: number[];\n}\n\ninterface Wrap<T, C extends CmdContext> {\n  item: Patch | View<T, C>;\n  node: Node;\n}\n\nconst tplCache = new WeakMap<TemplateStringsArray, Tpl>();\nconst walker = document.createTreeWalker(\n  document,\n  NodeFilter.SHOW_ELEMENT | NodeFilter.SHOW_COMMENT,\n);\n\nconst _toMark = (item: Patch | View): string =>\n  item.type === 'patch' ? MARK : `<!--${MARK}-->`;\n\nconst _hasMark = (el: Element) => el.hasAttribute(MARK);\nconst _rmMark = (el: Element) => el.removeAttribute(MARK);\nconst _isView = (item: Comment) => item.data.trim() === MARK;\n\nconst commitView = <T, C extends CmdContext>(\n  view: View<T, C>,\n  node: Node,\n): Commit<T, C> => {\n  (node as Comment).replaceWith(view.node);\n  return {\n    binds: view.bind,\n    children: view.childCommits,\n  };\n};\n\nconst commitPatch = (\n  patch: Patch,\n  node: Node,\n): Commit<unknown, PatchContext> => {\n  const binds: Bind<unknown, PatchContext>[] = [];\n  patch.toPatchItems.forEach((toPatchItem) => {\n    const item = toPatchItem(node as Element);\n    if (item.source instanceof Sig) {\n      item.cmd(item.source.get(), item.context);\n      binds.push(createBind(item.source, item.context, item.cmd));\n      // binds.push(item.source, item.context, item.cmd);\n    } else {\n      item.cmd(item.source, item.context);\n    }\n  });\n\n  return {binds};\n};\n\n// Both template passes walk the same tree hunting for the next interpolation\n// slot and then do exactly the same thing with it; only the way a slot is\n// recognised differs, so that part is the only argument.\nconst _scan = (\n  frag: DocumentFragment,\n  items: (Patch | AnyView)[],\n  wraps: Wrap<unknown, CmdContext>[],\n  hit: (node: Node, nodeIndex: number, itemIndex: number) => boolean,\n  indexes?: number[],\n) => {\n  walker.currentNode = frag;\n  let node = walker.nextNode();\n  let nodeIndex = 0;\n  let itemIndex = 0;\n  while (node !== null && itemIndex < items.length) {\n    if (hit(node, nodeIndex, itemIndex)) {\n      wraps.push({item: at(items, itemIndex), node});\n      if (indexes) indexes.push(nodeIndex);\n      itemIndex++;\n      if (node.nodeType === Node.ELEMENT_NODE) _rmMark(node as Element);\n    }\n    node = walker.nextNode();\n    nodeIndex++;\n  }\n  // https://github.com/lit/lit/blob/c42ee1e96b8fd61f7256f61d715daef572e76e52/packages/lit-html/src/lit-html.ts#L1260\n  // We need to set the currentNode away from the cloned tree so that we\n  // don't hold onto the tree even if it is detached and should be freed.\n  walker.currentNode = document;\n};\n\nexport const html = (\n  strs: TemplateStringsArray,\n  ...items: (Patch | AnyView)[]\n): View => {\n  // const frag = document.createDocumentFragment();\n  let frag: DocumentFragment;\n  const wraps: Wrap<unknown, CmdContext>[] = [];\n\n  const exist = tplCache.get(strs);\n  if (exist) {\n    frag = document.importNode(exist.el.content, true);\n    if (items && items.length > 0) {\n      _scan(\n        frag,\n        items,\n        wraps,\n        (_node, nodeIndex, itemIndex) => nodeIndex === exist.indexes[itemIndex],\n      );\n    }\n  } else {\n    const template = document.createElement('template');\n    template.innerHTML = _text(strs, ...items);\n    const tpl: Tpl = {el: template, indexes: []};\n    frag = document.importNode(template.content, true);\n\n    if (items && items.length > 0) {\n      _scan(\n        frag,\n        items,\n        wraps,\n        (node) =>\n          node.nodeType === Node.ELEMENT_NODE\n            ? _hasMark(node as Element)\n            : node.nodeType === Node.COMMENT_NODE && _isView(node as Comment),\n        tpl.indexes,\n      );\n    }\n\n    tplCache.set(strs, tpl);\n  }\n\n  if (wraps.length !== items.length)\n    throw new Error(\n      'html: unmatched interpolation; patch() must be in attribute position',\n    );\n\n  const commits: Commit<unknown, CmdContext>[] = [];\n  wraps.forEach(({item, node}) => {\n    if (item.type === 'patch') {\n      commits.push(\n        commitPatch(item, node) as unknown as Commit<unknown, CmdContext>,\n      );\n    } else if (item.type === 'view') {\n      commits.push(commitView(item, node));\n    }\n  });\n\n  return {\n    type: 'view',\n    node: frag,\n    childCommits: commits,\n  };\n};\n\nconst _text = (strs: TemplateStringsArray, ...parts: (Patch | AnyView)[]) => {\n  let text = strs[0] ?? '';\n  for (let i = 0; i < parts.length; i++) {\n    text += _toMark(at(parts, i)) + (strs[i + 1] ?? '');\n  }\n  return text;\n};\n","import type {Cmd, CmdContext} from './cmd';\nimport type {Sig} from './sig.bind';\n\nexport interface PatchContext extends CmdContext {\n  // kind: 'elem';\n  node: Node;\n  extra?: unknown[];\n}\n\nexport interface PatchItem<T> {\n  source: T | Sig<T>;\n  context: PatchContext;\n  cmd: Cmd<T, PatchContext>;\n}\nexport type ToPatchItem<T> = (el: Element) => PatchItem<T>;\n\n// biome-ignore lint/suspicious/noExplicitAny: any patch item\nexport type AnyPatchItem = PatchItem<any>;\nexport type ToAnyPatchItem = (el: Element) => AnyPatchItem;\n\nexport interface Patch {\n  type: 'patch';\n  toPatchItems: ToAnyPatchItem[];\n}\n\nexport const patch = (...toPatchItems: ToAnyPatchItem[]): Patch => ({\n  type: 'patch',\n  toPatchItems,\n});\n\n// Every patch item is the same shape -- bind `source` to `elem` plus whatever\n// arguments the command needs -- so the whole body lives here once.\nconst _toPatchItem =\n  <T>(\n    source: T | Sig<T>,\n    extra: unknown[] | undefined,\n    cmd: Cmd<T, PatchContext>,\n  ): ToPatchItem<T> =>\n  (elem) => ({\n    source,\n    context: extra ? {node: elem, extra} : {node: elem},\n    cmd,\n  });\n\n// most commands take their attribute/style/class name as the first extra\nconst _key = (ctx: PatchContext): string => {\n  const key = ctx.extra?.[0];\n  if (!key) throw new Error('patch: empty key');\n  return key as string;\n};\n\nconst idCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as Element).id = String(val);\n};\n\nexport const id = <T>(source: T | Sig<T>): ToPatchItem<T> =>\n  _toPatchItem(source, undefined, idCmd);\n\nconst valCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as unknown as {value: string}).value = String(val);\n};\n\nexport const val = <T>(source: T | Sig<T>): ToPatchItem<T> =>\n  _toPatchItem(source, undefined, valCmd);\n\nconst attrCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as Element).setAttribute(_key(ctx), String(val));\n};\n\nexport const attr = <T>(source: T | Sig<T>, key: string): ToPatchItem<T> =>\n  _toPatchItem(source, [key], attrCmd);\n\nexport type WritableStyleKey = {\n  [K in keyof CSSStyleDeclaration]: CSSStyleDeclaration[K] extends string\n    ? K\n    : never;\n}[keyof CSSStyleDeclaration];\n\nconst styleCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as HTMLElement).style[_key(ctx) as WritableStyleKey] = String(val);\n};\n\nexport const style = <T>(\n  source: T | Sig<T>,\n  key: WritableStyleKey,\n): ToPatchItem<T> => _toPatchItem(source, [key], styleCmd);\n\nconst stylePropertyCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as HTMLElement).style.setProperty(_key(ctx), String(val));\n};\n\nexport const styleProperty = <T>(\n  source: T | Sig<T>,\n  key: string,\n): ToPatchItem<T> => _toPatchItem(source, [key], stylePropertyCmd);\n\nconst toggleClassCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as Element).classList.toggle(_key(ctx), Boolean(val));\n};\n\nexport const toggleClass = <T>(\n  source: T | Sig<T>,\n  token: string,\n): ToPatchItem<T> => _toPatchItem(source, [token], toggleClassCmd);\n\nconst toggleClassesCmd = <T>(val: T, ctx: PatchContext) => {\n  ctx.extra?.forEach((token) => {\n    (ctx.node as Element).classList.toggle(token as string, Boolean(val));\n  });\n};\n\nexport const toggleClasses = <T>(\n  source: T | Sig<T>,\n  ...tokens: string[]\n): ToPatchItem<T> => _toPatchItem(source, tokens, toggleClassesCmd);\n\nexport type ActFn<T> = (node: Node, val?: T) => void;\n\nconst actCmd = <T>(val: T, ctx: PatchContext) => {\n  const fn = ctx.extra?.[0] as ActFn<T> | undefined;\n  if (!fn) throw new Error('patch: no function');\n  fn(ctx.node, val);\n};\n\nexport const act = <T>(source: T | Sig<T>, fn: ActFn<T>): ToPatchItem<T> =>\n  _toPatchItem(source, [fn], actCmd);\n\ntype _Listener<K extends keyof HTMLElementEventMap> = (\n  this: HTMLElement,\n  ev: HTMLElementEventMap[K],\n) => unknown;\n\nconst onCmd = (listener: unknown, ctx: PatchContext) => {\n  const type = ctx.extra?.[0] as string | undefined;\n  const options = ctx.extra?.[1] as\n    | boolean\n    | AddEventListenerOptions\n    | undefined;\n  if (!type) throw new Error('patch: no event type');\n  ctx.node.addEventListener(\n    type,\n    listener as EventListenerOrEventListenerObject,\n    options,\n  );\n};\n\nexport const on = <K extends keyof HTMLElementEventMap>(\n  type: K,\n  listener: _Listener<K>,\n  options?: boolean | AddEventListenerOptions,\n): ToPatchItem<_Listener<K>> => _toPatchItem(listener, [type, options], onCmd);\n","import type {AnyView} from './view';\n\nexport const render = (viewArg: AnyView | (() => AnyView), node: Node) => {\n  const view = typeof viewArg === 'function' ? viewArg() : viewArg;\n  node.appendChild(view.node);\n};\n","import {type Boundary, replaceWithNode, toBoundary} from './boundary';\nimport type {CmdContext} from './cmd';\nimport {type Commit, cleanCommit} from './commit';\nimport {\n  type AnyBind,\n  type Bind,\n  createBind,\n  removeBind,\n  type Sig,\n} from './sig.bind';\n\nexport interface View<T = unknown, C extends CmdContext = CmdContext> {\n  type: 'view';\n  node: Node;\n  bind?: Bind<T, C> | undefined;\n  childCommits?: Commit<unknown, CmdContext>[];\n}\n\n// biome-ignore lint/suspicious/noExplicitAny: any view\nexport type AnyView = View<any, any>;\n\nexport interface ViewContext<T> extends CmdContext {\n  boundary: Boundary;\n  bind?: AnyBind | undefined;\n  childCommits?: Commit<unknown, CmdContext>[] | undefined;\n  viewFn: (val: T) => View;\n}\n\nconst viewCmd = <T>(val: T, ctx: ViewContext<T>) => {\n  const view = ctx.viewFn(val);\n  const newBoundary = replaceWithView(ctx.boundary, view);\n  if (ctx.bind) removeBind(ctx.bind);\n  ctx.childCommits?.forEach((commit) => {\n    cleanCommit(commit);\n  });\n  ctx.boundary = newBoundary;\n  ctx.bind = view.bind;\n  ctx.childCommits = view.childCommits;\n};\n\nexport const view = <T>(\n  sig: Sig<T>,\n  viewFn: (val: T) => AnyView,\n): View<T, ViewContext<T>> => {\n  const view = viewFn(sig.get());\n\n  const boundary = extractBoundary(view);\n\n  const ctx: ViewContext<T> = {\n    boundary,\n    bind: view.bind,\n    viewFn,\n    childCommits: view.childCommits,\n  };\n\n  const bind = createBind(sig, ctx, viewCmd);\n\n  return {\n    ...view,\n    bind,\n  };\n};\n\nexport const extractBoundary = (view: View): Boundary => toBoundary(view.node);\n\nexport const replaceWithView = (old: Boundary, view: View): Boundary => {\n  return replaceWithNode(old, view.node);\n};\n","import {\n  type Boundary,\n  removeBoundary,\n  replaceWithNode,\n  toBoundary,\n} from './boundary';\nimport type {CmdContext} from './cmd';\nimport {type Commit, cleanCommit} from './commit';\nimport {isEqual} from './eq';\nimport {type AnyBind, createBind, removeBind, type Sig} from './sig.bind';\nimport {at} from './utils';\nimport {\n  type AnyView,\n  extractBoundary,\n  replaceWithView,\n  type View,\n} from './view';\n\nexport type RepeatProp<T> = {\n  key: (item: T) => string;\n  view: (item: T) => AnyView;\n  compare?: (a: T, b: T) => boolean;\n};\n\nexport interface Container {\n  parent: ParentNode;\n  startFence: Node;\n  endFence: Node;\n}\n\nexport interface Track<T> {\n  boundary: Boundary;\n  bind?: AnyBind | undefined;\n  item: T;\n  key: string;\n  childCommits?: Commit<unknown, CmdContext>[] | undefined;\n  checked?: boolean;\n  cleaned?: boolean;\n}\n\nexport interface RepeatContext<T> extends CmdContext {\n  prop: RepeatProp<T>;\n  boundary: Boundary;\n  tracks: Track<T>[];\n}\n\nconst _cleanTrack = <T>(track: Track<T>) => {\n  removeBoundary(track.boundary);\n  if (track.bind) removeBind(track.bind);\n  track.childCommits?.forEach((commit) => {\n    cleanCommit(commit);\n  });\n  track.cleaned = true;\n};\n\nconst repeatCmd = <T>(items: T[], ctx: RepeatContext<T>) => {\n  if (!Array.isArray(items) || items.length === 0) {\n    const newFrag = document.createDocumentFragment();\n    newFrag.appendChild(document.createComment('empty-list'));\n    const newBoundary = replaceWithNode(ctx.boundary, newFrag);\n    ctx.boundary = newBoundary;\n    ctx.tracks.forEach(_cleanTrack);\n    ctx.tracks = [];\n    return;\n  }\n  const newTracks: Track<T>[] = [];\n  if (!Array.isArray(ctx.tracks) || ctx.tracks.length === 0) {\n    const newFrag = _init(items, ctx.prop, newTracks);\n    const newBoundary = replaceWithNode(ctx.boundary, newFrag);\n    ctx.boundary = newBoundary;\n    // ctx.tracks.forEach(_cleanTrack);\n    ctx.tracks = newTracks;\n    return;\n  }\n\n  const start = ctx.boundary.start;\n  const end = ctx.boundary.end;\n  const parent = start.parentNode;\n  if (!parent) throw new Error('no parent node');\n\n  const compare = ctx.prop.compare ?? isEqual;\n  const newKeys = items.map((item) => ctx.prop.key(item));\n  const tracks = ctx.tracks;\n\n  // Nothing changed: same keys, same order, equal items. Bail out before\n  // touching the DOM so a redundant re-render costs zero DOM mutations\n  // instead of a fence insert/remove pair.\n  if (tracks.length === items.length) {\n    const unchanged = tracks.every((track, i) => {\n      const item = items[i] as T;\n      return track.key === newKeys[i] && compare(track.item, item);\n    });\n    if (unchanged) return;\n  }\n\n  const startFence = document.createComment('repeat-start-fence');\n  const endFence = document.createComment('repeat-end-fence');\n\n  parent.insertBefore(startFence, start);\n  parent.insertBefore(endFence, end.nextSibling);\n\n  const container: Container = {\n    parent,\n    startFence,\n    endFence,\n  };\n\n  const oldKeys = tracks.map((track) => track.key);\n\n  let newKeyToIndexMap: Map<unknown, number> | undefined;\n  let oldKeyToIndexMap: Map<unknown, number> | undefined;\n\n  let oldHead = 0;\n  let oldTail = ctx.tracks.length - 1;\n  let newHead = 0;\n  let newTail = items.length - 1;\n\n  while (oldHead <= oldTail && newHead <= newTail) {\n    if (ctx.tracks[oldHead]?.checked) {\n      // console.log('skip old head', ctx.tracks[oldHead].key);\n\n      oldHead++;\n    } else if (ctx.tracks[oldTail]?.checked) {\n      // console.log('skip old tail', ctx.tracks[oldTail].key);\n\n      oldTail--;\n    } else if (ctx.tracks[oldHead]?.key === newKeys[newHead]) {\n      // old head matches new head; update in place\n      // console.log('matches head', newKeys[newHead]);\n\n      newTracks[newHead] = _setTrack(\n        at(ctx.tracks, oldHead),\n        at(items, newHead),\n        ctx.prop,\n        compare,\n      );\n      oldHead++;\n      newHead++;\n    } else if (ctx.tracks[oldTail]?.key === newKeys[newTail]) {\n      // old tail matches nwe tail; update in place\n      // console.log('matches tail', newKeys[newTail]);\n\n      newTracks[newTail] = _setTrack(\n        at(ctx.tracks, oldTail),\n        at(items, newTail),\n        ctx.prop,\n        compare,\n      );\n      oldTail--;\n      newTail--;\n    } else if (ctx.tracks[oldHead]?.key === newKeys[newTail]) {\n      // Old head matches new tail; update and move to new tail\n      // console.log(\n      //   'Old head matches new tail',\n      //   ctx.tracks[oldHead].key,\n      //   newKeys[newTail],\n      // );\n      newTracks[newTail] = _setTrack(\n        at(ctx.tracks, oldHead),\n        at(items, newTail),\n        ctx.prop,\n        compare,\n      );\n      //\n      // const before = ref ? boundaryStart(ref.boundary) : fence;\n      // _moveTrackBefore(after, newTracks[newTail], newTracks[newTail + 1]);\n      _moveTrack(\n        container,\n        at(newTracks, newTail),\n        _beforeFence(container, newTracks[newTail + 1]),\n      );\n      oldHead++;\n      newTail--;\n    } else if (ctx.tracks[oldTail]?.key === newKeys[newHead]) {\n      // old tail matches new head; update and move to new head\n      // console.log(\n      //   'old tail matches new head',\n      //   ctx.tracks[oldTail].key,\n      //   newKeys[newHead],\n      // );\n\n      newTracks[newHead] = _setTrack(\n        at(ctx.tracks, oldTail),\n        at(items, newHead),\n        ctx.prop,\n        compare,\n      );\n      // if (!before.nextSibling) throw new Error('no before.nextSibling');\n      // _moveTrackAfter(before, newTracks[newHead], newTracks[newHead - 1]);\n      _moveTrack(\n        container,\n        at(newTracks, newHead),\n        _afterFence(container, newTracks[newHead - 1]),\n      );\n      oldTail--;\n      newHead++;\n    } else {\n      if (newKeyToIndexMap === undefined || oldKeyToIndexMap === undefined) {\n        newKeyToIndexMap = _generateMap(newKeys, newHead, newTail);\n        oldKeyToIndexMap = _generateMap(oldKeys, oldHead, oldTail);\n      }\n      if (!newKeyToIndexMap.has(oldKeys[oldHead])) {\n        // remove old head\n        // console.log('remove old head', ctx.tracks[oldHead].key);\n        _cleanTrack(at(ctx.tracks, oldHead));\n        oldHead++;\n      } else if (!newKeyToIndexMap.has(oldKeys[oldTail])) {\n        // remove old tail\n        // console.log('remove old tail', ctx.tracks[oldTail].key);\n        _cleanTrack(at(ctx.tracks, oldTail));\n        oldTail--;\n      } else {\n        const oldIndex = oldKeyToIndexMap.get(newKeys[newHead]);\n        const oldTrack = oldIndex !== undefined ? ctx.tracks[oldIndex] : null;\n        if (oldTrack) {\n          // console.log(\n          //   'move old item to new head:',\n          //   oldTrack.key,\n          //   newKeys[newHead],\n          // );\n          newTracks[newHead] = _setTrack(\n            oldTrack,\n            at(items, newHead),\n            ctx.prop,\n            compare,\n          );\n          // _moveTrackAfter(before, newTracks[newHead], newTracks[newHead - 1]);\n          _moveTrack(\n            container,\n            at(newTracks, newHead),\n            _afterFence(container, newTracks[newHead - 1]),\n          );\n          oldTrack.checked = true;\n          // ctx.tracks[oldIndex as number].checked = true;\n        } else {\n          // create a new one and insert it\n          // console.log('create new item:', newKeys[newHead]);\n          newTracks[newHead] = _insertNewTrack(\n            container,\n            at(items, newHead),\n            ctx.prop,\n            _afterFence(container, newTracks[newHead - 1]),\n          );\n        }\n        newHead++;\n      }\n    }\n  }\n\n  while (newHead <= newTail) {\n    // console.log('create new head:', newKeys[newHead]);\n    newTracks[newHead] = _insertNewTrack(\n      container,\n      at(items, newHead),\n      ctx.prop,\n      _afterFence(container, newTracks[newHead - 1]),\n    );\n    newHead++;\n  }\n\n  while (oldHead <= oldTail) {\n    // console.log('remove old head:', ctx.tracks[oldHead].key);\n    if (!ctx.tracks[oldHead]?.cleaned && !ctx.tracks[oldHead]?.checked)\n      _cleanTrack(at(ctx.tracks, oldHead));\n    oldHead++;\n  }\n\n  if (!container.startFence.nextSibling || !container.endFence.previousSibling)\n    throw new Error('error container fences');\n\n  ctx.boundary = {\n    start: container.startFence.nextSibling,\n    end: container.endFence.previousSibling,\n  };\n  container.parent.removeChild(container.startFence);\n  container.parent.removeChild(container.endFence);\n  ctx.tracks = newTracks;\n};\n\nconst _generateMap = (list: unknown[], start: number, end: number) => {\n  const map = new Map<unknown, number>();\n  for (let i = start; i <= end; i++) {\n    map.set(list[i], i);\n  }\n  return map;\n};\n\nconst _beforeFence = <T>(container: Container, track?: Track<T>): Node =>\n  track ? track.boundary.start : container.endFence;\nconst _afterFence = <T>(container: Container, track?: Track<T>): Node => {\n  const node = track ? track.boundary.end : container.startFence;\n  if (!node.nextSibling) throw new Error('no after fence');\n  return node.nextSibling;\n};\n\nconst _mvNodeBefore = (parent: ParentNode, node: Node, child: Node | null) => {\n  if (parent.moveBefore) parent.moveBefore(node, child);\n  else parent.insertBefore(node, child);\n};\n\nconst _moveTrack = <T>(container: Container, track: Track<T>, fence: Node) => {\n  const parent = container.parent;\n\n  if (track.boundary.start === track.boundary.end)\n    _mvNodeBefore(parent, track.boundary.start, fence);\n  else {\n    let n: Node | null = track.boundary.start;\n    while (n) {\n      const next: Node | null = n.nextSibling;\n      _mvNodeBefore(parent, n, fence);\n      if (n === track.boundary.end) break;\n      n = next;\n    }\n  }\n};\n\nconst _insertNewTrack = <T>(\n  container: Container,\n  item: T,\n  prop: RepeatProp<T>,\n  fence: Node,\n): Track<T> => {\n  const view = prop.view(item);\n  const boundary = extractBoundary(view);\n  container.parent.insertBefore(view.node, fence);\n  return {\n    key: prop.key(item),\n    boundary,\n    bind: view.bind,\n    childCommits: view.childCommits,\n    item,\n  };\n};\n\nconst _setTrack = <T>(\n  old: Track<T>,\n  item: T,\n  prop: RepeatProp<T>,\n  compare: (a: T, b: T) => boolean,\n): Track<T> => {\n  if (compare(old.item, item)) {\n    return {\n      ...old,\n      checked: false,\n      cleaned: false,\n    };\n  }\n\n  const view = prop.view(item);\n  const newBoundary = replaceWithView(old.boundary, view);\n  _cleanTrack(old);\n\n  const newTrack: Track<T> = {\n    key: prop.key(item),\n    boundary: newBoundary,\n    bind: view.bind,\n    childCommits: view.childCommits,\n    item,\n  };\n\n  return newTrack;\n};\n\nconst _init = <T>(\n  items: T[],\n  prop: RepeatProp<T>,\n  tracks: Track<T>[],\n): DocumentFragment => {\n  const frag = document.createDocumentFragment();\n  items.forEach((item) => {\n    const view = prop.view(item);\n    const key = prop.key(item);\n\n    const boundary = extractBoundary(view);\n    tracks.push({\n      key,\n      boundary,\n      bind: view.bind,\n      item,\n      childCommits: view.childCommits,\n    });\n    frag.appendChild(view.node);\n  });\n\n  if (frag.childNodes.length === 0) {\n    frag.appendChild(document.createComment('empty-list'));\n  }\n  return frag;\n};\n\nexport const repeat = <T>(\n  sig: Sig<T[]>,\n  prop: RepeatProp<T>,\n): View<T[], RepeatContext<T>> => {\n  const tracks: Track<T>[] = [];\n  const frag = _init(sig.get(), prop, tracks);\n\n  const ctx: RepeatContext<T> = {prop, tracks, boundary: toBoundary(frag)};\n  const bind = createBind(sig, ctx, repeatCmd);\n\n  return {\n    type: 'view',\n    node: frag,\n    bind,\n  };\n};\n","import type {PatchContext} from './patch';\nimport {createBind, Sig} from './sig.bind';\nimport type {View} from './view';\n\nconst textCmd = <T>(val: T, ctx: PatchContext) => {\n  ctx.node.textContent = String(val);\n};\n\nexport const text = <T>(source: T | Sig<T>): View<T, PatchContext> => {\n  const text = document.createTextNode(\n    source instanceof Sig ? String(source.get()) : String(source),\n  );\n  const ctx: PatchContext = {node: text};\n  const bind =\n    source instanceof Sig ? createBind(source, ctx, textCmd) : undefined;\n  return {\n    type: 'view',\n    node: text,\n    bind,\n  };\n};\n"],"mappings":"AAKA,MAAaA,EAAkB,GAAgB,CAC7C,IAAMC,EAASC,EAAE,MAAM,WACvB,GAAKD,EAML,IAAIC,EAAE,QAAUA,EAAE,IAAKD,EAAO,YAAYC,EAAE,KAAK,MAC5C,CAOH,IAAI,EAAiBA,EAAE,MACvB,KAAO,GAAG,CACR,IAAMC,EAAoB,EAAE,YAE5B,GADAF,EAAO,YAAY,CAAC,EAChB,IAAMC,EAAE,IAAK,MACjB,EAAIC,CACN,CACF,EACF,EAEaC,EAAc,GAAyB,CAClD,IAAMF,EACJG,EAAK,WAAa,KAAK,uBACnB,CAAC,MAAOA,EAAK,WAAY,IAAKA,EAAK,SAAS,EAC5C,CAAC,MAAOA,EAAM,IAAKA,CAAI,EAC7B,GAAI,CAACH,EAAE,OAAS,CAACA,EAAE,IAAK,MAAU,MAAM,4BAA4B,EACpE,OAAOA,CACT,EAEaI,GAAmB,EAAe,IAAe,CAC5D,IAAMC,EAAcH,EAAWC,CAAI,EAC7BJ,EAASO,EAAI,MAAM,WACzB,GAAI,CAACP,EACH,MAAU,MAAM,iDAAiD,EAEnE,GAAIO,EAAI,QAAUA,EAAI,IACpBP,EAAO,aAAaI,EAAMG,EAAI,KAAK,MAC9B,CACL,IAAIC,EAAID,EAAI,MAAM,YAElB,IADAP,EAAO,aAAaI,EAAMG,EAAI,KAAK,EAC5BC,GAAG,CACR,IAAMN,EAAOM,EAAE,YAEf,GADAR,EAAO,YAAYQ,CAAC,EAChBA,IAAMD,EAAI,IAAK,MACnB,EAAIL,CACN,CACF,CAaA,OAAOI,CACT,ECnEMG,EAAe,GACnB,OAAOC,GAAU,YACjBA,GACA,WAAYA,GACZ,OAAOA,EAAM,QAAW,WAIpBC,EAAY,GAChB,OAAOC,GAAM,YAAYA,EAEdC,GAAc,EAAM,IAAkB,CACjD,GAAIC,IAAMb,EAAG,MAAO,GAGpB,GAFI,OAAOa,GAAM,OAAOb,GAEpBa,IAAM,MAAQb,IAAM,MAAQ,OAAOa,GAAM,SAAU,MAAO,GAE9D,GAAIL,EAAYK,CAAC,EAAG,OAAOA,EAAE,OAAOb,CAAC,EAIrC,GAAI,MAAM,QAAQa,CAAC,GAAK,MAAM,QAAQb,CAAC,EAAG,CACxC,GAAIa,EAAE,SAAWb,EAAE,OAAQ,MAAO,GAClC,IAAK,IAAIc,EAAI,EAAGA,EAAID,EAAE,OAAQ,IAC5B,GAAI,CAACD,EAAQC,EAAEC,GAAId,EAAEc,EAAE,EAAG,MAAO,GAEnC,MAAO,EACT,CAGA,GAAID,aAAa,MAAQb,aAAa,KACpC,OAAOa,EAAE,QAAQ,IAAMb,EAAE,QAAQ,EAGnC,GAAIa,aAAa,QAAUb,aAAa,OACtC,OAAOa,EAAE,SAAS,IAAMb,EAAE,SAAS,EAIrC,GAAIa,aAAa,KAAOb,aAAa,IAAK,CACxC,GAAIa,EAAE,OAASb,EAAE,KAAM,MAAO,GAC9B,IAAK,GAAM,CAACe,EAAKC,KAAQH,EACvB,GAAI,CAACb,EAAE,IAAIe,CAAG,GAAK,CAACH,EAAQI,EAAKhB,EAAE,IAAIe,CAAG,CAAC,EAAG,MAAO,GAEvD,MAAO,EACT,CAGA,GAAIF,aAAa,KAAOb,aAAa,IAAK,CACxC,GAAIa,EAAE,OAASb,EAAE,KAAM,MAAO,GAC9B,IAAMiB,EAAO,MAAM,KAAKJ,CAAC,EACnBK,EAAO,MAAM,KAAKlB,CAAC,EACzB,OAAOY,EAAQK,EAAMC,CAAI,CAC3B,CAGA,GAAI,OAAO,GAAGL,EAAGb,CAAC,EAAG,MAAO,GAC5B,GAAI,CAACU,EAASG,CAAC,GAAK,CAACH,EAASV,CAAC,EAAG,MAAO,GAEzC,IAAMmB,EAAQ,OAAO,KAAKN,CAAC,EACrBO,EAAQ,OAAO,KAAKpB,CAAC,EAC3B,GAAImB,EAAM,SAAWC,EAAM,OAAQ,MAAO,GAE1C,IAAK,IAAML,KAAOI,EAEhB,GADI,CAAC,OAAO,OAAOnB,EAAGe,CAAG,GACrB,CAACH,EAAQC,EAAEE,GAAMf,EAAEe,EAAI,EAAG,MAAO,GAGvC,MAAO,EACT,ECCMM,EAAQ,IAAI,KA5DN,CACV,OAA4B,CAAC,EAC7B,KAAe,EACf,QAAkB,GAClB,UAAoB,GAEpB,OAAO,EAAiC,CACtC,IAAK,IAAMC,KAAQC,EACbD,EAAK,SACT,EAAK,OAAS,GACd,KAAK,OAAO,KAAKA,CAAI,GAGvB,OADI,KAAK,OAAO,OAAS,KAAK,MAAM,KAAK,KAAK,EACvC,IACT,CAEA,MAAqB,CACf,KAAK,SAAW,KAAK,YACzB,KAAK,UAAY,GACjB,mBAAqB,CACnB,KAAK,QAAU,GACf,KAAK,UAAY,GACjB,KAAK,MAAM,CACb,CAAC,EACH,CAEA,OAAsB,CACpB,KAAK,QAAU,GACf,GAAI,CACF,KAAO,KAAK,KAAO,KAAK,OAAO,QAAQ,CACrC,IAAMA,EAAO,KAAK,OAAO,KAAK,QAC9B,GAAIA,EACF,GAAI,CACF,GAAM,CAAC,UAAS,MAAK,UAAS,OAAOA,EAChCE,GAASC,EAAIC,EAAI,IAAI,EAAGC,CAAO,CACtC,OAASC,EAAK,CACZ,QAAQ,MAAM,uBAAwBA,EAAKN,CAAI,CACjD,QAAU,CAIR,EAAK,OAAS,EAChB,CAEJ,CACF,QAAU,CACR,KAAK,QAAU,GACX,KAAK,KAAO,KAAK,OAAO,QAE1B,KAAK,OAAS,KAAK,OAAO,MAAM,KAAK,IAAI,EACzC,KAAK,KAAO,EACZ,KAAK,KAAK,IAEV,KAAK,OAAO,OAAS,EACrB,KAAK,KAAO,EAEhB,CACF,CACF,EAIA,IAAaO,EAAb,MAAaA,CAA4B,CACvC,KACA,OAAwC,CAAC,EAEzC,YAAY,EAAQ,CAClB,KAAK,KAAOb,CACd,CAEA,OAAO,EAAY,CAEjB,OADIhB,aAAa6B,GAAYjB,EAAQ,KAAK,IAAI,EAAGZ,EAAE,IAAI,CAAC,CAE1D,CAEA,KAAS,CACP,OAAO,KAAK,IACd,CAEA,YAAY,EAAM,CAChB,KAAK,KAAOW,EACZU,EAAM,OAAO,KAAK,MAAM,CAC1B,CAEA,OAAO,EAAM,CACPT,EAAQD,EAAG,KAAK,IAAI,GACxB,KAAK,YAAYA,CAAC,CACpB,CAEA,MAAM,EAAiB,CACrB,KAAK,OAAOmB,EAAG,KAAK,IAAI,CAAC,CAC3B,CAEA,QAA8B,EAAkB,CAC9C,KAAK,OAAO,KAAKR,CAAsC,CACzD,CAEA,WAAW,EAA2B,CACpC,IAAMS,EAAQ,KAAK,OAAO,QAAQT,CAAI,EAClCS,GAAS,GAAG,KAAK,OAAO,OAAOA,EAAO,CAAC,EACvC,KAAK,OAAO,SAAW,GACzB,KAAK,QAAQ,CAEjB,CAEA,UAAkC,CAChC,OAAO,KAAK,MACd,CAEA,SAAU,CAEV,CACF,EAEaC,EAAb,cAAmCH,CAAO,CACxC,WAAkD,CAAC,EAEnD,YAAqC,EAAkB,CACrD,KAAK,WAAW,KAAKP,CAA4C,CACnE,CAEA,SAAmB,CACjB,KAAK,WAAW,QAAS,GAAS,CAChCW,EAAWX,CAAI,CACjB,CAAC,CAGH,CACF,EAEA,MAAaI,EAAU,GAAS,IAAIG,EAAIlB,CAAC,EAE5BsB,EAAc,GAAoC,CAC7D,EAAK,QAAU,GACfX,EAAK,IAAI,WAAWA,CAAI,CAC1B,EAEaY,GACX,EACA,EACA,IACe,CACf,IAAMZ,EAAmB,CAAC,MAAK,UAAS,MAAK,QAAS,GAAO,OAAQ,EAAK,EAE1E,OADAI,EAAI,QAAQJ,CAAI,EACTA,CACT,ECvJaa,EAAe,GAAwC,CAC9DC,EAAO,QACL,MAAM,QAAQA,EAAO,KAAK,EAC5BA,EAAO,MAAM,QAAS,GAAS,CAC7BH,EAAWX,CAAI,CACjB,CAAC,EAEDW,EAAWG,EAAO,KAAK,GAG3BA,EAAO,UAAU,QAAS,GAAU,CAClCD,EAAYE,CAAK,CACnB,CAAC,CACH,ECTaC,EAAoC,GAA4B,CAC3E,IAAMC,EAAO,OAAO,KAAKC,CAAM,EACzBC,EAAgC,CAAC,EACvC,IAAK,IAAI3B,EAAI,EAAGA,EAAIyB,EAAK,OAAQ,IAAK,CACpC,IAAMG,EAAIH,EAAKzB,GACX4B,GAAKF,EAAOE,KACd,EAAKA,GAAKF,EAAOE,EAAE,CAAC,IAAI,EAE5B,CACA,OAAOD,CACT,EAcME,GAAoB,EAAM,IAA8B,CAC5D,IAAMC,EAAMC,EAAI,GAAGC,CAAC,EACpBD,EAAI,OAAO,OAAOD,CAAG,CACvB,EAEMG,GACJ,EACA,IACG,CACH,IAAMN,EAAOH,EAAYO,EAAI,MAAM,EAC7BD,EAAMC,EAAI,GAAGJ,CAAI,EACvBI,EAAI,OAAO,OAAOD,CAAG,CACvB,EAEMI,GAAkB,EAAgB,IAAmC,CAEzE,IAAMC,EAAS,IAAIjB,EADJF,EAAGU,EAAO,IAAI,CACC,CAAM,EAE9BlB,EAAOY,EAAWM,EAAQ,CADG,SAAQ,IACT,EAAGG,CAAU,EAE/C,OADAM,EAAO,YAAY3B,CAAI,EAChB2B,CACT,EAEMC,GACJ,EACA,IACkB,CAGlB,IAAMD,EAAS,IAAIjB,EADPF,EADCQ,EAAYE,CACP,CACY,CAAG,EAE3BK,EAAkC,CAAC,SAAQ,SAAQ,IAAE,EAErDN,EAAO,OAAO,KAAKC,CAAM,EAC/B,IAAK,IAAI1B,EAAI,EAAGA,EAAIyB,EAAK,OAAQ,IAAK,CACpC,IAAMG,EAAIH,EAAKzB,GACf,GAAI4B,GAAKF,EAAOE,GAAI,CAClB,IAAMpB,EAAOY,EAAWM,EAAOE,GAAIG,EAAKE,CAAgB,EACxDE,EAAO,YAAY3B,CAAI,CACzB,CACF,CAEA,OAAO2B,CACT,EAQA,SAAgBE,EAAQ,EAAa,EAAsC,CACzE,OAAOX,aAAkBX,EACrBmB,EAASR,EAAQV,CAAE,EACnBoB,EAAeV,EAAQV,CAAE,CAC/B,CC3FA,MAAasB,GAAS,EAAU,IAAqB,CACnD,IAAMzC,EAAI0C,EAAItB,GACd,GAAIpB,IAAM,IAAA,GAAW,MAAU,WAAW,SAASoB,EAAM,cAAc,EACvE,OAAOpB,CACT,ECGa2C,EAAO,QAAQ,KAAK,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAYtDC,kBAAW,IAAI,QACfC,EAAS,SAAS,iBACtB,SACA,WAAW,aAAe,WAAW,YACvC,EAEMC,EAAW,GACfC,EAAK,OAAS,QAAUJ,EAAO,OAAOA,EAAK,KAEvCK,GAAY,GAAgBC,EAAG,aAAaN,CAAI,EAChDO,GAAW,GAAgBD,EAAG,gBAAgBN,CAAI,EAClDQ,GAAW,GAAkBJ,EAAK,KAAK,KAAK,IAAMJ,EAElDS,IACJ,EACA,KAEA5D,EAAkB,YAAY6D,EAAK,IAAI,EAChC,CACL,MAAOA,EAAK,KACZ,SAAUA,EAAK,YACjB,GAGIC,IACJ,EACA,IACkC,CAClC,IAAM1C,EAAuC,CAAC,EAY9C,OAXA2C,EAAM,aAAa,QAAS,GAAgB,CAC1C,IAAMR,EAAOS,EAAYhE,CAAe,EACpCuD,EAAK,kBAAkB7B,GACzB6B,EAAK,IAAIA,EAAK,OAAO,IAAI,EAAGA,EAAK,OAAO,EACxCnC,EAAM,KAAKW,EAAWwB,EAAK,OAAQA,EAAK,QAASA,EAAK,GAAG,CAAC,GAG1DA,EAAK,IAAIA,EAAK,OAAQA,EAAK,OAAO,CAEtC,CAAC,EAEM,CAAC,OAAK,CACf,EAKMU,GACJ,EACA,EACA,EACA,EACA,IACG,CACH,EAAO,YAAcC,EACrB,IAAIlE,EAAOqD,EAAO,SAAS,EACvBc,EAAY,EACZC,EAAY,EAChB,KAAOpE,IAAS,MAAQoE,EAAYC,EAAM,QACpCC,EAAItE,EAAMmE,EAAWC,CAAS,IAChCG,EAAM,KAAK,CAAC,KAAMtB,EAAGoB,EAAOD,CAAS,EAAG,MAAI,CAAC,EACzCI,GAASA,EAAQ,KAAKL,CAAS,EACnC,IACInE,EAAK,WAAa,KAAK,cAAc0D,GAAQ1D,CAAe,GAElE,EAAOqD,EAAO,SAAS,EACvB,IAKF,EAAO,YAAc,QACvB,EAEaoB,IACX,EACA,GAAGJ,IACM,CAET,IAAIH,EACEK,EAAqC,CAAC,EAEtCG,EAAQtB,EAAS,IAAIuB,CAAI,EAC/B,GAAID,EACF,EAAO,SAAS,WAAWA,EAAM,GAAG,QAAS,EAAI,EAC7CL,GAASA,EAAM,OAAS,GAC1BJ,EACEC,EACAG,EACAE,GACC,EAAO,EAAW,IAAcJ,IAAcO,EAAM,QAAQN,EAC/D,MAEG,CACL,IAAMQ,EAAW,SAAS,cAAc,UAAU,EAClD,EAAS,UAAYC,GAAMF,EAAM,GAAGN,CAAK,EACzC,IAAMS,EAAW,CAAC,GAAIF,EAAU,QAAS,CAAC,CAAC,EAC3C,EAAO,SAAS,WAAWA,EAAS,QAAS,EAAI,EAE7CP,GAASA,EAAM,OAAS,GAC1BJ,EACEC,EACAG,EACAE,EACC,GACCvE,EAAK,WAAa,KAAK,aACnBwD,GAASxD,CAAe,EACxBA,EAAK,WAAa,KAAK,cAAgB2D,GAAQ3D,CAAe,EACpE8E,EAAI,OACN,EAGF1B,EAAS,IAAIuB,EAAMG,CAAG,CACxB,CAEA,GAAIP,EAAM,SAAWF,EAAM,OACzB,MAAU,MACR,sEACF,EAEF,IAAMU,EAAyC,CAAC,EAWhD,OAVAR,EAAM,SAAS,CAAC,OAAM,UAAU,CAC1BhB,EAAK,OAAS,QAChBwB,EAAQ,KACNjB,GAAYP,EAAMvD,CAAI,CACxB,EACSuD,EAAK,OAAS,QACvBwB,EAAQ,KAAKnB,GAAWL,EAAMvD,CAAI,CAAC,CAEvC,CAAC,EAEM,CACL,KAAM,OACN,KAAMkE,EACN,aAAca,CAChB,CACF,EAEMF,IAAS,EAA4B,GAAGG,IAA+B,CAC3E,IAAIC,EAAON,EAAK,IAAM,GACtB,IAAK,IAAIhE,EAAI,EAAGA,EAAIqE,EAAM,OAAQ,IAChC,GAAQ1B,EAAQL,EAAG+B,EAAOrE,CAAC,CAAC,GAAKgE,EAAKhE,EAAI,IAAM,IAElD,OAAOsE,CACT,ECzIalB,GAAS,GAAGmB,KAA2C,CAClE,KAAM,QACN,cACF,GAIMC,GAEF,EACA,EACA,IAED,IAAU,CACT,SACA,QAASC,EAAQ,CAAC,KAAMC,EAAM,OAAK,EAAI,CAAC,KAAMA,CAAI,EAClD,KACF,GAGIC,EAAQ,GAA8B,CAC1C,IAAM1E,EAAM8B,EAAI,QAAQ,GACxB,GAAI,CAAC9B,EAAK,MAAU,MAAM,kBAAkB,EAC5C,OAAOA,CACT,EAEM2E,IAAY,EAAQ,IAAsB,CAC9C,EAAK,KAAiB,GAAK,OAAO1E,CAAG,CACvC,EAEa2E,GAAS,GACpBL,EAAa9C,EAAQ,IAAA,GAAWkD,EAAK,EAEjCE,IAAa,EAAQ,IAAsB,CAC/C,EAAK,KAAoC,MAAQ,OAAO5E,CAAG,CAC7D,EAEaA,EAAU,GACrBsE,EAAa9C,EAAQ,IAAA,GAAWoD,EAAM,EAElCC,GAAc,EAAQ,IAAsB,CAChDhD,EAAK,KAAiB,aAAa4C,EAAK5C,CAAG,EAAG,OAAO7B,CAAG,CAAC,CAC3D,EAEa8E,GAAW,EAAoB,IAC1CR,EAAa9C,EAAQ,CAACzB,CAAG,EAAG8E,CAAO,EAQ/BE,GAAe,EAAQ,IAAsB,CACjD,EAAK,KAAqB,MAAMN,EAAK5C,CAAG,GAAyB,OAAO7B,CAAG,CAC7E,EAEagF,GACX,EACA,IACmBV,EAAa9C,EAAQ,CAACzB,CAAG,EAAGgF,CAAQ,EAEnDE,GAAuB,EAAQ,IAAsB,CACzDpD,EAAK,KAAqB,MAAM,YAAY4C,EAAK5C,CAAG,EAAG,OAAO7B,CAAG,CAAC,CACpE,EAEakF,GACX,EACA,IACmBZ,EAAa9C,EAAQ,CAACzB,CAAG,EAAGkF,CAAgB,EAE3DE,GAAqB,EAAQ,IAAsB,CACvDtD,EAAK,KAAiB,UAAU,OAAO4C,EAAK5C,CAAG,EAAG,EAAQ7B,CAAI,CAChE,EAEaoF,GACX,EACA,IACmBd,EAAa9C,EAAQ,CAAC6D,CAAK,EAAGF,CAAc,EAE3DG,GAAuB,EAAQ,IAAsB,CACzDzD,EAAI,OAAO,QAAS,GAAU,CAC5BA,EAAK,KAAiB,UAAU,OAAOwD,EAAiB,EAAQrF,CAAI,CACtE,CAAC,CACH,EAEauF,GACX,EACA,GAAGC,IACgBlB,EAAa9C,EAAQgE,EAAQF,CAAgB,EAI5DG,GAAa,EAAQ,IAAsB,CAC/C,IAAM3E,EAAKe,EAAI,QAAQ,GACvB,GAAI,CAACf,EAAI,MAAU,MAAM,oBAAoB,EAC7CA,EAAGe,EAAI,KAAM7B,CAAG,CAClB,EAEa0F,GAAU,EAAoB,IACzCpB,EAAa9C,EAAQ,CAACV,CAAE,EAAG2E,CAAM,EAO7BE,GAAS,EAAmB,IAAsB,CACtD,IAAMC,EAAO/D,EAAI,QAAQ,GACnBgE,EAAUhE,EAAI,QAAQ,GAI5B,GAAI,CAAC+D,EAAM,MAAU,MAAM,sBAAsB,EACjD/D,EAAI,KAAK,iBACP+D,EACAE,EACAD,CACF,CACF,EAEaE,GACX,EACA,EACA,IAC8BzB,EAAawB,EAAU,CAACF,EAAMC,CAAO,EAAGF,CAAK,ECpJhEK,IAAU,EAAoC,IAAe,CACxE,IAAMhD,EAAO,OAAOiD,GAAY,WAAaA,EAAQ,EAAIA,EACzD9G,EAAK,YAAY6D,EAAK,IAAI,CAC5B,ECuBMkD,GAAc,EAAQ,IAAwB,CAClD,IAAMlD,EAAOnB,EAAI,OAAO7B,CAAG,EACrBX,EAAc8G,EAAgBtE,EAAI,SAAUmB,CAAI,EAClDnB,EAAI,MAAMZ,EAAWY,EAAI,IAAI,EACjCA,EAAI,cAAc,QAAS,GAAW,CACpCV,EAAYC,CAAM,CACpB,CAAC,EACD,EAAI,SAAW/B,EACf,EAAI,KAAO2D,EAAK,KAChB,EAAI,aAAeA,EAAK,YAC1B,EAEaA,IACX,EACA,IAC4B,CAC5B,IAAMA,EAAOoD,EAAO1F,EAAI,IAAI,CAAC,EAIvBmB,EAAsB,CAC1B,SAHewE,EAAgBrD,CAGxB,EACP,KAAMA,EAAK,KACX,SACA,aAAcA,EAAK,YACrB,EAEM1C,EAAOY,EAAWR,EAAKmB,EAAKqE,CAAO,EAEzC,MAAO,CACL,GAAGlD,EACH,MACF,CACF,EAEaqD,EAAmB,GAAyBnH,EAAW8D,EAAK,IAAI,EAEhEmD,GAAmB,EAAe,IACtC/G,EAAgBE,EAAK0D,EAAK,IAAI,ECpBjCsD,EAAkB,GAAoB,CAC1CxH,EAAeyH,EAAM,QAAQ,EACzBA,EAAM,MAAMtF,EAAWsF,EAAM,IAAI,EACrCA,EAAM,cAAc,QAAS,GAAW,CACtCpF,EAAYC,CAAM,CACpB,CAAC,EACD,EAAM,QAAU,EAClB,EAEMoF,IAAgB,EAAY,IAA0B,CAC1D,GAAI,CAAC,MAAM,QAAQhD,CAAK,GAAKA,EAAM,SAAW,EAAG,CAC/C,IAAMiD,EAAU,SAAS,uBAAuB,EAChDA,EAAQ,YAAY,SAAS,cAAc,YAAY,CAAC,EAExD,EAAI,SADgBrH,EAAgByC,EAAI,SAAU4E,CACzB,EACzB5E,EAAI,OAAO,QAAQyE,CAAW,EAC9B,EAAI,OAAS,CAAC,EACd,MACF,CACA,IAAMI,EAAwB,CAAC,EAC/B,GAAI,CAAC,MAAM,QAAQ7E,EAAI,MAAM,GAAKA,EAAI,OAAO,SAAW,EAAG,CACzD,IAAM4E,EAAUE,EAAMnD,EAAO3B,EAAI,KAAM6E,CAAS,EAEhD,EAAI,SADgBtH,EAAgByC,EAAI,SAAU4E,CACzB,EAEzB,EAAI,OAASC,EACb,MACF,CAEA,IAAME,EAAQ/E,EAAI,SAAS,MACrBgF,EAAMhF,EAAI,SAAS,IACnB9C,EAAS6H,EAAM,WACrB,GAAI,CAAC7H,EAAQ,MAAU,MAAM,gBAAgB,EAE7C,IAAM+H,EAAUjF,EAAI,KAAK,SAAWjC,EAC9BmH,EAAUvD,EAAM,IAAK,GAAS3B,EAAI,KAAK,IAAIa,CAAI,CAAC,EAChDsE,EAASnF,EAAI,OAKnB,GAAImF,EAAO,SAAWxD,EAAM,QACRwD,EAAO,OAAO,EAAO,IAAM,CAC3C,IAAMtE,EAAOc,EAAM1D,GACnB,OAAOyG,EAAM,MAAQQ,EAAQjH,IAAMgH,EAAQP,EAAM,KAAM7D,CAAI,CAC7D,CACY,EAAG,OAGjB,IAAMuE,EAAa,SAAS,cAAc,oBAAoB,EACxDC,EAAW,SAAS,cAAc,kBAAkB,EAE1DnI,EAAO,aAAakI,EAAYL,CAAK,EACrC7H,EAAO,aAAamI,EAAUL,EAAI,WAAW,EAE7C,IAAMM,EAAuB,CAC3B,SACA,aACA,UACF,EAEMC,EAAUJ,EAAO,IAAK,GAAUT,EAAM,GAAG,EAE3Cc,EACAC,EAEAC,EAAU,EACVC,EAAU3F,EAAI,OAAO,OAAS,EAC9B4F,EAAU,EACVC,EAAUlE,EAAM,OAAS,EAE7B,KAAO+D,GAAWC,GAAWC,GAAWC,GACtC,GAAI7F,EAAI,OAAO0F,EAAQ,EAAE,QAGvB,SACK,GAAI1F,EAAI,OAAO2F,EAAQ,EAAE,QAG9B,SACK,GAAI3F,EAAI,OAAO0F,EAAQ,EAAE,MAAQR,EAAQU,GAI9C,EAAUA,GAAWE,EACnBvF,EAAGP,EAAI,OAAQ0F,CAAO,EACtBnF,EAAGoB,EAAOiE,CAAO,EACjB5F,EAAI,KACJiF,CACF,EACA,IACA,SACK,GAAIjF,EAAI,OAAO2F,EAAQ,EAAE,MAAQT,EAAQW,GAI9C,EAAUA,GAAWC,EACnBvF,EAAGP,EAAI,OAAQ2F,CAAO,EACtBpF,EAAGoB,EAAOkE,CAAO,EACjB7F,EAAI,KACJiF,CACF,EACA,IACA,SACK,GAAIjF,EAAI,OAAO0F,EAAQ,EAAE,MAAQR,EAAQW,GAO9C,EAAUA,GAAWC,EACnBvF,EAAGP,EAAI,OAAQ0F,CAAO,EACtBnF,EAAGoB,EAAOkE,CAAO,EACjB7F,EAAI,KACJiF,CACF,EAIAc,EACET,EACA/E,EAAGsE,EAAWgB,CAAO,EACrBG,GAAaV,EAAWT,EAAUgB,EAAU,EAAE,CAChD,EACA,IACA,SACK,GAAI7F,EAAI,OAAO2F,EAAQ,EAAE,MAAQT,EAAQU,GAQ9C,EAAUA,GAAWE,EACnBvF,EAAGP,EAAI,OAAQ2F,CAAO,EACtBpF,EAAGoB,EAAOiE,CAAO,EACjB5F,EAAI,KACJiF,CACF,EAGAc,EACET,EACA/E,EAAGsE,EAAWe,CAAO,EACrBK,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EACA,IACA,SAMA,IAJIJ,IAAqB,IAAA,IAAaC,IAAqB,IAAA,MACzD,EAAmBS,EAAahB,EAASU,EAASC,CAAO,EACzD,EAAmBK,EAAaX,EAASG,EAASC,CAAO,GAEvD,CAACH,EAAiB,IAAID,EAAQG,EAAQ,EAGxCjB,EAAYlE,EAAGP,EAAI,OAAQ0F,CAAO,CAAC,EACnC,SACK,GAAI,CAACF,EAAiB,IAAID,EAAQI,EAAQ,EAG/ClB,EAAYlE,EAAGP,EAAI,OAAQ2F,CAAO,CAAC,EACnC,QACK,CACL,IAAMQ,EAAWV,EAAiB,IAAIP,EAAQU,EAAQ,EAChDQ,EAAWD,IAAa,IAAA,GAAmC,KAAvBnG,EAAI,OAAOmG,GACjDC,GAMF,EAAUR,GAAWE,EACnBM,EACA7F,EAAGoB,EAAOiE,CAAO,EACjB5F,EAAI,KACJiF,CACF,EAEAc,EACET,EACA/E,EAAGsE,EAAWe,CAAO,EACrBK,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EACA,EAAS,QAAU,IAKnB,EAAUA,GAAWS,EACnBf,EACA/E,EAAGoB,EAAOiE,CAAO,EACjB5F,EAAI,KACJiG,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EAEF,GACF,CAIJ,KAAOA,GAAWC,GAEhB,EAAUD,GAAWS,EACnBf,EACA/E,EAAGoB,EAAOiE,CAAO,EACjB5F,EAAI,KACJiG,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EACA,IAGF,KAAOF,GAAWC,GAEZ,CAAC3F,EAAI,OAAO0F,EAAQ,EAAE,SAAW,CAAC1F,EAAI,OAAO0F,EAAQ,EAAE,SACzDjB,EAAYlE,EAAGP,EAAI,OAAQ0F,CAAO,CAAC,EACrC,IAGF,GAAI,CAACJ,EAAU,WAAW,aAAe,CAACA,EAAU,SAAS,gBAC3D,MAAU,MAAM,wBAAwB,EAE1C,EAAI,SAAW,CACb,MAAOA,EAAU,WAAW,YAC5B,IAAKA,EAAU,SAAS,eAC1B,EACAA,EAAU,OAAO,YAAYA,EAAU,UAAU,EACjDA,EAAU,OAAO,YAAYA,EAAU,QAAQ,EAC/C,EAAI,OAAST,CACf,EAEMqB,GAAgB,EAAiB,EAAe,IAAgB,CACpE,IAAMI,kBAAM,IAAI,IAChB,IAAK,IAAI,EAAIvB,EAAO,GAAKC,EAAK,IAC5BsB,EAAI,IAAIC,EAAK,GAAI,CAAC,EAEpB,OAAOD,CACT,EAEMN,IAAmB,EAAsB,IAC7CtB,EAAQA,EAAM,SAAS,MAAQY,EAAU,SACrCW,GAAkB,EAAsB,IAA2B,CACvE,IAAM3I,EAAOoH,EAAQA,EAAM,SAAS,IAAMY,EAAU,WACpD,GAAI,CAAChI,EAAK,YAAa,MAAU,MAAM,gBAAgB,EACvD,OAAOA,EAAK,WACd,EAEMkJ,GAAiB,EAAoB,EAAY,IAAuB,CACxEtJ,EAAO,WAAYA,EAAO,WAAWI,EAAMkC,CAAK,EAC/CtC,EAAO,aAAaI,EAAMkC,CAAK,CACtC,EAEMuG,GAAiB,EAAsB,EAAiB,IAAgB,CAC5E,IAAM7I,EAASoI,EAAU,OAEzB,GAAIZ,EAAM,SAAS,QAAUA,EAAM,SAAS,IAC1C8B,EAActJ,EAAQwH,EAAM,SAAS,MAAO+B,CAAK,MAC9C,CACH,IAAI/I,EAAiBgH,EAAM,SAAS,MACpC,KAAOhH,GAAG,CACR,IAAMN,EAAoBM,EAAE,YAE5B,GADA8I,EAActJ,EAAQQ,EAAG+I,CAAK,EAC1B/I,IAAMgH,EAAM,SAAS,IAAK,MAC9B,EAAItH,CACN,CACF,CACF,EAEMiJ,GACJ,EACA,EACA,EACA,IACa,CACb,IAAMlF,EAAOuF,EAAK,KAAK7F,CAAI,EACrB8F,EAAWnC,EAAgBrD,CAAI,EAErC,OADAmE,EAAU,OAAO,aAAanE,EAAK,KAAMsF,CAAK,EACvC,CACL,IAAKC,EAAK,IAAI7F,CAAI,EAClB,WACA,KAAMM,EAAK,KACX,aAAcA,EAAK,aACnB,MACF,CACF,EAEM2E,GACJ,EACA,EACA,EACA,IACa,CACb,GAAIb,EAAQxH,EAAI,KAAMoD,CAAI,EACxB,MAAO,CACL,GAAGpD,EACH,QAAS,GACT,QAAS,EACX,EAGF,IAAM0D,EAAOuF,EAAK,KAAK7F,CAAI,EACrBrD,EAAc8G,EAAgB7G,EAAI,SAAU0D,CAAI,EAWtD,OAVAsD,EAAYhH,CAAG,EAUR,CAPL,IAAKiJ,EAAK,IAAI7F,CAAI,EAClB,SAAUrD,EACV,KAAM2D,EAAK,KACX,aAAcA,EAAK,aACnB,MAGY,CAChB,EAEM2D,GACJ,EACA,EACA,IACqB,CACrB,IAAMtD,EAAO,SAAS,uBAAuB,EAmB7C,OAlBAG,EAAM,QAAS,GAAS,CACtB,IAAMR,EAAOuF,EAAK,KAAK7F,CAAI,EACrB3C,EAAMwI,EAAK,IAAI7F,CAAI,EAEnB8F,EAAWnC,EAAgBrD,CAAI,EACrCgE,EAAO,KAAK,CACV,MACA,WACA,KAAMhE,EAAK,KACX,OACA,aAAcA,EAAK,YACrB,CAAC,EACDK,EAAK,YAAYL,EAAK,IAAI,CAC5B,CAAC,EAEGK,EAAK,WAAW,SAAW,GAC7BA,EAAK,YAAY,SAAS,cAAc,YAAY,CAAC,EAEhDA,CACT,EAEaoF,IACX,EACA,IACgC,CAChC,IAAMzB,EAAqB,CAAC,EACtB3D,EAAOsD,EAAMjG,EAAI,IAAI,EAAG6H,EAAMvB,CAAM,EAEpCnF,EAAwB,CAAC,OAAM,SAAQ,SAAU3C,EAAWmE,CAAI,CAAC,EAGvE,MAAO,CACL,KAAM,OACN,KAAMA,EACN,KALWnC,EAAWR,EAAKmB,EAAK2E,EAK7B,CACL,CACF,ECjZMkC,IAAc,EAAQ,IAAsB,CAChD,EAAI,KAAK,YAAc,OAAO1I,CAAG,CACnC,EAEaoE,GAAW,GAA8C,CACpE,IAAMA,EAAO,SAAS,eACpB5C,aAAkBX,EAAM,OAAOW,EAAO,IAAI,CAAC,EAAI,OAAOA,CAAM,CAC9D,EACMK,EAAoB,CAAC,KAAMuC,CAAI,EAGrC,MAAO,CACL,KAAM,OACN,KAAMA,EACN,KAJA5C,aAAkBX,EAAMK,EAAWM,EAAQK,EAAK6G,EAAO,EAAI,IAAA,EAK7D,CACF"}
+{"version":3,"file":"sigula.js","names":["removeBoundary","parent","b","next","toBoundary","node","replaceWithNode","newBoundary","old","n","isEquatable","value","isEqual","a","i","key","val","arrA","arrB","ao","bo","aKeys","bKeys","QUEUE","bind","binds","removed","cmd","sig","context","err","Sig","v","fn","index","DerivedSig","f","createBind","first","removeBind","cleanCommit","commit","child","computeCmd","ctx","s","computeRecordCmd","vals","k","_compute","target","source","_computeRecord","entries","entry","compute","at","arr","MARK","tplCache","walker","_walker","_toMark","item","_shape","items","shape","bits","_hasMark","el","_rmMark","_isView","commitView","view","commitPatch","patch","toPatchItem","_scan","w","frag","nodeIndex","itemIndex","hit","wraps","indexes","html","slots","strs","exist","template","_text","tpl","commits","boundary","parts","text","toPatchItems","_toPatchItem","extra","elem","_key","idCmd","id","valCmd","attrCmd","attr","styleCmd","style","stylePropertyCmd","styleProperty","toggleClassCmd","toggleClass","token","toggleClassesCmd","toggleClasses","tokens","actCmd","act","onCmd","type","options","listener","on","render","viewArg","viewCmd","replaceWithView","viewFn","extractBoundary","_cleanTrack","track","repeatCmd","newFrag","newTracks","_init","start","end","compare","newKeys","tracks","startFence","endFence","container","oldKeys","newKeyToIndexMap","oldKeyToIndexMap","oldHead","oldTail","newHead","newTail","_setTrack","_moveTrack","_beforeFence","_afterFence","_generateMap","oldIndex","oldTrack","_insertNewTrack","map","list","_mvNodeBefore","fence","prop","repeat","textCmd"],"sources":["../src/boundary.ts","../src/eq.ts","../src/sig.bind.ts","../src/commit.ts","../src/compute.ts","../src/utils.ts","../src/html.ts","../src/patch.ts","../src/render.ts","../src/view.ts","../src/repeat.ts","../src/text.ts"],"sourcesContent":["export interface Boundary {\n  start: Node;\n  end: Node;\n}\n\nexport const removeBoundary = (b: Boundary) => {\n  const parent = b.start.parentNode;\n  if (!parent) {\n    return;\n  }\n\n  if (b.start === b.end) parent.removeChild(b.start);\n  else {\n    // walking siblings is faster than a Range\n    let n: Node | null = b.start;\n    while (n) {\n      const next: Node | null = n.nextSibling;\n      parent.removeChild(n);\n      if (n === b.end) break;\n      n = next;\n    }\n  }\n};\n\nexport const toBoundary = (node: Node): Boundary => {\n  const b =\n    node.nodeType === Node.DOCUMENT_FRAGMENT_NODE\n      ? {start: node.firstChild, end: node.lastChild}\n      : {start: node, end: node};\n  if (!b.start || !b.end) throw new Error('toBoundary: empty fragment');\n  return b as Boundary;\n};\n\nexport const replaceWithNode = (old: Boundary, node: Node) => {\n  const newBoundary = toBoundary(node);\n  const parent = old.start.parentNode;\n  if (!parent)\n    throw new Error('replaceWithNode: old boundary has no parentNode');\n\n  if (old.start === old.end) {\n    parent.replaceChild(node, old.start);\n  } else {\n    let n = old.start.nextSibling;\n    parent.replaceChild(node, old.start);\n    while (n) {\n      const next = n.nextSibling;\n      parent.removeChild(n);\n      if (n === old.end) break;\n      n = next;\n    }\n  }\n\n  return newBoundary;\n};\n","export interface Equatable {\n  equals(other: unknown): boolean;\n}\n\nconst isEquatable = (value: unknown): value is Equatable =>\n  typeof value === 'object' &&\n  value !== null &&\n  'equals' in value &&\n  typeof value.equals === 'function';\n\nexport type UnknownRecord = Record<string, unknown>;\n\nexport const isEqual = <T>(a: T, b: T): boolean => {\n  if (a === b) return true;\n  if (typeof a !== typeof b) return false;\n\n  if (a === null || b === null || typeof a !== 'object') return false;\n\n  if (isEquatable(a)) return a.equals(b);\n\n  // may let Array always return false\n  // if (Array.isArray(a) || Array.isArray(b)) return false;\n  if (Array.isArray(a) && Array.isArray(b)) {\n    if (a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (!isEqual(a[i], b[i])) return false;\n    }\n    return true;\n  }\n\n  // Date\n  if (a instanceof Date && b instanceof Date)\n    return a.getTime() === b.getTime();\n\n  // RegExp\n  if (a instanceof RegExp && b instanceof RegExp) {\n    return a.toString() === b.toString();\n  }\n\n  // Map\n  if (a instanceof Map && b instanceof Map) {\n    if (a.size !== b.size) return false;\n    for (const [key, val] of a) {\n      if (!b.has(key) || !isEqual(val, b.get(key))) return false;\n    }\n    return true;\n  }\n\n  // Set\n  if (a instanceof Set && b instanceof Set) {\n    if (a.size !== b.size) return false;\n    const arrA = Array.from(a);\n    const arrB = Array.from(b);\n    return isEqual(arrA, arrB);\n  }\n\n  // Object & Record\n  // Reject different prototypes before falling back to a key comparison.\n  // Object.keys is [] for Date, Map, Set, RegExp, Error and [], so without\n  // this guard isEqual([], {}) and isEqual(new Date(0), {}) both report\n  // equal and Sig.update silently swallows a shape-changing write.\n  // Must stay BELOW the isEquatable check above: hoisting it stops a user\n  // Equatable from ever being consulted.\n  if (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false;\n\n  // both are objects sharing one prototype from here on, and the length check\n  // plus Object.hasOwn below prove the two key sets are identical, so ao[key]\n  // is always an own property\n  const ao = a as UnknownRecord;\n  const bo = b as UnknownRecord;\n\n  const aKeys = Object.keys(ao);\n  const bKeys = Object.keys(bo);\n  if (aKeys.length !== bKeys.length) return false;\n\n  for (let i = 0; i < aKeys.length; i++) {\n    const key = aKeys[i] as string;\n    if (!Object.hasOwn(bo, key)) return false;\n    if (!isEqual(ao[key], bo[key])) return false;\n  }\n\n  return true;\n};\n","import type {Cmd, CmdContext} from './cmd';\nimport {type Equatable, isEqual} from './eq';\n\nexport interface Bind<T, C extends CmdContext> {\n  sig: Sig<T>;\n  context: C;\n  cmd: Cmd<T, C>;\n  removed: boolean;\n  queued?: boolean;\n}\n\n// biome-ignore lint/suspicious/noExplicitAny: any bind\nexport type AnyBind = Bind<any, any>;\n\nclass Queue {\n  private _binds: AnyBind[] = [];\n  private head = 0;\n  private running = false;\n  private scheduled = false;\n\n  addAll(binds: readonly AnyBind[]): this {\n    for (const bind of binds) {\n      if (bind.queued) continue;\n      bind.queued = true;\n      this._binds.push(bind);\n    }\n    if (this._binds.length > this.head) this.kick();\n    return this;\n  }\n\n  private kick(): void {\n    if (this.running || this.scheduled) return;\n    this.scheduled = true;\n    queueMicrotask(() => {\n      this.running = true;\n      this.scheduled = false;\n      this.flush();\n    });\n  }\n\n  private flush(): void {\n    this.running = true;\n    try {\n      while (this.head < this._binds.length) {\n        const bind = this._binds[this.head++]!;\n        try {\n          const {removed, sig, context, cmd} = bind;\n          if (!removed) cmd(sig.get(), context);\n        } catch (err) {\n          console.error('[Queue] task failed:', err, bind);\n        } finally {\n          // re-arm after running: cmd reads sig.get() at call time, so a bind\n          // that runs after a write already sees the newest value and must\n          // not re-run, while one that ran before it has to be queued again\n          bind.queued = false;\n        }\n      }\n    } finally {\n      this.running = false;\n      if (this.head < this._binds.length) {\n        // almost impossible in js/ts\n        this._binds = this._binds.slice(this.head);\n        this.head = 0;\n        this.kick();\n      } else {\n        this._binds.length = 0;\n        this.head = 0;\n      }\n    }\n  }\n}\n\nconst QUEUE = new Queue();\n\nexport class Sig<T> implements Equatable {\n  private _val: T;\n  private _binds: AnyBind[] = [];\n\n  constructor(val: T) {\n    this._val = val;\n  }\n\n  equals(b: unknown) {\n    if (b instanceof Sig) return isEqual(this.get(), b.get());\n    return false;\n  }\n\n  get(): T {\n    return this._val;\n  }\n\n  forceUpdate(v: T) {\n    this._val = v;\n    QUEUE.addAll(this._binds);\n  }\n\n  update(v: T) {\n    if (isEqual(v, this._val)) return;\n    this.forceUpdate(v);\n  }\n\n  trans(fn: (v: T) => T) {\n    this.update(fn(this._val));\n  }\n\n  addBind<C extends CmdContext>(bind: Bind<T, C>) {\n    this._binds.push(bind);\n  }\n\n  removeBind(bind: Bind<T, CmdContext>) {\n    const index = this._binds.indexOf(bind);\n    if (index >= 0) this._binds.splice(index, 1);\n    if (this._binds.length === 0) {\n      this.cleanup();\n    }\n  }\n\n  getBinds(): Bind<T, CmdContext>[] {\n    return this._binds;\n  }\n\n  // empty: DerivedSig overrides this to detach from its sources when its last\n  // observer goes away\n  cleanup() {}\n}\n\nexport class DerivedSig<T> extends Sig<T> {\n  private _fromBinds: AnyBind[] = [];\n  private _linked = true;\n\n  addFromBind<S, C extends CmdContext>(bind: Bind<S, C>) {\n    this._fromBinds.push(bind);\n  }\n\n  // A derived signal's upstream links are torn down when its last observer\n  // goes away, which happens any time a view() subtree is hidden. The links\n  // cannot be revived in place because removeBind marks them removed, so we\n  // rebuild fresh binds from each recipe and recompute once: sources usually\n  // moved while we were detached.\n  //\n  // super.addBind must stay first: the recompute below updates this signal\n  // straight away, so the returning observer has to be registered before it\n  // or it misses the value and only catches up on some later update.\n  override addBind<C extends CmdContext>(bind: Bind<T, C>) {\n    super.addBind(bind);\n    if (this._linked) return;\n    this._linked = true;\n    for (let i = 0; i < this._fromBinds.length; i++) {\n      const f = this._fromBinds[i]!;\n      this._fromBinds[i] = createBind(f.sig, f.context, f.cmd);\n    }\n    // every from-bind shares one context whose cmd reads all sources, so one\n    // invocation recomputes the whole derived value\n    const first = this._fromBinds[0];\n    if (first) first.cmd(first.sig.get(), first.context);\n  }\n\n  override cleanup() {\n    if (!this._linked) return;\n    this._linked = false;\n    for (const b of this._fromBinds) removeBind(b);\n  }\n}\n\nexport const sig = <T>(v: T) => new Sig(v);\n\nexport const removeBind = (bind: Bind<unknown, CmdContext>) => {\n  bind.removed = true;\n  bind.sig.removeBind(bind);\n};\n\nexport const createBind = <T, C extends CmdContext>(\n  sig: Sig<T>,\n  context: C,\n  cmd: Cmd<T, C>,\n): Bind<T, C> => {\n  const bind: Bind<T, C> = {sig, context, cmd, removed: false, queued: false};\n  sig.addBind(bind);\n  return bind;\n};\n","import type {CmdContext} from './cmd';\nimport {type Bind, removeBind} from './sig.bind';\n\n// biome-ignore lint/suspicious/noExplicitAny: Commit with any context\nexport interface Commit<T, C extends CmdContext = any> {\n  binds: Bind<T, C> | Bind<T, C>[] | undefined;\n  // biome-ignore lint/suspicious/noExplicitAny: Commit.children with any context\n  children?: Commit<unknown, any>[] | undefined;\n}\n\nexport const cleanCommit = (commit: Commit<unknown, CmdContext>) => {\n  if (commit.binds) {\n    if (Array.isArray(commit.binds)) {\n      commit.binds.forEach((bind) => {\n        removeBind(bind);\n      });\n    } else {\n      removeBind(commit.binds);\n    }\n  }\n  commit.children?.forEach((child) => {\n    cleanCommit(child);\n  });\n};\n","import type {CmdContext} from './cmd';\nimport {createBind, DerivedSig, Sig} from './sig.bind';\n\nexport interface SigRecord {\n  // biome-ignore lint/suspicious/noExplicitAny: any sig val\n  [key: string]: Sig<any>;\n}\n\nexport type ValRecord<K extends SigRecord> = {\n  [P in keyof K]: K[P] extends Sig<infer U> ? U : never;\n};\n\n// biome-ignore lint/suspicious/noExplicitAny: heterogeneous source sigs\ntype ComputeEntry = [string, Sig<any>];\n\ninterface ComputeContext<S, T> extends CmdContext {\n  target: Sig<T>;\n  fn: (s: S) => T;\n}\n\ninterface ComputeRecordContext<S extends SigRecord, T> extends CmdContext {\n  target: Sig<T>;\n  fn: (v: ValRecord<S>) => T;\n  entries: ComputeEntry[];\n}\n\nconst computeCmd = <S, T>(s: S, ctx: ComputeContext<S, T>) => {\n  ctx.target.update(ctx.fn(s));\n};\n\nconst computeRecordCmd = <S extends SigRecord, T>(\n  _s: unknown,\n  ctx: ComputeRecordContext<S, T>,\n) => {\n  const vals: Record<string, unknown> = {};\n  for (const [k, s] of ctx.entries) vals[k] = s.get();\n  ctx.target.update(ctx.fn(vals as ValRecord<S>));\n};\n\nconst _compute = <S, T>(source: Sig<S>, fn: (v: S) => T): DerivedSig<T> => {\n  const target = new DerivedSig(fn(source.get()));\n  const ctx: ComputeContext<S, T> = {target, fn};\n  target.addFromBind(createBind(source, ctx, computeCmd));\n  return target;\n};\n\nconst _computeRecord = <S extends SigRecord, T>(\n  source: S,\n  fn: (v: ValRecord<S>) => T,\n): DerivedSig<T> => {\n  const entries: ComputeEntry[] = [];\n  const vals: Record<string, unknown> = {};\n  for (const [k, s] of Object.entries(source)) {\n    if (!k || !s) continue;\n    entries.push([k, s]);\n    vals[k] = s.get();\n  }\n\n  const target = new DerivedSig(fn(vals as ValRecord<S>));\n  const ctx: ComputeRecordContext<S, T> = {target, fn, entries};\n\n  for (const entry of entries) {\n    target.addFromBind(createBind(entry[1], ctx, computeRecordCmd));\n  }\n\n  return target;\n};\n\nexport function compute<S, T>(source: Sig<S>, fn: (v: S) => T): DerivedSig<T>;\nexport function compute<S extends SigRecord, T>(\n  source: S,\n  fn: (v: ValRecord<S>) => T,\n): DerivedSig<T>;\n// biome-ignore lint/suspicious/noExplicitAny: any source\nexport function compute(source: any, fn: (v: any) => any): DerivedSig<any> {\n  return source instanceof Sig\n    ? _compute(source, fn)\n    : _computeRecord(source, fn);\n}\n","export const at = <T>(arr: T[], index: number): T => {\n  const v = arr[index];\n  if (v === undefined) throw new RangeError(`index ${index} out of range`);\n  return v;\n};\n","import {toBoundary} from './boundary';\nimport type {CmdContext} from './cmd';\nimport type {Commit} from './commit';\nimport type {Patch, PatchContext} from './patch';\nimport {type Bind, createBind, Sig} from './sig.bind';\nimport {at} from './utils';\nimport type {AnyView, View} from './view';\n\nconst MARK = `@sig_${Math.random().toFixed(9).slice(2)}`;\n\ninterface Tpl {\n  el: HTMLTemplateElement;\n  indexes: number[];\n  // a bitmask for up to 31 slots, the string form beyond that\n  shape: number | string;\n}\n\ninterface Wrap<T, C extends CmdContext> {\n  item: Patch | View<T, C>;\n  node: Node;\n}\n\nconst tplCache = new WeakMap<TemplateStringsArray, Tpl>();\n\nlet walker: TreeWalker | undefined;\n\n// Created on first use rather than at module scope so that importing sigula\n// stays side-effect free and works where there is no document (SSR, tests).\nconst _walker = (): TreeWalker => {\n  walker ??= document.createTreeWalker(\n    document,\n    NodeFilter.SHOW_ELEMENT | NodeFilter.SHOW_COMMENT,\n  );\n  return walker;\n};\n\nconst _toMark = (item: Patch | View): string =>\n  item.type === 'patch' ? MARK : `<!--${MARK}-->`;\n\n// The markup of a call site depends on the kind of every interpolation: a patch\n// gets an attribute marker, a view gets a comment marker. Reusing a cached\n// template across a different mix would hand the wrong node type to\n// commitPatch/commitView, so the mix is part of the cache identity.\n// A bitmask is far cheaper to build and compare than a string, and 31 slots\n// keeps it a non-negative int32 — 1 << 31 flips the sign. Beyond that fall\n// back to the string form so wide templates keep working unchanged.\nconst MAX_MASKED_SLOTS = 31;\n\nconst _shape = (items: readonly (Patch | AnyView)[]): number | string => {\n  if (items.length > MAX_MASKED_SLOTS) {\n    let shape = '';\n    for (const item of items) shape += item.type === 'patch' ? 'p' : 'v';\n    return shape;\n  }\n  let bits = 0;\n  for (let i = 0; i < items.length; i++) {\n    if (items[i]?.type === 'patch') bits |= 1 << i;\n  }\n  return bits;\n};\n\nconst _hasMark = (el: Element) => el.hasAttribute(MARK);\nconst _rmMark = (el: Element) => el.removeAttribute(MARK);\nconst _isView = (item: Comment) => item.data.trim() === MARK;\n\nconst commitView = <T, C extends CmdContext>(\n  view: View<T, C>,\n  node: Node,\n): Commit<T, C> => {\n  (node as Comment).replaceWith(view.node);\n  return {\n    binds: view.bind,\n    children: view.childCommits,\n  };\n};\n\nconst commitPatch = (\n  patch: Patch,\n  node: Node,\n): Commit<unknown, PatchContext> => {\n  const binds: Bind<unknown, PatchContext>[] = [];\n  patch.toPatchItems.forEach((toPatchItem) => {\n    const item = toPatchItem(node as Element);\n    if (item.source instanceof Sig) {\n      item.cmd(item.source.get(), item.context);\n      binds.push(createBind(item.source, item.context, item.cmd));\n      // binds.push(item.source, item.context, item.cmd);\n    } else {\n      item.cmd(item.source, item.context);\n    }\n  });\n\n  return {binds};\n};\n\n// Both template passes walk the same tree hunting for the next interpolation\n// slot and then do exactly the same thing with it; only the way a slot is\n// recognised differs, so that part is the only argument.\nconst _scan = (\n  frag: DocumentFragment,\n  items: (Patch | AnyView)[],\n  wraps: Wrap<unknown, CmdContext>[],\n  hit: (node: Node, nodeIndex: number, itemIndex: number) => boolean,\n  indexes?: number[],\n) => {\n  const w = _walker();\n  w.currentNode = frag;\n  let node = w.nextNode();\n  let nodeIndex = 0;\n  let itemIndex = 0;\n  while (node !== null && itemIndex < items.length) {\n    if (hit(node, nodeIndex, itemIndex)) {\n      wraps.push({item: at(items, itemIndex), node});\n      if (indexes) indexes.push(nodeIndex);\n      itemIndex++;\n      if (node.nodeType === Node.ELEMENT_NODE) _rmMark(node as Element);\n    }\n    node = w.nextNode();\n    nodeIndex++;\n  }\n  // https://github.com/lit/lit/blob/c42ee1e96b8fd61f7256f61d715daef572e76e52/packages/lit-html/src/lit-html.ts#L1260\n  // We need to set the currentNode away from the cloned tree so that we\n  // don't hold onto the tree even if it is detached and should be freed.\n  w.currentNode = document;\n};\n\nexport const html = (\n  strs: TemplateStringsArray,\n  ...items: (Patch | AnyView)[]\n): View => {\n  // const frag = document.createDocumentFragment();\n  const slots = strs.length - 1;\n  if (items.length !== slots) {\n    throw new Error(\n      `html: expected ${slots} interpolation${slots === 1 ? '' : 's'}, got ${items.length}`,\n    );\n  }\n\n  let frag: DocumentFragment;\n  const wraps: Wrap<unknown, CmdContext>[] = [];\n\n  const shape = _shape(items);\n  const exist = tplCache.get(strs);\n  if (exist?.shape === shape) {\n    frag = document.importNode(exist.el.content, true);\n    if (items && items.length > 0) {\n      _scan(\n        frag,\n        items,\n        wraps,\n        (_node, nodeIndex, itemIndex) => nodeIndex === exist.indexes[itemIndex],\n      );\n    }\n  } else {\n    const template = document.createElement('template');\n    template.innerHTML = _text(strs, ...items);\n    const tpl: Tpl = {el: template, indexes: [], shape};\n    frag = document.importNode(template.content, true);\n\n    if (items && items.length > 0) {\n      _scan(\n        frag,\n        items,\n        wraps,\n        (node) =>\n          node.nodeType === Node.ELEMENT_NODE\n            ? _hasMark(node as Element)\n            : node.nodeType === Node.COMMENT_NODE && _isView(node as Comment),\n        tpl.indexes,\n      );\n    }\n\n    tplCache.set(strs, tpl);\n  }\n\n  if (wraps.length !== items.length)\n    throw new Error(\n      'html: unmatched interpolation; patch() must be in attribute position',\n    );\n\n  const commits: Commit<unknown>[] = [];\n  wraps.forEach(({item, node}) => {\n    if (item.type === 'patch') {\n      commits.push(commitPatch(item, node));\n    } else if (item.type === 'view') {\n      commits.push(commitView(item, node));\n    }\n  });\n\n  const boundary = frag.firstChild ? toBoundary(frag) : undefined;\n\n  return {\n    type: 'view',\n    node: frag,\n    childCommits: commits,\n    live: () => boundary,\n  };\n};\n\nconst _text = (strs: TemplateStringsArray, ...parts: (Patch | AnyView)[]) => {\n  let text = strs[0] ?? '';\n  for (let i = 0; i < parts.length; i++) {\n    text += _toMark(at(parts, i)) + (strs[i + 1] ?? '');\n  }\n  return text;\n};\n","import type {Cmd, CmdContext} from './cmd';\nimport type {Sig} from './sig.bind';\n\nexport interface PatchContext extends CmdContext {\n  // kind: 'elem';\n  node: Node;\n  extra?: unknown[];\n}\n\nexport interface PatchItem<T> {\n  source: T | Sig<T>;\n  context: PatchContext;\n  cmd: Cmd<T, PatchContext>;\n}\nexport type ToPatchItem<T> = (el: Element) => PatchItem<T>;\n\n// biome-ignore lint/suspicious/noExplicitAny: any patch item\nexport type AnyPatchItem = PatchItem<any>;\nexport type ToAnyPatchItem = (el: Element) => AnyPatchItem;\n\nexport interface Patch {\n  type: 'patch';\n  toPatchItems: ToAnyPatchItem[];\n}\n\nexport const patch = (...toPatchItems: ToAnyPatchItem[]): Patch => ({\n  type: 'patch',\n  toPatchItems,\n});\n\n// Every patch item is the same shape -- bind `source` to `elem` plus whatever\n// arguments the command needs -- so the whole body lives here once.\nconst _toPatchItem =\n  <T>(\n    source: T | Sig<T>,\n    extra: unknown[] | undefined,\n    cmd: Cmd<T, PatchContext>,\n  ): ToPatchItem<T> =>\n  (elem) => ({\n    source,\n    context: extra ? {node: elem, extra} : {node: elem},\n    cmd,\n  });\n\n// most commands take their attribute/style/class name as the first extra\nconst _key = (ctx: PatchContext): string => {\n  const key = ctx.extra?.[0];\n  if (!key) throw new Error('patch: empty key');\n  return key as string;\n};\n\nconst idCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as Element).id = String(val);\n};\n\nexport const id = <T>(source: T | Sig<T>): ToPatchItem<T> =>\n  _toPatchItem(source, undefined, idCmd);\n\nconst valCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as unknown as {value: string}).value = String(val);\n};\n\nexport const val = <T>(source: T | Sig<T>): ToPatchItem<T> =>\n  _toPatchItem(source, undefined, valCmd);\n\nconst attrCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as Element).setAttribute(_key(ctx), String(val));\n};\n\nexport const attr = <T>(source: T | Sig<T>, key: string): ToPatchItem<T> =>\n  _toPatchItem(source, [key], attrCmd);\n\nexport type WritableStyleKey = {\n  [K in keyof CSSStyleDeclaration]: CSSStyleDeclaration[K] extends string\n    ? K\n    : never;\n}[keyof CSSStyleDeclaration];\n\nconst styleCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as HTMLElement).style[_key(ctx) as WritableStyleKey] = String(val);\n};\n\nexport const style = <T>(\n  source: T | Sig<T>,\n  key: WritableStyleKey,\n): ToPatchItem<T> => _toPatchItem(source, [key], styleCmd);\n\nconst stylePropertyCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as HTMLElement).style.setProperty(_key(ctx), String(val));\n};\n\nexport const styleProperty = <T>(\n  source: T | Sig<T>,\n  key: string,\n): ToPatchItem<T> => _toPatchItem(source, [key], stylePropertyCmd);\n\nconst toggleClassCmd = <T>(val: T, ctx: PatchContext) => {\n  (ctx.node as Element).classList.toggle(_key(ctx), Boolean(val));\n};\n\nexport const toggleClass = <T>(\n  source: T | Sig<T>,\n  token: string,\n): ToPatchItem<T> => _toPatchItem(source, [token], toggleClassCmd);\n\nconst toggleClassesCmd = <T>(val: T, ctx: PatchContext) => {\n  ctx.extra?.forEach((token) => {\n    (ctx.node as Element).classList.toggle(token as string, Boolean(val));\n  });\n};\n\nexport const toggleClasses = <T>(\n  source: T | Sig<T>,\n  ...tokens: string[]\n): ToPatchItem<T> => _toPatchItem(source, tokens, toggleClassesCmd);\n\nexport type ActFn<T> = (node: Node, val?: T) => void;\n\nconst actCmd = <T>(val: T, ctx: PatchContext) => {\n  const fn = ctx.extra?.[0] as ActFn<T> | undefined;\n  if (!fn) throw new Error('patch: no function');\n  fn(ctx.node, val);\n};\n\nexport const act = <T>(source: T | Sig<T>, fn: ActFn<T>): ToPatchItem<T> =>\n  _toPatchItem(source, [fn], actCmd);\n\ntype _Listener<K extends keyof HTMLElementEventMap> = (\n  this: HTMLElement,\n  ev: HTMLElementEventMap[K],\n) => unknown;\n\nconst onCmd = (listener: unknown, ctx: PatchContext) => {\n  const type = ctx.extra?.[0] as string | undefined;\n  const options = ctx.extra?.[1] as\n    | boolean\n    | AddEventListenerOptions\n    | undefined;\n  if (!type) throw new Error('patch: no event type');\n  ctx.node.addEventListener(\n    type,\n    listener as EventListenerOrEventListenerObject,\n    options,\n  );\n};\n\nexport const on = <K extends keyof HTMLElementEventMap>(\n  type: K,\n  listener: _Listener<K>,\n  options?: boolean | AddEventListenerOptions,\n): ToPatchItem<_Listener<K>> => _toPatchItem(listener, [type, options], onCmd);\n","import {removeBoundary} from './boundary';\nimport type {CmdContext} from './cmd';\nimport type {Commit} from './commit';\nimport {cleanCommit} from './commit';\nimport type {AnyView} from './view';\n\nexport const render = (\n  viewArg: AnyView | (() => AnyView),\n  node: Node,\n): (() => void) => {\n  const view = typeof viewArg === 'function' ? viewArg() : viewArg;\n  node.appendChild(view.node);\n  const commit: Commit<unknown, CmdContext> = {\n    binds: view.bind,\n    children: view.childCommits,\n  };\n  return () => {\n    cleanCommit(commit);\n    // Read the boundary at dispose time, never at mount. view() and repeat()\n    // swap ctx.boundary on every update, so the nodes still in the host are\n    // the current ones, not the ones render originally appended.\n    const boundary = view.live?.();\n    if (boundary) removeBoundary(boundary);\n  };\n};\n","import {type Boundary, replaceWithNode, toBoundary} from './boundary';\nimport type {CmdContext} from './cmd';\nimport {type Commit, cleanCommit} from './commit';\nimport {\n  type AnyBind,\n  type Bind,\n  createBind,\n  removeBind,\n  type Sig,\n} from './sig.bind';\n\n// biome-ignore lint/suspicious/noExplicitAny: View with any context\nexport interface View<T = unknown, C extends CmdContext = any> {\n  type: 'view';\n  node: Node;\n  bind?: Bind<T, C> | undefined;\n  childCommits?: Commit<unknown, CmdContext>[];\n  live?: () => Boundary | undefined;\n}\n\n// biome-ignore lint/suspicious/noExplicitAny: any view\nexport type AnyView = View<any, any>;\n\nexport interface ViewContext<T> extends CmdContext {\n  boundary: Boundary;\n  bind?: AnyBind | undefined;\n  childCommits?: Commit<unknown, CmdContext>[] | undefined;\n  viewFn: (val: T) => View;\n}\n\nconst viewCmd = <T>(val: T, ctx: ViewContext<T>) => {\n  const view = ctx.viewFn(val);\n  const newBoundary = replaceWithView(ctx.boundary, view);\n  if (ctx.bind) removeBind(ctx.bind);\n  ctx.childCommits?.forEach((commit) => {\n    cleanCommit(commit);\n  });\n  ctx.boundary = newBoundary;\n  ctx.bind = view.bind;\n  ctx.childCommits = view.childCommits;\n};\n\nexport const view = <T>(\n  sig: Sig<T>,\n  viewFn: (val: T) => AnyView,\n): View<T, ViewContext<T>> => {\n  const view = viewFn(sig.get());\n\n  const boundary = extractBoundary(view);\n\n  const ctx: ViewContext<T> = {\n    boundary,\n    bind: view.bind,\n    viewFn,\n    childCommits: view.childCommits,\n  };\n\n  const bind = createBind(sig, ctx, viewCmd);\n\n  return {\n    ...view,\n    bind,\n    live: () => ctx.boundary,\n  };\n};\n\nexport const extractBoundary = (view: View): Boundary => toBoundary(view.node);\n\nexport const replaceWithView = (old: Boundary, view: View): Boundary => {\n  return replaceWithNode(old, view.node);\n};\n","import {\n  type Boundary,\n  removeBoundary,\n  replaceWithNode,\n  toBoundary,\n} from './boundary';\nimport type {CmdContext} from './cmd';\nimport {type Commit, cleanCommit} from './commit';\nimport {isEqual} from './eq';\nimport {type AnyBind, createBind, removeBind, type Sig} from './sig.bind';\nimport {at} from './utils';\nimport {\n  type AnyView,\n  extractBoundary,\n  replaceWithView,\n  type View,\n} from './view';\n\nexport type RepeatProp<T> = {\n  key: (item: T) => string;\n  view: (item: T) => AnyView;\n  compare?: (a: T, b: T) => boolean;\n};\n\ninterface Container {\n  parent: ParentNode;\n  startFence: Node;\n  endFence: Node;\n}\n\ninterface Track<T> {\n  boundary: Boundary;\n  bind?: AnyBind | undefined;\n  item: T;\n  key: string;\n  childCommits?: Commit<unknown, CmdContext>[] | undefined;\n  checked?: boolean;\n  cleaned?: boolean;\n}\n\nexport interface RepeatContext<T> extends CmdContext {\n  prop: RepeatProp<T>;\n  boundary: Boundary;\n  tracks: Track<T>[];\n}\n\nconst _cleanTrack = <T>(track: Track<T>) => {\n  removeBoundary(track.boundary);\n  if (track.bind) removeBind(track.bind);\n  track.childCommits?.forEach((commit) => {\n    cleanCommit(commit);\n  });\n  track.cleaned = true;\n};\n\nconst repeatCmd = <T>(items: T[], ctx: RepeatContext<T>) => {\n  if (!Array.isArray(items) || items.length === 0) {\n    const newFrag = document.createDocumentFragment();\n    newFrag.appendChild(document.createComment('empty-list'));\n    const newBoundary = replaceWithNode(ctx.boundary, newFrag);\n    ctx.boundary = newBoundary;\n    ctx.tracks.forEach(_cleanTrack);\n    ctx.tracks = [];\n    return;\n  }\n  const newTracks: Track<T>[] = [];\n  if (!Array.isArray(ctx.tracks) || ctx.tracks.length === 0) {\n    const newFrag = _init(items, ctx.prop, newTracks);\n    const newBoundary = replaceWithNode(ctx.boundary, newFrag);\n    ctx.boundary = newBoundary;\n    // ctx.tracks.forEach(_cleanTrack);\n    ctx.tracks = newTracks;\n    return;\n  }\n\n  const start = ctx.boundary.start;\n  const end = ctx.boundary.end;\n  const parent = start.parentNode;\n  if (!parent) throw new Error('no parent node');\n\n  const compare = ctx.prop.compare ?? isEqual;\n  const newKeys = items.map((item) => ctx.prop.key(item));\n  const tracks = ctx.tracks;\n\n  // Nothing changed: same keys, same order, equal items. Bail out before\n  // touching the DOM so a redundant re-render costs zero DOM mutations\n  // instead of a fence insert/remove pair.\n  if (tracks.length === items.length) {\n    const unchanged = tracks.every((track, i) => {\n      const item = items[i] as T;\n      return track.key === newKeys[i] && compare(track.item, item);\n    });\n    if (unchanged) return;\n  }\n\n  const startFence = document.createComment('repeat-start-fence');\n  const endFence = document.createComment('repeat-end-fence');\n\n  parent.insertBefore(startFence, start);\n  parent.insertBefore(endFence, end.nextSibling);\n\n  const container: Container = {\n    parent,\n    startFence,\n    endFence,\n  };\n\n  const oldKeys = tracks.map((track) => track.key);\n\n  let newKeyToIndexMap: Map<unknown, number> | undefined;\n  let oldKeyToIndexMap: Map<unknown, number> | undefined;\n\n  let oldHead = 0;\n  let oldTail = ctx.tracks.length - 1;\n  let newHead = 0;\n  let newTail = items.length - 1;\n\n  while (oldHead <= oldTail && newHead <= newTail) {\n    if (ctx.tracks[oldHead]?.checked) {\n      // console.log('skip old head', ctx.tracks[oldHead].key);\n\n      oldHead++;\n    } else if (ctx.tracks[oldTail]?.checked) {\n      // console.log('skip old tail', ctx.tracks[oldTail].key);\n\n      oldTail--;\n    } else if (ctx.tracks[oldHead]?.key === newKeys[newHead]) {\n      // old head matches new head; update in place\n      // console.log('matches head', newKeys[newHead]);\n\n      newTracks[newHead] = _setTrack(\n        at(ctx.tracks, oldHead),\n        at(items, newHead),\n        ctx.prop,\n        compare,\n      );\n      oldHead++;\n      newHead++;\n    } else if (ctx.tracks[oldTail]?.key === newKeys[newTail]) {\n      // old tail matches nwe tail; update in place\n      // console.log('matches tail', newKeys[newTail]);\n\n      newTracks[newTail] = _setTrack(\n        at(ctx.tracks, oldTail),\n        at(items, newTail),\n        ctx.prop,\n        compare,\n      );\n      oldTail--;\n      newTail--;\n    } else if (ctx.tracks[oldHead]?.key === newKeys[newTail]) {\n      // Old head matches new tail; update and move to new tail\n      // console.log(\n      //   'Old head matches new tail',\n      //   ctx.tracks[oldHead].key,\n      //   newKeys[newTail],\n      // );\n      newTracks[newTail] = _setTrack(\n        at(ctx.tracks, oldHead),\n        at(items, newTail),\n        ctx.prop,\n        compare,\n      );\n      //\n      // const before = ref ? boundaryStart(ref.boundary) : fence;\n      // _moveTrackBefore(after, newTracks[newTail], newTracks[newTail + 1]);\n      _moveTrack(\n        container,\n        at(newTracks, newTail),\n        _beforeFence(container, newTracks[newTail + 1]),\n      );\n      oldHead++;\n      newTail--;\n    } else if (ctx.tracks[oldTail]?.key === newKeys[newHead]) {\n      // old tail matches new head; update and move to new head\n      // console.log(\n      //   'old tail matches new head',\n      //   ctx.tracks[oldTail].key,\n      //   newKeys[newHead],\n      // );\n\n      newTracks[newHead] = _setTrack(\n        at(ctx.tracks, oldTail),\n        at(items, newHead),\n        ctx.prop,\n        compare,\n      );\n      // if (!before.nextSibling) throw new Error('no before.nextSibling');\n      // _moveTrackAfter(before, newTracks[newHead], newTracks[newHead - 1]);\n      _moveTrack(\n        container,\n        at(newTracks, newHead),\n        _afterFence(container, newTracks[newHead - 1]),\n      );\n      oldTail--;\n      newHead++;\n    } else {\n      if (newKeyToIndexMap === undefined || oldKeyToIndexMap === undefined) {\n        newKeyToIndexMap = _generateMap(newKeys, newHead, newTail);\n        oldKeyToIndexMap = _generateMap(oldKeys, oldHead, oldTail);\n      }\n      if (!newKeyToIndexMap.has(oldKeys[oldHead])) {\n        // remove old head\n        // console.log('remove old head', ctx.tracks[oldHead].key);\n        _cleanTrack(at(ctx.tracks, oldHead));\n        oldHead++;\n      } else if (!newKeyToIndexMap.has(oldKeys[oldTail])) {\n        // remove old tail\n        // console.log('remove old tail', ctx.tracks[oldTail].key);\n        _cleanTrack(at(ctx.tracks, oldTail));\n        oldTail--;\n      } else {\n        const oldIndex = oldKeyToIndexMap.get(newKeys[newHead]);\n        const oldTrack = oldIndex !== undefined ? ctx.tracks[oldIndex] : null;\n        if (oldTrack) {\n          // console.log(\n          //   'move old item to new head:',\n          //   oldTrack.key,\n          //   newKeys[newHead],\n          // );\n          newTracks[newHead] = _setTrack(\n            oldTrack,\n            at(items, newHead),\n            ctx.prop,\n            compare,\n          );\n          // _moveTrackAfter(before, newTracks[newHead], newTracks[newHead - 1]);\n          _moveTrack(\n            container,\n            at(newTracks, newHead),\n            _afterFence(container, newTracks[newHead - 1]),\n          );\n          oldTrack.checked = true;\n          // ctx.tracks[oldIndex as number].checked = true;\n        } else {\n          // create a new one and insert it\n          // console.log('create new item:', newKeys[newHead]);\n          newTracks[newHead] = _insertNewTrack(\n            container,\n            at(items, newHead),\n            ctx.prop,\n            _afterFence(container, newTracks[newHead - 1]),\n          );\n        }\n        newHead++;\n      }\n    }\n  }\n\n  while (newHead <= newTail) {\n    // console.log('create new head:', newKeys[newHead]);\n    newTracks[newHead] = _insertNewTrack(\n      container,\n      at(items, newHead),\n      ctx.prop,\n      _afterFence(container, newTracks[newHead - 1]),\n    );\n    newHead++;\n  }\n\n  while (oldHead <= oldTail) {\n    // console.log('remove old head:', ctx.tracks[oldHead].key);\n    if (!ctx.tracks[oldHead]?.cleaned && !ctx.tracks[oldHead]?.checked)\n      _cleanTrack(at(ctx.tracks, oldHead));\n    oldHead++;\n  }\n\n  if (!container.startFence.nextSibling || !container.endFence.previousSibling)\n    throw new Error('error container fences');\n\n  ctx.boundary = {\n    start: container.startFence.nextSibling,\n    end: container.endFence.previousSibling,\n  };\n  container.parent.removeChild(container.startFence);\n  container.parent.removeChild(container.endFence);\n  ctx.tracks = newTracks;\n};\n\nconst _generateMap = (list: unknown[], start: number, end: number) => {\n  const map = new Map<unknown, number>();\n  for (let i = start; i <= end; i++) {\n    map.set(list[i], i);\n  }\n  return map;\n};\n\nconst _beforeFence = <T>(container: Container, track?: Track<T>): Node =>\n  track ? track.boundary.start : container.endFence;\nconst _afterFence = <T>(container: Container, track?: Track<T>): Node => {\n  const node = track ? track.boundary.end : container.startFence;\n  if (!node.nextSibling) throw new Error('no after fence');\n  return node.nextSibling;\n};\n\nconst _mvNodeBefore = (parent: ParentNode, node: Node, child: Node | null) => {\n  if (parent.moveBefore) parent.moveBefore(node, child);\n  else parent.insertBefore(node, child);\n};\n\nconst _moveTrack = <T>(container: Container, track: Track<T>, fence: Node) => {\n  const parent = container.parent;\n\n  if (track.boundary.start === track.boundary.end)\n    _mvNodeBefore(parent, track.boundary.start, fence);\n  else {\n    let n: Node | null = track.boundary.start;\n    while (n) {\n      const next: Node | null = n.nextSibling;\n      _mvNodeBefore(parent, n, fence);\n      if (n === track.boundary.end) break;\n      n = next;\n    }\n  }\n};\n\nconst _insertNewTrack = <T>(\n  container: Container,\n  item: T,\n  prop: RepeatProp<T>,\n  fence: Node,\n): Track<T> => {\n  const view = prop.view(item);\n  const boundary = extractBoundary(view);\n  container.parent.insertBefore(view.node, fence);\n  return {\n    key: prop.key(item),\n    boundary,\n    bind: view.bind,\n    childCommits: view.childCommits,\n    item,\n  };\n};\n\nconst _setTrack = <T>(\n  old: Track<T>,\n  item: T,\n  prop: RepeatProp<T>,\n  compare: (a: T, b: T) => boolean,\n): Track<T> => {\n  if (compare(old.item, item)) {\n    return {\n      ...old,\n      checked: false,\n      cleaned: false,\n    };\n  }\n\n  const view = prop.view(item);\n  const newBoundary = replaceWithView(old.boundary, view);\n  _cleanTrack(old);\n\n  const newTrack: Track<T> = {\n    key: prop.key(item),\n    boundary: newBoundary,\n    bind: view.bind,\n    childCommits: view.childCommits,\n    item,\n  };\n\n  return newTrack;\n};\n\nconst _init = <T>(\n  items: T[],\n  prop: RepeatProp<T>,\n  tracks: Track<T>[],\n): DocumentFragment => {\n  const frag = document.createDocumentFragment();\n  items.forEach((item) => {\n    const view = prop.view(item);\n    const key = prop.key(item);\n\n    const boundary = extractBoundary(view);\n    tracks.push({\n      key,\n      boundary,\n      bind: view.bind,\n      item,\n      childCommits: view.childCommits,\n    });\n    frag.appendChild(view.node);\n  });\n\n  if (frag.childNodes.length === 0) {\n    frag.appendChild(document.createComment('empty-list'));\n  }\n  return frag;\n};\n\nexport const repeat = <T>(\n  sig: Sig<T[]>,\n  prop: RepeatProp<T>,\n): View<T[], RepeatContext<T>> => {\n  const tracks: Track<T>[] = [];\n  const frag = _init(sig.get(), prop, tracks);\n\n  const ctx: RepeatContext<T> = {prop, tracks, boundary: toBoundary(frag)};\n  const bind = createBind(sig, ctx, repeatCmd);\n\n  return {\n    type: 'view',\n    node: frag,\n    bind,\n    live: () => ctx.boundary,\n  };\n};\n","import type {PatchContext} from './patch';\nimport {createBind, Sig} from './sig.bind';\nimport type {View} from './view';\n\nconst textCmd = <T>(val: T, ctx: PatchContext) => {\n  ctx.node.textContent = String(val);\n};\n\nexport const text = <T>(source: T | Sig<T>): View<T, PatchContext> => {\n  const text = document.createTextNode(\n    source instanceof Sig ? String(source.get()) : String(source),\n  );\n  const ctx: PatchContext = {node: text};\n  const bind =\n    source instanceof Sig ? createBind(source, ctx, textCmd) : undefined;\n  return {\n    type: 'view',\n    node: text,\n    bind,\n  };\n};\n"],"mappings":"AAKA,MAAaA,EAAkB,GAAgB,CAC7C,IAAMC,EAASC,EAAE,MAAM,WACvB,GAAKD,EAIL,IAAIC,EAAE,QAAUA,EAAE,IAAKD,EAAO,YAAYC,EAAE,KAAK,MAC5C,CAEH,IAAI,EAAiBA,EAAE,MACvB,KAAO,GAAG,CACR,IAAMC,EAAoB,EAAE,YAE5B,GADAF,EAAO,YAAY,CAAC,EAChB,IAAMC,EAAE,IAAK,MACjB,EAAIC,CACN,CACF,EACF,EAEaC,EAAc,GAAyB,CAClD,IAAMF,EACJG,EAAK,WAAa,KAAK,uBACnB,CAAC,MAAOA,EAAK,WAAY,IAAKA,EAAK,SAAS,EAC5C,CAAC,MAAOA,EAAM,IAAKA,CAAI,EAC7B,GAAI,CAACH,EAAE,OAAS,CAACA,EAAE,IAAK,MAAU,MAAM,4BAA4B,EACpE,OAAOA,CACT,EAEaI,GAAmB,EAAe,IAAe,CAC5D,IAAMC,EAAcH,EAAWC,CAAI,EAC7BJ,EAASO,EAAI,MAAM,WACzB,GAAI,CAACP,EACH,MAAU,MAAM,iDAAiD,EAEnE,GAAIO,EAAI,QAAUA,EAAI,IACpBP,EAAO,aAAaI,EAAMG,EAAI,KAAK,MAC9B,CACL,IAAIC,EAAID,EAAI,MAAM,YAElB,IADAP,EAAO,aAAaI,EAAMG,EAAI,KAAK,EAC5BC,GAAG,CACR,IAAMN,EAAOM,EAAE,YAEf,GADAR,EAAO,YAAYQ,CAAC,EAChBA,IAAMD,EAAI,IAAK,MACnB,EAAIL,CACN,CACF,CAEA,OAAOI,CACT,ECjDMG,EAAe,GACnB,OAAOC,GAAU,YACjBA,GACA,WAAYA,GACZ,OAAOA,EAAM,QAAW,WAIbC,GAAc,EAAM,IAAkB,CACjD,GAAIC,IAAMX,EAAG,MAAO,GAGpB,GAFI,OAAOW,GAAM,OAAOX,GAEpBW,IAAM,MAAQX,IAAM,MAAQ,OAAOW,GAAM,SAAU,MAAO,GAE9D,GAAIH,EAAYG,CAAC,EAAG,OAAOA,EAAE,OAAOX,CAAC,EAIrC,GAAI,MAAM,QAAQW,CAAC,GAAK,MAAM,QAAQX,CAAC,EAAG,CACxC,GAAIW,EAAE,SAAWX,EAAE,OAAQ,MAAO,GAClC,IAAK,IAAIY,EAAI,EAAGA,EAAID,EAAE,OAAQ,IAC5B,GAAI,CAACD,EAAQC,EAAEC,GAAIZ,EAAEY,EAAE,EAAG,MAAO,GAEnC,MAAO,EACT,CAGA,GAAID,aAAa,MAAQX,aAAa,KACpC,OAAOW,EAAE,QAAQ,IAAMX,EAAE,QAAQ,EAGnC,GAAIW,aAAa,QAAUX,aAAa,OACtC,OAAOW,EAAE,SAAS,IAAMX,EAAE,SAAS,EAIrC,GAAIW,aAAa,KAAOX,aAAa,IAAK,CACxC,GAAIW,EAAE,OAASX,EAAE,KAAM,MAAO,GAC9B,IAAK,GAAM,CAACa,EAAKC,KAAQH,EACvB,GAAI,CAACX,EAAE,IAAIa,CAAG,GAAK,CAACH,EAAQI,EAAKd,EAAE,IAAIa,CAAG,CAAC,EAAG,MAAO,GAEvD,MAAO,EACT,CAGA,GAAIF,aAAa,KAAOX,aAAa,IAAK,CACxC,GAAIW,EAAE,OAASX,EAAE,KAAM,MAAO,GAC9B,IAAMe,EAAO,MAAM,KAAKJ,CAAC,EACnBK,EAAO,MAAM,KAAKhB,CAAC,EACzB,OAAOU,EAAQK,EAAMC,CAAI,CAC3B,CASA,GAAI,OAAO,eAAeL,CAAC,IAAM,OAAO,eAAeX,CAAC,EAAG,MAAO,GAKlE,IAAMiB,EAAKN,EACLO,EAAKlB,EAELmB,EAAQ,OAAO,KAAKF,CAAE,EACtBG,EAAQ,OAAO,KAAKF,CAAE,EAC5B,GAAIC,EAAM,SAAWC,EAAM,OAAQ,MAAO,GAE1C,IAAK,IAAIR,EAAI,EAAGA,EAAIO,EAAM,OAAQ,IAAK,CACrC,IAAMN,EAAMM,EAAMP,GAElB,GADI,CAAC,OAAO,OAAOM,EAAIL,CAAG,GACtB,CAACH,EAAQO,EAAGJ,GAAMK,EAAGL,EAAI,EAAG,MAAO,EACzC,CAEA,MAAO,EACT,ECVMQ,EAAQ,IAAI,KA1DN,CACV,OAA4B,CAAC,EAC7B,KAAe,EACf,QAAkB,GAClB,UAAoB,GAEpB,OAAO,EAAiC,CACtC,IAAK,IAAMC,KAAQC,EACbD,EAAK,SACT,EAAK,OAAS,GACd,KAAK,OAAO,KAAKA,CAAI,GAGvB,OADI,KAAK,OAAO,OAAS,KAAK,MAAM,KAAK,KAAK,EACvC,IACT,CAEA,MAAqB,CACf,KAAK,SAAW,KAAK,YACzB,KAAK,UAAY,GACjB,mBAAqB,CACnB,KAAK,QAAU,GACf,KAAK,UAAY,GACjB,KAAK,MAAM,CACb,CAAC,EACH,CAEA,OAAsB,CACpB,KAAK,QAAU,GACf,GAAI,CACF,KAAO,KAAK,KAAO,KAAK,OAAO,QAAQ,CACrC,IAAMA,EAAO,KAAK,OAAO,KAAK,QAC9B,GAAI,CACF,GAAM,CAAC,UAAS,MAAK,UAAS,OAAOA,EAChCE,GAASC,EAAIC,EAAI,IAAI,EAAGC,CAAO,CACtC,OAASC,EAAK,CACZ,QAAQ,MAAM,uBAAwBA,EAAKN,CAAI,CACjD,QAAU,CAIR,EAAK,OAAS,EAChB,CACF,CACF,QAAU,CACR,KAAK,QAAU,GACX,KAAK,KAAO,KAAK,OAAO,QAE1B,KAAK,OAAS,KAAK,OAAO,MAAM,KAAK,IAAI,EACzC,KAAK,KAAO,EACZ,KAAK,KAAK,IAEV,KAAK,OAAO,OAAS,EACrB,KAAK,KAAO,EAEhB,CACF,CACF,EAIA,IAAaO,EAAb,MAAaA,CAA4B,CACvC,KACA,OAA4B,CAAC,EAE7B,YAAY,EAAQ,CAClB,KAAK,KAAOf,CACd,CAEA,OAAO,EAAY,CAEjB,OADId,aAAa6B,GAAYnB,EAAQ,KAAK,IAAI,EAAGV,EAAE,IAAI,CAAC,CAE1D,CAEA,KAAS,CACP,OAAO,KAAK,IACd,CAEA,YAAY,EAAM,CAChB,KAAK,KAAO8B,EACZT,EAAM,OAAO,KAAK,MAAM,CAC1B,CAEA,OAAO,EAAM,CACPX,EAAQoB,EAAG,KAAK,IAAI,GACxB,KAAK,YAAYA,CAAC,CACpB,CAEA,MAAM,EAAiB,CACrB,KAAK,OAAOC,EAAG,KAAK,IAAI,CAAC,CAC3B,CAEA,QAA8B,EAAkB,CAC9C,KAAK,OAAO,KAAKT,CAAI,CACvB,CAEA,WAAW,EAA2B,CACpC,IAAMU,EAAQ,KAAK,OAAO,QAAQV,CAAI,EAClCU,GAAS,GAAG,KAAK,OAAO,OAAOA,EAAO,CAAC,EACvC,KAAK,OAAO,SAAW,GACzB,KAAK,QAAQ,CAEjB,CAEA,UAAkC,CAChC,OAAO,KAAK,MACd,CAIA,SAAU,CAAC,CACb,EAEaC,EAAb,cAAmCJ,CAAO,CACxC,WAAgC,CAAC,EACjC,QAAkB,GAElB,YAAqC,EAAkB,CACrD,KAAK,WAAW,KAAKP,CAAI,CAC3B,CAWA,QAAuC,EAAkB,CAEvD,GADA,MAAM,QAAQA,CAAI,EACd,KAAK,QAAS,OAClB,KAAK,QAAU,GACf,IAAK,IAAIV,EAAI,EAAGA,EAAI,KAAK,WAAW,OAAQ,IAAK,CAC/C,IAAMsB,EAAI,KAAK,WAAWtB,GAC1B,KAAK,WAAWA,GAAKuB,EAAWD,EAAE,IAAKA,EAAE,QAASA,EAAE,GAAG,CACzD,CAGA,IAAME,EAAQ,KAAK,WAAW,GAC1BA,GAAOA,EAAM,IAAIA,EAAM,IAAI,IAAI,EAAGA,EAAM,OAAO,CACrD,CAEA,SAAmB,CACjB,GAAK,KAAK,QACV,MAAK,QAAU,GACf,IAAK,IAAMpC,KAAK,KAAK,WAAYqC,EAAWrC,CAAC,CAD9B,CAEjB,CACF,EAEA,MAAa0B,EAAU,GAAS,IAAIG,EAAIC,CAAC,EAE5BO,EAAc,GAAoC,CAC7D,EAAK,QAAU,GACff,EAAK,IAAI,WAAWA,CAAI,CAC1B,EAEaa,GACX,EACA,EACA,IACe,CACf,IAAMb,EAAmB,CAAC,MAAK,UAAS,MAAK,QAAS,GAAO,OAAQ,EAAK,EAE1E,OADAI,EAAI,QAAQJ,CAAI,EACTA,CACT,ECzKagB,EAAe,GAAwC,CAC9DC,EAAO,QACL,MAAM,QAAQA,EAAO,KAAK,EAC5BA,EAAO,MAAM,QAAS,GAAS,CAC7BF,EAAWf,CAAI,CACjB,CAAC,EAEDe,EAAWE,EAAO,KAAK,GAG3BA,EAAO,UAAU,QAAS,GAAU,CAClCD,EAAYE,CAAK,CACnB,CAAC,CACH,ECGMC,GAAoB,EAAM,IAA8B,CAC5DC,EAAI,OAAO,OAAOA,EAAI,GAAGC,CAAC,CAAC,CAC7B,EAEMC,GACJ,EACA,IACG,CACH,IAAMC,EAAgC,CAAC,EACvC,IAAK,GAAM,CAACC,EAAGH,KAAMD,EAAI,QAAS,EAAKI,GAAKH,EAAE,IAAI,EAClDD,EAAI,OAAO,OAAOA,EAAI,GAAGG,CAAoB,CAAC,CAChD,EAEME,GAAkB,EAAgB,IAAmC,CACzE,IAAMC,EAAS,IAAIf,EAAWF,EAAGkB,EAAO,IAAI,CAAC,CAAC,EACxCP,EAA4B,CAAC,SAAQ,IAAE,EAE7C,OADAM,EAAO,YAAYb,EAAWc,EAAQP,EAAKD,CAAU,CAAC,EAC/CO,CACT,EAEME,GACJ,EACA,IACkB,CAClB,IAAMC,EAA0B,CAAC,EAC3BN,EAAgC,CAAC,EACvC,IAAK,GAAM,CAACC,EAAGH,KAAM,OAAO,QAAQM,CAAM,EACnCH,GAAMH,IACXQ,EAAQ,KAAK,CAACL,EAAGH,CAAC,CAAC,EACnB,EAAKG,GAAKH,EAAE,IAAI,GAGlB,IAAMK,EAAS,IAAIf,EAAWF,EAAGc,CAAoB,CAAC,EAChDH,EAAkC,CAAC,SAAQ,KAAI,SAAO,EAE5D,IAAK,IAAMU,KAASD,EAClBH,EAAO,YAAYb,EAAWiB,EAAM,GAAIV,EAAKE,CAAgB,CAAC,EAGhE,OAAOI,CACT,EAQA,SAAgBK,EAAQ,EAAa,EAAsC,CACzE,OAAOJ,aAAkBpB,EACrBkB,EAASE,EAAQlB,CAAE,EACnBmB,EAAeD,EAAQlB,CAAE,CAC/B,CC9EA,MAAauB,GAAS,EAAU,IAAqB,CACnD,IAAMxB,EAAIyB,EAAIvB,GACd,GAAIF,IAAM,IAAA,GAAW,MAAU,WAAW,SAASE,EAAM,cAAc,EACvE,OAAOF,CACT,ECIM0B,EAAO,QAAQ,KAAK,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAc/CC,kBAAW,IAAI,QAErB,IAAIC,EAIJ,MAAMC,OACJ,IAAW,SAAS,iBAClB,SACA,WAAW,aAAe,WAAW,YACvC,EACOD,GAGHE,GAAW,GACfC,EAAK,OAAS,QAAUL,EAAO,OAAOA,EAAK,KAWvCM,GAAU,GAAyD,CACvE,GAAIC,EAAM,OAAS,GAAkB,CACnC,IAAIC,EAAQ,GACZ,IAAK,IAAMH,KAAQE,EAAO,GAASF,EAAK,OAAS,QAAU,IAAM,IACjE,OAAOG,CACT,CACA,IAAIC,EAAO,EACX,IAAK,IAAIrD,EAAI,EAAGA,EAAImD,EAAM,OAAQ,IAC5BA,EAAMnD,EAAE,EAAE,OAAS,UAAS,GAAQ,GAAKA,GAE/C,OAAOqD,CACT,EAEMC,GAAY,GAAgBC,EAAG,aAAaX,CAAI,EAChDY,GAAW,GAAgBD,EAAG,gBAAgBX,CAAI,EAClDa,GAAW,GAAkBR,EAAK,KAAK,KAAK,IAAML,EAElDc,IACJ,EACA,KAEAnE,EAAkB,YAAYoE,EAAK,IAAI,EAChC,CACL,MAAOA,EAAK,KACZ,SAAUA,EAAK,YACjB,GAGIC,IACJ,EACA,IACkC,CAClC,IAAMjD,EAAuC,CAAC,EAY9C,OAXAkD,EAAM,aAAa,QAAS,GAAgB,CAC1C,IAAMZ,EAAOa,EAAYvE,CAAe,EACpC0D,EAAK,kBAAkBhC,GACzBgC,EAAK,IAAIA,EAAK,OAAO,IAAI,EAAGA,EAAK,OAAO,EACxCtC,EAAM,KAAKY,EAAW0B,EAAK,OAAQA,EAAK,QAASA,EAAK,GAAG,CAAC,GAG1DA,EAAK,IAAIA,EAAK,OAAQA,EAAK,OAAO,CAEtC,CAAC,EAEM,CAAC,OAAK,CACf,EAKMc,GACJ,EACA,EACA,EACA,EACA,IACG,CACH,IAAMC,EAAIjB,EAAQ,EAClB,EAAE,YAAckB,EAChB,IAAI1E,EAAOyE,EAAE,SAAS,EAClBE,EAAY,EACZC,EAAY,EAChB,KAAO5E,IAAS,MAAQ4E,EAAYhB,EAAM,QACpCiB,EAAI7E,EAAM2E,EAAWC,CAAS,IAChCE,EAAM,KAAK,CAAC,KAAM3B,EAAGS,EAAOgB,CAAS,EAAG,MAAI,CAAC,EACzCG,GAASA,EAAQ,KAAKJ,CAAS,EACnC,IACI3E,EAAK,WAAa,KAAK,cAAciE,GAAQjE,CAAe,GAElE,EAAOyE,EAAE,SAAS,EAClB,IAKF,EAAE,YAAc,QAClB,EAEaO,IACX,EACA,GAAGpB,IACM,CAET,IAAMqB,EAAQC,EAAK,OAAS,EAC5B,GAAItB,EAAM,SAAWqB,EACnB,MAAU,MACR,kBAAkBA,EAAM,gBAAgBA,IAAU,EAAI,GAAK,IAAI,QAAQrB,EAAM,QAC/E,EAGF,IAAIc,EACEI,EAAqC,CAAC,EAEtCjB,EAAQF,GAAOC,CAAK,EACpBuB,EAAQ7B,EAAS,IAAI4B,CAAI,EAC/B,GAAIC,GAAO,QAAUtB,EACnB,EAAO,SAAS,WAAWsB,EAAM,GAAG,QAAS,EAAI,EAC7CvB,GAASA,EAAM,OAAS,GAC1BY,EACEE,EACAd,EACAkB,GACC,EAAO,EAAW,IAAcH,IAAcQ,EAAM,QAAQP,EAC/D,MAEG,CACL,IAAMQ,EAAW,SAAS,cAAc,UAAU,EAClD,EAAS,UAAYC,EAAMH,EAAM,GAAGtB,CAAK,EACzC,IAAM0B,EAAW,CAAC,GAAIF,EAAU,QAAS,CAAC,EAAG,OAAK,EAClD,EAAO,SAAS,WAAWA,EAAS,QAAS,EAAI,EAE7CxB,GAASA,EAAM,OAAS,GAC1BY,EACEE,EACAd,EACAkB,EACC,GACC9E,EAAK,WAAa,KAAK,aACnB+D,GAAS/D,CAAe,EACxBA,EAAK,WAAa,KAAK,cAAgBkE,GAAQlE,CAAe,EACpEsF,EAAI,OACN,EAGFhC,EAAS,IAAI4B,EAAMI,CAAG,CACxB,CAEA,GAAIR,EAAM,SAAWlB,EAAM,OACzB,MAAU,MACR,sEACF,EAEF,IAAM2B,EAA6B,CAAC,EACpCT,EAAM,SAAS,CAAC,OAAM,UAAU,CAC1BpB,EAAK,OAAS,QAChB6B,EAAQ,KAAKlB,GAAYX,EAAM1D,CAAI,CAAC,EAC3B0D,EAAK,OAAS,QACvB6B,EAAQ,KAAKpB,GAAWT,EAAM1D,CAAI,CAAC,CAEvC,CAAC,EAED,IAAMwF,EAAWd,EAAK,WAAa3E,EAAW2E,CAAI,EAAI,IAAA,GAEtD,MAAO,CACL,KAAM,OACN,KAAMA,EACN,aAAca,EACd,SAAYC,CACd,CACF,EAEMH,GAAS,EAA4B,GAAGI,IAA+B,CAC3E,IAAIC,EAAOR,EAAK,IAAM,GACtB,IAAK,IAAIzE,EAAI,EAAGA,EAAIgF,EAAM,OAAQ,IAChC,GAAQhC,GAAQN,EAAGsC,EAAOhF,CAAC,CAAC,GAAKyE,EAAKzE,EAAI,IAAM,IAElD,OAAOiF,CACT,ECpLapB,GAAS,GAAGqB,KAA2C,CAClE,KAAM,QACN,cACF,GAIMC,GAEF,EACA,EACA,IAED,IAAU,CACT,SACA,QAASC,EAAQ,CAAC,KAAMC,EAAM,OAAK,EAAI,CAAC,KAAMA,CAAI,EAClD,KACF,GAGIC,EAAQ,GAA8B,CAC1C,IAAMrF,EAAM6B,EAAI,QAAQ,GACxB,GAAI,CAAC7B,EAAK,MAAU,MAAM,kBAAkB,EAC5C,OAAOA,CACT,EAEMsF,IAAY,EAAQ,IAAsB,CAC9C,EAAK,KAAiB,GAAK,OAAOrF,CAAG,CACvC,EAEasF,GAAS,GACpBL,EAAa9C,EAAQ,IAAA,GAAWkD,EAAK,EAEjCE,GAAa,EAAQ,IAAsB,CAC/C,EAAK,KAAoC,MAAQ,OAAOvF,CAAG,CAC7D,EAEaA,EAAU,GACrBiF,EAAa9C,EAAQ,IAAA,GAAWoD,CAAM,EAElCC,GAAc,EAAQ,IAAsB,CAChD5D,EAAK,KAAiB,aAAawD,EAAKxD,CAAG,EAAG,OAAO5B,CAAG,CAAC,CAC3D,EAEayF,GAAW,EAAoB,IAC1CR,EAAa9C,EAAQ,CAACpC,CAAG,EAAGyF,CAAO,EAQ/BE,GAAe,EAAQ,IAAsB,CACjD,EAAK,KAAqB,MAAMN,EAAKxD,CAAG,GAAyB,OAAO5B,CAAG,CAC7E,EAEa2F,GACX,EACA,IACmBV,EAAa9C,EAAQ,CAACpC,CAAG,EAAG2F,CAAQ,EAEnDE,GAAuB,EAAQ,IAAsB,CACzDhE,EAAK,KAAqB,MAAM,YAAYwD,EAAKxD,CAAG,EAAG,OAAO5B,CAAG,CAAC,CACpE,EAEa6F,GACX,EACA,IACmBZ,EAAa9C,EAAQ,CAACpC,CAAG,EAAG6F,CAAgB,EAE3DE,GAAqB,EAAQ,IAAsB,CACvDlE,EAAK,KAAiB,UAAU,OAAOwD,EAAKxD,CAAG,EAAG,EAAQ5B,CAAI,CAChE,EAEa+F,GACX,EACA,IACmBd,EAAa9C,EAAQ,CAAC6D,CAAK,EAAGF,CAAc,EAE3DG,GAAuB,EAAQ,IAAsB,CACzDrE,EAAI,OAAO,QAAS,GAAU,CAC5BA,EAAK,KAAiB,UAAU,OAAOoE,EAAiB,EAAQhG,CAAI,CACtE,CAAC,CACH,EAEakG,GACX,EACA,GAAGC,IACgBlB,EAAa9C,EAAQgE,EAAQF,CAAgB,EAI5DG,GAAa,EAAQ,IAAsB,CAC/C,IAAMnF,EAAKW,EAAI,QAAQ,GACvB,GAAI,CAACX,EAAI,MAAU,MAAM,oBAAoB,EAC7CA,EAAGW,EAAI,KAAM5B,CAAG,CAClB,EAEaqG,GAAU,EAAoB,IACzCpB,EAAa9C,EAAQ,CAAClB,CAAE,EAAGmF,CAAM,EAO7BE,GAAS,EAAmB,IAAsB,CACtD,IAAMC,EAAO3E,EAAI,QAAQ,GACnB4E,EAAU5E,EAAI,QAAQ,GAI5B,GAAI,CAAC2E,EAAM,MAAU,MAAM,sBAAsB,EACjD3E,EAAI,KAAK,iBACP2E,EACAE,EACAD,CACF,CACF,EAEaE,IACX,EACA,EACA,IAC8BzB,EAAawB,EAAU,CAACF,EAAMC,CAAO,EAAGF,CAAK,EChJhEK,GACX,EACA,IACiB,CACjB,IAAMlD,EAAO,OAAOmD,GAAY,WAAaA,EAAQ,EAAIA,EACzDvH,EAAK,YAAYoE,EAAK,IAAI,EAC1B,IAAMhC,EAAsC,CAC1C,MAAOgC,EAAK,KACZ,SAAUA,EAAK,YACjB,EACA,UAAa,CACXjC,EAAYC,CAAM,EAIlB,IAAMoD,EAAWpB,EAAK,OAAO,EACzBoB,GAAU7F,EAAe6F,CAAQ,CACvC,CACF,ECMMgC,GAAc,EAAQ,IAAwB,CAClD,IAAMpD,EAAO7B,EAAI,OAAO5B,CAAG,EACrBT,EAAcuH,EAAgBlF,EAAI,SAAU6B,CAAI,EAClD7B,EAAI,MAAML,EAAWK,EAAI,IAAI,EACjCA,EAAI,cAAc,QAAS,GAAW,CACpCJ,EAAYC,CAAM,CACpB,CAAC,EACD,EAAI,SAAWlC,EACf,EAAI,KAAOkE,EAAK,KAChB,EAAI,aAAeA,EAAK,YAC1B,EAEaA,IACX,EACA,IAC4B,CAC5B,IAAMA,EAAOsD,EAAOnG,EAAI,IAAI,CAAC,EAIvBgB,EAAsB,CAC1B,SAHeoF,EAAgBvD,CAGxB,EACP,KAAMA,EAAK,KACX,SACA,aAAcA,EAAK,YACrB,EAEMjD,EAAOa,EAAWT,EAAKgB,EAAKiF,CAAO,EAEzC,MAAO,CACL,GAAGpD,EACH,OACA,SAAY7B,EAAI,QAClB,CACF,EAEaoF,EAAmB,GAAyB5H,EAAWqE,EAAK,IAAI,EAEhEqD,GAAmB,EAAe,IACtCxH,EAAgBE,EAAKiE,EAAK,IAAI,ECvBjCwD,EAAkB,GAAoB,CAC1CjI,EAAekI,EAAM,QAAQ,EACzBA,EAAM,MAAM3F,EAAW2F,EAAM,IAAI,EACrCA,EAAM,cAAc,QAAS,GAAW,CACtC1F,EAAYC,CAAM,CACpB,CAAC,EACD,EAAM,QAAU,EAClB,EAEM0F,IAAgB,EAAY,IAA0B,CAC1D,GAAI,CAAC,MAAM,QAAQlE,CAAK,GAAKA,EAAM,SAAW,EAAG,CAC/C,IAAMmE,EAAU,SAAS,uBAAuB,EAChDA,EAAQ,YAAY,SAAS,cAAc,YAAY,CAAC,EAExD,EAAI,SADgB9H,EAAgBsC,EAAI,SAAUwF,CACzB,EACzBxF,EAAI,OAAO,QAAQqF,CAAW,EAC9B,EAAI,OAAS,CAAC,EACd,MACF,CACA,IAAMI,EAAwB,CAAC,EAC/B,GAAI,CAAC,MAAM,QAAQzF,EAAI,MAAM,GAAKA,EAAI,OAAO,SAAW,EAAG,CACzD,IAAMwF,EAAUE,EAAMrE,EAAOrB,EAAI,KAAMyF,CAAS,EAEhD,EAAI,SADgB/H,EAAgBsC,EAAI,SAAUwF,CACzB,EAEzB,EAAI,OAASC,EACb,MACF,CAEA,IAAME,EAAQ3F,EAAI,SAAS,MACrB4F,EAAM5F,EAAI,SAAS,IACnB3C,EAASsI,EAAM,WACrB,GAAI,CAACtI,EAAQ,MAAU,MAAM,gBAAgB,EAE7C,IAAMwI,EAAU7F,EAAI,KAAK,SAAWhC,EAC9B8H,EAAUzE,EAAM,IAAK,GAASrB,EAAI,KAAK,IAAImB,CAAI,CAAC,EAChD4E,EAAS/F,EAAI,OAKnB,GAAI+F,EAAO,SAAW1E,EAAM,QACR0E,EAAO,OAAO,EAAO,IAAM,CAC3C,IAAM5E,EAAOE,EAAMnD,GACnB,OAAOoH,EAAM,MAAQQ,EAAQ5H,IAAM2H,EAAQP,EAAM,KAAMnE,CAAI,CAC7D,CACY,EAAG,OAGjB,IAAM6E,EAAa,SAAS,cAAc,oBAAoB,EACxDC,EAAW,SAAS,cAAc,kBAAkB,EAE1D5I,EAAO,aAAa2I,EAAYL,CAAK,EACrCtI,EAAO,aAAa4I,EAAUL,EAAI,WAAW,EAE7C,IAAMM,EAAuB,CAC3B,SACA,aACA,UACF,EAEMC,EAAUJ,EAAO,IAAK,GAAUT,EAAM,GAAG,EAE3Cc,EACAC,EAEAC,EAAU,EACVC,EAAUvG,EAAI,OAAO,OAAS,EAC9BwG,EAAU,EACVC,EAAUpF,EAAM,OAAS,EAE7B,KAAOiF,GAAWC,GAAWC,GAAWC,GACtC,GAAIzG,EAAI,OAAOsG,EAAQ,EAAE,QAGvB,SACK,GAAItG,EAAI,OAAOuG,EAAQ,EAAE,QAG9B,SACK,GAAIvG,EAAI,OAAOsG,EAAQ,EAAE,MAAQR,EAAQU,GAI9C,EAAUA,GAAWE,EACnB9F,EAAGZ,EAAI,OAAQsG,CAAO,EACtB1F,EAAGS,EAAOmF,CAAO,EACjBxG,EAAI,KACJ6F,CACF,EACA,IACA,SACK,GAAI7F,EAAI,OAAOuG,EAAQ,EAAE,MAAQT,EAAQW,GAI9C,EAAUA,GAAWC,EACnB9F,EAAGZ,EAAI,OAAQuG,CAAO,EACtB3F,EAAGS,EAAOoF,CAAO,EACjBzG,EAAI,KACJ6F,CACF,EACA,IACA,SACK,GAAI7F,EAAI,OAAOsG,EAAQ,EAAE,MAAQR,EAAQW,GAO9C,EAAUA,GAAWC,EACnB9F,EAAGZ,EAAI,OAAQsG,CAAO,EACtB1F,EAAGS,EAAOoF,CAAO,EACjBzG,EAAI,KACJ6F,CACF,EAIAc,EACET,EACAtF,EAAG6E,EAAWgB,CAAO,EACrBG,GAAaV,EAAWT,EAAUgB,EAAU,EAAE,CAChD,EACA,IACA,SACK,GAAIzG,EAAI,OAAOuG,EAAQ,EAAE,MAAQT,EAAQU,GAQ9C,EAAUA,GAAWE,EACnB9F,EAAGZ,EAAI,OAAQuG,CAAO,EACtB3F,EAAGS,EAAOmF,CAAO,EACjBxG,EAAI,KACJ6F,CACF,EAGAc,EACET,EACAtF,EAAG6E,EAAWe,CAAO,EACrBK,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EACA,IACA,SAMA,IAJIJ,IAAqB,IAAA,IAAaC,IAAqB,IAAA,MACzD,EAAmBS,EAAahB,EAASU,EAASC,CAAO,EACzD,EAAmBK,EAAaX,EAASG,EAASC,CAAO,GAEvD,CAACH,EAAiB,IAAID,EAAQG,EAAQ,EAGxCjB,EAAYzE,EAAGZ,EAAI,OAAQsG,CAAO,CAAC,EACnC,SACK,GAAI,CAACF,EAAiB,IAAID,EAAQI,EAAQ,EAG/ClB,EAAYzE,EAAGZ,EAAI,OAAQuG,CAAO,CAAC,EACnC,QACK,CACL,IAAMQ,EAAWV,EAAiB,IAAIP,EAAQU,EAAQ,EAChDQ,EAAWD,IAAa,IAAA,GAAmC,KAAvB/G,EAAI,OAAO+G,GACjDC,GAMF,EAAUR,GAAWE,EACnBM,EACApG,EAAGS,EAAOmF,CAAO,EACjBxG,EAAI,KACJ6F,CACF,EAEAc,EACET,EACAtF,EAAG6E,EAAWe,CAAO,EACrBK,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EACA,EAAS,QAAU,IAKnB,EAAUA,GAAWS,EACnBf,EACAtF,EAAGS,EAAOmF,CAAO,EACjBxG,EAAI,KACJ6G,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EAEF,GACF,CAIJ,KAAOA,GAAWC,GAEhB,EAAUD,GAAWS,EACnBf,EACAtF,EAAGS,EAAOmF,CAAO,EACjBxG,EAAI,KACJ6G,EAAYX,EAAWT,EAAUe,EAAU,EAAE,CAC/C,EACA,IAGF,KAAOF,GAAWC,GAEZ,CAACvG,EAAI,OAAOsG,EAAQ,EAAE,SAAW,CAACtG,EAAI,OAAOsG,EAAQ,EAAE,SACzDjB,EAAYzE,EAAGZ,EAAI,OAAQsG,CAAO,CAAC,EACrC,IAGF,GAAI,CAACJ,EAAU,WAAW,aAAe,CAACA,EAAU,SAAS,gBAC3D,MAAU,MAAM,wBAAwB,EAE1C,EAAI,SAAW,CACb,MAAOA,EAAU,WAAW,YAC5B,IAAKA,EAAU,SAAS,eAC1B,EACAA,EAAU,OAAO,YAAYA,EAAU,UAAU,EACjDA,EAAU,OAAO,YAAYA,EAAU,QAAQ,EAC/C,EAAI,OAAST,CACf,EAEMqB,GAAgB,EAAiB,EAAe,IAAgB,CACpE,IAAMI,kBAAM,IAAI,IAChB,IAAK,IAAI,EAAIvB,EAAO,GAAKC,EAAK,IAC5BsB,EAAI,IAAIC,EAAK,GAAI,CAAC,EAEpB,OAAOD,CACT,EAEMN,IAAmB,EAAsB,IAC7CtB,EAAQA,EAAM,SAAS,MAAQY,EAAU,SACrCW,GAAkB,EAAsB,IAA2B,CACvE,IAAMpJ,EAAO6H,EAAQA,EAAM,SAAS,IAAMY,EAAU,WACpD,GAAI,CAACzI,EAAK,YAAa,MAAU,MAAM,gBAAgB,EACvD,OAAOA,EAAK,WACd,EAEM2J,GAAiB,EAAoB,EAAY,IAAuB,CACxE/J,EAAO,WAAYA,EAAO,WAAWI,EAAMqC,CAAK,EAC/CzC,EAAO,aAAaI,EAAMqC,CAAK,CACtC,EAEM6G,GAAiB,EAAsB,EAAiB,IAAgB,CAC5E,IAAMtJ,EAAS6I,EAAU,OAEzB,GAAIZ,EAAM,SAAS,QAAUA,EAAM,SAAS,IAC1C8B,EAAc/J,EAAQiI,EAAM,SAAS,MAAO+B,CAAK,MAC9C,CACH,IAAIxJ,EAAiByH,EAAM,SAAS,MACpC,KAAOzH,GAAG,CACR,IAAMN,EAAoBM,EAAE,YAE5B,GADAuJ,EAAc/J,EAAQQ,EAAGwJ,CAAK,EAC1BxJ,IAAMyH,EAAM,SAAS,IAAK,MAC9B,EAAI/H,CACN,CACF,CACF,EAEM0J,GACJ,EACA,EACA,EACA,IACa,CACb,IAAMpF,EAAOyF,EAAK,KAAKnG,CAAI,EACrB8B,EAAWmC,EAAgBvD,CAAI,EAErC,OADAqE,EAAU,OAAO,aAAarE,EAAK,KAAMwF,CAAK,EACvC,CACL,IAAKC,EAAK,IAAInG,CAAI,EAClB,WACA,KAAMU,EAAK,KACX,aAAcA,EAAK,aACnB,MACF,CACF,EAEM6E,GACJ,EACA,EACA,EACA,IACa,CACb,GAAIb,EAAQjI,EAAI,KAAMuD,CAAI,EACxB,MAAO,CACL,GAAGvD,EACH,QAAS,GACT,QAAS,EACX,EAGF,IAAMiE,EAAOyF,EAAK,KAAKnG,CAAI,EACrBxD,EAAcuH,EAAgBtH,EAAI,SAAUiE,CAAI,EAWtD,OAVAwD,EAAYzH,CAAG,EAUR,CAPL,IAAK0J,EAAK,IAAInG,CAAI,EAClB,SAAUxD,EACV,KAAMkE,EAAK,KACX,aAAcA,EAAK,aACnB,MAGY,CAChB,EAEM6D,GACJ,EACA,EACA,IACqB,CACrB,IAAMvD,EAAO,SAAS,uBAAuB,EAmB7C,OAlBAd,EAAM,QAAS,GAAS,CACtB,IAAMQ,EAAOyF,EAAK,KAAKnG,CAAI,EACrBhD,EAAMmJ,EAAK,IAAInG,CAAI,EAEnB8B,EAAWmC,EAAgBvD,CAAI,EACrCkE,EAAO,KAAK,CACV,MACA,WACA,KAAMlE,EAAK,KACX,OACA,aAAcA,EAAK,YACrB,CAAC,EACDM,EAAK,YAAYN,EAAK,IAAI,CAC5B,CAAC,EAEGM,EAAK,WAAW,SAAW,GAC7BA,EAAK,YAAY,SAAS,cAAc,YAAY,CAAC,EAEhDA,CACT,EAEaoF,IACX,EACA,IACgC,CAChC,IAAMxB,EAAqB,CAAC,EACtB5D,EAAOuD,EAAM1G,EAAI,IAAI,EAAGsI,EAAMvB,CAAM,EAEpC/F,EAAwB,CAAC,OAAM,SAAQ,SAAUxC,EAAW2E,CAAI,CAAC,EAGvE,MAAO,CACL,KAAM,OACN,KAAMA,EACN,KALW1C,EAAWT,EAAKgB,EAAKuF,EAK7B,EACH,SAAYvF,EAAI,QAClB,CACF,EClZMwH,IAAc,EAAQ,IAAsB,CAChD,EAAI,KAAK,YAAc,OAAOpJ,CAAG,CACnC,EAEa+E,GAAW,GAA8C,CACpE,IAAMA,EAAO,SAAS,eACpB5C,aAAkBpB,EAAM,OAAOoB,EAAO,IAAI,CAAC,EAAI,OAAOA,CAAM,CAC9D,EACMP,EAAoB,CAAC,KAAMmD,CAAI,EAGrC,MAAO,CACL,KAAM,OACN,KAAMA,EACN,KAJA5C,aAAkBpB,EAAMM,EAAWc,EAAQP,EAAKwH,EAAO,EAAI,IAAA,EAK7D,CACF"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "sigula",
-  "version": "1.0.1",
+  "version": "1.0.3",
   "author": "zjh <zhanjh@126.com>",
   "description": "Tiny web framework with fine-grained signal reactivity.",
   "license": "MIT",