for (int i = 0; i < VALID_ACTIONS.length; i++) {
if (action.equals(VALID_ACTIONS[i])) {
valid = true;
break;
}
}
for (int i = 0; i < VALID_ACTIONS.length; i++) {
if (action.equals(VALID_ACTIONS[i])) {
valid = true;
break;
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/j2ee/JonasHotDeploymentTool.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/j2ee/WebLogicHotDeploymentTool.java
|
Method name: boolean isActionValid()
|
|
Method name: boolean isActionValid()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | for (int i = 0; i < VALID_ACTIONS.length; i++) {↵ | | 1 | for (int i = 0; i < VALID_ACTIONS.length; i++) {↵
|
2 | if (action.equals(VALID_ACTIONS[i])) {↵ | | 2 | if (action.equals(VALID_ACTIONS[i])) {↵
|
3 | valid = true;↵ | | 3 | valid = true;↵
|
4 | break;↵ | | 4 | break;↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 6 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 10 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.3 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | for (int i = 0; i < VALID_ACTIONS.length; i++) | | 3 | for (int i = 0; i < VALID_ACTIONS.length; i++) |
4 | if (action.equals(VALID_ACTIONS[i])) | | 4 | if (action.equals(VALID_ACTIONS[i])) |
5 | | | 5 | |
6 | | | 6 | |
Precondition Violations (0)
Row |
Violation |