if (w == LengthConstraintType.RANGE) {
if (h == LengthConstraintType.NONE) {
return arrangeRN(container, g2, constraint);
}
else if (h == LengthConstraintType.FIXED) {
return arrangeRF(container, g2, constraint);
}
else if (h == LengthConstraintType.RANGE) {
return arrangeRR(container, g2, constraint);
}
}
if (w == LengthConstraintType.RANGE) {
if (h == LengthConstraintType.NONE) {
return arrangeRN(container, g2, constraint);
}
else if (h == LengthConstraintType.FIXED) {
return arrangeRF(container, g2, constraint);
}
else if (h == LengthConstraintType.RANGE) {
return arrangeRR(container, g2, constraint);
}
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/block/CenterArrangement.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/block/FlowArrangement.java
|
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
|
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
Number of AST nodes: 7
|
|
Number of AST nodes: 7
|
|
1 | if (w == LengthConstraintType.RANGE) {↵ | | 1 | if (w == LengthConstraintType.RANGE) {↵
|
2 | if (h == LengthConstraintType.NONE) {↵ | | 2 | if (h == LengthConstraintType.NONE) {↵
|
3 | return arrangeRN(container, g2, constraint); ↵ | | 3 | return arrangeRN(container, g2, constraint); ↵
|
4 | }↵ | | 4 | }↵
|
5 | else if (h == LengthConstraintType.FIXED) {↵ | | 5 | else if (h == LengthConstraintType.FIXED) {↵
|
6 | return arrangeRF(container, g2, constraint); ↵ | | 6 | return arrangeRF(container, g2, constraint); ↵
|
7 | }↵ | | 7 | }↵
|
8 | else if (h == LengthConstraintType.RANGE) {↵ | | 8 | else if (h == LengthConstraintType.RANGE) {↵
|
9 | return arrangeRR(container, g2, constraint); ↵ | | 9 | return arrangeRR(container, g2, constraint); ↵
|
10 | }↵ | | 10 | }↵
|
11 | } | | 11 | }
|
See real code fragment |
|
See real code fragment |
Summary
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 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 7 |
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) | 2.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
17 | else if (w == LengthConstraintType.RANGE) | | 17 | else if (w == LengthConstraintType.RANGE) |
18 | if (h == LengthConstraintType.NONE) | | 18 | if (h == LengthConstraintType.NONE) |
19 | return arrangeRN(container, g2, constraint); | | 19 | return arrangeRN(container, g2, constraint); |
20 | else if (h == LengthConstraintType.FIXED) | | 20 | else if (h == LengthConstraintType.FIXED) |
21 | return arrangeRF(container, g2, constraint); | | 21 | return arrangeRF(container, g2, constraint); |
22 | else if (h == LengthConstraintType.RANGE) | | 22 | else if (h == LengthConstraintType.RANGE) |
23 | return arrangeRR(container, g2, constraint); | | 23 | return arrangeRR(container, g2, constraint); |
Precondition Violations (1)
Row |
Violation |
1 | Not all possible execution flows end in a return statement |