@paulirish/trace_engine 0.0.32 → 0.0.33

package/models/trace/lantern/simulation/SimulationTimingMap.js.map

@@ -1 +1 @@
-{"version":3,"file":"SimulationTimingMap.js","sourceRoot":"","sources":["../../../../../../../../front_end/models/trace/lantern/simulation/SimulationTimingMap.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B;;;;;;GAMG;AAEH,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAmC3C,MAAM,kBAAkB;IACtB,YAAY,CAAkC;IAE9C;QACE,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,EAA8B,CAAC;IAC5D,CAAC;IAED,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,eAAe,CAAC,IAAgB,EAAE,MAA4B;QAC5D,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,aAAa,CAAC,IAAgB,EAAE,MAA2B;QACzD,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACvB,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,WAAW,EAAE,CAAC;SACf,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,GAAG,CACjB,IAAI,EACJ,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAC,GAAG,UAAU,EAAE,oBAAoB,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAC,CAAC,CAAC;YAC9D,UAAU,CAC1D,CAAC;IACJ,CAAC;IAED,YAAY,CAAC,IAAgB,EAAE,MAA8D;QAC3F,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAC3B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;SAC1C,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,IAAmB,EAAE,MAA6B;QACvD,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAC3B,WAAW,EAAE,MAAM,CAAC,WAAW;SAChC,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC;IAED,eAAe,CAAC,IAAmB,EAAE,MAAsC;QACzE,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAC3B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;SAClD,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC;IAED,UAAU,CACN,IAAuB,EACvB,MAAoF;QACtF,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAC/B,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;YACjD,eAAe,EAAE,MAAM,CAAC,eAAe;SACxC,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC;IAED,mBAAmB,CAAC,IAAuB,EAAE,MAAsC;QACjF,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAC/B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;SAClD,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1C,CAAC;IAED,SAAS,CAAC,IAAgB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa,CAAC,IAAmB;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,iBAAiB,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,iBAAiB,CAAC,IAAuB;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC,iBAAiB,IAAI,MAAM,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa,CAAC,IAAgB;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC,sBAAsB,IAAI,MAAM,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,sBAAsB,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,YAAY,CAAC,IAAgB;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC,sBAAsB,IAAI,MAAM,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,sBAAsB,CAAC,CAAC;QACrE,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,OAAO,EAAC,kBAAkB,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\n/**\n * @fileoverview\n *\n * This class encapsulates the type-related validation logic for moving timing information for nodes\n * through the different simulation phases. Methods here ensure that the invariants of simulation hold\n * as nodes are queued, partially simulated, and completed.\n */\n\nimport * as Core from '../core/core.js';\nimport * as Graph from '../graph/graph.js';\n\ninterface NodeTimingComplete {\n  startTime: number;\n  endTime: number;\n  queuedTime: number;\n  estimatedTimeElapsed: number;\n  timeElapsed: number;\n  timeElapsedOvershoot: number;\n  bytesDownloaded: number;\n}\n\ntype NodeTimingQueued = Pick<NodeTimingComplete, 'queuedTime'>;\n\ntype CpuNodeTimingStarted = NodeTimingQueued&Pick<NodeTimingComplete, 'startTime'|'timeElapsed'>;\ntype NetworkNodeTimingStarted = CpuNodeTimingStarted&Pick<NodeTimingComplete, 'timeElapsedOvershoot'|'bytesDownloaded'>;\n\ntype CpuNodeTimingInProgress = CpuNodeTimingStarted&Pick<NodeTimingComplete, 'estimatedTimeElapsed'>;\ntype NetworkNodeTimingInProgress = NetworkNodeTimingStarted&Pick<NodeTimingComplete, 'estimatedTimeElapsed'>;\n\nexport type CpuNodeTimingComplete = CpuNodeTimingInProgress&Pick<NodeTimingComplete, 'endTime'>;\nexport type NetworkNodeTimingComplete =\n    NetworkNodeTimingInProgress&Pick<NodeTimingComplete, 'endTime'>&{connectionTiming: ConnectionTiming};\nexport type CompleteNodeTiming = CpuNodeTimingComplete|NetworkNodeTimingComplete;\n\ntype NodeTimingData = NodeTimingQueued|CpuNodeTimingStarted|NetworkNodeTimingStarted|CpuNodeTimingInProgress|\n    NetworkNodeTimingInProgress|CpuNodeTimingComplete|NetworkNodeTimingComplete;\n\nexport interface ConnectionTiming {\n  dnsResolutionTime?: number;\n  connectionTime?: number;\n  sslTime?: number;\n  timeToFirstByte: number;\n}\n\nclass SimulatorTimingMap {\n  _nodeTimings: Map<Graph.Node, NodeTimingData>;\n\n  constructor() {\n    this._nodeTimings = new Map<Graph.Node, NodeTimingData>();\n  }\n\n  getNodes(): Graph.Node[] {\n    return Array.from(this._nodeTimings.keys());\n  }\n\n  setReadyToStart(node: Graph.Node, values: {queuedTime: number}): void {\n    this._nodeTimings.set(node, values);\n  }\n\n  setInProgress(node: Graph.Node, values: {startTime: number}): void {\n    const nodeTiming = {\n      ...this.getQueued(node),\n      startTime: values.startTime,\n      timeElapsed: 0,\n    };\n\n    this._nodeTimings.set(\n        node,\n        node.type === Graph.BaseNode.types.NETWORK ? {...nodeTiming, timeElapsedOvershoot: 0, bytesDownloaded: 0} :\n                                                     nodeTiming,\n    );\n  }\n\n  setCompleted(node: Graph.Node, values: {endTime: number, connectionTiming?: ConnectionTiming}): void {\n    const nodeTiming = {\n      ...this.getInProgress(node),\n      endTime: values.endTime,\n      connectionTiming: values.connectionTiming,\n    };\n\n    this._nodeTimings.set(node, nodeTiming);\n  }\n\n  setCpu(node: Graph.CPUNode, values: {timeElapsed: number}): void {\n    const nodeTiming = {\n      ...this.getCpuStarted(node),\n      timeElapsed: values.timeElapsed,\n    };\n\n    this._nodeTimings.set(node, nodeTiming);\n  }\n\n  setCpuEstimated(node: Graph.CPUNode, values: {estimatedTimeElapsed: number}): void {\n    const nodeTiming = {\n      ...this.getCpuStarted(node),\n      estimatedTimeElapsed: values.estimatedTimeElapsed,\n    };\n\n    this._nodeTimings.set(node, nodeTiming);\n  }\n\n  setNetwork(\n      node: Graph.NetworkNode,\n      values: {timeElapsed: number, timeElapsedOvershoot: number, bytesDownloaded: number}): void {\n    const nodeTiming = {\n      ...this.getNetworkStarted(node),\n      timeElapsed: values.timeElapsed,\n      timeElapsedOvershoot: values.timeElapsedOvershoot,\n      bytesDownloaded: values.bytesDownloaded,\n    };\n\n    this._nodeTimings.set(node, nodeTiming);\n  }\n\n  setNetworkEstimated(node: Graph.NetworkNode, values: {estimatedTimeElapsed: number}): void {\n    const nodeTiming = {\n      ...this.getNetworkStarted(node),\n      estimatedTimeElapsed: values.estimatedTimeElapsed,\n    };\n\n    this._nodeTimings.set(node, nodeTiming);\n  }\n\n  getQueued(node: Graph.Node): NodeTimingData {\n    const timing = this._nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    return timing;\n  }\n\n  getCpuStarted(node: Graph.CPUNode): CpuNodeTimingStarted {\n    const timing = this._nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if ('bytesDownloaded' in timing) {\n      throw new Core.LanternError(`Node ${node.id} timing not valid`);\n    }\n    return timing;\n  }\n\n  getNetworkStarted(node: Graph.NetworkNode): NetworkNodeTimingStarted {\n    const timing = this._nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if (!('bytesDownloaded' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} timing not valid`);\n    }\n    return timing;\n  }\n\n  getInProgress(node: Graph.Node): CpuNodeTimingInProgress|NetworkNodeTimingInProgress {\n    const timing = this._nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if (!('estimatedTimeElapsed' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet in progress`);\n    }\n    return timing;\n  }\n\n  getCompleted(node: Graph.Node): CpuNodeTimingComplete|NetworkNodeTimingComplete {\n    const timing = this._nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if (!('estimatedTimeElapsed' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet in progress`);\n    }\n    if (!('endTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet completed`);\n    }\n    return timing;\n  }\n}\n\nexport {SimulatorTimingMap};\n"]}
+{"version":3,"file":"SimulationTimingMap.js","sourceRoot":"","sources":["../../../../../../../../front_end/models/trace/lantern/simulation/SimulationTimingMap.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B;;;;;;GAMG;AAEH,OAAO,KAAK,IAAI,MAAM,iBAAiB,CAAC;AACxC,OAAO,KAAK,KAAK,MAAM,mBAAmB,CAAC;AAmC3C,MAAM,kBAAkB;IACtB,WAAW,CAAkC;IAE7C;QACE,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAA8B,CAAC;IAC3D,CAAC;IAED,QAAQ;QACN,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED,eAAe,CAAC,IAAgB,EAAE,MAA4B;QAC5D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACrC,CAAC;IAED,aAAa,CAAC,IAAgB,EAAE,MAA2B;QACzD,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YACvB,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,WAAW,EAAE,CAAC;SACf,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,GAAG,CAChB,IAAI,EACJ,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAC,GAAG,UAAU,EAAE,oBAAoB,EAAE,CAAC,EAAE,eAAe,EAAE,CAAC,EAAC,CAAC,CAAC;YAC9D,UAAU,CAC1D,CAAC;IACJ,CAAC;IAED,YAAY,CAAC,IAAgB,EAAE,MAA8D;QAC3F,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAC3B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;SAC1C,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,CAAC,IAAmB,EAAE,MAA6B;QACvD,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAC3B,WAAW,EAAE,MAAM,CAAC,WAAW;SAChC,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC;IAED,eAAe,CAAC,IAAmB,EAAE,MAAsC;QACzE,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YAC3B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;SAClD,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC;IAED,UAAU,CACN,IAAuB,EACvB,MAAoF;QACtF,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAC/B,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;YACjD,eAAe,EAAE,MAAM,CAAC,eAAe;SACxC,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC;IAED,mBAAmB,CAAC,IAAuB,EAAE,MAAsC;QACjF,MAAM,UAAU,GAAG;YACjB,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAC/B,oBAAoB,EAAE,MAAM,CAAC,oBAAoB;SAClD,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC;IAED,SAAS,CAAC,IAAgB;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa,CAAC,IAAmB;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,iBAAiB,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,iBAAiB,CAAC,IAAuB;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC,iBAAiB,IAAI,MAAM,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,aAAa,CAAC,IAAgB;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC,sBAAsB,IAAI,MAAM,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,sBAAsB,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,YAAY,CAAC,IAAgB;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,CAAC,WAAW,IAAI,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,CAAC,CAAC,sBAAsB,IAAI,MAAM,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,sBAAsB,CAAC,CAAC;QACrE,CAAC;QACD,IAAI,CAAC,CAAC,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,OAAO,EAAC,kBAAkB,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\n/**\n * @fileoverview\n *\n * This class encapsulates the type-related validation logic for moving timing information for nodes\n * through the different simulation phases. Methods here ensure that the invariants of simulation hold\n * as nodes are queued, partially simulated, and completed.\n */\n\nimport * as Core from '../core/core.js';\nimport * as Graph from '../graph/graph.js';\n\ninterface NodeTimingComplete {\n  startTime: number;\n  endTime: number;\n  queuedTime: number;\n  estimatedTimeElapsed: number;\n  timeElapsed: number;\n  timeElapsedOvershoot: number;\n  bytesDownloaded: number;\n}\n\ntype NodeTimingQueued = Pick<NodeTimingComplete, 'queuedTime'>;\n\ntype CpuNodeTimingStarted = NodeTimingQueued&Pick<NodeTimingComplete, 'startTime'|'timeElapsed'>;\ntype NetworkNodeTimingStarted = CpuNodeTimingStarted&Pick<NodeTimingComplete, 'timeElapsedOvershoot'|'bytesDownloaded'>;\n\ntype CpuNodeTimingInProgress = CpuNodeTimingStarted&Pick<NodeTimingComplete, 'estimatedTimeElapsed'>;\ntype NetworkNodeTimingInProgress = NetworkNodeTimingStarted&Pick<NodeTimingComplete, 'estimatedTimeElapsed'>;\n\nexport type CpuNodeTimingComplete = CpuNodeTimingInProgress&Pick<NodeTimingComplete, 'endTime'>;\nexport type NetworkNodeTimingComplete =\n    NetworkNodeTimingInProgress&Pick<NodeTimingComplete, 'endTime'>&{connectionTiming: ConnectionTiming};\nexport type CompleteNodeTiming = CpuNodeTimingComplete|NetworkNodeTimingComplete;\n\ntype NodeTimingData = NodeTimingQueued|CpuNodeTimingStarted|NetworkNodeTimingStarted|CpuNodeTimingInProgress|\n    NetworkNodeTimingInProgress|CpuNodeTimingComplete|NetworkNodeTimingComplete;\n\nexport interface ConnectionTiming {\n  dnsResolutionTime?: number;\n  connectionTime?: number;\n  sslTime?: number;\n  timeToFirstByte: number;\n}\n\nclass SimulatorTimingMap {\n  nodeTimings: Map<Graph.Node, NodeTimingData>;\n\n  constructor() {\n    this.nodeTimings = new Map<Graph.Node, NodeTimingData>();\n  }\n\n  getNodes(): Graph.Node[] {\n    return Array.from(this.nodeTimings.keys());\n  }\n\n  setReadyToStart(node: Graph.Node, values: {queuedTime: number}): void {\n    this.nodeTimings.set(node, values);\n  }\n\n  setInProgress(node: Graph.Node, values: {startTime: number}): void {\n    const nodeTiming = {\n      ...this.getQueued(node),\n      startTime: values.startTime,\n      timeElapsed: 0,\n    };\n\n    this.nodeTimings.set(\n        node,\n        node.type === Graph.BaseNode.types.NETWORK ? {...nodeTiming, timeElapsedOvershoot: 0, bytesDownloaded: 0} :\n                                                     nodeTiming,\n    );\n  }\n\n  setCompleted(node: Graph.Node, values: {endTime: number, connectionTiming?: ConnectionTiming}): void {\n    const nodeTiming = {\n      ...this.getInProgress(node),\n      endTime: values.endTime,\n      connectionTiming: values.connectionTiming,\n    };\n\n    this.nodeTimings.set(node, nodeTiming);\n  }\n\n  setCpu(node: Graph.CPUNode, values: {timeElapsed: number}): void {\n    const nodeTiming = {\n      ...this.getCpuStarted(node),\n      timeElapsed: values.timeElapsed,\n    };\n\n    this.nodeTimings.set(node, nodeTiming);\n  }\n\n  setCpuEstimated(node: Graph.CPUNode, values: {estimatedTimeElapsed: number}): void {\n    const nodeTiming = {\n      ...this.getCpuStarted(node),\n      estimatedTimeElapsed: values.estimatedTimeElapsed,\n    };\n\n    this.nodeTimings.set(node, nodeTiming);\n  }\n\n  setNetwork(\n      node: Graph.NetworkNode,\n      values: {timeElapsed: number, timeElapsedOvershoot: number, bytesDownloaded: number}): void {\n    const nodeTiming = {\n      ...this.getNetworkStarted(node),\n      timeElapsed: values.timeElapsed,\n      timeElapsedOvershoot: values.timeElapsedOvershoot,\n      bytesDownloaded: values.bytesDownloaded,\n    };\n\n    this.nodeTimings.set(node, nodeTiming);\n  }\n\n  setNetworkEstimated(node: Graph.NetworkNode, values: {estimatedTimeElapsed: number}): void {\n    const nodeTiming = {\n      ...this.getNetworkStarted(node),\n      estimatedTimeElapsed: values.estimatedTimeElapsed,\n    };\n\n    this.nodeTimings.set(node, nodeTiming);\n  }\n\n  getQueued(node: Graph.Node): NodeTimingData {\n    const timing = this.nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    return timing;\n  }\n\n  getCpuStarted(node: Graph.CPUNode): CpuNodeTimingStarted {\n    const timing = this.nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if ('bytesDownloaded' in timing) {\n      throw new Core.LanternError(`Node ${node.id} timing not valid`);\n    }\n    return timing;\n  }\n\n  getNetworkStarted(node: Graph.NetworkNode): NetworkNodeTimingStarted {\n    const timing = this.nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if (!('bytesDownloaded' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} timing not valid`);\n    }\n    return timing;\n  }\n\n  getInProgress(node: Graph.Node): CpuNodeTimingInProgress|NetworkNodeTimingInProgress {\n    const timing = this.nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if (!('estimatedTimeElapsed' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet in progress`);\n    }\n    return timing;\n  }\n\n  getCompleted(node: Graph.Node): CpuNodeTimingComplete|NetworkNodeTimingComplete {\n    const timing = this.nodeTimings.get(node);\n    if (!timing) {\n      throw new Core.LanternError(`Node ${node.id} not yet queued`);\n    }\n    if (!('startTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet started`);\n    }\n    if (!('estimatedTimeElapsed' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet in progress`);\n    }\n    if (!('endTime' in timing)) {\n      throw new Core.LanternError(`Node ${node.id} not yet completed`);\n    }\n    return timing;\n  }\n}\n\nexport {SimulatorTimingMap};\n"]}

package/models/trace/lantern/simulation/Simulator.d.ts

@@ -10,52 +10,52 @@ export interface Result<T = Lantern.AnyNetworkObject> {
 }
 declare class Simulator<T = Lantern.AnyNetworkObject> {
     static createSimulator(settings: Lantern.Simulation.Settings): Simulator;
-    _options: Required<Lantern.Simulation.Options>;
+    options: Required<Lantern.Simulation.Options>;
     _rtt: number;
-    _throughput: number;
-    _maximumConcurrentRequests: number;
-    _cpuSlowdownMultiplier: number;
-    _layoutTaskMultiplier: number;
-    _cachedNodeListByStartPosition: Graph.Node[];
-    _nodeTimings: SimulatorTimingMap;
-    _numberInProgressByType: Map<string, number>;
-    _nodes: Record<number, Set<Graph.Node>>;
-    _dns: DNSCache;
-    _connectionPool: ConnectionPool;
+    throughput: number;
+    maximumConcurrentRequests: number;
+    cpuSlowdownMultiplier: number;
+    layoutTaskMultiplier: number;
+    cachedNodeListByStartPosition: Graph.Node[];
+    nodeTimings: SimulatorTimingMap;
+    numberInProgressByType: Map<string, number>;
+    nodes: Record<number, Set<Graph.Node>>;
+    dns: DNSCache;
+    connectionPool: ConnectionPool;
     constructor(options?: Lantern.Simulation.Options);
     get rtt(): number;
-    _initializeConnectionPool(graph: Graph.Node): void;
+    initializeConnectionPool(graph: Graph.Node): void;
     /**
      * Initializes the various state data structures such _nodeTimings and the _node Sets by state.
      */
-    _initializeAuxiliaryData(): void;
-    _numberInProgress(type: string): number;
-    _markNodeAsReadyToStart(node: Graph.Node, queuedTime: number): void;
-    _markNodeAsInProgress(node: Graph.Node, startTime: number): void;
-    _markNodeAsComplete(node: Graph.Node, endTime: number, connectionTiming?: ConnectionTiming): void;
-    _acquireConnection(request: Lantern.NetworkRequest): TCPConnection | null;
-    _getNodesSortedByStartPosition(): Graph.Node[];
-    _startNodeIfPossible(node: Graph.Node, totalElapsedTime: number): void;
+    initializeAuxiliaryData(): void;
+    numberInProgress(type: string): number;
+    markNodeAsReadyToStart(node: Graph.Node, queuedTime: number): void;
+    markNodeAsInProgress(node: Graph.Node, startTime: number): void;
+    markNodeAsComplete(node: Graph.Node, endTime: number, connectionTiming?: ConnectionTiming): void;
+    acquireConnection(request: Lantern.NetworkRequest): TCPConnection | null;
+    getNodesSortedByStartPosition(): Graph.Node[];
+    startNodeIfPossible(node: Graph.Node, totalElapsedTime: number): void;
     /**
      * Updates each connection in use with the available throughput based on the number of network requests
      * currently in flight.
      */
-    _updateNetworkCapacity(): void;
+    updateNetworkCapacity(): void;
     /**
      * Estimates the number of milliseconds remaining given current condidtions before the node is complete.
      */
-    _estimateTimeRemaining(node: Graph.Node): number;
-    _estimateCPUTimeRemaining(cpuNode: Graph.CPUNode): number;
-    _estimateNetworkTimeRemaining(networkNode: Graph.NetworkNode): number;
+    estimateTimeRemaining(node: Graph.Node): number;
+    estimateCPUTimeRemaining(cpuNode: Graph.CPUNode): number;
+    estimateNetworkTimeRemaining(networkNode: Graph.NetworkNode): number;
     /**
      * Computes and returns the minimum estimated completion time of the nodes currently in progress.
      */
-    _findNextNodeCompletionTime(): number;
+    findNextNodeCompletionTime(): number;
     /**
      * Given a time period, computes the progress toward completion that the node made durin that time.
      */
-    _updateProgressMadeInTimePeriod(node: Graph.Node, timePeriodLength: number, totalElapsedTime: number): void;
-    _computeFinalNodeTimings(): {
+    updateProgressMadeInTimePeriod(node: Graph.Node, timePeriodLength: number, totalElapsedTime: number): void;
+    computeFinalNodeTimings(): {
         nodeTimings: Map<Graph.Node, Lantern.Simulation.NodeTiming>;
         completeNodeTimings: Map<Graph.Node, CompleteNodeTiming>;
     };
@@ -79,6 +79,6 @@ declare class Simulator<T = Lantern.AnyNetworkObject> {
      * When simulating, just because a low priority image started 5ms before a high priority image doesn't mean
      * it would have happened like that when the network was slower.
      */
-    static _computeNodeStartPosition(node: Graph.Node): number;
+    static computeNodeStartPosition(node: Graph.Node): number;
 }
 export { Simulator };

package/models/trace/lantern/simulation/Simulator.js

@@ -72,20 +72,20 @@ class Simulator {
         }
         return new Simulator(options);
     }
-    _options;
+    options;
     _rtt;
-    _throughput;
-    _maximumConcurrentRequests;
-    _cpuSlowdownMultiplier;
-    _layoutTaskMultiplier;
-    _cachedNodeListByStartPosition;
-    _nodeTimings;
-    _numberInProgressByType;
-    _nodes;
-    _dns;
-    _connectionPool;
+    throughput;
+    maximumConcurrentRequests;
+    cpuSlowdownMultiplier;
+    layoutTaskMultiplier;
+    cachedNodeListByStartPosition;
+    nodeTimings;
+    numberInProgressByType;
+    nodes;
+    dns;
+    connectionPool;
     constructor(options) {
-        this._options = Object.assign({
+        this.options = Object.assign({
             rtt: defaultThrottling.rttMs,
             throughput: defaultThrottling.throughputKbps * 1024,
             maximumConcurrentRequests: DEFAULT_MAXIMUM_CONCURRENT_REQUESTS,
@@ -94,101 +94,101 @@ class Simulator {
             additionalRttByOrigin: new Map(),
             serverResponseTimeByOrigin: new Map(),
         }, options);
-        this._rtt = this._options.rtt;
-        this._throughput = this._options.throughput;
-        this._maximumConcurrentRequests = Math.max(Math.min(TCPConnection.maximumSaturatedConnections(this._rtt, this._throughput), this._options.maximumConcurrentRequests), 1);
-        this._cpuSlowdownMultiplier = this._options.cpuSlowdownMultiplier;
-        this._layoutTaskMultiplier = this._cpuSlowdownMultiplier * this._options.layoutTaskMultiplier;
-        this._cachedNodeListByStartPosition = [];
+        this._rtt = this.options.rtt;
+        this.throughput = this.options.throughput;
+        this.maximumConcurrentRequests = Math.max(Math.min(TCPConnection.maximumSaturatedConnections(this._rtt, this.throughput), this.options.maximumConcurrentRequests), 1);
+        this.cpuSlowdownMultiplier = this.options.cpuSlowdownMultiplier;
+        this.layoutTaskMultiplier = this.cpuSlowdownMultiplier * this.options.layoutTaskMultiplier;
+        this.cachedNodeListByStartPosition = [];
         // Properties reset on every `.simulate` call but duplicated here for type checking
-        this._nodeTimings = new SimulatorTimingMap();
-        this._numberInProgressByType = new Map();
-        this._nodes = {};
-        this._dns = new DNSCache({ rtt: this._rtt });
+        this.nodeTimings = new SimulatorTimingMap();
+        this.numberInProgressByType = new Map();
+        this.nodes = {};
+        this.dns = new DNSCache({ rtt: this._rtt });
         // @ts-expect-error
-        this._connectionPool = null;
+        this.connectionPool = null;
         if (!Number.isFinite(this._rtt)) {
             throw new Core.LanternError(`Invalid rtt ${this._rtt}`);
         }
-        if (!Number.isFinite(this._throughput)) {
-            throw new Core.LanternError(`Invalid rtt ${this._throughput}`);
+        if (!Number.isFinite(this.throughput)) {
+            throw new Core.LanternError(`Invalid rtt ${this.throughput}`);
         }
     }
     get rtt() {
         return this._rtt;
     }
-    _initializeConnectionPool(graph) {
+    initializeConnectionPool(graph) {
         const records = [];
         graph.getRootNode().traverse(node => {
             if (node.type === Graph.BaseNode.types.NETWORK) {
                 records.push(node.request);
             }
         });
-        this._connectionPool = new ConnectionPool(records, this._options);
+        this.connectionPool = new ConnectionPool(records, this.options);
     }
     /**
      * Initializes the various state data structures such _nodeTimings and the _node Sets by state.
      */
-    _initializeAuxiliaryData() {
-        this._nodeTimings = new SimulatorTimingMap();
-        this._numberInProgressByType = new Map();
-        this._nodes = {};
-        this._cachedNodeListByStartPosition = [];
+    initializeAuxiliaryData() {
+        this.nodeTimings = new SimulatorTimingMap();
+        this.numberInProgressByType = new Map();
+        this.nodes = {};
+        this.cachedNodeListByStartPosition = [];
         // NOTE: We don't actually need *all* of these sets, but the clarity that each node progresses
         // through the system is quite nice.
         for (const state of Object.values(NodeState)) {
-            this._nodes[state] = new Set();
+            this.nodes[state] = new Set();
         }
     }
-    _numberInProgress(type) {
-        return this._numberInProgressByType.get(type) || 0;
+    numberInProgress(type) {
+        return this.numberInProgressByType.get(type) || 0;
     }
-    _markNodeAsReadyToStart(node, queuedTime) {
-        const nodeStartPosition = Simulator._computeNodeStartPosition(node);
-        const firstNodeIndexWithGreaterStartPosition = this._cachedNodeListByStartPosition.findIndex(candidate => Simulator._computeNodeStartPosition(candidate) > nodeStartPosition);
-        const insertionIndex = firstNodeIndexWithGreaterStartPosition === -1 ? this._cachedNodeListByStartPosition.length :
+    markNodeAsReadyToStart(node, queuedTime) {
+        const nodeStartPosition = Simulator.computeNodeStartPosition(node);
+        const firstNodeIndexWithGreaterStartPosition = this.cachedNodeListByStartPosition.findIndex(candidate => Simulator.computeNodeStartPosition(candidate) > nodeStartPosition);
+        const insertionIndex = firstNodeIndexWithGreaterStartPosition === -1 ? this.cachedNodeListByStartPosition.length :
             firstNodeIndexWithGreaterStartPosition;
-        this._cachedNodeListByStartPosition.splice(insertionIndex, 0, node);
-        this._nodes[NodeState.ReadyToStart].add(node);
-        this._nodes[NodeState.NotReadyToStart].delete(node);
-        this._nodeTimings.setReadyToStart(node, { queuedTime });
+        this.cachedNodeListByStartPosition.splice(insertionIndex, 0, node);
+        this.nodes[NodeState.ReadyToStart].add(node);
+        this.nodes[NodeState.NotReadyToStart].delete(node);
+        this.nodeTimings.setReadyToStart(node, { queuedTime });
     }
-    _markNodeAsInProgress(node, startTime) {
-        const indexOfNodeToStart = this._cachedNodeListByStartPosition.indexOf(node);
-        this._cachedNodeListByStartPosition.splice(indexOfNodeToStart, 1);
-        this._nodes[NodeState.InProgress].add(node);
-        this._nodes[NodeState.ReadyToStart].delete(node);
-        this._numberInProgressByType.set(node.type, this._numberInProgress(node.type) + 1);
-        this._nodeTimings.setInProgress(node, { startTime });
+    markNodeAsInProgress(node, startTime) {
+        const indexOfNodeToStart = this.cachedNodeListByStartPosition.indexOf(node);
+        this.cachedNodeListByStartPosition.splice(indexOfNodeToStart, 1);
+        this.nodes[NodeState.InProgress].add(node);
+        this.nodes[NodeState.ReadyToStart].delete(node);
+        this.numberInProgressByType.set(node.type, this.numberInProgress(node.type) + 1);
+        this.nodeTimings.setInProgress(node, { startTime });
     }
-    _markNodeAsComplete(node, endTime, connectionTiming) {
-        this._nodes[NodeState.Complete].add(node);
-        this._nodes[NodeState.InProgress].delete(node);
-        this._numberInProgressByType.set(node.type, this._numberInProgress(node.type) - 1);
-        this._nodeTimings.setCompleted(node, { endTime, connectionTiming });
+    markNodeAsComplete(node, endTime, connectionTiming) {
+        this.nodes[NodeState.Complete].add(node);
+        this.nodes[NodeState.InProgress].delete(node);
+        this.numberInProgressByType.set(node.type, this.numberInProgress(node.type) - 1);
+        this.nodeTimings.setCompleted(node, { endTime, connectionTiming });
         // Try to add all its dependents to the queue
         for (const dependent of node.getDependents()) {
             // Skip dependent node if one of its dependencies hasn't finished yet
             const dependencies = dependent.getDependencies();
-            if (dependencies.some(dep => !this._nodes[NodeState.Complete].has(dep))) {
+            if (dependencies.some(dep => !this.nodes[NodeState.Complete].has(dep))) {
                 continue;
             }
             // Otherwise add it to the queue
-            this._markNodeAsReadyToStart(dependent, endTime);
+            this.markNodeAsReadyToStart(dependent, endTime);
         }
     }
-    _acquireConnection(request) {
-        return this._connectionPool.acquire(request);
+    acquireConnection(request) {
+        return this.connectionPool.acquire(request);
     }
-    _getNodesSortedByStartPosition() {
+    getNodesSortedByStartPosition() {
         // Make a copy so we don't skip nodes due to concurrent modification
-        return Array.from(this._cachedNodeListByStartPosition);
+        return Array.from(this.cachedNodeListByStartPosition);
     }
-    _startNodeIfPossible(node, totalElapsedTime) {
+    startNodeIfPossible(node, totalElapsedTime) {
         if (node.type === Graph.BaseNode.types.CPU) {
             // Start a CPU task if there's no other CPU task in process
-            if (this._numberInProgress(node.type) === 0) {
-                this._markNodeAsInProgress(node, totalElapsedTime);
+            if (this.numberInProgress(node.type) === 0) {
+                this.markNodeAsInProgress(node, totalElapsedTime);
             }
             return;
         }
@@ -198,53 +198,53 @@ class Simulator {
         // If a network request is connectionless, we can always start it, so skip the connection checks
         if (!node.isConnectionless) {
             // Start a network request if we're not at max requests and a connection is available
-            const numberOfActiveRequests = this._numberInProgress(node.type);
-            if (numberOfActiveRequests >= this._maximumConcurrentRequests) {
+            const numberOfActiveRequests = this.numberInProgress(node.type);
+            if (numberOfActiveRequests >= this.maximumConcurrentRequests) {
                 return;
             }
-            const connection = this._acquireConnection(node.request);
+            const connection = this.acquireConnection(node.request);
             if (!connection) {
                 return;
             }
         }
-        this._markNodeAsInProgress(node, totalElapsedTime);
+        this.markNodeAsInProgress(node, totalElapsedTime);
     }
     /**
      * Updates each connection in use with the available throughput based on the number of network requests
      * currently in flight.
      */
-    _updateNetworkCapacity() {
-        const inFlight = this._numberInProgress(Graph.BaseNode.types.NETWORK);
+    updateNetworkCapacity() {
+        const inFlight = this.numberInProgress(Graph.BaseNode.types.NETWORK);
         if (inFlight === 0) {
             return;
         }
-        for (const connection of this._connectionPool.connectionsInUse()) {
-            connection.setThroughput(this._throughput / inFlight);
+        for (const connection of this.connectionPool.connectionsInUse()) {
+            connection.setThroughput(this.throughput / inFlight);
         }
     }
     /**
      * Estimates the number of milliseconds remaining given current condidtions before the node is complete.
      */
-    _estimateTimeRemaining(node) {
+    estimateTimeRemaining(node) {
         if (node.type === Graph.BaseNode.types.CPU) {
-            return this._estimateCPUTimeRemaining(node);
+            return this.estimateCPUTimeRemaining(node);
         }
         if (node.type === Graph.BaseNode.types.NETWORK) {
-            return this._estimateNetworkTimeRemaining(node);
+            return this.estimateNetworkTimeRemaining(node);
         }
         throw new Core.LanternError('Unsupported');
     }
-    _estimateCPUTimeRemaining(cpuNode) {
-        const timingData = this._nodeTimings.getCpuStarted(cpuNode);
-        const multiplier = cpuNode.didPerformLayout() ? this._layoutTaskMultiplier : this._cpuSlowdownMultiplier;
+    estimateCPUTimeRemaining(cpuNode) {
+        const timingData = this.nodeTimings.getCpuStarted(cpuNode);
+        const multiplier = cpuNode.didPerformLayout() ? this.layoutTaskMultiplier : this.cpuSlowdownMultiplier;
         const totalDuration = Math.min(Math.round(cpuNode.duration / 1000 * multiplier), DEFAULT_MAXIMUM_CPU_TASK_DURATION);
         const estimatedTimeElapsed = totalDuration - timingData.timeElapsed;
-        this._nodeTimings.setCpuEstimated(cpuNode, { estimatedTimeElapsed });
+        this.nodeTimings.setCpuEstimated(cpuNode, { estimatedTimeElapsed });
         return estimatedTimeElapsed;
     }
-    _estimateNetworkTimeRemaining(networkNode) {
+    estimateNetworkTimeRemaining(networkNode) {
         const request = networkNode.request;
-        const timingData = this._nodeTimings.getNetworkStarted(networkNode);
+        const timingData = this.nodeTimings.getNetworkStarted(networkNode);
         let timeElapsed = 0;
         if (networkNode.fromDiskCache) {
             // Rough access time for seeking to location on disk and reading sequentially.
@@ -261,8 +261,8 @@ class Simulator {
             timeElapsed = 2 + 10 * sizeInMb - timingData.timeElapsed;
         }
         else {
-            const connection = this._connectionPool.acquireActiveConnectionFromRequest(request);
-            const dnsResolutionTime = this._dns.getTimeUntilResolution(request, {
+            const connection = this.connectionPool.acquireActiveConnectionFromRequest(request);
+            const dnsResolutionTime = this.dns.getTimeUntilResolution(request, {
                 requestedAt: timingData.startTime,
                 shouldUpdateCache: true,
             });
@@ -271,28 +271,28 @@ class Simulator {
             timeElapsed = calculation.timeElapsed;
         }
         const estimatedTimeElapsed = timeElapsed + timingData.timeElapsedOvershoot;
-        this._nodeTimings.setNetworkEstimated(networkNode, { estimatedTimeElapsed });
+        this.nodeTimings.setNetworkEstimated(networkNode, { estimatedTimeElapsed });
         return estimatedTimeElapsed;
     }
     /**
      * Computes and returns the minimum estimated completion time of the nodes currently in progress.
      */
-    _findNextNodeCompletionTime() {
+    findNextNodeCompletionTime() {
         let minimumTime = Infinity;
-        for (const node of this._nodes[NodeState.InProgress]) {
-            minimumTime = Math.min(minimumTime, this._estimateTimeRemaining(node));
+        for (const node of this.nodes[NodeState.InProgress]) {
+            minimumTime = Math.min(minimumTime, this.estimateTimeRemaining(node));
         }
         return minimumTime;
     }
     /**
      * Given a time period, computes the progress toward completion that the node made durin that time.
      */
-    _updateProgressMadeInTimePeriod(node, timePeriodLength, totalElapsedTime) {
-        const timingData = this._nodeTimings.getInProgress(node);
+    updateProgressMadeInTimePeriod(node, timePeriodLength, totalElapsedTime) {
+        const timingData = this.nodeTimings.getInProgress(node);
         const isFinished = timingData.estimatedTimeElapsed === timePeriodLength;
         if (node.type === Graph.BaseNode.types.CPU || node.isConnectionless) {
             if (isFinished) {
-                this._markNodeAsComplete(node, totalElapsedTime);
+                this.markNodeAsComplete(node, totalElapsedTime);
             }
             else {
                 timingData.timeElapsed += timePeriodLength;
@@ -306,8 +306,8 @@ class Simulator {
             throw new Core.LanternError('Invalid timing data');
         }
         const request = node.request;
-        const connection = this._connectionPool.acquireActiveConnectionFromRequest(request);
-        const dnsResolutionTime = this._dns.getTimeUntilResolution(request, {
+        const connection = this.connectionPool.acquireActiveConnectionFromRequest(request);
+        const dnsResolutionTime = this.dns.getTimeUntilResolution(request, {
             requestedAt: timingData.startTime,
             shouldUpdateCache: true,
         });
@@ -320,8 +320,8 @@ class Simulator {
         connection.setH2OverflowBytesDownloaded(calculation.extraBytesDownloaded);
         if (isFinished) {
             connection.setWarmed(true);
-            this._connectionPool.release(request);
-            this._markNodeAsComplete(node, totalElapsedTime, calculation.connectionTiming);
+            this.connectionPool.release(request);
+            this.markNodeAsComplete(node, totalElapsedTime, calculation.connectionTiming);
         }
         else {
             timingData.timeElapsed += calculation.timeElapsed;
@@ -329,9 +329,9 @@ class Simulator {
             timingData.bytesDownloaded += calculation.bytesDownloaded;
         }
     }
-    _computeFinalNodeTimings() {
-        const completeNodeTimingEntries = this._nodeTimings.getNodes().map(node => {
-            return [node, this._nodeTimings.getCompleted(node)];
+    computeFinalNodeTimings() {
+        const completeNodeTimingEntries = this.nodeTimings.getNodes().map(node => {
+            return [node, this.nodeTimings.getCompleted(node)];
         });
         // Most consumers will want the entries sorted by startTime, so insert them in that order
         completeNodeTimingEntries.sort((a, b) => a[1].startTime - b[1].startTime);
@@ -352,7 +352,7 @@ class Simulator {
         };
     }
     getOptions() {
-        return this._options;
+        return this.options;
     }
     /**
      * Estimates the time taken to process all of the graph's nodes, returns the overall time along with
@@ -371,23 +371,23 @@ class Simulator {
             label: undefined,
         }, options);
         // initialize the necessary data containers
-        this._dns = new DNSCache({ rtt: this._rtt });
-        this._initializeConnectionPool(graph);
-        this._initializeAuxiliaryData();
-        const nodesNotReadyToStart = this._nodes[NodeState.NotReadyToStart];
-        const nodesReadyToStart = this._nodes[NodeState.ReadyToStart];
-        const nodesInProgress = this._nodes[NodeState.InProgress];
+        this.dns = new DNSCache({ rtt: this._rtt });
+        this.initializeConnectionPool(graph);
+        this.initializeAuxiliaryData();
+        const nodesNotReadyToStart = this.nodes[NodeState.NotReadyToStart];
+        const nodesReadyToStart = this.nodes[NodeState.ReadyToStart];
+        const nodesInProgress = this.nodes[NodeState.InProgress];
         const rootNode = graph.getRootNode();
         rootNode.traverse(node => nodesNotReadyToStart.add(node));
         let totalElapsedTime = 0;
         let iteration = 0;
         // root node is always ready to start
-        this._markNodeAsReadyToStart(rootNode, totalElapsedTime);
+        this.markNodeAsReadyToStart(rootNode, totalElapsedTime);
         // loop as long as we have nodes in the queue or currently in progress
         while (nodesReadyToStart.size || nodesInProgress.size) {
             // move all possible queued nodes to in progress
-            for (const node of this._getNodesSortedByStartPosition()) {
-                this._startNodeIfPossible(node, totalElapsedTime);
+            for (const node of this.getNodesSortedByStartPosition()) {
+                this.startNodeIfPossible(node, totalElapsedTime);
             }
             if (!nodesInProgress.size) {
                 // Interplay between fromDiskCache and connectionReused can be incorrect,
@@ -395,9 +395,9 @@ class Simulator {
                 throw new Core.LanternError('Failed to start a node');
             }
             // set the available throughput for all connections based on # inflight
-            this._updateNetworkCapacity();
+            this.updateNetworkCapacity();
             // find the time that the next node will finish
-            const minimumTime = this._findNextNodeCompletionTime();
+            const minimumTime = this.findNextNodeCompletionTime();
             totalElapsedTime += minimumTime;
             // While this is no longer strictly necessary, it's always better than hanging
             if (!Number.isFinite(minimumTime) || iteration > 100000) {
@@ -406,11 +406,11 @@ class Simulator {
             iteration++;
             // update how far each node will progress until that point
             for (const node of nodesInProgress) {
-                this._updateProgressMadeInTimePeriod(node, minimumTime, totalElapsedTime);
+                this.updateProgressMadeInTimePeriod(node, minimumTime, totalElapsedTime);
             }
         }
         // `nodeTimings` are used for simulator consumers, `completeNodeTimings` kept for debugging.
-        const { nodeTimings, completeNodeTimings } = this._computeFinalNodeTimings();
+        const { nodeTimings, completeNodeTimings } = this.computeFinalNodeTimings();
         ALL_SIMULATION_NODE_TIMINGS.set(options.label || 'unlabeled', completeNodeTimings);
         return {
             timeInMs: totalElapsedTime,
@@ -418,7 +418,7 @@ class Simulator {
         };
     }
     computeWastedMsFromWastedBytes(wastedBytes) {
-        const { throughput, observedThroughput } = this._options;
+        const { throughput, observedThroughput } = this.options;
         // https://github.com/GoogleChrome/lighthouse/pull/13323#issuecomment-962031709
         // 0 throughput means the no (additional) throttling is expected.
         // This is common for desktop + devtools throttling where throttling is additive and we don't want any additional.
@@ -439,7 +439,7 @@ class Simulator {
      * When simulating, just because a low priority image started 5ms before a high priority image doesn't mean
      * it would have happened like that when the network was slower.
      */
-    static _computeNodeStartPosition(node) {
+    static computeNodeStartPosition(node) {
         if (node.type === 'cpu') {
             return node.startTime;
         }