@memlab/mcp-server 2.18.1 → 2.52.0

package/dist/tools/dominator-attribution.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dominator-attribution.d.ts","sourceRoot":"","sources":["../../src/tools/dominator-attribution.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAuCvE,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CAwNpE"}

package/dist/tools/dominator-attribution.js

@@ -0,0 +1,189 @@
+/**
+ * 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 memlabCore from '@memlab/core';
+import { z } from 'zod';
+import { getSnapshot } from '../heap-state.js';
+import { boundedDominatorRetainedSize, errorResult, formatBytes, formatNumber, markdownTable, toolResult, truncateNodeName, } from '../utils.js';
+import { makeMembershipTest, parsePopulation } from './population-diff.js';
+const { NumericSet } = memlabCore;
+// Bound on the upward walk from a population member to a candidate, mirroring
+// `boundedDominatorRetainedSize`. A member whose walk truncates is reported
+// unattributed rather than guessed at.
+const MAX_HOPS = 500;
+export function registerDominatorAttribution(server) {
+    server.tool('memlab_dominator_attribution', 'Given several candidate retainers, measure how much of a population each one actually DOMINATES — i.e. what would really be freed by releasing it. Answers "which of these is the amplifier?" with a number instead of a plausible story. ' +
+        'Each population member is walked up the dominator tree to the first candidate above it, so every member is attributed to exactly one candidate and the shares cannot double-count. Members that reach the root without passing any candidate are reported as an explicit unattributed remainder — those are held through paths none of the candidates control. ' +
+        'When one candidate sits above another, a second column reports what the outer one dominates at any depth, so an ancestor is never printed as holding nothing merely because a nested candidate took its members. ' +
+        'A candidate that comes back with ZERO is the useful result: it refutes a hypothesis that named it. Measured example: for 4,541 detached nodes the split was activeElement 3,675 / activeElementInst 0 / lastSelection 18 / 848 unattributed, which killed the "the React fiber is the amplifier" theory outright. ' +
+        'Sizes are dominator-deduped (a nested member is not counted again under its ancestor), so the per-candidate figures are additive.', {
+        node_ids: z
+            .array(z.number())
+            .describe('Candidate retainer node ids, from the CURRENT snapshot (ids are per-capture). Typically the objects a hypothesis names — e.g. the ids behind the top rows of memlab_detached_dom group_by:"dominator", or the properties of one suspect object.'),
+        population: z
+            .string()
+            .optional()
+            .default('detached')
+            .describe('What to attribute: "detached" (default), "class:<ClassName>", "shape:prop1,prop2", or "all" (every node in the heap — expensive, and the totals become the whole heap).'),
+        limit: z
+            .number()
+            .optional()
+            .default(30)
+            .describe('Maximum candidate rows to print (default 30).'),
+    }, async ({ node_ids, population, limit }) => {
+        try {
+            if (node_ids.length === 0) {
+                return errorResult('node_ids is empty — pass the candidate retainers to compare.');
+            }
+            const snapshot = getSnapshot();
+            const candidates = new Map();
+            const missing = [];
+            for (const id of node_ids) {
+                const node = snapshot.getNodeById(id);
+                if (!node) {
+                    missing.push(id);
+                    continue;
+                }
+                candidates.set(id, {
+                    id,
+                    label: truncateNodeName(node.name, node.type, node.self_size, 48),
+                    ownRetained: node.retainedSize,
+                    memberCount: 0,
+                    memberSelf: 0,
+                    memberIds: [],
+                    totalCount: 0,
+                    cededCount: 0,
+                });
+            }
+            if (candidates.size === 0) {
+                return errorResult(`None of the ${node_ids.length} node id(s) exist in the current snapshot (ids are only valid within the snapshot they were read from): ${missing.join(', ')}.`);
+            }
+            const isMember = population.trim() === 'all'
+                ? (node) => node.id > 3
+                : makeMembershipTest(parsePopulation(population));
+            let total = 0;
+            let totalSelf = 0;
+            let unattributed = 0;
+            let unattributedSelf = 0;
+            let truncatedWalks = 0;
+            snapshot.nodes.forEach(node => {
+                if (!isMember(node))
+                    return;
+                total++;
+                totalSelf += node.self_size;
+                // A candidate that is itself in the population is attributed to
+                // itself: it dominates itself, and excluding it would understate a
+                // container that IS part of what leaked.
+                let cur = candidates.has(node.id)
+                    ? node
+                    : (node.dominatorNode ?? null);
+                let hops = 0;
+                let hit;
+                // The walk does NOT stop at the first candidate. Stopping there
+                // reports an ancestor candidate as dominating nothing whenever a
+                // second candidate happens to sit between it and the members — which
+                // reads as "this object holds none of the leak" when the truth is the
+                // opposite. Nearest-wins still decides the exclusive attribution; the
+                // rest of the chain is recorded as containment.
+                while (cur) {
+                    const c = candidates.get(cur.id);
+                    if (c) {
+                        c.totalCount++;
+                        if (hit === undefined)
+                            hit = c;
+                        else
+                            c.cededCount++;
+                    }
+                    if (hops++ >= MAX_HOPS) {
+                        if (hit === undefined)
+                            truncatedWalks++;
+                        break;
+                    }
+                    const next = cur.dominatorNode ?? null;
+                    if (!next || next.id === cur.id)
+                        break;
+                    cur = next;
+                }
+                if (hit) {
+                    hit.memberCount++;
+                    hit.memberSelf += node.self_size;
+                    hit.memberIds.push(node.id);
+                }
+                else {
+                    unattributed++;
+                    unattributedSelf += node.self_size;
+                }
+            });
+            if (total === 0) {
+                return toolResult(`No nodes match population \`${population}\` in this snapshot — nothing to attribute.`);
+            }
+            const rows = [...candidates.values()].sort((a, b) => b.memberCount - a.memberCount || b.totalCount - a.totalCount);
+            const shown = rows.slice(0, limit);
+            const reclaimable = new Map();
+            for (const c of shown) {
+                reclaimable.set(c.id, c.memberIds.length > 0
+                    ? boundedDominatorRetainedSize(new NumericSet(c.memberIds), snapshot)
+                    : { retained: 0, exact: true });
+            }
+            const pct = (n) => total > 0 ? `${((n / total) * 100).toFixed(1)}%` : '-';
+            const lines = [
+                `## Dominator attribution of \`${population}\` across ${formatNumber(candidates.size)} candidate(s)`,
+                '',
+                `Population: ${formatNumber(total)} node(s), ${formatBytes(totalSelf)} self size.`,
+                '',
+                markdownTable([
+                    'Candidate',
+                    'Class',
+                    'Attributed',
+                    '% of pop.',
+                    'Dominates (any depth)',
+                    'Reclaimable (deduped)',
+                    'Candidate retains',
+                ], shown.map(c => {
+                    const r = reclaimable.get(c.id);
+                    return [
+                        `@${c.id}`,
+                        c.label,
+                        formatNumber(c.memberCount),
+                        pct(c.memberCount),
+                        c.cededCount > 0
+                            ? `${formatNumber(c.totalCount)} (${formatNumber(c.cededCount)} to a nested candidate)`
+                            : formatNumber(c.totalCount),
+                        c.memberCount === 0
+                            ? '—'
+                            : `${formatBytes(r?.retained ?? 0)}${r?.exact === false ? ' (upper bound)' : ''}`,
+                        formatBytes(c.ownRetained),
+                    ];
+                }), new Set([2, 3, 4, 5, 6])),
+                '',
+                `- **Unattributed:** ${formatNumber(unattributed)} (${pct(unattributed)}), ${formatBytes(unattributedSelf)} self — reached the root without passing any candidate, so no candidate here frees them.`,
+            ];
+            if (rows.length > shown.length) {
+                lines.push(`- ${formatNumber(rows.length - shown.length)} further candidate(s) not shown (raise \`limit\`).`);
+            }
+            if (truncatedWalks > 0) {
+                lines.push(`- ⚠ ${formatNumber(truncatedWalks)} member(s) hit the ${MAX_HOPS}-hop walk cap and were counted as unattributed. Their true owner may be a candidate deeper up the chain; treat the unattributed figure as an upper bound.`);
+            }
+            const zero = shown.filter(c => c.totalCount === 0);
+            if (zero.length > 0) {
+                lines.push('', `⛔ **${formatNumber(zero.length)} candidate(s) dominate NOTHING in this population, at any depth** (${zero.map(c => `@${c.id} ${c.label}`).join(', ')}). Releasing them frees none of it — any hypothesis that names one of them as the amplifier is refuted by this measurement, not merely unsupported.`);
+            }
+            const nested = shown.filter(c => c.cededCount > 0);
+            if (nested.length > 0) {
+                lines.push('', `ℹ ${formatNumber(nested.length)} candidate(s) are ANCESTORS of another candidate (${nested.map(c => `@${c.id}`).join(', ')}), so members below the inner one are attributed there. Read their **Attributed** column as "what this object holds that the nested candidate does not" — a low value there with a high **Dominates** does not mean the object is innocent, it means the nested candidate is the tighter fix.`);
+            }
+            lines.push('', "_**Attributed** is by NEAREST candidate in the dominator tree, so each member counts once and the column sums to the population minus the unattributed remainder. **Dominates (any depth)** counts every member below the candidate and therefore double-counts across nested candidates — never sum it. **Reclaimable** is dominator-deduped over the attributed members — the bytes actually released — while **Candidate retains** is the candidate's entire retained size, which also covers everything it holds outside this population._");
+            return toolResult(lines.join('\n'));
+        }
+        catch (err) {
+            return errorResult(err);
+        }
+    });
+}
+//# sourceMappingURL=dominator-attribution.js.map

package/dist/tools/dominator-attribution.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dominator-attribution.js","sourceRoot":"","sources":["../../src/tools/dominator-attribution.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,UAAU,MAAM,cAAc,CAAC;AACtC,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AACtB,OAAO,EAAC,WAAW,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EACL,4BAA4B,EAC5B,WAAW,EACX,WAAW,EACX,YAAY,EACZ,aAAa,EACb,UAAU,EACV,gBAAgB,GACjB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAC,kBAAkB,EAAE,eAAe,EAAC,MAAM,sBAAsB,CAAC;AAEzE,MAAM,EAAC,UAAU,EAAC,GAAG,UAAU,CAAC;AAEhC,8EAA8E;AAC9E,4EAA4E;AAC5E,uCAAuC;AACvC,MAAM,QAAQ,GAAG,GAAG,CAAC;AAmBrB,MAAM,UAAU,4BAA4B,CAAC,MAAiB;IAC5D,MAAM,CAAC,IAAI,CACT,8BAA8B,EAC9B,4OAA4O;QAC1O,iWAAiW;QACjW,mNAAmN;QACnN,oTAAoT;QACpT,mIAAmI,EACrI;QACE,QAAQ,EAAE,CAAC;aACR,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,QAAQ,CACP,iPAAiP,CAClP;QACH,UAAU,EAAE,CAAC;aACV,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,UAAU,CAAC;aACnB,QAAQ,CACP,yKAAyK,CAC1K;QACH,KAAK,EAAE,CAAC;aACL,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CAAC,+CAA+C,CAAC;KAC7D,EACD,KAAK,EAAE,EAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAC,EAAE,EAAE;QACtC,IAAI,CAAC;YACH,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,WAAW,CAChB,8DAA8D,CAC/D,CAAC;YACJ,CAAC;YACD,MAAM,QAAQ,GAAG,WAAW,EAAE,CAAC;YAE/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAA0B,CAAC;YACrD,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE;oBACjB,EAAE;oBACF,KAAK,EAAE,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;oBACjE,WAAW,EAAE,IAAI,CAAC,YAAY;oBAC9B,WAAW,EAAE,CAAC;oBACd,UAAU,EAAE,CAAC;oBACb,SAAS,EAAE,EAAE;oBACb,UAAU,EAAE,CAAC;oBACb,UAAU,EAAE,CAAC;iBACd,CAAC,CAAC;YACL,CAAC;YACD,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,WAAW,CAChB,eAAe,QAAQ,CAAC,MAAM,2GAA2G,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAC/J,CAAC;YACJ,CAAC;YAED,MAAM,QAAQ,GACZ,UAAU,CAAC,IAAI,EAAE,KAAK,KAAK;gBACzB,CAAC,CAAC,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC;gBAClC,CAAC,CAAC,kBAAkB,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC;YAEtD,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,IAAI,cAAc,GAAG,CAAC,CAAC;YAEvB,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAAE,OAAO;gBAC5B,KAAK,EAAE,CAAC;gBACR,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;gBAC5B,gEAAgE;gBAChE,mEAAmE;gBACnE,yCAAyC;gBACzC,IAAI,GAAG,GAAqB,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjD,CAAC,CAAC,IAAI;oBACN,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC;gBACjC,IAAI,IAAI,GAAG,CAAC,CAAC;gBACb,IAAI,GAA+B,CAAC;gBACpC,gEAAgE;gBAChE,iEAAiE;gBACjE,qEAAqE;gBACrE,sEAAsE;gBACtE,sEAAsE;gBACtE,gDAAgD;gBAChD,OAAO,GAAG,EAAE,CAAC;oBACX,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACjC,IAAI,CAAC,EAAE,CAAC;wBACN,CAAC,CAAC,UAAU,EAAE,CAAC;wBACf,IAAI,GAAG,KAAK,SAAS;4BAAE,GAAG,GAAG,CAAC,CAAC;;4BAC1B,CAAC,CAAC,UAAU,EAAE,CAAC;oBACtB,CAAC;oBACD,IAAI,IAAI,EAAE,IAAI,QAAQ,EAAE,CAAC;wBACvB,IAAI,GAAG,KAAK,SAAS;4BAAE,cAAc,EAAE,CAAC;wBACxC,MAAM;oBACR,CAAC;oBACD,MAAM,IAAI,GAAqB,GAAG,CAAC,aAAa,IAAI,IAAI,CAAC;oBACzD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;wBAAE,MAAM;oBACvC,GAAG,GAAG,IAAI,CAAC;gBACb,CAAC;gBACD,IAAI,GAAG,EAAE,CAAC;oBACR,GAAG,CAAC,WAAW,EAAE,CAAC;oBAClB,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC,SAAS,CAAC;oBACjC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,YAAY,EAAE,CAAC;oBACf,gBAAgB,IAAI,IAAI,CAAC,SAAS,CAAC;gBACrC,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO,UAAU,CACf,+BAA+B,UAAU,6CAA6C,CACvF,CAAC;YACJ,CAAC;YAED,MAAM,IAAI,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACxC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAC/D,CAAC;YACF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACnC,MAAM,WAAW,GAAG,IAAI,GAAG,EAGxB,CAAC;YACJ,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,WAAW,CAAC,GAAG,CACb,CAAC,CAAC,EAAE,EACJ,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;oBACpB,CAAC,CAAC,4BAA4B,CAC1B,IAAI,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,EAC3B,QAAQ,CACT;oBACH,CAAC,CAAC,EAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAC,CAC/B,CAAC;YACJ,CAAC;YAED,MAAM,GAAG,GAAG,CAAC,CAAS,EAAU,EAAE,CAChC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAEzD,MAAM,KAAK,GAAa;gBACtB,iCAAiC,UAAU,aAAa,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe;gBACpG,EAAE;gBACF,eAAe,YAAY,CAAC,KAAK,CAAC,aAAa,WAAW,CAAC,SAAS,CAAC,aAAa;gBAClF,EAAE;gBACF,aAAa,CACX;oBACE,WAAW;oBACX,OAAO;oBACP,YAAY;oBACZ,WAAW;oBACX,uBAAuB;oBACvB,uBAAuB;oBACvB,mBAAmB;iBACpB,EACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;oBACZ,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAChC,OAAO;wBACL,IAAI,CAAC,CAAC,EAAE,EAAE;wBACV,CAAC,CAAC,KAAK;wBACP,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC;wBAC3B,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC;wBAClB,CAAC,CAAC,UAAU,GAAG,CAAC;4BACd,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,UAAU,CAAC,yBAAyB;4BACvF,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,UAAU,CAAC;wBAC9B,CAAC,CAAC,WAAW,KAAK,CAAC;4BACjB,CAAC,CAAC,GAAG;4BACL,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE;wBACnF,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;qBAC3B,CAAC;gBACJ,CAAC,CAAC,EACF,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CACzB;gBACD,EAAE;gBACF,uBAAuB,YAAY,CAAC,YAAY,CAAC,KAAK,GAAG,CAAC,YAAY,CAAC,MAAM,WAAW,CAAC,gBAAgB,CAAC,0FAA0F;aACrM,CAAC;YACF,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CACR,KAAK,YAAY,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,oDAAoD,CAClG,CAAC;YACJ,CAAC;YACD,IAAI,cAAc,GAAG,CAAC,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CACR,OAAO,YAAY,CAAC,cAAc,CAAC,sBAAsB,QAAQ,2JAA2J,CAC7N,CAAC;YACJ,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC;YACnD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CACR,EAAE,EACF,OAAO,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,sEAAsE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,qJAAqJ,CAC3S,CAAC;YACJ,CAAC;YACD,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,CACR,EAAE,EACF,KAAK,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,qDAAqD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,+RAA+R,CAC3Z,CAAC;YACJ,CAAC;YACD,KAAK,CAAC,IAAI,CACR,EAAE,EACF,ghBAAghB,CACjhB,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/dominator-chain.d.ts

@@ -0,0 +1,12 @@
+/**
+ * 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 type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+export declare function registerDominatorChain(server: McpServer): void;
+//# sourceMappingURL=dominator-chain.d.ts.map

package/dist/tools/dominator-chain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dominator-chain.d.ts","sourceRoot":"","sources":["../../src/tools/dominator-chain.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAavE,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CAgG9D"}

package/dist/tools/dominator-chain.js

@@ -0,0 +1,92 @@
+/**
+ * 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 { z } from 'zod';
+import { getSnapshot } from '../heap-state.js';
+import { isNodeWorthInspecting, truncateNodeName, errorResult, toolResult, formatBytes, formatNumber, } from '../utils.js';
+export function registerDominatorChain(server) {
+    server.tool('memlab_dominator_chain', 'Walk UPWARD through the immediate-dominator chain from a node to the GC root — the accountability chain of objects that each, if freed, would free the target. Every node on the chain exclusively dominates the target, so the nearest application-owned entry is the single owner to fix. This complements the DOWNWARD memlab_dominator_subtree / memlab_trace_dominators (what a node dominates) and the edge-based memlab_retainer_trace (a shortest reference path, which need not be a dominator). Mirrors the Chrome DevTools "Retained by / dominators" chain. Each step shows retained size and the fan-in (how much extra memory the next dominator is accountable for).', {
+        node_id: z
+            .number()
+            .describe('The numeric ID of the heap node to trace upward from'),
+        max_depth: z
+            .number()
+            .optional()
+            .default(30)
+            .describe('Maximum number of dominator hops to climb (default 30)'),
+    }, async ({ node_id, max_depth }) => {
+        try {
+            const snapshot = getSnapshot();
+            const targetNode = snapshot.getNodeById(node_id);
+            if (!targetNode) {
+                return errorResult(`Node with id ${node_id} not found`);
+            }
+            // Climb immediate dominators until the GC root (which dominates itself)
+            // or a depth/cycle limit is hit.
+            const chain = [targetNode];
+            const visited = new Set([targetNode.id]);
+            let current = targetNode;
+            let reachedRoot = false;
+            while (chain.length <= max_depth) {
+                const dom = current.dominatorNode;
+                if (!dom || dom.id === current.id) {
+                    reachedRoot = true;
+                    break;
+                }
+                if (visited.has(dom.id))
+                    break;
+                visited.add(dom.id);
+                chain.push(dom);
+                current = dom;
+            }
+            // The nearest dominator ABOVE the target that is a real, inspectable
+            // app object — the accountable owner to fix.
+            const owner = chain
+                .slice(1)
+                .find(n => isNodeWorthInspecting(n) && n.name !== '(GC roots)');
+            const lines = [
+                `## Dominator chain for @${targetNode.id} (${truncateNodeName(targetNode.name, targetNode.type, targetNode.self_size, 60)})`,
+                '',
+                `Retained ${formatBytes(targetNode.retainedSize)}. Climbing ${chain.length - 1} immediate dominator(s) toward the GC root${reachedRoot ? '' : ` (stopped at max_depth ${max_depth})`}.`,
+                '',
+            ];
+            for (let i = 0; i < chain.length; i++) {
+                const n = chain[i];
+                const indent = '  '.repeat(i);
+                const name = truncateNodeName(n.name, n.type, n.self_size, 80);
+                // Fan-in: how much more the next dominator up is accountable for than
+                // this node — i.e. what else it holds besides this subtree.
+                let fanIn = '';
+                if (i + 1 < chain.length) {
+                    const delta = chain[i + 1].retainedSize - n.retainedSize;
+                    if (delta > 0)
+                        fanIn = ` — dominator holds +${formatBytes(delta)} beyond this`;
+                }
+                const marker = i === 0 ? 'target' : `↑ dom ${i}`;
+                const ownerTag = owner && n.id === owner.id ? ' ← nearest app owner' : '';
+                lines.push(`${indent}[${marker}] @${n.id} ${name} (retained ${formatBytes(n.retainedSize)})${fanIn}${ownerTag}`);
+            }
+            lines.push('');
+            if (reachedRoot) {
+                lines.push('_(reached GC root — this is the full accountability chain)_');
+            }
+            else {
+                lines.push(`_(stopped at max_depth ${max_depth}; pass a larger max_depth to reach the root)_`);
+            }
+            if (owner) {
+                lines.push('', `**Nearest app owner:** @${owner.id} ${truncateNodeName(owner.name, owner.type, owner.self_size, 60)} — retains ${formatBytes(owner.retainedSize)} (${formatNumber(owner.retainedSize)} bytes). Fixing this object frees the target.`);
+            }
+            return toolResult(lines.join('\n'));
+        }
+        catch (err) {
+            return errorResult(err);
+        }
+    });
+}
+//# sourceMappingURL=dominator-chain.js.map

package/dist/tools/dominator-chain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dominator-chain.js","sourceRoot":"","sources":["../../src/tools/dominator-chain.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AACtB,OAAO,EAAC,WAAW,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,WAAW,EACX,UAAU,EACV,WAAW,EACX,YAAY,GACb,MAAM,aAAa,CAAC;AAErB,MAAM,UAAU,sBAAsB,CAAC,MAAiB;IACtD,MAAM,CAAC,IAAI,CACT,wBAAwB,EACxB,qpBAAqpB,EACrpB;QACE,OAAO,EAAE,CAAC;aACP,MAAM,EAAE;aACR,QAAQ,CAAC,sDAAsD,CAAC;QACnE,SAAS,EAAE,CAAC;aACT,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CAAC,wDAAwD,CAAC;KACtE,EACD,KAAK,EAAE,EAAC,OAAO,EAAE,SAAS,EAAC,EAAE,EAAE;QAC7B,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,OAAO,WAAW,CAAC,gBAAgB,OAAO,YAAY,CAAC,CAAC;YAC1D,CAAC;YAED,wEAAwE;YACxE,iCAAiC;YACjC,MAAM,KAAK,GAAgB,CAAC,UAAU,CAAC,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;YACjD,IAAI,OAAO,GAAc,UAAU,CAAC;YACpC,IAAI,WAAW,GAAG,KAAK,CAAC;YACxB,OAAO,KAAK,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,GAAG,GAAG,OAAO,CAAC,aAAa,CAAC;gBAClC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,KAAK,OAAO,CAAC,EAAE,EAAE,CAAC;oBAClC,WAAW,GAAG,IAAI,CAAC;oBACnB,MAAM;gBACR,CAAC;gBACD,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,MAAM;gBAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAChB,OAAO,GAAG,GAAG,CAAC;YAChB,CAAC;YAED,qEAAqE;YACrE,6CAA6C;YAC7C,MAAM,KAAK,GAAG,KAAK;iBAChB,KAAK,CAAC,CAAC,CAAC;iBACR,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YAElE,MAAM,KAAK,GAAa;gBACtB,2BAA2B,UAAU,CAAC,EAAE,KAAK,gBAAgB,CAAC,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,GAAG;gBAC5H,EAAE;gBACF,YAAY,WAAW,CAAC,UAAU,CAAC,YAAY,CAAC,cAAc,KAAK,CAAC,MAAM,GAAG,CAAC,6CAA6C,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,0BAA0B,SAAS,GAAG,GAAG;gBACvL,EAAE;aACH,CAAC;YAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC9B,MAAM,IAAI,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;gBAC/D,sEAAsE;gBACtE,4DAA4D;gBAC5D,IAAI,KAAK,GAAG,EAAE,CAAC;gBACf,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;oBACzB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;oBACzD,IAAI,KAAK,GAAG,CAAC;wBACX,KAAK,GAAG,uBAAuB,WAAW,CAAC,KAAK,CAAC,cAAc,CAAC;gBACpE,CAAC;gBACD,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjD,MAAM,QAAQ,GACZ,KAAK,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3D,KAAK,CAAC,IAAI,CACR,GAAG,MAAM,IAAI,MAAM,MAAM,CAAC,CAAC,EAAE,IAAI,IAAI,cAAc,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CACrG,CAAC;YACJ,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,IAAI,WAAW,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,CACR,6DAA6D,CAC9D,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CACR,0BAA0B,SAAS,+CAA+C,CACnF,CAAC;YACJ,CAAC;YACD,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,IAAI,CACR,EAAE,EACF,2BAA2B,KAAK,CAAC,EAAE,IAAI,gBAAgB,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,cAAc,WAAW,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC,+CAA+C,CACtO,CAAC;YACJ,CAAC;YAED,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/duplicate-objects.d.ts

@@ -0,0 +1,12 @@
+/**
+ * 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 type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+export declare function registerDuplicateObjects(server: McpServer): void;
+//# sourceMappingURL=duplicate-objects.d.ts.map

package/dist/tools/duplicate-objects.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-objects.d.ts","sourceRoot":"","sources":["../../src/tools/duplicate-objects.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAkCvE,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CA6LhE"}

package/dist/tools/duplicate-objects.js

@@ -0,0 +1,172 @@
+/**
+ * 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 { z } from 'zod';
+import { getSnapshot } from '../heap-state.js';
+import { formatBytes, formatNumber, markdownTable, errorResult, toolResult, suggestionsSuppressed, objectContentSignature, IDENTITY_PROPS, } from '../utils.js';
+function readTypename(node) {
+    for (const edge of node.references) {
+        if (edge.type === 'property' &&
+            String(edge.name_or_index) === '__typename') {
+            const t = edge.toNode;
+            return t.isString ? (t.toStringNode()?.stringValue ?? null) : null;
+        }
+    }
+    return null;
+}
+export function registerDuplicateObjects(server) {
+    server.tool('memlab_duplicate_objects', 'Find structurally-identical DUPLICATE objects — instances that carry the same content repeated many times, which a class histogram or shape histogram cannot see (they group by class or by property-NAME set, not by VALUE). Groups object instances by a shallow content signature (sorted property names + each scalar value; object-valued props marked generically) and reports, per signature, the instance count and the reclaimable own-bytes of the redundant copies. ' +
+        'This surfaces "materialize a canonical/default record once", "share a frozen default", or "intern the object" wins — e.g. thousands of normalized store records that are all the same all-default spec. ' +
+        'Scope the scan with `class_name` (constructor, e.g. "Object") and/or `typename` (the `__typename` property value, e.g. "AdCreativeFeatureSpecAttachment") — for normalized GraphQL/Relay stores `typename` is usually what you want since every record is a generic `Object`. ' +
+        'Per-instance identity fields (id, __id, __ref, key, clientMutationId) are EXCLUDED from the signature by default so records that differ only by their data-id still collapse together (override with `ignore_properties`). ' +
+        'Caveat: numeric property VALUES are not recoverable from the heap-snapshot format, so a number field contributes only a generic marker — two objects differing only in a numeric field (SMI or double) hash to the same signature and are reported as duplicates. String, boolean, null and object-valued properties are compared (objects generically, so nested content is not).', {
+        class_name: z
+            .string()
+            .optional()
+            .describe('Restrict to objects with this constructor name (e.g. "Object"). Omit to scan every object-type node.'),
+        typename: z
+            .string()
+            .optional()
+            .describe('Restrict to objects whose `__typename` property equals this value (normalized GraphQL/Relay records). Combine with or instead of class_name.'),
+        min_count: z
+            .number()
+            .optional()
+            .default(50)
+            .describe('Only report signature groups with at least this many instances (default 50). Raise to focus on the most-duplicated content.'),
+        min_dup_ratio: z
+            .number()
+            .optional()
+            .describe('Only report signature groups whose instance count is at least this multiple of 1 distinct content (i.e. count ≥ min_dup_ratio). Optional extra filter on top of min_count.'),
+        limit: z
+            .number()
+            .optional()
+            .default(20)
+            .describe('Maximum number of signature groups to return (default 20).'),
+        max_string_len: z
+            .number()
+            .optional()
+            .default(40)
+            .describe('Cap on the length of string values folded into the signature (default 40). Two strings that differ only past this cap are treated as equal — lower it to be more lenient, raise it to be stricter.'),
+        ignore_properties: z
+            .array(z.string())
+            .optional()
+            .describe('Property names to EXCLUDE from the content signature — per-instance identity/unique fields (a data-id, a key) that would otherwise make every record look distinct and hide real duplicates. Defaults to id, __id, __ref, key, clientMutationId. Pass [] to include every property.'),
+    }, async ({ class_name, typename, min_count, min_dup_ratio, limit, max_string_len, ignore_properties, }) => {
+        try {
+            const snapshot = getSnapshot();
+            const ignoreProps = ignore_properties
+                ? new Set(ignore_properties)
+                : IDENTITY_PROPS;
+            const groups = new Map();
+            let scopeCount = 0;
+            let scopeSelf = 0;
+            snapshot.nodes.forEach((node) => {
+                if (node.type !== 'object')
+                    return;
+                if (node.id <= 3)
+                    return;
+                if (class_name && node.name !== class_name)
+                    return;
+                if (typename && readTypename(node) !== typename)
+                    return;
+                const sig = objectContentSignature(node, {
+                    maxStringLen: max_string_len,
+                    ignoreProps,
+                });
+                if (sig === '')
+                    return; // no own properties — nothing to dedupe on
+                scopeCount++;
+                scopeSelf += node.self_size;
+                const g = groups.get(sig);
+                if (g) {
+                    g.count++;
+                    g.totalSelf += node.self_size;
+                }
+                else {
+                    groups.set(sig, {
+                        count: 1,
+                        totalSelf: node.self_size,
+                        exampleId: node.id,
+                    });
+                }
+            });
+            if (scopeCount === 0) {
+                return toolResult('No matching objects found. Loosen `class_name` / `typename`, or check the value with `memlab_property_distribution(property:"__typename")` / `memlab_class_histogram`.');
+            }
+            const distinct = groups.size;
+            // Reclaimable = own-bytes of the redundant copies (all but one per
+            // signature) — what deduping/sharing a canonical instance would free.
+            // Shared child subtrees are NOT included (this is a lower bound on the
+            // structural win, an honest own-bytes figure).
+            let totalReclaimable = 0;
+            for (const g of groups.values()) {
+                totalReclaimable += g.totalSelf * ((g.count - 1) / g.count);
+            }
+            const ranked = [...groups.entries()]
+                .map(([sig, g]) => ({
+                sig,
+                ...g,
+                reclaimable: g.totalSelf * ((g.count - 1) / g.count),
+            }))
+                .filter(g => g.count >= min_count)
+                .filter(g => min_dup_ratio == null || g.count >= min_dup_ratio);
+            ranked.sort((a, b) => b.reclaimable - a.reclaimable);
+            const shown = ranked.slice(0, limit);
+            const scopeLabel = [
+                class_name ? `class \`${class_name}\`` : null,
+                typename ? `__typename \`${typename}\`` : null,
+            ]
+                .filter(Boolean)
+                .join(' + ') || 'all objects';
+            const lines = [
+                `## Duplicate objects — ${scopeLabel}`,
+                '',
+                `**${formatNumber(scopeCount)}** instances in scope collapse to **${formatNumber(distinct)}** distinct contents ` +
+                    `(dup ratio **${(scopeCount / Math.max(1, distinct)).toFixed(1)}×**). ` +
+                    `Reclaimable own-bytes if deduped to one-per-content: **~${formatBytes(totalReclaimable)}** ` +
+                    `of ${formatBytes(scopeSelf)} total self size.`,
+                '',
+            ];
+            if (shown.length === 0) {
+                lines.push(`No single content is shared by ≥ ${min_count} instances` +
+                    (min_dup_ratio != null ? ` (and ≥ ${min_dup_ratio}× dup)` : '') +
+                    '. The instances are structurally varied (real data), not duplicates. Lower `min_count` to see smaller groups.');
+                return toolResult(lines.join('\n'));
+            }
+            const headers = [
+                'Count',
+                'Self each',
+                'Reclaimable',
+                'Example',
+                'Signature',
+            ];
+            const rightCols = new Set([0, 1, 2]);
+            const rows = shown.map(g => {
+                const avg = g.totalSelf / g.count;
+                const sigShown = g.sig.length > 90 ? g.sig.slice(0, 90) + '…' : g.sig;
+                return [
+                    formatNumber(g.count),
+                    formatBytes(avg),
+                    formatBytes(g.reclaimable),
+                    `@${g.exampleId}`,
+                    sigShown,
+                ];
+            });
+            lines.push(markdownTable(headers, rows, rightCols));
+            if (!suggestionsSuppressed()) {
+                lines.push('', '**Suggested next steps:**', `- Inspect a duplicate: \`memlab_object_shape(${shown[0].exampleId})\``, `- Trace why they are retained: \`memlab_retainer_trace(${shown[0].exampleId})\``, '- If these are normalized store records, the fix is usually at the resolver/normalizer: return a shared canonical instance (or null) for all-default content instead of materializing one per key.');
+            }
+            return toolResult(lines.join('\n'));
+        }
+        catch (err) {
+            return errorResult(err);
+        }
+    });
+}
+//# sourceMappingURL=duplicate-objects.js.map

package/dist/tools/duplicate-objects.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-objects.js","sourceRoot":"","sources":["../../src/tools/duplicate-objects.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AACtB,OAAO,EAAC,WAAW,EAAC,MAAM,kBAAkB,CAAC;AAC7C,OAAO,EACL,WAAW,EACX,YAAY,EACZ,aAAa,EACb,WAAW,EACX,UAAU,EACV,qBAAqB,EACrB,sBAAsB,EACtB,cAAc,GACf,MAAM,aAAa,CAAC;AAQrB,SAAS,YAAY,CAAC,IAAe;IACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,IACE,IAAI,CAAC,IAAI,KAAK,UAAU;YACxB,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,YAAY,EAC3C,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACrE,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,MAAiB;IACxD,MAAM,CAAC,IAAI,CACT,0BAA0B,EAC1B,idAAid;QAC/c,0MAA0M;QAC1M,gRAAgR;QAChR,6NAA6N;QAC7N,oXAAoX,EACtX;QACE,UAAU,EAAE,CAAC;aACV,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,QAAQ,CACP,sGAAsG,CACvG;QACH,QAAQ,EAAE,CAAC;aACR,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,QAAQ,CACP,8IAA8I,CAC/I;QACH,SAAS,EAAE,CAAC;aACT,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CACP,6HAA6H,CAC9H;QACH,aAAa,EAAE,CAAC;aACb,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,QAAQ,CACP,4KAA4K,CAC7K;QACH,KAAK,EAAE,CAAC;aACL,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CAAC,4DAA4D,CAAC;QACzE,cAAc,EAAE,CAAC;aACd,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CACP,oMAAoM,CACrM;QACH,iBAAiB,EAAE,CAAC;aACjB,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;aACjB,QAAQ,EAAE;aACV,QAAQ,CACP,qRAAqR,CACtR;KACJ,EACD,KAAK,EAAE,EACL,UAAU,EACV,QAAQ,EACR,SAAS,EACT,aAAa,EACb,KAAK,EACL,cAAc,EACd,iBAAiB,GAClB,EAAE,EAAE;QACH,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC/B,MAAM,WAAW,GAAG,iBAAiB;gBACnC,CAAC,CAAC,IAAI,GAAG,CAAC,iBAAiB,CAAC;gBAC5B,CAAC,CAAC,cAAc,CAAC;YACnB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;YAC3C,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAe,EAAE,EAAE;gBACzC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;oBAAE,OAAO;gBACnC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC;oBAAE,OAAO;gBACzB,IAAI,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;oBAAE,OAAO;gBACnD,IAAI,QAAQ,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,QAAQ;oBAAE,OAAO;gBAExD,MAAM,GAAG,GAAG,sBAAsB,CAAC,IAAI,EAAE;oBACvC,YAAY,EAAE,cAAc;oBAC5B,WAAW;iBACZ,CAAC,CAAC;gBACH,IAAI,GAAG,KAAK,EAAE;oBAAE,OAAO,CAAC,2CAA2C;gBAEnE,UAAU,EAAE,CAAC;gBACb,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;gBAC5B,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,CAAC,EAAE,CAAC;oBACN,CAAC,CAAC,KAAK,EAAE,CAAC;oBACV,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;wBACd,KAAK,EAAE,CAAC;wBACR,SAAS,EAAE,IAAI,CAAC,SAAS;wBACzB,SAAS,EAAE,IAAI,CAAC,EAAE;qBACnB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;gBACrB,OAAO,UAAU,CACf,wKAAwK,CACzK,CAAC;YACJ,CAAC;YAED,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC;YAC7B,mEAAmE;YACnE,sEAAsE;YACtE,uEAAuE;YACvE,+CAA+C;YAC/C,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;gBAChC,gBAAgB,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC9D,CAAC;YAED,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;iBACjC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAClB,GAAG;gBACH,GAAG,CAAC;gBACJ,WAAW,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;aACrD,CAAC,CAAC;iBACF,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC;iBACjC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,IAAI,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,aAAa,CAAC,CAAC;YAClE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;YACrD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAErC,MAAM,UAAU,GACd;gBACE,UAAU,CAAC,CAAC,CAAC,WAAW,UAAU,IAAI,CAAC,CAAC,CAAC,IAAI;gBAC7C,QAAQ,CAAC,CAAC,CAAC,gBAAgB,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAI;aAC/C;iBACE,MAAM,CAAC,OAAO,CAAC;iBACf,IAAI,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC;YAElC,MAAM,KAAK,GAAa;gBACtB,0BAA0B,UAAU,EAAE;gBACtC,EAAE;gBACF,KAAK,YAAY,CAAC,UAAU,CAAC,uCAAuC,YAAY,CAAC,QAAQ,CAAC,uBAAuB;oBAC/G,gBAAgB,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ;oBACvE,2DAA2D,WAAW,CAAC,gBAAgB,CAAC,KAAK;oBAC7F,MAAM,WAAW,CAAC,SAAS,CAAC,mBAAmB;gBACjD,EAAE;aACH,CAAC;YAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CACR,oCAAoC,SAAS,YAAY;oBACvD,CAAC,aAAa,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW,aAAa,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/D,+GAA+G,CAClH,CAAC;gBACF,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACtC,CAAC;YAED,MAAM,OAAO,GAAG;gBACd,OAAO;gBACP,WAAW;gBACX,aAAa;gBACb,SAAS;gBACT,WAAW;aACZ,CAAC;YACF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACzB,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC;gBAClC,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBACtE,OAAO;oBACL,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;oBACrB,WAAW,CAAC,GAAG,CAAC;oBAChB,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;oBAC1B,IAAI,CAAC,CAAC,SAAS,EAAE;oBACjB,QAAQ;iBACT,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;YAEpD,IAAI,CAAC,qBAAqB,EAAE,EAAE,CAAC;gBAC7B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,2BAA2B,EAC3B,gDAAgD,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,EACvE,0DAA0D,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,KAAK,EACjF,oMAAoM,CACrM,CAAC;YACJ,CAAC;YAED,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/duplicated-strings.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"duplicated-strings.d.ts","sourceRoot":"","sources":["../../src/tools/duplicated-strings.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAUvE,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CAgOjE"}
+{"version":3,"file":"duplicated-strings.d.ts","sourceRoot":"","sources":["../../src/tools/duplicated-strings.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAavE,wBAAgB,yBAAyB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CA6OjE"}