Size2D s = arrangeNN(g2);
if (widthRange.contains(s.getWidth())) {
return s;
}
double ww = widthRange.constrain(s.getWidth());
return arrangeFN(g2, ww);
Size2D s = arrangeNN(g2);
if (widthRange.contains(s.getWidth())) {
return s;
}
double ww = widthRange.constrain(s.getWidth());
return arrangeFN(g2, ww);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/title/ShortTextTitle.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/chart/title/TextTitle.java
|
Method name: Size2D arrangeRN(Graphics2D, Range)
|
|
Method name: Size2D arrangeRN(Graphics2D, Range)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | Size2D s = arrangeNN(g2);↵ | | 1 | Size2D s = arrangeNN(g2);↵
|
2 | if (widthRange.contains(s.getWidth())) {↵ | | 2 | if (widthRange.contains(s.getWidth())) {↵
|
3 | return s;↵ | | 3 | return s;↵
|
4 | }↵ | | 4 | }↵
|
5 | double ww = widthRange.constrain(s.getWidth());↵ | | 5 | double ww = widthRange.constrain(s.getWidth());↵
|
6 | return arrangeFN(g2, ww); | | 6 | return arrangeFN(g2, ww);
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 13 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
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) | 1.4 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | Size2D s = arrangeNN(g2); | | 1 | Size2D s = arrangeNN(g2); |
2 | if (widthRange.contains(s.getWidth())) | | 2 | if (widthRange.contains(s.getWidth())) |
3 | | | 3 | |
4 | double ww = widthRange.constrain(s.getWidth()); | | 4 | double ww = widthRange.constrain(s.getWidth()); |
5 | return arrangeFN(g2, ww); | | 5 | return arrangeFN(g2, ww); |
Precondition Violations (0)
Row |
Violation |