int length = array.length;
int seed = SEED;
for (int index = 0 ; index < length ; index++) {
seed = hash( seed, array[index] == null ? 0 : array[index].hashCode() );
}
return seed;
int length = array.length;
int seed = SEED;
for (int index = 0 ; index < length ; index++) {
seed = hash( seed, (int) array[index] ) ;
}
return seed;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/ArrayHelper.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/ArrayHelper.java
|
Method name: int hash(Object[])
|
|
Method name: int hash(char[])
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | int length = array.length;↵ | | 1 | int length = array.length;↵
|
2 | int seed = SEED;↵ | | 2 | int seed = SEED;↵
|
3 | for (int index = 0 ; index < length ; index++) {↵ | | 3 | for (int index = 0 ; index < length ; index++) {↵
|
4 | seed = hash( seed, array[index] == null ? 0 : array[index].hashCode() );↵ | | 4 | seed = hash( seed, (int) array[index] ) ;↵
|
5 | }↵ | | 5 | }↵
|
6 | return seed; | | 6 | return seed;
|
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 declared in the same class |
Number of node comparisons | 13 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 5 |
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.7 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | int length = array.length; | | 1 | int length = array.length; |
2 | int seed = SEED; | | 2 | int seed = SEED; |
3 | for (int index = 0; index < length; index++) | | 3 | for (int index = 0; index < length; index++) |
4 | seed = hash(seed, array[index] == null ? 0 : array[index].hashCode()); | | 4 | seed = hash(seed, (int)array[index]); |
5 | return seed; | | 5 | return seed; |
Precondition Violations (1)
Row |
Violation |
1 | Type java.lang.Object[] of variable array does not match with type char[] of variable array |