@a11y-pulse/browser-adaptor 0.1.0 → 0.2.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/adaptor.d.ts +3 -4
- package/dist/adaptors/puppeteer.js +12 -5
- package/dist/adaptors/puppeteer.js.map +1 -1
- package/dist/clip.d.ts +7 -0
- package/dist/dom.js.map +1 -1
- package/dist/get-selector.d.ts +2 -2
- package/dist/index.d.ts +1 -0
- package/dist/index.js +16 -0
- package/dist/index.js.map +1 -1
- package/package.json +1 -1
package/dist/adaptor.d.ts
CHANGED
|
@@ -10,8 +10,8 @@ export type Rect = {
|
|
|
10
10
|
*/
|
|
11
11
|
export type ElementRef = unknown;
|
|
12
12
|
/**
|
|
13
|
-
* A framework-specific adaptor that provides the primitives needed by tab-loop audits. An
|
|
14
|
-
*
|
|
13
|
+
* A framework-specific adaptor that provides the primitives needed by tab-loop audits. An adaptor
|
|
14
|
+
* wraps a single page in a web browser.
|
|
15
15
|
*/
|
|
16
16
|
export interface BrowserAdaptor {
|
|
17
17
|
/**
|
|
@@ -40,8 +40,7 @@ export interface BrowserAdaptor {
|
|
|
40
40
|
screenshotClip(clip: Rect): Promise<Uint8Array>;
|
|
41
41
|
/**
|
|
42
42
|
* Ensure the page reports focus for its lifetime. In particular, `document.hasFocus()` must
|
|
43
|
-
* function correctly and :focus styles must be applied, even when the page is not the
|
|
44
|
-
* foreground.
|
|
43
|
+
* function correctly and :focus styles must be applied, even when the page is not the foreground.
|
|
45
44
|
*
|
|
46
45
|
* This function must not throw.
|
|
47
46
|
*/
|
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
// src/adaptors/puppeteer.ts
|
|
2
|
-
var
|
|
2
|
+
var focusEmulationSessions = /* @__PURE__ */ new WeakMap();
|
|
3
3
|
var PuppeteerAdaptor = class {
|
|
4
4
|
constructor(page) {
|
|
5
5
|
this.page = page;
|
|
@@ -24,15 +24,22 @@ var PuppeteerAdaptor = class {
|
|
|
24
24
|
return await this.page.screenshot({ type: "png", clip });
|
|
25
25
|
}
|
|
26
26
|
async ensureFocusReporting() {
|
|
27
|
-
if (focusEmulationEnabled.has(this.page)) {
|
|
28
|
-
return;
|
|
29
|
-
}
|
|
30
27
|
try {
|
|
28
|
+
const existing = focusEmulationSessions.get(this.page);
|
|
29
|
+
if (existing) {
|
|
30
|
+
await existing.send("Emulation.setFocusEmulationEnabled", {
|
|
31
|
+
enabled: false
|
|
32
|
+
});
|
|
33
|
+
await existing.send("Emulation.setFocusEmulationEnabled", {
|
|
34
|
+
enabled: true
|
|
35
|
+
});
|
|
36
|
+
return;
|
|
37
|
+
}
|
|
31
38
|
const client = await this.page.createCDPSession();
|
|
32
39
|
await client.send("Emulation.setFocusEmulationEnabled", {
|
|
33
40
|
enabled: true
|
|
34
41
|
});
|
|
35
|
-
|
|
42
|
+
focusEmulationSessions.set(this.page, client);
|
|
36
43
|
} catch (error) {
|
|
37
44
|
console.warn("Could not enable focus emulation for the browser adaptor", {
|
|
38
45
|
error
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../../src/adaptors/puppeteer.ts"],"sourcesContent":["import type { JSHandle, Page } from \"puppeteer\";\nimport type { BrowserAdaptor, ElementRef, Rect } from \"../adaptor\";\n\n//
|
|
1
|
+
{"version":3,"sources":["../../src/adaptors/puppeteer.ts"],"sourcesContent":["import type { CDPSession, JSHandle, Page } from \"puppeteer\";\nimport type { BrowserAdaptor, ElementRef, Rect } from \"../adaptor\";\n\n// The CDP session holding focus emulation for each page. A fresh adaptor is created per audit run,\n// but a page often outlives one run, so without this each run would open another CDP session that\n// is never detached. The session is kept attached for the page's lifetime: Chrome clears the\n// emulation when the CDP client disconnects.\nconst focusEmulationSessions = new WeakMap<Page, CDPSession>();\n\n/** A BrowserAdaptor backed by a Puppeteer Page. */\nexport class PuppeteerAdaptor implements BrowserAdaptor {\n\tconstructor(private readonly page: Page) {}\n\n\tevaluate<T>(\n\t\t// biome-ignore lint/suspicious/noExplicitAny: the page-evaluated fn accepts arbitrary serialised args and element handles.\n\t\tfn: (...args: any[]) => T | Promise<T>,\n\t\t...args: unknown[]\n\t): Promise<T> {\n\t\t// Puppeteer resolves any JSHandle passed as an arg to the live element.\n\t\treturn this.page.evaluate(fn as never, ...(args as never[])) as Promise<T>;\n\t}\n\n\tevaluateHandle(fn: () => Element | null): Promise<ElementRef> {\n\t\treturn this.page.evaluateHandle(fn);\n\t}\n\n\tasync disposeRef(ref: ElementRef): Promise<void> {\n\t\tawait (ref as JSHandle).dispose();\n\t}\n\n\tasync pressTab(): Promise<void> {\n\t\tawait this.page.keyboard.press(\"Tab\");\n\t}\n\n\tasync pressEnter(): Promise<void> {\n\t\tawait this.page.keyboard.press(\"Enter\");\n\t}\n\n\tasync screenshotClip(clip: Rect): Promise<Uint8Array> {\n\t\treturn (await this.page.screenshot({ type: \"png\", clip })) as Uint8Array;\n\t}\n\n\tasync ensureFocusReporting(): Promise<void> {\n\t\t// Pages only report focus while they are the foreground tab. Since this browser instance is\n\t\t// likely running in the background, we need to enable focus emulation to get accurate results.\n\t\t//\n\t\t// Note this function does not throw if enabling emulation fails; it is a best-effort.\n\t\ttry {\n\t\t\tconst existing = focusEmulationSessions.get(this.page);\n\n\t\t\tif (existing) {\n\t\t\t\t// Chromium ignores a redundant enable, so re-asserting has to toggle.\n\t\t\t\tawait existing.send(\"Emulation.setFocusEmulationEnabled\", {\n\t\t\t\t\tenabled: false,\n\t\t\t\t});\n\t\t\t\tawait existing.send(\"Emulation.setFocusEmulationEnabled\", {\n\t\t\t\t\tenabled: true,\n\t\t\t\t});\n\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst client = await this.page.createCDPSession();\n\t\t\tawait client.send(\"Emulation.setFocusEmulationEnabled\", {\n\t\t\t\tenabled: true,\n\t\t\t});\n\t\t\tfocusEmulationSessions.set(this.page, client);\n\t\t} catch (error) {\n\t\t\tconsole.warn(\"Could not enable focus emulation for the browser adaptor\", {\n\t\t\t\terror,\n\t\t\t});\n\t\t}\n\t}\n}\n"],"mappings":";AAOA,IAAM,yBAAyB,oBAAI,QAA0B;AAGtD,IAAM,mBAAN,MAAiD;AAAA,EACvD,YAA6B,MAAY;AAAZ;AAAA,EAAa;AAAA,EAAb;AAAA,EAE7B,SAEC,OACG,MACU;AAEb,WAAO,KAAK,KAAK,SAAS,IAAa,GAAI,IAAgB;AAAA,EAC5D;AAAA,EAEA,eAAe,IAA+C;AAC7D,WAAO,KAAK,KAAK,eAAe,EAAE;AAAA,EACnC;AAAA,EAEA,MAAM,WAAW,KAAgC;AAChD,UAAO,IAAiB,QAAQ;AAAA,EACjC;AAAA,EAEA,MAAM,WAA0B;AAC/B,UAAM,KAAK,KAAK,SAAS,MAAM,KAAK;AAAA,EACrC;AAAA,EAEA,MAAM,aAA4B;AACjC,UAAM,KAAK,KAAK,SAAS,MAAM,OAAO;AAAA,EACvC;AAAA,EAEA,MAAM,eAAe,MAAiC;AACrD,WAAQ,MAAM,KAAK,KAAK,WAAW,EAAE,MAAM,OAAO,KAAK,CAAC;AAAA,EACzD;AAAA,EAEA,MAAM,uBAAsC;AAK3C,QAAI;AACH,YAAM,WAAW,uBAAuB,IAAI,KAAK,IAAI;AAErD,UAAI,UAAU;AAEb,cAAM,SAAS,KAAK,sCAAsC;AAAA,UACzD,SAAS;AAAA,QACV,CAAC;AACD,cAAM,SAAS,KAAK,sCAAsC;AAAA,UACzD,SAAS;AAAA,QACV,CAAC;AAED;AAAA,MACD;AAEA,YAAM,SAAS,MAAM,KAAK,KAAK,iBAAiB;AAChD,YAAM,OAAO,KAAK,sCAAsC;AAAA,QACvD,SAAS;AAAA,MACV,CAAC;AACD,6BAAuB,IAAI,KAAK,MAAM,MAAM;AAAA,IAC7C,SAAS,OAAO;AACf,cAAQ,KAAK,4DAA4D;AAAA,QACxE;AAAA,MACD,CAAC;AAAA,IACF;AAAA,EACD;AACD;","names":[]}
|
package/dist/clip.d.ts
ADDED
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
import type { Rect } from "./adaptor";
|
|
2
|
+
/**
|
|
3
|
+
* A screenshot clip framing `rect` with up to `buffer` pixels of padding on each side, shrunk where
|
|
4
|
+
* the page edges leave less room. The padding allows for indicators drawn just outside the element
|
|
5
|
+
* box (outlines, shadows) and for anti-aliasing.
|
|
6
|
+
*/
|
|
7
|
+
export declare function bufferedClip(rect: Rect, pageWidth: number, pageHeight: number, buffer: number): Rect;
|
package/dist/dom.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["../src/get-selector.ts","../src/truncate-html.ts"],"sourcesContent":["/**\n * Build a compact, hopefully-unique selector for any given element on the page. This function is\n * serialized and run in the page context, so it must not reference any symbols outside its own\n * scope.\n *\n * Mirrors axe-core's approach: each level contributes the fewest features that discriminate the\n * element (a unique id, the rarest single class, or an :nth-of-type position), and the walk stops\n * as soon as the joined selector matches exactly one element. Selectors stay short because of\n * that early stop, not because of truncation; the length budget is only a backstop.\n */\nexport function getSelector(root: Node | null): string {\n\tconst MAX_LENGTH = 128;\n\n\tconst esc = (value: string): string =>\n\t\ttypeof CSS !== \"undefined\" && typeof CSS.escape === \"function\"\n\t\t\t? CSS.escape(value)\n\t\t\t: value;\n\n\tconst tagName = (node: Node): string =>\n\t\tnode.nodeType === 1\n\t\t\t? node.nodeName.toLowerCase()\n\t\t\t: node.nodeName.toUpperCase().replace(/^#/, \"\");\n\n\t// A querySelectorAll-capable root (Document or ShadowRoot) for the element,\n\t// used to confirm uniqueness and class rarity. Absent on the plain objects\n\t// used in the serialisation unit tests, where we trust ids and walk to the\n\t// top instead of stopping early.\n\tconst rootOf = (element: Element): ParentNode | null => {\n\t\tconst node = (\n\t\t\telement as Element & { getRootNode?: () => Node }\n\t\t).getRootNode?.();\n\n\t\treturn node && typeof (node as ParentNode).querySelectorAll === \"function\"\n\t\t\t? (node as ParentNode)\n\t\t\t: null;\n\t};\n\n\tconst matchCount = (queryRoot: ParentNode, selector: string): number => {\n\t\ttry {\n\t\t\treturn queryRoot.querySelectorAll(selector).length;\n\t\t} catch {\n\t\t\t// A selector that fails to parse can't be relied on.\n\t\t\treturn Number.POSITIVE_INFINITY;\n\t\t}\n\t};\n\n\t// A candidate feature is only usable if it actually selects this element;\n\t// an escaping or engine mismatch (e.g. CSS string escapes in an attribute\n\t// value) could otherwise produce a selector that matches nothing. Or a\n\t// different element entirely.\n\tconst safeMatches = (element: Element, selector: string): boolean => {\n\t\ttry {\n\t\t\treturn typeof element.matches === \"function\" && element.matches(selector);\n\t\t} catch {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tconst idIsUnique = (element: Element, id: string): boolean => {\n\t\tconst queryRoot = rootOf(element);\n\n\t\treturn queryRoot === null || matchCount(queryRoot, `#${esc(id)}`) === 1;\n\t};\n\n\t// A discriminating feature for one level of the selector: its CSS text plus\n\t// a predicate telling whether a sibling would match the same feature (used\n\t// to decide if an :nth-of-type pin is still needed).\n\ttype Feature = {\n\t\tfeature: string;\n\t\tsharedBy: (sibling: Element) => boolean;\n\t};\n\n\tconst classFeature = (cls: string): Feature => ({\n\t\tfeature: `.${esc(cls)}`,\n\t\tsharedBy: (sibling) => Array.from(sibling.classList ?? []).includes(cls),\n\t});\n\n\t// The single feature that narrows the element down the most: the class or\n\t// href attribute with the fewest matches in the root. Hrefs break ties\n\t// between structurally-identical content blocks, where classes and\n\t// :nth-of-type (which only pins position within one parent) cannot. Without\n\t// a queryable root there is no rarity information, so the first class\n\t// stands in.\n\tconst rarestFeature = (\n\t\telement: Element,\n\t\tqueryRoot: ParentNode | null,\n\t): Feature | null => {\n\t\tconst classes = Array.from(element.classList).slice(0, 8);\n\n\t\tif (!queryRoot) {\n\t\t\tconst cls = classes[0];\n\n\t\t\treturn cls === undefined ? null : classFeature(cls);\n\t\t}\n\n\t\tlet best: Feature | null = null;\n\t\tlet bestCount = Number.POSITIVE_INFINITY;\n\n\t\tfor (const cls of classes) {\n\t\t\tconst candidate = classFeature(cls);\n\n\t\t\tif (!safeMatches(element, candidate.feature)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst count = matchCount(queryRoot, candidate.feature);\n\n\t\t\tif (count < bestCount) {\n\t\t\t\tbest = candidate;\n\t\t\t\tbestCount = count;\n\t\t\t}\n\n\t\t\tif (count === 1) {\n\t\t\t\treturn best;\n\t\t\t}\n\t\t}\n\n\t\tconst href =\n\t\t\ttypeof element.getAttribute === \"function\"\n\t\t\t\t? element.getAttribute(\"href\")\n\t\t\t\t: null;\n\n\t\t// Skip hrefs with characters that change meaning inside a CSS string\n\t\t// (quotes, backslashes), and query strings, which are too volatile\n\t\t// across scans to pin a selector to. Fragments (#main) stay eligible.\n\t\t// Skip links make stable discriminators.\n\t\tif (href && href.length <= 100 && !/[\"\\\\?]/.test(href)) {\n\t\t\tconst feature = `[href=\"${href}\"]`;\n\n\t\t\tif (\n\t\t\t\tsafeMatches(element, feature) &&\n\t\t\t\tmatchCount(queryRoot, feature) < bestCount\n\t\t\t) {\n\t\t\t\treturn {\n\t\t\t\t\tfeature,\n\t\t\t\t\tsharedBy: (sibling) =>\n\t\t\t\t\t\ttypeof sibling.getAttribute === \"function\" &&\n\t\t\t\t\t\tsibling.getAttribute(\"href\") === href,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn best;\n\t};\n\n\t// The element's 1-based position among same-tag siblings, and whether the\n\t// chosen feature fails to discriminate it from them (so the segment needs\n\t// an :nth-of-type pin). Siblings are absent on the serialisation test\n\t// nodes. There we skip the pin.\n\tconst positionAmongSiblings = (\n\t\telement: Element,\n\t\tsharedBy: (sibling: Element) => boolean,\n\t): { nth: number; ambiguous: boolean } => {\n\t\tconst siblings = (element.parentNode as ParentNode | null)?.children;\n\n\t\tif (!siblings) {\n\t\t\treturn { nth: 0, ambiguous: false };\n\t\t}\n\n\t\tlet nth = 0;\n\t\tlet count = 0;\n\t\tlet shared = 0;\n\n\t\tfor (const sibling of Array.from(siblings)) {\n\t\t\tif (sibling.nodeName !== element.nodeName) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tcount++;\n\n\t\t\tif (sibling === element) {\n\t\t\t\tnth = count;\n\t\t\t}\n\n\t\t\tif (sharedBy(sibling)) {\n\t\t\t\tshared++;\n\t\t\t}\n\t\t}\n\n\t\treturn { nth, ambiguous: shared > 1 };\n\t};\n\n\tconst segmentFor = (\n\t\telement: Element,\n\t\tqueryRoot: ParentNode | null,\n\t): { segment: string; anchored: boolean } => {\n\t\t// Only treat an id as an absolute anchor when it actually resolves to a\n\t\t// single element: pages with duplicate ids would otherwise yield a\n\t\t// selector (e.g. \"#dup>a\") that matches several elements.\n\t\tif (element.id && idIsUnique(element, element.id)) {\n\t\t\treturn { segment: `#${esc(element.id)}`, anchored: true };\n\t\t}\n\n\t\tconst feature = rarestFeature(element, queryRoot);\n\t\tlet segment = tagName(element) + (feature === null ? \"\" : feature.feature);\n\n\t\t// When same-tag siblings share the chosen feature, pin the position so the\n\t\t// segment selects exactly this element rather than all of them.\n\t\tconst { nth, ambiguous } = positionAmongSiblings(\n\t\t\telement,\n\t\t\tfeature === null ? () => true : feature.sharedBy,\n\t\t);\n\n\t\tif (ambiguous && nth > 0) {\n\t\t\tsegment += `:nth-of-type(${nth})`;\n\t\t}\n\n\t\treturn { segment, anchored: false };\n\t};\n\n\t// A minimal segment for when a level's full segment would blow the budget\n\t// (e.g. an enormous class name or a long href): just the tag, pinned by\n\t// position when same-tag siblings would make the bare tag ambiguous.\n\tconst degradedSegmentFor = (element: Element): string => {\n\t\tlet segment = tagName(element);\n\n\t\tconst { nth, ambiguous } = positionAmongSiblings(element, () => true);\n\n\t\tif (ambiguous && nth > 0) {\n\t\t\tsegment += `:nth-of-type(${nth})`;\n\t\t}\n\n\t\treturn segment;\n\t};\n\n\tconst segments: string[] = [];\n\tlet node: Node | null = root;\n\tconst queryRoot =\n\t\troot && root.nodeType === 1 ? rootOf(root as Element) : null;\n\n\ttry {\n\t\t// Walk only element nodes. Stopping at the first non-element parent (the\n\t\t// document, or a ShadowRoot when the target is inside an open shadow root)\n\t\t// keeps the selector within its tree and avoids reading `classList` off a\n\t\t// node that has none.\n\t\twhile (node && node.nodeType === 1) {\n\t\t\tconst element = node as Element;\n\t\t\tlet { segment, anchored } = segmentFor(element, queryRoot);\n\n\t\t\t// Keep within the budget (the +1 accounts for the \">\" that would join\n\t\t\t// this segment to the rest). A level whose full segment doesn't fit is\n\t\t\t// degraded to tag + position rather than discarded, so ancestor context\n\t\t\t// is never lost to one long feature.\n\t\t\tconst joinedWith = (candidate: string): number =>\n\t\t\t\tsegments.length\n\t\t\t\t\t? candidate.length + 1 + segments.join(\">\").length\n\t\t\t\t\t: candidate.length;\n\n\t\t\tif (joinedWith(segment) > MAX_LENGTH - 1) {\n\t\t\t\tsegment = degradedSegmentFor(element);\n\t\t\t\tanchored = false;\n\n\t\t\t\tif (joinedWith(segment) > MAX_LENGTH - 1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsegments.unshift(segment);\n\n\t\t\tif (anchored) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Stop as soon as the selector already identifies a single element.\n\t\t\t// This, not truncation, is what keeps selectors short.\n\t\t\tif (queryRoot && matchCount(queryRoot, segments.join(\">\")) === 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tnode = element.parentNode;\n\t\t}\n\t} catch {\n\t\t// A malformed node tree must never crash the audit; return what we have.\n\t}\n\n\treturn segments.join(\">\");\n}\n","const DEFAULT_MAX_ATTRIBUTE_VALUE_LENGTH = 50;\nconst DEFAULT_MAX_LENGTH = 300;\nconst ELLIPSIS = \"...\";\n\nexport type TruncateHtmlOptions = {\n\tmaxAttributeValueLength?: number;\n\tmaxLength?: number;\n};\n\n/**\n * Given an element's outerHTML, produce a truncated version suitable for display in results. For\n * memory efficiency, pass a shallow outerHTML i.e. `Node.cloneNode(false).outerHTML`.\n */\nexport function truncateHtml(\n\thtml: string,\n\toptions: TruncateHtmlOptions = {},\n): string {\n\tif (!html) {\n\t\treturn \"\";\n\t}\n\n\tconst maxAttributeValueLength =\n\t\toptions.maxAttributeValueLength ?? DEFAULT_MAX_ATTRIBUTE_VALUE_LENGTH;\n\tconst maxLength = options.maxLength ?? DEFAULT_MAX_LENGTH;\n\n\t// Keep only the opening tag\n\tconst closingBracket = html.indexOf(\">\");\n\tconst openingTag =\n\t\tclosingBracket === -1 ? html : html.slice(0, closingBracket + 1);\n\n\t// Shorten long quoted attribute values, preserving the quote style.\n\tconst trimmed = openingTag.replace(\n\t\t/=([\"'])([\\s\\S]*?)\\1/g,\n\t\t(match, quote: string, value: string) => {\n\t\t\tif (value.length <= maxAttributeValueLength) {\n\t\t\t\treturn match;\n\t\t\t}\n\n\t\t\treturn `=${quote}${value.slice(0, maxAttributeValueLength)}${ELLIPSIS}${quote}`;\n\t\t},\n\t);\n\n\tif (trimmed.length > maxLength) {\n\t\treturn `${trimmed.slice(0, maxLength)}${ELLIPSIS}`;\n\t}\n\n\treturn trimmed;\n}\n"],"mappings":";AAUO,SAAS,YAAY,MAA2B;AACtD,QAAM,aAAa;AAEnB,QAAM,MAAM,CAAC,UACZ,OAAO,QAAQ,eAAe,OAAO,IAAI,WAAW,aACjD,IAAI,OAAO,KAAK,IAChB;AAEJ,QAAM,UAAU,CAACA,UAChBA,MAAK,aAAa,IACfA,MAAK,SAAS,YAAY,IAC1BA,MAAK,SAAS,YAAY,EAAE,QAAQ,MAAM,EAAE;AAMhD,QAAM,SAAS,CAAC,YAAwC;AACvD,UAAMA,QACL,QACC,cAAc;AAEhB,WAAOA,SAAQ,OAAQA,MAAoB,qBAAqB,aAC5DA,QACD;AAAA,EACJ;AAEA,QAAM,aAAa,CAACC,YAAuB,aAA6B;AACvE,QAAI;AACH,aAAOA,WAAU,iBAAiB,QAAQ,EAAE;AAAA,IAC7C,QAAQ;AAEP,aAAO,OAAO;AAAA,IACf;AAAA,EACD;AAMA,QAAM,cAAc,CAAC,SAAkB,aAA8B;AACpE,QAAI;AACH,aAAO,OAAO,QAAQ,YAAY,cAAc,QAAQ,QAAQ,QAAQ;AAAA,IACzE,QAAQ;AACP,aAAO;AAAA,IACR;AAAA,EACD;AAEA,QAAM,aAAa,CAAC,SAAkB,OAAwB;AAC7D,UAAMA,aAAY,OAAO,OAAO;AAEhC,WAAOA,eAAc,QAAQ,WAAWA,YAAW,IAAI,IAAI,EAAE,CAAC,EAAE,MAAM;AAAA,EACvE;AAUA,QAAM,eAAe,CAAC,SAA0B;AAAA,IAC/C,SAAS,IAAI,IAAI,GAAG,CAAC;AAAA,IACrB,UAAU,CAAC,YAAY,MAAM,KAAK,QAAQ,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG;AAAA,EACxE;AAQA,QAAM,gBAAgB,CACrB,SACAA,eACoB;AACpB,UAAM,UAAU,MAAM,KAAK,QAAQ,SAAS,EAAE,MAAM,GAAG,CAAC;AAExD,QAAI,CAACA,YAAW;AACf,YAAM,MAAM,QAAQ,CAAC;AAErB,aAAO,QAAQ,SAAY,OAAO,aAAa,GAAG;AAAA,IACnD;AAEA,QAAI,OAAuB;AAC3B,QAAI,YAAY,OAAO;AAEvB,eAAW,OAAO,SAAS;AAC1B,YAAM,YAAY,aAAa,GAAG;AAElC,UAAI,CAAC,YAAY,SAAS,UAAU,OAAO,GAAG;AAC7C;AAAA,MACD;AAEA,YAAM,QAAQ,WAAWA,YAAW,UAAU,OAAO;AAErD,UAAI,QAAQ,WAAW;AACtB,eAAO;AACP,oBAAY;AAAA,MACb;AAEA,UAAI,UAAU,GAAG;AAChB,eAAO;AAAA,MACR;AAAA,IACD;AAEA,UAAM,OACL,OAAO,QAAQ,iBAAiB,aAC7B,QAAQ,aAAa,MAAM,IAC3B;AAMJ,QAAI,QAAQ,KAAK,UAAU,OAAO,CAAC,SAAS,KAAK,IAAI,GAAG;AACvD,YAAM,UAAU,UAAU,IAAI;AAE9B,UACC,YAAY,SAAS,OAAO,KAC5B,WAAWA,YAAW,OAAO,IAAI,WAChC;AACD,eAAO;AAAA,UACN;AAAA,UACA,UAAU,CAAC,YACV,OAAO,QAAQ,iBAAiB,cAChC,QAAQ,aAAa,MAAM,MAAM;AAAA,QACnC;AAAA,MACD;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAMA,QAAM,wBAAwB,CAC7B,SACA,aACyC;AACzC,UAAM,WAAY,QAAQ,YAAkC;AAE5D,QAAI,CAAC,UAAU;AACd,aAAO,EAAE,KAAK,GAAG,WAAW,MAAM;AAAA,IACnC;AAEA,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,QAAI,SAAS;AAEb,eAAW,WAAW,MAAM,KAAK,QAAQ,GAAG;AAC3C,UAAI,QAAQ,aAAa,QAAQ,UAAU;AAC1C;AAAA,MACD;AAEA;AAEA,UAAI,YAAY,SAAS;AACxB,cAAM;AAAA,MACP;AAEA,UAAI,SAAS,OAAO,GAAG;AACtB;AAAA,MACD;AAAA,IACD;AAEA,WAAO,EAAE,KAAK,WAAW,SAAS,EAAE;AAAA,EACrC;AAEA,QAAM,aAAa,CAClB,SACAA,eAC4C;AAI5C,QAAI,QAAQ,MAAM,WAAW,SAAS,QAAQ,EAAE,GAAG;AAClD,aAAO,EAAE,SAAS,IAAI,IAAI,QAAQ,EAAE,CAAC,IAAI,UAAU,KAAK;AAAA,IACzD;AAEA,UAAM,UAAU,cAAc,SAASA,UAAS;AAChD,QAAI,UAAU,QAAQ,OAAO,KAAK,YAAY,OAAO,KAAK,QAAQ;AAIlE,UAAM,EAAE,KAAK,UAAU,IAAI;AAAA,MAC1B;AAAA,MACA,YAAY,OAAO,MAAM,OAAO,QAAQ;AAAA,IACzC;AAEA,QAAI,aAAa,MAAM,GAAG;AACzB,iBAAW,gBAAgB,GAAG;AAAA,IAC/B;AAEA,WAAO,EAAE,SAAS,UAAU,MAAM;AAAA,EACnC;AAKA,QAAM,qBAAqB,CAAC,YAA6B;AACxD,QAAI,UAAU,QAAQ,OAAO;AAE7B,UAAM,EAAE,KAAK,UAAU,IAAI,sBAAsB,SAAS,MAAM,IAAI;AAEpE,QAAI,aAAa,MAAM,GAAG;AACzB,iBAAW,gBAAgB,GAAG;AAAA,IAC/B;AAEA,WAAO;AAAA,EACR;AAEA,QAAM,WAAqB,CAAC;AAC5B,MAAI,OAAoB;AACxB,QAAM,YACL,QAAQ,KAAK,aAAa,IAAI,OAAO,IAAe,IAAI;AAEzD,MAAI;AAKH,WAAO,QAAQ,KAAK,aAAa,GAAG;AACnC,YAAM,UAAU;AAChB,UAAI,EAAE,SAAS,SAAS,IAAI,WAAW,SAAS,SAAS;AAMzD,YAAM,aAAa,CAAC,cACnB,SAAS,SACN,UAAU,SAAS,IAAI,SAAS,KAAK,GAAG,EAAE,SAC1C,UAAU;AAEd,UAAI,WAAW,OAAO,IAAI,aAAa,GAAG;AACzC,kBAAU,mBAAmB,OAAO;AACpC,mBAAW;AAEX,YAAI,WAAW,OAAO,IAAI,aAAa,GAAG;AACzC;AAAA,QACD;AAAA,MACD;AAEA,eAAS,QAAQ,OAAO;AAExB,UAAI,UAAU;AACb;AAAA,MACD;AAIA,UAAI,aAAa,WAAW,WAAW,SAAS,KAAK,GAAG,CAAC,MAAM,GAAG;AACjE;AAAA,MACD;AAEA,aAAO,QAAQ;AAAA,IAChB;AAAA,EACD,QAAQ;AAAA,EAER;AAEA,SAAO,SAAS,KAAK,GAAG;AACzB;;;ACpRA,IAAM,qCAAqC;AAC3C,IAAM,qBAAqB;AAC3B,IAAM,WAAW;AAWV,SAAS,aACf,MACA,UAA+B,CAAC,GACvB;AACT,MAAI,CAAC,MAAM;AACV,WAAO;AAAA,EACR;AAEA,QAAM,0BACL,QAAQ,2BAA2B;AACpC,QAAM,YAAY,QAAQ,aAAa;AAGvC,QAAM,iBAAiB,KAAK,QAAQ,GAAG;AACvC,QAAM,aACL,mBAAmB,KAAK,OAAO,KAAK,MAAM,GAAG,iBAAiB,CAAC;AAGhE,QAAM,UAAU,WAAW;AAAA,IAC1B;AAAA,IACA,CAAC,OAAO,OAAe,UAAkB;AACxC,UAAI,MAAM,UAAU,yBAAyB;AAC5C,eAAO;AAAA,MACR;AAEA,aAAO,IAAI,KAAK,GAAG,MAAM,MAAM,GAAG,uBAAuB,CAAC,GAAG,QAAQ,GAAG,KAAK;AAAA,IAC9E;AAAA,EACD;AAEA,MAAI,QAAQ,SAAS,WAAW;AAC/B,WAAO,GAAG,QAAQ,MAAM,GAAG,SAAS,CAAC,GAAG,QAAQ;AAAA,EACjD;AAEA,SAAO;AACR;","names":["node","queryRoot"]}
|
|
1
|
+
{"version":3,"sources":["../src/get-selector.ts","../src/truncate-html.ts"],"sourcesContent":["/**\n * Build a compact, hopefully-unique selector for any given element on the page. This function is\n * serialized and run in the page context, so it must not reference any symbols outside its own\n * scope.\n *\n * Mirrors axe-core's approach: each level contributes the fewest features that discriminate the\n * element (a unique id, the rarest single class, or an :nth-of-type position), and the walk stops\n * as soon as the joined selector matches exactly one element. Selectors stay short because of that\n * early stop, not because of truncation; the length budget is only a backstop.\n */\nexport function getSelector(root: Node | null): string {\n\tconst MAX_LENGTH = 128;\n\n\tconst esc = (value: string): string =>\n\t\ttypeof CSS !== \"undefined\" && typeof CSS.escape === \"function\" ? CSS.escape(value) : value;\n\n\tconst tagName = (node: Node): string =>\n\t\tnode.nodeType === 1\n\t\t\t? node.nodeName.toLowerCase()\n\t\t\t: node.nodeName.toUpperCase().replace(/^#/, \"\");\n\n\t// A querySelectorAll-capable root (Document or ShadowRoot) for the element, used to confirm\n\t// uniqueness and class rarity. Absent on the plain objects used in the serialisation unit tests,\n\t// where we trust ids and walk to the top instead of stopping early.\n\tconst rootOf = (element: Element): ParentNode | null => {\n\t\tconst node = (element as Element & { getRootNode?: () => Node }).getRootNode?.();\n\n\t\treturn node && typeof (node as ParentNode).querySelectorAll === \"function\"\n\t\t\t? (node as ParentNode)\n\t\t\t: null;\n\t};\n\n\tconst matchCount = (queryRoot: ParentNode, selector: string): number => {\n\t\ttry {\n\t\t\treturn queryRoot.querySelectorAll(selector).length;\n\t\t} catch {\n\t\t\t// A selector that fails to parse can't be relied on.\n\t\t\treturn Number.POSITIVE_INFINITY;\n\t\t}\n\t};\n\n\t// A candidate feature is only usable if it actually selects this element; an escaping or engine\n\t// mismatch (e.g. CSS string escapes in an attribute value) could otherwise produce a selector\n\t// that matches nothing. Or a different element entirely.\n\tconst safeMatches = (element: Element, selector: string): boolean => {\n\t\ttry {\n\t\t\treturn typeof element.matches === \"function\" && element.matches(selector);\n\t\t} catch {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tconst idIsUnique = (element: Element, id: string): boolean => {\n\t\tconst queryRoot = rootOf(element);\n\n\t\treturn queryRoot === null || matchCount(queryRoot, `#${esc(id)}`) === 1;\n\t};\n\n\t// A discriminating feature for one level of the selector: its CSS text plus a predicate telling\n\t// whether a sibling would match the same feature (used to decide if an :nth-of-type pin is still\n\t// needed).\n\ttype Feature = {\n\t\tfeature: string;\n\t\tsharedBy: (sibling: Element) => boolean;\n\t};\n\n\tconst classFeature = (cls: string): Feature => ({\n\t\tfeature: `.${esc(cls)}`,\n\t\tsharedBy: (sibling) => Array.from(sibling.classList ?? []).includes(cls),\n\t});\n\n\t// The single feature that narrows the element down the most: the class or href attribute with the\n\t// fewest matches in the root. Hrefs break ties between structurally-identical content blocks,\n\t// where classes and :nth-of-type (which only pins position within one parent) cannot. Without a\n\t// queryable root there is no rarity information, so the first class stands in.\n\tconst rarestFeature = (element: Element, queryRoot: ParentNode | null): Feature | null => {\n\t\tconst classes = Array.from(element.classList).slice(0, 8);\n\n\t\tif (!queryRoot) {\n\t\t\tconst cls = classes[0];\n\n\t\t\treturn cls === undefined ? null : classFeature(cls);\n\t\t}\n\n\t\tlet best: Feature | null = null;\n\t\tlet bestCount = Number.POSITIVE_INFINITY;\n\n\t\tfor (const cls of classes) {\n\t\t\tconst candidate = classFeature(cls);\n\n\t\t\tif (!safeMatches(element, candidate.feature)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst count = matchCount(queryRoot, candidate.feature);\n\n\t\t\tif (count < bestCount) {\n\t\t\t\tbest = candidate;\n\t\t\t\tbestCount = count;\n\t\t\t}\n\n\t\t\tif (count === 1) {\n\t\t\t\treturn best;\n\t\t\t}\n\t\t}\n\n\t\tconst href = typeof element.getAttribute === \"function\" ? element.getAttribute(\"href\") : null;\n\n\t\t// Skip hrefs with characters that change meaning inside a CSS string (quotes, backslashes), and\n\t\t// query strings, which are too volatile across runs to pin a selector to. Fragments (#main)\n\t\t// stay eligible. Skip links make stable discriminators.\n\t\tif (href && href.length <= 100 && !/[\"\\\\?]/.test(href)) {\n\t\t\tconst feature = `[href=\"${href}\"]`;\n\n\t\t\tif (safeMatches(element, feature) && matchCount(queryRoot, feature) < bestCount) {\n\t\t\t\treturn {\n\t\t\t\t\tfeature,\n\t\t\t\t\tsharedBy: (sibling) =>\n\t\t\t\t\t\ttypeof sibling.getAttribute === \"function\" && sibling.getAttribute(\"href\") === href,\n\t\t\t\t};\n\t\t\t}\n\t\t}\n\n\t\treturn best;\n\t};\n\n\t// The element's 1-based position among same-tag siblings, and whether the chosen feature fails to\n\t// discriminate it from them (so the segment needs an :nth-of-type pin). Siblings are absent on\n\t// the serialisation test nodes. There we skip the pin.\n\tconst positionAmongSiblings = (\n\t\telement: Element,\n\t\tsharedBy: (sibling: Element) => boolean,\n\t): { nth: number; ambiguous: boolean } => {\n\t\tconst siblings = (element.parentNode as ParentNode | null)?.children;\n\n\t\tif (!siblings) {\n\t\t\treturn { nth: 0, ambiguous: false };\n\t\t}\n\n\t\tlet nth = 0;\n\t\tlet count = 0;\n\t\tlet shared = 0;\n\n\t\tfor (const sibling of Array.from(siblings)) {\n\t\t\tif (sibling.nodeName !== element.nodeName) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tcount++;\n\n\t\t\tif (sibling === element) {\n\t\t\t\tnth = count;\n\t\t\t}\n\n\t\t\tif (sharedBy(sibling)) {\n\t\t\t\tshared++;\n\t\t\t}\n\t\t}\n\n\t\treturn { nth, ambiguous: shared > 1 };\n\t};\n\n\tconst segmentFor = (\n\t\telement: Element,\n\t\tqueryRoot: ParentNode | null,\n\t): { segment: string; anchored: boolean } => {\n\t\t// Only treat an id as an absolute anchor when it actually resolves to a single element: pages\n\t\t// with duplicate ids would otherwise yield a selector (e.g. \"#dup>a\") that matches several\n\t\t// elements.\n\t\tif (element.id && idIsUnique(element, element.id)) {\n\t\t\treturn { segment: `#${esc(element.id)}`, anchored: true };\n\t\t}\n\n\t\tconst feature = rarestFeature(element, queryRoot);\n\t\tlet segment = tagName(element) + (feature === null ? \"\" : feature.feature);\n\n\t\t// When same-tag siblings share the chosen feature, pin the position so the segment selects\n\t\t// exactly this element rather than all of them.\n\t\tconst { nth, ambiguous } = positionAmongSiblings(\n\t\t\telement,\n\t\t\tfeature === null ? () => true : feature.sharedBy,\n\t\t);\n\n\t\tif (ambiguous && nth > 0) {\n\t\t\tsegment += `:nth-of-type(${nth})`;\n\t\t}\n\n\t\treturn { segment, anchored: false };\n\t};\n\n\t// A minimal segment for when a level's full segment would blow the budget (e.g. an enormous class\n\t// name or a long href): just the tag, pinned by position when same-tag siblings would make the\n\t// bare tag ambiguous.\n\tconst degradedSegmentFor = (element: Element): string => {\n\t\tlet segment = tagName(element);\n\n\t\tconst { nth, ambiguous } = positionAmongSiblings(element, () => true);\n\n\t\tif (ambiguous && nth > 0) {\n\t\t\tsegment += `:nth-of-type(${nth})`;\n\t\t}\n\n\t\treturn segment;\n\t};\n\n\tconst segments: string[] = [];\n\tlet node: Node | null = root;\n\tconst queryRoot = root && root.nodeType === 1 ? rootOf(root as Element) : null;\n\n\ttry {\n\t\t// Walk only element nodes. Stopping at the first non-element parent (the document, or a\n\t\t// ShadowRoot when the target is inside an open shadow root) keeps the selector within its tree\n\t\t// and avoids reading `classList` off a node that has none.\n\t\twhile (node && node.nodeType === 1) {\n\t\t\tconst element = node as Element;\n\t\t\tlet { segment, anchored } = segmentFor(element, queryRoot);\n\n\t\t\t// Keep within the budget (the +1 accounts for the \">\" that would join this segment to the\n\t\t\t// rest). A level whose full segment doesn't fit is degraded to tag + position rather than\n\t\t\t// discarded, so ancestor context is never lost to one long feature.\n\t\t\tconst joinedWith = (candidate: string): number =>\n\t\t\t\tsegments.length ? candidate.length + 1 + segments.join(\">\").length : candidate.length;\n\n\t\t\tif (joinedWith(segment) > MAX_LENGTH - 1) {\n\t\t\t\tsegment = degradedSegmentFor(element);\n\t\t\t\tanchored = false;\n\n\t\t\t\tif (joinedWith(segment) > MAX_LENGTH - 1) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsegments.unshift(segment);\n\n\t\t\tif (anchored) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Stop as soon as the selector already identifies a single element. This, not truncation, is\n\t\t\t// what keeps selectors short.\n\t\t\tif (queryRoot && matchCount(queryRoot, segments.join(\">\")) === 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tnode = element.parentNode;\n\t\t}\n\t} catch {\n\t\t// A malformed node tree must never crash the audit; return what we have.\n\t}\n\n\treturn segments.join(\">\");\n}\n","const DEFAULT_MAX_ATTRIBUTE_VALUE_LENGTH = 50;\nconst DEFAULT_MAX_LENGTH = 300;\nconst ELLIPSIS = \"...\";\n\nexport type TruncateHtmlOptions = {\n\tmaxAttributeValueLength?: number;\n\tmaxLength?: number;\n};\n\n/**\n * Given an element's outerHTML, produce a truncated version suitable for display in results. For\n * memory efficiency, pass a shallow outerHTML i.e. `Node.cloneNode(false).outerHTML`.\n */\nexport function truncateHtml(html: string, options: TruncateHtmlOptions = {}): string {\n\tif (!html) {\n\t\treturn \"\";\n\t}\n\n\tconst maxAttributeValueLength =\n\t\toptions.maxAttributeValueLength ?? DEFAULT_MAX_ATTRIBUTE_VALUE_LENGTH;\n\tconst maxLength = options.maxLength ?? DEFAULT_MAX_LENGTH;\n\n\t// Keep only the opening tag\n\tconst closingBracket = html.indexOf(\">\");\n\tconst openingTag = closingBracket === -1 ? html : html.slice(0, closingBracket + 1);\n\n\t// Shorten long quoted attribute values, preserving the quote style.\n\tconst trimmed = openingTag.replace(\n\t\t/=([\"'])([\\s\\S]*?)\\1/g,\n\t\t(match, quote: string, value: string) => {\n\t\t\tif (value.length <= maxAttributeValueLength) {\n\t\t\t\treturn match;\n\t\t\t}\n\n\t\t\treturn `=${quote}${value.slice(0, maxAttributeValueLength)}${ELLIPSIS}${quote}`;\n\t\t},\n\t);\n\n\tif (trimmed.length > maxLength) {\n\t\treturn `${trimmed.slice(0, maxLength)}${ELLIPSIS}`;\n\t}\n\n\treturn trimmed;\n}\n"],"mappings":";AAUO,SAAS,YAAY,MAA2B;AACtD,QAAM,aAAa;AAEnB,QAAM,MAAM,CAAC,UACZ,OAAO,QAAQ,eAAe,OAAO,IAAI,WAAW,aAAa,IAAI,OAAO,KAAK,IAAI;AAEtF,QAAM,UAAU,CAACA,UAChBA,MAAK,aAAa,IACfA,MAAK,SAAS,YAAY,IAC1BA,MAAK,SAAS,YAAY,EAAE,QAAQ,MAAM,EAAE;AAKhD,QAAM,SAAS,CAAC,YAAwC;AACvD,UAAMA,QAAQ,QAAmD,cAAc;AAE/E,WAAOA,SAAQ,OAAQA,MAAoB,qBAAqB,aAC5DA,QACD;AAAA,EACJ;AAEA,QAAM,aAAa,CAACC,YAAuB,aAA6B;AACvE,QAAI;AACH,aAAOA,WAAU,iBAAiB,QAAQ,EAAE;AAAA,IAC7C,QAAQ;AAEP,aAAO,OAAO;AAAA,IACf;AAAA,EACD;AAKA,QAAM,cAAc,CAAC,SAAkB,aAA8B;AACpE,QAAI;AACH,aAAO,OAAO,QAAQ,YAAY,cAAc,QAAQ,QAAQ,QAAQ;AAAA,IACzE,QAAQ;AACP,aAAO;AAAA,IACR;AAAA,EACD;AAEA,QAAM,aAAa,CAAC,SAAkB,OAAwB;AAC7D,UAAMA,aAAY,OAAO,OAAO;AAEhC,WAAOA,eAAc,QAAQ,WAAWA,YAAW,IAAI,IAAI,EAAE,CAAC,EAAE,MAAM;AAAA,EACvE;AAUA,QAAM,eAAe,CAAC,SAA0B;AAAA,IAC/C,SAAS,IAAI,IAAI,GAAG,CAAC;AAAA,IACrB,UAAU,CAAC,YAAY,MAAM,KAAK,QAAQ,aAAa,CAAC,CAAC,EAAE,SAAS,GAAG;AAAA,EACxE;AAMA,QAAM,gBAAgB,CAAC,SAAkBA,eAAiD;AACzF,UAAM,UAAU,MAAM,KAAK,QAAQ,SAAS,EAAE,MAAM,GAAG,CAAC;AAExD,QAAI,CAACA,YAAW;AACf,YAAM,MAAM,QAAQ,CAAC;AAErB,aAAO,QAAQ,SAAY,OAAO,aAAa,GAAG;AAAA,IACnD;AAEA,QAAI,OAAuB;AAC3B,QAAI,YAAY,OAAO;AAEvB,eAAW,OAAO,SAAS;AAC1B,YAAM,YAAY,aAAa,GAAG;AAElC,UAAI,CAAC,YAAY,SAAS,UAAU,OAAO,GAAG;AAC7C;AAAA,MACD;AAEA,YAAM,QAAQ,WAAWA,YAAW,UAAU,OAAO;AAErD,UAAI,QAAQ,WAAW;AACtB,eAAO;AACP,oBAAY;AAAA,MACb;AAEA,UAAI,UAAU,GAAG;AAChB,eAAO;AAAA,MACR;AAAA,IACD;AAEA,UAAM,OAAO,OAAO,QAAQ,iBAAiB,aAAa,QAAQ,aAAa,MAAM,IAAI;AAKzF,QAAI,QAAQ,KAAK,UAAU,OAAO,CAAC,SAAS,KAAK,IAAI,GAAG;AACvD,YAAM,UAAU,UAAU,IAAI;AAE9B,UAAI,YAAY,SAAS,OAAO,KAAK,WAAWA,YAAW,OAAO,IAAI,WAAW;AAChF,eAAO;AAAA,UACN;AAAA,UACA,UAAU,CAAC,YACV,OAAO,QAAQ,iBAAiB,cAAc,QAAQ,aAAa,MAAM,MAAM;AAAA,QACjF;AAAA,MACD;AAAA,IACD;AAEA,WAAO;AAAA,EACR;AAKA,QAAM,wBAAwB,CAC7B,SACA,aACyC;AACzC,UAAM,WAAY,QAAQ,YAAkC;AAE5D,QAAI,CAAC,UAAU;AACd,aAAO,EAAE,KAAK,GAAG,WAAW,MAAM;AAAA,IACnC;AAEA,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,QAAI,SAAS;AAEb,eAAW,WAAW,MAAM,KAAK,QAAQ,GAAG;AAC3C,UAAI,QAAQ,aAAa,QAAQ,UAAU;AAC1C;AAAA,MACD;AAEA;AAEA,UAAI,YAAY,SAAS;AACxB,cAAM;AAAA,MACP;AAEA,UAAI,SAAS,OAAO,GAAG;AACtB;AAAA,MACD;AAAA,IACD;AAEA,WAAO,EAAE,KAAK,WAAW,SAAS,EAAE;AAAA,EACrC;AAEA,QAAM,aAAa,CAClB,SACAA,eAC4C;AAI5C,QAAI,QAAQ,MAAM,WAAW,SAAS,QAAQ,EAAE,GAAG;AAClD,aAAO,EAAE,SAAS,IAAI,IAAI,QAAQ,EAAE,CAAC,IAAI,UAAU,KAAK;AAAA,IACzD;AAEA,UAAM,UAAU,cAAc,SAASA,UAAS;AAChD,QAAI,UAAU,QAAQ,OAAO,KAAK,YAAY,OAAO,KAAK,QAAQ;AAIlE,UAAM,EAAE,KAAK,UAAU,IAAI;AAAA,MAC1B;AAAA,MACA,YAAY,OAAO,MAAM,OAAO,QAAQ;AAAA,IACzC;AAEA,QAAI,aAAa,MAAM,GAAG;AACzB,iBAAW,gBAAgB,GAAG;AAAA,IAC/B;AAEA,WAAO,EAAE,SAAS,UAAU,MAAM;AAAA,EACnC;AAKA,QAAM,qBAAqB,CAAC,YAA6B;AACxD,QAAI,UAAU,QAAQ,OAAO;AAE7B,UAAM,EAAE,KAAK,UAAU,IAAI,sBAAsB,SAAS,MAAM,IAAI;AAEpE,QAAI,aAAa,MAAM,GAAG;AACzB,iBAAW,gBAAgB,GAAG;AAAA,IAC/B;AAEA,WAAO;AAAA,EACR;AAEA,QAAM,WAAqB,CAAC;AAC5B,MAAI,OAAoB;AACxB,QAAM,YAAY,QAAQ,KAAK,aAAa,IAAI,OAAO,IAAe,IAAI;AAE1E,MAAI;AAIH,WAAO,QAAQ,KAAK,aAAa,GAAG;AACnC,YAAM,UAAU;AAChB,UAAI,EAAE,SAAS,SAAS,IAAI,WAAW,SAAS,SAAS;AAKzD,YAAM,aAAa,CAAC,cACnB,SAAS,SAAS,UAAU,SAAS,IAAI,SAAS,KAAK,GAAG,EAAE,SAAS,UAAU;AAEhF,UAAI,WAAW,OAAO,IAAI,aAAa,GAAG;AACzC,kBAAU,mBAAmB,OAAO;AACpC,mBAAW;AAEX,YAAI,WAAW,OAAO,IAAI,aAAa,GAAG;AACzC;AAAA,QACD;AAAA,MACD;AAEA,eAAS,QAAQ,OAAO;AAExB,UAAI,UAAU;AACb;AAAA,MACD;AAIA,UAAI,aAAa,WAAW,WAAW,SAAS,KAAK,GAAG,CAAC,MAAM,GAAG;AACjE;AAAA,MACD;AAEA,aAAO,QAAQ;AAAA,IAChB;AAAA,EACD,QAAQ;AAAA,EAER;AAEA,SAAO,SAAS,KAAK,GAAG;AACzB;;;AC3PA,IAAM,qCAAqC;AAC3C,IAAM,qBAAqB;AAC3B,IAAM,WAAW;AAWV,SAAS,aAAa,MAAc,UAA+B,CAAC,GAAW;AACrF,MAAI,CAAC,MAAM;AACV,WAAO;AAAA,EACR;AAEA,QAAM,0BACL,QAAQ,2BAA2B;AACpC,QAAM,YAAY,QAAQ,aAAa;AAGvC,QAAM,iBAAiB,KAAK,QAAQ,GAAG;AACvC,QAAM,aAAa,mBAAmB,KAAK,OAAO,KAAK,MAAM,GAAG,iBAAiB,CAAC;AAGlF,QAAM,UAAU,WAAW;AAAA,IAC1B;AAAA,IACA,CAAC,OAAO,OAAe,UAAkB;AACxC,UAAI,MAAM,UAAU,yBAAyB;AAC5C,eAAO;AAAA,MACR;AAEA,aAAO,IAAI,KAAK,GAAG,MAAM,MAAM,GAAG,uBAAuB,CAAC,GAAG,QAAQ,GAAG,KAAK;AAAA,IAC9E;AAAA,EACD;AAEA,MAAI,QAAQ,SAAS,WAAW;AAC/B,WAAO,GAAG,QAAQ,MAAM,GAAG,SAAS,CAAC,GAAG,QAAQ;AAAA,EACjD;AAEA,SAAO;AACR;","names":["node","queryRoot"]}
|
package/dist/get-selector.d.ts
CHANGED
|
@@ -5,7 +5,7 @@
|
|
|
5
5
|
*
|
|
6
6
|
* Mirrors axe-core's approach: each level contributes the fewest features that discriminate the
|
|
7
7
|
* element (a unique id, the rarest single class, or an :nth-of-type position), and the walk stops
|
|
8
|
-
* as soon as the joined selector matches exactly one element. Selectors stay short because of
|
|
9
|
-
*
|
|
8
|
+
* as soon as the joined selector matches exactly one element. Selectors stay short because of that
|
|
9
|
+
* early stop, not because of truncation; the length budget is only a backstop.
|
|
10
10
|
*/
|
|
11
11
|
export declare function getSelector(root: Node | null): string;
|
package/dist/index.d.ts
CHANGED
package/dist/index.js
CHANGED
|
@@ -1 +1,17 @@
|
|
|
1
|
+
// src/clip.ts
|
|
2
|
+
function bufferedClip(rect, pageWidth, pageHeight, buffer) {
|
|
3
|
+
const left = Math.max(0, Math.min(buffer, rect.x));
|
|
4
|
+
const top = Math.max(0, Math.min(buffer, rect.y));
|
|
5
|
+
const right = Math.max(0, Math.min(buffer, pageWidth - rect.x - rect.width));
|
|
6
|
+
const bottom = Math.max(0, Math.min(buffer, pageHeight - rect.y - rect.height));
|
|
7
|
+
return {
|
|
8
|
+
x: Math.max(0, rect.x - left),
|
|
9
|
+
y: Math.max(0, rect.y - top),
|
|
10
|
+
width: rect.width + left + right,
|
|
11
|
+
height: rect.height + top + bottom
|
|
12
|
+
};
|
|
13
|
+
}
|
|
14
|
+
export {
|
|
15
|
+
bufferedClip
|
|
16
|
+
};
|
|
1
17
|
//# sourceMappingURL=index.js.map
|
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}
|
|
1
|
+
{"version":3,"sources":["../src/clip.ts"],"sourcesContent":["import type { Rect } from \"./adaptor\";\n\n/**\n * A screenshot clip framing `rect` with up to `buffer` pixels of padding on each side, shrunk where\n * the page edges leave less room. The padding allows for indicators drawn just outside the element\n * box (outlines, shadows) and for anti-aliasing.\n */\nexport function bufferedClip(\n\trect: Rect,\n\tpageWidth: number,\n\tpageHeight: number,\n\tbuffer: number,\n): Rect {\n\tconst left = Math.max(0, Math.min(buffer, rect.x));\n\tconst top = Math.max(0, Math.min(buffer, rect.y));\n\tconst right = Math.max(0, Math.min(buffer, pageWidth - rect.x - rect.width));\n\tconst bottom = Math.max(0, Math.min(buffer, pageHeight - rect.y - rect.height));\n\n\t// Clamp to non-negative origins: an element positioned partially off the top or left of the\n\t// document has a negative page-relative rect, and Puppeteer rejects a screenshot clip with\n\t// negative x/y.\n\treturn {\n\t\tx: Math.max(0, rect.x - left),\n\t\ty: Math.max(0, rect.y - top),\n\t\twidth: rect.width + left + right,\n\t\theight: rect.height + top + bottom,\n\t};\n}\n"],"mappings":";AAOO,SAAS,aACf,MACA,WACA,YACA,QACO;AACP,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK,CAAC,CAAC;AACjD,QAAM,MAAM,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,KAAK,CAAC,CAAC;AAChD,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,YAAY,KAAK,IAAI,KAAK,KAAK,CAAC;AAC3E,QAAM,SAAS,KAAK,IAAI,GAAG,KAAK,IAAI,QAAQ,aAAa,KAAK,IAAI,KAAK,MAAM,CAAC;AAK9E,SAAO;AAAA,IACN,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI;AAAA,IAC5B,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG;AAAA,IAC3B,OAAO,KAAK,QAAQ,OAAO;AAAA,IAC3B,QAAQ,KAAK,SAAS,MAAM;AAAA,EAC7B;AACD;","names":[]}
|
package/package.json
CHANGED