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;
}
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;
e.printStackTrace();
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/junit/StackedBarChartTests.java
|
|
File path: /jfreechart-1.0.10/tests/org/jfree/chart/junit/XYStepChartTests.java
|
Method name: void testDrawWithNullInfo()
|
|
Method name: void testDrawWithNullInfo()
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | try {↵ | | 1 | try {↵
|
2 | BufferedImage image = new BufferedImage(200 , 100, ↵ | | 2 | BufferedImage image = new BufferedImage(200 , 100, ↵
|
3 | BufferedImage.TYPE_INT_RGB);↵ | | 3 | 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, ↵ | | 5 | this.chart.draw(g2, new Rectangle2D.Double(0, 0, 200, 100), null, ↵
|
6 | null);↵ | | 6 | null);↵
|
7 | g2.dispose();↵ | | 7 | g2.dispose();↵
|
8 | success = true;↵ | | 8 | success = true;↵
|
9 | }↵ | | 9 | }↵
|
10 | catch (Exception e) {↵ | | 10 | catch (Exception e) {↵
|
11 | success = false;↵ | | 11 | success = false;↵
|
| | | 12 | e.printStackTrace();↵
|
12 | } | | 13 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
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 | 1 |