File path: /jfreechart-1.0.10/src/org/jfree/chart/block/CenterArrangement.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/title/PaintScaleLegend.java | |||
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
Method name: Size2D arrange(Graphics2D, RectangleConstraint)
|
|||
Number of AST nodes: 6 | Number of AST nodes: 7 | |||
1 | if (w == LengthConstraintType.FIXED) {↵ | |||
1 | if (h == LengthConstraintType.NONE) {↵ | 2 | if (h == LengthConstraintType.NONE) {↵ | |
2 | return arrangeFN(container, g2, constraint); ↵ | 3 | throw new RuntimeException("Not yet implemented."); ↵ | |
3 | }↵ | 4 | }↵ | |
4 | else if (h == LengthConstraintType.FIXED) {↵ | 5 | else if (h == LengthConstraintType.RANGE) {↵ | |
5 | throw new RuntimeException("Not implemented."); ↵ | 6 | throw new RuntimeException("Not yet implemented."); ↵ | |
6 | }↵ | 7 | }↵ | |
7 | else if (h == LengthConstraintType.RANGE) {↵ | 8 | else if (h == LengthConstraintType.FIXED) {↵ | |
8 | throw new RuntimeException("Not implemented."); ↵ | 9 | throw new RuntimeException("Not yet implemented.");↵ | |
9 | ↵ | 10 | }↵ | |
10 | } | 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.8 |
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.3 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
11 | if (h == LengthConstraintType.NONE) | 20 | if (h == LengthConstraintType.NONE) | |||||||||||
12 | return arrangeFN(container, g2, constraint); |
| | |||||||||||
|
| 21 | throw new RuntimeException("Not yet implemented."); | |||||||||||
13 | else if (h == LengthConstraintType.FIXED) | 24 | else if (h == LengthConstraintType.FIXED) | |||||||||||
14 | throw new RuntimeException("Not implemented."); |
| 25 | throw new RuntimeException("Not yet implemented."); | ||||||||||
15 | else if (h == LengthConstraintType.RANGE) | 22 | else if (h == LengthConstraintType.RANGE) | |||||||||||
16 | throw new RuntimeException("Not implemented."); |
| 23 | throw new RuntimeException("Not yet implemented."); |
Row | Violation |
---|---|
1 | Unmatched return arrangeFN(container,g2,constraint); |
2 | Unmatched statement throw new RuntimeException("Not yet 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 yet implemented."); |