@repobit/dex-store-elements 1.7.2 → 2.0.0

package/dist/src/core/node.element.js

@@ -0,0 +1,573 @@
+// src/core/BdNodeElement.ts
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+var _a;
+import { BdActionTopologyController } from '../controllers/controller.action-topology.js';
+import { html, LitElement } from 'lit';
+import { property } from 'lit/decorators.js';
+export const BD_NODE_REGISTER_EVENT = 'bd-node-register';
+export const BD_NODE_TRACK_WORK_EVENT = 'bd-node-track-work';
+/**
+ * String brand used as a fallback in case instanceof is not enough.
+ * For example, this can help if the package is bundled more than once.
+ */
+export const BD_NODE_ELEMENT_BRAND = '__bdNodeElement__';
+export function dispatchBdNodeTrackWork(target, key, work) {
+    const event = new CustomEvent(BD_NODE_TRACK_WORK_EVENT, {
+        bubbles: true,
+        composed: true,
+        cancelable: true,
+        detail: {
+            key,
+            work
+        }
+    });
+    return target.dispatchEvent(event);
+}
+const REVISION_CHANGED = Symbol('bd-revision-changed');
+export function isBdNodeElement(value) {
+    return (value instanceof BdNodeElement ||
+        (value instanceof HTMLElement &&
+            value[BD_NODE_ELEMENT_BRAND] === true));
+}
+/**
+ * Base class for all bd-* nodes.
+ *
+ * Responsibilities:
+ * - discovers the nearest logical BdNodeElement parent;
+ * - keeps a set of logical BdNodeElement children;
+ * - tracks local async work;
+ * - makes updateComplete wait for the whole logical subtree;
+ * - owns the set of native action elements in its logical subtree
+ *   (topology), fed incrementally by BdActionElementAdapter announcements.
+ *
+ * It does NOT know about:
+ * - product ids;
+ * - price clients;
+ * - scope;
+ * - @consume / @provide;
+ * - binding data attributes.
+ *
+ * Those belong in BdScopedElement, controllers, or concrete nodes.
+ */
+export class BdNodeElement extends LitElement {
+    constructor() {
+        super(...arguments);
+        this[_a] = true;
+        this.topologyBoundary = false;
+        this._bdChildren = new Set();
+        /**
+         * Latest local work per key.
+         *
+         * If the same key is tracked again, the new promise replaces the old one.
+         * This is important for @lit/task-like flows where old work can be aborted
+         * or made obsolete by newer args.
+         */
+        this._localWork = new Map();
+        this._childrenRevision = 0;
+        this._childrenRevisionWaiters = new Set();
+        this._workRevision = 0;
+        this._workRevisionWaiters = new Set();
+        this._actionTopology = new BdActionTopologyController(this);
+        this._onBdNodeRegister = (event) => {
+            const child = event.detail?.node;
+            if (!isBdNodeElement(child)) {
+                return;
+            }
+            /**
+             * This event is first seen by the node that dispatched it.
+             * Do not stop propagation for self-registration; it needs to reach the
+             * nearest logical parent.
+             */
+            if (child === this) {
+                return;
+            }
+            /**
+             * The first BdNodeElement ancestor that sees the event becomes the logical
+             * parent. Stop propagation so higher bd nodes do not also adopt it.
+             */
+            event.stopPropagation();
+            this._adoptBdChild(child);
+        };
+        this._onBdNodeTrackWork = (event) => {
+            const detail = event.detail;
+            if (!detail) {
+                return;
+            }
+            /**
+           * The nearest BdNodeElement owns this work.
+           * Do not let higher bd nodes track the same promise directly.
+           */
+            event.stopPropagation();
+            event.preventDefault();
+            this.trackLocalWork(detail.key, detail.work);
+        };
+    }
+    static { _a = BD_NODE_ELEMENT_BRAND; }
+    /**
+     * Default render for infrastructure bd-* nodes.
+     *
+     * Subclasses can override this if they need their own template.
+     */
+    render() {
+        return html `<slot></slot>`;
+    }
+    willUpdate(changedProperties) {
+        if (!changedProperties.has('topologyBoundary')) {
+            return;
+        }
+        this._actionTopology.markSubtreeChanged();
+        this._bdParent?._actionTopology.markSubtreeChanged();
+    }
+    connectedCallback() {
+        super.connectedCallback();
+        this.addEventListener(BD_NODE_REGISTER_EVENT, this._onBdNodeRegister);
+        this.addEventListener(BD_NODE_TRACK_WORK_EVENT, this._onBdNodeTrackWork);
+        this._registerWithNearestBdParent();
+        /**
+         * Fallback for custom-element upgrade order.
+         *
+         * Example:
+         * - bd-option may upgrade before bd-product.
+         * - its registration event may fire before bd-product has a listener.
+         * - when bd-product later connects, this pass adopts existing light-DOM
+         *   descendants that are already BdNodeElement instances.
+         */
+        queueMicrotask(() => {
+            if (this.isConnected) {
+                this._adoptExistingLightDomBdChildren();
+            }
+        });
+    }
+    disconnectedCallback() {
+        this._bdParent?._removeBdChild(this);
+        this._bdParent = undefined;
+        this._clearBdChildren();
+        this.removeEventListener(BD_NODE_REGISTER_EVENT, this._onBdNodeRegister);
+        this.removeEventListener(BD_NODE_TRACK_WORK_EVENT, this._onBdNodeTrackWork);
+        super.disconnectedCallback();
+    }
+    get bdParent() {
+        return this._bdParent;
+    }
+    get bdChildren() {
+        return this._bdChildren;
+    }
+    /**
+     * Revision that changes whenever the set of action elements anywhere in this
+     * node's logical subtree changes. Use this as a compute input.
+     */
+    get actionTopologyRevision() {
+        return this._actionTopology.revision;
+    }
+    /**
+     * Action elements owned directly by this node (not descendants).
+     */
+    get localActionElements() {
+        return this._actionTopology.localElements;
+    }
+    /**
+     * All action elements reachable from this node, unioned across the logical
+     * bd subtree. Walks the bd tree (tiny), not arbitrary DOM.
+     */
+    collectActionElements() {
+        const result = [
+            ...this._actionTopology.localElements
+        ];
+        for (const child of this._bdChildren) {
+            if (child.topologyBoundary) {
+                continue;
+            }
+            result.push(...child.collectActionElements());
+        }
+        return result;
+    }
+    /**
+     * Collected compute declarations for action elements reachable from this
+     * node. These are owned by topology so compute does not rescan DOM actions.
+     */
+    collectActionScans() {
+        const result = [
+            ...this._actionTopology.localActionScans
+        ];
+        for (const child of this._bdChildren) {
+            if (child.topologyBoundary) {
+                continue;
+            }
+            result.push(...child.collectActionScans());
+        }
+        return result;
+    }
+    /**
+     * Resolved option seeds reachable from this node, unioned across the logical
+     * bd subtree. Each option carries its product via option.getProduct().
+     */
+    collectOptionSeeds() {
+        const result = [];
+        const optionSeed = this._actionTopology.localOptionSeed;
+        if (optionSeed) {
+            result.push(optionSeed);
+        }
+        for (const child of this._bdChildren) {
+            if (child.topologyBoundary) {
+                continue;
+            }
+            result.push(...child.collectOptionSeeds());
+        }
+        return result;
+    }
+    setLocalOptionSeed(option) {
+        this._actionTopology.setLocalOptionSeed(option);
+    }
+    get hasLocalWork() {
+        return this._localWork.size > 0;
+    }
+    get localWorkCount() {
+        return this._localWork.size;
+    }
+    /**
+     * Promise that resolves when all CURRENT local work is complete.
+     *
+     * This is intentionally separate from updateComplete.
+     *
+     * localComplete:
+     *   current node async work only
+     *
+     * updateComplete:
+     *   current node + local work + logical children
+     *
+     * Loops while a newer `trackLocalWork` replaces tracked work
+     * (`_awaitCurrentLocalWorkComplete` returns `false` on revision
+     * change). The mirror of `getUpdateComplete`'s contract — a
+     * single `await` cannot catch the replacement because the
+     * replacement bumps `_workRevision` and clears the existing
+     * slot, so the earlier await's "all stable" signal is no
+     * longer trustworthy.
+     */
+    get localComplete() {
+        return this._awaitLocalCompleteLoop();
+    }
+    async _awaitLocalCompleteLoop() {
+        while (true) {
+            const stable = await this._awaitCurrentLocalWorkComplete();
+            if (stable && this._localWork.size === 0) {
+                return;
+            }
+        }
+    }
+    /**
+     * Tracks local async work.
+     *
+     * Use this from Task / BdResolveController:
+     *
+     *   task: (args, context) => {
+     *     const work = this.resolveAndPublish(args, context.signal);
+     *     return this.trackLocalWork(this._workKey, work);
+     *   }
+     *
+     * Important:
+     * - the promise should include resolve + commit/publish;
+     * - do not await this.updateComplete inside this promise;
+     * - old work with the same key is replaced by newer work.
+     */
+    trackLocalWork(key, work) {
+        const original = Promise.resolve(work);
+        /**
+         * updateComplete should not reject for business-level async failures.
+         *
+         * The original promise still rejects, so Task / BdResolveController can
+         * expose the error state. The tracked promise is only used for knowing
+         * "is local work finished?"
+         */
+        const tracked = original.then(() => undefined, () => undefined);
+        this._localWork.set(key, tracked);
+        this._bumpWorkRevision();
+        this.requestUpdate();
+        tracked.finally(() => {
+            /**
+             * Only clear if this is still the latest work for this key.
+             *
+             * If a newer task replaced it, the older task must not clear the newer
+             * one when it eventually completes.
+             */
+            if (this._localWork.get(key) !== tracked) {
+                return;
+            }
+            this._localWork.delete(key);
+            this._bumpWorkRevision();
+            this.requestUpdate();
+        });
+        return original;
+    }
+    /**
+     * Hook for subclasses that need to react when a logical child is adopted.
+     */
+    onBdChildConnected(_child) {
+        // Optional hook.
+    }
+    /**
+     * Hook for subclasses that need to react when a logical child is removed.
+     */
+    onBdChildDisconnected(_child) {
+        // Optional hook.
+    }
+    /**
+     * This is the important part.
+     *
+     * Awaiting updateComplete on any bd node means:
+     *
+     *   1. this element's Lit update is complete;
+     *   2. this element's local async work is complete;
+     *   3. any update caused by local work / publishScope is complete;
+     *   4. all logical bd children are updateComplete;
+     *   5. the tree did not change while we were waiting.
+     */
+    async getUpdateComplete() {
+        while (true) {
+            /**
+             * Let the current Lit update complete first.
+             *
+             * This matters when local work is started by @lit/task, because Task
+             * observes args during the host update and runs when they change.
+             */
+            const initialSelfComplete = await super.getUpdateComplete();
+            /**
+              * Wait for this node's own async work.
+              *
+              * This work should include:
+              * - resolve
+              * - commit
+              * - publishScope / clearScope
+              */
+            const localStable = await this._awaitCurrentLocalWorkComplete();
+            /**
+               * Local work may have called publishScope(), clearScope(),
+               * requestUpdate(), or changed Task state.
+               *
+               * Wait once for that local update to flush before asking children
+               * whether they are complete.
+               */
+            const selfCompleteAfterLocalWork = await super.getUpdateComplete();
+            if (!localStable ||
+                this._localWork.size > 0 ||
+                this.isUpdatePending) {
+                continue;
+            }
+            /**
+           * Now children should see the scope published by this node.
+           *
+           * Context subscribers can receive new values when the provider has new
+           * data, so this is the point where child nodes can continue their own
+           * work.
+           */
+            const childrenComplete = await this._awaitCurrentBdChildrenComplete();
+            if (childrenComplete.stable &&
+                this._localWork.size === 0 &&
+                !this.isUpdatePending) {
+                return (initialSelfComplete &&
+                    selfCompleteAfterLocalWork &&
+                    childrenComplete.complete);
+            }
+        }
+    }
+    _registerWithNearestBdParent() {
+        this.dispatchEvent(new CustomEvent(BD_NODE_REGISTER_EVENT, {
+            bubbles: true,
+            /**
+             * true:
+             *   registration can cross shadow DOM boundaries.
+             *
+             * false:
+             *   shadow DOM becomes a hard logical boundary.
+             *
+             */
+            composed: true,
+            detail: {
+                node: this
+            }
+        }));
+    }
+    _adoptBdChild(child) {
+        if (child === this) {
+            return;
+        }
+        if (child._bdParent === this &&
+            this._bdChildren.has(child)) {
+            return;
+        }
+        child._bdParent?._removeBdChild(child);
+        child._bdParent = this;
+        this._bdChildren.add(child);
+        this._bumpChildrenRevision();
+        this.onBdChildConnected(child);
+        this._actionTopology.markSubtreeChanged();
+        this.requestUpdate();
+    }
+    _removeBdChild(child) {
+        if (!this._bdChildren.delete(child)) {
+            return;
+        }
+        if (child._bdParent === this) {
+            child._bdParent = undefined;
+        }
+        this._bumpChildrenRevision();
+        this.onBdChildDisconnected(child);
+        this._actionTopology.markSubtreeChanged();
+        this.requestUpdate();
+    }
+    _clearBdChildren() {
+        if (this._bdChildren.size === 0) {
+            return;
+        }
+        const children = [...this._bdChildren];
+        this._bdChildren.clear();
+        for (const child of children) {
+            if (child._bdParent === this) {
+                child._bdParent = undefined;
+            }
+            this.onBdChildDisconnected(child);
+        }
+        this._bumpChildrenRevision();
+        this.requestUpdate();
+    }
+    /**
+     * Fallback adoption for already-upgraded descendants in light DOM.
+     *
+     * This does not cross arbitrary shadow roots. The event-based registration
+     * handles the composed/shadow case.
+     */
+    _adoptExistingLightDomBdChildren() {
+        const candidates = this.querySelectorAll('*');
+        for (const candidate of candidates) {
+            if (!isBdNodeElement(candidate)) {
+                continue;
+            }
+            if (candidate === this) {
+                continue;
+            }
+            if (this._isNearestLightDomBdParentOf(candidate)) {
+                this._adoptBdChild(candidate);
+            }
+        }
+    }
+    _isNearestLightDomBdParentOf(candidate) {
+        let node = candidate.parentNode;
+        while (node && node !== this) {
+            if (isBdNodeElement(node)) {
+                return false;
+            }
+            node = node.parentNode;
+        }
+        return node === this;
+    }
+    async _awaitCurrentLocalWorkComplete() {
+        const revision = this._workRevision;
+        const works = [...this._localWork.values()];
+        if (works.length === 0) {
+            return this._workRevision === revision;
+        }
+        const revisionWait = this._createWorkRevisionWait(revision);
+        try {
+            const results = await Promise.all(works.map((work) => Promise.race([
+                work.then(() => true),
+                revisionWait.promise
+            ])));
+            return (this._workRevision === revision &&
+                results.every((value) => value === true));
+        }
+        finally {
+            revisionWait.cancel();
+        }
+    }
+    async _awaitCurrentBdChildrenComplete() {
+        const revision = this._childrenRevision;
+        const children = [...this._bdChildren];
+        if (children.length === 0) {
+            return {
+                stable: this._childrenRevision === revision,
+                complete: true
+            };
+        }
+        const revisionWait = this._createChildrenRevisionWait(revision);
+        try {
+            const results = await Promise.all(children.map((child) => Promise.race([
+                child.updateComplete,
+                revisionWait.promise
+            ])));
+            const stable = this._childrenRevision === revision &&
+                results.every((value) => value !== REVISION_CHANGED);
+            return {
+                stable,
+                complete: stable &&
+                    results.every((value) => value === true)
+            };
+        }
+        finally {
+            revisionWait.cancel();
+        }
+    }
+    _createChildrenRevisionWait(revision) {
+        if (this._childrenRevision !== revision) {
+            return {
+                promise: Promise.resolve(REVISION_CHANGED),
+                cancel: () => undefined
+            };
+        }
+        let resolveWait;
+        const promise = new Promise((resolve) => {
+            resolveWait = () => resolve(REVISION_CHANGED);
+        });
+        this._childrenRevisionWaiters.add(resolveWait);
+        return {
+            promise,
+            cancel: () => {
+                this._childrenRevisionWaiters.delete(resolveWait);
+            }
+        };
+    }
+    _createWorkRevisionWait(revision) {
+        if (this._workRevision !== revision) {
+            return {
+                promise: Promise.resolve(REVISION_CHANGED),
+                cancel: () => undefined
+            };
+        }
+        let resolveWait;
+        const promise = new Promise((resolve) => {
+            resolveWait = () => resolve(REVISION_CHANGED);
+        });
+        this._workRevisionWaiters.add(resolveWait);
+        return {
+            promise,
+            cancel: () => {
+                this._workRevisionWaiters.delete(resolveWait);
+            }
+        };
+    }
+    _bumpChildrenRevision() {
+        this._childrenRevision += 1;
+        for (const resolve of this._childrenRevisionWaiters) {
+            resolve();
+        }
+        this._childrenRevisionWaiters.clear();
+    }
+    _bumpWorkRevision() {
+        this._workRevision += 1;
+        for (const resolve of this._workRevisionWaiters) {
+            resolve();
+        }
+        this._workRevisionWaiters.clear();
+    }
+}
+__decorate([
+    property({
+        attribute: 'topology-boundary',
+        type: Boolean,
+        reflect: true
+    })
+], BdNodeElement.prototype, "topologyBoundary", void 0);
+//# sourceMappingURL=node.element.js.map

package/dist/src/core/node.element.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"node.element.js","sourceRoot":"","sources":["../../../src/core/node.element.ts"],"names":[],"mappings":"AAAA,4BAA4B;;;;;;;;AAG5B,OAAO,EAAE,0BAA0B,EAAE,MAAM,6CAA6C,CAAC;AAEzF,OAAO,EACL,IAAI,EACJ,UAAU,EAGX,MAAM,KAAK,CAAC;AACb,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAE7C,MAAM,CAAC,MAAM,sBAAsB,GAAG,kBAA2B,CAAC;AAClE,MAAM,CAAC,MAAM,wBAAwB,GAAG,oBAA6B,CAAC;AAEtE;;;GAGG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,mBAA4B,CAAC;AAWlE,MAAM,UAAU,uBAAuB,CACrC,MAAmB,EACnB,GAAY,EACZ,IAAoB;IAEpB,MAAM,KAAK,GACT,IAAI,WAAW,CACb,wBAAwB,EACxB;QACE,OAAO,EAAK,IAAI;QAChB,QAAQ,EAAI,IAAI;QAChB,UAAU,EAAE,IAAI;QAChB,MAAM,EAAM;YACV,GAAG;YACH,IAAI;SACL;KACF,CACF,CAAC;IAEJ,OAAO,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;AACrC,CAAC;AASD,MAAM,gBAAgB,GAAG,MAAM,CAAC,qBAAqB,CAAC,CAAC;AASvD,MAAM,UAAU,eAAe,CAC7B,KAAc;IAEd,OAAO,CACL,KAAK,YAAY,aAAa;QAC9B,CACE,KAAK,YAAY,WAAW;YAE1B,KAED,CAAC,qBAAqB,CAAC,KAAK,IAAI,CAClC,CACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAgB,aAAc,SAAQ,UAAU;IAAtD;;QACW,QAAuB,GAAG,IAAI,CAAC;QAOxC,qBAAgB,GAAG,KAAK,CAAC;QAER,gBAAW,GAAG,IAAI,GAAG,EAAiB,CAAC;QAGxD;;;;;;WAMG;QACc,eAAU,GAAG,IAAI,GAAG,EAA0B,CAAC;QAExD,sBAAiB,GAAG,CAAC,CAAC;QACb,6BAAwB,GAAG,IAAI,GAAG,EAAc,CAAC;QAE1D,kBAAa,GAAG,CAAC,CAAC;QACT,yBAAoB,GAAG,IAAI,GAAG,EAAc,CAAC;QAE7C,oBAAe,GAC9B,IAAI,0BAA0B,CAAC,IAAI,CAAC,CAAC;QAyXtB,sBAAiB,GAAG,CACnC,KAA6C,EACvC,EAAE;YACR,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC;YAEjC,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,OAAO;YACT,CAAC;YAED;;;;eAIG;YACH,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,OAAO;YACT,CAAC;YAED;;;eAGG;YACH,KAAK,CAAC,eAAe,EAAE,CAAC;YAExB,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC,CAAC;QAEe,uBAAkB,GAAG,CACpC,KAA8C,EACxC,EAAE;YACR,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;YAE5B,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO;YACT,CAAC;YAED;;;aAGC;YACD,KAAK,CAAC,eAAe,EAAE,CAAC;YACxB,KAAK,CAAC,cAAc,EAAE,CAAC;YAEvB,IAAI,CAAC,cAAc,CACjB,MAAM,CAAC,GAAG,EACV,MAAM,CAAC,IAAI,CACZ,CAAC;QACJ,CAAC,CAAC;IAkPJ,CAAC;kBAtrBW,qBAAqB;IA8B/B;;;;OAIG;IACgB,MAAM;QACvB,OAAO,IAAI,CAAA,eAAe,CAAC;IAC7B,CAAC;IAEkB,UAAU,CAC3B,iBAAuC;QAEvC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC/C,OAAO;QACT,CAAC;QAED,IAAI,CAAC,eAAe,CAAC,kBAAkB,EAAE,CAAC;QAC1C,IAAI,CAAC,SAAS,EAAE,eAAe,CAAC,kBAAkB,EAAE,CAAC;IACvD,CAAC;IAEQ,iBAAiB;QACxB,KAAK,CAAC,iBAAiB,EAAE,CAAC;QAE1B,IAAI,CAAC,gBAAgB,CACnB,sBAAsB,EACtB,IAAI,CAAC,iBAAkC,CACxC,CAAC;QAEF,IAAI,CAAC,gBAAgB,CACnB,wBAAwB,EACxB,IAAI,CAAC,kBAAmC,CACzC,CAAC;QAEF,IAAI,CAAC,4BAA4B,EAAE,CAAC;QAEpC;;;;;;;;WAQG;QACH,cAAc,CAAC,GAAG,EAAE;YAClB,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,IAAI,CAAC,gCAAgC,EAAE,CAAC;YAC1C,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEQ,oBAAoB;QAC3B,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAE3B,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAExB,IAAI,CAAC,mBAAmB,CACtB,sBAAsB,EACtB,IAAI,CAAC,iBAAkC,CACxC,CAAC;QAEF,IAAI,CAAC,mBAAmB,CACtB,wBAAwB,EACxB,IAAI,CAAC,kBAAmC,CACzC,CAAC;QAEF,KAAK,CAAC,oBAAoB,EAAE,CAAC;IAC/B,CAAC;IAED,IAAc,QAAQ;QACpB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,IAAc,UAAU;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAI,sBAAsB;QACxB,OAAO,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,IAAI,mBAAmB;QACrB,OAAO,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACH,qBAAqB;QACnB,MAAM,MAAM,GAAkB;YAC5B,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa;SACtC,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,qBAAqB,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,kBAAkB;QAChB,MAAM,MAAM,GAAoB;YAC9B,GAAG,IAAI,CAAC,eAAe,CAAC,gBAAgB;SACzC,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,kBAAkB;QAChB,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,MAAM,UAAU,GACd,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC;QAEvC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAES,kBAAkB,CAC1B,MAAiC;QAEjC,IAAI,CAAC,eAAe,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,IAAc,YAAY;QACxB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,IAAc,cAAc;QAC1B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,IAAc,aAAa;QACzB,OAAO,IAAI,CAAC,uBAAuB,EAAE,CAAC;IACxC,CAAC;IAEO,KAAK,CAAC,uBAAuB;QACnC,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,MAAM,GACV,MAAM,IAAI,CAAC,8BAA8B,EAAE,CAAC;YAE9C,IAAI,MAAM,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACzC,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,cAAc,CACZ,GAAY,EACZ,IAAoB;QAEpB,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAEvC;;;;;;WAMG;QACH,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAC3B,GAAG,EAAE,CAAC,SAAS,EACf,GAAG,EAAE,CAAC,SAAS,CAChB,CAAC;QAEF,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,CAAC,aAAa,EAAE,CAAC;QAErB,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE;YACnB;;;;;eAKG;YACH,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,OAAO,EAAE,CAAC;gBACzC,OAAO;YACT,CAAC;YAED,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC5B,IAAI,CAAC,iBAAiB,EAAE,CAAC;YACzB,IAAI,CAAC,aAAa,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;QAEH,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACO,kBAAkB,CAAC,MAAqB;QAChD,iBAAiB;IACnB,CAAC;IAED;;OAEG;IACO,qBAAqB,CAAC,MAAqB;QACnD,iBAAiB;IACnB,CAAC;IAED;;;;;;;;;;OAUG;IACgB,KAAK,CAAC,iBAAiB;QACxC,OAAO,IAAI,EAAE,CAAC;YACd;;;;;eAKG;YACD,MAAM,mBAAmB,GAAG,MAAM,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAE5D;;;;;;;gBAOI;YACJ,MAAM,WAAW,GACf,MAAM,IAAI,CAAC,8BAA8B,EAAE,CAAC;YAE9C;;;;;;iBAMK;YACL,MAAM,0BAA0B,GAC9B,MAAM,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAElC,IACE,CAAC,WAAW;gBACd,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;gBACxB,IAAI,CAAC,eAAe,EAClB,CAAC;gBACD,SAAS;YACX,CAAC;YAED;;;;;;aAMC;YACD,MAAM,gBAAgB,GACpB,MAAM,IAAI,CAAC,+BAA+B,EAAE,CAAC;YAE/C,IACE,gBAAgB,CAAC,MAAM;gBACzB,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC;gBAC1B,CAAC,IAAI,CAAC,eAAe,EACnB,CAAC;gBACD,OAAO,CACL,mBAAmB;oBACrB,0BAA0B;oBAC1B,gBAAgB,CAAC,QAAQ,CACxB,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAEO,4BAA4B;QAClC,IAAI,CAAC,aAAa,CAChB,IAAI,WAAW,CACb,sBAAsB,EACtB;YACE,OAAO,EAAE,IAAI;YAEb;;;;;;;eAOG;YACH,QAAQ,EAAE,IAAI;YAEd,MAAM,EAAE;gBACN,IAAI,EAAE,IAAI;aACX;SACF,CACF,CACF,CAAC;IACJ,CAAC;IAmDO,aAAa,CAAC,KAAoB;QACxC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,OAAO;QACT,CAAC;QAED,IACE,KAAK,CAAC,SAAS,KAAK,IAAI;YACxB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAC3B,CAAC;YACD,OAAO;QACT,CAAC;QAED,KAAK,CAAC,SAAS,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC;QAEvC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAE5B,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,eAAe,CAAC,kBAAkB,EAAE,CAAC;QAC1C,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAEO,cAAc,CAAC,KAAoB;QACzC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YACpC,OAAO;QACT,CAAC;QAED,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC7B,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC;QAC9B,CAAC;QAED,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,eAAe,CAAC,kBAAkB,EAAE,CAAC;QAC1C,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAEO,gBAAgB;QACtB,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO;QACT,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAEvC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QAEzB,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC7B,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC;YAC9B,CAAC;YAED,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED;;;;;OAKG;IACK,gCAAgC;QACtC,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAE9C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC;gBAChC,SAAS;YACX,CAAC;YAED,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,SAAS;YACX,CAAC;YAED,IAAI,IAAI,CAAC,4BAA4B,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjD,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAEO,4BAA4B,CAClC,SAAwB;QAExB,IAAI,IAAI,GAAgB,SAAS,CAAC,UAAU,CAAC;QAE7C,OAAO,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1B,OAAO,KAAK,CAAC;YACf,CAAC;YAED,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QACzB,CAAC;QAED,OAAO,IAAI,KAAK,IAAI,CAAC;IACvB,CAAC;IAEO,KAAK,CAAC,8BAA8B;QAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC;QAE5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,aAAa,KAAK,QAAQ,CAAC;QACzC,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAE5D,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACjB,OAAO,CAAC,IAAI,CAAyB;gBACnC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAa,CAAC;gBAC9B,YAAY,CAAC,OAAO;aACrB,CAAC,CACH,CACF,CAAC;YAEF,OAAO,CACL,IAAI,CAAC,aAAa,KAAK,QAAQ;gBAC/B,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CACzC,CAAC;QACJ,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,+BAA+B;QAI3C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACxC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;QAEvC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,MAAM,EAAI,IAAI,CAAC,iBAAiB,KAAK,QAAQ;gBAC7C,QAAQ,EAAE,IAAI;aACf,CAAC;QACJ,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,2BAA2B,CAAC,QAAQ,CAAC,CAAC;QAEhE,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CACrB,OAAO,CAAC,IAAI,CAA4B;gBACtC,KAAK,CAAC,cAAc;gBACpB,YAAY,CAAC,OAAO;aACrB,CAAC,CACH,CACF,CAAC;YAEF,MAAM,MAAM,GACV,IAAI,CAAC,iBAAiB,KAAK,QAAQ;gBACnC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,gBAAgB,CAAC,CAAC;YAEvD,OAAO;gBACL,MAAM;gBACN,QAAQ,EACN,MAAM;oBACN,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;aAC3C,CAAC;QACJ,CAAC;gBAAS,CAAC;YACT,YAAY,CAAC,MAAM,EAAE,CAAC;QACxB,CAAC;IACH,CAAC;IAEO,2BAA2B,CACjC,QAAgB;QAEhB,IAAI,IAAI,CAAC,iBAAiB,KAAK,QAAQ,EAAE,CAAC;YACxC,OAAO;gBACL,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC;gBAC1C,MAAM,EAAG,GAAG,EAAE,CAAC,SAAS;aACzB,CAAC;QACJ,CAAC;QAED,IAAI,WAAwB,CAAC;QAE7B,MAAM,OAAO,GAAG,IAAI,OAAO,CAAkB,CAAC,OAAO,EAAE,EAAE;YACvD,WAAW,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE/C,OAAO;YACL,OAAO;YACP,MAAM,EAAE,GAAG,EAAE;gBACX,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YACpD,CAAC;SACF,CAAC;IACJ,CAAC;IAEO,uBAAuB,CAC7B,QAAgB;QAEhB,IAAI,IAAI,CAAC,aAAa,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO;gBACL,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC;gBAC1C,MAAM,EAAG,GAAG,EAAE,CAAC,SAAS;aACzB,CAAC;QACJ,CAAC;QAED,IAAI,WAAwB,CAAC;QAE7B,MAAM,OAAO,GAAG,IAAI,OAAO,CAAkB,CAAC,OAAO,EAAE,EAAE;YACvD,WAAW,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE3C,OAAO;YACL,OAAO;YACP,MAAM,EAAE,GAAG,EAAE;gBACX,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;YAChD,CAAC;SACF,CAAC;IACJ,CAAC;IAEO,qBAAqB;QAC3B,IAAI,CAAC,iBAAiB,IAAI,CAAC,CAAC;QAE5B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,wBAAwB,EAAE,CAAC;YACpD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,CAAC;IACxC,CAAC;IAEO,iBAAiB;QACvB,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC;QAExB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAChD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;IACpC,CAAC;CACF;AA/qBC;IALC,QAAQ,CAAC;QACR,SAAS,EAAE,mBAAmB;QAC9B,IAAI,EAAO,OAAO;QAClB,OAAO,EAAI,IAAI;KAChB,CAAC;uDACuB","sourcesContent":["// src/core/BdNodeElement.ts\n\nimport type { BdComputeScan } from '@/compute/compute.scan.js';\nimport { BdActionTopologyController } from '@/controllers/controller.action-topology.js';\nimport type { ProductOption } from '@repobit/dex-store';\nimport {\n  html,\n  LitElement,\n  type PropertyValues,\n  type TemplateResult\n} from 'lit';\nimport { property } from 'lit/decorators.js';\n\nexport const BD_NODE_REGISTER_EVENT = 'bd-node-register' as const;\nexport const BD_NODE_TRACK_WORK_EVENT = 'bd-node-track-work' as const;\n\n/**\n * String brand used as a fallback in case instanceof is not enough.\n * For example, this can help if the package is bundled more than once.\n */\nexport const BD_NODE_ELEMENT_BRAND = '__bdNodeElement__' as const;\n\nexport interface BdNodeRegisterEventDetail {\n  node: BdNodeElement;\n}\n\nexport interface BdNodeTrackWorkEventDetail<T = unknown> {\n  key : unknown;\n  work: PromiseLike<T>;\n}\n\nexport function dispatchBdNodeTrackWork<T>(\n  target: EventTarget,\n  key: unknown,\n  work: PromiseLike<T>\n): boolean {\n  const event =\n    new CustomEvent<BdNodeTrackWorkEventDetail<T>>(\n      BD_NODE_TRACK_WORK_EVENT,\n      {\n        bubbles   : true,\n        composed  : true,\n        cancelable: true,\n        detail    : {\n          key,\n          work\n        }\n      }\n    );\n\n  return target.dispatchEvent(event);\n}\n\ndeclare global {\n  interface HTMLElementEventMap {\n    [BD_NODE_REGISTER_EVENT]  : CustomEvent<BdNodeRegisterEventDetail>;\n    [BD_NODE_TRACK_WORK_EVENT]: CustomEvent<BdNodeTrackWorkEventDetail>;\n  }\n}\n\nconst REVISION_CHANGED = Symbol('bd-revision-changed');\n\ntype RevisionChanged = typeof REVISION_CHANGED;\n\ntype RevisionWait = {\n  promise: Promise<RevisionChanged>;\n  cancel : () => void;\n};\n\nexport function isBdNodeElement(\n  value: unknown\n): value is BdNodeElement {\n  return (\n    value instanceof BdNodeElement ||\n    (\n      value instanceof HTMLElement &&\n      (\n        value as HTMLElement &\n          Record<typeof BD_NODE_ELEMENT_BRAND, unknown>\n      )[BD_NODE_ELEMENT_BRAND] === true\n    )\n  );\n}\n\n/**\n * Base class for all bd-* nodes.\n *\n * Responsibilities:\n * - discovers the nearest logical BdNodeElement parent;\n * - keeps a set of logical BdNodeElement children;\n * - tracks local async work;\n * - makes updateComplete wait for the whole logical subtree;\n * - owns the set of native action elements in its logical subtree\n *   (topology), fed incrementally by BdActionElementAdapter announcements.\n *\n * It does NOT know about:\n * - product ids;\n * - price clients;\n * - scope;\n * - @consume / @provide;\n * - binding data attributes.\n *\n * Those belong in BdScopedElement, controllers, or concrete nodes.\n */\nexport abstract class BdNodeElement extends LitElement {\n  readonly [BD_NODE_ELEMENT_BRAND] = true;\n\n  @property({\n    attribute: 'topology-boundary',\n    type     : Boolean,\n    reflect  : true\n  })\n  topologyBoundary = false;\n\n  private readonly _bdChildren = new Set<BdNodeElement>();\n  private _bdParent?: BdNodeElement;\n\n  /**\n   * Latest local work per key.\n   *\n   * If the same key is tracked again, the new promise replaces the old one.\n   * This is important for @lit/task-like flows where old work can be aborted\n   * or made obsolete by newer args.\n   */\n  private readonly _localWork = new Map<unknown, Promise<void>>();\n\n  private _childrenRevision = 0;\n  private readonly _childrenRevisionWaiters = new Set<() => void>();\n\n  private _workRevision = 0;\n  private readonly _workRevisionWaiters = new Set<() => void>();\n\n  private readonly _actionTopology =\n    new BdActionTopologyController(this);\n\n  /**\n   * Default render for infrastructure bd-* nodes.\n   *\n   * Subclasses can override this if they need their own template.\n   */\n  protected override render(): TemplateResult {\n    return html`<slot></slot>`;\n  }\n\n  protected override willUpdate(\n    changedProperties: PropertyValues<this>\n  ): void {\n    if (!changedProperties.has('topologyBoundary')) {\n      return;\n    }\n\n    this._actionTopology.markSubtreeChanged();\n    this._bdParent?._actionTopology.markSubtreeChanged();\n  }\n\n  override connectedCallback(): void {\n    super.connectedCallback();\n\n    this.addEventListener(\n      BD_NODE_REGISTER_EVENT,\n      this._onBdNodeRegister as EventListener\n    );\n\n    this.addEventListener(\n      BD_NODE_TRACK_WORK_EVENT,\n      this._onBdNodeTrackWork as EventListener\n    );\n\n    this._registerWithNearestBdParent();\n\n    /**\n     * Fallback for custom-element upgrade order.\n     *\n     * Example:\n     * - bd-option may upgrade before bd-product.\n     * - its registration event may fire before bd-product has a listener.\n     * - when bd-product later connects, this pass adopts existing light-DOM\n     *   descendants that are already BdNodeElement instances.\n     */\n    queueMicrotask(() => {\n      if (this.isConnected) {\n        this._adoptExistingLightDomBdChildren();\n      }\n    });\n  }\n\n  override disconnectedCallback(): void {\n    this._bdParent?._removeBdChild(this);\n    this._bdParent = undefined;\n\n    this._clearBdChildren();\n\n    this.removeEventListener(\n      BD_NODE_REGISTER_EVENT,\n      this._onBdNodeRegister as EventListener\n    );\n\n    this.removeEventListener(\n      BD_NODE_TRACK_WORK_EVENT,\n      this._onBdNodeTrackWork as EventListener\n    );\n\n    super.disconnectedCallback();\n  }\n\n  protected get bdParent(): BdNodeElement | undefined {\n    return this._bdParent;\n  }\n\n  protected get bdChildren(): ReadonlySet<BdNodeElement> {\n    return this._bdChildren;\n  }\n\n  /**\n   * Revision that changes whenever the set of action elements anywhere in this\n   * node's logical subtree changes. Use this as a compute input.\n   */\n  get actionTopologyRevision(): number {\n    return this._actionTopology.revision;\n  }\n\n  /**\n   * Action elements owned directly by this node (not descendants).\n   */\n  get localActionElements(): readonly HTMLElement[] {\n    return this._actionTopology.localElements;\n  }\n\n  /**\n   * All action elements reachable from this node, unioned across the logical\n   * bd subtree. Walks the bd tree (tiny), not arbitrary DOM.\n   */\n  collectActionElements(): HTMLElement[] {\n    const result: HTMLElement[] = [\n      ...this._actionTopology.localElements\n    ];\n\n    for (const child of this._bdChildren) {\n      if (child.topologyBoundary) {\n        continue;\n      }\n\n      result.push(...child.collectActionElements());\n    }\n\n    return result;\n  }\n\n  /**\n   * Collected compute declarations for action elements reachable from this\n   * node. These are owned by topology so compute does not rescan DOM actions.\n   */\n  collectActionScans(): BdComputeScan[] {\n    const result: BdComputeScan[] = [\n      ...this._actionTopology.localActionScans\n    ];\n\n    for (const child of this._bdChildren) {\n      if (child.topologyBoundary) {\n        continue;\n      }\n\n      result.push(...child.collectActionScans());\n    }\n\n    return result;\n  }\n\n  /**\n   * Resolved option seeds reachable from this node, unioned across the logical\n   * bd subtree. Each option carries its product via option.getProduct().\n   */\n  collectOptionSeeds(): ProductOption[] {\n    const result: ProductOption[] = [];\n\n    const optionSeed =\n      this._actionTopology.localOptionSeed;\n\n    if (optionSeed) {\n      result.push(optionSeed);\n    }\n\n    for (const child of this._bdChildren) {\n      if (child.topologyBoundary) {\n        continue;\n      }\n\n      result.push(...child.collectOptionSeeds());\n    }\n\n    return result;\n  }\n\n  protected setLocalOptionSeed(\n    option: ProductOption | undefined\n  ): void {\n    this._actionTopology.setLocalOptionSeed(option);\n  }\n\n  protected get hasLocalWork(): boolean {\n    return this._localWork.size > 0;\n  }\n\n  protected get localWorkCount(): number {\n    return this._localWork.size;\n  }\n\n  /**\n   * Promise that resolves when all CURRENT local work is complete.\n   *\n   * This is intentionally separate from updateComplete.\n   *\n   * localComplete:\n   *   current node async work only\n   *\n   * updateComplete:\n   *   current node + local work + logical children\n   *\n   * Loops while a newer `trackLocalWork` replaces tracked work\n   * (`_awaitCurrentLocalWorkComplete` returns `false` on revision\n   * change). The mirror of `getUpdateComplete`'s contract — a\n   * single `await` cannot catch the replacement because the\n   * replacement bumps `_workRevision` and clears the existing\n   * slot, so the earlier await's \"all stable\" signal is no\n   * longer trustworthy.\n   */\n  protected get localComplete(): Promise<void> {\n    return this._awaitLocalCompleteLoop();\n  }\n\n  private async _awaitLocalCompleteLoop(): Promise<void> {\n    while (true) {\n      const stable =\n        await this._awaitCurrentLocalWorkComplete();\n\n      if (stable && this._localWork.size === 0) {\n        return;\n      }\n    }\n  }\n\n  /**\n   * Tracks local async work.\n   *\n   * Use this from Task / BdResolveController:\n   *\n   *   task: (args, context) => {\n   *     const work = this.resolveAndPublish(args, context.signal);\n   *     return this.trackLocalWork(this._workKey, work);\n   *   }\n   *\n   * Important:\n   * - the promise should include resolve + commit/publish;\n   * - do not await this.updateComplete inside this promise;\n   * - old work with the same key is replaced by newer work.\n   */\n  trackLocalWork<T>(\n    key: unknown,\n    work: PromiseLike<T>\n  ): Promise<T> {\n    const original = Promise.resolve(work);\n\n    /**\n     * updateComplete should not reject for business-level async failures.\n     *\n     * The original promise still rejects, so Task / BdResolveController can\n     * expose the error state. The tracked promise is only used for knowing\n     * \"is local work finished?\"\n     */\n    const tracked = original.then(\n      () => undefined,\n      () => undefined\n    );\n\n    this._localWork.set(key, tracked);\n    this._bumpWorkRevision();\n    this.requestUpdate();\n\n    tracked.finally(() => {\n      /**\n       * Only clear if this is still the latest work for this key.\n       *\n       * If a newer task replaced it, the older task must not clear the newer\n       * one when it eventually completes.\n       */\n      if (this._localWork.get(key) !== tracked) {\n        return;\n      }\n\n      this._localWork.delete(key);\n      this._bumpWorkRevision();\n      this.requestUpdate();\n    });\n\n    return original;\n  }\n\n  /**\n   * Hook for subclasses that need to react when a logical child is adopted.\n   */\n  protected onBdChildConnected(_child: BdNodeElement): void {\n    // Optional hook.\n  }\n\n  /**\n   * Hook for subclasses that need to react when a logical child is removed.\n   */\n  protected onBdChildDisconnected(_child: BdNodeElement): void {\n    // Optional hook.\n  }\n\n  /**\n   * This is the important part.\n   *\n   * Awaiting updateComplete on any bd node means:\n   *\n   *   1. this element's Lit update is complete;\n   *   2. this element's local async work is complete;\n   *   3. any update caused by local work / publishScope is complete;\n   *   4. all logical bd children are updateComplete;\n   *   5. the tree did not change while we were waiting.\n   */\n  protected override async getUpdateComplete(): Promise<boolean> {\n    while (true) {\n    /**\n     * Let the current Lit update complete first.\n     *\n     * This matters when local work is started by @lit/task, because Task\n     * observes args during the host update and runs when they change.\n     */\n      const initialSelfComplete = await super.getUpdateComplete();\n\n      /**\n        * Wait for this node's own async work.\n        *\n        * This work should include:\n        * - resolve\n        * - commit\n        * - publishScope / clearScope\n        */\n      const localStable =\n        await this._awaitCurrentLocalWorkComplete();\n\n      /**\n         * Local work may have called publishScope(), clearScope(),\n         * requestUpdate(), or changed Task state.\n         *\n         * Wait once for that local update to flush before asking children\n         * whether they are complete.\n         */\n      const selfCompleteAfterLocalWork =\n        await super.getUpdateComplete();\n\n      if (\n        !localStable ||\n      this._localWork.size > 0 ||\n      this.isUpdatePending\n      ) {\n        continue;\n      }\n\n      /**\n     * Now children should see the scope published by this node.\n     *\n     * Context subscribers can receive new values when the provider has new\n     * data, so this is the point where child nodes can continue their own\n     * work.\n     */\n      const childrenComplete =\n        await this._awaitCurrentBdChildrenComplete();\n\n      if (\n        childrenComplete.stable &&\n      this._localWork.size === 0 &&\n      !this.isUpdatePending\n      ) {\n        return (\n          initialSelfComplete &&\n        selfCompleteAfterLocalWork &&\n        childrenComplete.complete\n        );\n      }\n    }\n  }\n\n  private _registerWithNearestBdParent(): void {\n    this.dispatchEvent(\n      new CustomEvent<BdNodeRegisterEventDetail>(\n        BD_NODE_REGISTER_EVENT,\n        {\n          bubbles: true,\n\n          /**\n           * true:\n           *   registration can cross shadow DOM boundaries.\n           *\n           * false:\n           *   shadow DOM becomes a hard logical boundary.\n           *\n           */\n          composed: true,\n\n          detail: {\n            node: this\n          }\n        }\n      )\n    );\n  }\n\n  private readonly _onBdNodeRegister = (\n    event: CustomEvent<BdNodeRegisterEventDetail>\n  ): void => {\n    const child = event.detail?.node;\n\n    if (!isBdNodeElement(child)) {\n      return;\n    }\n\n    /**\n     * This event is first seen by the node that dispatched it.\n     * Do not stop propagation for self-registration; it needs to reach the\n     * nearest logical parent.\n     */\n    if (child === this) {\n      return;\n    }\n\n    /**\n     * The first BdNodeElement ancestor that sees the event becomes the logical\n     * parent. Stop propagation so higher bd nodes do not also adopt it.\n     */\n    event.stopPropagation();\n\n    this._adoptBdChild(child);\n  };\n\n  private readonly _onBdNodeTrackWork = (\n    event: CustomEvent<BdNodeTrackWorkEventDetail>\n  ): void => {\n    const detail = event.detail;\n\n    if (!detail) {\n      return;\n    }\n\n    /**\n   * The nearest BdNodeElement owns this work.\n   * Do not let higher bd nodes track the same promise directly.\n   */\n    event.stopPropagation();\n    event.preventDefault();\n\n    this.trackLocalWork(\n      detail.key,\n      detail.work\n    );\n  };\n\n  private _adoptBdChild(child: BdNodeElement): void {\n    if (child === this) {\n      return;\n    }\n\n    if (\n      child._bdParent === this &&\n      this._bdChildren.has(child)\n    ) {\n      return;\n    }\n\n    child._bdParent?._removeBdChild(child);\n\n    child._bdParent = this;\n    this._bdChildren.add(child);\n\n    this._bumpChildrenRevision();\n    this.onBdChildConnected(child);\n    this._actionTopology.markSubtreeChanged();\n    this.requestUpdate();\n  }\n\n  private _removeBdChild(child: BdNodeElement): void {\n    if (!this._bdChildren.delete(child)) {\n      return;\n    }\n\n    if (child._bdParent === this) {\n      child._bdParent = undefined;\n    }\n\n    this._bumpChildrenRevision();\n    this.onBdChildDisconnected(child);\n    this._actionTopology.markSubtreeChanged();\n    this.requestUpdate();\n  }\n\n  private _clearBdChildren(): void {\n    if (this._bdChildren.size === 0) {\n      return;\n    }\n\n    const children = [...this._bdChildren];\n\n    this._bdChildren.clear();\n\n    for (const child of children) {\n      if (child._bdParent === this) {\n        child._bdParent = undefined;\n      }\n\n      this.onBdChildDisconnected(child);\n    }\n\n    this._bumpChildrenRevision();\n    this.requestUpdate();\n  }\n\n  /**\n   * Fallback adoption for already-upgraded descendants in light DOM.\n   *\n   * This does not cross arbitrary shadow roots. The event-based registration\n   * handles the composed/shadow case.\n   */\n  private _adoptExistingLightDomBdChildren(): void {\n    const candidates = this.querySelectorAll('*');\n\n    for (const candidate of candidates) {\n      if (!isBdNodeElement(candidate)) {\n        continue;\n      }\n\n      if (candidate === this) {\n        continue;\n      }\n\n      if (this._isNearestLightDomBdParentOf(candidate)) {\n        this._adoptBdChild(candidate);\n      }\n    }\n  }\n\n  private _isNearestLightDomBdParentOf(\n    candidate: BdNodeElement\n  ): boolean {\n    let node: Node | null = candidate.parentNode;\n\n    while (node && node !== this) {\n      if (isBdNodeElement(node)) {\n        return false;\n      }\n\n      node = node.parentNode;\n    }\n\n    return node === this;\n  }\n\n  private async _awaitCurrentLocalWorkComplete(): Promise<boolean> {\n    const revision = this._workRevision;\n    const works = [...this._localWork.values()];\n\n    if (works.length === 0) {\n      return this._workRevision === revision;\n    }\n\n    const revisionWait = this._createWorkRevisionWait(revision);\n\n    try {\n      const results = await Promise.all(\n        works.map((work) =>\n          Promise.race<true | RevisionChanged>([\n            work.then(() => true as const),\n            revisionWait.promise\n          ])\n        )\n      );\n\n      return (\n        this._workRevision === revision &&\n        results.every((value) => value === true)\n      );\n    } finally {\n      revisionWait.cancel();\n    }\n  }\n\n  private async _awaitCurrentBdChildrenComplete(): Promise<{\n    stable  : boolean;\n    complete: boolean;\n  }> {\n    const revision = this._childrenRevision;\n    const children = [...this._bdChildren];\n\n    if (children.length === 0) {\n      return {\n        stable  : this._childrenRevision === revision,\n        complete: true\n      };\n    }\n\n    const revisionWait = this._createChildrenRevisionWait(revision);\n\n    try {\n      const results = await Promise.all(\n        children.map((child) =>\n          Promise.race<boolean | RevisionChanged>([\n            child.updateComplete,\n            revisionWait.promise\n          ])\n        )\n      );\n\n      const stable =\n        this._childrenRevision === revision &&\n        results.every((value) => value !== REVISION_CHANGED);\n\n      return {\n        stable,\n        complete:\n          stable &&\n          results.every((value) => value === true)\n      };\n    } finally {\n      revisionWait.cancel();\n    }\n  }\n\n  private _createChildrenRevisionWait(\n    revision: number\n  ): RevisionWait {\n    if (this._childrenRevision !== revision) {\n      return {\n        promise: Promise.resolve(REVISION_CHANGED),\n        cancel : () => undefined\n      };\n    }\n\n    let resolveWait!: () => void;\n\n    const promise = new Promise<RevisionChanged>((resolve) => {\n      resolveWait = () => resolve(REVISION_CHANGED);\n    });\n\n    this._childrenRevisionWaiters.add(resolveWait);\n\n    return {\n      promise,\n      cancel: () => {\n        this._childrenRevisionWaiters.delete(resolveWait);\n      }\n    };\n  }\n\n  private _createWorkRevisionWait(\n    revision: number\n  ): RevisionWait {\n    if (this._workRevision !== revision) {\n      return {\n        promise: Promise.resolve(REVISION_CHANGED),\n        cancel : () => undefined\n      };\n    }\n\n    let resolveWait!: () => void;\n\n    const promise = new Promise<RevisionChanged>((resolve) => {\n      resolveWait = () => resolve(REVISION_CHANGED);\n    });\n\n    this._workRevisionWaiters.add(resolveWait);\n\n    return {\n      promise,\n      cancel: () => {\n        this._workRevisionWaiters.delete(resolveWait);\n      }\n    };\n  }\n\n  private _bumpChildrenRevision(): void {\n    this._childrenRevision += 1;\n\n    for (const resolve of this._childrenRevisionWaiters) {\n      resolve();\n    }\n\n    this._childrenRevisionWaiters.clear();\n  }\n\n  private _bumpWorkRevision(): void {\n    this._workRevision += 1;\n\n    for (const resolve of this._workRevisionWaiters) {\n      resolve();\n    }\n\n    this._workRevisionWaiters.clear();\n  }\n}\n"]}