for ( int i = 0; i < propertyTypes.length; i++ ) { boolean[] propertyNullness = propertyTypes[i].toColumnNullness( values[i], mapping ); System.arraycopy( propertyNullness, 0, result, loc, propertyNullness.length ); loc += propertyNullness.length; }
for ( int i=0; i<propertyTypes.length; i++ ) { boolean[] propertyNullness = propertyTypes[i].toColumnNullness( values[i], mapping ); System.arraycopy(propertyNullness, 0, result, loc, propertyNullness.length); loc += propertyNullness.length; }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/ComponentType.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/type/CompositeCustomType.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for ( int i = 0; i < propertyTypes.length; i++ ) {
1
for ( int i=0; i<propertyTypes.length; i++ ) {
2
			boolean[] propertyNullness = propertyTypes[i].toColumnNullness( values[i], mapping );
2
			boolean[] propertyNullness = propertyTypes[i].toColumnNullness( values[i], mapping );
3
			System.arraycopy( propertyNullness, 0, result, loc, propertyNullness.length );
3
			System.arraycopy(propertyNullness, 0, result, loc, propertyNullness.length);
4
			loc += propertyNullness.length;
4
			loc += propertyNullness.length;
5
		}
5
		}
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0