@userflow-tech/react-native 0.1.1 → 0.3.0

package/lib/module/anchors/fiber/readHostContent.js

@@ -0,0 +1,127 @@
+"use strict";
+
+/**
+ * Live host-content reads from a public instance's fiber. Used at AUTO capture
+ * and match time so dynamic `{label}` / `{t(...)}` / `placeholder={…}` show up
+ * as `childText` even though Babel only stamps static literals.
+ *
+ * Same never-throws contract as the rest of the fiber layer.
+ */
+
+import { getChild, getFiberTag, getLiveHostProps, getMemoizedProps, getSibling, isHostFiber } from "./fiberInternals.js";
+
+/** React reconciler `HostComponent` / `HostText` fiber tags. */
+const HOST_COMPONENT_TAG = 5;
+const HOST_TEXT_TAG = 6;
+
+/**
+ * Mirrors Babel `childTextFromJsx` depth — but counted in **host** levels, not
+ * fibers. See {@link isHostLevel}.
+ */
+const DEFAULT_MAX_DEPTH = 4;
+
+/** Soft cap so a dense subtree cannot stall the JS thread. */
+const DEFAULT_MAX_NODES = 2_000;
+function coerceText(value) {
+  if (typeof value === 'string') {
+    const trimmed = value.trim();
+    return trimmed || undefined;
+  }
+  if (typeof value === 'number' && Number.isFinite(value)) {
+    return String(value);
+  }
+  return undefined;
+}
+
+/**
+ * Concatenate the string/number fragments of a split label, in order.
+ *
+ * `<Text>{count} items</Text>` reaches us as `[3, ' items']`. Keeping only the
+ * first fragment would record `3`, which digit-normalization then collapses to
+ * `#` — agreeing with every other numeric label and costing the fail-closed
+ * guarantee. Joining keeps `3 items`, which normalizes to `# items`. Fragments
+ * are concatenated raw so `['Hello, ', name, '!']` stays `Hello, Dan!`; only
+ * the result is trimmed. Non-text children (nested elements) are skipped.
+ */
+function joinTextFragments(children) {
+  let joined = '';
+  for (const child of children) {
+    if (typeof child === 'string') joined += child;else if (typeof child === 'number' && Number.isFinite(child)) joined += String(child);
+  }
+  return coerceText(joined);
+}
+function textFromMemoizedProps(fiber) {
+  // A HostText fiber (`tag === 6`) carries the string itself as its props.
+  const fromRaw = coerceText(fiber?.memoizedProps);
+  if (fromRaw) return fromRaw;
+  const props = getLiveHostProps(fiber) ?? getMemoizedProps(fiber);
+  if (!props) return undefined;
+  const fromChildren = coerceText(props.children);
+  if (fromChildren) return fromChildren;
+  if (Array.isArray(props.children)) {
+    const joined = joinTextFragments(props.children);
+    if (joined) return joined;
+  }
+  const fromText = coerceText(props.text);
+  if (fromText) return fromText;
+  return undefined;
+}
+
+/**
+ * First visible text under `fiber`, bounded by depth and node count. Reads a
+ * string/number `children` prop, the joined fragments of a split label, a
+ * native `text` prop, or the string a HostText fiber holds as its props.
+ */
+export function readHostText(fiber, maxDepth = DEFAULT_MAX_DEPTH) {
+  try {
+    const budget = {
+      remaining: DEFAULT_MAX_NODES
+    };
+    return walkText(fiber, 0, maxDepth, budget);
+  } catch {
+    return undefined;
+  }
+}
+
+/**
+ * Only host fibers count toward depth.
+ *
+ * The JSX `<View><Text>{label}</Text></View>` that Babel sees as two levels is
+ * many more fibers at runtime: the composite, its `forwardRef` inner, context
+ * providers, then the native host and its text child. How many wrappers sit in
+ * between is an RN implementation detail that changes between versions, so
+ * counting fibers would make the depth limit mean something different on every
+ * release — and would cut the walk short before reaching the text. Counting
+ * host levels matches what Babel counted, on any RN version. The node budget,
+ * not the depth, is what bounds cost.
+ */
+function isHostLevel(fiber) {
+  const tag = getFiberTag(fiber);
+  if (tag === HOST_COMPONENT_TAG || tag === HOST_TEXT_TAG) return true;
+  return isHostFiber(fiber);
+}
+function walkText(fiber, depth, maxDepth, budget) {
+  if (!fiber || depth > maxDepth || budget.remaining <= 0) return undefined;
+  budget.remaining -= 1;
+  const own = textFromMemoizedProps(fiber);
+  if (own) return own;
+  let child = getChild(fiber);
+  while (child) {
+    const nextDepth = isHostLevel(child) ? depth + 1 : depth;
+    const found = walkText(child, nextDepth, maxDepth, budget);
+    if (found) return found;
+    child = getSibling(child);
+  }
+  return undefined;
+}
+
+/** `placeholder` on this fiber (TextInput). Does not walk descendants. */
+export function readHostPlaceholder(fiber) {
+  try {
+    const props = getLiveHostProps(fiber) ?? getMemoizedProps(fiber);
+    return coerceText(props?.placeholder);
+  } catch {
+    return undefined;
+  }
+}
+//# sourceMappingURL=readHostContent.js.map

package/lib/module/anchors/fiber/readHostContent.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["getChild","getFiberTag","getLiveHostProps","getMemoizedProps","getSibling","isHostFiber","HOST_COMPONENT_TAG","HOST_TEXT_TAG","DEFAULT_MAX_DEPTH","DEFAULT_MAX_NODES","coerceText","value","trimmed","trim","undefined","Number","isFinite","String","joinTextFragments","children","joined","child","textFromMemoizedProps","fiber","fromRaw","memoizedProps","props","fromChildren","Array","isArray","fromText","text","readHostText","maxDepth","budget","remaining","walkText","isHostLevel","tag","depth","own","nextDepth","found","readHostPlaceholder","placeholder"],"sourceRoot":"../../../../src","sources":["anchors/fiber/readHostContent.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAEEA,QAAQ,EACRC,WAAW,EACXC,gBAAgB,EAChBC,gBAAgB,EAChBC,UAAU,EACVC,WAAW,QACN,qBAAkB;;AAEzB;AACA,MAAMC,kBAAkB,GAAG,CAAC;AAC5B,MAAMC,aAAa,GAAG,CAAC;;AAEvB;AACA;AACA;AACA;AACA,MAAMC,iBAAiB,GAAG,CAAC;;AAE3B;AACA,MAAMC,iBAAiB,GAAG,KAAK;AAE/B,SAASC,UAAUA,CAACC,KAAc,EAAsB;EACtD,IAAI,OAAOA,KAAK,KAAK,QAAQ,EAAE;IAC7B,MAAMC,OAAO,GAAGD,KAAK,CAACE,IAAI,CAAC,CAAC;IAC5B,OAAOD,OAAO,IAAIE,SAAS;EAC7B;EACA,IAAI,OAAOH,KAAK,KAAK,QAAQ,IAAII,MAAM,CAACC,QAAQ,CAACL,KAAK,CAAC,EAAE;IACvD,OAAOM,MAAM,CAACN,KAAK,CAAC;EACtB;EACA,OAAOG,SAAS;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,iBAAiBA,CAACC,QAAmB,EAAsB;EAClE,IAAIC,MAAM,GAAG,EAAE;EACf,KAAK,MAAMC,KAAK,IAAIF,QAAQ,EAAE;IAC5B,IAAI,OAAOE,KAAK,KAAK,QAAQ,EAAED,MAAM,IAAIC,KAAK,CAAC,KAC1C,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAIN,MAAM,CAACC,QAAQ,CAACK,KAAK,CAAC,EAAED,MAAM,IAAIH,MAAM,CAACI,KAAK,CAAC;EACvF;EACA,OAAOX,UAAU,CAACU,MAAM,CAAC;AAC3B;AAEA,SAASE,qBAAqBA,CAACC,KAAe,EAAsB;EAClE;EACA,MAAMC,OAAO,GAAGd,UAAU,CAACa,KAAK,EAAEE,aAAa,CAAC;EAChD,IAAID,OAAO,EAAE,OAAOA,OAAO;EAE3B,MAAME,KAAK,GAAGxB,gBAAgB,CAACqB,KAAK,CAAC,IAAIpB,gBAAgB,CAACoB,KAAK,CAAC;EAChE,IAAI,CAACG,KAAK,EAAE,OAAOZ,SAAS;EAE5B,MAAMa,YAAY,GAAGjB,UAAU,CAACgB,KAAK,CAACP,QAAQ,CAAC;EAC/C,IAAIQ,YAAY,EAAE,OAAOA,YAAY;EAErC,IAAIC,KAAK,CAACC,OAAO,CAACH,KAAK,CAACP,QAAQ,CAAC,EAAE;IACjC,MAAMC,MAAM,GAAGF,iBAAiB,CAACQ,KAAK,CAACP,QAAQ,CAAC;IAChD,IAAIC,MAAM,EAAE,OAAOA,MAAM;EAC3B;EAEA,MAAMU,QAAQ,GAAGpB,UAAU,CAACgB,KAAK,CAACK,IAAI,CAAC;EACvC,IAAID,QAAQ,EAAE,OAAOA,QAAQ;EAE7B,OAAOhB,SAAS;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASkB,YAAYA,CAACT,KAAe,EAAEU,QAAQ,GAAGzB,iBAAiB,EAAsB;EAC9F,IAAI;IACF,MAAM0B,MAAM,GAAG;MAAEC,SAAS,EAAE1B;IAAkB,CAAC;IAC/C,OAAO2B,QAAQ,CAACb,KAAK,EAAE,CAAC,EAAEU,QAAQ,EAAEC,MAAM,CAAC;EAC7C,CAAC,CAAC,MAAM;IACN,OAAOpB,SAAS;EAClB;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASuB,WAAWA,CAACd,KAAe,EAAW;EAC7C,MAAMe,GAAG,GAAGrC,WAAW,CAACsB,KAAK,CAAC;EAC9B,IAAIe,GAAG,KAAKhC,kBAAkB,IAAIgC,GAAG,KAAK/B,aAAa,EAAE,OAAO,IAAI;EACpE,OAAOF,WAAW,CAACkB,KAAK,CAAC;AAC3B;AAEA,SAASa,QAAQA,CACfb,KAAe,EACfgB,KAAa,EACbN,QAAgB,EAChBC,MAA6B,EACT;EACpB,IAAI,CAACX,KAAK,IAAIgB,KAAK,GAAGN,QAAQ,IAAIC,MAAM,CAACC,SAAS,IAAI,CAAC,EAAE,OAAOrB,SAAS;EACzEoB,MAAM,CAACC,SAAS,IAAI,CAAC;EAErB,MAAMK,GAAG,GAAGlB,qBAAqB,CAACC,KAAK,CAAC;EACxC,IAAIiB,GAAG,EAAE,OAAOA,GAAG;EAEnB,IAAInB,KAAK,GAAGrB,QAAQ,CAACuB,KAAK,CAAC;EAC3B,OAAOF,KAAK,EAAE;IACZ,MAAMoB,SAAS,GAAGJ,WAAW,CAAChB,KAAK,CAAC,GAAGkB,KAAK,GAAG,CAAC,GAAGA,KAAK;IACxD,MAAMG,KAAK,GAAGN,QAAQ,CAACf,KAAK,EAAEoB,SAAS,EAAER,QAAQ,EAAEC,MAAM,CAAC;IAC1D,IAAIQ,KAAK,EAAE,OAAOA,KAAK;IACvBrB,KAAK,GAAGjB,UAAU,CAACiB,KAAK,CAAC;EAC3B;EACA,OAAOP,SAAS;AAClB;;AAEA;AACA,OAAO,SAAS6B,mBAAmBA,CAACpB,KAAe,EAAsB;EACvE,IAAI;IACF,MAAMG,KAAK,GAAGxB,gBAAgB,CAACqB,KAAK,CAAC,IAAIpB,gBAAgB,CAACoB,KAAK,CAAC;IAChE,OAAOb,UAAU,CAACgB,KAAK,EAAEkB,WAAW,CAAC;EACvC,CAAC,CAAC,MAAM;IACN,OAAO9B,SAAS;EAClB;AACF","ignoreList":[]}

package/lib/module/anchors/fiber/resolveFiberPath.js

@@ -0,0 +1,215 @@
+"use strict";
+
+/**
+ * Re-resolve a fiber path captured from library UI the Babel plugin never
+ * stamped. Explicit leaf ids win. Otherwise score host kind, label, role, and
+ * path alignment, and fail closed when the best hit is weak or tied.
+ */
+
+import { getCachedFiberAnchor, getFiberAnchorScreenKey, setCachedFiberAnchor } from "../fiberAnchorCache.js";
+import { resolveAnchorHost } from "../resolveAnchorHost.js";
+import { textsAgree } from "../semanticMatcher.js";
+import { fiberScanRoot } from "./FiberScanRoot.js";
+import { MAX_ANCESTOR_WALK, getAlternate, getHostTypeName, getLiveHostProps, getReturn, isFiberMounted, isHostFiber } from "./fiberInternals.js";
+import { readHostText } from "./readHostContent.js";
+import { isFiberOnVisibleScreen } from "./visibleScreens.js";
+import { walkVisibleFibers } from "./walkVisibleFibers.js";
+const MIN_SCORE = 40;
+const UNIQUENESS_MARGIN = 12;
+function stringProp(value) {
+  return typeof value === 'string' && value.trim() ? value.trim() : undefined;
+}
+function cacheKey(path) {
+  return `fiber:${JSON.stringify(path)}`;
+}
+function sameFiber(a, b) {
+  if (a === b) return true;
+  const alt = getAlternate(a);
+  return alt != null && alt === b;
+}
+function liveSegment(fiber) {
+  const props = getLiveHostProps(fiber);
+  const role = stringProp(props?.accessibilityRole) ?? stringProp(props?.role);
+  const testID = stringProp(props?.testID);
+  const accessibilityLabel = stringProp(props?.accessibilityLabel) ?? stringProp(props?.['aria-label']);
+  let text;
+  try {
+    text = readHostText(fiber, 1);
+  } catch {
+    text = undefined;
+  }
+  const hostKind = getHostTypeName(fiber);
+  return {
+    displayName: typeof fiber?.type === 'string' ? fiber.type : '',
+    ...(hostKind ? {
+      hostKind
+    } : {}),
+    ...(role ? {
+      role
+    } : {}),
+    ...(testID ? {
+      testID
+    } : {}),
+    ...(accessibilityLabel ? {
+      accessibilityLabel
+    } : {}),
+    ...(text ? {
+      text
+    } : {})
+  };
+}
+function ancestorsOf(fiber) {
+  const chain = [];
+  let current = fiber;
+  for (let depth = 0; current && depth < MAX_ANCESTOR_WALK; depth += 1) {
+    if (isHostFiber(current)) chain.push(current);
+    current = getReturn(current);
+  }
+  chain.reverse();
+  return chain;
+}
+function scoreAlignment(expected, actual) {
+  const n = Math.min(expected.length, actual.length);
+  let score = 0;
+  let kindAligned = 0;
+  for (let i = 0; i < n; i += 1) {
+    const exp = expected[expected.length - 1 - i];
+    const live = liveSegment(actual[actual.length - 1 - i]);
+    const expKind = exp.hostKind ?? exp.displayName;
+    const liveKind = live.hostKind ?? live.displayName;
+    if (expKind && liveKind && expKind !== liveKind) break;
+    kindAligned += 1;
+    if (exp.testID && live.testID === exp.testID) score += 20;
+    if (exp.role && live.role && exp.role === live.role) score += 8;
+    if (exp.siblingIndex !== undefined && exp.siblingIndex === live.siblingIndex) score += 2;
+    if (exp.displayName && live.displayName && exp.displayName === live.displayName) score += 1;
+  }
+  return score + kindAligned * 6;
+}
+function scoreHost(path, fiber) {
+  const live = liveSegment(fiber);
+  const leaf = path.segments[path.segments.length - 1];
+  const leafKind = leaf?.hostKind ?? path.leafKind;
+  const liveKind = live.hostKind ?? '';
+  if (leafKind && liveKind && leafKind !== liveKind) {
+    return {
+      score: -Infinity,
+      textDisagreed: false
+    };
+  }
+  let score = 20;
+  if (leaf?.role && live.role === leaf.role) score += 15;
+  if (leaf?.testID && live.testID === leaf.testID) score += 90;
+  const expectedText = leaf?.text ?? path.leafText;
+  const expectedLabel = leaf?.accessibilityLabel;
+  const textDisagreed = !!expectedText && !!live.text && expectedText !== live.text;
+  const labelDisagreed = !!expectedLabel && !!live.accessibilityLabel && expectedLabel !== live.accessibilityLabel;
+  if (expectedText && textsAgree(expectedText, live.text)) score += 40;
+  if (expectedLabel && textsAgree(expectedLabel, live.accessibilityLabel)) score += 35;
+  const ancestors = ancestorsOf(fiber);
+  score += scoreAlignment(path.segments, ancestors);
+  const fatalText = textDisagreed && !textsAgree(expectedText, live.text);
+  const fatalLabel = labelDisagreed && !textsAgree(expectedLabel, live.accessibilityLabel);
+  // A full host-kind alignment vouches for a renamed or translated label the
+  // way an icon vouches in the registry matcher. Twins still fail uniqueness.
+  const offset = ancestors.length - path.segments.length;
+  const kindsAlign = offset >= 0 && path.segments.every((segment, index) => {
+    const actualKind = getHostTypeName(ancestors[offset + index]);
+    return !segment.hostKind || actualKind === segment.hostKind;
+  });
+  if ((fatalText || fatalLabel) && !leaf?.testID && !kindsAlign) {
+    return {
+      score: -Infinity,
+      textDisagreed: true
+    };
+  }
+  return {
+    score,
+    textDisagreed: textDisagreed || labelDisagreed
+  };
+}
+function resolveScored(path, root) {
+  const scored = [];
+  walkVisibleFibers(root, fiber => {
+    if (!isHostFiber(fiber)) return;
+    if (!isFiberOnVisibleScreen(fiber)) return;
+    const {
+      score,
+      textDisagreed
+    } = scoreHost(path, fiber);
+    if (score > -Infinity) scored.push({
+      fiber,
+      score,
+      textDisagreed
+    });
+  });
+  scored.sort((a, b) => b.score - a.score);
+  const best = scored[0];
+  if (!best || best.score < MIN_SCORE) return {
+    status: 'unknown'
+  };
+  const second = scored[1];
+  if (second && best.score - second.score < UNIQUENESS_MARGIN) return {
+    status: 'ambiguous'
+  };
+  return {
+    status: 'found',
+    fiber: best.fiber,
+    cacheId: '',
+    ...(best.textDisagreed ? {
+      textDisagreed: true
+    } : {})
+  };
+}
+
+/**
+ * Resolve `path` to the live host it describes. A leaf `testID` is authoritative
+ * and reuses the manual fiber scan.
+ */
+export function resolveFiberPath(path) {
+  if (!path || path.segments.length === 0) return {
+    status: 'unknown'
+  };
+  const leaf = path.segments[path.segments.length - 1];
+  const exactId = leaf?.testID;
+  if (exactId) {
+    const exact = resolveAnchorHost(exactId);
+    if (exact.status === 'found' && exact.fiber) {
+      return {
+        status: 'found',
+        fiber: exact.fiber,
+        cacheId: exactId
+      };
+    }
+    if (exact.status === 'ambiguous') return {
+      status: 'ambiguous'
+    };
+  }
+  const key = cacheKey(path);
+  const cached = getCachedFiberAnchor(key);
+  const screenKey = getFiberAnchorScreenKey();
+  if (cached && cached.screenKey === screenKey && isFiberMounted(cached.fiber) && isFiberOnVisibleScreen(cached.fiber)) {
+    return {
+      status: 'found',
+      fiber: cached.fiber,
+      cacheId: key
+    };
+  }
+  const root = fiberScanRoot.getFiber();
+  if (!root) return {
+    status: 'unknown'
+  };
+  const resolved = resolveScored(path, root);
+  if (resolved.status === 'found') {
+    setCachedFiberAnchor(key, resolved.fiber);
+    return {
+      ...resolved,
+      cacheId: key
+    };
+  }
+  return resolved;
+}
+export function fibersMatch(a, b) {
+  return sameFiber(a, b) || sameFiber(b, a);
+}
+//# sourceMappingURL=resolveFiberPath.js.map

package/lib/module/anchors/fiber/resolveFiberPath.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["getCachedFiberAnchor","getFiberAnchorScreenKey","setCachedFiberAnchor","resolveAnchorHost","textsAgree","fiberScanRoot","MAX_ANCESTOR_WALK","getAlternate","getHostTypeName","getLiveHostProps","getReturn","isFiberMounted","isHostFiber","readHostText","isFiberOnVisibleScreen","walkVisibleFibers","MIN_SCORE","UNIQUENESS_MARGIN","stringProp","value","trim","undefined","cacheKey","path","JSON","stringify","sameFiber","a","b","alt","liveSegment","fiber","props","role","accessibilityRole","testID","accessibilityLabel","text","hostKind","displayName","type","ancestorsOf","chain","current","depth","push","reverse","scoreAlignment","expected","actual","n","Math","min","length","score","kindAligned","i","exp","live","expKind","liveKind","siblingIndex","scoreHost","leaf","segments","leafKind","Infinity","textDisagreed","expectedText","leafText","expectedLabel","labelDisagreed","ancestors","fatalText","fatalLabel","offset","kindsAlign","every","segment","index","actualKind","resolveScored","root","scored","sort","best","status","second","cacheId","resolveFiberPath","exactId","exact","key","cached","screenKey","getFiber","resolved","fibersMatch"],"sourceRoot":"../../../../src","sources":["anchors/fiber/resolveFiberPath.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;;AAGA,SACEA,oBAAoB,EACpBC,uBAAuB,EACvBC,oBAAoB,QACf,wBAAqB;AAC5B,SAASC,iBAAiB,QAAQ,yBAAsB;AACxD,SAASC,UAAU,QAAQ,uBAAoB;AAE/C,SAASC,aAAa,QAAQ,oBAAiB;AAC/C,SAEEC,iBAAiB,EACjBC,YAAY,EACZC,eAAe,EACfC,gBAAgB,EAChBC,SAAS,EACTC,cAAc,EACdC,WAAW,QACN,qBAAkB;AACzB,SAASC,YAAY,QAAQ,sBAAmB;AAChD,SAASC,sBAAsB,QAAQ,qBAAkB;AACzD,SAASC,iBAAiB,QAAQ,wBAAqB;AAEvD,MAAMC,SAAS,GAAG,EAAE;AACpB,MAAMC,iBAAiB,GAAG,EAAE;AAO5B,SAASC,UAAUA,CAACC,KAAc,EAAsB;EACtD,OAAO,OAAOA,KAAK,KAAK,QAAQ,IAAIA,KAAK,CAACC,IAAI,CAAC,CAAC,GAAGD,KAAK,CAACC,IAAI,CAAC,CAAC,GAAGC,SAAS;AAC7E;AAEA,SAASC,QAAQA,CAACC,IAAqB,EAAU;EAC/C,OAAO,SAASC,IAAI,CAACC,SAAS,CAACF,IAAI,CAAC,EAAE;AACxC;AAEA,SAASG,SAASA,CAACC,CAAW,EAAEC,CAAW,EAAW;EACpD,IAAID,CAAC,KAAKC,CAAC,EAAE,OAAO,IAAI;EACxB,MAAMC,GAAG,GAAGtB,YAAY,CAACoB,CAAC,CAAC;EAC3B,OAAOE,GAAG,IAAI,IAAI,IAAIA,GAAG,KAAKD,CAAC;AACjC;AAEA,SAASE,WAAWA,CAACC,KAAe,EAAsB;EACxD,MAAMC,KAAK,GAAGvB,gBAAgB,CAACsB,KAAK,CAAC;EACrC,MAAME,IAAI,GAAGf,UAAU,CAACc,KAAK,EAAEE,iBAAiB,CAAC,IAAIhB,UAAU,CAACc,KAAK,EAAEC,IAAI,CAAC;EAC5E,MAAME,MAAM,GAAGjB,UAAU,CAACc,KAAK,EAAEG,MAAM,CAAC;EACxC,MAAMC,kBAAkB,GACtBlB,UAAU,CAACc,KAAK,EAAEI,kBAAkB,CAAC,IAAIlB,UAAU,CAACc,KAAK,GAAG,YAAY,CAAC,CAAC;EAC5E,IAAIK,IAAwB;EAC5B,IAAI;IACFA,IAAI,GAAGxB,YAAY,CAACkB,KAAK,EAAE,CAAC,CAAC;EAC/B,CAAC,CAAC,MAAM;IACNM,IAAI,GAAGhB,SAAS;EAClB;EACA,MAAMiB,QAAQ,GAAG9B,eAAe,CAACuB,KAAK,CAAC;EACvC,OAAO;IACLQ,WAAW,EAAE,OAAOR,KAAK,EAAES,IAAI,KAAK,QAAQ,GAAGT,KAAK,CAACS,IAAI,GAAG,EAAE;IAC9D,IAAIF,QAAQ,GAAG;MAAEA;IAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,IAAIL,IAAI,GAAG;MAAEA;IAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACzB,IAAIE,MAAM,GAAG;MAAEA;IAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B,IAAIC,kBAAkB,GAAG;MAAEA;IAAmB,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,IAAIC,IAAI,GAAG;MAAEA;IAAK,CAAC,GAAG,CAAC,CAAC;EAC1B,CAAC;AACH;AAEA,SAASI,WAAWA,CAACV,KAAe,EAAc;EAChD,MAAMW,KAAiB,GAAG,EAAE;EAC5B,IAAIC,OAAwB,GAAGZ,KAAK;EACpC,KAAK,IAAIa,KAAK,GAAG,CAAC,EAAED,OAAO,IAAIC,KAAK,GAAGtC,iBAAiB,EAAEsC,KAAK,IAAI,CAAC,EAAE;IACpE,IAAIhC,WAAW,CAAC+B,OAAO,CAAC,EAAED,KAAK,CAACG,IAAI,CAACF,OAAO,CAAC;IAC7CA,OAAO,GAAGjC,SAAS,CAACiC,OAAO,CAAC;EAC9B;EACAD,KAAK,CAACI,OAAO,CAAC,CAAC;EACf,OAAOJ,KAAK;AACd;AAEA,SAASK,cAAcA,CAACC,QAA8B,EAAEC,MAAkB,EAAU;EAClF,MAAMC,CAAC,GAAGC,IAAI,CAACC,GAAG,CAACJ,QAAQ,CAACK,MAAM,EAAEJ,MAAM,CAACI,MAAM,CAAC;EAClD,IAAIC,KAAK,GAAG,CAAC;EACb,IAAIC,WAAW,GAAG,CAAC;EACnB,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGN,CAAC,EAAEM,CAAC,IAAI,CAAC,EAAE;IAC7B,MAAMC,GAAG,GAAGT,QAAQ,CAACA,QAAQ,CAACK,MAAM,GAAG,CAAC,GAAGG,CAAC,CAAE;IAC9C,MAAME,IAAI,GAAG5B,WAAW,CAACmB,MAAM,CAACA,MAAM,CAACI,MAAM,GAAG,CAAC,GAAGG,CAAC,CAAE,CAAC;IACxD,MAAMG,OAAO,GAAGF,GAAG,CAACnB,QAAQ,IAAImB,GAAG,CAAClB,WAAW;IAC/C,MAAMqB,QAAQ,GAAGF,IAAI,CAACpB,QAAQ,IAAIoB,IAAI,CAACnB,WAAW;IAClD,IAAIoB,OAAO,IAAIC,QAAQ,IAAID,OAAO,KAAKC,QAAQ,EAAE;IACjDL,WAAW,IAAI,CAAC;IAChB,IAAIE,GAAG,CAACtB,MAAM,IAAIuB,IAAI,CAACvB,MAAM,KAAKsB,GAAG,CAACtB,MAAM,EAAEmB,KAAK,IAAI,EAAE;IACzD,IAAIG,GAAG,CAACxB,IAAI,IAAIyB,IAAI,CAACzB,IAAI,IAAIwB,GAAG,CAACxB,IAAI,KAAKyB,IAAI,CAACzB,IAAI,EAAEqB,KAAK,IAAI,CAAC;IAC/D,IAAIG,GAAG,CAACI,YAAY,KAAKxC,SAAS,IAAIoC,GAAG,CAACI,YAAY,KAAKH,IAAI,CAACG,YAAY,EAAEP,KAAK,IAAI,CAAC;IACxF,IAAIG,GAAG,CAAClB,WAAW,IAAImB,IAAI,CAACnB,WAAW,IAAIkB,GAAG,CAAClB,WAAW,KAAKmB,IAAI,CAACnB,WAAW,EAAEe,KAAK,IAAI,CAAC;EAC7F;EACA,OAAOA,KAAK,GAAGC,WAAW,GAAG,CAAC;AAChC;AAEA,SAASO,SAASA,CAChBvC,IAAqB,EACrBQ,KAAe,EAC4B;EAC3C,MAAM2B,IAAI,GAAG5B,WAAW,CAACC,KAAK,CAAC;EAC/B,MAAMgC,IAAI,GAAGxC,IAAI,CAACyC,QAAQ,CAACzC,IAAI,CAACyC,QAAQ,CAACX,MAAM,GAAG,CAAC,CAAC;EACpD,MAAMY,QAAQ,GAAGF,IAAI,EAAEzB,QAAQ,IAAIf,IAAI,CAAC0C,QAAQ;EAChD,MAAML,QAAQ,GAAGF,IAAI,CAACpB,QAAQ,IAAI,EAAE;EACpC,IAAI2B,QAAQ,IAAIL,QAAQ,IAAIK,QAAQ,KAAKL,QAAQ,EAAE;IACjD,OAAO;MAAEN,KAAK,EAAE,CAACY,QAAQ;MAAEC,aAAa,EAAE;IAAM,CAAC;EACnD;EAEA,IAAIb,KAAK,GAAG,EAAE;EACd,IAAIS,IAAI,EAAE9B,IAAI,IAAIyB,IAAI,CAACzB,IAAI,KAAK8B,IAAI,CAAC9B,IAAI,EAAEqB,KAAK,IAAI,EAAE;EACtD,IAAIS,IAAI,EAAE5B,MAAM,IAAIuB,IAAI,CAACvB,MAAM,KAAK4B,IAAI,CAAC5B,MAAM,EAAEmB,KAAK,IAAI,EAAE;EAE5D,MAAMc,YAAY,GAAGL,IAAI,EAAE1B,IAAI,IAAId,IAAI,CAAC8C,QAAQ;EAChD,MAAMC,aAAa,GAAGP,IAAI,EAAE3B,kBAAkB;EAC9C,MAAM+B,aAAa,GAAG,CAAC,CAACC,YAAY,IAAI,CAAC,CAACV,IAAI,CAACrB,IAAI,IAAI+B,YAAY,KAAKV,IAAI,CAACrB,IAAI;EACjF,MAAMkC,cAAc,GAClB,CAAC,CAACD,aAAa,IAAI,CAAC,CAACZ,IAAI,CAACtB,kBAAkB,IAAIkC,aAAa,KAAKZ,IAAI,CAACtB,kBAAkB;EAE3F,IAAIgC,YAAY,IAAIhE,UAAU,CAACgE,YAAY,EAAEV,IAAI,CAACrB,IAAI,CAAC,EAAEiB,KAAK,IAAI,EAAE;EACpE,IAAIgB,aAAa,IAAIlE,UAAU,CAACkE,aAAa,EAAEZ,IAAI,CAACtB,kBAAkB,CAAC,EAAEkB,KAAK,IAAI,EAAE;EAEpF,MAAMkB,SAAS,GAAG/B,WAAW,CAACV,KAAK,CAAC;EACpCuB,KAAK,IAAIP,cAAc,CAACxB,IAAI,CAACyC,QAAQ,EAAEQ,SAAS,CAAC;EAEjD,MAAMC,SAAS,GAAGN,aAAa,IAAI,CAAC/D,UAAU,CAACgE,YAAY,EAAEV,IAAI,CAACrB,IAAI,CAAC;EACvE,MAAMqC,UAAU,GAAGH,cAAc,IAAI,CAACnE,UAAU,CAACkE,aAAa,EAAEZ,IAAI,CAACtB,kBAAkB,CAAC;EACxF;EACA;EACA,MAAMuC,MAAM,GAAGH,SAAS,CAACnB,MAAM,GAAG9B,IAAI,CAACyC,QAAQ,CAACX,MAAM;EACtD,MAAMuB,UAAU,GACdD,MAAM,IAAI,CAAC,IACXpD,IAAI,CAACyC,QAAQ,CAACa,KAAK,CAAC,CAACC,OAAO,EAAEC,KAAK,KAAK;IACtC,MAAMC,UAAU,GAAGxE,eAAe,CAACgE,SAAS,CAACG,MAAM,GAAGI,KAAK,CAAE,CAAC;IAC9D,OAAO,CAACD,OAAO,CAACxC,QAAQ,IAAI0C,UAAU,KAAKF,OAAO,CAACxC,QAAQ;EAC7D,CAAC,CAAC;EACJ,IAAI,CAACmC,SAAS,IAAIC,UAAU,KAAK,CAACX,IAAI,EAAE5B,MAAM,IAAI,CAACyC,UAAU,EAAE;IAC7D,OAAO;MAAEtB,KAAK,EAAE,CAACY,QAAQ;MAAEC,aAAa,EAAE;IAAK,CAAC;EAClD;EAEA,OAAO;IAAEb,KAAK;IAAEa,aAAa,EAAEA,aAAa,IAAII;EAAe,CAAC;AAClE;AAEA,SAASU,aAAaA,CAAC1D,IAAqB,EAAE2D,IAAc,EAAuB;EACjF,MAAMC,MAAyE,GAAG,EAAE;EACpFpE,iBAAiB,CAACmE,IAAI,EAAGnD,KAAK,IAAK;IACjC,IAAI,CAACnB,WAAW,CAACmB,KAAK,CAAC,EAAE;IACzB,IAAI,CAACjB,sBAAsB,CAACiB,KAAK,CAAC,EAAE;IACpC,MAAM;MAAEuB,KAAK;MAAEa;IAAc,CAAC,GAAGL,SAAS,CAACvC,IAAI,EAAEQ,KAAK,CAAC;IACvD,IAAIuB,KAAK,GAAG,CAACY,QAAQ,EAAEiB,MAAM,CAACtC,IAAI,CAAC;MAAEd,KAAK;MAAEuB,KAAK;MAAEa;IAAc,CAAC,CAAC;EACrE,CAAC,CAAC;EACFgB,MAAM,CAACC,IAAI,CAAC,CAACzD,CAAC,EAAEC,CAAC,KAAKA,CAAC,CAAC0B,KAAK,GAAG3B,CAAC,CAAC2B,KAAK,CAAC;EACxC,MAAM+B,IAAI,GAAGF,MAAM,CAAC,CAAC,CAAC;EACtB,IAAI,CAACE,IAAI,IAAIA,IAAI,CAAC/B,KAAK,GAAGtC,SAAS,EAAE,OAAO;IAAEsE,MAAM,EAAE;EAAU,CAAC;EACjE,MAAMC,MAAM,GAAGJ,MAAM,CAAC,CAAC,CAAC;EACxB,IAAII,MAAM,IAAIF,IAAI,CAAC/B,KAAK,GAAGiC,MAAM,CAACjC,KAAK,GAAGrC,iBAAiB,EAAE,OAAO;IAAEqE,MAAM,EAAE;EAAY,CAAC;EAC3F,OAAO;IACLA,MAAM,EAAE,OAAO;IACfvD,KAAK,EAAEsD,IAAI,CAACtD,KAAK;IACjByD,OAAO,EAAE,EAAE;IACX,IAAIH,IAAI,CAAClB,aAAa,GAAG;MAAEA,aAAa,EAAE;IAAK,CAAC,GAAG,CAAC,CAAC;EACvD,CAAC;AACH;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAASsB,gBAAgBA,CAAClE,IAAwC,EAAuB;EAC9F,IAAI,CAACA,IAAI,IAAIA,IAAI,CAACyC,QAAQ,CAACX,MAAM,KAAK,CAAC,EAAE,OAAO;IAAEiC,MAAM,EAAE;EAAU,CAAC;EAErE,MAAMvB,IAAI,GAAGxC,IAAI,CAACyC,QAAQ,CAACzC,IAAI,CAACyC,QAAQ,CAACX,MAAM,GAAG,CAAC,CAAC;EACpD,MAAMqC,OAAO,GAAG3B,IAAI,EAAE5B,MAAM;EAC5B,IAAIuD,OAAO,EAAE;IACX,MAAMC,KAAK,GAAGxF,iBAAiB,CAACuF,OAAO,CAAC;IACxC,IAAIC,KAAK,CAACL,MAAM,KAAK,OAAO,IAAIK,KAAK,CAAC5D,KAAK,EAAE;MAC3C,OAAO;QAAEuD,MAAM,EAAE,OAAO;QAAEvD,KAAK,EAAE4D,KAAK,CAAC5D,KAAK;QAAEyD,OAAO,EAAEE;MAAQ,CAAC;IAClE;IACA,IAAIC,KAAK,CAACL,MAAM,KAAK,WAAW,EAAE,OAAO;MAAEA,MAAM,EAAE;IAAY,CAAC;EAClE;EAEA,MAAMM,GAAG,GAAGtE,QAAQ,CAACC,IAAI,CAAC;EAC1B,MAAMsE,MAAM,GAAG7F,oBAAoB,CAAC4F,GAAG,CAAC;EACxC,MAAME,SAAS,GAAG7F,uBAAuB,CAAC,CAAC;EAC3C,IACE4F,MAAM,IACNA,MAAM,CAACC,SAAS,KAAKA,SAAS,IAC9BnF,cAAc,CAACkF,MAAM,CAAC9D,KAAK,CAAC,IAC5BjB,sBAAsB,CAAC+E,MAAM,CAAC9D,KAAK,CAAC,EACpC;IACA,OAAO;MAAEuD,MAAM,EAAE,OAAO;MAAEvD,KAAK,EAAE8D,MAAM,CAAC9D,KAAK;MAAEyD,OAAO,EAAEI;IAAI,CAAC;EAC/D;EAEA,MAAMV,IAAI,GAAG7E,aAAa,CAAC0F,QAAQ,CAAC,CAAC;EACrC,IAAI,CAACb,IAAI,EAAE,OAAO;IAAEI,MAAM,EAAE;EAAU,CAAC;EAEvC,MAAMU,QAAQ,GAAGf,aAAa,CAAC1D,IAAI,EAAE2D,IAAI,CAAC;EAC1C,IAAIc,QAAQ,CAACV,MAAM,KAAK,OAAO,EAAE;IAC/BpF,oBAAoB,CAAC0F,GAAG,EAAEI,QAAQ,CAACjE,KAAK,CAAC;IACzC,OAAO;MAAE,GAAGiE,QAAQ;MAAER,OAAO,EAAEI;IAAI,CAAC;EACtC;EACA,OAAOI,QAAQ;AACjB;AAEA,OAAO,SAASC,WAAWA,CAACtE,CAAW,EAAEC,CAAW,EAAW;EAC7D,OAAOF,SAAS,CAACC,CAAC,EAAEC,CAAC,CAAC,IAAIF,SAAS,CAACE,CAAC,EAAED,CAAC,CAAC;AAC3C","ignoreList":[]}

package/lib/module/anchors/fiber/visibleRect.js

@@ -0,0 +1,139 @@
+"use strict";
+
+/**
+ * Geometry helpers for "what the user can actually see".
+ *
+ * `measureInWindow` reports a view's full layout rect, including the part
+ * scrolled under a tab bar or clipped by a ScrollView. Native hit-testing
+ * already accounts for that; the JS fallback and the tooltip tap rect do not,
+ * so they clip against scroll viewports and the topmost modal.
+ */
+import { getChild, getHostTypeName, getMemoizedProps, getReturn, getSibling, isHostFiber } from "./fiberInternals.js";
+import { findScrollAncestors } from "./findScrollAncestors.js";
+import { measureHostFiber } from "./measureHostFiber.js";
+const MEASURE_TIMEOUT_MS = 400;
+
+/** Paper and Fabric names for React Native's `<Modal>`. */
+const MODAL_HOST_TYPES = new Set(['RCTModalHostView', 'ModalHostView']);
+function measureFiberRect(fiber) {
+  return new Promise(resolve => {
+    let settled = false;
+    const timer = setTimeout(() => {
+      if (settled) return;
+      settled = true;
+      resolve(null);
+    }, MEASURE_TIMEOUT_MS);
+    try {
+      measureHostFiber(fiber, (x, y, width, height) => {
+        if (settled) return;
+        settled = true;
+        clearTimeout(timer);
+        if (width <= 0 || height <= 0) {
+          resolve(null);
+          return;
+        }
+        resolve({
+          x,
+          y,
+          width,
+          height
+        });
+      });
+    } catch {
+      if (settled) return;
+      settled = true;
+      clearTimeout(timer);
+      resolve(null);
+    }
+  });
+}
+export function intersectRects(a, b) {
+  const x = Math.max(a.x, b.x);
+  const y = Math.max(a.y, b.y);
+  const right = Math.min(a.x + a.width, b.x + b.width);
+  const bottom = Math.min(a.y + a.height, b.y + b.height);
+  const width = right - x;
+  const height = bottom - y;
+  if (width <= 0 || height <= 0) return null;
+  return {
+    x,
+    y,
+    width,
+    height
+  };
+}
+
+/**
+ * Intersect `rect` with every scroll viewport above `fiber` (innermost first).
+ * Returns null when the rect is entirely outside a viewport. No scroll ancestor
+ * leaves `rect` unchanged.
+ */
+export async function clipToScrollViewports(fiber, rect) {
+  if (!fiber) return rect;
+  let ancestors;
+  try {
+    ancestors = findScrollAncestors(fiber);
+  } catch {
+    return rect;
+  }
+  let clipped = rect;
+  for (const ancestor of ancestors) {
+    if (!clipped || !ancestor.containerFiber) continue;
+    const viewport = await measureFiberRect(ancestor.containerFiber);
+    if (!viewport) continue;
+    clipped = intersectRects(clipped, viewport);
+  }
+  return clipped;
+}
+function isModalHost(fiber) {
+  const type = getHostTypeName(fiber);
+  return type !== undefined && MODAL_HOST_TYPES.has(type);
+}
+function isModalVisible(fiber) {
+  const props = getMemoizedProps(fiber);
+  if (!props) return true;
+  if (props.visible === false) return false;
+  return true;
+}
+
+/**
+ * The visible modal host drawn on top, or null. Later siblings win: React
+ * Native mounts a newer `<Modal>` after the previous one.
+ */
+export function topmostVisibleModalHost(root, maxNodes = 8_000) {
+  if (!root) return null;
+  const stack = [root];
+  let topmost = null;
+  let visited = 0;
+  try {
+    while (stack.length > 0 && visited < maxNodes) {
+      const fiber = stack.pop();
+      if (!fiber) continue;
+      visited += 1;
+      if (fiber !== root && isHostFiber(fiber) && isModalHost(fiber) && isModalVisible(fiber)) {
+        topmost = fiber;
+      }
+      if (fiber !== root) {
+        const sibling = getSibling(fiber);
+        if (sibling) stack.push(sibling);
+      }
+      const child = getChild(fiber);
+      if (child) stack.push(child);
+    }
+  } catch {
+    return topmost;
+  }
+  return topmost;
+}
+
+/** True when `fiber` is `ancestor` or sits under it. */
+export function fiberIsUnder(fiber, ancestor, maxDepth = 10_000) {
+  let current = fiber;
+  for (let depth = 0; current && depth < maxDepth; depth += 1) {
+    if (current === ancestor) return true;
+    if (ancestor.alternate && current === ancestor.alternate) return true;
+    current = getReturn(current);
+  }
+  return false;
+}
+//# sourceMappingURL=visibleRect.js.map

package/lib/module/anchors/fiber/visibleRect.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["getChild","getHostTypeName","getMemoizedProps","getReturn","getSibling","isHostFiber","findScrollAncestors","measureHostFiber","MEASURE_TIMEOUT_MS","MODAL_HOST_TYPES","Set","measureFiberRect","fiber","Promise","resolve","settled","timer","setTimeout","x","y","width","height","clearTimeout","intersectRects","a","b","Math","max","right","min","bottom","clipToScrollViewports","rect","ancestors","clipped","ancestor","containerFiber","viewport","isModalHost","type","undefined","has","isModalVisible","props","visible","topmostVisibleModalHost","root","maxNodes","stack","topmost","visited","length","pop","sibling","push","child","fiberIsUnder","maxDepth","current","depth","alternate"],"sourceRoot":"../../../../src","sources":["anchors/fiber/visibleRect.ts"],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAEEA,QAAQ,EACRC,eAAe,EACfC,gBAAgB,EAChBC,SAAS,EACTC,UAAU,EACVC,WAAW,QACN,qBAAkB;AACzB,SAASC,mBAAmB,QAAQ,0BAAuB;AAC3D,SAASC,gBAAgB,QAAQ,uBAAoB;AASrD,MAAMC,kBAAkB,GAAG,GAAG;;AAE9B;AACA,MAAMC,gBAAgB,GAAG,IAAIC,GAAG,CAAC,CAAC,kBAAkB,EAAE,eAAe,CAAC,CAAC;AAIvE,SAASC,gBAAgBA,CAACC,KAAe,EAA+B;EACtE,OAAO,IAAIC,OAAO,CAAEC,OAAO,IAAK;IAC9B,IAAIC,OAAO,GAAG,KAAK;IACnB,MAAMC,KAAK,GAAGC,UAAU,CAAC,MAAM;MAC7B,IAAIF,OAAO,EAAE;MACbA,OAAO,GAAG,IAAI;MACdD,OAAO,CAAC,IAAI,CAAC;IACf,CAAC,EAAEN,kBAAkB,CAAC;IACtB,IAAI;MACFD,gBAAgB,CAACK,KAAK,EAAE,CAACM,CAAC,EAAEC,CAAC,EAAEC,KAAK,EAAEC,MAAM,KAAK;QAC/C,IAAIN,OAAO,EAAE;QACbA,OAAO,GAAG,IAAI;QACdO,YAAY,CAACN,KAAK,CAAC;QACnB,IAAII,KAAK,IAAI,CAAC,IAAIC,MAAM,IAAI,CAAC,EAAE;UAC7BP,OAAO,CAAC,IAAI,CAAC;UACb;QACF;QACAA,OAAO,CAAC;UAAEI,CAAC;UAAEC,CAAC;UAAEC,KAAK;UAAEC;QAAO,CAAC,CAAC;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC,MAAM;MACN,IAAIN,OAAO,EAAE;MACbA,OAAO,GAAG,IAAI;MACdO,YAAY,CAACN,KAAK,CAAC;MACnBF,OAAO,CAAC,IAAI,CAAC;IACf;EACF,CAAC,CAAC;AACJ;AAEA,OAAO,SAASS,cAAcA,CAACC,CAAc,EAAEC,CAAc,EAAsB;EACjF,MAAMP,CAAC,GAAGQ,IAAI,CAACC,GAAG,CAACH,CAAC,CAACN,CAAC,EAAEO,CAAC,CAACP,CAAC,CAAC;EAC5B,MAAMC,CAAC,GAAGO,IAAI,CAACC,GAAG,CAACH,CAAC,CAACL,CAAC,EAAEM,CAAC,CAACN,CAAC,CAAC;EAC5B,MAAMS,KAAK,GAAGF,IAAI,CAACG,GAAG,CAACL,CAAC,CAACN,CAAC,GAAGM,CAAC,CAACJ,KAAK,EAAEK,CAAC,CAACP,CAAC,GAAGO,CAAC,CAACL,KAAK,CAAC;EACpD,MAAMU,MAAM,GAAGJ,IAAI,CAACG,GAAG,CAACL,CAAC,CAACL,CAAC,GAAGK,CAAC,CAACH,MAAM,EAAEI,CAAC,CAACN,CAAC,GAAGM,CAAC,CAACJ,MAAM,CAAC;EACvD,MAAMD,KAAK,GAAGQ,KAAK,GAAGV,CAAC;EACvB,MAAMG,MAAM,GAAGS,MAAM,GAAGX,CAAC;EACzB,IAAIC,KAAK,IAAI,CAAC,IAAIC,MAAM,IAAI,CAAC,EAAE,OAAO,IAAI;EAC1C,OAAO;IAAEH,CAAC;IAAEC,CAAC;IAAEC,KAAK;IAAEC;EAAO,CAAC;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO,eAAeU,qBAAqBA,CACzCnB,KAAsB,EACtBoB,IAAiB,EACY;EAC7B,IAAI,CAACpB,KAAK,EAAE,OAAOoB,IAAI;EACvB,IAAIC,SAAS;EACb,IAAI;IACFA,SAAS,GAAG3B,mBAAmB,CAACM,KAAK,CAAC;EACxC,CAAC,CAAC,MAAM;IACN,OAAOoB,IAAI;EACb;EACA,IAAIE,OAA2B,GAAGF,IAAI;EACtC,KAAK,MAAMG,QAAQ,IAAIF,SAAS,EAAE;IAChC,IAAI,CAACC,OAAO,IAAI,CAACC,QAAQ,CAACC,cAAc,EAAE;IAC1C,MAAMC,QAAQ,GAAG,MAAM1B,gBAAgB,CAACwB,QAAQ,CAACC,cAAc,CAAC;IAChE,IAAI,CAACC,QAAQ,EAAE;IACfH,OAAO,GAAGX,cAAc,CAACW,OAAO,EAAEG,QAAQ,CAAC;EAC7C;EACA,OAAOH,OAAO;AAChB;AAEA,SAASI,WAAWA,CAAC1B,KAAe,EAAW;EAC7C,MAAM2B,IAAI,GAAGtC,eAAe,CAACW,KAAK,CAAC;EACnC,OAAO2B,IAAI,KAAKC,SAAS,IAAI/B,gBAAgB,CAACgC,GAAG,CAACF,IAAI,CAAC;AACzD;AAEA,SAASG,cAAcA,CAAC9B,KAAe,EAAW;EAChD,MAAM+B,KAAK,GAAGzC,gBAAgB,CAACU,KAAK,CAAC;EACrC,IAAI,CAAC+B,KAAK,EAAE,OAAO,IAAI;EACvB,IAAIA,KAAK,CAACC,OAAO,KAAK,KAAK,EAAE,OAAO,KAAK;EACzC,OAAO,IAAI;AACb;;AAEA;AACA;AACA;AACA;AACA,OAAO,SAASC,uBAAuBA,CAACC,IAAqB,EAAEC,QAAQ,GAAG,KAAK,EAAmB;EAChG,IAAI,CAACD,IAAI,EAAE,OAAO,IAAI;EACtB,MAAME,KAAiB,GAAG,CAACF,IAAI,CAAC;EAChC,IAAIG,OAAwB,GAAG,IAAI;EACnC,IAAIC,OAAO,GAAG,CAAC;EACf,IAAI;IACF,OAAOF,KAAK,CAACG,MAAM,GAAG,CAAC,IAAID,OAAO,GAAGH,QAAQ,EAAE;MAC7C,MAAMnC,KAAK,GAAGoC,KAAK,CAACI,GAAG,CAAC,CAAC;MACzB,IAAI,CAACxC,KAAK,EAAE;MACZsC,OAAO,IAAI,CAAC;MACZ,IAAItC,KAAK,KAAKkC,IAAI,IAAIzC,WAAW,CAACO,KAAK,CAAC,IAAI0B,WAAW,CAAC1B,KAAK,CAAC,IAAI8B,cAAc,CAAC9B,KAAK,CAAC,EAAE;QACvFqC,OAAO,GAAGrC,KAAK;MACjB;MACA,IAAIA,KAAK,KAAKkC,IAAI,EAAE;QAClB,MAAMO,OAAO,GAAGjD,UAAU,CAACQ,KAAK,CAAC;QACjC,IAAIyC,OAAO,EAAEL,KAAK,CAACM,IAAI,CAACD,OAAO,CAAC;MAClC;MACA,MAAME,KAAK,GAAGvD,QAAQ,CAACY,KAAK,CAAC;MAC7B,IAAI2C,KAAK,EAAEP,KAAK,CAACM,IAAI,CAACC,KAAK,CAAC;IAC9B;EACF,CAAC,CAAC,MAAM;IACN,OAAON,OAAO;EAChB;EACA,OAAOA,OAAO;AAChB;;AAEA;AACA,OAAO,SAASO,YAAYA,CAAC5C,KAAe,EAAEuB,QAAkB,EAAEsB,QAAQ,GAAG,MAAM,EAAW;EAC5F,IAAIC,OAAwB,GAAG9C,KAAK;EACpC,KAAK,IAAI+C,KAAK,GAAG,CAAC,EAAED,OAAO,IAAIC,KAAK,GAAGF,QAAQ,EAAEE,KAAK,IAAI,CAAC,EAAE;IAC3D,IAAID,OAAO,KAAKvB,QAAQ,EAAE,OAAO,IAAI;IACrC,IAAIA,QAAQ,CAACyB,SAAS,IAAIF,OAAO,KAAKvB,QAAQ,CAACyB,SAAS,EAAE,OAAO,IAAI;IACrEF,OAAO,GAAGvD,SAAS,CAACuD,OAAO,CAAC;EAC9B;EACA,OAAO,KAAK;AACd","ignoreList":[]}

package/lib/module/anchors/fiber/visibleScreens.js

@@ -25,7 +25,7 @@
  * Everything is feature-detected: an app without react-native-screens, or a
  * renamed native component, prunes nothing and behaves as before.
  */
-import { MAX_ANCESTOR_WALK, getAlternate, getChild, getHostTypeName, getMemoizedProps, getReturn, getSibling } from "./fiberInternals.js";
+import { MAX_ANCESTOR_WALK, getAlternate, getChild, getHostTypeName, getMemoizedProps, getReturn, getSibling, resolveCurrentFiber } from "./fiberInternals.js";
 
 /** Host screen types (push screens and iOS modal presentations). */
 const SCREEN_TYPES = new Set(['RNSScreen', 'RNSModalScreen']);
@@ -82,13 +82,8 @@ function ownedScreen(branch) {
 function isActive(screen) {
   return getMemoizedProps(screen)?.activityState === ACTIVITY_STATE_ACTIVE;
 }
-
-/**
- * Branches of `container` that are covered by another screen and so must not be
- * scanned. Empty when there is nothing to prune. Alternates are included so a
- * fiber captured on a previous render still matches.
- */
-export function coveredScreenBranches(container) {
+/** Every branch of `container` that owns a screen, and the ones currently visible. */
+function screenBranches(container) {
   const branches = [];
   let child = getChild(container);
   let guard = 0;
@@ -101,19 +96,38 @@ export function coveredScreenBranches(container) {
     child = getSibling(child);
     guard += 1;
   }
-  const covered = new Set();
-  if (branches.length <= 1) return covered;
-  let visible;
+  if (branches.length <= 1) return {
+    branches,
+    visible: branches
+  };
   if (isStackContainer(container)) {
     // Native stack: activityState is always 2 for mounted screens; last branch
     // owns the top of the stack (including an iOS RNSModalScreen presentation).
-    visible = [branches[branches.length - 1]];
-  } else {
-    const active = branches.filter(entry => isActive(entry.screen));
-    // Keep every active pane (tabs + multi-visible). If none report active
-    // (transition), fall back to last sibling rather than pruning everything.
-    visible = active.length > 0 ? active : [branches[branches.length - 1]];
+    return {
+      branches,
+      visible: [branches[branches.length - 1]]
+    };
   }
+  const active = branches.filter(entry => isActive(entry.screen));
+  // Keep every active pane (tabs + multi-visible). If none report active
+  // (transition), fall back to last sibling rather than pruning everything.
+  return {
+    branches,
+    visible: active.length > 0 ? active : [branches[branches.length - 1]]
+  };
+}
+
+/**
+ * Branches of `container` that are covered by another screen and so must not be
+ * scanned. Empty when there is nothing to prune. Alternates are included so a
+ * fiber captured on a previous render still matches.
+ */
+export function coveredScreenBranches(container) {
+  const {
+    branches,
+    visible
+  } = screenBranches(container);
+  const covered = new Set();
   for (const entry of branches) {
     if (visible.includes(entry)) continue;
     covered.add(entry.branch);
@@ -123,37 +137,59 @@ export function coveredScreenBranches(container) {
   return covered;
 }
 
+/**
+ * The innermost container that hides the branch holding `fiber`, or null when
+ * `fiber` is on a visible screen. Walks outward so nested navigators are handled.
+ */
+function coveringContainer(fiber) {
+  let previous = null;
+  let current = fiber;
+  for (let depth = 0; current && depth < MAX_ANCESTOR_WALK; depth += 1) {
+    if (previous && isScreenContainerFiber(current)) {
+      // A cached fiber's `return` chain can point at the previous render, whose
+      // branches still carry the old activityState. Only the committed
+      // container says which screen is visible now.
+      const container = resolveCurrentFiber(current);
+      const covered = coveredScreenBranches(container);
+      if (covered.has(previous)) return container;
+      const previousAlternate = getAlternate(previous);
+      if (previousAlternate && covered.has(previousAlternate)) return container;
+    }
+    previous = current;
+    current = getReturn(current);
+  }
+  return null;
+}
+
 /**
  * Whether `fiber` lives on a screen the user can currently see.
  *
  * Needed in addition to scan-time pruning: a resolved anchor is cached, and the
  * cache would otherwise keep serving a host after its screen was covered by a
- * newly pushed one. Walks outward so nested navigators are handled.
+ * newly pushed one.
  */
 export function isFiberOnVisibleScreen(fiber) {
   if (!fiber) return false;
   try {
-    let previous = null;
-    let current = fiber;
-    for (let depth = 0; current && depth < MAX_ANCESTOR_WALK; depth += 1) {
-      if (previous) {
-        // A cached fiber's `return` chain can point at the previous render, whose
-        // container still lists the old branches — so consult both alternates.
-        for (const container of [current, getAlternate(current)]) {
-          if (!container || !isScreenContainerFiber(container)) continue;
-          const covered = coveredScreenBranches(container);
-          if (covered.size === 0) continue;
-          if (covered.has(previous)) return false;
-          const previousAlternate = getAlternate(previous);
-          if (previousAlternate && covered.has(previousAlternate)) return false;
-        }
-      }
-      previous = current;
-      current = getReturn(current);
-    }
+    return coveringContainer(fiber) === null;
   } catch {
     // Visibility is a refinement; never let it break resolution.
+    return true;
+  }
+}
+
+/**
+ * When `fiber` is on a covered screen, the visible screens of the navigator
+ * that covers it, topmost first. Empty when `fiber` is visible.
+ */
+export function screensCoveringFiber(fiber) {
+  if (!fiber) return [];
+  try {
+    const container = coveringContainer(fiber);
+    if (!container) return [];
+    return screenBranches(container).visible.map(entry => entry.screen).reverse();
+  } catch {
+    return [];
   }
-  return true;
 }
 //# sourceMappingURL=visibleScreens.js.map