boolean nullIncludes = (includes == null);
includes = nullIncludes ? new String[] {"**"} : includes;
boolean nullExcludes = (excludes == null);
excludes = nullExcludes ? new String[0] : excludes;
boolean nullIncludes = (includes == null);
includes = nullIncludes ? new String[] {"**"} : includes;
boolean nullExcludes = (excludes == null);
excludes = nullExcludes ? new String[0] : excludes;
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: void scan()
|
|
Method name: void slowScan()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | boolean nullIncludes = (includes == null);↵ | | 1 | boolean nullIncludes = (includes == null);↵
|
2 | includes = nullIncludes ? new String[] {"**"} : includes;↵ | | 2 | includes = nullIncludes ? new String[] {"**"} : includes;↵
|
3 | boolean nullExcludes = (excludes == null);↵ | | 3 | boolean nullExcludes = (excludes == null);↵
|
4 | excludes = nullExcludes ? new String[0] : excludes; | | 4 | excludes = nullExcludes ? new String[0] : excludes;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 0 |