| findCandidateDanglingLines(Network, Predicate) |  | 0% | | 0% | 9 | 9 | 30 | 30 | 1 | 1 |
| mergeDifferentAliases(DanglingLine, DanglingLine, Map, ReportNode) | | 0% | | 0% | 7 | 7 | 19 | 19 | 1 | 1 |
| lambda$mergeProperties$2(DanglingLine, DanglingLine, Properties, ReportNode, String) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| mergeIdenticalAliases(DanglingLine, DanglingLine, Map, ReportNode) | | 0% | | 0% | 4 | 4 | 14 | 14 | 1 | 1 |
| voltageAtTheBoundaryNode(DanglingLine, DanglingLine) | | 0% | | 0% | 5 | 5 | 13 | 13 | 1 | 1 |
| associateConnectedDanglingLine(DanglingLine, List, BiConsumer) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| equivalentBranchAdmittanceMatrix(DanglingLine, DanglingLine) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| findAndAssociateDanglingLines(DanglingLine, Function, BiConsumer) | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| buildMergedName(String, String, String, String) | | 0% | | 0% | 7 | 7 | 13 | 13 | 1 | 1 |
| mergeProperties(DanglingLine, DanglingLine, Properties, ReportNode) | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| zeroImpedanceLine(LinkData.BranchAdmittanceMatrix) | | 0% | | 0% | 5 | 5 | 3 | 3 | 1 | 1 |
| lambda$findCandidateDanglingLines$9(Map, Map, Set, DanglingLine) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| buildMergedId(String, String) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| getR(DanglingLine, DanglingLine) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getX(DanglingLine, DanglingLine) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lambda$mergeDifferentAliases$7(DanglingLine, DanglingLine, String) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| getG1(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getB1(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getG2(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getB2(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getBoundaryAngle(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$getPairedDanglingLine$14(DanglingLine, TieLine) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lambda$mergeProperties$4(Properties, DanglingLine, String) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$mergeProperties$3(Properties, DanglingLine, String) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$mergeProperties$1(Properties, DanglingLine, String) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$mergeProperties$0(Properties, DanglingLine, String) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getBoundaryV(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| lambda$findAndAssociateDanglingLines$10(DanglingLine, DanglingLine) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| lambda$mergeIdenticalAliases$5(DanglingLine, DanglingLine, String) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| mergeProperties(DanglingLine, DanglingLine, Properties) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| mergeIdenticalAliases(DanglingLine, DanglingLine, Map) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getPairedDanglingLine(DanglingLine) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$findAndAssociateDanglingLines$11(DanglingLine, DanglingLine) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$mergeDifferentAliases$6(String, Map.Entry) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$associateConnectedDanglingLine$13(DanglingLine) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$findAndAssociateDanglingLines$12(DanglingLine) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$findCandidateDanglingLines$8(String) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |