boolean success = false;
try {
BufferedImage image = new BufferedImage(200 , 100,
BufferedImage.TYPE_INT_RGB);
Graphics2D g2 = image.createGraphics();
this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null,
null);
g2.dispose();
success = true;
}
catch (Exception e) {
success = false;
}
assertTrue(success);
boolean success = false;
try {
BufferedImage image = new BufferedImage(200 , 100,
BufferedImage.TYPE_INT_RGB);
Graphics2D g2 = image.createGraphics();
this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null,
null);
g2.dispose();
success = true;
}
catch (Exception e) {
success = false;
}
assertTrue(success);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/junit/LineChartTests.java
|
|
File path: /jfreechart-1.0.10/tests/org/jfree/chart/junit/StackedBarChart3DTests.java
|
Method name: void testDrawWithNullInfo()
|
|
Method name: void testDrawWithNullInfo()
|
Number of AST nodes: 8
|
|
Number of AST nodes: 8
|
|
1 | boolean success = false;↵ | | 1 | boolean success = false;↵
|
2 | try {↵ | | 2 | try {↵
|
3 | BufferedImage image = new BufferedImage(200 , 100, ↵ | | 3 | BufferedImage image = new BufferedImage(200 , 100, ↵
|
4 | BufferedImage.TYPE_INT_RGB);↵ | | 4 | BufferedImage.TYPE_INT_RGB);↵
|
5 | Graphics2D g2 = image.createGraphics();↵ | | 5 | Graphics2D g2 = image.createGraphics();↵
|
6 | this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null, ↵ | | 6 | this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null,↵
|
7 | null);↵ | | 7 | null);↵
|
8 | g2.dispose();↵ | | 8 | g2.dispose();↵
|
9 | success = true;↵ | | 9 | success = true;↵
|
10 | }↵ | | 10 | }↵
|
11 | catch (Exception e) {↵ | | 11 | catch (Exception e) {↵
|
12 | success = false;↵ | | 12 | success = false;↵
|
13 | }↵ | | 13 | }↵
|
14 | assertTrue(success); | | 14 | assertTrue(success);
|
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.1 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 40 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 8 |
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.6 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | boolean success = false; | | 1 | boolean success = false; |
2 | try | | 2 | try |
3 | BufferedImage image = new BufferedImage(200, 100, BufferedImage.TYPE_INT_RGB); | | 3 | BufferedImage image = new BufferedImage(200, 100, BufferedImage.TYPE_INT_RGB); |
4 | Graphics2D g2 = image.createGraphics(); | | 4 | Graphics2D g2 = image.createGraphics(); |
5 | this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null, null); | | 5 | this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null, null); |
6 | | | 6 | |
7 | | | 7 | |
8 | assertTrue(success); | | 8 | assertTrue(success); |
Precondition Violations (0)
Row |
Violation |