run() |  | 0% |  | 0% | 4 | 4 | 34 | 34 | 1 | 1 |
iterateOnTree() |  | 0% |  | 0% | 8 | 8 | 28 | 28 | 1 | 1 |
getVirtualCostlyElementsLogs(Leaf, String, String) |  | 0% |  | 0% | 4 | 4 | 18 | 18 | 1 | 1 |
optimizeNextLeafAndUpdate(NetworkActionCombination, boolean, Network) |  | 0% |  | 0% | 5 | 5 | 22 | 22 | 1 | 1 |
getSensitivityComputerForEvaluation(boolean) |  | 0% |  | 0% | 6 | 6 | 17 | 17 | 1 | 1 |
optimizeOneLeaf(AbstractNetworkPool, NetworkActionCombination, AtomicInteger) |  | 0% |  | 0% | 4 | 4 | 16 | 16 | 1 | 1 |
updateOptimalLeafWithNextDepthBestLeaf(AbstractNetworkPool) |  | 0% |  | 0% | 3 | 3 | 18 | 18 | 1 | 1 |
logVirtualCostDetails(Leaf, String, String) |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
updateOptimalLeaf(Leaf, NetworkActionCombination) |  | 0% |  | 0% | 8 | 8 | 12 | 12 | 1 | 1 |
improvedEnough(Leaf) |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
deterministicNetworkActionCombinationComparison(NetworkActionCombination, NetworkActionCombination) |  | 0% |  | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
createChildLeaf(Network, NetworkActionCombination, boolean) |  | 0% |  | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
costSatisfiesStopCriterion(double) |  | 0% |  | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
optimizeLeaf(Leaf) |  | 0% |  | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
SearchTree(SearchTreeInput, SearchTreeParameters, boolean) |  | 0% |  | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
stopCriterionReached(Leaf) |  | 0% |  | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
getPreviousDepthAppliedRemedialActionsBeforeNewLeafEvaluation(RangeActionActivationResult) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
logOptimizationSummary(Leaf) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
initLeaves(SearchTreeInput) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
lambda$getPreviousDepthAppliedRemedialActionsBeforeNewLeafEvaluation$5(AppliedRemedialActions, Map.Entry, RangeActionActivationResult, RangeAction) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$getPreviousDepthAppliedRemedialActionsBeforeNewLeafEvaluation$4(Map.Entry) |  | 0% |  | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
logVirtualCostInformation(Leaf, String) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
lambda$optimizeOneLeaf$3(Network, RangeAction) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
compareIsPreDefined(NetworkActionCombination, NetworkActionCombination) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$logVirtualCostInformation$7(Leaf, String) |  | 0% |  | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
lambda$optimizeOneLeaf$2(Network, RangeAction) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
compareSize(NetworkActionCombination, NetworkActionCombination) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
printNetworkActions(Set) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$getPreviousDepthAppliedRemedialActionsBeforeNewLeafEvaluation$6(AppliedRemedialActions, RangeActionActivationResult, Map.Entry) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
makeLeaf(OptimizationPerimeter, Network, PrePerimeterResult, AppliedRemedialActions) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
makeOpenRaoNetworkPool(Network, int) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$updateOptimalLeafWithNextDepthBestLeaf$1(AbstractNetworkPool, AtomicInteger, NetworkActionCombination) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
compareIsDetectedDuringRao(NetworkActionCombination, NetworkActionCombination) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$logVirtualCostDetails$9(OpenRaoLogger, String) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$logVirtualCostInformation$8(Leaf, String, String) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
lambda$updateOptimalLeafWithNextDepthBestLeaf$0(AbstractNetworkPool, NetworkActionCombination, AtomicInteger) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |