if (includes == null) { this.includes = null; } else { this.includes = new String[includes.length]; for (int i = 0; i < includes.length; i++) { this.includes[i] = normalizePattern(includes[i]);
if (excludes == null) { this.excludes = null; } else { this.excludes = new String[excludes.length]; for (int i = 0; i < excludes.length; i++) { this.excludes[i] = normalizePattern(excludes[i]);
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (includes == null) {
1
if (excludes == null) {
2
            this.includes = null;
2
            this.excludes = null;
3
        } else {
3
        } else {
4
            this.includes = new String[includes.length];
4
            this.excludes = new String[excludes.length];
5
            for (int i = 0; i < includes.length; i++) {
5
            for (int i = 0; i < excludes.length; i++) {
6
                this.includes[i] = normalizePattern(includes[i]);
6
                this.excludes[i] = normalizePattern(excludes[i]);
7
            
7
            
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