public synchronized void setIncludes(String[] includes) { 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]);
public synchronized void setExcludes(String[] excludes) { 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
public synchronized void setIncludes(String[] includes) {
1
public synchronized void setExcludes(String[] excludes) {
2
        if (includes == null) {
2
        if (excludes == null) {
3
            this.includes = null;
3
            this.excludes = null;
4
        } else {
4
        } else {
5
            this.includes = new String[includes.length];
5
            this.excludes = new String[excludes.length];
6
            for (int i = 0; i < includes.length; i++) {
6
            for (int i = 0; i < excludes.length; i++) {
7
                this.includes[i] = normalizePattern(includes[i]);
7
                this.excludes[i] = normalizePattern(excludes[i]);
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.0
Clones location
Number of node comparisons0