for (int i = 0; i < str.length(); ++i) { char ch = str.charAt(i); if (ch == fromChar) { buf.append(toString); } else { buf.append(ch); } }
for (int i=0;i<files.length;i++) { File f = files[i]; if (!f.isDirectory()) { collect.addElement(f); } else { getFiles(f, collect); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Javadoc.java File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/XmlPropertyTest.java
Method name: String replace(String, char, String) Method name: void getFiles(File, Vector)
Number of AST nodes: 5 Number of AST nodes: 5
1
for (int i = 0; i < str.length(); ++i) {
1
for (int i=0;i<files.length;i++) {
2
            char ch = str.charAt(i);
2
            File f = files[i];
3
            if (ch == fromChar) {
3
            if (!f.isDirectory()) {
4
                buf.append(toString);
4
                collect.addElement(f);
5
            } else {
5
            } else {
6
                buf.append(ch);
6
                getFiles(f, collect);
7
            }
7
            }
8
        }
8
        }
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.1
Clones locationClones are in different classes
Number of node comparisons1