@memlab/mcp-server 2.18.1 → 2.52.0

package/dist/tools/population-diff.d.ts

@@ -0,0 +1,57 @@
+/**
+ * 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 { IHeapNode } from '@memlab/core';
+import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+/**
+ * A population selector: which nodes the comparison is about.
+ *
+ * `detached` is the motivating case — see the tool description — but the same
+ * question ("is this the SAME set, or a set of the same size?") applies to any
+ * population a hunt is tracking.
+ */
+export type Population = {
+    kind: 'detached';
+} | {
+    kind: 'class';
+    name: string;
+} | {
+    kind: 'shape';
+    props: string[];
+};
+export declare function parsePopulation(spec: string): Population;
+/**
+ * Membership test for a population selector. Shared with
+ * `memlab_dominator_attribution` so the two tools cannot drift on what, for
+ * example, "detached" means — a difference there would make their numbers
+ * silently incomparable.
+ */
+export declare function makeMembershipTest(pop: Population): (node: IHeapNode) => boolean;
+interface Bucket {
+    count: number;
+    selfSize: number;
+}
+interface Census {
+    buckets: Map<string, Bucket>;
+    total: number;
+    totalSelf: number;
+}
+/**
+ * The verdict this tool exists to produce. Equal totals have three distinct
+ * causes and they call for opposite conclusions, so the headline states which
+ * one holds rather than leaving the reader to infer it from the table.
+ */
+export declare function summarizeComposition(a: Census, b: Census): {
+    headline: string;
+    added: number;
+    removed: number;
+};
+export declare function registerPopulationDiff(server: McpServer): void;
+export {};
+//# sourceMappingURL=population-diff.d.ts.map

package/dist/tools/population-diff.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"population-diff.d.ts","sourceRoot":"","sources":["../../src/tools/population-diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAgB,MAAM,cAAc,CAAC;AAC3D,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AAmBvE;;;;;;GAMG;AACH,MAAM,MAAM,UAAU,GAClB;IAAC,IAAI,EAAE,UAAU,CAAA;CAAC,GAClB;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAC,GAC7B;IAAC,IAAI,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAA;CAAC,CAAC;AAErC,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAyBxD;AAOD;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAChC,GAAG,EAAE,UAAU,GACd,CAAC,IAAI,EAAE,SAAS,KAAK,OAAO,CAyB9B;AA8ED,UAAU,MAAM;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,UAAU,MAAM;IACd,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;CACnB;AA0BD;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACR;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAC,CA6BpD;AAED,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CAiN9D"}

package/dist/tools/population-diff.js

@@ -0,0 +1,338 @@
+/**
+ * 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 { getCurrentHandle, getMetadataByHandle, getSnapshotByHandle, listSnapshots, } from '../heap-state.js';
+import { errorResult, formatBytes, formatNumber, isNodeWorthInspecting, markdownTable, toolResult, truncateNodeName, } from '../utils.js';
+import { normalizeClassName } from './sequence-analysis.js';
+export function parsePopulation(spec) {
+    const trimmed = spec.trim();
+    if (trimmed === 'detached')
+        return { kind: 'detached' };
+    if (trimmed.startsWith('class:')) {
+        const name = trimmed.slice('class:'.length).trim();
+        if (name.length === 0) {
+            throw new Error('Empty class name in population "class:".');
+        }
+        return { kind: 'class', name };
+    }
+    if (trimmed.startsWith('shape:')) {
+        const props = trimmed
+            .slice('shape:'.length)
+            .replace(/^\[|\]$/g, '')
+            .split(',')
+            .map(s => s.trim().replace(/^["']|["']$/g, ''))
+            .filter(s => s.length > 0);
+        if (props.length === 0) {
+            throw new Error('Empty property list in population "shape:".');
+        }
+        return { kind: 'shape', props };
+    }
+    throw new Error(`Unrecognized population "${spec}". Use "detached", "class:<ClassName>", or "shape:prop1,prop2".`);
+}
+function isDetached(node) {
+    if (node.id <= 3)
+        return false;
+    return node.is_detached || node.name.startsWith('Detached ');
+}
+/**
+ * Membership test for a population selector. Shared with
+ * `memlab_dominator_attribution` so the two tools cannot drift on what, for
+ * example, "detached" means — a difference there would make their numbers
+ * silently incomparable.
+ */
+export function makeMembershipTest(pop) {
+    switch (pop.kind) {
+        case 'detached':
+            return isDetached;
+        case 'class': {
+            const want = pop.name;
+            return (node) => node.id > 3 && node.name === want;
+        }
+        case 'shape': {
+            const want = pop.props;
+            return (node) => {
+                if (node.id <= 3 || node.type !== 'object')
+                    return false;
+                let hits = 0;
+                const seen = new Set();
+                for (const edge of node.references) {
+                    if (edge.type !== 'property')
+                        continue;
+                    const name = String(edge.name_or_index);
+                    if (!want.includes(name) || seen.has(name))
+                        continue;
+                    seen.add(name);
+                    if (++hits === want.length)
+                        return true;
+                }
+                return false;
+            };
+        }
+    }
+}
+// Bound on the upward dominator walk when grouping by owner, mirroring
+// `boundedDominatorRetainedSize`. A truncated walk yields '(no owner found)'
+// rather than a wrong owner.
+const MAX_OWNER_HOPS = 500;
+function domTagKey(name) {
+    const detached = name.startsWith('Detached ') ? 'Detached ' : '';
+    const bare = detached ? name.slice(9) : name;
+    const tag = bare.match(/^<(\w+)/)?.[1];
+    return tag ? `${detached}<${tag}>` : normalizeClassName(name);
+}
+function ownerKey(node) {
+    let cur = node.dominatorNode ?? null;
+    let hops = 0;
+    while (cur && hops++ < MAX_OWNER_HOPS) {
+        if (cur.id === node.id)
+            break;
+        if (cur.name !== '(GC roots)' &&
+            cur.id > 3 &&
+            isNodeWorthInspecting(cur) &&
+            !isDetached(cur)) {
+            // Deliberately NOT keyed by node id: ids are per-capture, so an id key
+            // would make every bucket "added" in the target and "removed" in the
+            // baseline. The owner's CLASS is what is comparable across snapshots.
+            return normalizeClassName(truncateNodeName(cur.name, cur.type, cur.self_size, 60));
+        }
+        const next = cur.dominatorNode ?? null;
+        if (!next || next.id === cur.id)
+            break;
+        cur = next;
+    }
+    return '(no owner — dominated by the GC root)';
+}
+function shapeKey(node) {
+    const props = [];
+    for (const edge of node.references) {
+        if (edge.type !== 'property')
+            continue;
+        const name = String(edge.name_or_index);
+        if (name === '__proto__')
+            continue;
+        props.push(name);
+    }
+    if (props.length === 0)
+        return '(no properties)';
+    props.sort();
+    const joined = props.join(',');
+    return joined.length > 80 ? joined.slice(0, 77) + '…' : joined;
+}
+function makeKeyFn(groupBy, pop) {
+    switch (groupBy) {
+        case 'owner':
+            return ownerKey;
+        case 'type':
+            return (node) => node.type;
+        case 'shape':
+            return shapeKey;
+        case 'class':
+            return pop.kind === 'detached'
+                ? (node) => domTagKey(node.name)
+                : (node) => normalizeClassName(node.name);
+    }
+}
+function census(snapshot, isMember, keyOf) {
+    const buckets = new Map();
+    let total = 0;
+    let totalSelf = 0;
+    snapshot.nodes.forEach(node => {
+        if (!isMember(node))
+            return;
+        total++;
+        totalSelf += node.self_size;
+        const key = keyOf(node);
+        const b = buckets.get(key);
+        if (b) {
+            b.count++;
+            b.selfSize += node.self_size;
+        }
+        else {
+            buckets.set(key, { count: 1, selfSize: node.self_size });
+        }
+    });
+    return { buckets, total, totalSelf };
+}
+/**
+ * The verdict this tool exists to produce. Equal totals have three distinct
+ * causes and they call for opposite conclusions, so the headline states which
+ * one holds rather than leaving the reader to infer it from the table.
+ */
+export function summarizeComposition(a, b) {
+    let added = 0;
+    let removed = 0;
+    for (const key of new Set([...a.buckets.keys(), ...b.buckets.keys()])) {
+        const d = (b.buckets.get(key)?.count ?? 0) - (a.buckets.get(key)?.count ?? 0);
+        if (d > 0)
+            added += d;
+        else
+            removed += -d;
+    }
+    const netTotal = b.total - a.total;
+    if (added === 0 && removed === 0) {
+        return {
+            headline: `✅ **Identical composition** — every one of the ${formatNumber(a.buckets.size)} bucket(s) has the same count at both ends. The population did not just stay the same SIZE, it stayed the same population.`,
+            added,
+            removed,
+        };
+    }
+    if (netTotal === 0) {
+        return {
+            headline: `⚠ **Equal totals, DIFFERENT composition** — ${formatNumber(added)} member(s) appeared and ${formatNumber(removed)} disappeared, and they cancel out. Do NOT read the equal total as "nothing changed": the round stranded and freed in equal measure, which is exactly what a leak paired with an eviction looks like.`,
+            added,
+            removed,
+        };
+    }
+    return {
+        headline: `Population ${netTotal > 0 ? 'grew' : 'shrank'} by **${formatNumber(Math.abs(netTotal))}** (${formatNumber(a.total)} → ${formatNumber(b.total)}); ${formatNumber(added)} appeared, ${formatNumber(removed)} disappeared.`,
+        added,
+        removed,
+    };
+}
+export function registerPopulationDiff(server) {
+    server.tool('memlab_population_diff', 'Compare the COMPOSITION of a population between two loaded snapshots, not just its size. Equal totals are not identity: a round that strands N objects and frees N others reports the same count at both ends, and reading that as "nothing leaked" is a wrong verdict a count comparison cannot catch. This breaks the population into buckets (class, dominator-owner class, node type, or object shape), reports both ends per bucket, and states which of the three cases holds — identical composition / equal totals but different composition / net growth. ' +
+        'Populations: "detached" (all detached DOM), "class:<ClassName>", or "shape:prop1,prop2" (objects carrying all of those properties). ' +
+        'Buckets are keyed by CLASS, never by node id — ids are per-capture, so an id-keyed comparison reports every member as both added and removed. Both snapshots must be resident: load them with keep_previous:true.', {
+        baseline_handle: z
+            .string()
+            .describe('Handle of the earlier snapshot (memlab_snapshots lists them).'),
+        target_handle: z
+            .string()
+            .optional()
+            .describe('Handle of the later snapshot. Defaults to the current snapshot.'),
+        population: z
+            .string()
+            .describe('Which nodes to compare: "detached", "class:<ClassName>", or "shape:prop1,prop2".'),
+        group_by: z
+            .enum(['class', 'owner', 'type', 'shape'])
+            .optional()
+            .describe('Composition axis. "class" = the member\'s own class (for detached DOM, its element tag); "owner" = the class of its nearest accountable dominator (needs a full, non-light load); "type" = heap node type; "shape" = its sorted property-name set. Defaults to "owner" for a class: population (the members already share a class, so their own name carries no information) and "class" otherwise.'),
+        limit: z
+            .number()
+            .optional()
+            .default(25)
+            .describe('Maximum buckets to show in the table (default 25).'),
+        min_delta: z
+            .number()
+            .optional()
+            .default(0)
+            .describe('Hide buckets whose count moved by less than this (default 0: show everything, since an unchanged bucket is itself evidence).'),
+    }, async ({ baseline_handle, target_handle, population, group_by, limit, min_delta, }) => {
+        try {
+            const pop = parsePopulation(population);
+            const targetHandle = target_handle ?? getCurrentHandle();
+            if (targetHandle == null) {
+                return errorResult('No current snapshot; pass target_handle.');
+            }
+            if (targetHandle === baseline_handle) {
+                return errorResult('baseline_handle and target_handle are the same snapshot.');
+            }
+            const baseline = getSnapshotByHandle(baseline_handle);
+            const target = getSnapshotByHandle(targetHandle);
+            if (baseline == null || target == null) {
+                const available = listSnapshots()
+                    .map(m => m.handle)
+                    .join(', ');
+                return errorResult(`Both snapshots must be resident. Missing: ${baseline == null ? baseline_handle : targetHandle}. Resident: ${available || '(none)'}. Load with memlab_load_snapshot({file_path, keep_previous: true}).`);
+            }
+            const groupBy = group_by ?? (pop.kind === 'class' ? 'owner' : 'class');
+            if (groupBy === 'owner') {
+                for (const h of [baseline_handle, targetHandle]) {
+                    if (getMetadataByHandle(h)?.light) {
+                        return errorResult(`Snapshot "${h}" was loaded in LIGHT mode and has no dominator tree, which group_by:"owner" requires. Reload it without light, or group by "class" / "type" / "shape".`);
+                    }
+                }
+            }
+            const isMember = makeMembershipTest(pop);
+            const keyOf = makeKeyFn(groupBy, pop);
+            const a = census(baseline, isMember, keyOf);
+            const b = census(target, isMember, keyOf);
+            if (a.total === 0 && b.total === 0) {
+                return toolResult(`No nodes match population \`${population}\` in either snapshot — nothing to compare. Check the class name with \`memlab_class_histogram\`, or the property names with \`memlab_shape_histogram\`.`);
+            }
+            const { headline, added, removed } = summarizeComposition(a, b);
+            const keys = new Set([...a.buckets.keys(), ...b.buckets.keys()]);
+            const rows = [];
+            for (const key of keys) {
+                const before = a.buckets.get(key);
+                const after = b.buckets.get(key);
+                const delta = (after?.count ?? 0) - (before?.count ?? 0);
+                if (Math.abs(delta) < min_delta)
+                    continue;
+                rows.push({
+                    key,
+                    before: before?.count ?? 0,
+                    after: after?.count ?? 0,
+                    delta,
+                    bytesDelta: (after?.selfSize ?? 0) - (before?.selfSize ?? 0),
+                });
+            }
+            // Movers first (largest |Δ|), then the stable buckets by size — the
+            // stable ones are the evidence behind an "identical composition"
+            // verdict, so they are shown, just not ahead of the changes.
+            rows.sort((x, y) => Math.abs(y.delta) - Math.abs(x.delta) || y.after - x.after);
+            const shown = rows.slice(0, limit);
+            const addedKeys = [...keys].filter(k => !a.buckets.has(k) && b.buckets.has(k));
+            const removedKeys = [...keys].filter(k => a.buckets.has(k) && !b.buckets.has(k));
+            const axisLabel = groupBy === 'owner'
+                ? 'Owner (dominator class)'
+                : groupBy === 'shape'
+                    ? 'Shape (property names)'
+                    : groupBy === 'type'
+                        ? 'Node type'
+                        : 'Class';
+            const lines = [
+                `## Population diff \`${population}\` by ${groupBy}: "${baseline_handle}" → "${targetHandle}"`,
+                '',
+                `Members: ${formatNumber(a.total)} (${formatBytes(a.totalSelf)} self) → ${formatNumber(b.total)} (${formatBytes(b.totalSelf)} self), across ${formatNumber(a.buckets.size)} → ${formatNumber(b.buckets.size)} bucket(s).`,
+                '',
+                headline,
+                '',
+                markdownTable([axisLabel, 'Before', 'After', 'Δ count', 'Δ self'], shown.map(r => [
+                    r.key.length > 52 ? r.key.slice(0, 49) + '…' : r.key,
+                    formatNumber(r.before),
+                    formatNumber(r.after),
+                    r.delta === 0
+                        ? '—'
+                        : `${r.delta > 0 ? '+' : '−'}${formatNumber(Math.abs(r.delta))}`,
+                    r.bytesDelta === 0
+                        ? '—'
+                        : `${r.bytesDelta > 0 ? '+' : '−'}${formatBytes(Math.abs(r.bytesDelta))}`,
+                ]), new Set([1, 2, 3, 4])),
+            ];
+            if (rows.length > shown.length) {
+                lines.push('', `_${formatNumber(rows.length - shown.length)} further bucket(s) not shown (raise \`limit\`)._`);
+            }
+            if (addedKeys.length > 0) {
+                lines.push('', `**Buckets present only in the target (${formatNumber(addedKeys.length)}):** ${addedKeys
+                    .slice(0, 15)
+                    .map(k => `\`${k}\``)
+                    .join(', ')}${addedKeys.length > 15 ? ', …' : ''}`);
+            }
+            if (removedKeys.length > 0) {
+                lines.push('', `**Buckets present only in the baseline (${formatNumber(removedKeys.length)}):** ${removedKeys
+                    .slice(0, 15)
+                    .map(k => `\`${k}\``)
+                    .join(', ')}${removedKeys.length > 15 ? ', …' : ''}`);
+            }
+            if (added > 0 || removed > 0) {
+                lines.push('', `_Churn is measured per bucket, so it is a LOWER bound on how many individual objects were replaced: two members swapping within one bucket are invisible here. Node identity cannot be tracked across captures — ids are per-capture — so this is the strongest available statement._`);
+            }
+            lines.push('', `**Next:** ${groupBy === 'owner'
+                ? 'Use `memlab_dominator_attribution` on the owners that moved to measure how much each actually pins.'
+                : 'Re-run with `group_by: "owner"` to see WHICH object holds the buckets that moved, then `memlab_dominator_attribution` to size each owner.'}`);
+            return toolResult(lines.join('\n'));
+        }
+        catch (err) {
+            return errorResult(err);
+        }
+    });
+}
+//# sourceMappingURL=population-diff.js.map

package/dist/tools/population-diff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"population-diff.js","sourceRoot":"","sources":["../../src/tools/population-diff.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAC,CAAC,EAAC,MAAM,KAAK,CAAC;AACtB,OAAO,EACL,gBAAgB,EAChB,mBAAmB,EACnB,mBAAmB,EACnB,aAAa,GACd,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,WAAW,EACX,WAAW,EACX,YAAY,EACZ,qBAAqB,EACrB,aAAa,EACb,UAAU,EACV,gBAAgB,GACjB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAC,kBAAkB,EAAC,MAAM,wBAAwB,CAAC;AAc1D,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,OAAO,KAAK,UAAU;QAAE,OAAO,EAAC,IAAI,EAAE,UAAU,EAAC,CAAC;IACtD,IAAI,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,EAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAC,CAAC;IAC/B,CAAC;IACD,IAAI,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,OAAO;aAClB,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;aACtB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;aACvB,KAAK,CAAC,GAAG,CAAC;aACV,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;aAC9C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,EAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAC,CAAC;IAChC,CAAC;IACD,MAAM,IAAI,KAAK,CACb,4BAA4B,IAAI,iEAAiE,CAClG,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CAAC,IAAe;IACjC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC/B,OAAO,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,GAAe;IAEf,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,UAAU;YACb,OAAO,UAAU,CAAC;QACpB,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YACtB,OAAO,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;QAChE,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC;YACvB,OAAO,CAAC,IAAe,EAAE,EAAE;gBACzB,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;oBAAE,OAAO,KAAK,CAAC;gBACzD,IAAI,IAAI,GAAG,CAAC,CAAC;gBACb,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBACnC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;wBAAE,SAAS;oBACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;oBACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,SAAS;oBACrD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACf,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC,MAAM;wBAAE,OAAO,IAAI,CAAC;gBAC1C,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AASD,uEAAuE;AACvE,6EAA6E;AAC7E,6BAA6B;AAC7B,MAAM,cAAc,GAAG,GAAG,CAAC;AAE3B,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;IACjE,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;AAChE,CAAC;AAED,SAAS,QAAQ,CAAC,IAAe;IAC/B,IAAI,GAAG,GAAqB,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC;IACvD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,GAAG,IAAI,IAAI,EAAE,GAAG,cAAc,EAAE,CAAC;QACtC,IAAI,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;YAAE,MAAM;QAC9B,IACE,GAAG,CAAC,IAAI,KAAK,YAAY;YACzB,GAAG,CAAC,EAAE,GAAG,CAAC;YACV,qBAAqB,CAAC,GAAG,CAAC;YAC1B,CAAC,UAAU,CAAC,GAAG,CAAC,EAChB,CAAC;YACD,uEAAuE;YACvE,qEAAqE;YACrE,sEAAsE;YACtE,OAAO,kBAAkB,CACvB,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CACxD,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAqB,GAAG,CAAC,aAAa,IAAI,IAAI,CAAC;QACzD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;YAAE,MAAM;QACvC,GAAG,GAAG,IAAI,CAAC;IACb,CAAC;IACD,OAAO,uCAAuC,CAAC;AACjD,CAAC;AAED,SAAS,QAAQ,CAAC,IAAe;IAC/B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACxC,IAAI,IAAI,KAAK,WAAW;YAAE,SAAS;QACnC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,iBAAiB,CAAC;IACjD,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,OAAO,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;AACjE,CAAC;AAED,SAAS,SAAS,CAChB,OAAgB,EAChB,GAAe;IAEf,QAAQ,OAAO,EAAE,CAAC;QAChB,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC;QAClB,KAAK,MAAM;YACT,OAAO,CAAC,IAAe,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;QACxC,KAAK,OAAO;YACV,OAAO,QAAQ,CAAC;QAClB,KAAK,OAAO;YACV,OAAO,GAAG,CAAC,IAAI,KAAK,UAAU;gBAC5B,CAAC,CAAC,CAAC,IAAe,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC3C,CAAC,CAAC,CAAC,IAAe,EAAE,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;AACH,CAAC;AAaD,SAAS,MAAM,CACb,QAAuB,EACvB,QAAsC,EACtC,KAAkC;IAElC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAC5B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO;QAC5B,KAAK,EAAE,CAAC;QACR,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,EAAE,CAAC;YACN,CAAC,CAAC,KAAK,EAAE,CAAC;YACV,CAAC,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAC,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,EAAC,OAAO,EAAE,KAAK,EAAE,SAAS,EAAC,CAAC;AACrC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,CAAS,EACT,CAAS;IAET,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC;QACtE,MAAM,CAAC,GACL,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,GAAG,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC;;YACjB,OAAO,IAAI,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IACnC,IAAI,KAAK,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;QACjC,OAAO;YACL,QAAQ,EAAE,kDAAkD,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,4HAA4H;YACpN,KAAK;YACL,OAAO;SACR,CAAC;IACJ,CAAC;IACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO;YACL,QAAQ,EAAE,+CAA+C,YAAY,CAAC,KAAK,CAAC,2BAA2B,YAAY,CAAC,OAAO,CAAC,sMAAsM;YAClU,KAAK;YACL,OAAO;SACR,CAAC;IACJ,CAAC;IACD,OAAO;QACL,QAAQ,EAAE,cAAc,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,SAAS,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,OAAO,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,YAAY,CAAC,KAAK,CAAC,cAAc,YAAY,CAAC,OAAO,CAAC,eAAe;QACnO,KAAK;QACL,OAAO;KACR,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAAiB;IACtD,MAAM,CAAC,IAAI,CACT,wBAAwB,EACxB,qiBAAqiB;QACniB,sIAAsI;QACtI,mNAAmN,EACrN;QACE,eAAe,EAAE,CAAC;aACf,MAAM,EAAE;aACR,QAAQ,CACP,+DAA+D,CAChE;QACH,aAAa,EAAE,CAAC;aACb,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,QAAQ,CACP,iEAAiE,CAClE;QACH,UAAU,EAAE,CAAC;aACV,MAAM,EAAE;aACR,QAAQ,CACP,kFAAkF,CACnF;QACH,QAAQ,EAAE,CAAC;aACR,IAAI,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;aACzC,QAAQ,EAAE;aACV,QAAQ,CACP,qYAAqY,CACtY;QACH,KAAK,EAAE,CAAC;aACL,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CAAC,oDAAoD,CAAC;QACjE,SAAS,EAAE,CAAC;aACT,MAAM,EAAE;aACR,QAAQ,EAAE;aACV,OAAO,CAAC,CAAC,CAAC;aACV,QAAQ,CACP,8HAA8H,CAC/H;KACJ,EACD,KAAK,EAAE,EACL,eAAe,EACf,aAAa,EACb,UAAU,EACV,QAAQ,EACR,KAAK,EACL,SAAS,GACV,EAAE,EAAE;QACH,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;YACxC,MAAM,YAAY,GAAG,aAAa,IAAI,gBAAgB,EAAE,CAAC;YACzD,IAAI,YAAY,IAAI,IAAI,EAAE,CAAC;gBACzB,OAAO,WAAW,CAAC,0CAA0C,CAAC,CAAC;YACjE,CAAC;YACD,IAAI,YAAY,KAAK,eAAe,EAAE,CAAC;gBACrC,OAAO,WAAW,CAChB,0DAA0D,CAC3D,CAAC;YACJ,CAAC;YACD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,eAAe,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,QAAQ,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;gBACvC,MAAM,SAAS,GAAG,aAAa,EAAE;qBAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,CAAC;gBACd,OAAO,WAAW,CAChB,6CAA6C,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,YAAY,eAAe,SAAS,IAAI,QAAQ,qEAAqE,CACxM,CAAC;YACJ,CAAC;YAED,MAAM,OAAO,GACX,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YACzD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;gBACxB,KAAK,MAAM,CAAC,IAAI,CAAC,eAAe,EAAE,YAAY,CAAC,EAAE,CAAC;oBAChD,IAAI,mBAAmB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;wBAClC,OAAO,WAAW,CAChB,aAAa,CAAC,yJAAyJ,CACxK,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,MAAM,QAAQ,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YACtC,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAE1C,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;gBACnC,OAAO,UAAU,CACf,+BAA+B,UAAU,0JAA0J,CACpM,CAAC;YACJ,CAAC;YAED,MAAM,EAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAC,GAAG,oBAAoB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAE9D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACjE,MAAM,IAAI,GAMJ,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjC,MAAM,KAAK,GAAG,CAAC,KAAK,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;gBACzD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,SAAS;oBAAE,SAAS;gBAC1C,IAAI,CAAC,IAAI,CAAC;oBACR,GAAG;oBACH,MAAM,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;oBAC1B,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,CAAC;oBACxB,KAAK;oBACL,UAAU,EAAE,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,CAAC;iBAC7D,CAAC,CAAC;YACL,CAAC;YACD,oEAAoE;YACpE,iEAAiE;YACjE,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CACrE,CAAC;YACF,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAEnC,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAC3C,CAAC;YACF,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAC3C,CAAC;YAEF,MAAM,SAAS,GACb,OAAO,KAAK,OAAO;gBACjB,CAAC,CAAC,yBAAyB;gBAC3B,CAAC,CAAC,OAAO,KAAK,OAAO;oBACnB,CAAC,CAAC,wBAAwB;oBAC1B,CAAC,CAAC,OAAO,KAAK,MAAM;wBAClB,CAAC,CAAC,WAAW;wBACb,CAAC,CAAC,OAAO,CAAC;YAElB,MAAM,KAAK,GAAa;gBACtB,wBAAwB,UAAU,SAAS,OAAO,MAAM,eAAe,QAAQ,YAAY,GAAG;gBAC9F,EAAE;gBACF,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,kBAAkB,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa;gBACzN,EAAE;gBACF,QAAQ;gBACR,EAAE;gBACF,aAAa,CACX,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC,EACnD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACb,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;oBACpD,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;oBACtB,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;oBACrB,CAAC,CAAC,KAAK,KAAK,CAAC;wBACX,CAAC,CAAC,GAAG;wBACL,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE;oBAClE,CAAC,CAAC,UAAU,KAAK,CAAC;wBAChB,CAAC,CAAC,GAAG;wBACL,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE;iBAC5E,CAAC,EACF,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CACtB;aACF,CAAC;YACF,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,kDAAkD,CAC/F,CAAC;YACJ,CAAC;YACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CACR,EAAE,EACF,yCAAyC,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,SAAS;qBACrF,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;qBACZ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;qBACpB,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CACrD,CAAC;YACJ,CAAC;YACD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,2CAA2C,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,WAAW;qBAC3F,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;qBACZ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;qBACpB,IAAI,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CACvD,CAAC;YACJ,CAAC;YACD,IAAI,KAAK,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;gBAC7B,KAAK,CAAC,IAAI,CACR,EAAE,EACF,uRAAuR,CACxR,CAAC;YACJ,CAAC;YACD,KAAK,CAAC,IAAI,CACR,EAAE,EACF,aACE,OAAO,KAAK,OAAO;gBACjB,CAAC,CAAC,qGAAqG;gBACvG,CAAC,CAAC,2IACN,EAAE,CACH,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/retainer-layers.d.ts

@@ -0,0 +1,23 @@
+/**
+ * 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';
+import type { IHeapSnapshot } from '@memlab/core';
+/**
+ * Reachability from the synthetic GC roots with one node treated as a sink:
+ * `blocked` is marked reached (so it is not reported as unreachable) but its
+ * outgoing edges are never followed. Anything left unmarked is reachable ONLY
+ * through `blocked`, i.e. it lives inside that node's retained subtree.
+ *
+ * Mirrors `computeReachableWithoutDevRoots` in dev-artifacts.ts, which does the
+ * same walk with the dev/automation roots as sinks.
+ */
+export declare function computeReachableWithoutNode(snapshot: IHeapSnapshot, blockedId: number): Uint8Array;
+export declare function registerRetainerLayers(server: McpServer): void;
+//# sourceMappingURL=retainer-layers.d.ts.map

package/dist/tools/retainer-layers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"retainer-layers.d.ts","sourceRoot":"","sources":["../../src/tools/retainer-layers.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAC,SAAS,EAAC,MAAM,yCAAyC,CAAC;AACvE,OAAO,KAAK,EAAuB,aAAa,EAAC,MAAM,cAAc,CAAC;AAatE;;;;;;;;GAQG;AACH,wBAAgB,2BAA2B,CACzC,QAAQ,EAAE,aAAa,EACvB,SAAS,EAAE,MAAM,GAChB,UAAU,CAmBZ;AAqBD,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,SAAS,GAAG,IAAI,CA6K9D"}

package/dist/tools/retainer-layers.js

@@ -0,0 +1,179 @@
+/**
+ * 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 { errorResult, formatBytes, formatNumber, isNodeWorthInspecting, markdownTable, toolResult, truncateNodeName, } from '../utils.js';
+/**
+ * Reachability from the synthetic GC roots with one node treated as a sink:
+ * `blocked` is marked reached (so it is not reported as unreachable) but its
+ * outgoing edges are never followed. Anything left unmarked is reachable ONLY
+ * through `blocked`, i.e. it lives inside that node's retained subtree.
+ *
+ * Mirrors `computeReachableWithoutDevRoots` in dev-artifacts.ts, which does the
+ * same walk with the dev/automation roots as sinks.
+ */
+export function computeReachableWithoutNode(snapshot, blockedId) {
+    const reached = new Uint8Array(snapshot.nodes.length);
+    const stack = [];
+    snapshot.nodes.forEach((node) => {
+        if (node.type !== 'synthetic' && node.id > 3)
+            return;
+        if (reached[node.nodeIndex])
+            return;
+        reached[node.nodeIndex] = 1;
+        if (node.id !== blockedId)
+            stack.push(node);
+    });
+    while (stack.length > 0) {
+        const node = stack.pop();
+        node.forEachReference((edge) => {
+            const to = edge.toNode;
+            if (reached[to.nodeIndex])
+                return;
+            reached[to.nodeIndex] = 1;
+            if (to.id !== blockedId)
+                stack.push(to);
+        });
+    }
+    return reached;
+}
+function groupKey(g) {
+    return `${g.fromType}\u0000${g.fromName}\u0000${g.edgeType}\u0000${g.edgeName}`;
+}
+export function registerRetainerLayers(server) {
+    server.tool('memlab_retainer_layers', 'Counterfactual retainer analysis: answer "if I cut this edge, would the object still be retained, and by what?". ' +
+        "Enumerates the INDEPENDENT retaining edges into a node — the incoming edges whose source is still reachable from a GC root when the target itself is treated as a sink — so back-edges from inside the target's own retained subtree are excluded. " +
+        'The object becomes unreachable only when ALL independent retainers are cut, so a count above 1 means any single fix leaves it retained by the others. ' +
+        'Use this BEFORE writing a fix: memlab_retainer_trace and memlab_detached_dom --group_by retainer each report ONE path/grouping, which is why a stack of caches holding the same object looks like a single retainer and a partial fix reports a misleading win. ' +
+        'Complements memlab_dominator_chain (accountability chain upward) and memlab_retainer_trace (one shortest path).', {
+        node_id: z
+            .number()
+            .int()
+            .describe('The numeric ID of the heap node to analyze'),
+        max_retainers: z
+            .number()
+            .int()
+            .min(1)
+            .optional()
+            .default(20)
+            .describe('Maximum number of distinct retainer groups to list (default 20). Grouping is by (source class, source type, edge name, edge type).'),
+    }, async ({ node_id, max_retainers }) => {
+        try {
+            const snapshot = getSnapshot();
+            const target = snapshot.getNodeById(node_id);
+            if (!target) {
+                return errorResult(`Node with id ${node_id} not found`);
+            }
+            const reached = computeReachableWithoutNode(snapshot, target.id);
+            // Partition incoming edges into independent retainers (source still
+            // reachable with the target blocked) and internal back-edges (source
+            // only reachable through the target).
+            const groups = new Map();
+            let independentEdgeCount = 0;
+            let backEdgeCount = 0;
+            for (const edge of target.referrers) {
+                const from = edge.fromNode;
+                // A self-edge (V8 emits them for DOM nodes) cannot retain the target,
+                // but the sink walk marks the target itself reached so it would
+                // otherwise pass the test below. Count it with the back-edges.
+                if (from.id === target.id || !reached[from.nodeIndex]) {
+                    backEdgeCount++;
+                    continue;
+                }
+                independentEdgeCount++;
+                const g = {
+                    fromName: from.name,
+                    fromType: from.type,
+                    edgeName: String(edge.name_or_index),
+                    edgeType: edge.type,
+                };
+                const key = groupKey(g);
+                const existing = groups.get(key);
+                if (existing) {
+                    existing.count++;
+                    if (from.retainedSize > existing.maxRetained) {
+                        existing.maxRetained = from.retainedSize;
+                        existing.exampleFromId = from.id;
+                    }
+                }
+                else {
+                    groups.set(key, {
+                        ...g,
+                        count: 1,
+                        exampleFromId: from.id,
+                        maxRetained: from.retainedSize,
+                    });
+                }
+            }
+            const sorted = [...groups.values()].sort((a, b) => b.maxRetained - a.maxRetained || b.count - a.count);
+            const shown = sorted.slice(0, max_retainers);
+            const targetLabel = truncateNodeName(target.name, target.type, target.self_size, 60);
+            const lines = [
+                `## Retainer layers for @${target.id} (${targetLabel})`,
+                '',
+                `Retained ${formatBytes(target.retainedSize)}. ` +
+                    `${formatNumber(independentEdgeCount)} independent retaining edge(s) in ${formatNumber(sorted.length)} group(s)` +
+                    (backEdgeCount > 0
+                        ? `; ${formatNumber(backEdgeCount)} back-edge(s) from inside its own retained subtree excluded.`
+                        : '.'),
+                '',
+            ];
+            if (independentEdgeCount === 0) {
+                lines.push(target.type === 'synthetic' || target.id <= 3
+                    ? '**This node is a GC root itself** — it has no external retainer to cut.'
+                    : "**No independent retainer found.** Nothing outside this object's own subtree references it, so it is already GC-eligible (or reachable only via weak references). It should not be counted toward a leak total — see `memlab_detached_dom --only_with_retainer_path`.");
+                return toolResult(lines.join('\n'));
+            }
+            // The counterfactual verdict. Cutting one independent edge cannot change
+            // the reachability of any other independent source, because every such
+            // source is reachable on a path that does not pass through the target.
+            if (independentEdgeCount === 1) {
+                const only = sorted[0];
+                lines.push(`**Sole retainer — cutting it frees the object.** \`${only.edgeName}\` (${only.edgeType}) from @${only.exampleFromId} ${only.fromName} (${only.fromType}). ` +
+                    `Fixing this one reference reclaims ${formatBytes(target.retainedSize)}.`, '');
+            }
+            else {
+                lines.push(`**${formatNumber(independentEdgeCount)} independent retainers — cutting any ONE leaves the object retained by the other ${formatNumber(independentEdgeCount - 1)}.** ` +
+                    'A fix that removes a single one of these will show little or no memory win, and a before/after measurement that attributes the whole object to the removed retainer will overstate the result. ' +
+                    'All of them must be cut to reclaim the object.', '');
+            }
+            lines.push(markdownTable(['#', 'edges', 'from', 'edge', 'example', 'source retains'], shown.map((g, i) => [
+                String(i + 1),
+                formatNumber(g.count),
+                `${g.fromName} (${g.fromType})`,
+                `${g.edgeName} (${g.edgeType})`,
+                `@${g.exampleFromId}`,
+                formatBytes(g.maxRetained),
+            ])));
+            if (sorted.length > shown.length) {
+                lines.push('', `_${formatNumber(sorted.length - shown.length)} more retainer group(s) not shown — raise max_retainers to see them._`);
+            }
+            // A dominator that is not the GC-roots super-node means every path to
+            // the target passes through it, so it is a single choke point even when
+            // several independent edges exist.
+            const dom = target.dominatorNode;
+            if (independentEdgeCount > 1 &&
+                dom &&
+                dom.id !== target.id &&
+                dom.name !== '(GC roots)' &&
+                isNodeWorthInspecting(dom)) {
+                lines.push('', `**Single choke point:** every path still passes through the immediate dominator @${dom.id} ${truncateNodeName(dom.name, dom.type, dom.self_size, 60)} (retains ${formatBytes(dom.retainedSize)}). ` +
+                    'Cutting there frees the target in one change instead of cutting each retainer. Use `memlab_dominator_chain` to walk further up.');
+            }
+            lines.push('', '_Independence test: an incoming edge counts only if its source is still reachable from a GC root when the target is treated as a sink. ' +
+                "Edges failing that test originate inside the target's own retained subtree and cannot keep it alive._");
+            return toolResult(lines.join('\n'));
+        }
+        catch (err) {
+            return errorResult(err);
+        }
+    });
+}
+//# sourceMappingURL=retainer-layers.js.map

package/dist/tools/retainer-layers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retainer-layers.js","sourceRoot":"","sources":["../../src/tools/retainer-layers.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,WAAW,EACX,YAAY,EACZ,qBAAqB,EACrB,aAAa,EACb,UAAU,EACV,gBAAgB,GACjB,MAAM,aAAa,CAAC;AAErB;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CACzC,QAAuB,EACvB,SAAiB;IAEjB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtD,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAe,EAAE,EAAE;QACzC,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC;YAAE,OAAO;QACrD,IAAI,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC;YAAE,OAAO;QACpC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IACH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAe,CAAC;QACtC,IAAI,CAAC,gBAAgB,CAAC,CAAC,IAAe,EAAE,EAAE;YACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;YACvB,IAAI,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC;gBAAE,OAAO;YAClC,OAAO,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,EAAE,CAAC,EAAE,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAYD,SAAS,QAAQ,CAAC,CAKjB;IACC,OAAO,GAAG,CAAC,CAAC,QAAQ,SAAS,CAAC,CAAC,QAAQ,SAAS,CAAC,CAAC,QAAQ,SAAS,CAAC,CAAC,QAAQ,EAAE,CAAC;AAClF,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAAiB;IACtD,MAAM,CAAC,IAAI,CACT,wBAAwB,EACxB,mHAAmH;QACjH,qPAAqP;QACrP,wJAAwJ;QACxJ,kQAAkQ;QAClQ,iHAAiH,EACnH;QACE,OAAO,EAAE,CAAC;aACP,MAAM,EAAE;aACR,GAAG,EAAE;aACL,QAAQ,CAAC,4CAA4C,CAAC;QACzD,aAAa,EAAE,CAAC;aACb,MAAM,EAAE;aACR,GAAG,EAAE;aACL,GAAG,CAAC,CAAC,CAAC;aACN,QAAQ,EAAE;aACV,OAAO,CAAC,EAAE,CAAC;aACX,QAAQ,CACP,oIAAoI,CACrI;KACJ,EACD,KAAK,EAAE,EAAC,OAAO,EAAE,aAAa,EAAC,EAAE,EAAE;QACjC,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YAC7C,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,WAAW,CAAC,gBAAgB,OAAO,YAAY,CAAC,CAAC;YAC1D,CAAC;YAED,MAAM,OAAO,GAAG,2BAA2B,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAEjE,oEAAoE;YACpE,qEAAqE;YACrE,sCAAsC;YACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAC;YACpD,IAAI,oBAAoB,GAAG,CAAC,CAAC;YAC7B,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;gBAC3B,sEAAsE;gBACtE,gEAAgE;gBAChE,+DAA+D;gBAC/D,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;oBACtD,aAAa,EAAE,CAAC;oBAChB,SAAS;gBACX,CAAC;gBACD,oBAAoB,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG;oBACR,QAAQ,EAAE,IAAI,CAAC,IAAI;oBACnB,QAAQ,EAAE,IAAI,CAAC,IAAI;oBACnB,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;oBACpC,QAAQ,EAAE,IAAI,CAAC,IAAI;iBACpB,CAAC;gBACF,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,KAAK,EAAE,CAAC;oBACjB,IAAI,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;wBAC7C,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;wBACzC,QAAQ,CAAC,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC;oBACnC,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE;wBACd,GAAG,CAAC;wBACJ,KAAK,EAAE,CAAC;wBACR,aAAa,EAAE,IAAI,CAAC,EAAE;wBACtB,WAAW,EAAE,IAAI,CAAC,YAAY;qBAC/B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,MAAM,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACtC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAC7D,CAAC;YACF,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;YAE7C,MAAM,WAAW,GAAG,gBAAgB,CAClC,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,SAAS,EAChB,EAAE,CACH,CAAC;YACF,MAAM,KAAK,GAAa;gBACtB,2BAA2B,MAAM,CAAC,EAAE,KAAK,WAAW,GAAG;gBACvD,EAAE;gBACF,YAAY,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI;oBAC9C,GAAG,YAAY,CAAC,oBAAoB,CAAC,qCAAqC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW;oBAChH,CAAC,aAAa,GAAG,CAAC;wBAChB,CAAC,CAAC,KAAK,YAAY,CAAC,aAAa,CAAC,8DAA8D;wBAChG,CAAC,CAAC,GAAG,CAAC;gBACV,EAAE;aACH,CAAC;YAEF,IAAI,oBAAoB,KAAK,CAAC,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CACR,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,EAAE,IAAI,CAAC;oBAC3C,CAAC,CAAC,yEAAyE;oBAC3E,CAAC,CAAC,uQAAuQ,CAC5Q,CAAC;gBACF,OAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACtC,CAAC;YAED,yEAAyE;YACzE,uEAAuE;YACvE,uEAAuE;YACvE,IAAI,oBAAoB,KAAK,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CACR,sDAAsD,IAAI,CAAC,QAAQ,OAAO,IAAI,CAAC,QAAQ,WAAW,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,KAAK;oBAC1J,sCAAsC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,EAC3E,EAAE,CACH,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CACR,KAAK,YAAY,CAAC,oBAAoB,CAAC,oFAAoF,YAAY,CAAC,oBAAoB,GAAG,CAAC,CAAC,MAAM;oBACrK,iMAAiM;oBACjM,gDAAgD,EAClD,EAAE,CACH,CAAC;YACJ,CAAC;YAED,KAAK,CAAC,IAAI,CACR,aAAa,CACX,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,gBAAgB,CAAC,EAC3D,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gBACb,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBACrB,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,GAAG;gBAC/B,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,GAAG;gBAC/B,IAAI,CAAC,CAAC,aAAa,EAAE;gBACrB,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC;aAC3B,CAAC,CACH,CACF,CAAC;YACF,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CACR,EAAE,EACF,IAAI,YAAY,CAAC,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,uEAAuE,CACtH,CAAC;YACJ,CAAC;YAED,sEAAsE;YACtE,wEAAwE;YACxE,mCAAmC;YACnC,MAAM,GAAG,GAAG,MAAM,CAAC,aAAa,CAAC;YACjC,IACE,oBAAoB,GAAG,CAAC;gBACxB,GAAG;gBACH,GAAG,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;gBACpB,GAAG,CAAC,IAAI,KAAK,YAAY;gBACzB,qBAAqB,CAAC,GAAG,CAAC,EAC1B,CAAC;gBACD,KAAK,CAAC,IAAI,CACR,EAAE,EACF,oFAAoF,GAAG,CAAC,EAAE,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,aAAa,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK;oBAClM,iIAAiI,CACpI,CAAC;YACJ,CAAC;YAED,KAAK,CAAC,IAAI,CACR,EAAE,EACF,yIAAyI;gBACvI,uGAAuG,CAC1G,CAAC;YAEF,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/retainer-summary.d.ts

@@ -8,5 +8,6 @@
  * @oncall memory_lab
  */
 import type { McpServer } from '@modelcontextprotocol/sdk/server/mcp.js';
+export declare const COMPACT_GAP_MARKER = "\u22EF";
 export declare function registerRetainerSummary(server: McpServer): void;
 //# sourceMappingURL=retainer-summary.d.ts.map