while (tok.hasMoreTokens()) {
String f = tok.nextToken();
SourceFile sf = new SourceFile();
sf.setFile(getProject().resolveFile(f.trim()));
addSource(sf);
}
while (e.hasMoreElements()) {
Section section = (Section) e.nextElement();
Enumeration e2 = section.getWarnings();
while (e2.hasMoreElements()) {
warnings.addElement(e2.nextElement());
}
}
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/taskdefs/Manifest.java
|
Method name: void setSourcefiles(String)
|
|
Method name: Enumeration getWarnings()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | while (tok.hasMoreTokens()) {↵ | | 1 | while (e.hasMoreElements()) {↵
|
2 | String f = tok.nextToken();↵ | | 2 | Section section = (Section) e.nextElement();↵
|
3 | SourceFile sf = new SourceFile();↵ | | 3 | Enumeration e2 = section.getWarnings();↵
|
4 | sf.setFile(getProject().resolveFile(f.trim()↵ | | 4 | while (e2.hasMoreElements()) {↵
|
5 | ));↵ | | 5 | warnings.addElement(e2.nextElement());↵
|
6 | addSource(sf);↵ | | 6 | }↵
|
7 | } | | 7 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |