Sha256: d5cb2b2321e3b06da82a01b0e2b67e08863c772a31654343dbed6d56b918a60b
Contents?: true
Size: 1.33 KB
Versions: 261
Compression:
Stored size: 1.33 KB
Contents
/* global axe, dom */
/**
* Get elements from point across shadow dom boundaries
* @method shadowElementsFromPoint
* @memberof axe.commons.dom
* @instance
* @param {Number} nodeX X coordinates of point
* @param {Number} nodeY Y coordinates of point
* @param {Object} [root] Shadow root or document root
* @return {Array}
*/
dom.shadowElementsFromPoint = function(nodeX, nodeY, root = document, i = 0) {
if (i > 999) {
throw new Error('Infinite loop detected');
}
return (
// IE can return null when there are no elements
Array.from(root.elementsFromPoint(nodeX, nodeY) || [])
// As of Chrome 66, elementFromPoint will return elements from parent trees.
// We only want to touch each tree once, so we're filtering out nodes on other trees.
.filter(nodes => dom.getRootNode(nodes) === root)
.reduce((stack, elm) => {
if (axe.utils.isShadowRoot(elm)) {
const shadowStack = dom.shadowElementsFromPoint(
nodeX,
nodeY,
elm.shadowRoot,
i + 1
);
stack = stack.concat(shadowStack);
// filter host nodes which get included regardless of overlap
// TODO: refactor multiline overlap checking inside shadow dom
if (stack.length && axe.commons.dom.visuallyContains(stack[0], elm)) {
stack.push(elm);
}
} else {
stack.push(elm);
}
return stack;
}, [])
);
};
Version data entries
261 entries across 261 versions & 1 rubygems