if (e.hasMoreElements()) {
while (e.hasMoreElements()) {
buf.append(e.nextElement().toString());
if (e.hasMoreElements()) {
buf.append(", ");
if (e.hasMoreElements()) {
while (e.hasMoreElements()) {
buf.append(e.nextElement().toString());
if (e.hasMoreElements()) {
buf.append(", ");
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/AbstractSelectorContainer.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/selectors/BaseSelectorContainer.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (e.hasMoreElements()) {↵ | | 1 | if (e.hasMoreElements()) {↵
|
2 | while (e.hasMoreElements()) {↵ | | 2 | while (e.hasMoreElements()) {↵
|
3 | buf.append(e.nextElement().toString());↵ | | 3 | buf.append(e.nextElement().toString());↵
|
4 | if (e.hasMoreElements()) {↵ | | 4 | if (e.hasMoreElements()) {↵
|
5 | buf.append(", ");↵ | | 5 | buf.append(", ");↵
|
6 | | | 6 |
|
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 |