@paulirish/trace_engine 0.0.10 → 0.0.12

package/models/trace/EntriesFilter.js

@@ -1,182 +1,243 @@
-import * as Platform from "../../core/platform/platform.js";
-import * as Helpers from "./helpers/helpers.js";
-import * as Types from "./types/types.js";
-export var FilterAction = /* @__PURE__ */ ((FilterAction2) => {
-  FilterAction2["MERGE_FUNCTION"] = "MERGE_FUNCTION";
-  FilterAction2["COLLAPSE_FUNCTION"] = "COLLAPSE_FUNCTION";
-  FilterAction2["COLLAPSE_REPEATING_DESCENDANTS"] = "COLLAPSE_REPEATING_DESCENDANTS";
-  FilterAction2["RESET_CHILDREN"] = "RESET_CHILDREN";
-  FilterAction2["UNDO_ALL_ACTIONS"] = "UNDO_ALL_ACTIONS";
-  return FilterAction2;
-})(FilterAction || {});
+// Copyright 2023 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+import * as Platform from '../../core/platform/platform.js';
+import * as Helpers from './helpers/helpers.js';
+import * as Types from './types/types.js';
+/**
+ * This class can take in a thread that has been generated by the
+ * RendererHandler and apply certain actions to it in order to modify what is
+ * shown to the user. These actions can be automatically applied by DevTools or
+ * applied by the user.
+ *
+ * Once actions are applied, the invisibleEntries() method will return the
+ * entries that are invisible, and this is the list of entries that should be
+ * removed before rendering the resulting thread on the timeline.
+ **/
 export class EntriesFilter {
-  #entryToNode;
-  #invisibleEntries = [];
-  #modifiedVisibleEntries = [];
-  #entryToDescendantsMap = /* @__PURE__ */ new Map();
-  constructor(entryToNode) {
-    this.#entryToNode = entryToNode;
-  }
-  findPossibleActions(entry) {
-    const entryNode = this.#entryToNode.get(entry);
-    if (!entryNode) {
-      return {
-        ["MERGE_FUNCTION" /* MERGE_FUNCTION */]: false,
-        ["COLLAPSE_FUNCTION" /* COLLAPSE_FUNCTION */]: false,
-        ["COLLAPSE_REPEATING_DESCENDANTS" /* COLLAPSE_REPEATING_DESCENDANTS */]: false,
-        ["RESET_CHILDREN" /* RESET_CHILDREN */]: false,
-        ["UNDO_ALL_ACTIONS" /* UNDO_ALL_ACTIONS */]: false
-      };
+    // Maps from an individual TraceEvent entry to its representation as a
+    // RendererEntryNode. We need this so we can then parse the tree structure
+    // generated by the RendererHandler.
+    #entryToNode;
+    // Track the set of invisible entries.
+    #invisibleEntries = [];
+    // List of entries whose children are modified. This list is used to
+    // keep track of entries that should be identified in the UI as modified.
+    #modifiedVisibleEntries = [];
+    // Cache for descendants of entry that have already been gathered. The descendants
+    // will never change so we can avoid running the potentially expensive search again.
+    #entryToDescendantsMap = new Map();
+    constructor(entryToNode) {
+        this.#entryToNode = entryToNode;
     }
-    const entryParent = entryNode.parent;
-    const allVisibleDescendants = this.#findAllDescendantsOfNode(entryNode).filter((descendant) => !this.#invisibleEntries.includes(descendant));
-    const allVisibleRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode).filter((descendant) => !this.#invisibleEntries.includes(descendant));
-    const allInVisibleDescendants = this.#findAllDescendantsOfNode(entryNode).filter((descendant) => this.#invisibleEntries.includes(descendant));
-    const possibleActions = {
-      ["MERGE_FUNCTION" /* MERGE_FUNCTION */]: entryParent !== null,
-      ["COLLAPSE_FUNCTION" /* COLLAPSE_FUNCTION */]: allVisibleDescendants.length > 0,
-      ["COLLAPSE_REPEATING_DESCENDANTS" /* COLLAPSE_REPEATING_DESCENDANTS */]: allVisibleRepeatingDescendants.length > 0,
-      ["RESET_CHILDREN" /* RESET_CHILDREN */]: allInVisibleDescendants.length > 0,
-      ["UNDO_ALL_ACTIONS" /* UNDO_ALL_ACTIONS */]: this.#invisibleEntries.length > 0
-    };
-    return possibleActions;
-  }
-  findHiddenDescendantsAmount(entry) {
-    const entryNode = this.#entryToNode.get(entry);
-    if (!entryNode) {
-      return 0;
-    }
-    const allDescendants = this.#findAllDescendantsOfNode(entryNode);
-    return allDescendants.filter((descendant) => this.invisibleEntries().includes(descendant)).length;
-  }
-  invisibleEntries() {
-    return this.#invisibleEntries;
-  }
-  applyFilterAction(action) {
-    const entriesToHide = /* @__PURE__ */ new Set();
-    switch (action.type) {
-      case "MERGE_FUNCTION" /* MERGE_FUNCTION */: {
-        entriesToHide.add(action.entry);
-        const actionNode = this.#entryToNode.get(action.entry) || null;
-        const parentNode = actionNode && this.#findNextVisibleParent(actionNode);
-        if (parentNode) {
-          this.#modifiedVisibleEntries.push(parentNode?.entry);
-        }
-        break;
-      }
-      case "COLLAPSE_FUNCTION" /* COLLAPSE_FUNCTION */: {
-        const entryNode = this.#entryToNode.get(action.entry);
+    /**
+     * Checks which actions can be applied on an entry. This allows us to only show possible actions in the Context Menu.
+     * For example, if an entry has no children, COLLAPSE_FUNCTION will not change the FlameChart, therefore there is no need to show this action as an option.
+     **/
+    findPossibleActions(entry) {
+        const entryNode = this.#entryToNode.get(entry);
         if (!entryNode) {
-          break;
-        }
-        const allDescendants = this.#findAllDescendantsOfNode(entryNode);
-        allDescendants.forEach((descendant) => entriesToHide.add(descendant));
-        if (entriesToHide.size > 0) {
-          this.#modifiedVisibleEntries.push(action.entry);
+            // Invalid node was given, return no possible actions.
+            return {
+                ["MERGE_FUNCTION" /* FilterAction.MERGE_FUNCTION */]: false,
+                ["COLLAPSE_FUNCTION" /* FilterAction.COLLAPSE_FUNCTION */]: false,
+                ["COLLAPSE_REPEATING_DESCENDANTS" /* FilterAction.COLLAPSE_REPEATING_DESCENDANTS */]: false,
+                ["RESET_CHILDREN" /* FilterAction.RESET_CHILDREN */]: false,
+                ["UNDO_ALL_ACTIONS" /* FilterAction.UNDO_ALL_ACTIONS */]: false,
+            };
         }
-        break;
-      }
-      case "COLLAPSE_REPEATING_DESCENDANTS" /* COLLAPSE_REPEATING_DESCENDANTS */: {
-        const entryNode = this.#entryToNode.get(action.entry);
+        const entryParent = entryNode.parent;
+        const allVisibleDescendants = this.#findAllDescendantsOfNode(entryNode).filter(descendant => !this.#invisibleEntries.includes(descendant));
+        const allVisibleRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode).filter(descendant => !this.#invisibleEntries.includes(descendant));
+        const allInVisibleDescendants = this.#findAllDescendantsOfNode(entryNode).filter(descendant => this.#invisibleEntries.includes(descendant));
+        // If there are children to hide, indicate action as possible
+        const possibleActions = {
+            ["MERGE_FUNCTION" /* FilterAction.MERGE_FUNCTION */]: entryParent !== null,
+            ["COLLAPSE_FUNCTION" /* FilterAction.COLLAPSE_FUNCTION */]: allVisibleDescendants.length > 0,
+            ["COLLAPSE_REPEATING_DESCENDANTS" /* FilterAction.COLLAPSE_REPEATING_DESCENDANTS */]: allVisibleRepeatingDescendants.length > 0,
+            ["RESET_CHILDREN" /* FilterAction.RESET_CHILDREN */]: allInVisibleDescendants.length > 0,
+            ["UNDO_ALL_ACTIONS" /* FilterAction.UNDO_ALL_ACTIONS */]: this.#invisibleEntries.length > 0,
+        };
+        return possibleActions;
+    }
+    /**
+     * Returns the amount of entry descendants that belong to the hidden entries array.
+     * **/
+    findHiddenDescendantsAmount(entry) {
+        const entryNode = this.#entryToNode.get(entry);
         if (!entryNode) {
-          break;
+            return 0;
         }
-        const allRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode);
-        allRepeatingDescendants.forEach((descendant) => entriesToHide.add(descendant));
-        if (entriesToHide.size > 0) {
-          this.#modifiedVisibleEntries.push(action.entry);
+        const allDescendants = this.#findAllDescendantsOfNode(entryNode);
+        return allDescendants.filter(descendant => this.invisibleEntries().includes(descendant)).length;
+    }
+    /**
+     * Returns the set of entries that are invisible given the set of applied actions.
+     **/
+    invisibleEntries() {
+        return this.#invisibleEntries;
+    }
+    /**
+     * Applies an action to hide entries or removes entries
+     * from hidden entries array depending on the action.
+     **/
+    applyFilterAction(action) {
+        // We apply new user action to the set of all entries, and mark
+        // any that should be hidden by adding them to this set.
+        // Another approach would be to use splice() to remove items from the
+        // array, but doing this would be a mutation of the arry for every hidden
+        // event. Instead, we add entries to this set and return it as an array at the end.
+        const entriesToHide = new Set();
+        switch (action.type) {
+            case "MERGE_FUNCTION" /* FilterAction.MERGE_FUNCTION */: {
+                // The entry that was clicked on is merged into its parent. All its
+                // children remain visible, so we just have to hide the entry that was
+                // selected.
+                entriesToHide.add(action.entry);
+                // If parent node exists, add it to modifiedVisibleEntries, so it would be possible to uncollapse its' children.
+                const actionNode = this.#entryToNode.get(action.entry) || null;
+                const parentNode = actionNode && this.#findNextVisibleParent(actionNode);
+                if (parentNode) {
+                    this.#modifiedVisibleEntries.push(parentNode?.entry);
+                }
+                break;
+            }
+            case "COLLAPSE_FUNCTION" /* FilterAction.COLLAPSE_FUNCTION */: {
+                // The entry itself remains visible, but all of its descendants are hidden.
+                const entryNode = this.#entryToNode.get(action.entry);
+                if (!entryNode) {
+                    // Invalid node was given, just ignore and move on.
+                    break;
+                }
+                const allDescendants = this.#findAllDescendantsOfNode(entryNode);
+                allDescendants.forEach(descendant => entriesToHide.add(descendant));
+                // If there are any children to hide, add selected entry to modifiedVisibleEntries array to identify in the UI that children of the selected entry are modified.
+                if (entriesToHide.size > 0) {
+                    this.#modifiedVisibleEntries.push(action.entry);
+                }
+                break;
+            }
+            case "COLLAPSE_REPEATING_DESCENDANTS" /* FilterAction.COLLAPSE_REPEATING_DESCENDANTS */: {
+                const entryNode = this.#entryToNode.get(action.entry);
+                if (!entryNode) {
+                    // Invalid node was given, just ignore and move on.
+                    break;
+                }
+                const allRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode);
+                allRepeatingDescendants.forEach(descendant => entriesToHide.add(descendant));
+                if (entriesToHide.size > 0) {
+                    this.#modifiedVisibleEntries.push(action.entry);
+                }
+                break;
+            }
+            case "UNDO_ALL_ACTIONS" /* FilterAction.UNDO_ALL_ACTIONS */: {
+                this.#invisibleEntries = [];
+                this.#modifiedVisibleEntries = [];
+                break;
+            }
+            case "RESET_CHILDREN" /* FilterAction.RESET_CHILDREN */: {
+                this.#makeEntryChildrenVisible(action.entry);
+                break;
+            }
+            default:
+                Platform.assertNever(action.type, `Unknown EntriesFilter action: ${action.type}`);
         }
-        break;
-      }
-      case "UNDO_ALL_ACTIONS" /* UNDO_ALL_ACTIONS */: {
-        this.#invisibleEntries = [];
-        this.#modifiedVisibleEntries = [];
-        break;
-      }
-      case "RESET_CHILDREN" /* RESET_CHILDREN */: {
-        this.#makeEntryChildrenVisible(action.entry);
-        break;
-      }
-      default:
-        Platform.assertNever(action.type, `Unknown EntriesFilter action: ${action.type}`);
+        this.#invisibleEntries.push(...entriesToHide);
+        return this.#invisibleEntries;
     }
-    this.#invisibleEntries.push(...entriesToHide);
-    return this.#invisibleEntries;
-  }
-  #findNextVisibleParent(node) {
-    let parent = node.parent;
-    while (parent && this.#invisibleEntries.includes(parent.entry)) {
-      parent = parent.parent;
+    // The direct parent might be hidden by other actions, therefore we look for the next visible parent.
+    #findNextVisibleParent(node) {
+        let parent = node.parent;
+        while (parent && this.#invisibleEntries.includes(parent.entry)) {
+            parent = parent.parent;
+        }
+        return parent;
     }
-    return parent;
-  }
-  #findAllDescendantsOfNode(root) {
-    const cachedDescendants = this.#entryToDescendantsMap.get(root);
-    if (cachedDescendants) {
-      return cachedDescendants;
+    #findAllDescendantsOfNode(root) {
+        const cachedDescendants = this.#entryToDescendantsMap.get(root);
+        if (cachedDescendants) {
+            return cachedDescendants;
+        }
+        const descendants = [];
+        // Walk through all the descendants, starting at the root node.
+        const children = [...root.children];
+        while (children.length > 0) {
+            const childNode = children.shift();
+            if (childNode) {
+                descendants.push(childNode.entry);
+                const childNodeCachedDescendants = this.#entryToDescendantsMap.get(childNode);
+                // If the descendants of a child are cached, get them from the cache instead of iterating through them again
+                if (childNodeCachedDescendants) {
+                    descendants.push(...childNodeCachedDescendants);
+                }
+                else {
+                    children.push(...childNode.children);
+                }
+            }
+        }
+        this.#entryToDescendantsMap.set(root, descendants);
+        return descendants;
     }
-    const descendants = [];
-    const children = [...root.children];
-    while (children.length > 0) {
-      const childNode = children.shift();
-      if (childNode) {
-        descendants.push(childNode.entry);
-        const childNodeCachedDescendants = this.#entryToDescendantsMap.get(childNode);
-        if (childNodeCachedDescendants) {
-          descendants.push(...childNodeCachedDescendants);
-        } else {
-          children.push(...childNode.children);
+    #findAllRepeatingDescendantsOfNext(root) {
+        // Walk through all the ancestors, starting at the root node.
+        const children = [...root.children];
+        const repeatingNodes = [];
+        const rootIsProfileCall = Types.TraceEvents.isProfileCall(root.entry);
+        while (children.length > 0) {
+            const childNode = children.shift();
+            if (childNode) {
+                const childIsProfileCall = Types.TraceEvents.isProfileCall(childNode.entry);
+                if ( /* Handle SyntheticProfileCalls */rootIsProfileCall && childIsProfileCall) {
+                    const rootNodeEntry = root.entry;
+                    const childNodeEntry = childNode.entry;
+                    if (Helpers.SamplesIntegrator.SamplesIntegrator.framesAreEqual(rootNodeEntry.callFrame, childNodeEntry.callFrame)) {
+                        repeatingNodes.push(childNode.entry);
+                    }
+                } /* Handle SyntheticRendererEvents */
+                else if (!rootIsProfileCall && !childIsProfileCall) {
+                    if (root.entry.name === childNode.entry.name) {
+                        repeatingNodes.push(childNode.entry);
+                    }
+                }
+                children.push(...childNode.children);
+            }
         }
-      }
+        return repeatingNodes;
     }
-    this.#entryToDescendantsMap.set(root, descendants);
-    return descendants;
-  }
-  #findAllRepeatingDescendantsOfNext(root) {
-    const children = [...root.children];
-    const repeatingNodes = [];
-    const rootIsProfileCall = Types.TraceEvents.isProfileCall(root.entry);
-    while (children.length > 0) {
-      const childNode = children.shift();
-      if (childNode) {
-        const childIsProfileCall = Types.TraceEvents.isProfileCall(childNode.entry);
-        if (rootIsProfileCall && childIsProfileCall) {
-          const rootNodeEntry = root.entry;
-          const childNodeEntry = childNode.entry;
-          if (Helpers.SamplesIntegrator.SamplesIntegrator.framesAreEqual(rootNodeEntry.callFrame, childNodeEntry.callFrame)) {
-            repeatingNodes.push(childNode.entry);
-          }
-        } else if (!rootIsProfileCall && !childIsProfileCall) {
-          if (root.entry.name === childNode.entry.name) {
-            repeatingNodes.push(childNode.entry);
-          }
+    /**
+     * Removes all of the entry children from the
+     * invisible entries array to make them visible.
+     **/
+    #makeEntryChildrenVisible(entry) {
+        const entryNode = this.#entryToNode.get(entry);
+        if (!entryNode) {
+            // Invalid node was given, just ignore and move on.
+            return;
         }
-        children.push(...childNode.children);
-      }
+        const descendants = this.#findAllDescendantsOfNode(entryNode);
+        /**
+         * Filter out all descendant of the node
+         * from the invisible entries list.
+         **/
+        this.#invisibleEntries = this.#invisibleEntries.filter(entry => {
+            if (descendants.includes(entry)) {
+                return false;
+            }
+            return true;
+        });
+        /**
+         * Filter out all descentants and entry from modified entries
+         * list to not show that some entries below those are hidden.
+         **/
+        this.#modifiedVisibleEntries = this.#modifiedVisibleEntries.filter(iterEntry => {
+            if (descendants.includes(iterEntry) || iterEntry === entry) {
+                return false;
+            }
+            return true;
+        });
     }
-    return repeatingNodes;
-  }
-  #makeEntryChildrenVisible(entry) {
-    const entryNode = this.#entryToNode.get(entry);
-    if (!entryNode) {
-      return;
+    isEntryModified(event) {
+        return this.#modifiedVisibleEntries.includes(event);
     }
-    const descendants = this.#findAllDescendantsOfNode(entryNode);
-    this.#invisibleEntries = this.#invisibleEntries.filter((entry2) => {
-      if (descendants.includes(entry2)) {
-        return false;
-      }
-      return true;
-    });
-    this.#modifiedVisibleEntries = this.#modifiedVisibleEntries.filter((iterEntry) => {
-      if (descendants.includes(iterEntry) || iterEntry === entry) {
-        return false;
-      }
-      return true;
-    });
-  }
-  isEntryModified(event) {
-    return this.#modifiedVisibleEntries.includes(event);
-  }
 }
-//# sourceMappingURL=EntriesFilter.js.map
+//# sourceMappingURL=EntriesFilter.js.map

package/models/trace/EntriesFilter.js.map

@@ -1,7 +1 @@
-{
-  "version": 3,
-  "sources": ["../../../../../../front_end/models/trace/EntriesFilter.ts"],
-  "sourcesContent": ["// Copyright 2023 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\nimport * as Platform from '../../core/platform/platform.js';\nimport * as Helpers from './helpers/helpers.js';\nimport * as Types from './types/types.js';\n\ntype EntryToNodeMap = Map<Types.TraceEvents.SyntheticTraceEntry, Helpers.TreeHelpers.TraceEntryNode>;\n\nexport const enum FilterAction {\n  MERGE_FUNCTION = 'MERGE_FUNCTION',\n  COLLAPSE_FUNCTION = 'COLLAPSE_FUNCTION',\n  COLLAPSE_REPEATING_DESCENDANTS = 'COLLAPSE_REPEATING_DESCENDANTS',\n  RESET_CHILDREN = 'RESET_CHILDREN',\n  UNDO_ALL_ACTIONS = 'UNDO_ALL_ACTIONS',\n}\n\nexport interface UserFilterAction {\n  type: FilterAction;\n  entry: Types.TraceEvents.SyntheticTraceEntry;\n}\n\n// Object used to indicate to the Context Menu if an action is possible on the selected entry.\nexport interface PossibleFilterActions {\n  [FilterAction.MERGE_FUNCTION]: boolean;\n  [FilterAction.COLLAPSE_FUNCTION]: boolean;\n  [FilterAction.COLLAPSE_REPEATING_DESCENDANTS]: boolean;\n  [FilterAction.RESET_CHILDREN]: boolean;\n  [FilterAction.UNDO_ALL_ACTIONS]: boolean;\n}\n\n/**\n * This class can take in a thread that has been generated by the\n * RendererHandler and apply certain actions to it in order to modify what is\n * shown to the user. These actions can be automatically applied by DevTools or\n * applied by the user.\n *\n * Once actions are applied, the invisibleEntries() method will return the\n * entries that are invisible, and this is the list of entries that should be\n * removed before rendering the resulting thread on the timeline.\n **/\nexport class EntriesFilter {\n  // Maps from an individual TraceEvent entry to its representation as a\n  // RendererEntryNode. We need this so we can then parse the tree structure\n  // generated by the RendererHandler.\n  #entryToNode: EntryToNodeMap;\n\n  // Track the set of invisible entries.\n  #invisibleEntries: Types.TraceEvents.TraceEventData[] = [];\n  // List of entries whose children are modified. This list is used to\n  // keep track of entries that should be identified in the UI as modified.\n  #modifiedVisibleEntries: Types.TraceEvents.TraceEventData[] = [];\n  // Cache for descendants of entry that have already been gathered. The descendants\n  // will never change so we can avoid running the potentially expensive search again.\n  #entryToDescendantsMap: Map<Helpers.TreeHelpers.TraceEntryNode, Types.TraceEvents.TraceEventData[]> = new Map();\n\n  constructor(entryToNode: EntryToNodeMap) {\n    this.#entryToNode = entryToNode;\n  }\n\n  /**\n   * Checks which actions can be applied on an entry. This allows us to only show possible actions in the Context Menu.\n   * For example, if an entry has no children, COLLAPSE_FUNCTION will not change the FlameChart, therefore there is no need to show this action as an option.\n   **/\n  findPossibleActions(entry: Types.TraceEvents.SyntheticTraceEntry): PossibleFilterActions {\n    const entryNode = this.#entryToNode.get(entry);\n    if (!entryNode) {\n      // Invalid node was given, return no possible actions.\n      return {\n        [FilterAction.MERGE_FUNCTION]: false,\n        [FilterAction.COLLAPSE_FUNCTION]: false,\n        [FilterAction.COLLAPSE_REPEATING_DESCENDANTS]: false,\n        [FilterAction.RESET_CHILDREN]: false,\n        [FilterAction.UNDO_ALL_ACTIONS]: false,\n      };\n    }\n    const entryParent = entryNode.parent;\n    const allVisibleDescendants =\n        this.#findAllDescendantsOfNode(entryNode).filter(descendant => !this.#invisibleEntries.includes(descendant));\n    const allVisibleRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode).filter(\n        descendant => !this.#invisibleEntries.includes(descendant));\n    const allInVisibleDescendants =\n        this.#findAllDescendantsOfNode(entryNode).filter(descendant => this.#invisibleEntries.includes(descendant));\n\n    // If there are children to hide, indicate action as possible\n    const possibleActions: PossibleFilterActions = {\n      [FilterAction.MERGE_FUNCTION]: entryParent !== null,\n      [FilterAction.COLLAPSE_FUNCTION]: allVisibleDescendants.length > 0,\n      [FilterAction.COLLAPSE_REPEATING_DESCENDANTS]: allVisibleRepeatingDescendants.length > 0,\n      [FilterAction.RESET_CHILDREN]: allInVisibleDescendants.length > 0,\n      [FilterAction.UNDO_ALL_ACTIONS]: this.#invisibleEntries.length > 0,\n    };\n    return possibleActions;\n  }\n\n  /**\n   * Returns the amount of entry descendants that belong to the hidden entries array.\n   * **/\n  findHiddenDescendantsAmount(entry: Types.TraceEvents.SyntheticTraceEntry): number {\n    const entryNode = this.#entryToNode.get(entry);\n    if (!entryNode) {\n      return 0;\n    }\n    const allDescendants = this.#findAllDescendantsOfNode(entryNode);\n    return allDescendants.filter(descendant => this.invisibleEntries().includes(descendant)).length;\n  }\n\n  /**\n   * Returns the set of entries that are invisible given the set of applied actions.\n   **/\n  invisibleEntries(): Types.TraceEvents.TraceEventData[] {\n    return this.#invisibleEntries;\n  }\n\n  /**\n   * Applies an action to hide entries or removes entries\n   * from hidden entries array depending on the action.\n   **/\n  applyFilterAction(action: UserFilterAction): Types.TraceEvents.TraceEventData[] {\n    // We apply new user action to the set of all entries, and mark\n    // any that should be hidden by adding them to this set.\n    // Another approach would be to use splice() to remove items from the\n    // array, but doing this would be a mutation of the arry for every hidden\n    // event. Instead, we add entries to this set and return it as an array at the end.\n    const entriesToHide = new Set<Types.TraceEvents.TraceEventData>();\n\n    switch (action.type) {\n      case FilterAction.MERGE_FUNCTION: {\n        // The entry that was clicked on is merged into its parent. All its\n        // children remain visible, so we just have to hide the entry that was\n        // selected.\n        entriesToHide.add(action.entry);\n        // If parent node exists, add it to modifiedVisibleEntries, so it would be possible to uncollapse its' children.\n        const actionNode = this.#entryToNode.get(action.entry) || null;\n        const parentNode = actionNode && this.#findNextVisibleParent(actionNode);\n        if (parentNode) {\n          this.#modifiedVisibleEntries.push(parentNode?.entry);\n        }\n        break;\n      }\n      case FilterAction.COLLAPSE_FUNCTION: {\n        // The entry itself remains visible, but all of its descendants are hidden.\n        const entryNode = this.#entryToNode.get(action.entry);\n        if (!entryNode) {\n          // Invalid node was given, just ignore and move on.\n          break;\n        }\n        const allDescendants = this.#findAllDescendantsOfNode(entryNode);\n        allDescendants.forEach(descendant => entriesToHide.add(descendant));\n        // If there are any children to hide, add selected entry to modifiedVisibleEntries array to identify in the UI that children of the selected entry are modified.\n        if (entriesToHide.size > 0) {\n          this.#modifiedVisibleEntries.push(action.entry);\n        }\n        break;\n      }\n      case FilterAction.COLLAPSE_REPEATING_DESCENDANTS: {\n        const entryNode = this.#entryToNode.get(action.entry);\n        if (!entryNode) {\n          // Invalid node was given, just ignore and move on.\n          break;\n        }\n        const allRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode);\n        allRepeatingDescendants.forEach(descendant => entriesToHide.add(descendant));\n        if (entriesToHide.size > 0) {\n          this.#modifiedVisibleEntries.push(action.entry);\n        }\n        break;\n      }\n      case FilterAction.UNDO_ALL_ACTIONS: {\n        this.#invisibleEntries = [];\n        this.#modifiedVisibleEntries = [];\n        break;\n      }\n      case FilterAction.RESET_CHILDREN: {\n        this.#makeEntryChildrenVisible(action.entry);\n        break;\n      }\n      default:\n        Platform.assertNever(action.type, `Unknown EntriesFilter action: ${action.type}`);\n    }\n\n    this.#invisibleEntries.push(...entriesToHide);\n\n    return this.#invisibleEntries;\n  }\n\n  // The direct parent might be hidden by other actions, therefore we look for the next visible parent.\n  #findNextVisibleParent(node: Helpers.TreeHelpers.TraceEntryNode): Helpers.TreeHelpers.TraceEntryNode|null {\n    let parent = node.parent;\n    while (parent && this.#invisibleEntries.includes(parent.entry)) {\n      parent = parent.parent;\n    }\n    return parent;\n  }\n\n  #findAllDescendantsOfNode(root: Helpers.TreeHelpers.TraceEntryNode): Types.TraceEvents.TraceEventData[] {\n    const cachedDescendants = this.#entryToDescendantsMap.get(root);\n    if (cachedDescendants) {\n      return cachedDescendants;\n    }\n\n    const descendants: Types.TraceEvents.TraceEventData[] = [];\n\n    // Walk through all the descendants, starting at the root node.\n    const children: Helpers.TreeHelpers.TraceEntryNode[] = [...root.children];\n    while (children.length > 0) {\n      const childNode = children.shift();\n      if (childNode) {\n        descendants.push(childNode.entry);\n        const childNodeCachedDescendants = this.#entryToDescendantsMap.get(childNode);\n        // If the descendants of a child are cached, get them from the cache instead of iterating through them again\n        if (childNodeCachedDescendants) {\n          descendants.push(...childNodeCachedDescendants);\n        } else {\n          children.push(...childNode.children);\n        }\n      }\n    }\n\n    this.#entryToDescendantsMap.set(root, descendants);\n    return descendants;\n  }\n\n  #findAllRepeatingDescendantsOfNext(root: Helpers.TreeHelpers.TraceEntryNode):\n      Types.TraceEvents.SyntheticTraceEntry[] {\n    // Walk through all the ancestors, starting at the root node.\n    const children: Helpers.TreeHelpers.TraceEntryNode[] = [...root.children];\n    const repeatingNodes: Types.TraceEvents.SyntheticTraceEntry[] = [];\n    const rootIsProfileCall = Types.TraceEvents.isProfileCall(root.entry);\n\n    while (children.length > 0) {\n      const childNode = children.shift();\n      if (childNode) {\n        const childIsProfileCall = Types.TraceEvents.isProfileCall(childNode.entry);\n        if (/* Handle SyntheticProfileCalls */ rootIsProfileCall && childIsProfileCall) {\n          const rootNodeEntry = root.entry as Types.TraceEvents.SyntheticProfileCall;\n          const childNodeEntry = childNode.entry as Types.TraceEvents.SyntheticProfileCall;\n\n          if (Helpers.SamplesIntegrator.SamplesIntegrator.framesAreEqual(\n                  rootNodeEntry.callFrame, childNodeEntry.callFrame)) {\n            repeatingNodes.push(childNode.entry);\n          }\n        } /* Handle SyntheticRendererEvents */ else if (!rootIsProfileCall && !childIsProfileCall) {\n          if (root.entry.name === childNode.entry.name) {\n            repeatingNodes.push(childNode.entry);\n          }\n        }\n        children.push(...childNode.children);\n      }\n    }\n\n    return repeatingNodes;\n  }\n\n  /**\n   * Removes all of the entry children from the\n   * invisible entries array to make them visible.\n   **/\n  #makeEntryChildrenVisible(entry: Types.TraceEvents.SyntheticTraceEntry): void {\n    const entryNode = this.#entryToNode.get(entry);\n    if (!entryNode) {\n      // Invalid node was given, just ignore and move on.\n      return;\n    }\n    const descendants = this.#findAllDescendantsOfNode(entryNode);\n\n    /**\n     * Filter out all descendant of the node\n     * from the invisible entries list.\n     **/\n    this.#invisibleEntries = this.#invisibleEntries.filter(entry => {\n      if (descendants.includes(entry)) {\n        return false;\n      }\n      return true;\n    });\n\n    /**\n     * Filter out all descentants and entry from modified entries\n     * list to not show that some entries below those are hidden.\n     **/\n    this.#modifiedVisibleEntries = this.#modifiedVisibleEntries.filter(iterEntry => {\n      if (descendants.includes(iterEntry) || iterEntry === entry) {\n        return false;\n      }\n      return true;\n    });\n  }\n\n  isEntryModified(event: Types.TraceEvents.TraceEventData): boolean {\n    return this.#modifiedVisibleEntries.includes(event);\n  }\n}\n"],
-  "mappings": "AAGA;AACA;AACA;AAIO,WAAW,eAAX,kBAAW,kBAAX;AACL,oCAAiB;AACjB,uCAAoB;AACpB,oDAAiC;AACjC,oCAAiB;AACjB,sCAAmB;AALH;AAAA;AAgCX,2BAAoB;AAAA;AAAA,sBAO+B;AAAA,4BAGM;AAAA,2BAGwC,oBAAI;AAAA,EAE1G,YAAY,aAA6B;AACvC,wBAAoB;AAAA;AAAA,EAOtB,oBAAoB,OAAqE;AACvF,UAAM,YAAY,kBAAkB,IAAI;AACxC,QAAI,CAAC,WAAW;AAEd,aAAO;AAAA,SACJ,wCAA8B;AAAA,SAC9B,8CAAiC;AAAA,SACjC,wEAA8C;AAAA,SAC9C,wCAA8B;AAAA,SAC9B,4CAAgC;AAAA;AAAA;AAGrC,UAAM,cAAc,UAAU;AAC9B,UAAM,wBACF,+BAA+B,WAAW,OAAO,gBAAc,CAAC,uBAAuB,SAAS;AACpG,UAAM,iCAAiC,wCAAwC,WAAW,OACtF,gBAAc,CAAC,uBAAuB,SAAS;AACnD,UAAM,0BACF,+BAA+B,WAAW,OAAO,gBAAc,uBAAuB,SAAS;AAGnG,UAAM,kBAAyC;AAAA,OAC5C,wCAA8B,gBAAgB;AAAA,OAC9C,8CAAiC,sBAAsB,SAAS;AAAA,OAChE,wEAA8C,+BAA+B,SAAS;AAAA,OACtF,wCAA8B,wBAAwB,SAAS;AAAA,OAC/D,4CAAgC,uBAAuB,SAAS;AAAA;AAEnE,WAAO;AAAA;AAAA,EAMT,4BAA4B,OAAsD;AAChF,UAAM,YAAY,kBAAkB,IAAI;AACxC,QAAI,CAAC,WAAW;AACd,aAAO;AAAA;AAET,UAAM,iBAAiB,+BAA+B;AACtD,WAAO,eAAe,OAAO,gBAAc,KAAK,mBAAmB,SAAS,aAAa;AAAA;AAAA,EAM3F,mBAAuD;AACrD,WAAO;AAAA;AAAA,EAOT,kBAAkB,QAA8D;AAM9E,UAAM,gBAAgB,oBAAI;AAE1B,YAAQ,OAAO;AAAA,WACR,uCAA6B;AAIhC,sBAAc,IAAI,OAAO;AAEzB,cAAM,aAAa,kBAAkB,IAAI,OAAO,UAAU;AAC1D,cAAM,aAAa,cAAc,4BAA4B;AAC7D,YAAI,YAAY;AACd,uCAA6B,KAAK,YAAY;AAAA;AAEhD;AAAA;AAAA,WAEG,6CAAgC;AAEnC,cAAM,YAAY,kBAAkB,IAAI,OAAO;AAC/C,YAAI,CAAC,WAAW;AAEd;AAAA;AAEF,cAAM,iBAAiB,+BAA+B;AACtD,uBAAe,QAAQ,gBAAc,cAAc,IAAI;AAEvD,YAAI,cAAc,OAAO,GAAG;AAC1B,uCAA6B,KAAK,OAAO;AAAA;AAE3C;AAAA;AAAA,WAEG,uEAA6C;AAChD,cAAM,YAAY,kBAAkB,IAAI,OAAO;AAC/C,YAAI,CAAC,WAAW;AAEd;AAAA;AAEF,cAAM,0BAA0B,wCAAwC;AACxE,gCAAwB,QAAQ,gBAAc,cAAc,IAAI;AAChE,YAAI,cAAc,OAAO,GAAG;AAC1B,uCAA6B,KAAK,OAAO;AAAA;AAE3C;AAAA;AAAA,WAEG,2CAA+B;AAClC,iCAAyB;AACzB,uCAA+B;AAC/B;AAAA;AAAA,WAEG,uCAA6B;AAChC,uCAA+B,OAAO;AACtC;AAAA;AAAA;AAGA,iBAAS,YAAY,OAAO,MAAM,iCAAiC,OAAO;AAAA;AAG9E,2BAAuB,KAAK,GAAG;AAE/B,WAAO;AAAA;AAAA,yBAIc,MAAmF;AACxG,QAAI,SAAS,KAAK;AAClB,WAAO,UAAU,uBAAuB,SAAS,OAAO,QAAQ;AAC9D,eAAS,OAAO;AAAA;AAElB,WAAO;AAAA;AAAA,4BAGiB,MAA8E;AACtG,UAAM,oBAAoB,4BAA4B,IAAI;AAC1D,QAAI,mBAAmB;AACrB,aAAO;AAAA;AAGT,UAAM,cAAkD;AAGxD,UAAM,WAAiD,CAAC,GAAG,KAAK;AAChE,WAAO,SAAS,SAAS,GAAG;AAC1B,YAAM,YAAY,SAAS;AAC3B,UAAI,WAAW;AACb,oBAAY,KAAK,UAAU;AAC3B,cAAM,6BAA6B,4BAA4B,IAAI;AAEnE,YAAI,4BAA4B;AAC9B,sBAAY,KAAK,GAAG;AAAA,eACf;AACL,mBAAS,KAAK,GAAG,UAAU;AAAA;AAAA;AAAA;AAKjC,gCAA4B,IAAI,MAAM;AACtC,WAAO;AAAA;AAAA,qCAG0B,MACS;AAE1C,UAAM,WAAiD,CAAC,GAAG,KAAK;AAChE,UAAM,iBAA0D;AAChE,UAAM,oBAAoB,MAAM,YAAY,cAAc,KAAK;AAE/D,WAAO,SAAS,SAAS,GAAG;AAC1B,YAAM,YAAY,SAAS;AAC3B,UAAI,WAAW;AACb,cAAM,qBAAqB,MAAM,YAAY,cAAc,UAAU;AACrE,YAAuC,qBAAqB,oBAAoB;AAC9E,gBAAM,gBAAgB,KAAK;AAC3B,gBAAM,iBAAiB,UAAU;AAEjC,cAAI,QAAQ,kBAAkB,kBAAkB,eACxC,cAAc,WAAW,eAAe,YAAY;AAC1D,2BAAe,KAAK,UAAU;AAAA;AAAA,mBAEc,CAAC,qBAAqB,CAAC,oBAAoB;AACzF,cAAI,KAAK,MAAM,SAAS,UAAU,MAAM,MAAM;AAC5C,2BAAe,KAAK,UAAU;AAAA;AAAA;AAGlC,iBAAS,KAAK,GAAG,UAAU;AAAA;AAAA;AAI/B,WAAO;AAAA;AAAA,4BAOiB,OAAoD;AAC5E,UAAM,YAAY,kBAAkB,IAAI;AACxC,QAAI,CAAC,WAAW;AAEd;AAAA;AAEF,UAAM,cAAc,+BAA+B;AAMnD,6BAAyB,uBAAuB,OAAO,YAAS;AAC9D,UAAI,YAAY,SAAS,SAAQ;AAC/B,eAAO;AAAA;AAET,aAAO;AAAA;AAOT,mCAA+B,6BAA6B,OAAO,eAAa;AAC9E,UAAI,YAAY,SAAS,cAAc,cAAc,OAAO;AAC1D,eAAO;AAAA;AAET,aAAO;AAAA;AAAA;AAAA,EAIX,gBAAgB,OAAkD;AAChE,WAAO,6BAA6B,SAAS;AAAA;AAAA;",
-  "names": []
-}
+{"version":3,"file":"EntriesFilter.js","sourceRoot":"","sources":["../../../../../../front_end/models/trace/EntriesFilter.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAC7B,OAAO,KAAK,QAAQ,MAAM,iCAAiC,CAAC;AAC5D,OAAO,KAAK,OAAO,MAAM,sBAAsB,CAAC;AAChD,OAAO,KAAK,KAAK,MAAM,kBAAkB,CAAC;AA0B1C;;;;;;;;;IASI;AACJ,MAAM,OAAO,aAAa;IACxB,sEAAsE;IACtE,0EAA0E;IAC1E,oCAAoC;IACpC,YAAY,CAAiB;IAE7B,sCAAsC;IACtC,iBAAiB,GAAuC,EAAE,CAAC;IAC3D,oEAAoE;IACpE,yEAAyE;IACzE,uBAAuB,GAAuC,EAAE,CAAC;IACjE,kFAAkF;IAClF,oFAAoF;IACpF,sBAAsB,GAAgF,IAAI,GAAG,EAAE,CAAC;IAEhH,YAAY,WAA2B;QACrC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IAED;;;QAGI;IACJ,mBAAmB,CAAC,KAA4C;QAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,EAAE;YACd,sDAAsD;YACtD,OAAO;gBACL,oDAA6B,EAAE,KAAK;gBACpC,0DAAgC,EAAE,KAAK;gBACvC,oFAA6C,EAAE,KAAK;gBACpD,oDAA6B,EAAE,KAAK;gBACpC,wDAA+B,EAAE,KAAK;aACvC,CAAC;SACH;QACD,MAAM,WAAW,GAAG,SAAS,CAAC,MAAM,CAAC;QACrC,MAAM,qBAAqB,GACvB,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;QACjH,MAAM,8BAA8B,GAAG,IAAI,CAAC,kCAAkC,CAAC,SAAS,CAAC,CAAC,MAAM,CAC5F,UAAU,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;QAChE,MAAM,uBAAuB,GACzB,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;QAEhH,6DAA6D;QAC7D,MAAM,eAAe,GAA0B;YAC7C,oDAA6B,EAAE,WAAW,KAAK,IAAI;YACnD,0DAAgC,EAAE,qBAAqB,CAAC,MAAM,GAAG,CAAC;YAClE,oFAA6C,EAAE,8BAA8B,CAAC,MAAM,GAAG,CAAC;YACxF,oDAA6B,EAAE,uBAAuB,CAAC,MAAM,GAAG,CAAC;YACjE,wDAA+B,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC;SACnE,CAAC;QACF,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;UAEM;IACN,2BAA2B,CAAC,KAA4C;QACtE,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,EAAE;YACd,OAAO,CAAC,CAAC;SACV;QACD,MAAM,cAAc,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC;IAClG,CAAC;IAED;;QAEI;IACJ,gBAAgB;QACd,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAChC,CAAC;IAED;;;QAGI;IACJ,iBAAiB,CAAC,MAAwB;QACxC,+DAA+D;QAC/D,wDAAwD;QACxD,qEAAqE;QACrE,yEAAyE;QACzE,mFAAmF;QACnF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoC,CAAC;QAElE,QAAQ,MAAM,CAAC,IAAI,EAAE;YACnB,uDAAgC,CAAC,CAAC;gBAChC,mEAAmE;gBACnE,sEAAsE;gBACtE,YAAY;gBACZ,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChC,gHAAgH;gBAChH,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;gBAC/D,MAAM,UAAU,GAAG,UAAU,IAAI,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;gBACzE,IAAI,UAAU,EAAE;oBACd,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;iBACtD;gBACD,MAAM;aACP;YACD,6DAAmC,CAAC,CAAC;gBACnC,2EAA2E;gBAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACtD,IAAI,CAAC,SAAS,EAAE;oBACd,mDAAmD;oBACnD,MAAM;iBACP;gBACD,MAAM,cAAc,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC,CAAC;gBACjE,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;gBACpE,gKAAgK;gBAChK,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE;oBAC1B,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;iBACjD;gBACD,MAAM;aACP;YACD,uFAAgD,CAAC,CAAC;gBAChD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACtD,IAAI,CAAC,SAAS,EAAE;oBACd,mDAAmD;oBACnD,MAAM;iBACP;gBACD,MAAM,uBAAuB,GAAG,IAAI,CAAC,kCAAkC,CAAC,SAAS,CAAC,CAAC;gBACnF,uBAAuB,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;gBAC7E,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE;oBAC1B,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;iBACjD;gBACD,MAAM;aACP;YACD,2DAAkC,CAAC,CAAC;gBAClC,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;gBAC5B,IAAI,CAAC,uBAAuB,GAAG,EAAE,CAAC;gBAClC,MAAM;aACP;YACD,uDAAgC,CAAC,CAAC;gBAChC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC7C,MAAM;aACP;YACD;gBACE,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,iCAAiC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SACrF;QAED,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QAE9C,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAChC,CAAC;IAED,qGAAqG;IACrG,sBAAsB,CAAC,IAAwC;QAC7D,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,OAAO,MAAM,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC9D,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACxB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,yBAAyB,CAAC,IAAwC;QAChE,MAAM,iBAAiB,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChE,IAAI,iBAAiB,EAAE;YACrB,OAAO,iBAAiB,CAAC;SAC1B;QAED,MAAM,WAAW,GAAuC,EAAE,CAAC;QAE3D,+DAA+D;QAC/D,MAAM,QAAQ,GAAyC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1E,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,SAAS,EAAE;gBACb,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBAClC,MAAM,0BAA0B,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAC9E,4GAA4G;gBAC5G,IAAI,0BAA0B,EAAE;oBAC9B,WAAW,CAAC,IAAI,CAAC,GAAG,0BAA0B,CAAC,CAAC;iBACjD;qBAAM;oBACL,QAAQ,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;iBACtC;aACF;SACF;QAED,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QACnD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,kCAAkC,CAAC,IAAwC;QAEzE,6DAA6D;QAC7D,MAAM,QAAQ,GAAyC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1E,MAAM,cAAc,GAA4C,EAAE,CAAC;QACnE,MAAM,iBAAiB,GAAG,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEtE,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1B,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,SAAS,EAAE;gBACb,MAAM,kBAAkB,GAAG,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;gBAC5E,KAAI,kCAAmC,iBAAiB,IAAI,kBAAkB,EAAE;oBAC9E,MAAM,aAAa,GAAG,IAAI,CAAC,KAA+C,CAAC;oBAC3E,MAAM,cAAc,GAAG,SAAS,CAAC,KAA+C,CAAC;oBAEjF,IAAI,OAAO,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,cAAc,CACtD,aAAa,CAAC,SAAS,EAAE,cAAc,CAAC,SAAS,CAAC,EAAE;wBAC1D,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;qBACtC;iBACF,CAAC,oCAAoC;qBAAM,IAAI,CAAC,iBAAiB,IAAI,CAAC,kBAAkB,EAAE;oBACzF,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE;wBAC5C,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;qBACtC;iBACF;gBACD,QAAQ,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;aACtC;SACF;QAED,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;;QAGI;IACJ,yBAAyB,CAAC,KAA4C;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,SAAS,EAAE;YACd,mDAAmD;YACnD,OAAO;SACR;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC,CAAC;QAE9D;;;YAGI;QACJ,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC7D,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAC/B,OAAO,KAAK,CAAC;aACd;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH;;;YAGI;QACJ,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE;YAC7E,IAAI,WAAW,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,KAAK,KAAK,EAAE;gBAC1D,OAAO,KAAK,CAAC;aACd;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED,eAAe,CAAC,KAAuC;QACrD,OAAO,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC;CACF","sourcesContent":["// Copyright 2023 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\nimport * as Platform from '../../core/platform/platform.js';\nimport * as Helpers from './helpers/helpers.js';\nimport * as Types from './types/types.js';\n\ntype EntryToNodeMap = Map<Types.TraceEvents.SyntheticTraceEntry, Helpers.TreeHelpers.TraceEntryNode>;\n\nexport const enum FilterAction {\n  MERGE_FUNCTION = 'MERGE_FUNCTION',\n  COLLAPSE_FUNCTION = 'COLLAPSE_FUNCTION',\n  COLLAPSE_REPEATING_DESCENDANTS = 'COLLAPSE_REPEATING_DESCENDANTS',\n  RESET_CHILDREN = 'RESET_CHILDREN',\n  UNDO_ALL_ACTIONS = 'UNDO_ALL_ACTIONS',\n}\n\nexport interface UserFilterAction {\n  type: FilterAction;\n  entry: Types.TraceEvents.SyntheticTraceEntry;\n}\n\n// Object used to indicate to the Context Menu if an action is possible on the selected entry.\nexport interface PossibleFilterActions {\n  [FilterAction.MERGE_FUNCTION]: boolean;\n  [FilterAction.COLLAPSE_FUNCTION]: boolean;\n  [FilterAction.COLLAPSE_REPEATING_DESCENDANTS]: boolean;\n  [FilterAction.RESET_CHILDREN]: boolean;\n  [FilterAction.UNDO_ALL_ACTIONS]: boolean;\n}\n\n/**\n * This class can take in a thread that has been generated by the\n * RendererHandler and apply certain actions to it in order to modify what is\n * shown to the user. These actions can be automatically applied by DevTools or\n * applied by the user.\n *\n * Once actions are applied, the invisibleEntries() method will return the\n * entries that are invisible, and this is the list of entries that should be\n * removed before rendering the resulting thread on the timeline.\n **/\nexport class EntriesFilter {\n  // Maps from an individual TraceEvent entry to its representation as a\n  // RendererEntryNode. We need this so we can then parse the tree structure\n  // generated by the RendererHandler.\n  #entryToNode: EntryToNodeMap;\n\n  // Track the set of invisible entries.\n  #invisibleEntries: Types.TraceEvents.TraceEventData[] = [];\n  // List of entries whose children are modified. This list is used to\n  // keep track of entries that should be identified in the UI as modified.\n  #modifiedVisibleEntries: Types.TraceEvents.TraceEventData[] = [];\n  // Cache for descendants of entry that have already been gathered. The descendants\n  // will never change so we can avoid running the potentially expensive search again.\n  #entryToDescendantsMap: Map<Helpers.TreeHelpers.TraceEntryNode, Types.TraceEvents.TraceEventData[]> = new Map();\n\n  constructor(entryToNode: EntryToNodeMap) {\n    this.#entryToNode = entryToNode;\n  }\n\n  /**\n   * Checks which actions can be applied on an entry. This allows us to only show possible actions in the Context Menu.\n   * For example, if an entry has no children, COLLAPSE_FUNCTION will not change the FlameChart, therefore there is no need to show this action as an option.\n   **/\n  findPossibleActions(entry: Types.TraceEvents.SyntheticTraceEntry): PossibleFilterActions {\n    const entryNode = this.#entryToNode.get(entry);\n    if (!entryNode) {\n      // Invalid node was given, return no possible actions.\n      return {\n        [FilterAction.MERGE_FUNCTION]: false,\n        [FilterAction.COLLAPSE_FUNCTION]: false,\n        [FilterAction.COLLAPSE_REPEATING_DESCENDANTS]: false,\n        [FilterAction.RESET_CHILDREN]: false,\n        [FilterAction.UNDO_ALL_ACTIONS]: false,\n      };\n    }\n    const entryParent = entryNode.parent;\n    const allVisibleDescendants =\n        this.#findAllDescendantsOfNode(entryNode).filter(descendant => !this.#invisibleEntries.includes(descendant));\n    const allVisibleRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode).filter(\n        descendant => !this.#invisibleEntries.includes(descendant));\n    const allInVisibleDescendants =\n        this.#findAllDescendantsOfNode(entryNode).filter(descendant => this.#invisibleEntries.includes(descendant));\n\n    // If there are children to hide, indicate action as possible\n    const possibleActions: PossibleFilterActions = {\n      [FilterAction.MERGE_FUNCTION]: entryParent !== null,\n      [FilterAction.COLLAPSE_FUNCTION]: allVisibleDescendants.length > 0,\n      [FilterAction.COLLAPSE_REPEATING_DESCENDANTS]: allVisibleRepeatingDescendants.length > 0,\n      [FilterAction.RESET_CHILDREN]: allInVisibleDescendants.length > 0,\n      [FilterAction.UNDO_ALL_ACTIONS]: this.#invisibleEntries.length > 0,\n    };\n    return possibleActions;\n  }\n\n  /**\n   * Returns the amount of entry descendants that belong to the hidden entries array.\n   * **/\n  findHiddenDescendantsAmount(entry: Types.TraceEvents.SyntheticTraceEntry): number {\n    const entryNode = this.#entryToNode.get(entry);\n    if (!entryNode) {\n      return 0;\n    }\n    const allDescendants = this.#findAllDescendantsOfNode(entryNode);\n    return allDescendants.filter(descendant => this.invisibleEntries().includes(descendant)).length;\n  }\n\n  /**\n   * Returns the set of entries that are invisible given the set of applied actions.\n   **/\n  invisibleEntries(): Types.TraceEvents.TraceEventData[] {\n    return this.#invisibleEntries;\n  }\n\n  /**\n   * Applies an action to hide entries or removes entries\n   * from hidden entries array depending on the action.\n   **/\n  applyFilterAction(action: UserFilterAction): Types.TraceEvents.TraceEventData[] {\n    // We apply new user action to the set of all entries, and mark\n    // any that should be hidden by adding them to this set.\n    // Another approach would be to use splice() to remove items from the\n    // array, but doing this would be a mutation of the arry for every hidden\n    // event. Instead, we add entries to this set and return it as an array at the end.\n    const entriesToHide = new Set<Types.TraceEvents.TraceEventData>();\n\n    switch (action.type) {\n      case FilterAction.MERGE_FUNCTION: {\n        // The entry that was clicked on is merged into its parent. All its\n        // children remain visible, so we just have to hide the entry that was\n        // selected.\n        entriesToHide.add(action.entry);\n        // If parent node exists, add it to modifiedVisibleEntries, so it would be possible to uncollapse its' children.\n        const actionNode = this.#entryToNode.get(action.entry) || null;\n        const parentNode = actionNode && this.#findNextVisibleParent(actionNode);\n        if (parentNode) {\n          this.#modifiedVisibleEntries.push(parentNode?.entry);\n        }\n        break;\n      }\n      case FilterAction.COLLAPSE_FUNCTION: {\n        // The entry itself remains visible, but all of its descendants are hidden.\n        const entryNode = this.#entryToNode.get(action.entry);\n        if (!entryNode) {\n          // Invalid node was given, just ignore and move on.\n          break;\n        }\n        const allDescendants = this.#findAllDescendantsOfNode(entryNode);\n        allDescendants.forEach(descendant => entriesToHide.add(descendant));\n        // If there are any children to hide, add selected entry to modifiedVisibleEntries array to identify in the UI that children of the selected entry are modified.\n        if (entriesToHide.size > 0) {\n          this.#modifiedVisibleEntries.push(action.entry);\n        }\n        break;\n      }\n      case FilterAction.COLLAPSE_REPEATING_DESCENDANTS: {\n        const entryNode = this.#entryToNode.get(action.entry);\n        if (!entryNode) {\n          // Invalid node was given, just ignore and move on.\n          break;\n        }\n        const allRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode);\n        allRepeatingDescendants.forEach(descendant => entriesToHide.add(descendant));\n        if (entriesToHide.size > 0) {\n          this.#modifiedVisibleEntries.push(action.entry);\n        }\n        break;\n      }\n      case FilterAction.UNDO_ALL_ACTIONS: {\n        this.#invisibleEntries = [];\n        this.#modifiedVisibleEntries = [];\n        break;\n      }\n      case FilterAction.RESET_CHILDREN: {\n        this.#makeEntryChildrenVisible(action.entry);\n        break;\n      }\n      default:\n        Platform.assertNever(action.type, `Unknown EntriesFilter action: ${action.type}`);\n    }\n\n    this.#invisibleEntries.push(...entriesToHide);\n\n    return this.#invisibleEntries;\n  }\n\n  // The direct parent might be hidden by other actions, therefore we look for the next visible parent.\n  #findNextVisibleParent(node: Helpers.TreeHelpers.TraceEntryNode): Helpers.TreeHelpers.TraceEntryNode|null {\n    let parent = node.parent;\n    while (parent && this.#invisibleEntries.includes(parent.entry)) {\n      parent = parent.parent;\n    }\n    return parent;\n  }\n\n  #findAllDescendantsOfNode(root: Helpers.TreeHelpers.TraceEntryNode): Types.TraceEvents.TraceEventData[] {\n    const cachedDescendants = this.#entryToDescendantsMap.get(root);\n    if (cachedDescendants) {\n      return cachedDescendants;\n    }\n\n    const descendants: Types.TraceEvents.TraceEventData[] = [];\n\n    // Walk through all the descendants, starting at the root node.\n    const children: Helpers.TreeHelpers.TraceEntryNode[] = [...root.children];\n    while (children.length > 0) {\n      const childNode = children.shift();\n      if (childNode) {\n        descendants.push(childNode.entry);\n        const childNodeCachedDescendants = this.#entryToDescendantsMap.get(childNode);\n        // If the descendants of a child are cached, get them from the cache instead of iterating through them again\n        if (childNodeCachedDescendants) {\n          descendants.push(...childNodeCachedDescendants);\n        } else {\n          children.push(...childNode.children);\n        }\n      }\n    }\n\n    this.#entryToDescendantsMap.set(root, descendants);\n    return descendants;\n  }\n\n  #findAllRepeatingDescendantsOfNext(root: Helpers.TreeHelpers.TraceEntryNode):\n      Types.TraceEvents.SyntheticTraceEntry[] {\n    // Walk through all the ancestors, starting at the root node.\n    const children: Helpers.TreeHelpers.TraceEntryNode[] = [...root.children];\n    const repeatingNodes: Types.TraceEvents.SyntheticTraceEntry[] = [];\n    const rootIsProfileCall = Types.TraceEvents.isProfileCall(root.entry);\n\n    while (children.length > 0) {\n      const childNode = children.shift();\n      if (childNode) {\n        const childIsProfileCall = Types.TraceEvents.isProfileCall(childNode.entry);\n        if (/* Handle SyntheticProfileCalls */ rootIsProfileCall && childIsProfileCall) {\n          const rootNodeEntry = root.entry as Types.TraceEvents.SyntheticProfileCall;\n          const childNodeEntry = childNode.entry as Types.TraceEvents.SyntheticProfileCall;\n\n          if (Helpers.SamplesIntegrator.SamplesIntegrator.framesAreEqual(\n                  rootNodeEntry.callFrame, childNodeEntry.callFrame)) {\n            repeatingNodes.push(childNode.entry);\n          }\n        } /* Handle SyntheticRendererEvents */ else if (!rootIsProfileCall && !childIsProfileCall) {\n          if (root.entry.name === childNode.entry.name) {\n            repeatingNodes.push(childNode.entry);\n          }\n        }\n        children.push(...childNode.children);\n      }\n    }\n\n    return repeatingNodes;\n  }\n\n  /**\n   * Removes all of the entry children from the\n   * invisible entries array to make them visible.\n   **/\n  #makeEntryChildrenVisible(entry: Types.TraceEvents.SyntheticTraceEntry): void {\n    const entryNode = this.#entryToNode.get(entry);\n    if (!entryNode) {\n      // Invalid node was given, just ignore and move on.\n      return;\n    }\n    const descendants = this.#findAllDescendantsOfNode(entryNode);\n\n    /**\n     * Filter out all descendant of the node\n     * from the invisible entries list.\n     **/\n    this.#invisibleEntries = this.#invisibleEntries.filter(entry => {\n      if (descendants.includes(entry)) {\n        return false;\n      }\n      return true;\n    });\n\n    /**\n     * Filter out all descentants and entry from modified entries\n     * list to not show that some entries below those are hidden.\n     **/\n    this.#modifiedVisibleEntries = this.#modifiedVisibleEntries.filter(iterEntry => {\n      if (descendants.includes(iterEntry) || iterEntry === entry) {\n        return false;\n      }\n      return true;\n    });\n  }\n\n  isEntryModified(event: Types.TraceEvents.TraceEventData): boolean {\n    return this.#modifiedVisibleEntries.includes(event);\n  }\n}\n"]}