@browserbasehq/orca 3.0.9-alpha-4 → 3.1.0-patch.1

package/dist/esm/lib/v3/understudy/a11y/snapshot/sessions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sessions.js","sourceRoot":"","sources":["../../../../../../../lib/v3/understudy/a11y/snapshot/sessions.ts"],"names":[],"mappings":"AAIA;;;;GAIG;AAEH,uEAAuE;AACvE,MAAM,UAAU,YAAY,CAAC,IAAU,EAAE,OAAe;IACtD,OAAO,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;AAC1C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,IAAU,EACV,aAA+B,EAC/B,OAAe;IAEf,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IACpD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC;AAC3C,CAAC","sourcesContent":["import type { CDPSessionLike } from \"../../cdp.js\";\nimport { Page } from \"../../page.js\";\nimport type { FrameParentIndex } from \"../../../types/private/snapshot.js\";\n\n/**\n * Session helpers ensure DOM lookups are always executed against the session\n * that actually owns a frame. Keeping this logic centralized prevents subtle\n * bugs when OOPIF adoption changes session ownership mid-capture.\n */\n\n/** Return the owning session for a frame as registered on the Page. */\nexport function ownerSession(page: Page, frameId: string): CDPSessionLike {\n  return page.getSessionForFrame(frameId);\n}\n\n/**\n * DOM.getFrameOwner must be called against the parent frame's session.\n * This helper hides the lookup (including main-frame fallback) so callers\n * always reach for the correct connection.\n */\nexport function parentSession(\n  page: Page,\n  parentByFrame: FrameParentIndex,\n  frameId: string,\n): CDPSessionLike {\n  const parentId = parentByFrame.get(frameId) ?? null;\n  if (!parentId) {\n    return page.getSessionForFrame(frameId);\n  }\n  return page.getSessionForFrame(parentId);\n}\n"]}

package/dist/esm/lib/v3/understudy/a11y/snapshot/treeFormatUtils.d.ts

@@ -0,0 +1,28 @@
+import type { A11yNode } from "../../../types/private/snapshot.js";
+/**
+ * Render a formatted outline (with encoded ids) for the accessibility tree.
+ * Keeps indentation logic shared between modules so unit tests can cover these
+ * pure formatting helpers without a full snapshot pipeline.
+ */
+export declare function formatTreeLine(node: A11yNode, level?: number): string;
+/**
+ * Inject each child frame outline under the parent's iframe node line.
+ * Keys in `idToTree` are the parent's iframe encoded ids.
+ */
+export declare function injectSubtrees(rootOutline: string, idToTree: Map<string, string>): string;
+export declare function indentBlock(block: string, indent: string): string;
+/**
+ * Return the lines that appear in `nextTree` but not in `prevTree`.
+ * Comparison is done line-by-line, ignoring leading whitespace in both trees.
+ * The returned block is re-indented so the minimal indent becomes column 0.
+ */
+export declare function diffCombinedTrees(prevTree: string, nextTree: string): string;
+/**
+ * Remove whitespace noise and invisible code points before rendering names.
+ */
+export declare function cleanText(input: string): string;
+/**
+ * Collapse all whitespace runs in a string to a single space without trimming.
+ * Exported for pruning routines that need the same normalization.
+ */
+export declare function normaliseSpaces(s: string): string;

package/dist/esm/lib/v3/understudy/a11y/snapshot/treeFormatUtils.js

@@ -0,0 +1,135 @@
+/**
+ * Render a formatted outline (with encoded ids) for the accessibility tree.
+ * Keeps indentation logic shared between modules so unit tests can cover these
+ * pure formatting helpers without a full snapshot pipeline.
+ */
+export function formatTreeLine(node, level = 0) {
+    const indent = "  ".repeat(level);
+    const labelId = node.encodedId ?? node.nodeId;
+    const label = `[${labelId}] ${node.role}${node.name ? `: ${cleanText(node.name)}` : ""}`;
+    const kids = node.children?.map((c) => formatTreeLine(c, level + 1)).join("\n") ?? "";
+    return kids ? `${indent}${label}\n${kids}` : `${indent}${label}`;
+}
+/**
+ * Inject each child frame outline under the parent's iframe node line.
+ * Keys in `idToTree` are the parent's iframe encoded ids.
+ */
+export function injectSubtrees(rootOutline, idToTree) {
+    const out = [];
+    const visited = new Set();
+    const stack = [{ lines: rootOutline.split("\n"), i: 0 }];
+    while (stack.length) {
+        const top = stack[stack.length - 1];
+        if (top.i >= top.lines.length) {
+            stack.pop();
+            continue;
+        }
+        const raw = top.lines[top.i++];
+        out.push(raw);
+        const indent = raw.match(/^(\s*)/)?.[1] ?? "";
+        const content = raw.slice(indent.length);
+        const m = content.match(/^\[([^\]]+)]/);
+        if (!m)
+            continue;
+        const encId = m[1];
+        const childOutline = idToTree.get(encId);
+        if (!childOutline || visited.has(encId))
+            continue;
+        visited.add(encId);
+        const fullyInjectedChild = injectSubtrees(childOutline, idToTree);
+        out.push(indentBlock(fullyInjectedChild.trimEnd(), indent + "  "));
+    }
+    return out.join("\n");
+}
+export function indentBlock(block, indent) {
+    if (!block)
+        return "";
+    return block
+        .split("\n")
+        .map((line) => (line.length ? indent + line : indent + line))
+        .join("\n");
+}
+/**
+ * Return the lines that appear in `nextTree` but not in `prevTree`.
+ * Comparison is done line-by-line, ignoring leading whitespace in both trees.
+ * The returned block is re-indented so the minimal indent becomes column 0.
+ */
+export function diffCombinedTrees(prevTree, nextTree) {
+    const prevSet = new Set((prevTree || "")
+        .split("\n")
+        .map((l) => l.trim())
+        .filter((l) => l.length > 0));
+    const nextLines = (nextTree || "").split("\n");
+    const added = [];
+    for (const line of nextLines) {
+        const core = line.trim();
+        if (!core)
+            continue;
+        if (!prevSet.has(core))
+            added.push(line);
+    }
+    if (added.length === 0)
+        return "";
+    let minIndent = Infinity;
+    for (const l of added) {
+        if (!l.trim())
+            continue;
+        const m = l.match(/^\s*/);
+        const indentLen = m ? m[0].length : 0;
+        if (indentLen < minIndent)
+            minIndent = indentLen;
+    }
+    if (!isFinite(minIndent))
+        minIndent = 0;
+    const out = added.map((l) => l.length >= minIndent ? l.slice(minIndent) : l);
+    return out.join("\n");
+}
+/**
+ * Remove whitespace noise and invisible code points before rendering names.
+ */
+export function cleanText(input) {
+    const PUA_START = 0xe000;
+    const PUA_END = 0xf8ff;
+    const NBSP = new Set([0x00a0, 0x202f, 0x2007, 0xfeff]);
+    let out = "";
+    let prevSpace = false;
+    for (let i = 0; i < input.length; i++) {
+        const code = input.charCodeAt(i);
+        if (code >= PUA_START && code <= PUA_END)
+            continue;
+        if (NBSP.has(code)) {
+            if (!prevSpace) {
+                out += " ";
+                prevSpace = true;
+            }
+            continue;
+        }
+        out += input[i];
+        prevSpace = input[i] === " ";
+    }
+    return out.trim();
+}
+/**
+ * Collapse all whitespace runs in a string to a single space without trimming.
+ * Exported for pruning routines that need the same normalization.
+ */
+export function normaliseSpaces(s) {
+    let out = "";
+    let inWs = false;
+    for (let i = 0; i < s.length; i++) {
+        const ch = s[i];
+        const isWs = /\s/.test(ch);
+        if (isWs) {
+            if (!inWs) {
+                out += " ";
+                inWs = true;
+            }
+        }
+        else {
+            out += ch;
+            inWs = false;
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=treeFormatUtils.js.map

package/dist/esm/lib/v3/understudy/a11y/snapshot/treeFormatUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"treeFormatUtils.js","sourceRoot":"","sources":["../../../../../../../lib/v3/understudy/a11y/snapshot/treeFormatUtils.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,IAAc,EAAE,KAAK,GAAG,CAAC;IACtD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,OAAO,KAAK,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACzF,MAAM,IAAI,GACR,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC3E,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,KAAK,EAAE,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,WAAmB,EACnB,QAA6B;IAG7B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAY,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAElE,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC9B,KAAK,CAAC,GAAG,EAAE,CAAC;YACZ,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEd,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAEzC,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC;YAAE,SAAS;QAEjB,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACpB,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAElD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnB,MAAM,kBAAkB,GAAG,cAAc,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QAClE,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,OAAO,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IACrE,CAAC;IAED,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,MAAc;IACvD,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,OAAO,KAAK;SACT,KAAK,CAAC,IAAI,CAAC;SACX,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;SAC5D,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,QAAgB,EAAE,QAAgB;IAClE,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CAAC,QAAQ,IAAI,EAAE,CAAC;SACb,KAAK,CAAC,IAAI,CAAC;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAC/B,CAAC;IAEF,MAAM,SAAS,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,IAAI,SAAS,GAAG,QAAQ,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;YAAE,SAAS;QACxB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1B,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,SAAS,GAAG,SAAS;YAAE,SAAS,GAAG,SAAS,CAAC;IACnD,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,SAAS,GAAG,CAAC,CAAC;IAExC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC1B,CAAC,CAAC,MAAM,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAC/C,CAAC;IACF,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC;IACzB,MAAM,OAAO,GAAG,MAAM,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAE/D,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,IAAI,SAAS,IAAI,IAAI,IAAI,OAAO;YAAE,SAAS;QACnD,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,GAAG,IAAI,GAAG,CAAC;gBACX,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;YACD,SAAS;QACX,CAAC;QACD,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QAChB,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;IAC/B,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,EAAE,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,CAAS;IACvC,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,IAAI,GAAG,KAAK,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,GAAG,IAAI,GAAG,CAAC;gBACX,IAAI,GAAG,IAAI,CAAC;YACd,CAAC;QACH,CAAC;aAAM,CAAC;YACN,GAAG,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["import type { A11yNode } from \"../../../types/private/snapshot.js\";\n\n/**\n * Render a formatted outline (with encoded ids) for the accessibility tree.\n * Keeps indentation logic shared between modules so unit tests can cover these\n * pure formatting helpers without a full snapshot pipeline.\n */\nexport function formatTreeLine(node: A11yNode, level = 0): string {\n  const indent = \"  \".repeat(level);\n  const labelId = node.encodedId ?? node.nodeId;\n  const label = `[${labelId}] ${node.role}${node.name ? `: ${cleanText(node.name)}` : \"\"}`;\n  const kids =\n    node.children?.map((c) => formatTreeLine(c, level + 1)).join(\"\\n\") ?? \"\";\n  return kids ? `${indent}${label}\\n${kids}` : `${indent}${label}`;\n}\n\n/**\n * Inject each child frame outline under the parent's iframe node line.\n * Keys in `idToTree` are the parent's iframe encoded ids.\n */\nexport function injectSubtrees(\n  rootOutline: string,\n  idToTree: Map<string, string>,\n): string {\n  type Frame = { lines: string[]; i: number };\n  const out: string[] = [];\n  const visited = new Set<string>();\n  const stack: Frame[] = [{ lines: rootOutline.split(\"\\n\"), i: 0 }];\n\n  while (stack.length) {\n    const top = stack[stack.length - 1];\n    if (top.i >= top.lines.length) {\n      stack.pop();\n      continue;\n    }\n\n    const raw = top.lines[top.i++];\n    out.push(raw);\n\n    const indent = raw.match(/^(\\s*)/)?.[1] ?? \"\";\n    const content = raw.slice(indent.length);\n\n    const m = content.match(/^\\[([^\\]]+)]/);\n    if (!m) continue;\n\n    const encId = m[1]!;\n    const childOutline = idToTree.get(encId);\n    if (!childOutline || visited.has(encId)) continue;\n\n    visited.add(encId);\n\n    const fullyInjectedChild = injectSubtrees(childOutline, idToTree);\n    out.push(indentBlock(fullyInjectedChild.trimEnd(), indent + \"  \"));\n  }\n\n  return out.join(\"\\n\");\n}\n\nexport function indentBlock(block: string, indent: string): string {\n  if (!block) return \"\";\n  return block\n    .split(\"\\n\")\n    .map((line) => (line.length ? indent + line : indent + line))\n    .join(\"\\n\");\n}\n\n/**\n * Return the lines that appear in `nextTree` but not in `prevTree`.\n * Comparison is done line-by-line, ignoring leading whitespace in both trees.\n * The returned block is re-indented so the minimal indent becomes column 0.\n */\nexport function diffCombinedTrees(prevTree: string, nextTree: string): string {\n  const prevSet = new Set(\n    (prevTree || \"\")\n      .split(\"\\n\")\n      .map((l) => l.trim())\n      .filter((l) => l.length > 0),\n  );\n\n  const nextLines = (nextTree || \"\").split(\"\\n\");\n  const added: string[] = [];\n  for (const line of nextLines) {\n    const core = line.trim();\n    if (!core) continue;\n    if (!prevSet.has(core)) added.push(line);\n  }\n\n  if (added.length === 0) return \"\";\n\n  let minIndent = Infinity;\n  for (const l of added) {\n    if (!l.trim()) continue;\n    const m = l.match(/^\\s*/);\n    const indentLen = m ? m[0]!.length : 0;\n    if (indentLen < minIndent) minIndent = indentLen;\n  }\n  if (!isFinite(minIndent)) minIndent = 0;\n\n  const out = added.map((l) =>\n    l.length >= minIndent ? l.slice(minIndent) : l,\n  );\n  return out.join(\"\\n\");\n}\n\n/**\n * Remove whitespace noise and invisible code points before rendering names.\n */\nexport function cleanText(input: string): string {\n  const PUA_START = 0xe000;\n  const PUA_END = 0xf8ff;\n  const NBSP = new Set<number>([0x00a0, 0x202f, 0x2007, 0xfeff]);\n\n  let out = \"\";\n  let prevSpace = false;\n  for (let i = 0; i < input.length; i++) {\n    const code = input.charCodeAt(i);\n    if (code >= PUA_START && code <= PUA_END) continue;\n    if (NBSP.has(code)) {\n      if (!prevSpace) {\n        out += \" \";\n        prevSpace = true;\n      }\n      continue;\n    }\n    out += input[i];\n    prevSpace = input[i] === \" \";\n  }\n  return out.trim();\n}\n\n/**\n * Collapse all whitespace runs in a string to a single space without trimming.\n * Exported for pruning routines that need the same normalization.\n */\nexport function normaliseSpaces(s: string): string {\n  let out = \"\";\n  let inWs = false;\n  for (let i = 0; i < s.length; i++) {\n    const ch = s[i]!;\n    const isWs = /\\s/.test(ch);\n    if (isWs) {\n      if (!inWs) {\n        out += \" \";\n        inWs = true;\n      }\n    } else {\n      out += ch;\n      inWs = false;\n    }\n  }\n  return out;\n}\n"]}

package/dist/esm/lib/v3/understudy/a11y/snapshot/xpathUtils.d.ts

@@ -0,0 +1,26 @@
+import type { Protocol } from "devtools-protocol";
+import type { CDPSessionLike } from "../../cdp.js";
+/**
+ * Build the absolute XPath for a node by walking through every iframe host
+ * we've traversed so far followed by the leaf backend node.
+ */
+export declare function buildAbsoluteXPathFromChain(chain: Array<{
+    parentSession: CDPSessionLike;
+    iframeBackendNodeId: number;
+}>, leafSession: CDPSessionLike, leafBackendNodeId: number): Promise<string | null>;
+/**
+ * Resolve a backend node to an absolute XPath within the provided session.
+ * The CDP Runtime is used so we can invoke a small helper that walks the DOM.
+ */
+export declare function absoluteXPathForBackendNode(session: CDPSessionLike, backendNodeId: number): Promise<string | null>;
+/**
+ * Prefix `child` XPath with an absolute iframe path `parentAbs`.
+ * Handles root slashes and shadow hops (“//”) cleanly.
+ */
+export declare function prefixXPath(parentAbs: string, child: string): string;
+/** Normalize an XPath: strip `xpath=`, ensure leading '/', remove trailing '/'. */
+export declare function normalizeXPath(x?: string): string;
+/** Build per-sibling XPath steps for DOM traversal. */
+export declare function buildChildXPathSegments(kids: Protocol.DOM.Node[]): string[];
+/** Join two XPath fragments while preserving special shadow-root hops. */
+export declare function joinXPath(base: string, step: string): string;

package/dist/esm/lib/v3/understudy/a11y/snapshot/xpathUtils.js

@@ -0,0 +1,102 @@
+import { a11yScriptSources } from "../../../dom/build/a11yScripts.generated.js";
+/**
+ * Build the absolute XPath for a node by walking through every iframe host
+ * we've traversed so far followed by the leaf backend node.
+ */
+export async function buildAbsoluteXPathFromChain(chain, leafSession, leafBackendNodeId) {
+    let prefix = "";
+    for (const step of chain) {
+        const xp = await absoluteXPathForBackendNode(step.parentSession, step.iframeBackendNodeId);
+        if (!xp)
+            continue;
+        prefix = prefix ? prefixXPath(prefix, xp) : normalizeXPath(xp);
+    }
+    const leaf = await absoluteXPathForBackendNode(leafSession, leafBackendNodeId);
+    if (!leaf)
+        return prefix || "/";
+    return prefix ? prefixXPath(prefix, leaf) : normalizeXPath(leaf);
+}
+/**
+ * Resolve a backend node to an absolute XPath within the provided session.
+ * The CDP Runtime is used so we can invoke a small helper that walks the DOM.
+ */
+export async function absoluteXPathForBackendNode(session, backendNodeId) {
+    try {
+        const { object } = await session.send("DOM.resolveNode", { backendNodeId });
+        const objectId = object?.objectId;
+        if (!objectId)
+            return null;
+        const { result } = await session.send("Runtime.callFunctionOn", {
+            objectId,
+            functionDeclaration: a11yScriptSources.nodeToAbsoluteXPath,
+            returnByValue: true,
+        });
+        await session.send("Runtime.releaseObject", { objectId }).catch(() => { });
+        return typeof result?.value === "string" && result.value
+            ? result.value
+            : null;
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Prefix `child` XPath with an absolute iframe path `parentAbs`.
+ * Handles root slashes and shadow hops (“//”) cleanly.
+ */
+export function prefixXPath(parentAbs, child) {
+    const p = parentAbs === "/" ? "" : parentAbs.replace(/\/$/, "");
+    if (!child || child === "/")
+        return p || "/";
+    if (child.startsWith("//"))
+        return p ? `${p}//${child.slice(2)}` : `//${child.slice(2)}`;
+    const c = child.replace(/^\//, "");
+    return p ? `${p}/${c}` : `/${c}`;
+}
+/** Normalize an XPath: strip `xpath=`, ensure leading '/', remove trailing '/'. */
+export function normalizeXPath(x) {
+    if (!x)
+        return "";
+    let s = x.trim().replace(/^xpath=/i, "");
+    if (!s.startsWith("/"))
+        s = "/" + s;
+    if (s.length > 1 && s.endsWith("/"))
+        s = s.slice(0, -1);
+    return s;
+}
+/** Build per-sibling XPath steps for DOM traversal. */
+export function buildChildXPathSegments(kids) {
+    const segs = [];
+    const ctr = {};
+    for (const child of kids) {
+        const tag = String(child.nodeName).toLowerCase();
+        const key = `${child.nodeType}:${tag}`;
+        const idx = (ctr[key] = (ctr[key] ?? 0) + 1);
+        if (child.nodeType === 3) {
+            segs.push(`text()[${idx}]`);
+        }
+        else if (child.nodeType === 8) {
+            segs.push(`comment()[${idx}]`);
+        }
+        else {
+            segs.push(tag.includes(":") ? `*[name()='${tag}'][${idx}]` : `${tag}[${idx}]`);
+        }
+    }
+    return segs;
+}
+/** Join two XPath fragments while preserving special shadow-root hops. */
+export function joinXPath(base, step) {
+    if (step === "//") {
+        if (!base || base === "/")
+            return "//";
+        return base.endsWith("/") ? `${base}/` : `${base}//`;
+    }
+    if (!base || base === "/")
+        return step ? `/${step}` : "/";
+    if (base.endsWith("//"))
+        return `${base}${step}`;
+    if (!step)
+        return base;
+    return `${base}/${step}`;
+}
+//# sourceMappingURL=xpathUtils.js.map

package/dist/esm/lib/v3/understudy/a11y/snapshot/xpathUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"xpathUtils.js","sourceRoot":"","sources":["../../../../../../../lib/v3/understudy/a11y/snapshot/xpathUtils.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,iBAAiB,EAAE,MAAM,6CAA6C,CAAC;AAEhF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,KAGE,EACF,WAA2B,EAC3B,iBAAyB;IAEzB,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,MAAM,2BAA2B,CAC1C,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,mBAAmB,CACzB,CAAC;QACF,IAAI,CAAC,EAAE;YAAE,SAAS;QAClB,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACjE,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,2BAA2B,CAC5C,WAAW,EACX,iBAAiB,CAClB,CAAC;IACF,IAAI,CAAC,IAAI;QAAE,OAAO,MAAM,IAAI,GAAG,CAAC;IAChC,OAAO,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,OAAuB,EACvB,aAAqB;IAErB,IAAI,CAAC;QACH,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,CACnC,iBAAiB,EACjB,EAAE,aAAa,EAAE,CAClB,CAAC;QACF,MAAM,QAAQ,GAAG,MAAM,EAAE,QAAQ,CAAC;QAClC,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,CACnC,wBAAwB,EACxB;YACE,QAAQ;YACR,mBAAmB,EAAE,iBAAiB,CAAC,mBAAmB;YAC1D,aAAa,EAAE,IAAI;SACpB,CACF,CAAC;QACF,MAAM,OAAO,CAAC,IAAI,CAAC,uBAAuB,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC1E,OAAO,OAAO,MAAM,EAAE,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK;YACtD,CAAC,CAAC,MAAM,CAAC,KAAK;YACd,CAAC,CAAC,IAAI,CAAC;IACX,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,KAAa;IAC1D,MAAM,CAAC,GAAG,SAAS,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChE,IAAI,CAAC,KAAK,IAAI,KAAK,KAAK,GAAG;QAAE,OAAO,CAAC,IAAI,GAAG,CAAC;IAC7C,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;QACxB,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACnC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;AACnC,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,cAAc,CAAC,CAAU;IACvC,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;IACzC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,uBAAuB,CAAC,IAAyB;IAC/D,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC;QACjD,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,GAAG,EAAE,CAAC;QACvC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC9B,CAAC;aAAM,IAAI,KAAK,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CACP,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,CACpE,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,IAAY;IAClD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QACvC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC;IACvD,CAAC;IACD,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;IAC1D,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,GAAG,IAAI,GAAG,IAAI,EAAE,CAAC;IACjD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,OAAO,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC;AAC3B,CAAC","sourcesContent":["import type { Protocol } from \"devtools-protocol\";\nimport type { CDPSessionLike } from \"../../cdp.js\";\nimport { a11yScriptSources } from \"../../../dom/build/a11yScripts.generated.js\";\n\n/**\n * Build the absolute XPath for a node by walking through every iframe host\n * we've traversed so far followed by the leaf backend node.\n */\nexport async function buildAbsoluteXPathFromChain(\n  chain: Array<{\n    parentSession: CDPSessionLike;\n    iframeBackendNodeId: number;\n  }>,\n  leafSession: CDPSessionLike,\n  leafBackendNodeId: number,\n): Promise<string | null> {\n  let prefix = \"\";\n  for (const step of chain) {\n    const xp = await absoluteXPathForBackendNode(\n      step.parentSession,\n      step.iframeBackendNodeId,\n    );\n    if (!xp) continue;\n    prefix = prefix ? prefixXPath(prefix, xp) : normalizeXPath(xp);\n  }\n  const leaf = await absoluteXPathForBackendNode(\n    leafSession,\n    leafBackendNodeId,\n  );\n  if (!leaf) return prefix || \"/\";\n  return prefix ? prefixXPath(prefix, leaf) : normalizeXPath(leaf);\n}\n\n/**\n * Resolve a backend node to an absolute XPath within the provided session.\n * The CDP Runtime is used so we can invoke a small helper that walks the DOM.\n */\nexport async function absoluteXPathForBackendNode(\n  session: CDPSessionLike,\n  backendNodeId: number,\n): Promise<string | null> {\n  try {\n    const { object } = await session.send<{ object: { objectId?: string } }>(\n      \"DOM.resolveNode\",\n      { backendNodeId },\n    );\n    const objectId = object?.objectId;\n    if (!objectId) return null;\n\n    const { result } = await session.send<{ result: { value?: string } }>(\n      \"Runtime.callFunctionOn\",\n      {\n        objectId,\n        functionDeclaration: a11yScriptSources.nodeToAbsoluteXPath,\n        returnByValue: true,\n      },\n    );\n    await session.send(\"Runtime.releaseObject\", { objectId }).catch(() => {});\n    return typeof result?.value === \"string\" && result.value\n      ? result.value\n      : null;\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Prefix `child` XPath with an absolute iframe path `parentAbs`.\n * Handles root slashes and shadow hops (“//”) cleanly.\n */\nexport function prefixXPath(parentAbs: string, child: string): string {\n  const p = parentAbs === \"/\" ? \"\" : parentAbs.replace(/\\/$/, \"\");\n  if (!child || child === \"/\") return p || \"/\";\n  if (child.startsWith(\"//\"))\n    return p ? `${p}//${child.slice(2)}` : `//${child.slice(2)}`;\n  const c = child.replace(/^\\//, \"\");\n  return p ? `${p}/${c}` : `/${c}`;\n}\n\n/** Normalize an XPath: strip `xpath=`, ensure leading '/', remove trailing '/'. */\nexport function normalizeXPath(x?: string): string {\n  if (!x) return \"\";\n  let s = x.trim().replace(/^xpath=/i, \"\");\n  if (!s.startsWith(\"/\")) s = \"/\" + s;\n  if (s.length > 1 && s.endsWith(\"/\")) s = s.slice(0, -1);\n  return s;\n}\n\n/** Build per-sibling XPath steps for DOM traversal. */\nexport function buildChildXPathSegments(kids: Protocol.DOM.Node[]): string[] {\n  const segs: string[] = [];\n  const ctr: Record<string, number> = {};\n  for (const child of kids) {\n    const tag = String(child.nodeName).toLowerCase();\n    const key = `${child.nodeType}:${tag}`;\n    const idx = (ctr[key] = (ctr[key] ?? 0) + 1);\n    if (child.nodeType === 3) {\n      segs.push(`text()[${idx}]`);\n    } else if (child.nodeType === 8) {\n      segs.push(`comment()[${idx}]`);\n    } else {\n      segs.push(\n        tag.includes(\":\") ? `*[name()='${tag}'][${idx}]` : `${tag}[${idx}]`,\n      );\n    }\n  }\n  return segs;\n}\n\n/** Join two XPath fragments while preserving special shadow-root hops. */\nexport function joinXPath(base: string, step: string): string {\n  if (step === \"//\") {\n    if (!base || base === \"/\") return \"//\";\n    return base.endsWith(\"/\") ? `${base}/` : `${base}//`;\n  }\n  if (!base || base === \"/\") return step ? `/${step}` : \"/\";\n  if (base.endsWith(\"//\")) return `${base}${step}`;\n  if (!step) return base;\n  return `${base}/${step}`;\n}\n"]}

package/dist/esm/lib/v3/understudy/a11yInvocation.d.ts

@@ -0,0 +1,8 @@
+import { type A11yScriptName } from "../dom/build/a11yScripts.generated.js";
+/**
+ * Wrap a generated a11y script in a self-invoking expression that first ensures
+ * the bootstrap has run, then calls the requested helper via its global ref.
+ * This mirrors the locator resolver’s injection path so any CDP Runtime.evaluate
+ * can reuse the shared bundle without inlining JS strings.
+ */
+export declare function buildA11yInvocation(name: A11yScriptName, args: string[]): string;

package/dist/esm/lib/v3/understudy/a11yInvocation.js

@@ -0,0 +1,12 @@
+import { a11yScriptBootstrap, a11yScriptGlobalRefs, } from "../dom/build/a11yScripts.generated.js";
+/**
+ * Wrap a generated a11y script in a self-invoking expression that first ensures
+ * the bootstrap has run, then calls the requested helper via its global ref.
+ * This mirrors the locator resolver’s injection path so any CDP Runtime.evaluate
+ * can reuse the shared bundle without inlining JS strings.
+ */
+export function buildA11yInvocation(name, args) {
+    const invocation = `${a11yScriptGlobalRefs[name]}(${args.join(", ")})`;
+    return `(() => { ${a11yScriptBootstrap}; return ${invocation}; })()`;
+}
+//# sourceMappingURL=a11yInvocation.js.map

package/dist/esm/lib/v3/understudy/a11yInvocation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"a11yInvocation.js","sourceRoot":"","sources":["../../../../../lib/v3/understudy/a11yInvocation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,mBAAmB,EACnB,oBAAoB,GAErB,MAAM,uCAAuC,CAAC;AAE/C;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAoB,EACpB,IAAc;IAEd,MAAM,UAAU,GAAG,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;IACvE,OAAO,YAAY,mBAAmB,YAAY,UAAU,QAAQ,CAAC;AACvE,CAAC","sourcesContent":["import {\n  a11yScriptBootstrap,\n  a11yScriptGlobalRefs,\n  type A11yScriptName,\n} from \"../dom/build/a11yScripts.generated.js\";\n\n/**\n * Wrap a generated a11y script in a self-invoking expression that first ensures\n * the bootstrap has run, then calls the requested helper via its global ref.\n * This mirrors the locator resolver’s injection path so any CDP Runtime.evaluate\n * can reuse the shared bundle without inlining JS strings.\n */\nexport function buildA11yInvocation(\n  name: A11yScriptName,\n  args: string[],\n): string {\n  const invocation = `${a11yScriptGlobalRefs[name]}(${args.join(\", \")})`;\n  return `(() => { ${a11yScriptBootstrap}; return ${invocation}; })()`;\n}\n"]}

package/dist/esm/lib/v3/understudy/cdp.d.ts

@@ -0,0 +1,69 @@
+import type { Protocol } from "devtools-protocol";
+/**
+ * CDP transport & session multiplexer
+ *
+ * Owns the browser WebSocket and multiplexes flattened Target sessions.
+ * Tracks inflight CDP calls, routes responses to the right session, and forwards events.
+ *
+ * This does not interpret Page/DOM/Runtime semantics — callers own that logic.
+ */
+export interface CDPSessionLike {
+    send<R = unknown>(method: string, params?: object): Promise<R>;
+    on<P = unknown>(event: string, handler: (params: P) => void): void;
+    off<P = unknown>(event: string, handler: (params: P) => void): void;
+    close(): Promise<void>;
+    readonly id: string | null;
+}
+type EventHandler = (params: unknown) => void;
+export declare class CdpConnection implements CDPSessionLike {
+    private ws;
+    private nextId;
+    private inflight;
+    private eventHandlers;
+    private sessions;
+    /** Maps sessionId -> targetId (1:1 mapping) */
+    private sessionToTarget;
+    readonly id: string | null;
+    private transportCloseHandlers;
+    /** Optional CDP logger - set this to receive all outgoing CDP method calls */
+    cdpLogger?: (info: {
+        method: string;
+        params?: object;
+        targetId?: string | null;
+    }) => void;
+    /** Optional CDP event logger - set this to receive all incoming CDP events */
+    cdpEventLogger?: (info: {
+        method: string;
+        params?: unknown;
+        targetId?: string | null;
+    }) => void;
+    onTransportClosed(handler: (why: string) => void): void;
+    offTransportClosed(handler: (why: string) => void): void;
+    private emitTransportClosed;
+    private constructor();
+    static connect(wsUrl: string): Promise<CdpConnection>;
+    enableAutoAttach(): Promise<void>;
+    send<R = unknown>(method: string, params?: object): Promise<R>;
+    on<P = unknown>(event: string, handler: (params: P) => void): void;
+    off<P = unknown>(event: string, handler: (params: P) => void): void;
+    close(): Promise<void>;
+    getSession(sessionId: string): CdpSession | undefined;
+    attachToTarget(targetId: string): Promise<CdpSession>;
+    getTargets(): Promise<Protocol.Target.TargetInfo[]>;
+    private onMessage;
+    _sendViaSession<R = unknown>(sessionId: string, method: string, params?: object): Promise<R>;
+    _onSessionEvent(sessionId: string, event: string, handler: EventHandler): void;
+    _offSessionEvent(sessionId: string, event: string, handler: EventHandler): void;
+    _dispatchToSession(sessionId: string, event: string, params: unknown): void;
+}
+export declare class CdpSession implements CDPSessionLike {
+    private readonly root;
+    readonly id: string;
+    constructor(root: CdpConnection, id: string);
+    send<R = unknown>(method: string, params?: object): Promise<R>;
+    on<P = unknown>(event: string, handler: (params: P) => void): void;
+    off<P = unknown>(event: string, handler: (params: P) => void): void;
+    close(): Promise<void>;
+    dispatch(event: string, params: unknown): void;
+}
+export {};