react-native-mcp-kit 3.0.0 → 4.0.0

package/dist/modules/fiberTree/projection.js

@@ -0,0 +1,82 @@
+"use strict";
+/**
+ * `select` parser — converts the agent's raw select array into a strict
+ * `Projection` object the query handler can read against. Recognises three
+ * shapes per entry:
+ *   - bare string         → include the named field with defaults
+ *   - { field: true }     → same
+ *   - { field: options }  → include with per-field options
+ *
+ * Heavy fields (`props`, `hooks`, `children`) take per-field option
+ * objects; light fields (mcpId / name / testID / bounds / refMethods) just
+ * toggle on. Validation of children's nested select happens inside
+ * `parseChildrenOptions` so the error surfaces with the offending field
+ * name.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseProjection = exports.QUERY_DEFAULT_FIELDS = void 0;
+const children_1 = require("./children");
+const hooks_1 = require("./hooks");
+exports.QUERY_DEFAULT_FIELDS = ['mcpId', 'name', 'testID'];
+/**
+ * Parse the `select` arg into a flat Projection. Each element of `select`
+ * may be either a string (include the named field with default options)
+ * or an object whose keys are field names and whose values are
+ * `true` / `false` / per-field projection options.
+ *
+ * Per-field options:
+ *   props: { path?, depth?, maxBytes? }   — projection of the props object
+ *   hooks: HooksRawOptions                — kinds/names filters + withValues
+ *                                           + path/depth/maxBytes for hook
+ *                                           values
+ *   children: number | { treeDepth?, select?, itemsCap? }
+ *                                         — recursive light-only walker; see
+ *                                           parseChildrenSelect for limits.
+ *
+ * Heavy fields (props, hooks) are projected handler-side with these
+ * per-field options so the rest of the response (mcpId, name, total, ...)
+ * stays raw and always visible.
+ */
+const parseProjection = (selectArg) => {
+    const fields = new Set();
+    let propsRaw = {};
+    let hooksRaw;
+    let childrenOpts = null;
+    if (Array.isArray(selectArg)) {
+        for (const entry of selectArg) {
+            if (typeof entry === 'string') {
+                fields.add(entry);
+                continue;
+            }
+            if (entry && typeof entry === 'object') {
+                for (const [key, value] of Object.entries(entry)) {
+                    if (value === false)
+                        continue;
+                    if (key === 'children') {
+                        childrenOpts = (0, children_1.parseChildrenOptions)(value);
+                        continue;
+                    }
+                    fields.add(key);
+                    if (key === 'props' && value && typeof value === 'object') {
+                        propsRaw = value;
+                    }
+                    else if (key === 'hooks' && value && typeof value === 'object') {
+                        hooksRaw = value;
+                    }
+                }
+            }
+        }
+    }
+    if (fields.size === 0) {
+        for (const f of exports.QUERY_DEFAULT_FIELDS)
+            fields.add(f);
+    }
+    return {
+        children: childrenOpts,
+        fields,
+        hooks: (0, hooks_1.buildHooksOptions)(hooksRaw),
+        props: propsRaw,
+    };
+};
+exports.parseProjection = parseProjection;
+//# sourceMappingURL=projection.js.map

package/dist/modules/fiberTree/projection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"projection.js","sourceRoot":"","sources":["../../../src/modules/fiberTree/projection.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;GAaG;;;AAEH,yCAAwE;AACxE,mCAAqF;AAexE,QAAA,oBAAoB,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAU,CAAC;AAEzE;;;;;;;;;;;;;;;;;;GAkBG;AACI,MAAM,eAAe,GAAG,CAAC,SAAkB,EAAc,EAAE;IAChE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,IAAI,QAAQ,GAAiB,EAAE,CAAC;IAChC,IAAI,QAAqC,CAAC;IAC1C,IAAI,YAAY,GAA2B,IAAI,CAAC;IAEhD,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAClB,SAAS;YACX,CAAC;YACD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACvC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAgC,CAAC,EAAE,CAAC;oBAC5E,IAAI,KAAK,KAAK,KAAK;wBAAE,SAAS;oBAC9B,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;wBACvB,YAAY,GAAG,IAAA,+BAAoB,EAAC,KAAK,CAAC,CAAC;wBAC3C,SAAS;oBACX,CAAC;oBACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAChB,IAAI,GAAG,KAAK,OAAO,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;wBAC1D,QAAQ,GAAG,KAAqB,CAAC;oBACnC,CAAC;yBAAM,IAAI,GAAG,KAAK,OAAO,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;wBACjE,QAAQ,GAAG,KAAwB,CAAC;oBACtC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,4BAAoB;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,YAAY;QACtB,MAAM;QACN,KAAK,EAAE,IAAA,yBAAiB,EAAC,QAAQ,CAAC;QAClC,KAAK,EAAE,QAAQ;KAChB,CAAC;AACJ,CAAC,CAAC;AAxCW,QAAA,eAAe,mBAwC1B"}

package/dist/modules/fiberTree/query.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Query primitive — chained `steps`, each step a `scope` + criteria pair.
+ * Each step's matches fan out into the next step's scope (so a 2-step
+ * `[{ name: 'List' }, { scope: 'children', name: 'Item' }]` reads as
+ * "find all Lists, then for each List collect its Item children").
+ *
+ * Scopes (`QueryScope`) control which fibers a step *considers*; criteria
+ * (from `ComponentQuery`) filter that set. Validation rejects unknown
+ * scope strings at the entry point so typos surface as a structured
+ * error instead of silently degrading to the default `descendants`.
+ */
+import { type ComponentQuery, type Fiber } from './types';
+export interface FiberTreeNavigationRef {
+    getCurrentRoute?: () => unknown;
+}
+export type QueryScope = 'ancestors' | 'children' | 'descendants' | 'nearest_host' | 'parent' | 'root' | 'screen' | 'self' | 'siblings';
+export interface QueryStep extends ComponentQuery {
+    /**
+     * If provided, only the N-th match survives into the next step. Omit to
+     * forward every match along (fan-out across scopes on the next step).
+     */
+    index?: number;
+    /**
+     * Which fibers relative to the previous step's result are considered for this
+     * step. Defaults to 'descendants' (so the first step walks the whole tree
+     * from the fiber root). Other values walk 'parent'/'ancestors'/'siblings'/
+     * 'children'/'self'.
+     */
+    scope?: QueryScope;
+}
+export interface QueryRuntime {
+    root: Fiber;
+    navigationRef?: FiberTreeNavigationRef | null;
+}
+/**
+ * Up-front validation of every step's `scope`. Returns a human-readable
+ * error string on a bad scope (with the valid set listed for the agent),
+ * or null when all steps look sane. Keeps unknown scopes from silently
+ * collapsing to the default 'descendants' inside `collectByScope`.
+ */
+export declare const validateSteps: (steps: QueryStep[]) => string | null;
+/**
+ * Walk the chain of steps starting from the fiber root. Each iteration
+ * collects candidates via `collectByScope`, then filters with
+ * `matchesQuery`. `step.index` picks one match; otherwise all matches
+ * fan out as the input set for the next step.
+ */
+export declare const runQueryChain: (runtime: QueryRuntime, steps: QueryStep[]) => Fiber[];
+/**
+ * Keep only fibers whose ancestor chain contains no other match. Removes
+ * wrapper cascades (PressableView → Pressable → View → RCTView) while
+ * keeping independent siblings with overlapping bounds (e.g.
+ * absolute-positioned overlays). Preserves original DFS order.
+ */
+export declare const dedupAncestors: (matches: Fiber[]) => Fiber[];
+//# sourceMappingURL=query.d.ts.map

package/dist/modules/fiberTree/query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../../../src/modules/fiberTree/query.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,KAAK,cAAc,EAAE,KAAK,KAAK,EAAE,MAAM,SAAS,CAAC;AAc1D,MAAM,WAAW,sBAAsB;IACrC,eAAe,CAAC,EAAE,MAAM,OAAO,CAAC;CACjC;AAED,MAAM,MAAM,UAAU,GAClB,WAAW,GACX,UAAU,GACV,aAAa,GACb,cAAc,GACd,QAAQ,GACR,MAAM,GACN,QAAQ,GACR,MAAM,GACN,UAAU,CAAC;AAcf,MAAM,WAAW,SAAU,SAAQ,cAAc;IAC/C;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;OAKG;IACH,KAAK,CAAC,EAAE,UAAU,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,KAAK,CAAC;IACZ,aAAa,CAAC,EAAE,sBAAsB,GAAG,IAAI,CAAC;CAC/C;AAiDD;;;;;GAKG;AACH,eAAO,MAAM,aAAa,UAAW,SAAS,EAAE,KAAG,MAAM,GAAG,IAU3D,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,aAAa,YAAa,YAAY,SAAS,SAAS,EAAE,KAAG,KAAK,EA0B9E,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,cAAc,YAAa,KAAK,EAAE,KAAG,KAAK,EAWtD,CAAC"}

package/dist/modules/fiberTree/query.js

@@ -0,0 +1,151 @@
+"use strict";
+/**
+ * Query primitive — chained `steps`, each step a `scope` + criteria pair.
+ * Each step's matches fan out into the next step's scope (so a 2-step
+ * `[{ name: 'List' }, { scope: 'children', name: 'Item' }]` reads as
+ * "find all Lists, then for each List collect its Item children").
+ *
+ * Scopes (`QueryScope`) control which fibers a step *considers*; criteria
+ * (from `ComponentQuery`) filter that set. Validation rejects unknown
+ * scope strings at the entry point so typos surface as a structured
+ * error instead of silently degrading to the default `descendants`.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.dedupAncestors = exports.runQueryChain = exports.validateSteps = void 0;
+const utils_1 = require("./utils");
+const VALID_SCOPES = new Set([
+    'ancestors',
+    'children',
+    'descendants',
+    'nearest_host',
+    'parent',
+    'root',
+    'screen',
+    'self',
+    'siblings',
+]);
+const resolveScreenFiber = (runtime) => {
+    const nav = runtime.navigationRef;
+    if (!nav || typeof nav.getCurrentRoute !== 'function')
+        return null;
+    const route = nav.getCurrentRoute();
+    const key = route && typeof route.key === 'string' ? route.key : undefined;
+    if (!key)
+        return null;
+    return (0, utils_1.findScreenFiberByRouteKey)(runtime.root, key);
+};
+const collectByScope = (fiber, scope, runtime) => {
+    switch (scope) {
+        case 'self':
+            return [fiber];
+        case 'parent':
+            return fiber.return ? [fiber.return] : [];
+        case 'ancestors':
+            return (0, utils_1.getAncestors)(fiber);
+        case 'children':
+            return (0, utils_1.getDirectChildren)(fiber);
+        case 'siblings':
+            return (0, utils_1.getSiblings)(fiber);
+        case 'nearest_host': {
+            const host = (0, utils_1.findHostFiber)(fiber);
+            return host ? [host] : [];
+        }
+        case 'root':
+            // Top of the fiber tree, regardless of the previous step's match. Use
+            // as the first step (e.g. `query({ steps: [{ scope: 'root' }], select:
+            // [{ children: 5 }] })` to dump the whole tree). Criteria on this step
+            // are matched against the root fiber itself; if you want descendants
+            // of root, follow with another step using scope:'descendants'.
+            return [runtime.root];
+        case 'screen': {
+            const screen = resolveScreenFiber(runtime);
+            if (!screen)
+                return [];
+            return (0, utils_1.findAllByQuery)(screen, {}).filter((f) => {
+                return f !== screen;
+            });
+        }
+        case 'descendants':
+        default:
+            return (0, utils_1.findAllByQuery)(fiber, {}).filter((f) => {
+                return f !== fiber;
+            });
+    }
+};
+/**
+ * Up-front validation of every step's `scope`. Returns a human-readable
+ * error string on a bad scope (with the valid set listed for the agent),
+ * or null when all steps look sane. Keeps unknown scopes from silently
+ * collapsing to the default 'descendants' inside `collectByScope`.
+ */
+const validateSteps = (steps) => {
+    for (let i = 0; i < steps.length; i++) {
+        const step = steps[i];
+        if (!step)
+            continue;
+        if (step.scope !== undefined && !VALID_SCOPES.has(step.scope)) {
+            const valid = Array.from(VALID_SCOPES).sort().join(' / ');
+            return `steps[${i}].scope: unknown scope "${step.scope}". Valid: ${valid}.`;
+        }
+    }
+    return null;
+};
+exports.validateSteps = validateSteps;
+/**
+ * Walk the chain of steps starting from the fiber root. Each iteration
+ * collects candidates via `collectByScope`, then filters with
+ * `matchesQuery`. `step.index` picks one match; otherwise all matches
+ * fan out as the input set for the next step.
+ */
+const runQueryChain = (runtime, steps) => {
+    let current = [runtime.root];
+    for (const step of steps) {
+        const scope = step.scope ?? 'descendants';
+        const seen = new Set();
+        const collected = [];
+        for (const fiber of current) {
+            for (const candidate of collectByScope(fiber, scope, runtime)) {
+                if (!seen.has(candidate)) {
+                    seen.add(candidate);
+                    collected.push(candidate);
+                }
+            }
+        }
+        const filtered = collected.filter((f) => {
+            return (0, utils_1.matchesQuery)(f, step);
+        });
+        if (typeof step.index === 'number') {
+            const picked = filtered[step.index];
+            current = picked ? [picked] : [];
+        }
+        else {
+            current = filtered;
+        }
+        if (current.length === 0)
+            return [];
+    }
+    return current;
+};
+exports.runQueryChain = runQueryChain;
+/**
+ * Keep only fibers whose ancestor chain contains no other match. Removes
+ * wrapper cascades (PressableView → Pressable → View → RCTView) while
+ * keeping independent siblings with overlapping bounds (e.g.
+ * absolute-positioned overlays). Preserves original DFS order.
+ */
+const dedupAncestors = (matches) => {
+    if (matches.length < 2)
+        return matches;
+    const matchSet = new Set(matches);
+    return matches.filter((fiber) => {
+        let p = fiber.return;
+        while (p) {
+            if (matchSet.has(p))
+                return false;
+            p = p.return;
+        }
+        return true;
+    });
+};
+exports.dedupAncestors = dedupAncestors;
+//# sourceMappingURL=query.js.map

package/dist/modules/fiberTree/query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.js","sourceRoot":"","sources":["../../../src/modules/fiberTree/query.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;AAGH,mCAQiB;AAoBjB,MAAM,YAAY,GAA4B,IAAI,GAAG,CAAC;IACpD,WAAW;IACX,UAAU;IACV,aAAa;IACb,cAAc;IACd,QAAQ;IACR,MAAM;IACN,QAAQ;IACR,MAAM;IACN,UAAU;CACX,CAAC,CAAC;AAsBH,MAAM,kBAAkB,GAAG,CAAC,OAAqB,EAAgB,EAAE;IACjE,MAAM,GAAG,GAAG,OAAO,CAAC,aAAa,CAAC;IAClC,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,CAAC,eAAe,KAAK,UAAU;QAAE,OAAO,IAAI,CAAC;IACnE,MAAM,KAAK,GAAG,GAAG,CAAC,eAAe,EAA0C,CAAC;IAC5E,MAAM,GAAG,GAAG,KAAK,IAAI,OAAO,KAAK,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3E,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,OAAO,IAAA,iCAAyB,EAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACtD,CAAC,CAAC;AAEF,MAAM,cAAc,GAAG,CAAC,KAAY,EAAE,KAAiB,EAAE,OAAqB,EAAW,EAAE;IACzF,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,MAAM;YACT,OAAO,CAAC,KAAK,CAAC,CAAC;QACjB,KAAK,QAAQ;YACX,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5C,KAAK,WAAW;YACd,OAAO,IAAA,oBAAY,EAAC,KAAK,CAAC,CAAC;QAC7B,KAAK,UAAU;YACb,OAAO,IAAA,yBAAiB,EAAC,KAAK,CAAC,CAAC;QAClC,KAAK,UAAU;YACb,OAAO,IAAA,mBAAW,EAAC,KAAK,CAAC,CAAC;QAC5B,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,IAAA,qBAAa,EAAC,KAAK,CAAC,CAAC;YAClC,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5B,CAAC;QACD,KAAK,MAAM;YACT,sEAAsE;YACtE,uEAAuE;YACvE,uEAAuE;YACvE,qEAAqE;YACrE,+DAA+D;YAC/D,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACxB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM;gBAAE,OAAO,EAAE,CAAC;YACvB,OAAO,IAAA,sBAAc,EAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC7C,OAAO,CAAC,KAAK,MAAM,CAAC;YACtB,CAAC,CAAC,CAAC;QACL,CAAC;QACD,KAAK,aAAa,CAAC;QACnB;YACE,OAAO,IAAA,sBAAc,EAAC,KAAK,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC5C,OAAO,CAAC,KAAK,KAAK,CAAC;YACrB,CAAC,CAAC,CAAC;IACP,CAAC;AACH,CAAC,CAAC;AAEF;;;;;GAKG;AACI,MAAM,aAAa,GAAG,CAAC,KAAkB,EAAiB,EAAE;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,KAAmB,CAAC,EAAE,CAAC;YAC5E,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1D,OAAO,SAAS,CAAC,2BAA2B,IAAI,CAAC,KAAK,aAAa,KAAK,GAAG,CAAC;QAC9E,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAVW,QAAA,aAAa,iBAUxB;AAEF;;;;;GAKG;AACI,MAAM,aAAa,GAAG,CAAC,OAAqB,EAAE,KAAkB,EAAW,EAAE;IAClF,IAAI,OAAO,GAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAe,IAAI,CAAC,KAAK,IAAI,aAAa,CAAC;QACtD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAC;QAC9B,MAAM,SAAS,GAAY,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC9D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;oBACpB,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACtC,OAAO,IAAA,oBAAY,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QACH,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpC,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,OAAO,GAAG,QAAQ,CAAC;QACrB,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;IACtC,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC,CAAC;AA1BW,QAAA,aAAa,iBA0BxB;AAEF;;;;;GAKG;AACI,MAAM,cAAc,GAAG,CAAC,OAAgB,EAAW,EAAE;IAC1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,OAAO,CAAC;IACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAQ,OAAO,CAAC,CAAC;IACzC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;QAC9B,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACrB,OAAO,CAAC,EAAE,CAAC;YACT,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAXW,QAAA,cAAc,kBAWzB"}

package/dist/modules/fiberTree/redact.d.ts

@@ -0,0 +1,24 @@
+/**
+ * Hook-value redaction. Names matching any compiled pattern have their
+ * `value` masked as `"[redacted]"` in `withValues: true` responses while
+ * keeping kind / name / hook visible. Matching is applied to a hook's
+ * `name` AND every entry in its `via` chain so values stay masked even
+ * when nested under a sensitive custom hook (a leaf `value` inside a
+ * `useAuth()` expansion).
+ *
+ * Default list catches the common security-sensitive names. Tuned to
+ * match real-world variable names without over-matching innocents:
+ * `Pin$` is anchored so it doesn't catch "Spinner"; broad terms like
+ * `auth` are deliberately omitted (would catch `isAuthenticated`).
+ */
+export declare const DEFAULT_REDACT_HOOK_NAMES: ReadonlyArray<string | RegExp>;
+/** Placeholder put on the `value` field of a redacted hook entry. */
+export declare const REDACTED_VALUE = "[redacted]";
+/**
+ * Compile a mixed string/RegExp list into RegExps. String patterns are
+ * escaped and made case-insensitive (so `"password"` catches `password`,
+ * `oldPassword`, `passwordHash`); RegExp values are kept verbatim.
+ */
+export declare const compileRedactPatterns: (raw: ReadonlyArray<string | RegExp>) => RegExp[];
+export declare const matchesAnyRedactPattern: (name: string, patterns: RegExp[]) => boolean;
+//# sourceMappingURL=redact.d.ts.map

package/dist/modules/fiberTree/redact.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"redact.d.ts","sourceRoot":"","sources":["../../../src/modules/fiberTree/redact.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,yBAAyB,EAAE,aAAa,CAAC,MAAM,GAAG,MAAM,CASpE,CAAC;AAEF,qEAAqE;AACrE,eAAO,MAAM,cAAc,eAAe,CAAC;AAM3C;;;;GAIG;AACH,eAAO,MAAM,qBAAqB,QAAS,aAAa,CAAC,MAAM,GAAG,MAAM,CAAC,KAAG,MAAM,EAIjF,CAAC;AAEF,eAAO,MAAM,uBAAuB,SAAU,MAAM,YAAY,MAAM,EAAE,KAAG,OAK1E,CAAC"}

package/dist/modules/fiberTree/redact.js

@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.matchesAnyRedactPattern = exports.compileRedactPatterns = exports.REDACTED_VALUE = exports.DEFAULT_REDACT_HOOK_NAMES = void 0;
+/**
+ * Hook-value redaction. Names matching any compiled pattern have their
+ * `value` masked as `"[redacted]"` in `withValues: true` responses while
+ * keeping kind / name / hook visible. Matching is applied to a hook's
+ * `name` AND every entry in its `via` chain so values stay masked even
+ * when nested under a sensitive custom hook (a leaf `value` inside a
+ * `useAuth()` expansion).
+ *
+ * Default list catches the common security-sensitive names. Tuned to
+ * match real-world variable names without over-matching innocents:
+ * `Pin$` is anchored so it doesn't catch "Spinner"; broad terms like
+ * `auth` are deliberately omitted (would catch `isAuthenticated`).
+ */
+exports.DEFAULT_REDACT_HOOK_NAMES = [
+    /password/i,
+    /token/i,
+    /jwt/i,
+    /secret/i,
+    /Pin$/,
+    /credential/i,
+    /apiKey/i,
+    /authorization/i,
+];
+/** Placeholder put on the `value` field of a redacted hook entry. */
+exports.REDACTED_VALUE = '[redacted]';
+const escapeRegExp = (s) => {
+    return s.replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+};
+/**
+ * Compile a mixed string/RegExp list into RegExps. String patterns are
+ * escaped and made case-insensitive (so `"password"` catches `password`,
+ * `oldPassword`, `passwordHash`); RegExp values are kept verbatim.
+ */
+const compileRedactPatterns = (raw) => {
+    return raw.map((p) => {
+        return typeof p === 'string' ? new RegExp(escapeRegExp(p), 'i') : p;
+    });
+};
+exports.compileRedactPatterns = compileRedactPatterns;
+const matchesAnyRedactPattern = (name, patterns) => {
+    for (const p of patterns) {
+        if (p.test(name))
+            return true;
+    }
+    return false;
+};
+exports.matchesAnyRedactPattern = matchesAnyRedactPattern;
+//# sourceMappingURL=redact.js.map

package/dist/modules/fiberTree/redact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"redact.js","sourceRoot":"","sources":["../../../src/modules/fiberTree/redact.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACU,QAAA,yBAAyB,GAAmC;IACvE,WAAW;IACX,QAAQ;IACR,MAAM;IACN,SAAS;IACT,MAAM;IACN,aAAa;IACb,SAAS;IACT,gBAAgB;CACjB,CAAC;AAEF,qEAAqE;AACxD,QAAA,cAAc,GAAG,YAAY,CAAC;AAE3C,MAAM,YAAY,GAAG,CAAC,CAAS,EAAU,EAAE;IACzC,OAAO,CAAC,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;AAClD,CAAC,CAAC;AAEF;;;;GAIG;AACI,MAAM,qBAAqB,GAAG,CAAC,GAAmC,EAAY,EAAE;IACrF,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACnB,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAJW,QAAA,qBAAqB,yBAIhC;AAEK,MAAM,uBAAuB,GAAG,CAAC,IAAY,EAAE,QAAkB,EAAW,EAAE;IACnF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AALW,QAAA,uBAAuB,2BAKlC"}

package/dist/modules/fiberTree/types.d.ts

@@ -1,3 +1,10 @@
+/**
+ * Loose alias for React's internal Fiber shape — we only ever poke a handful
+ * of fields (memoizedProps, memoizedState, type, return, sibling, child)
+ * and the exact shape drifts between React versions. Centralised here so
+ * every sub-module reaches for the same alias instead of re-declaring it.
+ */
+export type Fiber = any;
 export type ComponentType = 'composite' | 'host' | 'other' | 'text';
 export interface Bounds {
     centerX: number;

package/dist/modules/fiberTree/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/modules/fiberTree/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;AAEpE,MAAM,WAAW,MAAM;IAErB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,mBAAmB,EAAE,CAAC;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,IAAI,EAAE,aAAa,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,MAAM,GACN,MAAM,GACN;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAA;CAAE,GACpC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAEtC,MAAM,WAAW,cAAc;IAC7B;;;;OAIG;IACH,GAAG,CAAC,EAAE,cAAc,EAAE,CAAC;IACvB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;;;;OAQG;IACH,GAAG,CAAC,EAAE,cAAc,GAAG,cAAc,EAAE,CAAC;IACxC;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACpC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/modules/fiberTree/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,MAAM,KAAK,GAAG,GAAG,CAAC;AAExB,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;AAEpE,MAAM,WAAW,MAAM;IAErB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;CACX;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,mBAAmB,EAAE,CAAC;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,IAAI,EAAE,aAAa,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,WAAW,GACnB,OAAO,GACP,MAAM,GACN,MAAM,GACN;IAAE,QAAQ,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAA;CAAE,GACpC;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,OAAO,CAAA;CAAE,CAAC;AAEtC,MAAM,WAAW,cAAc;IAC7B;;;;OAIG;IACH,GAAG,CAAC,EAAE,cAAc,EAAE,CAAC;IACvB,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;;;;;;;OAQG;IACH,GAAG,CAAC,EAAE,cAAc,GAAG,cAAc,EAAE,CAAC;IACxC;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACpC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf"}

package/dist/modules/fiberTree/utils.d.ts

@@ -1,10 +1,16 @@
+import { type ProjectOptions } from '../../shared/projection/projectValue';
 import { type Bounds, type ComponentQuery, type SerializedComponent } from './types';
 type Fiber = any;
 export declare const setRootRef: (ref: unknown) => void;
 export declare const getFiberRoot: () => Fiber | null;
 export declare const getComponentName: (fiber: Fiber) => string;
-export declare const serializeValue: (value: unknown, seen?: WeakSet<object>, depth?: number, maxDepth?: number) => unknown;
-export declare const serializeProps: (props: Record<string, unknown> | null) => Record<string, unknown>;
+/**
+ * Projection helper used everywhere fiber values are serialised (props, hook
+ * values, fiber refs). Pre-applies the fiber-aware collapse rule + skip list
+ * over the shared `projectValue`. Callers can pass `path` / `depth` / etc.
+ * through `options` like with `projectValue` directly.
+ */
+export declare const projectFiberValue: (value: unknown, options?: ProjectOptions) => unknown;
 export declare const serializeFiber: (fiber: Fiber, maxDepth: number, currentDepth?: number) => SerializedComponent | null;
 export declare const findFiber: (root: Fiber, predicate: (fiber: Fiber) => boolean) => Fiber | null;
 export declare const findAllFibers: (root: Fiber, predicate: (fiber: Fiber) => boolean) => Fiber[];

package/dist/modules/fiberTree/utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../src/modules/fiberTree/utils.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,MAAM,EACX,KAAK,cAAc,EAGnB,KAAK,mBAAmB,EACzB,MAAM,SAAS,CAAC;AAYjB,KAAK,KAAK,GAAG,GAAG,CAAC;AAKjB,eAAO,MAAM,UAAU,QAAS,OAAO,KAAG,IAEzC,CAAC;AAeF,eAAO,MAAM,YAAY,QAAO,KAAK,GAAG,IAKvC,CAAC;AAEF,eAAO,MAAM,gBAAgB,UAAW,KAAK,KAAG,MA+B/C,CAAC;AAmBF,eAAO,MAAM,cAAc,UAClB,OAAO,SACR,OAAO,CAAC,MAAM,CAAC,6BAEX,MAAM,KACf,OAyDF,CAAC;AAWF,eAAO,MAAM,cAAc,UAAW,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,KAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAc5F,CAAC;AAoBF,eAAO,MAAM,cAAc,UAClB,KAAK,YACF,MAAM,4BAEf,mBAAmB,GAAG,IAaxB,CAAC;AA4EF,eAAO,MAAM,SAAS,SAAU,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,KAAG,KAAK,GAAG,IAWrF,CAAC;AAEF,eAAO,MAAM,aAAa,SAAU,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,KAAG,KAAK,EAgBtF,CAAC;AAEF,eAAO,MAAM,WAAW,SAAU,KAAK,SAAS,MAAM,KAAG,KAAK,GAAG,IAIhE,CAAC;AAEF,eAAO,MAAM,YAAY,SAAU,KAAK,UAAU,MAAM,KAAG,KAAK,GAAG,IAIlE,CAAC;AAEF,eAAO,MAAM,UAAU,SAAU,KAAK,QAAQ,MAAM,KAAG,KAAK,GAAG,IAI9D,CAAC;AAEF,eAAO,MAAM,UAAU,SAAU,KAAK,QAAQ,MAAM,KAAG,KAAK,GAAG,IAK9D,CAAC;AAqEF,eAAO,MAAM,YAAY,UAAW,KAAK,SAAS,cAAc,KAAG,OA0ClE,CAAC;AAEF,eAAO,MAAM,cAAc,SAAU,KAAK,SAAS,cAAc,KAAG,KAAK,EAIxE,CAAC;AAGF,eAAO,MAAM,iBAAiB,UAAW,KAAK,KAAG,KAAK,EAQrD,CAAC;AAGF,eAAO,MAAM,WAAW,UAAW,KAAK,KAAG,KAAK,EAM/C,CAAC;AAGF,eAAO,MAAM,YAAY,UAAW,KAAK,KAAG,KAAK,EAQhD,CAAC;AAGF,eAAO,MAAM,aAAa,UAAW,KAAK,KAAG,KAAK,GAAG,IAUpD,CAAC;AAaF;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,SAAU,KAAK,YAAY,MAAM,KAAG,KAAK,GAAG,IAajF,CAAC;AAGF,eAAO,MAAM,iBAAiB,UAAW,KAAK,KAAG,OAoBhD,CAAC;AAYF,eAAO,MAAM,YAAY,UAAiB,KAAK,KAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAiDtE,CAAC;AAEF,eAAO,MAAM,mBAAmB,aAAc,OAAO,KAAG,MAAM,EAiB7D,CAAC"}
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../src/modules/fiberTree/utils.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,KAAK,cAAc,EACpB,MAAM,kCAAkC,CAAC;AAG1C,OAAO,EACL,KAAK,MAAM,EACX,KAAK,cAAc,EAGnB,KAAK,mBAAmB,EACzB,MAAM,SAAS,CAAC;AAYjB,KAAK,KAAK,GAAG,GAAG,CAAC;AAKjB,eAAO,MAAM,UAAU,QAAS,OAAO,KAAG,IAEzC,CAAC;AAeF,eAAO,MAAM,YAAY,QAAO,KAAK,GAAG,IAKvC,CAAC;AAEF,eAAO,MAAM,gBAAgB,UAAW,KAAK,KAAG,MAqC/C,CAAC;AA6EF;;;;;GAKG;AACH,eAAO,MAAM,iBAAiB,UAAW,OAAO,YAAW,cAAc,KAAQ,OAMhF,CAAC;AAoBF,eAAO,MAAM,cAAc,UAClB,KAAK,YACF,MAAM,4BAEf,mBAAmB,GAAG,IAaxB,CAAC;AA+EF,eAAO,MAAM,SAAS,SAAU,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,KAAG,KAAK,GAAG,IAWrF,CAAC;AAEF,eAAO,MAAM,aAAa,SAAU,KAAK,aAAa,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,KAAG,KAAK,EAgBtF,CAAC;AAEF,eAAO,MAAM,WAAW,SAAU,KAAK,SAAS,MAAM,KAAG,KAAK,GAAG,IAIhE,CAAC;AAEF,eAAO,MAAM,YAAY,SAAU,KAAK,UAAU,MAAM,KAAG,KAAK,GAAG,IAIlE,CAAC;AAEF,eAAO,MAAM,UAAU,SAAU,KAAK,QAAQ,MAAM,KAAG,KAAK,GAAG,IAI9D,CAAC;AAEF,eAAO,MAAM,UAAU,SAAU,KAAK,QAAQ,MAAM,KAAG,KAAK,GAAG,IAK9D,CAAC;AAqEF,eAAO,MAAM,YAAY,UAAW,KAAK,SAAS,cAAc,KAAG,OA0ClE,CAAC;AAEF,eAAO,MAAM,cAAc,SAAU,KAAK,SAAS,cAAc,KAAG,KAAK,EAIxE,CAAC;AAGF,eAAO,MAAM,iBAAiB,UAAW,KAAK,KAAG,KAAK,EAQrD,CAAC;AAGF,eAAO,MAAM,WAAW,UAAW,KAAK,KAAG,KAAK,EAM/C,CAAC;AAGF,eAAO,MAAM,YAAY,UAAW,KAAK,KAAG,KAAK,EAQhD,CAAC;AAGF,eAAO,MAAM,aAAa,UAAW,KAAK,KAAG,KAAK,GAAG,IAUpD,CAAC;AAaF;;;;;;GAMG;AACH,eAAO,MAAM,yBAAyB,SAAU,KAAK,YAAY,MAAM,KAAG,KAAK,GAAG,IAajF,CAAC;AAGF,eAAO,MAAM,iBAAiB,UAAW,KAAK,KAAG,OAoBhD,CAAC;AAYF,eAAO,MAAM,YAAY,UAAiB,KAAK,KAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAgDtE,CAAC;AAEF,eAAO,MAAM,mBAAmB,aAAc,OAAO,KAAG,MAAM,EAiB7D,CAAC"}

package/dist/modules/fiberTree/utils.js

@@ -1,6 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.getAvailableMethods = exports.measureFiber = exports.getNativeInstance = exports.findScreenFiberByRouteKey = exports.findHostFiber = exports.getAncestors = exports.getSiblings = exports.getDirectChildren = exports.findAllByQuery = exports.matchesQuery = exports.findByText = exports.findByName = exports.findByTestID = exports.findByMcpId = exports.findAllFibers = exports.findFiber = exports.serializeFiber = exports.serializeProps = exports.serializeValue = exports.getComponentName = exports.getFiberRoot = exports.setRootRef = void 0;
+exports.getAvailableMethods = exports.measureFiber = exports.getNativeInstance = exports.findScreenFiberByRouteKey = exports.findHostFiber = exports.getAncestors = exports.getSiblings = exports.getDirectChildren = exports.findAllByQuery = exports.matchesQuery = exports.findByText = exports.findByName = exports.findByTestID = exports.findByMcpId = exports.findAllFibers = exports.findFiber = exports.serializeFiber = exports.projectFiberValue = exports.getComponentName = exports.getFiberRoot = exports.setRootRef = void 0;
+const projectValue_1 = require("../../shared/projection/projectValue");
+const core_1 = require("../../shared/rn/core");
 // Fiber tag constants
 const HOST_COMPONENT = 5;
 const HOST_TEXT = 6;
@@ -36,8 +38,14 @@ const getFiberRoot = () => {
 };
 exports.getFiberRoot = getFiberRoot;
 const getComponentName = (fiber) => {
-    if (!fiber.type)
+    // Host root has no `type` and no `return` parent. Surface it as
+    // "FiberRoot" instead of "Unknown" so dumps via scope:'root' read
+    // sensibly (and the name doesn't collide with a real component).
+    if (!fiber.type) {
+        if (!fiber.return)
+            return 'FiberRoot';
         return 'Unknown';
+    }
     if (typeof fiber.type === 'string') {
         return fiber.type;
     }
@@ -75,85 +83,76 @@ const getComponentType = (fiber) => {
     }
     return 'other';
 };
-const MAX_VALUE_DEPTH = 3;
-const serializeValue = (value, seen = new WeakSet(), depth = 0, maxDepth = MAX_VALUE_DEPTH) => {
-    if (value === null || value === undefined)
-        return value;
-    if (depth > maxDepth)
-        return '[...]';
-    if (typeof value === 'function') {
-        return `[Function: ${value.name || 'anonymous'}]`;
-    }
-    if (typeof value === 'symbol') {
-        return value.toString();
-    }
-    if (typeof value !== 'object')
-        return value;
-    // React element
-    if (value && typeof value === 'object' && '$$typeof' in value) {
-        return '[ReactElement]';
-    }
-    if (seen.has(value))
-        return '[Circular]';
-    seen.add(value);
-    // Skip objects that look like fiber nodes or native instances
-    if (value &&
-        typeof value === 'object' &&
-        ('stateNode' in value || 'memoizedProps' in value || '__nativeTag' in value)) {
-        return '[InternalObject]';
-    }
-    if (Array.isArray(value)) {
-        return value.slice(0, 10).map((item) => {
-            return (0, exports.serializeValue)(item, seen, depth + 1, maxDepth);
-        });
-    }
-    const result = {};
-    try {
-        const keys = Object.keys(value);
-        for (const key of keys.slice(0, 20)) {
-            if (key.startsWith('__'))
-                continue;
-            try {
-                result[key] = (0, exports.serializeValue)(value[key], seen, depth + 1, maxDepth);
-            }
-            catch {
-                result[key] = '[Error]';
-            }
-        }
-    }
-    catch {
-        return '[Object]';
-    }
-    return result;
-};
-exports.serializeValue = serializeValue;
-// Props to skip — internal React/RN properties that bloat output
-const SKIP_PROPS = new Set([
+// Props/values to drop — internal React/RN bookkeeping that bloats output.
+// Used by `projectFiberValue` below as `skipKeys`. Anything matching the
+// `__`-prefix regex is also dropped (covers `__nativeTag`, `__reactProps$...`,
+// react-refresh internal markers, etc.).
+const SKIP_KEYS_FIBER = [
     '__internalInstanceHandle',
     '__nativeTag',
     'children',
     'collapsableChildren',
     'ref',
-]);
-const serializeProps = (props) => {
-    if (!props)
-        return {};
-    const result = {};
-    for (const key of Object.keys(props)) {
-        if (SKIP_PROPS.has(key))
-            continue;
-        if (key.startsWith('__'))
-            continue;
-        try {
-            result[key] = (0, exports.serializeValue)(props[key]);
-        }
-        catch {
-            result[key] = '[Error reading prop]';
-        }
-    }
-    return result;
+    /^__/,
+];
+// Collapse rule: detect React elements / fiber nodes / native instances and
+// replace them with compact `${...}`-keyed marker objects. Stops projectValue
+// from descending into ~unbounded React internals graph and emits something
+// the agent can act on (mcpId / componentName).
+const fiberCollapseRule = (value) => {
+    if (!value || typeof value !== 'object')
+        return undefined;
+    const obj = value;
+    // React element — has `$$typeof` symbol
+    if ('$$typeof' in obj) {
+        return { ['${ReactElement}']: true };
+    }
+    // Fiber-like or native-instance — try to extract a compact ref
+    const looksLikeFiberOrNative = 'stateNode' in obj || 'memoizedProps' in obj || '__nativeTag' in obj;
+    if (!looksLikeFiberOrNative)
+        return undefined;
+    // pull a fiber out — direct, or via internal handle on a native view
+    const fiber = obj._reactInternals ??
+        obj._reactInternalFiber ??
+        obj._internalFiberInstanceHandleDEV ??
+        obj._internalInstanceHandle ??
+        ('memoizedProps' in obj ? obj : undefined);
+    const meta = {};
+    if (fiber) {
+        const props = fiber.memoizedProps;
+        const mcpId = props?.['data-mcp-id'];
+        const testID = props?.testID;
+        if (mcpId)
+            meta.mcpId = mcpId;
+        if (testID)
+            meta.testID = testID;
+        const typeName = fiber.type?.displayName ??
+            fiber.type?.name;
+        if (typeName)
+            meta.name = typeName;
+    }
+    if ('__nativeTag' in obj) {
+        meta.nativeTag = obj.__nativeTag;
+        const viewConfig = obj.viewConfig;
+        if (viewConfig?.uiViewClassName)
+            meta.viewClass = viewConfig.uiViewClassName;
+    }
+    return { ['${ref}']: Object.keys(meta).length > 0 ? meta : true };
+};
+/**
+ * Projection helper used everywhere fiber values are serialised (props, hook
+ * values, fiber refs). Pre-applies the fiber-aware collapse rule + skip list
+ * over the shared `projectValue`. Callers can pass `path` / `depth` / etc.
+ * through `options` like with `projectValue` directly.
+ */
+const projectFiberValue = (value, options = {}) => {
+    return (0, projectValue_1.projectValue)(value, {
+        ...options,
+        collapse: [fiberCollapseRule, ...(options.collapse ?? [])],
+        skipKeys: [...SKIP_KEYS_FIBER, ...(options.skipKeys ?? [])],
+    }).value;
 };
-exports.serializeProps = serializeProps;
+exports.projectFiberValue = projectFiberValue;
 const getTextContent = (fiber) => {
     if (fiber.tag === HOST_TEXT) {
         return fiber.memoizedProps;
@@ -231,7 +230,10 @@ const serializeFiberUnsafe = (fiber, maxDepth, currentDepth) => {
         return null;
     }
     const name = (0, exports.getComponentName)(fiber);
-    const props = (0, exports.serializeProps)(fiber.memoizedProps);
+    // Pass raw memoizedProps through — handler-level `applyProjection` runs the
+    // single canonical projectValue walk on the final response, including this
+    // tree. Projecting here would cause double-projection and break path drill.
+    const props = (fiber.memoizedProps ?? {});
     const mcpId = fiber.memoizedProps?.['data-mcp-id'];
     const testID = fiber.memoizedProps?.testID;
     const text = getTextContent(fiber);
@@ -558,8 +560,7 @@ const measureFiber = async (fiber) => {
     const instance = canonical?.publicInstance ?? hostFiber.stateNode;
     if (!instance)
         return null;
-    // eslint-disable-next-line @typescript-eslint/no-require-imports, @typescript-eslint/no-var-requires
-    const RN = require('react-native');
+    const RN = (0, core_1.getRN)();
     const { PixelRatio, UIManager, findNodeHandle } = RN;
     const handle = typeof findNodeHandle === 'function' ? findNodeHandle(instance) : null;
     if (handle == null)