@paulirish/trace_engine 0.0.32 → 0.0.33

package/models/trace/lantern/BaseNode.js

@@ -1,268 +0,0 @@
-// Copyright 2024 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.
-/**
- * @fileoverview This class encapsulates logic for handling resources and tasks used to model the
- * execution dependency graph of the page. A node has a unique identifier and can depend on other
- * nodes/be depended on. The construction of the graph maintains some important invariants that are
- * inherent to the model:
- *
- *    1. The graph is a DAG, there are no cycles.
- *    2. There is always a root node upon which all other nodes eventually depend.
- *
- * This allows particular optimizations in this class so that we do no need to check for cycles as
- * these methods are called and we can always start traversal at the root node.
- */
-class BaseNode {
-    static types = {
-        NETWORK: 'network',
-        CPU: 'cpu',
-    };
-    _id;
-    _isMainDocument;
-    _dependents;
-    _dependencies;
-    constructor(id) {
-        this._id = id;
-        this._isMainDocument = false;
-        this._dependents = [];
-        this._dependencies = [];
-    }
-    get id() {
-        return this._id;
-    }
-    get type() {
-        throw new Error('Unimplemented');
-    }
-    /**
-     * In microseconds
-     */
-    get startTime() {
-        throw new Error('Unimplemented');
-    }
-    /**
-     * In microseconds
-     */
-    get endTime() {
-        throw new Error('Unimplemented');
-    }
-    setIsMainDocument(value) {
-        this._isMainDocument = value;
-    }
-    isMainDocument() {
-        return this._isMainDocument;
-    }
-    getDependents() {
-        return this._dependents.slice();
-    }
-    getNumberOfDependents() {
-        return this._dependents.length;
-    }
-    getDependencies() {
-        return this._dependencies.slice();
-    }
-    getNumberOfDependencies() {
-        return this._dependencies.length;
-    }
-    getRootNode() {
-        let rootNode = this;
-        while (rootNode._dependencies.length) {
-            rootNode = rootNode._dependencies[0];
-        }
-        return rootNode;
-    }
-    addDependent(node) {
-        node.addDependency(this);
-    }
-    addDependency(node) {
-        // @ts-expect-error - in checkJs, ts doesn't know that CPUNode and NetworkNode *are* BaseNodes.
-        if (node === this) {
-            throw new Error('Cannot add dependency on itself');
-        }
-        if (this._dependencies.includes(node)) {
-            return;
-        }
-        node._dependents.push(this);
-        this._dependencies.push(node);
-    }
-    removeDependent(node) {
-        node.removeDependency(this);
-    }
-    removeDependency(node) {
-        if (!this._dependencies.includes(node)) {
-            return;
-        }
-        const thisIndex = node._dependents.indexOf(this);
-        node._dependents.splice(thisIndex, 1);
-        this._dependencies.splice(this._dependencies.indexOf(node), 1);
-    }
-    removeAllDependencies() {
-        for (const node of this._dependencies.slice()) {
-            this.removeDependency(node);
-        }
-    }
-    /**
-     * Computes whether the given node is anywhere in the dependency graph of this node.
-     * While this method can prevent cycles, it walks the graph and should be used sparingly.
-     * Nodes are always considered dependent on themselves for the purposes of cycle detection.
-     */
-    isDependentOn(node) {
-        let isDependentOnNode = false;
-        this.traverse(currentNode => {
-            if (isDependentOnNode) {
-                return;
-            }
-            isDependentOnNode = currentNode === node;
-        }, currentNode => {
-            // If we've already found the dependency, don't traverse further.
-            if (isDependentOnNode) {
-                return [];
-            }
-            // Otherwise, traverse the dependencies.
-            return currentNode.getDependencies();
-        });
-        return isDependentOnNode;
-    }
-    /**
-     * Clones the node's information without adding any dependencies/dependents.
-     */
-    cloneWithoutRelationships() {
-        const node = new BaseNode(this.id);
-        node.setIsMainDocument(this._isMainDocument);
-        return node;
-    }
-    /**
-     * Clones the entire graph connected to this node filtered by the optional predicate. If a node is
-     * included by the predicate, all nodes along the paths between the node and the root will be included. If the
-     * node this was called on is not included in the resulting filtered graph, the method will throw.
-     */
-    cloneWithRelationships(predicate) {
-        const rootNode = this.getRootNode();
-        const idsToIncludedClones = new Map();
-        // Walk down dependents.
-        rootNode.traverse(node => {
-            if (idsToIncludedClones.has(node.id)) {
-                return;
-            }
-            if (predicate === undefined) {
-                // No condition for entry, so clone every node.
-                idsToIncludedClones.set(node.id, node.cloneWithoutRelationships());
-                return;
-            }
-            if (predicate(node)) {
-                // Node included, so walk back up dependencies, cloning nodes from here back to the root.
-                node.traverse(node => idsToIncludedClones.set(node.id, node.cloneWithoutRelationships()), 
-                // Dependencies already cloned have already cloned ancestors, so no need to visit again.
-                node => node._dependencies.filter(parent => !idsToIncludedClones.has(parent.id)));
-            }
-        });
-        // Copy dependencies between nodes.
-        rootNode.traverse(originalNode => {
-            const clonedNode = idsToIncludedClones.get(originalNode.id);
-            if (!clonedNode) {
-                return;
-            }
-            for (const dependency of originalNode._dependencies) {
-                const clonedDependency = idsToIncludedClones.get(dependency.id);
-                if (!clonedDependency) {
-                    throw new Error('Dependency somehow not cloned');
-                }
-                clonedNode.addDependency(clonedDependency);
-            }
-        });
-        const clonedThisNode = idsToIncludedClones.get(this.id);
-        if (!clonedThisNode) {
-            throw new Error('Cloned graph missing node');
-        }
-        return clonedThisNode;
-    }
-    /**
-     * Traverses all connected nodes in BFS order, calling `callback` exactly once
-     * on each. `traversalPath` is the shortest (though not necessarily unique)
-     * path from `node` to the root of the iteration.
-     *
-     * The `getNextNodes` function takes a visited node and returns which nodes to
-     * visit next. It defaults to returning the node's dependents.
-     */
-    traverse(callback, getNextNodes) {
-        for (const { node, traversalPath } of this.traverseGenerator(getNextNodes)) {
-            callback(node, traversalPath);
-        }
-    }
-    /**
-     * @see BaseNode.traverse
-     */
-    // clang-format off
-    *traverseGenerator(getNextNodes) {
-        // clang-format on
-        if (!getNextNodes) {
-            getNextNodes = node => node.getDependents();
-        }
-        // @ts-expect-error - only traverses graphs of Node, so force tsc to treat `this` as one
-        const queue = [[this]];
-        const visited = new Set([this.id]);
-        while (queue.length) {
-            // @ts-expect-error - queue has length so it's guaranteed to have an item
-            const traversalPath = queue.shift();
-            const node = traversalPath[0];
-            yield { node, traversalPath };
-            for (const nextNode of getNextNodes(node)) {
-                if (visited.has(nextNode.id)) {
-                    continue;
-                }
-                visited.add(nextNode.id);
-                queue.push([nextNode, ...traversalPath]);
-            }
-        }
-    }
-    /**
-     * Returns whether the given node has a cycle in its dependent graph by performing a DFS.
-     */
-    static hasCycle(node, direction = 'both') {
-        // Checking 'both' is the default entrypoint to recursively check both directions
-        if (direction === 'both') {
-            return BaseNode.hasCycle(node, 'dependents') || BaseNode.hasCycle(node, 'dependencies');
-        }
-        const visited = new Set();
-        const currentPath = [];
-        const toVisit = [node];
-        const depthAdded = new Map([[node, 0]]);
-        // Keep going while we have nodes to visit in the stack
-        while (toVisit.length) {
-            // Get the last node in the stack (DFS uses stack, not queue)
-            // @ts-expect-error - toVisit has length so it's guaranteed to have an item
-            const currentNode = toVisit.pop();
-            // We've hit a cycle if the node we're visiting is in our current dependency path
-            if (currentPath.includes(currentNode)) {
-                return true;
-            }
-            // If we've already visited the node, no need to revisit it
-            if (visited.has(currentNode)) {
-                continue;
-            }
-            // Since we're visiting this node, clear out any nodes in our path that we had to backtrack
-            // @ts-expect-error
-            while (currentPath.length > depthAdded.get(currentNode)) {
-                currentPath.pop();
-            }
-            // Update our data structures to reflect that we're adding this node to our path
-            visited.add(currentNode);
-            currentPath.push(currentNode);
-            // Add all of its dependents to our toVisit stack
-            const nodesToExplore = direction === 'dependents' ? currentNode._dependents : currentNode._dependencies;
-            for (const nextNode of nodesToExplore) {
-                if (toVisit.includes(nextNode)) {
-                    continue;
-                }
-                toVisit.push(nextNode);
-                depthAdded.set(nextNode, currentPath.length);
-            }
-        }
-        return false;
-    }
-    canDependOn(node) {
-        return node.startTime <= this.startTime;
-    }
-}
-export { BaseNode };
-//# sourceMappingURL=BaseNode.js.map

package/models/trace/lantern/BaseNode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"BaseNode.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/lantern/BaseNode.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAY7B;;;;;;;;;;;GAWG;AAEH,MAAM,QAAQ;IACZ,MAAM,CAAC,KAAK,GAAG;QACb,OAAO,EAAE,SAAS;QAClB,GAAG,EAAE,KAAK;KACF,CAAC;IAEX,GAAG,CAAS;IACZ,eAAe,CAAU;IACzB,WAAW,CAAS;IACpB,aAAa,CAAS;IAEtB,YAAY,EAAU;QACpB,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;IAC1B,CAAC;IAED,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC;IAClB,CAAC;IAED,IAAI,IAAI;QACN,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAI,SAAS;QACX,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,IAAI,OAAO;QACT,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;IAED,iBAAiB,CAAC,KAAc;QAC9B,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;IAC/B,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;IAED,qBAAqB;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;IACjC,CAAC;IAED,eAAe;QACb,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;IACpC,CAAC;IAED,uBAAuB;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IACnC,CAAC;IAED,WAAW;QACT,IAAI,QAAQ,GAAG,IAAwB,CAAC;QACxC,OAAO,QAAQ,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;YACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,YAAY,CAAC,IAAU;QACrB,IAAI,CAAC,aAAa,CAAC,IAAwB,CAAC,CAAC;IAC/C,CAAC;IAED,aAAa,CAAC,IAAU;QACtB,+FAA+F;QAC/F,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACrD,CAAC;QAED,IAAI,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAwB,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,eAAe,CAAC,IAAU;QACxB,IAAI,CAAC,gBAAgB,CAAC,IAAwB,CAAC,CAAC;IAClD,CAAC;IAED,gBAAgB,CAAC,IAAU;QACzB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAwB,CAAC,CAAC;QACrE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,qBAAqB;QACnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,aAAa,CAAC,IAAiB;QAC7B,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,QAAQ,CACT,WAAW,CAAC,EAAE;YACZ,IAAI,iBAAiB,EAAE,CAAC;gBACtB,OAAO;YACT,CAAC;YACD,iBAAiB,GAAG,WAAW,KAAK,IAAI,CAAC;QAC3C,CAAC,EACD,WAAW,CAAC,EAAE;YACZ,iEAAiE;YACjE,IAAI,iBAAiB,EAAE,CAAC;gBACtB,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,wCAAwC;YACxC,OAAO,WAAW,CAAC,eAAe,EAAE,CAAC;QACvC,CAAC,CAAC,CAAC;QAEP,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,yBAAyB;QACvB,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAY,CAAC;QAC9C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,sBAAsB,CAAC,SAAmC;QACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAEpC,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAgB,CAAC;QAEpD,wBAAwB;QACxB,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;YACvB,IAAI,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACrC,OAAO;YACT,CAAC;YAED,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,+CAA+C;gBAC/C,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,yBAAyB,EAAE,CAAC,CAAC;gBACnE,OAAO;YACT,CAAC;YAED,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,yFAAyF;gBACzF,IAAI,CAAC,QAAQ,CACT,IAAI,CAAC,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,yBAAyB,EAAE,CAAC;gBAC1E,wFAAwF;gBACxF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CACnF,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,mCAAmC;QACnC,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE;YAC/B,MAAM,UAAU,GAAG,mBAAmB,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;YAC5D,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,OAAO;YACT,CAAC;YAED,KAAK,MAAM,UAAU,IAAI,YAAY,CAAC,aAAa,EAAE,CAAC;gBACpD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAChE,IAAI,CAAC,gBAAgB,EAAE,CAAC;oBACtB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;gBACnD,CAAC;gBACD,UAAU,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,cAAc,GAAG,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,cAAc,CAAC;IACxB,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAC,QAA2D,EAAE,YAA2C;QAE/G,KAAK,MAAM,EAAC,IAAI,EAAE,aAAa,EAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAAE,CAAC;YACzE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,mBAAmB;IACnB,CAAC,iBAAiB,CAAC,YAAqC;QAEtD,kBAAkB;QAClB,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;QAC9C,CAAC;QAED,wFAAwF;QACxF,MAAM,KAAK,GAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,yEAAyE;YACzE,MAAM,aAAa,GAAW,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAC,IAAI,EAAE,aAAa,EAAC,CAAC;YAE5B,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC1C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC7B,SAAS;gBACX,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAEzB,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,IAAU,EAAE,YAAgD,MAAM;QAChF,iFAAiF;QACjF,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACzB,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QAC1F,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,MAAM,WAAW,GAAe,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QACvB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAExC,uDAAuD;QACvD,OAAO,OAAO,CAAC,MAAM,EAAE,CAAC;YACtB,6DAA6D;YAC7D,2EAA2E;YAC3E,MAAM,WAAW,GAAa,OAAO,CAAC,GAAG,EAAE,CAAC;YAE5C,iFAAiF;YACjF,IAAI,WAAW,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;gBACtC,OAAO,IAAI,CAAC;YACd,CAAC;YACD,2DAA2D;YAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC7B,SAAS;YACX,CAAC;YAED,2FAA2F;YAC3F,mBAAmB;YACnB,OAAO,WAAW,CAAC,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBACxD,WAAW,CAAC,GAAG,EAAE,CAAC;YACpB,CAAC;YAED,gFAAgF;YAChF,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YACzB,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAE9B,iDAAiD;YACjD,MAAM,cAAc,GAAG,SAAS,KAAK,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,aAAa,CAAC;YACxG,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;gBACtC,IAAI,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC/B,SAAS;gBACX,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvB,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,WAAW,CAAC,IAAU;QACpB,OAAO,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC;IAC1C,CAAC;;AAGH,OAAO,EAAC,QAAQ,EAAC,CAAC","sourcesContent":["// Copyright 2024 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 CPUNode} from './CPUNode.js';\nimport {type NetworkNode} from './NetworkNode.js';\nimport type * as Lantern from './types/lantern.js';\n\n/**\n * A union of all types derived from BaseNode, allowing type check discrimination\n * based on `node.type`. If a new node type is created, it should be added here.\n */\nexport type Node<T = Lantern.AnyNetworkObject> = CPUNode<T>|NetworkNode<T>;\n\n/**\n * @fileoverview This class encapsulates logic for handling resources and tasks used to model the\n * execution dependency graph of the page. A node has a unique identifier and can depend on other\n * nodes/be depended on. The construction of the graph maintains some important invariants that are\n * inherent to the model:\n *\n *    1. The graph is a DAG, there are no cycles.\n *    2. There is always a root node upon which all other nodes eventually depend.\n *\n * This allows particular optimizations in this class so that we do no need to check for cycles as\n * these methods are called and we can always start traversal at the root node.\n */\n\nclass BaseNode<T = Lantern.AnyNetworkObject> {\n  static types = {\n    NETWORK: 'network',\n    CPU: 'cpu',\n  } as const;\n\n  _id: string;\n  _isMainDocument: boolean;\n  _dependents: Node[];\n  _dependencies: Node[];\n\n  constructor(id: string) {\n    this._id = id;\n    this._isMainDocument = false;\n    this._dependents = [];\n    this._dependencies = [];\n  }\n\n  get id(): string {\n    return this._id;\n  }\n\n  get type(): 'network'|'cpu' {\n    throw new Error('Unimplemented');\n  }\n\n  /**\n   * In microseconds\n   */\n  get startTime(): number {\n    throw new Error('Unimplemented');\n  }\n\n  /**\n   * In microseconds\n   */\n  get endTime(): number {\n    throw new Error('Unimplemented');\n  }\n\n  setIsMainDocument(value: boolean): void {\n    this._isMainDocument = value;\n  }\n\n  isMainDocument(): boolean {\n    return this._isMainDocument;\n  }\n\n  getDependents(): Node[] {\n    return this._dependents.slice();\n  }\n\n  getNumberOfDependents(): number {\n    return this._dependents.length;\n  }\n\n  getDependencies(): Node[] {\n    return this._dependencies.slice();\n  }\n\n  getNumberOfDependencies(): number {\n    return this._dependencies.length;\n  }\n\n  getRootNode(): Node<T> {\n    let rootNode = this as BaseNode as Node;\n    while (rootNode._dependencies.length) {\n      rootNode = rootNode._dependencies[0];\n    }\n\n    return rootNode;\n  }\n\n  addDependent(node: Node): void {\n    node.addDependency(this as BaseNode as Node);\n  }\n\n  addDependency(node: Node): void {\n    // @ts-expect-error - in checkJs, ts doesn't know that CPUNode and NetworkNode *are* BaseNodes.\n    if (node === this) {\n      throw new Error('Cannot add dependency on itself');\n    }\n\n    if (this._dependencies.includes(node)) {\n      return;\n    }\n\n    node._dependents.push(this as BaseNode as Node);\n    this._dependencies.push(node);\n  }\n\n  removeDependent(node: Node): void {\n    node.removeDependency(this as BaseNode as Node);\n  }\n\n  removeDependency(node: Node): void {\n    if (!this._dependencies.includes(node)) {\n      return;\n    }\n\n    const thisIndex = node._dependents.indexOf(this as BaseNode as Node);\n    node._dependents.splice(thisIndex, 1);\n    this._dependencies.splice(this._dependencies.indexOf(node), 1);\n  }\n\n  removeAllDependencies(): void {\n    for (const node of this._dependencies.slice()) {\n      this.removeDependency(node);\n    }\n  }\n\n  /**\n   * Computes whether the given node is anywhere in the dependency graph of this node.\n   * While this method can prevent cycles, it walks the graph and should be used sparingly.\n   * Nodes are always considered dependent on themselves for the purposes of cycle detection.\n   */\n  isDependentOn(node: BaseNode<T>): boolean {\n    let isDependentOnNode = false;\n    this.traverse(\n        currentNode => {\n          if (isDependentOnNode) {\n            return;\n          }\n          isDependentOnNode = currentNode === node;\n        },\n        currentNode => {\n          // If we've already found the dependency, don't traverse further.\n          if (isDependentOnNode) {\n            return [];\n          }\n          // Otherwise, traverse the dependencies.\n          return currentNode.getDependencies();\n        });\n\n    return isDependentOnNode;\n  }\n\n  /**\n   * Clones the node's information without adding any dependencies/dependents.\n   */\n  cloneWithoutRelationships(): Node<T> {\n    const node = new BaseNode(this.id) as Node<T>;\n    node.setIsMainDocument(this._isMainDocument);\n    return node;\n  }\n\n  /**\n   * Clones the entire graph connected to this node filtered by the optional predicate. If a node is\n   * included by the predicate, all nodes along the paths between the node and the root will be included. If the\n   * node this was called on is not included in the resulting filtered graph, the method will throw.\n   */\n  cloneWithRelationships(predicate?: (arg0: Node) => boolean): Node {\n    const rootNode = this.getRootNode();\n\n    const idsToIncludedClones = new Map<string, Node>();\n\n    // Walk down dependents.\n    rootNode.traverse(node => {\n      if (idsToIncludedClones.has(node.id)) {\n        return;\n      }\n\n      if (predicate === undefined) {\n        // No condition for entry, so clone every node.\n        idsToIncludedClones.set(node.id, node.cloneWithoutRelationships());\n        return;\n      }\n\n      if (predicate(node)) {\n        // Node included, so walk back up dependencies, cloning nodes from here back to the root.\n        node.traverse(\n            node => idsToIncludedClones.set(node.id, node.cloneWithoutRelationships()),\n            // Dependencies already cloned have already cloned ancestors, so no need to visit again.\n            node => node._dependencies.filter(parent => !idsToIncludedClones.has(parent.id)),\n        );\n      }\n    });\n\n    // Copy dependencies between nodes.\n    rootNode.traverse(originalNode => {\n      const clonedNode = idsToIncludedClones.get(originalNode.id);\n      if (!clonedNode) {\n        return;\n      }\n\n      for (const dependency of originalNode._dependencies) {\n        const clonedDependency = idsToIncludedClones.get(dependency.id);\n        if (!clonedDependency) {\n          throw new Error('Dependency somehow not cloned');\n        }\n        clonedNode.addDependency(clonedDependency);\n      }\n    });\n\n    const clonedThisNode = idsToIncludedClones.get(this.id);\n    if (!clonedThisNode) {\n      throw new Error('Cloned graph missing node');\n    }\n    return clonedThisNode;\n  }\n\n  /**\n   * Traverses all connected nodes in BFS order, calling `callback` exactly once\n   * on each. `traversalPath` is the shortest (though not necessarily unique)\n   * path from `node` to the root of the iteration.\n   *\n   * The `getNextNodes` function takes a visited node and returns which nodes to\n   * visit next. It defaults to returning the node's dependents.\n   */\n  traverse(callback: (node: Node<T>, traversalPath: Node<T>[]) => void, getNextNodes?: (arg0: Node<T>) => Node<T>[]):\n      void {\n    for (const {node, traversalPath} of this.traverseGenerator(getNextNodes)) {\n      callback(node, traversalPath);\n    }\n  }\n\n  /**\n   * @see BaseNode.traverse\n   */\n  // clang-format off\n  *traverseGenerator(getNextNodes?: (arg0: Node) => Node[]):\n      Generator<{node: Node, traversalPath: Node[]}, void, unknown> {\n    // clang-format on\n    if (!getNextNodes) {\n      getNextNodes = node => node.getDependents();\n    }\n\n    // @ts-expect-error - only traverses graphs of Node, so force tsc to treat `this` as one\n    const queue: Node[][] = [[this]];\n    const visited = new Set([this.id]);\n\n    while (queue.length) {\n      // @ts-expect-error - queue has length so it's guaranteed to have an item\n      const traversalPath: Node[] = queue.shift();\n      const node = traversalPath[0];\n      yield {node, traversalPath};\n\n      for (const nextNode of getNextNodes(node)) {\n        if (visited.has(nextNode.id)) {\n          continue;\n        }\n        visited.add(nextNode.id);\n\n        queue.push([nextNode, ...traversalPath]);\n      }\n    }\n  }\n\n  /**\n   * Returns whether the given node has a cycle in its dependent graph by performing a DFS.\n   */\n  static hasCycle(node: Node, direction: 'dependents'|'dependencies'|'both' = 'both'): boolean {\n    // Checking 'both' is the default entrypoint to recursively check both directions\n    if (direction === 'both') {\n      return BaseNode.hasCycle(node, 'dependents') || BaseNode.hasCycle(node, 'dependencies');\n    }\n\n    const visited = new Set();\n    const currentPath: BaseNode[] = [];\n    const toVisit = [node];\n    const depthAdded = new Map([[node, 0]]);\n\n    // Keep going while we have nodes to visit in the stack\n    while (toVisit.length) {\n      // Get the last node in the stack (DFS uses stack, not queue)\n      // @ts-expect-error - toVisit has length so it's guaranteed to have an item\n      const currentNode: BaseNode = toVisit.pop();\n\n      // We've hit a cycle if the node we're visiting is in our current dependency path\n      if (currentPath.includes(currentNode)) {\n        return true;\n      }\n      // If we've already visited the node, no need to revisit it\n      if (visited.has(currentNode)) {\n        continue;\n      }\n\n      // Since we're visiting this node, clear out any nodes in our path that we had to backtrack\n      // @ts-expect-error\n      while (currentPath.length > depthAdded.get(currentNode)) {\n        currentPath.pop();\n      }\n\n      // Update our data structures to reflect that we're adding this node to our path\n      visited.add(currentNode);\n      currentPath.push(currentNode);\n\n      // Add all of its dependents to our toVisit stack\n      const nodesToExplore = direction === 'dependents' ? currentNode._dependents : currentNode._dependencies;\n      for (const nextNode of nodesToExplore) {\n        if (toVisit.includes(nextNode)) {\n          continue;\n        }\n        toVisit.push(nextNode);\n        depthAdded.set(nextNode, currentPath.length);\n      }\n    }\n\n    return false;\n  }\n\n  canDependOn(node: Node): boolean {\n    return node.startTime <= this.startTime;\n  }\n}\n\nexport {BaseNode};\n"]}

package/models/trace/lantern/CPUNode.d.ts

@@ -1,24 +0,0 @@
-import { BaseNode } from './BaseNode.js';
-import type * as Lantern from './types/lantern.js';
-declare class CPUNode<T = Lantern.AnyNetworkObject> extends BaseNode<T> {
-    _event: Lantern.TraceEvent;
-    _childEvents: Lantern.TraceEvent[];
-    _correctedEndTs: number | undefined;
-    constructor(parentEvent: Lantern.TraceEvent, childEvents?: Lantern.TraceEvent[], correctedEndTs?: number);
-    get type(): 'cpu';
-    get startTime(): number;
-    get endTime(): number;
-    get duration(): number;
-    get event(): Lantern.TraceEvent;
-    get childEvents(): Lantern.TraceEvent[];
-    /**
-     * Returns true if this node contains a Layout task.
-     */
-    didPerformLayout(): boolean;
-    /**
-     * Returns the script URLs that had their EvaluateScript events occur in this task.
-     */
-    getEvaluateScriptURLs(): Set<string>;
-    cloneWithoutRelationships(): CPUNode;
-}
-export { CPUNode };

package/models/trace/lantern/CPUNode.js

@@ -1,64 +0,0 @@
-// Copyright 2024 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 { BaseNode } from './BaseNode.js';
-class CPUNode extends BaseNode {
-    _event;
-    _childEvents;
-    _correctedEndTs;
-    constructor(parentEvent, childEvents = [], correctedEndTs) {
-        const nodeId = `${parentEvent.tid}.${parentEvent.ts}`;
-        super(nodeId);
-        this._event = parentEvent;
-        this._childEvents = childEvents;
-        this._correctedEndTs = correctedEndTs;
-    }
-    get type() {
-        return BaseNode.types.CPU;
-    }
-    get startTime() {
-        return this._event.ts;
-    }
-    get endTime() {
-        if (this._correctedEndTs) {
-            return this._correctedEndTs;
-        }
-        return this._event.ts + this._event.dur;
-    }
-    get duration() {
-        return this.endTime - this.startTime;
-    }
-    get event() {
-        return this._event;
-    }
-    get childEvents() {
-        return this._childEvents;
-    }
-    /**
-     * Returns true if this node contains a Layout task.
-     */
-    didPerformLayout() {
-        return this._childEvents.some(evt => evt.name === 'Layout');
-    }
-    /**
-     * Returns the script URLs that had their EvaluateScript events occur in this task.
-     */
-    getEvaluateScriptURLs() {
-        const urls = new Set();
-        for (const event of this._childEvents) {
-            if (event.name !== 'EvaluateScript') {
-                continue;
-            }
-            if (!event.args.data || !event.args.data.url) {
-                continue;
-            }
-            urls.add(event.args.data.url);
-        }
-        return urls;
-    }
-    cloneWithoutRelationships() {
-        return new CPUNode(this._event, this._childEvents, this._correctedEndTs);
-    }
-}
-export { CPUNode };
-//# sourceMappingURL=CPUNode.js.map

package/models/trace/lantern/CPUNode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CPUNode.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/lantern/CPUNode.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AAGvC,MAAM,OAAsC,SAAQ,QAAW;IAC7D,MAAM,CAAqB;IAC3B,YAAY,CAAuB;IACnC,eAAe,CAAmB;IAElC,YAAY,WAA+B,EAAE,cAAoC,EAAE,EAAE,cAAuB;QAC1G,MAAM,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,IAAI,WAAW,CAAC,EAAE,EAAE,CAAC;QACtD,KAAK,CAAC,MAAM,CAAC,CAAC;QAEd,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC;QAC1B,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;IACxC,CAAC;IAED,IAAa,IAAI;QACf,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC;IAC5B,CAAC;IAED,IAAa,SAAS;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IACxB,CAAC;IAED,IAAa,OAAO;QAClB,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,eAAe,CAAC;QAC9B,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;IAC1C,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;IACvC,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IAC9D,CAAC;IAED;;OAEG;IACH,qBAAqB;QACnB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;gBACpC,SAAS;YACX,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAC7C,SAAS;YACX,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAEQ,yBAAyB;QAChC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,eAAe,CAAC,CAAC;IAC3E,CAAC;CACF;AAED,OAAO,EAAC,OAAO,EAAC,CAAC","sourcesContent":["// Copyright 2024 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 {BaseNode} from './BaseNode.js';\nimport type * as Lantern from './types/lantern.js';\n\nclass CPUNode<T = Lantern.AnyNetworkObject> extends BaseNode<T> {\n  _event: Lantern.TraceEvent;\n  _childEvents: Lantern.TraceEvent[];\n  _correctedEndTs: number|undefined;\n\n  constructor(parentEvent: Lantern.TraceEvent, childEvents: Lantern.TraceEvent[] = [], correctedEndTs?: number) {\n    const nodeId = `${parentEvent.tid}.${parentEvent.ts}`;\n    super(nodeId);\n\n    this._event = parentEvent;\n    this._childEvents = childEvents;\n    this._correctedEndTs = correctedEndTs;\n  }\n\n  override get type(): 'cpu' {\n    return BaseNode.types.CPU;\n  }\n\n  override get startTime(): number {\n    return this._event.ts;\n  }\n\n  override get endTime(): number {\n    if (this._correctedEndTs) {\n      return this._correctedEndTs;\n    }\n    return this._event.ts + this._event.dur;\n  }\n\n  get duration(): number {\n    return this.endTime - this.startTime;\n  }\n\n  get event(): Lantern.TraceEvent {\n    return this._event;\n  }\n\n  get childEvents(): Lantern.TraceEvent[] {\n    return this._childEvents;\n  }\n\n  /**\n   * Returns true if this node contains a Layout task.\n   */\n  didPerformLayout(): boolean {\n    return this._childEvents.some(evt => evt.name === 'Layout');\n  }\n\n  /**\n   * Returns the script URLs that had their EvaluateScript events occur in this task.\n   */\n  getEvaluateScriptURLs(): Set<string> {\n    const urls = new Set<string>();\n    for (const event of this._childEvents) {\n      if (event.name !== 'EvaluateScript') {\n        continue;\n      }\n      if (!event.args.data || !event.args.data.url) {\n        continue;\n      }\n      urls.add(event.args.data.url);\n    }\n\n    return urls;\n  }\n\n  override cloneWithoutRelationships(): CPUNode {\n    return new CPUNode(this._event, this._childEvents, this._correctedEndTs);\n  }\n}\n\nexport {CPUNode};\n"]}

package/models/trace/lantern/LanternError.d.ts

@@ -1,3 +0,0 @@
-declare class LanternError extends Error {
-}
-export { LanternError };

package/models/trace/lantern/LanternError.js

@@ -1,7 +0,0 @@
-// Copyright 2024 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.
-class LanternError extends Error {
-}
-export { LanternError };
-//# sourceMappingURL=LanternError.js.map

package/models/trace/lantern/LanternError.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"LanternError.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/lantern/LanternError.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,MAAM,YAAa,SAAQ,KAAK;CAAG;AAEnC,OAAO,EAAC,YAAY,EAAC,CAAC","sourcesContent":["// Copyright 2024 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\nclass LanternError extends Error {}\n\nexport {LanternError};\n"]}

package/models/trace/lantern/MetricsModule.d.ts

@@ -1,11 +0,0 @@
-import { FirstContentfulPaint } from './metrics/FirstContentfulPaint.js';
-import { Interactive } from './metrics/Interactive.js';
-import { LargestContentfulPaint } from './metrics/LargestContentfulPaint.js';
-import { MaxPotentialFID } from './metrics/MaxPotentialFID.js';
-import { type Extras, Metric } from './metrics/Metric.js';
-import { SpeedIndex } from './metrics/SpeedIndex.js';
-import { TotalBlockingTime } from './metrics/TotalBlockingTime.js';
-import type * as Lantern from './types/lantern.js';
-export type Result<T = Lantern.AnyNetworkObject> = Lantern.Metrics.Result<T>;
-export { FirstContentfulPaint, Interactive, LargestContentfulPaint, MaxPotentialFID, Extras, Metric, SpeedIndex, TotalBlockingTime, };
-export * as TBTUtils from './metrics/TBTUtils.js';

package/models/trace/lantern/MetricsModule.js

@@ -1,14 +0,0 @@
-// Copyright 2024 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.
-// TODO(crbug.com/348449529): refactor to proper devtools module
-import { FirstContentfulPaint } from './metrics/FirstContentfulPaint.js';
-import { Interactive } from './metrics/Interactive.js';
-import { LargestContentfulPaint } from './metrics/LargestContentfulPaint.js';
-import { MaxPotentialFID } from './metrics/MaxPotentialFID.js';
-import { Metric } from './metrics/Metric.js';
-import { SpeedIndex } from './metrics/SpeedIndex.js';
-import { TotalBlockingTime } from './metrics/TotalBlockingTime.js';
-export { FirstContentfulPaint, Interactive, LargestContentfulPaint, MaxPotentialFID, Metric, SpeedIndex, TotalBlockingTime, };
-export * as TBTUtils from './metrics/TBTUtils.js';
-//# sourceMappingURL=MetricsModule.js.map

package/models/trace/lantern/MetricsModule.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"MetricsModule.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/lantern/MetricsModule.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,gEAAgE;AAEhE,OAAO,EAAC,oBAAoB,EAAC,MAAM,mCAAmC,CAAC;AACvE,OAAO,EAAC,WAAW,EAAC,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAC,sBAAsB,EAAC,MAAM,qCAAqC,CAAC;AAC3E,OAAO,EAAC,eAAe,EAAC,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAc,MAAM,EAAC,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAC,UAAU,EAAC,MAAM,yBAAyB,CAAC;AACnD,OAAO,EAAC,iBAAiB,EAAC,MAAM,gCAAgC,CAAC;AAKjE,OAAO,EACL,oBAAoB,EACpB,WAAW,EACX,sBAAsB,EACtB,eAAe,EAEf,MAAM,EACN,UAAU,EACV,iBAAiB,GAClB,CAAC;AAEF,OAAO,KAAK,QAAQ,MAAM,uBAAuB,CAAC","sourcesContent":["// Copyright 2024 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\n// TODO(crbug.com/348449529): refactor to proper devtools module\n\nimport {FirstContentfulPaint} from './metrics/FirstContentfulPaint.js';\nimport {Interactive} from './metrics/Interactive.js';\nimport {LargestContentfulPaint} from './metrics/LargestContentfulPaint.js';\nimport {MaxPotentialFID} from './metrics/MaxPotentialFID.js';\nimport {type Extras, Metric} from './metrics/Metric.js';\nimport {SpeedIndex} from './metrics/SpeedIndex.js';\nimport {TotalBlockingTime} from './metrics/TotalBlockingTime.js';\nimport type * as Lantern from './types/lantern.js';\n\nexport type Result<T = Lantern.AnyNetworkObject> = Lantern.Metrics.Result<T>;\n\nexport {\n  FirstContentfulPaint,\n  Interactive,\n  LargestContentfulPaint,\n  MaxPotentialFID,\n  Extras,\n  Metric,\n  SpeedIndex,\n  TotalBlockingTime,\n};\n\nexport * as TBTUtils from './metrics/TBTUtils.js';\n"]}

package/models/trace/lantern/NetworkNode.d.ts

@@ -1,22 +0,0 @@
-import { BaseNode } from './BaseNode.js';
-import type * as Lantern from './types/lantern.js';
-declare class NetworkNode<T = Lantern.AnyNetworkObject> extends BaseNode<T> {
-    _request: Lantern.NetworkRequest<T>;
-    constructor(networkRequest: Lantern.NetworkRequest<T>);
-    get type(): 'network';
-    get startTime(): number;
-    get endTime(): number;
-    get rawRequest(): Readonly<T>;
-    get request(): Lantern.NetworkRequest<T>;
-    get initiatorType(): string;
-    get fromDiskCache(): boolean;
-    get isNonNetworkProtocol(): boolean;
-    /**
-     * Returns whether this network request can be downloaded without a TCP connection.
-     * During simulation we treat data coming in over a network connection separately from on-device data.
-     */
-    get isConnectionless(): boolean;
-    hasRenderBlockingPriority(): boolean;
-    cloneWithoutRelationships(): NetworkNode<T>;
-}
-export { NetworkNode };

package/models/trace/lantern/NetworkNode.js

@@ -1,83 +0,0 @@
-// Copyright 2024 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 { BaseNode } from './BaseNode.js';
-const NON_NETWORK_SCHEMES = [
-    'blob', // @see https://developer.mozilla.org/en-US/docs/Web/API/URL/createObjectURL
-    'data', // @see https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/Data_URIs
-    'intent', // @see https://developer.chrome.com/docs/multidevice/android/intents/
-    'file', // @see https://en.wikipedia.org/wiki/File_URI_scheme
-    'filesystem', // @see https://developer.mozilla.org/en-US/docs/Web/API/FileSystem
-    'chrome-extension',
-];
-/**
- * Note: the `protocol` field from CDP can be 'h2', 'http', (not 'https'!) or it'll be url's scheme.
- *   https://source.chromium.org/chromium/chromium/src/+/main:content/browser/devtools/protocol/network_handler.cc;l=598-611;drc=56d4a9a9deb30be73adcee8737c73bcb2a5ab64f
- * However, a `new URL(href).protocol` has a colon suffix.
- *   https://url.spec.whatwg.org/#dom-url-protocol
- * A URL's `scheme` is specced as the `protocol` sans-colon, but isn't exposed on a URL object.
- * This method can take all 3 of these string types as a parameter.
- *
- * @param protocol Either a networkRequest's `protocol` per CDP or a `new URL(href).protocol`
- */
-function isNonNetworkProtocol(protocol) {
-    // Strip off any colon
-    const urlScheme = protocol.includes(':') ? protocol.slice(0, protocol.indexOf(':')) : protocol;
-    return NON_NETWORK_SCHEMES.includes(urlScheme);
-}
-class NetworkNode extends BaseNode {
-    _request;
-    constructor(networkRequest) {
-        super(networkRequest.requestId);
-        this._request = networkRequest;
-    }
-    get type() {
-        return BaseNode.types.NETWORK;
-    }
-    get startTime() {
-        return this._request.rendererStartTime * 1000;
-    }
-    get endTime() {
-        return this._request.networkEndTime * 1000;
-    }
-    get rawRequest() {
-        return this._request.rawRequest;
-    }
-    get request() {
-        return this._request;
-    }
-    get initiatorType() {
-        return this._request.initiator && this._request.initiator.type;
-    }
-    get fromDiskCache() {
-        return Boolean(this._request.fromDiskCache);
-    }
-    get isNonNetworkProtocol() {
-        // The 'protocol' field in devtools a string more like a `scheme`
-        return isNonNetworkProtocol(this.request.protocol) ||
-            // But `protocol` can fail to be populated if the request fails, so fallback to scheme.
-            isNonNetworkProtocol(this.request.parsedURL.scheme);
-    }
-    /**
-     * Returns whether this network request can be downloaded without a TCP connection.
-     * During simulation we treat data coming in over a network connection separately from on-device data.
-     */
-    get isConnectionless() {
-        return this.fromDiskCache || this.isNonNetworkProtocol;
-    }
-    hasRenderBlockingPriority() {
-        const priority = this._request.priority;
-        const isScript = this._request.resourceType === 'Script';
-        const isDocument = this._request.resourceType === 'Document';
-        const isBlockingScript = priority === 'High' && isScript;
-        const isBlockingHtmlImport = priority === 'High' && isDocument;
-        return priority === 'VeryHigh' || isBlockingScript || isBlockingHtmlImport;
-    }
-    cloneWithoutRelationships() {
-        const node = new NetworkNode(this._request);
-        node.setIsMainDocument(this._isMainDocument);
-        return node;
-    }
-}
-export { NetworkNode };
-//# sourceMappingURL=NetworkNode.js.map

package/models/trace/lantern/NetworkNode.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"NetworkNode.js","sourceRoot":"","sources":["../../../../../../../front_end/models/trace/lantern/NetworkNode.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B,OAAO,EAAC,QAAQ,EAAC,MAAM,eAAe,CAAC;AAGvC,MAAM,mBAAmB,GAAG;IAC1B,MAAM,EAAS,4EAA4E;IAC3F,MAAM,EAAS,kFAAkF;IACjG,QAAQ,EAAO,sEAAsE;IACrF,MAAM,EAAS,qDAAqD;IACpE,YAAY,EAAG,mEAAmE;IAClF,kBAAkB;CACnB,CAAC;AAEF;;;;;;;;;GASG;AACH,SAAS,oBAAoB,CAAC,QAAgB;IAC5C,sBAAsB;IACtB,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IAC/F,OAAO,mBAAmB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,WAA0C,SAAQ,QAAW;IACjE,QAAQ,CAA4B;IAEpC,YAAY,cAAyC;QACnD,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAChC,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC;IACjC,CAAC;IAED,IAAa,IAAI;QACf,OAAO,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC;IAChC,CAAC;IAED,IAAa,SAAS;QACpB,OAAO,IAAI,CAAC,QAAQ,CAAC,iBAAiB,GAAG,IAAI,CAAC;IAChD,CAAC;IAED,IAAa,OAAO;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC;IAC7C,CAAC;IAED,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,UAAyB,CAAC;IACjD,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC;IACjE,CAAC;IAED,IAAI,aAAa;QACf,OAAO,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,oBAAoB;QACtB,iEAAiE;QACjE,OAAO,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;YAC9C,uFAAuF;YACvF,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC1D,CAAC;IAED;;;OAGG;IACH,IAAI,gBAAgB;QAClB,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,oBAAoB,CAAC;IACzD,CAAC;IAED,yBAAyB;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,KAAK,QAAQ,CAAC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,KAAK,UAAU,CAAC;QAC7D,MAAM,gBAAgB,GAAG,QAAQ,KAAK,MAAM,IAAI,QAAQ,CAAC;QACzD,MAAM,oBAAoB,GAAG,QAAQ,KAAK,MAAM,IAAI,UAAU,CAAC;QAC/D,OAAO,QAAQ,KAAK,UAAU,IAAI,gBAAgB,IAAI,oBAAoB,CAAC;IAC7E,CAAC;IAEQ,yBAAyB;QAChC,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED,OAAO,EAAC,WAAW,EAAC,CAAC","sourcesContent":["// Copyright 2024 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 {BaseNode} from './BaseNode.js';\nimport type * as Lantern from './types/lantern.js';\n\nconst NON_NETWORK_SCHEMES = [\n  'blob',        // @see https://developer.mozilla.org/en-US/docs/Web/API/URL/createObjectURL\n  'data',        // @see https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/Data_URIs\n  'intent',      // @see https://developer.chrome.com/docs/multidevice/android/intents/\n  'file',        // @see https://en.wikipedia.org/wiki/File_URI_scheme\n  'filesystem',  // @see https://developer.mozilla.org/en-US/docs/Web/API/FileSystem\n  'chrome-extension',\n];\n\n/**\n * Note: the `protocol` field from CDP can be 'h2', 'http', (not 'https'!) or it'll be url's scheme.\n *   https://source.chromium.org/chromium/chromium/src/+/main:content/browser/devtools/protocol/network_handler.cc;l=598-611;drc=56d4a9a9deb30be73adcee8737c73bcb2a5ab64f\n * However, a `new URL(href).protocol` has a colon suffix.\n *   https://url.spec.whatwg.org/#dom-url-protocol\n * A URL's `scheme` is specced as the `protocol` sans-colon, but isn't exposed on a URL object.\n * This method can take all 3 of these string types as a parameter.\n *\n * @param protocol Either a networkRequest's `protocol` per CDP or a `new URL(href).protocol`\n */\nfunction isNonNetworkProtocol(protocol: string): boolean {\n  // Strip off any colon\n  const urlScheme = protocol.includes(':') ? protocol.slice(0, protocol.indexOf(':')) : protocol;\n  return NON_NETWORK_SCHEMES.includes(urlScheme);\n}\n\nclass NetworkNode<T = Lantern.AnyNetworkObject> extends BaseNode<T> {\n  _request: Lantern.NetworkRequest<T>;\n\n  constructor(networkRequest: Lantern.NetworkRequest<T>) {\n    super(networkRequest.requestId);\n    this._request = networkRequest;\n  }\n\n  override get type(): 'network' {\n    return BaseNode.types.NETWORK;\n  }\n\n  override get startTime(): number {\n    return this._request.rendererStartTime * 1000;\n  }\n\n  override get endTime(): number {\n    return this._request.networkEndTime * 1000;\n  }\n\n  get rawRequest(): Readonly<T> {\n    return this._request.rawRequest as Required<T>;\n  }\n\n  get request(): Lantern.NetworkRequest<T> {\n    return this._request;\n  }\n\n  get initiatorType(): string {\n    return this._request.initiator && this._request.initiator.type;\n  }\n\n  get fromDiskCache(): boolean {\n    return Boolean(this._request.fromDiskCache);\n  }\n\n  get isNonNetworkProtocol(): boolean {\n    // The 'protocol' field in devtools a string more like a `scheme`\n    return isNonNetworkProtocol(this.request.protocol) ||\n        // But `protocol` can fail to be populated if the request fails, so fallback to scheme.\n        isNonNetworkProtocol(this.request.parsedURL.scheme);\n  }\n\n  /**\n   * Returns whether this network request can be downloaded without a TCP connection.\n   * During simulation we treat data coming in over a network connection separately from on-device data.\n   */\n  get isConnectionless(): boolean {\n    return this.fromDiskCache || this.isNonNetworkProtocol;\n  }\n\n  hasRenderBlockingPriority(): boolean {\n    const priority = this._request.priority;\n    const isScript = this._request.resourceType === 'Script';\n    const isDocument = this._request.resourceType === 'Document';\n    const isBlockingScript = priority === 'High' && isScript;\n    const isBlockingHtmlImport = priority === 'High' && isDocument;\n    return priority === 'VeryHigh' || isBlockingScript || isBlockingHtmlImport;\n  }\n\n  override cloneWithoutRelationships(): NetworkNode<T> {\n    const node = new NetworkNode(this._request);\n    node.setIsMainDocument(this._isMainDocument);\n    return node;\n  }\n}\n\nexport {NetworkNode};\n"]}

package/models/trace/lantern/PageDependencyGraph.d.ts

@@ -1,43 +0,0 @@
-import { type Node } from './BaseNode.js';
-import { CPUNode } from './CPUNode.js';
-import { NetworkNode } from './NetworkNode.js';
-import type * as Lantern from './types/lantern.js';
-interface NetworkNodeOutput {
-    nodes: Array<NetworkNode>;
-    idToNodeMap: Map<string, NetworkNode>;
-    urlToNodeMap: Map<string, Array<NetworkNode>>;
-    frameIdToNodeMap: Map<string, NetworkNode | null>;
-}
-declare class PageDependencyGraph {
-    static getNetworkInitiators(request: Lantern.NetworkRequest): string[];
-    static getNetworkNodeOutput(networkRequests: Lantern.NetworkRequest[]): NetworkNodeOutput;
-    static isScheduleableTask(evt: Lantern.TraceEvent): boolean;
-    /**
-     * There should *always* be at least one top level event, having 0 typically means something is
-     * drastically wrong with the trace and we should just give up early and loudly.
-     */
-    static assertHasToplevelEvents(events: Lantern.TraceEvent[]): void;
-    static getCPUNodes(mainThreadEvents: Lantern.TraceEvent[]): CPUNode[];
-    static linkNetworkNodes(rootNode: NetworkNode, networkNodeOutput: NetworkNodeOutput): void;
-    static linkCPUNodes(rootNode: Node, networkNodeOutput: NetworkNodeOutput, cpuNodes: CPUNode[]): void;
-    /**
-     * Removes the given node from the graph, but retains all paths between its dependencies and
-     * dependents.
-     */
-    static _pruneNode(node: Node): void;
-    /**
-     * TODO: remove when CDT backend in Lighthouse is gone. Until then, this is a useful debugging tool
-     * to find delta between using CDP or the trace to create the network requests.
-     *
-     * When a test fails using the trace backend, I enabled this debug method and copied the network
-     * requests when CDP was used, then when trace is used, and diff'd them. This method helped
-     * remove non-logical differences from the comparison (order of properties, slight rounding
-     * discrepancies, removing object cycles, etc).
-     *
-     * When using for a unit test, make sure to do `.only` so you are getting what you expect.
-     */
-    static _debugNormalizeRequests(lanternRequests: Lantern.NetworkRequest[]): void;
-    static createGraph(mainThreadEvents: Lantern.TraceEvent[], networkRequests: Lantern.NetworkRequest[], url: Lantern.Simulation.URL): Node;
-    static printGraph(rootNode: Node, widthInCharacters?: number): void;
-}
-export { PageDependencyGraph };