if (l != null && l.size() > 0) { for (int i = 0; i < l.size(); i++) { Number n = (Number) l.get(i); average += n.doubleValue(); count += 1; } if (count > 0) { average = average / count;
if (l != null && l.size() > 0) { for (int i = 0; i < l.size(); i++) { Number n = (Number) l.get(i); average += n.doubleValue(); count += 1; } if (count > 0) { average = average / count;
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultMultiValueCategoryDataset.java File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/DefaultMultiValueCategoryDataset.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (l != null && l.size() > 0) {
1
if (l != null && l.size() > 0) {
2
            for (int i = 0; i < l.size(); i++) {
2
            for (int i = 0; i < l.size(); i++) {
3
                Number n = (Number) l.get(i);
3
                Number n = (Number) l.get(i);
4
                average += n.doubleValue();
4
                average += n.doubleValue();
5
                count += 1;
5
                count += 1;
6
            }
6
            }
7
            if (count > 0) {
7
            if (count > 0) {
8
                average = average / count;
8
                average = average / count;
9
            
9
            
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