if (lastWasDelim) {// we saw a delimiter last time
strList.add(def);// so add the default
}
lastWasDelim=true;
for (int i = 0; i < BINARY_TYPES.length; i++){
if (ct.startsWith(BINARY_TYPES[i])){
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jorphan/util/JOrphanUtils.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/samplers/SampleResult.java
|
Method name: String[] split(String, String, String)
|
|
Method name: boolean isBinaryType(String)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if (lastWasDelim) {// we saw a delimiter last time↵ | | |
|
2 | strList.add(def);// so add the default↵ | | 1 | for (int i = 0; i < BINARY_TYPES.length; i++){↵
|
| | | 2 | if (ct.startsWith(BINARY_TYPES[i])){↵
|
| | | 3 | return true;↵
|
3 | }↵ | | 4 | ↵
|
4 | ↵ | | 5 | } ↵
|
5 | lastWasDelim=true; | | 6 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 1 |
Number of unmapped statements in the first code fragment | 2 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.4 |
Clone type | Type 3 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
7 | if (lastWasDelim) | | 2 | if (ct.startsWith(BINARY_TYPES[i])) |
| | | 3 | |
8 | | | | |
9 | lastWasDelim = true; | | | |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched return true; |
2 | Unmatched statement lastWasDelim=true; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |