actualReturnTypes = new Type[selectLength]; int j = 0; for ( int i = 0; i < persisters.length; i++ ) { if ( includeInSelect[i] ) { actualReturnTypes[j++] = TypeFactory.manyToOne( persisters[i].getEntityName(), shallowQuery ); } }
setters = new Setter[aliases.length]; for ( int i = 0; i < aliases.length; i++ ) { String alias = aliases[i]; if ( alias != null ) { setters[i] = propertyAccessor.getSetter( resultClass, alias ); } }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/classic/QueryTranslatorImpl.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/transform/AliasToBeanResultTransformer.java
Method name: void renderSQL() Method name: Object transformTuple(Object[], String[])
Number of AST nodes: 5 Number of AST nodes: 5
1
actualReturnTypes = new Type[selectLength];
2
			int j = 0;
1
setters = new Setter[aliases.length];
3
			for ( int i = 0; i < persisters.length; i++ ) {
2
				for ( int i = 0; i < aliases.length; i++ ) {
4
				if ( includeInSelect[i] ) {
3
				
5
					actualReturnTypes[j++] = TypeFactory.manyToOne( persisters[i].getEntityName(), shallowQuery
4
	String alias = aliases[i];
5
					if ( alias != null ) {
6
 );
6
						setters[i] = propertyAccessor.getSetter( resultClass, alias );
7
				}
7
					}
8
			}
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