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

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

@@ -0,0 +1,76 @@
+export type XPathPredicate = {
+    type: "index";
+    index: number;
+} | {
+    type: "attrEquals";
+    name: string;
+    value: string;
+    normalize?: boolean;
+} | {
+    type: "attrExists";
+    name: string;
+} | {
+    type: "attrContains";
+    name: string;
+    value: string;
+    normalize?: boolean;
+} | {
+    type: "attrStartsWith";
+    name: string;
+    value: string;
+    normalize?: boolean;
+} | {
+    type: "textEquals";
+    value: string;
+    normalize?: boolean;
+} | {
+    type: "textContains";
+    value: string;
+    normalize?: boolean;
+} | {
+    type: "and";
+    predicates: XPathPredicate[];
+} | {
+    type: "or";
+    predicates: XPathPredicate[];
+} | {
+    type: "not";
+    predicate: XPathPredicate;
+};
+export interface XPathStep {
+    axis: "child" | "desc";
+    tag: string;
+    predicates: XPathPredicate[];
+}
+/**
+ * Parse an XPath expression into a list of traversal steps.
+ *
+ * This is a subset parser designed for composed DOM traversal (including
+ * shadow roots). It intentionally does not implement the full XPath spec.
+ *
+ * Supported:
+ *  - Child (`/`) and descendant (`//`) axes
+ *  - Tag names and wildcard (`*`)
+ *  - Positional indices (`[n]`)
+ *  - Attribute equality predicates (`[@attr='value']`, `[@attr="value"]`)
+ *  - Attribute existence (`[@attr]`)
+ *  - Attribute contains/starts-with (`contains(@attr,'v')`, `starts-with(@attr,'v')`)
+ *  - Text equality/contains (`[text()='v']`, `[contains(text(),'v')]`, `[.='v']`)
+ *  - normalize-space on text/attributes (`[normalize-space(text())='v']`)
+ *  - Basic boolean predicates (`and`, `or`, `not(...)`)
+ *  - Multiple predicates per step (`[@class='foo'][2]`)
+ *  - Optional `xpath=` prefix
+ *
+ * Not supported:
+ *  - Position functions (`[position() > n]`, `[last()]`)
+ *  - Axes beyond child/descendant (`ancestor::`, `parent::`, `self::`,
+ *    `preceding-sibling::`, `following-sibling::`)
+ *  - Union operator (`|`)
+ *  - Grouped expressions (`(//div)[n]`)
+ *
+ * Unsupported predicates are silently ignored — the step still matches
+ * by tag name, but the unrecognized predicate has no filtering effect.
+ */
+export declare function parseXPathSteps(input: string): XPathStep[];
+export declare function evaluatePredicate(element: Element, predicate: XPathPredicate): boolean;
+export declare function applyPredicates(elements: Element[], predicates: XPathPredicate[]): Element[];

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

@@ -0,0 +1,376 @@
+/**
+ * Parse an XPath expression into a list of traversal steps.
+ *
+ * This is a subset parser designed for composed DOM traversal (including
+ * shadow roots). It intentionally does not implement the full XPath spec.
+ *
+ * Supported:
+ *  - Child (`/`) and descendant (`//`) axes
+ *  - Tag names and wildcard (`*`)
+ *  - Positional indices (`[n]`)
+ *  - Attribute equality predicates (`[@attr='value']`, `[@attr="value"]`)
+ *  - Attribute existence (`[@attr]`)
+ *  - Attribute contains/starts-with (`contains(@attr,'v')`, `starts-with(@attr,'v')`)
+ *  - Text equality/contains (`[text()='v']`, `[contains(text(),'v')]`, `[.='v']`)
+ *  - normalize-space on text/attributes (`[normalize-space(text())='v']`)
+ *  - Basic boolean predicates (`and`, `or`, `not(...)`)
+ *  - Multiple predicates per step (`[@class='foo'][2]`)
+ *  - Optional `xpath=` prefix
+ *
+ * Not supported:
+ *  - Position functions (`[position() > n]`, `[last()]`)
+ *  - Axes beyond child/descendant (`ancestor::`, `parent::`, `self::`,
+ *    `preceding-sibling::`, `following-sibling::`)
+ *  - Union operator (`|`)
+ *  - Grouped expressions (`(//div)[n]`)
+ *
+ * Unsupported predicates are silently ignored — the step still matches
+ * by tag name, but the unrecognized predicate has no filtering effect.
+ */
+export function parseXPathSteps(input) {
+    const path = String(input || "")
+        .trim()
+        .replace(/^xpath=/i, "");
+    if (!path)
+        return [];
+    const steps = [];
+    let i = 0;
+    while (i < path.length) {
+        let axis = "child";
+        if (path.startsWith("//", i)) {
+            axis = "desc";
+            i += 2;
+        }
+        else if (path[i] === "/") {
+            axis = "child";
+            i += 1;
+        }
+        const start = i;
+        let bracketDepth = 0;
+        let quote = null;
+        while (i < path.length) {
+            const ch = path[i];
+            if (quote) {
+                if (ch === quote)
+                    quote = null;
+            }
+            else if (ch === "'" || ch === '"') {
+                quote = ch;
+            }
+            else if (ch === "[") {
+                bracketDepth++;
+            }
+            else if (ch === "]") {
+                bracketDepth--;
+            }
+            else if (ch === "/" && bracketDepth === 0) {
+                break;
+            }
+            i += 1;
+        }
+        const rawStep = path.slice(start, i).trim();
+        if (!rawStep)
+            continue;
+        const { tag, predicates } = parseStep(rawStep);
+        steps.push({ axis, tag, predicates });
+    }
+    return steps;
+}
+/**
+ * Extract predicate contents from a string like `[@attr='val'][2]`.
+ * Handles `]` inside quoted attribute values (e.g. `[@title='a[0]']`).
+ */
+function extractPredicates(str) {
+    const results = [];
+    let i = 0;
+    while (i < str.length) {
+        if (str[i] !== "[") {
+            i++;
+            continue;
+        }
+        i++; // skip opening [
+        const start = i;
+        let quote = null;
+        while (i < str.length) {
+            const ch = str[i];
+            if (quote) {
+                if (ch === quote)
+                    quote = null;
+            }
+            else if (ch === "'" || ch === '"') {
+                quote = ch;
+            }
+            else if (ch === "]") {
+                break;
+            }
+            i++;
+        }
+        results.push(str.slice(start, i).trim());
+        i++; // skip closing ]
+    }
+    return results;
+}
+function parseStep(raw) {
+    const bracketPos = raw.indexOf("[");
+    if (bracketPos === -1) {
+        const tag = raw === "" ? "*" : raw.toLowerCase();
+        return { tag, predicates: [] };
+    }
+    const tagPart = raw.slice(0, bracketPos).trim();
+    const tag = tagPart === "" ? "*" : tagPart.toLowerCase();
+    const predicateStr = raw.slice(bracketPos);
+    const predicates = [];
+    for (const inner of extractPredicates(predicateStr)) {
+        const parsed = parsePredicateExpression(inner);
+        if (parsed)
+            predicates.push(parsed);
+    }
+    return { tag, predicates };
+}
+function parsePredicateExpression(input) {
+    const trimmed = input.trim();
+    if (!trimmed)
+        return null;
+    const orParts = splitTopLevel(trimmed, "or");
+    if (orParts.length > 1) {
+        const preds = orParts
+            .map((part) => parsePredicateExpression(part))
+            .filter(Boolean);
+        if (preds.length !== orParts.length)
+            return null;
+        return { type: "or", predicates: preds };
+    }
+    const andParts = splitTopLevel(trimmed, "and");
+    if (andParts.length > 1) {
+        const preds = andParts
+            .map((part) => parsePredicateExpression(part))
+            .filter(Boolean);
+        if (preds.length !== andParts.length)
+            return null;
+        return { type: "and", predicates: preds };
+    }
+    const notInner = unwrapFunctionCall(trimmed, "not");
+    if (notInner != null) {
+        const predicate = parsePredicateExpression(notInner);
+        return predicate ? { type: "not", predicate } : null;
+    }
+    return parseAtomicPredicate(trimmed);
+}
+function parseAtomicPredicate(input) {
+    const valueMatch = /^(?:'([^']*)'|"([^"]*)")$/;
+    const attrName = "[a-zA-Z_][\\w.-]*";
+    const quoted = "(?:'([^']*)'|\"([^\"]*)\")";
+    if (/^\d+$/.test(input)) {
+        return { type: "index", index: Math.max(1, Number(input)) };
+    }
+    const normalizeAttrMatch = input.match(new RegExp(`^normalize-space\\(\\s*@(${attrName})\\s*\\)\\s*=\\s*${quoted}$`));
+    if (normalizeAttrMatch) {
+        return {
+            type: "attrEquals",
+            name: normalizeAttrMatch[1],
+            value: normalizeAttrMatch[2] ?? normalizeAttrMatch[3] ?? "",
+            normalize: true,
+        };
+    }
+    const normalizeTextMatch = input.match(new RegExp(`^normalize-space\\(\\s*(?:text\\(\\)|\\.)\\s*\\)\\s*=\\s*${quoted}$`));
+    if (normalizeTextMatch) {
+        return {
+            type: "textEquals",
+            value: normalizeTextMatch[1] ?? normalizeTextMatch[2] ?? "",
+            normalize: true,
+        };
+    }
+    const attrEqualsMatch = input.match(new RegExp(`^@(${attrName})\\s*=\\s*${quoted}$`));
+    if (attrEqualsMatch) {
+        return {
+            type: "attrEquals",
+            name: attrEqualsMatch[1],
+            value: attrEqualsMatch[2] ?? attrEqualsMatch[3] ?? "",
+        };
+    }
+    const attrExistsMatch = input.match(new RegExp(`^@(${attrName})$`));
+    if (attrExistsMatch) {
+        return { type: "attrExists", name: attrExistsMatch[1] };
+    }
+    const attrContainsMatch = input.match(new RegExp(`^contains\\(\\s*@(${attrName})\\s*,\\s*${quoted}\\s*\\)$`));
+    if (attrContainsMatch) {
+        return {
+            type: "attrContains",
+            name: attrContainsMatch[1],
+            value: attrContainsMatch[2] ?? attrContainsMatch[3] ?? "",
+        };
+    }
+    const attrStartsMatch = input.match(new RegExp(`^starts-with\\(\\s*@(${attrName})\\s*,\\s*${quoted}\\s*\\)$`));
+    if (attrStartsMatch) {
+        return {
+            type: "attrStartsWith",
+            name: attrStartsMatch[1],
+            value: attrStartsMatch[2] ?? attrStartsMatch[3] ?? "",
+        };
+    }
+    const textEqualsMatch = input.match(new RegExp(`^(?:text\\(\\)|\\.)\\s*=\\s*${quoted}$`));
+    if (textEqualsMatch) {
+        return {
+            type: "textEquals",
+            value: textEqualsMatch[1] ?? textEqualsMatch[2] ?? "",
+        };
+    }
+    const textContainsMatch = input.match(new RegExp(`^contains\\(\\s*(?:text\\(\\)|\\.)\\s*,\\s*${quoted}\\s*\\)$`));
+    if (textContainsMatch) {
+        return {
+            type: "textContains",
+            value: textContainsMatch[1] ?? textContainsMatch[2] ?? "",
+        };
+    }
+    if (valueMatch.test(input)) {
+        return null;
+    }
+    return null;
+}
+function splitTopLevel(input, keyword) {
+    const parts = [];
+    let start = 0;
+    let depth = 0;
+    let quote = null;
+    let i = 0;
+    while (i < input.length) {
+        const ch = input[i];
+        if (quote) {
+            if (ch === quote)
+                quote = null;
+            i += 1;
+            continue;
+        }
+        if (ch === "'" || ch === '"') {
+            quote = ch;
+            i += 1;
+            continue;
+        }
+        if (ch === "(") {
+            depth += 1;
+            i += 1;
+            continue;
+        }
+        if (ch === ")") {
+            depth = Math.max(0, depth - 1);
+            i += 1;
+            continue;
+        }
+        if (depth === 0 && isKeywordAt(input, i, keyword)) {
+            parts.push(input.slice(start, i).trim());
+            i += keyword.length;
+            start = i;
+            continue;
+        }
+        i += 1;
+    }
+    parts.push(input.slice(start).trim());
+    return parts.filter((part) => part.length > 0);
+}
+function isKeywordAt(input, index, keyword) {
+    if (!input.startsWith(keyword, index))
+        return false;
+    const before = index > 0 ? input[index - 1] : " ";
+    if (before === "@")
+        return false;
+    const after = index + keyword.length < input.length ? input[index + keyword.length] : " ";
+    return isBoundary(before) && isBoundary(after);
+}
+function isBoundary(ch) {
+    return !/[a-zA-Z0-9_.-]/.test(ch);
+}
+function unwrapFunctionCall(input, name) {
+    const prefix = `${name}(`;
+    if (!input.startsWith(prefix) || !input.endsWith(")"))
+        return null;
+    const inner = input.slice(prefix.length, -1);
+    return hasBalancedParens(inner) ? inner : null;
+}
+function hasBalancedParens(input) {
+    let depth = 0;
+    let quote = null;
+    for (let i = 0; i < input.length; i += 1) {
+        const ch = input[i];
+        if (quote) {
+            if (ch === quote)
+                quote = null;
+            continue;
+        }
+        if (ch === "'" || ch === '"') {
+            quote = ch;
+            continue;
+        }
+        if (ch === "(")
+            depth += 1;
+        else if (ch === ")")
+            depth -= 1;
+        if (depth < 0)
+            return false;
+    }
+    return depth === 0;
+}
+const normalizeSpace = (value) => value.replace(/\s+/g, " ").trim();
+function textValue(element) {
+    return String(element.textContent ?? "");
+}
+function normalizeMaybe(value, normalize) {
+    return normalize ? normalizeSpace(value) : value;
+}
+export function evaluatePredicate(element, predicate) {
+    switch (predicate.type) {
+        case "and":
+            return predicate.predicates.every((p) => evaluatePredicate(element, p));
+        case "or":
+            return predicate.predicates.some((p) => evaluatePredicate(element, p));
+        case "not":
+            return !evaluatePredicate(element, predicate.predicate);
+        case "attrExists":
+            return element.getAttribute(predicate.name) !== null;
+        case "attrEquals": {
+            const attr = element.getAttribute(predicate.name);
+            if (attr === null)
+                return false;
+            return (normalizeMaybe(attr, predicate.normalize) ===
+                normalizeMaybe(predicate.value, predicate.normalize));
+        }
+        case "attrContains": {
+            const attr = element.getAttribute(predicate.name);
+            if (attr === null)
+                return false;
+            return normalizeMaybe(attr, predicate.normalize).includes(normalizeMaybe(predicate.value, predicate.normalize));
+        }
+        case "attrStartsWith": {
+            const attr = element.getAttribute(predicate.name);
+            if (attr === null)
+                return false;
+            return normalizeMaybe(attr, predicate.normalize).startsWith(normalizeMaybe(predicate.value, predicate.normalize));
+        }
+        case "textEquals": {
+            const value = normalizeMaybe(textValue(element), predicate.normalize);
+            return value === normalizeMaybe(predicate.value, predicate.normalize);
+        }
+        case "textContains": {
+            const value = normalizeMaybe(textValue(element), predicate.normalize);
+            return value.includes(normalizeMaybe(predicate.value, predicate.normalize));
+        }
+        case "index":
+            return true;
+        default:
+            return true;
+    }
+}
+export function applyPredicates(elements, predicates) {
+    let current = elements;
+    for (const predicate of predicates) {
+        if (!current.length)
+            return [];
+        if (predicate.type === "index") {
+            const idx = predicate.index - 1;
+            current = idx >= 0 && idx < current.length ? [current[idx]] : [];
+            continue;
+        }
+        current = current.filter((el) => evaluatePredicate(el, predicate));
+    }
+    return current;
+}
+//# sourceMappingURL=xpathParser.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"xpathParser.js","sourceRoot":"","sources":["../../../../../../lib/v3/dom/locatorScripts/xpathParser.ts"],"names":[],"mappings":"AA4BA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;SAC7B,IAAI,EAAE;SACN,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,GAAqB,OAAO,CAAC;QACrC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;YAC7B,IAAI,GAAG,MAAM,CAAC;YACd,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3B,IAAI,GAAG,OAAO,CAAC;YACf,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,CAAC;QAChB,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,KAAK,GAAkB,IAAI,CAAC;QAChC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,EAAE,KAAK,KAAK;oBAAE,KAAK,GAAG,IAAI,CAAC;YACjC,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACpC,KAAK,GAAG,EAAE,CAAC;YACb,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACtB,YAAY,EAAE,CAAC;YACjB,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACtB,YAAY,EAAE,CAAC;YACjB,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBAC5C,MAAM;YACR,CAAC;YACD,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,GAAW;IACpC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;QACtB,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACnB,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,CAAC,EAAE,CAAC,CAAC,iBAAiB;QACtB,MAAM,KAAK,GAAG,CAAC,CAAC;QAChB,IAAI,KAAK,GAAkB,IAAI,CAAC;QAChC,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,EAAE,KAAK,KAAK;oBAAE,KAAK,GAAG,IAAI,CAAC;YACjC,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACpC,KAAK,GAAG,EAAE,CAAC;YACb,CAAC;iBAAM,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBACtB,MAAM;YACR,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACzC,CAAC,EAAE,CAAC,CAAC,iBAAiB;IACxB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,SAAS,CAAC,GAAW;IAI5B,MAAM,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;QACjD,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IACjC,CAAC;IAED,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,IAAI,EAAE,CAAC;IAChD,MAAM,GAAG,GAAG,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;IACzD,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IAE3C,MAAM,UAAU,GAAqB,EAAE,CAAC;IAExC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,YAAY,CAAC,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,wBAAwB,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;AAC7B,CAAC;AAED,SAAS,wBAAwB,CAAC,KAAa;IAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC7C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,OAAO;aAClB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;aAC7C,MAAM,CAAC,OAAO,CAAqB,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACjD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC3C,CAAC;IAED,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAC/C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,QAAQ;aACnB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;aAC7C,MAAM,CAAC,OAAO,CAAqB,CAAC;QACvC,IAAI,KAAK,CAAC,MAAM,KAAK,QAAQ,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAClD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAC5C,CAAC;IAED,MAAM,QAAQ,GAAG,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACpD,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,SAAS,GAAG,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAED,OAAO,oBAAoB,CAAC,OAAO,CAAC,CAAC;AACvC,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAa;IACzC,MAAM,UAAU,GAAG,2BAA2B,CAAC;IAC/C,MAAM,QAAQ,GAAG,mBAAmB,CAAC;IACrC,MAAM,MAAM,GAAG,4BAA4B,CAAC;IAE5C,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;IAC9D,CAAC;IAED,MAAM,kBAAkB,GAAG,KAAK,CAAC,KAAK,CACpC,IAAI,MAAM,CACR,4BAA4B,QAAQ,oBAAoB,MAAM,GAAG,CAClE,CACF,CAAC;IACF,IAAI,kBAAkB,EAAE,CAAC;QACvB,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC3B,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE;YAC3D,SAAS,EAAE,IAAI;SAChB,CAAC;IACJ,CAAC;IAED,MAAM,kBAAkB,GAAG,KAAK,CAAC,KAAK,CACpC,IAAI,MAAM,CACR,4DAA4D,MAAM,GAAG,CACtE,CACF,CAAC;IACF,IAAI,kBAAkB,EAAE,CAAC;QACvB,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,kBAAkB,CAAC,CAAC,CAAC,IAAI,EAAE;YAC3D,SAAS,EAAE,IAAI;SAChB,CAAC;IACJ,CAAC;IAED,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CACjC,IAAI,MAAM,CAAC,MAAM,QAAQ,aAAa,MAAM,GAAG,CAAC,CACjD,CAAC;IACF,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC;YACxB,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,QAAQ,IAAI,CAAC,CAAC,CAAC;IACpE,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,CAAC;IAED,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,CACnC,IAAI,MAAM,CAAC,qBAAqB,QAAQ,aAAa,MAAM,UAAU,CAAC,CACvE,CAAC;IACF,IAAI,iBAAiB,EAAE,CAAC;QACtB,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,IAAI,EAAE,iBAAiB,CAAC,CAAC,CAAC;YAC1B,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE;SAC1D,CAAC;IACJ,CAAC;IAED,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CACjC,IAAI,MAAM,CAAC,wBAAwB,QAAQ,aAAa,MAAM,UAAU,CAAC,CAC1E,CAAC;IACF,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO;YACL,IAAI,EAAE,gBAAgB;YACtB,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC;YACxB,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,MAAM,eAAe,GAAG,KAAK,CAAC,KAAK,CACjC,IAAI,MAAM,CAAC,+BAA+B,MAAM,GAAG,CAAC,CACrD,CAAC;IACF,IAAI,eAAe,EAAE,CAAC;QACpB,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,CACnC,IAAI,MAAM,CAAC,8CAA8C,MAAM,UAAU,CAAC,CAC3E,CAAC;IACF,IAAI,iBAAiB,EAAE,CAAC;QACtB,OAAO;YACL,IAAI,EAAE,cAAc;YACpB,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE;SAC1D,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,KAAa,EAAE,OAAe;IACnD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAkB,IAAI,CAAC;IAChC,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,EAAE,KAAK,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC;YAC/B,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QAED,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC7B,KAAK,GAAG,EAAE,CAAC;YACX,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QAED,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,CAAC;YACX,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QAED,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/B,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QAED,IAAI,KAAK,KAAK,CAAC,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;YAClD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACzC,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;YACpB,KAAK,GAAG,CAAC,CAAC;YACV,SAAS;QACX,CAAC;QAED,CAAC,IAAI,CAAC,CAAC;IACT,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,WAAW,CAAC,KAAa,EAAE,KAAa,EAAE,OAAe;IAChE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACpD,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAClD,IAAI,MAAM,KAAK,GAAG;QAAE,OAAO,KAAK,CAAC;IACjC,MAAM,KAAK,GACT,KAAK,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IAC9E,OAAO,UAAU,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;AACjD,CAAC;AAED,SAAS,UAAU,CAAC,EAAU;IAC5B,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAa,EAAE,IAAY;IACrD,MAAM,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC;IAC1B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACnE,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7C,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AACjD,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAa;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAkB,IAAI,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,EAAE,KAAK,KAAK;gBAAE,KAAK,GAAG,IAAI,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC7B,KAAK,GAAG,EAAE,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,IAAI,CAAC,CAAC;aACtB,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,IAAI,CAAC,CAAC;QAChC,IAAI,KAAK,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IAC9B,CAAC;IACD,OAAO,KAAK,KAAK,CAAC,CAAC;AACrB,CAAC;AAED,MAAM,cAAc,GAAG,CAAC,KAAa,EAAU,EAAE,CAC/C,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AAEpC,SAAS,SAAS,CAAC,OAAgB;IACjC,OAAO,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,cAAc,CAAC,KAAa,EAAE,SAAmB;IACxD,OAAO,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,OAAgB,EAChB,SAAyB;IAEzB,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,KAAK,IAAI;YACP,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACzE,KAAK,KAAK;YACR,OAAO,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;QAC1D,KAAK,YAAY;YACf,OAAO,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC;QACvD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAChC,OAAO,CACL,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC;gBACzC,cAAc,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CACrD,CAAC;QACJ,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAChC,OAAO,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,QAAQ,CACvD,cAAc,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CACrD,CAAC;QACJ,CAAC;QACD,KAAK,gBAAgB,CAAC,CAAC,CAAC;YACtB,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAChC,OAAO,cAAc,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC,UAAU,CACzD,cAAc,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CACrD,CAAC;QACJ,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;YACtE,OAAO,KAAK,KAAK,cAAc,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;QACxE,CAAC;QACD,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,cAAc,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;YACtE,OAAO,KAAK,CAAC,QAAQ,CACnB,cAAc,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CACrD,CAAC;QACJ,CAAC;QACD,KAAK,OAAO;YACV,OAAO,IAAI,CAAC;QACd;YACE,OAAO,IAAI,CAAC;IAChB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,eAAe,CAC7B,QAAmB,EACnB,UAA4B;IAE5B,IAAI,OAAO,GAAG,QAAQ,CAAC;IACvB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,EAAE,CAAC;QAE/B,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC;YAChC,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAClE,SAAS;QACX,CAAC;QAED,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,iBAAiB,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["export type XPathPredicate =\n  | { type: \"index\"; index: number }\n  | { type: \"attrEquals\"; name: string; value: string; normalize?: boolean }\n  | { type: \"attrExists\"; name: string }\n  | {\n      type: \"attrContains\";\n      name: string;\n      value: string;\n      normalize?: boolean;\n    }\n  | {\n      type: \"attrStartsWith\";\n      name: string;\n      value: string;\n      normalize?: boolean;\n    }\n  | { type: \"textEquals\"; value: string; normalize?: boolean }\n  | { type: \"textContains\"; value: string; normalize?: boolean }\n  | { type: \"and\"; predicates: XPathPredicate[] }\n  | { type: \"or\"; predicates: XPathPredicate[] }\n  | { type: \"not\"; predicate: XPathPredicate };\n\nexport interface XPathStep {\n  axis: \"child\" | \"desc\";\n  tag: string;\n  predicates: XPathPredicate[];\n}\n\n/**\n * Parse an XPath expression into a list of traversal steps.\n *\n * This is a subset parser designed for composed DOM traversal (including\n * shadow roots). It intentionally does not implement the full XPath spec.\n *\n * Supported:\n *  - Child (`/`) and descendant (`//`) axes\n *  - Tag names and wildcard (`*`)\n *  - Positional indices (`[n]`)\n *  - Attribute equality predicates (`[@attr='value']`, `[@attr=\"value\"]`)\n *  - Attribute existence (`[@attr]`)\n *  - Attribute contains/starts-with (`contains(@attr,'v')`, `starts-with(@attr,'v')`)\n *  - Text equality/contains (`[text()='v']`, `[contains(text(),'v')]`, `[.='v']`)\n *  - normalize-space on text/attributes (`[normalize-space(text())='v']`)\n *  - Basic boolean predicates (`and`, `or`, `not(...)`)\n *  - Multiple predicates per step (`[@class='foo'][2]`)\n *  - Optional `xpath=` prefix\n *\n * Not supported:\n *  - Position functions (`[position() > n]`, `[last()]`)\n *  - Axes beyond child/descendant (`ancestor::`, `parent::`, `self::`,\n *    `preceding-sibling::`, `following-sibling::`)\n *  - Union operator (`|`)\n *  - Grouped expressions (`(//div)[n]`)\n *\n * Unsupported predicates are silently ignored — the step still matches\n * by tag name, but the unrecognized predicate has no filtering effect.\n */\nexport function parseXPathSteps(input: string): XPathStep[] {\n  const path = String(input || \"\")\n    .trim()\n    .replace(/^xpath=/i, \"\");\n  if (!path) return [];\n\n  const steps: XPathStep[] = [];\n  let i = 0;\n\n  while (i < path.length) {\n    let axis: \"child\" | \"desc\" = \"child\";\n    if (path.startsWith(\"//\", i)) {\n      axis = \"desc\";\n      i += 2;\n    } else if (path[i] === \"/\") {\n      axis = \"child\";\n      i += 1;\n    }\n\n    const start = i;\n    let bracketDepth = 0;\n    let quote: string | null = null;\n    while (i < path.length) {\n      const ch = path[i];\n      if (quote) {\n        if (ch === quote) quote = null;\n      } else if (ch === \"'\" || ch === '\"') {\n        quote = ch;\n      } else if (ch === \"[\") {\n        bracketDepth++;\n      } else if (ch === \"]\") {\n        bracketDepth--;\n      } else if (ch === \"/\" && bracketDepth === 0) {\n        break;\n      }\n      i += 1;\n    }\n    const rawStep = path.slice(start, i).trim();\n    if (!rawStep) continue;\n\n    const { tag, predicates } = parseStep(rawStep);\n    steps.push({ axis, tag, predicates });\n  }\n\n  return steps;\n}\n\n/**\n * Extract predicate contents from a string like `[@attr='val'][2]`.\n * Handles `]` inside quoted attribute values (e.g. `[@title='a[0]']`).\n */\nfunction extractPredicates(str: string): string[] {\n  const results: string[] = [];\n  let i = 0;\n  while (i < str.length) {\n    if (str[i] !== \"[\") {\n      i++;\n      continue;\n    }\n    i++; // skip opening [\n    const start = i;\n    let quote: string | null = null;\n    while (i < str.length) {\n      const ch = str[i];\n      if (quote) {\n        if (ch === quote) quote = null;\n      } else if (ch === \"'\" || ch === '\"') {\n        quote = ch;\n      } else if (ch === \"]\") {\n        break;\n      }\n      i++;\n    }\n    results.push(str.slice(start, i).trim());\n    i++; // skip closing ]\n  }\n  return results;\n}\n\nfunction parseStep(raw: string): {\n  tag: string;\n  predicates: XPathPredicate[];\n} {\n  const bracketPos = raw.indexOf(\"[\");\n  if (bracketPos === -1) {\n    const tag = raw === \"\" ? \"*\" : raw.toLowerCase();\n    return { tag, predicates: [] };\n  }\n\n  const tagPart = raw.slice(0, bracketPos).trim();\n  const tag = tagPart === \"\" ? \"*\" : tagPart.toLowerCase();\n  const predicateStr = raw.slice(bracketPos);\n\n  const predicates: XPathPredicate[] = [];\n\n  for (const inner of extractPredicates(predicateStr)) {\n    const parsed = parsePredicateExpression(inner);\n    if (parsed) predicates.push(parsed);\n  }\n\n  return { tag, predicates };\n}\n\nfunction parsePredicateExpression(input: string): XPathPredicate | null {\n  const trimmed = input.trim();\n  if (!trimmed) return null;\n\n  const orParts = splitTopLevel(trimmed, \"or\");\n  if (orParts.length > 1) {\n    const preds = orParts\n      .map((part) => parsePredicateExpression(part))\n      .filter(Boolean) as XPathPredicate[];\n    if (preds.length !== orParts.length) return null;\n    return { type: \"or\", predicates: preds };\n  }\n\n  const andParts = splitTopLevel(trimmed, \"and\");\n  if (andParts.length > 1) {\n    const preds = andParts\n      .map((part) => parsePredicateExpression(part))\n      .filter(Boolean) as XPathPredicate[];\n    if (preds.length !== andParts.length) return null;\n    return { type: \"and\", predicates: preds };\n  }\n\n  const notInner = unwrapFunctionCall(trimmed, \"not\");\n  if (notInner != null) {\n    const predicate = parsePredicateExpression(notInner);\n    return predicate ? { type: \"not\", predicate } : null;\n  }\n\n  return parseAtomicPredicate(trimmed);\n}\n\nfunction parseAtomicPredicate(input: string): XPathPredicate | null {\n  const valueMatch = /^(?:'([^']*)'|\"([^\"]*)\")$/;\n  const attrName = \"[a-zA-Z_][\\\\w.-]*\";\n  const quoted = \"(?:'([^']*)'|\\\"([^\\\"]*)\\\")\";\n\n  if (/^\\d+$/.test(input)) {\n    return { type: \"index\", index: Math.max(1, Number(input)) };\n  }\n\n  const normalizeAttrMatch = input.match(\n    new RegExp(\n      `^normalize-space\\\\(\\\\s*@(${attrName})\\\\s*\\\\)\\\\s*=\\\\s*${quoted}$`,\n    ),\n  );\n  if (normalizeAttrMatch) {\n    return {\n      type: \"attrEquals\",\n      name: normalizeAttrMatch[1],\n      value: normalizeAttrMatch[2] ?? normalizeAttrMatch[3] ?? \"\",\n      normalize: true,\n    };\n  }\n\n  const normalizeTextMatch = input.match(\n    new RegExp(\n      `^normalize-space\\\\(\\\\s*(?:text\\\\(\\\\)|\\\\.)\\\\s*\\\\)\\\\s*=\\\\s*${quoted}$`,\n    ),\n  );\n  if (normalizeTextMatch) {\n    return {\n      type: \"textEquals\",\n      value: normalizeTextMatch[1] ?? normalizeTextMatch[2] ?? \"\",\n      normalize: true,\n    };\n  }\n\n  const attrEqualsMatch = input.match(\n    new RegExp(`^@(${attrName})\\\\s*=\\\\s*${quoted}$`),\n  );\n  if (attrEqualsMatch) {\n    return {\n      type: \"attrEquals\",\n      name: attrEqualsMatch[1],\n      value: attrEqualsMatch[2] ?? attrEqualsMatch[3] ?? \"\",\n    };\n  }\n\n  const attrExistsMatch = input.match(new RegExp(`^@(${attrName})$`));\n  if (attrExistsMatch) {\n    return { type: \"attrExists\", name: attrExistsMatch[1] };\n  }\n\n  const attrContainsMatch = input.match(\n    new RegExp(`^contains\\\\(\\\\s*@(${attrName})\\\\s*,\\\\s*${quoted}\\\\s*\\\\)$`),\n  );\n  if (attrContainsMatch) {\n    return {\n      type: \"attrContains\",\n      name: attrContainsMatch[1],\n      value: attrContainsMatch[2] ?? attrContainsMatch[3] ?? \"\",\n    };\n  }\n\n  const attrStartsMatch = input.match(\n    new RegExp(`^starts-with\\\\(\\\\s*@(${attrName})\\\\s*,\\\\s*${quoted}\\\\s*\\\\)$`),\n  );\n  if (attrStartsMatch) {\n    return {\n      type: \"attrStartsWith\",\n      name: attrStartsMatch[1],\n      value: attrStartsMatch[2] ?? attrStartsMatch[3] ?? \"\",\n    };\n  }\n\n  const textEqualsMatch = input.match(\n    new RegExp(`^(?:text\\\\(\\\\)|\\\\.)\\\\s*=\\\\s*${quoted}$`),\n  );\n  if (textEqualsMatch) {\n    return {\n      type: \"textEquals\",\n      value: textEqualsMatch[1] ?? textEqualsMatch[2] ?? \"\",\n    };\n  }\n\n  const textContainsMatch = input.match(\n    new RegExp(`^contains\\\\(\\\\s*(?:text\\\\(\\\\)|\\\\.)\\\\s*,\\\\s*${quoted}\\\\s*\\\\)$`),\n  );\n  if (textContainsMatch) {\n    return {\n      type: \"textContains\",\n      value: textContainsMatch[1] ?? textContainsMatch[2] ?? \"\",\n    };\n  }\n\n  if (valueMatch.test(input)) {\n    return null;\n  }\n\n  return null;\n}\n\nfunction splitTopLevel(input: string, keyword: string): string[] {\n  const parts: string[] = [];\n  let start = 0;\n  let depth = 0;\n  let quote: string | null = null;\n  let i = 0;\n\n  while (i < input.length) {\n    const ch = input[i];\n    if (quote) {\n      if (ch === quote) quote = null;\n      i += 1;\n      continue;\n    }\n\n    if (ch === \"'\" || ch === '\"') {\n      quote = ch;\n      i += 1;\n      continue;\n    }\n\n    if (ch === \"(\") {\n      depth += 1;\n      i += 1;\n      continue;\n    }\n\n    if (ch === \")\") {\n      depth = Math.max(0, depth - 1);\n      i += 1;\n      continue;\n    }\n\n    if (depth === 0 && isKeywordAt(input, i, keyword)) {\n      parts.push(input.slice(start, i).trim());\n      i += keyword.length;\n      start = i;\n      continue;\n    }\n\n    i += 1;\n  }\n\n  parts.push(input.slice(start).trim());\n  return parts.filter((part) => part.length > 0);\n}\n\nfunction isKeywordAt(input: string, index: number, keyword: string): boolean {\n  if (!input.startsWith(keyword, index)) return false;\n  const before = index > 0 ? input[index - 1] : \" \";\n  if (before === \"@\") return false;\n  const after =\n    index + keyword.length < input.length ? input[index + keyword.length] : \" \";\n  return isBoundary(before) && isBoundary(after);\n}\n\nfunction isBoundary(ch: string): boolean {\n  return !/[a-zA-Z0-9_.-]/.test(ch);\n}\n\nfunction unwrapFunctionCall(input: string, name: string): string | null {\n  const prefix = `${name}(`;\n  if (!input.startsWith(prefix) || !input.endsWith(\")\")) return null;\n  const inner = input.slice(prefix.length, -1);\n  return hasBalancedParens(inner) ? inner : null;\n}\n\nfunction hasBalancedParens(input: string): boolean {\n  let depth = 0;\n  let quote: string | null = null;\n  for (let i = 0; i < input.length; i += 1) {\n    const ch = input[i];\n    if (quote) {\n      if (ch === quote) quote = null;\n      continue;\n    }\n    if (ch === \"'\" || ch === '\"') {\n      quote = ch;\n      continue;\n    }\n    if (ch === \"(\") depth += 1;\n    else if (ch === \")\") depth -= 1;\n    if (depth < 0) return false;\n  }\n  return depth === 0;\n}\n\nconst normalizeSpace = (value: string): string =>\n  value.replace(/\\s+/g, \" \").trim();\n\nfunction textValue(element: Element): string {\n  return String(element.textContent ?? \"\");\n}\n\nfunction normalizeMaybe(value: string, normalize?: boolean): string {\n  return normalize ? normalizeSpace(value) : value;\n}\n\nexport function evaluatePredicate(\n  element: Element,\n  predicate: XPathPredicate,\n): boolean {\n  switch (predicate.type) {\n    case \"and\":\n      return predicate.predicates.every((p) => evaluatePredicate(element, p));\n    case \"or\":\n      return predicate.predicates.some((p) => evaluatePredicate(element, p));\n    case \"not\":\n      return !evaluatePredicate(element, predicate.predicate);\n    case \"attrExists\":\n      return element.getAttribute(predicate.name) !== null;\n    case \"attrEquals\": {\n      const attr = element.getAttribute(predicate.name);\n      if (attr === null) return false;\n      return (\n        normalizeMaybe(attr, predicate.normalize) ===\n        normalizeMaybe(predicate.value, predicate.normalize)\n      );\n    }\n    case \"attrContains\": {\n      const attr = element.getAttribute(predicate.name);\n      if (attr === null) return false;\n      return normalizeMaybe(attr, predicate.normalize).includes(\n        normalizeMaybe(predicate.value, predicate.normalize),\n      );\n    }\n    case \"attrStartsWith\": {\n      const attr = element.getAttribute(predicate.name);\n      if (attr === null) return false;\n      return normalizeMaybe(attr, predicate.normalize).startsWith(\n        normalizeMaybe(predicate.value, predicate.normalize),\n      );\n    }\n    case \"textEquals\": {\n      const value = normalizeMaybe(textValue(element), predicate.normalize);\n      return value === normalizeMaybe(predicate.value, predicate.normalize);\n    }\n    case \"textContains\": {\n      const value = normalizeMaybe(textValue(element), predicate.normalize);\n      return value.includes(\n        normalizeMaybe(predicate.value, predicate.normalize),\n      );\n    }\n    case \"index\":\n      return true;\n    default:\n      return true;\n  }\n}\n\nexport function applyPredicates(\n  elements: Element[],\n  predicates: XPathPredicate[],\n): Element[] {\n  let current = elements;\n  for (const predicate of predicates) {\n    if (!current.length) return [];\n\n    if (predicate.type === \"index\") {\n      const idx = predicate.index - 1;\n      current = idx >= 0 && idx < current.length ? [current[idx]!] : [];\n      continue;\n    }\n\n    current = current.filter((el) => evaluatePredicate(el, predicate));\n  }\n  return current;\n}\n"]}

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

@@ -0,0 +1,9 @@
+type ClosedRootGetter = (host: Element) => ShadowRoot | null;
+export type XPathResolveOptions = {
+    pierceShadow?: boolean;
+};
+export declare function resolveXPathFirst(rawXp: string, options?: XPathResolveOptions): Element | null;
+export declare function resolveXPathAtIndex(rawXp: string, index: number, options?: XPathResolveOptions): Element | null;
+export declare function countXPathMatches(rawXp: string, options?: XPathResolveOptions): number;
+export declare function resolveXPathComposedMatches(rawXp: string, getClosedRoot?: ClosedRootGetter | null): Element[];
+export {};