@paulirish/trace_engine 0.0.12 → 0.0.14

package/generated/protocol.d.ts

@@ -293,7 +293,7 @@ export declare namespace Accessibility {
         depth?: integer;
         /**
          * The frame for whose document the AX tree should be retrieved.
-         * If omited, the root frame is used.
+         * If omitted, the root frame is used.
          */
         frameId?: Page.FrameId;
     }
@@ -928,7 +928,12 @@ export declare namespace Audits {
         InvalidRegisterOsTriggerHeader = "InvalidRegisterOsTriggerHeader",
         WebAndOsHeaders = "WebAndOsHeaders",
         NoWebOrOsSupport = "NoWebOrOsSupport",
-        NavigationRegistrationWithoutTransientUserActivation = "NavigationRegistrationWithoutTransientUserActivation"
+        NavigationRegistrationWithoutTransientUserActivation = "NavigationRegistrationWithoutTransientUserActivation",
+        InvalidInfoHeader = "InvalidInfoHeader",
+        NoRegisterSourceHeader = "NoRegisterSourceHeader",
+        NoRegisterTriggerHeader = "NoRegisterTriggerHeader",
+        NoRegisterOsSourceHeader = "NoRegisterOsSourceHeader",
+        NoRegisterOsTriggerHeader = "NoRegisterOsTriggerHeader"
     }
     /**
      * Details for issues around "Attribution Reporting API" usage.
@@ -1334,7 +1339,7 @@ export declare namespace Autofill {
      */
     interface AddressUI {
         /**
-         * A two dimension array containing the repesentation of values from an address profile.
+         * A two dimension array containing the representation of values from an address profile.
          */
         addressFields: AddressFields[];
     }
@@ -1370,6 +1375,10 @@ export declare namespace Autofill {
          * The filling strategy
          */
         fillingStrategy: FillingStrategy;
+        /**
+         * The frame the field belongs to
+         */
+        frameId: Page.FrameId;
         /**
          * The form field's DOM node
          */
@@ -1556,6 +1565,7 @@ export declare namespace Browser {
         ProtectedMediaIdentifier = "protectedMediaIdentifier",
         Sensors = "sensors",
         StorageAccess = "storageAccess",
+        SpeakerSelection = "speakerSelection",
         TopLevelStorageAccess = "topLevelStorageAccess",
         VideoCapture = "videoCapture",
         VideoCapturePanTiltZoom = "videoCapturePanTiltZoom",
@@ -1686,7 +1696,7 @@ export declare namespace Browser {
         /**
          * Whether to allow all or deny all download requests, or use default Chrome behavior if
          * available (otherwise deny). |allowAndName| allows download and names files according to
-         * their dowmload guids.
+         * their download guids.
          */
         behavior: SetDownloadBehaviorRequestBehavior;
         /**
@@ -2013,7 +2023,7 @@ export declare namespace CSS {
         frameId: Page.FrameId;
         /**
          * Stylesheet resource URL. Empty if this is a constructed stylesheet created using
-         * new CSSStyleSheet() (but non-empty if this is a constructed sylesheet imported
+         * new CSSStyleSheet() (but non-empty if this is a constructed stylesheet imported
          * as a CSS module script).
          */
         sourceURL: string;
@@ -3720,7 +3730,7 @@ export declare namespace DOM {
     }
     interface GetAttributesRequest {
         /**
-         * Id of the node to retrieve attibutes for.
+         * Id of the node to retrieve attributes for.
          */
         nodeId: NodeId;
     }
@@ -5305,14 +5315,14 @@ export declare namespace Emulation {
         PauseIfNetworkFetchesPending = "pauseIfNetworkFetchesPending"
     }
     /**
-     * Used to specify User Agent Cient Hints to emulate. See https://wicg.github.io/ua-client-hints
+     * Used to specify User Agent Client Hints to emulate. See https://wicg.github.io/ua-client-hints
      */
     interface UserAgentBrandVersion {
         brand: string;
         version: string;
     }
     /**
-     * Used to specify User Agent Cient Hints to emulate. See https://wicg.github.io/ua-client-hints
+     * Used to specify User Agent Client Hints to emulate. See https://wicg.github.io/ua-client-hints
      * Missing optional values will be filled in by the target with what it would normally use.
      */
     interface UserAgentMetadata {
@@ -5624,8 +5634,9 @@ export declare namespace Emulation {
     }
     interface SetTimezoneOverrideRequest {
         /**
-         * The timezone identifier. If empty, disables the override and
-         * restores default host system timezone.
+         * The timezone identifier. List of supported timezones:
+         * https://source.chromium.org/chromium/chromium/deps/icu.git/+/faee8bc70570192d82d2978a71e2a615788597d1:source/data/misc/metaZones.txt
+         * If empty, disables the override and restores default host system timezone.
          */
         timezoneId: string;
     }
@@ -5759,7 +5770,7 @@ export declare namespace IO {
          */
         handle: StreamHandle;
         /**
-         * Seek to the specified offset before reading (if not specificed, proceed with offset
+         * Seek to the specified offset before reading (if not specified, proceed with offset
          * following the last read). Some types of streams may only support sequential reads.
          */
         offset?: integer;
@@ -6903,7 +6914,7 @@ export declare namespace LayerTree {
     }
     interface LayerTreeDidChangeEvent {
         /**
-         * Layer tree, absent if not in the comspositing mode.
+         * Layer tree, absent if not in the compositing mode.
          */
         layers?: Layer[];
     }
@@ -7389,7 +7400,7 @@ export declare namespace Network {
         trustTokenParams?: TrustTokenParams;
         /**
          * True if this resource request is considered to be the 'same site' as the
-         * request correspondinfg to the main frame.
+         * request corresponding to the main frame.
          */
         isSameSite?: boolean;
     }
@@ -7615,8 +7626,18 @@ export declare namespace Network {
         DnsAlpnH3JobWonRace = "dnsAlpnH3JobWonRace",
         UnspecifiedReason = "unspecifiedReason"
     }
+    /**
+     * Source of service worker router.
+     */
+    const enum ServiceWorkerRouterSource {
+        Network = "network",
+        Cache = "cache",
+        FetchEvent = "fetch-event",
+        RaceNetworkAndFetchHandler = "race-network-and-fetch-handler"
+    }
     interface ServiceWorkerRouterInfo {
         ruleIdMatched: integer;
+        matchedSourceType: ServiceWorkerRouterSource;
     }
     /**
      * HTTP response data.
@@ -7687,7 +7708,7 @@ export declare namespace Network {
          */
         fromPrefetchCache?: boolean;
         /**
-         * Infomation about how Service Worker Static Router was used.
+         * Information about how Service Worker Static Router was used.
          */
         serviceWorkerRouterInfo?: ServiceWorkerRouterInfo;
         /**
@@ -8287,7 +8308,7 @@ export declare namespace Network {
          */
         securityDetails?: SecurityDetails;
         /**
-         * Errors occurred while handling the signed exchagne.
+         * Errors occurred while handling the signed exchange.
          */
         errors?: SignedExchangeError[];
     }
@@ -8917,7 +8938,7 @@ export declare namespace Network {
          */
         type: ResourceType;
         /**
-         * User friendly error message.
+         * Error message. List of network errors: https://cs.chromium.org/chromium/src/net/base/net_error_list.h
          */
         errorText: string;
         /**
@@ -9379,7 +9400,7 @@ export declare namespace Network {
          */
         cookiePartitionKey?: string;
         /**
-         * True if partitioned cookies are enabled, but the partition key is not serializeable to string.
+         * True if partitioned cookies are enabled, but the partition key is not serializable to string.
          */
         cookiePartitionKeyOpaque?: boolean;
         /**
@@ -9528,7 +9549,7 @@ export declare namespace Overlay {
      */
     interface SourceOrderConfig {
         /**
-         * the color to outline the givent element in.
+         * the color to outline the given element in.
          */
         parentOutlineColor: DOM.RGBA;
         /**
@@ -9874,7 +9895,7 @@ export declare namespace Overlay {
          */
         showCSS: boolean;
         /**
-         * Seleted platforms to show the overlay.
+         * Selected platforms to show the overlay.
          */
         selectedPlatform: string;
         /**
@@ -10358,6 +10379,7 @@ export declare namespace Page {
         SharedStorage = "shared-storage",
         SharedStorageSelectUrl = "shared-storage-select-url",
         SmartCard = "smart-card",
+        SpeakerSelection = "speaker-selection",
         StorageAccess = "storage-access",
         SubApps = "sub-apps",
         SyncXhr = "sync-xhr",
@@ -10667,7 +10689,7 @@ export declare namespace Page {
          */
         message: string;
         /**
-         * If criticial, this is a non-recoverable parse error.
+         * If critical, this is a non-recoverable parse error.
          */
         critical: integer;
         /**
@@ -10897,7 +10919,7 @@ export declare namespace Page {
         eager?: boolean;
     }
     /**
-     * Enum of possible auto-reponse for permisison / prompt dialogs.
+     * Enum of possible auto-response for permission / prompt dialogs.
      */
     const enum AutoResponseMode {
         None = "none",
@@ -10981,7 +11003,6 @@ export declare namespace Page {
         SubresourceHasCacheControlNoCache = "SubresourceHasCacheControlNoCache",
         ContainsPlugins = "ContainsPlugins",
         DocumentLoaded = "DocumentLoaded",
-        DedicatedWorkerOrWorklet = "DedicatedWorkerOrWorklet",
         OutstandingNetworkRequestOthers = "OutstandingNetworkRequestOthers",
         RequestedMIDIPermission = "RequestedMIDIPermission",
         RequestedAudioCapturePermission = "RequestedAudioCapturePermission",
@@ -11022,6 +11043,7 @@ export declare namespace Page {
         SmartCard = "SmartCard",
         LiveMediaStreamTrack = "LiveMediaStreamTrack",
         UnloadHandler = "UnloadHandler",
+        ParserAborted = "ParserAborted",
         ContentSecurityHandler = "ContentSecurityHandler",
         ContentWebAuthenticationAPI = "ContentWebAuthenticationAPI",
         ContentFileChooser = "ContentFileChooser",
@@ -12028,7 +12050,7 @@ export declare namespace Page {
      */
     interface BackForwardCacheNotUsedEvent {
         /**
-         * The loader id for the associated navgation.
+         * The loader id for the associated navigation.
          */
         loaderId: Network.LoaderId;
         /**
@@ -12223,7 +12245,7 @@ export declare namespace PerformanceTimeline {
         frameId: Page.FrameId;
         /**
          * The event type, as specified in https://w3c.github.io/performance-timeline/#dom-performanceentry-entrytype
-         * This determines which of the optional "details" fiedls is present.
+         * This determines which of the optional "details" fields is present.
          */
         type: string;
         /**
@@ -12335,7 +12357,7 @@ export declare namespace Security {
          */
         certificateNetworkError?: string;
         /**
-         * True if the certificate uses a weak signature aglorithm.
+         * True if the certificate uses a weak signature algorithm.
          */
         certificateHasWeakSignature: boolean;
         /**
@@ -12789,9 +12811,23 @@ export declare namespace Storage {
      * Details for an origin's shared storage.
      */
     interface SharedStorageMetadata {
+        /**
+         * Time when the origin's shared storage was last created.
+         */
         creationTime: Network.TimeSinceEpoch;
+        /**
+         * Number of key-value pairs stored in origin's shared storage.
+         */
         length: integer;
+        /**
+         * Current amount of bits of entropy remaining in the navigation budget.
+         */
         remainingBudget: number;
+        /**
+         * Total number of bytes stored as key-value pairs in origin's shared
+         * storage.
+         */
+        bytesUsed: integer;
     }
     /**
      * Pair of reporting metadata details for a candidate URL for `selectURL()`.
@@ -12976,7 +13012,7 @@ export declare namespace Storage {
         Include = "include",
         Exclude = "exclude"
     }
-    interface AttributionReportingAggregatableValueEntry {
+    interface AttributionReportingAggregatableValueDictEntry {
         key: string;
         /**
          * number instead of integer because not all uint32 can be represented by
@@ -12984,6 +13020,10 @@ export declare namespace Storage {
          */
         value: number;
     }
+    interface AttributionReportingAggregatableValueEntry {
+        values: AttributionReportingAggregatableValueDictEntry[];
+        filters: AttributionReportingFilterPair;
+    }
     interface AttributionReportingEventTriggerData {
         data: UnsignedInt64AsBase10;
         priority: SignedInt64AsBase10;
@@ -13428,7 +13468,7 @@ export declare namespace Storage {
          */
         ownerOrigin: string;
         /**
-         * The sub-parameters warapped by `params` are all optional and their
+         * The sub-parameters wrapped by `params` are all optional and their
          * presence/absence depends on `type`.
          */
         params: SharedStorageAccessParams;
@@ -13676,6 +13716,9 @@ export declare namespace Target {
     type SessionID = OpaqueIdentifier<string, 'Protocol.Target.SessionID'>;
     interface TargetInfo {
         targetId: TargetID;
+        /**
+         * List of types: https://source.chromium.org/chromium/chromium/src/+/main:content/browser/devtools/devtools_agent_host_impl.cc?ss=chromium&q=f:devtools%20-f:out%20%22::kTypeTab%5B%5D%22
+         */
         type: string;
         title: string;
         url: string;
@@ -13707,7 +13750,7 @@ export declare namespace Target {
      */
     interface FilterEntry {
         /**
-         * If set, causes exclusion of mathcing targets from the list.
+         * If set, causes exclusion of matching targets from the list.
          */
         exclude?: boolean;
         /**
@@ -14913,6 +14956,18 @@ export declare namespace WebAuthn {
          * See https://w3c.github.io/webauthn/#sctn-large-blob-extension
          */
         largeBlob?: binary;
+        /**
+         * Assertions returned by this credential will have the backup eligibility
+         * (BE) flag set to this value. Defaults to the authenticator's
+         * defaultBackupEligibility value.
+         */
+        backupEligibility?: boolean;
+        /**
+         * Assertions returned by this credential will have the backup state (BS)
+         * flag set to this value. Defaults to the authenticator's
+         * defaultBackupState value.
+         */
+        backupState?: boolean;
     }
     interface EnableRequest {
         /**
@@ -14983,6 +15038,12 @@ export declare namespace WebAuthn {
         authenticatorId: AuthenticatorId;
         enabled: boolean;
     }
+    interface SetCredentialPropertiesRequest {
+        authenticatorId: AuthenticatorId;
+        credentialId: binary;
+        backupEligibility?: boolean;
+        backupState?: boolean;
+    }
     /**
      * Triggered when a credential is added to an authenticator.
      */
@@ -15241,7 +15302,7 @@ export declare namespace Preload {
      * that had a speculation rule that triggered the attempt, and the
      * BackendNodeIds of <a href> or <area href> elements that triggered the
      * attempt (in the case of attempts triggered by a document rule). It is
-     * possible for mulitple rule sets and links to trigger a single attempt.
+     * possible for multiple rule sets and links to trigger a single attempt.
      */
     interface PreloadingAttemptSource {
         key: PreloadingAttemptKey;

package/models/cpu_profile/cpu_profile-tsconfig.json

@@ -34,8 +34,7 @@
     "../../../../../../front_end/legacy/legacy-defs.d.ts",
     "../../../../../../front_end/global_typings/global_defs.d.ts",
     "../../../../../../front_end/global_typings/request_idle_callback.d.ts",
-    "../../../../../../node_modules/@types/filesystem/index.d.ts",
-    "../../../../../../node_modules/@webgpu/types/dist/index.d.ts"
+    "../../../../../../node_modules/@types/filesystem/index.d.ts"
   ],
   "references": [
     {

package/models/cpu_profile/devtools_entrypoint-bundle-typescript-tsconfig.json

@@ -33,8 +33,7 @@
     "../../../../../../front_end/legacy/legacy-defs.d.ts",
     "../../../../../../front_end/global_typings/global_defs.d.ts",
     "../../../../../../front_end/global_typings/request_idle_callback.d.ts",
-    "../../../../../../node_modules/@types/filesystem/index.d.ts",
-    "../../../../../../node_modules/@webgpu/types/dist/index.d.ts"
+    "../../../../../../node_modules/@types/filesystem/index.d.ts"
   ],
   "references": [
     {

package/models/trace/EntriesFilter.d.ts

@@ -45,6 +45,10 @@ export declare class EntriesFilter {
      * Returns the set of entries that are invisible given the set of applied actions.
      **/
     invisibleEntries(): Types.TraceEvents.TraceEventData[];
+    /**
+     * Returns the array of entries that have a sign indicating that entries below are hidden.
+     **/
+    modifiedEntries(): Types.TraceEvents.TraceEventData[];
     /**
      * Applies an action to hide entries or removes entries
      * from hidden entries array depending on the action.

package/models/trace/EntriesFilter.js

@@ -77,6 +77,12 @@ export class EntriesFilter {
     invisibleEntries() {
         return this.#invisibleEntries;
     }
+    /**
+     * Returns the array of entries that have a sign indicating that entries below are hidden.
+     **/
+    modifiedEntries() {
+        return this.#modifiedVisibleEntries;
+    }
     /**
      * Applies an action to hide entries or removes entries
      * from hidden entries array depending on the action.
@@ -98,7 +104,7 @@ export class EntriesFilter {
                 const actionNode = this.#entryToNode.get(action.entry) || null;
                 const parentNode = actionNode && this.#findNextVisibleParent(actionNode);
                 if (parentNode) {
-                    this.#modifiedVisibleEntries.push(parentNode?.entry);
+                    this.#addModifiedEntry(parentNode.entry);
                 }
                 break;
             }
@@ -111,10 +117,7 @@ export class EntriesFilter {
                 }
                 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);
-                }
+                this.#addModifiedEntry(action.entry);
                 break;
             }
             case "COLLAPSE_REPEATING_DESCENDANTS" /* FilterAction.COLLAPSE_REPEATING_DESCENDANTS */: {
@@ -126,7 +129,7 @@ export class EntriesFilter {
                 const allRepeatingDescendants = this.#findAllRepeatingDescendantsOfNext(entryNode);
                 allRepeatingDescendants.forEach(descendant => entriesToHide.add(descendant));
                 if (entriesToHide.size > 0) {
-                    this.#modifiedVisibleEntries.push(action.entry);
+                    this.#addModifiedEntry(action.entry);
                 }
                 break;
             }
@@ -145,6 +148,26 @@ export class EntriesFilter {
         this.#invisibleEntries.push(...entriesToHide);
         return this.#invisibleEntries;
     }
+    /**
+     * Add an entry to the array of entries that have a sign indicating that entries below are hidden.
+     * Also, remove all of the child entries of the new modified entry from the modified array. Do that because
+     * to draw the initiator from the closest visible entry, we need to get the closest entry that is
+     * marked as modified and we do not want to get some that are hidden.
+     */
+    #addModifiedEntry(entry) {
+        this.#modifiedVisibleEntries.push(entry);
+        const entryNode = this.#entryToNode.get(entry);
+        if (!entryNode) {
+            // Invalid node was given, just ignore and move on.
+            return;
+        }
+        const allDescendants = this.#findAllDescendantsOfNode(entryNode);
+        if (allDescendants.length > 0) {
+            this.#modifiedVisibleEntries = this.#modifiedVisibleEntries.filter(entry => {
+                return !allDescendants.includes(entry);
+            });
+        }
+    }
     // The direct parent might be hidden by other actions, therefore we look for the next visible parent.
     #findNextVisibleParent(node) {
         let parent = node.parent;

package/models/trace/EntriesFilter.js.map

@@ -1 +1 @@
-{"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"]}
+{"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;;QAEI;IACJ,eAAe;QACb,OAAO,IAAI,CAAC,uBAAuB,CAAC;IACtC,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,iBAAiB,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;iBAC1C;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,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACrC,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,iBAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;iBACtC;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;;;;;OAKG;IACH,iBAAiB,CAAC,KAAuC;QACvD,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,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,cAAc,GAAG,IAAI,CAAC,yBAAyB,CAAC,SAAS,CAAC,CAAC;QACjE,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7B,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;gBACzE,OAAO,CAAC,cAAc,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACzC,CAAC,CAAC,CAAC;SACJ;IACH,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   * Returns the array of entries that have a sign indicating that entries below are hidden.\n   **/\n  modifiedEntries(): Types.TraceEvents.TraceEventData[] {\n    return this.#modifiedVisibleEntries;\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.#addModifiedEntry(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        this.#addModifiedEntry(action.entry);\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.#addModifiedEntry(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  /**\n   * Add an entry to the array of entries that have a sign indicating that entries below are hidden.\n   * Also, remove all of the child entries of the new modified entry from the modified array. Do that because\n   * to draw the initiator from the closest visible entry, we need to get the closest entry that is\n   * marked as modified and we do not want to get some that are hidden.\n   */\n  #addModifiedEntry(entry: Types.TraceEvents.TraceEventData): void {\n    this.#modifiedVisibleEntries.push(entry);\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 allDescendants = this.#findAllDescendantsOfNode(entryNode);\n    if (allDescendants.length > 0) {\n      this.#modifiedVisibleEntries = this.#modifiedVisibleEntries.filter(entry => {\n        return !allDescendants.includes(entry);\n      });\n    }\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"]}

package/models/trace/ModelImpl.d.ts

@@ -1,4 +1,5 @@
 import * as Handlers from './handlers/handlers.js';
+import type * as Insights from './insights/insights.js';
 import * as Types from './types/types.js';
 export interface ParseConfig {
     metadata?: Types.File.MetaData;
@@ -62,6 +63,7 @@ export declare class Model<EnabledModelHandlers extends {
      * If no index is given, the last stored parsed data is returned.
      */
     traceParsedData(index?: number): Handlers.Types.EnabledHandlerDataWithMeta<EnabledModelHandlers> | null;
+    traceInsights(index?: number): Insights.Types.TraceInsightData<EnabledModelHandlers> | null;
     metadata(index: number): Types.File.MetaData | null;
     traceEvents(index: number): readonly Types.TraceEvents.TraceEventData[] | null;
     size(): number;
@@ -78,6 +80,7 @@ export type ParsedTraceFile<Handlers extends {
     [key: string]: Handlers.Types.TraceEventHandler;
 }> = Types.File.TraceFile & {
     traceParsedData: Handlers.Types.EnabledHandlerDataWithMeta<Handlers> | null;
+    traceInsights: Insights.Types.TraceInsightData<Handlers> | null;
 };
 export declare const enum ModelUpdateType {
     COMPLETE = "COMPLETE",

package/models/trace/ModelImpl.js

@@ -87,12 +87,13 @@ export class Model extends EventTarget {
             traceEvents,
             metadata,
             traceParsedData: null,
+            traceInsights: null,
         };
         try {
             // Wait for all outstanding promises before finishing the async execution,
             // but perform all tasks in parallel.
             await this.#processor.parse(traceEvents, isFreshRecording);
-            this.#storeParsedFileData(file, this.#processor.data);
+            this.#storeParsedFileData(file, this.#processor.traceParsedData, this.#processor.insights);
             // We only push the file onto this.#traces here once we know it's valid
             // and there's been no errors in the parsing.
             this.#traces.push(file);
@@ -107,8 +108,9 @@ export class Model extends EventTarget {
             this.dispatchEvent(new ModelUpdateEvent({ type: "COMPLETE" /* ModelUpdateType.COMPLETE */, data: 'done' }));
         }
     }
-    #storeParsedFileData(file, data) {
+    #storeParsedFileData(file, data, insights) {
         file.traceParsedData = data;
+        file.traceInsights = insights;
         this.#lastRecordingIndex++;
         let recordingName = `Trace ${this.#lastRecordingIndex}`;
         let origin = null;
@@ -132,6 +134,12 @@ export class Model extends EventTarget {
         }
         return this.#traces[index].traceParsedData;
     }
+    traceInsights(index = this.#traces.length - 1) {
+        if (!this.#traces[index]) {
+            return null;
+        }
+        return this.#traces[index].traceInsights;
+    }
     metadata(index) {
         if (!this.#traces[index]) {
             return null;