File path: /jfreechart-1.0.10/src/org/jfree/chart/block/CenterArrangement.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.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 | throw new RuntimeException("Not implemented."); ↵ | 6 | throw new RuntimeException("Not implemented."); ↵ | |
7 | }↵ | 7 | }↵ | |
8 | else if (h == LengthConstraintType.RANGE) {↵ | 8 | else if (h == LengthConstraintType.RANGE) {↵ | |
9 | throw new RuntimeException("Not implemented."); ↵ | 9 | throw new RuntimeException("Not implemented."); ↵ | |
10 | }↵ | 10 | }↵ | |
11 | }↵ | 11 | }↵ | |
12 | else if (w == LengthConstraintType.FIXED) {↵ | 12 | else if (w == LengthConstraintType.FIXED) {↵ | |
13 | if (h == LengthConstraintType.NONE) {↵ | 13 | if (h == LengthConstraintType.NONE) {↵ | |
14 | return arrangeFN(container, g2, constraint); ↵ | 14 | throw new RuntimeException("Not implemented."); ↵ | |
15 | }↵ | 15 | }↵ | |
16 | else if (h == LengthConstraintType.FIXED) {↵ | 16 | else if (h == LengthConstraintType.FIXED) {↵ | |
17 | throw new RuntimeException("Not implemented."); ↵ | 17 | return arrangeFF(container, g2, constraint); ↵ | |
18 | }↵ | 18 | }↵ | |
19 | else if (h == LengthConstraintType.RANGE) {↵ | 19 | else if (h == LengthConstraintType.RANGE) {↵ | |
20 | throw new RuntimeException("Not implemented."); ↵ | 20 | throw new RuntimeException("Not implemented."); ↵ | |
21 | }↵ | 21 | }↵ | |
22 | }↵ | 22 | }↵ | |
23 | else if (w == LengthConstraintType.RANGE) {↵ | 23 | else if (w == LengthConstraintType.RANGE) {↵ | |
24 | if (h == LengthConstraintType.NONE) {↵ | 24 | if (h == LengthConstraintType.NONE) {↵ | |
25 | return arrangeRN(container, g2, constraint); ↵ | 25 | throw new RuntimeException("Not implemented."); ↵ | |
26 | }↵ | 26 | }↵ | |
27 | else if (h == LengthConstraintType.FIXED) {↵ | 27 | else if (h == LengthConstraintType.FIXED) {↵ | |
28 | return arrangeRF(container, g2, constraint); ↵ | 28 | return arrangeRF(container, g2, constraint); ↵ | |
29 | }↵ | 29 | }↵ | |
30 | else if (h == LengthConstraintType.RANGE) {↵ | 30 | else if (h == LengthConstraintType.RANGE) {↵ | |
31 | return arrangeRR(container, g2, constraint); ↵ | 31 | return arrangeRR(container, g2, constraint); ↵ | |
32 | }↵ | 32 | }↵ | |
33 | } | 33 |
| |
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) | 7.7 |
Clones location | Clones are in different classes |
Number of node comparisons | 171 |
Number of mapped statements | 20 |
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) | 82.5 |
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 implemented."); | |||||||||||
8 | else if (h == LengthConstraintType.RANGE) | 8 | else if (h == LengthConstraintType.RANGE) | |||||||||||
9 | throw new RuntimeException("Not implemented."); | 9 | throw new RuntimeException("Not implemented."); | |||||||||||
10 | else if (w == LengthConstraintType.FIXED) | 10 | else if (w == LengthConstraintType.FIXED) | |||||||||||
11 | if (h == LengthConstraintType.NONE) |
| 13 | if (h == LengthConstraintType.FIXED) | ||||||||||
12 | return arrangeFN(container, g2, constraint); |
| 14 | return arrangeFF(container, g2, constraint); | ||||||||||
13 | else if (h == LengthConstraintType.FIXED) |
| 11 | else if (h == LengthConstraintType.NONE) | ||||||||||
14 | throw new RuntimeException("Not implemented."); | 12 | throw new RuntimeException("Not implemented."); | |||||||||||
15 | else if (h == LengthConstraintType.RANGE) | 15 | else if (h == LengthConstraintType.RANGE) | |||||||||||
16 | throw new RuntimeException("Not implemented."); | 16 | throw new RuntimeException("Not implemented."); | |||||||||||
17 | else if (w == LengthConstraintType.RANGE) | 17 | else if (w == LengthConstraintType.RANGE) | |||||||||||
18 | if (h == LengthConstraintType.NONE) |
| 20 | if (h == LengthConstraintType.FIXED) | ||||||||||
19 | return arrangeRN(container, g2, constraint); |
| 21 | return arrangeRF(container, g2, constraint); | ||||||||||
20 | else if (h == LengthConstraintType.FIXED) |
| 22 | else if (h == LengthConstraintType.RANGE) | ||||||||||
21 | return arrangeRF(container, g2, constraint); |
| 23 | return arrangeRR(container, g2, constraint); | ||||||||||
22 | if (h == LengthConstraintType.RANGE) |
| 18 | if (h == LengthConstraintType.NONE) | ||||||||||
|
| 19 | throw new RuntimeException("Not implemented."); | |||||||||||
23 | return arrangeRR(container, g2, constraint); |
| |
Row | Violation |
---|---|
1 | Unmatched throw new RuntimeException("Not implemented."); |
2 | Unmatched return arrangeRR(container,g2,constraint); |