@memlab/core 1.1.6 → 1.1.10

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 };
@@ -163,6 +163,9 @@ class NormalizedTrace {
                 ? 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]);
@@ -208,12 +211,18 @@ class NormalizedTrace {
         const { allClusters } = NormalizedTrace.diffTraces(traces, [], option);
         // construct TraceCluster from clustering result
         let clusters = allClusters.map((traces) => {
+            const representativeTrace = traces[0];
             const cluster = {
-                path: traceToPathMap.get(traces[0]),
+                path: traceToPathMap.get(representativeTrace),
                 count: traces.length,
                 snapshot,
                 retainedSize: 0,
             };
+            // add representative object id if there is one
+            const lastNode = representativeTrace[representativeTrace.length - 1];
+            if ('id' in lastNode) {
+                cluster.id = lastNode.id;
+            }
             traces.forEach((trace) => {
                 NormalizedTrace.addLeakedNodeToCluster(cluster, traceToPathMap.get(trace));
             });
@@ -222,7 +231,6 @@ class NormalizedTrace {
         });
         clusters = NormalizedTrace.filterClusters(clusters);
         clusters.sort((c1, c2) => { var _a, _b; return ((_a = c2.retainedSize) !== null && _a !== void 0 ? _a : 0) - ((_b = c1.retainedSize) !== null && _b !== void 0 ? _b : 0); });
-        Console_1.default.midLevel(`MemLab found ${clusters.length} leak(s)`);
         return clusters;
     }
     static generateUnClassifiedClusters(paths, snapshot, aggregateDominatorMetrics) {

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

@@ -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 MLTraceSimilarityStrategy implements IClusterStrategy {

package/dist/trace-cluster/strategies/MLTraceSimilarityStrategy.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 };
@@ -32,7 +32,7 @@ class MLTraceSimilarityStrategy {
             if (!map.has(repTrace)) {
                 map.set(repTrace, [repTrace]);
             }
-            // to please lint
+            // to please linter
             (_a = map.get(repTrace)) === null || _a === void 0 ? void 0 : _a.push(trace);
         }
         return {

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 };

package/dist/trace-cluster/strategies/machine-learning/DistanceMatrix.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
  */
 export declare const distance: (tfidfs: Record<string, number>[]) => Float32Array;
 //# sourceMappingURL=DistanceMatrix.d.ts.map

package/dist/trace-cluster/strategies/machine-learning/DistanceMatrix.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.distance = void 0;

package/dist/trace-cluster/strategies/machine-learning/HAC.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
  */
 /**
  *
@@ -13,5 +13,5 @@
  * @param {*} D condenced distance matrix
  * @returns labels - list of doc ids as clusters
  */
-export declare const cluster: (nDocs: number, condensedDistanceMatrix: Float32Array, maxDistanceThreshold: number) => number[];
+export declare const cluster: (nDocs: number, condensedDistanceMatrix: Float32Array, maxDistanceThreshold: number) => number[] | Uint32Array;
 //# sourceMappingURL=HAC.d.ts.map

package/dist/trace-cluster/strategies/machine-learning/HAC.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.cluster = void 0;
@@ -18,13 +18,13 @@ const condensedIndex = (n, i, j) => {
     // (n - 1) + (n - 2) + ... + (n - i) + (j - i) - 1
     return n * i - (i * (i + 1)) / 2 + (j - i - 1);
 };
-const getRootLabel = (array, idx) => {
+function getRootLabel(array, idx) {
     let rootIdx = idx;
     while (array[rootIdx] !== rootIdx) {
         rootIdx = array[rootIdx];
     }
     return rootIdx;
-};
+}
 /**
  *
  * @param {*} nDocs number of docs
@@ -42,9 +42,7 @@ const cluster = (nDocs, condensedDistanceMatrix, maxDistanceThreshold) => {
     let traceBIdx = -1;
     let currentMin = Number.MAX_SAFE_INTEGER;
     let distanceBetweenTraces;
-    const labels = Array(nDocs)
-        .fill(0)
-        .map((_, idx) => idx);
+    const labels = new Uint32Array(nDocs).map((_, idx) => idx);
     for (let k = 0; k < nDocs - 1; k++) {
         traceBIdx = -1;
         if (chainLength === 0) {
@@ -77,7 +75,7 @@ const cluster = (nDocs, condensedDistanceMatrix, maxDistanceThreshold) => {
                     traceBIdx = i;
                 }
             }
-            // to make sure we found a two mutual traces whose distance is smallest.
+            // make sure that traceA and traceB are closest to each other
             if (chainLength > 1 &&
                 traceBIdx !== -1 &&
                 traceBIdx === clusterChain[chainLength - 2]) {

package/dist/trace-cluster/strategies/machine-learning/Ngram.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
  */
 export declare function nGram(n: number, terms: string[]): string[];
 //# sourceMappingURL=Ngram.d.ts.map

package/dist/trace-cluster/strategies/machine-learning/Ngram.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.nGram = void 0;

package/dist/trace-cluster/strategies/machine-learning/TfidfVectorizer.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
  */
 interface TfidfVectorizerProps {
     rawDocuments: string[];

package/dist/trace-cluster/strategies/machine-learning/TfidfVectorizer.js

@@ -5,22 +5,26 @@
  * 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 };
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TfidfVectorizer = void 0;
+const Config_1 = __importDefault(require("../../../lib/Config"));
 const Ngram_1 = require("./Ngram");
 const SMOOTHING_KEY = '__smoothObjectKey';
 const VOCAB_IDX_FOR_DOC_WITH_HIGH_DF = '-1';
 class TfidfVectorizer {
-    constructor({ rawDocuments, maxDF = 0.8 }) {
+    constructor({ rawDocuments, maxDF }) {
         this.rawDocuments = [];
         this.vocabulary = Object.create(null);
         this.documentFrequency = Object.create(null);
         this.documents = [];
         this.rawDocuments = rawDocuments;
-        this.maxDF = maxDF;
+        this.maxDF = maxDF !== null && maxDF !== void 0 ? maxDF : Config_1.default.mlMaxDF;
     }
     computeTfidfs() {
         const tokenizedDocuments = this.rawDocuments.map(this.tokenize);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@memlab/core",
-  "version": "1.1.6",
+  "version": "1.1.10",
   "license": "MIT",
   "description": "memlab core libraries",
   "author": "Liang Gong <lgong@fb.com>",