Property[] properties = t.getProperties();
for (int i = 0; i < properties.length; i++) {
Property p = properties[i];
if (p.isDescriptor() && !p.isPrimaryDescriptor()) {
return p;
}
}
return null;
Property[] properties = t.getProperties();
for (int i = 0; i < properties.length; i++) {
Property p = properties[i];
if (p.isPrimaryDescriptor()) {
return p;
}
}
return null;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/scm/AntStarTeamCheckOut.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/scm/AntStarTeamCheckOut.java
|
Method name: Property getSecondaryDescriptor(Type)
|
|
Method name: Property getPrimaryDescriptor(Type)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 6
|
|
1 | Property[] properties = t.getProperties();↵ | | 1 | Property[] properties = t.getProperties();↵
|
|
2 | for (int i = 0; i < properties.length; i++) {↵ | | 2 | for (int i = 0; i < properties.length; i++) {↵
|
3 | Property p = properties[i];↵ | | 3 | Property p = properties[i];↵
|
|
4 | if (p.isDescriptor() && !p.isPrimaryDescriptor()) {↵ | | 4 | if (p.isPrimaryDescriptor()) {↵
|
5 | return p;↵ | | 5 | return p;↵
|
6 | }↵ | | 6 | }↵
|
7 | }↵ | | 7 | }↵
|
8 | return null; | | 8 | return null;
|
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 declared in the same class |
Number of node comparisons | 1 |