while ( it.hasNext() ) {
if ( !map.containsKey( it.next() ) ) {
return false;
}
}
for ( int i = 0; i < propertySpan; i++ ) {
if ( !propertyTypes[i].isEqual( xvalues[i], yvalues[i], entityMode ) ) {
return false;
}
}
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/IdentitySet.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/ComponentType.java
|
Method name: boolean containsAll(Collection)
|
|
Method name: boolean isEqual(Object, Object, EntityMode)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | while ( it.hasNext() ) {↵ | | |
|
2 | if ( !map.containsKey( it.next()↵ | | 1 | for ( int i = 0; i < propertySpan; i++ ) {↵
|
3 | ) ) {↵ | | 2 | if ( !propertyTypes[i].isEqual( xvalues[i], yvalues[i], entityMode ) ) {↵
|
4 | return false;↵ | | 3 | return false;↵
|
5 | }↵ | | 4 | }↵
|
6 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
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 |
Number of node comparisons | 1 |