if ( that.positionalParameterTypes != null ) { return false; }
for ( int i = 0; i < types.length; i++ ) { if ( !areCompatible( types[i], selectTypes[i] ) ) { throw new QueryException( "insertion type [" + types[i] + "] and selection type [" + selectTypes[i] + "] at position " + i + " are not compatible" ); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/cache/QueryKey.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/ast/tree/IntoClause.java
Method name: boolean equals(Object) Method name: void validateTypes(SelectClause)
Number of AST nodes: 2 Number of AST nodes: 3
1
if ( that.positionalParameterTypes != null ) {
2
				return false
1
for ( int i = 0; i < types.length; i++ ) {
2
			if ( !areCompatible( types[i], selectTypes[i] ) ) {
3
				throw new QueryException(
4
				        "insertion type [" + types[i] + "] and selection type [" +
5
				        selectTypes[i] + "] at position " + i + " are not compatible"
3
;
6
				);
4
			}
7
			}
8
		}
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.1
Clones locationClones are in different classes
Number of node comparisons1