@paulirish/trace_engine 0.0.35 → 0.0.37

package/models/trace/extras/TraceTree.js

@@ -0,0 +1,515 @@
+// Copyright 2016 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 Helpers from '../helpers/helpers.js';
+import * as Types from '../types/types.js';
+import { TimelineJSProfileProcessor } from './TimelineJSProfile.js';
+export class Node {
+    totalTime;
+    selfTime;
+    id;
+    event;
+    parent;
+    groupId;
+    isGroupNodeInternal;
+    depth;
+    constructor(id, event) {
+        this.totalTime = 0;
+        this.selfTime = 0;
+        this.id = id;
+        this.event = event;
+        this.groupId = '';
+        this.isGroupNodeInternal = false;
+        this.depth = 0;
+    }
+    isGroupNode() {
+        return this.isGroupNodeInternal;
+    }
+    hasChildren() {
+        throw 'Not implemented';
+    }
+    setHasChildren(_value) {
+        throw 'Not implemented';
+    }
+    /**
+     * Returns the direct descendants of this node.
+     * @returns a map with ordered <nodeId, Node> tuples.
+     */
+    children() {
+        throw 'Not implemented';
+    }
+    searchTree(matchFunction, results) {
+        results = results || [];
+        if (this.event && matchFunction(this.event)) {
+            results.push(this);
+        }
+        for (const child of this.children().values()) {
+            child.searchTree(matchFunction, results);
+        }
+        return results;
+    }
+}
+export class TopDownNode extends Node {
+    root;
+    hasChildrenInternal;
+    childrenInternal;
+    parent;
+    constructor(id, event, parent) {
+        super(id, event);
+        this.root = parent && parent.root;
+        this.hasChildrenInternal = false;
+        this.childrenInternal = null;
+        this.parent = parent;
+    }
+    hasChildren() {
+        return this.hasChildrenInternal;
+    }
+    setHasChildren(value) {
+        this.hasChildrenInternal = value;
+    }
+    children() {
+        return this.childrenInternal || this.buildChildren();
+    }
+    buildChildren() {
+        // Tracks the ancestor path of this node, includes the current node.
+        const path = [];
+        for (let node = this; node.parent && !node.isGroupNode(); node = node.parent) {
+            path.push(node);
+        }
+        path.reverse();
+        const children = new Map();
+        const self = this;
+        const root = this.root;
+        if (!root) {
+            this.childrenInternal = children;
+            return this.childrenInternal;
+        }
+        const startTime = root.startTime;
+        const endTime = root.endTime;
+        const instantEventCallback = (root.doNotAggregate || root.includeInstantEvents) ? onInstantEvent : undefined;
+        const eventIdCallback = root.doNotAggregate ? undefined : generateEventID;
+        const eventGroupIdCallback = root.getEventGroupIdCallback();
+        let depth = 0;
+        // The amount of ancestors found to match this node's ancestors
+        // during the event tree walk.
+        let matchedDepth = 0;
+        let currentDirectChild = null;
+        // Walk on the full event tree to find this node's children.
+        Helpers.Trace.forEachEvent(root.events, {
+            onStartEvent,
+            onEndEvent,
+            onInstantEvent: instantEventCallback,
+            startTime: Helpers.Timing.millisecondsToMicroseconds(startTime),
+            endTime: Helpers.Timing.millisecondsToMicroseconds(endTime),
+            eventFilter: root.filter,
+            ignoreAsyncEvents: false,
+        });
+        function onStartEvent(e) {
+            const { startTime: currentStartTime, endTime: currentEndTime } = Helpers.Timing.eventTimingsMilliSeconds(e);
+            ++depth;
+            if (depth > path.length + 2) {
+                return;
+            }
+            if (!matchPath(e)) {
+                return;
+            }
+            const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;
+            const duration = actualEndTime - Math.max(startTime, currentStartTime);
+            if (duration < 0) {
+                console.error('Negative event duration');
+            }
+            processEvent(e, duration);
+        }
+        function onInstantEvent(e) {
+            ++depth;
+            if (matchedDepth === path.length && depth <= path.length + 2) {
+                processEvent(e, 0);
+            }
+            --depth;
+        }
+        /**
+         * Creates a child node.
+         */
+        function processEvent(e, duration) {
+            if (depth === path.length + 2) {
+                if (!currentDirectChild) {
+                    return;
+                }
+                currentDirectChild.setHasChildren(true);
+                currentDirectChild.selfTime -= duration;
+                return;
+            }
+            let id;
+            let groupId = '';
+            if (!eventIdCallback) {
+                id = Symbol('uniqueId');
+            }
+            else {
+                id = eventIdCallback(e);
+                groupId = eventGroupIdCallback ? eventGroupIdCallback(e) : '';
+                if (groupId) {
+                    id += '/' + groupId;
+                }
+            }
+            let node = children.get(id);
+            if (!node) {
+                node = new TopDownNode(id, e, self);
+                node.groupId = groupId;
+                children.set(id, node);
+            }
+            node.selfTime += duration;
+            node.totalTime += duration;
+            currentDirectChild = node;
+        }
+        /**
+         * Checks if the path of ancestors of an event matches the path of
+         * ancestors of the current node. In other words, checks if an event
+         * is a child of this node. As the check is done, the partial result
+         * is cached on `matchedDepth`, for future checks.
+         */
+        function matchPath(e) {
+            const { endTime } = Helpers.Timing.eventTimingsMilliSeconds(e);
+            if (matchedDepth === path.length) {
+                return true;
+            }
+            if (matchedDepth !== depth - 1) {
+                return false;
+            }
+            if (!endTime) {
+                return false;
+            }
+            if (!eventIdCallback) {
+                if (e === path[matchedDepth].event) {
+                    ++matchedDepth;
+                }
+                return false;
+            }
+            let id = eventIdCallback(e);
+            const groupId = eventGroupIdCallback ? eventGroupIdCallback(e) : '';
+            if (groupId) {
+                id += '/' + groupId;
+            }
+            if (id === path[matchedDepth].id) {
+                ++matchedDepth;
+            }
+            return false;
+        }
+        function onEndEvent() {
+            --depth;
+            if (matchedDepth > depth) {
+                matchedDepth = depth;
+            }
+        }
+        this.childrenInternal = children;
+        return children;
+    }
+    getRoot() {
+        return this.root;
+    }
+}
+export class TopDownRootNode extends TopDownNode {
+    filter;
+    /** This is all events passed in to create the tree, and it's very likely that it included events outside of the passed startTime/endTime as that filtering is done in `Helpers.Trace.forEachEvent` */
+    events;
+    startTime;
+    endTime;
+    eventGroupIdCallback;
+    /** Default behavior is to aggregate similar trace events into one Node based on generateEventID(), eventGroupIdCallback(), etc. Set true to keep nodes 1:1 with events. */
+    doNotAggregate;
+    includeInstantEvents;
+    totalTime;
+    selfTime;
+    constructor(events, filters, startTime, endTime, doNotAggregate, eventGroupIdCallback, includeInstantEvents) {
+        super('', null, null);
+        this.root = this;
+        this.events = events;
+        this.filter = (e) => filters.every(f => f.accept(e));
+        this.startTime = startTime;
+        this.endTime = endTime;
+        this.eventGroupIdCallback = eventGroupIdCallback;
+        this.doNotAggregate = doNotAggregate;
+        this.includeInstantEvents = includeInstantEvents;
+        this.totalTime = endTime - startTime;
+        this.selfTime = this.totalTime;
+    }
+    children() {
+        return this.childrenInternal || this.grouppedTopNodes();
+    }
+    grouppedTopNodes() {
+        const flatNodes = super.children();
+        for (const node of flatNodes.values()) {
+            this.selfTime -= node.totalTime;
+        }
+        if (!this.eventGroupIdCallback) {
+            return flatNodes;
+        }
+        const groupNodes = new Map();
+        for (const node of flatNodes.values()) {
+            if (!node.event) {
+                continue;
+            }
+            const groupId = this.eventGroupIdCallback(node.event);
+            let groupNode = groupNodes.get(groupId);
+            if (!groupNode) {
+                groupNode = new GroupNode(groupId, this, node.event);
+                groupNodes.set(groupId, groupNode);
+            }
+            groupNode.addChild(node, node.selfTime, node.totalTime);
+        }
+        this.childrenInternal = groupNodes;
+        return groupNodes;
+    }
+    getEventGroupIdCallback() {
+        return this.eventGroupIdCallback;
+    }
+}
+export class BottomUpRootNode extends Node {
+    childrenInternal;
+    events;
+    textFilter;
+    filter;
+    startTime;
+    endTime;
+    eventGroupIdCallback;
+    totalTime;
+    constructor(events, textFilter, filters, startTime, endTime, eventGroupIdCallback) {
+        super('', null);
+        this.childrenInternal = null;
+        this.events = events;
+        this.textFilter = textFilter;
+        this.filter = (e) => filters.every(f => f.accept(e));
+        this.startTime = startTime;
+        this.endTime = endTime;
+        this.eventGroupIdCallback = eventGroupIdCallback;
+        this.totalTime = endTime - startTime;
+    }
+    hasChildren() {
+        return true;
+    }
+    filterChildren(children) {
+        for (const [id, child] of children) {
+            // to provide better context to user only filter first (top) level.
+            if (child.event && child.depth <= 1 && !this.textFilter.accept(child.event)) {
+                children.delete(id);
+            }
+        }
+        return children;
+    }
+    children() {
+        if (!this.childrenInternal) {
+            this.childrenInternal = this.filterChildren(this.grouppedTopNodes());
+        }
+        return this.childrenInternal;
+    }
+    ungrouppedTopNodes() {
+        const root = this;
+        const startTime = this.startTime;
+        const endTime = this.endTime;
+        const nodeById = new Map();
+        const selfTimeStack = [endTime - startTime];
+        const firstNodeStack = [];
+        const totalTimeById = new Map();
+        Helpers.Trace.forEachEvent(this.events, {
+            onStartEvent,
+            onEndEvent,
+            startTime: Helpers.Timing.millisecondsToMicroseconds(this.startTime),
+            endTime: Helpers.Timing.millisecondsToMicroseconds(this.endTime),
+            eventFilter: this.filter,
+            ignoreAsyncEvents: false,
+        });
+        function onStartEvent(e) {
+            const { startTime: currentStartTime, endTime: currentEndTime } = Helpers.Timing.eventTimingsMilliSeconds(e);
+            const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;
+            const duration = actualEndTime - Math.max(currentStartTime, startTime);
+            selfTimeStack[selfTimeStack.length - 1] -= duration;
+            selfTimeStack.push(duration);
+            const id = generateEventID(e);
+            const noNodeOnStack = !totalTimeById.has(id);
+            if (noNodeOnStack) {
+                totalTimeById.set(id, duration);
+            }
+            firstNodeStack.push(noNodeOnStack);
+        }
+        function onEndEvent(event) {
+            const id = generateEventID(event);
+            let node = nodeById.get(id);
+            if (!node) {
+                node = new BottomUpNode(root, id, event, false, root);
+                nodeById.set(id, node);
+            }
+            node.selfTime += selfTimeStack.pop() || 0;
+            if (firstNodeStack.pop()) {
+                node.totalTime += totalTimeById.get(id) || 0;
+                totalTimeById.delete(id);
+            }
+            if (firstNodeStack.length) {
+                node.setHasChildren(true);
+            }
+        }
+        this.selfTime = selfTimeStack.pop() || 0;
+        for (const pair of nodeById) {
+            if (pair[1].selfTime <= 0) {
+                nodeById.delete(pair[0]);
+            }
+        }
+        return nodeById;
+    }
+    grouppedTopNodes() {
+        const flatNodes = this.ungrouppedTopNodes();
+        if (!this.eventGroupIdCallback) {
+            return flatNodes;
+        }
+        const groupNodes = new Map();
+        for (const node of flatNodes.values()) {
+            if (!node.event) {
+                continue;
+            }
+            const groupId = this.eventGroupIdCallback(node.event);
+            let groupNode = groupNodes.get(groupId);
+            if (!groupNode) {
+                groupNode = new GroupNode(groupId, this, node.event);
+                groupNodes.set(groupId, groupNode);
+            }
+            groupNode.addChild(node, node.selfTime, node.selfTime);
+        }
+        return groupNodes;
+    }
+}
+export class GroupNode extends Node {
+    childrenInternal;
+    isGroupNodeInternal;
+    constructor(id, parent, event) {
+        super(id, event);
+        this.childrenInternal = new Map();
+        this.parent = parent;
+        this.isGroupNodeInternal = true;
+    }
+    addChild(child, selfTime, totalTime) {
+        this.childrenInternal.set(child.id, child);
+        this.selfTime += selfTime;
+        this.totalTime += totalTime;
+        child.parent = this;
+    }
+    hasChildren() {
+        return true;
+    }
+    children() {
+        return this.childrenInternal;
+    }
+}
+export class BottomUpNode extends Node {
+    parent;
+    root;
+    depth;
+    cachedChildren;
+    hasChildrenInternal;
+    constructor(root, id, event, hasChildren, parent) {
+        super(id, event);
+        this.parent = parent;
+        this.root = root;
+        this.depth = (parent.depth || 0) + 1;
+        this.cachedChildren = null;
+        this.hasChildrenInternal = hasChildren;
+    }
+    hasChildren() {
+        return this.hasChildrenInternal;
+    }
+    setHasChildren(value) {
+        this.hasChildrenInternal = value;
+    }
+    children() {
+        if (this.cachedChildren) {
+            return this.cachedChildren;
+        }
+        const selfTimeStack = [0];
+        const eventIdStack = [];
+        const eventStack = [];
+        const nodeById = new Map();
+        const startTime = this.root.startTime;
+        const endTime = this.root.endTime;
+        let lastTimeMarker = startTime;
+        const self = this;
+        Helpers.Trace.forEachEvent(this.root.events, {
+            onStartEvent,
+            onEndEvent,
+            startTime: Helpers.Timing.millisecondsToMicroseconds(startTime),
+            endTime: Helpers.Timing.millisecondsToMicroseconds(endTime),
+            eventFilter: this.root.filter,
+            ignoreAsyncEvents: false,
+        });
+        function onStartEvent(e) {
+            const { startTime: currentStartTime, endTime: currentEndTime } = Helpers.Timing.eventTimingsMilliSeconds(e);
+            const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;
+            const duration = actualEndTime - Math.max(currentStartTime, startTime);
+            if (duration < 0) {
+                console.assert(false, 'Negative duration of an event');
+            }
+            selfTimeStack[selfTimeStack.length - 1] -= duration;
+            selfTimeStack.push(duration);
+            const id = generateEventID(e);
+            eventIdStack.push(id);
+            eventStack.push(e);
+        }
+        function onEndEvent(e) {
+            const { startTime: currentStartTime, endTime: currentEndTime } = Helpers.Timing.eventTimingsMilliSeconds(e);
+            const selfTime = selfTimeStack.pop();
+            const id = eventIdStack.pop();
+            eventStack.pop();
+            let node;
+            for (node = self; node.depth > 1; node = node.parent) {
+                if (node.id !== eventIdStack[eventIdStack.length + 1 - node.depth]) {
+                    return;
+                }
+            }
+            if (node.id !== id || eventIdStack.length < self.depth) {
+                return;
+            }
+            const childId = eventIdStack[eventIdStack.length - self.depth];
+            node = nodeById.get(childId);
+            if (!node) {
+                const event = eventStack[eventStack.length - self.depth];
+                const hasChildren = eventStack.length > self.depth;
+                node = new BottomUpNode(self.root, childId, event, hasChildren, self);
+                nodeById.set(childId, node);
+            }
+            const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;
+            const totalTime = actualEndTime - Math.max(currentStartTime, lastTimeMarker);
+            node.selfTime += selfTime || 0;
+            node.totalTime += totalTime;
+            lastTimeMarker = actualEndTime;
+        }
+        this.cachedChildren = this.root.filterChildren(nodeById);
+        return this.cachedChildren;
+    }
+    searchTree(matchFunction, results) {
+        results = results || [];
+        if (this.event && matchFunction(this.event)) {
+            results.push(this);
+        }
+        return results;
+    }
+}
+export function eventStackFrame(event) {
+    if (Types.Events.isProfileCall(event)) {
+        return event.callFrame;
+    }
+    const topFrame = event.args?.data?.stackTrace?.[0];
+    if (!topFrame) {
+        return null;
+    }
+    return { ...topFrame, scriptId: String(topFrame.scriptId) };
+}
+export function generateEventID(event) {
+    if (Types.Events.isProfileCall(event)) {
+        const name = TimelineJSProfileProcessor.isNativeRuntimeFrame(event.callFrame) ?
+            TimelineJSProfileProcessor.nativeGroup(event.callFrame.functionName) :
+            event.callFrame.functionName;
+        const location = event.callFrame.scriptId || event.callFrame.url || '';
+        return `f:${name}@${location}`;
+    }
+    if (Types.Events.isTimeStamp(event)) {
+        return `${event.name}:${event.args.data.message}`;
+    }
+    return event.name;
+}
+//# sourceMappingURL=TraceTree.js.map

package/models/trace/extras/TraceTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TraceTree.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/TraceTree.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAG7B,OAAO,KAAK,OAAO,MAAM,uBAAuB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAE3C,OAAO,EAAC,0BAA0B,EAAC,MAAM,wBAAwB,CAAC;AAGlE,MAAM,OAAO,IAAI;IACf,SAAS,CAAS;IAClB,QAAQ,CAAS;IACjB,EAAE,CAAgB;IAClB,KAAK,CAA0B;IAC/B,MAAM,CAAa;IACnB,OAAO,CAAS;IAChB,mBAAmB,CAAU;IAC7B,KAAK,CAAS;IAEd,YAAY,EAAiB,EAAE,KAA8B;QAC3D,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QAEnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IAED,WAAW;QACT,MAAM,iBAAiB,CAAC;IAC1B,CAAC;IAED,cAAc,CAAC,MAAe;QAC5B,MAAM,iBAAiB,CAAC;IAC1B,CAAC;IACD;;;OAGG;IACH,QAAQ;QACN,MAAM,iBAAiB,CAAC;IAC1B,CAAC;IAED,UAAU,CAAC,aAAoD,EAAE,OAAgB;QAC/E,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,KAAK,CAAC,UAAU,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAED,MAAM,OAAO,WAAY,SAAQ,IAAI;IACnC,IAAI,CAAuB;IACnB,mBAAmB,CAAU;IACrC,gBAAgB,CAAqB;IAC5B,MAAM,CAAmB;IAElC,YAAY,EAAiB,EAAE,KAA8B,EAAE,MAAwB;QACrF,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACjC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAEQ,WAAW;QAClB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IAEQ,cAAc,CAAC,KAAc;QACpC,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;IACnC,CAAC;IAEQ,QAAQ;QACf,OAAO,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;IACvD,CAAC;IAEO,aAAa;QACnB,oEAAoE;QACpE,MAAM,IAAI,GAAkB,EAAE,CAAC;QAC/B,KAAK,IAAI,IAAI,GAAiB,IAAoB,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3G,IAAI,CAAC,IAAI,CAAE,IAAoB,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,MAAM,QAAQ,GAAkB,IAAI,GAAG,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,gBAAgB,GAAG,QAAQ,CAAC;YACjC,OAAO,IAAI,CAAC,gBAAgB,CAAC;QAC/B,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,oBAAoB,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7G,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC;QAC1E,MAAM,oBAAoB,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC5D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,+DAA+D;QAC/D,8BAA8B;QAC9B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,kBAAkB,GAAc,IAAI,CAAC;QAEzC,4DAA4D;QAC5D,OAAO,CAAC,KAAK,CAAC,YAAY,CACtB,IAAI,CAAC,MAAM,EACX;YACE,YAAY;YACZ,UAAU;YACV,cAAc,EAAE,oBAAoB;YACpC,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,0BAA0B,CAAC,SAAS,CAAC;YAC/D,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,0BAA0B,CAAC,OAAO,CAAC;YAC3D,WAAW,EAAE,IAAI,CAAC,MAAM;YACxB,iBAAiB,EAAE,KAAK;SACzB,CACJ,CAAC;QAEF,SAAS,YAAY,CAAC,CAAqB;YACzC,MAAM,EAAC,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,cAAc,EAAC,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;YAE1G,EAAE,KAAK,CAAC;YACR,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,OAAO;YACT,CAAC;YACD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,OAAO;YACT,CAAC;YACD,MAAM,aAAa,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACjG,MAAM,QAAQ,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC;YACvE,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,OAAO,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;YAC3C,CAAC;YACD,YAAY,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC5B,CAAC;QAED,SAAS,cAAc,CAAC,CAAqB;YAC3C,EAAE,KAAK,CAAC;YACR,IAAI,YAAY,KAAK,IAAI,CAAC,MAAM,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7D,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,CAAC;YACD,EAAE,KAAK,CAAC;QACV,CAAC;QAED;;WAEG;QACH,SAAS,YAAY,CAAC,CAAqB,EAAE,QAAgB;YAC3D,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,IAAI,CAAC,kBAAkB,EAAE,CAAC;oBACxB,OAAO;gBACT,CAAC;gBACD,kBAAkB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;gBACxC,kBAAkB,CAAC,QAAQ,IAAI,QAAQ,CAAC;gBACxC,OAAO;YACT,CAAC;YACD,IAAI,EAAE,CAAC;YACP,IAAI,OAAO,GAAG,EAAE,CAAC;YACjB,IAAI,CAAC,eAAe,EAAE,CAAC;gBACrB,EAAE,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACN,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBACxB,OAAO,GAAG,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,IAAI,OAAO,EAAE,CAAC;oBACZ,EAAE,IAAI,GAAG,GAAG,OAAO,CAAC;gBACtB,CAAC;YACH,CAAC;YACD,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,IAAI,WAAW,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;gBACpC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;gBACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;YAC1B,IAAI,CAAC,SAAS,IAAI,QAAQ,CAAC;YAC3B,kBAAkB,GAAG,IAAI,CAAC;QAC5B,CAAC;QAED;;;;;WAKG;QACH,SAAS,SAAS,CAAC,CAAqB;YACtC,MAAM,EAAC,OAAO,EAAC,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,YAAY,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,YAAY,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC/B,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAC,eAAe,EAAE,CAAC;gBACrB,IAAI,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC,KAAK,EAAE,CAAC;oBACnC,EAAE,YAAY,CAAC;gBACjB,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,OAAO,GAAG,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,IAAI,OAAO,EAAE,CAAC;gBACZ,EAAE,IAAI,GAAG,GAAG,OAAO,CAAC;YACtB,CAAC;YACD,IAAI,EAAE,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC;gBACjC,EAAE,YAAY,CAAC;YACjB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,SAAS,UAAU;YACjB,EAAE,KAAK,CAAC;YACR,IAAI,YAAY,GAAG,KAAK,EAAE,CAAC;gBACzB,YAAY,GAAG,KAAK,CAAC;YACvB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,gBAAgB,GAAG,QAAQ,CAAC;QACjC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;CACF;AAED,MAAM,OAAO,eAAgB,SAAQ,WAAW;IACrC,MAAM,CAAqC;IACpD,sMAAsM;IAC7L,MAAM,CAAuB;IAC7B,SAAS,CAA4B;IACrC,OAAO,CAA4B;IAC5C,oBAAoB,CAAwD;IAC5E,2KAA2K;IAClK,cAAc,CAAoB;IAClC,oBAAoB,CAAW;IAC/B,SAAS,CAAS;IAClB,QAAQ,CAAS;IAE1B,YACI,MAA4B,EAAE,OAAsB,EAAE,SAAoC,EAC1F,OAAkC,EAAE,cAAwB,EAC5D,oBAAkE,EAAE,oBAA8B;QACpG,KAAK,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAqB,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;QACjD,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;QAEjD,IAAI,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;IACjC,CAAC;IAEQ,QAAQ;QACf,OAAO,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;IAC1D,CAAC;IAEO,gBAAgB;QACtB,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC/B,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChB,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtD,IAAI,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,SAAS,GAAG,IAAI,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrD,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YACrC,CAAC;YACD,SAAS,CAAC,QAAQ,CAAC,IAAoB,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1E,CAAC;QACD,IAAI,CAAC,gBAAgB,GAAG,UAAU,CAAC;QACnC,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,uBAAuB;QACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC;IACnC,CAAC;CACF;AAED,MAAM,OAAO,gBAAiB,SAAQ,IAAI;IAChC,gBAAgB,CAAqB;IACpC,MAAM,CAAuB;IAC9B,UAAU,CAAc;IACvB,MAAM,CAAqC;IAC3C,SAAS,CAA4B;IACrC,OAAO,CAA4B;IACpC,oBAAoB,CAA8C;IACjE,SAAS,CAAS;IAE3B,YACI,MAA4B,EAAE,UAAuB,EAAE,OAAsB,EAC7E,SAAoC,EAAE,OAAkC,EACxE,oBAAiE;QACnE,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAqB,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;QACjD,IAAI,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;IACvC,CAAC;IAEQ,WAAW;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,cAAc,CAAC,QAAuB;QACpC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;YACnC,mEAAmE;YACnE,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5E,QAAQ,CAAC,MAAM,CAAE,EAAsB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEQ,QAAQ;QACf,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC;IAC/B,CAAC;IAEO,kBAAkB;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgB,CAAC;QACzC,MAAM,aAAa,GAAa,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC;QACtD,MAAM,cAAc,GAAc,EAAE,CAAC;QACrC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,OAAO,CAAC,KAAK,CAAC,YAAY,CACtB,IAAI,CAAC,MAAM,EACX;YACE,YAAY;YACZ,UAAU;YACV,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,0BAA0B,CAAC,IAAI,CAAC,SAAS,CAAC;YACpE,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,0BAA0B,CAAC,IAAI,CAAC,OAAO,CAAC;YAChE,WAAW,EAAE,IAAI,CAAC,MAAM;YACxB,iBAAiB,EAAE,KAAK;SACzB,CACJ,CAAC;QAEF,SAAS,YAAY,CAAC,CAAqB;YACzC,MAAM,EAAC,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,cAAc,EAAC,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;YAE1G,MAAM,aAAa,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACjG,MAAM,QAAQ,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACvE,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC;YACpD,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,aAAa,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7C,IAAI,aAAa,EAAE,CAAC;gBAClB,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;YAClC,CAAC;YACD,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrC,CAAC;QAED,SAAS,UAAU,CAAC,KAAyB;YAC3C,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBACtD,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,QAAQ,IAAI,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,IAAI,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,SAAS,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC7C,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC3B,CAAC;YACD,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBAC1B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAC1B,QAAQ,CAAC,MAAM,CAAE,IAAI,CAAC,CAAC,CAAY,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEO,gBAAgB;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC/B,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChB,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtD,IAAI,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,SAAS,GAAG,IAAI,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrD,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YACrC,CAAC;YACD,SAAS,CAAC,QAAQ,CAAC,IAAoB,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;CACF;AAED,MAAM,OAAO,SAAU,SAAQ,IAAI;IAChB,gBAAgB,CAAgB;IACxC,mBAAmB,CAAU;IAEtC,YAAY,EAAU,EAAE,MAAwC,EAAE,KAAyB;QACzF,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjB,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;IAClC,CAAC;IAED,QAAQ,CAAC,KAAmB,EAAE,QAAgB,EAAE,SAAiB;QAC/D,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;QAC5B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;IACtB,CAAC;IAEQ,WAAW;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAEQ,QAAQ;QACf,OAAO,IAAI,CAAC,gBAAgB,CAAC;IAC/B,CAAC;CACF;AAED,MAAM,OAAO,YAAa,SAAQ,IAAI;IAC3B,MAAM,CAAO;IACd,IAAI,CAAmB;IACtB,KAAK,CAAS;IACf,cAAc,CAAqB;IACnC,mBAAmB,CAAU;IAErC,YAAY,IAAsB,EAAE,EAAU,EAAE,KAAyB,EAAE,WAAoB,EAAE,MAAY;QAC3G,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,mBAAmB,GAAG,WAAW,CAAC;IACzC,CAAC;IAEQ,WAAW;QAClB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IAEQ,cAAc,CAAC,KAAc;QACpC,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAC;IACnC,CAAC;IAEQ,QAAQ;QACf,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACxB,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,CAAC;QACD,MAAM,aAAa,GAAa,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAyB,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;QAClC,IAAI,cAAc,GAAW,SAAS,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,CAAC,KAAK,CAAC,YAAY,CACtB,IAAI,CAAC,IAAI,CAAC,MAAM,EAChB;YACE,YAAY;YACZ,UAAU;YACV,SAAS,EAAE,OAAO,CAAC,MAAM,CAAC,0BAA0B,CAAC,SAAS,CAAC;YAC/D,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,0BAA0B,CAAC,OAAO,CAAC;YAC3D,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM;YAC7B,iBAAiB,EAAE,KAAK;SACzB,CACJ,CAAC;QACF,SAAS,YAAY,CAAC,CAAqB;YACzC,MAAM,EAAC,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,cAAc,EAAC,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;YAC1G,MAAM,aAAa,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACjG,MAAM,QAAQ,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACvE,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;YACzD,CAAC;YACD,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC;YACpD,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC9B,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QAED,SAAS,UAAU,CAAC,CAAqB;YACvC,MAAM,EAAC,SAAS,EAAE,gBAAgB,EAAE,OAAO,EAAE,cAAc,EAAC,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC;YAC1G,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC;YAC9B,UAAU,CAAC,GAAG,EAAE,CAAC;YACjB,IAAI,IAAI,CAAC;YACT,KAAK,IAAI,GAAG,IAAI,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBACrD,IAAI,IAAI,CAAC,EAAE,KAAK,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACnE,OAAO;gBACT,CAAC;YACH,CAAC;YACD,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACvD,OAAO;YACT,CAAC;YACD,MAAM,OAAO,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;YAC/D,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,MAAM,KAAK,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzD,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;gBACnD,IAAI,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;gBACtE,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC9B,CAAC;YACD,MAAM,aAAa,GAAG,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;YACjG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;YAC7E,IAAI,CAAC,QAAQ,IAAI,QAAQ,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;YAC5B,cAAc,GAAG,aAAa,CAAC;QACjC,CAAC;QAED,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;IAEQ,UAAU,CAAC,aAAoD,EAAE,OAAgB;QACxF,OAAO,GAAG,OAAO,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,KAAK,IAAI,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAED,MAAM,UAAU,eAAe,CAAC,KAAyB;IACvD,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,OAAO,KAAK,CAAC,SAAS,CAAC;IACzB,CAAC;IACD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,EAAC,GAAG,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAA8B,EAAC,CAAC;AACzF,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAyB;IACvD,IAAI,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,0BAA0B,CAAC,oBAAoB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YAC3E,0BAA0B,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC;YACtE,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,GAAG,IAAI,EAAE,CAAC;QACvE,OAAO,KAAK,IAAI,IAAI,QAAQ,EAAE,CAAC;IACjC,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACpC,OAAO,GAAG,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IACpD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC;AACpB,CAAC","sourcesContent":["// Copyright 2016 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.\n\nimport type * as Protocol from '../../../generated/protocol.js';\nimport * as Helpers from '../helpers/helpers.js';\nimport * as Types from '../types/types.js';\n\nimport {TimelineJSProfileProcessor} from './TimelineJSProfile.js';\nimport type {TraceFilter} from './TraceFilter.js';\n\nexport class Node {\n  totalTime: number;\n  selfTime: number;\n  id: string|symbol;\n  event: Types.Events.Event|null;\n  parent!: Node|null;\n  groupId: string;\n  isGroupNodeInternal: boolean;\n  depth: number;\n\n  constructor(id: string|symbol, event: Types.Events.Event|null) {\n    this.totalTime = 0;\n    this.selfTime = 0;\n    this.id = id;\n    this.event = event;\n\n    this.groupId = '';\n    this.isGroupNodeInternal = false;\n    this.depth = 0;\n  }\n\n  isGroupNode(): boolean {\n    return this.isGroupNodeInternal;\n  }\n\n  hasChildren(): boolean {\n    throw 'Not implemented';\n  }\n\n  setHasChildren(_value: boolean): void {\n    throw 'Not implemented';\n  }\n  /**\n   * Returns the direct descendants of this node.\n   * @returns a map with ordered <nodeId, Node> tuples.\n   */\n  children(): ChildrenCache {\n    throw 'Not implemented';\n  }\n\n  searchTree(matchFunction: (arg0: Types.Events.Event) => boolean, results?: Node[]): Node[] {\n    results = results || [];\n    if (this.event && matchFunction(this.event)) {\n      results.push(this);\n    }\n    for (const child of this.children().values()) {\n      child.searchTree(matchFunction, results);\n    }\n    return results;\n  }\n}\n\nexport class TopDownNode extends Node {\n  root: TopDownRootNode|null;\n  private hasChildrenInternal: boolean;\n  childrenInternal: ChildrenCache|null;\n  override parent: TopDownNode|null;\n\n  constructor(id: string|symbol, event: Types.Events.Event|null, parent: TopDownNode|null) {\n    super(id, event);\n    this.root = parent && parent.root;\n    this.hasChildrenInternal = false;\n    this.childrenInternal = null;\n    this.parent = parent;\n  }\n\n  override hasChildren(): boolean {\n    return this.hasChildrenInternal;\n  }\n\n  override setHasChildren(value: boolean): void {\n    this.hasChildrenInternal = value;\n  }\n\n  override children(): ChildrenCache {\n    return this.childrenInternal || this.buildChildren();\n  }\n\n  private buildChildren(): ChildrenCache {\n    // Tracks the ancestor path of this node, includes the current node.\n    const path: TopDownNode[] = [];\n    for (let node: TopDownNode = (this as TopDownNode); node.parent && !node.isGroupNode(); node = node.parent) {\n      path.push((node as TopDownNode));\n    }\n    path.reverse();\n    const children: ChildrenCache = new Map();\n    const self = this;\n    const root = this.root;\n    if (!root) {\n      this.childrenInternal = children;\n      return this.childrenInternal;\n    }\n    const startTime = root.startTime;\n    const endTime = root.endTime;\n    const instantEventCallback = (root.doNotAggregate || root.includeInstantEvents) ? onInstantEvent : undefined;\n    const eventIdCallback = root.doNotAggregate ? undefined : generateEventID;\n    const eventGroupIdCallback = root.getEventGroupIdCallback();\n    let depth = 0;\n    // The amount of ancestors found to match this node's ancestors\n    // during the event tree walk.\n    let matchedDepth = 0;\n    let currentDirectChild: Node|null = null;\n\n    // Walk on the full event tree to find this node's children.\n    Helpers.Trace.forEachEvent(\n        root.events,\n        {\n          onStartEvent,\n          onEndEvent,\n          onInstantEvent: instantEventCallback,\n          startTime: Helpers.Timing.millisecondsToMicroseconds(startTime),\n          endTime: Helpers.Timing.millisecondsToMicroseconds(endTime),\n          eventFilter: root.filter,\n          ignoreAsyncEvents: false,\n        },\n    );\n\n    function onStartEvent(e: Types.Events.Event): void {\n      const {startTime: currentStartTime, endTime: currentEndTime} = Helpers.Timing.eventTimingsMilliSeconds(e);\n\n      ++depth;\n      if (depth > path.length + 2) {\n        return;\n      }\n      if (!matchPath(e)) {\n        return;\n      }\n      const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;\n      const duration = actualEndTime - Math.max(startTime, currentStartTime);\n      if (duration < 0) {\n        console.error('Negative event duration');\n      }\n      processEvent(e, duration);\n    }\n\n    function onInstantEvent(e: Types.Events.Event): void {\n      ++depth;\n      if (matchedDepth === path.length && depth <= path.length + 2) {\n        processEvent(e, 0);\n      }\n      --depth;\n    }\n\n    /**\n     * Creates a child node.\n     */\n    function processEvent(e: Types.Events.Event, duration: number): void {\n      if (depth === path.length + 2) {\n        if (!currentDirectChild) {\n          return;\n        }\n        currentDirectChild.setHasChildren(true);\n        currentDirectChild.selfTime -= duration;\n        return;\n      }\n      let id;\n      let groupId = '';\n      if (!eventIdCallback) {\n        id = Symbol('uniqueId');\n      } else {\n        id = eventIdCallback(e);\n        groupId = eventGroupIdCallback ? eventGroupIdCallback(e) : '';\n        if (groupId) {\n          id += '/' + groupId;\n        }\n      }\n      let node = children.get(id);\n      if (!node) {\n        node = new TopDownNode(id, e, self);\n        node.groupId = groupId;\n        children.set(id, node);\n      }\n      node.selfTime += duration;\n      node.totalTime += duration;\n      currentDirectChild = node;\n    }\n\n    /**\n     * Checks if the path of ancestors of an event matches the path of\n     * ancestors of the current node. In other words, checks if an event\n     * is a child of this node. As the check is done, the partial result\n     * is cached on `matchedDepth`, for future checks.\n     */\n    function matchPath(e: Types.Events.Event): boolean {\n      const {endTime} = Helpers.Timing.eventTimingsMilliSeconds(e);\n      if (matchedDepth === path.length) {\n        return true;\n      }\n      if (matchedDepth !== depth - 1) {\n        return false;\n      }\n      if (!endTime) {\n        return false;\n      }\n      if (!eventIdCallback) {\n        if (e === path[matchedDepth].event) {\n          ++matchedDepth;\n        }\n        return false;\n      }\n      let id = eventIdCallback(e);\n      const groupId = eventGroupIdCallback ? eventGroupIdCallback(e) : '';\n      if (groupId) {\n        id += '/' + groupId;\n      }\n      if (id === path[matchedDepth].id) {\n        ++matchedDepth;\n      }\n      return false;\n    }\n\n    function onEndEvent(): void {\n      --depth;\n      if (matchedDepth > depth) {\n        matchedDepth = depth;\n      }\n    }\n\n    this.childrenInternal = children;\n    return children;\n  }\n\n  getRoot(): TopDownRootNode|null {\n    return this.root;\n  }\n}\n\nexport class TopDownRootNode extends TopDownNode {\n  readonly filter: (e: Types.Events.Event) => boolean;\n  /** This is all events passed in to create the tree, and it's very likely that it included events outside of the passed startTime/endTime as that filtering is done in `Helpers.Trace.forEachEvent` */\n  readonly events: Types.Events.Event[];\n  readonly startTime: Types.Timing.MilliSeconds;\n  readonly endTime: Types.Timing.MilliSeconds;\n  eventGroupIdCallback: ((arg0: Types.Events.Event) => string)|null|undefined;\n  /** Default behavior is to aggregate similar trace events into one Node based on generateEventID(), eventGroupIdCallback(), etc. Set true to keep nodes 1:1 with events. */\n  readonly doNotAggregate: boolean|undefined;\n  readonly includeInstantEvents?: boolean;\n  override totalTime: number;\n  override selfTime: number;\n\n  constructor(\n      events: Types.Events.Event[], filters: TraceFilter[], startTime: Types.Timing.MilliSeconds,\n      endTime: Types.Timing.MilliSeconds, doNotAggregate?: boolean,\n      eventGroupIdCallback?: ((arg0: Types.Events.Event) => string)|null, includeInstantEvents?: boolean) {\n    super('', null, null);\n    this.root = this;\n    this.events = events;\n    this.filter = (e: Types.Events.Event): boolean => filters.every(f => f.accept(e));\n    this.startTime = startTime;\n    this.endTime = endTime;\n    this.eventGroupIdCallback = eventGroupIdCallback;\n    this.doNotAggregate = doNotAggregate;\n    this.includeInstantEvents = includeInstantEvents;\n\n    this.totalTime = endTime - startTime;\n    this.selfTime = this.totalTime;\n  }\n\n  override children(): ChildrenCache {\n    return this.childrenInternal || this.grouppedTopNodes();\n  }\n\n  private grouppedTopNodes(): ChildrenCache {\n    const flatNodes = super.children();\n    for (const node of flatNodes.values()) {\n      this.selfTime -= node.totalTime;\n    }\n    if (!this.eventGroupIdCallback) {\n      return flatNodes;\n    }\n    const groupNodes = new Map<string, GroupNode>();\n    for (const node of flatNodes.values()) {\n      if (!node.event) {\n        continue;\n      }\n      const groupId = this.eventGroupIdCallback(node.event);\n      let groupNode = groupNodes.get(groupId);\n      if (!groupNode) {\n        groupNode = new GroupNode(groupId, this, node.event);\n        groupNodes.set(groupId, groupNode);\n      }\n      groupNode.addChild(node as BottomUpNode, node.selfTime, node.totalTime);\n    }\n    this.childrenInternal = groupNodes;\n    return groupNodes;\n  }\n\n  getEventGroupIdCallback(): ((arg0: Types.Events.Event) => string)|null|undefined {\n    return this.eventGroupIdCallback;\n  }\n}\n\nexport class BottomUpRootNode extends Node {\n  private childrenInternal: ChildrenCache|null;\n  readonly events: Types.Events.Event[];\n  private textFilter: TraceFilter;\n  readonly filter: (e: Types.Events.Event) => boolean;\n  readonly startTime: Types.Timing.MilliSeconds;\n  readonly endTime: Types.Timing.MilliSeconds;\n  private eventGroupIdCallback: ((arg0: Types.Events.Event) => string)|null;\n  override totalTime: number;\n\n  constructor(\n      events: Types.Events.Event[], textFilter: TraceFilter, filters: TraceFilter[],\n      startTime: Types.Timing.MilliSeconds, endTime: Types.Timing.MilliSeconds,\n      eventGroupIdCallback: ((arg0: Types.Events.Event) => string)|null) {\n    super('', null);\n    this.childrenInternal = null;\n    this.events = events;\n    this.textFilter = textFilter;\n    this.filter = (e: Types.Events.Event): boolean => filters.every(f => f.accept(e));\n    this.startTime = startTime;\n    this.endTime = endTime;\n    this.eventGroupIdCallback = eventGroupIdCallback;\n    this.totalTime = endTime - startTime;\n  }\n\n  override hasChildren(): boolean {\n    return true;\n  }\n\n  filterChildren(children: ChildrenCache): ChildrenCache {\n    for (const [id, child] of children) {\n      // to provide better context to user only filter first (top) level.\n      if (child.event && child.depth <= 1 && !this.textFilter.accept(child.event)) {\n        children.delete((id as string | symbol));\n      }\n    }\n    return children;\n  }\n\n  override children(): ChildrenCache {\n    if (!this.childrenInternal) {\n      this.childrenInternal = this.filterChildren(this.grouppedTopNodes());\n    }\n    return this.childrenInternal;\n  }\n\n  private ungrouppedTopNodes(): ChildrenCache {\n    const root = this;\n    const startTime = this.startTime;\n    const endTime = this.endTime;\n    const nodeById = new Map<string, Node>();\n    const selfTimeStack: number[] = [endTime - startTime];\n    const firstNodeStack: boolean[] = [];\n    const totalTimeById = new Map<string, number>();\n    Helpers.Trace.forEachEvent(\n        this.events,\n        {\n          onStartEvent,\n          onEndEvent,\n          startTime: Helpers.Timing.millisecondsToMicroseconds(this.startTime),\n          endTime: Helpers.Timing.millisecondsToMicroseconds(this.endTime),\n          eventFilter: this.filter,\n          ignoreAsyncEvents: false,\n        },\n    );\n\n    function onStartEvent(e: Types.Events.Event): void {\n      const {startTime: currentStartTime, endTime: currentEndTime} = Helpers.Timing.eventTimingsMilliSeconds(e);\n\n      const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;\n      const duration = actualEndTime - Math.max(currentStartTime, startTime);\n      selfTimeStack[selfTimeStack.length - 1] -= duration;\n      selfTimeStack.push(duration);\n      const id = generateEventID(e);\n      const noNodeOnStack = !totalTimeById.has(id);\n      if (noNodeOnStack) {\n        totalTimeById.set(id, duration);\n      }\n      firstNodeStack.push(noNodeOnStack);\n    }\n\n    function onEndEvent(event: Types.Events.Event): void {\n      const id = generateEventID(event);\n      let node = nodeById.get(id);\n      if (!node) {\n        node = new BottomUpNode(root, id, event, false, root);\n        nodeById.set(id, node);\n      }\n      node.selfTime += selfTimeStack.pop() || 0;\n      if (firstNodeStack.pop()) {\n        node.totalTime += totalTimeById.get(id) || 0;\n        totalTimeById.delete(id);\n      }\n      if (firstNodeStack.length) {\n        node.setHasChildren(true);\n      }\n    }\n\n    this.selfTime = selfTimeStack.pop() || 0;\n    for (const pair of nodeById) {\n      if (pair[1].selfTime <= 0) {\n        nodeById.delete((pair[0] as string));\n      }\n    }\n    return nodeById;\n  }\n\n  private grouppedTopNodes(): ChildrenCache {\n    const flatNodes = this.ungrouppedTopNodes();\n    if (!this.eventGroupIdCallback) {\n      return flatNodes;\n    }\n    const groupNodes = new Map<string, GroupNode>();\n    for (const node of flatNodes.values()) {\n      if (!node.event) {\n        continue;\n      }\n      const groupId = this.eventGroupIdCallback(node.event);\n      let groupNode = groupNodes.get(groupId);\n      if (!groupNode) {\n        groupNode = new GroupNode(groupId, this, node.event);\n        groupNodes.set(groupId, groupNode);\n      }\n      groupNode.addChild(node as BottomUpNode, node.selfTime, node.selfTime);\n    }\n    return groupNodes;\n  }\n}\n\nexport class GroupNode extends Node {\n  private readonly childrenInternal: ChildrenCache;\n  override isGroupNodeInternal: boolean;\n\n  constructor(id: string, parent: BottomUpRootNode|TopDownRootNode, event: Types.Events.Event) {\n    super(id, event);\n    this.childrenInternal = new Map();\n    this.parent = parent;\n    this.isGroupNodeInternal = true;\n  }\n\n  addChild(child: BottomUpNode, selfTime: number, totalTime: number): void {\n    this.childrenInternal.set(child.id, child);\n    this.selfTime += selfTime;\n    this.totalTime += totalTime;\n    child.parent = this;\n  }\n\n  override hasChildren(): boolean {\n    return true;\n  }\n\n  override children(): ChildrenCache {\n    return this.childrenInternal;\n  }\n}\n\nexport class BottomUpNode extends Node {\n  override parent: Node;\n  private root: BottomUpRootNode;\n  override depth: number;\n  private cachedChildren: ChildrenCache|null;\n  private hasChildrenInternal: boolean;\n\n  constructor(root: BottomUpRootNode, id: string, event: Types.Events.Event, hasChildren: boolean, parent: Node) {\n    super(id, event);\n    this.parent = parent;\n    this.root = root;\n    this.depth = (parent.depth || 0) + 1;\n    this.cachedChildren = null;\n    this.hasChildrenInternal = hasChildren;\n  }\n\n  override hasChildren(): boolean {\n    return this.hasChildrenInternal;\n  }\n\n  override setHasChildren(value: boolean): void {\n    this.hasChildrenInternal = value;\n  }\n\n  override children(): ChildrenCache {\n    if (this.cachedChildren) {\n      return this.cachedChildren;\n    }\n    const selfTimeStack: number[] = [0];\n    const eventIdStack: string[] = [];\n    const eventStack: Types.Events.Event[] = [];\n    const nodeById = new Map<string, BottomUpNode>();\n    const startTime = this.root.startTime;\n    const endTime = this.root.endTime;\n    let lastTimeMarker: number = startTime;\n    const self = this;\n    Helpers.Trace.forEachEvent(\n        this.root.events,\n        {\n          onStartEvent,\n          onEndEvent,\n          startTime: Helpers.Timing.millisecondsToMicroseconds(startTime),\n          endTime: Helpers.Timing.millisecondsToMicroseconds(endTime),\n          eventFilter: this.root.filter,\n          ignoreAsyncEvents: false,\n        },\n    );\n    function onStartEvent(e: Types.Events.Event): void {\n      const {startTime: currentStartTime, endTime: currentEndTime} = Helpers.Timing.eventTimingsMilliSeconds(e);\n      const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;\n      const duration = actualEndTime - Math.max(currentStartTime, startTime);\n      if (duration < 0) {\n        console.assert(false, 'Negative duration of an event');\n      }\n      selfTimeStack[selfTimeStack.length - 1] -= duration;\n      selfTimeStack.push(duration);\n      const id = generateEventID(e);\n      eventIdStack.push(id);\n      eventStack.push(e);\n    }\n\n    function onEndEvent(e: Types.Events.Event): void {\n      const {startTime: currentStartTime, endTime: currentEndTime} = Helpers.Timing.eventTimingsMilliSeconds(e);\n      const selfTime = selfTimeStack.pop();\n      const id = eventIdStack.pop();\n      eventStack.pop();\n      let node;\n      for (node = self; node.depth > 1; node = node.parent) {\n        if (node.id !== eventIdStack[eventIdStack.length + 1 - node.depth]) {\n          return;\n        }\n      }\n      if (node.id !== id || eventIdStack.length < self.depth) {\n        return;\n      }\n      const childId = eventIdStack[eventIdStack.length - self.depth];\n      node = nodeById.get(childId);\n      if (!node) {\n        const event = eventStack[eventStack.length - self.depth];\n        const hasChildren = eventStack.length > self.depth;\n        node = new BottomUpNode(self.root, childId, event, hasChildren, self);\n        nodeById.set(childId, node);\n      }\n      const actualEndTime = currentEndTime !== undefined ? Math.min(currentEndTime, endTime) : endTime;\n      const totalTime = actualEndTime - Math.max(currentStartTime, lastTimeMarker);\n      node.selfTime += selfTime || 0;\n      node.totalTime += totalTime;\n      lastTimeMarker = actualEndTime;\n    }\n\n    this.cachedChildren = this.root.filterChildren(nodeById);\n    return this.cachedChildren;\n  }\n\n  override searchTree(matchFunction: (arg0: Types.Events.Event) => boolean, results?: Node[]): Node[] {\n    results = results || [];\n    if (this.event && matchFunction(this.event)) {\n      results.push(this);\n    }\n    return results;\n  }\n}\n\nexport function eventStackFrame(event: Types.Events.Event): Protocol.Runtime.CallFrame|null {\n  if (Types.Events.isProfileCall(event)) {\n    return event.callFrame;\n  }\n  const topFrame = event.args?.data?.stackTrace?.[0];\n  if (!topFrame) {\n    return null;\n  }\n  return {...topFrame, scriptId: String(topFrame.scriptId) as Protocol.Runtime.ScriptId};\n}\n\nexport function generateEventID(event: Types.Events.Event): string {\n  if (Types.Events.isProfileCall(event)) {\n    const name = TimelineJSProfileProcessor.isNativeRuntimeFrame(event.callFrame) ?\n        TimelineJSProfileProcessor.nativeGroup(event.callFrame.functionName) :\n        event.callFrame.functionName;\n    const location = event.callFrame.scriptId || event.callFrame.url || '';\n    return `f:${name}@${location}`;\n  }\n\n  if (Types.Events.isTimeStamp(event)) {\n    return `${event.name}:${event.args.data.message}`;\n  }\n\n  return event.name;\n}\n\nexport type ChildrenCache = Map<string|symbol, Node>;\n"]}

package/models/trace/extras/extras-tsconfig.json

@@ -34,6 +34,9 @@
     "../../../../../../../front_end/models/trace/extras/MainThreadActivity.ts",
     "../../../../../../../front_end/models/trace/extras/Metadata.ts",
     "../../../../../../../front_end/models/trace/extras/ThirdParties.ts",
+    "../../../../../../../front_end/models/trace/extras/TimelineJSProfile.ts",
+    "../../../../../../../front_end/models/trace/extras/TraceFilter.ts",
+    "../../../../../../../front_end/models/trace/extras/TraceTree.ts",
     "../../../../../../../front_end/models/trace/extras/URLForEntry.ts",
     "../../../../../../../front_end/legacy/legacy-defs.d.ts",
     "../../../../../../../front_end/global_typings/global_defs.d.ts",

package/models/trace/extras/extras.js.map

@@ -1 +1 @@
-{"version":3,"file":"extras.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/extras.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAC;AAC9C,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,kBAAkB,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAC;AAClD,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC","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.\n\nexport * as FetchNodes from './FetchNodes.js';\nexport * as FilmStrip from './FilmStrip.js';\nexport * as MainThreadActivity from './MainThreadActivity.js';\nexport * as Metadata from './Metadata.js';\nexport * as ThirdParties from './ThirdParties.js';\nexport * as URLForEntry from './URLForEntry.js';\n"]}
+{"version":3,"file":"extras.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/extras/extras.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAC;AAC9C,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,kBAAkB,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,QAAQ,MAAM,eAAe,CAAC;AAC1C,OAAO,KAAK,YAAY,MAAM,mBAAmB,CAAC;AAClD,OAAO,KAAK,iBAAiB,MAAM,wBAAwB,CAAC;AAC5D,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC;AAChD,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAC;AAC5C,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAC","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.\n\nexport * as FetchNodes from './FetchNodes.js';\nexport * as FilmStrip from './FilmStrip.js';\nexport * as MainThreadActivity from './MainThreadActivity.js';\nexport * as Metadata from './Metadata.js';\nexport * as ThirdParties from './ThirdParties.js';\nexport * as TimelineJSProfile from './TimelineJSProfile.js';\nexport * as TraceFilter from './TraceFilter.js';\nexport * as TraceTree from './TraceTree.js';\nexport * as URLForEntry from './URLForEntry.js';\n"]}

package/models/trace/handlers/AnimationHandler.js

@@ -5,7 +5,6 @@ import * as Helpers from '../helpers/helpers.js';
 import * as Types from '../types/types.js';
 const animations = [];
 const animationsSyntheticEvents = [];
-let handlerState = 1 /* HandlerState.UNINITIALIZED */;
 export function reset() {
     animations.length = 0;
     animationsSyntheticEvents.length = 0;
@@ -19,12 +18,8 @@ export function handleEvent(event) {
 export async function finalize() {
     const syntheticEvents = Helpers.Trace.createMatchedSortedSyntheticEvents(animations);
     animationsSyntheticEvents.push(...syntheticEvents);
-    handlerState = 3 /* HandlerState.FINALIZED */;
 }
 export function data() {
-    if (handlerState !== 3 /* HandlerState.FINALIZED */) {
-        throw new Error('Animation handler is not finalized');
-    }
     return {
         animations: animationsSyntheticEvents,
     };

package/models/trace/handlers/AnimationHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"AnimationHandler.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/handlers/AnimationHandler.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,OAAO,MAAM,uBAAuB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAI3C,MAAM,UAAU,GAA6B,EAAE,CAAC;AAChD,MAAM,yBAAyB,GAA0C,EAAE,CAAC;AAK5E,IAAI,YAAY,qCAA6B,CAAC;AAE9C,MAAM,UAAU,KAAK;IACnB,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IACtB,yBAAyB,CAAC,MAAM,GAAG,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAyB;IACnD,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACpC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO;IACT,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,QAAQ;IAC5B,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,CAAC,kCAAkC,CAAC,UAAU,CAAC,CAAC;IACrF,yBAAyB,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;IACnD,YAAY,iCAAyB,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,IAAI;IAClB,IAAI,YAAY,mCAA2B,EAAE,CAAC;QAC5C,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;IACxD,CAAC;IAED,OAAO;QACL,UAAU,EAAE,yBAAyB;KACtC,CAAC;AACJ,CAAC","sourcesContent":["// Copyright 2022 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.\n\nimport * as Helpers from '../helpers/helpers.js';\nimport * as Types from '../types/types.js';\n\nimport {HandlerState} from './types.js';\n\nconst animations: Types.Events.Animation[] = [];\nconst animationsSyntheticEvents: Types.Events.SyntheticAnimationPair[] = [];\n\nexport interface AnimationData {\n  animations: readonly Types.Events.SyntheticAnimationPair[];\n}\nlet handlerState = HandlerState.UNINITIALIZED;\n\nexport function reset(): void {\n  animations.length = 0;\n  animationsSyntheticEvents.length = 0;\n}\n\nexport function handleEvent(event: Types.Events.Event): void {\n  if (Types.Events.isAnimation(event)) {\n    animations.push(event);\n    return;\n  }\n}\n\nexport async function finalize(): Promise<void> {\n  const syntheticEvents = Helpers.Trace.createMatchedSortedSyntheticEvents(animations);\n  animationsSyntheticEvents.push(...syntheticEvents);\n  handlerState = HandlerState.FINALIZED;\n}\n\nexport function data(): AnimationData {\n  if (handlerState !== HandlerState.FINALIZED) {\n    throw new Error('Animation handler is not finalized');\n  }\n\n  return {\n    animations: animationsSyntheticEvents,\n  };\n}\n"]}
+{"version":3,"file":"AnimationHandler.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/handlers/AnimationHandler.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,KAAK,OAAO,MAAM,uBAAuB,CAAC;AACjD,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAE3C,MAAM,UAAU,GAA6B,EAAE,CAAC;AAChD,MAAM,yBAAyB,GAA0C,EAAE,CAAC;AAM5E,MAAM,UAAU,KAAK;IACnB,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;IACtB,yBAAyB,CAAC,MAAM,GAAG,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAyB;IACnD,IAAI,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACpC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO;IACT,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,QAAQ;IAC5B,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,CAAC,kCAAkC,CAAC,UAAU,CAAC,CAAC;IACrF,yBAAyB,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,UAAU,IAAI;IAClB,OAAO;QACL,UAAU,EAAE,yBAAyB;KACtC,CAAC;AACJ,CAAC","sourcesContent":["// Copyright 2022 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.\n\nimport * as Helpers from '../helpers/helpers.js';\nimport * as Types from '../types/types.js';\n\nconst animations: Types.Events.Animation[] = [];\nconst animationsSyntheticEvents: Types.Events.SyntheticAnimationPair[] = [];\n\nexport interface AnimationData {\n  animations: readonly Types.Events.SyntheticAnimationPair[];\n}\n\nexport function reset(): void {\n  animations.length = 0;\n  animationsSyntheticEvents.length = 0;\n}\n\nexport function handleEvent(event: Types.Events.Event): void {\n  if (Types.Events.isAnimation(event)) {\n    animations.push(event);\n    return;\n  }\n}\n\nexport async function finalize(): Promise<void> {\n  const syntheticEvents = Helpers.Trace.createMatchedSortedSyntheticEvents(animations);\n  animationsSyntheticEvents.push(...syntheticEvents);\n}\n\nexport function data(): AnimationData {\n  return {\n    animations: animationsSyntheticEvents,\n  };\n}\n"]}

package/models/trace/handlers/ExtensionTraceDataHandler.d.ts

@@ -1,6 +1,6 @@
 import * as Helpers from '../helpers/helpers.js';
 import * as Types from '../types/types.js';
-import { type HandlerName } from './types.js';
+import type { HandlerName } from './types.js';
 export interface ExtensionTraceData {
     extensionTrackData: readonly Types.Extensions.ExtensionTrackData[];
     extensionMarkers: readonly Types.Extensions.SyntheticExtensionMarker[];