@memlab/mcp-server 2.3.0 → 2.52.0

package/dist/tools/collection-trend.js

@@ -0,0 +1,315 @@
+/**
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *
+ * @format
+ * @oncall memory_lab
+ */
+import fs from 'fs';
+import memlabCore from '@memlab/core';
+import { z } from 'zod';
+import { enumerateMapEntries, enumerateSetElements, errorResult, formatNumber, markdownTable, toolResult, } from '../utils.js';
+import { resolveLadderPaths } from './ladder.js';
+import { resolveMaxFileSizeMB, resolveSnapshotPath } from './load-snapshot.js';
+const { utils: memlabUtils } = memlabCore;
+export function parseLocator(spec) {
+    const parts = spec
+        .split('.')
+        .map(s => s.trim())
+        .filter(s => s.length > 0);
+    if (parts.length < 2) {
+        throw new Error(`Locator "${spec}" must be "<OwnerClass>.<property>" (optionally deeper, e.g. "Store.cache.entries").`);
+    }
+    return { ownerClass: parts[0], path: parts.slice(1), raw: spec };
+}
+/**
+ * Follow one named edge. Hidden-class and other internal bookkeeping edges are
+ * skipped so a user property named like an internal slot still resolves; a
+ * `table` / `backing_store` edge is NOT followed here because the collection
+ * enumerators below do that themselves.
+ */
+function stepEdge(node, name) {
+    for (const edge of node.references) {
+        if (edge.type === 'hidden')
+            continue;
+        if (String(edge.name_or_index) !== name)
+            continue;
+        const target = edge.toNode;
+        if (target.id <= 3)
+            return null;
+        return target;
+    }
+    return null;
+}
+export function resolvePath(owner, path) {
+    let cur = owner;
+    for (const seg of path) {
+        if (cur == null)
+            return null;
+        cur = stepEdge(cur, seg);
+    }
+    return cur;
+}
+/**
+ * Number of entries held by a collection node, by V8 kind.
+ *
+ * Returns null when the node is not a container — reported as "not a
+ * collection" rather than as 0 entries, because those two read identically in a
+ * table and mean opposite things (an empty cache vs a mistyped locator).
+ */
+export function countEntries(node) {
+    const name = node.name;
+    if (name === 'Map' || name === 'WeakMap') {
+        return enumerateMapEntries(node).length;
+    }
+    if (name === 'Set' || name === 'WeakSet') {
+        return enumerateSetElements(node).length;
+    }
+    if (name === 'Array' || node.type === 'array') {
+        // Element edges hang off either the array node itself or its
+        // `(object elements)` backing store, depending on the V8 elements kind, so
+        // both are counted. An element lives in exactly one of the two, so summing
+        // cannot double-count. (On the Chromium captures checked here the direct
+        // form was used throughout; the backing-store branch is for the kinds that
+        // are not, and an empty array's shared `elements` store contributes 0.)
+        let n = 0;
+        let backing = null;
+        for (const edge of node.references) {
+            if (edge.type === 'element')
+                n++;
+            else if (String(edge.name_or_index) === 'elements')
+                backing = edge.toNode;
+        }
+        if (backing != null) {
+            for (const edge of backing.references) {
+                if (edge.type === 'element')
+                    n++;
+            }
+        }
+        return n;
+    }
+    if (node.type === 'object') {
+        let n = 0;
+        for (const edge of node.references) {
+            if (edge.type === 'property' &&
+                String(edge.name_or_index) !== '__proto__') {
+                n++;
+            }
+        }
+        return n;
+    }
+    return null;
+}
+export function measureLocators(snapshot, locators) {
+    const byClass = new Map();
+    for (const loc of locators) {
+        const list = byClass.get(loc.ownerClass);
+        if (list)
+            list.push(loc);
+        else
+            byClass.set(loc.ownerClass, [loc]);
+    }
+    const out = new Map();
+    for (const loc of locators) {
+        out.set(loc.raw, {
+            owners: 0,
+            resolved: 0,
+            entries: 0,
+            maxEntries: 0,
+            nonCollection: false,
+        });
+    }
+    snapshot.nodes.forEach(node => {
+        if (node.id <= 3)
+            return;
+        const locs = byClass.get(node.name);
+        if (!locs)
+            return;
+        for (const loc of locs) {
+            const m = out.get(loc.raw);
+            if (!m)
+                continue;
+            m.owners++;
+            const target = resolvePath(node, loc.path);
+            if (target == null)
+                continue;
+            const n = countEntries(target);
+            if (n == null) {
+                m.nonCollection = true;
+                continue;
+            }
+            m.resolved++;
+            m.entries += n;
+            if (n > m.maxEntries)
+                m.maxEntries = n;
+        }
+    });
+    return out;
+}
+/**
+ * Load each rung, measure the locators, drop the graph. Uses the LIGHT parse:
+ * entry counts come from backing-store edges, so the dominator/retained-size
+ * pass this tool would otherwise pay for on every rung buys nothing (measured
+ * on a 380 MB capture: 18s → 8s per rung).
+ */
+export async function measureLadder(paths, locators, maxFileSizeMB) {
+    const labels = [];
+    const perRung = [];
+    for (const p of paths) {
+        let local;
+        let fetchedFrom = null;
+        try {
+            const r = resolveSnapshotPath(p);
+            local = r.localPath;
+            fetchedFrom = r.fetchedFrom;
+        }
+        catch (e) {
+            throw new Error(`Failed to resolve "${p}": ${e instanceof Error ? e.message : String(e)}`);
+        }
+        if (!fs.existsSync(local))
+            throw new Error(`File not found: ${local}`);
+        const sizeMB = fs.statSync(local).size / (1024 * 1024);
+        const limit = resolveMaxFileSizeMB(maxFileSizeMB, fetchedFrom != null);
+        if (sizeMB > limit) {
+            throw new Error(`${p} is ${sizeMB.toFixed(0)} MB — exceeds the ${limit} MB per-file safety limit. Raise it with max_file_size_mb: ${Math.ceil(sizeMB + 100)}.`);
+        }
+        const snapshot = await memlabUtils.getSnapshotFromFile(local, {
+            buildNodeIdIndex: true,
+            verbose: false,
+        });
+        labels.push(fetchedFrom ?? p.replace(/^.*\//, ''));
+        perRung.push(measureLocators(snapshot, locators));
+    }
+    return { labels, perRung };
+}
+function trendOf(series) {
+    let up = true;
+    for (let i = 1; i < series.length; i++) {
+        if (series[i] <= series[i - 1])
+            up = false;
+    }
+    const net = series[series.length - 1] - series[0];
+    if (up && net > 0)
+        return 'up-every-rung';
+    if (net > 0)
+        return 'grew-net';
+    return 'flat-or-mixed';
+}
+export function registerCollectionTrend(server) {
+    server.tool('memlab_collection_trend', 'Track named collections ACROSS a snapshot ladder: entry counts per rung, with per-cycle growth. memlab_cache_analysis, memlab_stale_collections and memlab_growth_signals all answer "how big is this collection now?" on one snapshot; the question that separates a leak from a cache that has simply filled is "did it grow at every rung, and by how much per interaction?" — which needs the ladder. ' +
+        'Collections are named by OWNER CLASS and property path ("LoggerImpl.logs", "Store.cache.entries"), never by node id: ids are per-capture, so an id would track a different object at each rung. Every instance of the owner class is measured, so both a singleton\'s collection and a per-instance one are visible (totals and the largest single instance are reported separately). ' +
+        'Measured examples from one hunt: undoStack 5 → 2,205, allFamiliesByID 3 → 16,367, LoggerImpl.logs 8,790 → 20,700 — all invisible to a single-snapshot view. ' +
+        'Loads each rung transiently in LIGHT mode (one graph resident at a time), so it is safe on ladders too large to hold in memory at once.', {
+        paths: z
+            .array(z.string())
+            .describe('Ordered snapshot paths, OLDEST FIRST. A single ["ladder:<name>"] element expands to a saved ladder (see memlab_ladder).'),
+        locators: z
+            .array(z.string())
+            .describe('Collections to track, as "<OwnerClass>.<property>" (deeper paths allowed: "Store.cache.entries"). The owner class is the node class name as it appears in memlab_class_histogram.'),
+        cycles: z
+            .number()
+            .optional()
+            .describe('Interaction cycles driven BETWEEN consecutive rungs. When given, growth is also reported per cycle — the figure that says whether a fix has to bound the collection or merely size it.'),
+        max_file_size_mb: z
+            .number()
+            .optional()
+            .describe('Per-file size limit override (MB).'),
+    }, async ({ paths, locators, cycles, max_file_size_mb }) => {
+        try {
+            const { paths: resolvedPaths, ladder } = resolveLadderPaths(paths);
+            if (resolvedPaths.length < 2) {
+                return errorResult(`memlab_collection_trend needs at least 2 snapshots; got ${resolvedPaths.length}. A trend cannot be read from one rung — use memlab_cache_analysis for a single snapshot.`);
+            }
+            if (locators.length === 0) {
+                return errorResult('locators is empty — pass at least one "<OwnerClass>.<property>".');
+            }
+            const parsed = locators.map(parseLocator);
+            const effectiveCycles = cycles ??
+                (ladder?.cycles != null && resolvedPaths.length > 1
+                    ? ladder.cycles / (resolvedPaths.length - 1)
+                    : undefined);
+            const { labels, perRung } = await measureLadder(resolvedPaths, parsed, max_file_size_mb);
+            const n = perRung.length;
+            const headers = [
+                'Collection',
+                ...labels.map((l, i) => `r${i}: ${l.length > 18 ? l.slice(0, 15) + '…' : l}`),
+                'Δ total',
+                ...(effectiveCycles ? ['Δ/cycle'] : []),
+                'Trend',
+            ];
+            const rows = [];
+            const notes = [];
+            for (const loc of parsed) {
+                const series = perRung.map(m => m.get(loc.raw)?.entries ?? 0);
+                const owners = perRung.map(m => m.get(loc.raw)?.owners ?? 0);
+                const resolved = perRung.map(m => m.get(loc.raw)?.resolved ?? 0);
+                const net = series[n - 1] - series[0];
+                const trend = trendOf(series);
+                rows.push([
+                    loc.raw,
+                    ...series.map(v => formatNumber(v)),
+                    `${net >= 0 ? '+' : '−'}${formatNumber(Math.abs(net))}`,
+                    ...(effectiveCycles
+                        ? [
+                            (net / (effectiveCycles * (n - 1))).toFixed(Math.abs(net / (effectiveCycles * (n - 1))) < 10 ? 2 : 0),
+                        ]
+                        : []),
+                    trend === 'up-every-rung'
+                        ? '↑ every rung'
+                        : trend === 'grew-net'
+                            ? '↑ net'
+                            : 'flat/mixed',
+                ]);
+                if (owners.every(o => o === 0)) {
+                    notes.push(`- ⚠ \`${loc.raw}\`: no node of class \`${loc.ownerClass}\` exists in any rung. Check the class name against \`memlab_class_histogram\` — this row's zeros mean "not found", not "empty".`);
+                }
+                else if (resolved.every(r => r === 0)) {
+                    notes.push(`- ⚠ \`${loc.raw}\`: \`${loc.ownerClass}\` exists but the path \`.${loc.path.join('.')}\` never resolved to a collection. Inspect one instance with \`memlab_object_shape\`.`);
+                }
+                else {
+                    const maxAtEnd = perRung[n - 1].get(loc.raw);
+                    if (maxAtEnd && maxAtEnd.resolved > 1) {
+                        const firstMax = perRung[0].get(loc.raw)?.maxEntries ?? 0;
+                        const ownersGrew = net > 0 && maxAtEnd.maxEntries <= firstMax * 1.2;
+                        notes.push(`- \`${loc.raw}\`: ${formatNumber(maxAtEnd.resolved)} instance(s) at the last rung; largest single collection holds ${formatNumber(maxAtEnd.maxEntries)} entries.` +
+                            (ownersGrew
+                                ? ` The total grew while the largest instance did not — the OWNERS are accumulating, not the collection. Track \`${loc.ownerClass}\` itself with \`memlab_sequence_analysis\`.`
+                                : ''));
+                    }
+                    if (maxAtEnd?.nonCollection) {
+                        notes.push(`- ⚠ \`${loc.raw}\`: at least one instance resolved to something that is not a container; those instances are excluded from the counts.`);
+                    }
+                }
+            }
+            const lines = [
+                `## Collection trend across ${n} rung(s)`,
+                '',
+                markdownTable(headers, rows, new Set(headers
+                    .map((_, i) => i)
+                    .filter(i => i > 0 && i < headers.length - 1))),
+            ];
+            if (effectiveCycles) {
+                lines.push('', `_Δ/cycle assumes ${formatNumber(Math.round(effectiveCycles))} interaction cycle(s) between consecutive rungs${cycles == null ? ' (from the saved ladder)' : ''}._`);
+            }
+            else {
+                lines.push('', '_Pass `cycles` (interactions driven between rungs) to get per-cycle growth — the number that distinguishes a collection that must be BOUNDED from one that merely needs a bigger initial size._');
+            }
+            if (notes.length > 0)
+                lines.push('', ...notes);
+            const growers = parsed.filter(loc => {
+                const series = perRung.map(m => m.get(loc.raw)?.entries ?? 0);
+                return trendOf(series) === 'up-every-rung';
+            });
+            lines.push('', growers.length > 0
+                ? `**${formatNumber(growers.length)} collection(s) grew at EVERY rung** (${growers.map(g => `\`${g.raw}\``).join(', ')}) — monotonic growth under a repeated interaction is the signature of an unbounded collection. Confirm the entries are distinct (not one object re-added) with \`memlab_map_entries\`, then \`memlab_retainer_trace\` the owner.`
+                : '**No collection grew at every rung.** Net growth without monotonicity is usually a cache filling toward its cap; re-run with more rungs, or check `memlab_cache_analysis` for the cap.');
+            return toolResult(lines.join('\n'));
+        }
+        catch (err) {
+            return errorResult(err);
+        }
+    });
+}
+//# sourceMappingURL=collection-trend.js.map

package/dist/tools/collection-trend.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection-trend.js","sourceRoot":"","sources":["../../src/tools/collection-trend.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,UAAU,MAAM,cAAc,CAAC;AACtC,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AACtB,OAAO,EACL,mBAAmB,EACnB,oBAAoB,EACpB,WAAW,EACX,YAAY,EACZ,aAAa,EACb,UAAU,GACX,MAAM,aAAa,CAAC;AACrB,OAAO,EAAC,kBAAkB,EAAC,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAC,oBAAoB,EAAE,mBAAmB,EAAC,MAAM,oBAAoB,CAAC;AAE7E,MAAM,EAAC,KAAK,EAAE,WAAW,EAAC,GAAG,UAAU,CAAC;AAiBxC,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,MAAM,KAAK,GAAG,IAAI;SACf,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7B,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,IAAI,KAAK,CACb,YAAY,IAAI,sFAAsF,CACvG,CAAC;IACJ,CAAC;IACD,OAAO,EAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAC,CAAC;AACjE,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,IAAe,EAAE,IAAY;IAC7C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,SAAS;QACrC,IAAI,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,IAAI;YAAE,SAAS;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,MAAM,CAAC,EAAE,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAChC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,KAAgB,EAChB,IAAc;IAEd,IAAI,GAAG,GAAqB,KAAK,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;QAC7B,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,IAAe;IAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACzC,OAAO,mBAAmB,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IAC1C,CAAC;IACD,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACzC,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IAC3C,CAAC;IACD,IAAI,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC9C,6DAA6D;QAC7D,2EAA2E;QAC3E,2EAA2E;QAC3E,yEAAyE;QACzE,2EAA2E;QAC3E,wEAAwE;QACxE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,OAAO,GAAqB,IAAI,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;gBAAE,CAAC,EAAE,CAAC;iBAC5B,IAAI,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,UAAU;gBAAE,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5E,CAAC;QACD,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;YACpB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS;oBAAE,CAAC,EAAE,CAAC;YACnC,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,IACE,IAAI,CAAC,IAAI,KAAK,UAAU;gBACxB,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,WAAW,EAC1C,CAAC;gBACD,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAgBD,MAAM,UAAU,eAAe,CAC7B,QAAuB,EACvB,QAAmB;IAEnB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACpB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA8B,CAAC;IAClD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE;YACf,MAAM,EAAE,CAAC;YACT,QAAQ,EAAE,CAAC;YACX,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,KAAK;SACrB,CAAC,CAAC;IACL,CAAC;IACD,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAC5B,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC;YAAE,OAAO;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,CAAC,CAAC,MAAM,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,MAAM,IAAI,IAAI;gBAAE,SAAS;YAC7B,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;gBACd,CAAC,CAAC,aAAa,GAAG,IAAI,CAAC;gBACvB,SAAS;YACX,CAAC;YACD,CAAC,CAAC,QAAQ,EAAE,CAAC;YACb,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,CAAC,UAAU;gBAAE,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC;QACzC,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,KAAe,EACf,QAAmB,EACnB,aAAsB;IAEtB,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAsC,EAAE,CAAC;IACtD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,KAAa,CAAC;QAClB,IAAI,WAAW,GAAkB,IAAI,CAAC;QACtC,IAAI,CAAC;YACH,MAAM,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;YACjC,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC;YACpB,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;QAC9B,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CACb,sBAAsB,CAAC,MAAM,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC1E,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,KAAK,EAAE,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,oBAAoB,CAAC,aAAa,EAAE,WAAW,IAAI,IAAI,CAAC,CAAC;QACvE,IAAI,MAAM,GAAG,KAAK,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CACb,GAAG,CAAC,OAAO,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB,KAAK,8DAA8D,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,CAC/I,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,mBAAmB,CAAC,KAAK,EAAE;YAC5D,gBAAgB,EAAE,IAAI;YACtB,OAAO,EAAE,KAAK;SACf,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,EAAC,MAAM,EAAE,OAAO,EAAC,CAAC;AAC3B,CAAC;AAED,SAAS,OAAO,CACd,MAAgB;IAEhB,IAAI,EAAE,GAAG,IAAI,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YAAE,EAAE,GAAG,KAAK,CAAC;IAC7C,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAClD,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,eAAe,CAAC;IAC1C,IAAI,GAAG,GAAG,CAAC;QAAE,OAAO,UAAU,CAAC;IAC/B,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,MAAiB;IACvD,MAAM,CAAC,IAAI,CACT,yBAAyB,EACzB,4YAA4Y;QAC1Y,wXAAwX;QACxX,8JAA8J;QAC9J,yIAAyI,EAC3I;QACE,KAAK,EAAE,CAAC;aACL,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,QAAQ,CACP,yHAAyH,CAC1H;QACH,QAAQ,EAAE,CAAC;aACR,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,QAAQ,CACP,mLAAmL,CACpL;QACH,MAAM,EAAE,CAAC;aACN,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,QAAQ,CACP,wLAAwL,CACzL;QACH,gBAAgB,EAAE,CAAC;aAChB,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,QAAQ,CAAC,oCAAoC,CAAC;KAClD,EACD,KAAK,EAAE,EAAC,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAC,EAAE,EAAE;QACpD,IAAI,CAAC;YACH,MAAM,EAAC,KAAK,EAAE,aAAa,EAAE,MAAM,EAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;YACjE,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,OAAO,WAAW,CAChB,2DAA2D,aAAa,CAAC,MAAM,2FAA2F,CAC3K,CAAC;YACJ,CAAC;YACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,WAAW,CAChB,kEAAkE,CACnE,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAC1C,MAAM,eAAe,GACnB,MAAM;gBACN,CAAC,MAAM,EAAE,MAAM,IAAI,IAAI,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC;oBACjD,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC5C,CAAC,CAAC,SAAS,CAAC,CAAC;YAEjB,MAAM,EAAC,MAAM,EAAE,OAAO,EAAC,GAAG,MAAM,aAAa,CAC3C,aAAa,EACb,MAAM,EACN,gBAAgB,CACjB,CAAC;YACF,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;YAEzB,MAAM,OAAO,GAAG;gBACd,YAAY;gBACZ,GAAG,MAAM,CAAC,GAAG,CACX,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAC/D;gBACD,SAAS;gBACT,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,OAAO;aACR,CAAC;YACF,MAAM,IAAI,GAAe,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC,CAAC;gBAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;gBAC7D,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC,CAAC;gBACjE,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC;oBACR,GAAG,CAAC,GAAG;oBACP,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oBACnC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;oBACvD,GAAG,CAAC,eAAe;wBACjB,CAAC,CAAC;4BACE,CAAC,GAAG,GAAG,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CACzC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,eAAe,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzD;yBACF;wBACH,CAAC,CAAC,EAAE,CAAC;oBACP,KAAK,KAAK,eAAe;wBACvB,CAAC,CAAC,cAAc;wBAChB,CAAC,CAAC,KAAK,KAAK,UAAU;4BACpB,CAAC,CAAC,OAAO;4BACT,CAAC,CAAC,YAAY;iBACnB,CAAC,CAAC;gBAEH,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBAC/B,KAAK,CAAC,IAAI,CACR,SAAS,GAAG,CAAC,GAAG,0BAA0B,GAAG,CAAC,UAAU,kIAAkI,CAC3L,CAAC;gBACJ,CAAC;qBAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACxC,KAAK,CAAC,IAAI,CACR,SAAS,GAAG,CAAC,GAAG,SAAS,GAAG,CAAC,UAAU,6BAA6B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,uFAAuF,CAC9K,CAAC;gBACJ,CAAC;qBAAM,CAAC;oBACN,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC7C,IAAI,QAAQ,IAAI,QAAQ,CAAC,QAAQ,GAAG,CAAC,EAAE,CAAC;wBACtC,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,UAAU,IAAI,CAAC,CAAC;wBAC1D,MAAM,UAAU,GACd,GAAG,GAAG,CAAC,IAAI,QAAQ,CAAC,UAAU,IAAI,QAAQ,GAAG,GAAG,CAAC;wBACnD,KAAK,CAAC,IAAI,CACR,OAAO,GAAG,CAAC,GAAG,OAAO,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,kEAAkE,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,WAAW;4BAChK,CAAC,UAAU;gCACT,CAAC,CAAC,iHAAiH,GAAG,CAAC,UAAU,8CAA8C;gCAC/K,CAAC,CAAC,EAAE,CAAC,CACV,CAAC;oBACJ,CAAC;oBACD,IAAI,QAAQ,EAAE,aAAa,EAAE,CAAC;wBAC5B,KAAK,CAAC,IAAI,CACR,SAAS,GAAG,CAAC,GAAG,wHAAwH,CACzI,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,KAAK,GAAa;gBACtB,8BAA8B,CAAC,UAAU;gBACzC,EAAE;gBACF,aAAa,CACX,OAAO,EACP,IAAI,EACJ,IAAI,GAAG,CACL,OAAO;qBACJ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;qBAChB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAChD,CACF;aACF,CAAC;YACF,IAAI,eAAe,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CACR,EAAE,EACF,oBAAoB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,kDAAkD,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC,EAAE,IAAI,CACpK,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CACR,EAAE,EACF,iMAAiM,CAClM,CAAC;YACJ,CAAC;YACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,CAAC;YAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE;gBAClC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC,CAAC;gBAC9D,OAAO,OAAO,CAAC,MAAM,CAAC,KAAK,eAAe,CAAC;YAC7C,CAAC,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CACR,EAAE,EACF,OAAO,CAAC,MAAM,GAAG,CAAC;gBAChB,CAAC,CAAC,KAAK,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,wCAAwC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kOAAkO;gBACxV,CAAC,CAAC,wLAAwL,CAC7L,CAAC;YACF,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACtC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC,CACF,CAAC;AACJ,CAAC"}

package/dist/tools/detached-dom.d.ts

@@ -8,5 +8,7 @@
  * @oncall memory_lab
  */
 import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+import type { IHeapNode } from '@memlab/core';
+export declare function getFirstNonFrameworkRetainer(node: IHeapNode): string;
 export declare function registerDetachedDom(server: McpServer): void;
 //# sourceMappingURL=detached-dom.d.ts.map

package/dist/tools/detached-dom.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"detached-dom.d.ts","sourceRoot":"","sources":["../../src/tools/detached-dom.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AA4EvE,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CAoM3D"}
+{"version":3,"file":"detached-dom.d.ts","sourceRoot":"","sources":["../../src/tools/detached-dom.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAGvE,OAAO,KAAK,EAAC,SAAS,EAA2B,MAAM,cAAc,CAAC;AAgGtE,wBAAgB,4BAA4B,CAAC,IAAI,EAAE,SAAS,GAAG,MAAM,CAmCpE;AAuGD,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CA2X3D"}