for (int i = 0; i < tags.length; i++) {
if (tags[i].equals(mode)) {
return i;
}
}
for (int i = 0; i < tags.length; i++) {
if (tags[i].equals(text)) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/timers/ConstantThroughputTimerBeanInfo.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/testbeans/gui/WrapperEditor.java
|
Method name: int getCalcModeAsInt(String)
|
|
Method name: boolean isATag(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | for (int i = 0; i < tags.length; i++) {↵ | | 1 | for (int i = 0; i < tags.length; i++) {↵
|
2 | if (tags[i].equals(mode)) {↵ | | 2 | if (tags[i].equals(text)) {↵
|
3 | return i;↵ | | 3 | return true;↵
|
4 | }↵ | | 4 | }↵
|
5 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.3 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | for (int i = 0; i < tags.length; i++) | | 4 | for (int i = 0; i < tags.length; i++) |
2 | if (tags[i].equals(mode)) | | 5 | if (tags[i].equals(text)) |
3 | | | | |
| | | 6 | |
Precondition Violations (4)
Row |
Violation |
1 | Unmatched statement return i; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched return i; |
3 | Unmatched return true; |
4 | Clone fragment #1 returns variables i , while Clone fragment #2 returns variables |