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: 14 | Number of AST nodes: 14 | |||
1 | if (w == LengthConstraintType.FIXED) {↵ | 1 | if (w == LengthConstraintType.FIXED) {↵ | |
2 | if (h == LengthConstraintType.NONE) {↵ | 2 | if (h == LengthConstraintType.NONE) {↵ | |
3 | throw new RuntimeException("Not implemented."↵ | 3 | // find optimum height↵ | |
4 | ); ↵ | 4 | return arrangeFN(container, g2, constraint); ↵ | |
5 | }↵ | 5 | }↵ | |
6 | else if (h == LengthConstraintType.FIXED) {↵ | 6 | else if (h == LengthConstraintType.FIXED) {↵ | |
7 | return arrangeFF(container, g2, constraint); ↵ | 7 | return arrangeFF(container, g2, constraint);↵ | |
8 | }↵ | 8 | }↵ | |
9 | else if (h == LengthConstraintType.RANGE) {↵ | 9 | else if (h == LengthConstraintType.RANGE) {↵ | |
10 | throw new RuntimeException("Not implemented."↵ | 10 | // find optimum height and map to range↵ | |
11 | ); ↵ | 11 | return arrangeFR(container, g2, constraint); ↵ | |
12 | }↵ | 12 | }↵ | |
13 | }↵ | 13 | }↵ | |
14 | else if (w == LengthConstraintType.RANGE) {↵ | 14 | else if (w == LengthConstraintType.RANGE) {↵ | |
15 | // find optimum width and map to range↵ | |||
15 | if (h == LengthConstraintType.NONE) {↵ | 16 | if (h == LengthConstraintType.NONE) {↵ | |
17 | // find optimum height↵ | |||
16 | throw new RuntimeException("Not implemented."); ↵ | 18 | throw new RuntimeException("Not yet implemented."); ↵ | |
17 | }↵ | 19 | }↵ | |
18 | else if (h == LengthConstraintType.FIXED) {↵ | 20 | else if (h == LengthConstraintType.FIXED) {↵ | |
19 | return arrangeRF(container, g2, constraint↵ | 21 | // fixed width↵ | |
20 | ); ↵ | 22 | throw new RuntimeException("Not yet implemented."); ↵ | |
21 | }↵ | 23 | }↵ | |
22 | else if (h == LengthConstraintType.RANGE) {↵ | 24 | else if (h == LengthConstraintType.RANGE) {↵ | |
23 | return arrangeRR(container, g2, constraint); ↵ | 25 | throw new RuntimeException("Not yet implemented."); ↵ | |
24 | }↵ | 26 | }↵ | |
25 | } | 27 |
| |
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) | 2.5 |
Clones location | Clones are in different classes |
Number of node comparisons | 85 |
Number of mapped statements | 12 |
Number of unmapped statements in the first code fragment | 2 |
Number of unmapped statements in the second code fragment | 2 |
Time elapsed for statement mapping (ms) | 3.9 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
10 | else if (w == LengthConstraintType.FIXED) |
| 17 | else if (w == LengthConstraintType.RANGE) | |||||||||||
11 | if (h == LengthConstraintType.NONE) | 18 | if (h == LengthConstraintType.NONE) | ||||||||||||
12 | throw new RuntimeException("Not implemented."); |
| 19 | throw new RuntimeException("Not yet implemented."); | |||||||||||
13 | else if (h == LengthConstraintType.FIXED) | 20 | else if (h == LengthConstraintType.FIXED) | ||||||||||||
14 | return arrangeFF(container, g2, constraint); |
| | ||||||||||||
|
| 21 | 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."); | |||||||||||
17 | else if (w == LengthConstraintType.RANGE) |
| 10 | else if (w == LengthConstraintType.FIXED) | |||||||||||
18 | if (h == LengthConstraintType.NONE) | 11 | if (h == LengthConstraintType.NONE) | ||||||||||||
|
| 12 | return arrangeFN(container, g2, constraint); | ||||||||||||
19 | throw new RuntimeException("Not implemented."); |
| | ||||||||||||
20 | else if (h == LengthConstraintType.FIXED) | 13 | else if (h == LengthConstraintType.FIXED) | ||||||||||||
21 | return arrangeRF(container, g2, constraint); |
| 14 | return arrangeFF(container, g2, constraint); | |||||||||||
22 | else if (h == LengthConstraintType.RANGE) | 15 | else if (h == LengthConstraintType.RANGE) | ||||||||||||
23 | return arrangeRR(container, g2, constraint); |
| 16 | return arrangeFR(container, g2, constraint); |
Row | Violation |
---|---|
1 | Unmatched return arrangeFF(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."); |
4 | Unmatched statement return arrangeFN(container,g2,constraint); 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 |
5 | Unmatched return arrangeFN(container,g2,constraint); |
6 | 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 |
7 | Unmatched throw new RuntimeException("Not implemented."); |
8 | Expression arrangeFR(container,g2,constraint) is a method call throwing exception(s) that should be caught by a try block that will be extracted |
9 | Not all possible execution flows end in a return statement |