hotspot = new Polygon(); hotspot.addPoint((int) ((transX0 + transX1) / 2.0), (int) transZero); hotspot.addPoint((int) ((transX0 + transX1) / 2.0), (int) ((transY0 + transY1) / 2.0)); hotspot.addPoint((int) transX1, (int) transY1); hotspot.addPoint((int) ((transX1 + transX2) / 2.0), (int) ((transY1 + transY2) / 2.0)); hotspot.addPoint((int) ((transX1 + transX2) / 2.0), (int) transZero);
hotspot = new Polygon(); hotspot.addPoint((int) ((transX0 + transX1) / 2.0), (int) transZero); hotspot.addPoint((int) ((transX0 + transX1) / 2.0), (int) ((transY0 + transY1) / 2.0)); hotspot.addPoint((int) transX1, (int) transY1); hotspot.addPoint((int) ((transX1 + transX2) / 2.0), (int) ((transY1 + transY2) / 2.0)); hotspot.addPoint((int) ((transX1 + transX2) / 2.0), (int) transZero);
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYAreaRenderer.java File path: /jfreechart-1.0.10/src/org/jfree/chart/renderer/xy/XYAreaRenderer2.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
hotspot = new Polygon();
1
hotspot = new Polygon();
2
            hotspot.addPoint((int) ((transX0 + transX1) / 2.0), 
2
            hotspot.addPoint((int) ((transX0 + transX1) / 2.0), 
3
                    (int) transZero);
3
                    (int) transZero);
4
            hotspot.addPoint((int) ((transX0 + transX1) / 2.0), 
4
            hotspot.addPoint((int) ((transX0 + transX1) / 2.0), 
5
                    (int) ((transY0 + transY1) / 2.0));
5
                    (int) ((transY0 + transY1) / 2.0));
6
            hotspot.addPoint((int) transX1, (int) transY1);
6
            hotspot.addPoint((int) transX1, (int) transY1);
7
            hotspot.addPoint((int) ((transX1 + transX2) / 2.0), 
7
            hotspot.addPoint((int) ((transX1 + transX2) / 2.0), 
8
                    (int) ((transY1 + transY2) / 2.0));
8
                    (int) ((transY1 + transY2) / 2.0));
9
            hotspot.addPoint((int) ((transX1 + transX2) / 2.0), 
9
            hotspot.addPoint((int) ((transX1 + transX2) / 2.0), 
10
                    (int) transZero);
10
                    (int) transZero);
11
        
11
        
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0