@memlab/core 1.1.5 → 1.1.9

package/dist/modes/InteractionTestMode.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };

package/dist/modes/MeasureMode.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import BaseMode from './BaseMode';
 import type { Page } from 'puppeteer';

package/dist/modes/MeasureMode.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
     function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }

package/dist/modes/RunningModes.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { Config, IRunningMode } from '../lib/Types';
 declare const _default: {

package/dist/modes/RunningModes.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };

package/dist/paths/TraceFinder.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { AnyOptions, HeapNodeIdSet, IHeapEdge, IHeapNode, IHeapSnapshot, LeakTracePathItem, Nullable, Optional, Predicator } from '../lib/Types';
 declare class TraceFinder {

package/dist/paths/TraceFinder.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
@@ -89,15 +89,17 @@ class TraceFinder {
         let nodesToVisitLength = 0;
         const node = snapshot.nodes.get(ROOT_NODE_INDEX);
         for (const edge of node.references) {
-            if (edge.type === 'element') {
-                if (Utils_1.default.isDocumentDOMTreesRoot(edge.toNode)) {
+            const toNode = edge.toNode;
+            const type = edge.type;
+            if (type === 'element') {
+                if (Utils_1.default.isDocumentDOMTreesRoot(toNode)) {
                     continue;
                 }
             }
-            else if (edge.type === 'shortcut') {
+            else if (type === 'shortcut') {
                 continue;
             }
-            const childNodeIndex = edge.toNode.nodeIndex;
+            const childNodeIndex = toNode.nodeIndex;
             nodesToVisit[nodesToVisitLength++] = childNodeIndex;
             flags[childNodeIndex] |= flag;
         }
@@ -303,11 +305,11 @@ class TraceFinder {
                 let newDominatorIndex = emptySlot;
                 let isOrphanNode = true;
                 const node = nodes.get(nodeIndex);
-                for (const edge of node.referrers) {
+                node.forEachReferrer((edge) => {
                     const referrerEdgeType = edge.type;
                     const referrerNodeIndex = edge.fromNode.nodeIndex;
                     if (!Utils_1.default.isEssentialEdge(referrerNodeIndex, referrerEdgeType, ROOT_NODE_INDEX)) {
-                        continue;
+                        return;
                     }
                     isOrphanNode = false;
                     const referrerNodeFlag = flags[referrerNodeIndex] & flag;
@@ -317,10 +319,10 @@ class TraceFinder {
                     if (referrerNodeIndex !== ROOT_NODE_INDEX &&
                         nodeFlag &&
                         !referrerNodeFlag) {
-                        continue;
+                        return;
                     }
                     if (!this.shouldTraverseEdge(edge)) {
-                        continue;
+                        return;
                     }
                     let referrerPostOrderIndex = nodeIndex2PostOrderIndex[referrerNodeIndex];
                     if (dominators[referrerPostOrderIndex] !== emptySlot) {
@@ -339,10 +341,10 @@ class TraceFinder {
                         }
                         // no need to check any further if reaching the root node
                         if (newDominatorIndex === rootPostOrderedIndex) {
-                            break;
+                            return { stop: true };
                         }
                     }
-                }
+                });
                 // set root node as the dominator of orphan nodes
                 if (isOrphanNode) {
                     newDominatorIndex = rootPostOrderedIndex;
@@ -384,13 +386,12 @@ class TraceFinder {
         return retainedSizes;
     }
     shouldIgnoreEdgeInTraceFinding(edge) {
-        if (!edge || !edge.toNode || !edge.fromNode) {
-            return true;
-        }
+        const fromNode = edge.fromNode;
+        const toNode = edge.toNode;
         return (Config_1.default.hideBrowserLeak &&
-            (Utils_1.default.isBlinkRootNode(edge.fromNode) ||
-                Utils_1.default.isPendingActivityNode(edge.fromNode)) &&
-            Utils_1.default.isDetachedDOMNode(edge.toNode));
+            (Utils_1.default.isBlinkRootNode(fromNode) ||
+                Utils_1.default.isPendingActivityNode(fromNode)) &&
+            Utils_1.default.isDetachedDOMNode(toNode));
     }
     shouldTraverseEdge(edge, options = {}) {
         if (this.isBlockListedEdge(edge)) {
@@ -400,31 +401,22 @@ class TraceFinder {
     }
     // remove edges that are already part of reported leaked paths
     isBlockListedEdge(edge) {
-        if (!edge) {
-            return false;
-        }
-        const isStrName = typeof edge.name_or_index === 'string';
+        const nameOrIndex = edge.name_or_index;
         if (!Config_1.default.traverseDevToolsConsole &&
             edge.type === 'internal' &&
-            isStrName &&
-            String(edge.name_or_index).indexOf('DevTools console') >= 0) {
+            typeof nameOrIndex === 'string' &&
+            nameOrIndex.indexOf('DevTools console') >= 0) {
             return true;
         }
-        if (Config_1.default.edgeNameBlockList.has(String(edge.name_or_index))) {
+        if (Config_1.default.edgeNameBlockList.has(String(nameOrIndex))) {
             return true;
         }
         return false;
     }
     isLessPreferableEdge(edge) {
-        if (!edge) {
-            return false;
-        }
         return Config_1.default.edgeNameGreyList.has(String(edge.name_or_index));
     }
     isLessPreferableNode(node) {
-        if (!node) {
-            return false;
-        }
         return Config_1.default.nodeNameGreyList.has(node.name);
     }
     // each edge is indexed by fromNode's ID, toNode's ID, edge name, and edge type
@@ -434,16 +426,21 @@ class TraceFinder {
         return `${fromNode.id}|${edge.name_or_index}|${edge.type}|${toNode.id}`;
     }
     calculateAllNodesRetainedSizes(snapshot) {
-        Console_1.default.overwrite('calculating dominators and retained sizes...');
+        Console_1.default.overwrite('calculating dominators and retained sizes .');
         // step 1: build post order index
         const flags = new Uint32Array(snapshot.nodes.length);
+        Console_1.default.overwrite('calculating dominators and retained sizes ..');
         this.flagReachableNodesFromWindow(snapshot, flags, PAGE_OBJECT_FLAG);
+        Console_1.default.overwrite('calculating dominators and retained sizes ...');
         const postOrderInfo = this.buildPostOrderIndex(snapshot, flags);
         // step 2: build dominator relations
+        Console_1.default.overwrite('calculating dominators and retained sizes .');
         const dominatorInfo = this.calculateDominatorNodesFromPostOrder(snapshot.nodes, snapshot.edges, postOrderInfo, flags);
         // step 3: calculate retained sizes
+        Console_1.default.overwrite('calculating dominators and retained sizes ..');
         const retainedSizes = this.calculateRetainedSizesFromDominatorNodes(snapshot.nodes, dominatorInfo, postOrderInfo);
         // step 4: assign retained sizes and dominators to nodes
+        Console_1.default.overwrite('calculating dominators and retained sizes ...');
         for (let i = 0; i < retainedSizes.length; i++) {
             const node = snapshot.nodes.get(i);
             node.retainedSize = retainedSizes[i];
@@ -473,8 +470,9 @@ class TraceFinder {
                 const node = curQueue.pop();
                 visited[node.nodeIndex] = 1;
                 for (const edge of node.references) {
+                    const toNode = edge.toNode;
                     // skip nodes that already have a parent
-                    if (edge.toNode.pathEdge) {
+                    if (toNode.hasPathEdge) {
                         continue;
                     }
                     if (!this.shouldTraverseEdge(edge, traverseOption)) {
@@ -491,31 +489,32 @@ class TraceFinder {
                     }
                     // postpone traversing edges and nodes that are less preferable
                     if (this.isLessPreferableEdge(edge) ||
-                        this.isLessPreferableNode(edge.toNode)) {
+                        this.isLessPreferableNode(toNode)) {
                         postponeQueue.push(edge);
                     }
                     else {
-                        edge.toNode.pathEdge = edge;
-                        nextQueue.push(edge.toNode);
+                        toNode.pathEdge = edge;
+                        nextQueue.push(toNode);
                     }
-                    queued[edge.toNode.nodeIndex] = 1;
+                    queued[toNode.nodeIndex] = 1;
                 }
             }
             // if no other preferable traces available
             // traverse the postpone queue
             while (nextQueue.length === 0 && postponeQueue.length > 0) {
                 const edge = postponeQueue.pop();
-                if (edge.toNode.pathEdge) {
+                const toNode = edge.toNode;
+                if (toNode.hasPathEdge) {
                     continue;
                 }
-                edge.toNode.pathEdge = edge;
-                nextQueue.push(edge.toNode);
+                toNode.pathEdge = edge;
+                nextQueue.push(toNode);
             }
             // if no other preferable traces available
             // consider the low priority root nodes
             while (nextQueue.length === 0 && lowPriRootLists.length > 0) {
                 const root = lowPriRootLists.pop();
-                if (root.pathEdge) {
+                if (root.hasPathEdge) {
                     continue;
                 }
                 nextQueue.push(root);
@@ -524,11 +523,11 @@ class TraceFinder {
         }
     }
     getPathToGCRoots(_snapshot, node) {
-        if (!node || !node.pathEdge) {
+        if (!node || !node.hasPathEdge) {
             return null;
         }
         let path = { node };
-        while (node && node.pathEdge) {
+        while (node && node.hasPathEdge) {
             const edge = node.pathEdge;
             path = { node: edge.fromNode, edge, next: path };
             node = edge.fromNode;

package/dist/trace-cluster/ClusterUtils.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 declare const _default: {
     isSimilarTrace: (t1: import("..").LeakTrace, t2: import("..").LeakTrace) => boolean;

package/dist/trace-cluster/ClusterUtils.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };

package/dist/trace-cluster/ClusterUtilsHelper.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { AnyValue, LeakTraceElement, LeakTrace } from '../lib/Types';
 declare type NameWeightMapType = Map<string | RegExp | number, number>;

package/dist/trace-cluster/ClusterUtilsHelper.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.debugTraceElementSimilarityStats = exports.debugLog = void 0;

package/dist/trace-cluster/ClusteringHeuristics.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 declare const _default: {
     edgeNameStopWords: Map<any, any>;

package/dist/trace-cluster/ClusteringHeuristics.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };

package/dist/trace-cluster/EvalutationMetric.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 declare type ClusteredLeakTraces = Record<string, string>;
 declare const _default: {

package/dist/trace-cluster/EvalutationMetric.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 ////////////////////////

package/dist/trace-cluster/SequentialClustering.d.ts

@@ -0,0 +1,17 @@
+/**
+ * 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 ws_labs
+ */
+import type { LeakTrace } from '../lib/Types';
+export default class SequentialClustering {
+    private existingRepresentativeTraces;
+    private traceSimilarity;
+    constructor();
+    cluster(newLeakTraces: LeakTrace[]): LeakTrace[][];
+}
+//# sourceMappingURL=SequentialClustering.d.ts.map

package/dist/trace-cluster/SequentialClustering.js

@@ -0,0 +1,47 @@
+"use strict";
+/**
+ * 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 ws_labs
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const ClusterUtils_1 = __importDefault(require("./ClusterUtils"));
+const TraceSimilarityStrategy_1 = __importDefault(require("./strategies/TraceSimilarityStrategy"));
+const MLTraceSimilarityStrategy_1 = __importDefault(require("./strategies/MLTraceSimilarityStrategy"));
+const Config_1 = __importDefault(require("../lib/Config"));
+class SequentialClustering {
+    constructor() {
+        this.existingRepresentativeTraces = [];
+        this.traceSimilarity = Config_1.default.isMLClustering
+            ? new MLTraceSimilarityStrategy_1.default()
+            : new TraceSimilarityStrategy_1.default();
+    }
+    cluster(newLeakTraces) {
+        const { allClusters: clusters } = this.traceSimilarity.diffTraces(newLeakTraces, []);
+        const representativeTracesToAdd = [];
+        // Second round of clustering and relabeling
+        outer: for (let i = 0; i < clusters.length; i++) {
+            const newRepTrace = clusters[i][0];
+            for (const exRepTrace of this.existingRepresentativeTraces) {
+                if (ClusterUtils_1.default.isSimilarTrace(exRepTrace, newRepTrace)) {
+                    clusters[i].unshift(exRepTrace);
+                    continue outer;
+                }
+            }
+            representativeTracesToAdd.push(newRepTrace);
+        }
+        this.existingRepresentativeTraces = [
+            ...this.existingRepresentativeTraces,
+            ...representativeTracesToAdd,
+        ];
+        return clusters;
+    }
+}
+exports.default = SequentialClustering;

package/dist/trace-cluster/TraceBucket.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { IHeapNode, IHeapSnapshot, LeakTrace, LeakTracePathItem, Optional, TraceCluster, TraceClusterDiff, IClusterStrategy } from '../lib/Types';
 import type { NormalizedTraceElement } from './TraceElement';
@@ -25,6 +25,7 @@ export default class NormalizedTrace {
     private static diffTraces;
     static diffClusters(newClusters: TraceCluster[], existingClusters: TraceCluster[]): TraceClusterDiff;
     static clusterLeakTraces(leakTraces: LeakTrace[]): Record<string, string>;
+    static clusteredLeakTracesToRecord(allClusters: LeakTrace[][]): Record<string, string>;
     static filterClusters(clusters: TraceCluster[]): TraceCluster[];
     static clusterPaths(paths: LeakTracePathItem[], snapshot: IHeapSnapshot, aggregateDominatorMetrics: AggregateNodeCb, option?: {
         strategy?: IClusterStrategy;

package/dist/trace-cluster/TraceBucket.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
@@ -20,6 +20,7 @@ const Utils_1 = __importDefault(require("../lib/Utils"));
 const TraceElement_1 = require("./TraceElement");
 const TraceSimilarityStrategy_1 = __importDefault(require("./strategies/TraceSimilarityStrategy"));
 const TraceAsClusterStrategy_1 = __importDefault(require("./strategies/TraceAsClusterStrategy"));
+const MLTraceSimilarityStrategy_1 = __importDefault(require("./strategies/MLTraceSimilarityStrategy"));
 // sync up with html/intern/js/webspeed/memlab/lib/LeakCluster.js
 class NormalizedTrace {
     constructor(p = null, snapshot = null) {
@@ -157,7 +158,14 @@ class NormalizedTrace {
         };
     }
     static clusterLeakTraces(leakTraces) {
-        const { allClusters } = NormalizedTrace.diffTraces(leakTraces, []);
+        const { allClusters } = NormalizedTrace.diffTraces(leakTraces, [], {
+            strategy: Config_1.default.isMLClustering
+                ? new MLTraceSimilarityStrategy_1.default()
+                : undefined,
+        });
+        return NormalizedTrace.clusteredLeakTracesToRecord(allClusters);
+    }
+    static clusteredLeakTracesToRecord(allClusters) {
         const lastNodeFromTrace = (trace) => trace[trace.length - 1];
         const labaledLeakTraces = allClusters.reduce((acc, bucket) => {
             const lastNodeFromFirstTrace = lastNodeFromTrace(bucket[0]);

package/dist/trace-cluster/TraceElement.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { EdgeIterationCallback, IHeapEdge, IHeapLocation, IHeapNode, IHeapSnapshot, IHeapStringNode, Nullable } from '../lib/Types';
 export declare class NodeRecord implements IHeapNode {
@@ -37,6 +37,8 @@ export declare class NodeRecord implements IHeapNode {
     findAnyReference(): Nullable<IHeapEdge>;
     findAnyReferrer(): Nullable<IHeapEdge>;
     findReferrers(): IHeapEdge[];
+    set hasPathEdge(f: boolean);
+    get hasPathEdge(): boolean;
     set pathEdge(r: IHeapEdge);
     get pathEdge(): IHeapEdge;
     set dominatorNode(r: IHeapNode);

package/dist/trace-cluster/TraceElement.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
@@ -79,6 +79,12 @@ class NodeRecord {
     findReferrers() {
         throw new Error('NodeRecord.findReferrers is not implemented');
     }
+    set hasPathEdge(f) {
+        throw new Error('NodeRecord.hasPathEdge cannot be assigned');
+    }
+    get hasPathEdge() {
+        throw new Error('NodeRecord.hasPathEdge cannot be read');
+    }
     set pathEdge(r) {
         throw new Error('NodeRecord.pathEdge cannot be assigned');
     }

package/dist/trace-cluster/strategies/MLTraceSimilarityStrategy.d.ts

@@ -0,0 +1,15 @@
+/**
+ * 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 ws_labs
+ */
+import type { IClusterStrategy, LeakTrace, TraceDiff } from '../../lib/Types';
+export default class MLTraceSimilarityStrategy implements IClusterStrategy {
+    diffTraces(newLeakTraces: LeakTrace[]): TraceDiff;
+    traceToDoc(trace: LeakTrace): string;
+}
+//# sourceMappingURL=MLTraceSimilarityStrategy.d.ts.map

package/dist/trace-cluster/strategies/MLTraceSimilarityStrategy.js

@@ -0,0 +1,61 @@
+"use strict";
+/**
+ * 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 ws_labs
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const Config_1 = __importDefault(require("../../lib/Config"));
+const DistanceMatrix_1 = require("./machine-learning/DistanceMatrix");
+const HAC_1 = require("./machine-learning/HAC");
+const TfidfVectorizer_1 = require("./machine-learning/TfidfVectorizer");
+class MLTraceSimilarityStrategy {
+    diffTraces(newLeakTraces) {
+        var _a;
+        const rawDocuments = newLeakTraces.map(this.traceToDoc);
+        const vectorizer = new TfidfVectorizer_1.TfidfVectorizer({ rawDocuments });
+        const tfidfs = vectorizer.computeTfidfs();
+        const dmatrix = (0, DistanceMatrix_1.distance)(tfidfs);
+        const result = (0, HAC_1.cluster)(rawDocuments.length, dmatrix, Config_1.default.mlClusteringLinkageMaxDistance);
+        const map = new Map();
+        for (let i = 0; i < result.length; i++) {
+            const traceIdx = result[i];
+            const repTrace = newLeakTraces[traceIdx];
+            const trace = newLeakTraces[i];
+            if (!map.has(repTrace)) {
+                map.set(repTrace, [repTrace]);
+            }
+            // to please linter
+            (_a = map.get(repTrace)) === null || _a === void 0 ? void 0 : _a.push(trace);
+        }
+        return {
+            allClusters: Array.from(map.values()),
+            staleClusters: [],
+            clustersToAdd: [],
+        };
+    }
+    traceToDoc(trace) {
+        const res = [];
+        for (const t of trace) {
+            let name = t.kind === 'node' ? String(t.name) : String(t.name_or_index);
+            if (name === '') {
+                name = '_null_';
+            }
+            name = name.replace(/ /g, '_');
+            name = name.replace(/\d/g, '');
+            if (name === '') {
+                name = '_number_';
+            }
+            res.push(name);
+        }
+        return res.join(' ');
+    }
+}
+exports.default = MLTraceSimilarityStrategy;

package/dist/trace-cluster/strategies/TraceAsClusterStrategy.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { IClusterStrategy, LeakTrace, TraceDiff } from '../../lib/Types';
 export default class TraceAsClusterStrategy implements IClusterStrategy {

package/dist/trace-cluster/strategies/TraceAsClusterStrategy.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };

package/dist/trace-cluster/strategies/TraceSimilarityStrategy.d.ts

@@ -4,8 +4,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 import type { IClusterStrategy, LeakTrace, TraceDiff } from '../../lib/Types';
 export default class TraceSimilarityStrategy implements IClusterStrategy {

package/dist/trace-cluster/strategies/TraceSimilarityStrategy.js

@@ -5,8 +5,8 @@
  * This source code is licensed under the MIT license found in the
  * LICENSE file in the root directory of this source tree.
  *
- * @emails oncall+ws_labs
  * @format
+ * @oncall ws_labs
  */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };