File path: /jfreechart-1.0.10/src/org/jfree/chart/block/CenterArrangement.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: 21 | Number of AST nodes: 21 | |||
1 | if (w == LengthConstraintType.NONE) {↵ | 1 | if (w == LengthConstraintType.NONE) {↵ | |
2 | if (h == LengthConstraintType.NONE) {↵ | 2 | if (h == LengthConstraintType.NONE) {↵ | |
3 | return arrangeNN(container, g2); ↵ | 3 | return arrangeNN(container, g2); ↵ | |
4 | }↵ | 4 | }↵ | |
5 | else if (h == LengthConstraintType.FIXED) {↵ | 5 | else if (h == LengthConstraintType.FIXED) {↵ | |
6 | ↵ | |||
6 | throw new RuntimeException("Not implemented."); ↵ | 7 | throw new RuntimeException("Not yet implemented."); ↵ | |
7 | }↵ | 8 | }↵ | |
8 | else if (h == LengthConstraintType.RANGE) {↵ | 9 | else if (h == LengthConstraintType.RANGE) {↵ | |
10 | // find optimum height, then map to range↵ | |||
9 | throw new RuntimeException("Not implemented."); ↵ | 11 | throw new RuntimeException("Not yet implemented."); ↵ | |
10 | }↵ | 12 | }↵ | |
11 | }↵ | 13 | }↵ | |
12 | else if (w == LengthConstraintType.FIXED) {↵ | 14 | else if (w == LengthConstraintType.FIXED) {↵ | |
13 | if (h == LengthConstraintType.NONE) {↵ | 15 | if (h == LengthConstraintType.NONE) {↵ | |
16 | // find optimum height↵ | |||
14 | return arrangeFN(container, g2, constraint); ↵ | 17 | return arrangeFN(container, g2, constraint); ↵ | |
15 | }↵ | 18 | }↵ | |
16 | else if (h == LengthConstraintType.FIXED) {↵ | 19 | else if (h == LengthConstraintType.FIXED) {↵ | |
17 | throw new RuntimeException("Not implemented."); ↵ | 20 | return arrangeFF(container, g2, constraint);↵ | |
18 | }↵ | 21 | }↵ | |
19 | else if (h == LengthConstraintType.RANGE) {↵ | 22 | else if (h == LengthConstraintType.RANGE) {↵ | |
20 | throw new RuntimeException("Not implemented."↵ | 23 | // find optimum height and map to range↵ | |
21 | ); ↵ | 24 | return arrangeFR(container, g2, constraint); ↵ | |
22 | }↵ | 25 | }↵ | |
23 | }↵ | 26 | }↵ | |
24 | else if (w == LengthConstraintType.RANGE) {↵ | 27 | else if (w == LengthConstraintType.RANGE) {↵ | |
28 | // find optimum width and map to range↵ | |||
25 | if (h == LengthConstraintType.NONE) {↵ | 29 | if (h == LengthConstraintType.NONE) {↵ | |
26 | return arrangeRN(container, g2, constraint↵ | 30 | // find optimum height↵ | |
27 | ); ↵ | 31 | throw new RuntimeException("Not yet implemented."); ↵ | |
28 | }↵ | 32 | }↵ | |
29 | else if (h == LengthConstraintType.FIXED) {↵ | 33 | else if (h == LengthConstraintType.FIXED) {↵ | |
30 | return arrangeRF(container, g2, constraint↵ | 34 | // fixed width↵ | |
31 | ); ↵ | 35 | throw new RuntimeException("Not yet implemented."); ↵ | |
32 | }↵ | 36 | }↵ | |
33 | else if (h == LengthConstraintType.RANGE) {↵ | 37 | else if (h == LengthConstraintType.RANGE) {↵ | |
34 | return arrangeRR(container, g2, constraint); ↵ | 38 | throw new RuntimeException("Not yet implemented."); ↵ | |
35 | }↵ | 39 | }↵ | |
36 | } | 40 |
| |
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) | 5.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 171 |
Number of mapped statements | 16 |
Number of unmapped statements in the first code fragment | 5 |
Number of unmapped statements in the second code fragment | 5 |
Time elapsed for statement mapping (ms) | 5.0 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3 | if (w == LengthConstraintType.NONE) | 3 | if (w == LengthConstraintType.NONE) | |||||||||||
4 | if (h == LengthConstraintType.NONE) | 4 | if (h == LengthConstraintType.NONE) | |||||||||||
5 | return arrangeNN(container, g2); | 5 | return arrangeNN(container, g2); | |||||||||||
6 | else if (h == LengthConstraintType.FIXED) | 6 | else if (h == LengthConstraintType.FIXED) | |||||||||||
7 | throw new RuntimeException("Not implemented."); |
| 7 | throw new RuntimeException("Not yet implemented."); | ||||||||||
8 | else if (h == LengthConstraintType.RANGE) | 8 | else if (h == LengthConstraintType.RANGE) | |||||||||||
9 | throw new RuntimeException("Not implemented."); |
| 9 | throw new RuntimeException("Not yet implemented."); | ||||||||||
10 | else if (w == LengthConstraintType.FIXED) | 10 | else if (w == LengthConstraintType.FIXED) | |||||||||||
11 | if (h == LengthConstraintType.NONE) | 11 | if (h == LengthConstraintType.NONE) | |||||||||||
12 | return arrangeFN(container, g2, constraint); | 12 | return arrangeFN(container, g2, constraint); | |||||||||||
13 | else if (h == LengthConstraintType.FIXED) | 13 | else if (h == LengthConstraintType.FIXED) | |||||||||||
|
| 14 | return arrangeFF(container, g2, constraint); | |||||||||||
14 | throw new RuntimeException("Not implemented."); |
| | |||||||||||
15 | else if (h == LengthConstraintType.RANGE) | 15 | else if (h == LengthConstraintType.RANGE) | |||||||||||
|
| 16 | return arrangeFR(container, g2, constraint); | |||||||||||
16 | throw new RuntimeException("Not implemented."); |
| | |||||||||||
17 | else if (w == LengthConstraintType.RANGE) | 17 | else if (w == LengthConstraintType.RANGE) | |||||||||||
18 | if (h == LengthConstraintType.NONE) | 18 | if (h == LengthConstraintType.NONE) | |||||||||||
|
| 19 | throw new RuntimeException("Not yet implemented."); | |||||||||||
19 | return arrangeRN(container, g2, constraint); |
| | |||||||||||
20 | else if (h == LengthConstraintType.FIXED) | 20 | else if (h == LengthConstraintType.FIXED) | |||||||||||
|
| 21 | throw new RuntimeException("Not yet implemented."); | |||||||||||
21 | return arrangeRF(container, g2, constraint); |
| | |||||||||||
22 | else if (h == LengthConstraintType.RANGE) | 22 | else if (h == LengthConstraintType.RANGE) | |||||||||||
|
| 23 | throw new RuntimeException("Not yet implemented."); | |||||||||||
23 | return arrangeRR(container, g2, constraint); |
| |
Row | Violation |
---|---|
1 | Unmatched return arrangeFF(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 | Unmatched statement return arrangeFR(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 arrangeFR(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 | 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 |
9 | Unmatched throw new RuntimeException("Not yet implemented."); |
10 | Unmatched return arrangeRN(container,g2,constraint); |
11 | 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 |
12 | Unmatched throw new RuntimeException("Not yet implemented."); |
13 | Unmatched return arrangeRF(container,g2,constraint); |
14 | 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 |
15 | Unmatched throw new RuntimeException("Not yet implemented."); |
16 | Unmatched return arrangeRR(container,g2,constraint); |
17 | Not all possible execution flows end in a return statement |