for (int w = 0; w < incls.length; w++) { String pattern = incls[w].replace('/', File.separatorChar) .replace('\\', File.separatorChar); if (pattern.endsWith(File.separator)) { pattern += "**"; } includePatterns.add(pattern); }
for (int w = 0; w < excls.length; w++) { String pattern = excls[w] .replace('/', File.separatorChar) .replace('\\', File.separatorChar); if (pattern.endsWith(File.separator)) { pattern += "**"; } excludePatterns.add(pattern); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Expand.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Expand.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (int w = 0; w < incls.length; w++) {
1
for (int w = 0; w < excls.length; w++) {
2
                    String pattern = incls[w]
2
                        String pattern = excls[w]
3
.replace('/', File.separatorChar)
3
                            .replace('/', File.separatorChar)
4
                        .replace('\\', File.separatorChar);
4
                            .replace('\\', File.separatorChar);
5
                    if (pattern.endsWith(File.separator)) {
5
                        if (pattern.endsWith(File.separator)) {
6
                        pattern += "**";
6
                            pattern += "**";
7
                    }
7
                    
8
    }
8
                    includePatterns.add(pattern);
9
                        excludePatterns.add(pattern);
9
                }
10
                    }
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