for (; same < minLength; same++) { if (!fromPathStack[same].equals(toPathStack[same])) { break; } }
for (int i = 0; i < delims.length; ++i) { if (delims[i] == ch) { return true; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/FileUtils.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/StringTokenizer.java
Method name: String getRelativePath(File, File) Method name: boolean isDelim(char)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (; same < minLength; same++) {
1
for (int i = 0; i < delims.length; ++i) {
2
            if (!fromPathStack[same].equals(toPathStack[same])) {
2
            if (delims[i] == ch) {
3
                break;
3
                return true;
4
            }
4
            }
5
        }
5
        }
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