@proyecto-viviana/solidaria 0.4.2 → 0.6.0-rc.0

package/dist/_chunk/ariaHideOutside.js

@@ -1,10 +1,184 @@
-import { c as getOwnerWindow } from "./focus.js";
+/*
+* Copyright 2020 Adobe. All rights reserved.
+* This file is licensed to you 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 REPRESENTATIONS
+* OF ANY KIND, either express or implied. See the License for the specific language
+* governing permissions and limitations under the License.
+*/
+// Ported to SolidJS for Proyecto Viviana; based on packages/react-aria/src/overlays/ariaHideOutside.ts
+import { a as getOwnerDocument, o as getOwnerWindow, v as nodeContains } from "./dom.js";
+import { shadowDOM } from "@proyecto-viviana/solid-stately/private/flags/flags";
+//#region src/utils/ShadowTreeWalker.ts
+/*!
+* Copyright (c) Microsoft Corporation. All rights reserved.
+* Licensed under the MIT License.
+*/
+var ShadowTreeWalker = class {
+	filter;
+	root;
+	whatToShow;
+	doc;
+	walkerStack = [];
+	current;
+	currentSetFor = /* @__PURE__ */ new Set();
+	constructor(doc, root, whatToShow, filter) {
+		this.doc = doc;
+		this.root = root;
+		this.filter = filter ?? null;
+		this.whatToShow = whatToShow ?? NodeFilter.SHOW_ALL;
+		this.current = root;
+		this.walkerStack.unshift(doc.createTreeWalker(root, whatToShow, this.acceptNode));
+		const shadowRoot = root.shadowRoot;
+		if (shadowRoot) this.walkerStack.unshift(this.doc.createTreeWalker(shadowRoot, this.whatToShow, { acceptNode: this.acceptNode }));
+	}
+	acceptNode = (node) => {
+		if (node.nodeType === Node.ELEMENT_NODE) {
+			const shadowRoot = node.shadowRoot;
+			if (shadowRoot) {
+				this.walkerStack.unshift(this.doc.createTreeWalker(shadowRoot, this.whatToShow, { acceptNode: this.acceptNode }));
+				return NodeFilter.FILTER_ACCEPT;
+			}
+			if (typeof this.filter === "function") return this.filter(node);
+			if (this.filter?.acceptNode) return this.filter.acceptNode(node);
+			if (this.filter === null) return NodeFilter.FILTER_ACCEPT;
+		}
+		return NodeFilter.FILTER_SKIP;
+	};
+	get currentNode() {
+		return this.current;
+	}
+	set currentNode(node) {
+		if (!nodeContains(this.root, node)) throw new Error("Cannot set currentNode to a node that is not contained by the root node.");
+		const walkers = [];
+		let currentNode = node;
+		let walkerCurrentNode = node;
+		this.current = node;
+		while (currentNode && currentNode !== this.root) if (currentNode.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {
+			const shadowRoot = currentNode;
+			const walker = this.doc.createTreeWalker(shadowRoot, this.whatToShow, { acceptNode: this.acceptNode });
+			walkers.push(walker);
+			walker.currentNode = walkerCurrentNode;
+			this.currentSetFor.add(walker);
+			currentNode = walkerCurrentNode = shadowRoot.host;
+		} else currentNode = currentNode.parentNode;
+		const walker = this.doc.createTreeWalker(this.root, this.whatToShow, { acceptNode: this.acceptNode });
+		walkers.push(walker);
+		walker.currentNode = walkerCurrentNode;
+		this.currentSetFor.add(walker);
+		this.walkerStack = walkers;
+	}
+	firstChild() {
+		const currentNode = this.currentNode;
+		const newNode = this.nextNode();
+		if (!nodeContains(currentNode, newNode)) {
+			this.currentNode = currentNode;
+			return null;
+		}
+		if (newNode) this.currentNode = newNode;
+		return newNode;
+	}
+	lastChild() {
+		const newNode = this.walkerStack[0].lastChild();
+		if (newNode) this.currentNode = newNode;
+		return newNode;
+	}
+	nextNode() {
+		const nextNode = this.walkerStack[0].nextNode();
+		if (nextNode) {
+			if (nextNode.shadowRoot) {
+				let nodeResult;
+				if (typeof this.filter === "function") nodeResult = this.filter(nextNode);
+				else if (this.filter?.acceptNode) nodeResult = this.filter.acceptNode(nextNode);
+				if (nodeResult === NodeFilter.FILTER_ACCEPT) {
+					this.currentNode = nextNode;
+					return nextNode;
+				}
+				const childNode = this.nextNode();
+				if (childNode) this.currentNode = childNode;
+				return childNode;
+			}
+			this.currentNode = nextNode;
+			return nextNode;
+		}
+		if (this.walkerStack.length > 1) {
+			this.walkerStack.shift();
+			const parentNode = this.nextNode();
+			if (parentNode) this.currentNode = parentNode;
+			return parentNode;
+		}
+		return null;
+	}
+	previousNode() {
+		const currentWalker = this.walkerStack[0];
+		if (currentWalker.currentNode === currentWalker.root) {
+			if (this.currentSetFor.has(currentWalker)) {
+				this.currentSetFor.delete(currentWalker);
+				if (this.walkerStack.length > 1) {
+					this.walkerStack.shift();
+					const parentNode = this.previousNode();
+					if (parentNode) this.currentNode = parentNode;
+					return parentNode;
+				}
+			}
+			return null;
+		}
+		const previousNode = currentWalker.previousNode();
+		if (previousNode) {
+			if (previousNode.shadowRoot) {
+				let nodeResult;
+				if (typeof this.filter === "function") nodeResult = this.filter(previousNode);
+				else if (this.filter?.acceptNode) nodeResult = this.filter.acceptNode(previousNode);
+				if (nodeResult === NodeFilter.FILTER_ACCEPT) {
+					this.currentNode = previousNode;
+					return previousNode;
+				}
+				const childNode = this.lastChild();
+				if (childNode) this.currentNode = childNode;
+				return childNode;
+			}
+			this.currentNode = previousNode;
+			return previousNode;
+		}
+		if (this.walkerStack.length > 1) {
+			this.walkerStack.shift();
+			const parentNode = this.previousNode();
+			if (parentNode) this.currentNode = parentNode;
+			return parentNode;
+		}
+		return null;
+	}
+	/** @deprecated */
+	nextSibling() {
+		return null;
+	}
+	/** @deprecated */
+	previousSibling() {
+		return null;
+	}
+	/** @deprecated */
+	parentNode() {
+		return null;
+	}
+};
+/** Shadow DOM-safe version of `Document.createTreeWalker`. */
+function createShadowTreeWalker(doc, root, whatToShow, filter) {
+	if (shadowDOM()) return new ShadowTreeWalker(doc, root, whatToShow, filter);
+	return doc.createTreeWalker(root, whatToShow, filter);
+}
+//#endregion
 //#region src/overlays/ariaHideOutside.ts
 /**
 * Hides all elements in the DOM outside the given targets from screen readers.
-* Based on @react-aria/overlays ariaHideOutside.
+* Ported from packages/react-aria/src/overlays/ariaHideOutside.ts.
 */
 const supportsInert = typeof HTMLElement !== "undefined" && "inert" in HTMLElement.prototype;
+function isAlwaysVisibleNode(node) {
+	return node.dataset.liveAnnouncer === "true" || node.dataset.solidariaTopLayer !== void 0;
+}
 const refCountMap = /* @__PURE__ */ new WeakMap();
 const observerStack = [];
 /**
@@ -18,10 +192,21 @@ const observerStack = [];
 function ariaHideOutside(targets, options) {
 	const windowObj = getOwnerWindow(targets?.[0]);
 	const opts = options instanceof windowObj.Element ? { root: options } : options;
-	const root = opts?.root ?? document.body;
+	const root = opts?.root ?? getOwnerDocument(targets?.[0]).body;
 	const shouldUseInert = opts?.shouldUseInert && supportsInert;
 	const visibleNodes = new Set(targets);
 	const hiddenNodes = /* @__PURE__ */ new Set();
+	const shadowRootsToWatch = /* @__PURE__ */ new Set();
+	if (shadowDOM()) {
+		const boundary = root.getRootNode();
+		for (const target of targets) {
+			let current = target.getRootNode();
+			while (current instanceof windowObj.ShadowRoot && current !== boundary) {
+				shadowRootsToWatch.add(current);
+				current = current.host.getRootNode();
+			}
+		}
+	}
 	const getHidden = (element) => {
 		return shouldUseInert && element instanceof windowObj.HTMLElement ? element.inert : element.getAttribute("aria-hidden") === "true";
 	};
@@ -44,10 +229,10 @@ function ariaHideOutside(targets, options) {
 		for (const element of walkRoot.querySelectorAll("[data-live-announcer], [data-solidaria-top-layer]")) visibleNodes.add(element);
 		const acceptNode = (node) => {
 			if (hiddenNodes.has(node) || visibleNodes.has(node) || node.parentElement && hiddenNodes.has(node.parentElement) && node.parentElement.getAttribute("role") !== "row") return NodeFilter.FILTER_REJECT;
-			for (const target of visibleNodes) if (node.contains(target)) return NodeFilter.FILTER_SKIP;
+			for (const target of visibleNodes) if (nodeContains(node, target)) return NodeFilter.FILTER_SKIP;
 			return NodeFilter.FILTER_ACCEPT;
 		};
-		const walker = document.createTreeWalker(walkRoot, NodeFilter.SHOW_ELEMENT, { acceptNode });
+		const walker = createShadowTreeWalker(getOwnerDocument(walkRoot), walkRoot, NodeFilter.SHOW_ELEMENT, { acceptNode });
 		const acceptRoot = acceptNode(walkRoot);
 		if (acceptRoot === NodeFilter.FILTER_ACCEPT) hide(walkRoot);
 		if (acceptRoot !== NodeFilter.FILTER_REJECT) {
@@ -60,19 +245,35 @@ function ariaHideOutside(targets, options) {
 	};
 	if (observerStack.length) observerStack[observerStack.length - 1].disconnect();
 	walk(root);
-	const observer = new MutationObserver((changes) => {
+	const processMutations = (changes) => {
 		for (const change of changes) {
 			if (change.type !== "childList") continue;
-			if (![...visibleNodes, ...hiddenNodes].some((node) => node.contains(change.target))) {
-				for (const node of change.addedNodes) if ((node instanceof HTMLElement || node instanceof SVGElement) && (node.dataset.liveAnnouncer === "true" || node.dataset.solidariaTopLayer === "true")) visibleNodes.add(node);
-				else if (node instanceof Element) walk(node);
+			if (change.target.isConnected && ![...visibleNodes, ...hiddenNodes].some((node) => nodeContains(node, change.target))) {
+				for (const node of change.addedNodes) if ((node instanceof windowObj.HTMLElement || node instanceof windowObj.SVGElement) && isAlwaysVisibleNode(node)) visibleNodes.add(node);
+				else if (node instanceof windowObj.Element) walk(node);
+			}
+			if (shadowDOM()) {
+				for (const shadowRoot of shadowRootsToWatch) if (!shadowRoot.isConnected) {
+					observer.disconnect();
+					break;
+				}
 			}
 		}
-	});
+	};
+	const observer = new windowObj.MutationObserver(processMutations);
 	observer.observe(root, {
 		childList: true,
 		subtree: true
 	});
+	const shadowObservers = /* @__PURE__ */ new Set();
+	if (shadowDOM()) for (const shadowRoot of shadowRootsToWatch) {
+		const shadowObserver = new windowObj.MutationObserver(processMutations);
+		shadowObserver.observe(shadowRoot, {
+			childList: true,
+			subtree: true
+		});
+		shadowObservers.add(shadowObserver);
+	}
 	const observerWrapper = {
 		visibleNodes,
 		hiddenNodes,
@@ -89,6 +290,7 @@ function ariaHideOutside(targets, options) {
 	observerStack.push(observerWrapper);
 	return () => {
 		observer.disconnect();
+		if (shadowDOM()) for (const shadowObserver of shadowObservers) shadowObserver.disconnect();
 		for (const node of hiddenNodes) {
 			const count = refCountMap.get(node);
 			if (count == null) continue;

package/dist/_chunk/ariaHideOutside.js.map

@@ -1 +1 @@
-{"version":3,"file":"ariaHideOutside.js","names":[],"sources":["../../src/overlays/ariaHideOutside.ts"],"sourcesContent":["/**\n * Hides all elements in the DOM outside the given targets from screen readers.\n * Based on @react-aria/overlays ariaHideOutside.\n */\n\nimport { getOwnerWindow } from \"../utils\";\n\nconst supportsInert = typeof HTMLElement !== \"undefined\" && \"inert\" in HTMLElement.prototype;\n\nexport interface AriaHideOutsideOptions {\n  /** The root element to start hiding from. */\n  root?: Element;\n  /** Whether to use the `inert` attribute instead of `aria-hidden`. */\n  shouldUseInert?: boolean;\n}\n\n// Keeps a ref count of all hidden elements. Added to when hiding an element, and\n// subtracted from when showing it again. When it reaches zero, aria-hidden is removed.\nconst refCountMap = new WeakMap<Element, number>();\n\ninterface ObserverWrapper {\n  visibleNodes: Set<Element>;\n  hiddenNodes: Set<Element>;\n  observe: () => void;\n  disconnect: () => void;\n}\n\nconst observerStack: ObserverWrapper[] = [];\n\n/**\n * Hides all elements in the DOM outside the given targets from screen readers using aria-hidden,\n * and returns a function to revert these changes. In addition, changes to the DOM are watched\n * and new elements outside the targets are automatically hidden.\n * @param targets - The elements that should remain visible.\n * @param options - Options for hiding behavior.\n * @returns - A function to restore all hidden elements.\n */\nexport function ariaHideOutside(\n  targets: Element[],\n  options?: AriaHideOutsideOptions | Element,\n): () => void {\n  const windowObj = getOwnerWindow(targets?.[0]);\n  const opts = options instanceof windowObj.Element ? { root: options } : options;\n  const root = opts?.root ?? document.body;\n  const shouldUseInert = opts?.shouldUseInert && supportsInert;\n  const visibleNodes = new Set<Element>(targets);\n  const hiddenNodes = new Set<Element>();\n\n  const getHidden = (element: Element): boolean => {\n    return shouldUseInert && element instanceof windowObj.HTMLElement\n      ? element.inert\n      : element.getAttribute(\"aria-hidden\") === \"true\";\n  };\n\n  const setHidden = (element: Element, hidden: boolean): void => {\n    if (shouldUseInert && element instanceof windowObj.HTMLElement) {\n      element.inert = hidden;\n    } else if (hidden) {\n      element.setAttribute(\"aria-hidden\", \"true\");\n    } else {\n      element.removeAttribute(\"aria-hidden\");\n      if (element instanceof windowObj.HTMLElement) {\n        // We only ever call setHidden with hidden = false when the nodeCount is 1 aka\n        // we are trying to make the element visible to screen readers again, so remove inert as well\n        element.inert = false;\n      }\n    }\n  };\n\n  const hide = (node: Element): void => {\n    let refCount = refCountMap.get(node) ?? 0;\n\n    // If already aria-hidden, and the ref count is zero, then this element\n    // was already hidden and there's nothing for us to do.\n    if (getHidden(node) && refCount === 0) {\n      return;\n    }\n\n    if (refCount === 0) {\n      setHidden(node, true);\n    }\n\n    hiddenNodes.add(node);\n    refCountMap.set(node, refCount + 1);\n  };\n\n  const walk = (walkRoot: Element): void => {\n    // Keep live announcer and top layer elements (e.g. toasts) visible.\n    for (const element of walkRoot.querySelectorAll(\n      \"[data-live-announcer], [data-solidaria-top-layer]\",\n    )) {\n      visibleNodes.add(element);\n    }\n\n    const acceptNode = (node: Element): number => {\n      // Skip this node and its children if it is one of the target nodes, or a live announcer.\n      // Also skip children of already hidden nodes, as aria-hidden is recursive. An exception is\n      // made for elements with role=\"row\" since VoiceOver on iOS has issues hiding elements with role=\"row\".\n      // For that case we want to hide the cells inside as well (https://bugs.webkit.org/show_bug.cgi?id=222623).\n      if (\n        hiddenNodes.has(node) ||\n        visibleNodes.has(node) ||\n        (node.parentElement &&\n          hiddenNodes.has(node.parentElement) &&\n          node.parentElement.getAttribute(\"role\") !== \"row\")\n      ) {\n        return NodeFilter.FILTER_REJECT;\n      }\n\n      // Skip this node but continue to children if one of the targets is inside the node.\n      for (const target of visibleNodes) {\n        if (node.contains(target)) {\n          return NodeFilter.FILTER_SKIP;\n        }\n      }\n\n      return NodeFilter.FILTER_ACCEPT;\n    };\n\n    const walker = document.createTreeWalker(walkRoot, NodeFilter.SHOW_ELEMENT, { acceptNode });\n\n    // TreeWalker does not include the root.\n    const acceptRoot = acceptNode(walkRoot);\n    if (acceptRoot === NodeFilter.FILTER_ACCEPT) {\n      hide(walkRoot);\n    }\n\n    if (acceptRoot !== NodeFilter.FILTER_REJECT) {\n      let node = walker.nextNode() as Element;\n      while (node != null) {\n        hide(node);\n        node = walker.nextNode() as Element;\n      }\n    }\n  };\n\n  // If there is already a MutationObserver listening from a previous call,\n  // disconnect it so the new one takes over.\n  if (observerStack.length) {\n    observerStack[observerStack.length - 1].disconnect();\n  }\n\n  walk(root);\n\n  const observer = new MutationObserver((changes) => {\n    for (const change of changes) {\n      if (change.type !== \"childList\") {\n        continue;\n      }\n\n      // If the parent element of the added nodes is not within one of the targets,\n      // and not already inside a hidden node, hide all of the new children.\n      if (![...visibleNodes, ...hiddenNodes].some((node) => node.contains(change.target))) {\n        for (const node of change.addedNodes) {\n          if (\n            (node instanceof HTMLElement || node instanceof SVGElement) &&\n            (node.dataset.liveAnnouncer === \"true\" || node.dataset.solidariaTopLayer === \"true\")\n          ) {\n            visibleNodes.add(node);\n          } else if (node instanceof Element) {\n            walk(node);\n          }\n        }\n      }\n    }\n  });\n\n  observer.observe(root, { childList: true, subtree: true });\n\n  const observerWrapper: ObserverWrapper = {\n    visibleNodes,\n    hiddenNodes,\n    observe() {\n      observer.observe(root, { childList: true, subtree: true });\n    },\n    disconnect() {\n      observer.disconnect();\n    },\n  };\n\n  observerStack.push(observerWrapper);\n\n  return (): void => {\n    observer.disconnect();\n\n    for (const node of hiddenNodes) {\n      const count = refCountMap.get(node);\n      if (count == null) {\n        continue;\n      }\n      if (count === 1) {\n        setHidden(node, false);\n        refCountMap.delete(node);\n      } else {\n        refCountMap.set(node, count - 1);\n      }\n    }\n\n    // Remove this observer from the stack, and start the previous one.\n    if (observerWrapper === observerStack[observerStack.length - 1]) {\n      observerStack.pop();\n      if (observerStack.length) {\n        observerStack[observerStack.length - 1].observe();\n      }\n    } else {\n      observerStack.splice(observerStack.indexOf(observerWrapper), 1);\n    }\n  };\n}\n\n/**\n * Keeps an element visible when aria-hiding is active.\n * Used for elements like live regions that should remain accessible.\n */\nexport function keepVisible(element: Element): (() => void) | undefined {\n  const observer = observerStack[observerStack.length - 1];\n  if (observer && !observer.visibleNodes.has(element)) {\n    observer.visibleNodes.add(element);\n    return () => {\n      observer.visibleNodes.delete(element);\n    };\n  }\n}\n"],"mappings":";;;;;;AAOA,MAAM,gBAAgB,OAAO,gBAAgB,eAAe,WAAW,YAAY;AAWnF,MAAM,8BAAc,IAAI,QAAyB;AASjD,MAAM,gBAAmC,CAAC;;;;;;;;;AAU1C,SAAgB,gBACd,SACA,SACY;CACZ,MAAM,YAAY,eAAe,UAAU,EAAE;CAC7C,MAAM,OAAO,mBAAmB,UAAU,UAAU,EAAE,MAAM,QAAQ,IAAI;CACxE,MAAM,OAAO,MAAM,QAAQ,SAAS;CACpC,MAAM,iBAAiB,MAAM,kBAAkB;CAC/C,MAAM,eAAe,IAAI,IAAa,OAAO;CAC7C,MAAM,8BAAc,IAAI,IAAa;CAErC,MAAM,aAAa,YAA8B;EAC/C,OAAO,kBAAkB,mBAAmB,UAAU,cAClD,QAAQ,QACR,QAAQ,aAAa,aAAa,MAAM;CAC9C;CAEA,MAAM,aAAa,SAAkB,WAA0B;EAC7D,IAAI,kBAAkB,mBAAmB,UAAU,aACjD,QAAQ,QAAQ;OACX,IAAI,QACT,QAAQ,aAAa,eAAe,MAAM;OACrC;GACL,QAAQ,gBAAgB,aAAa;GACrC,IAAI,mBAAmB,UAAU,aAG/B,QAAQ,QAAQ;EAEpB;CACF;CAEA,MAAM,QAAQ,SAAwB;EACpC,IAAI,WAAW,YAAY,IAAI,IAAI,KAAK;EAIxC,IAAI,UAAU,IAAI,KAAK,aAAa,GAClC;EAGF,IAAI,aAAa,GACf,UAAU,MAAM,IAAI;EAGtB,YAAY,IAAI,IAAI;EACpB,YAAY,IAAI,MAAM,WAAW,CAAC;CACpC;CAEA,MAAM,QAAQ,aAA4B;EAExC,KAAK,MAAM,WAAW,SAAS,iBAC7B,mDACF,GACE,aAAa,IAAI,OAAO;EAG1B,MAAM,cAAc,SAA0B;GAK5C,IACE,YAAY,IAAI,IAAI,KACpB,aAAa,IAAI,IAAI,KACpB,KAAK,iBACJ,YAAY,IAAI,KAAK,aAAa,KAClC,KAAK,cAAc,aAAa,MAAM,MAAM,OAE9C,OAAO,WAAW;GAIpB,KAAK,MAAM,UAAU,cACnB,IAAI,KAAK,SAAS,MAAM,GACtB,OAAO,WAAW;GAItB,OAAO,WAAW;EACpB;EAEA,MAAM,SAAS,SAAS,iBAAiB,UAAU,WAAW,cAAc,EAAE,WAAW,CAAC;EAG1F,MAAM,aAAa,WAAW,QAAQ;EACtC,IAAI,eAAe,WAAW,eAC5B,KAAK,QAAQ;EAGf,IAAI,eAAe,WAAW,eAAe;GAC3C,IAAI,OAAO,OAAO,SAAS;GAC3B,OAAO,QAAQ,MAAM;IACnB,KAAK,IAAI;IACT,OAAO,OAAO,SAAS;GACzB;EACF;CACF;CAIA,IAAI,cAAc,QAChB,cAAc,cAAc,SAAS,EAAE,CAAC,WAAW;CAGrD,KAAK,IAAI;CAET,MAAM,WAAW,IAAI,kBAAkB,YAAY;EACjD,KAAK,MAAM,UAAU,SAAS;GAC5B,IAAI,OAAO,SAAS,aAClB;GAKF,IAAI,CAAC,CAAC,GAAG,cAAc,GAAG,WAAW,CAAC,CAAC,MAAM,SAAS,KAAK,SAAS,OAAO,MAAM,CAAC;SAC3E,MAAM,QAAQ,OAAO,YACxB,KACG,gBAAgB,eAAe,gBAAgB,gBAC/C,KAAK,QAAQ,kBAAkB,UAAU,KAAK,QAAQ,sBAAsB,SAE7E,aAAa,IAAI,IAAI;SAChB,IAAI,gBAAgB,SACzB,KAAK,IAAI;GAAA;EAIjB;CACF,CAAC;CAED,SAAS,QAAQ,MAAM;EAAE,WAAW;EAAM,SAAS;CAAK,CAAC;CAEzD,MAAM,kBAAmC;EACvC;EACA;EACA,UAAU;GACR,SAAS,QAAQ,MAAM;IAAE,WAAW;IAAM,SAAS;GAAK,CAAC;EAC3D;EACA,aAAa;GACX,SAAS,WAAW;EACtB;CACF;CAEA,cAAc,KAAK,eAAe;CAElC,aAAmB;EACjB,SAAS,WAAW;EAEpB,KAAK,MAAM,QAAQ,aAAa;GAC9B,MAAM,QAAQ,YAAY,IAAI,IAAI;GAClC,IAAI,SAAS,MACX;GAEF,IAAI,UAAU,GAAG;IACf,UAAU,MAAM,KAAK;IACrB,YAAY,OAAO,IAAI;GACzB,OACE,YAAY,IAAI,MAAM,QAAQ,CAAC;EAEnC;EAGA,IAAI,oBAAoB,cAAc,cAAc,SAAS,IAAI;GAC/D,cAAc,IAAI;GAClB,IAAI,cAAc,QAChB,cAAc,cAAc,SAAS,EAAE,CAAC,QAAQ;EAEpD,OACE,cAAc,OAAO,cAAc,QAAQ,eAAe,GAAG,CAAC;CAElE;AACF;;;;;AAMA,SAAgB,YAAY,SAA4C;CACtE,MAAM,WAAW,cAAc,cAAc,SAAS;CACtD,IAAI,YAAY,CAAC,SAAS,aAAa,IAAI,OAAO,GAAG;EACnD,SAAS,aAAa,IAAI,OAAO;EACjC,aAAa;GACX,SAAS,aAAa,OAAO,OAAO;EACtC;CACF;AACF"}
+{"version":3,"file":"ariaHideOutside.js","names":[],"sources":["../../src/utils/ShadowTreeWalker.ts","../../src/overlays/ariaHideOutside.ts"],"sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// Ported to SolidJS for Proyecto Viviana; based on packages/react-aria/src/utils/shadowdom/ShadowTreeWalker.ts\n// Adobe's source is based on:\n// https://github.com/microsoft/tabster/blob/a89fc5d7e332d48f68d03b1ca6e344489d1c3898/src/Shadowdomize/ShadowTreeWalker.ts\n\nimport { shadowDOM } from \"@proyecto-viviana/solid-stately/private/flags/flags\";\nimport { nodeContains } from \"./dom\";\n\nexport class ShadowTreeWalker implements TreeWalker {\n  public readonly filter: NodeFilter | null;\n  public readonly root: Node;\n  public readonly whatToShow: number;\n\n  private readonly doc: Document;\n  private walkerStack: TreeWalker[] = [];\n  private current: Node;\n  private currentSetFor = new Set<TreeWalker>();\n\n  constructor(doc: Document, root: Node, whatToShow?: number, filter?: NodeFilter | null) {\n    this.doc = doc;\n    this.root = root;\n    this.filter = filter ?? null;\n    this.whatToShow = whatToShow ?? NodeFilter.SHOW_ALL;\n    this.current = root;\n\n    this.walkerStack.unshift(doc.createTreeWalker(root, whatToShow, this.acceptNode));\n\n    const shadowRoot = (root as Element).shadowRoot;\n    if (shadowRoot) {\n      this.walkerStack.unshift(\n        this.doc.createTreeWalker(shadowRoot, this.whatToShow, {\n          acceptNode: this.acceptNode,\n        }),\n      );\n    }\n  }\n\n  private acceptNode = (node: Node): number => {\n    if (node.nodeType === Node.ELEMENT_NODE) {\n      const shadowRoot = (node as Element).shadowRoot;\n      if (shadowRoot) {\n        this.walkerStack.unshift(\n          this.doc.createTreeWalker(shadowRoot, this.whatToShow, {\n            acceptNode: this.acceptNode,\n          }),\n        );\n        return NodeFilter.FILTER_ACCEPT;\n      }\n\n      if (typeof this.filter === \"function\") {\n        return this.filter(node);\n      }\n      if (this.filter?.acceptNode) {\n        return this.filter.acceptNode(node);\n      }\n      if (this.filter === null) {\n        return NodeFilter.FILTER_ACCEPT;\n      }\n    }\n\n    return NodeFilter.FILTER_SKIP;\n  };\n\n  public get currentNode(): Node {\n    return this.current;\n  }\n\n  public set currentNode(node: Node) {\n    if (!nodeContains(this.root, node)) {\n      throw new Error(\"Cannot set currentNode to a node that is not contained by the root node.\");\n    }\n\n    const walkers: TreeWalker[] = [];\n    let currentNode: Node | null | undefined = node;\n    let walkerCurrentNode = node;\n    this.current = node;\n\n    while (currentNode && currentNode !== this.root) {\n      if (currentNode.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {\n        const shadowRoot = currentNode as ShadowRoot;\n        const walker = this.doc.createTreeWalker(shadowRoot, this.whatToShow, {\n          acceptNode: this.acceptNode,\n        });\n        walkers.push(walker);\n        walker.currentNode = walkerCurrentNode;\n        this.currentSetFor.add(walker);\n        currentNode = walkerCurrentNode = shadowRoot.host;\n      } else {\n        currentNode = currentNode.parentNode;\n      }\n    }\n\n    const walker = this.doc.createTreeWalker(this.root, this.whatToShow, {\n      acceptNode: this.acceptNode,\n    });\n    walkers.push(walker);\n    walker.currentNode = walkerCurrentNode;\n    this.currentSetFor.add(walker);\n    this.walkerStack = walkers;\n  }\n\n  public firstChild(): Node | null {\n    const currentNode = this.currentNode;\n    const newNode = this.nextNode();\n    if (!nodeContains(currentNode, newNode)) {\n      this.currentNode = currentNode;\n      return null;\n    }\n    if (newNode) {\n      this.currentNode = newNode;\n    }\n    return newNode;\n  }\n\n  public lastChild(): Node | null {\n    const walker = this.walkerStack[0];\n    const newNode = walker.lastChild();\n    if (newNode) {\n      this.currentNode = newNode;\n    }\n    return newNode;\n  }\n\n  public nextNode(): Node | null {\n    const nextNode = this.walkerStack[0].nextNode();\n    if (nextNode) {\n      const shadowRoot = (nextNode as Element).shadowRoot;\n      if (shadowRoot) {\n        let nodeResult: number | undefined;\n        if (typeof this.filter === \"function\") {\n          nodeResult = this.filter(nextNode);\n        } else if (this.filter?.acceptNode) {\n          nodeResult = this.filter.acceptNode(nextNode);\n        }\n\n        if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n          this.currentNode = nextNode;\n          return nextNode;\n        }\n\n        const childNode = this.nextNode();\n        if (childNode) {\n          this.currentNode = childNode;\n        }\n        return childNode;\n      }\n\n      this.currentNode = nextNode;\n      return nextNode;\n    }\n\n    if (this.walkerStack.length > 1) {\n      this.walkerStack.shift();\n      const parentNode = this.nextNode();\n      if (parentNode) {\n        this.currentNode = parentNode;\n      }\n      return parentNode;\n    }\n    return null;\n  }\n\n  public previousNode(): Node | null {\n    const currentWalker = this.walkerStack[0];\n    if (currentWalker.currentNode === currentWalker.root) {\n      if (this.currentSetFor.has(currentWalker)) {\n        this.currentSetFor.delete(currentWalker);\n        if (this.walkerStack.length > 1) {\n          this.walkerStack.shift();\n          const parentNode = this.previousNode();\n          if (parentNode) {\n            this.currentNode = parentNode;\n          }\n          return parentNode;\n        }\n      }\n      return null;\n    }\n\n    const previousNode = currentWalker.previousNode();\n    if (previousNode) {\n      const shadowRoot = (previousNode as Element).shadowRoot;\n      if (shadowRoot) {\n        let nodeResult: number | undefined;\n        if (typeof this.filter === \"function\") {\n          nodeResult = this.filter(previousNode);\n        } else if (this.filter?.acceptNode) {\n          nodeResult = this.filter.acceptNode(previousNode);\n        }\n\n        if (nodeResult === NodeFilter.FILTER_ACCEPT) {\n          this.currentNode = previousNode;\n          return previousNode;\n        }\n\n        const childNode = this.lastChild();\n        if (childNode) {\n          this.currentNode = childNode;\n        }\n        return childNode;\n      }\n\n      this.currentNode = previousNode;\n      return previousNode;\n    }\n\n    if (this.walkerStack.length > 1) {\n      this.walkerStack.shift();\n      const parentNode = this.previousNode();\n      if (parentNode) {\n        this.currentNode = parentNode;\n      }\n      return parentNode;\n    }\n    return null;\n  }\n\n  /** @deprecated */\n  public nextSibling(): Node | null {\n    return null;\n  }\n\n  /** @deprecated */\n  public previousSibling(): Node | null {\n    return null;\n  }\n\n  /** @deprecated */\n  public parentNode(): Node | null {\n    return null;\n  }\n}\n\n/** Shadow DOM-safe version of `Document.createTreeWalker`. */\nexport function createShadowTreeWalker(\n  doc: Document,\n  root: Node,\n  whatToShow?: number,\n  filter?: NodeFilter | null,\n): TreeWalker {\n  if (shadowDOM()) {\n    return new ShadowTreeWalker(doc, root, whatToShow, filter);\n  }\n  return doc.createTreeWalker(root, whatToShow, filter);\n}\n","/*\n * Copyright 2020 Adobe. All rights reserved.\n * This file is licensed to you under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License. You may obtain a copy\n * of the License at http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under\n * the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS\n * OF ANY KIND, either express or implied. See the License for the specific language\n * governing permissions and limitations under the License.\n */\n\n// Ported to SolidJS for Proyecto Viviana; based on packages/react-aria/src/overlays/ariaHideOutside.ts\n\n/**\n * Hides all elements in the DOM outside the given targets from screen readers.\n * Ported from packages/react-aria/src/overlays/ariaHideOutside.ts.\n */\n\nimport { shadowDOM } from \"@proyecto-viviana/solid-stately/private/flags/flags\";\nimport { getOwnerDocument, getOwnerWindow, nodeContains } from \"../utils\";\nimport { createShadowTreeWalker } from \"../utils/ShadowTreeWalker\";\n\nconst supportsInert = typeof HTMLElement !== \"undefined\" && \"inert\" in HTMLElement.prototype;\n\nfunction isAlwaysVisibleNode(node: HTMLElement | SVGElement): boolean {\n  return node.dataset.liveAnnouncer === \"true\" || node.dataset.solidariaTopLayer !== undefined;\n}\n\nexport interface AriaHideOutsideOptions {\n  /** The root element to start hiding from. */\n  root?: Element;\n  /** Whether to use the `inert` attribute instead of `aria-hidden`. */\n  shouldUseInert?: boolean;\n}\n\n// Keeps a ref count of all hidden elements. Added to when hiding an element, and\n// subtracted from when showing it again. When it reaches zero, aria-hidden is removed.\nconst refCountMap = new WeakMap<Element, number>();\n\ninterface ObserverWrapper {\n  visibleNodes: Set<Element>;\n  hiddenNodes: Set<Element>;\n  observe: () => void;\n  disconnect: () => void;\n}\n\nconst observerStack: ObserverWrapper[] = [];\n\n/**\n * Hides all elements in the DOM outside the given targets from screen readers using aria-hidden,\n * and returns a function to revert these changes. In addition, changes to the DOM are watched\n * and new elements outside the targets are automatically hidden.\n * @param targets - The elements that should remain visible.\n * @param options - Options for hiding behavior.\n * @returns - A function to restore all hidden elements.\n */\nexport function ariaHideOutside(\n  targets: Element[],\n  options?: AriaHideOutsideOptions | Element,\n): () => void {\n  const windowObj = getOwnerWindow(targets?.[0]);\n  const opts = options instanceof windowObj.Element ? { root: options } : options;\n  const root = opts?.root ?? getOwnerDocument(targets?.[0]).body;\n  const shouldUseInert = opts?.shouldUseInert && supportsInert;\n  const visibleNodes = new Set<Element>(targets);\n  const hiddenNodes = new Set<Element>();\n\n  const shadowRootsToWatch = new Set<ShadowRoot>();\n  if (shadowDOM()) {\n    const boundary = root.getRootNode();\n    for (const target of targets) {\n      let current = target.getRootNode();\n      while (current instanceof windowObj.ShadowRoot && current !== boundary) {\n        shadowRootsToWatch.add(current);\n        current = current.host.getRootNode();\n      }\n    }\n  }\n\n  const getHidden = (element: Element): boolean => {\n    return shouldUseInert && element instanceof windowObj.HTMLElement\n      ? element.inert\n      : element.getAttribute(\"aria-hidden\") === \"true\";\n  };\n\n  const setHidden = (element: Element, hidden: boolean): void => {\n    if (shouldUseInert && element instanceof windowObj.HTMLElement) {\n      element.inert = hidden;\n    } else if (hidden) {\n      element.setAttribute(\"aria-hidden\", \"true\");\n    } else {\n      element.removeAttribute(\"aria-hidden\");\n      if (element instanceof windowObj.HTMLElement) {\n        // We only ever call setHidden with hidden = false when the nodeCount is 1 aka\n        // we are trying to make the element visible to screen readers again, so remove inert as well\n        element.inert = false;\n      }\n    }\n  };\n\n  const hide = (node: Element): void => {\n    let refCount = refCountMap.get(node) ?? 0;\n\n    // If already aria-hidden, and the ref count is zero, then this element\n    // was already hidden and there's nothing for us to do.\n    if (getHidden(node) && refCount === 0) {\n      return;\n    }\n\n    if (refCount === 0) {\n      setHidden(node, true);\n    }\n\n    hiddenNodes.add(node);\n    refCountMap.set(node, refCount + 1);\n  };\n\n  const walk = (walkRoot: Element): void => {\n    // Keep live announcer and top layer elements (e.g. toasts) visible.\n    for (const element of walkRoot.querySelectorAll(\n      \"[data-live-announcer], [data-solidaria-top-layer]\",\n    )) {\n      visibleNodes.add(element);\n    }\n\n    const acceptNode = (node: Element): number => {\n      // Skip this node and its children if it is one of the target nodes, or a live announcer.\n      // Also skip children of already hidden nodes, as aria-hidden is recursive. An exception is\n      // made for elements with role=\"row\" since VoiceOver on iOS has issues hiding elements with role=\"row\".\n      // For that case we want to hide the cells inside as well (https://bugs.webkit.org/show_bug.cgi?id=222623).\n      if (\n        hiddenNodes.has(node) ||\n        visibleNodes.has(node) ||\n        (node.parentElement &&\n          hiddenNodes.has(node.parentElement) &&\n          node.parentElement.getAttribute(\"role\") !== \"row\")\n      ) {\n        return NodeFilter.FILTER_REJECT;\n      }\n\n      // Skip this node but continue to children if one of the targets is inside the node.\n      for (const target of visibleNodes) {\n        if (nodeContains(node, target)) {\n          return NodeFilter.FILTER_SKIP;\n        }\n      }\n\n      return NodeFilter.FILTER_ACCEPT;\n    };\n\n    const walker = createShadowTreeWalker(\n      getOwnerDocument(walkRoot),\n      walkRoot,\n      NodeFilter.SHOW_ELEMENT,\n      { acceptNode },\n    );\n\n    // TreeWalker does not include the root.\n    const acceptRoot = acceptNode(walkRoot);\n    if (acceptRoot === NodeFilter.FILTER_ACCEPT) {\n      hide(walkRoot);\n    }\n\n    if (acceptRoot !== NodeFilter.FILTER_REJECT) {\n      let node = walker.nextNode() as Element;\n      while (node != null) {\n        hide(node);\n        node = walker.nextNode() as Element;\n      }\n    }\n  };\n\n  // If there is already a MutationObserver listening from a previous call,\n  // disconnect it so the new one takes over.\n  if (observerStack.length) {\n    observerStack[observerStack.length - 1].disconnect();\n  }\n\n  walk(root);\n\n  const processMutations = (changes: MutationRecord[]): void => {\n    for (const change of changes) {\n      if (change.type !== \"childList\") {\n        continue;\n      }\n\n      // If the parent element of the added nodes is not within one of the targets,\n      // and not already inside a hidden node, hide all of the new children.\n      if (\n        change.target.isConnected &&\n        ![...visibleNodes, ...hiddenNodes].some((node) => nodeContains(node, change.target))\n      ) {\n        for (const node of change.addedNodes) {\n          if (\n            (node instanceof windowObj.HTMLElement || node instanceof windowObj.SVGElement) &&\n            isAlwaysVisibleNode(node)\n          ) {\n            visibleNodes.add(node);\n          } else if (node instanceof windowObj.Element) {\n            walk(node);\n          }\n        }\n      }\n\n      if (shadowDOM()) {\n        for (const shadowRoot of shadowRootsToWatch) {\n          if (!shadowRoot.isConnected) {\n            observer.disconnect();\n            break;\n          }\n        }\n      }\n    }\n  };\n\n  const observer = new windowObj.MutationObserver(processMutations);\n\n  observer.observe(root, { childList: true, subtree: true });\n\n  const shadowObservers = new Set<MutationObserver>();\n  if (shadowDOM()) {\n    for (const shadowRoot of shadowRootsToWatch) {\n      const shadowObserver = new windowObj.MutationObserver(processMutations);\n      shadowObserver.observe(shadowRoot, { childList: true, subtree: true });\n      shadowObservers.add(shadowObserver);\n    }\n  }\n\n  const observerWrapper: ObserverWrapper = {\n    visibleNodes,\n    hiddenNodes,\n    observe() {\n      observer.observe(root, { childList: true, subtree: true });\n    },\n    disconnect() {\n      observer.disconnect();\n    },\n  };\n\n  observerStack.push(observerWrapper);\n\n  return (): void => {\n    observer.disconnect();\n    if (shadowDOM()) {\n      for (const shadowObserver of shadowObservers) {\n        shadowObserver.disconnect();\n      }\n    }\n\n    for (const node of hiddenNodes) {\n      const count = refCountMap.get(node);\n      if (count == null) {\n        continue;\n      }\n      if (count === 1) {\n        setHidden(node, false);\n        refCountMap.delete(node);\n      } else {\n        refCountMap.set(node, count - 1);\n      }\n    }\n\n    // Remove this observer from the stack, and start the previous one.\n    if (observerWrapper === observerStack[observerStack.length - 1]) {\n      observerStack.pop();\n      if (observerStack.length) {\n        observerStack[observerStack.length - 1].observe();\n      }\n    } else {\n      observerStack.splice(observerStack.indexOf(observerWrapper), 1);\n    }\n  };\n}\n\n/**\n * Keeps an element visible when aria-hiding is active.\n * Used for elements like live regions that should remain accessible.\n */\nexport function keepVisible(element: Element): (() => void) | undefined {\n  const observer = observerStack[observerStack.length - 1];\n  if (observer && !observer.visibleNodes.has(element)) {\n    observer.visibleNodes.add(element);\n    return () => {\n      observer.visibleNodes.delete(element);\n    };\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAYA,IAAa,mBAAb,MAAoD;CAClD;CACA;CACA;CAEA;CACA,cAAoC,CAAC;CACrC;CACA,gCAAwB,IAAI,IAAgB;CAE5C,YAAY,KAAe,MAAY,YAAqB,QAA4B;EACtF,KAAK,MAAM;EACX,KAAK,OAAO;EACZ,KAAK,SAAS,UAAU;EACxB,KAAK,aAAa,cAAc,WAAW;EAC3C,KAAK,UAAU;EAEf,KAAK,YAAY,QAAQ,IAAI,iBAAiB,MAAM,YAAY,KAAK,UAAU,CAAC;EAEhF,MAAM,aAAc,KAAiB;EACrC,IAAI,YACF,KAAK,YAAY,QACf,KAAK,IAAI,iBAAiB,YAAY,KAAK,YAAY,EACrD,YAAY,KAAK,WACnB,CAAC,CACH;CAEJ;CAEA,cAAsB,SAAuB;EAC3C,IAAI,KAAK,aAAa,KAAK,cAAc;GACvC,MAAM,aAAc,KAAiB;GACrC,IAAI,YAAY;IACd,KAAK,YAAY,QACf,KAAK,IAAI,iBAAiB,YAAY,KAAK,YAAY,EACrD,YAAY,KAAK,WACnB,CAAC,CACH;IACA,OAAO,WAAW;GACpB;GAEA,IAAI,OAAO,KAAK,WAAW,YACzB,OAAO,KAAK,OAAO,IAAI;GAEzB,IAAI,KAAK,QAAQ,YACf,OAAO,KAAK,OAAO,WAAW,IAAI;GAEpC,IAAI,KAAK,WAAW,MAClB,OAAO,WAAW;EAEtB;EAEA,OAAO,WAAW;CACpB;CAEA,IAAW,cAAoB;EAC7B,OAAO,KAAK;CACd;CAEA,IAAW,YAAY,MAAY;EACjC,IAAI,CAAC,aAAa,KAAK,MAAM,IAAI,GAC/B,MAAM,IAAI,MAAM,0EAA0E;EAG5F,MAAM,UAAwB,CAAC;EAC/B,IAAI,cAAuC;EAC3C,IAAI,oBAAoB;EACxB,KAAK,UAAU;EAEf,OAAO,eAAe,gBAAgB,KAAK,MACzC,IAAI,YAAY,aAAa,KAAK,wBAAwB;GACxD,MAAM,aAAa;GACnB,MAAM,SAAS,KAAK,IAAI,iBAAiB,YAAY,KAAK,YAAY,EACpE,YAAY,KAAK,WACnB,CAAC;GACD,QAAQ,KAAK,MAAM;GACnB,OAAO,cAAc;GACrB,KAAK,cAAc,IAAI,MAAM;GAC7B,cAAc,oBAAoB,WAAW;EAC/C,OACE,cAAc,YAAY;EAI9B,MAAM,SAAS,KAAK,IAAI,iBAAiB,KAAK,MAAM,KAAK,YAAY,EACnE,YAAY,KAAK,WACnB,CAAC;EACD,QAAQ,KAAK,MAAM;EACnB,OAAO,cAAc;EACrB,KAAK,cAAc,IAAI,MAAM;EAC7B,KAAK,cAAc;CACrB;CAEA,aAAiC;EAC/B,MAAM,cAAc,KAAK;EACzB,MAAM,UAAU,KAAK,SAAS;EAC9B,IAAI,CAAC,aAAa,aAAa,OAAO,GAAG;GACvC,KAAK,cAAc;GACnB,OAAO;EACT;EACA,IAAI,SACF,KAAK,cAAc;EAErB,OAAO;CACT;CAEA,YAAgC;EAE9B,MAAM,UADS,KAAK,YAAY,EACV,CAAC,UAAU;EACjC,IAAI,SACF,KAAK,cAAc;EAErB,OAAO;CACT;CAEA,WAA+B;EAC7B,MAAM,WAAW,KAAK,YAAY,EAAE,CAAC,SAAS;EAC9C,IAAI,UAAU;GAEZ,IADoB,SAAqB,YACzB;IACd,IAAI;IACJ,IAAI,OAAO,KAAK,WAAW,YACzB,aAAa,KAAK,OAAO,QAAQ;SAC5B,IAAI,KAAK,QAAQ,YACtB,aAAa,KAAK,OAAO,WAAW,QAAQ;IAG9C,IAAI,eAAe,WAAW,eAAe;KAC3C,KAAK,cAAc;KACnB,OAAO;IACT;IAEA,MAAM,YAAY,KAAK,SAAS;IAChC,IAAI,WACF,KAAK,cAAc;IAErB,OAAO;GACT;GAEA,KAAK,cAAc;GACnB,OAAO;EACT;EAEA,IAAI,KAAK,YAAY,SAAS,GAAG;GAC/B,KAAK,YAAY,MAAM;GACvB,MAAM,aAAa,KAAK,SAAS;GACjC,IAAI,YACF,KAAK,cAAc;GAErB,OAAO;EACT;EACA,OAAO;CACT;CAEA,eAAmC;EACjC,MAAM,gBAAgB,KAAK,YAAY;EACvC,IAAI,cAAc,gBAAgB,cAAc,MAAM;GACpD,IAAI,KAAK,cAAc,IAAI,aAAa,GAAG;IACzC,KAAK,cAAc,OAAO,aAAa;IACvC,IAAI,KAAK,YAAY,SAAS,GAAG;KAC/B,KAAK,YAAY,MAAM;KACvB,MAAM,aAAa,KAAK,aAAa;KACrC,IAAI,YACF,KAAK,cAAc;KAErB,OAAO;IACT;GACF;GACA,OAAO;EACT;EAEA,MAAM,eAAe,cAAc,aAAa;EAChD,IAAI,cAAc;GAEhB,IADoB,aAAyB,YAC7B;IACd,IAAI;IACJ,IAAI,OAAO,KAAK,WAAW,YACzB,aAAa,KAAK,OAAO,YAAY;SAChC,IAAI,KAAK,QAAQ,YACtB,aAAa,KAAK,OAAO,WAAW,YAAY;IAGlD,IAAI,eAAe,WAAW,eAAe;KAC3C,KAAK,cAAc;KACnB,OAAO;IACT;IAEA,MAAM,YAAY,KAAK,UAAU;IACjC,IAAI,WACF,KAAK,cAAc;IAErB,OAAO;GACT;GAEA,KAAK,cAAc;GACnB,OAAO;EACT;EAEA,IAAI,KAAK,YAAY,SAAS,GAAG;GAC/B,KAAK,YAAY,MAAM;GACvB,MAAM,aAAa,KAAK,aAAa;GACrC,IAAI,YACF,KAAK,cAAc;GAErB,OAAO;EACT;EACA,OAAO;CACT;;CAGA,cAAkC;EAChC,OAAO;CACT;;CAGA,kBAAsC;EACpC,OAAO;CACT;;CAGA,aAAiC;EAC/B,OAAO;CACT;AACF;;AAGA,SAAgB,uBACd,KACA,MACA,YACA,QACY;CACZ,IAAI,UAAU,GACZ,OAAO,IAAI,iBAAiB,KAAK,MAAM,YAAY,MAAM;CAE3D,OAAO,IAAI,iBAAiB,MAAM,YAAY,MAAM;AACtD;;;;;;;ACjOA,MAAM,gBAAgB,OAAO,gBAAgB,eAAe,WAAW,YAAY;AAEnF,SAAS,oBAAoB,MAAyC;CACpE,OAAO,KAAK,QAAQ,kBAAkB,UAAU,KAAK,QAAQ,sBAAsB,KAAA;AACrF;AAWA,MAAM,8BAAc,IAAI,QAAyB;AASjD,MAAM,gBAAmC,CAAC;;;;;;;;;AAU1C,SAAgB,gBACd,SACA,SACY;CACZ,MAAM,YAAY,eAAe,UAAU,EAAE;CAC7C,MAAM,OAAO,mBAAmB,UAAU,UAAU,EAAE,MAAM,QAAQ,IAAI;CACxE,MAAM,OAAO,MAAM,QAAQ,iBAAiB,UAAU,EAAE,CAAC,CAAC;CAC1D,MAAM,iBAAiB,MAAM,kBAAkB;CAC/C,MAAM,eAAe,IAAI,IAAa,OAAO;CAC7C,MAAM,8BAAc,IAAI,IAAa;CAErC,MAAM,qCAAqB,IAAI,IAAgB;CAC/C,IAAI,UAAU,GAAG;EACf,MAAM,WAAW,KAAK,YAAY;EAClC,KAAK,MAAM,UAAU,SAAS;GAC5B,IAAI,UAAU,OAAO,YAAY;GACjC,OAAO,mBAAmB,UAAU,cAAc,YAAY,UAAU;IACtE,mBAAmB,IAAI,OAAO;IAC9B,UAAU,QAAQ,KAAK,YAAY;GACrC;EACF;CACF;CAEA,MAAM,aAAa,YAA8B;EAC/C,OAAO,kBAAkB,mBAAmB,UAAU,cAClD,QAAQ,QACR,QAAQ,aAAa,aAAa,MAAM;CAC9C;CAEA,MAAM,aAAa,SAAkB,WAA0B;EAC7D,IAAI,kBAAkB,mBAAmB,UAAU,aACjD,QAAQ,QAAQ;OACX,IAAI,QACT,QAAQ,aAAa,eAAe,MAAM;OACrC;GACL,QAAQ,gBAAgB,aAAa;GACrC,IAAI,mBAAmB,UAAU,aAG/B,QAAQ,QAAQ;EAEpB;CACF;CAEA,MAAM,QAAQ,SAAwB;EACpC,IAAI,WAAW,YAAY,IAAI,IAAI,KAAK;EAIxC,IAAI,UAAU,IAAI,KAAK,aAAa,GAClC;EAGF,IAAI,aAAa,GACf,UAAU,MAAM,IAAI;EAGtB,YAAY,IAAI,IAAI;EACpB,YAAY,IAAI,MAAM,WAAW,CAAC;CACpC;CAEA,MAAM,QAAQ,aAA4B;EAExC,KAAK,MAAM,WAAW,SAAS,iBAC7B,mDACF,GACE,aAAa,IAAI,OAAO;EAG1B,MAAM,cAAc,SAA0B;GAK5C,IACE,YAAY,IAAI,IAAI,KACpB,aAAa,IAAI,IAAI,KACpB,KAAK,iBACJ,YAAY,IAAI,KAAK,aAAa,KAClC,KAAK,cAAc,aAAa,MAAM,MAAM,OAE9C,OAAO,WAAW;GAIpB,KAAK,MAAM,UAAU,cACnB,IAAI,aAAa,MAAM,MAAM,GAC3B,OAAO,WAAW;GAItB,OAAO,WAAW;EACpB;EAEA,MAAM,SAAS,uBACb,iBAAiB,QAAQ,GACzB,UACA,WAAW,cACX,EAAE,WAAW,CACf;EAGA,MAAM,aAAa,WAAW,QAAQ;EACtC,IAAI,eAAe,WAAW,eAC5B,KAAK,QAAQ;EAGf,IAAI,eAAe,WAAW,eAAe;GAC3C,IAAI,OAAO,OAAO,SAAS;GAC3B,OAAO,QAAQ,MAAM;IACnB,KAAK,IAAI;IACT,OAAO,OAAO,SAAS;GACzB;EACF;CACF;CAIA,IAAI,cAAc,QAChB,cAAc,cAAc,SAAS,EAAE,CAAC,WAAW;CAGrD,KAAK,IAAI;CAET,MAAM,oBAAoB,YAAoC;EAC5D,KAAK,MAAM,UAAU,SAAS;GAC5B,IAAI,OAAO,SAAS,aAClB;GAKF,IACE,OAAO,OAAO,eACd,CAAC,CAAC,GAAG,cAAc,GAAG,WAAW,CAAC,CAAC,MAAM,SAAS,aAAa,MAAM,OAAO,MAAM,CAAC,GAE9E;SAAA,MAAM,QAAQ,OAAO,YACxB,KACG,gBAAgB,UAAU,eAAe,gBAAgB,UAAU,eACpE,oBAAoB,IAAI,GAExB,aAAa,IAAI,IAAI;SAChB,IAAI,gBAAgB,UAAU,SACnC,KAAK,IAAI;GAAA;GAKf,IAAI,UAAU,GACP;SAAA,MAAM,cAAc,oBACvB,IAAI,CAAC,WAAW,aAAa;KAC3B,SAAS,WAAW;KACpB;IACF;;EAGN;CACF;CAEA,MAAM,WAAW,IAAI,UAAU,iBAAiB,gBAAgB;CAEhE,SAAS,QAAQ,MAAM;EAAE,WAAW;EAAM,SAAS;CAAK,CAAC;CAEzD,MAAM,kCAAkB,IAAI,IAAsB;CAClD,IAAI,UAAU,GACZ,KAAK,MAAM,cAAc,oBAAoB;EAC3C,MAAM,iBAAiB,IAAI,UAAU,iBAAiB,gBAAgB;EACtE,eAAe,QAAQ,YAAY;GAAE,WAAW;GAAM,SAAS;EAAK,CAAC;EACrE,gBAAgB,IAAI,cAAc;CACpC;CAGF,MAAM,kBAAmC;EACvC;EACA;EACA,UAAU;GACR,SAAS,QAAQ,MAAM;IAAE,WAAW;IAAM,SAAS;GAAK,CAAC;EAC3D;EACA,aAAa;GACX,SAAS,WAAW;EACtB;CACF;CAEA,cAAc,KAAK,eAAe;CAElC,aAAmB;EACjB,SAAS,WAAW;EACpB,IAAI,UAAU,GACZ,KAAK,MAAM,kBAAkB,iBAC3B,eAAe,WAAW;EAI9B,KAAK,MAAM,QAAQ,aAAa;GAC9B,MAAM,QAAQ,YAAY,IAAI,IAAI;GAClC,IAAI,SAAS,MACX;GAEF,IAAI,UAAU,GAAG;IACf,UAAU,MAAM,KAAK;IACrB,YAAY,OAAO,IAAI;GACzB,OACE,YAAY,IAAI,MAAM,QAAQ,CAAC;EAEnC;EAGA,IAAI,oBAAoB,cAAc,cAAc,SAAS,IAAI;GAC/D,cAAc,IAAI;GAClB,IAAI,cAAc,QAChB,cAAc,cAAc,SAAS,EAAE,CAAC,QAAQ;EAEpD,OACE,cAAc,OAAO,cAAc,QAAQ,eAAe,GAAG,CAAC;CAElE;AACF;;;;;AAMA,SAAgB,YAAY,SAA4C;CACtE,MAAM,WAAW,cAAc,cAAc,SAAS;CACtD,IAAI,YAAY,CAAC,SAAS,aAAa,IAAI,OAAO,GAAG;EACnD,SAAS,aAAa,IAAI,OAAO;EACjC,aAAa;GACX,SAAS,aAAa,OAAO,OAAO;EACtC;CACF;AACF"}

package/dist/_chunk/ariaHideOutside.jsx

@@ -1,10 +1,184 @@
-import { c as getOwnerWindow } from "./focus.jsx";
+/*
+* Copyright 2020 Adobe. All rights reserved.
+* This file is licensed to you 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 REPRESENTATIONS
+* OF ANY KIND, either express or implied. See the License for the specific language
+* governing permissions and limitations under the License.
+*/
+// Ported to SolidJS for Proyecto Viviana; based on packages/react-aria/src/overlays/ariaHideOutside.ts
+import { a as getOwnerDocument, o as getOwnerWindow, v as nodeContains } from "./dom.jsx";
+import { shadowDOM } from "@proyecto-viviana/solid-stately/private/flags/flags";
+//#region src/utils/ShadowTreeWalker.ts
+/*!
+* Copyright (c) Microsoft Corporation. All rights reserved.
+* Licensed under the MIT License.
+*/
+var ShadowTreeWalker = class {
+	filter;
+	root;
+	whatToShow;
+	doc;
+	walkerStack = [];
+	current;
+	currentSetFor = /* @__PURE__ */ new Set();
+	constructor(doc, root, whatToShow, filter) {
+		this.doc = doc;
+		this.root = root;
+		this.filter = filter ?? null;
+		this.whatToShow = whatToShow ?? NodeFilter.SHOW_ALL;
+		this.current = root;
+		this.walkerStack.unshift(doc.createTreeWalker(root, whatToShow, this.acceptNode));
+		const shadowRoot = root.shadowRoot;
+		if (shadowRoot) this.walkerStack.unshift(this.doc.createTreeWalker(shadowRoot, this.whatToShow, { acceptNode: this.acceptNode }));
+	}
+	acceptNode = (node) => {
+		if (node.nodeType === Node.ELEMENT_NODE) {
+			const shadowRoot = node.shadowRoot;
+			if (shadowRoot) {
+				this.walkerStack.unshift(this.doc.createTreeWalker(shadowRoot, this.whatToShow, { acceptNode: this.acceptNode }));
+				return NodeFilter.FILTER_ACCEPT;
+			}
+			if (typeof this.filter === "function") return this.filter(node);
+			if (this.filter?.acceptNode) return this.filter.acceptNode(node);
+			if (this.filter === null) return NodeFilter.FILTER_ACCEPT;
+		}
+		return NodeFilter.FILTER_SKIP;
+	};
+	get currentNode() {
+		return this.current;
+	}
+	set currentNode(node) {
+		if (!nodeContains(this.root, node)) throw new Error("Cannot set currentNode to a node that is not contained by the root node.");
+		const walkers = [];
+		let currentNode = node;
+		let walkerCurrentNode = node;
+		this.current = node;
+		while (currentNode && currentNode !== this.root) if (currentNode.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {
+			const shadowRoot = currentNode;
+			const walker = this.doc.createTreeWalker(shadowRoot, this.whatToShow, { acceptNode: this.acceptNode });
+			walkers.push(walker);
+			walker.currentNode = walkerCurrentNode;
+			this.currentSetFor.add(walker);
+			currentNode = walkerCurrentNode = shadowRoot.host;
+		} else currentNode = currentNode.parentNode;
+		const walker = this.doc.createTreeWalker(this.root, this.whatToShow, { acceptNode: this.acceptNode });
+		walkers.push(walker);
+		walker.currentNode = walkerCurrentNode;
+		this.currentSetFor.add(walker);
+		this.walkerStack = walkers;
+	}
+	firstChild() {
+		const currentNode = this.currentNode;
+		const newNode = this.nextNode();
+		if (!nodeContains(currentNode, newNode)) {
+			this.currentNode = currentNode;
+			return null;
+		}
+		if (newNode) this.currentNode = newNode;
+		return newNode;
+	}
+	lastChild() {
+		const newNode = this.walkerStack[0].lastChild();
+		if (newNode) this.currentNode = newNode;
+		return newNode;
+	}
+	nextNode() {
+		const nextNode = this.walkerStack[0].nextNode();
+		if (nextNode) {
+			if (nextNode.shadowRoot) {
+				let nodeResult;
+				if (typeof this.filter === "function") nodeResult = this.filter(nextNode);
+				else if (this.filter?.acceptNode) nodeResult = this.filter.acceptNode(nextNode);
+				if (nodeResult === NodeFilter.FILTER_ACCEPT) {
+					this.currentNode = nextNode;
+					return nextNode;
+				}
+				const childNode = this.nextNode();
+				if (childNode) this.currentNode = childNode;
+				return childNode;
+			}
+			this.currentNode = nextNode;
+			return nextNode;
+		}
+		if (this.walkerStack.length > 1) {
+			this.walkerStack.shift();
+			const parentNode = this.nextNode();
+			if (parentNode) this.currentNode = parentNode;
+			return parentNode;
+		}
+		return null;
+	}
+	previousNode() {
+		const currentWalker = this.walkerStack[0];
+		if (currentWalker.currentNode === currentWalker.root) {
+			if (this.currentSetFor.has(currentWalker)) {
+				this.currentSetFor.delete(currentWalker);
+				if (this.walkerStack.length > 1) {
+					this.walkerStack.shift();
+					const parentNode = this.previousNode();
+					if (parentNode) this.currentNode = parentNode;
+					return parentNode;
+				}
+			}
+			return null;
+		}
+		const previousNode = currentWalker.previousNode();
+		if (previousNode) {
+			if (previousNode.shadowRoot) {
+				let nodeResult;
+				if (typeof this.filter === "function") nodeResult = this.filter(previousNode);
+				else if (this.filter?.acceptNode) nodeResult = this.filter.acceptNode(previousNode);
+				if (nodeResult === NodeFilter.FILTER_ACCEPT) {
+					this.currentNode = previousNode;
+					return previousNode;
+				}
+				const childNode = this.lastChild();
+				if (childNode) this.currentNode = childNode;
+				return childNode;
+			}
+			this.currentNode = previousNode;
+			return previousNode;
+		}
+		if (this.walkerStack.length > 1) {
+			this.walkerStack.shift();
+			const parentNode = this.previousNode();
+			if (parentNode) this.currentNode = parentNode;
+			return parentNode;
+		}
+		return null;
+	}
+	/** @deprecated */
+	nextSibling() {
+		return null;
+	}
+	/** @deprecated */
+	previousSibling() {
+		return null;
+	}
+	/** @deprecated */
+	parentNode() {
+		return null;
+	}
+};
+/** Shadow DOM-safe version of `Document.createTreeWalker`. */
+function createShadowTreeWalker(doc, root, whatToShow, filter) {
+	if (shadowDOM()) return new ShadowTreeWalker(doc, root, whatToShow, filter);
+	return doc.createTreeWalker(root, whatToShow, filter);
+}
+//#endregion
 //#region src/overlays/ariaHideOutside.ts
 /**
 * Hides all elements in the DOM outside the given targets from screen readers.
-* Based on @react-aria/overlays ariaHideOutside.
+* Ported from packages/react-aria/src/overlays/ariaHideOutside.ts.
 */
 const supportsInert = typeof HTMLElement !== "undefined" && "inert" in HTMLElement.prototype;
+function isAlwaysVisibleNode(node) {
+	return node.dataset.liveAnnouncer === "true" || node.dataset.solidariaTopLayer !== void 0;
+}
 const refCountMap = /* @__PURE__ */ new WeakMap();
 const observerStack = [];
 /**
@@ -18,10 +192,21 @@ const observerStack = [];
 function ariaHideOutside(targets, options) {
 	const windowObj = getOwnerWindow(targets?.[0]);
 	const opts = options instanceof windowObj.Element ? { root: options } : options;
-	const root = opts?.root ?? document.body;
+	const root = opts?.root ?? getOwnerDocument(targets?.[0]).body;
 	const shouldUseInert = opts?.shouldUseInert && supportsInert;
 	const visibleNodes = new Set(targets);
 	const hiddenNodes = /* @__PURE__ */ new Set();
+	const shadowRootsToWatch = /* @__PURE__ */ new Set();
+	if (shadowDOM()) {
+		const boundary = root.getRootNode();
+		for (const target of targets) {
+			let current = target.getRootNode();
+			while (current instanceof windowObj.ShadowRoot && current !== boundary) {
+				shadowRootsToWatch.add(current);
+				current = current.host.getRootNode();
+			}
+		}
+	}
 	const getHidden = (element) => {
 		return shouldUseInert && element instanceof windowObj.HTMLElement ? element.inert : element.getAttribute("aria-hidden") === "true";
 	};
@@ -44,10 +229,10 @@ function ariaHideOutside(targets, options) {
 		for (const element of walkRoot.querySelectorAll("[data-live-announcer], [data-solidaria-top-layer]")) visibleNodes.add(element);
 		const acceptNode = (node) => {
 			if (hiddenNodes.has(node) || visibleNodes.has(node) || node.parentElement && hiddenNodes.has(node.parentElement) && node.parentElement.getAttribute("role") !== "row") return NodeFilter.FILTER_REJECT;
-			for (const target of visibleNodes) if (node.contains(target)) return NodeFilter.FILTER_SKIP;
+			for (const target of visibleNodes) if (nodeContains(node, target)) return NodeFilter.FILTER_SKIP;
 			return NodeFilter.FILTER_ACCEPT;
 		};
-		const walker = document.createTreeWalker(walkRoot, NodeFilter.SHOW_ELEMENT, { acceptNode });
+		const walker = createShadowTreeWalker(getOwnerDocument(walkRoot), walkRoot, NodeFilter.SHOW_ELEMENT, { acceptNode });
 		const acceptRoot = acceptNode(walkRoot);
 		if (acceptRoot === NodeFilter.FILTER_ACCEPT) hide(walkRoot);
 		if (acceptRoot !== NodeFilter.FILTER_REJECT) {
@@ -60,19 +245,35 @@ function ariaHideOutside(targets, options) {
 	};
 	if (observerStack.length) observerStack[observerStack.length - 1].disconnect();
 	walk(root);
-	const observer = new MutationObserver((changes) => {
+	const processMutations = (changes) => {
 		for (const change of changes) {
 			if (change.type !== "childList") continue;
-			if (![...visibleNodes, ...hiddenNodes].some((node) => node.contains(change.target))) {
-				for (const node of change.addedNodes) if ((node instanceof HTMLElement || node instanceof SVGElement) && (node.dataset.liveAnnouncer === "true" || node.dataset.solidariaTopLayer === "true")) visibleNodes.add(node);
-				else if (node instanceof Element) walk(node);
+			if (change.target.isConnected && ![...visibleNodes, ...hiddenNodes].some((node) => nodeContains(node, change.target))) {
+				for (const node of change.addedNodes) if ((node instanceof windowObj.HTMLElement || node instanceof windowObj.SVGElement) && isAlwaysVisibleNode(node)) visibleNodes.add(node);
+				else if (node instanceof windowObj.Element) walk(node);
+			}
+			if (shadowDOM()) {
+				for (const shadowRoot of shadowRootsToWatch) if (!shadowRoot.isConnected) {
+					observer.disconnect();
+					break;
+				}
 			}
 		}
-	});
+	};
+	const observer = new windowObj.MutationObserver(processMutations);
 	observer.observe(root, {
 		childList: true,
 		subtree: true
 	});
+	const shadowObservers = /* @__PURE__ */ new Set();
+	if (shadowDOM()) for (const shadowRoot of shadowRootsToWatch) {
+		const shadowObserver = new windowObj.MutationObserver(processMutations);
+		shadowObserver.observe(shadowRoot, {
+			childList: true,
+			subtree: true
+		});
+		shadowObservers.add(shadowObserver);
+	}
 	const observerWrapper = {
 		visibleNodes,
 		hiddenNodes,
@@ -89,6 +290,7 @@ function ariaHideOutside(targets, options) {
 	observerStack.push(observerWrapper);
 	return () => {
 		observer.disconnect();
+		if (shadowDOM()) for (const shadowObserver of shadowObservers) shadowObserver.disconnect();
 		for (const node of hiddenNodes) {
 			const count = refCountMap.get(node);
 			if (count == null) continue;