String[] rtn = new String[count];
for ( int i = 0; i < count; i++ ) {
rtn[i] = "?";
}
return rtn;
String[] rtn = new String[count];
for ( int i = 0; i < count; i++ ) {
rtn[i] = "?";
}
return rtn;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/BinaryLogicOperatorNode.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/AbstractNullnessCheckNode.java
|
Method name: String[] extractMutationTexts(Node, int)
|
|
Method name: String[] extractMutationTexts(Node, int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | String[] rtn = new String[count];↵ | | 1 | String[] rtn = new String[count];↵
|
2 | for ( int i = 0; i < count; i++ ) {↵ | | 2 | for ( int i = 0; i < count; i++ ) {↵
|
3 | rtn[i] = "?";↵ | | 3 | rtn[i] = "?";↵
|
4 | }↵ | | 4 | }↵
|
5 | return rtn; | | 5 | return rtn;
|
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.2 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 9 |
-
{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.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | String[] rtn = new String[count]; | | 2 | String[] rtn = new String[count]; |
3 | for (int i = 0; i < count; i++) | | 3 | for (int i = 0; i < count; i++) |
4 | | | 4 | |
5 | return rtn; | | 5 | return rtn; |
Precondition Violations (0)
Row |
Violation |