@adaas/are-html 0.0.20 → 0.0.22

package/dist/node/directives/AreDirectiveFor.directive.d.mts

@@ -5,9 +5,52 @@ import { AreStore, AreScene } from '@adaas/are';
 import '../lib/AreStyle/AreStyle.context.mjs';
 
 declare class AreDirectiveFor extends AreDirective {
+    /**
+     * Lists whose number of NEW item nodes is at or below this threshold render
+     * fully synchronously — byte-for-byte the previous behavior. Typical UIs
+     * (menus, small tables) are therefore completely unaffected; only genuinely
+     * large lists pay the (tiny) scheduling cost to keep the main thread responsive.
+     */
+    private static readonly SYNC_THRESHOLD;
+    /**
+     * Per-chunk time budget (ms). During a large-list render we mount item nodes
+     * until this much time has elapsed, then yield to the browser so it can paint
+     * and process input before the next chunk. ~16ms targets one animation frame.
+     */
+    private static readonly CHUNK_BUDGET_MS;
+    /**
+     * Per-attribute serialization state. A new update() that arrives while a
+     * chunked render of the SAME `$for` is still in flight does NOT start a second
+     * concurrent pass (which could interleave mutations on the shared children
+     * list); instead it marks `pending` and the in-flight run re-runs once more
+     * with the latest data when it finishes. This guarantees the children list is
+     * only ever mutated by one pass at a time and the final state always reflects
+     * the most recent store value.
+     */
+    private static readonly renderState;
     transform(attribute: AreDirectiveAttribute, scope: A_Scope, store: AreStore, scene: AreScene, logger: A_Logger, ...args: any[]): void;
     compile(attribute: AreDirectiveAttribute, store: AreStore, scene: AreScene, ...args: any[]): void;
-    update(attribute: AreDirectiveAttribute, store: AreStore, scene: AreScene, ...args: any[]): void;
+    update(attribute: AreDirectiveAttribute, store: AreStore, scene: AreScene, ...args: any[]): void | Promise<void>;
+    /**
+     * Core of the `$for` update: re-diff the source array against the current
+     * children, reconcile reused/removed items, then mount the new ones (small
+     * lists synchronously, large lists time-sliced). Never called while another
+     * pass for the same `$for` is in flight (see `update`).
+     */
+    private performUpdate;
+    /**
+     * Completes an update pass. If another update() arrived while a chunked
+     * render was streaming, run exactly one more pass now from the latest store
+     * value so the final DOM always reflects the most recent data.
+     */
+    private finishUpdate;
+    /**
+     * Walks the node's ancestor chain (inclusive) and reports whether the
+     * whole path is currently active — i.e. the subtree is actually rendered
+     * into the DOM. A single inactive ancestor scene (e.g. a `$if` whose
+     * condition is false) means the subtree is detached.
+     */
+    private isAttached;
     /**
      * Build a key-function that derives a stable identity from each item.
      * If the user provided a `track <expr>` clause, evaluate it as a path on

package/dist/node/directives/AreDirectiveFor.directive.d.ts

@@ -5,9 +5,52 @@ import { AreStore, AreScene } from '@adaas/are';
 import '../lib/AreStyle/AreStyle.context.js';
 
 declare class AreDirectiveFor extends AreDirective {
+    /**
+     * Lists whose number of NEW item nodes is at or below this threshold render
+     * fully synchronously — byte-for-byte the previous behavior. Typical UIs
+     * (menus, small tables) are therefore completely unaffected; only genuinely
+     * large lists pay the (tiny) scheduling cost to keep the main thread responsive.
+     */
+    private static readonly SYNC_THRESHOLD;
+    /**
+     * Per-chunk time budget (ms). During a large-list render we mount item nodes
+     * until this much time has elapsed, then yield to the browser so it can paint
+     * and process input before the next chunk. ~16ms targets one animation frame.
+     */
+    private static readonly CHUNK_BUDGET_MS;
+    /**
+     * Per-attribute serialization state. A new update() that arrives while a
+     * chunked render of the SAME `$for` is still in flight does NOT start a second
+     * concurrent pass (which could interleave mutations on the shared children
+     * list); instead it marks `pending` and the in-flight run re-runs once more
+     * with the latest data when it finishes. This guarantees the children list is
+     * only ever mutated by one pass at a time and the final state always reflects
+     * the most recent store value.
+     */
+    private static readonly renderState;
     transform(attribute: AreDirectiveAttribute, scope: A_Scope, store: AreStore, scene: AreScene, logger: A_Logger, ...args: any[]): void;
     compile(attribute: AreDirectiveAttribute, store: AreStore, scene: AreScene, ...args: any[]): void;
-    update(attribute: AreDirectiveAttribute, store: AreStore, scene: AreScene, ...args: any[]): void;
+    update(attribute: AreDirectiveAttribute, store: AreStore, scene: AreScene, ...args: any[]): void | Promise<void>;
+    /**
+     * Core of the `$for` update: re-diff the source array against the current
+     * children, reconcile reused/removed items, then mount the new ones (small
+     * lists synchronously, large lists time-sliced). Never called while another
+     * pass for the same `$for` is in flight (see `update`).
+     */
+    private performUpdate;
+    /**
+     * Completes an update pass. If another update() arrived while a chunked
+     * render was streaming, run exactly one more pass now from the latest store
+     * value so the final DOM always reflects the most recent data.
+     */
+    private finishUpdate;
+    /**
+     * Walks the node's ancestor chain (inclusive) and reports whether the
+     * whole path is currently active — i.e. the subtree is actually rendered
+     * into the DOM. A single inactive ancestor scene (e.g. a `$if` whose
+     * condition is false) means the subtree is detached.
+     */
+    private isAttached;
     /**
      * Build a key-function that derives a stable identity from each item.
      * If the user provided a `track <expr>` clause, evaluate it as a path on

package/dist/node/directives/AreDirectiveFor.directive.js

@@ -7,6 +7,7 @@ var AreDirective_component = require('@adaas/are-html/directive/AreDirective.com
 var AddComment_instruction = require('@adaas/are-html/instructions/AddComment.instruction');
 var AreDirective_context = require('@adaas/are-html/directive/AreDirective.context');
 var core = require('@adaas/a-frame/core');
+var AreScheduler_helper = require('@adaas/are-html/helpers/AreScheduler.helper');
 
 var __defProp = Object.defineProperty;
 var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
@@ -47,11 +48,30 @@ exports.AreDirectiveFor = class AreDirectiveFor extends AreDirective_component.A
     scene.unPlan(hostInstruction);
   }
   update(attribute, store, scene, ...args) {
+    let state = exports.AreDirectiveFor.renderState.get(attribute);
+    if (!state) {
+      state = { running: false, pending: false };
+      exports.AreDirectiveFor.renderState.set(attribute, state);
+    }
+    if (state.running) {
+      state.pending = true;
+      return;
+    }
+    return this.performUpdate(attribute, store, scene, state);
+  }
+  /**
+   * Core of the `$for` update: re-diff the source array against the current
+   * children, reconcile reused/removed items, then mount the new ones (small
+   * lists synchronously, large lists time-sliced). Never called while another
+   * pass for the same `$for` is in flight (see `update`).
+   */
+  performUpdate(attribute, store, scene, state) {
     const { key, index, arrayExpr, trackExpr } = this.parseExpression(attribute.content);
     const newArray = this.resolveArray(store, arrayExpr, attribute.content);
     const owner = attribute.owner;
     const currentChildren = [...owner.children];
     attribute.value = newArray;
+    const attached = this.isAttached(owner);
     const computeKey = this.makeKeyFn(key, index, trackExpr);
     const childByKey = /* @__PURE__ */ new Map();
     const remaining = /* @__PURE__ */ new Set();
@@ -62,7 +82,7 @@ exports.AreDirectiveFor = class AreDirectiveFor extends AreDirective_component.A
       childByKey.set(k, child);
       remaining.add(child);
     }
-    const newOnes = [];
+    const toCreate = [];
     for (let i = 0; i < newArray.length; i++) {
       const item = newArray[i];
       const k = computeKey(item, i);
@@ -80,19 +100,72 @@ exports.AreDirectiveFor = class AreDirectiveFor extends AreDirective_component.A
           [index || "index"]: i
         };
       } else {
-        const itemNode = this.spawnItemNode(attribute.template, owner, key, index, item, i);
-        newOnes.push(itemNode);
+        toCreate.push({ item, idx: i });
       }
     }
     for (const child of remaining) {
-      child.unmount();
+      if (attached) child.unmount();
       owner.removeChild(child);
     }
-    for (const child of newOnes) {
+    const createItem = (desc) => {
+      const child = this.spawnItemNode(attribute.template, owner, key, index, desc.item, desc.idx);
       child.transform();
       child.compile();
-      child.mount();
+      if (attached) child.mount();
+    };
+    if (toCreate.length <= exports.AreDirectiveFor.SYNC_THRESHOLD) {
+      for (const desc of toCreate) createItem(desc);
+      return this.finishUpdate(attribute, store, scene, state);
+    }
+    state.running = true;
+    let cursor = 0;
+    const processChunk = () => {
+      try {
+        const start = AreScheduler_helper.AreSchedulerHelper.now();
+        while (cursor < toCreate.length) {
+          createItem(toCreate[cursor]);
+          cursor++;
+          if (AreScheduler_helper.AreSchedulerHelper.now() - start >= exports.AreDirectiveFor.CHUNK_BUDGET_MS) break;
+        }
+      } catch (error) {
+        state.running = false;
+        state.pending = false;
+        throw error;
+      }
+      if (cursor < toCreate.length) {
+        return new Promise((resolve) => {
+          AreScheduler_helper.AreSchedulerHelper.scheduleMacrotask(() => resolve(processChunk()));
+        });
+      }
+      return this.finishUpdate(attribute, store, scene, state);
+    };
+    return processChunk();
+  }
+  /**
+   * Completes an update pass. If another update() arrived while a chunked
+   * render was streaming, run exactly one more pass now from the latest store
+   * value so the final DOM always reflects the most recent data.
+   */
+  finishUpdate(attribute, store, scene, state) {
+    state.running = false;
+    if (state.pending) {
+      state.pending = false;
+      return this.performUpdate(attribute, store, scene, state);
+    }
+  }
+  /**
+   * Walks the node's ancestor chain (inclusive) and reports whether the
+   * whole path is currently active — i.e. the subtree is actually rendered
+   * into the DOM. A single inactive ancestor scene (e.g. a `$if` whose
+   * condition is false) means the subtree is detached.
+   */
+  isAttached(node) {
+    let current = node;
+    while (current) {
+      if (current.scene?.isInactive) return false;
+      current = current.parent;
     }
+    return true;
   }
   // ─────────────────────────────────────────────────────────────────────────────
   // ── Helpers ──────────────────────────────────────────────────────────────────
@@ -238,6 +311,29 @@ exports.AreDirectiveFor = class AreDirectiveFor extends AreDirective_component.A
     return itemNode;
   }
 };
+/**
+ * Lists whose number of NEW item nodes is at or below this threshold render
+ * fully synchronously — byte-for-byte the previous behavior. Typical UIs
+ * (menus, small tables) are therefore completely unaffected; only genuinely
+ * large lists pay the (tiny) scheduling cost to keep the main thread responsive.
+ */
+exports.AreDirectiveFor.SYNC_THRESHOLD = 100;
+/**
+ * Per-chunk time budget (ms). During a large-list render we mount item nodes
+ * until this much time has elapsed, then yield to the browser so it can paint
+ * and process input before the next chunk. ~16ms targets one animation frame.
+ */
+exports.AreDirectiveFor.CHUNK_BUDGET_MS = 16;
+/**
+ * Per-attribute serialization state. A new update() that arrives while a
+ * chunked render of the SAME `$for` is still in flight does NOT start a second
+ * concurrent pass (which could interleave mutations on the shared children
+ * list); instead it marks `pending` and the in-flight run re-runs once more
+ * with the latest data when it finishes. This guarantees the children list is
+ * only ever mutated by one pass at a time and the final state always reflects
+ * the most recent store value.
+ */
+exports.AreDirectiveFor.renderState = /* @__PURE__ */ new WeakMap();
 __decorateClass([
   AreDirective_component.AreDirective.Transform,
   __decorateParam(0, aConcept.A_Inject(aConcept.A_Caller)),

package/dist/node/directives/AreDirectiveFor.directive.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/directives/AreDirectiveFor.directive.ts"],"names":["AreDirectiveFor","AreDirective","AddCommentInstruction","AreDirectiveContext","AreCompilerError","A_Caller","A_Scope","AreStore","AreScene","A_Logger","A_Frame"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAyBaA,uBAAA,GAAN,8BAA8BC,mCAAA,CAAa;AAAA,EAI9C,UACwB,SAAA,EACD,KAAA,EACC,KAAA,EACA,KAAA,EACA,WACjB,IAAA,EACL;AAEE,IAAA,MAAA,CAAO,MAAM,CAAA,gCAAA,EAAmC,SAAA,CAAU,MAAM,KAAA,CAAM,QAAA,EAAU,CAAA,CAAA,CAAG,CAAA;AAEnF,IAAA,MAAM,OAAO,SAAA,CAAU,KAAA;AAQvB,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,EAAe;AAOxC,IAAA,MAAM,OAAA,GAAU,YAAY,UAAA,CAAW,IAAA,CAAK,OAAK,CAAA,CAAE,IAAA,KAAS,UAAU,IAAI,CAAA;AAE1E,IAAA,IAAI,OAAA,EAAS;AACT,MAAA,WAAA,CAAY,KAAA,CAAM,WAAW,OAAO,CAAA;AACpC,MAAA,IAAA,CAAK,KAAA,CAAM,SAAS,OAAO,CAAA;AAAA,IAC/B;AAMA,IAAA,IAAA,CAAK,IAAA,EAAK;AAKV,IAAA,SAAA,CAAU,QAAA,GAAW,WAAA;AAMrB,IAAA,MAAM,EAAE,KAAK,KAAA,EAAO,SAAA,KAAc,IAAA,CAAK,eAAA,CAAgB,UAAU,OAAO,CAAA;AACxE,IAAA,MAAM,QAAQ,IAAA,CAAK,YAAA,CAAa,KAAA,EAAO,SAAA,EAAW,UAAU,OAAO,CAAA;AAEnE,IAAA,SAAA,CAAU,KAAA,GAAQ,KAAA;AAUlB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACnC,MAAA,IAAA,CAAK,aAAA,CAAc,SAAA,CAAU,QAAA,EAAW,SAAA,CAAU,KAAA,EAAO,KAAK,KAAA,EAAO,KAAA,CAAM,CAAC,CAAA,EAAG,CAAC,CAAA;AAAA,IACpF;AAAA,EACJ;AAAA,EAIA,OAAA,CACwB,SAAA,EACA,KAAA,EACA,KAAA,EAAA,GACjB,IAAA,EACC;AAMJ,IAAA,MAAM,kBAAkB,KAAA,CAAM,IAAA;AAC9B,IAAA,MAAM,iBAAA,GAAoB,CAAA,UAAA,EAAa,SAAA,CAAU,QAAA,CAAU,EAAE,CAAA,KAAA,CAAA;AAC7D,IAAA,MAAM,cAAc,IAAIC,4CAAA,CAAsB,EAAE,OAAA,EAAS,mBAAmB,CAAA;AAE5E,IAAA,KAAA,CAAM,QAAQ,WAAW,CAAA;AACzB,IAAA,KAAA,CAAM,UAAA,CAAW,aAAa,eAAe,CAAA;AAC7C,IAAA,KAAA,CAAM,OAAO,eAAe,CAAA;AAAA,EAChC;AAAA,EAIA,MAAA,CACwB,SAAA,EACA,KAAA,EACA,KAAA,EAAA,GACjB,IAAA,EACC;AAIJ,IAAA,MAAM,EAAE,KAAK,KAAA,EAAO,SAAA,EAAW,WAAU,GAAI,IAAA,CAAK,eAAA,CAAgB,SAAA,CAAU,OAAO,CAAA;AACnF,IAAA,MAAM,WAAW,IAAA,CAAK,YAAA,CAAa,KAAA,EAAO,SAAA,EAAW,UAAU,OAAO,CAAA;AAEtE,IAAA,MAAM,QAAQ,SAAA,CAAU,KAAA;AACxB,IAAA,MAAM,eAAA,GAAkB,CAAC,GAAG,KAAA,CAAM,QAAQ,CAAA;AAE1C,IAAA,SAAA,CAAU,KAAA,GAAQ,QAAA;AAElB,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,SAAA,CAAU,GAAA,EAAK,OAAO,SAAS,CAAA;AAGvD,IAAA,MAAM,UAAA,uBAAiB,GAAA,EAAsB;AAC7C,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAiB;AAEvC,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,eAAA,CAAgB,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,MAAM,KAAA,GAAQ,gBAAgB,CAAC,CAAA;AAC/B,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,KAAA,CAAM,WAAA,CAAYC,wCAAmB,CAAA;AACvD,MAAA,MAAM,CAAA,GAAI,GAAA,GAAM,UAAA,CAAW,GAAA,CAAI,MAAM,GAAG,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,KAAA,IAAS,OAAO,CAAC,CAAA,0BAAW,QAAQ,CAAA;AACzF,MAAA,UAAA,CAAW,GAAA,CAAI,GAAG,KAAK,CAAA;AACvB,MAAA,SAAA,CAAU,IAAI,KAAK,CAAA;AAAA,IACvB;AAIA,IAAA,MAAM,UAAyB,EAAC;AAEhC,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACtC,MAAA,MAAM,IAAA,GAAO,SAAS,CAAC,CAAA;AACvB,MAAA,MAAM,CAAA,GAAI,UAAA,CAAW,IAAA,EAAM,CAAC,CAAA;AAC5B,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA;AAEjC,MAAA,IAAI,QAAA,EAAU;AACV,QAAA,SAAA,CAAU,OAAO,QAAQ,CAAA;AAEzB,QAAA,IAAI,gBAAA,GAAmB,QAAA,CAAS,KAAA,CAAM,WAAA,CAAYA,wCAAmB,CAAA;AACrE,QAAA,IAAI,CAAC,gBAAA,EAAkB;AACnB,UAAA,gBAAA,GAAmB,IAAIA,wCAAA,CAAoB,QAAA,CAAS,KAAK,CAAA;AACzD,UAAA,QAAA,CAAS,KAAA,CAAM,SAAS,gBAAgB,CAAA;AAAA,QAC5C;AACA,QAAA,gBAAA,CAAiB,KAAA,GAAQ;AAAA,UACrB,GAAG,gBAAA,CAAiB,KAAA;AAAA,UACpB,CAAC,GAAG,GAAG,IAAA;AAAA,UACP,CAAC,KAAA,IAAS,OAAO,GAAG;AAAA,SACxB;AACqB,MACzB,CAAA,MAAO;AACH,QAAA,MAAM,QAAA,GAAW,KAAK,aAAA,CAAc,SAAA,CAAU,UAAW,KAAA,EAAO,GAAA,EAAK,KAAA,EAAO,IAAA,EAAM,CAAC,CAAA;AAEnF,QAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA;AAAA,MACzB;AAAA,IACJ;AAGA,IAAA,KAAA,MAAW,SAAS,SAAA,EAAW;AAC3B,MAAA,KAAA,CAAM,OAAA,EAAQ;AACd,MAAA,KAAA,CAAM,YAAY,KAAK,CAAA;AAAA,IAC3B;AAGA,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AACzB,MAAA,KAAA,CAAM,SAAA,EAAU;AAChB,MAAA,KAAA,CAAM,OAAA,EAAQ;AACd,MAAA,KAAA,CAAM,KAAA,EAAM;AAAA,IAChB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,SAAA,CAAU,GAAA,EAAa,KAAA,EAA2B,SAAA,EAA8D;AACpH,IAAA,IAAI,CAAC,SAAA,EAAW;AACZ,MAAA,OAAO,CAAC,IAAA,EAAM,CAAA,KAAM,IAAA,IAAQ,CAAA;AAAA,IAChC;AAGA,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,UAAA,CAAW,GAAA,GAAM,GAAG,CAAA,GAAI,SAAA,CAAU,KAAA,CAAM,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,GAAI,SAAA;AAEjF,IAAA,OAAO,CAAC,MAAM,CAAA,KAAM;AAChB,MAAA,IAAI,IAAA,IAAQ,MAAM,OAAO,CAAA;AACzB,MAAA,IAAI,SAAS,GAAA,IAAO,IAAA,KAAS,UAAU,OAAO,IAAA,KAAS,WAAW,CAAA,GAAI,IAAA;AAGtE,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,MAAA,IAAI,CAAA,GAAS,IAAA;AACb,MAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACnB,QAAA,IAAI,CAAA,IAAK,MAAM,OAAO,CAAA;AACtB,QAAA,CAAA,GAAI,EAAE,CAAC,CAAA;AAAA,MACX;AACA,MAAA,OAAO,CAAA,IAAK,CAAA;AAAA,IAChB,CAAA;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcQ,gBAAgB,OAAA,EAAmC;AAEvD,IAAA,IAAI,SAAA;AACJ,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,MAAA,CAAO,aAAa,CAAA;AAC7C,IAAA,IAAI,IAAA,GAAO,OAAA;AACX,IAAA,IAAI,aAAa,EAAA,EAAI;AACjB,MAAA,MAAM,IAAI,OAAA,CAAQ,KAAA,CAAM,QAAQ,CAAA,CAAE,MAAM,kBAAkB,CAAA;AAC1D,MAAA,IAAI,CAAA,EAAG;AACH,QAAA,SAAA,GAAY,CAAA,CAAE,CAAC,CAAA,CAAE,IAAA,EAAK;AACtB,QAAA,IAAA,GAAO,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,QAAQ,EAAE,IAAA,EAAK;AAAA,MAC3C;AAAA,IACJ;AAEA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,WAAA,CAAY,MAAM,CAAA;AACvC,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,OAAO,EAAE,IAAA,EAAK,CAAE,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAA;AACxE,IAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAM,OAAA,GAAU,CAAC,EAAE,IAAA,EAAK;AAC/C,IAAA,MAAM,QAAA,GAAW,YAAY,KAAA,CAAM,GAAG,EAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,IAAA,EAAM,CAAA;AAEzD,IAAA,OAAO;AAAA,MACH,GAAA,EAAK,SAAS,CAAC,CAAA;AAAA,MACf,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,IAAK,MAAA;AAAA,MACtB,SAAA;AAAA,MACA;AAAA,KACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,YAAA,CAAa,KAAA,EAAiB,SAAA,EAAmB,WAAA,EAA4B;AACjF,IAAA,IAAI,MAAA;AACJ,IAAA,MAAM,SAAA,GAAY,SAAA,CAAU,KAAA,CAAM,mBAAmB,CAAA;AAErD,IAAA,IAAI,SAAA,EAAW;AACX,MAAA,MAAM,MAAA,GAAS,SAAA,CAAU,CAAC,CAAA,CAAE,IAAA,EAAK;AACjC,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,GAAA,CAAI,MAAa,CAAA;AAElC,MAAA,IAAI,OAAO,EAAA,KAAO,UAAA;AACd,QAAA,MAAM,IAAIC,oBAAA,CAAiB;AAAA,UACvB,KAAA,EAAO,kCAAA;AAAA,UACP,WAAA,EAAa,CAAA,gBAAA,EAAmB,MAAM,CAAA,gFAAA,EAAmF,OAAO,EAAE,CAAA;AAAA,SACrI,CAAA;AAEL,MAAA,MAAM,OAAA,GAAU,SAAA,CAAU,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,IAAA,EAAM,CAAA;AACzD,MAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,GAAA,CAAI,CAAA,GAAA,KAAO;AACpC,QAAA,IAAI,GAAA,CAAI,UAAA,CAAW,GAAG,CAAA,IAAK,GAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACpE,QAAA,IAAI,GAAA,CAAI,UAAA,CAAW,GAAG,CAAA,IAAK,GAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACpE,QAAA,IAAI,CAAC,MAAM,MAAA,CAAO,GAAG,CAAC,CAAA,EAAG,OAAO,OAAO,GAAG,CAAA;AAE1C,QAAA,MAAM,QAAA,GAAW,GAAA,CAAI,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAA;AACtC,QAAA,IAAI,QAAA,CAAS,QAAA,CAAS,GAAG,CAAA,EAAG;AACxB,UAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAC,CAAA;AAC/D,UAAA,IAAI,GAAA,GAAW,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAQ,CAAA;AACxC,UAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACnC,YAAA,IAAI,GAAA,IAAO,MAAM,OAAO,MAAA;AACxB,YAAA,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,UACtB;AACA,UAAA,OAAO,GAAA,IAAO,MAAA;AAAA,QAClB;AACA,QAAA,OAAO,KAAA,CAAM,IAAI,QAAe,CAAA;AAAA,MACpC,CAAC,CAAA;AAED,MAAA,MAAA,GAAU,EAAA,CAAgB,GAAG,YAAY,CAAA;AAAA,IAC7C,CAAA,MAAA,IAAW,SAAA,CAAU,QAAA,CAAS,GAAG,CAAA,EAAG;AAIhC,MAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAC,CAAA;AAChE,MAAA,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAQ,CAAA;AAClC,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACnC,QAAA,IAAI,UAAU,IAAA,EAAM;AACpB,QAAA,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,MAC5B;AAAA,IACJ,CAAA,MAAO;AACH,MAAA,MAAA,GAAS,MAAM,GAAA,CAAI,SAAA,CAAU,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAQ,CAAA;AAAA,IAC1D;AAKA,IAAA,IAAI,MAAA,IAAU,IAAA,EAAM,OAAO,EAAC;AAE5B,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA;AACrB,MAAA,MAAM,IAAIA,oBAAA,CAAiB;AAAA,QACvB,KAAA,EAAO,+BAAA;AAAA,QACP,WAAA,EAAa,CAAA,6CAAA,EAAgD,OAAO,MAAM,CAAA,eAAA,EAAkB,WAAW,CAAA,aAAA,EAAgB,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,CAAA;AAAA,OAChJ,CAAA;AAEL,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,cACJ,QAAA,EACA,KAAA,EACA,GAAA,EACA,KAAA,EACA,MACA,CAAA,EACW;AACX,IAAA,MAAM,QAAA,GAAW,SAAS,KAAA,EAAM;AAEhC,IAAA,KAAA,CAAM,SAAS,QAAQ,CAAA;AAEvB,IAAA,MAAM,KAAA,GAAQ,CAAC,QAAQ,CAAA;AAEvB,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACrB,MAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAE5B,MAAA,OAAA,CAAQ,IAAA,EAAK;AAEb,MAAA,KAAA,CAAM,IAAA,CAAK,GAAG,OAAA,CAAQ,QAAyB,CAAA;AAAA,IACnD;AAKA,IAAA,IAAI,gBAAA,GAAmB,QAAA,CAAS,KAAA,CAAM,WAAA,CAAYD,wCAAmB,CAAA;AAErE,IAAA,IAAI,CAAC,gBAAA,EAAkB;AACnB,MAAA,gBAAA,GAAmB,IAAIA,wCAAA,CAAoB,QAAA,CAAS,KAAK,CAAA;AACzD,MAAA,QAAA,CAAS,KAAA,CAAM,SAAS,gBAAgB,CAAA;AAAA,IAC5C;AAEA,IAAA,gBAAA,CAAiB,KAAA,GAAQ;AAAA,MACrB,GAAG,gBAAA,CAAiB,KAAA;AAAA,MACpB,CAAC,GAAG,GAAG,IAAA;AAAA,MACP,CAAC,KAAA,IAAS,OAAO,GAAG;AAAA,KACxB;AAEA,IAAA,QAAA,CAAS,MAAM,QAAA,EAAS;AAExB,IAAA,OAAO,QAAA;AAAA,EACX;AACJ;AAnWI,eAAA,CAAA;AAAA,EADCF,mCAAA,CAAa,SAAA;AAAA,EAET,qCAASI,iBAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,gBAAO,CAAA,CAAA;AAAA,EAChB,qCAASC,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,gBAAQ,CAAA;AAAA,CAAA,EATbT,uBAAA,CAIT,SAAA,EAAA,WAAA,EAAA,CAAA,CAAA;AAoEA,eAAA,CAAA;AAAA,EADCC,mCAAA,CAAa,OAAA;AAAA,EAET,qCAASI,iBAAQ,CAAA,CAAA;AAAA,EACjB,qCAASE,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,YAAQ,CAAA;AAAA,CAAA,EA3EbR,uBAAA,CAwET,SAAA,EAAA,SAAA,EAAA,CAAA,CAAA;AAsBA,eAAA,CAAA;AAAA,EADCC,mCAAA,CAAa,MAAA;AAAA,EAET,qCAASI,iBAAQ,CAAA,CAAA;AAAA,EACjB,qCAASE,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,YAAQ,CAAA;AAAA,CAAA,EAjGbR,uBAAA,CA8FT,SAAA,EAAA,QAAA,EAAA,CAAA,CAAA;AA9FSA,uBAAA,GAAN,eAAA,CAAA;AAAA,EALNU,aAAQ,MAAA,CAAO;AAAA,IACZ,SAAA,EAAW,YAAA;AAAA,IACX,WAAA,EAAa;AAAA,GAChB,CAAA;AAAA,EACAT,mCAAA,CAAa,SAAS,CAAC;AAAA,CAAA,EACXD,uBAAA,CAAA","file":"AreDirectiveFor.directive.js","sourcesContent":["import { A_Caller, A_Inject, A_Scope } from \"@adaas/a-concept\";\nimport { A_Logger } from \"@adaas/a-utils/a-logger\";\nimport { AreDirectiveAttribute } from \"@adaas/are-html/attributes/AreDirective.attribute\";\nimport { AreCompilerError, AreScene, AreStore } from \"@adaas/are\";\nimport { AreDirective } from \"@adaas/are-html/directive/AreDirective.component\";\nimport { AddCommentInstruction } from \"@adaas/are-html/instructions/AddComment.instruction\";\nimport { AreHTMLNode } from \"@adaas/are-html/node\";\nimport { AreDirectiveContext } from \"@adaas/are-html/directive/AreDirective.context\";\nimport { A_Frame } from \"@adaas/a-frame/core\";\n\n\ntype AreForExpression = {\n    key: string;\n    index: string | undefined;\n    arrayExpr: string;\n    /** Optional `track <expr>` clause, e.g. `track row.id` */\n    trackExpr: string | undefined;\n};\n\n\n@A_Frame.Define({\n    namespace: 'a-are-html',\n    description: 'Built-in $for directive. Iterates over an array expression resolved from the store and renders a cloned template fragment per item, managing per-item subscopes and comment-node anchors. Supports keyed diffing via an optional track clause to minimise DOM mutations on collection updates.'\n})\n@AreDirective.Priority(1)\nexport class AreDirectiveFor extends AreDirective {\n\n\n    @AreDirective.Transform\n    transform(\n        @A_Inject(A_Caller) attribute: AreDirectiveAttribute,\n        @A_Inject(A_Scope) scope: A_Scope,\n        @A_Inject(AreStore) store: AreStore,\n        @A_Inject(AreScene) scene: AreScene,\n        @A_Inject(A_Logger) logger: A_Logger,\n        ...args: any[]\n    ) {\n\n        logger.debug(`[Transform] directive $FOR for <${attribute.owner.aseid.toString()}>`)\n\n        const node = attribute.owner;\n\n        /**\n         * Transfer the original node's scope (with all registered attributes and children)\n         * to the template clone, and give the owner node a fresh empty scope.\n         * This mirrors the $if directive's approach, making the owner a lightweight\n         * group container whose sole visible presence is a comment placeholder.\n         */\n        const forTemplate = node.cloneWithScope();\n\n        /**\n         * Remove the $for attribute from the template so iterative clones do not\n         * re-trigger this directive during their own transform phase.\n         * Re-register it on the owner so the reactive compile/update pipeline keeps working.\n         */\n        const forAttr = forTemplate.attributes.find(d => d.name === attribute.name);\n\n        if (forAttr) {\n            forTemplate.scope.deregister(forAttr);\n            node.scope.register(forAttr);\n        }\n\n        /**\n         * Re-initialize the owner node with its fresh scope so it becomes a valid\n         * group container that will own the generated item nodes as children.\n         */\n        node.init();\n\n        /**\n         * Store the template for use in compile and update.\n         */\n        attribute.template = forTemplate;\n\n\n        /**\n         * Parse the $for expression and evaluate the source array.\n         */\n        const { key, index, arrayExpr } = this.parseExpression(attribute.content);\n        const array = this.resolveArray(store, arrayExpr, attribute.content);\n\n        attribute.value = array;\n\n        /**\n         * For each item in the array, spawn a clone of the template with the\n         * item's store values pre-set and its scene activated.\n         *\n         * The children are added to the owner node before the main compiler's\n         * children iteration loop runs, so the main cycle will compile them —\n         * no explicit child.compile() call is needed here.\n         */\n        for (let i = 0; i < array.length; i++) {\n            this.spawnItemNode(attribute.template!, attribute.owner, key, index, array[i], i);\n        }\n    }\n\n\n    @AreDirective.Compile\n    compile(\n        @A_Inject(A_Caller) attribute: AreDirectiveAttribute,\n        @A_Inject(AreStore) store: AreStore,\n        @A_Inject(AreScene) scene: AreScene,\n        ...args: any[]\n    ): void {\n        /**\n         * Replace the group node's default host declaration with a comment placeholder\n         * so the owner element itself does not render as a DOM element — the item nodes\n         * render as its children instead.\n         */\n        const hostInstruction = scene.host!;\n        const commentIdentifier = ` --- for: ${attribute.template!.id} --- `;\n        const declaration = new AddCommentInstruction({ content: commentIdentifier });\n\n        scene.setHost(declaration);\n        scene.planBefore(declaration, hostInstruction);\n        scene.unPlan(hostInstruction);\n    }\n\n\n    @AreDirective.Update\n    update(\n        @A_Inject(A_Caller) attribute: AreDirectiveAttribute,\n        @A_Inject(AreStore) store: AreStore,\n        @A_Inject(AreScene) scene: AreScene,\n        ...args: any[]\n    ): void {\n        /**\n         * Re-evaluate the source array.\n         */\n        const { key, index, arrayExpr, trackExpr } = this.parseExpression(attribute.content);\n        const newArray = this.resolveArray(store, arrayExpr, attribute.content);\n\n        const owner = attribute.owner;\n        const currentChildren = [...owner.children] as AreHTMLNode[];\n\n        attribute.value = newArray;\n\n        const computeKey = this.makeKeyFn(key, index, trackExpr);\n\n        // ── 1. Index existing children by stable key ────────────────────────\n        const childByKey = new Map<any, AreHTMLNode>();\n        const remaining = new Set<AreHTMLNode>();\n\n        for (let i = 0; i < currentChildren.length; i++) {\n            const child = currentChildren[i];\n            const ctx = child.scope.resolveFlat(AreDirectiveContext);\n            const k = ctx ? computeKey(ctx.scope[key], ctx.scope[index || 'index']) : Symbol('orphan');\n            childByKey.set(k, child);\n            remaining.add(child);\n        }\n\n        // ── 2. Walk desired list; reuse existing or spawn new ───────────────\n        const desired: AreHTMLNode[] = [];\n        const newOnes: AreHTMLNode[] = [];\n\n        for (let i = 0; i < newArray.length; i++) {\n            const item = newArray[i];\n            const k = computeKey(item, i);\n            const existing = childByKey.get(k);\n\n            if (existing) {\n                remaining.delete(existing);\n\n                let directiveContext = existing.scope.resolveFlat(AreDirectiveContext);\n                if (!directiveContext) {\n                    directiveContext = new AreDirectiveContext(existing.aseid);\n                    existing.scope.register(directiveContext);\n                }\n                directiveContext.scope = {\n                    ...directiveContext.scope,\n                    [key]: item,\n                    [index || 'index']: i,\n                };\n                desired.push(existing);\n            } else {\n                const itemNode = this.spawnItemNode(attribute.template!, owner, key, index, item, i);\n                desired.push(itemNode);\n                newOnes.push(itemNode);\n            }\n        }\n\n        // ── 3. Unmount + detach removed children ─────────────────────────────\n        for (const child of remaining) {\n            child.unmount();\n            owner.removeChild(child);\n        }\n\n        // ── 4. Mount only the new ones (kept children stay where they are). ─\n        for (const child of newOnes) {\n            child.transform();\n            child.compile();\n            child.mount();\n        }\n    }\n\n\n    // ─────────────────────────────────────────────────────────────────────────────\n    // ── Helpers ──────────────────────────────────────────────────────────────────\n    // ─────────────────────────────────────────────────────────────────────────────\n\n    /**\n     * Build a key-function that derives a stable identity from each item.\n     * If the user provided a `track <expr>` clause, evaluate it as a path on\n     * the item; otherwise fall back to the item identity (reference equality).\n     */\n    private makeKeyFn(key: string, index: string | undefined, trackExpr: string | undefined): (item: any, i: number) => any {\n        if (!trackExpr) {\n            return (item, i) => item ?? i;\n        }\n\n        // Strip any leading `key.` so users can write `track row.id`.\n        const path = trackExpr.startsWith(key + '.') ? trackExpr.slice(key.length + 1) : trackExpr;\n\n        return (item, i) => {\n            if (item == null) return i;\n            if (path === key || path === '$index') return path === '$index' ? i : item;\n\n            // dotted path lookup\n            const parts = path.split('.');\n            let v: any = item;\n            for (const p of parts) {\n                if (v == null) return i;\n                v = v[p];\n            }\n            return v ?? i;\n        };\n    }\n\n    /**\n     * Parses the $for expression string into its constituent parts.\n     *\n     * Supported formats:\n     *   item in items\n     *   item, index in items\n     *   (item, index) in items\n     *   item in filter(items)\n     *   item, index in filter(items, 'active')\n     *   item in items track item.id\n     *   (item, i) in items track item.id\n     */\n    private parseExpression(content: string): AreForExpression {\n        // Strip optional `track <expr>` suffix first.\n        let trackExpr: string | undefined;\n        const trackIdx = content.search(/\\s+track\\s+/);\n        let body = content;\n        if (trackIdx !== -1) {\n            const m = content.slice(trackIdx).match(/\\s+track\\s+(.+)$/);\n            if (m) {\n                trackExpr = m[1].trim();\n                body = content.slice(0, trackIdx).trim();\n            }\n        }\n\n        const inIndex = body.lastIndexOf(' in ');\n        const keyAndIndex = body.slice(0, inIndex).trim().replace(/^\\(|\\)$/g, '');\n        const arrayExpr = body.slice(inIndex + 4).trim();\n        const keyParts = keyAndIndex.split(',').map(p => p.trim());\n\n        return {\n            key: keyParts[0],\n            index: keyParts[1] || undefined,\n            arrayExpr,\n            trackExpr,\n        };\n    }\n\n    /**\n     * Resolves the array expression against the store.\n     * Supports both plain key lookups and function-call expressions:\n     *   items          → store.get('items')\n     *   filter(items)  → store.get('filter')(store.get('items'))\n     */\n    private resolveArray(store: AreStore, arrayExpr: string, fullContent: string): any[] {\n        let result: any;\n        const callMatch = arrayExpr.match(/^([^(]+)\\((.+)\\)$/);\n\n        if (callMatch) {\n            const fnName = callMatch[1].trim();\n            const fn = store.get(fnName as any);\n\n            if (typeof fn !== 'function')\n                throw new AreCompilerError({\n                    title: 'Invalid \"for\" Directive Function',\n                    description: `The expression \"${fnName}\" in the \"for\" directive does not resolve to a function in the store. Received: ${typeof fn}`,\n                });\n\n            const rawArgs = callMatch[2].split(',').map(a => a.trim());\n            const resolvedArgs = rawArgs.map(arg => {\n                if (arg.startsWith(\"'\") && arg.endsWith(\"'\")) return arg.slice(1, -1);\n                if (arg.startsWith('\"') && arg.endsWith('\"')) return arg.slice(1, -1);\n                if (!isNaN(Number(arg))) return Number(arg);\n                // Dotted-path / optional-chain: e.g. `record?.embedding` or `record.data`\n                const stripped = arg.replace(/\\?$/, '');\n                if (stripped.includes('.')) {\n                    const parts = stripped.split('.').map(p => p.replace(/\\?$/, ''));\n                    let val: any = store.get(parts[0] as any);\n                    for (let j = 1; j < parts.length; j++) {\n                        if (val == null) return undefined;\n                        val = val[parts[j]];\n                    }\n                    return val ?? undefined;\n                }\n                return store.get(stripped as any);\n            });\n\n            result = (fn as Function)(...resolvedArgs);\n        } else if (arrayExpr.includes('.')) {\n            // dotted-path lookup: e.g. \"list.items\" or \"record?.keywords\"\n            // Strip optional-chaining `?` suffix from each segment so that\n            // `record?.keywords` resolves the same as `record.keywords`.\n            const parts = arrayExpr.split('.').map(p => p.replace(/\\?$/, ''));\n            result = store.get(parts[0] as any);\n            for (let i = 1; i < parts.length; i++) {\n                if (result == null) break;\n                result = result[parts[i]];\n            }\n        } else {\n            result = store.get(arrayExpr.replace(/\\?$/, '') as any);\n        }\n\n        // null / undefined from optional-chaining expressions (e.g. `record?.keywords`)\n        // means the source object is not yet loaded — treat as empty array so the\n        // directive initialises gracefully and fills in when the store updates.\n        if (result == null) return [];\n\n        if (!Array.isArray(result))\n            throw new AreCompilerError({\n                title: 'Invalid \"for\" Directive Value',\n                description: `The \"for\" directive expects an array but got ${typeof result}. Expression: \"${fullContent}\". Received: ${JSON.stringify(result)}`,\n            });\n\n        return result;\n    }\n\n    /**\n     * Creates a single item node from the template, registers it as a child of\n     * the owner, initialises it, injects item-scoped store values, and activates\n     * its scene so the mount/compile cycle will include it.\n     *\n     * NOTE: This method does NOT call compile() or mount() — the caller is\n     * responsible for doing so when the main lifecycle cycle won't cover it\n     * (i.e. during update, but not during the initial compile phase).\n     */\n    private spawnItemNode(\n        template: AreHTMLNode,\n        owner: AreHTMLNode,\n        key: string,\n        index: string | undefined,\n        item: any,\n        i: number,\n    ): AreHTMLNode {\n        const itemNode = template.clone() as AreHTMLNode;\n\n        owner.addChild(itemNode);\n\n        const queue = [itemNode];\n\n        while (queue.length > 0) {\n            const current = queue.shift()!\n\n            current.init();\n\n            queue.push(...current.children as AreHTMLNode[]);\n        }\n\n        /**\n         * Resolve or create a directive context for the item node. This is needed to hold the item-specific store values (e.g. the \"item\" and \"index\" in a \"for\" loop) that the template's bindings will reference during compile and update. The context is shared among all clones of the same template, but that's fine because each clone gets its own scope values assigned here.\n         */\n        let directiveContext = itemNode.scope.resolveFlat(AreDirectiveContext);\n\n        if (!directiveContext) {\n            directiveContext = new AreDirectiveContext(itemNode.aseid);\n            itemNode.scope.register(directiveContext);\n        }\n\n        directiveContext.scope = {\n            ...directiveContext.scope,\n            [key]: item,\n            [index || 'index']: i,\n        }\n\n        itemNode.scene.activate();\n\n        return itemNode;\n    }\n}"]}
+{"version":3,"sources":["../../../src/directives/AreDirectiveFor.directive.ts"],"names":["AreDirectiveFor","AreDirective","AddCommentInstruction","AreDirectiveContext","AreSchedulerHelper","AreCompilerError","A_Caller","A_Scope","AreStore","AreScene","A_Logger","A_Frame"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAgCaA,uBAAA,GAAN,8BAA8BC,mCAAA,CAAa;AAAA,EA8B9C,UACwB,SAAA,EACD,KAAA,EACC,KAAA,EACA,KAAA,EACA,WACjB,IAAA,EACL;AAEE,IAAA,MAAA,CAAO,MAAM,CAAA,gCAAA,EAAmC,SAAA,CAAU,MAAM,KAAA,CAAM,QAAA,EAAU,CAAA,CAAA,CAAG,CAAA;AAEnF,IAAA,MAAM,OAAO,SAAA,CAAU,KAAA;AAQvB,IAAA,MAAM,WAAA,GAAc,KAAK,cAAA,EAAe;AAOxC,IAAA,MAAM,OAAA,GAAU,YAAY,UAAA,CAAW,IAAA,CAAK,OAAK,CAAA,CAAE,IAAA,KAAS,UAAU,IAAI,CAAA;AAE1E,IAAA,IAAI,OAAA,EAAS;AACT,MAAA,WAAA,CAAY,KAAA,CAAM,WAAW,OAAO,CAAA;AACpC,MAAA,IAAA,CAAK,KAAA,CAAM,SAAS,OAAO,CAAA;AAAA,IAC/B;AAMA,IAAA,IAAA,CAAK,IAAA,EAAK;AAKV,IAAA,SAAA,CAAU,QAAA,GAAW,WAAA;AAMrB,IAAA,MAAM,EAAE,KAAK,KAAA,EAAO,SAAA,KAAc,IAAA,CAAK,eAAA,CAAgB,UAAU,OAAO,CAAA;AACxE,IAAA,MAAM,QAAQ,IAAA,CAAK,YAAA,CAAa,KAAA,EAAO,SAAA,EAAW,UAAU,OAAO,CAAA;AAEnE,IAAA,SAAA,CAAU,KAAA,GAAQ,KAAA;AAUlB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACnC,MAAA,IAAA,CAAK,aAAA,CAAc,SAAA,CAAU,QAAA,EAAW,SAAA,CAAU,KAAA,EAAO,KAAK,KAAA,EAAO,KAAA,CAAM,CAAC,CAAA,EAAG,CAAC,CAAA;AAAA,IACpF;AAAA,EACJ;AAAA,EAIA,OAAA,CACwB,SAAA,EACA,KAAA,EACA,KAAA,EAAA,GACjB,IAAA,EACC;AAMJ,IAAA,MAAM,kBAAkB,KAAA,CAAM,IAAA;AAC9B,IAAA,MAAM,iBAAA,GAAoB,CAAA,UAAA,EAAa,SAAA,CAAU,QAAA,CAAU,EAAE,CAAA,KAAA,CAAA;AAC7D,IAAA,MAAM,cAAc,IAAIC,4CAAA,CAAsB,EAAE,OAAA,EAAS,mBAAmB,CAAA;AAE5E,IAAA,KAAA,CAAM,QAAQ,WAAW,CAAA;AACzB,IAAA,KAAA,CAAM,UAAA,CAAW,aAAa,eAAe,CAAA;AAC7C,IAAA,KAAA,CAAM,OAAO,eAAe,CAAA;AAAA,EAChC;AAAA,EAIA,MAAA,CACwB,SAAA,EACA,KAAA,EACA,KAAA,EAAA,GACjB,IAAA,EACiB;AASpB,IAAA,IAAI,KAAA,GAAQF,uBAAA,CAAgB,WAAA,CAAY,GAAA,CAAI,SAAS,CAAA;AACrD,IAAA,IAAI,CAAC,KAAA,EAAO;AACR,MAAA,KAAA,GAAQ,EAAE,OAAA,EAAS,KAAA,EAAO,OAAA,EAAS,KAAA,EAAM;AACzC,MAAAA,uBAAA,CAAgB,WAAA,CAAY,GAAA,CAAI,SAAA,EAAW,KAAK,CAAA;AAAA,IACpD;AACA,IAAA,IAAI,MAAM,OAAA,EAAS;AACf,MAAA,KAAA,CAAM,OAAA,GAAU,IAAA;AAChB,MAAA;AAAA,IACJ;AAEA,IAAA,OAAO,IAAA,CAAK,aAAA,CAAc,SAAA,EAAW,KAAA,EAAO,OAAO,KAAK,CAAA;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,aAAA,CACJ,SAAA,EACA,KAAA,EACA,KAAA,EACA,KAAA,EACoB;AAIpB,IAAA,MAAM,EAAE,KAAK,KAAA,EAAO,SAAA,EAAW,WAAU,GAAI,IAAA,CAAK,eAAA,CAAgB,SAAA,CAAU,OAAO,CAAA;AACnF,IAAA,MAAM,WAAW,IAAA,CAAK,YAAA,CAAa,KAAA,EAAO,SAAA,EAAW,UAAU,OAAO,CAAA;AAEtE,IAAA,MAAM,QAAQ,SAAA,CAAU,KAAA;AACxB,IAAA,MAAM,eAAA,GAAkB,CAAC,GAAG,KAAA,CAAM,QAAQ,CAAA;AAE1C,IAAA,SAAA,CAAU,KAAA,GAAQ,QAAA;AAmBlB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,UAAA,CAAW,KAAK,CAAA;AAEtC,IAAA,MAAM,UAAA,GAAa,IAAA,CAAK,SAAA,CAAU,GAAA,EAAK,OAAO,SAAS,CAAA;AAGvD,IAAA,MAAM,UAAA,uBAAiB,GAAA,EAAsB;AAC7C,IAAA,MAAM,SAAA,uBAAgB,GAAA,EAAiB;AAEvC,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,eAAA,CAAgB,QAAQ,CAAA,EAAA,EAAK;AAC7C,MAAA,MAAM,KAAA,GAAQ,gBAAgB,CAAC,CAAA;AAC/B,MAAA,MAAM,GAAA,GAAM,KAAA,CAAM,KAAA,CAAM,WAAA,CAAYG,wCAAmB,CAAA;AACvD,MAAA,MAAM,CAAA,GAAI,GAAA,GAAM,UAAA,CAAW,GAAA,CAAI,MAAM,GAAG,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,KAAA,IAAS,OAAO,CAAC,CAAA,0BAAW,QAAQ,CAAA;AACzF,MAAA,UAAA,CAAW,GAAA,CAAI,GAAG,KAAK,CAAA;AACvB,MAAA,SAAA,CAAU,IAAI,KAAK,CAAA;AAAA,IACvB;AAQA,IAAA,MAAM,WAA8C,EAAC;AAErD,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AACtC,MAAA,MAAM,IAAA,GAAO,SAAS,CAAC,CAAA;AACvB,MAAA,MAAM,CAAA,GAAI,UAAA,CAAW,IAAA,EAAM,CAAC,CAAA;AAC5B,MAAA,MAAM,QAAA,GAAW,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA;AAEjC,MAAA,IAAI,QAAA,EAAU;AACV,QAAA,SAAA,CAAU,OAAO,QAAQ,CAAA;AAEzB,QAAA,IAAI,gBAAA,GAAmB,QAAA,CAAS,KAAA,CAAM,WAAA,CAAYA,wCAAmB,CAAA;AACrE,QAAA,IAAI,CAAC,gBAAA,EAAkB;AACnB,UAAA,gBAAA,GAAmB,IAAIA,wCAAA,CAAoB,QAAA,CAAS,KAAK,CAAA;AACzD,UAAA,QAAA,CAAS,KAAA,CAAM,SAAS,gBAAgB,CAAA;AAAA,QAC5C;AACA,QAAA,gBAAA,CAAiB,KAAA,GAAQ;AAAA,UACrB,GAAG,gBAAA,CAAiB,KAAA;AAAA,UACpB,CAAC,GAAG,GAAG,IAAA;AAAA,UACP,CAAC,KAAA,IAAS,OAAO,GAAG;AAAA,SACxB;AAAA,MACJ,CAAA,MAAO;AACH,QAAA,QAAA,CAAS,IAAA,CAAK,EAAE,IAAA,EAAM,GAAA,EAAK,GAAG,CAAA;AAAA,MAClC;AAAA,IACJ;AAGA,IAAA,KAAA,MAAW,SAAS,SAAA,EAAW;AAI3B,MAAA,IAAI,QAAA,QAAgB,OAAA,EAAQ;AAC5B,MAAA,KAAA,CAAM,YAAY,KAAK,CAAA;AAAA,IAC3B;AAOA,IAAA,MAAM,UAAA,GAAa,CAAC,IAAA,KAAqC;AACrD,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,aAAA,CAAc,SAAA,CAAU,QAAA,EAAW,KAAA,EAAO,GAAA,EAAK,KAAA,EAAO,IAAA,CAAK,IAAA,EAAM,IAAA,CAAK,GAAG,CAAA;AAC5F,MAAA,KAAA,CAAM,SAAA,EAAU;AAChB,MAAA,KAAA,CAAM,OAAA,EAAQ;AAKd,MAAA,IAAI,QAAA,QAAgB,KAAA,EAAM;AAAA,IAC9B,CAAA;AAGA,IAAA,IAAI,QAAA,CAAS,MAAA,IAAUH,uBAAA,CAAgB,cAAA,EAAgB;AACnD,MAAA,KAAA,MAAW,IAAA,IAAQ,QAAA,EAAU,UAAA,CAAW,IAAI,CAAA;AAC5C,MAAA,OAAO,IAAA,CAAK,YAAA,CAAa,SAAA,EAAW,KAAA,EAAO,OAAO,KAAK,CAAA;AAAA,IAC3D;AAOA,IAAA,KAAA,CAAM,OAAA,GAAU,IAAA;AAChB,IAAA,IAAI,MAAA,GAAS,CAAA;AAEb,IAAA,MAAM,eAAe,MAA4B;AAC7C,MAAA,IAAI;AACA,QAAA,MAAM,KAAA,GAAQI,uCAAmB,GAAA,EAAI;AACrC,QAAA,OAAO,MAAA,GAAS,SAAS,MAAA,EAAQ;AAC7B,UAAA,UAAA,CAAW,QAAA,CAAS,MAAM,CAAC,CAAA;AAC3B,UAAA,MAAA,EAAA;AACA,UAAA,IAAIA,sCAAA,CAAmB,GAAA,EAAI,GAAI,KAAA,IAASJ,wBAAgB,eAAA,EAAiB;AAAA,QAC7E;AAAA,MACJ,SAAS,KAAA,EAAO;AAGZ,QAAA,KAAA,CAAM,OAAA,GAAU,KAAA;AAChB,QAAA,KAAA,CAAM,OAAA,GAAU,KAAA;AAChB,QAAA,MAAM,KAAA;AAAA,MACV;AAEA,MAAA,IAAI,MAAA,GAAS,SAAS,MAAA,EAAQ;AAC1B,QAAA,OAAO,IAAI,QAAc,CAAA,OAAA,KAAW;AAChC,UAAAI,sCAAA,CAAmB,iBAAA,CAAkB,MAAM,OAAA,CAAQ,YAAA,EAAc,CAAC,CAAA;AAAA,QACtE,CAAC,CAAA;AAAA,MACL;AAEA,MAAA,OAAO,IAAA,CAAK,YAAA,CAAa,SAAA,EAAW,KAAA,EAAO,OAAO,KAAK,CAAA;AAAA,IAC3D,CAAA;AAEA,IAAA,OAAO,YAAA,EAAa;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOQ,YAAA,CACJ,SAAA,EACA,KAAA,EACA,KAAA,EACA,KAAA,EACoB;AACpB,IAAA,KAAA,CAAM,OAAA,GAAU,KAAA;AAChB,IAAA,IAAI,MAAM,OAAA,EAAS;AACf,MAAA,KAAA,CAAM,OAAA,GAAU,KAAA;AAChB,MAAA,OAAO,IAAA,CAAK,aAAA,CAAc,SAAA,EAAW,KAAA,EAAO,OAAO,KAAK,CAAA;AAAA,IAC5D;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASQ,WAAW,IAAA,EAA4B;AAC3C,IAAA,IAAI,OAAA,GAAmC,IAAA;AACvC,IAAA,OAAO,OAAA,EAAS;AACZ,MAAA,IAAI,OAAA,CAAQ,KAAA,EAAO,UAAA,EAAY,OAAO,KAAA;AACtC,MAAA,OAAA,GAAU,OAAA,CAAQ,MAAA;AAAA,IACtB;AACA,IAAA,OAAO,IAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYQ,SAAA,CAAU,GAAA,EAAa,KAAA,EAA2B,SAAA,EAA8D;AACpH,IAAA,IAAI,CAAC,SAAA,EAAW;AACZ,MAAA,OAAO,CAAC,IAAA,EAAM,CAAA,KAAM,IAAA,IAAQ,CAAA;AAAA,IAChC;AAGA,IAAA,MAAM,IAAA,GAAO,SAAA,CAAU,UAAA,CAAW,GAAA,GAAM,GAAG,CAAA,GAAI,SAAA,CAAU,KAAA,CAAM,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,GAAI,SAAA;AAEjF,IAAA,OAAO,CAAC,MAAM,CAAA,KAAM;AAChB,MAAA,IAAI,IAAA,IAAQ,MAAM,OAAO,CAAA;AACzB,MAAA,IAAI,SAAS,GAAA,IAAO,IAAA,KAAS,UAAU,OAAO,IAAA,KAAS,WAAW,CAAA,GAAI,IAAA;AAGtE,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,MAAA,IAAI,CAAA,GAAS,IAAA;AACb,MAAA,KAAA,MAAW,KAAK,KAAA,EAAO;AACnB,QAAA,IAAI,CAAA,IAAK,MAAM,OAAO,CAAA;AACtB,QAAA,CAAA,GAAI,EAAE,CAAC,CAAA;AAAA,MACX;AACA,MAAA,OAAO,CAAA,IAAK,CAAA;AAAA,IAChB,CAAA;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcQ,gBAAgB,OAAA,EAAmC;AAEvD,IAAA,IAAI,SAAA;AACJ,IAAA,MAAM,QAAA,GAAW,OAAA,CAAQ,MAAA,CAAO,aAAa,CAAA;AAC7C,IAAA,IAAI,IAAA,GAAO,OAAA;AACX,IAAA,IAAI,aAAa,EAAA,EAAI;AACjB,MAAA,MAAM,IAAI,OAAA,CAAQ,KAAA,CAAM,QAAQ,CAAA,CAAE,MAAM,kBAAkB,CAAA;AAC1D,MAAA,IAAI,CAAA,EAAG;AACH,QAAA,SAAA,GAAY,CAAA,CAAE,CAAC,CAAA,CAAE,IAAA,EAAK;AACtB,QAAA,IAAA,GAAO,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,QAAQ,EAAE,IAAA,EAAK;AAAA,MAC3C;AAAA,IACJ;AAEA,IAAA,MAAM,OAAA,GAAU,IAAA,CAAK,WAAA,CAAY,MAAM,CAAA;AACvC,IAAA,MAAM,WAAA,GAAc,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,OAAO,EAAE,IAAA,EAAK,CAAE,OAAA,CAAQ,UAAA,EAAY,EAAE,CAAA;AACxE,IAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAM,OAAA,GAAU,CAAC,EAAE,IAAA,EAAK;AAC/C,IAAA,MAAM,QAAA,GAAW,YAAY,KAAA,CAAM,GAAG,EAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,IAAA,EAAM,CAAA;AAEzD,IAAA,OAAO;AAAA,MACH,GAAA,EAAK,SAAS,CAAC,CAAA;AAAA,MACf,KAAA,EAAO,QAAA,CAAS,CAAC,CAAA,IAAK,MAAA;AAAA,MACtB,SAAA;AAAA,MACA;AAAA,KACJ;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,YAAA,CAAa,KAAA,EAAiB,SAAA,EAAmB,WAAA,EAA4B;AACjF,IAAA,IAAI,MAAA;AACJ,IAAA,MAAM,SAAA,GAAY,SAAA,CAAU,KAAA,CAAM,mBAAmB,CAAA;AAErD,IAAA,IAAI,SAAA,EAAW;AACX,MAAA,MAAM,MAAA,GAAS,SAAA,CAAU,CAAC,CAAA,CAAE,IAAA,EAAK;AACjC,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,GAAA,CAAI,MAAa,CAAA;AAElC,MAAA,IAAI,OAAO,EAAA,KAAO,UAAA;AACd,QAAA,MAAM,IAAIC,oBAAA,CAAiB;AAAA,UACvB,KAAA,EAAO,kCAAA;AAAA,UACP,WAAA,EAAa,CAAA,gBAAA,EAAmB,MAAM,CAAA,gFAAA,EAAmF,OAAO,EAAE,CAAA;AAAA,SACrI,CAAA;AAEL,MAAA,MAAM,OAAA,GAAU,SAAA,CAAU,CAAC,CAAA,CAAE,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,IAAA,EAAM,CAAA;AACzD,MAAA,MAAM,YAAA,GAAe,OAAA,CAAQ,GAAA,CAAI,CAAA,GAAA,KAAO;AACpC,QAAA,IAAI,GAAA,CAAI,UAAA,CAAW,GAAG,CAAA,IAAK,GAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACpE,QAAA,IAAI,GAAA,CAAI,UAAA,CAAW,GAAG,CAAA,IAAK,GAAA,CAAI,QAAA,CAAS,GAAG,CAAA,EAAG,OAAO,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,EAAE,CAAA;AACpE,QAAA,IAAI,CAAC,MAAM,MAAA,CAAO,GAAG,CAAC,CAAA,EAAG,OAAO,OAAO,GAAG,CAAA;AAE1C,QAAA,MAAM,QAAA,GAAW,GAAA,CAAI,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAA;AACtC,QAAA,IAAI,QAAA,CAAS,QAAA,CAAS,GAAG,CAAA,EAAG;AACxB,UAAA,MAAM,KAAA,GAAQ,QAAA,CAAS,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAC,CAAA;AAC/D,UAAA,IAAI,GAAA,GAAW,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAQ,CAAA;AACxC,UAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACnC,YAAA,IAAI,GAAA,IAAO,MAAM,OAAO,MAAA;AACxB,YAAA,GAAA,GAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,UACtB;AACA,UAAA,OAAO,GAAA,IAAO,MAAA;AAAA,QAClB;AACA,QAAA,OAAO,KAAA,CAAM,IAAI,QAAe,CAAA;AAAA,MACpC,CAAC,CAAA;AAED,MAAA,MAAA,GAAU,EAAA,CAAgB,GAAG,YAAY,CAAA;AAAA,IAC7C,CAAA,MAAA,IAAW,SAAA,CAAU,QAAA,CAAS,GAAG,CAAA,EAAG;AAIhC,MAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,GAAG,CAAA,CAAE,GAAA,CAAI,CAAA,CAAA,KAAK,CAAA,CAAE,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAC,CAAA;AAChE,MAAA,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAQ,CAAA;AAClC,MAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACnC,QAAA,IAAI,UAAU,IAAA,EAAM;AACpB,QAAA,MAAA,GAAS,MAAA,CAAO,KAAA,CAAM,CAAC,CAAC,CAAA;AAAA,MAC5B;AAAA,IACJ,CAAA,MAAO;AACH,MAAA,MAAA,GAAS,MAAM,GAAA,CAAI,SAAA,CAAU,OAAA,CAAQ,KAAA,EAAO,EAAE,CAAQ,CAAA;AAAA,IAC1D;AAKA,IAAA,IAAI,MAAA,IAAU,IAAA,EAAM,OAAO,EAAC;AAE5B,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,CAAQ,MAAM,CAAA;AACrB,MAAA,MAAM,IAAIA,oBAAA,CAAiB;AAAA,QACvB,KAAA,EAAO,+BAAA;AAAA,QACP,WAAA,EAAa,CAAA,6CAAA,EAAgD,OAAO,MAAM,CAAA,eAAA,EAAkB,WAAW,CAAA,aAAA,EAAgB,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,CAAA;AAAA,OAChJ,CAAA;AAEL,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWQ,cACJ,QAAA,EACA,KAAA,EACA,GAAA,EACA,KAAA,EACA,MACA,CAAA,EACW;AACX,IAAA,MAAM,QAAA,GAAW,SAAS,KAAA,EAAM;AAEhC,IAAA,KAAA,CAAM,SAAS,QAAQ,CAAA;AAEvB,IAAA,MAAM,KAAA,GAAQ,CAAC,QAAQ,CAAA;AAEvB,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACrB,MAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAE5B,MAAA,OAAA,CAAQ,IAAA,EAAK;AAEb,MAAA,KAAA,CAAM,IAAA,CAAK,GAAG,OAAA,CAAQ,QAAyB,CAAA;AAAA,IACnD;AAKA,IAAA,IAAI,gBAAA,GAAmB,QAAA,CAAS,KAAA,CAAM,WAAA,CAAYF,wCAAmB,CAAA;AAErE,IAAA,IAAI,CAAC,gBAAA,EAAkB;AACnB,MAAA,gBAAA,GAAmB,IAAIA,wCAAA,CAAoB,QAAA,CAAS,KAAK,CAAA;AACzD,MAAA,QAAA,CAAS,KAAA,CAAM,SAAS,gBAAgB,CAAA;AAAA,IAC5C;AAEA,IAAA,gBAAA,CAAiB,KAAA,GAAQ;AAAA,MACrB,GAAG,gBAAA,CAAiB,KAAA;AAAA,MACpB,CAAC,GAAG,GAAG,IAAA;AAAA,MACP,CAAC,KAAA,IAAS,OAAO,GAAG;AAAA,KACxB;AAEA,IAAA,QAAA,CAAS,MAAM,QAAA,EAAS;AAExB,IAAA,OAAO,QAAA;AAAA,EACX;AACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA7gBaH,uBAAA,CAQe,cAAA,GAAiB,GAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AARhCA,uBAAA,CAee,eAAA,GAAkB,EAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAfjCA,uBAAA,CA0Be,WAAA,uBAAkB,OAAA,EAAmC;AAI7E,eAAA,CAAA;AAAA,EADCC,mCAAA,CAAa,SAAA;AAAA,EAET,qCAASK,iBAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,gBAAO,CAAA,CAAA;AAAA,EAChB,qCAASC,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,gBAAQ,CAAA;AAAA,CAAA,EAnCbV,uBAAA,CA8BT,SAAA,EAAA,WAAA,EAAA,CAAA,CAAA;AAoEA,eAAA,CAAA;AAAA,EADCC,mCAAA,CAAa,OAAA;AAAA,EAET,qCAASK,iBAAQ,CAAA,CAAA;AAAA,EACjB,qCAASE,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,YAAQ,CAAA;AAAA,CAAA,EArGbT,uBAAA,CAkGT,SAAA,EAAA,SAAA,EAAA,CAAA,CAAA;AAsBA,eAAA,CAAA;AAAA,EADCC,mCAAA,CAAa,MAAA;AAAA,EAET,qCAASK,iBAAQ,CAAA,CAAA;AAAA,EACjB,qCAASE,YAAQ,CAAA,CAAA;AAAA,EACjB,qCAASC,YAAQ,CAAA;AAAA,CAAA,EA3HbT,uBAAA,CAwHT,SAAA,EAAA,QAAA,EAAA,CAAA,CAAA;AAxHSA,uBAAA,GAAN,eAAA,CAAA;AAAA,EALNW,aAAQ,MAAA,CAAO;AAAA,IACZ,SAAA,EAAW,YAAA;AAAA,IACX,WAAA,EAAa;AAAA,GAChB,CAAA;AAAA,EACAV,mCAAA,CAAa,SAAS,CAAC;AAAA,CAAA,EACXD,uBAAA,CAAA","file":"AreDirectiveFor.directive.js","sourcesContent":["import { A_Caller, A_Inject, A_Scope } from \"@adaas/a-concept\";\nimport { A_Logger } from \"@adaas/a-utils/a-logger\";\nimport { AreDirectiveAttribute } from \"@adaas/are-html/attributes/AreDirective.attribute\";\nimport { AreCompilerError, AreScene, AreStore } from \"@adaas/are\";\nimport { AreDirective } from \"@adaas/are-html/directive/AreDirective.component\";\nimport { AddCommentInstruction } from \"@adaas/are-html/instructions/AddComment.instruction\";\nimport { AreHTMLNode } from \"@adaas/are-html/node\";\nimport { AreDirectiveContext } from \"@adaas/are-html/directive/AreDirective.context\";\nimport { A_Frame } from \"@adaas/a-frame/core\";\nimport { AreSchedulerHelper } from \"@adaas/are-html/helpers/AreScheduler.helper\";\n\n\ntype AreForExpression = {\n    key: string;\n    index: string | undefined;\n    arrayExpr: string;\n    /** Optional `track <expr>` clause, e.g. `track row.id` */\n    trackExpr: string | undefined;\n};\n\n/**\n * Per-`$for` reentrancy state used to serialize chunked (async) renders.\n * Keyed by the directive attribute instance (one per `$for` in the template).\n */\ntype AreForRenderState = { running: boolean; pending: boolean };\n\n\n@A_Frame.Define({\n    namespace: 'a-are-html',\n    description: 'Built-in $for directive. Iterates over an array expression resolved from the store and renders a cloned template fragment per item, managing per-item subscopes and comment-node anchors. Supports keyed diffing via an optional track clause to minimise DOM mutations on collection updates.'\n})\n@AreDirective.Priority(1)\nexport class AreDirectiveFor extends AreDirective {\n\n    /**\n     * Lists whose number of NEW item nodes is at or below this threshold render\n     * fully synchronously — byte-for-byte the previous behavior. Typical UIs\n     * (menus, small tables) are therefore completely unaffected; only genuinely\n     * large lists pay the (tiny) scheduling cost to keep the main thread responsive.\n     */\n    private static readonly SYNC_THRESHOLD = 100;\n\n    /**\n     * Per-chunk time budget (ms). During a large-list render we mount item nodes\n     * until this much time has elapsed, then yield to the browser so it can paint\n     * and process input before the next chunk. ~16ms targets one animation frame.\n     */\n    private static readonly CHUNK_BUDGET_MS = 16;\n\n    /**\n     * Per-attribute serialization state. A new update() that arrives while a\n     * chunked render of the SAME `$for` is still in flight does NOT start a second\n     * concurrent pass (which could interleave mutations on the shared children\n     * list); instead it marks `pending` and the in-flight run re-runs once more\n     * with the latest data when it finishes. This guarantees the children list is\n     * only ever mutated by one pass at a time and the final state always reflects\n     * the most recent store value.\n     */\n    private static readonly renderState = new WeakMap<object, AreForRenderState>();\n\n\n    @AreDirective.Transform\n    transform(\n        @A_Inject(A_Caller) attribute: AreDirectiveAttribute,\n        @A_Inject(A_Scope) scope: A_Scope,\n        @A_Inject(AreStore) store: AreStore,\n        @A_Inject(AreScene) scene: AreScene,\n        @A_Inject(A_Logger) logger: A_Logger,\n        ...args: any[]\n    ) {\n\n        logger.debug(`[Transform] directive $FOR for <${attribute.owner.aseid.toString()}>`)\n\n        const node = attribute.owner;\n\n        /**\n         * Transfer the original node's scope (with all registered attributes and children)\n         * to the template clone, and give the owner node a fresh empty scope.\n         * This mirrors the $if directive's approach, making the owner a lightweight\n         * group container whose sole visible presence is a comment placeholder.\n         */\n        const forTemplate = node.cloneWithScope();\n\n        /**\n         * Remove the $for attribute from the template so iterative clones do not\n         * re-trigger this directive during their own transform phase.\n         * Re-register it on the owner so the reactive compile/update pipeline keeps working.\n         */\n        const forAttr = forTemplate.attributes.find(d => d.name === attribute.name);\n\n        if (forAttr) {\n            forTemplate.scope.deregister(forAttr);\n            node.scope.register(forAttr);\n        }\n\n        /**\n         * Re-initialize the owner node with its fresh scope so it becomes a valid\n         * group container that will own the generated item nodes as children.\n         */\n        node.init();\n\n        /**\n         * Store the template for use in compile and update.\n         */\n        attribute.template = forTemplate;\n\n\n        /**\n         * Parse the $for expression and evaluate the source array.\n         */\n        const { key, index, arrayExpr } = this.parseExpression(attribute.content);\n        const array = this.resolveArray(store, arrayExpr, attribute.content);\n\n        attribute.value = array;\n\n        /**\n         * For each item in the array, spawn a clone of the template with the\n         * item's store values pre-set and its scene activated.\n         *\n         * The children are added to the owner node before the main compiler's\n         * children iteration loop runs, so the main cycle will compile them —\n         * no explicit child.compile() call is needed here.\n         */\n        for (let i = 0; i < array.length; i++) {\n            this.spawnItemNode(attribute.template!, attribute.owner, key, index, array[i], i);\n        }\n    }\n\n\n    @AreDirective.Compile\n    compile(\n        @A_Inject(A_Caller) attribute: AreDirectiveAttribute,\n        @A_Inject(AreStore) store: AreStore,\n        @A_Inject(AreScene) scene: AreScene,\n        ...args: any[]\n    ): void {\n        /**\n         * Replace the group node's default host declaration with a comment placeholder\n         * so the owner element itself does not render as a DOM element — the item nodes\n         * render as its children instead.\n         */\n        const hostInstruction = scene.host!;\n        const commentIdentifier = ` --- for: ${attribute.template!.id} --- `;\n        const declaration = new AddCommentInstruction({ content: commentIdentifier });\n\n        scene.setHost(declaration);\n        scene.planBefore(declaration, hostInstruction);\n        scene.unPlan(hostInstruction);\n    }\n\n\n    @AreDirective.Update\n    update(\n        @A_Inject(A_Caller) attribute: AreDirectiveAttribute,\n        @A_Inject(AreStore) store: AreStore,\n        @A_Inject(AreScene) scene: AreScene,\n        ...args: any[]\n    ): void | Promise<void> {\n        /**\n         * Serialize chunked renders per `$for`. If a previous large-list render\n         * is still streaming item nodes across macrotasks, do NOT start a second\n         * concurrent pass — that would interleave two diffs over the same shared\n         * children list (and leave half-compiled item nodes that the next diff\n         * would wrongly \"reuse\"). Mark a pass as pending instead; the in-flight\n         * run re-diffs once more from the latest store value when it completes.\n         */\n        let state = AreDirectiveFor.renderState.get(attribute);\n        if (!state) {\n            state = { running: false, pending: false };\n            AreDirectiveFor.renderState.set(attribute, state);\n        }\n        if (state.running) {\n            state.pending = true;\n            return;\n        }\n\n        return this.performUpdate(attribute, store, scene, state);\n    }\n\n    /**\n     * Core of the `$for` update: re-diff the source array against the current\n     * children, reconcile reused/removed items, then mount the new ones (small\n     * lists synchronously, large lists time-sliced). Never called while another\n     * pass for the same `$for` is in flight (see `update`).\n     */\n    private performUpdate(\n        attribute: AreDirectiveAttribute,\n        store: AreStore,\n        scene: AreScene,\n        state: AreForRenderState,\n    ): void | Promise<void> {\n        /**\n         * Re-evaluate the source array.\n         */\n        const { key, index, arrayExpr, trackExpr } = this.parseExpression(attribute.content);\n        const newArray = this.resolveArray(store, arrayExpr, attribute.content);\n\n        const owner = attribute.owner;\n        const currentChildren = [...owner.children] as AreHTMLNode[];\n\n        attribute.value = newArray;\n\n        /**\n         * Is this `$for`'s subtree currently rendered into the DOM?\n         *\n         * A `$for` can update while its subtree is detached — e.g. it lives\n         * inside a `$if` whose condition is currently false (the documented\n         * `<div $if><x $for></div>` nesting). The directive still receives the\n         * store change and re-diffs, but it must NOT mount/unmount item nodes\n         * directly while detached: the `$for` anchor (and its ancestors) are\n         * not in the DOM, so the interpreter's mount-point walk would fall\n         * through to the nearest *mounted* ancestor (the `$if` comment in the\n         * grandparent) and HOIST the items out of their intended container.\n         * When the ancestor `$if` later activates, its mount cascade applies\n         * the already-compiled item instructions in the correct place.\n         *\n         * Detached === any ancestor scene is inactive (regular nodes default\n         * to an active scene; only structural directives deactivate one).\n         */\n        const attached = this.isAttached(owner);\n\n        const computeKey = this.makeKeyFn(key, index, trackExpr);\n\n        // ── 1. Index existing children by stable key ────────────────────────\n        const childByKey = new Map<any, AreHTMLNode>();\n        const remaining = new Set<AreHTMLNode>();\n\n        for (let i = 0; i < currentChildren.length; i++) {\n            const child = currentChildren[i];\n            const ctx = child.scope.resolveFlat(AreDirectiveContext);\n            const k = ctx ? computeKey(ctx.scope[key], ctx.scope[index || 'index']) : Symbol('orphan');\n            childByKey.set(k, child);\n            remaining.add(child);\n        }\n\n        // ── 2. Walk desired list; reuse existing or record items to create ──\n        // NOTE: new item nodes are NOT spawned here. Spawning (cloneWithScope +\n        // subtree init + scene activation) is the dominant cost of a large\n        // render, so it is deferred into the time-sliced loop below alongside\n        // transform/compile/mount. Existing (keyed) children are reconciled in\n        // place synchronously — that is cheap and keeps reused rows stable.\n        const toCreate: Array<{ item: any; idx: number }> = [];\n\n        for (let i = 0; i < newArray.length; i++) {\n            const item = newArray[i];\n            const k = computeKey(item, i);\n            const existing = childByKey.get(k);\n\n            if (existing) {\n                remaining.delete(existing);\n\n                let directiveContext = existing.scope.resolveFlat(AreDirectiveContext);\n                if (!directiveContext) {\n                    directiveContext = new AreDirectiveContext(existing.aseid);\n                    existing.scope.register(directiveContext);\n                }\n                directiveContext.scope = {\n                    ...directiveContext.scope,\n                    [key]: item,\n                    [index || 'index']: i,\n                };\n            } else {\n                toCreate.push({ item, idx: i });\n            }\n        }\n\n        // ── 3. Unmount + detach removed children ─────────────────────────────\n        for (const child of remaining) {\n            // Only revert DOM if the subtree is live; a detached subtree's item\n            // nodes were never mounted (see `attached` rationale above), so\n            // unmounting them is a no-op at best and risks reverting stale state.\n            if (attached) child.unmount();\n            owner.removeChild(child);\n        }\n\n        // ── 4. Create + mount the new item nodes. ───────────────────────────\n        // `spawnItemNode` appends to `owner.children` immediately, so iterating\n        // `toCreate` in source order preserves list order (reused children keep\n        // their positions, new rows are appended in order) — identical to the\n        // previous synchronous behavior.\n        const createItem = (desc: { item: any; idx: number }) => {\n            const child = this.spawnItemNode(attribute.template!, owner, key, index, desc.item, desc.idx);\n            child.transform();\n            child.compile();\n            // While detached, stop after compile: the item's instructions are\n            // planned and the ancestor `$if`'s mount cascade will apply them in\n            // the correct container once the condition becomes truthy. Mounting\n            // here would hoist the item to the nearest mounted ancestor.\n            if (attached) child.mount();\n        };\n\n        // Small lists → fully synchronous, identical to the previous behavior.\n        if (toCreate.length <= AreDirectiveFor.SYNC_THRESHOLD) {\n            for (const desc of toCreate) createItem(desc);\n            return this.finishUpdate(attribute, store, scene, state);\n        }\n\n        // Large lists → time-sliced render. Create item nodes until the frame\n        // budget elapses, then yield to the browser (zero-delay macrotask) so\n        // it can paint and stay responsive instead of blocking for the whole\n        // batch. The `state.running` flag (see `update`) prevents any other\n        // update() for this `$for` from interleaving while we stream.\n        state.running = true;\n        let cursor = 0;\n\n        const processChunk = (): void | Promise<void> => {\n            try {\n                const start = AreSchedulerHelper.now();\n                while (cursor < toCreate.length) {\n                    createItem(toCreate[cursor]);\n                    cursor++;\n                    if (AreSchedulerHelper.now() - start >= AreDirectiveFor.CHUNK_BUDGET_MS) break;\n                }\n            } catch (error) {\n                // Never leave the `$for` wedged in the running state on failure,\n                // or every future update would be silently deferred forever.\n                state.running = false;\n                state.pending = false;\n                throw error;\n            }\n\n            if (cursor < toCreate.length) {\n                return new Promise<void>(resolve => {\n                    AreSchedulerHelper.scheduleMacrotask(() => resolve(processChunk()));\n                });\n            }\n\n            return this.finishUpdate(attribute, store, scene, state);\n        };\n\n        return processChunk();\n    }\n\n    /**\n     * Completes an update pass. If another update() arrived while a chunked\n     * render was streaming, run exactly one more pass now from the latest store\n     * value so the final DOM always reflects the most recent data.\n     */\n    private finishUpdate(\n        attribute: AreDirectiveAttribute,\n        store: AreStore,\n        scene: AreScene,\n        state: AreForRenderState,\n    ): void | Promise<void> {\n        state.running = false;\n        if (state.pending) {\n            state.pending = false;\n            return this.performUpdate(attribute, store, scene, state);\n        }\n    }\n\n\n    /**\n     * Walks the node's ancestor chain (inclusive) and reports whether the\n     * whole path is currently active — i.e. the subtree is actually rendered\n     * into the DOM. A single inactive ancestor scene (e.g. a `$if` whose\n     * condition is false) means the subtree is detached.\n     */\n    private isAttached(node: AreHTMLNode): boolean {\n        let current: AreHTMLNode | undefined = node;\n        while (current) {\n            if (current.scene?.isInactive) return false;\n            current = current.parent as AreHTMLNode | undefined;\n        }\n        return true;\n    }\n\n\n    // ─────────────────────────────────────────────────────────────────────────────\n    // ── Helpers ──────────────────────────────────────────────────────────────────\n    // ─────────────────────────────────────────────────────────────────────────────\n\n    /**\n     * Build a key-function that derives a stable identity from each item.\n     * If the user provided a `track <expr>` clause, evaluate it as a path on\n     * the item; otherwise fall back to the item identity (reference equality).\n     */\n    private makeKeyFn(key: string, index: string | undefined, trackExpr: string | undefined): (item: any, i: number) => any {\n        if (!trackExpr) {\n            return (item, i) => item ?? i;\n        }\n\n        // Strip any leading `key.` so users can write `track row.id`.\n        const path = trackExpr.startsWith(key + '.') ? trackExpr.slice(key.length + 1) : trackExpr;\n\n        return (item, i) => {\n            if (item == null) return i;\n            if (path === key || path === '$index') return path === '$index' ? i : item;\n\n            // dotted path lookup\n            const parts = path.split('.');\n            let v: any = item;\n            for (const p of parts) {\n                if (v == null) return i;\n                v = v[p];\n            }\n            return v ?? i;\n        };\n    }\n\n    /**\n     * Parses the $for expression string into its constituent parts.\n     *\n     * Supported formats:\n     *   item in items\n     *   item, index in items\n     *   (item, index) in items\n     *   item in filter(items)\n     *   item, index in filter(items, 'active')\n     *   item in items track item.id\n     *   (item, i) in items track item.id\n     */\n    private parseExpression(content: string): AreForExpression {\n        // Strip optional `track <expr>` suffix first.\n        let trackExpr: string | undefined;\n        const trackIdx = content.search(/\\s+track\\s+/);\n        let body = content;\n        if (trackIdx !== -1) {\n            const m = content.slice(trackIdx).match(/\\s+track\\s+(.+)$/);\n            if (m) {\n                trackExpr = m[1].trim();\n                body = content.slice(0, trackIdx).trim();\n            }\n        }\n\n        const inIndex = body.lastIndexOf(' in ');\n        const keyAndIndex = body.slice(0, inIndex).trim().replace(/^\\(|\\)$/g, '');\n        const arrayExpr = body.slice(inIndex + 4).trim();\n        const keyParts = keyAndIndex.split(',').map(p => p.trim());\n\n        return {\n            key: keyParts[0],\n            index: keyParts[1] || undefined,\n            arrayExpr,\n            trackExpr,\n        };\n    }\n\n    /**\n     * Resolves the array expression against the store.\n     * Supports both plain key lookups and function-call expressions:\n     *   items          → store.get('items')\n     *   filter(items)  → store.get('filter')(store.get('items'))\n     */\n    private resolveArray(store: AreStore, arrayExpr: string, fullContent: string): any[] {\n        let result: any;\n        const callMatch = arrayExpr.match(/^([^(]+)\\((.+)\\)$/);\n\n        if (callMatch) {\n            const fnName = callMatch[1].trim();\n            const fn = store.get(fnName as any);\n\n            if (typeof fn !== 'function')\n                throw new AreCompilerError({\n                    title: 'Invalid \"for\" Directive Function',\n                    description: `The expression \"${fnName}\" in the \"for\" directive does not resolve to a function in the store. Received: ${typeof fn}`,\n                });\n\n            const rawArgs = callMatch[2].split(',').map(a => a.trim());\n            const resolvedArgs = rawArgs.map(arg => {\n                if (arg.startsWith(\"'\") && arg.endsWith(\"'\")) return arg.slice(1, -1);\n                if (arg.startsWith('\"') && arg.endsWith('\"')) return arg.slice(1, -1);\n                if (!isNaN(Number(arg))) return Number(arg);\n                // Dotted-path / optional-chain: e.g. `record?.embedding` or `record.data`\n                const stripped = arg.replace(/\\?$/, '');\n                if (stripped.includes('.')) {\n                    const parts = stripped.split('.').map(p => p.replace(/\\?$/, ''));\n                    let val: any = store.get(parts[0] as any);\n                    for (let j = 1; j < parts.length; j++) {\n                        if (val == null) return undefined;\n                        val = val[parts[j]];\n                    }\n                    return val ?? undefined;\n                }\n                return store.get(stripped as any);\n            });\n\n            result = (fn as Function)(...resolvedArgs);\n        } else if (arrayExpr.includes('.')) {\n            // dotted-path lookup: e.g. \"list.items\" or \"record?.keywords\"\n            // Strip optional-chaining `?` suffix from each segment so that\n            // `record?.keywords` resolves the same as `record.keywords`.\n            const parts = arrayExpr.split('.').map(p => p.replace(/\\?$/, ''));\n            result = store.get(parts[0] as any);\n            for (let i = 1; i < parts.length; i++) {\n                if (result == null) break;\n                result = result[parts[i]];\n            }\n        } else {\n            result = store.get(arrayExpr.replace(/\\?$/, '') as any);\n        }\n\n        // null / undefined from optional-chaining expressions (e.g. `record?.keywords`)\n        // means the source object is not yet loaded — treat as empty array so the\n        // directive initialises gracefully and fills in when the store updates.\n        if (result == null) return [];\n\n        if (!Array.isArray(result))\n            throw new AreCompilerError({\n                title: 'Invalid \"for\" Directive Value',\n                description: `The \"for\" directive expects an array but got ${typeof result}. Expression: \"${fullContent}\". Received: ${JSON.stringify(result)}`,\n            });\n\n        return result;\n    }\n\n    /**\n     * Creates a single item node from the template, registers it as a child of\n     * the owner, initialises it, injects item-scoped store values, and activates\n     * its scene so the mount/compile cycle will include it.\n     *\n     * NOTE: This method does NOT call compile() or mount() — the caller is\n     * responsible for doing so when the main lifecycle cycle won't cover it\n     * (i.e. during update, but not during the initial compile phase).\n     */\n    private spawnItemNode(\n        template: AreHTMLNode,\n        owner: AreHTMLNode,\n        key: string,\n        index: string | undefined,\n        item: any,\n        i: number,\n    ): AreHTMLNode {\n        const itemNode = template.clone() as AreHTMLNode;\n\n        owner.addChild(itemNode);\n\n        const queue = [itemNode];\n\n        while (queue.length > 0) {\n            const current = queue.shift()!\n\n            current.init();\n\n            queue.push(...current.children as AreHTMLNode[]);\n        }\n\n        /**\n         * Resolve or create a directive context for the item node. This is needed to hold the item-specific store values (e.g. the \"item\" and \"index\" in a \"for\" loop) that the template's bindings will reference during compile and update. The context is shared among all clones of the same template, but that's fine because each clone gets its own scope values assigned here.\n         */\n        let directiveContext = itemNode.scope.resolveFlat(AreDirectiveContext);\n\n        if (!directiveContext) {\n            directiveContext = new AreDirectiveContext(itemNode.aseid);\n            itemNode.scope.register(directiveContext);\n        }\n\n        directiveContext.scope = {\n            ...directiveContext.scope,\n            [key]: item,\n            [index || 'index']: i,\n        }\n\n        itemNode.scene.activate();\n\n        return itemNode;\n    }\n}"]}

package/dist/node/directives/AreDirectiveFor.directive.mjs

@@ -6,6 +6,7 @@ import { AreDirective } from '@adaas/are-html/directive/AreDirective.component';
 import { AddCommentInstruction } from '@adaas/are-html/instructions/AddComment.instruction';
 import { AreDirectiveContext } from '@adaas/are-html/directive/AreDirective.context';
 import { A_Frame } from '@adaas/a-frame/core';
+import { AreSchedulerHelper } from '@adaas/are-html/helpers/AreScheduler.helper';
 
 let AreDirectiveFor = class extends AreDirective {
   transform(attribute, scope, store, scene, logger, ...args) {
@@ -35,11 +36,30 @@ let AreDirectiveFor = class extends AreDirective {
     scene.unPlan(hostInstruction);
   }
   update(attribute, store, scene, ...args) {
+    let state = AreDirectiveFor.renderState.get(attribute);
+    if (!state) {
+      state = { running: false, pending: false };
+      AreDirectiveFor.renderState.set(attribute, state);
+    }
+    if (state.running) {
+      state.pending = true;
+      return;
+    }
+    return this.performUpdate(attribute, store, scene, state);
+  }
+  /**
+   * Core of the `$for` update: re-diff the source array against the current
+   * children, reconcile reused/removed items, then mount the new ones (small
+   * lists synchronously, large lists time-sliced). Never called while another
+   * pass for the same `$for` is in flight (see `update`).
+   */
+  performUpdate(attribute, store, scene, state) {
     const { key, index, arrayExpr, trackExpr } = this.parseExpression(attribute.content);
     const newArray = this.resolveArray(store, arrayExpr, attribute.content);
     const owner = attribute.owner;
     const currentChildren = [...owner.children];
     attribute.value = newArray;
+    const attached = this.isAttached(owner);
     const computeKey = this.makeKeyFn(key, index, trackExpr);
     const childByKey = /* @__PURE__ */ new Map();
     const remaining = /* @__PURE__ */ new Set();
@@ -50,7 +70,7 @@ let AreDirectiveFor = class extends AreDirective {
       childByKey.set(k, child);
       remaining.add(child);
     }
-    const newOnes = [];
+    const toCreate = [];
     for (let i = 0; i < newArray.length; i++) {
       const item = newArray[i];
       const k = computeKey(item, i);
@@ -68,19 +88,72 @@ let AreDirectiveFor = class extends AreDirective {
           [index || "index"]: i
         };
       } else {
-        const itemNode = this.spawnItemNode(attribute.template, owner, key, index, item, i);
-        newOnes.push(itemNode);
+        toCreate.push({ item, idx: i });
       }
     }
     for (const child of remaining) {
-      child.unmount();
+      if (attached) child.unmount();
       owner.removeChild(child);
     }
-    for (const child of newOnes) {
+    const createItem = (desc) => {
+      const child = this.spawnItemNode(attribute.template, owner, key, index, desc.item, desc.idx);
       child.transform();
       child.compile();
-      child.mount();
+      if (attached) child.mount();
+    };
+    if (toCreate.length <= AreDirectiveFor.SYNC_THRESHOLD) {
+      for (const desc of toCreate) createItem(desc);
+      return this.finishUpdate(attribute, store, scene, state);
+    }
+    state.running = true;
+    let cursor = 0;
+    const processChunk = () => {
+      try {
+        const start = AreSchedulerHelper.now();
+        while (cursor < toCreate.length) {
+          createItem(toCreate[cursor]);
+          cursor++;
+          if (AreSchedulerHelper.now() - start >= AreDirectiveFor.CHUNK_BUDGET_MS) break;
+        }
+      } catch (error) {
+        state.running = false;
+        state.pending = false;
+        throw error;
+      }
+      if (cursor < toCreate.length) {
+        return new Promise((resolve) => {
+          AreSchedulerHelper.scheduleMacrotask(() => resolve(processChunk()));
+        });
+      }
+      return this.finishUpdate(attribute, store, scene, state);
+    };
+    return processChunk();
+  }
+  /**
+   * Completes an update pass. If another update() arrived while a chunked
+   * render was streaming, run exactly one more pass now from the latest store
+   * value so the final DOM always reflects the most recent data.
+   */
+  finishUpdate(attribute, store, scene, state) {
+    state.running = false;
+    if (state.pending) {
+      state.pending = false;
+      return this.performUpdate(attribute, store, scene, state);
+    }
+  }
+  /**
+   * Walks the node's ancestor chain (inclusive) and reports whether the
+   * whole path is currently active — i.e. the subtree is actually rendered
+   * into the DOM. A single inactive ancestor scene (e.g. a `$if` whose
+   * condition is false) means the subtree is detached.
+   */
+  isAttached(node) {
+    let current = node;
+    while (current) {
+      if (current.scene?.isInactive) return false;
+      current = current.parent;
     }
+    return true;
   }
   // ─────────────────────────────────────────────────────────────────────────────
   // ── Helpers ──────────────────────────────────────────────────────────────────
@@ -226,6 +299,29 @@ let AreDirectiveFor = class extends AreDirective {
     return itemNode;
   }
 };
+/**
+ * Lists whose number of NEW item nodes is at or below this threshold render
+ * fully synchronously — byte-for-byte the previous behavior. Typical UIs
+ * (menus, small tables) are therefore completely unaffected; only genuinely
+ * large lists pay the (tiny) scheduling cost to keep the main thread responsive.
+ */
+AreDirectiveFor.SYNC_THRESHOLD = 100;
+/**
+ * Per-chunk time budget (ms). During a large-list render we mount item nodes
+ * until this much time has elapsed, then yield to the browser so it can paint
+ * and process input before the next chunk. ~16ms targets one animation frame.
+ */
+AreDirectiveFor.CHUNK_BUDGET_MS = 16;
+/**
+ * Per-attribute serialization state. A new update() that arrives while a
+ * chunked render of the SAME `$for` is still in flight does NOT start a second
+ * concurrent pass (which could interleave mutations on the shared children
+ * list); instead it marks `pending` and the in-flight run re-runs once more
+ * with the latest data when it finishes. This guarantees the children list is
+ * only ever mutated by one pass at a time and the final state always reflects
+ * the most recent store value.
+ */
+AreDirectiveFor.renderState = /* @__PURE__ */ new WeakMap();
 __decorateClass([
   AreDirective.Transform,
   __decorateParam(0, A_Inject(A_Caller)),