Spaces:
Running
Running
Download node_modules/playwright-core/lib/server/accessibility.js from AK51/LunarSpark: direct link, hf CLI and curl.
- Browser
- Download file 2.19 kB
-
https://huggingface.co/spaces/AK51/LunarSpark/resolve/main/node_modules/playwright-core/lib/server/accessibility.js
- Command line
-
hf download hf://spaces/AK51/LunarSpark/node_modules/playwright-core/lib/server/accessibility.js
-
curl -L -o accessibility.js https://huggingface.co/spaces/AK51/LunarSpark/resolve/main/node_modules/playwright-core/lib/server/accessibility.js
2.19 kB
| ; | |
| Object.defineProperty(exports, "__esModule", { | |
| value: true | |
| }); | |
| exports.Accessibility = void 0; | |
| /** | |
| * Copyright 2018 Google Inc. All rights reserved. | |
| * Modifications copyright (c) Microsoft Corporation. | |
| * | |
| * Licensed under the Apache License, Version 2.0 (the "License"); | |
| * you may not use this file except in compliance with the License. | |
| * You may obtain a copy of the License at | |
| * | |
| * http://www.apache.org/licenses/LICENSE-2.0 | |
| * | |
| * Unless required by applicable law or agreed to in writing, software | |
| * distributed under the License is distributed on an "AS IS" BASIS, | |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| * See the License for the specific language governing permissions and | |
| * limitations under the License. | |
| */ | |
| class Accessibility { | |
| constructor(getAXTree) { | |
| this._getAXTree = void 0; | |
| this._getAXTree = getAXTree; | |
| } | |
| async snapshot(options = {}) { | |
| const { | |
| interestingOnly = true, | |
| root = null | |
| } = options; | |
| const { | |
| tree, | |
| needle | |
| } = await this._getAXTree(root || undefined); | |
| if (!interestingOnly) { | |
| if (root) return needle && serializeTree(needle)[0]; | |
| return serializeTree(tree)[0]; | |
| } | |
| const interestingNodes = new Set(); | |
| collectInterestingNodes(interestingNodes, tree, false); | |
| if (root && (!needle || !interestingNodes.has(needle))) return null; | |
| return serializeTree(needle || tree, interestingNodes)[0]; | |
| } | |
| } | |
| exports.Accessibility = Accessibility; | |
| function collectInterestingNodes(collection, node, insideControl) { | |
| if (node.isInteresting(insideControl)) collection.add(node); | |
| if (node.isLeafNode()) return; | |
| insideControl = insideControl || node.isControl(); | |
| for (const child of node.children()) collectInterestingNodes(collection, child, insideControl); | |
| } | |
| function serializeTree(node, whitelistedNodes) { | |
| const children = []; | |
| for (const child of node.children()) children.push(...serializeTree(child, whitelistedNodes)); | |
| if (whitelistedNodes && !whitelistedNodes.has(node)) return children; | |
| const serializedNode = node.serialize(); | |
| if (children.length) serializedNode.children = children; | |
| return [serializedNode]; | |
| } |