File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/block/FlowArrangement.java | |||
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
|||
Number of AST nodes: 7 | Number of AST nodes: 6 | |||
1 | if (w == LengthConstraintType.RANGE) {↵ | |||
2 | if (h == LengthConstraintType.NONE) {↵ | 1 | if (h == LengthConstraintType.NONE) {↵ | |
3 | throw new RuntimeException("Not implemented."); ↵ | 2 | return arrangeRN(container, g2, constraint); ↵ | |
4 | }↵ | 3 | }↵ | |
5 | else if (h == LengthConstraintType.FIXED) {↵ | 4 | else if (h == LengthConstraintType.FIXED) {↵ | |
6 | return arrangeRF(container, g2, constraint); ↵ | 5 | return arrangeRF(container, g2, constraint); ↵ | |
7 | }↵ | 6 | }↵ | |
8 | else if (h == LengthConstraintType.RANGE) {↵ | 7 | else if (h == LengthConstraintType.RANGE) {↵ | |
9 | return arrangeRR(container, g2, constraint); ↵ | 8 | return arrangeRR(container, g2, constraint); ↵ | |
10 | }↵ | 9 |
| |
11 | } | |||
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.7 |
Clones location | Clones are in different classes |
Number of node comparisons | 28 |
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 1.8 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||
---|---|---|---|---|---|---|---|---|
18 | if (h == LengthConstraintType.NONE) | 18 | if (h == LengthConstraintType.NONE) | |||||
|
| 19 | return arrangeRN(container, g2, constraint); | |||||
19 | throw new RuntimeException("Not implemented."); |
| | |||||
20 | else if (h == LengthConstraintType.FIXED) | 20 | else if (h == LengthConstraintType.FIXED) | |||||
21 | return arrangeRF(container, g2, constraint); | 21 | return arrangeRF(container, g2, constraint); | |||||
22 | else if (h == LengthConstraintType.RANGE) | 22 | else if (h == LengthConstraintType.RANGE) | |||||
23 | return arrangeRR(container, g2, constraint); | 23 | return arrangeRR(container, g2, constraint); |
Row | Violation |
---|---|
1 | Unmatched return arrangeRN(container,g2,constraint); |
2 | Unmatched statement throw new RuntimeException("Not implemented."); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted |
3 | Unmatched throw new RuntimeException("Not implemented."); |
4 | Not all possible execution flows end in a return statement |