while (tok.hasMoreTokens()) {
String f = tok.nextToken();
SourceFile sf = new SourceFile();
sf.setFile(getProject().resolveFile(f.trim()));
addSource(sf);
}
for (Enumeration e = getFilters().elements(); e.hasMoreElements();) {
Filter filter = (Filter) e.nextElement();
filterHash.put(filter.getToken(), filter.getValue());
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Javadoc.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/FilterSet.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | while (tok.hasMoreTokens()) {↵ | | 1 | for (Enumeration e = getFilters().elements(); e.hasMoreElements();) {↵
|
2 | String f = tok.nextToken();↵ | | 2 | Filter filter = (Filter) e.nextElement();↵
|
3 | SourceFile sf = new SourceFile();↵ | | 3 | ↵
|
4 | sf.setFile(getProject().resolveFile(f.trim()));↵ | | |
|
5 | addSource(sf);↵ | | |
|
| | | 4 | filterHash.put(filter.getToken(), filter.getValue());↵
|
6 | } | | 5 | }
|
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 | |
Number of node comparisons | 0 |