if ( !EqualsHelper.equals( x[0], y[0] ) ) {
return new int[] { 0 };
}
else {
return null;
}
if ( !EqualsHelper.equals( x[0], y[0] ) ) {
return new int[] { 0 };
}
else {
return null;
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/CustomPersister.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/CustomPersister.java
|
Method name: int[] findDirty(Object[], Object[], Object, SessionImplementor)
|
|
Method name: int[] findModified(Object[], Object[], Object, SessionImplementor)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if ( !EqualsHelper.equals( x[0], y[0] ) ) {↵ | | 1 | if ( !EqualsHelper.equals( x[0], y[0] ) ) {↵
|
2 | return new int[] { 0 };↵ | | 2 | return new int[] { 0 };↵
|
3 | }↵ | | 3 | }↵
|
4 | else {↵ | | 4 | else {↵
|
5 | return null;↵ | | 5 | return null;↵
|
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 declared in the same class |
Number of node comparisons | 9 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 3 |
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) | 1.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | if (!EqualsHelper.equals(x[0], y[0])) | | 1 | if (!EqualsHelper.equals(x[0], y[0])) |
2 | | | 2 | |
| | | | |
3 | | | 3 | |
Precondition Violations (0)
Row |
Violation |