@adaas/are-html 0.0.20 → 0.0.22

package/dist/node/lib/AreRoot/AreRoot.component.mjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../src/lib/AreRoot/AreRoot.component.ts"],"names":[],"mappings":";;;;;;;;AAYO,IAAM,OAAA,GAAN,cAAsB,GAAA,CAAI;AAAA,EAG7B,MAAM,QAAA,CACkB,IAAA,EACA,MAAA,EACS,cAAA,EAC/B;AAEE,IAAA,MAAM,SAAS,IAAA,CAAK,EAAA;AAIpB,IAAA,IAAI,cAAA,IAAkB,CAAC,cAAA,CAAe,OAAA,CAAQ,MAAM,CAAA,EAAG;AACnD,MAAA,IAAI,CAAC,IAAA,CAAK,OAAA,EAAS,IAAA,EAAK,EAAG;AAEvB,QAAA,MAAM,YAAA,GAAe,IAAA,CAAK,MAAA,EAAQ,KAAA,CAAM,4BAA4B,CAAA;AACpE,QAAA,MAAM,gBAAA,GAAmB,eAAe,CAAC,CAAA;AACzC,QAAA,IAAI,gBAAA,EAAkB;AAClB,UAAA,IAAA,CAAK,UAAA,CAAW,CAAA,CAAA,EAAI,gBAAgB,CAAA,GAAA,EAAM,gBAAgB,CAAA,CAAA,CAAG,CAAA;AAAA,QACjE;AAAA,MACJ;AAEA,MAAA;AAAA,IACJ;AAEA,IAAA,MAAM,YAAA,GAAe,SAAS,OAAA,EAAQ;AAEtC,IAAA,IAAI,aAAA;AAEJ,IAAA,IAAI,YAAA,EAAc;AACd,MAAA,MAAM,aAAA,GAAgB,IAAI,cAAA,CAAe,CAAC,YAAY,CAAC,CAAA;AAGvD,MAAA,IAAI,YAAA,GAAe,cAAA,EAAgB,qBAAA,CAAsB,MAAA,EAAQ,aAAa,CAAA;AAS9E,MAAA,IAAI,CAAC,YAAA,EAAc;AACf,QAAA,MAAM,WAAA,GAAc,SAAA,CAAU,IAAA,CAAqB,UAAU,CAAA;AAC7D,QAAA,MAAM,IAAA,GAAO,cAAA,EAAgB,gBAAA,CAAiB,MAAM,CAAA;AACpD,QAAA,MAAM,aAAa,WAAA,EAAa,qBAAA;AAAA,UAC5B,aAAA;AAAA,UACA,IAAA,EAAM,SAAS,IAAA,GAAO;AAAA,SAC1B;AACA,QAAA,IAAI,eAAe,CAAC,IAAA,EAAM,UAAU,IAAA,CAAK,QAAA,CAAS,UAAU,CAAA,CAAA,EAAI;AAC5D,UAAA,YAAA,GAAe,UAAA;AAAA,QACnB;AAAA,MACJ;AAEA,MAAA,IAAI,cAAc,IAAA,EAAM;AACpB,QAAA,aAAA,GAAgB,iBAAA,CAAkB,WAAA,CAAY,YAAA,CAAa,IAAI,CAAA;AAAA,MACnE;AAAA,IACJ;AAKA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,IAAI,IAAA,CAAK,OAAA,EAAS,IAAA,EAAK,EAAG;AACtB,QAAA;AAAA,MACJ;AAAA,IACJ;AAEA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,MAAM,WAAA,GAAc,cAAA,EAAgB,UAAA,CAAW,MAAM,CAAA;AACrD,MAAA,IAAI,aAAa,IAAA,EAAM;AACnB,QAAA,aAAA,GAAgB,iBAAA,CAAkB,WAAA,CAAY,WAAA,CAAY,IAAI,CAAA;AAAA,MAClE;AAAA,IACJ;AAEA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,MAAM,YAAA,GAAe,IAAA,CAAK,MAAA,EAAQ,KAAA,CAAM,4BAA4B,CAAA;AACpE,MAAA,aAAA,GAAgB,eAAe,CAAC,CAAA;AAAA,IACpC;AAEA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,MAAA,CAAO,QAAQ,oHAAoH,CAAA;AACnI,MAAA;AAAA,IACJ;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,CAAA,CAAA,EAAI,aAAa,CAAA,GAAA,EAAM,aAAa,CAAA,CAAA,CAAG,CAAA;AAAA,EAC3D;AAAA,EAIA,MAAM,QAAA,CACkB,IAAA,EACM,MAAA,EACN,QACS,cAAA,EAC/B;AACE,IAAA,MAAM,SAAS,IAAA,CAAK,EAAA;AAGpB,IAAA,IAAI,cAAA,IAAkB,CAAC,cAAA,CAAe,OAAA,CAAQ,MAAM,CAAA,EAAG;AACnD,MAAA;AAAA,IACJ;AAGA,IAAA,IAAI,YAAA,GAAe,cAAA,EAAgB,qBAAA,CAAsB,MAAA,EAAQ,MAAM,CAAA;AASvE,IAAA,IAAI,CAAC,YAAA,EAAc;AACf,MAAA,MAAM,WAAA,GAAc,SAAA,CAAU,IAAA,CAAqB,UAAU,CAAA;AAC7D,MAAA,MAAM,IAAA,GAAO,cAAA,EAAgB,gBAAA,CAAiB,MAAM,CAAA;AACpD,MAAA,MAAM,aAAa,WAAA,EAAa,qBAAA;AAAA,QAC5B,MAAA;AAAA,QACA,IAAA,EAAM,SAAS,IAAA,GAAO;AAAA,OAC1B;AACA,MAAA,IAAI,eAAe,CAAC,IAAA,EAAM,UAAU,IAAA,CAAK,QAAA,CAAS,UAAU,CAAA,CAAA,EAAI;AAC5D,QAAA,YAAA,GAAe,UAAA;AAAA,MACnB;AAAA,IACJ;AAEA,IAAA,MAAM,GAAA,GAAM,cAAA,EAAgB,UAAA,CAAW,MAAM,CAAA;AAC7C,IAAA,MAAM,aAAA,GAAgB,YAAA,EAAc,IAAA,GAC9B,iBAAA,CAAkB,YAAY,YAAA,CAAa,IAAI,CAAA,GAC/C,GAAA,EAAK,IAAA,GACD,iBAAA,CAAkB,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,GACtC,MAAA;AAGV,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC3C,QAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,QAAA,cAAA,EAAgB,YAAY,KAAK,CAAA;AACjC,QAAA,KAAA,CAAM,OAAA,EAAQ;AACd,QAAA,KAAA,CAAM,OAAA,EAAQ;AACd,QAAA,IAAA,CAAK,YAAY,KAAK,CAAA;AAAA,MAC1B;AACA,MAAA,IAAA,CAAK,WAAW,EAAE,CAAA;AAClB,MAAA;AAAA,IACJ;AAOA,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AACpC,IAAA,IAAI,YAAA,EAAc,SAAS,aAAA,EAAe;AACtC,MAAA;AAAA,IACJ;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,CAAA,CAAA,EAAI,aAAa,CAAA,GAAA,EAAM,aAAa,CAAA,CAAA,CAAG,CAAA;AAKvD,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC3C,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,MAAA,cAAA,EAAgB,YAAY,KAAK,CAAA;AACjC,MAAA,KAAA,CAAM,OAAA,EAAQ;AACd,MAAA,KAAA,CAAM,OAAA,EAAQ;AACd,MAAA,IAAA,CAAK,YAAY,KAAK,CAAA;AAAA,IAC1B;AAGA,IAAA,IAAA,CAAK,QAAA,EAAS;AAEd,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC3C,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,MAAA,KAAA,CAAM,IAAA,EAAK;AAEX,MAAA,MAAM,GAAA,GAAM,MAAM,IAAA,EAAK;AACvB,MAAA,IAAI,eAAe,OAAA,EAAS;AACxB,QAAA,MAAM,GAAA;AAAA,MACV;AACA,MAAA,KAAA,CAAM,SAAA,EAAU;AAEhB,MAAA,KAAA,CAAM,OAAA,EAAQ;AACd,MAAA,KAAA,CAAM,KAAA,EAAM;AAAA,IAChB;AAAA,EACJ;AACJ;AAvLU,eAAA,CAAA;AAAA,EADL,GAAA,CAAI,QAAA;AAAA,EAEA,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,iBAAiB,CAAA;AAAA,CAAA,EANtB,OAAA,CAGH,SAAA,EAAA,UAAA,EAAA,CAAA,CAAA;AAwFA,eAAA,CAAA;AAAA,EADL,GAAA,CAAI,MAAA;AAAA,EAEA,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,cAAc,CAAA,CAAA;AAAA,EACvB,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,iBAAiB,CAAA;AAAA,CAAA,EA/FtB,OAAA,CA2FH,SAAA,EAAA,UAAA,EAAA,CAAA,CAAA;AA3FG,OAAA,GAAN,eAAA,CAAA;AAAA,EAJN,QAAQ,MAAA,CAAO;AAAA,IACZ,SAAA,EAAW,YAAA;AAAA,IACX,WAAA,EAAa;AAAA,GAChB;AAAA,CAAA,EACY,OAAA,CAAA","file":"AreRoot.component.mjs","sourcesContent":["import { A_Caller, A_Context, A_FormatterHelper, A_Inject, } from \"@adaas/a-concept\";\nimport { A_Frame } from \"@adaas/a-frame/core\";\nimport { A_Logger } from \"@adaas/a-utils/a-logger\";\nimport { A_SignalVector } from \"@adaas/a-utils/a-signal\";\nimport { Are, AreNode, AreSignals, AreSignalsMeta, AreSignalsContext } from \"@adaas/are\";\nimport { AreRoute } from \"@adaas/are-html/signals/AreRoute.signal\";\n\n\n@A_Frame.Define({\n    namespace: 'a-are-html',\n    description: 'The AreRoot component serves as the foundational entry point for the A-Concept Rendering Engine (ARE). It is responsible for initializing the rendering process, managing the root node of the component tree, and handling signal-based rendering logic. The AreRoot component processes incoming signals to determine which child components to render, allowing for dynamic and responsive UI updates based on application state and user interactions.'\n})\nexport class AreRoot extends Are {\n\n    @Are.Template\n    async template(\n        @A_Inject(A_Caller) root: AreNode,\n        @A_Inject(A_Logger) logger: A_Logger,\n        @A_Inject(AreSignalsContext) signalsContext?: AreSignalsContext,\n    ) {\n\n        const rootId = root.id;\n\n        // No routing config for this root — but still honour body content or\n        // a 'default' attribute if one is present on the markup.\n        if (signalsContext && !signalsContext.hasRoot(rootId)) {\n            if (!root.content?.trim()) {\n                // Fallback: legacy default= attribute\n                const defaultMatch = root.markup?.match(/\\bdefault=[\"']([^\"']*)[\"']/);\n                const defaultComponent = defaultMatch?.[1];\n                if (defaultComponent) {\n                    root.setContent(`<${defaultComponent}></${defaultComponent}>`);\n                }\n            }\n            // Body content (or none) — tokenizer picks it up without intervention\n            return;\n        }\n\n        const currentRoute = AreRoute.default();\n\n        let componentName: string | undefined;\n\n        if (currentRoute) {\n            const initialVector = new A_SignalVector([currentRoute]);\n\n            // 1. Lookup via AreSignalsContext (per root-id conditions)\n            let renderTarget = signalsContext?.findComponentByVector(rootId, initialVector);\n\n            // 2. Fall back to global AreSignalsMeta, pool-filtered.\n            // IMPORTANT: pass the pool *into* the lookup so it can skip over\n            // out-of-pool matches (e.g. a meta-outlet component whose condition\n            // also matches the same vector) and find the highest-priority match\n            // that this outlet can actually render. Filtering only after the\n            // fact would mask valid in-pool matches and surface the outlet's\n            // default instead.\n            if (!renderTarget) {\n                const signalsMeta = A_Context.meta<AreSignalsMeta>(AreSignals);\n                const pool = signalsContext?.getComponentById(rootId);\n                const metaTarget = signalsMeta?.findComponentByVector(\n                    initialVector,\n                    pool?.length ? pool : undefined,\n                );\n                if (metaTarget && (!pool?.length || pool.includes(metaTarget))) {\n                    renderTarget = metaTarget;\n                }\n            }\n\n            if (renderTarget?.name) {\n                componentName = A_FormatterHelper.toKebabCase(renderTarget.name);\n            }\n        }\n\n        // 3. Fall back to body content (the nodes already placed inside the\n        //    <are-root> tag act as the default).  No setContent() call needed —\n        //    the tokenizer will process root.content as-is.\n        if (!componentName) {\n            if (root.content?.trim()) {\n                return;\n            }\n        }\n        // 3.5. Fall back to AreSignalsContext default component for this root.\n        if (!componentName) {\n            const defaultComp = signalsContext?.getDefault(rootId);\n            if (defaultComp?.name) {\n                componentName = A_FormatterHelper.toKebabCase(defaultComp.name);\n            }\n        }\n        // 4. Last resort: legacy default= attribute on the markup.\n        if (!componentName) {\n            const defaultMatch = root.markup?.match(/\\bdefault=[\"']([^\"']*)[\"']/);\n            componentName = defaultMatch?.[1];\n        }\n\n        if (!componentName) {\n            logger.warning('AreRoot: No component found for initial render. Provide body content, a route condition, or a \"default\" attribute.');\n            return;\n        }\n\n        root.setContent(`<${componentName}></${componentName}>`);\n    }\n\n\n    @Are.Signal\n    async onSignal(\n        @A_Inject(A_Caller) root: AreNode,\n        @A_Inject(A_SignalVector) vector: A_SignalVector,\n        @A_Inject(A_Logger) logger: A_Logger,\n        @A_Inject(AreSignalsContext) signalsContext?: AreSignalsContext,\n    ) {\n        const rootId = root.id;\n\n        // No routing config for this root — signals do not affect its content\n        if (signalsContext && !signalsContext.hasRoot(rootId)) {\n            return;\n        }\n\n        // 1. Try root-specific lookup via AreSignalsContext (keyed by the are-root's id attribute)\n        let renderTarget = signalsContext?.findComponentByVector(rootId, vector);\n\n        // 2. Fall back to global AreSignalsMeta lookup, restricted to this\n        //    outlet's pool. Passing the pool *into* the lookup is critical:\n        //    without it, the first globally matching component wins and may\n        //    belong to a different outlet (e.g. AisRequirementsPanel for the\n        //    meta-outlet matching AisEditorCursorScope) — the pool check then\n        //    rejects it and the outlet falls back to default, hiding a valid\n        //    in-pool match (e.g. AisDiagramTab matching AisSetPrimaryDisplay).\n        if (!renderTarget) {\n            const signalsMeta = A_Context.meta<AreSignalsMeta>(AreSignals);\n            const pool = signalsContext?.getComponentById(rootId);\n            const metaTarget = signalsMeta?.findComponentByVector(\n                vector,\n                pool?.length ? pool : undefined,\n            );\n            if (metaTarget && (!pool?.length || pool.includes(metaTarget))) {\n                renderTarget = metaTarget;\n            }\n        }\n\n        const def = signalsContext?.getDefault(rootId);\n        const componentName = renderTarget?.name\n            ? A_FormatterHelper.toKebabCase(renderTarget.name)\n            : def?.name\n                ? A_FormatterHelper.toKebabCase(def.name)\n                : undefined;\n\n        // No matching condition for this signal vector and no default — clear the outlet.\n        if (!componentName) {\n            for (let i = 0; i < root.children.length; i++) {\n                const child = root.children[i];\n                signalsContext?.unsubscribe(child);\n                child.unmount();\n                child.destroy();\n                root.removeChild(child);\n            }\n            root.setContent('');\n            return;\n        }\n\n        // Guard: if the outlet already shows the same component, do nothing.\n        // Prevents infinite remount loops when a non-routing signal carries a\n        // stale routing signal in the accumulated A_SignalState vector.\n        // node.type is the kebab-case tag name — the most direct and reliable\n        // identifier (no constructor-name resolution, no proxy wrapping issues).\n        const currentChild = root.children[0] as AreNode | undefined;\n        if (currentChild?.type === componentName) {\n            return;\n        }\n\n        root.setContent(`<${componentName}></${componentName}>`);\n\n        // Unsubscribe old children BEFORE destroying them.\n        // Without this, AreSignals.handleSignalVector keeps iterating stale\n        // (scope-less) nodes on every subsequent signal and throws an error.\n        for (let i = 0; i < root.children.length; i++) {\n            const child = root.children[i];\n            signalsContext?.unsubscribe(child);\n            child.unmount();\n            child.destroy();\n            root.removeChild(child);\n        }\n\n\n        root.tokenize();\n\n        for (let i = 0; i < root.children.length; i++) {\n            const child = root.children[i];\n            child.init();\n\n            const res = child.load();\n            if (res instanceof Promise) {\n                await res;\n            }\n            child.transform();\n\n            child.compile();\n            child.mount();\n        }\n    }\n}\n"]}
+{"version":3,"sources":["../../../../src/lib/AreRoot/AreRoot.component.ts"],"names":[],"mappings":";;;;;;;;;AAaO,IAAM,OAAA,GAAN,cAAsB,GAAA,CAAI;AAAA,EAG7B,MAAM,QAAA,CACkB,IAAA,EACA,MAAA,EACS,gBACJ,WAAA,EAC3B;AAEE,IAAA,MAAM,SAAS,IAAA,CAAK,EAAA;AAIpB,IAAA,IAAI,cAAA,IAAkB,CAAC,cAAA,CAAe,OAAA,CAAQ,MAAM,CAAA,EAAG;AACnD,MAAA,IAAI,CAAC,IAAA,CAAK,OAAA,EAAS,IAAA,EAAK,EAAG;AAEvB,QAAA,MAAM,YAAA,GAAe,IAAA,CAAK,MAAA,EAAQ,KAAA,CAAM,4BAA4B,CAAA;AACpE,QAAA,MAAM,gBAAA,GAAmB,eAAe,CAAC,CAAA;AACzC,QAAA,IAAI,gBAAA,EAAkB;AAClB,UAAA,IAAA,CAAK,UAAA,CAAW,CAAA,CAAA,EAAI,gBAAgB,CAAA,GAAA,EAAM,gBAAgB,CAAA,CAAA,CAAG,CAAA;AAAA,QACjE;AAAA,MACJ;AAEA,MAAA;AAAA,IACJ;AASA,IAAA,MAAM,aAAA,GAAgB,IAAA,CAAK,kBAAA,CAAmB,WAAW,CAAA;AACzD,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,cAAA,CAAe,MAAA,EAAQ,eAAe,cAAc,CAAA;AAE9E,IAAA,IAAI,gBAAoC,YAAA,EAAc,IAAA,GAChD,kBAAkB,WAAA,CAAY,YAAA,CAAa,IAAI,CAAA,GAC/C,MAAA;AAKN,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,IAAI,IAAA,CAAK,OAAA,EAAS,IAAA,EAAK,EAAG;AACtB,QAAA;AAAA,MACJ;AAAA,IACJ;AAEA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,MAAM,WAAA,GAAc,cAAA,EAAgB,UAAA,CAAW,MAAM,CAAA;AACrD,MAAA,IAAI,aAAa,IAAA,EAAM;AACnB,QAAA,aAAA,GAAgB,iBAAA,CAAkB,WAAA,CAAY,WAAA,CAAY,IAAI,CAAA;AAAA,MAClE;AAAA,IACJ;AAEA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,MAAM,YAAA,GAAe,IAAA,CAAK,MAAA,EAAQ,KAAA,CAAM,4BAA4B,CAAA;AACpE,MAAA,aAAA,GAAgB,eAAe,CAAC,CAAA;AAAA,IACpC;AAEA,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,MAAA,CAAO,QAAQ,oHAAoH,CAAA;AACnI,MAAA;AAAA,IACJ;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,CAAA,CAAA,EAAI,aAAa,CAAA,GAAA,EAAM,aAAa,CAAA,CAAA,CAAG,CAAA;AAAA,EAC3D;AAAA,EAIA,MAAM,QAAA,CACkB,IAAA,EACM,MAAA,EACN,MAAA,EACS,gBACL,KAAA,EAC1B;AACE,IAAA,MAAM,SAAS,IAAA,CAAK,EAAA;AAGpB,IAAA,IAAI,cAAA,IAAkB,CAAC,cAAA,CAAe,OAAA,CAAQ,MAAM,CAAA,EAAG;AACnD,MAAA;AAAA,IACJ;AAKA,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,cAAA,CAAe,MAAA,EAAQ,QAAQ,cAAc,CAAA;AAEvE,IAAA,MAAM,GAAA,GAAM,cAAA,EAAgB,UAAA,CAAW,MAAM,CAAA;AAC7C,IAAA,MAAM,aAAA,GAAgB,YAAA,EAAc,IAAA,GAC9B,iBAAA,CAAkB,YAAY,YAAA,CAAa,IAAI,CAAA,GAC/C,GAAA,EAAK,IAAA,GACD,iBAAA,CAAkB,WAAA,CAAY,GAAA,CAAI,IAAI,CAAA,GACtC,MAAA;AAGV,IAAA,IAAI,CAAC,aAAA,EAAe;AAChB,MAAA,KAAA,MAAW,KAAA,IAAS,CAAC,GAAG,IAAA,CAAK,QAAQ,CAAA,EAAG;AACpC,QAAA,IAAA,CAAK,UAAA,CAAW,IAAA,EAAM,KAAA,EAAO,cAAA,EAAgB,KAAK,CAAA;AAAA,MACtD;AACA,MAAA,IAAA,CAAK,WAAW,EAAE,CAAA;AAClB,MAAA;AAAA,IACJ;AAOA,IAAA,MAAM,YAAA,GAAe,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AACpC,IAAA,IAAI,YAAA,EAAc,SAAS,aAAA,EAAe;AACtC,MAAA;AAAA,IACJ;AAKA,IAAA,KAAA,MAAW,KAAA,IAAS,CAAC,GAAG,IAAA,CAAK,QAAQ,CAAA,EAAG;AACpC,MAAA,IAAA,CAAK,UAAA,CAAW,IAAA,EAAM,KAAA,EAAO,cAAA,EAAgB,KAAK,CAAA;AAAA,IACtD;AAEA,IAAA,IAAA,CAAK,UAAA,CAAW,CAAA,CAAA,EAAI,aAAa,CAAA,GAAA,EAAM,aAAa,CAAA,CAAA,CAAG,CAAA;AAKvD,IAAA,MAAM,MAAA,GAAS,KAAA,EAAO,IAAA,CAAK,IAAA,CAAK,IAAI,aAAa,CAAA;AACjD,IAAA,IAAI,MAAA,EAAQ;AACR,MAAA,IAAA,CAAK,YAAA,CAAa,IAAA,EAAM,MAAA,EAAQ,cAAc,CAAA;AAC9C,MAAA;AAAA,IACJ;AAGA,IAAA,IAAA,CAAK,QAAA,EAAS;AAEd,IAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,GAAI,IAAA,CAAK,QAAA,CAAS,QAAQ,CAAA,EAAA,EAAK;AAC3C,MAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,QAAA,CAAS,CAAC,CAAA;AAC7B,MAAA,KAAA,CAAM,IAAA,EAAK;AAEX,MAAA,MAAM,GAAA,GAAM,MAAM,IAAA,EAAK;AACvB,MAAA,IAAI,eAAe,OAAA,EAAS;AACxB,QAAA,MAAM,GAAA;AAAA,MACV;AACA,MAAA,KAAA,CAAM,SAAA,EAAU;AAEhB,MAAA,KAAA,CAAM,OAAA,EAAQ;AAId,MAAA,MAAM,MAAM,KAAA,EAAM;AAAA,IACtB;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBU,cAAA,CACN,MAAA,EACA,MAAA,EACA,cAAA,EAC8B;AAC9B,IAAA,IAAI,CAAC,QAAQ,OAAO,MAAA;AAGpB,IAAA,IAAI,YAAA,GAAe,cAAA,EAAgB,qBAAA,CAAsB,MAAA,EAAQ,MAAM,CAAA;AAGvE,IAAA,IAAI,CAAC,YAAA,EAAc;AACf,MAAA,MAAM,WAAA,GAAc,SAAA,CAAU,IAAA,CAAqB,UAAU,CAAA;AAC7D,MAAA,MAAM,IAAA,GAAO,cAAA,EAAgB,gBAAA,CAAiB,MAAM,CAAA;AACpD,MAAA,MAAM,aAAa,WAAA,EAAa,qBAAA;AAAA,QAC5B,MAAA;AAAA,QACA,IAAA,EAAM,SAAS,IAAA,GAAO,MAAA;AAAA,QACtB;AAAA,OACJ;AACA,MAAA,IAAI,eAAe,CAAC,IAAA,EAAM,UAAU,IAAA,CAAK,QAAA,CAAS,UAAU,CAAA,CAAA,EAAI;AAC5D,QAAA,YAAA,GAAe,UAAA;AAAA,MACnB;AAAA,IACJ;AAEA,IAAA,OAAO,YAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUU,mBAAmB,WAAA,EAA6C;AACtE,IAAA,MAAM,UAAsB,EAAC;AAE7B,IAAA,IAAI,WAAA,EAAa;AACb,MAAA,KAAA,MAAW,MAAA,IAAU,WAAA,CAAY,QAAA,EAAS,EAAG;AACzC,QAAA,IAAI,MAAA,EAAQ,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA;AAAA,MACnC;AAAA,IACJ;AAEA,IAAA,IAAI,CAAC,OAAA,CAAQ,IAAA,CAAK,CAAA,MAAA,KAAU,MAAA,YAAkB,QAAQ,CAAA,EAAG;AACrD,MAAA,IAAI;AACA,QAAA,MAAM,YAAA,GAAe,SAAS,OAAA,EAAQ;AACtC,QAAA,IAAI,YAAA,EAAc,OAAA,CAAQ,IAAA,CAAK,YAAY,CAAA;AAAA,MAC/C,CAAA,CAAA,MAAQ;AAAA,MAER;AAAA,IACJ;AAEA,IAAA,OAAO,IAAI,eAAe,OAAO,CAAA;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaU,UAAA,CACN,IAAA,EACA,KAAA,EACA,cAAA,EACA,KAAA,EACI;AACJ,IAAA,MAAM,MAAM,KAAA,CAAM,IAAA;AAElB,IAAA,KAAA,CAAM,OAAA,EAAQ;AAMd,IAAA,MAAM,cAAc,cAAA,GACd,IAAA,CAAK,mBAAmB,KAAA,EAAO,cAAc,IAC7C,EAAC;AACP,IAAA,KAAA,MAAW,QAAQ,WAAA,EAAa;AAC5B,MAAA,cAAA,EAAgB,YAAY,IAAI,CAAA;AAAA,IACpC;AAGA,IAAA,IAAA,CAAK,YAAY,KAAK,CAAA;AAEtB,IAAA,IAAI,CAAC,KAAA,EAAO;AACR,MAAA,KAAK,MAAM,OAAA,EAAQ;AACnB,MAAA;AAAA,IACJ;AAEA,IAAA,MAAM,OAAA,GAAU,KAAA,CAAM,GAAA,CAAI,IAAA,CAAK,EAAA,EAAI,KAAK,EAAE,IAAA,EAAM,KAAA,EAAO,WAAA,EAAa,CAAA;AACpE,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAEzB,MAAA,KAAK,KAAA,CAAM,KAAK,OAAA,EAAQ;AAAA,IAC5B;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOU,YAAA,CACN,IAAA,EACA,KAAA,EACA,cAAA,EACI;AACJ,IAAA,MAAM,QAAQ,KAAA,CAAM,IAAA;AAEpB,IAAA,IAAA,CAAK,SAAS,KAAK,CAAA;AAEnB,IAAA,KAAA,MAAW,IAAA,IAAQ,MAAM,WAAA,EAAa;AAClC,MAAA,cAAA,EAAgB,UAAU,IAAI,CAAA;AAAA,IAClC;AAEA,IAAA,KAAA,CAAM,KAAA,EAAM;AAAA,EAChB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASU,kBAAA,CACN,MACA,cAAA,EACS;AACT,IAAA,MAAM,SAAoB,EAAC;AAC3B,IAAA,MAAM,KAAA,GAAmB,CAAC,IAAI,CAAA;AAC9B,IAAA,OAAO,KAAA,CAAM,SAAS,CAAA,EAAG;AACrB,MAAA,MAAM,OAAA,GAAU,MAAM,KAAA,EAAM;AAC5B,MAAA,IAAI,cAAA,CAAe,WAAA,CAAY,GAAA,CAAI,OAAO,CAAA,EAAG;AACzC,QAAA,MAAA,CAAO,KAAK,OAAO,CAAA;AAAA,MACvB;AACA,MAAA,KAAA,CAAM,IAAA,CAAK,GAAG,OAAA,CAAQ,QAAQ,CAAA;AAAA,IAClC;AACA,IAAA,OAAO,MAAA;AAAA,EACX;AACJ;AA3TU,eAAA,CAAA;AAAA,EADL,GAAA,CAAI,QAAA;AAAA,EAEA,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,iBAAiB,CAAA,CAAA;AAAA,EAC1B,4BAAS,aAAa,CAAA;AAAA,CAAA,EAPlB,OAAA,CAGH,SAAA,EAAA,UAAA,EAAA,CAAA,CAAA;AAqEA,eAAA,CAAA;AAAA,EADL,GAAA,CAAI,MAAA;AAAA,EAEA,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,cAAc,CAAA,CAAA;AAAA,EACvB,4BAAS,QAAQ,CAAA,CAAA;AAAA,EACjB,4BAAS,iBAAiB,CAAA,CAAA;AAAA,EAC1B,4BAAS,YAAY,CAAA;AAAA,CAAA,EA7EjB,OAAA,CAwEH,SAAA,EAAA,UAAA,EAAA,CAAA,CAAA;AAxEG,OAAA,GAAN,eAAA,CAAA;AAAA,EAJN,QAAQ,MAAA,CAAO;AAAA,IACZ,SAAA,EAAW,YAAA;AAAA,IACX,WAAA,EAAa;AAAA,GAChB;AAAA,CAAA,EACY,OAAA,CAAA","file":"AreRoot.component.mjs","sourcesContent":["import { A_Caller, A_Context, A_FormatterHelper, A_Inject, A_TYPES__Ctor } from \"@adaas/a-concept\";\nimport { A_Frame } from \"@adaas/a-frame/core\";\nimport { A_Logger } from \"@adaas/a-utils/a-logger\";\nimport { A_Signal, A_SignalState, A_SignalVector } from \"@adaas/a-utils/a-signal\";\nimport { Are, AreNode, AreSignals, AreSignalsMeta, AreSignalsContext } from \"@adaas/are\";\nimport { AreRoute } from \"@adaas/are-html/signals/AreRoute.signal\";\nimport { AreRootCache, AreRootCacheEntry } from \"./AreRootCache.context\";\n\n\n@A_Frame.Define({\n    namespace: 'a-are-html',\n    description: 'The AreRoot component serves as the foundational entry point for the A-Concept Rendering Engine (ARE). It is responsible for initializing the rendering process, managing the root node of the component tree, and handling signal-based rendering logic. The AreRoot component processes incoming signals to determine which child components to render, allowing for dynamic and responsive UI updates based on application state and user interactions.'\n})\nexport class AreRoot extends Are {\n\n    @Are.Template\n    async template(\n        @A_Inject(A_Caller) root: AreNode,\n        @A_Inject(A_Logger) logger: A_Logger,\n        @A_Inject(AreSignalsContext) signalsContext?: AreSignalsContext,\n        @A_Inject(A_SignalState) signalState?: A_SignalState,\n    ) {\n\n        const rootId = root.id;\n\n        // No routing config for this root — but still honour body content or\n        // a 'default' attribute if one is present on the markup.\n        if (signalsContext && !signalsContext.hasRoot(rootId)) {\n            if (!root.content?.trim()) {\n                // Fallback: legacy default= attribute\n                const defaultMatch = root.markup?.match(/\\bdefault=[\"']([^\"']*)[\"']/);\n                const defaultComponent = defaultMatch?.[1];\n                if (defaultComponent) {\n                    root.setContent(`<${defaultComponent}></${defaultComponent}>`);\n                }\n            }\n            // Body content (or none) — tokenizer picks it up without intervention\n            return;\n        }\n\n        // Select from the ACCUMULATED signal state (every signal dispatched so\n        // far), not just the current URL route. Outlets keyed on domain signals\n        // (e.g. a primary-display selector) must reflect the live vector the\n        // moment they mount — even when they mount AFTER the routing signal was\n        // dispatched (a nested outlet inside a just-rendered parent). Using the\n        // same vector + lookup as onSignal keeps initial render and subsequent\n        // updates consistent.\n        const initialVector = this.buildInitialVector(signalState);\n        const renderTarget = this.matchComponent(rootId, initialVector, signalsContext);\n\n        let componentName: string | undefined = renderTarget?.name\n            ? A_FormatterHelper.toKebabCase(renderTarget.name)\n            : undefined;\n\n        // 3. Fall back to body content (the nodes already placed inside the\n        //    <are-root> tag act as the default).  No setContent() call needed —\n        //    the tokenizer will process root.content as-is.\n        if (!componentName) {\n            if (root.content?.trim()) {\n                return;\n            }\n        }\n        // 3.5. Fall back to AreSignalsContext default component for this root.\n        if (!componentName) {\n            const defaultComp = signalsContext?.getDefault(rootId);\n            if (defaultComp?.name) {\n                componentName = A_FormatterHelper.toKebabCase(defaultComp.name);\n            }\n        }\n        // 4. Last resort: legacy default= attribute on the markup.\n        if (!componentName) {\n            const defaultMatch = root.markup?.match(/\\bdefault=[\"']([^\"']*)[\"']/);\n            componentName = defaultMatch?.[1];\n        }\n\n        if (!componentName) {\n            logger.warning('AreRoot: No component found for initial render. Provide body content, a route condition, or a \"default\" attribute.');\n            return;\n        }\n\n        root.setContent(`<${componentName}></${componentName}>`);\n    }\n\n\n    @Are.Signal\n    async onSignal(\n        @A_Inject(A_Caller) root: AreNode,\n        @A_Inject(A_SignalVector) vector: A_SignalVector,\n        @A_Inject(A_Logger) logger: A_Logger,\n        @A_Inject(AreSignalsContext) signalsContext?: AreSignalsContext,\n        @A_Inject(AreRootCache) cache?: AreRootCache,\n    ) {\n        const rootId = root.id;\n\n        // No routing config for this root — signals do not affect its content\n        if (signalsContext && !signalsContext.hasRoot(rootId)) {\n            return;\n        }\n\n        // Resolve the target component for the incoming vector using the SAME\n        // lookup the initial template render uses (root-id conditions first,\n        // then the global pool-filtered meta map).\n        const renderTarget = this.matchComponent(rootId, vector, signalsContext);\n\n        const def = signalsContext?.getDefault(rootId);\n        const componentName = renderTarget?.name\n            ? A_FormatterHelper.toKebabCase(renderTarget.name)\n            : def?.name\n                ? A_FormatterHelper.toKebabCase(def.name)\n                : undefined;\n\n        // No matching condition for this signal vector and no default — clear the outlet.\n        if (!componentName) {\n            for (const child of [...root.children]) {\n                this.stashChild(root, child, signalsContext, cache);\n            }\n            root.setContent('');\n            return;\n        }\n\n        // Guard: if the outlet already shows the same component, do nothing.\n        // Prevents infinite remount loops when a non-routing signal carries a\n        // stale routing signal in the accumulated A_SignalState vector.\n        // node.type is the kebab-case tag name — the most direct and reliable\n        // identifier (no constructor-name resolution, no proxy wrapping issues).\n        const currentChild = root.children[0] as AreNode | undefined;\n        if (currentChild?.type === componentName) {\n            return;\n        }\n\n        // Stash the currently displayed children so routing back to them can be\n        // re-injected instantly from the cache (they are unmounted + detached but\n        // NOT destroyed). Falls back to full teardown when no cache is available.\n        for (const child of [...root.children]) {\n            this.stashChild(root, child, signalsContext, cache);\n        }\n\n        root.setContent(`<${componentName}></${componentName}>`);\n\n        // Fast path: a previously rendered subtree for this component is cached —\n        // re-attach it and re-mount from the preserved scene plan, skipping the\n        // expensive tokenize/init/load/transform/compile pipeline.\n        const cached = cache?.take(root.id, componentName);\n        if (cached) {\n            this.restoreChild(root, cached, signalsContext);\n            return;\n        }\n\n        // Slow path: build the component subtree from scratch.\n        root.tokenize();\n\n        for (let i = 0; i < root.children.length; i++) {\n            const child = root.children[i];\n            child.init();\n\n            const res = child.load();\n            if (res instanceof Promise) {\n                await res;\n            }\n            child.transform();\n\n            child.compile();\n            // The HTML engine time-slices large initial mounts; await so a heavy\n            // routed component renders in yielding chunks instead of freezing the\n            // main thread on first entry. Small subtrees resolve synchronously.\n            await child.mount();\n        }\n    }\n\n    /**\n     * Resolves the component a vector should render for the given root, mirroring\n     * the priority used everywhere in the routing system:\n     *   1. Root-specific conditions registered on AreSignalsContext.\n     *   2. The global AreSignalsMeta map, restricted to this outlet's pool.\n     *\n     * Passing the pool *into* the meta lookup is critical: without it, the first\n     * globally matching component wins and may belong to a different outlet\n     * (e.g. AisRequirementsPanel for the meta-outlet matching\n     * AisEditorCursorScope) — the pool check would then reject it and the outlet\n     * would fall back to its default, hiding a valid in-pool match (e.g.\n     * AisDiagramTab matching AisSetPrimaryDisplay).\n     *\n     * Returns `undefined` when nothing matches — callers decide whether to use a\n     * configured default, body content, or clear the outlet.\n     */\n    protected matchComponent(\n        rootId: string,\n        vector: A_SignalVector | undefined,\n        signalsContext?: AreSignalsContext,\n    ): A_TYPES__Ctor<Are> | undefined {\n        if (!vector) return undefined;\n\n        // 1. Root-specific conditions.\n        let renderTarget = signalsContext?.findComponentByVector(rootId, vector);\n\n        // 2. Global pool-filtered meta map.\n        if (!renderTarget) {\n            const signalsMeta = A_Context.meta<AreSignalsMeta>(AreSignals);\n            const pool = signalsContext?.getComponentById(rootId);\n            const metaTarget = signalsMeta?.findComponentByVector(\n                vector,\n                pool?.length ? pool : undefined,\n                rootId,\n            );\n            if (metaTarget && (!pool?.length || pool.includes(metaTarget))) {\n                renderTarget = metaTarget;\n            }\n        }\n\n        return renderTarget as A_TYPES__Ctor<Are> | undefined;\n    }\n\n    /**\n     * Builds the vector used for the INITIAL render. It is seeded from the\n     * accumulated signal state (every signal dispatched on the bus so far) so a\n     * freshly-mounted outlet reflects the live application state immediately,\n     * not just on the next signal tick. The current URL route is appended when\n     * no AreRoute is already present in the state, so route-driven outlets still\n     * resolve on the very first paint (before AreRouteWatcher has dispatched).\n     */\n    protected buildInitialVector(signalState?: A_SignalState): A_SignalVector {\n        const signals: A_Signal[] = [];\n\n        if (signalState) {\n            for (const signal of signalState.toVector()) {\n                if (signal) signals.push(signal);\n            }\n        }\n\n        if (!signals.some(signal => signal instanceof AreRoute)) {\n            try {\n                const currentRoute = AreRoute.default();\n                if (currentRoute) signals.push(currentRoute);\n            } catch {\n                // Non-browser environment (no document) — route is simply absent.\n            }\n        }\n\n        return new A_SignalVector(signals);\n    }\n\n    /**\n     * Detach a displayed child subtree from the outlet and stash it in the cache\n     * for fast re-injection later. The subtree is unmounted (its scene plan is\n     * preserved) and deregistered from the root scope, but NOT destroyed. The\n     * nodes that were subscribed to the signal bus are unsubscribed while cached\n     * so the detached DOM never reacts to signals, and recorded so they can be\n     * re-subscribed verbatim on restore.\n     *\n     * When no cache is available, or the LRU evicts an entry, the affected\n     * subtree is fully destroyed.\n     */\n    protected stashChild(\n        root: AreNode,\n        child: AreNode,\n        signalsContext: AreSignalsContext | undefined,\n        cache: AreRootCache | undefined,\n    ): void {\n        const tag = child.type;\n\n        child.unmount();\n\n        // Collect exactly the nodes that are currently subscribed within this\n        // subtree, then unsubscribe them. Without this, AreSignals keeps\n        // delivering vectors to a detached subtree that would update reverted\n        // DOM (unmount does not deactivate the scene).\n        const subscribers = signalsContext\n            ? this.collectSubscribers(child, signalsContext)\n            : [];\n        for (const node of subscribers) {\n            signalsContext?.unsubscribe(node);\n        }\n\n        // Deregister from the root scope (the \"deregister node from parent\").\n        root.removeChild(child);\n\n        if (!cache) {\n            void child.destroy();\n            return;\n        }\n\n        const evicted = cache.put(root.id, tag, { node: child, subscribers });\n        for (const entry of evicted) {\n            // Evicted entries are already unmounted + unsubscribed + detached.\n            void entry.node.destroy();\n        }\n    }\n\n    /**\n     * Re-attach a cached subtree to the outlet and re-mount it from its preserved\n     * scene plan, re-subscribing exactly the nodes that were subscribed before it\n     * was cached.\n     */\n    protected restoreChild(\n        root: AreNode,\n        entry: AreRootCacheEntry,\n        signalsContext: AreSignalsContext | undefined,\n    ): void {\n        const child = entry.node;\n\n        root.addChild(child);\n\n        for (const node of entry.subscribers) {\n            signalsContext?.subscribe(node);\n        }\n\n        child.mount();\n    }\n\n    /**\n     * Walk a subtree and collect the nodes currently registered as signal\n     * subscribers. Mirrors the subscription performed at init time in\n     * AreHTMLLifecycle (component nodes and root nodes) without depending on the\n     * concrete node classes — it simply intersects the subtree with the live\n     * subscriber registry.\n     */\n    protected collectSubscribers(\n        node: AreNode,\n        signalsContext: AreSignalsContext,\n    ): AreNode[] {\n        const result: AreNode[] = [];\n        const queue: AreNode[] = [node];\n        while (queue.length > 0) {\n            const current = queue.shift()!;\n            if (signalsContext.subscribers.has(current)) {\n                result.push(current);\n            }\n            queue.push(...current.children);\n        }\n        return result;\n    }\n}\n"]}

package/dist/node/lib/AreRoot/AreRootCache.context.d.mts

@@ -0,0 +1,58 @@
+import { A_Fragment } from '@adaas/a-concept';
+import { AreNode } from '@adaas/are';
+
+/**
+ * A single cached, detached component subtree for an are-root outlet.
+ *
+ * `node` is fully compiled and its scene plan is intact (it was `unmount()`ed,
+ * not destroyed), so it can be re-mounted instantly without re-tokenizing,
+ * re-loading, transforming or compiling. `subscribers` records the exact set of
+ * nodes inside the subtree that were subscribed to the signal bus at the moment
+ * of stashing — they are unsubscribed while cached (so the detached DOM never
+ * reacts to signals) and re-subscribed verbatim on restore.
+ */
+type AreRootCacheEntry = {
+    node: AreNode;
+    subscribers: AreNode[];
+};
+declare class AreRootCache extends A_Fragment {
+    /**
+     * rootId -> (component tag -> cache entry). The inner Map preserves
+     * insertion order which is used as the LRU recency order: the first key is
+     * the least-recently-used entry, the last key the most-recently-used.
+     */
+    protected _cache: Map<string, Map<string, AreRootCacheEntry>>;
+    /**
+     * Maximum number of cached subtrees kept per root. Older entries beyond this
+     * limit are evicted (and returned to the caller so it can destroy them).
+     */
+    protected _limit: number;
+    constructor(limit?: number);
+    /**
+     * Maximum number of cached subtrees kept per root.
+     */
+    get limit(): number;
+    protected bucket(rootId: string): Map<string, AreRootCacheEntry>;
+    /**
+     * Whether a subtree for the given component tag is currently cached.
+     */
+    has(rootId: string, tag: string): boolean;
+    /**
+     * Retrieve AND remove a cached subtree so it can become live again. Returns
+     * `undefined` on a cache miss.
+     */
+    take(rootId: string, tag: string): AreRootCacheEntry | undefined;
+    /**
+     * Stash a detached subtree under the given component tag. Returns any entries
+     * that were evicted to honour the LRU limit (or replaced for the same tag) so
+     * the caller can `destroy()` them.
+     */
+    put(rootId: string, tag: string, entry: AreRootCacheEntry): AreRootCacheEntry[];
+    /**
+     * Remove and return every cached entry for a root (e.g. on teardown) so the
+     * caller can destroy them.
+     */
+    clear(rootId: string): AreRootCacheEntry[];
+}
+
+export { AreRootCache, type AreRootCacheEntry };

package/dist/node/lib/AreRoot/AreRootCache.context.d.ts

@@ -0,0 +1,58 @@
+import { A_Fragment } from '@adaas/a-concept';
+import { AreNode } from '@adaas/are';
+
+/**
+ * A single cached, detached component subtree for an are-root outlet.
+ *
+ * `node` is fully compiled and its scene plan is intact (it was `unmount()`ed,
+ * not destroyed), so it can be re-mounted instantly without re-tokenizing,
+ * re-loading, transforming or compiling. `subscribers` records the exact set of
+ * nodes inside the subtree that were subscribed to the signal bus at the moment
+ * of stashing — they are unsubscribed while cached (so the detached DOM never
+ * reacts to signals) and re-subscribed verbatim on restore.
+ */
+type AreRootCacheEntry = {
+    node: AreNode;
+    subscribers: AreNode[];
+};
+declare class AreRootCache extends A_Fragment {
+    /**
+     * rootId -> (component tag -> cache entry). The inner Map preserves
+     * insertion order which is used as the LRU recency order: the first key is
+     * the least-recently-used entry, the last key the most-recently-used.
+     */
+    protected _cache: Map<string, Map<string, AreRootCacheEntry>>;
+    /**
+     * Maximum number of cached subtrees kept per root. Older entries beyond this
+     * limit are evicted (and returned to the caller so it can destroy them).
+     */
+    protected _limit: number;
+    constructor(limit?: number);
+    /**
+     * Maximum number of cached subtrees kept per root.
+     */
+    get limit(): number;
+    protected bucket(rootId: string): Map<string, AreRootCacheEntry>;
+    /**
+     * Whether a subtree for the given component tag is currently cached.
+     */
+    has(rootId: string, tag: string): boolean;
+    /**
+     * Retrieve AND remove a cached subtree so it can become live again. Returns
+     * `undefined` on a cache miss.
+     */
+    take(rootId: string, tag: string): AreRootCacheEntry | undefined;
+    /**
+     * Stash a detached subtree under the given component tag. Returns any entries
+     * that were evicted to honour the LRU limit (or replaced for the same tag) so
+     * the caller can `destroy()` them.
+     */
+    put(rootId: string, tag: string, entry: AreRootCacheEntry): AreRootCacheEntry[];
+    /**
+     * Remove and return every cached entry for a root (e.g. on teardown) so the
+     * caller can destroy them.
+     */
+    clear(rootId: string): AreRootCacheEntry[];
+}
+
+export { AreRootCache, type AreRootCacheEntry };

package/dist/node/lib/AreRoot/AreRootCache.context.js

@@ -0,0 +1,106 @@
+'use strict';
+
+var aConcept = require('@adaas/a-concept');
+var core = require('@adaas/a-frame/core');
+
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __decorateClass = (decorators, target, key, kind) => {
+  var result = kind > 1 ? void 0 : kind ? __getOwnPropDesc(target, key) : target;
+  for (var i = decorators.length - 1, decorator; i >= 0; i--)
+    if (decorator = decorators[i])
+      result = (decorator(result)) || result;
+  return result;
+};
+exports.AreRootCache = class AreRootCache extends aConcept.A_Fragment {
+  constructor(limit = 10) {
+    super({ name: "AreRootCache" });
+    /**
+     * rootId -> (component tag -> cache entry). The inner Map preserves
+     * insertion order which is used as the LRU recency order: the first key is
+     * the least-recently-used entry, the last key the most-recently-used.
+     */
+    this._cache = /* @__PURE__ */ new Map();
+    this._limit = Math.max(0, Math.floor(limit));
+  }
+  /**
+   * Maximum number of cached subtrees kept per root.
+   */
+  get limit() {
+    return this._limit;
+  }
+  bucket(rootId) {
+    let bucket = this._cache.get(rootId);
+    if (!bucket) {
+      bucket = /* @__PURE__ */ new Map();
+      this._cache.set(rootId, bucket);
+    }
+    return bucket;
+  }
+  /**
+   * Whether a subtree for the given component tag is currently cached.
+   */
+  has(rootId, tag) {
+    return this.bucket(rootId).has(tag);
+  }
+  /**
+   * Retrieve AND remove a cached subtree so it can become live again. Returns
+   * `undefined` on a cache miss.
+   */
+  take(rootId, tag) {
+    const bucket = this.bucket(rootId);
+    const entry = bucket.get(tag);
+    if (entry) {
+      bucket.delete(tag);
+    }
+    return entry;
+  }
+  /**
+   * Stash a detached subtree under the given component tag. Returns any entries
+   * that were evicted to honour the LRU limit (or replaced for the same tag) so
+   * the caller can `destroy()` them.
+   */
+  put(rootId, tag, entry) {
+    const bucket = this.bucket(rootId);
+    const evicted = [];
+    const existing = bucket.get(tag);
+    if (existing) {
+      bucket.delete(tag);
+      if (existing.node !== entry.node) {
+        evicted.push(existing);
+      }
+    }
+    bucket.set(tag, entry);
+    while (bucket.size > this._limit) {
+      const oldestKey = bucket.keys().next().value;
+      if (oldestKey === void 0) {
+        break;
+      }
+      const oldest = bucket.get(oldestKey);
+      bucket.delete(oldestKey);
+      evicted.push(oldest);
+    }
+    return evicted;
+  }
+  /**
+   * Remove and return every cached entry for a root (e.g. on teardown) so the
+   * caller can destroy them.
+   */
+  clear(rootId) {
+    const bucket = this._cache.get(rootId);
+    if (!bucket) {
+      return [];
+    }
+    const entries = [...bucket.values()];
+    bucket.clear();
+    this._cache.delete(rootId);
+    return entries;
+  }
+};
+exports.AreRootCache = __decorateClass([
+  core.A_Frame.Define({
+    namespace: "a-are-html",
+    description: "AreRootCache is a fragment that keeps a small per-root LRU of previously rendered are-root subtrees. When an are-root swaps the component it displays, the outgoing subtree is stashed here (unmounted + detached, but not destroyed) so that routing back to it can re-inject the preserved scene instantly instead of rebuilding from scratch."
+  })
+], exports.AreRootCache);
+//# sourceMappingURL=AreRootCache.context.js.map
+//# sourceMappingURL=AreRootCache.context.js.map

package/dist/node/lib/AreRoot/AreRootCache.context.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/lib/AreRoot/AreRootCache.context.ts"],"names":["AreRootCache","A_Fragment","A_Frame"],"mappings":";;;;;;;;;;;;;AAyBaA,oBAAA,GAAN,2BAA2BC,mBAAA,CAAW;AAAA,EAezC,WAAA,CAAY,QAAgB,EAAA,EAAI;AAC5B,IAAA,KAAA,CAAM,EAAE,IAAA,EAAM,cAAA,EAAgB,CAAA;AATlC;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAU,MAAA,uBAA0D,GAAA,EAAI;AAUpE,IAAA,IAAA,CAAK,SAAS,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,KAAA,GAAgB;AAChB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EAChB;AAAA,EAEU,OAAO,MAAA,EAAgD;AAC7D,IAAA,IAAI,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,MAAA,EAAQ;AACT,MAAA,MAAA,uBAAa,GAAA,EAAI;AACjB,MAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,MAAA,EAAQ,MAAM,CAAA;AAAA,IAClC;AACA,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,QAAgB,GAAA,EAAsB;AACtC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA,CAAE,IAAI,GAAG,CAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAA,CAAK,QAAgB,GAAA,EAA4C;AAC7D,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AACjC,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,KAAA,EAAO;AACP,MAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,IACrB;AACA,IAAA,OAAO,KAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,GAAA,CAAI,MAAA,EAAgB,GAAA,EAAa,KAAA,EAA+C;AAC5E,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AACjC,IAAA,MAAM,UAA+B,EAAC;AAKtC,IAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC/B,IAAA,IAAI,QAAA,EAAU;AACV,MAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AACjB,MAAA,IAAI,QAAA,CAAS,IAAA,KAAS,KAAA,CAAM,IAAA,EAAM;AAC9B,QAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA;AAAA,MACzB;AAAA,IACJ;AAIA,IAAA,MAAA,CAAO,GAAA,CAAI,KAAK,KAAK,CAAA;AAErB,IAAA,OAAO,MAAA,CAAO,IAAA,GAAO,IAAA,CAAK,MAAA,EAAQ;AAC9B,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AACvC,MAAA,IAAI,cAAc,MAAA,EAAW;AACzB,QAAA;AAAA,MACJ;AACA,MAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,CAAI,SAAS,CAAA;AACnC,MAAA,MAAA,CAAO,OAAO,SAAS,CAAA;AACvB,MAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AAAA,IACvB;AAEA,IAAA,OAAO,OAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAA,EAAqC;AACvC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AACrC,IAAA,IAAI,CAAC,MAAA,EAAQ;AACT,MAAA,OAAO,EAAC;AAAA,IACZ;AACA,IAAA,MAAM,OAAA,GAAU,CAAC,GAAG,MAAA,CAAO,QAAQ,CAAA;AACnC,IAAA,MAAA,CAAO,KAAA,EAAM;AACb,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,MAAM,CAAA;AACzB,IAAA,OAAO,OAAA;AAAA,EACX;AACJ;AA3GaD,oBAAA,GAAN,eAAA,CAAA;AAAA,EAJNE,aAAQ,MAAA,CAAO;AAAA,IACZ,SAAA,EAAW,YAAA;AAAA,IACX,WAAA,EAAa;AAAA,GAChB;AAAA,CAAA,EACYF,oBAAA,CAAA","file":"AreRootCache.context.js","sourcesContent":["import { A_Fragment } from \"@adaas/a-concept\";\nimport { A_Frame } from \"@adaas/a-frame/core\";\nimport { AreNode } from \"@adaas/are\";\n\n\n/**\n * A single cached, detached component subtree for an are-root outlet.\n *\n * `node` is fully compiled and its scene plan is intact (it was `unmount()`ed,\n * not destroyed), so it can be re-mounted instantly without re-tokenizing,\n * re-loading, transforming or compiling. `subscribers` records the exact set of\n * nodes inside the subtree that were subscribed to the signal bus at the moment\n * of stashing — they are unsubscribed while cached (so the detached DOM never\n * reacts to signals) and re-subscribed verbatim on restore.\n */\nexport type AreRootCacheEntry = {\n    node: AreNode;\n    subscribers: AreNode[];\n};\n\n\n@A_Frame.Define({\n    namespace: 'a-are-html',\n    description: 'AreRootCache is a fragment that keeps a small per-root LRU of previously rendered are-root subtrees. When an are-root swaps the component it displays, the outgoing subtree is stashed here (unmounted + detached, but not destroyed) so that routing back to it can re-inject the preserved scene instantly instead of rebuilding from scratch.'\n})\nexport class AreRootCache extends A_Fragment {\n\n    /**\n     * rootId -> (component tag -> cache entry). The inner Map preserves\n     * insertion order which is used as the LRU recency order: the first key is\n     * the least-recently-used entry, the last key the most-recently-used.\n     */\n    protected _cache: Map<string, Map<string, AreRootCacheEntry>> = new Map();\n\n    /**\n     * Maximum number of cached subtrees kept per root. Older entries beyond this\n     * limit are evicted (and returned to the caller so it can destroy them).\n     */\n    protected _limit: number;\n\n    constructor(limit: number = 10) {\n        super({ name: 'AreRootCache' });\n        this._limit = Math.max(0, Math.floor(limit));\n    }\n\n    /**\n     * Maximum number of cached subtrees kept per root.\n     */\n    get limit(): number {\n        return this._limit;\n    }\n\n    protected bucket(rootId: string): Map<string, AreRootCacheEntry> {\n        let bucket = this._cache.get(rootId);\n        if (!bucket) {\n            bucket = new Map();\n            this._cache.set(rootId, bucket);\n        }\n        return bucket;\n    }\n\n    /**\n     * Whether a subtree for the given component tag is currently cached.\n     */\n    has(rootId: string, tag: string): boolean {\n        return this.bucket(rootId).has(tag);\n    }\n\n    /**\n     * Retrieve AND remove a cached subtree so it can become live again. Returns\n     * `undefined` on a cache miss.\n     */\n    take(rootId: string, tag: string): AreRootCacheEntry | undefined {\n        const bucket = this.bucket(rootId);\n        const entry = bucket.get(tag);\n        if (entry) {\n            bucket.delete(tag);\n        }\n        return entry;\n    }\n\n    /**\n     * Stash a detached subtree under the given component tag. Returns any entries\n     * that were evicted to honour the LRU limit (or replaced for the same tag) so\n     * the caller can `destroy()` them.\n     */\n    put(rootId: string, tag: string, entry: AreRootCacheEntry): AreRootCacheEntry[] {\n        const bucket = this.bucket(rootId);\n        const evicted: AreRootCacheEntry[] = [];\n\n        // Replace any stale entry for the same tag (should not normally happen,\n        // since a displayed tag is never simultaneously cached) and surface it\n        // for destruction so it does not leak.\n        const existing = bucket.get(tag);\n        if (existing) {\n            bucket.delete(tag);\n            if (existing.node !== entry.node) {\n                evicted.push(existing);\n            }\n        }\n\n        // A limit of 0 disables caching: the freshly added entry is evicted\n        // immediately so the caller tears it down.\n        bucket.set(tag, entry);\n\n        while (bucket.size > this._limit) {\n            const oldestKey = bucket.keys().next().value as string | undefined;\n            if (oldestKey === undefined) {\n                break;\n            }\n            const oldest = bucket.get(oldestKey)!;\n            bucket.delete(oldestKey);\n            evicted.push(oldest);\n        }\n\n        return evicted;\n    }\n\n    /**\n     * Remove and return every cached entry for a root (e.g. on teardown) so the\n     * caller can destroy them.\n     */\n    clear(rootId: string): AreRootCacheEntry[] {\n        const bucket = this._cache.get(rootId);\n        if (!bucket) {\n            return [];\n        }\n        const entries = [...bucket.values()];\n        bucket.clear();\n        this._cache.delete(rootId);\n        return entries;\n    }\n}\n"]}

package/dist/node/lib/AreRoot/AreRootCache.context.mjs

@@ -0,0 +1,99 @@
+import { __decorateClass } from '../../chunk-EQQGB2QZ.mjs';
+import { A_Fragment } from '@adaas/a-concept';
+import { A_Frame } from '@adaas/a-frame/core';
+
+let AreRootCache = class extends A_Fragment {
+  constructor(limit = 10) {
+    super({ name: "AreRootCache" });
+    /**
+     * rootId -> (component tag -> cache entry). The inner Map preserves
+     * insertion order which is used as the LRU recency order: the first key is
+     * the least-recently-used entry, the last key the most-recently-used.
+     */
+    this._cache = /* @__PURE__ */ new Map();
+    this._limit = Math.max(0, Math.floor(limit));
+  }
+  /**
+   * Maximum number of cached subtrees kept per root.
+   */
+  get limit() {
+    return this._limit;
+  }
+  bucket(rootId) {
+    let bucket = this._cache.get(rootId);
+    if (!bucket) {
+      bucket = /* @__PURE__ */ new Map();
+      this._cache.set(rootId, bucket);
+    }
+    return bucket;
+  }
+  /**
+   * Whether a subtree for the given component tag is currently cached.
+   */
+  has(rootId, tag) {
+    return this.bucket(rootId).has(tag);
+  }
+  /**
+   * Retrieve AND remove a cached subtree so it can become live again. Returns
+   * `undefined` on a cache miss.
+   */
+  take(rootId, tag) {
+    const bucket = this.bucket(rootId);
+    const entry = bucket.get(tag);
+    if (entry) {
+      bucket.delete(tag);
+    }
+    return entry;
+  }
+  /**
+   * Stash a detached subtree under the given component tag. Returns any entries
+   * that were evicted to honour the LRU limit (or replaced for the same tag) so
+   * the caller can `destroy()` them.
+   */
+  put(rootId, tag, entry) {
+    const bucket = this.bucket(rootId);
+    const evicted = [];
+    const existing = bucket.get(tag);
+    if (existing) {
+      bucket.delete(tag);
+      if (existing.node !== entry.node) {
+        evicted.push(existing);
+      }
+    }
+    bucket.set(tag, entry);
+    while (bucket.size > this._limit) {
+      const oldestKey = bucket.keys().next().value;
+      if (oldestKey === void 0) {
+        break;
+      }
+      const oldest = bucket.get(oldestKey);
+      bucket.delete(oldestKey);
+      evicted.push(oldest);
+    }
+    return evicted;
+  }
+  /**
+   * Remove and return every cached entry for a root (e.g. on teardown) so the
+   * caller can destroy them.
+   */
+  clear(rootId) {
+    const bucket = this._cache.get(rootId);
+    if (!bucket) {
+      return [];
+    }
+    const entries = [...bucket.values()];
+    bucket.clear();
+    this._cache.delete(rootId);
+    return entries;
+  }
+};
+AreRootCache = __decorateClass([
+  A_Frame.Define({
+    namespace: "a-are-html",
+    description: "AreRootCache is a fragment that keeps a small per-root LRU of previously rendered are-root subtrees. When an are-root swaps the component it displays, the outgoing subtree is stashed here (unmounted + detached, but not destroyed) so that routing back to it can re-inject the preserved scene instantly instead of rebuilding from scratch."
+  })
+], AreRootCache);
+
+export { AreRootCache };
+//# sourceMappingURL=AreRootCache.context.mjs.map
+//# sourceMappingURL=AreRootCache.context.mjs.map

package/dist/node/lib/AreRoot/AreRootCache.context.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../src/lib/AreRoot/AreRootCache.context.ts"],"names":[],"mappings":";;;;AAyBO,IAAM,YAAA,GAAN,cAA2B,UAAA,CAAW;AAAA,EAezC,WAAA,CAAY,QAAgB,EAAA,EAAI;AAC5B,IAAA,KAAA,CAAM,EAAE,IAAA,EAAM,cAAA,EAAgB,CAAA;AATlC;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAU,MAAA,uBAA0D,GAAA,EAAI;AAUpE,IAAA,IAAA,CAAK,SAAS,IAAA,CAAK,GAAA,CAAI,GAAG,IAAA,CAAK,KAAA,CAAM,KAAK,CAAC,CAAA;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,KAAA,GAAgB;AAChB,IAAA,OAAO,IAAA,CAAK,MAAA;AAAA,EAChB;AAAA,EAEU,OAAO,MAAA,EAAgD;AAC7D,IAAA,IAAI,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AACnC,IAAA,IAAI,CAAC,MAAA,EAAQ;AACT,MAAA,MAAA,uBAAa,GAAA,EAAI;AACjB,MAAA,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,MAAA,EAAQ,MAAM,CAAA;AAAA,IAClC;AACA,IAAA,OAAO,MAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,GAAA,CAAI,QAAgB,GAAA,EAAsB;AACtC,IAAA,OAAO,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA,CAAE,IAAI,GAAG,CAAA;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,IAAA,CAAK,QAAgB,GAAA,EAA4C;AAC7D,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AACjC,IAAA,MAAM,KAAA,GAAQ,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC5B,IAAA,IAAI,KAAA,EAAO;AACP,MAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AAAA,IACrB;AACA,IAAA,OAAO,KAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,GAAA,CAAI,MAAA,EAAgB,GAAA,EAAa,KAAA,EAA+C;AAC5E,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,MAAM,CAAA;AACjC,IAAA,MAAM,UAA+B,EAAC;AAKtC,IAAA,MAAM,QAAA,GAAW,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA;AAC/B,IAAA,IAAI,QAAA,EAAU;AACV,MAAA,MAAA,CAAO,OAAO,GAAG,CAAA;AACjB,MAAA,IAAI,QAAA,CAAS,IAAA,KAAS,KAAA,CAAM,IAAA,EAAM;AAC9B,QAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA;AAAA,MACzB;AAAA,IACJ;AAIA,IAAA,MAAA,CAAO,GAAA,CAAI,KAAK,KAAK,CAAA;AAErB,IAAA,OAAO,MAAA,CAAO,IAAA,GAAO,IAAA,CAAK,MAAA,EAAQ;AAC9B,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AACvC,MAAA,IAAI,cAAc,MAAA,EAAW;AACzB,QAAA;AAAA,MACJ;AACA,MAAA,MAAM,MAAA,GAAS,MAAA,CAAO,GAAA,CAAI,SAAS,CAAA;AACnC,MAAA,MAAA,CAAO,OAAO,SAAS,CAAA;AACvB,MAAA,OAAA,CAAQ,KAAK,MAAM,CAAA;AAAA,IACvB;AAEA,IAAA,OAAO,OAAA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAA,EAAqC;AACvC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AACrC,IAAA,IAAI,CAAC,MAAA,EAAQ;AACT,MAAA,OAAO,EAAC;AAAA,IACZ;AACA,IAAA,MAAM,OAAA,GAAU,CAAC,GAAG,MAAA,CAAO,QAAQ,CAAA;AACnC,IAAA,MAAA,CAAO,KAAA,EAAM;AACb,IAAA,IAAA,CAAK,MAAA,CAAO,OAAO,MAAM,CAAA;AACzB,IAAA,OAAO,OAAA;AAAA,EACX;AACJ;AA3Ga,YAAA,GAAN,eAAA,CAAA;AAAA,EAJN,QAAQ,MAAA,CAAO;AAAA,IACZ,SAAA,EAAW,YAAA;AAAA,IACX,WAAA,EAAa;AAAA,GAChB;AAAA,CAAA,EACY,YAAA,CAAA","file":"AreRootCache.context.mjs","sourcesContent":["import { A_Fragment } from \"@adaas/a-concept\";\nimport { A_Frame } from \"@adaas/a-frame/core\";\nimport { AreNode } from \"@adaas/are\";\n\n\n/**\n * A single cached, detached component subtree for an are-root outlet.\n *\n * `node` is fully compiled and its scene plan is intact (it was `unmount()`ed,\n * not destroyed), so it can be re-mounted instantly without re-tokenizing,\n * re-loading, transforming or compiling. `subscribers` records the exact set of\n * nodes inside the subtree that were subscribed to the signal bus at the moment\n * of stashing — they are unsubscribed while cached (so the detached DOM never\n * reacts to signals) and re-subscribed verbatim on restore.\n */\nexport type AreRootCacheEntry = {\n    node: AreNode;\n    subscribers: AreNode[];\n};\n\n\n@A_Frame.Define({\n    namespace: 'a-are-html',\n    description: 'AreRootCache is a fragment that keeps a small per-root LRU of previously rendered are-root subtrees. When an are-root swaps the component it displays, the outgoing subtree is stashed here (unmounted + detached, but not destroyed) so that routing back to it can re-inject the preserved scene instantly instead of rebuilding from scratch.'\n})\nexport class AreRootCache extends A_Fragment {\n\n    /**\n     * rootId -> (component tag -> cache entry). The inner Map preserves\n     * insertion order which is used as the LRU recency order: the first key is\n     * the least-recently-used entry, the last key the most-recently-used.\n     */\n    protected _cache: Map<string, Map<string, AreRootCacheEntry>> = new Map();\n\n    /**\n     * Maximum number of cached subtrees kept per root. Older entries beyond this\n     * limit are evicted (and returned to the caller so it can destroy them).\n     */\n    protected _limit: number;\n\n    constructor(limit: number = 10) {\n        super({ name: 'AreRootCache' });\n        this._limit = Math.max(0, Math.floor(limit));\n    }\n\n    /**\n     * Maximum number of cached subtrees kept per root.\n     */\n    get limit(): number {\n        return this._limit;\n    }\n\n    protected bucket(rootId: string): Map<string, AreRootCacheEntry> {\n        let bucket = this._cache.get(rootId);\n        if (!bucket) {\n            bucket = new Map();\n            this._cache.set(rootId, bucket);\n        }\n        return bucket;\n    }\n\n    /**\n     * Whether a subtree for the given component tag is currently cached.\n     */\n    has(rootId: string, tag: string): boolean {\n        return this.bucket(rootId).has(tag);\n    }\n\n    /**\n     * Retrieve AND remove a cached subtree so it can become live again. Returns\n     * `undefined` on a cache miss.\n     */\n    take(rootId: string, tag: string): AreRootCacheEntry | undefined {\n        const bucket = this.bucket(rootId);\n        const entry = bucket.get(tag);\n        if (entry) {\n            bucket.delete(tag);\n        }\n        return entry;\n    }\n\n    /**\n     * Stash a detached subtree under the given component tag. Returns any entries\n     * that were evicted to honour the LRU limit (or replaced for the same tag) so\n     * the caller can `destroy()` them.\n     */\n    put(rootId: string, tag: string, entry: AreRootCacheEntry): AreRootCacheEntry[] {\n        const bucket = this.bucket(rootId);\n        const evicted: AreRootCacheEntry[] = [];\n\n        // Replace any stale entry for the same tag (should not normally happen,\n        // since a displayed tag is never simultaneously cached) and surface it\n        // for destruction so it does not leak.\n        const existing = bucket.get(tag);\n        if (existing) {\n            bucket.delete(tag);\n            if (existing.node !== entry.node) {\n                evicted.push(existing);\n            }\n        }\n\n        // A limit of 0 disables caching: the freshly added entry is evicted\n        // immediately so the caller tears it down.\n        bucket.set(tag, entry);\n\n        while (bucket.size > this._limit) {\n            const oldestKey = bucket.keys().next().value as string | undefined;\n            if (oldestKey === undefined) {\n                break;\n            }\n            const oldest = bucket.get(oldestKey)!;\n            bucket.delete(oldestKey);\n            evicted.push(oldest);\n        }\n\n        return evicted;\n    }\n\n    /**\n     * Remove and return every cached entry for a root (e.g. on teardown) so the\n     * caller can destroy them.\n     */\n    clear(rootId: string): AreRootCacheEntry[] {\n        const bucket = this._cache.get(rootId);\n        if (!bucket) {\n            return [];\n        }\n        const entries = [...bucket.values()];\n        bucket.clear();\n        this._cache.delete(rootId);\n        return entries;\n    }\n}\n"]}

package/examples/dashboard/dist/index.html

@@ -16,7 +16,7 @@
     <dashboard-app></dashboard-app>
   </are-root>
 
-  <script type="module" src="./mq19zxz4-mnlgmd.js"></script>
+  <script type="module" src="./mqh9ryml-xat335.js"></script>
 </body>
 
 </html>