Source file "org/apache/fop/layoutmgr/BreakingAlgorithm.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,763 of 1,763 | 0% | 232 of 232 | 0% | 158 | 158 | 339 | 339 | 42 | 42 |
| considerLegalBreak(KnuthElement, int) | | 0% | | 0% | 14 | 14 | 29 | 29 | 1 | 1 |
| findBreakingPoints(KnuthSequence, int, double, boolean, int) | | 0% | | 0% | 14 | 14 | 37 | 37 | 1 | 1 |
| forceNode(BreakingAlgorithm.KnuthNode, int, int, int, double, double, int, int, int) | | 0% | | 0% | 14 | 14 | 26 | 26 | 1 | 1 |
| computeDemerits(BreakingAlgorithm.KnuthNode, KnuthElement, int, double) | | 0% | | 0% | 15 | 15 | 28 | 28 | 1 | 1 |
| addBreaks(int, int) | | 0% | | 0% | 11 | 11 | 24 | 24 | 1 | 1 |
| recoverFromOverflow() | | 0% | | 0% | 8 | 8 | 22 | 22 | 1 | 1 |
| removeNode(int, BreakingAlgorithm.KnuthNode) | | 0% | | 0% | 7 | 7 | 18 | 18 | 1 | 1 |
| restartFrom(BreakingAlgorithm.KnuthNode, int) | | 0% | | 0% | 4 | 4 | 15 | 15 | 1 | 1 |
| addNode(int, BreakingAlgorithm.KnuthNode) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| BreakingAlgorithm(int, int, boolean, boolean, int) | | 0% | n/a | 1 | 1 | 18 | 18 | 1 | 1 | |
| recoverFromTooLong(BreakingAlgorithm.KnuthNode) | | 0% | | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| activateNode(BreakingAlgorithm.KnuthNode, int, double, double, int, int, int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| toString(String) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| handleElementAt(int, boolean, int) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| computeAdjustmentRatio(BreakingAlgorithm.KnuthNode, int) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| createNode(int, int, int, int, int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| handleGlueAt(KnuthGlue, int, boolean, int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| finish() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| initialize() | | 0% | n/a | 1 | 1 | 9 | 9 | 1 | 1 | |
| deactivateNode(BreakingAlgorithm.KnuthNode, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| compareNodes(BreakingAlgorithm.KnuthNode, BreakingAlgorithm.KnuthNode) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| handlePenaltyAt(KnuthPenalty, int, int) | | 0% | | 0% | 6 | 6 | 3 | 3 | 1 | 1 |
| computeDifference(BreakingAlgorithm.KnuthNode, KnuthElement, int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| calculateBreakPoints(BreakingAlgorithm.KnuthNode, KnuthSequence, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| createNode(int, int, int, int, int, int, double, int, int, int, double, BreakingAlgorithm.KnuthNode) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| replaceLastDeactivated() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getLineWidth(int) | | 0% | | 0% | 3 | 3 | 2 | 2 | 1 | 1 |
| elementCanEndLine(KnuthElement, int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| findBreakingPoints(KnuthSequence, double, boolean, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| handleBox(KnuthBox) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| getNode(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getElement(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| setConstantLineWidth(int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| handleIpdChange() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| isPartOverflowRecoveryActivated() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getLastTooShort() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getLineWidth() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getAlignment() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getAlignmentLast() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getMaxRecoveryAttempts() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| getIPDdifference() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |