@memlab/core 1.1.6 → 1.1.10

package/dist/lib/leak-filters/BaseLeakFilter.rule.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.LeakDecision = void 0;

package/dist/lib/leak-filters/LeakFilterRuleList.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 { ILeakObjectFilterRule } from './BaseLeakFilter.rule';
 declare const _default: ILeakObjectFilterRule[];

package/dist/lib/leak-filters/LeakFilterRuleList.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/lib/leak-filters/LeakObjectFilter.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 { MemLabConfig } from '../Config';
 import type { HeapNodeIdSet, IHeapNode, IHeapSnapshot } from '../Types';

package/dist/lib/leak-filters/LeakObjectFilter.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/lib/leak-filters/rules/FilterByExternalFilter.rule.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 { MemLabConfig } from '../../Config';
 import type { HeapNodeIdSet, IHeapNode, IHeapSnapshot } from '../../Types';

package/dist/lib/leak-filters/rules/FilterByExternalFilter.rule.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.FilterByExternalFilterRule = void 0;

package/dist/lib/leak-filters/rules/FilterDetachedDOMElement.rule.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 { MemLabConfig } from '../../Config';
 import type { IHeapNode } from '../../Types';

package/dist/lib/leak-filters/rules/FilterDetachedDOMElement.rule.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/lib/leak-filters/rules/FilterHermesNode.rule.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 { MemLabConfig } from '../../Config';
 import type { IHeapNode } from '../../Types';

package/dist/lib/leak-filters/rules/FilterHermesNode.rule.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/lib/leak-filters/rules/FilterOverSizedNodeAsLeak.rule.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 { MemLabConfig } from '../../Config';
 import type { IHeapNode } from '../../Types';

package/dist/lib/leak-filters/rules/FilterOverSizedNodeAsLeak.rule.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.FilterOverSizedNodeAsLeakRule = void 0;

package/dist/lib/leak-filters/rules/FilterStackTraceFrame.rule.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 { MemLabConfig } from '../../Config';
 import type { IHeapNode } from '../../Types';

package/dist/lib/leak-filters/rules/FilterStackTraceFrame.rule.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/lib/leak-filters/rules/FilterTrivialNode.rule.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 { MemLabConfig } from '../../Config';
 import type { IHeapNode } from '../../Types';

package/dist/lib/leak-filters/rules/FilterTrivialNode.rule.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/lib/leak-filters/rules/FilterUnmountedFiberNode.rule.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 { MemLabConfig } from '../../Config';
 import type { IHeapNode } from '../../Types';

package/dist/lib/leak-filters/rules/FilterUnmountedFiberNode.rule.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/logger/LeakClusterLogger.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 { E2EStepInfo, TraceCluster, TraceClusterDiff, TraceClusterMetaInfo } from '../lib/Types';
 declare class LeakClusterLogger {

package/dist/logger/LeakClusterLogger.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/logger/LeakTraceDetailsLogger.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 { IHeapSnapshot, ISerializedInfo, LeakTracePathItem, Nullable } from '../lib/Types';
 declare class LeakTraceDetailsLogger {

package/dist/logger/LeakTraceDetailsLogger.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/BaseMode.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 { E2EStepInfo, Config, IE2EScenarioVisitPlan, Optional } from '../lib/Types';
 import type { Page } from 'puppeteer';

package/dist/modes/BaseMode.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/InteractionTestMode.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';
 declare class InteractionTestMode extends BaseMode {

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,20 @@ class TraceFinder {
         return retainedSizes;
     }
     shouldIgnoreEdgeInTraceFinding(edge) {
-        if (!edge || !edge.toNode || !edge.fromNode) {
+        const fromNode = edge.fromNode;
+        const toNode = edge.toNode;
+        const isDetachedNode = Utils_1.default.isDetachedDOMNode(toNode);
+        if (Config_1.default.hideBrowserLeak &&
+            Utils_1.default.isBlinkRootNode(fromNode) &&
+            isDetachedNode) {
+            return true;
+        }
+        if (!Config_1.default.reportLeaksInTimers &&
+            Utils_1.default.isPendingActivityNode(fromNode) &&
+            isDetachedNode) {
             return true;
         }
-        return (Config_1.default.hideBrowserLeak &&
-            (Utils_1.default.isBlinkRootNode(edge.fromNode) ||
-                Utils_1.default.isPendingActivityNode(edge.fromNode)) &&
-            Utils_1.default.isDetachedDOMNode(edge.toNode));
+        return false;
     }
     shouldTraverseEdge(edge, options = {}) {
         if (this.isBlockListedEdge(edge)) {
@@ -400,31 +409,33 @@ 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(nameOrIndex))) {
+            return true;
+        }
+        if (Config_1.default.nodeNameBlockList.has(edge.toNode.name)) {
             return true;
         }
-        if (Config_1.default.edgeNameBlockList.has(String(edge.name_or_index))) {
+        if (Config_1.default.nodeNameBlockList.has(edge.fromNode.name)) {
             return true;
         }
         return false;
     }
     isLessPreferableEdge(edge) {
-        if (!edge) {
-            return false;
+        // pending activities -> DOM element is less preferrable
+        if (Utils_1.default.isPendingActivityNode(edge.fromNode) &&
+            Utils_1.default.isDOMNodeIncomplete(edge.toNode)) {
+            return true;
         }
         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 +445,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 +489,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 +508,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 +542,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 };