@browserbasehq/orca 3.0.9-alpha-3 → 3.1.0-patch.0

package/dist/esm/lib/v3/dom/locatorScripts/selectors.js

@@ -0,0 +1,283 @@
+import { resolveXPathAtIndex } from "./xpathResolver.js";
+const parseTargetIndex = (value) => {
+    const num = Number(value ?? 0);
+    if (!Number.isFinite(num) || num < 0)
+        return 0;
+    return Math.floor(num);
+};
+const collectCssMatches = (selector, limit) => {
+    if (!selector)
+        return [];
+    const seenRoots = new WeakSet();
+    const seenElements = new Set();
+    const results = [];
+    const queue = [document];
+    const visit = (root) => {
+        if (!root || seenRoots.has(root) || results.length >= limit)
+            return;
+        seenRoots.add(root);
+        try {
+            const matches = root.querySelectorAll(selector);
+            for (const element of matches) {
+                if (seenElements.has(element))
+                    continue;
+                seenElements.add(element);
+                results.push(element);
+                if (results.length >= limit)
+                    return;
+            }
+        }
+        catch {
+            // ignore querySelectorAll issues
+        }
+        try {
+            const ownerDocument = root instanceof Document
+                ? root
+                : (root.host?.ownerDocument ?? document);
+            const walker = ownerDocument.createTreeWalker(root, NodeFilter.SHOW_ELEMENT);
+            let node;
+            while ((node = walker.nextNode())) {
+                if (!(node instanceof Element))
+                    continue;
+                const open = node.shadowRoot;
+                if (open)
+                    queue.push(open);
+            }
+        }
+        catch {
+            // ignore traversal issues
+        }
+    };
+    while (queue.length && results.length < limit) {
+        const next = queue.shift();
+        if (next)
+            visit(next);
+    }
+    return results;
+};
+export function resolveCssSelector(selectorRaw, targetIndexRaw) {
+    const selector = String(selectorRaw ?? "").trim();
+    if (!selector)
+        return null;
+    const targetIndex = parseTargetIndex(targetIndexRaw);
+    const matches = collectCssMatches(selector, targetIndex + 1);
+    return matches[targetIndex] ?? null;
+}
+export function resolveCssSelectorPierce(selectorRaw, targetIndexRaw) {
+    const selector = String(selectorRaw ?? "").trim();
+    if (!selector)
+        return null;
+    const targetIndex = parseTargetIndex(targetIndexRaw);
+    const backdoor = window.__stagehandV3__;
+    if (!backdoor || typeof backdoor.getClosedRoot !== "function") {
+        const matches = collectCssMatches(selector, targetIndex + 1);
+        return matches[targetIndex] ?? null;
+    }
+    const getClosedRoot = (host) => {
+        try {
+            return backdoor.getClosedRoot(host) ?? null;
+        }
+        catch {
+            return null;
+        }
+    };
+    const seenRoots = new WeakSet();
+    const seenElements = new Set();
+    const results = [];
+    const queue = [document];
+    const visit = (root) => {
+        if (!root || seenRoots.has(root) || results.length >= targetIndex + 1)
+            return;
+        seenRoots.add(root);
+        try {
+            const matches = root.querySelectorAll(selector);
+            for (const element of matches) {
+                if (seenElements.has(element))
+                    continue;
+                seenElements.add(element);
+                results.push(element);
+                if (results.length >= targetIndex + 1)
+                    return;
+            }
+        }
+        catch {
+            // ignore query errors
+        }
+        try {
+            const ownerDocument = root instanceof Document
+                ? root
+                : (root.host?.ownerDocument ?? document);
+            const walker = ownerDocument.createTreeWalker(root, NodeFilter.SHOW_ELEMENT);
+            let node;
+            while ((node = walker.nextNode())) {
+                if (!(node instanceof Element))
+                    continue;
+                const open = node.shadowRoot;
+                if (open)
+                    queue.push(open);
+                const closed = getClosedRoot(node);
+                if (closed)
+                    queue.push(closed);
+            }
+        }
+        catch {
+            // ignore traversal issues
+        }
+    };
+    while (queue.length && results.length < targetIndex + 1) {
+        const next = queue.shift();
+        if (next)
+            visit(next);
+    }
+    return results[targetIndex] ?? null;
+}
+export function resolveTextSelector(rawNeedle, targetIndexRaw) {
+    const needle = String(rawNeedle ?? "");
+    if (!needle)
+        return null;
+    const needleLc = needle.toLowerCase();
+    const targetIndex = parseTargetIndex(targetIndexRaw);
+    const skipTags = new Set([
+        "SCRIPT",
+        "STYLE",
+        "TEMPLATE",
+        "NOSCRIPT",
+        "HEAD",
+        "TITLE",
+        "LINK",
+        "META",
+        "HTML",
+        "BODY",
+    ]);
+    const shouldSkip = (node) => {
+        if (!node)
+            return false;
+        const tag = node.tagName?.toUpperCase() ?? "";
+        return skipTags.has(tag);
+    };
+    const extractText = (node) => {
+        try {
+            if (shouldSkip(node))
+                return "";
+            const inner = node.innerText;
+            if (typeof inner === "string" && inner.trim())
+                return inner.trim();
+        }
+        catch {
+            // ignore
+        }
+        try {
+            const text = node.textContent;
+            if (typeof text === "string")
+                return text.trim();
+        }
+        catch {
+            // ignore
+        }
+        return "";
+    };
+    const matches = (node) => {
+        const text = extractText(node);
+        return !!text && text.toLowerCase().includes(needleLc);
+    };
+    const backdoor = window.__stagehandV3__;
+    const getClosedRoot = backdoor && typeof backdoor.getClosedRoot === "function"
+        ? (host) => {
+            try {
+                return backdoor.getClosedRoot(host) ?? null;
+            }
+            catch {
+                return null;
+            }
+        }
+        : (host) => {
+            void host;
+            return null;
+        };
+    const seen = new WeakSet();
+    const queue = [];
+    const matchesList = [];
+    const enqueue = (node) => {
+        if (!node || seen.has(node))
+            return;
+        seen.add(node);
+        queue.push(node);
+    };
+    const walkerFor = (root) => {
+        try {
+            const doc = root instanceof Document
+                ? root
+                : (root?.ownerDocument ?? document);
+            return doc.createTreeWalker(root, NodeFilter.SHOW_ELEMENT);
+        }
+        catch {
+            return null;
+        }
+    };
+    enqueue(document);
+    while (queue.length) {
+        const root = queue.shift();
+        if (!root)
+            continue;
+        if (root instanceof Element && matches(root)) {
+            matchesList.push({
+                element: root,
+                tag: root.tagName ?? "",
+                id: root.id ?? "",
+                className: root.className ?? "",
+                text: extractText(root),
+            });
+        }
+        const walker = walkerFor(root);
+        if (!walker)
+            continue;
+        let node;
+        while ((node = walker.nextNode())) {
+            if (!(node instanceof Element))
+                continue;
+            if (matches(node)) {
+                matchesList.push({
+                    element: node,
+                    tag: node.tagName ?? "",
+                    id: node.id ?? "",
+                    className: node.className ?? "",
+                    text: extractText(node),
+                });
+            }
+            const open = node.shadowRoot;
+            if (open)
+                enqueue(open);
+            const closed = getClosedRoot(node);
+            if (closed)
+                enqueue(closed);
+        }
+    }
+    const innermost = [];
+    for (const item of matchesList) {
+        const el = item.element;
+        let skip = false;
+        for (const other of matchesList) {
+            if (item === other)
+                continue;
+            try {
+                if (el.contains(other.element)) {
+                    skip = true;
+                    break;
+                }
+            }
+            catch {
+                // ignore containment errors
+            }
+        }
+        if (!skip) {
+            innermost.push(item);
+        }
+    }
+    const target = innermost[targetIndex];
+    return target?.element ?? null;
+}
+export function resolveXPathMainWorld(rawXp, targetIndexRaw) {
+    const targetIndex = parseTargetIndex(targetIndexRaw);
+    return resolveXPathAtIndex(rawXp, targetIndex, { pierceShadow: true });
+}
+//# sourceMappingURL=selectors.js.map

package/dist/esm/lib/v3/dom/locatorScripts/selectors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selectors.js","sourceRoot":"","sources":["../../../../../../lib/v3/dom/locatorScripts/selectors.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAEzD,MAAM,gBAAgB,GAAG,CAAC,KAAc,EAAU,EAAE;IAClD,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;IAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,QAAgB,EAAE,KAAa,EAAa,EAAE;IACvE,IAAI,CAAC,QAAQ;QAAE,OAAO,EAAE,CAAC;IACzB,MAAM,SAAS,GAAG,IAAI,OAAO,EAAQ,CAAC;IACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAW,CAAC;IACxC,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAiC,CAAC,QAAQ,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,CAAC,IAA2B,EAAQ,EAAE;QAClD,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK;YAAE,OAAO;QACpE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEpB,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YAChD,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;gBAC9B,IAAI,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS;gBACxC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC1B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtB,IAAI,OAAO,CAAC,MAAM,IAAI,KAAK;oBAAE,OAAO;YACtC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,iCAAiC;QACnC,CAAC;QAED,IAAI,CAAC;YACH,MAAM,aAAa,GACjB,IAAI,YAAY,QAAQ;gBACtB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,aAAa,IAAI,QAAQ,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,gBAAgB,CAC3C,IAAI,EACJ,UAAU,CAAC,YAAY,CACxB,CAAC;YACF,IAAI,IAAiB,CAAC;YACtB,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,CAAC,IAAI,YAAY,OAAO,CAAC;oBAAE,SAAS;gBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;gBAC7B,IAAI,IAAI;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,UAAU,kBAAkB,CAChC,WAAmB,EACnB,cAAuB;IAEvB,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAClD,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAE3B,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;IAC7D,OAAO,OAAO,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC;AACtC,CAAC;AAED,MAAM,UAAU,wBAAwB,CACtC,WAAmB,EACnB,cAAuB;IAEvB,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAClD,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAE3B,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,CAAC,CAAC;IACrD,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC;IACxC,IAAI,CAAC,QAAQ,IAAI,OAAO,QAAQ,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;QAC9D,MAAM,OAAO,GAAG,iBAAiB,CAAC,QAAQ,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;QAC7D,OAAO,OAAO,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC;IACtC,CAAC;IAED,MAAM,aAAa,GAAyC,CAC1D,IAAa,EACb,EAAE;QACF,IAAI,CAAC;YACH,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;QAC9C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,IAAI,OAAO,EAAQ,CAAC;IACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAW,CAAC;IACxC,MAAM,OAAO,GAAc,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAiC,CAAC,QAAQ,CAAC,CAAC;IAEvD,MAAM,KAAK,GAAG,CAAC,IAA2B,EAAQ,EAAE;QAClD,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM,IAAI,WAAW,GAAG,CAAC;YACnE,OAAO;QACT,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEpB,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YAChD,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE,CAAC;gBAC9B,IAAI,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS;gBACxC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAC1B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtB,IAAI,OAAO,CAAC,MAAM,IAAI,WAAW,GAAG,CAAC;oBAAE,OAAO;YAChD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,sBAAsB;QACxB,CAAC;QAED,IAAI,CAAC;YACH,MAAM,aAAa,GACjB,IAAI,YAAY,QAAQ;gBACtB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,aAAa,IAAI,QAAQ,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,gBAAgB,CAC3C,IAAI,EACJ,UAAU,CAAC,YAAY,CACxB,CAAC;YACF,IAAI,IAAiB,CAAC;YACtB,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,CAAC,IAAI,YAAY,OAAO,CAAC;oBAAE,SAAS;gBACzC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;gBAC7B,IAAI,IAAI;oBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC3B,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;gBACnC,IAAI,MAAM;oBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,KAAK,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,WAAW,GAAG,CAAC,EAAE,CAAC;QACxD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,OAAO,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC;AACtC,CAAC;AAED,MAAM,UAAU,mBAAmB,CACjC,SAAiB,EACjB,cAAuB;IAEvB,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IACvC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACtC,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,CAAC,CAAC;IAErD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC;QACvB,QAAQ;QACR,OAAO;QACP,UAAU;QACV,UAAU;QACV,MAAM;QACN,OAAO;QACP,MAAM;QACN,MAAM;QACN,MAAM;QACN,MAAM;KACP,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,CAAC,IAAgC,EAAW,EAAE;QAC/D,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QAC9C,OAAO,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC,CAAC;IAEF,MAAM,WAAW,GAAG,CAAC,IAAa,EAAU,EAAE;QAC5C,IAAI,CAAC;YACH,IAAI,UAAU,CAAC,IAAI,CAAC;gBAAE,OAAO,EAAE,CAAC;YAChC,MAAM,KAAK,GAAI,IAAoB,CAAC,SAAS,CAAC;YAC9C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE;gBAAE,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;QACrE,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QACD,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;YAC9B,IAAI,OAAO,IAAI,KAAK,QAAQ;gBAAE,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;QACnD,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,IAAa,EAAW,EAAE;QACzC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC;IACxC,MAAM,aAAa,GACjB,QAAQ,IAAI,OAAO,QAAQ,CAAC,aAAa,KAAK,UAAU;QACtD,CAAC,CAAC,CAAC,IAAa,EAAqB,EAAE;YACnC,IAAI,CAAC;gBACH,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;YAC9C,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACH,CAAC,CAAC,CAAC,IAAa,EAAqB,EAAE;YACnC,KAAK,IAAI,CAAC;YACV,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;IAER,MAAM,IAAI,GAAG,IAAI,OAAO,EAAQ,CAAC;IACjC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,WAAW,GAMZ,EAAE,CAAC;IAER,MAAM,OAAO,GAAG,CAAC,IAA6B,EAAE,EAAE;QAChD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QACpC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC,CAAC;IAEF,MAAM,SAAS,GAAG,CAAC,IAAU,EAAqB,EAAE;QAClD,IAAI,CAAC;YACH,MAAM,GAAG,GACP,IAAI,YAAY,QAAQ;gBACtB,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,CAAE,IAAgB,EAAE,aAAa,IAAI,QAAQ,CAAC,CAAC;YACrD,OAAO,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,UAAU,CAAC,YAAY,CAAC,CAAC;QAC7D,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC,CAAC;IAEF,OAAO,CAAC,QAAQ,CAAC,CAAC;IAElB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,IAAI,IAAI,YAAY,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,WAAW,CAAC,IAAI,CAAC;gBACf,OAAO,EAAE,IAAI;gBACb,GAAG,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE;gBACvB,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;gBACjB,SAAS,EAAG,IAAoB,CAAC,SAAS,IAAI,EAAE;gBAChD,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC;aACxB,CAAC,CAAC;QACL,CAAC;QAED,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,MAAM;YAAE,SAAS;QAEtB,IAAI,IAAiB,CAAC;QACtB,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,CAAC,IAAI,YAAY,OAAO,CAAC;gBAAE,SAAS;YAEzC,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClB,WAAW,CAAC,IAAI,CAAC;oBACf,OAAO,EAAE,IAAI;oBACb,GAAG,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE;oBACvB,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;oBACjB,SAAS,EAAG,IAAoB,CAAC,SAAS,IAAI,EAAE;oBAChD,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC;iBACxB,CAAC,CAAC;YACL,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC7B,IAAI,IAAI;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,MAAM;gBAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAuB,EAAE,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC;QACxB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,IAAI,IAAI,KAAK,KAAK;gBAAE,SAAS;YAC7B,IAAI,CAAC;gBACH,IAAI,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC/B,IAAI,GAAG,IAAI,CAAC;oBACZ,MAAM;gBACR,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,4BAA4B;YAC9B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC;IACtC,OAAO,MAAM,EAAE,OAAO,IAAI,IAAI,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,qBAAqB,CACnC,KAAa,EACb,cAAuB;IAEvB,MAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,CAAC,CAAC;IACrD,OAAO,mBAAmB,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;AACzE,CAAC","sourcesContent":["import { resolveXPathAtIndex } from \"./xpathResolver.js\";\n\nconst parseTargetIndex = (value: unknown): number => {\n  const num = Number(value ?? 0);\n  if (!Number.isFinite(num) || num < 0) return 0;\n  return Math.floor(num);\n};\n\nconst collectCssMatches = (selector: string, limit: number): Element[] => {\n  if (!selector) return [];\n  const seenRoots = new WeakSet<Node>();\n  const seenElements = new Set<Element>();\n  const results: Element[] = [];\n  const queue: Array<Document | ShadowRoot> = [document];\n\n  const visit = (root: Document | ShadowRoot): void => {\n    if (!root || seenRoots.has(root) || results.length >= limit) return;\n    seenRoots.add(root);\n\n    try {\n      const matches = root.querySelectorAll(selector);\n      for (const element of matches) {\n        if (seenElements.has(element)) continue;\n        seenElements.add(element);\n        results.push(element);\n        if (results.length >= limit) return;\n      }\n    } catch {\n      // ignore querySelectorAll issues\n    }\n\n    try {\n      const ownerDocument =\n        root instanceof Document\n          ? root\n          : (root.host?.ownerDocument ?? document);\n      const walker = ownerDocument.createTreeWalker(\n        root,\n        NodeFilter.SHOW_ELEMENT,\n      );\n      let node: Node | null;\n      while ((node = walker.nextNode())) {\n        if (!(node instanceof Element)) continue;\n        const open = node.shadowRoot;\n        if (open) queue.push(open);\n      }\n    } catch {\n      // ignore traversal issues\n    }\n  };\n\n  while (queue.length && results.length < limit) {\n    const next = queue.shift();\n    if (next) visit(next);\n  }\n\n  return results;\n};\n\nexport function resolveCssSelector(\n  selectorRaw: string,\n  targetIndexRaw?: number,\n): Element | null {\n  const selector = String(selectorRaw ?? \"\").trim();\n  if (!selector) return null;\n\n  const targetIndex = parseTargetIndex(targetIndexRaw);\n  const matches = collectCssMatches(selector, targetIndex + 1);\n  return matches[targetIndex] ?? null;\n}\n\nexport function resolveCssSelectorPierce(\n  selectorRaw: string,\n  targetIndexRaw?: number,\n): Element | null {\n  const selector = String(selectorRaw ?? \"\").trim();\n  if (!selector) return null;\n\n  const targetIndex = parseTargetIndex(targetIndexRaw);\n  const backdoor = window.__stagehandV3__;\n  if (!backdoor || typeof backdoor.getClosedRoot !== \"function\") {\n    const matches = collectCssMatches(selector, targetIndex + 1);\n    return matches[targetIndex] ?? null;\n  }\n\n  const getClosedRoot: (host: Element) => ShadowRoot | null = (\n    host: Element,\n  ) => {\n    try {\n      return backdoor.getClosedRoot(host) ?? null;\n    } catch {\n      return null;\n    }\n  };\n\n  const seenRoots = new WeakSet<Node>();\n  const seenElements = new Set<Element>();\n  const results: Element[] = [];\n  const queue: Array<Document | ShadowRoot> = [document];\n\n  const visit = (root: Document | ShadowRoot): void => {\n    if (!root || seenRoots.has(root) || results.length >= targetIndex + 1)\n      return;\n    seenRoots.add(root);\n\n    try {\n      const matches = root.querySelectorAll(selector);\n      for (const element of matches) {\n        if (seenElements.has(element)) continue;\n        seenElements.add(element);\n        results.push(element);\n        if (results.length >= targetIndex + 1) return;\n      }\n    } catch {\n      // ignore query errors\n    }\n\n    try {\n      const ownerDocument =\n        root instanceof Document\n          ? root\n          : (root.host?.ownerDocument ?? document);\n      const walker = ownerDocument.createTreeWalker(\n        root,\n        NodeFilter.SHOW_ELEMENT,\n      );\n      let node: Node | null;\n      while ((node = walker.nextNode())) {\n        if (!(node instanceof Element)) continue;\n        const open = node.shadowRoot;\n        if (open) queue.push(open);\n        const closed = getClosedRoot(node);\n        if (closed) queue.push(closed);\n      }\n    } catch {\n      // ignore traversal issues\n    }\n  };\n\n  while (queue.length && results.length < targetIndex + 1) {\n    const next = queue.shift();\n    if (next) visit(next);\n  }\n\n  return results[targetIndex] ?? null;\n}\n\nexport function resolveTextSelector(\n  rawNeedle: string,\n  targetIndexRaw?: number,\n): Element | null {\n  const needle = String(rawNeedle ?? \"\");\n  if (!needle) return null;\n  const needleLc = needle.toLowerCase();\n  const targetIndex = parseTargetIndex(targetIndexRaw);\n\n  const skipTags = new Set([\n    \"SCRIPT\",\n    \"STYLE\",\n    \"TEMPLATE\",\n    \"NOSCRIPT\",\n    \"HEAD\",\n    \"TITLE\",\n    \"LINK\",\n    \"META\",\n    \"HTML\",\n    \"BODY\",\n  ]);\n\n  const shouldSkip = (node: Element | null | undefined): boolean => {\n    if (!node) return false;\n    const tag = node.tagName?.toUpperCase() ?? \"\";\n    return skipTags.has(tag);\n  };\n\n  const extractText = (node: Element): string => {\n    try {\n      if (shouldSkip(node)) return \"\";\n      const inner = (node as HTMLElement).innerText;\n      if (typeof inner === \"string\" && inner.trim()) return inner.trim();\n    } catch {\n      // ignore\n    }\n    try {\n      const text = node.textContent;\n      if (typeof text === \"string\") return text.trim();\n    } catch {\n      // ignore\n    }\n    return \"\";\n  };\n\n  const matches = (node: Element): boolean => {\n    const text = extractText(node);\n    return !!text && text.toLowerCase().includes(needleLc);\n  };\n\n  const backdoor = window.__stagehandV3__;\n  const getClosedRoot: (host: Element) => ShadowRoot | null =\n    backdoor && typeof backdoor.getClosedRoot === \"function\"\n      ? (host: Element): ShadowRoot | null => {\n          try {\n            return backdoor.getClosedRoot(host) ?? null;\n          } catch {\n            return null;\n          }\n        }\n      : (host: Element): ShadowRoot | null => {\n          void host;\n          return null;\n        };\n\n  const seen = new WeakSet<Node>();\n  const queue: Node[] = [];\n  const matchesList: Array<{\n    element: Element;\n    tag: string;\n    id: string;\n    className: string;\n    text: string;\n  }> = [];\n\n  const enqueue = (node: Node | null | undefined) => {\n    if (!node || seen.has(node)) return;\n    seen.add(node);\n    queue.push(node);\n  };\n\n  const walkerFor = (root: Node): TreeWalker | null => {\n    try {\n      const doc =\n        root instanceof Document\n          ? root\n          : ((root as Element)?.ownerDocument ?? document);\n      return doc.createTreeWalker(root, NodeFilter.SHOW_ELEMENT);\n    } catch {\n      return null;\n    }\n  };\n\n  enqueue(document);\n\n  while (queue.length) {\n    const root = queue.shift();\n    if (!root) continue;\n\n    if (root instanceof Element && matches(root)) {\n      matchesList.push({\n        element: root,\n        tag: root.tagName ?? \"\",\n        id: root.id ?? \"\",\n        className: (root as HTMLElement).className ?? \"\",\n        text: extractText(root),\n      });\n    }\n\n    const walker = walkerFor(root);\n    if (!walker) continue;\n\n    let node: Node | null;\n    while ((node = walker.nextNode())) {\n      if (!(node instanceof Element)) continue;\n\n      if (matches(node)) {\n        matchesList.push({\n          element: node,\n          tag: node.tagName ?? \"\",\n          id: node.id ?? \"\",\n          className: (node as HTMLElement).className ?? \"\",\n          text: extractText(node),\n        });\n      }\n\n      const open = node.shadowRoot;\n      if (open) enqueue(open);\n\n      const closed = getClosedRoot(node);\n      if (closed) enqueue(closed);\n    }\n  }\n\n  const innermost: typeof matchesList = [];\n  for (const item of matchesList) {\n    const el = item.element;\n    let skip = false;\n    for (const other of matchesList) {\n      if (item === other) continue;\n      try {\n        if (el.contains(other.element)) {\n          skip = true;\n          break;\n        }\n      } catch {\n        // ignore containment errors\n      }\n    }\n    if (!skip) {\n      innermost.push(item);\n    }\n  }\n\n  const target = innermost[targetIndex];\n  return target?.element ?? null;\n}\n\nexport function resolveXPathMainWorld(\n  rawXp: string,\n  targetIndexRaw?: number,\n): Element | null {\n  const targetIndex = parseTargetIndex(targetIndexRaw);\n  return resolveXPathAtIndex(rawXp, targetIndex, { pierceShadow: true });\n}\n"]}

package/dist/esm/lib/v3/dom/locatorScripts/waitForSelector.d.ts

@@ -0,0 +1,19 @@
+/**
+ * waitForSelector - Waits for an element matching a selector to reach a specific state.
+ * Supports both CSS selectors and XPath expressions.
+ * Uses MutationObserver for efficiency and integrates with the V3 piercer for closed shadow roots.
+ *
+ * NOTE: This function runs inside the page context. Keep it dependency-free
+ * and resilient to exceptions.
+ */
+/**
+ * Wait for an element matching the selector to reach the specified state.
+ * Supports both CSS selectors and XPath expressions (prefix with "xpath=" or start with "/").
+ *
+ * @param selectorRaw - CSS selector or XPath expression to wait for
+ * @param stateRaw - Element state: 'attached' | 'detached' | 'visible' | 'hidden'
+ * @param timeoutRaw - Maximum time to wait in milliseconds
+ * @param pierceShadowRaw - Whether to search inside shadow DOM
+ * @returns Promise that resolves to true when condition is met, or rejects on timeout
+ */
+export declare function waitForSelector(selectorRaw: string, stateRaw?: string, timeoutRaw?: number, pierceShadowRaw?: boolean): Promise<boolean>;

package/dist/esm/lib/v3/dom/locatorScripts/waitForSelector.js

@@ -0,0 +1,283 @@
+/**
+ * waitForSelector - Waits for an element matching a selector to reach a specific state.
+ * Supports both CSS selectors and XPath expressions.
+ * Uses MutationObserver for efficiency and integrates with the V3 piercer for closed shadow roots.
+ *
+ * NOTE: This function runs inside the page context. Keep it dependency-free
+ * and resilient to exceptions.
+ */
+import { resolveXPathFirst } from "./xpathResolver.js";
+/**
+ * Check if a selector is an XPath expression.
+ */
+const isXPath = (selector) => {
+    return selector.startsWith("xpath=") || selector.startsWith("/");
+};
+/**
+ * Get closed shadow root via the V3 piercer if available.
+ */
+const getClosedRoot = (element) => {
+    try {
+        const backdoor = window.__stagehandV3__;
+        if (backdoor && typeof backdoor.getClosedRoot === "function") {
+            return backdoor.getClosedRoot(element) ?? null;
+        }
+    }
+    catch {
+        // ignore
+    }
+    return null;
+};
+/**
+ * Get shadow root (open or closed via piercer).
+ */
+const getShadowRoot = (element) => {
+    // First try open shadow root
+    if (element.shadowRoot)
+        return element.shadowRoot;
+    // Then try closed shadow root via piercer
+    return getClosedRoot(element);
+};
+/**
+ * Deep querySelector that pierces shadow DOM (both open and closed via piercer).
+ */
+const deepQuerySelector = (root, selector, pierceShadow) => {
+    // Try regular querySelector first
+    try {
+        const el = root.querySelector(selector);
+        if (el)
+            return el;
+    }
+    catch {
+        // ignore query errors
+    }
+    if (!pierceShadow)
+        return null;
+    // BFS queue to search all shadow roots (open and closed)
+    const seenRoots = new WeakSet();
+    const queue = [root];
+    while (queue.length > 0) {
+        const currentRoot = queue.shift();
+        if (!currentRoot || seenRoots.has(currentRoot))
+            continue;
+        seenRoots.add(currentRoot);
+        // Try querySelector on this root
+        try {
+            const found = currentRoot.querySelector(selector);
+            if (found)
+                return found;
+        }
+        catch {
+            // ignore query errors
+        }
+        // Walk all elements in this root to find shadow hosts
+        try {
+            const ownerDoc = currentRoot instanceof Document
+                ? currentRoot
+                : (currentRoot.host?.ownerDocument ?? document);
+            const walker = ownerDoc.createTreeWalker(currentRoot, NodeFilter.SHOW_ELEMENT);
+            let node;
+            while ((node = walker.nextNode())) {
+                if (!(node instanceof Element))
+                    continue;
+                const shadowRoot = getShadowRoot(node);
+                if (shadowRoot && !seenRoots.has(shadowRoot)) {
+                    queue.push(shadowRoot);
+                }
+            }
+        }
+        catch {
+            // ignore traversal errors
+        }
+    }
+    return null;
+};
+/**
+ * Resolve XPath with shadow DOM piercing support.
+ */
+const deepXPathQuery = (xpath, pierceShadow) => {
+    return resolveXPathFirst(xpath, { pierceShadow });
+};
+/**
+ * Find element by selector (CSS or XPath) with optional shadow DOM piercing.
+ */
+const findElement = (selector, pierceShadow) => {
+    if (isXPath(selector)) {
+        return deepXPathQuery(selector, pierceShadow);
+    }
+    return deepQuerySelector(document, selector, pierceShadow);
+};
+/**
+ * Check if element matches the desired state.
+ */
+const checkState = (el, state) => {
+    if (state === "detached")
+        return el === null;
+    if (state === "attached")
+        return el !== null;
+    if (el === null)
+        return false;
+    if (state === "hidden") {
+        try {
+            const style = window.getComputedStyle(el);
+            const rect = el.getBoundingClientRect();
+            return (style.display === "none" ||
+                style.visibility === "hidden" ||
+                style.opacity === "0" ||
+                rect.width === 0 ||
+                rect.height === 0);
+        }
+        catch {
+            return false;
+        }
+    }
+    // state === "visible"
+    try {
+        const style = window.getComputedStyle(el);
+        const rect = el.getBoundingClientRect();
+        return (style.display !== "none" &&
+            style.visibility !== "hidden" &&
+            style.opacity !== "0" &&
+            rect.width > 0 &&
+            rect.height > 0);
+    }
+    catch {
+        return false;
+    }
+};
+/**
+ * Set up MutationObservers on all shadow roots to detect changes.
+ */
+const setupShadowObservers = (callback, observers) => {
+    const seenRoots = new WeakSet();
+    const observeShadowRoots = (node) => {
+        const shadowRoot = getShadowRoot(node);
+        if (shadowRoot && !seenRoots.has(shadowRoot)) {
+            seenRoots.add(shadowRoot);
+            const shadowObserver = new MutationObserver(callback);
+            shadowObserver.observe(shadowRoot, {
+                childList: true,
+                subtree: true,
+                attributes: true,
+                attributeFilter: ["style", "class", "hidden", "disabled"],
+            });
+            observers.push(shadowObserver);
+            // Recurse into shadow root children
+            for (const child of Array.from(shadowRoot.children)) {
+                observeShadowRoots(child);
+            }
+        }
+        // Recurse into regular children
+        for (const child of Array.from(node.children)) {
+            observeShadowRoots(child);
+        }
+    };
+    const root = document.documentElement || document.body;
+    if (root) {
+        observeShadowRoots(root);
+    }
+};
+/**
+ * Wait for an element matching the selector to reach the specified state.
+ * Supports both CSS selectors and XPath expressions (prefix with "xpath=" or start with "/").
+ *
+ * @param selectorRaw - CSS selector or XPath expression to wait for
+ * @param stateRaw - Element state: 'attached' | 'detached' | 'visible' | 'hidden'
+ * @param timeoutRaw - Maximum time to wait in milliseconds
+ * @param pierceShadowRaw - Whether to search inside shadow DOM
+ * @returns Promise that resolves to true when condition is met, or rejects on timeout
+ */
+export function waitForSelector(selectorRaw, stateRaw, timeoutRaw, pierceShadowRaw) {
+    const selector = String(selectorRaw ?? "").trim();
+    const state = String(stateRaw ?? "visible") || "visible";
+    const timeout = typeof timeoutRaw === "number" && timeoutRaw > 0 ? timeoutRaw : 30000;
+    const pierceShadow = pierceShadowRaw !== false;
+    return new Promise((resolve, reject) => {
+        let timeoutId = null;
+        let domReadyHandler = null;
+        let settled = false;
+        const clearTimer = () => {
+            if (timeoutId !== null) {
+                clearTimeout(timeoutId);
+                timeoutId = null;
+            }
+        };
+        // Check immediately
+        const el = findElement(selector, pierceShadow);
+        if (checkState(el, state)) {
+            settled = true;
+            resolve(true);
+            return;
+        }
+        const observers = [];
+        const cleanup = () => {
+            for (const obs of observers) {
+                obs.disconnect();
+            }
+            if (domReadyHandler) {
+                document.removeEventListener("DOMContentLoaded", domReadyHandler);
+                domReadyHandler = null;
+            }
+        };
+        const check = () => {
+            if (settled)
+                return;
+            const el = findElement(selector, pierceShadow);
+            if (checkState(el, state)) {
+                settled = true;
+                clearTimer();
+                cleanup();
+                resolve(true);
+            }
+        };
+        // Handle case where document.body is not ready yet
+        const observeRoot = document.body || document.documentElement;
+        if (!observeRoot) {
+            domReadyHandler = () => {
+                document.removeEventListener("DOMContentLoaded", domReadyHandler);
+                domReadyHandler = null;
+                check();
+                setupObservers();
+            };
+            document.addEventListener("DOMContentLoaded", domReadyHandler);
+            timeoutId = setTimeout(() => {
+                if (settled)
+                    return;
+                settled = true;
+                clearTimer();
+                cleanup();
+                reject(new Error(`waitForSelector: Timeout ${timeout}ms exceeded waiting for "${selector}" to be ${state}`));
+            }, timeout);
+            return;
+        }
+        const setupObservers = () => {
+            const root = document.body || document.documentElement;
+            if (!root)
+                return;
+            // Main document observer
+            const mainObserver = new MutationObserver(check);
+            mainObserver.observe(root, {
+                childList: true,
+                subtree: true,
+                attributes: true,
+                attributeFilter: ["style", "class", "hidden", "disabled"],
+            });
+            observers.push(mainObserver);
+            // Shadow DOM observers (if piercing)
+            if (pierceShadow) {
+                setupShadowObservers(check, observers);
+            }
+        };
+        setupObservers();
+        // Set up timeout
+        timeoutId = setTimeout(() => {
+            if (settled)
+                return;
+            settled = true;
+            clearTimer();
+            cleanup();
+            reject(new Error(`waitForSelector: Timeout ${timeout}ms exceeded waiting for "${selector}" to be ${state}`));
+        }, timeout);
+    });
+}
+//# sourceMappingURL=waitForSelector.js.map

package/dist/esm/lib/v3/dom/locatorScripts/waitForSelector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"waitForSelector.js","sourceRoot":"","sources":["../../../../../../lib/v3/dom/locatorScripts/waitForSelector.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAIvD;;GAEG;AACH,MAAM,OAAO,GAAG,CAAC,QAAgB,EAAW,EAAE;IAC5C,OAAO,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AACnE,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,aAAa,GAAG,CAAC,OAAgB,EAAqB,EAAE;IAC5D,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC;QACxC,IAAI,QAAQ,IAAI,OAAO,QAAQ,CAAC,aAAa,KAAK,UAAU,EAAE,CAAC;YAC7D,OAAO,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;QACjD,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,SAAS;IACX,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,aAAa,GAAG,CAAC,OAAgB,EAAqB,EAAE;IAC5D,6BAA6B;IAC7B,IAAI,OAAO,CAAC,UAAU;QAAE,OAAO,OAAO,CAAC,UAAU,CAAC;IAClD,0CAA0C;IAC1C,OAAO,aAAa,CAAC,OAAO,CAAC,CAAC;AAChC,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,iBAAiB,GAAG,CACxB,IAA2B,EAC3B,QAAgB,EAChB,YAAqB,EACL,EAAE;IAClB,kCAAkC;IAClC,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QACxC,IAAI,EAAE;YAAE,OAAO,EAAE,CAAC;IACpB,CAAC;IAAC,MAAM,CAAC;QACP,sBAAsB;IACxB,CAAC;IAED,IAAI,CAAC,YAAY;QAAE,OAAO,IAAI,CAAC;IAE/B,yDAAyD;IACzD,MAAM,SAAS,GAAG,IAAI,OAAO,EAAQ,CAAC;IACtC,MAAM,KAAK,GAAiC,CAAC,IAAI,CAAC,CAAC;IAEnD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,CAAC,WAAW,IAAI,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC;YAAE,SAAS;QACzD,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE3B,iCAAiC;QACjC,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,WAAW,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAClD,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,sBAAsB;QACxB,CAAC;QAED,sDAAsD;QACtD,IAAI,CAAC;YACH,MAAM,QAAQ,GACZ,WAAW,YAAY,QAAQ;gBAC7B,CAAC,CAAC,WAAW;gBACb,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,IAAI,QAAQ,CAAC,CAAC;YACpD,MAAM,MAAM,GAAG,QAAQ,CAAC,gBAAgB,CACtC,WAAW,EACX,UAAU,CAAC,YAAY,CACxB,CAAC;YACF,IAAI,IAAiB,CAAC;YACtB,OAAO,CAAC,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,CAAC,IAAI,YAAY,OAAO,CAAC;oBAAE,SAAS;gBACzC,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;gBACvC,IAAI,UAAU,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7C,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,cAAc,GAAG,CACrB,KAAa,EACb,YAAqB,EACL,EAAE;IAClB,OAAO,iBAAiB,CAAC,KAAK,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;AACpD,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,WAAW,GAAG,CAClB,QAAgB,EAChB,YAAqB,EACL,EAAE;IAClB,IAAI,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACtB,OAAO,cAAc,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;AAC7D,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,GAAG,CACjB,EAAkB,EAClB,KAA2B,EAClB,EAAE;IACX,IAAI,KAAK,KAAK,UAAU;QAAE,OAAO,EAAE,KAAK,IAAI,CAAC;IAC7C,IAAI,KAAK,KAAK,UAAU;QAAE,OAAO,EAAE,KAAK,IAAI,CAAC;IAC7C,IAAI,EAAE,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAE9B,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvB,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,qBAAqB,EAAE,CAAC;YACxC,OAAO,CACL,KAAK,CAAC,OAAO,KAAK,MAAM;gBACxB,KAAK,CAAC,UAAU,KAAK,QAAQ;gBAC7B,KAAK,CAAC,OAAO,KAAK,GAAG;gBACrB,IAAI,CAAC,KAAK,KAAK,CAAC;gBAChB,IAAI,CAAC,MAAM,KAAK,CAAC,CAClB,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,MAAM,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,qBAAqB,EAAE,CAAC;QACxC,OAAO,CACL,KAAK,CAAC,OAAO,KAAK,MAAM;YACxB,KAAK,CAAC,UAAU,KAAK,QAAQ;YAC7B,KAAK,CAAC,OAAO,KAAK,GAAG;YACrB,IAAI,CAAC,KAAK,GAAG,CAAC;YACd,IAAI,CAAC,MAAM,GAAG,CAAC,CAChB,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,oBAAoB,GAAG,CAC3B,QAAoB,EACpB,SAA6B,EACvB,EAAE;IACR,MAAM,SAAS,GAAG,IAAI,OAAO,EAAQ,CAAC;IAEtC,MAAM,kBAAkB,GAAG,CAAC,IAAa,EAAQ,EAAE;QACjD,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,UAAU,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC7C,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC1B,MAAM,cAAc,GAAG,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YACtD,cAAc,CAAC,OAAO,CAAC,UAAU,EAAE;gBACjC,SAAS,EAAE,IAAI;gBACf,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,IAAI;gBAChB,eAAe,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC;aAC1D,CAAC,CAAC;YACH,SAAS,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAE/B,oCAAoC;YACpC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpD,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9C,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,QAAQ,CAAC,eAAe,IAAI,QAAQ,CAAC,IAAI,CAAC;IACvD,IAAI,IAAI,EAAE,CAAC;QACT,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAC7B,WAAmB,EACnB,QAAiB,EACjB,UAAmB,EACnB,eAAyB;IAEzB,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IAClD,MAAM,KAAK,GACR,MAAM,CAAC,QAAQ,IAAI,SAAS,CAA0B,IAAI,SAAS,CAAC;IACvE,MAAM,OAAO,GACX,OAAO,UAAU,KAAK,QAAQ,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC;IACxE,MAAM,YAAY,GAAG,eAAe,KAAK,KAAK,CAAC;IAE/C,OAAO,IAAI,OAAO,CAAU,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QAC9C,IAAI,SAAS,GAAyC,IAAI,CAAC;QAC3D,IAAI,eAAe,GAAwB,IAAI,CAAC;QAChD,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,MAAM,UAAU,GAAG,GAAS,EAAE;YAC5B,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;gBACvB,YAAY,CAAC,SAAS,CAAC,CAAC;gBACxB,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;QACH,CAAC,CAAC;QAEF,oBAAoB;QACpB,MAAM,EAAE,GAAG,WAAW,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;QAC/C,IAAI,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,GAAG,IAAI,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,CAAC;YACd,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAuB,EAAE,CAAC;QAEzC,MAAM,OAAO,GAAG,GAAS,EAAE;YACzB,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;gBAC5B,GAAG,CAAC,UAAU,EAAE,CAAC;YACnB,CAAC;YACD,IAAI,eAAe,EAAE,CAAC;gBACpB,QAAQ,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,eAAe,CAAC,CAAC;gBAClE,eAAe,GAAG,IAAI,CAAC;YACzB,CAAC;QACH,CAAC,CAAC;QAEF,MAAM,KAAK,GAAG,GAAS,EAAE;YACvB,IAAI,OAAO;gBAAE,OAAO;YACpB,MAAM,EAAE,GAAG,WAAW,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YAC/C,IAAI,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,GAAG,IAAI,CAAC;gBACf,UAAU,EAAE,CAAC;gBACb,OAAO,EAAE,CAAC;gBACV,OAAO,CAAC,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC,CAAC;QAEF,mDAAmD;QACnD,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,eAAe,CAAC;QAC9D,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,eAAe,GAAG,GAAS,EAAE;gBAC3B,QAAQ,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,eAAgB,CAAC,CAAC;gBACnE,eAAe,GAAG,IAAI,CAAC;gBACvB,KAAK,EAAE,CAAC;gBACR,cAAc,EAAE,CAAC;YACnB,CAAC,CAAC;YACF,QAAQ,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,eAAe,CAAC,CAAC;YAC/D,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC1B,IAAI,OAAO;oBAAE,OAAO;gBACpB,OAAO,GAAG,IAAI,CAAC;gBACf,UAAU,EAAE,CAAC;gBACb,OAAO,EAAE,CAAC;gBACV,MAAM,CACJ,IAAI,KAAK,CACP,4BAA4B,OAAO,4BAA4B,QAAQ,WAAW,KAAK,EAAE,CAC1F,CACF,CAAC;YACJ,CAAC,EAAE,OAAO,CAAC,CAAC;YACZ,OAAO;QACT,CAAC;QAED,MAAM,cAAc,GAAG,GAAS,EAAE;YAChC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,eAAe,CAAC;YACvD,IAAI,CAAC,IAAI;gBAAE,OAAO;YAElB,yBAAyB;YACzB,MAAM,YAAY,GAAG,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC;YACjD,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE;gBACzB,SAAS,EAAE,IAAI;gBACf,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,IAAI;gBAChB,eAAe,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,CAAC;aAC1D,CAAC,CAAC;YACH,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAE7B,qCAAqC;YACrC,IAAI,YAAY,EAAE,CAAC;gBACjB,oBAAoB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACzC,CAAC;QACH,CAAC,CAAC;QAEF,cAAc,EAAE,CAAC;QAEjB,iBAAiB;QACjB,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;YAC1B,IAAI,OAAO;gBAAE,OAAO;YACpB,OAAO,GAAG,IAAI,CAAC;YACf,UAAU,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;YACV,MAAM,CACJ,IAAI,KAAK,CACP,4BAA4B,OAAO,4BAA4B,QAAQ,WAAW,KAAK,EAAE,CAC1F,CACF,CAAC;QACJ,CAAC,EAAE,OAAO,CAAC,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["/**\n * waitForSelector - Waits for an element matching a selector to reach a specific state.\n * Supports both CSS selectors and XPath expressions.\n * Uses MutationObserver for efficiency and integrates with the V3 piercer for closed shadow roots.\n *\n * NOTE: This function runs inside the page context. Keep it dependency-free\n * and resilient to exceptions.\n */\n\nimport { resolveXPathFirst } from \"./xpathResolver.js\";\n\ntype WaitForSelectorState = \"attached\" | \"detached\" | \"visible\" | \"hidden\";\n\n/**\n * Check if a selector is an XPath expression.\n */\nconst isXPath = (selector: string): boolean => {\n  return selector.startsWith(\"xpath=\") || selector.startsWith(\"/\");\n};\n\n/**\n * Get closed shadow root via the V3 piercer if available.\n */\nconst getClosedRoot = (element: Element): ShadowRoot | null => {\n  try {\n    const backdoor = window.__stagehandV3__;\n    if (backdoor && typeof backdoor.getClosedRoot === \"function\") {\n      return backdoor.getClosedRoot(element) ?? null;\n    }\n  } catch {\n    // ignore\n  }\n  return null;\n};\n\n/**\n * Get shadow root (open or closed via piercer).\n */\nconst getShadowRoot = (element: Element): ShadowRoot | null => {\n  // First try open shadow root\n  if (element.shadowRoot) return element.shadowRoot;\n  // Then try closed shadow root via piercer\n  return getClosedRoot(element);\n};\n\n/**\n * Deep querySelector that pierces shadow DOM (both open and closed via piercer).\n */\nconst deepQuerySelector = (\n  root: Document | ShadowRoot,\n  selector: string,\n  pierceShadow: boolean,\n): Element | null => {\n  // Try regular querySelector first\n  try {\n    const el = root.querySelector(selector);\n    if (el) return el;\n  } catch {\n    // ignore query errors\n  }\n\n  if (!pierceShadow) return null;\n\n  // BFS queue to search all shadow roots (open and closed)\n  const seenRoots = new WeakSet<Node>();\n  const queue: Array<Document | ShadowRoot> = [root];\n\n  while (queue.length > 0) {\n    const currentRoot = queue.shift();\n    if (!currentRoot || seenRoots.has(currentRoot)) continue;\n    seenRoots.add(currentRoot);\n\n    // Try querySelector on this root\n    try {\n      const found = currentRoot.querySelector(selector);\n      if (found) return found;\n    } catch {\n      // ignore query errors\n    }\n\n    // Walk all elements in this root to find shadow hosts\n    try {\n      const ownerDoc =\n        currentRoot instanceof Document\n          ? currentRoot\n          : (currentRoot.host?.ownerDocument ?? document);\n      const walker = ownerDoc.createTreeWalker(\n        currentRoot,\n        NodeFilter.SHOW_ELEMENT,\n      );\n      let node: Node | null;\n      while ((node = walker.nextNode())) {\n        if (!(node instanceof Element)) continue;\n        const shadowRoot = getShadowRoot(node);\n        if (shadowRoot && !seenRoots.has(shadowRoot)) {\n          queue.push(shadowRoot);\n        }\n      }\n    } catch {\n      // ignore traversal errors\n    }\n  }\n\n  return null;\n};\n\n/**\n * Resolve XPath with shadow DOM piercing support.\n */\nconst deepXPathQuery = (\n  xpath: string,\n  pierceShadow: boolean,\n): Element | null => {\n  return resolveXPathFirst(xpath, { pierceShadow });\n};\n\n/**\n * Find element by selector (CSS or XPath) with optional shadow DOM piercing.\n */\nconst findElement = (\n  selector: string,\n  pierceShadow: boolean,\n): Element | null => {\n  if (isXPath(selector)) {\n    return deepXPathQuery(selector, pierceShadow);\n  }\n  return deepQuerySelector(document, selector, pierceShadow);\n};\n\n/**\n * Check if element matches the desired state.\n */\nconst checkState = (\n  el: Element | null,\n  state: WaitForSelectorState,\n): boolean => {\n  if (state === \"detached\") return el === null;\n  if (state === \"attached\") return el !== null;\n  if (el === null) return false;\n\n  if (state === \"hidden\") {\n    try {\n      const style = window.getComputedStyle(el);\n      const rect = el.getBoundingClientRect();\n      return (\n        style.display === \"none\" ||\n        style.visibility === \"hidden\" ||\n        style.opacity === \"0\" ||\n        rect.width === 0 ||\n        rect.height === 0\n      );\n    } catch {\n      return false;\n    }\n  }\n\n  // state === \"visible\"\n  try {\n    const style = window.getComputedStyle(el);\n    const rect = el.getBoundingClientRect();\n    return (\n      style.display !== \"none\" &&\n      style.visibility !== \"hidden\" &&\n      style.opacity !== \"0\" &&\n      rect.width > 0 &&\n      rect.height > 0\n    );\n  } catch {\n    return false;\n  }\n};\n\n/**\n * Set up MutationObservers on all shadow roots to detect changes.\n */\nconst setupShadowObservers = (\n  callback: () => void,\n  observers: MutationObserver[],\n): void => {\n  const seenRoots = new WeakSet<Node>();\n\n  const observeShadowRoots = (node: Element): void => {\n    const shadowRoot = getShadowRoot(node);\n    if (shadowRoot && !seenRoots.has(shadowRoot)) {\n      seenRoots.add(shadowRoot);\n      const shadowObserver = new MutationObserver(callback);\n      shadowObserver.observe(shadowRoot, {\n        childList: true,\n        subtree: true,\n        attributes: true,\n        attributeFilter: [\"style\", \"class\", \"hidden\", \"disabled\"],\n      });\n      observers.push(shadowObserver);\n\n      // Recurse into shadow root children\n      for (const child of Array.from(shadowRoot.children)) {\n        observeShadowRoots(child);\n      }\n    }\n\n    // Recurse into regular children\n    for (const child of Array.from(node.children)) {\n      observeShadowRoots(child);\n    }\n  };\n\n  const root = document.documentElement || document.body;\n  if (root) {\n    observeShadowRoots(root);\n  }\n};\n\n/**\n * Wait for an element matching the selector to reach the specified state.\n * Supports both CSS selectors and XPath expressions (prefix with \"xpath=\" or start with \"/\").\n *\n * @param selectorRaw - CSS selector or XPath expression to wait for\n * @param stateRaw - Element state: 'attached' | 'detached' | 'visible' | 'hidden'\n * @param timeoutRaw - Maximum time to wait in milliseconds\n * @param pierceShadowRaw - Whether to search inside shadow DOM\n * @returns Promise that resolves to true when condition is met, or rejects on timeout\n */\nexport function waitForSelector(\n  selectorRaw: string,\n  stateRaw?: string,\n  timeoutRaw?: number,\n  pierceShadowRaw?: boolean,\n): Promise<boolean> {\n  const selector = String(selectorRaw ?? \"\").trim();\n  const state =\n    (String(stateRaw ?? \"visible\") as WaitForSelectorState) || \"visible\";\n  const timeout =\n    typeof timeoutRaw === \"number\" && timeoutRaw > 0 ? timeoutRaw : 30000;\n  const pierceShadow = pierceShadowRaw !== false;\n\n  return new Promise<boolean>((resolve, reject) => {\n    let timeoutId: ReturnType<typeof setTimeout> | null = null;\n    let domReadyHandler: (() => void) | null = null;\n    let settled = false;\n    const clearTimer = (): void => {\n      if (timeoutId !== null) {\n        clearTimeout(timeoutId);\n        timeoutId = null;\n      }\n    };\n\n    // Check immediately\n    const el = findElement(selector, pierceShadow);\n    if (checkState(el, state)) {\n      settled = true;\n      resolve(true);\n      return;\n    }\n\n    const observers: MutationObserver[] = [];\n\n    const cleanup = (): void => {\n      for (const obs of observers) {\n        obs.disconnect();\n      }\n      if (domReadyHandler) {\n        document.removeEventListener(\"DOMContentLoaded\", domReadyHandler);\n        domReadyHandler = null;\n      }\n    };\n\n    const check = (): void => {\n      if (settled) return;\n      const el = findElement(selector, pierceShadow);\n      if (checkState(el, state)) {\n        settled = true;\n        clearTimer();\n        cleanup();\n        resolve(true);\n      }\n    };\n\n    // Handle case where document.body is not ready yet\n    const observeRoot = document.body || document.documentElement;\n    if (!observeRoot) {\n      domReadyHandler = (): void => {\n        document.removeEventListener(\"DOMContentLoaded\", domReadyHandler!);\n        domReadyHandler = null;\n        check();\n        setupObservers();\n      };\n      document.addEventListener(\"DOMContentLoaded\", domReadyHandler);\n      timeoutId = setTimeout(() => {\n        if (settled) return;\n        settled = true;\n        clearTimer();\n        cleanup();\n        reject(\n          new Error(\n            `waitForSelector: Timeout ${timeout}ms exceeded waiting for \"${selector}\" to be ${state}`,\n          ),\n        );\n      }, timeout);\n      return;\n    }\n\n    const setupObservers = (): void => {\n      const root = document.body || document.documentElement;\n      if (!root) return;\n\n      // Main document observer\n      const mainObserver = new MutationObserver(check);\n      mainObserver.observe(root, {\n        childList: true,\n        subtree: true,\n        attributes: true,\n        attributeFilter: [\"style\", \"class\", \"hidden\", \"disabled\"],\n      });\n      observers.push(mainObserver);\n\n      // Shadow DOM observers (if piercing)\n      if (pierceShadow) {\n        setupShadowObservers(check, observers);\n      }\n    };\n\n    setupObservers();\n\n    // Set up timeout\n    timeoutId = setTimeout(() => {\n      if (settled) return;\n      settled = true;\n      clearTimer();\n      cleanup();\n      reject(\n        new Error(\n          `waitForSelector: Timeout ${timeout}ms exceeded waiting for \"${selector}\" to be ${state}`,\n        ),\n      );\n    }, timeout);\n  });\n}\n"]}