File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.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 | throw new RuntimeException("Not implemented."); ↵ | 2 | return arrangeNN(container, g2); ↵ | |
3 | }↵ | 3 | }↵ | |
4 | else if (h == LengthConstraintType.FIXED) {↵ | 4 | else if (h == LengthConstraintType.FIXED) {↵ | |
5 | return arrangeFF(container, g2, constraint↵ | 5 | ↵ | |
6 | ); ↵ | 6 | throw new RuntimeException("Not yet implemented."); ↵ | |
7 | }↵ | 7 | }↵ | |
8 | else if (h == LengthConstraintType.RANGE) {↵ | 8 | else if (h == LengthConstraintType.RANGE) {↵ | |
9 | // find optimum height, then map to range↵ | |||
9 | throw new RuntimeException("Not implemented."); ↵ | 10 | throw new RuntimeException("Not yet implemented."); ↵ | |
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.7 |
Clones location | Clones are in different classes |
Number of node comparisons | 28 |
Number of mapped statements | 6 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 510.5 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
11 | if (h == LengthConstraintType.NONE) |
| 6 | if (h == LengthConstraintType.FIXED) | |||||||||||||
12 | throw new RuntimeException("Not implemented."); |
| 7 | throw new RuntimeException("Not yet implemented."); | |||||||||||||
13 | else if (h == LengthConstraintType.FIXED) |
| 4 | else if (h == LengthConstraintType.NONE) | |||||||||||||
14 | return arrangeFF(container, g2, constraint); |
| 5 | return arrangeNN(container, g2); | |||||||||||||
15 | else if (h == LengthConstraintType.RANGE) | 8 | else if (h == LengthConstraintType.RANGE) | ||||||||||||||
16 | throw new RuntimeException("Not implemented."); |
| 9 | throw new RuntimeException("Not yet implemented."); |
Row | Violation |
---|---|
1 | Not all possible execution flows end in a return statement |