File path: /jfreechart-1.0.10/src/org/jfree/chart/block/BorderArrangement.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/block/GridArrangement.java | |||
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
|||
Number of AST nodes: 6 | Number of AST nodes: 6 | |||
1 | if (h == LengthConstraintType.NONE) {↵ | 1 | if (h == LengthConstraintType.NONE) {↵ | |
2 | contentSize = arrangeNN(container, g2);↵ | 2 | return arrangeNN(container, g2); ↵ | |
3 | }↵ | 3 | }↵ | |
4 | else if (h == LengthConstraintType.FIXED) {↵ | 4 | else if (h == LengthConstraintType.FIXED) {↵ | |
5 | ↵ | |||
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.RANGE) {↵ | |
9 | // find optimum height, then map to range↵ | |||
8 | throw new RuntimeException("Not implemented.");↵ | 10 | throw new RuntimeException("Not yet implemented."); ↵ | |
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.2 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
6 | if (h == LengthConstraintType.NONE) | 4 | if (h == LengthConstraintType.NONE) | |||||||||||
|
| 5 | return arrangeNN(container, g2); | |||||||||||
7 | contentSize = arrangeNN(container, g2); |
| | |||||||||||
8 | else if (h == LengthConstraintType.FIXED) | 6 | else if (h == LengthConstraintType.FIXED) | |||||||||||
9 | throw new RuntimeException("Not implemented."); |
| 7 | throw new RuntimeException("Not yet implemented."); | ||||||||||
10 | else if (h == LengthConstraintType.RANGE) | 8 | else if (h == LengthConstraintType.RANGE) | |||||||||||
11 | throw new RuntimeException("Not implemented."); |
| 9 | throw new RuntimeException("Not yet implemented."); |
Row | Violation |
---|---|
1 | Unmatched return arrangeNN(container,g2); |
2 | Unmatched statement contentSize=arrangeNN(container,g2); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted |
3 | Unmatched statement contentSize=arrangeNN(container,g2); 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 |