memorydetective 1.0.0 → 1.1.0

package/dist/tools/findCycles.js

@@ -3,6 +3,7 @@ import { existsSync } from "node:fs";
 import { resolve as resolvePath } from "node:path";
 import { runCommand } from "../runtime/exec.js";
 import { parseLeaksOutput, rootCyclesOnly, walkCycles, } from "../parsers/leaksOutput.js";
+import { shortenForVerbosity, } from "../parsers/shortenClassName.js";
 export const findCyclesSchema = z.object({
     path: z.string().min(1).describe("Absolute path to a `.memgraph` file."),
     className: z
@@ -15,8 +16,12 @@ export const findCyclesSchema = z.object({
         .positive()
         .default(10)
         .describe("Truncate chains beyond this depth (default 10)."),
+    verbosity: z
+        .enum(["compact", "normal", "full"])
+        .default("compact")
+        .describe("Class-name verbosity. `compact` shortens SwiftUI generic names aggressively; `full` returns demangled names verbatim."),
 });
-function flattenChain(node, maxDepth) {
+function flattenChain(node, maxDepth, verbosity) {
     const out = [];
     for (const { node: n, depth } of walkCycles([node])) {
         if (depth > maxDepth)
@@ -25,7 +30,7 @@ function flattenChain(node, maxDepth) {
             depth,
             edge: n.edge,
             retainKind: n.retainKind,
-            className: n.className,
+            className: shortenForVerbosity(n.className, verbosity),
             address: n.address,
             count: n.count,
             size: n.size,
@@ -36,16 +41,16 @@ function flattenChain(node, maxDepth) {
     return out;
 }
 /** Pure function: parse `leaks` output and return the cycles array. */
-export function extractCycles(leaksText, path, filter, maxDepth = 10) {
+export function extractCycles(leaksText, path, filter, maxDepth = 10, verbosity = "compact") {
     const report = parseLeaksOutput(leaksText);
     const roots = rootCyclesOnly(report.cycles);
     const cycles = roots.map((c) => {
-        const chain = flattenChain(c, maxDepth);
+        const chain = flattenChain(c, maxDepth, verbosity);
         const matched = filter
             ? chain.some((entry) => entry.className.includes(filter))
             : true;
         return {
-            rootClass: c.className,
+            rootClass: shortenForVerbosity(c.className, verbosity),
             rootAddress: c.address,
             count: c.count,
             size: c.size,
@@ -73,6 +78,6 @@ export async function findCycles(input) {
     if (result.code !== 0 && result.code !== 1) {
         throw new Error(`leaks failed (code ${result.code}): ${result.stderr || result.stdout}`);
     }
-    return extractCycles(result.stdout, path, input.className, input.maxDepth ?? 10);
+    return extractCycles(result.stdout, path, input.className, input.maxDepth ?? 10, input.verbosity ?? "compact");
 }
 //# sourceMappingURL=findCycles.js.map

package/dist/tools/findCycles.js.map

@@ -1 +1 @@
-{"version":3,"file":"findCycles.js","sourceRoot":"","sources":["../../src/tools/findCycles.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,WAAW,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,UAAU,GACX,MAAM,2BAA2B,CAAC;AAGnC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,sCAAsC,CAAC;IACxE,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,uHAAuH,CACxH;IACH,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,OAAO,CAAC,EAAE,CAAC;SACX,QAAQ,CAAC,iDAAiD,CAAC;CAC/D,CAAC,CAAC;AAkCH,SAAS,YAAY,CACnB,IAAe,EACf,QAAgB;IAEhB,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACpD,IAAI,KAAK,GAAG,QAAQ;YAAE,SAAS;QAC/B,GAAG,CAAC,IAAI,CAAC;YACP,KAAK;YACL,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,WAAW,EAAE,CAAC,CAAC,WAAW;SAC3B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAC3B,SAAiB,EACjB,IAAY,EACZ,MAAe,EACf,QAAQ,GAAG,EAAE;IAEb,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE5C,MAAM,MAAM,GAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5C,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,MAAM;YACpB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACzD,CAAC,CAAC,IAAI,CAAC;QACT,OAAO;YACL,SAAS,EAAE,CAAC,CAAC,SAAS;YACtB,WAAW,EAAE,CAAC,CAAC,OAAO;YACtB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,KAAK;YACL,OAAO;SACR,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEnE,OAAO;QACL,EAAE,EAAE,IAAI;QACR,IAAI;QACJ,WAAW,EAAE,KAAK,CAAC,MAAM;QACzB,aAAa,EAAE,MAAM;QACrB,MAAM,EAAE,QAAQ;KACjB,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,KAAsB;IAEtB,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;QAC/C,SAAS,EAAE,CAAC,GAAG,MAAM;KACtB,CAAC,CAAC;IACH,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CACb,sBAAsB,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CACxE,CAAC;IACJ,CAAC;IACD,OAAO,aAAa,CAClB,MAAM,CAAC,MAAM,EACb,IAAI,EACJ,KAAK,CAAC,SAAS,EACf,KAAK,CAAC,QAAQ,IAAI,EAAE,CACrB,CAAC;AACJ,CAAC"}
+{"version":3,"file":"findCycles.js","sourceRoot":"","sources":["../../src/tools/findCycles.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AACrC,OAAO,EAAE,OAAO,IAAI,WAAW,EAAE,MAAM,WAAW,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EACL,gBAAgB,EAChB,cAAc,EACd,UAAU,GACX,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,mBAAmB,GAEpB,MAAM,gCAAgC,CAAC;AAGxC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC;IACvC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,sCAAsC,CAAC;IACxE,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,uHAAuH,CACxH;IACH,QAAQ,EAAE,CAAC;SACR,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,OAAO,CAAC,EAAE,CAAC;SACX,QAAQ,CAAC,iDAAiD,CAAC;IAC9D,SAAS,EAAE,CAAC;SACT,IAAI,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SACnC,OAAO,CAAC,SAAS,CAAC;SAClB,QAAQ,CACP,uHAAuH,CACxH;CACJ,CAAC,CAAC;AAkCH,SAAS,YAAY,CACnB,IAAe,EACf,QAAgB,EAChB,SAAoB;IAEpB,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,KAAK,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QACpD,IAAI,KAAK,GAAG,QAAQ;YAAE,SAAS;QAC/B,GAAG,CAAC,IAAI,CAAC;YACP,KAAK;YACL,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,SAAS,EAAE,mBAAmB,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC;YACtD,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,WAAW,EAAE,CAAC,CAAC,WAAW;SAC3B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAC3B,SAAiB,EACjB,IAAY,EACZ,MAAe,EACf,QAAQ,GAAG,EAAE,EACb,YAAuB,SAAS;IAEhC,MAAM,MAAM,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAE5C,MAAM,MAAM,GAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC5C,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,MAAM;YACpB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACzD,CAAC,CAAC,IAAI,CAAC;QACT,OAAO;YACL,SAAS,EAAE,mBAAmB,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC;YACtD,WAAW,EAAE,CAAC,CAAC,OAAO;YACtB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,KAAK;YACL,OAAO;SACR,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEnE,OAAO;QACL,EAAE,EAAE,IAAI;QACR,IAAI;QACJ,WAAW,EAAE,KAAK,CAAC,MAAM;QACzB,aAAa,EAAE,MAAM;QACrB,MAAM,EAAE,QAAQ;KACjB,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,KAAsB;IAEtB,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,4BAA4B,IAAI,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,MAAM,MAAM,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE;QAC/C,SAAS,EAAE,CAAC,GAAG,MAAM;KACtB,CAAC,CAAC;IACH,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CACb,sBAAsB,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CACxE,CAAC;IACJ,CAAC;IACD,OAAO,aAAa,CAClB,MAAM,CAAC,MAAM,EACb,IAAI,EACJ,KAAK,CAAC,SAAS,EACf,KAAK,CAAC,QAAQ,IAAI,EAAE,EACpB,KAAK,CAAC,SAAS,IAAI,SAAS,CAC7B,CAAC;AACJ,CAAC"}

package/dist/tools/reachableFromCycle.d.ts

@@ -0,0 +1,61 @@
+import { z } from "zod";
+import type { LeaksReport } from "../types.js";
+/**
+ * Cycle-scoped reachability + class counting.
+ *
+ * Answers questions like:
+ *   "How many `NSURLSessionConfiguration` instances are reachable from the
+ *    cycle rooted at `DetailViewModel`?"
+ *
+ * Where global `countAlive` would say "4495 NSURLSessionConfiguration", this
+ * tool says "1100 reachable from each of the 4 cycles, so the cycle root is
+ * the actual culprit pinning them in memory."
+ *
+ * API shape inspired by Meta's `memlab` predicate-based queries.
+ */
+export declare const reachableFromCycleSchema: z.ZodObject<{
+    path: z.ZodString;
+    cycleIndex: z.ZodOptional<z.ZodNumber>;
+    rootClassName: z.ZodOptional<z.ZodString>;
+    className: z.ZodOptional<z.ZodString>;
+    topN: z.ZodDefault<z.ZodNumber>;
+    verbosity: z.ZodDefault<z.ZodEnum<["compact", "normal", "full"]>>;
+}, "strip", z.ZodTypeAny, {
+    path: string;
+    verbosity: "compact" | "normal" | "full";
+    topN: number;
+    className?: string | undefined;
+    cycleIndex?: number | undefined;
+    rootClassName?: string | undefined;
+}, {
+    path: string;
+    className?: string | undefined;
+    verbosity?: "compact" | "normal" | "full" | undefined;
+    topN?: number | undefined;
+    cycleIndex?: number | undefined;
+    rootClassName?: string | undefined;
+}>;
+export type ReachableFromCycleInput = z.infer<typeof reachableFromCycleSchema>;
+export interface ClassCount {
+    className: string;
+    count: number;
+}
+export interface ReachableFromCycleResult {
+    ok: boolean;
+    path: string;
+    /** The cycle that was scoped to. */
+    cycle: {
+        index: number;
+        rootClass: string;
+        rootAddress: string;
+        /** Total reachable nodes from this cycle root (including descendants). */
+        totalReachable: number;
+    };
+    /** When `className` filter is provided, only that class shows up. Otherwise top N. */
+    counts: ClassCount[];
+    /** Total unique classes in the cycle's reachable set. */
+    uniqueClasses: number;
+}
+/** Pure: compute the result from a parsed report. Exposed for testing. */
+export declare function reachableFromReport(report: LeaksReport, path: string, input: ReachableFromCycleInput): ReachableFromCycleResult;
+export declare function reachableFromCycle(input: ReachableFromCycleInput): Promise<ReachableFromCycleResult>;

package/dist/tools/reachableFromCycle.js

@@ -0,0 +1,116 @@
+import { z } from "zod";
+import { runLeaksAndParse } from "../runtime/leaks.js";
+import { rootCyclesOnly } from "../parsers/leaksOutput.js";
+import { shortenForVerbosity, } from "../parsers/shortenClassName.js";
+/**
+ * Cycle-scoped reachability + class counting.
+ *
+ * Answers questions like:
+ *   "How many `NSURLSessionConfiguration` instances are reachable from the
+ *    cycle rooted at `DetailViewModel`?"
+ *
+ * Where global `countAlive` would say "4495 NSURLSessionConfiguration", this
+ * tool says "1100 reachable from each of the 4 cycles, so the cycle root is
+ * the actual culprit pinning them in memory."
+ *
+ * API shape inspired by Meta's `memlab` predicate-based queries.
+ */
+export const reachableFromCycleSchema = z.object({
+    path: z.string().min(1).describe("Absolute path to a `.memgraph` file."),
+    cycleIndex: z
+        .number()
+        .int()
+        .nonnegative()
+        .optional()
+        .describe("Zero-based index of the ROOT CYCLE to scope to. Mutually exclusive with `rootClassName`. When neither is given, defaults to cycle index 0."),
+    rootClassName: z
+        .string()
+        .optional()
+        .describe("Substring of the root cycle's class name (e.g. \"DetailViewModel\"). Picks the first ROOT CYCLE whose root matches. Mutually exclusive with `cycleIndex`."),
+    className: z
+        .string()
+        .optional()
+        .describe("Optional filter — only count nodes whose className contains this substring. When omitted, returns the full per-class breakdown."),
+    topN: z
+        .number()
+        .int()
+        .positive()
+        .max(100)
+        .default(20)
+        .describe("Cap on per-class entries returned (default 20)."),
+    verbosity: z
+        .enum(["compact", "normal", "full"])
+        .default("compact")
+        .describe("Class-name verbosity for the response. See analyzeMemgraph for the same flag."),
+});
+/** Pure: walk the tree from root, count nodes by className. */
+function countReachableFromNode(root, verbosity) {
+    const counts = new Map();
+    let total = 0;
+    const visit = (n) => {
+        total += 1;
+        if (n.className) {
+            const short = shortenForVerbosity(n.className, verbosity);
+            counts.set(short, (counts.get(short) ?? 0) + 1);
+        }
+        for (const child of n.children)
+            visit(child);
+    };
+    visit(root);
+    return { byClass: counts, total };
+}
+function pickCycle(report, input) {
+    const roots = rootCyclesOnly(report.cycles);
+    if (roots.length === 0)
+        return null;
+    if (input.rootClassName) {
+        const idx = roots.findIndex((r) => r.className.includes(input.rootClassName));
+        if (idx >= 0)
+            return { node: roots[idx], index: idx };
+        return null;
+    }
+    const idx = input.cycleIndex ?? 0;
+    if (idx >= roots.length)
+        return null;
+    return { node: roots[idx], index: idx };
+}
+/** Pure: compute the result from a parsed report. Exposed for testing. */
+export function reachableFromReport(report, path, input) {
+    const picked = pickCycle(report, input);
+    if (!picked) {
+        throw new Error(input.rootClassName
+            ? `No ROOT CYCLE found whose root class contains "${input.rootClassName}".`
+            : `No ROOT CYCLE at index ${input.cycleIndex ?? 0}. Available roots: ${rootCyclesOnly(report.cycles).length}.`);
+    }
+    const verbosity = input.verbosity ?? "compact";
+    const { byClass, total } = countReachableFromNode(picked.node, verbosity);
+    let entries = Array.from(byClass.entries()).map(([n, c]) => ({
+        className: n,
+        count: c,
+    }));
+    if (input.className) {
+        entries = entries.filter((e) => e.className.includes(input.className));
+    }
+    entries.sort((a, b) => b.count - a.count);
+    entries = entries.slice(0, input.topN ?? 20);
+    return {
+        ok: true,
+        path,
+        cycle: {
+            index: picked.index,
+            rootClass: shortenForVerbosity(picked.node.className, verbosity),
+            rootAddress: picked.node.address,
+            totalReachable: total,
+        },
+        counts: entries,
+        uniqueClasses: byClass.size,
+    };
+}
+export async function reachableFromCycle(input) {
+    if (input.cycleIndex !== undefined && input.rootClassName !== undefined) {
+        throw new Error("Provide either `cycleIndex` or `rootClassName`, not both.");
+    }
+    const { report, resolvedPath } = await runLeaksAndParse(input.path);
+    return reachableFromReport(report, resolvedPath, input);
+}
+//# sourceMappingURL=reachableFromCycle.js.map

package/dist/tools/reachableFromCycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reachableFromCycle.js","sourceRoot":"","sources":["../../src/tools/reachableFromCycle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EACL,mBAAmB,GAEpB,MAAM,gCAAgC,CAAC;AAGxC;;;;;;;;;;;;GAYG;AAEH,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAC,MAAM,CAAC;IAC/C,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,sCAAsC,CAAC;IACxE,UAAU,EAAE,CAAC;SACV,MAAM,EAAE;SACR,GAAG,EAAE;SACL,WAAW,EAAE;SACb,QAAQ,EAAE;SACV,QAAQ,CACP,4IAA4I,CAC7I;IACH,aAAa,EAAE,CAAC;SACb,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,2JAA2J,CAC5J;IACH,SAAS,EAAE,CAAC;SACT,MAAM,EAAE;SACR,QAAQ,EAAE;SACV,QAAQ,CACP,iIAAiI,CAClI;IACH,IAAI,EAAE,CAAC;SACJ,MAAM,EAAE;SACR,GAAG,EAAE;SACL,QAAQ,EAAE;SACV,GAAG,CAAC,GAAG,CAAC;SACR,OAAO,CAAC,EAAE,CAAC;SACX,QAAQ,CAAC,iDAAiD,CAAC;IAC9D,SAAS,EAAE,CAAC;SACT,IAAI,CAAC,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SACnC,OAAO,CAAC,SAAS,CAAC;SAClB,QAAQ,CACP,+EAA+E,CAChF;CACJ,CAAC,CAAC;AA0BH,+DAA+D;AAC/D,SAAS,sBAAsB,CAC7B,IAAe,EACf,SAAoB;IAEpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,KAAK,GAAG,CAAC,CAAY,EAAE,EAAE;QAC7B,KAAK,IAAI,CAAC,CAAC;QACX,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAChB,MAAM,KAAK,GAAG,mBAAmB,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ;YAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AACpC,CAAC;AAED,SAAS,SAAS,CAChB,MAAmB,EACnB,KAA8B;IAE9B,MAAM,KAAK,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACpC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAChC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAc,CAAC,CAC3C,CAAC;QACF,IAAI,GAAG,IAAI,CAAC;YAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;QACtD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;IAClC,IAAI,GAAG,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACrC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AAC1C,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,mBAAmB,CACjC,MAAmB,EACnB,IAAY,EACZ,KAA8B;IAE9B,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACxC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CACb,KAAK,CAAC,aAAa;YACjB,CAAC,CAAC,kDAAkD,KAAK,CAAC,aAAa,IAAI;YAC3E,CAAC,CAAC,0BAA0B,KAAK,CAAC,UAAU,IAAI,CAAC,sBAAsB,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CACjH,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,SAAS,CAAC;IAC/C,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAE1E,IAAI,OAAO,GAAiB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACzE,SAAS,EAAE,CAAC;QACZ,KAAK,EAAE,CAAC;KACT,CAAC,CAAC,CAAC;IAEJ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;QACpB,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7B,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAU,CAAC,CACvC,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAE7C,OAAO;QACL,EAAE,EAAE,IAAI;QACR,IAAI;QACJ,KAAK,EAAE;YACL,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,SAAS,EAAE,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC;YAChE,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO;YAChC,cAAc,EAAE,KAAK;SACtB;QACD,MAAM,EAAE,OAAO;QACf,aAAa,EAAE,OAAO,CAAC,IAAI;KAC5B,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAA8B;IAE9B,IAAI,KAAK,CAAC,UAAU,KAAK,SAAS,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;QACxE,MAAM,IAAI,KAAK,CACb,2DAA2D,CAC5D,CAAC;IACJ,CAAC;IACD,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,MAAM,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACpE,OAAO,mBAAmB,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;AAC1D,CAAC"}

package/dist/tools/renderCycleGraph.d.ts

@@ -7,8 +7,8 @@ export declare const renderCycleGraphSchema: z.ZodObject<{
     maxDepth: z.ZodDefault<z.ZodNumber>;
     truncateClassName: z.ZodDefault<z.ZodNumber>;
 }, "strip", z.ZodTypeAny, {
-    path: string;
     maxDepth: number;
+    path: string;
     cycleIndex: number;
     format: "mermaid" | "dot";
     truncateClassName: number;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "memorydetective",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "description": "MCP server for iOS leak hunting and performance investigation. Reads .memgraph + .trace files, captures new ones via xctrace and leaks(1), classifies retain cycles.",
   "type": "module",
   "bin": {
@@ -11,7 +11,9 @@
     "dist",
     "README.md",
     "LICENSE",
-    "CHANGELOG.md"
+    "NOTICE",
+    "CHANGELOG.md",
+    "USAGE.md"
   ],
   "scripts": {
     "build": "tsc && chmod +x dist/index.js",
@@ -34,7 +36,7 @@
     "performance"
   ],
   "author": "Carlos Henrique",
-  "license": "MIT",
+  "license": "Apache-2.0",
   "homepage": "https://github.com/carloshpdoc/memorydetective#readme",
   "repository": {
     "type": "git",