for ( int i = 0; i < subvalues.length; i++ ) { Object replacement = nullifyTransientReferences( subvalues[i], subtypes[i] ); if ( replacement != subvalues[i] ) { substitute = true; subvalues[i] = replacement; } }
int span = types[i].getColumnSpan( f ); columnNames[i] = new String[span]; for ( int j = 0; j < span; j++ ) { columnNames[i][j] = NameGenerator.scalarName( i, j ); }
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/engine/ForeignKeys.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/hql/NameGenerator.java
Method name: Object nullifyTransientReferences(Object, Type) Method name: String[][] generateColumnNames(Type[], SessionFactoryImplementor)
Number of AST nodes: 5 Number of AST nodes: 4
1
for ( int i = 0; i < subvalues.length; i++ ) {
2
					Object replacement = nullifyTransientReferences( subvalues[i], subtypes[i] );
3
					if ( replacement != subvalues[i]
1
int span = types[i].getColumnSpan( f );
2
			columnNames[i] = new String[span];
4
 ) {
3
			for ( int j = 0; j < span; j++ ) {
5
						substitute = true;
4
				
6
						subvalues[i] = replacement;
7
					}
8
	
5
columnNames[i][j] = NameGenerator.scalarName( i, j );
9
			}
6
			}
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 locationClones are in different classes
Number of node comparisons1